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
|
;; A practical implementation for the Scheme programming language
;;
;; ,--^,
;; _ ___/ /|/
;; ,;'( )__, ) '
;; ;; // L__.
;; ' \\ / '
;; ^ ^
;;
;; Copyright (c) 1992-2004 Manuel Serrano
;;
;; Bug descriptions, use reports, comments or suggestions are
;; welcome. Send them to
;; bigloo@sophia.inria.fr
;; http://www.inria.fr/mimosa/fp/Bigloo
;;
;; This program is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2 of the License, or
;; (at your option) any later version. More precisely,
;;
;; - The compiler and the tools are distributed under the terms of the
;; GNU General Public License.
;;
;; - The Bigloo run-time system and the libraries are distributed under
;; the terms of the GNU Library General Public License. The source code
;; of the Bigloo runtime system is located in the ./runtime directory.
;; The source code of the FairThreads library is located in the
;; ./fthread directory.
;;
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;;
;; You should have received a copy of the GNU General Public
;; License along with this program; if not, write to the Free
;; Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
;; MA 02111-1307, USA.
;*---------------------------------------------------------------------*/
;* serrano/prgm/project/bigloo/recette/list.scm */
;* */
;* Author : Manuel Serrano */
;* Creation : Tue Nov 3 09:21:42 1992 */
;* Last change : Fri Nov 14 17:29:58 2003 (serrano) */
;* */
;* On teste les operations primitives sur les listes */
;*---------------------------------------------------------------------*/
;; ChangeLog
;;
;; 2005-08-18 kzk Copied from Bigloo 2.6e and adapted to SigScheme
(load "./test/unittest-bigloo.scm")
;*---------------------------------------------------------------------*/
;* test-list ... */
;*---------------------------------------------------------------------*/
(define (test-list)
(test "car" (car (list 1 2 3)) 1)
(test "cdr" (cdr (list 1 2 3)) '(2 3))
(test "set-car!" (let ((x (cons 1 2))) (set-car! x 0) x) (cons 0 2))
(test "set-cdr!" (let ((x (cons 1 2))) (set-cdr! x 0) x) (cons 1 0))
(test "cons" (cons 1 (cons 2 '())) '(1 2))
; (test "epair.1" (epair? (econs 1 2 3)) #t)
; (test "epair.2" (epair? (cons 2 3)) #f)
; (test "epair.3" (pair? (econs 1 2 3)) #t)
; (test "epair.4" (cer (econs 1 2 3)) 3)
; (test "epair.5" (let ((p (econs 1 2 3)))
; (set-cer! p 4)
; (cer p))
; 4)
; (test "epair.6" (car (econs 1 2 3)) 1)
; (test "epair.7" (cdr (econs 1 2 3)) 2)
(test "map.1" (map (lambda (x) (+ 1 x)) '(1 2 3)) '(2 3 4))
(test "map.2" (map cons '(1 2 3) '(4 5 6)) '((1 . 4) (2 . 5) (3 . 6)))
(test "map.3" (map list '(1 2 3) '(4 5 6)) '((1 4) (2 5) (3 6)))
(test "map.4" (map (lambda (a b) (list a b)) '(1 2 3) '(4 5 6))
'((1 4) (2 5) (3 6)))
(test "map.5" (map (lambda (a b c) (list a b c)) '(1 2 3) '(4 5 6) '(7 8 9))
'((1 4 7) (2 5 8) (3 6 9)))
(test "map.6" (map (lambda (x) x) '()) '())
(test "map.7" (map car '()) '())
(test "map.8" (map car '((1))) '(1))
(test "for-each.1" (begin (for-each (lambda (x) x) '()) #t) #t)
(test "for-each.2" (let ((v 0))
(for-each (lambda (x) (set! v (+ x v)))
'(1 2 3))
v)
6)
(test "for-each.3" (let ((v 0))
(for-each (lambda (x y) (set! v (+ y x v)))
'(1 2 3) '(4 5 6))
v)
21)
(test "for-each.4" (let ((v 0))
(for-each (lambda (x y z) (set! v (+ y x v z)))
'(1 2 3) '(4 5 6) '(7 8 9))
v)
45)
; (test "filter" (filter number? '(1 2 #\a "foo" foo 3)) '(1 2 3))
; (test "filter!" (let ((l (list 1 2 #\a "foo" 'foo 3)))
; (set! l (filter! number? l))
; l) '(1 2 3))
; (test "any?" (any? number? '(1 2 3 4 5 6)) #t)
; (test "any?" (any? number? '(toto 1 2 3 4 5 6)) #t)
; (test "any?" (any? number? '(toto 1 2 3 4 5 6 tutu)) #t)
; (test "any?" (any? number? '(toto tutu)) #f)
; (test "any?" (any? > '(1 2 3 4) '(5 6 7 8)) #f)
; (test "any?" (any? > '(1 2 3 4) '(5 0 7 8)) #t)
; (test "every?" (every? number? '(1 2 3 4 5 6)) #t)
; (test "every?" (every? number? '(toto 1 2 3 4 5 6)) #f)
; (test "every?" (every? number? '(toto 1 2 3 4 5 6 tutu)) #f)
; (test "every?" (every? number? '(toto tutu)) #f)
; (test "every?" (every? > '(1 2 3 4) '(5 6 7 8)) #f)
; (test "every?" (every? > '(5 6 7 8) '(1 2 3 4)) #t)
(test "reverse" (reverse '(1 2 3 4)) '(4 3 2 1))
; (test "reverse!" (reverse! '(1 2 3 4)) '(4 3 2 1))
(test "list-tail" (list-tail '(1 2 3 4) 2) '(3 4))
(test "list-ref" (list-ref '(1 2 (3 4) 5) 2) '(3 4))
(test "assoc" (assoc 1 '((2 3) (4 5))) #f)
(test "equal.1" (equal? '(1 2 (3 4 (5) (6 7)) (5 6) "titi"
#(1 2 (6 #(6 7)) titi) tutu)
'(1 2 (3 4 (5) (6 7)) (5 6) "titi"
#(1 2 (6 #(6 7)) titi) tutu))
#t)
(test "equal.2" (equal? '(1 2 (3 4 (5) (6 7)) (5 6) "titi"
#(1 2 (6 #(6 7)) titi) tutu)
'(1 2 (3 4 (5) (6 7)) (5 6) "titi"
#(1 2 (6 #(6 7)) toto) tutu))
#f)
(test "member.1" (member '(1 2 3) '((0 1 2) (1 2 3) (4 5 6)))
'((1 2 3) (4 5 6)))
(test "length" (length '(1 2 3)) 3)
(test "append.1" (append '(1 2 (3 4)) '((5 6) 7)) '(1 2 (3 4) (5 6) 7))
(test "append.2" (append '(a b) '(c . d)) '(a b c . d))
(test "append.3" (append '() 'a) 'a)
(test "list" (list 1 2 3) '(1 2 3))
(test "list?.1" (list? '(1 2 . 4)) #f)
(test "list?.2" (list? '(1 2 3 4)) #t)
; (test "remq" (let ((x '(1 2 3 4))) (remq 2 x)) '(1 3 4))
; (test "remq!" (let ((x '(1 2 3 4))) (remq! 2 x) x) '(1 3 4))
; (test "delete" (let ((x '(1 2 (3 4) 5))) (delete '(3 4) x)) '(1 2 5))
; (test "delete!" (let ((x '(1 2 (3 4) 5))) (delete! '(3 4) x) x) '(1 2 5))
; Changed expected value from '(3 4 5) to #f, since eq? on numbers
; return #f. When we deploy tagged pointers, this may change.
; We did. But we didn't ditch the old implementation. Now what?
; (test "memq.1" (memq 3 '(1 2 3 4 5)) '(3 4 5))
; (test "memq.1" (memq 3 '(1 2 3 4 5)) #f)
(test "memq.2" (memq #\a '(1 2 3 4 5)) #f)
(test "member.2" (member '(2 3) '((1 2) (2 3) (3 4) (4 5)))
'((2 3) (3 4) (4 5)))
; (test "cons*.1" (cons* 1 0) '(1 . 0))
; (test "cons*.2" (cons* (cons* (quote x) 0 (quote ())) (quote ())) '((x 0)))
; (test "make-list.1" (make-list 2) '(#unspecified #unspecified))
; (test "make-list.2" (make-list 10 4) '(4 4 4 4 4 4 4 4 4 4))
; (test "list-tabulate" (list-tabulate 4 values) '(0 1 2 3))
; (test "iota.1" (iota 5) '(0 1 2 3 4))
; (test "iota.2" (iota 5 0 -1.) '(0. -1. -2. -3. -4.))
)
(test-list)
(total-report)
|
