|
Files |
| file | eg_ebtree.ex.c |
| file | eg_ebtree.h |
Data Structures |
| struct | EGeBTree_t |
| | Basic structure of a tree node, note that a node in a tree is in itself a (sub)tree. More...
|
Defines |
| #define | EG_EBTREE_LEFT 1 |
| | Left Child Index.
|
| #define | EG_EBTREE_PARENT 0 |
| | Parent index.
|
| #define | EG_EBTREE_RIGHT 2 |
| | Right Child Index.
|
| #define | EGeBTreeAddLeft(parent, child) |
| | Add a left child to a node in a tree.
|
| #define | EGeBTreeAddRight(parent, child) |
| | Add a right child to a node in a tree.
|
| #define | EGeBTreeClear(tn) |
| | Free any internal memory (not allocated by the user) related to this structure.
|
| #define | EGeBTreeCut(member) |
| | Cut the given node from the tree containing it (and so create a sub-tree).
|
| #define | EGeBTreeDel(leaf) |
| | Erase a leaf node from a tree.
|
| #define | EGeBTreeGetFirst(node) |
| | return the first node in the (sub-)tree (according to the in-order).
|
| #define | EGeBTreeGetLast(node) |
| | return the last node in the (sub-)tree (according to the in-order).
|
| #define | EGeBTreeGetLeft(member) ((member)->cn[EG_EBTREE_LEFT]) |
| #define | EGeBTreeGetNext(node) |
| | return the successor of the given node in it's tree according to the in-order ordering.
|
| #define | EGeBTreeGetParent(member) ((member)->cn[EG_EBTREE_PARENT]) |
| #define | EGeBTreeGetPrev(node) |
| | return the predecesor of the given node in it's tree according to the in-order ordering.
|
| #define | EGeBTreeGetRight(member) ((member)->cn[EG_EBTREE_RIGHT]) |
| #define | EGeBTreeGetRoot(member) |
| | return the root of the tree containing the given tree node.
|
| #define | EGeBTreeInit(tn) (*(tn) = (EGeBTree_t){{0,0,0}}) |
| | Initialize a tree structure. It let it as a tree containing only itself. and allocate any internal memory (not allocated by the user).
|
| #define | EGeBTreeReplace(old, replacement) |
| | Replace a node in a tree.
|
| #define | EGeBTreeReset(tn) EGeBTreeInit(tn) |
| | Let a tree just as after an init call.
|
Typedefs |
| typedef EGeBTree_t | EGeBTree_t |
| | Basic structure of a tree node, note that a node in a tree is in itself a (sub)tree.
|
Functions |
| static int | ebt_display (FILE *out_f, EGeBTree_t *root) |
| | display the given tree in-order.
|
| static int | ebt_parseargs (int argc, char **argv, unsigned int *s, unsigned int *z) |
| | parse external arguments.
|
| static void | ebt_usage (char const *const program) |
| | usage function, if we give the wrong number of parameters, we return an error message and print a help.
|
| int | main (int argc, char **argv) |
| | Tester program for the projection structure and functions.
|
Variables |
| static int | verbose = 0 |
![\[ \psset{unit=1cm,arrows=->} \begin{pspicture}(-1,-1)(7,3) \rput(0,0){\circlenode{a}{1}} \rput(1,1){\circlenode{b}{2}} \rput(2,0){\circlenode{c}{3}} \rput(3,2){\circlenode{d}{4}} \rput(4,0){\circlenode{e}{5}} \rput(5,1){\circlenode{f}{6}} \rput(6,0){\circlenode{g}{7}} \ncline{b}{a} \ncline{b}{c} \ncline{d}{b} \ncline{d}{f} \ncline{f}{e} \ncline{f}{g} \end{pspicture} \]](form_9.png)
