24 #ifndef DOUGLAS_MARK_ROYER_LIBRARY_COMMON_NODESEARCH_H 25 #define DOUGLAS_MARK_ROYER_LIBRARY_COMMON_NODESEARCH_H 28 #ifdef BUILDING_SAS_COMMON_LIBRARY 29 #include "strsearch.hpp" 31 #include <SaS/Common/strsearch.hpp> 123 static T ** Search(
const T * Key,
124 Tree_t<T> *
const * VRootP,
127 T ** Results = (T**) strsearch(Key,
129 (strcompare_fn_t)CompareFunction);
146 static T ** Find(
const T * Key,
147 Tree_t<T> *
const * VRootP,
150 T ** Results = (T**)strfind(Key,
152 (strcompare_fn_t)CompareFunction);
169 static T ** Delete(
const void * Key,
173 T ** Results = (T**)strdelete(Key,
175 (strcompare_fn_t)CompareFunction);
200 static void Walk(
const Tree_t<T> * VRoot,
203 strwalk(VRoot, (straction_fn_t)Action);
215 #endif // DOUGLAS_MARK_ROYER_LIBRARY_COMMON_NODESEARCH_H
const Tree_t< T > * const_Tree
A const_Tree is a (const Tree_t<T>*)
void(* TreeAction_fn_t)(const Tree_t< T > **, VISIT Leaf, int Depth)
Perform action on Tree_t<T>
Copyright Douglas Mark Royer DouglasRoyer@gmail.com.
void(* TreeFree_fn_t)(Tree_t< T > *TreeToFree)
Free Tree_t.
int(* TreeCompare_fn_t)(const T *One, const T *Two)
Tree compare function.
Tree_t< T > * Tree
A Tree is a (Tree_t<T>*)