anchor.diff:      {NumPartitions,_Nodes} = CHash,
       NumPartitions.
   
  -
   update_test() ->
       Node = 'old@host', NewNode = 'new@host',
       
  
positive.code:     {_NumPartitions, Nodes} = CHash,
      Nodes.
  
  % @doc Return a randomized merge of two rings based on a vclock.
  %      If multiple nodes are actively claiming nodes in the same
  %      time period, churn will occur.  Be prepared to live with it.
  % @spec merge_rings(CHashA :: chash(), CHashB :: chash()) -> chash()
  
negative.code: %      starting at Index.
  % @spec predecessors(Index :: index(), CHash :: chash()) -> [NodeEntry]
  predecessors(Index, CHash) ->
      {NumPartitions, _Nodes} = CHash,
      predecessors(Index, CHash, NumPartitions).
  % @doc Given an object key, return the next N NodeEntries in reverse order
  %      starting at Index.
  % @spec predecessors(Index :: index(), CHash :: chash(), N :: integer())
  