| ►Npriority_queue_local | |
| Cext_merger | External merger, based on the loser tree data structure. ! |
| Cinternal_bounded_stack | Similar to std::stack, with the following differences: |
| Cinternal_priority_queue | Similar to std::priority_queue, with the following differences: |
| Cinvert_order | Inverts the order of a comparison functor by swapping its arguments |
| Closer_tree | Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 ! |
| ►Nstream | Stream package subnamespace |
| Cbasic_runs_creator | Forms sorted runs of data from a stream |
| Cbasic_runs_merger | Merges sorted runs |
| Cchoose< Input_, 1 > | Creates stream from a tuple stream taking the first component of each tuple |
| Cchoose< Input_, 2 > | Creates stream from a tuple stream taking the second component of each tuple |
| Cchoose< Input_, 3 > | Creates stream from a tuple stream taking the third component of each tuple |
| Cchoose< Input_, 4 > | Creates stream from a tuple stream taking the fourth component of each tuple |
| Cchoose< Input_, 5 > | Creates stream from a tuple stream taking the fifth component of each tuple |
| Cchoose< Input_, 6 > | Creates stream from a tuple stream taking the sixth component of each tuple |
| Ccompute_sorted_runs_type | Computes sorted runs type from value type and block size |
| Cfrom_sorted_sequences | Input strategy for runs_creator class |
| Cgenerator2stream | A model of stream that outputs data from an adaptable generator functor For convenience use streamify function instead of direct instantiation of generator2stream |
| Citerator2stream | A model of stream that retrieves the data from an input iterator For convenience use streamify function instead of direct instantiation of iterator2stream |
| Cmake_tuple | Creates stream of 6-tuples from 6 input streams |
| Cmake_tuple< Input1_, Input2_, Input3_, Input4_, Input5_, Stopper > | Creates stream of 5-tuples from 5 input streams |
| Cmake_tuple< Input1_, Input2_, Input3_, Input4_, Stopper, Stopper > | Creates stream of 4-tuples from 4 input streams |
| Cmake_tuple< Input1_, Input2_, Input3_, Stopper, Stopper, Stopper > | Creates stream of 3-tuples from 3 input streams |
| Cmake_tuple< Input1_, Input2_, Stopper, Stopper, Stopper, Stopper > | Creates stream of 2-tuples (pairs) from 2 input streams |
| Cruns_creator | Forms sorted runs of data from a stream |
| Cruns_creator< from_sorted_sequences< ValueType_ >, Cmp_, BlockSize_, AllocStr_ > | Forms sorted runs of data taking elements in sorted order (element by element) |
| Cruns_creator< use_push< ValueType_ >, Cmp_, BlockSize_, AllocStr_ > | Forms sorted runs of elements passed in push() method |
| Cruns_merger | Merges sorted runs |
| Csort | Produces sorted stream from input stream |
| Csorted_runs | All sorted runs of a sort operation |
| Cstreamify_traits | Traits class of streamify function |
| Ctransform | Processes (up to) 6 input streams using given operation functor |
| Ctransform< Operation_, Input1_, Input2_, Input3_, Input4_, Input5_, Stopper > | Processes 5 input streams using given operation functor |
| Ctransform< Operation_, Input1_, Input2_, Input3_, Input4_, Stopper, Stopper > | Processes 4 input streams using given operation functor |
| Ctransform< Operation_, Input1_, Input2_, Input3_, Stopper, Stopper, Stopper > | Processes 3 input streams using given operation functor |
| Ctransform< Operation_, Input1_, Input2_, Stopper, Stopper, Stopper, Stopper > | Processes 2 input streams using given operation functor |
| Ctransform< Operation_, Input1_, Stopper, Stopper, Stopper, Stopper, Stopper > | Processes an input stream using given operation functor |
| Cunique | Equivalent to std::unique algorithms |
| Cunique< Input, dummy_cmp_unique_ > | Equivalent to std::unique algorithms |
| Cuse_push | Input strategy for runs_creator class |
| Cvector_iterator2stream | 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 |
| Cvector_iterator2stream_sr | Version of iterator2stream. Switches between vector_iterator2stream and iterator2stream |
| Cadd_filler | Contains per block filler for stxxl::typed_block , not intended for direct use |
| Cbasic_allocation_strategy | Example disk allocation scheme functor |
| CBID | Block identifier class |
| CBID< 0 > | Specialization of block identifier class (BID) for variable size block size |
| Cblock_manager | Block manager class |
| Cblock_prefetcher | Encapsulates asynchronous prefetching engine |
| Cblock_w_bids | Contains BID references for stxxl::typed_block , not intended for direct use |
| Cblock_w_info | Contains per block information for stxxl::typed_block , not intended for direct use |
| Cbuf_istream | Buffered input stream |
| Cbuf_ostream | Buffered output stream |
| Cbuffered_writer | Encapsulates asynchronous buffered block writing engine |
| Ccompletion_handler | Completion handler class (Loki-style) |
| Cconfig | Access point to disks properties |
| Cconst_vector_iterator | Const external vector iterator, model of ext_random_access_iterator concept |
| Cdefault_completion_handler | Default completion handler class |
| Cdeque | A deque container |
| Cdisk_queued_file | Implementation of some file methods based on serving_request |
| Cdisk_queues | Encapsulates disk queues |
| Celement_block | Contains data elements for stxxl::typed_block , not intended for direct use |
| Cexpand_struct | Helper to compute the size of the filler , not intended for direct use |
| Cfile | Defines interface of file |
| Cfileperblock_file | Implementation of file based on other files, dynamically allocate one file per block. Allows for dynamic disk space consumption |
| CFR | Fully randomized disk allocation scheme functor |
| Cgrow_shrink_stack | Efficient implementation that uses prefetching and overlapping using internal buffers |
| Cgrow_shrink_stack2 | Efficient implementation that uses prefetching and overlapping using (shared) buffers pools |
| CIF | IF template metaprogramming statement |
| CIF_N | |
| CLOG2_floor | |
| Clru_pager | Pager with LRU replacement strategy |
| Cmalloc_stats | Access to some useful malloc statistics |
| Cmap | External associative container |
| Cmem_file | Implementation of file based on new[] and memcpy |
| Cmigrating_stack | A stack that migrates from internal memory to external when its size exceeds a certain threshold |
| Cmmap_file | Implementation of memory mapped access file |
| Cnormal_stack | External stack container |
| Coffset_allocator | Allocator functor adaptor |
| Cprefetch_pool | Implements dynamically resizable prefetching pool |
| Cpriority_queue | External priority queue data structure |
| CPRIORITY_QUEUE_GENERATOR | Priority queue type generator |
| Cqueue | External FIFO queue container |
| Crandom_number | Uniform [0, N) pseudo-random generator |
| Crandom_number32 | Fast uniform [0, 2^32) pseudo-random generator with period 2^32, random bits: 32 |
| Crandom_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 |
| Crandom_number64 | Slow and precise uniform [0, 2^64) pseudo-random generator |
| Crandom_pager | Pager with random replacement strategy |
| Crandom_uniform_fast | Fast uniform [0.0, 1.0) pseudo-random generator |
| Crandom_uniform_slow | Slow and precise uniform [0.0, 1.0) pseudo-random generator period: at least 2^48, random bits: at least 31 |
| CRC | Randomized cycling disk allocation scheme functor |
| Cread_write_pool | Implements dynamically resizable buffered writing and prefetched reading pool |
| Crequest | Request with basic properties like file and offset |
| Crequest_interface | Functional interface of a request |
| Crequest_ptr | Implemented as reference counting smart pointer |
| Crequest_with_state | Request with completion state |
| Crequest_with_waiters | Request that is aware of threads waiting for it to complete |
| Cscoped_mutex_lock | Aquire a lock that's valid until the end of scope |
| Cserving_request | Request which serves an I/O by calling the synchronous routine of the file |
| Csim_disk_file | Implementation of disk emulation |
| Csingle_disk | 'single disk' disk allocation scheme functor |
| CSR | Simple randomized disk allocation scheme functor |
| CSTACK_GENERATOR | Stack type generator |
| Cstats | Collects various I/O statistics |
| Cstriping | Striping disk allocation scheme functor |
| Csyscall_file | Implementation of file based on UNIX syscalls |
| Ctuple | 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 |
| Ctyped_block | Block containing elements of fixed length |
| Cufs_file_base | Base for UNIX file system implementations |
| Cvector | External vector container |
| CVECTOR_GENERATOR | External vector type generator |
| Cvector_iterator | External vector iterator, model of ext_random_access_iterator concept |
| Cwbtl_file | Implementation of file based on buffered writes and block remapping via a translation layer |
| Cwrite_pool | Implements dynamically resizable buffered writing pool |
