;;;; 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)))
(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))
+ `(copy-tree ',arg))
args))))
(assert (equal (funcall (compile nil `(lambda () ,exp))) result)))))
(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))
+ `(copy-tree ',arg))
args))))
(check-error (funcall (compile nil `(lambda () ,exp))) fail)))))
(reverse (1 2 . 3))
(nreverse (1 2 . 3))
(nreconc (1 2 . 3) (4 5))
- (copy-alist ((1 . 2) (3 . 4) . 5))))
+ (copy-alist ((1 . 2) (3 . 4) . 5))))
(assert (raises-error? (apply (first test) (copy-tree (rest test)))
- type-error)))
+ 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)))))
+
+;;; Bug reported by Paul Dietz: ASSOC should ignore NIL elements in a
+;;; alist
+(let ((f (compile nil '(lambda (x)
+ (assoc x '(nil (a . b) nil (nil . c) (c . d))
+ :test #'eq)))))
+ (assert (equal (funcall f 'nil) '(nil . c))))
+
+;;; 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 (eq ,expected (funcall fun ,@(cdr form))))
+ (assert (eq ,expected (funcall (lambda ()
+ (declare (optimize speed))
+ ,form))))
+ (assert (eq ,expected (funcall (lambda ()
+ (declare (optimize space))
+ ,form)))))))
+ (let ((numbers '(1 2))
+ (fun (car (list 'member))))
+ (test numbers (member 1 numbers))
+ (test (cdr numbers) (member 2 numbers))
+ (test nil (member 1.0 numbers ))
+
+ (test numbers (member 1.0 numbers :test #'=))
+ (test numbers (member 1.0 numbers :test #'= :key nil))
+ (test (cdr numbers) (member 2.0 numbers :test '=))
+ (test nil (member 0 numbers :test '=))
+
+ (test numbers (member 0 numbers :test-not #'>))
+ (test (cdr numbers) (member 1 numbers :test-not 'eql))
+ (test nil (member 0 numbers :test-not '<))
+
+ (test numbers (member -1 numbers :key #'-))
+ (test (cdr numbers) (member -2 numbers :key '-))
+ (test nil (member -1.0 numbers :key #'-))
+
+ (test numbers (member -1.0 numbers :key #'- :test '=))
+ (test (cdr numbers) (member -2.0 numbers :key #'- :test '=))
+ (test nil (member -1.0 numbers :key #'- :test 'eql))))
projects / sbcl.git / blobdiff