Debian Codegraph @

test/include/list-queues-test.scm

raw
1 (test-group "list-queues"
2
3 (test-group "list-queues/simple"
4 (test '(1 1 1) (list-queue-list (make-list-queue '(1 1 1))))
5 (define x (list-queue 1 2 3))
6 (test '(1 2 3) (list-queue-list x))
7 (define x1 (list 1 2 3))
8 (define x2 (make-list-queue x1 (cddr x1)))
9 (test 3 (list-queue-back x2))
10 (define y (list-queue 4 5))
11 (test-assert (list-queue? y))
12 (define z (list-queue-append x y))
13 (test '(1 2 3 4 5) (list-queue-list z))
14 (define z2 (list-queue-append! x (list-queue-copy y)))
15 (test '(1 2 3 4 5) (list-queue-list z2))
16 (test 1 (list-queue-front z))
17 (test 5 (list-queue-back z))
18 (list-queue-remove-front! y)
19 (test '(5) (list-queue-list y))
20 (list-queue-remove-back! y)
21 (test-assert (list-queue-empty? y))
22 (test-error (list-queue-remove-front! y))
23 (test-error (list-queue-remove-back! y))
24 (test '(1 2 3 4 5) (list-queue-list z))
25 (test '(1 2 3 4 5) (list-queue-remove-all! z2))
26 (test-assert (list-queue-empty? z2))
27 (list-queue-remove-all! z)
28 (list-queue-add-front! z 1)
29 (list-queue-add-front! z 0)
30 (list-queue-add-back! z 2)
31 (list-queue-add-back! z 3)
32 (test '(0 1 2 3) (list-queue-list z))
33 ) ; end list-queues/simple
34
35 (test-group "list-queues/whole"
36 (define a (list-queue 1 2 3))
37 (define b (list-queue-copy a))
38 (test '(1 2 3) (list-queue-list b))
39 (list-queue-add-front! b 0)
40 (test '(1 2 3) (list-queue-list a))
41 (test 4 (length (list-queue-list b)))
42 (define c (list-queue-concatenate (list a b)))
43 (test '(1 2 3 0 1 2 3) (list-queue-list c))
44 ) ; end list-queues/whole
45
46 (test-group "list-queues/map"
47 (define r (list-queue 1 2 3))
48 (define s (list-queue-map (lambda (x) (* x 10)) r))
49 (test '(10 20 30) (list-queue-list s))
50 (list-queue-map! (lambda (x) (+ x 1)) r)
51 (test '(2 3 4) (list-queue-list r))
52 (define sum 0)
53 (list-queue-for-each (lambda (x) (set! sum (+ sum x))) s)
54 (test 60 sum)
55 ) ; end list-queues/map
56
57 (test-group "list-queues/conversion"
58 (define n (list-queue 5 6))
59 (list-queue-set-list! n (list 1 2))
60 (test '(1 2) (list-queue-list n))
61 (define d (list 1 2 3))
62 (define e (cddr d))
63 (define f (make-list-queue d e))
64 (define-values (dx ex) (list-queue-first-last f))
65 (test-assert (eq? d dx))
66 (test-assert (eq? e ex))
67 (test '(1 2 3) (list-queue-list f))
68 (list-queue-add-front! f 0)
69 (list-queue-add-back! f 4)
70 (test '(0 1 2 3 4) (list-queue-list f))
71 (define g (make-list-queue d e))
72 (test '(1 2 3 4) (list-queue-list g))
73 (define h (list-queue 5 6))
74 (list-queue-set-list! h d e)
75 (test '(1 2 3 4) (list-queue-list h))
76 ); end list-queues/conversion
77
78 (test-group "list-queues/unfold"
79 (define (double x) (* x 2))
80 (define (done? x) (> x 3))
81 (define (add1 x) (+ x 1))
82 (define x (list-queue-unfold done? double add1 0))
83 (test '(0 2 4 6) (list-queue-list x))
84 (define y (list-queue-unfold-right done? double add1 0))
85 (test '(6 4 2 0) (list-queue-list y))
86 (define x0 (list-queue 8))
87 (define x1 (list-queue-unfold done? double add1 0 x0))
88 (test '(0 2 4 6 8) (list-queue-list x1))
89 (define y0 (list-queue 8))
90 (define y1 (list-queue-unfold-right done? double add1 0 y0))
91 (test '(8 6 4 2 0) (list-queue-list y1))
92
93 ) ; end list-queues/unfold
94
95 ) ; end list-queues
96
97 (test-exit)