anchor.diff:  
   default_wants_claim(Ring, Node) ->
       wants_claim_v1(Ring, Node).
  -
  -get_member_count(Ring, Node) ->
  -    %% Determine how many nodes are involved with the ring; if the requested
  -    %% node is not yet part of the ring, include it in the count.
  -    AllMembers = riak_core_ring:claiming_members(Ring),
  -    case lists:member(Node, AllMembers) of
  -        true ->
  -            length(AllMembers);
  -        false ->
  -            length(AllMembers) + 1
  -    end.
  -
  -get_expected_partitions(Ring, Node) ->
  -    riak_core_ring:num_partitions(Ring) div get_member_count(Ring, Node).
   
   wants_claim_v1(Ring) ->
       wants_claim_v1(Ring, node()).
  
positive.code:                      Last),
      {true, [ Part || {_, _, Part} <- Violations ]}.
  
  claim_with_n_met(Ring, TailViolations, Node) ->
      CurrentOwners = lists:keysort(1, riak_core_ring:all_owners(Ring)),
      Nodes = lists:usort([Node|riak_core_ring:claiming_members(Ring)]),
  
negative.code: -include_lib("eunit/include/eunit.hrl").
  -endif.
  
  %% ===================================================================
  %% API
  %% ===================================================================
  
  %% @spec default_choose_claim(riak_core_ring()) -> riak_core_ring()
  %% @doc Choose a partition at random.
  default_choose_claim(Ring) ->
      default_choose_claim(Ring, node()).
  
  default_choose_claim(Ring, Node) ->
      choose_claim_v1(Ring, Node).
  
  %% @spec default_wants_claim(riak_core_ring()) -> {yes, integer()} | no
  %% @doc Want a partition if we currently have less than floor(ringsize/nodes).
  default_wants_claim(Ring) ->
  