1 ! Copyright (c) 2005 Mackenzie Straight.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: assocs fry grouping kernel math random sequences sets
4 tools.test trees.splay ;
7 : randomize-numeric-splay-tree ( splay-tree -- )
8 100 iota [ drop 100 random of drop ] with each ;
10 : make-numeric-splay-tree ( n -- splay-tree )
11 iota <splay> [ '[ dup _ set-at ] each ] keep ;
14 100 make-numeric-splay-tree dup randomize-numeric-splay-tree
15 [ drop ] { } assoc>map [ < ] monotonic?
18 { 10 } [ 10 make-numeric-splay-tree keys length ] unit-test
19 { 10 } [ 10 make-numeric-splay-tree values length ] unit-test
21 { f } [ <splay> f 4 pick set-at 4 of ] unit-test
23 ! Ensure that f can be a value
24 { t } [ <splay> f 4 pick set-at 4 swap key? ] unit-test
27 { { 1 "a" } { 2 "b" } { 3 "c" } { 4 "d" } { 5 "e" } { 6 "f" } }
30 { 4 "d" } { 5 "e" } { 6 "f" }
31 { 1 "a" } { 2 "b" } { 3 "c" }
36 100 iota [ dup zip >splay ] keep
37 [ over delete-at ] each assoc-size
40 : test-tree ( -- tree )
46 { 7 "replaced seven" }
50 { 3 } [ test-tree assoc-size ] unit-test
51 { 2 } [ test-tree 9 over delete-at assoc-size ] unit-test
53 ! Test that converting trees doesn't give linked lists
55 SPLAY{ { 1 1 } { 3 3 } { 2 2 } }
56 } [ SPLAY{ { 1 1 } { 3 3 } { 2 2 } } >splay ] unit-test