Definition in file eg_ebtree.h.
#include "eg_macros.h"
Include dependency graph for eg_ebtree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.
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. | |
1.4.5