#include <elm/avl/GenTree.h>
|
| | VisitStack (void) |
| |
| | VisitStack (Node *n) |
| |
| void | copyLeft (A *a, VisitStack &s) |
| |
| void | copyRight (A *a, VisitStack &s) |
| |
| | StaticStack (void) |
| |
| | StaticStack (const StaticStack< Node *, N > &s) |
| |
| void | copy (const StaticStack< Node *, N > &s) |
| |
| StaticStack< Node *, N > & | operator= (const StaticStack< Node *, N > &s) |
| |
| bool | isEmpty (void) const |
| |
| const Node * & | top (void) const |
| |
| const Node * & | pop (void) |
| |
| void | push (const Node * &v) |
| |
| void | reset (void) |
| |
| int | count (void) const |
| |
| bool | contains (const Node * &v) |
| |
| bool | contains (const StaticStack< Node *, 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< Node *, N > &s) const |
| |
| bool | operator== (const StaticStack< Node *, N > &s) const |
| |
| bool | operator!= (const StaticStack< Node *, N > &s) const |
| |
| bool | operator<= (const StaticStack< Node *, N > &s) const |
| |
| bool | operator>= (const StaticStack< Node *, N > &s) const |
| |
| bool | operator< (const StaticStack< Node *, N > &s) const |
| |
| bool | operator> (const StaticStack< Node *, N > &s) const |
| |
◆ VisitStack() [1/2]
◆ VisitStack() [2/2]
◆ copyLeft()
◆ copyRight()
The documentation for this class was generated from the following file: