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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
|
;;;; -*- Mode: LISP; Syntax: ANSI-Common-Lisp; Package: rsm.queue.test -*-
;;;; *************************************************************************
;;;; FILE IDENTIFICATION
;;;;
;;;; Name: queue-test.lisp
;;;; Purpose: Regression Testing For Queuing Package.
;;;; Author: R. Scott McIntire
;;;; Date Started: Aug 2003
;;;;
;;;; $Id: queue-test.lisp,v 1.4 2003/10/20 11:26:53 rscottmcintire Exp $
;;;; *************************************************************************
(in-package #:cl-user)
(defpackage rsm.queue.test
(:use #:cl rsm.queue #:ptester)
(:documentation
"Provides a test harness for queuing functions.")
)
(in-package rsm.queue.test)
;;;; SET UP A QUEUE TO TEST.
(defparameter *queue* (create (list 'a 'b)))
(defparameter *queue2* (create))
;;;; RUN THE TESTS.
(defun run-queue-tests ()
(with-tests (:name "QUEUE TESTS")
(enqueue '(b c) *queue*)
(test (list 'a 'b)
(dequeue *queue*)
:test #'equal
:fail-info "Test 1")
(enqueue 'a *queue*)
(enqueue 'b *queue*)
(enqueue 'c *queue*)
(test nil
(empty-p *queue*)
:fail-info "Test 2")
(test (list 'b 'c)
(dequeue *queue*)
:test #'equal
:fail-info "Test 3")
(test 'a
(dequeue *queue*)
:test #'equal
:fail-info "Test 4")
(test 'b
(dequeue *queue*)
:test #'equal
:fail-info "Test 5")
(test 'c
(dequeue *queue*)
:test #'equal
:fail-info "Test 6")
(test t
(empty-p *queue*)
:fail-info "Test 7")
(enqueue 'a *queue*)
(enqueue 'b *queue*)
(enqueue 'c *queue*)
(test nil
(empty-p *queue*)
:fail-info "Test 8")
(test 'a
(dequeue *queue*)
:fail-info "Test 9")
(test nil
(empty-p *queue*)
:fail-info "Test 10")
(test 'b
(dequeue *queue*)
:fail-info "Test 11")
(test nil
(empty-p *queue*)
:fail-info "Test 12")
(test 'c
(dequeue *queue*)
:fail-info "Test 13")
(test t
(empty-p *queue*)
:fail-info "Test 14")
(enqueue 'a *queue*)
(test nil
(empty-p *queue*)
:fail-info "Test 15")
(test 'a
(dequeue *queue*)
:fail-info "Test 16")
(test t
(empty-p *queue*)
:fail-info "Test 17")
(test nil
(dequeue *queue*)
:fail-info "Test 18")
(test nil
(dequeue *queue*)
:fail-info "Test 19")
(enqueue 'a *queue*)
(enqueue 'b *queue*)
(test nil
(empty-p *queue*)
:fail-info "Test 20")
(test 'a
(dequeue *queue*)
:fail-info "Test 21")
(test nil
(empty-p *queue*)
:fail-info "Test 22")
(test 'b
(dequeue *queue*)
:fail-info "Test 23")
(test nil
(dequeue *queue*)
:fail-info "Test 24")
(test t
(empty-p *queue*)
:fail-info "Test 25")
(enqueue (list 'a 'b) *queue*)
(enqueue (list 'c 'd) *queue*)
(enqueue (list 'e 'f) *queue*)
(test (list 'a 'b)
(dequeue *queue*)
:test #'equal
:fail-info "Test 26")
(test (list 'c 'd)
(dequeue *queue*)
:test #'equal
:fail-info "Test 27")
(test (list 'e 'f)
(dequeue *queue*)
:test #'equal
:fail-info "Test 28")
(test t
(queue-p *queue*)
:fail-info "Test 29")
(enqueue (list 'a 'b) *queue*)
(test t
(queue-p *queue*)
:fail-info "Test 30")
(enqueue (list 'c 'd) *queue*)
(enqueue (list 'e 'f) *queue*)
(do-nqueue (item *queue*)
(enqueue item *queue2*))
(test t
(queue-p *queue*)
:fail-info "Test 31")
(test t
(empty-p *queue*)
:fail-info "Test 32")
(test (list 'a 'b)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 33")
(test (list 'c 'd)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 34")
(test (list 'e 'f)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 35")
(enqueue (list 'a 'b) *queue*)
(test t
(queue-p *queue*)
:fail-info "Test 36")
(enqueue (list 'c 'd) *queue*)
(enqueue (list 'e 'f) *queue*)
(test (list (list 'a 'b) (list 'c 'd) (list 'e 'f))
(queue->list *queue*)
:test #'equal
:fail-info "Test 37")
(test nil
(empty-p *queue*)
:fail-info "Test 38")
;; Test the "do" control macro.
(do-queue (item *queue*)
(enqueue item *queue2*))
(test t
(queue-p *queue*)
:fail-info "Test 39")
(test nil
(empty-p *queue*)
:fail-info "Test 40")
(test (list 'a 'b)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 41")
(test (list 'c 'd)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 42")
(test (list 'e 'f)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 43")
(setf *queue2*
(list->queue (list (list 'a 'b) (list 'c 'd) (list 'e 'f))))
(test (list 'a 'b)
(get-first *queue2*)
:test #'equal
:fail-info "Test 44")
(test (list 'e 'f)
(get-last *queue2*)
:test #'equal
:fail-info "Test 45")
(test t
(queue-p *queue2*)
:fail-info "Test 46")
(test nil
(empty-p *queue2*)
:fail-info "Test 47")
(test (list 'a 'b)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 48")
(test (list 'c 'd)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 49")
(test (list 'e 'f)
(dequeue *queue2*)
:test #'equal
:fail-info "Test 50")
;;; Get the internal list of *queue*.
(test (list (list 'a 'b) (list 'c 'd) (list 'e 'f))
(nget-list *queue*)
:test #'equal
:fail-info "Test 51")
;;; This appears to be creating a queue with an element nil, but
;;; it creates an empty queue.
(setf *queue* (create nil))
;;; The queue should be empty.
(test t
(empty-p *queue*)
:fail-info "Test 52")
;;; Now queue up a nil.
(enqueue nil *queue*)
;;; The length of the queue should be 1.
(test 1
(length (queue->list *queue*))
:fail-info "Test 54")
;;; Queue up another nil.
(enqueue nil *queue*)
;;; The queue should have two nils which we drain.
(do-nqueue (item *queue*)
(let ((message (format nil "Test 55 item = ~s" item)))
(test nil
item
:fail-info message)))
;;; The queue should now be empty.
(test t
(empty-p *queue*)
:fail-info "Test 56")
;; Should get nil when dequeuing an empty queue.
(test nil
(dequeue *queue*)
:fail-info "Test 57")
(setf *queue* (create))
(enqueue "c" *queue*)
(enqueue "b" *queue*)
(enqueue "d" *queue*)
(enqueue "a" *queue*)
(setf *queue2* (sort-queue *queue* #'string<))
(test (list "a" "b" "c" "d")
(nget-list *queue2*)
:test #'equal
:fail-info "Test 58")
(setf *queue* (nsort-queue *queue* #'string<))
(test (list "a" "b" "c" "d")
(nget-list *queue*)
:test #'equal
:fail-info "Test 59")
(setf *queue* (create))
(enqueue "c" *queue*)
(enqueue "b" *queue*)
(enqueue "d" *queue*)
(enqueue "a" *queue*)
(nsort-queue *queue* #'string<)
(test (list "a" "b" "c" "d")
(nget-list *queue*)
:test #'equal
:fail-info "Test 60")
)
t
)
|
