anchor.diff:  (defun ITOA (num)
     (format nil "~a" num))
   
  -;;; TAKEwHILE function
  +;;; TAKEWHILE function
   ;;; I took this function from Haskell.
   ;;; How can I give the implementation for sequence?
   ;;; Jan. 06th 2014, chiku
  
positive.code: ;;;    (remove nil (mapcar (lambda (x idx) (if (pred (funcall key x)) idx nil)) lst (iota (length lst))))))
  ;;;
  ;;; 22 Dec, 2010 chiku
  ;;; I revised the definition. This version works not only for list but also for general sequence.
  (defun position-list (item seq &key (key #'identity) (test #'eql))
    (labels ((rec (s acc)
                  (let ((pos (position item s :key key :test test)))
  
negative.code: ;;; it's not used. Thus, I decided to save them to this file.
  (defmacro in (obj &rest choices)
    (with-gensyms (insym)
      `(let ((,insym ,obj))
         (or ,@(mapcar (lambda (c) `(eql ,insym ,c)) choices)))))
  
  (defmacro inq (obj &rest choices)
    `(in ,obj ,@(mapcar (lambda (c) `',c) choices)))
  
  (defmacro in-if (fn &rest choices)
    (with-gensyms (fn-var)
      `(let ((,fn-var ,fn))
         (or ,@(mapcar (lambda (c) `(funcall ,fn-var ,c)) choices)))))
  
  (defmacro curry (fn)
    " curry fn => function;{{{
  