parallel_priority_queue.h File Reference

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdlib>
#include <ctime>
#include <list>
#include <utility>
#include <numeric>
#include <vector>
#include <stxxl/bits/common/winner_tree.h>
#include <stxxl/bits/common/custom_stats.h>
#include <stxxl/bits/common/mutex.h>
#include <stxxl/bits/common/timer.h>
#include <stxxl/bits/common/is_heap.h>
#include <stxxl/bits/common/swap_vector.h>
#include <stxxl/bits/common/rand.h>
#include <stxxl/bits/config.h>
#include <stxxl/bits/io/request_operations.h>
#include <stxxl/bits/mng/block_alloc.h>
#include <stxxl/bits/mng/buf_ostream.h>
#include <stxxl/bits/mng/prefetch_pool.h>
#include <stxxl/bits/mng/block_manager.h>
#include <stxxl/bits/mng/read_write_pool.h>
#include <stxxl/bits/mng/typed_block.h>
#include <stxxl/bits/namespace.h>
#include <stxxl/bits/noncopyable.h>
#include <stxxl/bits/parallel.h>
#include <stxxl/bits/verbose.h>
#include <stxxl/types>

Go to the source code of this file.

Classes
class	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >
	Parallelized External Memory Priority Queue. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::empty_external_array_eraser
	Unary operator which returns true if the external array has run empty. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::empty_internal_array_eraser
	Unary operator which returns true if the internal array has run empty. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::external_min_comparator
	Compares the largest accessible value of two external arrays. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::hint_comparator
	Compares the largest value of the block hinted the latest of two external arrays. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::inv_compare_type
	Inverse comparison functor. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::ProcessorData
	A struct containing the local insertion heap and other information local to a processor. More...
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::s_min_tree_comparator
struct	stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::stats_type
	Struct of all statistical counters and timers. Turn on/off statistics using the stats_counter and stats_timer typedefs. More...
class	stxxl::ppq_local::external_array< ValueType, BlockSize, AllocStrategy >
	External array stores a sorted sequence of values on the hard disk and allows access to the first block (containing the smallest values). More...
class	stxxl::ppq_local::external_array_writer< ExternalArrayType >
class	stxxl::ppq_local::external_array_writer< ExternalArrayType >
class	stxxl::ppq_local::external_array_writer< ExternalArrayType >::iterator
class	stxxl::ppq_local::internal_array< ValueType >
	Internal arrays store a sorted sequence of values in RAM, which will be merged together into the deletion buffer when it needs to be refilled. More...
class	stxxl::ppq_local::minima_tree< ParentType >
	The minima_tree contains minima from all sources inside the PPQ. More...
struct	stxxl::ppq_local::minima_tree< ParentType >::head_comp
	WinnerTree-Comparator for the head winner tree. It accesses all relevant data structures from the priority queue. More...
struct	stxxl::ppq_local::minima_tree< ParentType >::heaps_comp
	Comparator for the insertion heaps winner tree. More...
struct	stxxl::ppq_local::minima_tree< ParentType >::ia_comp
	Comparator for the internal arrays winner tree. More...
class	stxxl::ppq_local::ppq_iterator< ValueType >
	A random-access iterator class for block oriented data. More...

Namespaces
	stxxl
	STXXL library namespace
	stxxl::ppq_local

Macros
#define	STXXL_MOVE(T)   T

Macro Definition Documentation

#define STXXL_MOVE

(

T

)

T

Definition at line 34 of file parallel_priority_queue.h.

Referenced by stxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::push_heap().