This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123456]

add_filler< BaseType_, FillSize_ >	Contains per block filler for `stxxl::typed_block` , not intended for direct use
add_filler< Tp_, RawSize_-sizeof(Tp_)>
expand_struct< Tp_, RawSize_ >	Helper to compute the size of the filler , not intended for direct use
basic_allocation_strategy	Example disk allocation scheme functor
stream::basic_runs_creator< Input_, Cmp_, BlockSize_, AllocStr_ >	Forms sorted runs of data from a stream
stream::runs_creator< Input_, Cmp_, BlockSize_, AllocStr_ >	Forms sorted runs of data from a stream
stream::basic_runs_merger< RunsType_, Cmp_, AllocStr_ >	Merges sorted runs
stream::runs_merger< RunsType_, Cmp_, AllocStr_ >	Merges sorted runs
stream::basic_runs_merger< sorted_runs_type, Cmp_, AllocStr_ >
stream::runs_merger< sorted_runs_type, Cmp_, AllocStr_ >
BID< SIZE >	Block identifier class
BID< 0 >	Specialization of block identifier class (BID) for variable size block size
BID< BLK_SIZE >
BID< raw_size >
block_manager	Block manager class
block_prefetcher< block_type, bid_iterator_type >	Encapsulates asynchronous prefetching engine
buf_istream< BlkTp_, BIDIteratorTp_ >	Buffered input stream
buf_ostream< BlkTp_, BIDIteratorTp_ >	Buffered output stream
buffered_writer< block_type >	Encapsulates asynchronous buffered block writing engine
buffered_writer< typed_block >
stream::choose< Input_, 1 >	Creates stream from a tuple stream taking the first component of each tuple
stream::choose< Input_, 2 >	Creates stream from a tuple stream taking the second component of each tuple
stream::choose< Input_, 3 >	Creates stream from a tuple stream taking the third component of each tuple
stream::choose< Input_, 4 >	Creates stream from a tuple stream taking the fourth component of each tuple
stream::choose< Input_, 5 >	Creates stream from a tuple stream taking the fifth component of each tuple
stream::choose< Input_, 6 >	Creates stream from a tuple stream taking the sixth component of each tuple
completion_handler	Completion handler class (Loki-style)
stream::compute_sorted_runs_type< ValueType_, BlockSize_ >	Computes sorted runs type from value type and block size
config	Access point to disks properties
const_vector_iterator< Tp_, AllocStr_, SzTp_, DiffTp_, BlkSize_, PgTp_, PgSz_ >	Const external vector iterator, model of `ext_random_access_iterator` concept
default_completion_handler	Default completion handler class
deque< T, VectorType >	A deque container
disk_queues	Encapsulates disk queues
element_block< T, Size_ >	Contains data elements for `stxxl::typed_block` , not intended for direct use
block_w_bids< T, Size_, RawSize_, NBids_ >	Contains BID references for `stxxl::typed_block` , not intended for direct use
element_block< T_, Size_ >
block_w_bids< T_,((RawSize_-sizeof(BID< RawSize_ >)*NBids_)/sizeof(T_)), RawSize_, NBids_ >
block_w_bids< T_,((RawSize_-sizeof(BID< RawSize_ >)*NBids_-sizeof(InfoType_))/sizeof(T_)), RawSize_, NBids_ >
block_w_info< T_, RawSize_, NBids_, InfoType_ >	Contains per block information for `stxxl::typed_block` , not intended for direct use
block_w_info< T_, RawSize_, NRef_, InfoType_ >
add_filler< block_w_info< T_, RawSize_, NRef_, InfoType_ >, RawSize_-sizeof(block_w_info< T_, RawSize_, NRef_, InfoType_ >)>
expand_struct< block_w_info< T_, RawSize_, NRef_, InfoType_ >, RawSize_ >
typed_block< RawSize_, T_, NRef_, InfoType_ >	Block containing elements of fixed length
priority_queue_local::ext_merger< BlockType_, Cmp_, Arity_, AllocStr_ >	External merger, based on the loser tree data structure. !
file	Defines interface of file
disk_queued_file	Implementation of some file methods based on serving_request
fileperblock_file< base_file_type >	Implementation of file based on other files, dynamically allocate one file per block. Allows for dynamic disk space consumption
mem_file	Implementation of file based on new[] and memcpy
mmap_file	Implementation of memory mapped access file
sim_disk_file	Implementation of disk emulation
syscall_file	Implementation of file based on UNIX syscalls
wbtl_file	Implementation of file based on buffered writes and block remapping via a translation layer
ufs_file_base	Base for UNIX file system implementations
mmap_file	Implementation of memory mapped access file
sim_disk_file	Implementation of disk emulation
syscall_file	Implementation of file based on UNIX syscalls
stream::from_sorted_sequences< ValueType_ >	Input strategy for `runs_creator` class
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`
grow_shrink_stack< Config_ >	Efficient implementation that uses prefetching and overlapping using internal buffers
grow_shrink_stack2< Config_ >	Efficient implementation that uses prefetching and overlapping using (shared) buffers pools
IF< Flag, Type1, Type2 >	IF template metaprogramming statement
IF_N< Flag, Num1, Num2 >
priority_queue_local::internal_bounded_stack< Tp_, max_size_ >	Similar to std::stack, with the following differences:
priority_queue_local::internal_bounded_stack< unsigned_type, arity >
priority_queue_local::internal_bounded_stack< unsigned_type, KNKMAX >
priority_queue_local::internal_priority_queue< _Tp, _Sequence, _Compare >	Similar to std::priority_queue, with the following differences:
priority_queue_local::internal_priority_queue< value_type, std::vector< value_type >, comparator_type >
priority_queue_local::invert_order< Predicate, first_argument_type, second_argument_type >	Inverts the order of a comparison functor by swapping its arguments
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`
LOG2_floor< Input >
priority_queue_local::loser_tree< ValTp_, Cmp_, KNKMAX >	Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 !
priority_queue_local::loser_tree< value_type, comparator_type, IntKMAX >
lru_pager< npages_ >	Pager with LRU replacement strategy
stream::make_tuple< Input1_, Input2_, Input3_, Input4_, Input5_, Input6_ >	Creates stream of 6-tuples from 6 input streams
stream::make_tuple< Input1_, Input2_, Input3_, Input4_, Input5_, Stopper >	Creates stream of 5-tuples from 5 input streams
stream::make_tuple< Input1_, Input2_, Input3_, Input4_, Stopper, Stopper >	Creates stream of 4-tuples from 4 input streams
stream::make_tuple< Input1_, Input2_, Input3_, Stopper, Stopper, Stopper >	Creates stream of 3-tuples from 3 input streams
stream::make_tuple< Input1_, Input2_, Stopper, Stopper, Stopper, Stopper >	Creates stream of 2-tuples (pairs) from 2 input streams
malloc_stats	Access to some useful malloc statistics
map< KeyType, DataType, CompareType, RawNodeSize, RawLeafSize, PDAllocStrategy >	External associative container
migrating_stack< CritSize, ExternalStack, InternalStack >	A stack that migrates from internal memory to external when its size exceeds a certain threshold
normal_stack< Config_ >	External stack container
offset_allocator< BaseAllocator_ >	Allocator functor adaptor
prefetch_pool< BlockType >	Implements dynamically resizable prefetching pool
priority_queue< Config_ >	External priority queue data structure
PRIORITY_QUEUE_GENERATOR< Tp_, Cmp_, IntM_, MaxS_, Tune_ >	Priority queue type generator
queue< ValTp, BlkSz, AllocStr, SzTp >	External FIFO queue container
random_number< UniformRGen_ >	Uniform [0, N) pseudo-random generator
random_number32	Fast uniform [0, 2^32) pseudo-random generator with period 2^32, random bits: 32
random_number32_r	Fast 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
random_number64	Slow and precise uniform [0, 2^64) pseudo-random generator
random_number< random_uniform_fast >
random_pager< npages_ >	Pager with random replacement strategy
random_uniform_fast	Fast uniform [0.0, 1.0) pseudo-random generator
random_uniform_slow	Slow and precise uniform [0.0, 1.0) pseudo-random generator period: at least 2^48, random bits: at least 31
read_write_pool< BlockType >	Implements dynamically resizable buffered writing and prefetched reading pool
request_interface	Functional interface of a request
request	Request with basic properties like file and offset
request_with_state	Request with completion state
serving_request	Request which serves an I/O by calling the synchronous routine of the file
request_with_waiters	Request that is aware of threads waiting for it to complete
request_with_state	Request with completion state
request_ptr	Implemented as reference counting smart pointer
stream::runs_creator< from_sorted_sequences< ValueType_ >, Cmp_, BlockSize_, AllocStr_ >	Forms sorted runs of data taking elements in sorted order (element by element)
stream::runs_creator< use_push< ValueType_ >, Cmp_, BlockSize_, AllocStr_ >	Forms sorted runs of elements passed in push() method
scoped_mutex_lock	Aquire a lock that's valid until the end of scope
single_disk	'single disk' disk allocation scheme functor
stream::sort< Input_, Cmp_, BlockSize_, AllocStr_, runs_creator_type >	Produces sorted stream from input stream
stream::sorted_runs< TriggerEntryType >	All sorted runs of a sort operation
stream::sorted_runs< trigger_entry_type >
STACK_GENERATOR< ValTp, Externality, Behaviour, BlocksPerPage, BlkSz, IntStackTp, MigrCritSize, AllocStr, SzTp >	Stack type generator
stats	Collects various I/O statistics
stream::streamify_traits< InputIterator_ >	Traits class of `streamify` function
striping	Striping disk allocation scheme functor
FR	Fully randomized disk allocation scheme functor
RC	Randomized cycling disk allocation scheme functor
SR	Simple randomized disk allocation scheme functor
stream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Input5_, Input6_ >	Processes (up to) 6 input streams using given operation functor
stream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Input5_, Stopper >	Processes 5 input streams using given operation functor
stream::transform< Operation_, Input1_, Input2_, Input3_, Input4_, Stopper, Stopper >	Processes 4 input streams using given operation functor
stream::transform< Operation_, Input1_, Input2_, Input3_, Stopper, Stopper, Stopper >	Processes 3 input streams using given operation functor
stream::transform< Operation_, Input1_, Input2_, Stopper, Stopper, Stopper, Stopper >	Processes 2 input streams using given operation functor
stream::transform< Operation_, Input1_, Stopper, Stopper, Stopper, Stopper, Stopper >	Processes an input stream using given operation functor
tuple< T1, T2, T3, T4, T5, T6 >	K-Tuple data type
tuple< T1, Plug, Plug, Plug, Plug >	Partial specialization for 1- `tuple`
tuple< T1, T2, Plug, Plug, Plug, Plug >	Partial specialization for 2- `tuple` (equivalent to std::pair)
tuple< T1, T2, T3, Plug, Plug, Plug >	Partial specialization for 3- `tuple` (triple)
tuple< T1, T2, T3, T4, Plug, Plug >	Partial specialization for 4- `tuple`
tuple< T1, T2, T3, T4, T5, Plug >	Partial specialization for 5- `tuple`
stream::unique< Input, BinaryPredicate >	Equivalent to std::unique algorithms
stream::unique< Input, dummy_cmp_unique_ >	Equivalent to std::unique algorithms
stream::use_push< ValueType_ >	Input strategy for `runs_creator` class
vector< Tp_, PgSz_, PgTp_, BlkSize_, AllocStr_, SzTp_ >	External vector container
VECTOR_GENERATOR< Tp_, PgSz_, Pages_, BlkSize_, AllocStr_, Pager_ >	External vector type generator
vector_iterator< Tp_, AllocStr_, SzTp_, DiffTp_, BlkSize_, PgTp_, PgSz_ >	External vector iterator, model of `ext_random_access_iterator` concept
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`
stream::vector_iterator2stream_sr< InputIterator_ >	Version of `iterator2stream`. Switches between `vector_iterator2stream` and `iterator2stream`
write_pool< BlockType >	Implements dynamically resizable buffered writing pool