External merger, based on the loser tree data structure. ! More...
#include <priority_queue.h>
Inherits noncopyable.
Protected Member Functions | |
void | insert_segment (std::list< bid_type > *bidlist, block_type *first_block, unsigned_type first_size, unsigned_type slot) |
External merger, based on the loser tree data structure. !
!
Arity_ | maximum arity of merger, does not need to be a power of two |
void priority_queue_local::ext_merger< BlockType_, Cmp_, Arity_, AllocStr_ >::insert_segment | ( | std::list< bid_type > * | bidlist, | |
block_type * | first_block, | |||
unsigned_type | first_size, | |||
unsigned_type | slot | |||
) | [inline, protected] |
first_size | number of elements in the first block |