elm::genstruct::GenSortedBinTree< T, K, C > Class Template Reference

#include <elm/genstruct/SortedBinTree.h>

Classes
class	Iterator

Public Member Functions
	GenSortedBinTree (void)
	~GenSortedBinTree (void)
int	count (void) const
bool	contains (const T &value) const
bool	isEmpty (void) const
	operator bool (void) const
void	clear (void)
void	add (const T &value)
template<template< class _ > class S>
void	addAll (const S< T > &items)
void	remove (const T &value)
template<template< class _ > class S>
void	removeAll (const S< T > &items)
void	remove (const Iterator &iter)
const T *	look (const typename K::key_t &key) const
T *	look (const typename K::key_t &key)

Detailed Description

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>
class elm::genstruct::GenSortedBinTree< T, K, C >

Generative class for sorted binary trees. Base class of SortedBinTree or SortedBinMap.

Parameters

T	Type of items in the tree.
K	Key accessor (must implement elm::concept::Key concept, Id<T> as a default).
C	Comparator for keys (must implement elm::concept::Comparator<T>,elm::Comparator<T> as a default).

Constructor & Destructor Documentation

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

elm::genstruct::GenSortedBinTree< T, K, C >::GenSortedBinTree

(

void

)

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

elm::genstruct::GenSortedBinTree< T, K, C >::~GenSortedBinTree

(

void

)

Member Function Documentation

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

void elm::genstruct::GenSortedBinTree< T, K, C >::add

(

const T &

value

)

Referenced by elm::genstruct::GenSortedBinTree< value_t, PairAdapter< elm::String, elm::option::Option * >, C >::addAll(), and elm::genstruct::SortedBinMap< char, elm::option::Option * >::put().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

template<template< class _ > class S>

void elm::genstruct::GenSortedBinTree< T, K, C >::addAll

(

const S< T > &

items

)

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

void elm::genstruct::GenSortedBinTree< T, K, C >::clear

(

void

)

Referenced by elm::genstruct::GenSortedBinTree< value_t, PairAdapter< elm::String, elm::option::Option * >, C >::~GenSortedBinTree().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

bool elm::genstruct::GenSortedBinTree< T, K, C >::contains

(

const T &

value

)

const

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

int elm::genstruct::GenSortedBinTree< T, K, C >::count

(

void

)

const

Referenced by elm::genstruct::SortedBinMap< char, elm::option::Option * >::count().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

bool elm::genstruct::GenSortedBinTree< T, K, C >::isEmpty

(

void

)

const

Referenced by elm::genstruct::GenSortedBinTree< value_t, PairAdapter< elm::String, elm::option::Option * >, C >::clear(), elm::genstruct::SortedBinMap< char, elm::option::Option * >::isEmpty(), and elm::genstruct::GenSortedBinTree< value_t, PairAdapter< elm::String, elm::option::Option * >, C >::operator bool().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

const T* elm::genstruct::GenSortedBinTree< T, K, C >::look

(

const typename K::key_t &

key

)

const

Referenced by elm::genstruct::SortedBinMap< char, elm::option::Option * >::contains(), elm::genstruct::SortedBinMap< char, elm::option::Option * >::get(), elm::genstruct::SortedBinMap< char, elm::option::Option * >::hasKey(), and elm::genstruct::SortedBinMap< char, elm::option::Option * >::remove().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

T* elm::genstruct::GenSortedBinTree< T, K, C >::look

(

const typename K::key_t &

key

)

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

elm::genstruct::GenSortedBinTree< T, K, C >::operator bool

(

void

)

const

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

void elm::genstruct::GenSortedBinTree< T, K, C >::remove

(

const T &

value

)

Referenced by elm::genstruct::SortedBinMap< char, elm::option::Option * >::remove().

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

void elm::genstruct::GenSortedBinTree< T, K, C >::remove

(

const Iterator &

iter

)

template<class T, class K = IdAdapter<T>, class C = Comparator<typename K::t>>

template<template< class _ > class S>

void elm::genstruct::GenSortedBinTree< T, K, C >::removeAll

(

const S< T > &

items

)

---

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

• include/elm/genstruct/SortedBinTree.h