| Coriginal::algorithms | Utility class containing generic container algorithms |
| Coriginal::allocatorBase< TYPE, DERIVED > | Interface for other memory allocator implementations |
| ►Coriginal::allocatorBase< bool, allocator > | |
| Coriginal::allocator< bool > | |
| ►Coriginal::allocatorBase< K_TYPE, allocator > | |
| Coriginal::allocator< K_TYPE > | |
| ►Coriginal::allocatorBase< opts, allocator > | |
| Coriginal::allocator< opts > | |
| ►Coriginal::allocatorBase< original::skipList::skipListNode *, allocator > | |
| Coriginal::allocator< original::skipList::skipListNode * > | |
| ►Coriginal::allocatorBase< TYPE, allocator > | |
| Coriginal::allocator< TYPE > | Default memory allocator using allocators utilities |
| ►Coriginal::allocatorBase< TYPE, objPoolAllocator > | |
| Coriginal::objPoolAllocator< TYPE > | Object pool allocator for efficient fixed-size memory management |
| Coriginal::allocators | Utility class providing static memory allocation/de-allocation functions |
| Coriginal::baseCloneable< DERIVED > | Base class that defines a cloneable interface |
| ►Coriginal::baseCloneable< cloneable > | |
| ►Coriginal::cloneable | Concrete cloneable class with custom cloning behavior |
| ►Coriginal::iterator< couple< const K_TYPE, V_TYPE > > | |
| ►Coriginal::baseIterator< couple< const K_TYPE, V_TYPE > > | |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC >::Iterator | Forward iterator for JMap |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC >::Iterator | Bidirectional iterator for hashMap |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC >::Iterator | Bidirectional iterator for treeMap |
| ►Coriginal::iterator< bool > | |
| ►Coriginal::baseIterator< bool > | |
| Coriginal::bitSet< ALLOC >::Iterator | An iterator for traversing the bits in a bitSet |
| ►Coriginal::filter< TYPE > | Base class for filter operations |
| Coriginal::equalFilter< TYPE > | A filter that checks if an element is equal to a target value |
| Coriginal::greaterFilter< TYPE > | A filter that checks if an element is greater than a target value |
| Coriginal::lessFilter< TYPE > | A filter that checks if an element is less than a target value |
| Coriginal::notEqualFilter< TYPE > | A filter that checks if an element is not equal to a target value |
| Coriginal::notGreaterFilter< TYPE > | A filter that checks if an element is less than or equal to a target value |
| Coriginal::notLessFilter< TYPE > | A filter that checks if an element is greater than or equal to a target value |
| Coriginal::rangeFilter< TYPE > | A filter that checks if an element lies within a specified range |
| ►Coriginal::iterator< TYPE > | Base iterator interface that supports common operations for iteration |
| Coriginal::baseIterator< couple< const K_TYPE, V_TYPE > > | |
| ►Coriginal::baseIterator< const TYPE > | |
| Coriginal::JSet< TYPE, Compare, ALLOC >::Iterator | Forward iterator for JSet |
| Coriginal::hashSet< TYPE, HASH, ALLOC >::Iterator | Forward iterator for hashSet |
| Coriginal::treeSet< TYPE, Compare, ALLOC >::Iterator | Bidirectional iterator for treeSet |
| Coriginal::baseIterator< const TYPE > | |
| Coriginal::baseIterator< bool > | |
| ►Coriginal::baseIterator< TYPE > | A base class for basic iterators |
| Coriginal::blocksList< TYPE, ALLOC >::Iterator | Iterator for blocksList, supports forward and backward iteration |
| ►Coriginal::randomAccessIterator< TYPE, ALLOC > | Abstract base class for random-access iterators |
| Coriginal::array< TYPE, ALLOC >::Iterator | Iterator for the array class that supports random access |
| Coriginal::vector< TYPE, ALLOC >::Iterator | Random access iterator implementation for vector |
| ►Coriginal::stepIterator< TYPE > | Abstract base class for step iterators |
| ►Coriginal::doubleDirectionIterator< TYPE > | Abstract base class for double-direction iterators |
| Coriginal::chain< TYPE, ALLOC >::Iterator | Bidirectional iterator implementation for chain |
| ►Coriginal::singleDirectionIterator< TYPE > | Abstract base class for single-direction iterators |
| Coriginal::forwardChain< TYPE, ALLOC >::Iterator | Iterator for forwardChain, supports single-direction traversal |
| Coriginal::baseIterator< TYPE > | A base class for basic iterators |
| Coriginal::iterable< TYPE >::iterAdaptor | RAII wrapper for base iterators that provides standard iteration interface |
| ►Coriginal::transform< TYPE > | Base class for transformation operations |
| Coriginal::absTransform< TYPE > | Transformation that converts an element to its absolute value |
| Coriginal::addOptTransform< TYPE > | Transformation that adds a given value to an element |
| Coriginal::assignOptTransform< TYPE > | Transformation that assigns a specified value to an element |
| Coriginal::copyTransform< TYPE, ALLOC > | Transformation that copies an element into a container |
| Coriginal::multiOptTransform< TYPE > | Transformation that multiplies an element by a given value |
| Coriginal::callBackChecker | Static utility for validating callback signatures |
| Coriginal::comparable< DERIVED > | Base class for comparable objects |
| ►Coriginal::comparable< autoPtr< TYPE, DERIVED, DELETER > > | |
| ►Coriginal::autoPtr< TYPE, DERIVED, DELETER > | Base smart pointer with reference counting |
| Coriginal::ownerPtr< TYPE, DELETER > | Unique ownership smart pointer with move semantics |
| Coriginal::refCntPtr< TYPE, DERIVED, DELETER > | Base class for reference-counted pointers |
| ►Coriginal::comparable< autoPtr< TYPE, ownerPtr< TYPE, deleter< TYPE > >, deleter< TYPE > > > | |
| Coriginal::autoPtr< TYPE, ownerPtr< TYPE, deleter< TYPE > >, deleter< TYPE > > | |
| ►Coriginal::comparable< autoPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > > | |
| ►Coriginal::autoPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > | |
| ►Coriginal::refCntPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > | |
| Coriginal::strongPtr< original::filter< TYPE > > | |
| Coriginal::strongPtr< TYPE, DELETER > | Shared ownership smart pointer with strong references |
| ►Coriginal::comparable< autoPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > > | |
| ►Coriginal::autoPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > | |
| ►Coriginal::refCntPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > | |
| Coriginal::weakPtr< TYPE, DELETER > | Non-owning reference to shared resource |
| ►Coriginal::comparable< containerAdapter< TYPE, blocksList, allocator > > | |
| ►Coriginal::containerAdapter< TYPE, blocksList, allocator > | |
| Coriginal::prique< TYPE, Callback, SERIAL, ALLOC > | Heap-based priority queue container |
| ►Coriginal::comparable< containerAdapter< TYPE, chain, allocator > > | |
| ►Coriginal::containerAdapter< TYPE, chain, allocator > | |
| Coriginal::deque< TYPE, SERIAL, ALLOC > | Double-ended queue container adapter |
| Coriginal::queue< TYPE, SERIAL, ALLOC > | First-In-First-Out (FIFO) container adapter |
| Coriginal::stack< TYPE, SERIAL, ALLOC > | Last-In-First-Out (LIFO) container adapter |
| ►Coriginal::comparable< containerAdapter< TYPE, SERIAL, ALLOC > > | |
| Coriginal::containerAdapter< TYPE, SERIAL, ALLOC > | Adapter class that provides unified interface for various container types |
| ►Coriginal::comparable< couple< const K_TYPE, V_TYPE > > | |
| Coriginal::couple< const K_TYPE, V_TYPE > | |
| ►Coriginal::comparable< couple< F_TYPE, S_TYPE > > | |
| Coriginal::couple< F_TYPE, S_TYPE > | Container for two heterogeneous elements |
| ►Coriginal::comparable< iterationStream< bool, bitSet< allocator< bool > > > > | |
| Coriginal::iterationStream< bool, bitSet< allocator< bool > > > | |
| ►Coriginal::comparable< iterationStream< opts, chain< opts, allocator< opts > > > > | |
| Coriginal::iterationStream< opts, chain< opts, allocator< opts > > > | |
| ►Coriginal::comparable< iterationStream< original::hashTable::hashNode *, vector< original::hashTable::hashNode *, rebind_alloc_pointer > > > | |
| ►Coriginal::iterationStream< original::hashTable::hashNode *, vector< original::hashTable::hashNode *, rebind_alloc_pointer > > | |
| Coriginal::vector< original::hashTable::hashNode *, rebind_alloc_pointer > | |
| ►Coriginal::comparable< iterationStream< original::skipList::skipListNode *, vector< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > > > | |
| Coriginal::iterationStream< original::skipList::skipListNode *, vector< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > > | |
| ►Coriginal::comparable< iterationStream< TYPE, array< TYPE, allocator< TYPE > > > > | |
| Coriginal::iterationStream< TYPE, array< TYPE, allocator< TYPE > > > | |
| ►Coriginal::comparable< iterationStream< TYPE, blocksList< TYPE, allocator< TYPE > > > > | |
| ►Coriginal::iterationStream< TYPE, blocksList< TYPE, allocator< TYPE > > > | |
| Coriginal::blocksList< TYPE, allocator< TYPE > > | |
| ►Coriginal::comparable< iterationStream< TYPE, chain< TYPE, allocator< TYPE > > > > | |
| ►Coriginal::iterationStream< TYPE, chain< TYPE, allocator< TYPE > > > | |
| Coriginal::chain< TYPE, allocator< TYPE > > | |
| ►Coriginal::comparable< iterationStream< TYPE, DERIVED > > | |
| ►Coriginal::iterationStream< TYPE, DERIVED > | A stream class that allows iteration, comparison, and printing |
| Coriginal::chain< original::strongPtr< original::filter< TYPE > > > | |
| Coriginal::chain< opts > | |
| Coriginal::chain< original::strongPtr< original::transform< TYPE > > > | |
| Coriginal::vector< hashNode *, rebind_alloc_pointer > | |
| Coriginal::vector< TYPE * > | |
| Coriginal::vector< original::skipList::skipListNode * > | |
| Coriginal::array< TYPE, ALLOC > | A fixed-size array container with random access |
| Coriginal::bitSet< ALLOC > | A class representing a set of bits, offering functionality to manipulate and query individual bits |
| Coriginal::blocksList< TYPE, ALLOC > | A block-based list implementation |
| Coriginal::chain< TYPE, ALLOC > | Non-cyclic doubly linked list container |
| Coriginal::forwardChain< TYPE, ALLOC > | A singly linked list implementation |
| Coriginal::vector< TYPE, ALLOC > | Dynamic array container with amortized constant time operations |
| ►Coriginal::comparable< iterationStream< TYPE, forwardChain< TYPE, allocator< TYPE > > > > | |
| Coriginal::iterationStream< TYPE, forwardChain< TYPE, allocator< TYPE > > > | |
| ►Coriginal::comparable< iterationStream< TYPE, vector< TYPE, allocator< TYPE > > > > | |
| Coriginal::iterationStream< TYPE, vector< TYPE, allocator< TYPE > > > | |
| ►Coriginal::comparable< iterationStream< underlying_type, array< underlying_type, rebind_alloc_underlying > > > | |
| ►Coriginal::iterationStream< underlying_type, array< underlying_type, rebind_alloc_underlying > > | |
| Coriginal::array< underlying_type, rebind_alloc_underlying > | |
| ►Coriginal::comparable< iterator< bool > > | |
| Coriginal::iterator< bool > | |
| ►Coriginal::comparable< iterator< couple< const K_TYPE, V_TYPE > > > | |
| Coriginal::iterator< couple< const K_TYPE, V_TYPE > > | |
| ►Coriginal::comparable< iterator< TYPE > > | |
| Coriginal::iterator< TYPE > | Base iterator interface that supports common operations for iteration |
| ►Coriginal::comparable< tuple< TYPES... > > | |
| Coriginal::tuple< TYPES > | Container for multiple heterogeneous elements |
| Coriginal::comparable< tupleImpl< I, T > > | |
| Coriginal::comparable< tupleImpl< I, T, TS > > | |
| Coriginal::comparable< tupleImpl< I, T, TS... > > | |
| ►Coriginal::comparator< TYPE > | Base class for comparison |
| Coriginal::decreaseComparator< TYPE > | Comparator for decreasing comparison (greater than) |
| Coriginal::decreaseNotStrictComparator< TYPE > | Comparator for non-strict decreasing comparison (greater than or equal to) |
| Coriginal::equalComparator< TYPE > | Comparator for equality comparison |
| Coriginal::increaseComparator< TYPE > | Comparator for increasing comparison (less than) |
| Coriginal::increaseNotStrictComparator< TYPE > | Comparator for non-strict increasing comparison (less than or equal to) |
| Coriginal::notEqualComparator< TYPE > | Comparator for inequality comparison |
| ►Coriginal::comparator< K_TYPE > | |
| Coriginal::increaseComparator< K_TYPE > | |
| ►Coriginal::container< TYPE, ALLOC > | Abstract base class for containers |
| ►Coriginal::serial< TYPE, ALLOC > | Abstract base class for sequential containers with index-based access |
| ►Coriginal::baseArray< TYPE, ALLOC > | Base class for fixed-size serial containers |
| Coriginal::array< TYPE, ALLOC > | A fixed-size array container with random access |
| Coriginal::bitSet< ALLOC > | A class representing a set of bits, offering functionality to manipulate and query individual bits |
| ►Coriginal::baseList< TYPE, ALLOC > | Base class for variable-size serial containers |
| Coriginal::chain< original::strongPtr< original::filter< TYPE > > > | |
| Coriginal::chain< opts > | |
| Coriginal::chain< original::strongPtr< original::transform< TYPE > > > | |
| Coriginal::vector< hashNode *, rebind_alloc_pointer > | |
| Coriginal::vector< TYPE * > | |
| Coriginal::vector< original::skipList::skipListNode * > | |
| Coriginal::blocksList< TYPE, ALLOC > | A block-based list implementation |
| Coriginal::chain< TYPE, ALLOC > | Non-cyclic doubly linked list container |
| Coriginal::forwardChain< TYPE, ALLOC > | A singly linked list implementation |
| Coriginal::vector< TYPE, ALLOC > | Dynamic array container with amortized constant time operations |
| Coriginal::set< K_TYPE, ALLOC > | Abstract base class for unique element containers |
| ►Coriginal::container< bool, allocator< bool > > | |
| ►Coriginal::serial< bool, allocator< bool > > | |
| Coriginal::baseArray< bool, allocator< bool > > | |
| ►Ccontainer< couple< const K_TYPE, V_TYPE >, allocator< couple< const K_TYPE, V_TYPE > > > | |
| Coriginal::map< K_TYPE, V_TYPE, ALLOC > | Abstract base class for key-value mapping containers |
| Coriginal::container< K_TYPE, allocator< K_TYPE > > | |
| ►Coriginal::container< opts, allocator< opts > > | |
| ►Coriginal::serial< opts, allocator< opts > > | |
| Coriginal::baseList< opts, allocator< opts > > | |
| ►Coriginal::container< original::hashTable::hashNode *, rebind_alloc_pointer > | |
| ►Coriginal::serial< original::hashTable::hashNode *, rebind_alloc_pointer > | |
| ►Coriginal::baseList< original::hashTable::hashNode *, rebind_alloc_pointer > | |
| Coriginal::vector< original::hashTable::hashNode *, rebind_alloc_pointer > | |
| ►Coriginal::container< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > | |
| ►Coriginal::serial< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > | |
| Coriginal::baseList< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > | |
| ►Coriginal::container< TYPE, ALLOC< TYPE > > | |
| Coriginal::containerAdapter< TYPE, SERIAL, ALLOC > | Adapter class that provides unified interface for various container types |
| ►Coriginal::container< TYPE, allocator< TYPE > > | |
| Coriginal::containerAdapter< TYPE, chain, allocator > | |
| Coriginal::containerAdapter< TYPE, blocksList, allocator > | |
| ►Coriginal::serial< TYPE, allocator< TYPE > > | |
| Coriginal::baseArray< TYPE, allocator< TYPE > > | |
| ►Coriginal::baseList< TYPE, allocator< TYPE > > | |
| Coriginal::blocksList< TYPE, allocator< TYPE > > | |
| Coriginal::chain< TYPE, allocator< TYPE > > | |
| ►Coriginal::container< underlying_type, rebind_alloc_underlying > | |
| ►Coriginal::serial< underlying_type, rebind_alloc_underlying > | |
| ►Coriginal::baseArray< underlying_type, rebind_alloc_underlying > | |
| Coriginal::array< underlying_type, rebind_alloc_underlying > | |
| ►Coriginal::deleterBase< TYPE > | Base class for deleters defining the deletion policy interface |
| Coriginal::deleter< TYPE[]> | |
| Coriginal::deleter< TYPE > | Default deletion policy for single objects |
| ►Coriginal::deleterBase< TYPE[]> | Base class for array deleters |
| Coriginal::deleter< TYPE[]> | |
| ►Cstd::exception | |
| ►Coriginal::error | Base interface for all exception types in Original |
| Coriginal::allocateError | Exception for memory allocation failures |
| Coriginal::callbackReturnTypeError | Exception for callback return type mismatch |
| Coriginal::callbackSignatureError | Exception for callback argument mismatch |
| Coriginal::noElementError | Exception for missing element requests |
| Coriginal::nullPointerError | Exception for null pointer dereference attempts |
| Coriginal::outOfBoundError | Exception for container index out-of-range errors |
| Coriginal::sysError | |
| Coriginal::unSupportedMethodError | Exception for unimplemented method calls |
| Coriginal::valueError | Exception for invalid parameter values |
| Coriginal::filterStream< TYPE > | Composite filter builder with logical operator chaining |
| Cstd::formatter< T > | Std::formatter specialization for printable types |
| Coriginal::hash< TYPE > | Forward declaration of hash class template |
| Coriginal::hash< K_TYPE > | |
| Coriginal::hashable< DERIVED > | Forward declaration of hashable interface template |
| ►Coriginal::hashable< autoPtr< TYPE, DERIVED, DELETER > > | |
| Coriginal::autoPtr< TYPE, DERIVED, DELETER > | Base smart pointer with reference counting |
| ►Coriginal::hashable< autoPtr< TYPE, ownerPtr< TYPE, deleter< TYPE > >, deleter< TYPE > > > | |
| Coriginal::autoPtr< TYPE, ownerPtr< TYPE, deleter< TYPE > >, deleter< TYPE > > | |
| ►Coriginal::hashable< autoPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > > | |
| Coriginal::autoPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > | |
| ►Coriginal::hashable< autoPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > > | |
| Coriginal::autoPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > | |
| Coriginal::hashTable< K_TYPE, V_TYPE, ALLOC, HASH > | Hash table implementation with separate chaining |
| ►ChashTable< K_TYPE, V_TYPE, allocator< couple< const K_TYPE, V_TYPE > >, hash< K_TYPE > > | |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC > | Hash table based implementation of the map interface |
| ►ChashTable< TYPE, const bool, allocator< couple< const TYPE, const bool > >, hash< TYPE > > | |
| Coriginal::hashSet< TYPE, HASH, ALLOC > | Hash table based implementation of the set interface |
| ►Cstd::integral_constant | |
| Cstd::tuple_size< original::couple< F, S > > | Specialization of tuple_size for couple to enable structured bindings |
| Cstd::tuple_size< original::tuple< TYPES... > > | Specialization of tuple_size for tuple to enable structured bindings |
| ►Coriginal::iterable< TYPE > | A base class for iterable containers that support multiple iteration patterns |
| Coriginal::iterationStream< TYPE, array< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, blocksList< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, chain< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, forwardChain< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, vector< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, DERIVED > | A stream class that allows iteration, comparison, and printing |
| ►Coriginal::iterable< bool > | |
| Coriginal::iterationStream< bool, bitSet< allocator< bool > > > | |
| ►Coriginal::iterable< const TYPE > | |
| Coriginal::JSet< TYPE, Compare, ALLOC > | Skip List based implementation of the set interface |
| Coriginal::hashSet< TYPE, HASH, ALLOC > | Hash table based implementation of the set interface |
| Coriginal::treeSet< TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the set interface |
| ►Coriginal::iterable< couple< const K_TYPE, V_TYPE > > | |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC > | Skip List based implementation of the map interface |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC > | Hash table based implementation of the map interface |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the map interface |
| ►Coriginal::iterable< opts > | |
| Coriginal::iterationStream< opts, chain< opts, allocator< opts > > > | |
| ►Coriginal::iterable< original::hashTable::hashNode * > | |
| Coriginal::iterationStream< original::hashTable::hashNode *, vector< original::hashTable::hashNode *, rebind_alloc_pointer > > | |
| ►Coriginal::iterable< original::skipList::skipListNode * > | |
| Coriginal::iterationStream< original::skipList::skipListNode *, vector< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > > | |
| ►Coriginal::iterable< underlying_type > | |
| Coriginal::iterationStream< underlying_type, array< underlying_type, rebind_alloc_underlying > > | |
| ►Coriginal::hashTable< K_TYPE, V_TYPE, ALLOC, HASH >::Iterator | Forward iterator for hashTable |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC >::Iterator | Bidirectional iterator for hashMap |
| Coriginal::hashSet< TYPE, HASH, ALLOC >::Iterator | Forward iterator for hashSet |
| Coriginal::RBTree< K_TYPE, V_TYPE, ALLOC, Compare >::Iterator | Bidirectional iterator for RBTree |
| ►Coriginal::RBTree< K_TYPE, V_TYPE, ALLOC, Compare >::Iterator | |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC >::Iterator | Bidirectional iterator for treeMap |
| ►Coriginal::RBTree< TYPE, const bool, ALLOC, Compare >::Iterator | |
| Coriginal::treeSet< TYPE, Compare, ALLOC >::Iterator | Bidirectional iterator for treeSet |
| Coriginal::skipList< K_TYPE, V_TYPE, ALLOC, Compare >::Iterator | Forward iterator for skipList |
| ►Coriginal::skipList< const K_TYPE, V_TYPE, ALLOC, Compare >::Iterator | |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC >::Iterator | Forward iterator for JMap |
| ►Coriginal::skipList< const TYPE, const bool, ALLOC, Compare >::Iterator | |
| Coriginal::JSet< TYPE, Compare, ALLOC >::Iterator | Forward iterator for JSet |
| ►Cmap< K_TYPE, V_TYPE, allocator< couple< const K_TYPE, V_TYPE > > > | |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC > | Skip List based implementation of the map interface |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC > | Hash table based implementation of the map interface |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the map interface |
| ►Coriginal::printable | Base class providing polymorphic string conversion capabilities |
| Coriginal::autoPtr< TYPE, ownerPtr< TYPE, deleter< TYPE > >, deleter< TYPE > > | |
| Coriginal::autoPtr< TYPE, strongPtr< TYPE, DELETER >, DELETER > | |
| Coriginal::autoPtr< TYPE, weakPtr< TYPE, DELETER >, DELETER > | |
| Coriginal::containerAdapter< TYPE, chain, allocator > | |
| Coriginal::containerAdapter< TYPE, blocksList, allocator > | |
| Coriginal::couple< const K_TYPE, V_TYPE > | |
| Coriginal::iterationStream< TYPE, array< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< bool, bitSet< allocator< bool > > > | |
| Coriginal::iterationStream< TYPE, blocksList< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, chain< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, forwardChain< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< TYPE, vector< TYPE, allocator< TYPE > > > | |
| Coriginal::iterationStream< underlying_type, array< underlying_type, rebind_alloc_underlying > > | |
| Coriginal::iterationStream< opts, chain< opts, allocator< opts > > > | |
| Coriginal::iterationStream< original::hashTable::hashNode *, vector< original::hashTable::hashNode *, rebind_alloc_pointer > > | |
| Coriginal::iterationStream< original::skipList::skipListNode *, vector< original::skipList::skipListNode *, allocator< original::skipList::skipListNode * > > > | |
| Coriginal::iterator< couple< const K_TYPE, V_TYPE > > | |
| Coriginal::iterator< bool > | |
| ►Coriginal::wrapper< couple< const K_TYPE, V_TYPE > > | |
| Coriginal::hashTable< K_TYPE, V_TYPE, ALLOC, HASH >::hashNode | Internal node type for hash table storage |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC > | Skip List based implementation of the map interface |
| Coriginal::JSet< TYPE, Compare, ALLOC > | Skip List based implementation of the set interface |
| Coriginal::autoPtr< TYPE, DERIVED, DELETER > | Base smart pointer with reference counting |
| Coriginal::containerAdapter< TYPE, SERIAL, ALLOC > | Adapter class that provides unified interface for various container types |
| Coriginal::couple< F_TYPE, S_TYPE > | Container for two heterogeneous elements |
| Coriginal::hashMap< K_TYPE, V_TYPE, HASH, ALLOC > | Hash table based implementation of the map interface |
| Coriginal::hashSet< TYPE, HASH, ALLOC > | Hash table based implementation of the set interface |
| Coriginal::iterationStream< TYPE, DERIVED > | A stream class that allows iteration, comparison, and printing |
| Coriginal::iterator< TYPE > | Base iterator interface that supports common operations for iteration |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the map interface |
| Coriginal::treeSet< TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the set interface |
| Coriginal::tuple< TYPES > | Container for multiple heterogeneous elements |
| Coriginal::wrapper< TYPE > | Base class for linked value containers with formatted output |
| Coriginal::RBTree< K_TYPE, V_TYPE, ALLOC, Compare >::RBNode | Internal node class for Red-Black Tree |
| Coriginal::RBTree< K_TYPE, V_TYPE, ALLOC, Compare > | Red-Black Tree container implementation |
| Coriginal::RBTree< K_TYPE, V_TYPE, ALLOC, Compare > | |
| ►CRBTree< K_TYPE, V_TYPE, allocator< couple< const K_TYPE, V_TYPE > >, increaseComparator< K_TYPE > > | |
| Coriginal::treeMap< K_TYPE, V_TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the map interface |
| Coriginal::RBTree< TYPE, const bool, ALLOC, Compare > | |
| ►CRBTree< TYPE, const bool, allocator< couple< const TYPE, const bool > >, increaseComparator< TYPE > > | |
| Coriginal::treeSet< TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the set interface |
| Coriginal::refCount< TYPE, DELETER > | Reference counting metadata container |
| Coriginal::refCount< TYPE, deleter< TYPE > > | |
| ►Cset< TYPE, allocator< couple< const TYPE, const bool > > > | |
| Coriginal::JSet< TYPE, Compare, ALLOC > | Skip List based implementation of the set interface |
| Coriginal::hashSet< TYPE, HASH, ALLOC > | Hash table based implementation of the set interface |
| Coriginal::treeSet< TYPE, Compare, ALLOC > | Red-Black Tree based implementation of the set interface |
| Coriginal::skipList< K_TYPE, V_TYPE, ALLOC, Compare > | Skip List container implementation |
| Coriginal::skipList< const K_TYPE, V_TYPE, ALLOC, Compare > | |
| ►CskipList< const K_TYPE, V_TYPE, allocator< couple< const K_TYPE, V_TYPE > >, increaseComparator< K_TYPE > > | |
| Coriginal::JMap< K_TYPE, V_TYPE, Compare, ALLOC > | Skip List based implementation of the map interface |
| Coriginal::skipList< const TYPE, const bool, ALLOC, Compare > | |
| ►CskipList< const TYPE, const bool, allocator< couple< const TYPE, const bool > >, increaseComparator< TYPE > > | |
| Coriginal::JSet< TYPE, Compare, ALLOC > | Skip List based implementation of the set interface |
| Coriginal::skipList< K_TYPE, V_TYPE, ALLOC, Compare >::skipListNode | Internal node class for Skip List |
| Coriginal::staticError< ERR, TRIGGERING_CONDITION > | Compile-time error assertion utility |
| Coriginal::staticError< original::allocateError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::callbackReturnTypeError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::callbackSignatureError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::error, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::noElementError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::nullPointerError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::outOfBoundError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::unSupportedMethodError, TRIGGERING_CONDITION > | |
| Coriginal::staticError< original::valueError, TRIGGERING_CONDITION > | |
| Coriginal::thread | High-level thread wrapper |
| ►Coriginal::threadBase | Base class for thread implementations |
| Coriginal::pThread | POSIX thread implementation |
| Coriginal::threadBase::threadData< Callback > | Wrapper for thread execution data |
| Coriginal::transformStream< TYPE > | Ordered sequence of transformation operations |
| Cstd::tuple_element< I, original::couple< F, S > > | Specialization of tuple_element for couple to enable structured bindings |
| Cstd::tuple_element< I, original::tuple< TYPES... > > | Specialization of tuple_element for tuple to enable structured bindings |
1.13.1