stlab.adobe.com Adobe Systems Incorporated
closed_hash_map< Key, T, Hash, Pred, A > Class Template Reference

#include <closed_hash.hpp>

Public Types

typedef T mapped_type
- Public Types inherited from closed_hash_set< pair< Key, T >, get_element< 0, pair< Key, T > >, Hash, Pred, A >
typedef A allocator_type
typedef
implementation::closed_hash_iterator
< closed_hash_set, const
value_type
const_iterator
typedef const value_typeconst_pointer
typedef const value_typeconst_reference
typedef std::reverse_iterator
< const_iterator
const_reverse_iterator
typedef std::ptrdiff_t difference_type
typedef Hash hasher
typedef
implementation::closed_hash_iterator
< closed_hash_set, value_type
iterator
typedef Pred key_equal
typedef get_element< 0, pair
< Key, T > > 
key_transform
typedef
boost::remove_reference
< typename
key_transform::result_type >
::type 
key_type
typedef value_typepointer
typedef value_typereference
typedef std::reverse_iterator
< iterator
reverse_iterator
typedef std::size_t size_type
typedef pair< Key, T > value_type

Public Member Functions

 closed_hash_map ()
template<typename I >
 closed_hash_map (I f, I l)
 closed_hash_map (const closed_hash_map &x)
 closed_hash_map (move_from< closed_hash_map > x)
closed_hash_mapoperator= (closed_hash_map x)
mapped_typeoperator[] (const Key &x)
- Public Member Functions inherited from closed_hash_set< pair< Key, T >, get_element< 0, pair< Key, T > >, Hash, Pred, A >
iterator begin ()
const_iterator begin () const
size_type capacity () const
void clear ()
 closed_hash_set ()
 closed_hash_set (size_type n)
 closed_hash_set (size_type n, const hasher &hf, const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type())
 closed_hash_set (I f, I l)
 closed_hash_set (I f, I l, size_type n, const hasher &hf=hasher(), const key_equal &eq=key_equal(), const key_transform &kf=key_transform(), const allocator_type &a=allocator_type())
 closed_hash_set (const closed_hash_set &x)
 closed_hash_set (move_from< closed_hash_set > x)
std::size_t count (const key_type &key) const
bool empty () const
iterator end ()
const_iterator end () const
std::pair< const_iterator,
const_iterator
equal_range (const key_type &key) const
std::pair< iterator, iteratorequal_range (const key_type &key)
iterator erase (iterator location)
std::size_t erase (const key_type &key)
const_iterator find (const key_type &key) const
iterator find (const key_type &key)
allocator_type get_allocator () const
hasher hash_function () const
void insert (I first, I last)
std::pair< iterator, bool > insert (value_type x)
iterator insert (iterator, value_type x)
key_equal key_eq () const
key_transform key_function () const
size_type max_size () const
void move_insert (I first, I last)
closed_hash_setoperator= (closed_hash_set x)
reverse_iterator rbegin ()
const_reverse_iterator rbegin () const
reverse_iterator rend ()
const_reverse_iterator rend () const
void reserve (size_type n)
size_type size () const
 ~closed_hash_set ()

Friends

bool operator!= (const closed_hash_map &x, const closed_hash_map &y)
bool operator== (const closed_hash_map &x, const closed_hash_map &y)
void swap (closed_hash_map &x, closed_hash_map &y)

Detailed Description

template<typename Key, typename T, typename Hash, typename Pred, typename A>
class adobe::closed_hash_map< Key, T, Hash, Pred, A >

A closed_hash_map is a hash based associative container, it is an adapted closed_hash_set where value_type is adobe::pair<Key, T> and the KeyTransform returns the first element of the pair.
Model Of:

Definition at line 638 of file closed_hash.hpp.

Member Typedef Documentation

typedef T mapped_type

Definition at line 650 of file closed_hash.hpp.

Constructor & Destructor Documentation

Definition at line 652 of file closed_hash.hpp.

closed_hash_map ( f,
l 
)

Definition at line 655 of file closed_hash.hpp.

closed_hash_map ( const closed_hash_map< Key, T, Hash, Pred, A > &  x)

Definition at line 662 of file closed_hash.hpp.

closed_hash_map ( move_from< closed_hash_map< Key, T, Hash, Pred, A > >  x)

Definition at line 663 of file closed_hash.hpp.

Member Function Documentation

closed_hash_map& operator= ( closed_hash_map< Key, T, Hash, Pred, A >  x)

Definition at line 664 of file closed_hash.hpp.

mapped_type& operator[] ( const Key &  x)

Definition at line 688 of file closed_hash.hpp.

Friends And Related Function Documentation

bool operator!= ( const closed_hash_map< Key, T, Hash, Pred, A > &  x,
const closed_hash_map< Key, T, Hash, Pred, A > &  y 
)
friend

Definition at line 679 of file closed_hash.hpp.

bool operator== ( const closed_hash_map< Key, T, Hash, Pred, A > &  x,
const closed_hash_map< Key, T, Hash, Pred, A > &  y 
)
friend

Definition at line 671 of file closed_hash.hpp.

void swap ( closed_hash_map< Key, T, Hash, Pred, A > &  x,
closed_hash_map< Key, T, Hash, Pred, A > &  y 
)
friend

Definition at line 667 of file closed_hash.hpp.

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google