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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
#include <jim.h>
int Jim_treeInit(Jim_Interp *interp)
{
if (Jim_PackageProvide(interp, "tree", "1.0", JIM_ERRMSG)) return JIM_ERR;
return Jim_EvalSource(interp, "tree.tcl", 1, "\n"
"\n"
"\n"
"\n"
"\n"
"package require oo\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"\n"
"class tree {\n"
" tree {root {}}\n"
" parents {root {}}\n"
" children {root {}}\n"
" nodeid 0\n"
"}\n"
"\n"
"\n"
"tree method depth {node} {\n"
" set depth 0\n"
" while {$node ne \"root\"} {\n"
" incr depth\n"
" set node [dict get $parents $node]\n"
" }\n"
" return $depth\n"
"}\n"
"\n"
"tree method parent {node} {\n"
" dict get $parents $node\n"
"}\n"
"\n"
"tree method children {node} {\n"
" dict get $children $node\n"
"}\n"
"\n"
"tree method numchildren {node} {\n"
" llength [dict get $children $node]\n"
"}\n"
"\n"
"tree method next {node} {\n"
"\n"
" set siblings [dict get $children [dict get $parents $node]]\n"
"\n"
" set i [lsearch $siblings $node]\n"
" incr i\n"
" lindex $siblings $i\n"
"}\n"
"\n"
"tree method set {node key value} {\n"
" dict set tree $node $key $value\n"
" return $value\n"
"}\n"
"\n"
"tree method get {node key} {\n"
" dict get $tree $node $key\n"
"}\n"
"\n"
"tree method keyexists {node key} {\n"
" dict exists $tree $node $key\n"
"}\n"
"\n"
"tree method getall {node} {\n"
" dict get $tree $node\n"
"}\n"
"\n"
"tree method insert {node {index end}} {\n"
"\n"
"\n"
" set childname node[incr nodeid]\n"
" dict set tree $childname {}\n"
"\n"
"\n"
" dict set children $childname {}\n"
"\n"
"\n"
" dict set parents $childname $node\n"
"\n"
"\n"
" set nodes [dict get $children $node]\n"
" dict set children $node [linsert $nodes $index $childname]\n"
"\n"
" return $childname\n"
"}\n"
"\n"
"tree method delete {node} {\n"
" if {$node eq \"root\"} {\n"
" return -code error \"can't delete root node\"\n"
" }\n"
" $self walk $node dfs {action subnode} {\n"
" if {$action eq \"exit\"} {\n"
"\n"
" dict unset tree $subnode\n"
"\n"
" set parent [$self parent $subnode]\n"
" if {$parent ne \"\"} {\n"
" set siblings [dict get $children $parent]\n"
" set i [lsearch $siblings $subnode]\n"
" dict set children $parent [lreplace $siblings $i $i]\n"
" }\n"
" }\n"
" }\n"
"}\n"
"\n"
"\n"
"tree method lappend {node key args} {\n"
" if {[dict exists $tree $node $key]} {\n"
" set result [dict get $tree $node $key]\n"
" }\n"
" lappend result {*}$args\n"
" dict set tree $node $key $result\n"
" return $result\n"
"}\n"
"\n"
"\n"
"\n"
"tree method walk {node type vars code} {\n"
"\n"
" lassign $vars actionvar namevar\n"
"\n"
" set n $node\n"
"\n"
" if {$type ne \"child\"} {\n"
" upvar 2 $namevar name $actionvar action\n"
"\n"
"\n"
" set name $node\n"
" set action enter\n"
"\n"
" uplevel 2 $code\n"
" }\n"
"\n"
" if {$type eq \"dfs\"} {\n"
"\n"
" foreach child [$self children $n] {\n"
" uplevel 2 [list $self walk $child $type $vars $code]\n"
" }\n"
" } elseif {$type ne \"none\"} {\n"
"\n"
" foreach child [$self children $n] {\n"
" uplevel 2 [list $self walk $child none $vars $code]\n"
" }\n"
"\n"
"\n"
" foreach child [$self children $n] {\n"
" uplevel 2 [list $self walk $child child $vars $code]\n"
" }\n"
" }\n"
"\n"
" if {$type ne \"child\"} {\n"
"\n"
" set name $node\n"
" set action exit\n"
"\n"
" uplevel 2 $code\n"
" }\n"
"}\n"
"\n"
"tree method dump {} {\n"
" $self walk root dfs {action n} {\n"
" set indent [string repeat \" \" [$self depth $n]]\n"
" if {$action eq \"enter\"} {\n"
" puts \"$indent$n ([$self getall $n])\"\n"
" }\n"
" }\n"
" puts \"\"\n"
"}\n");
}{ ... }