anchor.diff:      {ok, Lookup4} = vtree:lookup(Fd4, ResultPos4, {0,0,1001,1001}),
       ?assertEqual(246, length(Lookup4)),
   
  -    % Test 2.5: input tree is too hight (2 level) and produces multiple
  +    % Test 2.5: input tree is too high (2 levels) and produces multiple
       % splits (recusively) (seedtree height=2)
       % XXX vmx: not really sure if there's more than one split
       TargetTreeNodeNum5 = 196,
  
positive.code:     ?debugVal(ResultPos2_1),
      {ok, Lookup2_1} = vtree:lookup(Fd2, ResultPos2_1, {0,0,1001,1001}),
      ?assertEqual(92, length(Lookup2_1)),
  ok.
  
  % @doc Loads nodes from file
  -spec load_nodes(Fd::file:io_device(), Positions::[integer()]) -> list().
  
negative.code:     {level_done, Level} when length(Level) > ?MAX_FILLED ->
          ?debugMsg("Level done (doesn't fit in)"),
          ?debugVal(Level),
  
          %{Level2, _} = omt_load(Level, ?MAX_FILLED),
          %
          %Parents = lists:foldl(fun(Level3, LevelAcc) ->
          %    ParentMbr = vtree:calc_nodes_mbr(Level3),
          %    ChildrenPos = write_nodes(Fd, Level3),
          %    % XXX vmx: Not sure if type=inner is always right
          %    Parent = {ParentMbr, #node{type=inner}, ChildrenPos},
          %    [Parent|LevelAcc]
          %end, Acc, Level2),
          %?debugVal(Parents),
          %{ok, [Parents|Acc]}
          %{ok, Parents}
  
          % NOTE vmx: don't split now. We might need to split some upper levels
          %     as well (recursively)
          {ok, Level}
      end,
      ?debugVal(T),
      {Info, Acc3} = seedtree_write(Fd, T, InsertHeight, Acc2),
  