![]() |
Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/avl/Set.h>
Public Types | |
typedef T | t |
typedef Set< T, C > | self_t |
typedef GenTree< T, IdAdapter< T >, C > | base_t |
![]() | |
typedef T | t |
typedef GenTree< T, IdAdapter< T >, elm::Comparator< T >, DefaultAlloc > | self_t |
![]() | |
typedef T | t |
Public Member Functions | |
self_t & | operator+= (const T &x) |
self_t & | operator-= (const T &x) |
self_t & | operator= (const self_t &s) |
void | insert (const T &x) |
bool | subsetOf (const Set< T, C > &s) const |
void | join (const Set< T, C > &s) |
void | diff (const Set< T, C > &s) |
void | meet (const Set< T, C > &s) |
self_t & | operator+= (const Set< T, C > &s) |
self_t & | operator|= (const Set< T, C > &s) |
self_t & | operator-= (const Set< T, C > &s) |
self_t & | operator&= (const Set< T, C > &s) |
self_t & | operator*= (const Set< T, C > &s) |
self_t | operator+ (const Set< T, C > &s) const |
self_t | operator| (const Set< T, C > &s) const |
self_t | operator- (const Set< T, C > &s) const |
self_t | operator* (const Set< T, C > &s) const |
self_t | operator& (const Set< T, C > &s) const |
![]() | |
GenTree (void) | |
GenTree (const GenTree< T > &tree) | |
~GenTree (void) | |
const elm::Comparator< T > & | comparator () const |
elm::Comparator< T > & | comparator () |
const DefaultAlloc & | allocator () const |
DefaultAlloc & | allocator () |
T * | get (const typename IdAdapter< T > ::key_t &key) |
const T * | get (const typename IdAdapter< T > ::key_t &key) const |
void | set (const T &item) |
void | removeByKey (const typename IdAdapter< T > ::key_t &item) |
int | count (void) const |
bool | contains (const typename IdAdapter< T > ::key_t &item) const |
bool | containsAll (const CC &c) const |
bool | isEmpty (void) const |
operator bool (void) const | |
Iter | begin (void) const |
Iter | end (void) const |
bool | equals (const GenTree< T, IdAdapter< T >, elm::Comparator< T > > &tree) const |
bool | operator== (const GenTree< T, IdAdapter< T >, elm::Comparator< T > > &tree) const |
bool | operator!= (const GenTree< T, IdAdapter< T >, elm::Comparator< T > > &tree) const |
void | clear (void) |
void | add (const T &item) |
void | addAll (const CC &c) |
void | remove (const T &x) |
void | remove (const Iter &iter) |
void | removeAll (const CC &c) |
self_t & | operator+= (const T &x) |
self_t & | operator-= (const T &x) |
void | copy (const GenTree< T, IdAdapter< T >, elm::Comparator< T > > &tree) |
GenTree< T, IdAdapter< T >, elm::Comparator< T > > & | operator= (const GenTree< T, IdAdapter< T >, elm::Comparator< T > > &tree) |
![]() | |
int | count (void) const |
![]() | |
int | doCompare (const T &v1, const T &v2) const |
![]() | |
t::ptr | allocate (t::size size) const |
void | free (t::ptr p) const |
template<class T > | |
T * | alloc () const |
Additional Inherited Members | |
![]() | |
static int | compare (const T &v1, const T &v2) |
![]() | |
enum | dir_t { LEFT = -1, NONE = 0, RIGHT = +1 } |
typedef signed char | balance_t |
![]() | |
Node * | root (void) const |
void | remove (Stack &s, Node *n) |
int | compare (const typename IdAdapter< T > ::key_t &k1, const typename IdAdapter< T > ::key_t &k2) const |
Node * | lookup (Stack &s, const typename IdAdapter< T > ::key_t &key) const |
Node * | find (const typename IdAdapter< T > ::key_t &key) const |
void | exchange (Node *n, Node *p) |
![]() | |
AbstractTree (void) | |
Node ** | link (const Stack &s) |
void | exchange (Node *n, Node *m) |
void | insert (Stack &stack, Node *node) |
void | rotateRight (Stack &s) |
void | rotateLeft (Stack &s) |
void | remove (Stack &stack, Node *n) |
Node * | leftMost (Stack &s, Node *n) |
![]() | |
Node * | _root |
int | _cnt |
![]() | |
static const int | MAX_HEIGHT = 32 |
Implements a set collection based on an AVL tree, that is, supporting access and modifications with a O(log n) complexity.
T | Type of stored items. |
C | Comparator used to sort the items (must implements the elm::concept::Comparator<T> concept, as a default elm::Comparator<T>). |
typedef T t |
References GenTree< T, K, C, A >::remove().
Referenced by Set< T, C >::meet(), Set< T, C >::operator-(), and Set< T, C >::operator-=().
|
inline |
References GenTree< T, K, C, A >::add().
Referenced by Set< T, C >::operator+=().
References GenTree< T, K, C, A >::add().
Referenced by Set< T, C >::operator+(), Set< T, C >::operator+=(), Set< T, C >::operator|(), and Set< T, C >::operator|=().
References Set< T, C >::meet().
References Set< T, C >::meet().
References Set< T, C >::meet().
References Set< T, C >::meet().
References Set< T, C >::join().
References Set< T, C >::join().
|
inline |
References Set< T, C >::insert().
References Set< T, C >::diff().
References Set< T, C >::diff().
|
inline |
References GenTree< T, K, C, A >::remove().
References GenTree< T, K, C, A >::copy().
References Set< T, C >::join().
References Set< T, C >::join().