anchor.diff:  ;;;;****************************************************************************
   
   (in-package "COMMON-LISP-USER")
  -(DECLAIM (DECLARATION ALSO-USE-PACKAGES))
  -(declaim (ALSO-USE-PACKAGES "COM.INFORMATIMAGO.COMMON-LISP.CESARUM.SEQUENCE"))
   (defpackage "COM.INFORMATIMAGO.COMMON-LISP.CESARUM.LIST"
     (:use "COMMON-LISP")
     (:export "DLL-NEXT" "DLL-PREVIOUS" "DLL-NODE" "LIST-TO-DOUBLE-LINKED-LIST"
  
positive.code:            "MAKE-LIST-OF-RANDOM-NUMBERS" "LIST-INSERT-SEPARATOR"
             "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" "LIST-LENGTHS"
             "ENSURE-CIRCULAR" "MAKE-CIRCULAR-LIST" "CIRCULAR-LENGTH"
             "TREE-DIFFERENCE" "REPLACE-TREE" "MAPTREE")
  
negative.code:        :finally (return (values i i 0)))))
  
  
  (defun hashed-intersection (set1 set2)
    "
  AUTHORS: Paul F. Dietz <dietz@dls.net>
  