STXXL
1.4.1
|
#include <vector>
#include <algorithm>
#include <stxxl/bits/deprecated.h>
#include <stxxl/bits/mng/block_manager.h>
#include <stxxl/bits/mng/typed_block.h>
#include <stxxl/bits/mng/block_alloc.h>
#include <stxxl/bits/mng/read_write_pool.h>
#include <stxxl/bits/mng/prefetch_pool.h>
#include <stxxl/bits/mng/write_pool.h>
#include <stxxl/bits/common/tmeta.h>
#include <stxxl/bits/algo/sort_base.h>
#include <stxxl/bits/parallel.h>
#include <stxxl/bits/common/is_sorted.h>
#include <stxxl/bits/common/error_handling.h>
Go to the source code of this file.
Classes | |
class | stxxl::priority_queue_local::internal_bounded_stack< ValueType, MaxSize > |
Similar to std::stack, with the following differences: More... | |
class | stxxl::priority_queue_local::internal_priority_queue< ValueType, ContainerType, CompareType > |
Similar to std::priority_queue, with the following differences: More... | |
class | stxxl::priority_queue_local::invert_order< Predicate, FirstType, SecondType > |
Inverts the order of a comparison functor by swapping its arguments. More... | |
Namespaces | |
stxxl | |
STXXL library namespace | |
stxxl::priority_queue_local | |
Macros | |
#define | STXXL_PQ_EXTERNAL_LOSER_TREE 1 |
#define | STXXL_PQ_INTERNAL_LOSER_TREE 1 |
#define | STXXL_VERBOSE_PQ(msg) STXXL_VERBOSE2_THIS("priority_queue::" << msg) |
#define STXXL_PQ_EXTERNAL_LOSER_TREE 1 |
Definition at line 62 of file pq_helpers.h.
#define STXXL_PQ_INTERNAL_LOSER_TREE 1 |
Definition at line 68 of file pq_helpers.h.
#define STXXL_VERBOSE_PQ | ( | msg | ) | STXXL_VERBOSE2_THIS("priority_queue::" << msg) |
Definition at line 71 of file pq_helpers.h.
Referenced by stxxl::priority_queue< ConfigType >::empty_insert_heap(), stxxl::priority_queue< ConfigType >::make_space_available(), stxxl::priority_queue< ConfigType >::priority_queue(), stxxl::priority_queue< ConfigType >::refill_delete_buffer(), stxxl::priority_queue< ConfigType >::refill_group_buffer(), and stxxl::priority_queue< ConfigType >::~priority_queue().