libstdc++
bits/hashtable.h File Reference

Go to the source code of this file.

Classes

class  std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >
 

Namespaces

 std
 

Typedefs

template<typename _Tp , typename _Hash >
using std::__cache_default = __not_< __and_< __is_fast_hash< _Hash >, __is_nothrow_invocable< const _Hash &, const _Tp & >>>
 

Functions

iterator std::__result (__n->_M_next())
 
this std::_M_deallocate_node (__n)
 
return std::_M_erase (__bkt, __prev_n, __n)
 
return std::_M_insert_multi_node (__hint._M_cur, __code, __node)
 
 std::_M_remove_bucket_begin (__bkt, __n_last, __n_last_bkt)
 
 std::catch (...)
 
 std::for (;;)
 
 std::if (__p)
 
else std::if (__n->_M_nxt)
 
else std::if (__n_last &&__n_last_bkt!=__bkt) _M_buckets[__n_last_bkt]
 
return std::iterator (__n)
 
 std::while (__n_last_bkt==__bkt &&this->_M_equals(__k, __code, __n_last))
 
 std::while (__n!=__n_last)
 

Variables

size_type std::__bkt
 
__hash_code std::__code
 
bool std::__is_bucket_begin
 
const key_type & std::__k
 
__node_type * std::__last_n
 
std::size_t std::__n
 
std::size_t std::__n_bkt
 
__node_type * std::__n_last
 
std::size_t std::__n_last_bkt
 
__node_type * std::__p
 
template<typename _Key , typename _Value , typename _Alloc , typename _ExtractKey , typename _Equal , typename _H1 , typename _H2 , typename _Hash , typename _RehashPolicy , typename _Traits >
auto _Hashtable< _Key, _Value,
_Alloc, _ExtractKey, _Equal,
_H1, _H2, _Hash, _RehashPolicy,
_Traits >__node_base * 
std::__prev_n
 
return std::__result
 
template<typename _Key , typename _Value , typename _Alloc , typename _ExtractKey , typename _Equal , typename _H1 , typename _H2 , typename _Hash , typename _RehashPolicy , typename _Traits >
auto std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >iterator
 
template<typename... _Args>
auto std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >pair< iterator, bool >
 
template<typename _Key , typename _Value , typename _Alloc , typename _ExtractKey , typename _Equal , typename _H1 , typename _H2 , typename _Hash , typename _RehashPolicy , typename _Traits >
auto std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >pair< iterator, iterator >
 
template<typename _Key , typename _Value , typename _Alloc , typename _ExtractKey , typename _Equal , typename _H1 , typename _H2 , typename _Hash , typename _RehashPolicy , typename _Traits >
auto std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >size_type
 
 std::_M_buckets [__n_bkt]
 
 std::_M_element_count
 
__prev_n std::_M_nxt
 
 std::break
 
 std::do
 
 std::return
 
 std::try
 

Detailed Description

This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <unordered_map> or < unordered_set>.

Definition in file bits/hashtable.h.