X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;ds=sidebyside;f=tests%2Ftype.pure.lisp;h=6a0351a527fedf6e6543ba2347a2cd426ace33be;hb=45c2a2e4daee0f48ca79e7d4f37c4ae636ac2fb9;hp=90205bc0a094951a9ae9b761055b3b94dd3656eb;hpb=b956ed4f9cef685d1b49be28dcd2aec1e082d994;p=sbcl.git diff --git a/tests/type.pure.lisp b/tests/type.pure.lisp index 90205bc..6a0351a 100644 --- a/tests/type.pure.lisp +++ b/tests/type.pure.lisp @@ -43,16 +43,7 @@ array generic-function simple-error - ;; so it might seem easy to change the HAIRY - ;; :UNPARSE method to recognize that (NOT - ;; CONS) should unparse as ATOM. However, we - ;; then lose the nice (SUBTYPEP '(NOT ATOM) - ;; 'CONS) => T,T behaviour that we get from - ;; simplifying (NOT ATOM) -> (NOT (NOT CONS)) - ;; -> CONS. So, for now, we leave this - ;; commented out. - ;; - ;; atom + atom hash-table simple-string base-char @@ -206,3 +197,72 @@ ;;; bug 46c (dolist (fun '(and if)) (assert (raises-error? (coerce fun 'function) type-error))) + +(dotimes (i 100) + (let ((x (make-array 0 :element-type `(unsigned-byte ,(1+ i))))) + (eval `(typep ,x (class-of ,x))))) + +(assert (not (typep #c(1 2) '(member #c(2 1))))) +(assert (typep #c(1 2) '(member #c(1 2)))) +(assert (subtypep 'nil '(complex nil))) +(assert (subtypep '(complex nil) 'nil)) +(assert (subtypep 'nil '(complex (eql 0)))) +(assert (subtypep '(complex (eql 0)) 'nil)) +(assert (subtypep 'nil '(complex (integer 0 0)))) +(assert (subtypep '(complex (integer 0 0)) 'nil)) +(assert (subtypep 'nil '(complex (rational 0 0)))) +(assert (subtypep '(complex (rational 0 0)) 'nil)) +(assert (subtypep 'complex '(complex real))) +(assert (subtypep '(complex real) 'complex)) +(assert (subtypep '(complex (eql 1)) '(complex (member 1 2)))) +(assert (subtypep '(complex ratio) '(complex rational))) +(assert (subtypep '(complex ratio) 'complex)) +(assert (equal (multiple-value-list + (subtypep '(complex (integer 1 2)) + '(member #c(1 1) #c(1 2) #c(2 1) #c(2 2)))) + '(nil t))) + +(assert (typep 0 '(real #.(ash -1 10000) #.(ash 1 10000)))) +(assert (subtypep '(real #.(ash -1 1000) #.(ash 1 1000)) + '(real #.(ash -1 10000) #.(ash 1 10000)))) +(assert (subtypep '(real (#.(ash -1 1000)) (#.(ash 1 1000))) + '(real #.(ash -1 1000) #.(ash 1 1000)))) + +;;; Bug, found by Paul F. Dietz +(let* ((x (eval #c(-1 1/2))) + (type (type-of x))) + (assert (subtypep type '(complex rational))) + (assert (typep x type))) + +;;; Test derivation of LOG{AND,IOR,XOR} bounds for unsigned arguments. +;;; +;;; Fear the Loop of Doom! +(let* ((bits 5) + (size (ash 1 bits))) + (flet ((brute-force (a b c d op minimize) + (loop with extreme = (if minimize (ash 1 bits) 0) + with collector = (if minimize #'min #'max) + for i from a upto b do + (loop for j from c upto d do + (setf extreme (funcall collector + extreme + (funcall op i j)))) + finally (return extreme)))) + (dolist (op '(logand logior logxor)) + (dolist (minimize '(t nil)) + (let ((deriver (intern (format nil "~A-DERIVE-UNSIGNED-~:[HIGH~;LOW~]-BOUND" + op minimize) + (find-package :sb-c)))) + (loop for a from 0 below size do + (loop for b from a below size do + (loop for c from 0 below size do + (loop for d from c below size do + (let* ((brute (brute-force a b c d op minimize)) + (x-type (sb-c::specifier-type `(integer ,a ,b))) + (y-type (sb-c::specifier-type `(integer ,c ,d))) + (derived (funcall deriver x-type y-type))) + (unless (= brute derived) + (format t "FAIL: ~A [~D,~D] [~D,~D] ~A~% +ACTUAL ~D DERIVED ~D~%" + op a b c d minimize brute derived) + (assert (= brute derived)))))))))))))