Stxxl  1.3.1
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Cadd_filler< BaseType_, FillSize_ >Contains per block filler for stxxl::typed_block , not intended for direct use
 Cadd_filler< Tp_, RawSize_-sizeof(Tp_)>
 Cbasic_allocation_strategyExample disk allocation scheme functor
 Cstream::basic_runs_creator< Input_, Cmp_, BlockSize_, AllocStr_ >Forms sorted runs of data from a stream
 Cstream::basic_runs_merger< RunsType_, Cmp_, AllocStr_ >Merges sorted runs
 Cstream::basic_runs_merger< sorted_runs_type, Cmp_, AllocStr_ >
 CBID< SIZE >Block identifier class
 CBID< 0 >Specialization of block identifier class (BID) for variable size block size
 CBID< BLK_SIZE >
 CBID< raw_size >
 Cblock_managerBlock manager class
 Cblock_prefetcher< block_type, bid_iterator_type >Encapsulates asynchronous prefetching engine
 Cbuf_istream< BlkTp_, BIDIteratorTp_ >Buffered input stream
 Cbuf_ostream< BlkTp_, BIDIteratorTp_ >Buffered output stream
 Cbuffered_writer< block_type >Encapsulates asynchronous buffered block writing engine
 Cbuffered_writer< typed_block >
 Cstream::choose< Input_, 1 >Creates stream from a tuple stream taking the first component of each tuple
 Cstream::choose< Input_, 2 >Creates stream from a tuple stream taking the second component of each tuple
 Cstream::choose< Input_, 3 >Creates stream from a tuple stream taking the third component of each tuple
 Cstream::choose< Input_, 4 >Creates stream from a tuple stream taking the fourth component of each tuple
 Cstream::choose< Input_, 5 >Creates stream from a tuple stream taking the fifth component of each tuple
 Cstream::choose< Input_, 6 >Creates stream from a tuple stream taking the sixth component of each tuple
 Ccompletion_handlerCompletion handler class (Loki-style)
 Cstream::compute_sorted_runs_type< ValueType_, BlockSize_ >Computes sorted runs type from value type and block size
 CconfigAccess point to disks properties
 Cconst_vector_iterator< Tp_, AllocStr_, SzTp_, DiffTp_, BlkSize_, PgTp_, PgSz_ >Const external vector iterator, model of ext_random_access_iterator concept
 Cdefault_completion_handlerDefault completion handler class
 Cdeque< T, VectorType >A deque container
 Cdisk_queuesEncapsulates disk queues
 Celement_block< T, Size_ >Contains data elements for stxxl::typed_block , not intended for direct use
 Celement_block< T_, Size_ >
 Cpriority_queue_local::ext_merger< BlockType_, Cmp_, Arity_, AllocStr_ >External merger, based on the loser tree data structure. !
 CfileDefines interface of file
 Cstream::from_sorted_sequences< ValueType_ >Input strategy for runs_creator class
 Cstream::generator2stream< Generator_, T >A model of stream that outputs data from an adaptable generator functor For convenience use streamify function instead of direct instantiation of generator2stream
 Cgrow_shrink_stack< Config_ >Efficient implementation that uses prefetching and overlapping using internal buffers
 Cgrow_shrink_stack2< Config_ >Efficient implementation that uses prefetching and overlapping using (shared) buffers pools
 CIF< Flag, Type1, Type2 >IF template metaprogramming statement
 CIF_N< Flag, Num1, Num2 >
 Cpriority_queue_local::internal_bounded_stack< Tp_, max_size_ >Similar to std::stack, with the following differences:
 Cpriority_queue_local::internal_bounded_stack< unsigned_type, arity >
 Cpriority_queue_local::internal_bounded_stack< unsigned_type, KNKMAX >
 Cpriority_queue_local::internal_priority_queue< _Tp, _Sequence, _Compare >Similar to std::priority_queue, with the following differences:
 Cpriority_queue_local::internal_priority_queue< value_type, std::vector< value_type >, comparator_type >
 Cpriority_queue_local::invert_order< Predicate, first_argument_type, second_argument_type >Inverts the order of a comparison functor by swapping its arguments
 Cstream::iterator2stream< InputIterator_ >A model of stream that retrieves the data from an input iterator For convenience use streamify function instead of direct instantiation of iterator2stream
 CLOG2_floor< Input >
 Cpriority_queue_local::loser_tree< ValTp_, Cmp_, KNKMAX >Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 !
 Cpriority_queue_local::loser_tree< value_type, comparator_type, IntKMAX >
 Clru_pager< npages_ >Pager with LRU replacement strategy
 Cstream::make_tuple< Input1_, Input2_, Input3_, Input4_, Input5_, Input6_ >Creates stream of 6-tuples from 6 input streams
 Cstream::make_tuple< Input1_, Input2_, Input3_, Input4_, Input5_, Stopper >Creates stream of 5-tuples from 5 input streams
 Cstream::make_tuple< Input1_, Input2_, Input3_, Input4_, Stopper, Stopper >Creates stream of 4-tuples from 4 input streams
 Cstream::make_tuple< Input1_, Input2_, Input3_, Stopper, Stopper, Stopper >Creates stream of 3-tuples from 3 input streams
 Cstream::make_tuple< Input1_, Input2_, Stopper, Stopper, Stopper, Stopper >Creates stream of 2-tuples (pairs) from 2 input streams
 Cmalloc_statsAccess to some useful malloc statistics
 Cmap< KeyType, DataType, CompareType, RawNodeSize, RawLeafSize, PDAllocStrategy >External associative container
 Cmigrating_stack< CritSize, ExternalStack, InternalStack >A stack that migrates from internal memory to external when its size exceeds a certain threshold
 Cnormal_stack< Config_ >External stack container
 Coffset_allocator< BaseAllocator_ >Allocator functor adaptor
 Cprefetch_pool< BlockType >Implements dynamically resizable prefetching pool
 Cpriority_queue< Config_ >External priority queue data structure
 CPRIORITY_QUEUE_GENERATOR< Tp_, Cmp_, IntM_, MaxS_, Tune_ >Priority queue type generator
 Cqueue< ValTp, BlkSz, AllocStr, SzTp >External FIFO queue container
 Crandom_number< UniformRGen_ >Uniform [0, N) pseudo-random generator
 Crandom_number32Fast uniform [0, 2^32) pseudo-random generator with period 2^32, random bits: 32
 Crandom_number32_rFast uniform [0, 2^32) pseudo-random generator with period 2^32, random bits: 32. Reentrant variant of random_number32 that keeps it's private state
 Crandom_number64Slow and precise uniform [0, 2^64) pseudo-random generator
 Crandom_number< random_uniform_fast >
 Crandom_pager< npages_ >Pager with random replacement strategy
 Crandom_uniform_fastFast uniform [0.0, 1.0) pseudo-random generator
 Crandom_uniform_slowSlow and precise uniform [0.0, 1.0) pseudo-random generator period: at least 2^48, random bits: at least 31
 Cread_write_pool< BlockType >Implements dynamically resizable buffered writing and prefetched reading pool
 Crequest_interfaceFunctional interface of a request
 Crequest_ptrImplemented as reference counting smart pointer
 Cstream::runs_creator< from_sorted_sequences< ValueType_ >, Cmp_, BlockSize_, AllocStr_ >Forms sorted runs of data taking elements in sorted order (element by element)
 Cstream::runs_creator< use_push< ValueType_ >, Cmp_, BlockSize_, AllocStr_ >Forms sorted runs of elements passed in push() method
 Cscoped_mutex_lockAquire a lock that's valid until the end of scope
 Csingle_disk'single disk' disk allocation scheme functor
 Cstream::sort< Input_, Cmp_, BlockSize_, AllocStr_, runs_creator_type >Produces sorted stream from input stream
 Cstream::sorted_runs< TriggerEntryType >All sorted runs of a sort operation
 Cstream::sorted_runs< trigger_entry_type >
 CSTACK_GENERATOR< ValTp, Externality, Behaviour, BlocksPerPage, BlkSz, IntStackTp, MigrCritSize, AllocStr, SzTp >Stack type generator
 CstatsCollects various I/O statistics
 Cstream::streamify_traits< InputIterator_ >Traits class of streamify function
 CstripingStriping disk allocation scheme functor
 Cstream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Input5_, Input6_ >Processes (up to) 6 input streams using given operation functor
 Cstream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Input5_, Stopper >Processes 5 input streams using given operation functor
 Cstream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Stopper, Stopper >Processes 4 input streams using given operation functor
 Cstream::transform< Operation_, Input1_, Input2_, Input3_, Stopper, Stopper, Stopper >Processes 3 input streams using given operation functor
 Cstream::transform< Operation_, Input1_, Input2_, Stopper, Stopper, Stopper, Stopper >Processes 2 input streams using given operation functor
 Cstream::transform< Operation_, Input1_, Stopper, Stopper, Stopper, Stopper, Stopper >Processes an input stream using given operation functor
 Ctuple< T1, T2, T3, T4, T5, T6 >K-Tuple data type
 Ctuple< T1, Plug, Plug, Plug, Plug >Partial specialization for 1- tuple
 Ctuple< T1, T2, Plug, Plug, Plug, Plug >Partial specialization for 2- tuple (equivalent to std::pair)
 Ctuple< T1, T2, T3, Plug, Plug, Plug >Partial specialization for 3- tuple (triple)
 Ctuple< T1, T2, T3, T4, Plug, Plug >Partial specialization for 4- tuple
 Ctuple< T1, T2, T3, T4, T5, Plug >Partial specialization for 5- tuple
 Cstream::unique< Input, BinaryPredicate >Equivalent to std::unique algorithms
 Cstream::unique< Input, dummy_cmp_unique_ >Equivalent to std::unique algorithms
 Cstream::use_push< ValueType_ >Input strategy for runs_creator class
 Cvector< Tp_, PgSz_, PgTp_, BlkSize_, AllocStr_, SzTp_ >External vector container
 CVECTOR_GENERATOR< Tp_, PgSz_, Pages_, BlkSize_, AllocStr_, Pager_ >External vector type generator
 Cvector_iterator< Tp_, AllocStr_, SzTp_, DiffTp_, BlkSize_, PgTp_, PgSz_ >External vector iterator, model of ext_random_access_iterator concept
 Cstream::vector_iterator2stream< InputIterator_ >A model of stream that retrieves data from an external stxxl::vector iterator. It is more efficient than generic iterator2stream thanks to use of overlapping For convenience use streamify function instead of direct instantiation of vector_iterator2stream
 Cstream::vector_iterator2stream_sr< InputIterator_ >Version of iterator2stream. Switches between vector_iterator2stream and iterator2stream
 Cwrite_pool< BlockType >Implements dynamically resizable buffered writing pool