anchor.diff:        (hash-code token)
       (get-fact-id (get-top-fact token))))
   
  -(defmethod clear-tree ((self token-tree))
  -  (clrhash (get-table self)))
  +(defun clear-tree (self)
  +  (declare (type token-tree self))
  +  (clrhash (get-table self))
  +  (setf (get-size self) 0))
   
  -(defmethod token-tree-count ((self token-tree))
  -  (hash-table-count (get-table self)))
  +(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
  
positive.code:                (progn ,@body)
               (return nil)))))))
  
  (defun make-token-tree (&key (use-sortcode-p nil))
    (make-instance 'token-tree :use-sortcode use-sortcode-p))
  
negative.code: ;;; File: token-tree.lisp
  ;;; Description: Maintains a hashed collection of tokens.
  
  ;;; $Id: token-tree.lisp,v 1.14 2001/02/09 15:19:56 youngde Exp $
  
  (in-package :lisa)
  
  