std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code > Class Template Reference

Inheritance diagram for std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >:

List of all members.

Public Types
typedef Base::size_type	size_type
typedef Base::hasher	hasher
typedef Base::key_equal	key_equal
typedef Base::allocator_type	allocator_type
Public Member Functions
	unordered_map (size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())
template<typename InputIterator>
	unordered_map (InputIterator f, InputIterator l, size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())
Private Types
typedef hashtable< Key, std::pair< const Key, T >, Alloc, Internal::extract1st< std::pair< const Key, T > >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, false, true >	Base

---

Detailed Description

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>
class std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >

Definition at line 55 of file unordered_map.

---

Member Typedef Documentation

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

typedef Base::allocator_type std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::allocator_type

Reimplemented from std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >.

Definition at line 77 of file unordered_map.

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

typedef hashtable<Key, std::pair<const Key, T>, Alloc, Internal::extract1st<std::pair<const Key, T> >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, false, true> std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::Base [private]

Definition at line 71 of file unordered_map.

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

typedef Base::hasher std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::hasher

Definition at line 75 of file unordered_map.

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

typedef Base::key_equal std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::key_equal

Reimplemented from std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >.

Definition at line 76 of file unordered_map.

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

typedef Base::size_type std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::size_type

Reimplemented from std::tr1::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >.

Definition at line 74 of file unordered_map.

---

Constructor & Destructor Documentation

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::unordered_map	(	size_type	n = 10,
		const hasher &	hf = hasher(),
		const key_equal &	eql = key_equal(),
		const allocator_type &	a = allocator_type()
	)			[inline, explicit]

Definition at line 80 of file unordered_map.

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>

template<typename InputIterator>

std::tr1::unordered_map< Key, T, Hash, Pred, Alloc, cache_hash_code >::unordered_map	(	InputIterator	f,
		InputIterator	l,
		size_type	n = 10,
		const hasher &	hf = hasher(),
		const key_equal &	eql = key_equal(),
		const allocator_type &	a = allocator_type()
	)			[inline]

Definition at line 90 of file unordered_map.

---

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

• unordered_map

---