MNdictionary< K, I > Class Template Reference

#include <MNdictionary.h>

Inheritance diagram for MNdictionary< K, I >:

[legend]List of all members.

Inlined member functions of the MNdictionary template
K	key (const void *it) const
I	inf (const void *it) const
I &	operator[] (const void *it) const
void *	insert (const K &k, const I &i)
void *	lookup (const K &k) const
I	access (const K &k) const
void	del (const K &k)
void	del_item (const void *it)
void	change_inf (const void *it, const I &i)
void	clear ()
int	size () const
bool	empty () const
void *	first_item (void *start=NULL) const
void *	last_item () const
void *	next_item (const void *it) const
Public Member Functions
	MNdictionary ()
virtual	~MNdictionary ()
virtual int	compare (const K &x, const K &y) const =0
int	compare_int (const int &x, const int &y) const

template<class K, class I>
class MNdictionary< K, I >

---

Constructor & Destructor Documentation

template<class K, class I> MNdictionary< K, I >::MNdictionary (   )  [inline]

template<class K, class I> virtual MNdictionary< K, I >::~MNdictionary (   )  [inline, virtual]

---

Member Function Documentation

template<class K, class I> I MNdictionary< K, I >::access (  const K &  k  )  const [inline]

template<class K, class I> void MNdictionary< K, I >::change_inf (  const void *  it, const I &  i )  [inline]

template<class K, class I> void MNdictionary< K, I >::clear (   )  [inline]

template<class K, class I> virtual int MNdictionary< K, I >::compare (  const K &  x, const K &  y )  const [pure virtual]

Implemented in StringDictionary< I >, SH::Base::SHSide::EndpointTable, OrigServerDictionary, and CacheDictionary.

template<class K, class I> int MNdictionary< K, I >::compare_int (  const int &  x, const int &  y )  const [inline]

template<class K, class I> void MNdictionary< K, I >::del (  const K &  k  )  [inline]

template<class K, class I> void MNdictionary< K, I >::del_item (  const void *  it  )  [inline]

template<class K, class I> bool MNdictionary< K, I >::empty (   )  const [inline]

template<class K, class I> void * MNdictionary< K, I >::first_item (  void *  start = NULL  )  const [inline]

template<class K, class I> I MNdictionary< K, I >::inf (  const void *  it  )  const [inline]

template<class K, class I> void * MNdictionary< K, I >::insert (  const K &  k, const I &  i )  [inline]

template<class K, class I> K MNdictionary< K, I >::key (  const void *  it  )  const [inline]

template<class K, class I> void * MNdictionary< K, I >::last_item (   )  const [inline]

template<class K, class I> void * MNdictionary< K, I >::lookup (  const K &  k  )  const [inline]

template<class K, class I> void * MNdictionary< K, I >::next_item (  const void *  it  )  const [inline]

template<class K, class I> I & MNdictionary< K, I >::operator[] (  const void *  it  )  const [inline]

template<class K, class I> int MNdictionary< K, I >::size (   )  const [inline]

---

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

• MNdictionary.h

---