STXXL
1.4-dev
|
#include <stxxl/bits/containers/pq_helpers.h>
Go to the source code of this file.
Classes | |
class | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > |
Loser tree from Knuth, "Sorting and Searching", Section 5.4.1. More... | |
struct | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity >::Entry |
type of nodes in the loser tree More... | |
Namespaces | |
stxxl | |
STXXL library namespace | |
stxxl::priority_queue_local | |
Macros | |
#define | Merge3Case(a, b, c) |
#define | Merge4Case(a, b, c, d) |
#define | StartMerge4(a, b, c, d) |
#define | TreeStep(L) |
Functions | |
template<class InputIterator , class OutputIterator , class CompareType > | |
void | stxxl::priority_queue_local::merge2_iterator (InputIterator &source0, InputIterator &source1, OutputIterator target, OutputIterator end, CompareType &cmp) |
template<class InputIterator , class OutputIterator , class CompareType > | |
void | stxxl::priority_queue_local::merge3_iterator (InputIterator &source0, InputIterator &source1, InputIterator &source2, OutputIterator target, OutputIterator end, CompareType &cmp) |
template<class InputIterator , class OutputIterator , class CompareType > | |
void | stxxl::priority_queue_local::merge4_iterator (InputIterator &source0, InputIterator &source1, InputIterator &source2, InputIterator &source3, OutputIterator target, OutputIterator end, CompareType &cmp) |
#define Merge3Case | ( | a, | |
b, | |||
c | |||
) |
Referenced by stxxl::priority_queue_local::merge3_iterator().
#define Merge4Case | ( | a, | |
b, | |||
c, | |||
d | |||
) |
Referenced by stxxl::priority_queue_local::merge4_iterator().
#define StartMerge4 | ( | a, | |
b, | |||
c, | |||
d | |||
) |
Referenced by stxxl::priority_queue_local::merge4_iterator().
#define TreeStep | ( | L | ) |
Referenced by stxxl::priority_queue_local::loser_tree< self_type, CompareType, MaxArity >::multi_merge_f().