106 * |
106 * |
107 * @return 0 if the node contains the data, |
107 * @return 0 if the node contains the data, |
108 * 1 if one of the children might contain the data, |
108 * 1 if one of the children might contain the data, |
109 * -1 if neither the node, nor the children contains the data |
109 * -1 if neither the node, nor the children contains the data |
110 */ |
110 */ |
111 int (*cx_tree_search_func)(void const *node, void const* data); |
111 typedef int (*cx_tree_search_func)(void const *node, void const* data); |
112 |
112 |
113 #ifdef __cplusplus |
113 #ifdef __cplusplus |
114 } // extern "C" |
114 } // extern "C" |
115 #endif |
115 #endif |
116 |
116 |