anchor.diff:      ?debugMsg("almost done."),
       ?debugVal(Level),
       Root = if
  -    is_tuple(Level) ->
  -        Level;
  +    length(Level) == 1 ->
  +        hd(Level);
       true ->
           ParentMbr = vtree:calc_nodes_mbr(Level),
           ChildrenPos = write_nodes(Fd, Level),
           {ParentMbr, #node{type=inner}, ChildrenPos}
       end,
       ?debugVal(Root),
  +
   %    {ok, Pos} = couch_file:append_term(Fd, Parent),
       {ok, Pos} = couch_file:append_term(Fd, Root),
       %{ok, Acc} = seedtree_write(Fd, [Tree], InsertHeight, []),
  
positive.code:         MbrAndPos = seedtree_write_finish(NewChildren);
      % insert tree is too small => expand seedtree
      HeightDiff > 0 ->
          % Create new seedtree
          %SeedTree = seedtree_init(Fd,        
          %{ok, Parent} = couch_file:pread_term(Fd, RootPos),
          ?debugVal(Acc),
          ok = foo;
      % insert tree is too high => use its children
      HeightDiff < 0 ->
          {OmtTree, _OmtHeight} = omt_load(New, ?MAX_FILLED),
  
negative.code: % This function returns a new list of children, as some children were
  % rewritten due to repacking. The MBR doesn't change (that's the nature of
  % this algorithm).
  seedtree_write(Fd, #seedtree_leaf{orig=Orig, new=New, pos=ParentPos},
          InsertHeight, Acc) ->
      ?debugMsg("leaf!!!!!!!!!!!!!!!!!!"),
      ?debugVal(Orig),
      ?debugVal(New),
  