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
|
;-*- Mode: Lisp -*-
;;;; Author: Paul Dietz
;;;; Created: Fri Oct 18 20:17:30 2002
;;;; Contains: Tests for ECASE
(in-package :cl-test)
(deftest ecase.1
(ecase 'b (a 1) (b 2) (c 3))
2)
(deftest ecase.2
(classify-error (ecase 1))
type-error)
(deftest ecase.3
(classify-error (ecase 1 (a 1) (b 2) (c 3)))
type-error)
;;; It is legal to use T or OTHERWISE as key designators
;;; in ECASE forms. They have no special meaning here.
(deftest ecase.4
(classify-error (ecase 1 (t nil)))
type-error)
(deftest ecase.5
(classify-error (ecase 1 (otherwise nil)))
type-error)
(deftest ecase.6
(ecase 'b ((a z) 1) ((y b w) 2) ((b c) 3))
2)
(deftest ecase.7
(ecase 'z
((a b c) 1)
((d e) 2)
((f z g) 3))
3)
(deftest ecase.8
(ecase (1+ most-positive-fixnum)
(#.(1+ most-positive-fixnum) 'a))
a)
(deftest ecase.9
(classify-error (ecase nil (nil 'a)))
type-error)
(deftest ecase.10
(ecase nil ((nil) 'a))
a)
(deftest ecase.11
(ecase 'a (b 0) (a (values 1 2 3)) (c nil))
1 2 3)
(deftest ecase.12
(classify-error (ecase t (a 10)))
type-error)
(deftest ecase.13
(ecase t ((t) 10) (t 20))
10)
(deftest ecase.14
(let ((x (list 'a 'b)))
(eval `(ecase (quote ,x) ((,x) 1) (a 2))))
1)
(deftest ecase.15
(classify-error (ecase 'otherwise ((t) 10)))
type-error)
(deftest ecase.16
(classify-error (ecase t ((otherwise) 10)))
type-error)
(deftest ecase.17
(classify-error (ecase 'a (b 0) (c 1) (otherwise 2)))
type-error)
(deftest ecase.18
(classify-error (ecase 'a (b 0) (c 1) ((otherwise) 2)))
type-error)
(deftest ecase.19
(classify-error (ecase 'a (b 0) (c 1) ((t) 2)))
type-error)
(deftest ecase.20
(ecase #\a
((#\b #\c) 10)
((#\d #\e #\A) 20)
(() 30)
((#\z #\a #\y) 40))
40)
(deftest ecase.21 (ecase 1 (1 (values)) (2 'a)))
(deftest ecase.23 (ecase 1 (1 (values 'a 'b 'c)))
a b c)
;;; Show that the key expression is evaluated only once.
(deftest ecase.25
(let ((x 0))
(values
(ecase (progn (incf x) 'c)
(a 1)
(b 2)
(c 3)
(d 4))
x))
3 1)
;;; Repeated keys are allowed (all but the first are ignored)
(deftest ecase.26
(ecase 'b ((a b c) 10) (b 20))
10)
(deftest ecase.27
(ecase 'b (b 20) ((a b c) 10))
20)
(deftest ecase.28
(ecase 'b (b 20) (b 10) (d 0))
20)
;;; There are implicit progns
(deftest ecase.29
(let ((x nil))
(values
(ecase 2
(1 (setq x 'a) 'w)
(2 (setq x 'b) 'y)
(3 (setq x 'c) 'z))
x))
y b)
(deftest ecase.31
(ecase (values 'b 'c) (c 0) ((a b) 10) (d 20))
10)
(deftest ecase.32
(ecase 'a (a) (b 'b))
nil)
|