1 USING: deques dlists dlists.private kernel tools.test random
2 assocs sets sequences namespaces sorting debugger io prettyprint
3 math accessors classes ;
6 [ t ] [ <dlist> deque-empty? ] unit-test
8 [ T{ dlist f T{ dlist-node f 1 f f } T{ dlist-node f 1 f f } 1 } ]
9 [ <dlist> 1 over push-front ] unit-test
11 ! Make sure empty lists are empty
12 [ t ] [ <dlist> deque-empty? ] unit-test
13 [ f ] [ <dlist> 1 over push-front deque-empty? ] unit-test
14 [ f ] [ <dlist> 1 over push-back deque-empty? ] unit-test
16 [ 1 ] [ <dlist> 1 over push-front pop-front ] unit-test
17 [ 1 ] [ <dlist> 1 over push-front pop-back ] unit-test
18 [ 1 ] [ <dlist> 1 over push-back pop-front ] unit-test
19 [ 1 ] [ <dlist> 1 over push-back pop-back ] unit-test
20 [ T{ dlist f f f 0 } ] [ <dlist> 1 over push-front dup pop-front* ] unit-test
21 [ T{ dlist f f f 0 } ] [ <dlist> 1 over push-front dup pop-back* ] unit-test
22 [ T{ dlist f f f 0 } ] [ <dlist> 1 over push-back dup pop-front* ] unit-test
23 [ T{ dlist f f f 0 } ] [ <dlist> 1 over push-back dup pop-back* ] unit-test
25 ! Test the prev,next links for two nodes
27 <dlist> 1 over push-back 2 over push-back
32 <dlist> 1 over push-back 2 over push-back
37 <dlist> 1 over push-back 2 over push-back
38 front>> next>> prev>> obj>>
42 <dlist> 1 over push-back 2 over push-back
46 [ f f ] [ <dlist> [ 1 = ] dlist-find ] unit-test
47 [ 1 t ] [ <dlist> 1 over push-back [ 1 = ] dlist-find ] unit-test
48 [ f f ] [ <dlist> 1 over push-back [ 2 = ] dlist-find ] unit-test
49 [ f ] [ <dlist> 1 over push-back [ 2 = ] dlist-contains? ] unit-test
50 [ t ] [ <dlist> 1 over push-back [ 1 = ] dlist-contains? ] unit-test
52 [ 1 ] [ <dlist> 1 over push-back [ 1 = ] delete-node-if ] unit-test
53 [ t ] [ <dlist> 1 over push-back dup [ 1 = ] delete-node-if drop deque-empty? ] unit-test
54 [ t ] [ <dlist> 1 over push-back dup [ 1 = ] delete-node-if drop deque-empty? ] unit-test
55 [ 0 ] [ <dlist> 1 over push-back dup [ 1 = ] delete-node-if drop deque-length ] unit-test
56 [ 1 ] [ <dlist> 1 over push-back 2 over push-back dup [ 1 = ] delete-node-if drop deque-length ] unit-test
57 [ 2 ] [ <dlist> 1 over push-back 2 over push-back 3 over push-back dup [ 1 = ] delete-node-if drop deque-length ] unit-test
58 [ 2 ] [ <dlist> 1 over push-back 2 over push-back 3 over push-back dup [ 2 = ] delete-node-if drop deque-length ] unit-test
59 [ 2 ] [ <dlist> 1 over push-back 2 over push-back 3 over push-back dup [ 3 = ] delete-node-if drop deque-length ] unit-test
61 [ 0 ] [ <dlist> deque-length ] unit-test
62 [ 1 ] [ <dlist> 1 over push-front deque-length ] unit-test
63 [ 0 ] [ <dlist> 1 over push-front dup pop-front* deque-length ] unit-test
65 [ t ] [ <dlist> 4 over push-back 5 over push-back [ obj>> 4 = ] dlist-find-node drop class dlist-node = ] unit-test
66 [ t ] [ <dlist> 4 over push-back 5 over push-back [ obj>> 5 = ] dlist-find-node drop class dlist-node = ] unit-test
67 [ t ] [ <dlist> 4 over push-back 5 over push-back* [ = ] curry dlist-find-node drop class dlist-node = ] unit-test
68 [ ] [ <dlist> 4 over push-back 5 over push-back [ drop ] dlist-each ] unit-test
70 [ <dlist> peek-front ] [ empty-dlist? ] must-fail-with
71 [ <dlist> peek-back ] [ empty-dlist? ] must-fail-with
72 [ <dlist> pop-front ] [ empty-dlist? ] must-fail-with
73 [ <dlist> pop-back ] [ empty-dlist? ] must-fail-with
75 [ t ] [ <dlist> 3 over push-front 4 over push-back 3 swap deque-member? ] unit-test
77 [ f ] [ <dlist> 3 over push-front 4 over push-back -1 swap deque-member? ] unit-test
79 [ f ] [ <dlist> 0 swap deque-member? ] unit-test