#include <binary_search.h>
|
template<typename t_container , typename t_param > |
static bool | run (const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result) |
|
template<typename t_container , typename t_param > |
static bool | runGroup (const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result, t_size &p_resultCount) |
|
template<typename t_container , typename t_param > |
static bool | runGroupBegin (const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result) |
|
template<typename t_container , typename t_param > |
static bool | runGroupEnd (const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result) |
|
template<typename t_comparator = comparator_default>
class pfc::binarySearch< t_comparator >
Definition at line 5 of file binary_search.h.
template<typename t_comparator = comparator_default>
template<typename t_container , typename t_param >
Definition at line 9 of file binary_search.h.
10 t_size max = p_base + p_count;
13 t_size ptr = min + ( (max-min) >> 1);
15 if (state > 0) min = ptr + 1;
16 else if (state < 0) max = ptr;
int compare(t1 const &p1, t2 const &p2)
template<typename t_comparator = comparator_default>
template<typename t_container , typename t_param >
Definition at line 64 of file binary_search.h.
65 if (!
runGroupBegin(p_container,p_base,p_count,p_param,p_result)) {
70 if (!
runGroupEnd(p_container,p_result,p_count - p_result,p_param,groupEnd)) {
76 PFC_ASSERT(groupEnd > p_result);
77 p_resultCount = groupEnd - p_result;
static bool runGroupBegin(const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result)
static bool runGroupEnd(const t_container &p_container, t_size p_base, t_size p_count, const t_param &p_param, t_size &p_result)
template<typename t_comparator = comparator_default>
template<typename t_container , typename t_param >
Definition at line 28 of file binary_search.h.
29 t_size max = p_base + p_count;
33 t_size ptr = min + ( (max-min) >> 1);
35 if (state > 0) min = ptr + 1;
36 else if (state < 0) max = ptr;
38 found =
true; max = ptr;
int compare(t1 const &p1, t2 const &p2)
template<typename t_comparator = comparator_default>
template<typename t_container , typename t_param >
Definition at line 46 of file binary_search.h.
47 t_size max = p_base + p_count;
51 t_size ptr = min + ( (max-min) >> 1);
53 if (state > 0) min = ptr + 1;
54 else if (state < 0) max = ptr;
56 found =
true; min = ptr + 1;
int compare(t1 const &p1, t2 const &p2)
The documentation for this class was generated from the following file: