Lines Matching refs:tree
36 ** Functions to manage the tree of partial-completions for keycodes.
49 _nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len)
51 TRIES *ptr = tree;
86 * Remove a code from the specified tree, freeing the unused nodes. Returns
90 _nc_remove_key(TRIES ** tree, unsigned code)
92 T((T_CALLED("_nc_remove_key(%p,%d)"), (void *) tree, code));
97 while (*tree != 0) {
98 if (_nc_remove_key(&(*tree)->child, code)) {
101 if ((*tree)->value == code) {
102 if ((*tree)->child) {
103 /* don't cut the whole sub-tree */
104 (*tree)->value = 0;
106 TRIES *to_free = *tree;
107 *tree = (*tree)->sibling;
112 tree = &(*tree)->sibling;
118 * Remove a string from the specified tree, freeing the unused nodes. Returns
122 _nc_remove_string(TRIES ** tree, const char *string)
124 T((T_CALLED("_nc_remove_string(%p,%s)"), (void *) tree, _nc_visbuf(string)));
129 while (*tree != 0) {
130 if (UChar((*tree)->ch) == UChar(*string)) {
132 returnCode(_nc_remove_string(&(*tree)->child, string + 1));
133 if ((*tree)->child == 0) {
134 TRIES *to_free = *tree;
135 *tree = (*tree)->sibling;
142 tree = &(*tree)->sibling;