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 52 of file unordered_map.
Public Types
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 n) const
-
local_iterator end (size_type n)
-
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)
-
void erase (const_iterator, const_iterator)
-
size_type erase (const key_type &)
-
void erase (const_iterator)
-
const_iterator find (const key_type &k) const
-
iterator find (const key_type &)
-
allocator_type get_allocator () const
-
hashtable (const hashtable &)
-
hashtable (InIter first, InIter last, size_type bucket_hint, const Hash &, const Internal::mod_range_hashing &, const Internal::default_ranged_hash &, const Pred &, const Internal::extract1st< std::pair< const Key, T > > &, const allocator_type &)
-
hashtable (size_type bucket_hint, const Hash &, const Internal::mod_range_hashing &, const Internal::default_ranged_hash &, const Pred &, const Internal::extract1st< std::pair< const Key, T > > &, const allocator_type &)
-
void insert (InIter first, InIter last)
-
Insert_Return_Type insert (const_iterator, const value_type &v)
-
Insert_Return_Type insert (const value_type &v)
-
float load_factor () const
-
size_type max_bucket_count () const
-
size_type max_size () const
-
void rehash (size_type n)
-
void rehash_policy (const Internal::prime_rehash_policy &)
-
const Internal::prime_rehash_policy & 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())
The documentation for this class was generated from the following file:
Generated on Sat Oct 1 15:09:58 2005 for libstdc++ source by
1.4.4