anchor.diff:          end;
       % insert new tree into target tree
       Diff when Diff > 0 ->
  -?debugMsg("target tree higher"),
  -?debugVal(TargetPos),
  +    %?debugMsg("target tree higher"),
           {ok, _, SubPos} = insert_subtree(Fd, TargetPos, MbrAndPosList, Diff-1),
  -?debugVal(SubPos),
  -?debugMsg("target tree higher"),
           {SubPos, TargetHeight};
       % insert target tree into new tree
       Diff when Diff < 0 ->
  -?debugMsg("target tree smaller"),
  +    %?debugMsg("target tree smaller"),
           % NOTE vmx: I don't think this case can ever happen
           %case length(MbrAndPosList) of
           %1 ->
  
positive.code:         {Mbrs, Poss} = lists:unzip(Nodes),
          % Poss might be actual nodes, if it is a leaf node. Then they
          % are already wrapped in a list.
  ?debugVal(Poss),
          Poss2 = if
              is_list(hd(Poss)) -> hd(Poss);
              true -> Poss
          end,
  ?debugVal(Poss2),
          Mbr = vtree:calc_mbr(Mbrs),
          [{Mbr, Poss2}|Acc]
      end, [], NewChildren3)),
  
negative.code:             {MinExp, Nth2, Cnt+1}
          end
      end, {-1, 0, 0}, MbrAndPos),
      %?debugVal(Nth),
  
      % Remove the child where the node will be inserted
      {C1, C2} = lists:split(Nth-1, MbrAndPos),
  