UnsortedMap< Key, Value > Class Template Reference

#include <container.h>

Public Types

typedef Values::value_type value_type
typedef Values::iterator iterator
typedef Values::const_iterator const_iterator

Public Member Functions

iterator begin ()
const_iterator begin () const
iterator end ()
const_iterator end () const
bool empty () const
std::size_t size () const
void clear ()
iterator insert (const value_type &value)
void erase (const Key &key)
void erase (iterator i)
iterator find (const Key &key)
const_iterator find (const Key &key) const
Valueoperator[] (const Key &key)

Private Types

typedef std::list< std::pair
< Key, Value > > 
Values

Private Attributes

Values m_values

Detailed Description

template<typename Key, typename Value>
class UnsortedMap< Key, Value >

An adaptor to make std::list into a Unique Associative Sequence - which cannot contain the same value more than once. Key: Uniquely identifies a value. Must provide a copy-constructor and an equality operator. Value: Must provide a copy-constructor.

Definition at line 137 of file container.h.


Member Typedef Documentation

template<typename Key, typename Value>
typedef Values::const_iterator UnsortedMap< Key, Value >::const_iterator

Definition at line 143 of file container.h.

template<typename Key, typename Value>
typedef Values::iterator UnsortedMap< Key, Value >::iterator

Definition at line 142 of file container.h.

template<typename Key, typename Value>
typedef Values::value_type UnsortedMap< Key, Value >::value_type

Definition at line 141 of file container.h.

template<typename Key, typename Value>
typedef std::list< std::pair<Key, Value> > UnsortedMap< Key, Value >::Values [private]

Definition at line 138 of file container.h.


Member Function Documentation

template<typename Key, typename Value>
const_iterator UnsortedMap< Key, Value >::begin (  )  const [inline]

Definition at line 148 of file container.h.

template<typename Key, typename Value>
iterator UnsortedMap< Key, Value >::begin (  )  [inline]
template<typename Key, typename Value>
void UnsortedMap< Key, Value >::clear (  )  [inline]

Definition at line 164 of file container.h.

template<typename Key, typename Value>
bool UnsortedMap< Key, Value >::empty (  )  const [inline]

Definition at line 158 of file container.h.

template<typename Key, typename Value>
const_iterator UnsortedMap< Key, Value >::end (  )  const [inline]

Definition at line 154 of file container.h.

template<typename Key, typename Value>
iterator UnsortedMap< Key, Value >::end (  )  [inline]
template<typename Key, typename Value>
void UnsortedMap< Key, Value >::erase ( iterator  i  )  [inline]

Definition at line 178 of file container.h.

template<typename Key, typename Value>
void UnsortedMap< Key, Value >::erase ( const Key &  key  )  [inline]

Definition at line 173 of file container.h.

Referenced by EntityKeyValues::erase(), and UnsortedMap< Key, KeyValuePtr >::erase().

template<typename Key, typename Value>
const_iterator UnsortedMap< Key, Value >::find ( const Key &  key  )  const [inline]

Definition at line 189 of file container.h.

template<typename Key, typename Value>
iterator UnsortedMap< Key, Value >::find ( const Key &  key  )  [inline]
template<typename Key, typename Value>
iterator UnsortedMap< Key, Value >::insert ( const value_type value  )  [inline]

Definition at line 168 of file container.h.

Referenced by EntityKeyValues::insert().

template<typename Key, typename Value>
Value& UnsortedMap< Key, Value >::operator[] ( const Key &  key  )  [inline]

Definition at line 198 of file container.h.

template<typename Key, typename Value>
std::size_t UnsortedMap< Key, Value >::size (  )  const [inline]

Definition at line 161 of file container.h.


Field Documentation

template<typename Key, typename Value>
Values UnsortedMap< Key, Value >::m_values [private]

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

Generated by  doxygen 1.6.2