Inheritance diagram for std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >:
Definition at line 1001 of file hashtable.
| typedef Allocator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::allocator_type |
Reimplemented in std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >, and std::tr1::unordered_multiset< Value, Hash, Pred, Alloc, cache_hash_code >.
typedef Allocator::template rebind<node*>::other std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::bucket_allocator_t [private] |
| typedef Internal::hashtable_const_iterator<value_type, constant_iterators, cache_hash_code> std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::const_iterator |
| typedef Internal::node_const_iterator<value_type, constant_iterators, cache_hash_code> std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::const_local_iterator |
| typedef Allocator::const_reference std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::const_reference |
| typedef Allocator::difference_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::difference_type |
typedef Internal::IF<unique_keys, Internal::extract1st<Insert_Return_Type>, Internal::identity<Insert_Return_Type> >::type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::Insert_Conv_Type [private] |
typedef Internal::IF<unique_keys, std::pair<iterator, bool>, iterator>::type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::Insert_Return_Type [private] |
| typedef Internal::hashtable_iterator<value_type, constant_iterators, cache_hash_code> std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::iterator |
| typedef Equal std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::key_equal |
Reimplemented in std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >, and std::tr1::unordered_multiset< Value, Hash, Pred, Alloc, cache_hash_code >.
| typedef Key std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::key_type |
| typedef Internal::node_iterator<value_type, constant_iterators, cache_hash_code> std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::local_iterator |
typedef Internal::hash_node<Value, cache_hash_code> std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::node [private] |
typedef Allocator::template rebind<node>::other std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::node_allocator_t [private] |
| typedef Allocator::reference std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::reference |
| typedef Allocator::size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::size_type |
Reimplemented in std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code >, std::tr1::unordered_set< Value, Hash, Pred, Alloc, cache_hash_code >, and std::tr1::unordered_multiset< Value, Hash, Pred, Alloc, cache_hash_code >.
| typedef Value std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::value_type |
| std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::hashtable | ( | size_type | bucket_hint, | |
| const H1 & | , | |||
| const H2 & | , | |||
| const H & | , | |||
| const Equal & | , | |||
| const ExtractKey & | , | |||
| const allocator_type & | ||||
| ) |
Definition at line 1382 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy.
| std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::hashtable | ( | InIter | first, | |
| InIter | last, | |||
| size_type | bucket_hint, | |||
| const H1 & | , | |||
| const H2 & | , | |||
| const H & | , | |||
| const Equal & | , | |||
| const ExtractKey & | , | |||
| const allocator_type & | ||||
| ) |
Definition at line 1404 of file hashtable.
References __throw_exception_again, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), Internal::distance_fw(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::max().
| std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::hashtable | ( | const hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys > & | ) |
Definition at line 1441 of file hashtable.
References __throw_exception_again, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_buckets().
| std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::~hashtable | ( | ) |
Definition at line 1492 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_buckets().
| const_local_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::begin | ( | size_type | n | ) | const [inline] |
| local_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::begin | ( | size_type | n | ) | [inline] |
| const_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::begin | ( | ) | const [inline] |
| iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::begin | ( | ) | [inline] |
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::bucket | ( | const key_type & | k | ) | const [inline] |
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::bucket_count | ( | ) | const [inline] |
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::bucket_size | ( | size_type | n | ) | const [inline] |
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::clear | ( | ) |
Definition at line 1894 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_nodes(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::~hashtable().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::size_type std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::count | ( | const key_type & | k | ) | const |
| bool std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::empty | ( | ) | const [inline] |
| const_local_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end | ( | size_type | ) | const [inline] |
| local_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end | ( | size_type | ) | [inline] |
| const_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end | ( | ) | const [inline] |
| iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end | ( | ) | [inline] |
Definition at line 1115 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::equal_range(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::find().
| std::pair< typename hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::const_iterator, typename hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::const_iterator > std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::equal_range | ( | const key_type & | k | ) | const |
Definition at line 1620 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node(), Internal::hashtable_iterator_base< Value, cache >::m_incr_bucket(), and std::make_pair().
| std::pair< typename hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator, typename hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator > std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::equal_range | ( | const key_type & | k | ) |
Definition at line 1587 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node(), Internal::hashtable_iterator_base< Value, cache >::m_incr_bucket(), and std::make_pair().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::const_iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::erase | ( | const_iterator | , | |
| const_iterator | ||||
| ) |
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::erase | ( | iterator | , | |
| iterator | ||||
| ) |
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::size_type std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::erase | ( | const key_type & | ) |
Definition at line 1837 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_node(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count.
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::const_iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::erase | ( | const_iterator | ) |
Definition at line 1823 of file hashtable.
References Internal::hashtable_iterator_base< Value, cache >::m_cur_bucket, Internal::hashtable_iterator_base< Value, cache >::m_cur_node, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_erase_node().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::erase | ( | iterator | ) |
Definition at line 1809 of file hashtable.
References Internal::hashtable_iterator_base< Value, cache >::m_cur_bucket, Internal::hashtable_iterator_base< Value, cache >::m_cur_node, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_erase_node().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::const_iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::find | ( | const key_type & | k | ) | const |
Definition at line 1553 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::find | ( | const key_type & | k | ) |
Definition at line 1539 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::end(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node().
| allocator_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::get_allocator | ( | ) | const [inline] |
Definition at line 1131 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_node(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_node().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::insert | ( | InIter | first, | |
| InIter | last | |||
| ) |
Definition at line 1791 of file hashtable.
References Internal::distance_fw(), std::pair< _T1, _T2 >::first, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::pair< _T1, _T2 >::second.
| const_iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert | ( | const_iterator | , | |
| const value_type & | v | |||
| ) | [inline] |
| iterator std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert | ( | iterator | , | |
| const value_type & | v | |||
| ) | [inline] |
| Insert_Return_Type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert | ( | const value_type & | v | ) | [inline] |
| key_equal std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::key_eq | ( | ) | const [inline] |
| float std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::load_factor | ( | ) | const [inline] |
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::node ** std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_allocate_buckets | ( | size_type | n | ) | [private] |
Definition at line 1353 of file hashtable.
References std::fill(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_node_allocator.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::node * std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_allocate_node | ( | const value_type & | v | ) | [private] |
Definition at line 1298 of file hashtable.
References __throw_exception_again, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::get_allocator(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_node_allocator.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_deallocate_buckets | ( | node ** | , | |
| size_type | n | |||
| ) | [private] |
Definition at line 1371 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::~hashtable().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_deallocate_node | ( | node * | n | ) | [private] |
Definition at line 1320 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::get_allocator(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_node_allocator.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::erase(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_nodes(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_erase_node(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_deallocate_nodes | ( | node ** | , | |
| size_type | ||||
| ) | [private] |
Definition at line 1332 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_erase_node | ( | node * | , | |
| node ** | ||||
| ) | [private] |
Definition at line 1764 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_node(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count.
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::node * std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_find_node | ( | node * | , | |
| const key_type & | , | |||
| typename hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hash_code_t | ||||
| ) | const [private] |
Definition at line 1652 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::equal_range(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::find(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_insert | ( | const value_type & | , | |
| std::tr1::false_type | ||||
| ) | [private] |
Definition at line 1726 of file hashtable.
References std::pair< _T1, _T2 >::first, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::pair< _T1, _T2 >::second.
| std::pair< typename hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator, bool > std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_insert | ( | const value_type & | , | |
| std::tr1::true_type | ||||
| ) | [private] |
Definition at line 1708 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_find_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), and std::make_pair().
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::iterator std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_insert_bucket | ( | const value_type & | , | |
| size_type | , | |||
| typename hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hash_code_t | ||||
| ) | [private] |
Definition at line 1668 of file hashtable.
References __throw_exception_again, std::pair< _T1, _T2 >::first, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::pair< _T1, _T2 >::second.
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::m_rehash | ( | size_type | n | ) | [private] |
Definition at line 1919 of file hashtable.
References __throw_exception_again, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_nodes(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash_policy().
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::max_bucket_count | ( | ) | const [inline] |
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::max_size | ( | ) | const [inline] |
| hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u > & std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::operator= | ( | const hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys > & | ) |
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::rehash | ( | size_type | n | ) |
Definition at line 1906 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::max().
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::rehash_policy | ( | const RehashPolicy & | ) |
Definition at line 1525 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy.
| const RehashPolicy& std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash_policy | ( | ) | const [inline] |
| size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::size | ( | ) | const [inline] |
| void std::tr1::hashtable< K, V, A, Ex, Eq, H1, H2, H, RP, c, ci, u >::swap | ( | hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys > & | ) |
Definition at line 1504 of file hashtable.
References std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count, std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy, and std::swap().
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::operator=(), and std::tr1::swap().
friend struct Internal::map_base [friend] |
size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_bucket_count [private] |
Definition at line 1054 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::erase(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash_policy(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::swap(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::~hashtable().
node** std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_buckets [private] |
Definition at line 1053 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::count(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::equal_range(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::erase(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::find(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::swap(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::~hashtable().
size_type std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_element_count [private] |
Definition at line 1055 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::clear(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::erase(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_erase_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash_policy(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::swap().
node_allocator_t std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_node_allocator [private] |
Definition at line 1052 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_buckets(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_allocate_node(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_buckets(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_deallocate_node().
RehashPolicy std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_rehash_policy [private] |
Definition at line 1056 of file hashtable.
Referenced by std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::hashtable(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::m_insert_bucket(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash(), std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::rehash_policy(), and std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >::swap().
1.4.7