External merger, based on the loser tree data structure. ! More...
#include <priority_queue.h>
Inherits noncopyable.
Collaboration diagram for priority_queue_local::ext_merger< BlockType_, Cmp_, Arity_, AllocStr_ >:
Protected Member Functions | |
| void | insert_segment (std::list< bid_type > *bidlist, block_type *first_block, unsigned_type first_size, unsigned_type slot) |
Detailed Description
template<class BlockType_, class Cmp_, unsigned Arity_, class AllocStr_ = STXXL_DEFAULT_ALLOC_STRATEGY>
class priority_queue_local::ext_merger< BlockType_, Cmp_, Arity_, AllocStr_ >
External merger, based on the loser tree data structure. !
!
- Parameters:
-
Arity_ maximum arity of merger, does not need to be a power of two
Member Function Documentation
template<class BlockType_ , class Cmp_ , unsigned Arity_, class AllocStr_ = STXXL_DEFAULT_ALLOC_STRATEGY>
| 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] |
- Parameters:
-
first_size number of elements in the first block
The documentation for this class was generated from the following file:
