|
| GATree (const T &t) |
|
| GATree (const GATree< T > &orig) |
|
GATree< T > & | operator= (const GATree< T > &orig) |
|
GATree< T > * | clone (unsigned int i=0) const |
|
void | copy (const GATree< T > &orig) |
|
int | destroy () |
|
int | swaptree (GATree< T > *t) |
|
int | swaptree (unsigned int a, unsigned int b) |
|
int | swap (unsigned int a, unsigned int b) |
|
GATree< T > * | remove () |
|
int | insert (GATree< T > *t, GATreeBASE::Location where=GATreeBASE::BELOW) |
|
int | insert (const T &t, GATreeBASE::Location where=GATreeBASE::BELOW) |
|
T * | root () |
|
T * | current () |
|
T * | next () |
|
T * | prev () |
|
T * | parent () |
|
T * | child () |
|
T * | eldest () |
|
T * | youngest () |
|
T * | warp (unsigned int i) |
|
T * | warp (const GATreeIter< T > &i) |
|
int | nchildren () |
|
int | nsiblings () |
|
| GATreeBASE (GANodeBASE *n) |
|
GANodeBASE * | remove (GANodeBASE *n) |
|
int | insert (GANodeBASE *n, GANodeBASE *idx, Location where=BELOW) |
|
int | swaptree (GANodeBASE *a, GANodeBASE *b) |
|
int | swapnode (GANodeBASE *a, GANodeBASE *b) |
|
int | size () const |
|
int | depth () const |
|
int | ancestral (unsigned int i, unsigned int j) const |
|
|
int | insert (GANode< T > *n, GANode< T > *idx, GATreeBASE::Location where=GATreeBASE::BELOW) |
|
|
enum | Location { ROOT = 0
, BEFORE
, AFTER
, BELOW
} |
|
enum | { NO_ERR = 0
, ERR = -1
} |
|
The documentation for this class was generated from the following file: