Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/avl/GenTree.h>
Public Member Functions | |
Node * | topNode (void) const |
Public Member Functions inherited from AbstractTree::Stack | |
Stack (void) | |
void | push (Node *node, dir_t dir) |
dir_t | topDir (void) const |
Node * | topNode (void) const |
Public Member Functions inherited from StaticStack< Pair< Node *, dir_t >, MAX_HEIGHT > | |
StaticStack (void) | |
StaticStack (const StaticStack< Pair< Node *, dir_t >, N > &s) | |
void | copy (const StaticStack< Pair< Node *, dir_t >, N > &s) |
StaticStack< Pair< Node *, dir_t >, N > & | operator= (const StaticStack< Pair< Node *, dir_t >, N > &s) |
bool | isEmpty (void) const |
const Pair< Node *, dir_t > & | top (void) const |
const Pair< Node *, dir_t > & | pop (void) |
void | push (const Pair< Node *, dir_t > &v) |
void | reset (void) |
int | count (void) const |
bool | contains (const Pair< Node *, dir_t > &v) |
bool | contains (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | containsAll (const C &coll) |
operator bool (void) const | |
Iter | begin (void) const |
Iter | end (void) const |
Iter | items (void) const |
Iter | operator* (void) const |
bool | equals (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator== (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator!= (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator<= (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator>= (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator< (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
bool | operator> (const StaticStack< Pair< Node *, dir_t >, N > &s) const |
References AbstractTree::Stack::topNode().