node_hash_map.h File Reference

#include "di/container/allocator/allocator.h"
#include "di/container/allocator/fallible_allocator.h"
#include "di/container/allocator/infallible_allocator.h"
#include "di/container/associative/map_interface.h"
#include "di/container/concepts/prelude.h"
#include "di/container/hash/default_hasher.h"
#include "di/container/hash/node/owning_node_hash_table.h"
#include "di/container/intrusive/forward_list_forward_declaration.h"
#include "di/container/vector/vector.h"
#include "di/container/view/transform.h"
#include "di/function/compare.h"
#include "di/function/equal.h"
#include "di/platform/prelude.h"
#include "di/util/deduce_create.h"
#include "di/vocab/optional/prelude.h"

Go to the source code of this file.

Classes
struct	di::container::detail::NodeHashMapTag< Key, Value >
class	di::container::NodeHashMap< Key, Value, Eq, Hasher, Buckets, Alloc >
class	di::NodeHashMap< Key, Value, Eq, Hasher, Buckets, Alloc >

Namespaces
namespace	di
namespace	di::container
namespace	di::container::detail

Functions
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2)
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > >
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq> requires (meta::TupleSize<T> == 2)
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&, Eq) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq >
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq, typename Hasher> requires (meta::TupleSize<T> == 2)
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&, Eq, Hasher) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq, Hasher >