arity enum value | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
arrays | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | protected |
arrays_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
cmp | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
cmp | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
compact_tree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
compactTree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
comparator_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
compare_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
current | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
current_end | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
deallocate_segment(unsigned_type slot) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
double_k() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
doubleK() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
Element typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
entry | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | protected |
free_player(unsigned_type slot) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
free_slots | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
free_slots | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | protected |
init() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
init_winner(unsigned_type root) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
initialize() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
initWinner(unsigned_type root) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
insert_segment(Element *target, unsigned_type length) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
is_segment_empty(unsigned_type slot) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inlineprivate |
is_sentinel(const Element &a) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
is_sentinel(const value_type &a) const | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
is_space_available() const | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
is_space_available() const | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
k | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
logK | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
loser_tree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
loser_tree(const compare_type &c, arrays_type &a) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
max_arity enum value | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
maybe_compact() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
mem_cons() const | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
mem_cons_ | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
multi_merge(Element *begin, Element *end) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
multi_merge(Element *, unsigned_type length) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
multi_merge(OutputIterator begin, OutputIterator end) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
multi_merge_f(OutputIterator begin, OutputIterator end) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
multi_merge_k(Element *target, unsigned_type length) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
multi_merge_k(OutputIterator begin, OutputIterator end) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
new_player() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
noncopyable() | stxxl::noncopyable | inlineprivate |
not_sentinel(const Element &a) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
rebuild_loser_tree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
rebuildLoserTree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
segment | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
segment_size | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
sentinel | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
sequence_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
size() const | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
size_ | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
swap(loser_tree &obj) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
swap(loser_tree &obj) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
update_on_insert(unsigned_type node, const Element &newKey, unsigned_type newIndex, Element *winnerKey, unsigned_type *winnerIndex, unsigned_type *mask) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | private |
update_on_insert(unsigned_type node, const value_type &newKey, unsigned_type newIndex, value_type *winner_key, unsigned_type *winner_index, unsigned_type *mask) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
update_on_insert(unsigned_type node, const value_type &newKey, unsigned_type newIndex) | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | inline |
value_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
value_type typedef | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |
~loser_tree() | stxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity > | |