;;;; While most of SBCL is derived from the CMU CL system, the test
;;;; files (like this one) were written from scratch after the fork
;;;; from CMU CL.
-;;;;
+;;;;
;;;; This software is in the public domain and is provided with
;;;; absolutely no warranty. See the COPYING and CREDITS files for
;;;; more information.
+;;; As reported by Paul Dietz from his ansi-test suite for gcl, REMOVE
+;;; malfunctioned when given :START, :END and :FROM-END arguments.
+;;; Make sure it doesn't happen again.
(let* ((orig '(1 2 3 2 6 1 2 4 1 3 2 7))
(x (copy-seq orig))
(y (remove 3 x :from-end t :start 1 :end 5))
(assert (equalp orig x))
(assert (equalp y '(1 2 2 6 1 2 4 1 3 2 7)))
(assert (equalp z '(1 3 6 1 2 4 1 3 2 7))))
+
+;;; Similarly, NSUBSTITUTE and friends were getting things wrong with
+;;; :START, :END and :FROM-END:
+(assert
+ (loop for i from 0 to 9 always
+ (loop for j from i to 10 always
+ (loop for c from 0 to (- j i) always
+ (let* ((orig '(a a a a a a a a a a))
+ (x (copy-seq orig))
+ (y (nsubstitute 'x 'a x :start i :end j :count c)))
+ (equal y (nconc (make-list i :initial-element 'a)
+ (make-list c :initial-element 'x)
+ (make-list (- 10 (+ i c))
+ :initial-element 'a))))))))
+
+(assert
+ (loop for i from 0 to 9 always
+ (loop for j from i to 10 always
+ (loop for c from 0 to (- j i) always
+ (let* ((orig '(a a a a a a a a a a))
+ (x (copy-seq orig))
+ (y (nsubstitute-if 'x (lambda (x) (eq x 'a)) x
+ :start i :end j
+ :count c :from-end t)))
+ (equal y (nconc (make-list (- j c) :initial-element 'a)
+ (make-list c :initial-element 'x)
+ (make-list (- 10 j)
+ :initial-element 'a))))))))
+(assert
+ (loop for i from 0 to 9 always
+ (loop for j from i to 10 always
+ (loop for c from 0 to (- j i) always
+ (let* ((orig '(a a a a a a a a a a))
+ (x (copy-seq orig))
+ (y (nsubstitute-if-not 'x (lambda (x)
+ (not (eq x 'a))) x
+ :start i :end j
+ :count c :from-end t)))
+ (equal y (nconc (make-list (- j c) :initial-element 'a)
+ (make-list c :initial-element 'x)
+ (make-list (- 10 j)
+ :initial-element 'a))))))))
+
+;;; And equally similarly, REMOVE-DUPLICATES misbehaved when given
+;;; :START arguments:
+
+(let ((orig (list 0 1 2 0 1 2 0 1 2 0 1 2)))
+ (assert (equalp (remove-duplicates orig :start 3 :end 9) '(0 1 2 0 1 2 0 1 2)))
+ (assert (equalp (delete-duplicates orig :start 3 :end 9) '(0 1 2 0 1 2 0 1 2))))
+
+;;; tests of COUNT
+(assert (= 1 (count 1 '(1 2 3))))
+(assert (= 2 (count 'z #(z 1 2 3 z))))
+(assert (= 0 (count 'y '(z 1 2 3 z))))
+
+;;; tests of COUNT-IF and COUNT-IF-NOT
+(macrolet (;; the guts of CCI, abstracted over whether we're testing
+ ;; COUNT-IF or COUNT-IF-NOT
+ (%cci (expected count-if test sequence-as-list &rest keys)
+ `(let* ((list ',sequence-as-list)
+ (simple-vector (coerce list 'simple-vector))
+ (length (length list))
+ (vector (make-array (* 2 length) :fill-pointer length)))
+ (replace vector list :end1 length)
+ (dolist (seq (list list simple-vector vector))
+ (assert (= ,expected (,count-if ,test seq ,@keys))))))
+ ;; "Check COUNT-IF"
+ (cci (expected test sequence-as-list &rest keys)
+ `(progn
+ (format t "~&SEQUENCE-AS-LIST=~S~%" ',sequence-as-list)
+ (%cci ,expected
+ count-if
+ ,test
+ ,sequence-as-list
+ ,@keys)
+ (%cci ,expected
+ count-if-not
+ (complement ,test)
+ ,sequence-as-list
+ ,@keys))))
+ (cci 1 #'consp (1 (12) 1))
+ (cci 3 #'consp (1 (2) 3 (4) (5) 6))
+ (cci 3 #'consp (1 (2) 3 (4) (5) 6) :from-end t)
+ (cci 2 #'consp (1 (2) 3 (4) (5) 6) :start 2)
+ (cci 0 #'consp (1 (2) 3 (4) (5) 6) :start 2 :end 3)
+ (cci 1 #'consp (1 (2) 3 (4) (5) 6) :start 1 :end 3)
+ (cci 1 #'consp (1 (2) 3 (4) (5) 6) :start 1 :end 2)
+ (cci 0 #'consp (1 (2) 3 (4) (5) 6) :start 2 :end 2)
+ (cci 2 #'zerop (0 10 0 11 12))
+ (cci 1 #'zerop (0 10 0 11 12) :start 1)
+ (cci 2 #'minusp (0 10 0 11 12) :key #'1-)
+ (cci 1 #'minusp (0 10 0 11 12) :key #'1- :end 2))
+(multiple-value-bind (v e)
+ (ignore-errors (count-if #'zerop '(0 a 0 b c) :start 1))
+ (declare (ignore v))
+ (assert (eql (type-error-datum e) 'a)))
+(multiple-value-bind (v e)
+ (ignore-errors (count-if #'zerop #(0 a 0 b c) :start 1 :from-end 11))
+ (declare (ignore v))
+ (assert (eql (type-error-datum e) 'c)))
+
+;;; :COUNT may be negative and BIGNUM
+(assert (equal (remove 1 '(1 2 3 1) :count 1) '(2 3 1)))
+(assert (equal (remove 1 '(1 2 3 1) :count (* 2 most-positive-fixnum)) '(2 3)))
+(assert (equal (remove 1 '(1 2 3 1) :count (* -2 most-positive-fixnum)) '(1 2 3 1)))
+
+;;; bug reported by Wolfgang Jenkner on sbcl-devel 2003-01-04:
+;;; embedded calls of SORT do not work
+(assert (equal (sort (list 0 0 0) (lambda (x y) (sort (list 0 0 0) #'<) nil))
+ '(0 0 0)))
+(assert (equal (sort (list 0 0 0 0 0)
+ (lambda (x y)
+ (declare (ignore x y))
+ (block compare
+ (sort (make-list 11 :initial-element 1)
+ (let ((counter 7))
+ (lambda (x y)
+ (declare (ignore x y))
+ (when (= (decf counter) 0)
+ (return-from compare nil))
+ t))))))
+ '(0 0 0 0 0)))
+
+;;; miscellaneous sanity checks on stuff which could've been broken by
+;;; changes in MERGE-LIST* in sbcl-0.7.11.*
+(assert (equal (merge 'list () () '<) ()))
+(assert (equal (merge 'list () (list 1) #'< :key 'identity) '(1)))
+(assert (equal (merge 'list (list 2) () '>) '(2)))
+(assert (equal (merge 'list (list 1 2 4) (list 2 3 7) '<) '(1 2 2 3 4 7)))
+(assert (equal (merge 'list (list 1 2 4) (list -2 3 7) #'<) '(-2 1 2 3 4 7)))
+(assert (equal (merge 'list (list 1 2 4) (vector -2 3 7) '< :key 'abs)
+ '(1 2 -2 3 4 7)))
+(assert (equal (merge 'list (list 1 -2 4) (list -2 3 7) '< :key #'abs)
+ '(1 -2 -2 3 4 7)))
+(assert (equal (stable-sort (list 1 10 2 12 13 3) '<) '(1 2 3 10 12 13)))
+(assert (equal (stable-sort (list 1 10 2 12 13 3) #'< :key '-)
+ '(13 12 10 3 2 1)))
+(assert (equal (stable-sort (list 1 10 2 12 13 3) '> :key #'-)
+ '(1 2 3 10 12 13)))
+(assert (equal (stable-sort (list 1 2 3 -3 -2 -1) '< :key 'abs)
+ '(1 -1 2 -2 3 -3)))
+
+;;; CSR broke FILL by not returning the sequence argument in a transform.
+(let* ((s1 (copy-seq "abcde"))
+ (s2 (fill s1 #\z)))
+ (assert s2)
+ (assert (string= s2 "zzzzz")))
+
+;;; POSITION on displaced arrays with non-zero offset has been broken
+;;; for quite a while...
+(let ((fn (compile nil '(lambda (x) (position x)))))
+ (let* ((x #(1 2 3))
+ (y (make-array 2 :displaced-to x :displaced-index-offset 1)))
+ (assert (= (position 2 y) 0))))
+
+;;; (SIMPLE-STRING) is a legal type specifier for creation functions
+(let ((a (make-sequence '(simple-string) 5))
+ (b (concatenate '(simple-string) "a" "bdec"))
+ (c (map '(simple-string) 'identity "abcde"))
+ (d (merge '(simple-string) (copy-seq "acd") (copy-seq "be") 'char>))
+ (e (coerce '(#\a #\b #\c #\e #\d) '(simple-string))))
+ (assert (= (length a) 5))
+ (assert (string= b "abdec"))
+ (assert (string= c "abcde"))
+ (assert (string= d "beacd"))
+ (assert (string= e "abced")))
projects / sbcl.git / blobdiff