#include <CeresEngine/Foundation/Container/FlatHashMap.hpp>
|
| | FlatHashMap () |
| |
| V & | operator[] (const K &key) |
| |
| V & | operator[] (K &&key) |
| |
| V & | at (const K &key) |
| |
| const V & | at (const K &key) const |
| |
| Pair< typename Table::iterator, bool > | emplace () |
| |
| template<typename M > |
| Pair< typename Table::iterator, bool > | insert_or_assign (const key_type &key, M &&m) |
| |
| template<typename M > |
| Pair< typename Table::iterator, bool > | insert_or_assign (key_type &&key, M &&m) |
| |
| template<typename M > |
| Table::iterator | insert_or_assign (typename Table::const_iterator, const key_type &key, M &&m) |
| |
| template<typename M > |
| Table::iterator | insert_or_assign (typename Table::const_iterator, key_type &&key, M &&m) |
| |
| template<typename Key , typename... Args> |
| Pair< iterator, bool > | emplace (Key &&key, Args &&... args) |
| |
|
| using | Table = detailv3::SherwoodV3Table< Pair< K, V >, K, H, detailv3::KeyOrValueHasher< K, Pair< K, V >, H >, E, detailv3::KeyOrValueEquality< K, Pair< K, V >, E >, A, typename std::allocator_traits< A >::template rebind_alloc< detailv3::SherwoodV3Entry< Pair< K, V > > > > |
| |
◆ key_type
◆ mapped_type
◆ Table
| using CeresEngine::FlatHashMap< K, V, H, E, A >::Table = detailv3::SherwoodV3Table<Pair<K, V>, K, H, detailv3::KeyOrValueHasher<K, Pair<K, V>, H>, E, detailv3::KeyOrValueEquality<K, Pair<K, V>, E>, A, typename std::allocator_traits<A>::template rebind_alloc<detailv3::SherwoodV3Entry<Pair<K, V> >> > |
|
private |
◆ FlatHashMap()
◆ at() [1/2]
◆ at() [2/2]
◆ emplace() [1/2]
◆ emplace() [2/2]
◆ insert_or_assign() [1/4]
◆ insert_or_assign() [2/4]
◆ insert_or_assign() [3/4]
◆ insert_or_assign() [4/4]
◆ operator[]() [1/2]
◆ operator[]() [2/2]
◆ operator!=
◆ operator==
The documentation for this class was generated from the following file:
- /Users/Rogiel/Developer/CeresEngine/Engine/Sources/CeresEngine/Foundation/Container/FlatHashMap.hpp