anchor.diff:  ;                             (princ x)
   ;                             (print (showdiff *first-impl* *second-impl* x)))))
   ;  (rdiff base modified 'ref 1)
  -;  (lost-subtree-list (rdiff base modified 'ref 1) base 'ref 'lost))
  -
  -(defun merge-lost (routeref-diff lost-subtrees refmark)
  +;  (lostnode-list (rdiff base modified 'ref 1) base 'ref 'lost))
  +
  +(defun merge-lost (refdiff lostnode-lst refmark)
     (labels ((rec (node route)
  -               (let ((lostnodes (remove-if-not (p (equal (drop _ 2) route)) lost-subtrees))
  +               (let ((lostnodes (remove-if-not (p (equal (drop _ 2) route)) lostnode-lst))
                        (nodelength (length node)))
                    (mapcan (lambda (order)
                              (let* ((cur-item (nth order node))
  
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))
  