#include <StormByte/size.hxx>
#include <StormByte/safe/exception.hxx>
#include <StormByte/safe/hash.hxx>
#include <StormByte/safe/heap.hxx>
#include <StormByte/safe/pair.hxx>
#include <StormByte/type_traits.hxx>
#include <StormByte/visibility.h>
#include <cstddef>
#include <functional>
#include <initializer_list>
#include <iterator>
#include <limits>
#include <ranges>
#include <unordered_map>
#include <utility>
#include <StormByte/safe/unordered_map.txx>
#include <StormByte/safe/string.hxx>
Go to the source code of this file.
|
| class | StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual > |
| | Unique-key hash map stored on Base's heap. More...
|
| class | StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::BasicIterator< IsConst > |
| | Forward cursor over Base-owned hash nodes. More...
|
| class | StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::node_type |
| | Owning handle to one extracted Base node. More...
|
| struct | StormByte::Safe::UnorderedMap< K, V, Hash, KeyEqual >::insert_return_type |
| | Result of inserting an extracted node. More...
|
| struct | StormByte::Type::IsSafe< Safe::UnorderedMap< K, V, Hash, KeyEqual > > |
| | A map of Safe entries is Safe. More...
|
| struct | StormByte::Type::IsMaybeSafe< Safe::UnorderedMap< K, V, Hash, KeyEqual > > |
| | Propagates conditional safety from a map entry. More...
|
| struct | StormByte::Type::IsSafeValue< Safe::UnorderedMap< K, V, Hash, KeyEqual > > |
| | Admits a Safe unordered map as a collection value. More...
|
|
| template<Type::SafeValue K, Type::SafeValue V, class Hash, class KeyEqual> |
| void | StormByte::Safe::swap (UnorderedMap< K, V, Hash, KeyEqual > &left, UnorderedMap< K, V, Hash, KeyEqual > &right) noexcept |
| | Exchange two maps.
|