anchor.diff:  
   
   lookup_path_test() ->
  -    {ok, {RootPos, Fd}} = vtree_test:build_random_tree("/tmp/randtree.bin", 20),
  +    {ok, {Fd, {RootPos, _}}} = vtree_test:build_random_tree(
  +            "/tmp/randtree.bin", 20),
       ?debugVal(RootPos),
       % Not inside 1st level
       EntryPath1 = lookup_path(Fd, RootPos, {1,3,2,4}, 2),
  
positive.code: 
  
  seedtree_init_test() ->
      {ok, {RootPos, Fd}} = vtree_test:build_random_tree("/tmp/randtree.bin", 20),
      ?debugVal(RootPos),
      SeedTree1 = seedtree_init(Fd, RootPos, 2),
      ?assertEqual({seedtree_root, {{4,43,980,986}, {node,inner},
  
negative.code:     {ok, ResultPos5} = seedtree_write(Fd5, Seedtree5_2, TargetTreeHeight5),
      ?debugVal(ResultPos5),
      {ok, Lookup5} = vtree:lookup(Fd5, ResultPos5, {0,0,1001,1001}),
      ?assertEqual(1051, length(Lookup5)).
  
  
  seedtree_write_case2() ->
      % Test "Case 2: input R-tree is not shorter than the level of the
      % target node" (chapter 6.2)
      % Test 2.1: input tree is too height
      TargetTreeNodeNum = 25,
      % NOTE vmx: wonder why this tree is not really dense
      {ok, {Fd, {RootPos, TargetTreeHeight}}} = vtree_test:build_random_tree(
              "/tmp/seedtree_write.bin", TargetTreeNodeNum),
  
      ?debugVal(RootPos),
      Nodes1 = lists:foldl(fun(I, Acc) ->
          {NodeId, {NodeMbr, NodeMeta, NodeData}} =
              vtree_test:random_node({I,27+I*329,45}),
          Node = {NodeMbr, NodeMeta, {[NodeId, <<"bulk">>], NodeData}},
          [Node|Acc]
      end, [], lists:seq(1,12)),
  
      Seedtree1 = seedtree_init(Fd, RootPos, 1),
      ?debugVal(Seedtree1),
      Seedtree2 = seedtree_insert_list(Seedtree1, Nodes1),
      {ok, ResultPos1} = seedtree_write(Fd, Seedtree2, TargetTreeHeight),
      ?debugVal(ResultPos1),
      {ok, Lookup1} = vtree:lookup(Fd, ResultPos1, {0,0,1001,1001}),
      ?assertEqual(45, length(Lookup1)),
  
  
  ok.
  
  
  % @doc Loads nodes from file
  