Classes | |
class | Array |
class | DoublyLinkedList |
class | LinkedList |
class | SkipList |
class | STLContainerWrapper |
Functions | |
template<typename T > | |
nonvirtual ForwardIterator & | operator++ () noexcept |
nonvirtual size_t | CurrentIndex (const DoublyLinkedList *data) const |
constexpr void | AssertDataMatches (const DoublyLinkedList *data) const |
template<typename T > | |
nonvirtual size_t | CurrentIndex (const LinkedList *data) const |
constexpr void | AssertDataMatches (const LinkedList *data) const |
LinkedList<T,TRAITS> is a backend implementation. It is not intended to be directly
used by programmers, except in implementing concrete container reps.
TODO:
|
noexcept |
Just an implementation detail. Don't use directly except in helper classes. dont use block allocation for link sizes too large
nonvirtual size_t Stroika::Foundation::Containers::DataStructures::CurrentIndex | ( | const DoublyLinkedList * | data | ) | const |
|
constexpr |
For debugging, assert the iterator data matches argument data
nonvirtual size_t Stroika::Foundation::Containers::DataStructures::CurrentIndex | ( | const LinkedList * | data | ) | const |
dont use block allocation for link sizes too large
|
constexpr |
For debugging, assert the iterator data matches argument data