;;;; 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.
;;; looks as though it's past time to start accumulating regression
;;; tests for these.
(dolist (testcase
- '((:args ((1 2 3 4 5)) :result (1 2 3 4))
- (:args ((1 2 3 4 5) 6) :result nil)
- (:args (nil) :result nil)
- (:args ((1 2 3) 0) :result (1 2 3))
- (:args ((1 2 3) 1) :result (1 2))
- (:args ((1 2 3)) :result (1 2))
- (:args ((1 2 3) 2) :result (1))
- (:args ((1 2 3) 3) :result nil)
- (:args ((1 2 3) 4) :result nil)
- (:args ((1 2 3 . 4) 0) :result (1 2 3 . 4))
- (:args ((1 2 3 . 4) 1) :result (1 2))
- (:args ((1 2 3 . 4)) :result (1 2))
- (:args ((1 2 3 . 4) 2) :result (1))
- (:args ((1 2 3 . 4) 3) :result nil)
- (:args ((1 2 3 . 4) 4) :result nil)))
+ '((:args ((1 2 3 4 5)) :result (1 2 3 4))
+ (:args ((1 2 3 4 5) 6) :result nil)
+ (:args (nil) :result nil)
+ (:args ((1 2 3) 0) :result (1 2 3))
+ (:args ((1 2 3) 1) :result (1 2))
+ (:args ((1 2 3)) :result (1 2))
+ (:args ((1 2 3) 2) :result (1))
+ (:args ((1 2 3) 3) :result nil)
+ (:args ((1 2 3) 4) :result nil)
+ (:args ((1 2 3 . 4) 0) :result (1 2 3 . 4))
+ (:args ((1 2 3 . 4) 1) :result (1 2))
+ (:args ((1 2 3 . 4)) :result (1 2))
+ (:args ((1 2 3 . 4) 2) :result (1))
+ (:args ((1 2 3 . 4) 3) :result nil)
+ (:args ((1 2 3 . 4) 4) :result nil)))
(destructuring-bind (&key args result) testcase
(destructuring-bind (list &rest rest) args
;; Test with BUTLAST.
(let ((actual-result (apply #'butlast args)))
- (when (and (consp list) (eq actual-result list))
- (error "not a copy in BUTLAST for ~S" args))
- (unless (equal actual-result result)
- (error "failed BUTLAST for ~S" args)))
+ (when (and (consp list) (eq actual-result list))
+ (error "not a copy in BUTLAST for ~S" args))
+ (unless (equal actual-result result)
+ (error "failed BUTLAST for ~S" args)))
;; Test with NBUTLAST.
(let* ((copied-list (copy-list list))
- (actual-result (apply #'nbutlast copied-list rest)))
- (unless (equal actual-result result)
- (error "failed NBUTLAST for ~S" args))))))
+ (actual-result (apply #'nbutlast copied-list rest)))
+ (unless (equal actual-result result)
+ (error "failed NBUTLAST for ~S" args))))))
(multiple-value-bind (result error)
(ignore-errors (apply #'butlast (list t)))
;;; reported by Paul Dietz on cmucl-imp: LDIFF does not check type of
;;; its first argument
(assert (not (ignore-errors (ldiff 1 2))))
+
+;;; evaluation order in PUSH, PUSHNEW
+(let ((a (map 'vector #'list '(a b c))))
+ (let ((i 0))
+ (pushnew (incf i) (aref a (incf i)))
+ (assert (equalp a #((a) (b) (1 c))))))
+
+(symbol-macrolet ((s (aref a (incf i))))
+ (let ((a (map 'vector #'list '(a b c))))
+ (let ((i 0))
+ (push t s)
+ (assert (equalp a #((a) (t b) (c))))
+ (pushnew 1 s)
+ (assert (equalp a #((a) (t b) (1 c))))
+ (setq i 0)
+ (assert (eql (pop s) 't))
+ (assert (equalp a #((a) (b) (1 c)))))))
+
+;;; Type checking in NCONC
+(let ((tests '((((1 . 2)) (1 . 2))
+ (((1 . 2) (3 . 4)) (1 3 . 4))
+ (((1 . 2) 3) (1 . 3))
+ ((3) 3))))
+ (loop for (args result) in tests
+ do (assert (equal (apply 'nconc (copy-tree args)) result))
+ do (let ((exp `(nconc ,@ (mapcar (lambda (arg)
+ `(copy-tree ',arg))
+ args))))
+ (assert (equal (funcall (compile nil `(lambda () ,exp))) result)))))
+
+(let ((tests '(((3 (1 . 2)) 3)
+ (((1 . 2) 3 (4 . 5)) 3))))
+ (macrolet ((check-error (form failed-arg)
+ `(multiple-value-bind (.result. .error.)
+ (ignore-errors ,form)
+ (assert (null .result.))
+ (assert (typep .error. 'type-error))
+ (assert (eq (type-error-expected-type .error.) 'list))
+ (assert (equal (type-error-datum .error.) ,failed-arg)))))
+ (loop for (args fail) in tests
+ do (check-error (apply #'nconc (copy-tree args)) fail)
+ do (let ((exp `(nconc ,@ (mapcar (lambda (arg)
+ `(copy-tree ',arg))
+ args))))
+ (check-error (funcall (compile nil `(lambda () ,exp))) fail)))))
+
+(dolist (test '((append 1 2)
+ (append (1 2) nil (3 . 4) nil)
+ (append nil (1 2) nil (3 . 4) nil)
+ (reverse (1 2 . 3))
+ (nreverse (1 2 . 3))
+ (nreconc (1 2 . 3) (4 5))
+ (copy-alist ((1 . 2) (3 . 4) . 5))))
+ (assert (raises-error? (apply (first test) (copy-tree (rest test)))
+ type-error)))
+
+;;; Bug reported by Paul Dietz: NSET-EXCLUSIVE-OR should not return
+;;; extra elements, even when given "sets" contain duplications
+(assert (equal (remove-duplicates (sort (nset-exclusive-or (list 1 2 1 3)
+ (list 4 1 3 3))
+ #'<))
+ '(2 4)))
+
+;;; Bug reported by Adam Warner: valid list index designator is not
+;;; necessary a fixnum
+(let ((s (read-from-string "(a . #1=(b c . #1#))")))
+ (assert (eq (nth (* 1440 most-positive-fixnum) s) 'c))
+ (setf (nth (* 1440 most-positive-fixnum) s) 14)
+ (assert (eq (nth (* 1440 most-positive-fixnum) s) 14)))
+
+(let ((s (copy-list '(1 2 3))))
+ (assert (eq s (last s (* 1440 most-positive-fixnum))))
+ (assert (null (butlast s (* 1440 most-positive-fixnum))))
+ (assert (null (nbutlast s (* 1440 most-positive-fixnum)))))
+
+(assert (eq :atom (last (list* 1 2 3 :atom) (eval 0))))
+(assert (eq :atom (last (list* 1 2 3 :atom) 0)))
+
+;;; enforce lists in symbol-plist
+(let ((s (gensym))
+ (l (list 1 3 4)))
+ (assert (not (symbol-plist s)))
+ (assert (eq l (setf (symbol-plist s) l)))
+ (multiple-value-bind (res err)
+ (ignore-errors (setf (symbol-plist s) (car l)))
+ (assert (not res))
+ (assert (typep err 'type-error))))
+
+;;; member
+
+(macrolet ((test (expected form)
+ `(progn
+ (assert (equal ,expected (let ((numbers '(1 2)))
+ (funcall fun ,@(cdr form)))))
+ (assert (equal ,expected (funcall (lambda ()
+ (declare (optimize speed))
+ (let ((numbers '(1 2)))
+ ,form)))))
+ (assert (equal ,expected (funcall (lambda ()
+ (declare (optimize space))
+ (let ((numbers '(1 2)))
+ ,form))))))))
+ (let ((x-numbers '(1 2))
+ (fun (car (list 'member))))
+ (test x-numbers (member 1 numbers))
+ (test x-numbers (member 1 numbers :key 'identity))
+ (test x-numbers (member 1 numbers :key #'identity))
+ (test (cdr x-numbers) (member 2 numbers))
+ (test nil (member 1.0 numbers ))
+
+ (test x-numbers (member 1.0 numbers :test #'=))
+ (test x-numbers (member 1.0 numbers :test #'= :key nil))
+ (test (cdr x-numbers) (member 2.0 numbers :test '=))
+ (test nil (member 0 numbers :test '=))
+
+ (test x-numbers (member 0 numbers :test-not #'>))
+ (test (cdr x-numbers) (member 1 numbers :test-not 'eql))
+ (test nil (member 0 numbers :test-not '<))
+
+ (test x-numbers (member -1 numbers :key #'-))
+ (test (cdr x-numbers) (member -2 numbers :key '-))
+ (test nil (member -1.0 numbers :key #'-))
+
+ (test x-numbers (member -1.0 numbers :key #'- :test '=))
+ (test (cdr x-numbers) (member -2.0 numbers :key #'- :test '=))
+ (test nil (member -1.0 numbers :key #'- :test 'eql))))
+
+;;; assoc
+(macrolet ((test (expected form)
+ (let ((numbers '((1 a) (2 b)))
+ (tricky '(nil (a . b) nil (nil . c) (c . d))))
+ `(progn
+ (assert (equal ',expected (let ((numbers ',numbers)
+ (tricky ',tricky))
+ (funcall fun ,@(cdr form)))))
+ (assert (equal ',expected (funcall (lambda ()
+ (declare (optimize speed))
+ (let ((numbers ',numbers)
+ (tricky ',tricky))
+ ,form)))))
+ (assert (equal ',expected (funcall (lambda ()
+ (declare (optimize space))
+ (let ((numbers ',numbers)
+ (tricky ',tricky))
+ ,form)))))))))
+ (let ((fun (car (list 'assoc))))
+ (test (1 a) (assoc 1 numbers))
+ (test (2 b) (assoc 2 numbers))
+ (test (1 a) (assoc 1 numbers :key 'identity))
+ (test (2 b) (assoc 2 numbers :key #'identity))
+ (test nil (assoc 1.0 numbers))
+
+ (test (1 a) (assoc 1.0 numbers :test #'=))
+ (test (1 a) (assoc 1.0 numbers :test #'= :key nil))
+ (test (2 b) (assoc 2.0 numbers :test '=))
+ (test nil (assoc 0 numbers :test '=))
+
+ (test (1 a) (assoc 0 numbers :test-not #'>))
+ (test (2 b) (assoc 1 numbers :test-not 'eql))
+ (test nil (assoc 0 numbers :test-not '<))
+
+ (test (1 a) (assoc -1 numbers :key #'-))
+ (test (2 b) (assoc -2 numbers :key '-))
+ (test nil (assoc -1.0 numbers :key #'-))
+
+ (test (1 a) (assoc -1.0 numbers :key #'- :test '=))
+ (test (2 b) (assoc -2.0 numbers :key #'- :test '=))
+ (test nil (assoc -1.0 numbers :key #'- :test 'eql))
+
+ ;; Bug reported by Paul Dietz: ASSOC should ignore NIL elements in a
+ ;; alist
+ (test (nil . c) (assoc nil tricky :test #'eq))))
+
+;;; rassoc
+(macrolet ((test (expected form)
+ (let ((numbers '((a . 1) (b . 2)))
+ (tricky '(nil (b . a) nil (c . nil) (d . c))))
+ `(progn
+ (assert (equal ',expected (let ((numbers ',numbers)
+ (tricky ',tricky))
+ (funcall fun ,@(cdr form)))))
+ (assert (equal ',expected (funcall (lambda ()
+ (declare (optimize speed))
+ (let ((numbers ',numbers)
+ (tricky ',tricky))
+ ,form)))))
+ (assert (equal ',expected (funcall (lambda ()
+ (declare (optimize space))
+ (let ((numbers ',numbers)
+ (tricky ',tricky))
+ ,form)))))))))
+ (let ((fun (car (list 'rassoc))))
+ (test (a . 1) (rassoc 1 numbers))
+ (test (b . 2) (rassoc 2 numbers))
+ (test (a . 1) (rassoc 1 numbers :key 'identity))
+ (test (b . 2) (rassoc 2 numbers :key #'identity))
+ (test nil (rassoc 1.0 numbers))
+
+ (test (a . 1) (rassoc 1.0 numbers :test #'=))
+ (test (a . 1) (rassoc 1.0 numbers :test #'= :key nil))
+ (test (b . 2) (rassoc 2.0 numbers :test '=))
+ (test nil (rassoc 0 numbers :test '=))
+
+ (test (a . 1) (rassoc 0 numbers :test-not #'>))
+ (test (b . 2) (rassoc 1 numbers :test-not 'eql))
+ (test nil (rassoc 0 numbers :test-not '<))
+
+ (test (a . 1) (rassoc -1 numbers :key #'-))
+ (test (b . 2) (rassoc -2 numbers :key '-))
+ (test nil (rassoc -1.0 numbers :key #'-))
+
+ (test (a . 1) (rassoc -1.0 numbers :key #'- :test '=))
+ (test (b . 2) (rassoc -2.0 numbers :key #'- :test '=))
+ (test nil (rassoc -1.0 numbers :key #'- :test 'eql))
+
+ (test (c . nil) (rassoc nil tricky :test #'eq))))
+
+;;;; member-if & assoc-if & rassoc-if
+(macrolet ((test (value form)
+ `(let ((* ,value))
+ (assert (eval ,form))
+ (assert (funcall (compile nil (lambda () ,form)))))))
+ (test 'evenp
+ (equal '(2 3 4) (member-if * (list 1 2 3 4))))
+ (test 'evenp
+ (equal '(2 3 4) (locally (declare (optimize speed))
+ (member-if * '(1 2 3 4)))))
+ (test 'evenp
+ (equal '(3 4) (member-if * (list 1 2 3 4) :key (lambda (x) (if (= 3 x) 2 1)))))
+ (test 'evenp
+ (equal '(2 :two) (assoc-if * (list (list 1 :one) (list 3 :three) (list 2 :two) (list 4 :four)))))
+ (test 'evenp
+ (equal '(3 :three) (assoc-if * (list (list 1 :one) (list 3 :three) (list 2 :two) (list 4 :four))
+ :key (lambda (x) (if (= 3 x) 2 1)))))
+ (test 'evenp
+ (equal '(:two . 2) (rassoc-if * (list '(:one . 1) '(:three . 3) '(:two . 2) '(:four . 4)))))
+ (test (list 1 2 3 4)
+ (equal '(2 3 4) (member-if 'evenp *)))
+ (test (list (cons 1 'a) (cons 2 'b) (cons 3 'c))
+ (equal (cons 2 'b) (assoc-if 'evenp *))))
+
+;;;; member-if-not & assoc-if-not
+(macrolet ((test (value form)
+ `(let ((* ,value))
+ (assert (eval ,form))
+ (assert (funcall (compile nil (lambda () ,form)))))))
+ (test 'oddp
+ (equal '(2 3 4) (member-if-not * (list 1 2 3 4))))
+ (test 'oddp
+ (equal '(2 3 4) (locally (declare (optimize speed))
+ (member-if-not * '(1 2 3 4)))))
+ (test 'oddp
+ (equal '(3 4) (member-if-not * (list 1 2 3 4) :key (lambda (x) (if (= 3 x) 2 1)))))
+ (test 'oddp
+ (equal '(2 :two) (assoc-if-not * (list (list 1 :one) (list 3 :three) (list 2 :two) (list 4 :four)))))
+ (test 'oddp
+ (equal '(3 :three) (assoc-if-not * (list (list 1 :one) (list 3 :three) (list 2 :two) (list 4 :four))
+ :key (lambda (x) (if (= 3 x) 2 1)))))
+ (test (list 1 2 3 4)
+ (equal '(2 3 4) (member-if-not 'oddp *)))
+ (test (list (cons 1 'a) (cons 2 'b) (cons 3 'c))
+ (equal (cons 2 'b) (assoc-if-not 'oddp *))))
+
+;;; bug reported by Dan Corkill: *PRINT-CASE* affected the compiler transforms
+;;; for ASSOC & MEMBER
+(let ((*print-case* :downcase))
+ (assert (eql 2 (cdr (funcall (compile nil '(lambda (i l) (assoc i l)))
+ :b '((:a . 1) (:b . 2))))))
+ (assert (equal '(3 4 5) (funcall (compile nil '(lambda (i l) (member i l)))
+ 3 '(1 2 3 4 5)))))
+
+;;; bad bounding index pair to SUBSEQ on a list
+(let ((list (list 0 1 2 3 4 5)))
+ (multiple-value-bind (res err) (ignore-errors (subseq list 4 2))
+ (assert (not res))
+ (assert (typep err 'sb-kernel:bounding-indices-bad-error))))
+
+;;; ADJOIN must apply key to item as well
+(assert (equal '((:b)) (funcall
+ (compile nil '(lambda (x y) (adjoin x y :key #'car :test #'string=)))
+ (list 'b) (list '(:b)))))
+#+sb-eval
+(assert (equal '((:b))
+ (let ((sb-ext:*evaluator-mode* :interpret))
+ (eval '(adjoin (list 'b) (list '(:b)) :key #'car :test #'string=)))))
+
+;;; constant list argument to ADJOIN
+(assert (equal '(:x :y) (funcall
+ (compile nil '(lambda (elt)
+ (declare (optimize speed))
+ (adjoin elt '(:x :y))))
+ ':x)))
+(assert (equal '(:x :y) (funcall
+ (compile nil '(lambda (elt)
+ (declare (optimize speed))
+ (adjoin elt '(:y))))
+ ':x)))
+(assert (equal '(a) (funcall (compile nil '(lambda () (adjoin 'a nil))))))
+
+(macrolet ((test (expected list-1 list-2 &rest args)
+ `(progn
+ (assert (equal ,expected (funcall #'union ,list-1 ,list-2 ,@args)))
+ (assert (equal ,expected (funcall #'nunion
+ (copy-list ,list-1)
+ (copy-list ,list-2)
+ ,@args))))))
+ (test nil nil nil)
+ (test '(42) nil '(42))
+ (test '(42) '(42) nil)
+ (test '(42) '(42) '(42))
+ (test '((42) (42)) '((42)) '((42)))
+ (test '((42) (42)) '((42)) '((42)) :test-not #'equal)
+ (test '((42)) '((42)) '((42)) :test #'equal)
+ (test '((42)) '((42)) '((42)) :key #'car)
+ (test '((42)) '((42)) '((42)) :key #'car :test-not #'<))
+
+;;; FIND on lists should not call key outside the specified subsquence.
+(assert (not (find :a '(0 (:c) 1) :start 1 :end 2 :key #'car)))
+
+(with-test (:name :adjoin-folding)
+ (flet ((%f () (adjoin 'x '(a b))))
+ (assert (not (eq (%f) (%f))))))
projects / sbcl.git / blobdiff