#include <StormByte/size.hxx>#include <StormByte/safe/heap.hxx>#include <StormByte/type_traits.hxx>#include <StormByte/visibility.h>#include <compare>#include <cstddef>#include <deque>#include <initializer_list>#include <iterator>#include <limits>#include <utility>#include <StormByte/safe/deque.txx>
Go to the source code of this file.
Classes | |
| class | StormByte::Safe::Deque< T > |
| Double-ended sequence stored on Base's heap. More... | |
Namespaces | |
| namespace | StormByte |
| Root namespace of the StormByte suite. | |
| namespace | StormByte::Safe |
| Owned values that cross a DLL without the caller's CRT. | |
Functions | |
| void | StormByte::Safe::ThrowDequeOutOfBounds () |
| Throw the deque out-of-bounds error from Base. | |
| void | StormByte::Safe::ThrowDequeOutOfBounds (const Size &index) |
| template<Type::SafeValue T> | |
| bool | StormByte::Safe::operator== (const Deque< T > &left, const Deque< T > &right) |
| Whether two deques contain equal elements. | |
| template<Type::SafeValue T> | |
| STORMBYTE_FORCE_INLINE std::strong_ordering | StormByte::Safe::operator<=> (const Deque< T > &left, const Deque< T > &right) |
| Order two deques lexicographically. | |
| template<Type::SafeValue T> | |
| void | StormByte::Safe::swap (Deque< T > &left, Deque< T > &right) noexcept |
| Exchange two deques. | |