anchor.diff:                (b (copy-seq source)))
             (is (equalp ( sort a #'<)
                         (psort b #'< :parts i)))
  +          #-abcl
             (is (equalp ( sort a #'<)
                         (psort b #'< :parts i)))
  +          #-abcl
             (is (equalp ( sort a #'>)
                         (psort b #'> :parts i))))))
       (let1 source (vector 5 1 9 3 6 0 1 9)
  
positive.code:     (let1 v (make-random-seq 'vector size)
        (is (eq v (sort v #'<)))))
  
    (let1 source (make-random-vector
                  #-abcl 10000
                  #+abcl
                  (progn
                    (warn "Using smaller psort size for ABCL recursion issue.")
                    5000))
      (let ((a (copy-seq source))
            (b (copy-seq source)))
        (is (equalp ( sort a #'<)
                    (psort b #'<)))
        (is (equalp ( sort a #'<)
                    (psort b #'<))))
      (let ((a (copy-seq source))
  
negative.code:               (b (copy-seq source)))
            (is (equalp ( sort a #'< :key (lambda (x) (* -1 x)))
                        (psort b #'< :key (lambda (x) (* -1 x)) :parts i)))
            #-abcl
            (is (equalp ( sort a #'< :key (lambda (x) (* -1 x)))
                        (psort b #'< :key (lambda (x) (* -1 x)) :parts i))))))
      (let1 source (make-array 50 :initial-element 5)
  