unordered_map Class Template Reference

Inheritance diagram for unordered_map:

List of all members.

---

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.

Public Types

• typedef Base::allocator_type allocator_type
• typedef Internal::hashtable_const_iterator<
  value_type, constant_iterators,
  cache_hash_code > const_iterator
• typedef Internal::node_const_iterator<
  value_type, constant_iterators,
  cache_hash_code > const_local_iterator
• typedef Allocator::const_reference const_reference
• typedef Allocator::difference_type difference_type
• typedef Base::hasher hasher
• typedef Internal::hashtable_iterator<
  value_type, constant_iterators,
  cache_hash_code > iterator
• typedef Base::key_equal key_equal
• typedef Key key_type
• typedef Internal::node_iterator<
  value_type, constant_iterators,
  cache_hash_code > local_iterator
• typedef Allocator::reference reference
• typedef Base::size_type size_type
• typedef Value value_type

Public Member Functions

• const_local_iterator begin (size_type n) const
• local_iterator begin (size_type n)
• const_iterator begin () const
• iterator begin ()
• size_type bucket (const key_type &k) const
• size_type bucket_count () const
• size_type bucket_size (size_type n) const
• void clear ()
• size_type count (const key_type &k) const
• bool empty () const
• const_local_iterator end (size_type) const
• local_iterator end (size_type)
• const_iterator end () const
• iterator end ()
• std::pair< const_iterator,
  const_iterator > equal_range (const key_type &k) const
• std::pair< iterator, iterator > equal_range (const key_type &k)
• const_iterator erase (const_iterator, const_iterator)
• iterator erase (iterator, iterator)
• size_type erase (const key_type &)
• const_iterator erase (const_iterator)
• iterator erase (iterator)
• const_iterator find (const key_type &k) const
• iterator find (const key_type &k)
• allocator_type get_allocator () const
• template<typename InIter> void insert (InIter first, InIter last)
• const_iterator insert (const_iterator, const value_type &v)
• iterator insert (iterator, const value_type &v)
• Insert_Return_Type insert (const value_type &v)
• key_equal key_eq () const
• float load_factor () const
• size_type max_bucket_count () const
• size_type max_size () const
• void rehash (size_type n)
• void rehash_policy (const RehashPolicy &)
• const RehashPolicy & rehash_policy () const
• size_type size () const
• void swap (hashtable &)
• 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())
• unordered_map (size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())

Friends

• struct Internal::map_base

---

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

• unordered_map

---