anchor.diff:  % 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}, InsertHeight, _Acc) ->
  +seedtree_write(Fd, #seedtree_leaf{orig=Orig, new=New}, InsertHeight, Acc) ->
       ?debugMsg("leaf!!!!!!!!!!!!!!!!!!"),
       ?debugVal(Orig),
       ?debugVal(New),
       NewNum = length(New),
  -    %% Height of the OMT tree
  -    %Height = log_n_ceil(?MAX_FILLED, NewNum),
  -    % We can build the OMT tree now, as it is needed in any case
  -    {OmtTree, OmtHeight} = omt_load(New, ?MAX_FILLED),
  +    % Height of the OMT tree
  +    OmtHeight = log_n_ceil(?MAX_FILLED, NewNum),
       ?debugVal(OmtHeight),
  -    ?debugVal(OmtTree),
   
       % It's (Height + 1), as the OMT trees root node always needs to be a
       % sinlgle position in file (but the omt_load returns a root node with
  
positive.code:     NewChildrenPos2 = if
      % Input tree can be inserted as-is into the target tree
      HeightDiff == 0 ->
          NewChildren = seedtree_write_insert(Fd, Orig, OmtTree),
          MbrAndPos = seedtree_write_finish(NewChildren);
      HeightDiff > 0 ->
          ok = foo;
      % insert tree is too high => use its children
      HeightDiff < 0 ->
          % flatten the OMT tree until it has the expected height to be
          % inserted into the target tree (one subtree at a time).
          OmtTrees = lists:foldl(fun(_I, Acc) ->
  
negative.code:         {NewMbrs, NewPos} = lists:unzip(MbrAndPos2),
          ?debugVal({NewMbrs, NewPos}),
  
          % NOTE vmx: seedtree_write_finish/1 might still go crazy with
          %     huge node overflows
          MbrAndPos = seedtree_write_finish(lists:zip(NewMbrs, NewPos))
      end,
      % XXX vmx: Check NewChildrenPos2 for length. It might overflow the node
  