| ►Nstd | STL namespace |
| Chash< tlx::StringView > | |
| ►Ntlx | |
| ►Nmeta_detail | |
| CCallForRangeImpl | Helper for call_for_range: general recursive case |
| CCallForRangeImpl< Index, 0, Functor > | Helper for call_for_range: base case |
| Cmake_index_sequence_helper | |
| Cmake_index_sequence_helper< 0, Indexes... > | |
| CVMapForRangeImpl | Helper for vmap_for_range: general recursive case |
| CVMapForRangeImpl< Index, 0, Functor > | Helper for vmap_for_range: base case |
| ►Nmultisequence_partition_detail | |
| Clexicographic | Compare a pair of types lexicographically, ascending |
| Clexicographic_rev | Compare a pair of types lexicographically, descending |
| ►Nmultisequence_selection_detail | |
| Clexicographic | Compare a pair of types lexicographically, ascending |
| Clexicographic_rev | Compare a pair of types lexicographically, descending |
| ►Nmultiway_merge_detail | |
| Cguarded_iterator | Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons |
| Cunguarded_iterator | |
| ►Nparallel_mergesort_detail | |
| CPMWMSPiece | Subsequence description |
| CPMWMSSortingData | Data accessed by all threads |
| ►Nradix_heap_detail | |
| CBitArray | A BitArray of fixed size supporting reading, setting, and clearing of individual bits |
| CBitArrayRecursive | Internal implementation of BitArray; do not invoke directly |
| CBitArrayRecursive< Size, false > | |
| CBitArrayRecursive< Size, true > | |
| CBucketComputation | |
| CIntegerRank | Compute the rank of an integer x (i.e |
| CPairKeyExtract | Used as an adapter to implement RadixHeapPair on top of RadixHeap |
| ►Nsort_networks | Implementations of sorting networks for up to sixteen elements |
| CCS_IfSwap | Conditional swap implementation used for sorting networks: trivial portable C++ implementation with custom comparison method and std::swap() |
| ►Nsort_strings_detail | |
| CGenericCharStringSet | Class implementing StringSet concept for char* and unsigned char* strings |
| CGenericCharStringSetTraits | Traits class implementing StringSet concept for char* and unsigned char* strings |
| CPerfectTreeCalculations | Class to transform in-order to level-order indexes in a perfect binary tree |
| CPS5BigSortStep | PS5BigSortStep Out-of-Place Parallel Sample Sort with Separate Jobs |
| CPS5Context | Parallel Super Scalar String Sample Sort Context |
| CPS5ParametersDefault | Parallel Super Scalar String Sample Sort Parameter Struct |
| ►CPS5SmallsortJob | SampleSort: Non-Recursive In-Place Sequential Sample Sort for Small Sorts |
| CMKQSStep | |
| CSeqSampleSortStep | Stack of Recursive Sample Sort Steps |
| CPS5SortStep | PS5SortStep Top-Level Class to Keep Track of Substeps |
| CRadixStep_CE0 | |
| CRadixStep_CE2 | |
| CRadixStep_CE3 | |
| CRadixStep_CI2 | |
| CRadixStep_CI3 | |
| CSSClassifyEqualUnroll | Sample Sort Classification Tree Unrolled with Equal Comparisons |
| CSSClassifyTreeCalcUnrollInterleave | Sample Sort Classification Tree Unrolled, Interleaved, and with Perfect Tree Index Calculations |
| CSSClassifyTreeUnrollInterleave | Sample Sort Classification Tree Unrolled and Interleaved |
| CSSTreeBuilderLevelOrder | Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters |
| CSSTreeBuilderPreAndLevelOrder | Recursive TreeBuilder for full-descent and unrolled variants, constructs a both a pre-order and level-order array of splitters and the corresponding LCPs |
| CStdStringSet | Class implementing StringSet concept for arrays of std::string objects |
| CStdStringSetTraits | Class implementing StringSet concept for a std::string objects |
| CStringLcpPtr | Objectified string and LCP array pointer arrays |
| CStringPtr | Objectified string array pointer array |
| CStringSetBase | Base class for common string set functions, included via CRTP |
| CStringShadowLcpPtr | Objectified string array pointer and shadow pointer array for out-of-place swapping of pointers |
| CStringShadowPtr | Objectified string array pointer and shadow pointer array for out-of-place swapping of pointers |
| CStringSuffixSet | Class implementing StringSet concept for suffix sorting indexes of a std::string text object |
| CStringSuffixSetTraits | Class implementing StringSet concept for suffix sorting indexes of a std::string text object |
| CUPtrStdStringSet | Class implementing StringSet concept for a std::vector containing std::string objects |
| CUPtrStdStringSetTraits | Class implementing StringSet concept for a std::unique_ptr<std::string objects, which are non-copyable |
| CAggregate | Calculate running aggregate statistics: feed it with values, and it will keep the minimum, the maximum, the average, the value number, and the standard deviation is values |
| CAggregateMinMax | Calculate running aggregate statistics: feed it with values, and it will keep the minimum and the maximum values |
| CAllocatorBase | |
| ►CBTree | Basic class implementing a B+ tree data structure in memory |
| Cconst_iterator | STL-like read-only iterator object for B+ tree items |
| Cconst_reverse_iterator | STL-like read-only reverse iterator object for B+ tree items |
| CInnerNode | Extended structure of a inner node in-memory |
| Citerator | STL-like iterator object for B+ tree items |
| CLeafNode | Extended structure of a leaf node in memory |
| Cnode | The header structure of each node in-memory |
| Cresult_t | B+ tree recursive deletion has much information which is needs to be passed upward |
| Creverse_iterator | STL-like mutable reverse iterator object for B+ tree items |
| Ctree_stats | A small struct containing basic statistics about the B+ tree |
| Cvalue_compare | Function class to compare value_type objects. Required by the STL |
| Cbtree_default_traits | Generates default traits for a B+ tree used as a set or map |
| ►Cbtree_map | Specialized B+ tree template class implementing STL's map container |
| Ckey_of_value | Key Extractor Struct |
| ►Cbtree_multimap | Specialized B+ tree template class implementing STL's multimap container |
| Ckey_of_value | Key Extractor Struct |
| ►Cbtree_multiset | Specialized B+ tree template class implementing STL's multiset container |
| Ckey_of_value | Key Extractor Struct |
| ►Cbtree_set | Specialized B+ tree template class implementing STL's set container |
| Ckey_of_value | Key Extractor Struct |
| CCmdlineParser | Base class of all options and parameters |
| CCountingPtr | High-performance smart pointer used as a wrapping reference counting pointer |
| CCountingPtrDefaultDeleter | Default deleter for CountingPtr |
| CCountingPtrNoOperationDeleter | Dummy deleter for CountingPtr |
| CDAryAddressableIntHeap | This class implements an addressable integer priority queue, precisely a d-ary heap |
| CDAryHeap | This class implements a d-ary comparison-based heap usable as a priority queue |
| CDefaultLoggerOutputCErr | Default output logger to cerr |
| CDefaultLoggerOutputCOut | Default output logger to cout |
| CDelegate | |
| ►CDelegate< R(A...), Allocator > | This is a faster replacement than std::function |
| CIsConstMemberPair | Template for const class::function selector |
| CIsConstMemberPair< ConstMemberPair< C > > | Specialization for const class::function selector |
| CIsMemberPair | Template for class::function selector |
| CIsMemberPair< MemberPair< C > > | Specialization for class::function selector |
| CDieException | Exception thrown by die_with_message() if |
| Cenable_if | SFINAE enable_if – copy of std::enable_if<> with less extra cruft |
| Cenable_if< true, T > | |
| CFunctionChain | A FunctionChain is a chain of functors that can be folded to a single functors |
| CFunctionStack | A FunctionStack is a chain of functor that can be folded to a single functor (which is usually optimize by the compiler) |
| Chas_ostream_operator | SFINAE magic helper for wrap_unprintable() |
| Cindex_sequence | |
| Cis_std_array | Test if is std::array<T, N> |
| Cis_std_array< std::array< T, N > > | |
| Cis_std_pair | Test if is a std::pair<...> |
| Cis_std_pair< std::pair< S, T > > | |
| Cis_std_tuple | Test if is a std::tuple<...> |
| Cis_std_tuple< std::tuple< Ts... > > | |
| Cis_std_vector | Test if is std::vector<T> |
| Cis_std_vector< std::vector< T > > | |
| Cless_icase_asc | Case-insensitive less order relation functional class for std::map, etc |
| Cless_icase_desc | Descending case-insensitive less order relation functional class for std::map, etc |
| CLevenshteinStandardICaseParameters | Standard parameters to Levenshtein distance function |
| CLevenshteinStandardParameters | Standard parameters to levenshtein distance function |
| CLog2 | |
| CLog2< 0 > | |
| CLog2< 1 > | |
| CLog2Floor | |
| CLog2Floor< 0 > | |
| CLog2Floor< 1 > | |
| CLogger | LOG and sLOG for development and debugging |
| CLoggerCollectOutput | Class to hook logger output in the local thread |
| CLoggerFormatter | Template class for formatting. contains a print() method |
| CLoggerFormatter< AnyType > | |
| CLoggerFormatter< std::array< T, N > > | |
| CLoggerFormatter< std::deque< T, A > > | |
| CLoggerFormatter< std::map< K, V, C, A > > | |
| CLoggerFormatter< std::multimap< K, V, C, A > > | |
| CLoggerFormatter< std::multiset< T, C, A > > | |
| CLoggerFormatter< std::pair< A, B > > | |
| CLoggerFormatter< std::set< T, C, A > > | |
| CLoggerFormatter< std::tuple< Args... > > | |
| CLoggerFormatter< std::tuple<> > | |
| CLoggerFormatter< std::unordered_map< K, V, H, E, A > > | |
| CLoggerFormatter< std::unordered_multimap< K, V, H, E, A > > | |
| CLoggerFormatter< std::unordered_multiset< T, H, E, A > > | |
| CLoggerFormatter< std::unordered_set< T, H, E, A > > | |
| CLoggerFormatter< std::vector< T, A > > | |
| CLoggerOutputHook | Abstract class to implement output hooks for logging |
| CLoggerPrefixHook | Abstract class to implement prefix output hooks for logging |
| CLoggerTupleFormatter | |
| CLoggerVoidify | |
| CLoserTreeCopy | Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index |
| CLoserTreeCopy< true, ValueType, Comparator > | Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index |
| ►CLoserTreeCopyBase | Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index |
| CLoser | Internal representation of a loser tree player/node |
| CLoserTreeCopyUnguarded | |
| CLoserTreeCopyUnguarded< true, ValueType, Comparator > | |
| ►CLoserTreeCopyUnguardedBase | Unguarded loser tree, copying the whole element into the tree structure |
| CLoser | Internal representation of a loser tree player/node |
| CLoserTreePointer | Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes |
| CLoserTreePointer< true, ValueType, Comparator > | Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes |
| ►CLoserTreePointerBase | Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes |
| CLoser | Internal representation of a loser tree player/node |
| CLoserTreePointerUnguarded | |
| CLoserTreePointerUnguarded< true, ValueType, Comparator > | |
| ►CLoserTreePointerUnguardedBase | Unguarded loser tree, keeping only pointers to the elements in the tree structure |
| CLoser | Internal representation of a loser tree player/node |
| CLoserTreeSwitch | |
| CLruCacheMap | This is an expected O(1) LRU cache which contains a map of (key -> value) elements |
| CLruCacheSet | This is an expected O(1) LRU cache which contains a set of key-only elements |
| Cmake_index_sequence | |
| CMD5 | MD-5 processor without external dependencies |
| ►CMultiTimer | MultiTimer can be used to measure time usage of different phases in a program or algorithm |
| CEntry | |
| CNoOperation | The noop functor, which takes any arguments and does nothing |
| CNoOperation< void > | Specialized noop functor which returns a void |
| ►CPolynomialRegression | Calculate the regression polynomial \( a_0+a_1x^1+a_2x^2+\cdots+a_nx^n \) from a list of 2D points |
| CCoefficients | Polynomial stored as the coefficients of \( a_0+a_1 x^1+a_2 x^2+\cdots+a_n x^n \) |
| CPoint | 2D point |
| CRadixHeap | This class implements a monotonic integer min priority queue, more specific a multi-level radix heap |
| CReferenceCounter | Provides reference counting abilities for use with CountingPtr |
| CRingBuffer | A ring (circular) buffer of static (non-growing) size |
| CScopedMultiTimer | Independent RAII Scoped MultiTimer: contains a MultiTimer which is started with the given timer, and added to the base MultiTimer on destruction |
| CScopedMultiTimerSwitch | RAII Scoped MultiTimer switcher: switches the timer of a MultiTimer on construction and back to old one on destruction |
| CSemaphore | A simple semaphore implementation using C++11 synchronization methods |
| CSHA1 | SHA-1 processor without external dependencies |
| CSHA256 | SHA-256 processor without external dependencies |
| CSHA512 | SHA-512 processor without external dependencies |
| CSimpleVector | Simpler non-growing vector without initialization |
| CSpacingLogger | A logging class which outputs spaces between elements pushed via operator<< |
| ►CSplayTree | |
| CNode | Splay tree node, also seen as public iterator |
| ►CStackAllocator | |
| Crebind | Required rebind |
| ►CStackArena | Storage area allocated on the stack and usable by a StackAllocator |
| CAlignmentHelper | Union to enforce alignment of buffer area |
| CStaticIndex | Helper for call_foreach_with_index() to save the index as a compile-time index |
| CStringView | StringView is a reference to a part of a string, consisting of only a char pointer and a length |
| CThreadBarrierMutex | Implements a thread barrier using mutex locking and condition variables that can be used to synchronize threads |
| CThreadBarrierSpin | Implements a thread barrier using atomics and a spin lock that can be used to synchronize threads |
| CThreadPool | ThreadPool starts a fixed number p of std::threads which process Jobs that are enqueued into a concurrent job queue |
1.8.11 
