anchor.diff:  
       % send entries in sender interval but not in sent KvvList
       % convert keys KvvList to a gb_tree for faster access checks
  -    MyIOtherKvTree =
  -        lists:foldl(fun({KeyX, _ValX, VersionX}, TreeX) ->
  -                            % assume, KVs at the same node have the same version
  -                            gb_trees:enter(KeyX, VersionX, TreeX)
  -                    end, gb_trees:empty(), MyIOtherKvvList),
  +    MyIOtherKvTree = make_other_kv_tree(MyIOtherKvvList),
   
       % allow the garbage collection to clean up the ReqKeys here:
       % also update the KvvList
  
positive.code:     ?TRACE("GET ENTRIES - Operation=~p~n SessionId:~p - #Items: ~p",
             [interval_upd_send, SID, length(EntryList)]),
  
      KvvList = [entry_to_kvv(E) || E <- EntryList],
      ResStarted = send_request_resolve(Dest, {?interval_upd, I, KvvList}, SID,
                                        FromMyNode, FBDest, [], false),
  
  
negative.code:                                intervals:in(RKey, MyI)].
  
  %% @doc Maps the given (unique!) key list to the MyI interval.
  %%      Note: mapped keys are not unique if MyI covers multiple replicas!
  -spec map_key_list([?RT:key()], MyI::intervals:interval()) -> [?RT:key()].
  map_key_list(KeyList, MyI) ->
      ?DBG_ASSERT(length(KeyList) =:= length(lists:usort(KeyList))),
  