Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 ! More...
#include <pq_losertree.h>
Public Types | |
typedef ValTp_ | value_type |
typedef Cmp_ | comparator_type |
typedef value_type | Element |
Public Member Functions | |
bool | is_sentinel (const Element &a) |
bool | not_sentinel (const Element &a) |
void | init () |
void | swap (loser_tree &obj) |
void | multi_merge (Element *begin, Element *end) |
void | multi_merge (Element *, unsigned_type length) |
unsigned_type | mem_cons () const |
bool | is_space_available () const |
void | insert_segment (Element *target, unsigned_type length) |
unsigned_type | size () |
Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 !
!
KNKMAX | maximum arity of loser tree, has to be a power of two |