anchor.diff:  %% @doc Maps the given tuple list (with keys as first elements) to the MyI
   %%      interval.
   %%      Precond: tuple list with unique keys
  +%%      Note: mapped tuples are not unique if MyI covers multiple replicas!
   -spec map_kvv_list([Tpl], MyI::intervals:interval()) -> [Tpl]
           when is_subtype(Tpl, {?RT:key()} |
                                {?RT:key(), term()} |
  
positive.code:     NewState =
          State#rr_resolve_state{operation = {?key_upd, [], []},
                                 stats = Stats#resolve_stats{diff_size = ToUpdate},
                                 fb_send_kvv_req = lists:append(FbReqKVV, KvvList)},
  
      if ToUpdate =:= 0 ->
             % use the same options as above in get_state_response:
  
negative.code: 
      % Send entries in sender interval but not in sent KvvList
      % convert keys KvvList to a gb_tree for faster access checks
      MyIOtherKvTree = make_other_kv_tree(MyIOtherKvvList),
      % note: EntryList may not be unique! - it is made unique in shutdown/2 though
      MissingOnOther = [entry_to_kvv(X) || X <- EntryList,
                                           not gb_trees:is_defined(db_entry:get_key(X), MyIOtherKvTree)],
  
  