2 * (c) Oleg Puchinin 2007
3 * graycardinalster@gmail.com
17 List
* childNodes
; // node_t *
20 typedef void (node_f
) (node_t
*);
32 node_t
* newNode (node_t
* parent
, char * key
= NULL
, char * userData
= NULL
);
33 char * freeNode (node_t
* node
, Dfunc_t f
);
34 List
* childs (node_t
* node
);
35 node_t
* searchDown (node_t
* node
, char *key
, uint32_t ID
= 0);
36 node_t
* searchUp (node_t
* node
, char *key
, uint32_t ID
= 0);
37 List
* keyChilds (node_t
* node
, char * key
, uint32_t ID
= 0);
38 void foreach (node_f fn
, node_t
* m_node
= NULL
);