1 ;;;; tests related to sequences
3 ;;;; This software is part of the SBCL system. See the README file for
6 ;;;; While most of SBCL is derived from the CMU CL system, the test
7 ;;;; files (like this one) were written from scratch after the fork
10 ;;;; This software is in the public domain and is provided with
11 ;;;; absolutely no warranty. See the COPYING and CREDITS files for
12 ;;;; more information.
14 ;;; As reported by Paul Dietz from his ansi-test suite for gcl, REMOVE
15 ;;; malfunctioned when given :START, :END and :FROM-END arguments.
16 ;;; Make sure it doesn't happen again.
17 (let* ((orig '(1 2 3 2 6 1 2 4 1 3 2 7))
19 (y (remove 3 x :from-end t :start 1 :end 5))
20 (z (remove 2 x :from-end t :start 1 :end 5)))
21 (assert (equalp orig x))
22 (assert (equalp y '(1 2 2 6 1 2 4 1 3 2 7)))
23 (assert (equalp z '(1 3 6 1 2 4 1 3 2 7))))
25 ;;; Similarly, NSUBSTITUTE and friends were getting things wrong with
26 ;;; :START, :END and :FROM-END:
28 (loop for i from 0 to 9 always
29 (loop for j from i to 10 always
30 (loop for c from 0 to (- j i) always
31 (let* ((orig '(a a a a a a a a a a))
33 (y (nsubstitute 'x 'a x :start i :end j :count c)))
34 (equal y (nconc (make-list i :initial-element 'a)
35 (make-list c :initial-element 'x)
36 (make-list (- 10 (+ i c))
37 :initial-element 'a))))))))
40 (loop for i from 0 to 9 always
41 (loop for j from i to 10 always
42 (loop for c from 0 to (- j i) always
43 (let* ((orig '(a a a a a a a a a a))
45 (y (nsubstitute-if 'x (lambda (x) (eq x 'a)) x
47 :count c :from-end t)))
48 (equal y (nconc (make-list (- j c) :initial-element 'a)
49 (make-list c :initial-element 'x)
51 :initial-element 'a))))))))
53 (loop for i from 0 to 9 always
54 (loop for j from i to 10 always
55 (loop for c from 0 to (- j i) always
56 (let* ((orig '(a a a a a a a a a a))
58 (y (nsubstitute-if-not 'x (lambda (x)
61 :count c :from-end t)))
62 (equal y (nconc (make-list (- j c) :initial-element 'a)
63 (make-list c :initial-element 'x)
65 :initial-element 'a))))))))
68 (assert (= 1 (count 1 '(1 2 3))))
69 (assert (= 2 (count 'z #(z 1 2 3 z))))
70 (assert (= 0 (count 'y '(z 1 2 3 z))))
72 ;;; tests of COUNT-IF and COUNT-IF-NOT
73 (macrolet (;; the guts of CCI, abstracted over whether we're testing
74 ;; COUNT-IF or COUNT-IF-NOT
75 (%cci (expected count-if test sequence-as-list &rest keys)
76 `(let* ((list ',sequence-as-list)
77 (simple-vector (coerce list 'simple-vector))
78 (length (length list))
79 (vector (make-array (* 2 length) :fill-pointer length)))
80 (replace vector list :end1 length)
81 (dolist (seq (list list simple-vector vector))
82 (assert (= ,expected (,count-if ,test seq ,@keys))))))
84 (cci (expected test sequence-as-list &rest keys)
86 (format t "~&SEQUENCE-AS-LIST=~S~%" ',sequence-as-list)
97 (cci 1 #'consp (1 (12) 1))
98 (cci 3 #'consp (1 (2) 3 (4) (5) 6))
99 (cci 3 #'consp (1 (2) 3 (4) (5) 6) :from-end t)
100 (cci 2 #'consp (1 (2) 3 (4) (5) 6) :start 2)
101 (cci 0 #'consp (1 (2) 3 (4) (5) 6) :start 2 :end 3)
102 (cci 1 #'consp (1 (2) 3 (4) (5) 6) :start 1 :end 3)
103 (cci 1 #'consp (1 (2) 3 (4) (5) 6) :start 1 :end 2)
104 (cci 0 #'consp (1 (2) 3 (4) (5) 6) :start 2 :end 2)
105 (cci 2 #'zerop (0 10 0 11 12))
106 (cci 1 #'zerop (0 10 0 11 12) :start 1)
107 (cci 2 #'minusp (0 10 0 11 12) :key #'1-)
108 (cci 1 #'minusp (0 10 0 11 12) :key #'1- :end 2))
109 (multiple-value-bind (v e)
110 (ignore-errors (count-if #'zerop '(0 a 0 b c) :start 1))
112 (assert (eql (type-error-datum e) 'a)))
113 (multiple-value-bind (v e)
114 (ignore-errors (count-if #'zerop #(0 a 0 b c) :start 1 :from-end 11))
116 (assert (eql (type-error-datum e) 'c)))