anchor.diff:           (table (get-table self))
            (tokens (gethash hash table)))
       (setf (gethash hash table)
  -          (nconc tokens `(,token)))))
  +          (push token tokens))
  +    (incf (get-size self))
  +    (values)))
   
  -(defmethod remove-token ((self token-tree) (tok token))
  +(defun remove-token (self token)
  +  (declare (type token-tree self) (type token token))
     (with-accessors ((table get-table)) self
  -    (let* ((key (create-hash-code self tok))
  -           (obj (gethash key table)))
  -      (unless (null obj)
  -        (remhash key table))
  -      (values obj))))
  +    (let* ((key (create-hash-code self token))
  +           (token-list (gethash key table))
  +           (foundp nil))
  +      (setf token-list
  +            (delete-if #'(lambda (obj)
  +                           (setf foundp (equals obj token)))
  +                       token-list :count 1))
  +      (when foundp
  +        (if (null token-list)
  +            (remhash key table)
  +          (setf (gethash key table) token-list))
  +        (decf (get-size self)))
  +      (values foundp))))
   
  -(defun use-sortcode-p (tree)
  -  (declare (type token-tree tree))
  -  (get-use-sortcode tree))
  +(defun use-sortcode-p (self)
  +  (declare (type token-tree self))
  +  (get-use-sortcode self))
   
   (defun create-hash-code (tree token)
     (declare (type token-tree tree) (type token token))
  
positive.code: ;;; File: token-tree.lisp
  ;;; Description: Maintains a hashed collection of tokens.
  
  ;;; $Id: token-tree.lisp,v 1.13 2001/02/09 01:49:59 youngde Exp $
  
  (in-package :lisa)
  
  
negative.code:       (hash-code token)
      (get-fact-id (get-top-fact token))))
  
  (defun clear-tree (self)
    (declare (type token-tree self))
    (clrhash (get-table self))
    (setf (get-size self) 0))
  
  (defun token-tree-count (self)
    (declare (type token-tree self))
    (get-size self))
  
  #+ignore
  (defmacro with-tree-iterator ((key value tree) &body body)
    "Iterates over each element in TREE (an instance of TOKEN-TREE) and
    evaluates BODY. RETURN may be used to exit from the iterator with
  