anchor.diff:      ?debugVal(Result2),
       ?assertEqual(8, length(Result2)).
   
  --endif.
  +%-endif.
  
positive.code:     % third parameter
      %InsertHeight = TargetHeight - Seedtree#seedtree_root.height,
      TargetHeight = InsertHeight + Seedtree#seedtree_root.height,
  %    ?debugVal(TargetHeight),
  %    ?debugVal(InsertHeight),
      %seedtree_write(Fd, [Tree], InsertHeight, []).
      %{level_done, [{_Mbr, Pos}]} = seedtree_write(Fd, [Tree], InsertHeight, []),
      {level_done, Level} = seedtree_write(Fd, [Tree], InsertHeight, []),
  %    ?debugMsg("almost done."),
  %    ?debugVal(Level),
  %    ?debugVal(length(Level)),
  
negative.code:         MaxDepth::integer(), Depth::integer()) -> seedtree_node().
  % It's "Depth+1" as the root already contains several nodes (it's the nature
  % of a R-Tree).
  seedtree_init(Fd, RootPos, MaxDepth, Depth) when
          (Depth+1 == MaxDepth) or (Depth+1 == ?MAX_SEEDTREE_HEIGHT) ->
      %?debugVal(RootPos),
      {ok, Parent} = couch_file:pread_term(Fd, RootPos),
      {ParentMbr, ParentMeta, EntriesPos} = Parent,
  