Lines Matching refs:L_
27 #undef L_
50 #define L_ AVL_UNIQUE
54 #define L_(X) X
88 L_(avl);
92 L_SC void L_(init)(L_(avl) *tree);
94 L_SC int L_(is_empty)(L_(avl) *tree);
96 L_SC AVL_HANDLE L_(insert)(L_(avl) *tree, AVL_HANDLE h);
98 L_SC AVL_HANDLE L_(search)(L_(avl) *tree, AVL_KEY k, avl_search_type st);
100 L_SC AVL_HANDLE L_(search_least)(L_(avl) *tree);
102 L_SC AVL_HANDLE L_(search_greatest)(L_(avl) *tree);
104 L_SC AVL_HANDLE L_(remove)(L_(avl) *tree, AVL_KEY k);
106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node);
110 L_SC int L_(build)(
111 L_(avl) *tree, AVL_BUILD_ITER_TYPE p, L_SIZE num_nodes);
169 L_(avl) *tree_;
183 L_(iter);
187 L_SC void L_(start_iter)(
188 L_(avl) *tree, L_(iter) *iter, AVL_KEY k, avl_search_type st);
190 L_SC void L_(start_iter_least)(L_(avl) *tree, L_(iter) *iter);
192 L_SC void L_(start_iter_greatest)(L_(avl) *tree, L_(iter) *iter);
194 L_SC AVL_HANDLE L_(get_iter)(L_(iter) *iter);
196 L_SC void L_(incr_iter)(L_(iter) *iter);
198 L_SC void L_(decr_iter)(L_(iter) *iter);
200 L_SC void L_(init_iter)(L_(iter) *iter);
221 #undef L_