anchor.diff:              (return true)))
         (return false))
   
  -    (defun append (arr1 arr2)
  -      "Return a new array with the contents of ARR1 and ARR2. If ARR2 is not an array
  -then append it as a member."
  -      (let ((result (array))
  -            (idx 0))
  -        (dolist (el arr1)
  -          (setf (aref result idx) el)
  -          (setf idx (1+ idx)))
  -        (unless (= arr2 undefined)
  -          (if (instanceof arr2 *array)
  -              (dolist (el arr2)
  -                (setf (aref result idx) el)
  -                (setf idx (1+ idx)))
  -              (setf (aref result idx) arr2))))
  -      (return result))
  -
       (defun set-difference (arr arr-to-sub)
         "Return a new array with only those elements in ARR that are not in ARR-TO-SUB."
         (let ((idx 0)
  
positive.code: (in-package :parenscript)
  
  ;;; Script of library functions you can include with your own code to
  ;;; provide standard Lisp functionality.
  
negative.code:       (let ((result-array (make-array)))
          (if (= 1 (length as))
              (dolist (element (aref as 0))
                ((@ result-array push) (fun element)))
              (dotimes (i (length (aref as 0)))
                (let ((args-array (mapcar (lambda (a) (return (aref a i))) as)))
                  ((@ result-array push) ((@ fun apply) fun args-array)))))
          (return result-array)))
  
      (defun map-into (fn arr)
  