anchor.diff:                   ;; found loop
                    (return (values i index (- i index)))
                    (setf (gethash current indexes) i)))
  -       :finally (return (values i)))))
  +       :finally (return (values i i 0)))))
   
   
   
  
positive.code:            "NSPLIT-LIST-ON-INDICATOR" "NSPLIT-LIST" "DEEPEST-REC" "DEEPEST" "DEPTH"
             "FLATTEN" "LIST-TRIM" "TRANSPOSE" "AGET" "MEMQ" "PLIST-REMOVE" "PLIST-GET"
             "PLIST-PUT" "HASHED-INTERSECTION" "HASHED-REMOVE-DUPLICATES"
             "ENSURE-LIST" "PROPER-LIST-P"
             "ENSURE-CIRCULAR" "MAKE-CIRCULAR-LIST" "CIRCULAR-LENGTH"
             "TREE-DIFFERENCE" "REPLACE-TREE" "MAPTREE")
    (:DOCUMENTATION
     "This package exports list processing functions.
      
      Copyright Pascal J. Bourguignon 2003 - 2008
      This package is provided under the GNU General Public License.
      See the source file for details."))
  (IN-PACKAGE "COM.INFORMATIMAGO.COMMON-LISP.CESARUM.LIST")
  
negative.code: ;;;;LEGAL
  ;;;;    GPL
  ;;;;
  ;;;;    Copyright Pascal J. Bourguignon 2002 - 2011
  ;;;;
  ;;;;    This script is free software; you can redistribute it and/or
  ;;;;    modify it under the terms of the GNU  General Public
  