STXXL  1.4-dev
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
oCstxxl::addressable_fifo_queue< swappable_block_identifier_type >
oCstxxl::addressable_priority_queue< swappable_block_identifier_type, stxxl::block_scheduler_algorithm_offline_lfd::priority >
oCstxxl::BID< block_size >
oCstxxl::BID< BlockSize >
oCstxxl::BID< raw_size >
oCstxxl::btree::btree_iterator_base< self_type >
oCstxxl::choose_int_types< my_pointer_size >
oCstxxl::compat_hash_map< bid_type, busy_entry, bid_hash >
oCstxxl::compat_hash_map< bid_type, unsigned_type, bid_hash >
oCstxxl::compat_hash_multimap< internal_size_type, iterator_base *, hasher >
oCstxxl::compat_unique_ptr< buf_istream_type >
oCstxxl::compat_unique_ptr< stxxl::completion_handler_impl >
oCstxxl::compat_unique_ptr< stxxl::stxxl::io_error >
oCstxxl::counting_ptr< request >
oCstxxl::counting_ptr< sorted_runs_data_type >
oCstxxl::counting_ptr< swappable_block_matrix_type >
oCstxxl::dummy_custom_stats_counter< uint64 >
oCstxxl::mng_local::filler_struct< FillSize >
oCstxxl::priority_queue_local::internal_bounded_stack< unsigned_type, arity >
oCstxxl::priority_queue_local::internal_bounded_stack< unsigned_type, MaxArity >
oCstxxl::priority_queue_local::internal_priority_queue< value_type, std::vector< value_type >, comparator_type >
oCstxxl::ppq_local::minima_tree< parallel_priority_queue< value_type, compare_type, alloc_strategy, block_size, DefaultMemSize, MaxItems > >
oCstxxl::random_number< random_uniform_fast >
oCstxxl::random_number< stxxl::random_uniform_fast >
oCbinary_function
oCstd::exceptionSTL class
oCiterator
oCstd::numeric_limits< stxxl::uint_pair< HighType > >Template class providing some numeric_limits fields for uint_pair types
oCpair
oCstd::vector< T >STL class
oCstxxl::addressable_fifo_queue< KeyType >An internal fifo queue that allows removing elements addressed with (a copy of) themselves
oCstxxl::addressable_priority_queue< KeyType, PriorityType, Cmp >An internal priority queue that allows removing elements addressed with (a copy of) themselves
oCstxxl::addressable_priority_queue< KeyType, PriorityType, Cmp >::cmp
oCstxxl::aligned_alloc_settings< MustBeInt >
oCstxxl::atomic_counted_objectProvides reference counting abilities for use with counting_ptr with mutex locking
oCstxxl::basic_allocation_strategyExample disk allocation scheme functor
oCstxxl::BID< Size >Block identifier class
oCstxxl::BID< 0 >Specialization of block identifier class (BID) for variable size block size
oCstxxl::binary_bufferBinary_buffer represents a dynamically growable area of memory, which can be modified by appending integral data types via put() and other basic operations
oCstxxl::binary_buffer_refBinary_buffer_ref represents a memory area as pointer and valid length
oCstxxl::block_scheduler< SwappableBlockType >::prediction_sequence_element
oCstxxl::block_scheduler_algorithm_offline_lfd< SwappableBlockType >::priority
oCstxxl::block_scheduler_algorithm_offline_lru_prefetching< SwappableBlockType >::read_after_write
oCstxxl::block_scheduler_algorithm_offline_lru_prefetching< SwappableBlockType >::scheduled_block_meta
oCstxxl::block_scheduler_algorithm_offline_lru_prefetching< SwappableBlockType >::write_read_request
oCstxxl::blocked_index< modulo >
oCstxxl::btree::btree_iterator_base< BTreeType >
oCstxxl::btree::iterator_map< BTreeType >::bid_comp
oCstxxl::btree::iterator_map< BTreeType >::Key
oCstxxl::btree::iterator_map< BTreeType >::KeyCmp
oCstxxl::btree::node_cache< NodeType, BTreeType >::bid_hash
oCstxxl::btree::normal_leaf< KeyType, DataType, KeyCmp, LogNElem, BTreeType >::metainfo_type
oCstxxl::btree::normal_node< KeyType, KeyCmp, RawSize, BTreeType >::metainfo_type
oCstxxl::btree::root_node< KeyType, BIDType >
oCstxxl::buffered_writer< BlockType >::batch_entry
oCstxxl::buffered_writer< BlockType >::batch_entry_cmp
oCstxxl::CASE< tag_, Type_, Next_ >
oCstxxl::choose_int_types< PtrSize >
oCstxxl::choose_int_types< 4 >
oCstxxl::choose_int_types< 8 >
oCstxxl::cmdline_parser::argumentBase class of all options and parameters
oCstxxl::compat::remove_const< Type >
oCstxxl::compat::remove_const< Type const >
oCstxxl::compat_hash< KeyType >
oCstxxl::compat_hash_map< KeyType, MappedType, HashType >
oCstxxl::compat_hash_multimap< KeyType, MappedType, HashType >
oCstxxl::compat_unique_ptr< Type >
oCstxxl::completion_handlerCompletion handler class (Loki-style)
oCstxxl::completion_handler_impl
oCstxxl::const_counting_ptr< Type >High-performance smart pointer used as a wrapping reference counting pointer
oCstxxl::const_deque_iterator< DequeType >
oCstxxl::const_matrix_iterator< ValueType, BlockSideLength >General const_iterator type that points to single elements inside a matrix
oCstxxl::const_vector_iterator< ValueType, AllocStr, SizeType, DiffType, BlockSize, PagerType, PageSize >Const external vector iterator, model of ext_random_access_iterator concept
oCstxxl::counted_objectProvides reference counting abilities for use with counting_ptr
oCstxxl::counting_ptr< Type >High-performance smart pointer used as a wrapping reference counting pointer
oCstxxl::custom_stats_counter< ValueType >This class provides a statistical counter that can easily be deactivated using a typedef to dummy_custom_stats_counter
oCstxxl::deque_iterator< DequeType >
oCstxxl::disk_configEncapsulate the configuration of one "disk". The disk is actually a file I/O object which block_manager uses to read/write blocks
oCstxxl::double_blocked_index< SizeType, modulo2, modulo1 >
oCstxxl::dummy_custom_stats_counter< ValueType >Dummy class for custom_stats_counter
oCstxxl::element_iterator_traits< BlockType, SizeType >
oCstxxl::external_shared_ptr< P >This class takes a shared pointer, increments its reference count and wraps it in a way that the resulting object can be copied, dumped to disk, and destroyed without affecting the refcount
oCstxxl::fake_timerClass fake_timer is a drop-in replacement for timer, which does nothing
oCstxxl::hash_map::block_cache< BlockType >::bid_eq
oCstxxl::hash_map::block_cache< BlockType >::bid_hash
oCstxxl::hash_map::bucket< NodeType >
oCstxxl::hash_map::hash_map< KeyType, MappedType, HashType, KeyCompareType, SubBlockSize, SubBlocksPerBlock, AllocatorType >::AddHashStream< InputStream >
oCstxxl::hash_map::hash_map< KeyType, MappedType, HashType, KeyCompareType, SubBlockSize, SubBlocksPerBlock, AllocatorType >::HashedValueExtractorFunctor to extracts the actual value from a HashedValue-struct
oCstxxl::hash_map::hash_map< KeyType, MappedType, HashType, KeyCompareType, SubBlockSize, SubBlocksPerBlock, AllocatorType >::HashingStream< InputStream, ValueExtractor >Will return from its input-stream all values that are to be stored in the given bucket
oCstxxl::hash_map::hash_map< KeyType, MappedType, HashType, KeyCompareType, SubBlockSize, SubBlocksPerBlock, AllocatorType >::StripHashFunctorExtracts the value-part (ignoring the hashvalue); required by HashingStream (see above)
oCstxxl::hash_map::hash_map< KeyType, MappedType, HashType, KeyCompareType, SubBlockSize, SubBlocksPerBlock, AllocatorType >::UniqueValueStream< InputStream >Stream for filtering duplicates
oCstxxl::hash_map::hash_map_iterator_base< HashMap >
oCstxxl::hash_map::HashedValue< HashMap >Additional information about a stored value:
oCstxxl::hash_map::HashedValuesStream< HashMap, Reader >Stream interface for all value-pairs currently stored in the map
oCstxxl::hash_map::iterator_map< HashMap >::hasher
oCstxxl::hash_map::node< ValueType >
oCstxxl::helper::element_iterator_generator< BlockType, SizeType, CanUseTrivialPointer >
oCstxxl::helper::element_iterator_generator< BlockType, SizeType, false >
oCstxxl::helper::element_iterator_generator< BlockType, SizeType, true >
oCstxxl::IF< Flag, Type1, Type2 >IF template metaprogramming statement
oCstxxl::IF< false, Type1, Type2 >
oCstxxl::IF_N< Flag, Num1, Num2 >If Flag is true then IF<>::result is Num1 otherwise of IF<>::result is Num2
oCstxxl::IF_N< false, Num1, Num2 >
oCstxxl::interleaved_alloc_traits< scheme >
oCstxxl::interleaved_alloc_traits< FR >
oCstxxl::interleaved_alloc_traits< RC >
oCstxxl::interleaved_alloc_traits< RC_disk >
oCstxxl::interleaved_alloc_traits< RC_flash >
oCstxxl::interleaved_alloc_traits< single_disk >
oCstxxl::interleaved_alloc_traits< SR >
oCstxxl::interleaved_alloc_traits< striping >
oCstxxl::interleaved_striping
oCstxxl::ksort_defaultkey< RecordType >
oCstxxl::ksort_local::trigger_entry< BIDType, KeyType >
oCstxxl::ksort_local::type_key< Type, KeyType >
oCstxxl::ksort_local::write_completion_handler< BlockType, BidType >
oCstxxl::LOG2< Input >
oCstxxl::LOG2< 0 >
oCstxxl::LOG2< 1 >
oCstxxl::LOG2_floor< Input >
oCstxxl::LOG2_floor< 0 >
oCstxxl::LOG2_floor< 1 >
oCstxxl::malloc_setup
oCstxxl::malloc_statsAccess to some useful malloc statistics
oCstxxl::matrix< ValueType, BlockSideLength >External matrix container.
Introduction to matrix container: see STXXL Matrix tutorial.
Design and Internals of matrix container: see Matrix
oCstxxl::matrix_iterator< ValueType, BlockSideLength >General iterator type that points to single elements inside a matrix
oCstxxl::matrix_local::feedable_strassen_winograd< ValueType, BlockSideLength, Level, AExists, BExists >
oCstxxl::matrix_local::feedable_strassen_winograd< ValueType, BlockSideLength, 0, AExists, BExists >
oCstxxl::matrix_local::feedable_strassen_winograd_block_grained< ValueType, BlockSideLength, Level, AExists, BExists >
oCstxxl::matrix_local::feedable_strassen_winograd_block_grained< ValueType, BlockSideLength, 0, AExists, BExists >
oCstxxl::matrix_local::low_level_matrix_binary_ass_op< ValueType, BlockSideLength, a_transposed, b_transposed, Op >C = a [op] b; for arbitrary entries
oCstxxl::matrix_local::low_level_matrix_multiply_and_add< ValueType, BlockSideLength >Multiplies matrices A and B, adds result to C, for arbitrary entries param pointer to blocks of A,B,C; elements in blocks have to be in row-major
oCstxxl::matrix_local::low_level_matrix_unary_ass_op< ValueType, BlockSideLength, a_transposed, Op >C [op]= a; for arbitrary entries
oCstxxl::matrix_local::low_level_matrix_unary_op< ValueType, BlockSideLength, a_transposed, Op >C =[op] a; for arbitrary entries
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::addition
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::scalar_multiplication
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::subtraction
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::swappable_block_matrix_approximative_quarterer
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::swappable_block_matrix_padding_quarterer
oCstxxl::matrix_local::matrix_operations< ValueType, BlockSideLength >::swappable_block_matrix_quarterer
oCstxxl::matrix_local::matrix_to_quadtree< ValueType, BlockSideLength, Level >
oCstxxl::matrix_local::matrix_to_quadtree< ValueType, BlockSideLength, 0 >
oCstxxl::matrix_local::matrix_to_quadtree_block_grained< ValueType, BlockSideLength, Level, Granularity >
oCstxxl::matrix_local::matrix_to_quadtree_block_grained< ValueType, BlockSideLength, 0, Granularity >
oCstxxl::matrix_local::static_quadtree< ValueType, Level >A static_quadtree holds 4^Level elements arranged in a quad tree
oCstxxl::matrix_local::static_quadtree< ValueType, 0 >
oCstxxl::matrix_local::switch_major_index< BlockSideLength, transposed >
oCstxxl::matrix_local::switch_major_index< BlockSideLength, false >
oCstxxl::matrix_local::switch_major_index< BlockSideLength, true >
oCstxxl::matrix_operation_statistic_dataset
oCstxxl::mng_local::element_block< Type, Size >Contains data elements for stxxl::typed_block , not intended for direct use
oCstxxl::mng_local::filler_struct< Bytes >
oCstxxl::mng_local::filler_struct< 0 >
oCstxxl::new_alloc< Type >
oCstxxl::new_alloc< Type >::rebind< Rebind >
oCstxxl::new_alloc_rebind< Type, Rebind >
oCstxxl::new_alloc_rebind< Type, Type >
oCstxxl::NilCase
oCstxxl::noncopyable
oCstxxl::offset_allocator< BaseAllocator >Allocator functor adaptor
oCstxxl::parallel::active_tag
oCstxxl::parallel::guarded_iterator< RandomAccessIterator, Comparator >Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons
oCstxxl::parallel::inactive_tag
oCstxxl::parallel::loser_tree_traits< Stable, ValueType, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, char, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, int, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, long long, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, long, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, short, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, unsigned char, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, unsigned int, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, unsigned long long, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, unsigned long, Comparator >
oCstxxl::parallel::loser_tree_traits< Stable, unsigned short, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, ValueType, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, char, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, int, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, long long, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, long, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, short, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, unsigned char, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, unsigned int, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, unsigned long long, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, unsigned long, Comparator >
oCstxxl::parallel::loser_tree_traits_unguarded< Stable, unsigned short, Comparator >
oCstxxl::parallel::LoserTreeCopyBase< ValueType, Comparator >
oCstxxl::parallel::LoserTreeCopyBase< ValueType, Comparator >::LoserInternal representation of a loser tree player/node
oCstxxl::parallel::LoserTreeCopyUnguardedBase< ValueType, Comparator >::LoserInternal representation of a loser tree player/node
oCstxxl::parallel::LoserTreePointerBase< ValueType, Comparator >
oCstxxl::parallel::LoserTreePointerBase< ValueType, Comparator >::LoserInternal representation of a loser tree player/node
oCstxxl::parallel::LoserTreePointerUnguardedBase< ValueType, Comparator >::LoserInternal representation of a loser tree player/node
oCstxxl::parallel::LoserTreeReference< T, Comparator >
oCstxxl::parallel::LoserTreeReference< T, Comparator >::Loser
oCstxxl::parallel::NumberOfThreads
oCstxxl::parallel::Settings< must_be_int >
oCstxxl::parallel::Timing< tag, must_be_int >
oCstxxl::parallel::Timing< inactive_tag, must_be_int >
oCstxxl::parallel::unguarded_iterator< RandomAccessIterator, Comparator >
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::empty_external_array_eraserUnary operator which returns true if the external array has run empty
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::empty_internal_array_eraserUnary operator which returns true if the internal array has run empty
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::external_min_comparatorCompares the largest accessible value of two external arrays
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::hint_comparatorCompares the largest value of the block hinted the latest of two external arrays
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::inv_compare_typeInverse comparison functor
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::ProcessorDataA struct containing the local insertion heap and other information local to a processor
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::s_min_tree_comparator
oCstxxl::parallel_priority_queue< ValueType, CompareType, AllocStrategy, BlockSize, DefaultMemSize, MaxItems >::stats_typeStruct of all statistical counters and timers. Turn on/off statistics using the stats_counter and stats_timer typedefs
oCstxxl::Plug
oCstxxl::ppq_local::external_array_writer< ExternalArrayType >::iterator
oCstxxl::ppq_local::minima_tree< ParentType >The minima_tree contains minima from all sources inside the PPQ
oCstxxl::ppq_local::minima_tree< ParentType >::head_compWinnerTree-Comparator for the head winner tree. It accesses all relevant data structures from the priority queue
oCstxxl::ppq_local::minima_tree< ParentType >::heaps_compComparator for the insertion heaps winner tree
oCstxxl::ppq_local::minima_tree< ParentType >::ia_compComparator for the internal arrays winner tree
oCstxxl::ppq_local::ppq_iterator< ValueType >A random-access iterator class for block oriented data
oCstxxl::prefetch_pool< BlockType >::bid_hash
oCstxxl::priority_queue_config< ValueType, CompareType, BufferSize1_, N_, IntKMAX_, IntLevels_, BlockSize_, ExtKMAX_, ExtLevels_, AllocStr_ >
oCstxxl::PRIORITY_QUEUE_GENERATOR< ValueType, CompareType, IntMemory, MaxItems, Tune >Priority queue type generator.
Introduction to priority queue container: see STXXL Priority Queue tutorial.
Design and Internals of priority queue container: see Priority Queue
oCstxxl::priority_queue_local::compute_N< AI_, X_, CriticalSize >
oCstxxl::priority_queue_local::compute_N< 1, X_, CriticalSize_ >
oCstxxl::priority_queue_local::dummy
oCstxxl::priority_queue_local::find_B_m< ElementSize, IntMem, MaxItems, BlockSize, m_, stop >
oCstxxl::priority_queue_local::find_B_m< ElementSize, IntMem, MaxItems, 2048, 1, stop >
oCstxxl::priority_queue_local::find_B_m< ElementSize, IntMem, MaxItems, BlockSize, m_, true >
oCstxxl::priority_queue_local::find_settings< ElementSize, IntMem, MaxItems >
oCstxxl::priority_queue_local::internal_bounded_stack< ValueType, MaxSize >Similar to std::stack, with the following differences:
oCstxxl::priority_queue_local::internal_priority_queue< ValueType, ContainerType, CompareType >Similar to std::priority_queue, with the following differences:
oCstxxl::priority_queue_local::invert_order< Predicate, FirstType, SecondType >Inverts the order of a comparison functor by swapping its arguments
oCstxxl::priority_queue_local::loser_tree< ValueType, CompareType, MaxArity >::EntryType of nodes in the loser tree
oCstxxl::priority_queue_local::Parameters_for_priority_queue_not_found_Increase_IntMem
oCstxxl::priority_queue_local::Parameters_not_found_Try_to_change_the_Tune_parameter
oCstxxl::random_number< UniformRGen >Uniform [0, N) pseudo-random generator
oCstxxl::random_number32Fast uniform [0, 2^32) pseudo-random generator with period 2^32, random bits: 32
oCstxxl::random_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
oCstxxl::random_number64Slow and precise uniform [0, 2^64) pseudo-random generator
oCstxxl::random_number8_rFast uniform [0, 255] pseudo-random generator with period 2^8, random bits: 8 (one byte)
oCstxxl::random_pager< npages_ >Pager with random replacement strategy
oCstxxl::random_uniform_fastFast uniform [0.0, 1.0) pseudo-random generator
oCstxxl::random_uniform_slowSlow and precise uniform [0.0, 1.0) pseudo-random generator period: at least 2^48, random bits: at least 31
oCstxxl::run_cursor< BlockType >
oCstxxl::scoped_mutex_lockAquire a lock that's valid until the end of scope
oCstxxl::scoped_print_timerSimple scoped timer, which takes a text message and prints the duration until the scope is destroyed
oCstxxl::sequence< ValueType, BlockSize, AllocStr, SizeType >::reverse_stream
oCstxxl::sequence< ValueType, BlockSize, AllocStr, SizeType >::stream
oCstxxl::set_switch_handler
oCstxxl::settings< MustBeInt >
oCstxxl::simdisk_geometry::Zone
oCstxxl::simdisk_geometry::ZoneCmp
oCstxxl::single_disk'Single disk' disk allocation scheme functor
oCstxxl::sort_helper::trigger_entry< BlockType, ValueType >
oCstxxl::sort_local::read_next_after_write_completed< BlockType, BidType >
oCstxxl::stable_ksort_local::bid_sequence< BIDType, AllocStrategy >
oCstxxl::stable_ksort_local::type_key< Type >
oCstxxl::stack_config_generator< ValueType, BlocksPerPage, BlockSize, AllocStr, SizeType >
oCstxxl::STACK_GENERATOR< ValueType, Externality, Behaviour, BlocksPerPage, BlockSize, IntStackType, MigrCritSize, AllocStr, SizeType >Stack type generator
Introduction to stack container: see STXXL Stack tutorial.
Design and Internals of stack container: see Stack
oCstxxl::stats::scoped_read_timer
oCstxxl::stats::scoped_read_write_timer
oCstxxl::stats::scoped_wait_timer
oCstxxl::stats::scoped_write_timer
oCstxxl::stats_data
oCstxxl::stream::choose< Input, Which >
oCstxxl::stream::choose< Input, 1 >Creates stream from a tuple stream taking the first component of each tuple
oCstxxl::stream::choose< Input, 2 >Creates stream from a tuple stream taking the second component of each tuple
oCstxxl::stream::choose< Input, 3 >Creates stream from a tuple stream taking the third component of each tuple
oCstxxl::stream::choose< Input, 4 >Creates stream from a tuple stream taking the fourth component of each tuple
oCstxxl::stream::choose< Input, 5 >Creates stream from a tuple stream taking the fifth component of each tuple
oCstxxl::stream::choose< Input, 6 >Creates stream from a tuple stream taking the sixth component of each tuple
oCstxxl::stream::compute_sorted_runs_type< ValueType, BlockSize >Computes sorted runs type from value type and block size
oCstxxl::stream::concatenate< StreamA, StreamB >
oCstxxl::stream::counter< ValueType >
oCstxxl::stream::dummy_cmp_unique
oCstxxl::stream::from_sorted_sequences< ValueType >Input strategy for runs_creator class
oCstxxl::stream::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
oCstxxl::stream::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
oCstxxl::stream::make_tuple< Input1, Input2, Input3, Input4, Input5, Input6 >Creates stream of 6-tuples from 6 input streams
oCstxxl::stream::make_tuple< Input1, Input2, Input3, Input4, Input5, Stopper >Creates stream of 5-tuples from 5 input streams
oCstxxl::stream::make_tuple< Input1, Input2, Input3, Input4, Stopper, Stopper >Creates stream of 4-tuples from 4 input streams
oCstxxl::stream::make_tuple< Input1, Input2, Input3, Stopper, Stopper, Stopper >Creates stream of 3-tuples from 3 input streams
oCstxxl::stream::make_tuple< Input1, Input2, Stopper, Stopper, Stopper, Stopper >Creates stream of 2-tuples (pairs) from 2 input streams
oCstxxl::stream::Stopper
oCstxxl::stream::streamify_traits< InputIterator >Traits class of streamify function
oCstxxl::stream::streamify_traits< stxxl::const_vector_iterator< ValueType, AllocStr, SizeType, DiffType, BlockSize, PagerType, PageSize > >
oCstxxl::stream::streamify_traits< stxxl::vector_iterator< ValueType, AllocStr, SizeType, DiffType, BlockSize, PagerType, PageSize > >
oCstxxl::stream::transform< Operation, Input1, Input2, Input3, Input4, Input5, Input6 >Processes (up to) 6 input streams using given operation functor
oCstxxl::stream::transform< Operation, Input1, Input2, Input3, Input4, Input5, Stopper >Processes 5 input streams using given operation functor
oCstxxl::stream::transform< Operation, Input1, Input2, Input3, Input4, Stopper, Stopper >Processes 4 input streams using given operation functor
oCstxxl::stream::transform< Operation, Input1, Input2, Input3, Stopper, Stopper, Stopper >Processes 3 input streams using given operation functor
oCstxxl::stream::transform< Operation, Input1, Input2, Stopper, Stopper, Stopper, Stopper >Processes 2 input streams using given operation functor
oCstxxl::stream::transform< Operation, Input1, Stopper, Stopper, Stopper, Stopper, Stopper >Processes an input stream using given operation functor
oCstxxl::stream::unique< Input, BinaryPredicate >Equivalent to std::unique algorithms
oCstxxl::stream::unique< Input, dummy_cmp_unique >Equivalent to std::unique algorithms
oCstxxl::stream::use_push< ValueType >Input strategy for runs_creator class
oCstxxl::stream::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
oCstxxl::stream::vector_iterator2stream_sr< InputIterator >Version of iterator2stream. Switches between vector_iterator2stream and iterator2stream
oCstxxl::stripingStriping disk allocation scheme functor
oCstxxl::swappable_block< ValueType, BlockSize >Virtualization of a block of data. Holds information for allocating and swapping. To use in cooperation with block_scheduler
oCstxxl::SWITCH< tag, Case >
oCstxxl::SWITCH< tag, NilCase >
oCstxxl::timerClass timer is a simple stop watch timer
oCstxxl::trigger_entry_iterator< trigger_iterator_type >
oCstxxl::tuple< T1, T2, T3, T4, T5, T6 >K-Tuple data type
oCstxxl::tuple< T1, T2, T3, T4, T5, T6 >::item_type< I >
oCstxxl::tuple< T1, Plug, Plug, Plug, Plug >Partial specialization for 1- tuple
oCstxxl::tuple< T1, Plug, Plug, Plug, Plug >::item_type< I >
oCstxxl::tuple< T1, T2, Plug, Plug, Plug, Plug >Partial specialization for 2- tuple (equivalent to std::pair)
oCstxxl::tuple< T1, T2, Plug, Plug, Plug, Plug >::item_type< I >
oCstxxl::tuple< T1, T2, T3, Plug, Plug, Plug >Partial specialization for 3- tuple (triple)
oCstxxl::tuple< T1, T2, T3, Plug, Plug, Plug >::item_type< I >
oCstxxl::tuple< T1, T2, T3, T4, Plug, Plug >Partial specialization for 4- tuple
oCstxxl::tuple< T1, T2, T3, T4, Plug, Plug >::item_type< I >
oCstxxl::tuple< T1, T2, T3, T4, T5, Plug >Partial specialization for 5- tuple
oCstxxl::tuple< T1, T2, T3, T4, T5, Plug >::item_type< I >
oCstxxl::tuple_base< T1, T2, T3, T4, T5, T6 >
oCstxxl::tuple_base< T1, T2, T3, T4, T5, T6 >::item_type< I >
oCstxxl::tuple_greater1st< TupleType >
oCstxxl::tuple_less1st< TupleType >
oCstxxl::tuple_less1st_less2nd< TupleType >
oCstxxl::tuple_less2nd< TupleType >
oCstxxl::tuple_less2nd_less1st< TupleType >
oCstxxl::uint_pair< HighType >Construct an 40-bit or 48-bit unsigned integer stored in five or six bytes
oCstxxl::vector< ValueType, PageSize, PagerType, BlockSize, AllocStr, SizeType >External vector container.
Introduction to vector container: see STXXL Vector tutorial.
Design and Internals of vector container: see Vector
oCstxxl::vector_bufreader_iterator< VectorBufReaderType >Adapter for vector_bufreader to match iterator requirements of C++11 range-based loop construct
oCstxxl::VECTOR_GENERATOR< ValueType, PageSize, CachePages, BlockSize, AllocStr, Pager >External vector type generator
oCstxxl::vector_iterator< ValueType, AllocStr, SizeType, DiffType, BlockSize, PagerType, PageSize >External vector iterator, model of ext_random_access_iterator concept
oCstxxl::winner_tree< Comparator >The class winner_tree is a binary tournament tree
oCstxxl::winner_tree< Comparator >::stats_typeCollection of stats from the winner_tree
oCstxxl::write_pool< BlockType >::busy_entry
oCstxxl::swappable_block< ValueType, BlockSideLength *BlockSideLength >
oCstxxl::tuple< typename Input1::value_type, typename Input2::value_type >
oCstxxl::tuple< typename Input1::value_type, typename Input2::value_type, typename Input3::value_type >
oCstxxl::tuple< typename Input1::value_type, typename Input2::value_type, typename Input3::value_type, typename Input4::value_type >
oCstxxl::tuple< typename Input1::value_type, typename Input2::value_type, typename Input3::value_type, typename Input4::value_type, typename Input5::value_type >
oCstxxl::tuple< typename Input1::value_type, typename Input2::value_type, typename Input3::value_type, typename Input4::value_type, typename Input5::value_type, typename Input6::value_type >
oCstxxl::vector< ValueType >
oCstxxl::winner_tree< stxxl::parallel_priority_queue::external_min_comparator >
oCstxxl::winner_tree< stxxl::parallel_priority_queue::hint_comparator >
oCstxxl::winner_tree< stxxl::ppq_local::minima_tree::head_comp >
oCstxxl::winner_tree< stxxl::ppq_local::minima_tree::heaps_comp >
oCstxxl::winner_tree< stxxl::ppq_local::minima_tree::ia_comp >
oCBaseType
\CType