anchor.diff:      % Transform the nodes to repack from normal ones to tuples (consisting
       % of the MBR and the position where the node in the file (or the nodes
       % themselves if they are leaf nodes)
  -%?debugVal(NodesToRepack),
  -%?debugVal(PosToRepack2),
       ToRepackMbrAndPos = lists:zipwith(fun({Mbr, _, _}, Pos) ->
           {Mbr, Pos}
       end, NodesToRepack, PosToRepack2),
  
positive.code:         MbrAndPos = seedtree_write_finish(NewChildren);
      % insert tree is too small => expand seedtree
      HeightDiff > 0 ->
          %?debugVal(ParentPos),
          % Create new seedtree
          % NOTE vmx: HeightDiff+1 makes sense as we like to load the level
  
negative.code:     % XXX vmx: The idea will be to propage changes up, but only one level
      %    and not up to the root (as changes might also come from other
      %    siblings).
  
      %% XXX vmx: I temporarily write this node to disk just for debugging
      %% purpose, this should still be there in the final code.
      %{DebugMbr, DebugPosList} = hd(NewChildrenPos2),
      %{ok, DebugPos} = couch_file:append_term(
      %        Fd, {DebugMbr, #node{type=inner}, DebugPosList}),
      %?debugVal(DebugPos),
  
      {new_leaf, NewChildrenPos2};
  seedtree_write(Fd, [{Mbr, Meta, Children}=H|T], InsertHeight, Acc) ->
      %?debugVal(H),
  