limitedmap< K, V > Class Template Reference

#include <limitedmap.h>

Public Types
typedef K	key_type
typedef V	mapped_type
typedef std::pair< const key_type, mapped_type >	value_type
typedef std::map< K, V >::const_iterator	const_iterator
typedef std::map< K, V >::size_type	size_type

Public Member Functions
	limitedmap (size_type nMaxSizeIn)
const_iterator	begin () const
const_iterator	end () const
size_type	size () const
bool	empty () const
const_iterator	find (const key_type &k) const
size_type	count (const key_type &k) const
void	insert (const value_type &x)
void	erase (const key_type &k)
void	update (const_iterator itIn, const mapped_type &v)
size_type	max_size () const
size_type	max_size (size_type s)

Protected Types
typedef std::map< K, V >::iterator	iterator
typedef std::multimap< V, iterator >::iterator	rmap_iterator

Protected Attributes
std::map< K, V >	map
std::multimap< V, iterator >	rmap
size_type	nMaxSize

Detailed Description

template<typename K, typename V>
class limitedmap< K, V >

STL-like map container that only keeps the N elements with the highest value.

Member Typedef Documentation

const_iterator

template<typename K , typename V >

typedef std::map<K, V>::const_iterator limitedmap< K, V >::const_iterator

iterator

template<typename K , typename V >

typedef std::map<K, V>::iterator limitedmap< K, V >::iterator

protected

key_type

template<typename K , typename V >

typedef K limitedmap< K, V >::key_type

mapped_type

template<typename K , typename V >

typedef V limitedmap< K, V >::mapped_type

rmap_iterator

template<typename K , typename V >

typedef std::multimap<V, iterator>::iterator limitedmap< K, V >::rmap_iterator

protected

size_type

template<typename K , typename V >

typedef std::map<K, V>::size_type limitedmap< K, V >::size_type

value_type

template<typename K , typename V >

typedef std::pair<const key_type, mapped_type> limitedmap< K, V >::value_type

Constructor & Destructor Documentation

limitedmap()

template<typename K , typename V >

limitedmap< K, V >::limitedmap ( size_type  nMaxSizeIn )

inlineexplicit

Member Function Documentation

begin()

template<typename K , typename V >

const_iterator limitedmap< K, V >::begin ( ) const

inline

count()

template<typename K , typename V >

size_type limitedmap< K, V >::count ( const key_type &  k ) const

inline

empty()

template<typename K , typename V >

bool limitedmap< K, V >::empty ( ) const

inline

end()

template<typename K , typename V >

const_iterator limitedmap< K, V >::end ( ) const

inline

erase()

template<typename K , typename V >

void limitedmap< K, V >::erase ( const key_type &  k )

inline

find()

template<typename K , typename V >

const_iterator limitedmap< K, V >::find ( const key_type &  k ) const

inline

insert()

template<typename K , typename V >

void limitedmap< K, V >::insert ( const value_type &  x )

inline

max_size() [1/2]

template<typename K , typename V >

size_type limitedmap< K, V >::max_size ( ) const

inline

max_size() [2/2]

template<typename K , typename V >

size_type limitedmap< K, V >::max_size ( size_type  s )

inline

size()

template<typename K , typename V >

size_type limitedmap< K, V >::size ( ) const

inline

update()

template<typename K , typename V >

void limitedmap< K, V >::update ( const_iterator  itIn, const mapped_type &  v  )

inline

Member Data Documentation

map

template<typename K , typename V >

std::map<K, V> limitedmap< K, V >::map

protected

nMaxSize

template<typename K , typename V >

size_type limitedmap< K, V >::nMaxSize

protected

rmap

template<typename K , typename V >

std::multimap<V, iterator> limitedmap< K, V >::rmap

protected

---

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

• src/limitedmap.h