anchor.diff:      true  ->
           % perform remaining actions on last node
           {_, PointerInfo} = element(Sz, NodeTuple),
  -        {ok, ChildKPs, QueryOutput2, Bt2} =
  +        {ok, ChildKPs, QueryOutput2} =
               modify_node(Bt, PointerInfo, Actions, QueryOutput),
           NodeList = lists:reverse(ResultNode, bounded_tuple_to_list(NodeTuple, LowerBound,
               Sz - 1, ChildKPs)),
  -        {ok, NodeList, QueryOutput2, Bt2};
  +        {ok, NodeList, QueryOutput2};
       false ->
           {NodeKey, PointerInfo} = element(N, NodeTuple),
           SplitFun = fun({_ActionType, ActionKey, _ActionValue}) ->
                   not less(Bt, NodeKey, ActionKey)
               end,
           {LessEqQueries, GreaterQueries} = lists:splitwith(SplitFun, Actions),
  -        {ok, ChildKPs, QueryOutput2, Bt2} =
  +        {ok, ChildKPs, QueryOutput2} =
                   modify_node(Bt, PointerInfo, LessEqQueries, QueryOutput),
           ResultNode2 = lists:reverse(ChildKPs, bounded_tuple_to_revlist(NodeTuple,
                   LowerBound, N - 1, ResultNode)),
  -        modify_kpnode(Bt2, NodeTuple, N+1, GreaterQueries, ResultNode2, QueryOutput2)
  +        modify_kpnode(Bt, NodeTuple, N+1, GreaterQueries, ResultNode2, QueryOutput2)
       end.
   
   bounded_tuple_to_revlist(_Tuple, Start, End, Tail) when Start > End ->
  
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),
  