blob: 9d00fda625622808b4b54f5812eb08d2729ccf8a (
plain)
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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
(load "../common")
(defvarl tr (tree))
(defvarl keys '(0 6 8 11 10 2 16 3 17 7 19 12 15 13 18 4 14 5 1 9))
(test tr #T(()))
(mtest
(treep tr) t
(treep 42) nil)
(mtest
(len #T()) 0
(len #T(() 1)) 1
(len #T(() 1 2)) 2
(len #T(() 1 2 3)) 3
(len #T(() 1 1 1)) 3)
(each ((n keys))
(tree-insert tr n))
(mtest
(tree-lookup tr 0) 0
(tree-lookup tr 1) 1
(tree-lookup tr 2) 2
(tree-lookup tr 3) 3
(tree-lookup tr 4) 4
(tree-lookup tr 5) 5
(tree-lookup tr 6) 6
(tree-lookup tr 7) 7
(tree-lookup tr 8) 8
(tree-lookup tr 9) 9
(tree-lookup tr 10) 10
(tree-lookup tr 11) 11
(tree-lookup tr 12) 12
(tree-lookup tr 13) 13
(tree-lookup tr 14) 14
(tree-lookup tr 15) 15
(tree-lookup tr 16) 16
(tree-lookup tr 17) 17
(tree-lookup tr 18) 18
(tree-lookup tr 19) 19)
(mtest
[tr 0] 0
[tr 5] 5
[tr 19] 19)
(mtest
[tr 0..3] (0 1 2)
[tr 3..5] (3 4)
[tr -2..0] ()
[tr -2..4] (0 1 2 3)
[tr :..4] (0 1 2 3)
[tr 18..100] (18 19)
[tr 18..:] (18 19)
[tr 100..200] ())
(vtest
[tr :..:] (range 0 19))
(vtest (build (for* ((i (tree-begin tr))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(range 0 19))
(vtest (build (for* ((j (tree-begin tr))
(i (progn (tree-next j) (tree-next j) (tree-reset j tr)))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(range 0 19))
(vtest (build (for* ((j (tree-begin tr))
(i (progn (tree-next j) (tree-next j) (tree-reset j tr)))
(n (tree-peek i)))
((and n (eq (tree-next i) n)))
((set n (tree-peek i)))
(add (key n))))
(range 0 19))
(defvarl trc (copy-search-tree tr))
(vtest trc tr)
(tree-clear trc)
(test trc #T(()))
(test (tree-delete tr 6) 6)
(vtest (build (for* ((i (tree-begin tr 6))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(range 7 19))
(vtest (build (for* ((i (tree-begin tr 0))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(rlist 0..5 7..19))
(vtest (build (for* ((i (tree-begin tr 8))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(range 8 19))
(vtest (build (for* ((i (tree-reset (tree-begin #T(())) tr 8))
(n (tree-next i)))
(n)
((set n (tree-next i)))
(add (key n))))
(range 8 19))
(test (let* ((t0 (tree-begin tr))
(t1 (progn (tree-next t0) (copy-tree-iter t0))))
(tree-next t0)
(tree-next t0)
(list (key (tree-next t1))
(key (tree-next t1))
(key (tree-next t1))))
(1 2 3))
(test (let* ((t0 (tree-begin tr))
(t1 (progn (tree-next t0) (copy-tree-iter t0)))
(t2 (replace-tree-iter (tree-begin tr) t0)))
(tree-next t0)
(tree-next t0)
(list (key (tree-next t1))
(key (tree-next t1))
(key (tree-next t2))
(key (tree-next t2))))
(1 2 1 2))
(test (tree-next (tree-begin tr 20)) nil)
(test (tree-next (tree-begin #T(()) 0)) nil)
(test (key (tree-next (tree-begin #T(() 1) 1))) 1)
(mtest
(tree-delete tr 0) 0
(tree-delete tr 1) 1
(tree-delete tr 2) 2
(tree-delete tr 3) 3
(tree-delete tr 4) 4
(tree-delete tr 5) 5
(tree-delete tr 7) 7
(tree-delete tr 8) 8
(tree-delete tr 9) 9
(tree-delete tr 10) 10
(tree-delete tr 11) 11
(tree-delete tr 12) 12
(tree-delete tr 13) 13
(tree-delete tr 14) 14
(tree-delete tr 15) 15
(tree-delete tr 16) 16
(tree-delete tr 17) 17
(tree-delete tr 18) 18
(tree-delete tr 19) 19)
(set *tree-fun-whitelist* [list* '= '< 'to *tree-fun-whitelist*])
(let ((tr [tree '(1 2 3) identity < =]))
(mtest
tr #T((identity < =) 1 2 3)
(copy-search-tree tr) #T((identity < =) 1 2 3)
(make-similar-tree tr) #T((identity < =))))
(test
(collect-each ((el (tree-begin #T(() 1 2 3 4 5) 2 5)))
(* 10 el))
(20 30 40))
(mtest
(uni #T(() "a" "b") #T(() "b" "c")) ("a" "b" "c")
(diff #T(() "a" "b") #T(() "b" "c")) ("a")
(isec #T(() "a" "b") #T(() "b" "c")) ("b"))
(defstruct (item label key) ()
label
key
(:method equal (it) it.key))
(defun make-items ()
(vec (new (item 'a 1))
(new (item 'b 2))
(new (item 'c 2))
(new (item 'd 2))
(new (item 'e 2))
(new (item 'f 3))))
(let* ((items (make-items))
(tr (tree items : : : t)))
(each ((it items))
(vtest (tree-delete tr it) it))
(test tr #T(())))
(let* ((items (make-items))
(tr (tree items : : : t)))
(each ((it items))
(let* ((tn (tree-lookup-node tr it.key))
(iu (key tn)))
(vtest (tree-delete-specific-node tr tn) tn)
(each ((iv tr))
(test (eq iv.label iu.label) nil))))
(test tr #T(())))
(let* ((items (make-items))
(tr (tree items : : : t)))
(vtest (vec-list [mapcar .label tr]) [mapcar .label items]))
(let ((tr (tree)))
(mtest
(tree-insert tr 1) #N(1 nil nil)
(tree-insert tr 1) #N(1 nil nil)
(tree-insert tr 1) #N(1 nil nil))
(tree-insert tr 2)
(test (tree-count tr) 2)
(tree-insert tr 1 t)
(test (tree-count tr) 3))
(mtest
(tree-min-node (tree)) nil
(tree-min-node (tree '(1))) #N(1 nil nil)
(tree-min-node (tree '(1 2 3))) #N(1 nil nil))
(mtest
(tree-min (tree)) nil
(tree-min (tree '(1))) 1
(tree-min (tree '(1 2 3))) 1)
(let ((tr (tree '(1 2 3 4 5 6 7 8 9 10))))
(mtest
(tree-count tr) 10
(tree-del-min tr) 1
(tree-del-min tr) 2
(tree-del-min tr) 3
(tree-count tr) 7
(tree-del-min tr) 4
(tree-count tr) 6
(tree-del-min tr) 5
(tree-del-min tr) 6
(tree-del-min tr) 7
(tree-del-min tr) 8
(tree-count tr) 2
(tree-del-min tr) 9
(tree-count tr) 1
(tree-del-min tr) 10
(tree-count tr) 0
(tree-del-min tr) nil))
(let* ((tr [tree '(#R(1 10) #R(11 20) #R(21 30)) to])
(node (tree-lookup-node tr 10)))
(test node #N(#R(1 10) nil nil))
(tree-delete-specific-node tr node)
(test tr #T((to) #R(11 20) #R(21 30))))
|
