microScheme
Classes | Public Types | Public Member Functions | Private Types | List of all members
hashtablemap< Key, T > Class Template Reference

#include <hashtablemap.hpp>

Classes

class  const_iterator
 
class  iterator
 

Public Types

typedef Key key_type
 
typedef T data_type
 
typedef T mapped_type
 
typedef pair< const Key, T > value_type
 
typedef unsigned int size_type
 
typedef int difference_type
 

Public Member Functions

 hashtablemap ()
 
 hashtablemap (const Self &x)
 
Selfoperator= (const Self &x)
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
bool empty () const
 
size_type size () const
 
pair< iterator, bool > insert (const value_type &x)
 
void erase (iterator pos)
 
size_type erase (const Key &x)
 
void clear ()
 
iterator find (const Key &x)
 
const_iterator find (const Key &x) const
 
size_type count (const Key &x) const
 
T & operator[] (const Key &k)
 

Private Types

typedef hashtablemap< Key, T > Self
 

Member Typedef Documentation

template<class Key , class T >
typedef T hashtablemap< Key, T >::data_type
template<class Key , class T >
typedef int hashtablemap< Key, T >::difference_type
template<class Key , class T >
typedef Key hashtablemap< Key, T >::key_type
template<class Key , class T >
typedef T hashtablemap< Key, T >::mapped_type
template<class Key , class T >
typedef hashtablemap<Key, T> hashtablemap< Key, T >::Self
private
template<class Key , class T >
typedef unsigned int hashtablemap< Key, T >::size_type
template<class Key , class T >
typedef pair<const Key, T> hashtablemap< Key, T >::value_type

Constructor & Destructor Documentation

template<class Key , class T >
hashtablemap< Key, T >::hashtablemap ( )
inline
template<class Key , class T >
hashtablemap< Key, T >::hashtablemap ( const Self x)
inline

Member Function Documentation

template<class Key , class T >
iterator hashtablemap< Key, T >::begin ( )
inline
template<class Key , class T >
const_iterator hashtablemap< Key, T >::begin ( ) const
inline
template<class Key , class T >
void hashtablemap< Key, T >::clear ( )
inline
template<class Key , class T >
size_type hashtablemap< Key, T >::count ( const Key &  x) const
inline
template<class Key , class T >
bool hashtablemap< Key, T >::empty ( ) const
inline
template<class Key , class T >
iterator hashtablemap< Key, T >::end ( )
inline
template<class Key , class T >
const_iterator hashtablemap< Key, T >::end ( ) const
inline
template<class Key , class T >
void hashtablemap< Key, T >::erase ( iterator  pos)
inline
template<class Key , class T >
size_type hashtablemap< Key, T >::erase ( const Key &  x)
inline
template<class Key , class T >
iterator hashtablemap< Key, T >::find ( const Key &  x)
inline
template<class Key , class T >
const_iterator hashtablemap< Key, T >::find ( const Key &  x) const
inline
template<class Key , class T >
pair<iterator,bool> hashtablemap< Key, T >::insert ( const value_type x)
inline
template<class Key , class T >
Self& hashtablemap< Key, T >::operator= ( const Self x)
inline
template<class Key , class T >
T& hashtablemap< Key, T >::operator[] ( const Key &  k)
inline
template<class Key , class T >
size_type hashtablemap< Key, T >::size ( ) const
inline

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