anchor.diff:                      end,
                       { Acc, SourceMap },
                       SourceKeys),
  -    interpolate_values(N - 1, SourceKeys, OutputSourceMap, OutputAcc).
  +    merge_values(N - 1, SourceKeys, OutputSourceMap, OutputAcc).
   
   %% Collect the first value for a given key, then return the value and the mutated map:
   pop_value(Key, SourceMap) ->
  
positive.code:             %% If we get any more options, we should use something associative rather than adding more options:
              go/0, go/1, go/2, go/3,
  
              force_encoding/2,
              get_ring_members/0,
              get_ring_owners/0
          ]).
  
negative.code: %%      Note: This algorithm is surely inefficient, but N is expected to be small.
  gather_vnodes_rr(NVnodes) ->
  
      %% Map owners to their vnode ids (not including ourselves):
      HandoffMap = dict:erase(node(), lists:foldl(fun({NodeID, NodeName}, AccDict) ->
                                                      dict:append(NodeName, NodeID, AccDict)
  