anchor.diff:      % (like Ang/Tan) could be used. But we might also just use the OMT
       % algorithm.
       %NewNodes4 = case length(NewNodes3) > ?MAX_FILLED of
  -    %NewChildren = Disjoint ++ NewNodes3, 
  +    %NewChildren = Disjoint ++ NewNodes3,
   
       % XXX WARNING vmx: it is implicitly expected that NewChildren3 doesn't
       %     contain a depply nested list, though this could happen if
  
positive.code:         ChildrenNodes = load_nodes(Fd, RootNodes2Pos),
          {ChildrenNodes, LevelDiff}
      end,
  
  %    {MbrAndPos, TreeHeight} = lists:foldl(fun(
  %            {Mbr, Meta, {DocId, Value}}=Foo, {{_, CurPos}, _}) ->
  %        {ok, NewMbr, CurPos2, TreeHeight} = vtree:insert(
  
negative.code:     end,
      {ok, NewPos, TreeHeight};
  bulk_load(Fd, RootPos, TargetTreeHeight, Nodes) ->
      % XXX vmx (2010-12-13): WARNING -1 is really bad and for debugging purpose
      % only
      % NOTE vmx (2010-12-13): Let's see if the memoty bug also occurs with + 1
      SeedtreeHeight = floor(TargetTreeHeight/2),
  ?myDebugVal(SeedtreeHeight),
      Seedtree = seedtree_init(Fd, RootPos, SeedtreeHeight),
      Seedtree2 = seedtree_insert_list(Seedtree, Nodes),
  
  