TreeMap< K, T, C, E, A > Class Template Reference

#include <elm/data/TreeMap.h>

Inheritance diagram for TreeMap< K, T, C, E, A >:

Classes
class	Iter
class	KeyIter
class	PairIter

Public Member Functions
	TreeMap ()
	TreeMap (const TreeMap< K, T, C > &map)
const Comparator< K > &	comparator () const
Comparator< K > &	comparator ()
E &	equivalence ()
A &	allocator ()
int	count (void) const
bool	contains (const K &k) const
bool	isEmpty (void) const
	operator bool (void) const
Iter	begin () const
Iter	end () const
const T &	get (const K &key, const T &def) const
Option< T >	get (const K &key) const
bool	hasKey (const K &k) const
Iterable< KeyIter >	keys () const
Iterable< PairIter >	pairs () const
void	put (const K &key, const T &value)
void	remove (const K &key)
void	remove (const Iter &iter)
Public Member Functions inherited from Equiv< T >
bool	isEqual (const T &v1, const T &v2) const

Additional Inherited Members
Public Types inherited from Equiv< T >
typedef T	t
Static Public Member Functions inherited from Equiv< T >
static bool	equals (const T &v1, const T &v2)
Static Public Attributes inherited from Equiv< T >
static Equiv< T >	def

Constructor & Destructor Documentation

TreeMap() [1/2]

TreeMap ( )

inline

TreeMap() [2/2]

TreeMap ( const TreeMap< K, T, C > &  map )

inline

Member Function Documentation

allocator()

A& allocator ( )

inline

References TreeBag< T, C, A >::allocator().

begin()

Iter begin ( ) const

inline

References TreeBag< T, C, A >::begin().

comparator() [1/2]

Comparator<K>& comparator ( )

inline

References TreeBag< T, C, A >::comparator().

comparator() [2/2]

const Comparator<K>& comparator ( ) const

inline

References TreeBag< T, C, A >::comparator().

contains()

bool contains ( const K &  k ) const

inline

References TreeBag< T, C, A >::find().

count()

int count ( void  ) const

inline

References TreeBag< T, C, A >::count().

end()

Iter end ( ) const

inline

References TreeBag< T, C, A >::end().

Referenced by TreeMap< K, T, C, E, A >::keys(), and TreeMap< K, T, C, E, A >::pairs().

equivalence()

E& equivalence ( )

inline

get() [1/2]

Option<T> get ( const K &  key ) const

inline

References TreeBag< T, C, A >::find(), elm::none, elm::pair(), and Pair< T1, T2 >::snd.

get() [2/2]

const T& get ( const K &  key, const T &  def  ) const

inline

References Equiv< T >::def, TreeBag< T, C, A >::find(), elm::pair(), and Pair< T1, T2 >::snd.

hasKey()

bool hasKey ( const K &  k ) const

inline

References TreeBag< T, C, A >::contains().

isEmpty()

bool isEmpty ( void  ) const

inline

References TreeBag< T, C, A >::isEmpty().

Referenced by TreeMap< K, T, C, E, A >::operator bool().

keys()

Iterable<KeyIter> keys ( ) const

inline

References TreeMap< K, T, C, E, A >::end(), and elm::subiter().

operator bool()

operator bool ( void  ) const

inline

References TreeMap< K, T, C, E, A >::isEmpty().

pairs()

Iterable<PairIter> pairs ( ) const

inline

References TreeMap< K, T, C, E, A >::end(), and elm::subiter().

put()

void put ( const K &  key, const T &  value  )

inline

References TreeBag< T, C, A >::add().

remove() [1/2]

void remove ( const Iter &  iter )

inline

References iter::iter(), and TreeBag< T, C, A >::remove().

remove() [2/2]

void remove ( const K &  key )

inline

References elm::pair(), and TreeBag< T, C, A >::remove().

---

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

• include/elm/data/TreeMap.h