1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/* $OpenBSD: tries.c,v 1.2 1999/02/24 06:31:08 millert Exp $ */
/****************************************************************************
* Copyright (c) 1998 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Thomas E. Dickey <dickey@clark.net> 1997 *
****************************************************************************/
/*
** tries.c
**
** Functions to manage the tree of partial-completions for keycodes.
**
*/
#include <curses.priv.h>
MODULE_ID("$From: tries.c,v 1.10 1999/02/19 11:52:11 tom Exp $")
/*
* Expand a keycode into the string that it corresponds to, returning null if
* no match was found, otherwise allocating a string of the result.
*/
char *_nc_expand_try(struct tries *tree, unsigned short code, int *count, size_t len)
{
struct tries *ptr = tree;
char *result = 0;
if (code != 0) {
while (ptr != 0) {
if ((result = _nc_expand_try(ptr->child, code, count, len + 1)) != 0) {
break;
}
if (ptr->value == code) {
*count -= 1;
if (*count == -1) {
result = typeCalloc(char, len+2);
break;
}
}
ptr = ptr->sibling;
}
}
if (result != 0) {
if ((result[len] = ptr->ch) == 0)
*((unsigned char *)(result+len)) = 128;
#ifdef TRACE
if (len == 0)
_tracef("expand_key %s %s", _trace_key(code), _nc_visbuf(result));
#endif
}
return result;
}
/*
* Remove a code from the specified tree, freeing the unused nodes. Returns
* true if the code was found/removed.
*/
int _nc_remove_key(struct tries **tree, unsigned short code)
{
if (code == 0)
return FALSE;
while (*tree != 0) {
if (_nc_remove_key(&(*tree)->child, code)) {
return TRUE;
}
if ((*tree)->value == code) {
if((*tree)->child) {
/* don't cut the whole sub-tree */
(*tree)->value = 0;
} else {
struct tries *to_free = *tree;
*tree = (*tree)->sibling;
free(to_free);
}
return TRUE;
}
tree = &(*tree)->sibling;
}
return FALSE;
}
/*
* Remove a string from the specified tree, freeing the unused nodes. Returns
* true if the string was found/removed.
*/
int _nc_remove_string(struct tries **tree, char *string)
{
if (string == 0 || *string == 0)
return FALSE;
while (*tree != 0) {
if (_nc_remove_string(&(*tree)->child, string+1)) {
return TRUE;
}
if ((unsigned char)(*tree)->ch == (unsigned char)*string) {
if((*tree)->child) {
/* don't cut the whole sub-tree */
(*tree)->value = 0;
} else {
struct tries *to_free = *tree;
*tree = (*tree)->sibling;
free(to_free);
}
return TRUE;
}
tree = &(*tree)->sibling;
}
return FALSE;
}
|
