indirectmap< K, T > Class Template Reference

#include <indirectmap.h>

Public Types
typedef base::iterator	iterator
typedef base::const_iterator	const_iterator
typedef base::size_type	size_type
typedef base::value_type	value_type

Public Member Functions
std::pair< iterator, bool >	insert (const value_type &value)
iterator	find (const K &key)
const_iterator	find (const K &key) const
iterator	lower_bound (const K &key)
const_iterator	lower_bound (const K &key) const
size_type	erase (const K &key)
size_type	count (const K &key) const
bool	empty () const
size_type	size () const
size_type	max_size () const
void	clear ()
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
const_iterator	cbegin () const
const_iterator	cend () const

Private Types
typedef std::map< const K *, T, DereferencingComparator< const K * > >	base

Private Attributes
base	m

Member Typedef Documentation

base

template<class K, class T>

typedef std::map<const K*, T, DereferencingComparator<const K*> > indirectmap< K, T >::base

private

const_iterator

template<class K, class T>

typedef base::const_iterator indirectmap< K, T >::const_iterator

iterator

template<class K, class T>

typedef base::iterator indirectmap< K, T >::iterator

size_type

template<class K, class T>

typedef base::size_type indirectmap< K, T >::size_type

value_type

template<class K, class T>

typedef base::value_type indirectmap< K, T >::value_type

Member Function Documentation

begin() [1/2]

template<class K, class T>

iterator indirectmap< K, T >::begin ( )

inline

begin() [2/2]

template<class K, class T>

const_iterator indirectmap< K, T >::begin ( ) const

inline

cbegin()

template<class K, class T>

const_iterator indirectmap< K, T >::cbegin ( ) const

inline

cend()

template<class K, class T>

const_iterator indirectmap< K, T >::cend ( ) const

inline

clear()

template<class K, class T>

void indirectmap< K, T >::clear ( )

inline

count()

template<class K, class T>

size_type indirectmap< K, T >::count ( const K &  key ) const

inline

empty()

template<class K, class T>

bool indirectmap< K, T >::empty ( ) const

inline

end() [1/2]

template<class K, class T>

iterator indirectmap< K, T >::end ( )

inline

end() [2/2]

template<class K, class T>

const_iterator indirectmap< K, T >::end ( ) const

inline

erase()

template<class K, class T>

size_type indirectmap< K, T >::erase ( const K &  key )

inline

find() [1/2]

template<class K, class T>

iterator indirectmap< K, T >::find ( const K &  key )

inline

find() [2/2]

template<class K, class T>

const_iterator indirectmap< K, T >::find ( const K &  key ) const

inline

insert()

template<class K, class T>

std::pair<iterator, bool> indirectmap< K, T >::insert ( const value_type &  value )

inline

lower_bound() [1/2]

template<class K, class T>

iterator indirectmap< K, T >::lower_bound ( const K &  key )

inline

lower_bound() [2/2]

template<class K, class T>

const_iterator indirectmap< K, T >::lower_bound ( const K &  key ) const

inline

max_size()

template<class K, class T>

size_type indirectmap< K, T >::max_size ( ) const

inline

size()

template<class K, class T>

size_type indirectmap< K, T >::size ( ) const

inline

Member Data Documentation

m

template<class K, class T>

base indirectmap< K, T >::m

private

---

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

• src/indirectmap.h