anchor.diff:               (:resolve () (if reserved (cons ref-mark route) subtree))
                (:cancel () (setf reserved nil)))))
   
  +;;; RDIFF function returns a diff format called ``refdiff''
   (defun rdiff (base modified refmark &optional (allowed-distance 0))
     (with-route (node r)
                 (let (tmp)
  
positive.code: ;                    (print (showdiff *first-impl* *second-impl* x)))))
  ;  (rdiff base modified 'ref 2))
  
  (defun routeref-list (routeref-diff refmark)
    (let ((result))
      (maptree (lambda (leaf)
                 ;; Here, we need to coerce ATOMs into NIL. The MAPTREE
  
negative.code: ;(printing-let* ((base *first-impl*)
  ;                (modified *impl2*)
  ;                (newnode-detected-diff  (rdiff base modified 'ref 1))
  ;                (lost-subtrees (lostnode-list newnode-detected-diff base 'ref 'lost)))
  ;               newnode-detected-diff
  ;               lost-subtrees
  ;               (merge-lost newnode-detected-diff lost-subtrees 'ref))
  