|
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 |
|
using | __node_gen_type = typename __base_type::__node_gen_type |
|
using | __unique_keys = typename __base_type::__unique_keys |
|
using | const_iterator = typename __base_type::const_iterator |
|
using | iterator = typename __base_type::iterator |
|
using | value_type = typename __base_type::value_type |
|
|
template<typename _InputIterator > |
void | insert (_InputIterator __first, _InputIterator __last) |
|
__ireturn_type | insert (const value_type &__v) |
|
iterator | insert (const_iterator __hint, const value_type &__v) |
|
iterator | insert (const_iterator __hint, value_type &&__v) |
|
void | insert (initializer_list< value_type > __l) |
|
__ireturn_type | insert (value_type &&__v) |
|
template<typename _KType , typename... _Args> |
std::pair< iterator, bool > | try_emplace (const_iterator, _KType &&__k, _Args &&... __args) |
|
|
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 | size_type = typename __hashtable_base::size_type |
|
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, true >
Specialization.
Definition at line 959 of file hashtable_policy.h.