anchor.diff:      end.
   
   
  -complete_root(Bt, []) ->
  -    {ok, nil, Bt};
  -complete_root(Bt, [{_Key, PointerInfo}])->
  -    {ok, PointerInfo, Bt};
  +complete_root(_Bt, []) ->
  +    {ok, nil};
  +complete_root(_Bt, [{_Key, PointerInfo}])->
  +    {ok, PointerInfo};
   complete_root(Bt, KPs) ->
  -    {ok, ResultKeyPointers, Bt2} = write_node(Bt, kp_node, KPs),
  -    complete_root(Bt2, ResultKeyPointers).
  +    {ok, ResultKeyPointers} = write_node(Bt, kp_node, KPs),
  +    complete_root(Bt, ResultKeyPointers).
   
   %%%%%%%%%%%%% The chunkify function sucks! %%%%%%%%%%%%%
   % It is inaccurate as it does not account for compression when blocks are
  
positive.code:         find_first_gteq(Bt, Tuple, Start, Mid, Key)
      end.
  
  modify_kvnode(Bt, NodeTuple, LowerBound, [], ResultNode, QueryOutput) ->
      {ok, lists:reverse(ResultNode, bounded_tuple_to_list(NodeTuple, LowerBound, tuple_size(NodeTuple), [])), QueryOutput, Bt};
  modify_kvnode(Bt, NodeTuple, LowerBound, [{ActionType, ActionKey, ActionValue} | RestActions], ResultNode, QueryOutput) when LowerBound > tuple_size(NodeTuple) ->
      case ActionType of
      insert ->
  
negative.code:     ||
          ANodeList <- NodeListList
      ],
      {ok, ResultList}.
  
  modify_kpnode(Bt, {}, _LowerBound, Actions, [], QueryOutput) ->
      modify_node(Bt, nil, Actions, QueryOutput);
  modify_kpnode(_Bt, NodeTuple, LowerBound, [], ResultNode, QueryOutput) ->
      {ok, lists:reverse(ResultNode, bounded_tuple_to_list(NodeTuple, LowerBound,
              tuple_size(NodeTuple), [])), QueryOutput};
  modify_kpnode(Bt, NodeTuple, LowerBound,
          [{_, FirstActionKey, _}|_]=Actions, ResultNode, QueryOutput) ->
      Sz = tuple_size(NodeTuple),
  