anchor.diff: +;-*-syntax:COMMON-LISP;Package:(RT :use "COMMON-LISP" :colon-mode :external)-*-
  +
   #|----------------------------------------------------------------------------|
    | Copyright 1990 by the Massachusetts Institute of Technology, Cambridge MA. |
    |                                                                            |
  
positive.code: 	 (equalp-with-case (cdr x) (cdr y))))
     ((and (typep x 'array)
  	 (= (array-rank x) 0))
      (equalp-with-case (aref x) (aref y)))
     ((typep x 'vector)
      (and (typep y 'vector)
  	 (let ((x-len (length x))
  	       (y-len (length y)))
  	   (and (eql x-len y-len)
  		(loop
  		 for e1 across x
  		 for e2 across y
  		 always (equalp-with-case e1 e2))))))
     ((and (typep x 'array)
  	 (typep y 'array)
  	 (not (equal (array-dimensions x)
  		     (array-dimensions y))))
      nil)
     ((typep x 'array)
      (and (typep y 'array)
  	 (let ((size (array-total-size x)))
  	   (loop for i from 0 below size
  		 always (equalp-with-case (row-major-aref x i)
  					  (row-major-aref y i))))))
     (t (eql x y))))
  
  (defun do-entry (entry &optional
  
negative.code: 	  (stream out :direction :output)
  	(do-entries stream))))
  
  (defun do-entries* (s)
    (format s "~&Doing ~A pending test~:P ~
               of ~A tests total.~%"
            (count t (the list (cdr *entries*)) :key #'pend)
  	  (length (cdr *entries*)))
    (finish-output s)
    (dolist (entry (cdr *entries*))
      (when (and (pend entry)
  	       (not (has-disabled-note entry)))
        (format s "~@[~<~%~:; ~:@(~S~)~>~]"
  	      (do-entry entry s))
        (finish-output s)
        ))
    (let ((pending (pending-tests))
  	(expected-table (make-hash-table :test #'equal)))
      (dolist (ex *expected-failures*)
  