-
Notifications
You must be signed in to change notification settings - Fork 1
/
tree.c
1199 lines (1036 loc) · 32.7 KB
/
tree.c
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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright 2019-2024
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <signal.h>
#include "config.h"
#include "alloca.h"
#include "lib.h"
#include "gc.h"
#include "signal.h"
#include "unwind.h"
#include "stream.h"
#include "eval.h"
#include "hash.h"
#include "tree.h"
#if SIZEOF_PTR == 4
#define TREE_DEPTH_MAX 28
#elif SIZEOF_PTR == 8
#define TREE_DEPTH_MAX 60
#else
#error portme
#endif
struct tree {
val root;
ucnum size, max_size;
val key_fn, less_fn, equal_fn;
val key_fn_name, less_fn_name, equal_fn_name;
};
enum tree_iter_state {
tr_visited_nothing,
tr_visited_left,
tr_find_low_prepared
};
struct tree_iter {
val self;
int depth;
enum tree_iter_state state;
val path[TREE_DEPTH_MAX];
};
struct tree_diter {
struct tree_iter ti;
val tree;
val lastnode;
val highkey;
};
#define tree_iter_init(self) { (self), 0, tr_visited_nothing, { 0 } }
val tree_s, tree_iter_s, tree_fun_whitelist_s;
struct cobj_class *tree_cls, *tree_iter_cls;
val tnode(val key, val left, val right)
{
val obj = make_obj();
obj->tn.type = TNOD;
obj->tn.left = left;
obj->tn.right = right;
obj->tn.key = key;
return obj;
}
val tnodep(val obj)
{
return tnil(type(obj) == TNOD);
}
val left(val node)
{
type_check(lit("left"), node, TNOD);
return node->tn.left;
}
val right(val node)
{
type_check(lit("right"), node, TNOD);
return node->tn.right;
}
val key(val node)
{
type_check(lit("key"), node, TNOD);
return node->tn.key;
}
val set_left(val node, val nleft)
{
type_check(lit("set-left"), node, TNOD);
set(mkloc(node->tn.left, node), nleft);
return node;
}
val set_right(val node, val nright)
{
type_check(lit("set-right"), node, TNOD);
set(mkloc(node->tn.right, node), nright);
return node;
}
val set_key(val node, val nkey)
{
type_check(lit("set-key"), node, TNOD);
set(mkloc(node->tn.key, node), nkey);
return node;
}
val copy_tnode(val node)
{
return (type_check(lit("copy-tnode"), node, TNOD), copy_obj(node));
}
static ucnum tn_size(val node)
{
return 1 + if3(node->tn.right, tn_size(node->tn.right), 0) +
if3(node->tn.left, tn_size(node->tn.left), 0);
}
static ucnum tn_size_one_child(val node, val child, ucnum size)
{
return 1 + size + if3(child == node->tn.left,
if3(node->tn.right, tn_size(node->tn.right), 0),
if3(node->tn.left, tn_size(node->tn.left), 0));
}
static val tn_lookup(struct tree *tr, val node, val key)
{
val tr_key = if3(tr->key_fn,
funcall1(tr->key_fn, node->tn.key),
node->tn.key);
if (if3(tr->less_fn,
funcall2(tr->less_fn, key, tr_key),
less(key, tr_key)))
{
return if2(node->tn.left, tn_lookup(tr, node->tn.left, key));
} else if (if3(tr->equal_fn == nil,
equal(key, tr_key),
funcall2(tr->equal_fn, key, tr_key))) {
return node;
} else {
return if2(node->tn.right, tn_lookup(tr, node->tn.right, key));
}
}
static val tn_find_next(val node, struct tree_iter *trit)
{
for (;;) {
switch (trit->state) {
case tr_visited_nothing:
if (!node)
return nil;
while (node->tn.left) {
bug_unless (trit->depth < TREE_DEPTH_MAX);
set(mkloc(trit->path[trit->depth++], trit->self), node);
node = node->tn.left;
}
trit->state = tr_visited_left;
return node;
case tr_visited_left:
if (node->tn.right) {
trit->state = tr_visited_nothing;
set(mkloc(trit->path[trit->depth++], trit->self), node);
node = node->tn.right;
continue;
} else {
while (trit->depth > 0) {
val parent = trit->path[--trit->depth];
if (node == parent->tn.right) {
node = parent;
continue;
}
trit->state = tr_visited_left;
return parent;
}
return nil;
}
case tr_find_low_prepared:
trit->state = tr_visited_left;
return node;
default:
internal_error("invalid tree iterator state");
}
}
}
static val tn_peek_next(val node, struct tree_iter *trit)
{
enum tree_iter_state state = trit->state;
int depth = trit->depth;
for (;;) {
switch (state) {
case tr_visited_nothing:
if (!node)
return nil;
while (node->tn.left)
node = node->tn.left;
return node;
case tr_visited_left:
if (node->tn.right) {
state = tr_visited_nothing;
node = node->tn.right;
continue;
} else {
while (depth > 0) {
val parent = trit->path[--depth];
if (node == parent->tn.right) {
node = parent;
continue;
}
return parent;
}
return nil;
}
case tr_find_low_prepared:
return node;
default:
internal_error("invalid tree iterator state");
}
}
}
static void tn_find_low(val node, struct tree_diter *tdi,
struct tree *tr, val key)
{
struct tree_iter *trit = &tdi->ti;
if (node == 0) {
return;
} else {
val tr_key = if3(tr->key_fn,
funcall1(tr->key_fn, node->tn.key),
node->tn.key);
set(mkloc(trit->path[trit->depth++], trit->self), node);
if (if3(tr->less_fn,
funcall2(tr->less_fn, key, tr_key),
less(key, tr_key)))
{
set(mkloc(tdi->lastnode, tdi->ti.self), node);
if (node->tn.left) {
tn_find_low(node->tn.left, tdi, tr, key);
return;
}
} else if (if3(tr->equal_fn == nil,
equal(key, tr_key),
funcall2(tr->equal_fn, key, tr_key))) {
set(mkloc(tdi->lastnode, tdi->ti.self), node);
if (node->tn.left) {
tn_find_low(node->tn.left, tdi, tr, key);
return;
}
} else {
if (node->tn.right) {
tn_find_low(node->tn.right, tdi, tr, key);
return;
}
}
if (tdi->lastnode) {
while (trit->path[trit->depth - 1] != tdi->lastnode)
trit->depth--;
trit->depth--;
trit->state = tr_find_low_prepared;
}
}
}
static val tn_flatten(val x, val y)
{
if (x == nil)
return y;
x->tn.right = tn_flatten(x->tn.right, y);
return tn_flatten(x->tn.left, x);
}
static val tn_build_tree(ucnum n, val x)
{
if (n == 0) {
x->tn.left = nil;
return x;
} else {
val r = tn_build_tree(n / 2, x);
val s = tn_build_tree((n - 1) / 2, r->tn.right);
set(mkloc(r->tn.right, r), s->tn.left);
set(mkloc(s->tn.left, s), r);
return s;
}
}
static void tr_rebuild(val tree, struct tree *tr, val node,
val parent, ucnum size)
{
#if CONFIG_GEN_GC
obj_t dummy = { { TNOD, 0, 0, { 0 }, 0 } };
#else
obj_t dummy = { { TNOD, { 0 }, 0 } };
#endif
val flat = tn_flatten(node, &dummy);
val new_root = (tn_build_tree(size, flat), dummy.tn.left);
if (parent) {
if (parent->tn.left == node)
set(mkloc(parent->tn.left, parent), new_root);
else
set(mkloc(parent->tn.right, parent), new_root);
} else {
set(mkloc(tr->root, tree), new_root);
}
}
static void tr_find_rebuild_scapegoat(val tree, struct tree *tr,
struct tree_iter *ti,
val child, ucnum child_size)
{
if (ti->depth > 0) {
val parent = ti->path[--ti->depth];
ucnum parent_size = tn_size_one_child(parent, child, child_size);
ucnum sib_size = parent_size - child_size;
if (2 * child_size > parent_size || 2 * sib_size > parent_size) {
val grandparent = if2(ti->depth > 0, ti->path[ti->depth - 1]);
tr_rebuild(tree, tr, parent, grandparent, parent_size);
} else {
tr_find_rebuild_scapegoat(tree, tr, ti, parent, parent_size);
}
}
}
static void tr_insert(val tree, struct tree *tr, struct tree_iter *ti,
val subtree, val node, val dup)
{
val tn_key = if3(tr->key_fn,
funcall1(tr->key_fn, node->tn.key),
node->tn.key);
val tr_key = if3(tr->key_fn,
funcall1(tr->key_fn, subtree->tn.key),
subtree->tn.key);
if (if3(tr->less_fn,
funcall2(tr->less_fn, tn_key, tr_key),
less(tn_key, tr_key)))
{
if (subtree->tn.left) {
set(mkloc(ti->path[ti->depth++], ti->self), subtree);
tr_insert(tree, tr, ti, subtree->tn.left, node, dup);
} else {
int dep = ti->depth + 1;
set(mkloc(subtree->tn.left, subtree), node);
if (++tr->size > tr->max_size)
tr->max_size = tr->size;
if (subtree->tn.right == nil && (convert(ucnum, 1) << dep) > tr->size) {
set(mkloc(ti->path[ti->depth++], ti->self), subtree);
tr_find_rebuild_scapegoat(tree, tr, ti, node, 1);
}
}
} else if (if3(tr->equal_fn == nil,
equal(tn_key, tr_key),
funcall2(tr->equal_fn, tn_key, tr_key)) &&
!dup)
{
set(mkloc(node->tn.left, node), subtree->tn.left);
set(mkloc(node->tn.right, node), subtree->tn.right);
if (ti->depth > 0) {
val parent = ti->path[ti->depth - 1];
if (parent->tn.left == subtree)
set(mkloc(parent->tn.left, parent), node);
else
set(mkloc(parent->tn.right, parent), node);
} else {
set(mkloc(tr->root, tree), node);
}
} else {
if (subtree->tn.right) {
set(mkloc(ti->path[ti->depth++], ti->self), subtree);
tr_insert(tree, tr, ti, subtree->tn.right, node, dup);
} else {
int dep = ti->depth + 1;
set(mkloc(subtree->tn.right, subtree), node);
if (++tr->size > tr->max_size)
tr->max_size = tr->size;
if (subtree->tn.left == nil && (convert(ucnum, 1) << dep) > tr->size) {
set(mkloc(ti->path[ti->depth++], ti->self), subtree);
tr_find_rebuild_scapegoat(tree, tr, ti, node, 1);
}
}
}
}
static val tr_lookup(struct tree *tree, val key)
{
return if2(tree->root, tn_lookup(tree, tree->root, key));
}
static val tr_do_delete(val tree, struct tree *tr, val subtree,
val parent, val key)
{
val tr_key = if3(tr->key_fn,
funcall1(tr->key_fn, subtree->tn.key),
subtree->tn.key);
if (if3(tr->less_fn,
funcall2(tr->less_fn, key, tr_key),
less(key, tr_key)))
{
if (subtree->tn.left)
return tr_do_delete(tree, tr, subtree->tn.left, subtree, key);
return nil;
} else if (if3(tr->equal_fn == nil,
equal(key, tr_key),
funcall2(tr->equal_fn, key, tr_key))) {
val le = subtree->tn.left;
val ri = subtree->tn.right;
if (le && ri) {
struct tree_iter trit = tree_iter_init(0);
val succ = tn_find_next(ri, &trit);
val succ_par = if3(trit.depth, trit.path[trit.depth - 1], subtree);
if (succ_par == subtree)
set(mkloc(succ_par->tn.right, succ_par), succ->tn.right);
else
set(mkloc(succ_par->tn.left, succ_par), succ->tn.right);
set(mkloc(succ->tn.left, succ), subtree->tn.left);
set(mkloc(succ->tn.right, succ), subtree->tn.right);
if (parent) {
if (parent->tn.left == subtree)
set(mkloc(parent->tn.left, parent), succ);
else
set(mkloc(parent->tn.right, parent), succ);
} else {
tr->root = succ;
}
} else {
uses_or2;
val chld = or2(le, ri);
if (parent) {
if (parent->tn.left == subtree)
set(mkloc(parent->tn.left, parent), chld);
else
set(mkloc(parent->tn.right, parent), chld);
} else {
set(mkloc(tr->root, tree), chld);
}
}
subtree->tn.left = subtree->tn.right = nil;
return subtree;
} else {
if (subtree->tn.right)
return tr_do_delete(tree, tr, subtree->tn.right, subtree, key);
return nil;
}
}
static val tr_do_delete_specific(val tree, struct tree *tr, val subtree,
val parent, val key, val thisnode)
{
if (subtree == nil) {
return nil;
} else if (subtree == thisnode) {
val le = subtree->tn.left;
val ri = subtree->tn.right;
if (le && ri) {
struct tree_iter trit = tree_iter_init(0);
val succ = tn_find_next(ri, &trit);
val succ_par = if3(trit.depth, trit.path[trit.depth - 1], subtree);
if (succ_par == subtree)
set(mkloc(succ_par->tn.right, succ_par), succ->tn.right);
else
set(mkloc(succ_par->tn.left, succ_par), succ->tn.right);
set(mkloc(succ->tn.left, succ), subtree->tn.left);
set(mkloc(succ->tn.right, succ), subtree->tn.right);
if (parent) {
if (parent->tn.left == subtree)
set(mkloc(parent->tn.left, parent), succ);
else
set(mkloc(parent->tn.right, parent), succ);
} else {
tr->root = succ;
}
} else {
uses_or2;
val chld = or2(le, ri);
if (parent) {
if (parent->tn.left == subtree)
set(mkloc(parent->tn.left, parent), chld);
else
set(mkloc(parent->tn.right, parent), chld);
} else {
set(mkloc(tr->root, tree), chld);
}
}
subtree->tn.left = subtree->tn.right = nil;
return subtree;
}
{
val tr_key = if3(tr->key_fn,
funcall1(tr->key_fn, subtree->tn.key),
subtree->tn.key);
if (if3(tr->less_fn,
funcall2(tr->less_fn, key, tr_key),
less(key, tr_key)))
{
val le = subtree->tn.left;
return tr_do_delete_specific(tree, tr, le, subtree, key, thisnode);
} else if (if3(tr->equal_fn == nil,
equal(key, tr_key),
funcall2(tr->equal_fn, key, tr_key)))
{
uses_or2;
val le = subtree->tn.left;
val ri = subtree->tn.right;
return or2(tr_do_delete_specific(tree, tr, le, subtree, key, thisnode),
tr_do_delete_specific(tree, tr, ri, subtree, key, thisnode));
} else {
val ri = subtree->tn.right;
return tr_do_delete_specific(tree, tr, ri, subtree, key, thisnode);
}
}
}
static val tr_delete(val tree, struct tree *tr, val key)
{
if (tr->root) {
val node = tr_do_delete(tree, tr, tr->root, nil, key);
if (node) {
if (2 * --tr->size < tr->max_size) {
tr_rebuild(tree, tr, tr->root, nil, tr->size);
tr->max_size = tr->size;
}
}
return node;
}
return nil;
}
static val tr_delete_specific(val tree, struct tree *tr, val thisnode)
{
if (tr->root) {
val nkey = key(thisnode);
val key = if3(tr->key_fn, funcall1(tr->key_fn, nkey), nkey);
val node = tr_do_delete_specific(tree, tr, tr->root,
nil, key, thisnode);
if (node) {
if (2 * --tr->size < tr->max_size) {
tr_rebuild(tree, tr, tr->root, nil, tr->size);
tr->max_size = tr->size;
}
}
return node;
}
return nil;
}
val tree_insert_node(val tree, val node, val dup_in)
{
val self = lit("tree-insert-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
val dup = default_null_arg(dup_in);
type_check(self, node, TNOD);
node->tn.left = nil;
node->tn.right = nil;
if (tr->root == nil) {
tr->size = 1;
tr->max_size = 1;
set(mkloc(tr->root, tree), node);
} else {
struct tree_iter ti = tree_iter_init(0);
tr_insert(tree, tr, &ti, tr->root, node, dup);
}
return node;
}
val tree_insert(val tree, val key, val dup_in)
{
return tree_insert_node(tree, tnode(key, nil, nil), default_null_arg(dup_in));
}
val tree_lookup_node(val tree, val key)
{
val self = lit("tree-lookup-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
return tr_lookup(tr, key);
}
val tree_lookup(val tree, val key)
{
val node = tree_lookup_node(tree, key);
return if2(node, node->tn.key);
}
val tree_min_node(val tree)
{
val self = lit("tree-min-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
val node = tr->root;
while (node != nil) {
val le = node->tn.left;
if (le == nil)
return node;
node = le;
}
return nil;
}
val tree_min(val tree)
{
val node = tree_min_node(tree);
return if2(node, node->tn.key);
}
val tree_delete_node(val tree, val key)
{
val self = lit("tree-delete-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
return tr_delete(tree, tr, key);
}
val tree_delete(val tree, val key)
{
val node = tree_delete_node(tree, key);
return if2(node, node->tn.key);
}
val tree_delete_specific_node(val tree, val node)
{
val self = lit("tree-delete-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
return tr_delete_specific(tree, tr, node);
}
val tree_del_min_node(val tree)
{
val self = lit("tree-min-node");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
val node = tr->root, parent = nil;;
while (node != nil) {
val le = node->tn.left;
if (le == nil) {
val chld = node->tn.right;
if (parent)
set(mkloc(parent->tn.left, parent), chld);
else
set(mkloc(tr->root, tree), chld);
if (2 * --tr->size < tr->max_size) {
tr_rebuild(tree, tr, tr->root, nil, tr->size);
tr->max_size = tr->size;
}
return node;
}
parent = node;
node = le;
}
return nil;
}
val tree_del_min(val tree)
{
val node = tree_del_min_node(tree);
return if2(node, node->tn.key);
}
static val tree_root(val tree)
{
val self = lit("tree-root");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
return tr->root;
}
static val tree_equal_op(val left, val right)
{
val self = lit("equal");
struct tree *ltr = coerce(struct tree *, cobj_handle(self, left, tree_cls));
struct tree *rtr = coerce(struct tree *, cobj_handle(self, right, tree_cls));
if (ltr->size != rtr->size)
return nil;
if (ltr->key_fn != rtr->key_fn)
return nil;
if (ltr->less_fn != rtr->less_fn)
return nil;
if (ltr->equal_fn != rtr->equal_fn)
return nil;
{
struct tree_iter liter = tree_iter_init(0), riter = tree_iter_init(0);
val lnode = ltr->root, rnode = rtr->root;
while ((lnode = tn_find_next(lnode, &liter)) &&
(rnode = tn_find_next(rnode, &riter)))
{
if (!equal(lnode->tn.key, rnode->tn.key))
return nil;
}
return t;
}
}
static void tree_print_op(val tree, val out, val pretty, struct strm_ctx *ctx)
{
struct tree *tr = coerce(struct tree *, tree->co.handle);
val save_mode = test_set_indent_mode(out, num_fast(indent_off),
num_fast(indent_data));
val save_indent;
int force_br = 0;
put_string(lit("#T("), out);
save_indent = inc_indent(out, zero);
put_char(chr('('), out);
if (tr->key_fn_name || tr->less_fn_name || tr->equal_fn_name) {
obj_print_impl(tr->key_fn_name, out, pretty, ctx);
if (tr->less_fn_name || tr->equal_fn_name) {
put_char(chr(' '), out);
obj_print_impl(tr->less_fn_name, out, pretty, ctx);
if (tr->equal_fn_name) {
put_char(chr(' '), out);
obj_print_impl(tr->equal_fn_name, out, pretty, ctx);
}
}
}
put_char(chr(')'), out);
{
struct tree_iter trit = tree_iter_init(0);
val node = tr->root;
while ((node = tn_find_next(node, &trit))) {
if (width_check(out, chr(' ')))
force_br = 1;
obj_print_impl(node->tn.key, out, pretty, ctx);
}
}
put_char(chr(')'), out);
if (force_br)
force_break(out);
set_indent_mode(out, save_mode);
set_indent(out, save_indent);
}
static void tree_mark(val tree)
{
struct tree *ltr = coerce(struct tree *, tree->co.handle);
gc_mark(ltr->root);
gc_mark(ltr->key_fn);
gc_mark(ltr->less_fn);
gc_mark(ltr->equal_fn);
gc_mark(ltr->key_fn_name);
gc_mark(ltr->less_fn_name);
gc_mark(ltr->equal_fn_name);
}
static ucnum tree_hash_op(val obj, int *count, ucnum seed)
{
struct tree *tr = coerce(struct tree *, obj->co.handle);
ucnum hash = 0;
if ((*count)-- <= 0)
return hash;
hash += equal_hash(tr->key_fn, count, seed);
hash += equal_hash(tr->less_fn, count, seed);
hash += equal_hash(tr->equal_fn, count, seed);
{
struct tree_iter trit = tree_iter_init(0);
val node = tr->root;
while ((node = tn_find_next(node, &trit)) && (*count)-- <= 0)
hash += equal_hash(node->tn.key, count, seed);
}
return hash;
}
static struct cobj_ops tree_ops = cobj_ops_init(tree_equal_op,
tree_print_op,
cobj_destroy_free_op,
tree_mark,
tree_hash_op);
val tree(val keys_in, val key_fn, val less_fn, val equal_fn, val dup_in)
{
struct tree *tr = coerce(struct tree *, chk_calloc(1, sizeof *tr));
val keys = default_null_arg(keys_in), key;
val tree = cobj(coerce(mem_t *, tr), tree_cls, &tree_ops);
val dup = default_null_arg(dup_in);
seq_iter_t ki;
uses_or2;
tr->key_fn = default_null_arg(key_fn);
tr->less_fn = default_null_arg(less_fn);
tr->equal_fn = default_null_arg(equal_fn);
tr->key_fn_name = if2(tr->key_fn,
or2(func_get_name(tr->key_fn, nil), tr->key_fn));
tr->less_fn_name = if2(tr->less_fn,
or2(func_get_name(tr->less_fn, nil), tr->key_fn));
tr->equal_fn_name = if2(tr->equal_fn,
or2(func_get_name(tr->equal_fn, nil), tr->key_fn));
seq_iter_init(tree_s, &ki, keys);
while (seq_get(&ki, &key))
tree_insert(tree, key, dup);
return tree;
}
static val tree_construct_fname(val name)
{
if (!name) {
return nil;
} else if (bindable(name)) {
val fun = cdr(lookup_fun(nil, name));
if (fun)
return fun;
uw_throwf(error_s, lit("#T: function named ~s doesn't exist"), name, nao);
} else if (functionp(name)) {
return name;
} else {
uw_throwf(error_s, lit("#T: ~s isn't a function name"), name, nao);
}
}
static val tree_construct(val opts, val keys)
{
val key_fn = tree_construct_fname(pop(&opts));
val less_fn = tree_construct_fname(pop(&opts));
val equal_fn = tree_construct_fname(pop(&opts));
return tree(keys, key_fn, less_fn, equal_fn, t);
}
static val deep_copy_tnode(val node)
{
if (node == nil)
return nil;
return tnode(node->tn.key,
deep_copy_tnode(node->tn.left),
deep_copy_tnode(node->tn.right));
}
val copy_search_tree(val tree)
{
val self = lit("copy-search-tree");
struct tree *ntr = coerce(struct tree *, malloc(sizeof *ntr));
struct tree *otr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
val nroot = deep_copy_tnode(otr->root);
val ntree = cobj(coerce(mem_t *, ntr), tree_cls, &tree_ops);
*ntr = *otr;
ntr->root = nroot;
gc_hint(tree);
return ntree;
}
val make_similar_tree(val tree)
{
val self = lit("make-similar-tree");
struct tree *ntr = coerce(struct tree *, malloc(sizeof *ntr));
struct tree *otr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
val ntree = cobj(coerce(mem_t *, ntr), tree_cls, &tree_ops);
*ntr = *otr;
ntr->root = nil;
ntr->size = ntr->max_size = 0;
gc_hint(tree);
return ntree;
}
val treep(val obj)
{
return tnil(type(obj) == COBJ && obj->co.cls == tree_cls);
}
val tree_count(val tree)
{
val self = lit("tree-count");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
return unum(tr->size);
}
static void tree_iter_mark(val tree_iter)
{
struct tree_diter *tdi = coerce(struct tree_diter *, tree_iter->co.handle);
int i;
for (i = 0; i < tdi->ti.depth; i++)
gc_mark(tdi->ti.path[i]);
gc_mark(tdi->tree);
gc_mark(tdi->lastnode);
gc_mark(tdi->highkey);
}
static struct cobj_ops tree_iter_ops = cobj_ops_init(eq,
cobj_print_op,
cobj_destroy_free_op,
tree_iter_mark,
cobj_eq_hash_op);
val tree_begin(val tree, val lowkey, val highkey)
{
val self = lit("tree-begin");
struct tree *tr = coerce(struct tree *, cobj_handle(self, tree, tree_cls));
struct tree_diter *tdi = coerce(struct tree_diter *,
chk_calloc(1, sizeof *tdi));
val iter = cobj(coerce(mem_t *, tdi), tree_iter_cls, &tree_iter_ops);
tdi->ti.self = iter;
tdi->tree = tree;
if (!missingp(lowkey))
tn_find_low(tr->root, tdi, tr, lowkey);
else
tdi->lastnode = tr->root;
if (!missingp(highkey))
tdi->highkey = highkey;
else
tdi->highkey = iter;
return iter;
}
val copy_tree_iter(val iter)
{
val self = lit("copy-tree-iter");
struct tree_diter *tdis = coerce(struct tree_diter *,
cobj_handle(self, iter, tree_iter_cls));