anchor.diff:  
   %%%%% Tests %%%%%
   
  +%-ifdef(runnall).
   
   % XXX vmx: tests with function (check_list/6 ) are missing
   chunk_list_test() ->
  
positive.code: %                Fd, CurPos, DocId, {Mbr, Meta, Value}),
  %        CurPos2
  %    end, RootPos, Nodes). 
  
  
  %%%%% Helpers %%%%%
  
negative.code:     ?assertEqual(772, length(Lookup5)),
      LeafDepths5 = vtreestats:leaf_depths(Fd5, ResultPos5),
      ?assertEqual([4], LeafDepths5).
  
  
  insert_subtree_test() ->
      {ok, {Fd, {RootPos, TreeHeight}}} = vtree_test:build_random_tree(
              "/tmp/randtree.bin", 20),
      ?debugVal(RootPos),
      ?debugVal(TreeHeight),
  
      Nodes1 = lists:foldl(fun(I, Acc) ->
          {NodeId, {NodeMbr, NodeMeta, NodeData}} =
              vtree_test:random_node({I,27+I*329,45}),
          Node = {NodeMbr, NodeMeta, {[NodeId, <<"subtree">>], NodeData}},
          [Node|Acc]
      end, [], lists:seq(1,5)),
  
  
      {Omt1, SubtreeHeight1} = omt_load(Nodes1, ?MAX_FILLED),
      ?debugVal(SubtreeHeight1),
      {ok, MbrAndPosList1} = omt_write_tree(Fd, Omt1),
  
      Result1 = lists:map(fun(MbrAndPos) ->
          {ok, NewMbr, NewPos} = insert_subtree(Fd, RootPos, MbrAndPos, 2),
          ?debugVal(NewPos),
  
          {ok, Lookup} = vtree:lookup(Fd, NewPos, {0,0,1001,1001}),
          %?assertEqual(76, length(Lookup)),
          LeafDepths = vtreestats:leaf_depths(Fd, NewPos),
          %?assertEqual([3], LeafDepths)
          {length(Lookup), LeafDepths}
      end, MbrAndPosList1),
  
      ?assertEqual([{23, [3]}, {22, [3]}], Result1).
  
  %-endif.
  