Inheritance diagram for std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false >:

[legend]

Public Types
using	__base_type = _Insert_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits >

using	__hashtable = typename __base_type::__hashtable

using	__ireturn_type = typename __base_type::__ireturn_type

template<typename _Pair >
using	__is_cons = std::is_constructible< value_type, _Pair && >

using	__unique_keys = typename __base_type::__unique_keys

template<typename _Pair >
using	_IFcons = std::enable_if< __is_cons< _Pair >::value >

template<typename _Pair >
using	_IFconsp = typename _IFcons< _Pair >::type

using	const_iterator = typename __base_type::const_iterator

using	iterator = typename __base_type::iterator

using	value_type = typename __base_type::value_type

Public Member Functions
__ireturn_type	insert (const value_type &__v)

iterator	insert (const_iterator __hint, const value_type &__v)

void	insert (initializer_list< value_type > __l)

template<typename _InputIterator >
void	insert (_InputIterator __first, _InputIterator __last)

iterator	insert (const_iterator __hint, const value_type &__v)

template<typename _InputIterator >
void	insert (_InputIterator __first, _InputIterator __last)

void	insert (initializer_list< value_type > __l)

__ireturn_type	insert (const value_type &__v)

template<typename _Pair , typename = _IFconsp<_Pair>>
__ireturn_type	insert (_Pair &&__v)

template<typename _Pair , typename = _IFconsp<_Pair>>
iterator	insert (const_iterator __hint, _Pair &&__v)

template<typename _KType , typename... _Args>
std::pair< iterator, bool >	try_emplace (const_iterator, _KType &&__k, _Args &&... __args)

Protected Types
using	__constant_iterators = typename _Traits::__constant_iterators

using	__hash_cached = typename _Traits::__hash_cached

using	__hashtable_alloc = _Hashtable_alloc< __alloc_rebind< _Alloc, _Hash_node< _Value, __hash_cached::value > >>

using	__hashtable_base = _Hashtable_base< _Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits >

using	__node_alloc_type = typename __hashtable_alloc::__node_alloc_type

using	__node_gen_type = _AllocNode< __node_alloc_type >

using	size_type = typename __hashtable_base::size_type

Protected Member Functions
__hashtable &	_M_conjure_hashtable ()

template<typename _InputIterator , typename _NodeGetter >
void	_M_insert_range (_InputIterator __first, _InputIterator __last, const _NodeGetter &, true_type __uks)

template<typename _InputIterator , typename _NodeGetter >
void	_M_insert_range (_InputIterator __first, _InputIterator __last, const _NodeGetter &, false_type __uks)

Detailed Description

template<typename _Key, typename _Value, typename _Alloc, typename _ExtractKey, typename _Equal, typename _Hash, typename _RangeHash, typename _Unused, typename _RehashPolicy, typename _Traits>
struct std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits, false >

Specialization.

Definition at line 1003 of file hashtable_policy.h.

The documentation for this struct was generated from the following file:

hashtable_policy.h

Public Types

Public Member Functions

Protected Types

Protected Member Functions

Detailed Description