A hash based associative container. More...

#include <closed_hash.hpp>

Inheritance diagram for closed_hash_map< Key, T, Hash, Pred, A >:

Public Types
typedef T	mapped_type
Public Types inherited from closed_hash_set< std::pair< Key, T >, get_element< 0 >, Hash, Pred, A >
typedef get_element< 0 >	key_transform
using	key_type
typedef T	value_type
typedef Hash	hasher
typedef Pred	key_equal
typedef A	allocator_type
typedef value_type *	pointer
typedef const value_type *	const_pointer
typedef value_type &	reference
typedef const value_type &	const_reference
typedef std::size_t	size_type
typedef std::ptrdiff_t	difference_type
typedef implementation::closed_hash_iterator< closed_hash_set, value_type >	iterator
typedef implementation::closed_hash_iterator< closed_hash_set, const value_type >	const_iterator
typedef std::reverse_iterator< iterator >	reverse_iterator
typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

Public Member Functions
	closed_hash_map ()
template<typename I>
	closed_hash_map (I f, I l)
	closed_hash_map (std::initializer_list< typename set_type::value_type > init)
	closed_hash_map (const closed_hash_map &x)
	closed_hash_map (closed_hash_map &&x) noexcept
closed_hash_map &	operator= (closed_hash_map x)
Public Member Functions inherited from closed_hash_set< std::pair< Key, T >, get_element< 0 >, Hash, Pred, A >
	closed_hash_set ()
	closed_hash_set (size_type n)
	closed_hash_set (size_type n, const hasher &hf, const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type())
	closed_hash_set (I f, I l)
	closed_hash_set (std::initializer_list< value_type > init)
	closed_hash_set (I f, I l, size_type n, const hasher &hf=hasher(), const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type())
	closed_hash_set (const closed_hash_set &x)
closed_hash_set &	operator= (closed_hash_set x)
allocator_type	get_allocator () const
	closed_hash_set (closed_hash_set &&x) noexcept
size_type	size () const
size_type	max_size () const
bool	empty () const
size_type	capacity () const
void	reserve (size_type n)
key_transform	key_function () const
hasher	hash_function () const
key_equal	key_eq () const
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
reverse_iterator	rbegin ()
reverse_iterator	rend ()
const_reverse_iterator	rbegin () const
const_reverse_iterator	rend () const
iterator	erase (iterator location)
std::size_t	erase (const key_type &key)
void	clear ()
const_iterator	find (const key_type &key) const
const_iterator	find (const key_type &key, std::size_t hash) const
iterator	find (const key_type &key)
iterator	find (const key_type &key, std::size_t hash)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const
std::pair< const_iterator, const_iterator >	equal_range (const key_type &key, size_t hash) const
std::pair< iterator, iterator >	equal_range (const key_type &key)
std::pair< iterator, iterator >	equal_range (const key_type &key, std::size_t hash)
std::size_t	count (const key_type &key) const
std::size_t	count (const key_type &key, std::size_t hash) const
void	insert (I first, I last)
void	move_insert (I first, I last)
std::pair< iterator, bool >	insert (value_type x)
std::pair< iterator, bool >	insert (value_type x, std::size_t hash)
iterator	insert (iterator, value_type x)
	~closed_hash_set ()

Friends
void	swap (closed_hash_map &x, closed_hash_map &y)
bool	operator== (const closed_hash_map &x, const closed_hash_map &y)
bool	operator!= (const closed_hash_map &x, const closed_hash_map &y)

Detailed Description

template<typename Key, typename T, typename Hash, typename Pred, typename A>
class adobe::version_1::closed_hash_map< Key, T, Hash, Pred, A >

: A closed_hash_map is a hash based associative container, it is an adapted closed_hash_set where value_type is adobe::pair<Key, T> and the KeyTransform returns the first element of the pair.

Model Of

Definition at line 642 of file closed_hash.hpp.