anchor.diff:  %     - the actual node value (if the tree consists only of one node).
   -spec omt_write_tree(Fd::file:io_device(), Tree::list()) -> {ok, integer()}.
   omt_write_tree(Fd, Tree) ->
  -    %?debugVal(Tree),
  +    ?debugVal(Tree),
       %{level_done, [{_Mbr, Pos}]} = omt_write_tree(Fd, [Tree], 0, []),
       %{level_done, Foo} = omt_write_tree(Fd, Tree, 0, []),
       Return = case omt_write_tree(Fd, Tree, 0, []) of
  
positive.code: 
  
  
  omt_write_tree_test() ->
      Filename = "/tmp/omt.bin",
      Nodes1 = lists:foldl(fun(I, Acc) ->
          {NodeId, {NodeMbr, NodeMeta, NodeData}} =
              vtree_test:random_node({I,20+I*250,30}),
          Node = {NodeMbr, NodeMeta, {NodeId, NodeData}},
          [Node|Acc]
      end, [], lists:seq(1,9)),
      {Omt1, _OmtHeight1} = omt_load(Nodes1, 2),
  
      Fd = case couch_file:open(Filename, [create, overwrite]) of
      {ok, Fd2} ->
          Fd2;
  
negative.code:     % a normal one (line Ang/Tan) is that it can split several levels at
      % one time (and not only split into two partitions)
      {NewNodes, NewNodesHeight} = omt_load(
          %ToRepackMbrAndPos ++ OmtMbrAndPos, ?MAX_FILLED),
          ToRepackMbrAndPos ++ OmtMbrAndPos2, ?MAX_FILLED),
      ?debugVal(NewNodes),
      ?debugVal(NewNodesHeight),
  
  