anchor.diff:  %% Claim nodes in seq a,b,c,a,b,c trying to handle the wraparound
   %% case to meet target N
   claim_diagonal(Wants, Owners, Params) ->
  -    TN = proplists:get_value(target_n_val, Params, 4),
  +    TN = proplists:get_value(target_n_val, Params, ?DEF_TARGET_N),
       Claiming = lists:sort([N || {N,W} <- Wants, W > 0]),
       S = length(Claiming),
       Q = length(Owners),
  
positive.code: -endif.
  -include_lib("eunit/include/eunit.hrl").
  -endif.
  
  claim(Ring) ->
      Want = app_helper:get_env(riak_core, wants_claim_fun),
  
negative.code:     choose_claim_v3(Ring, node()).
  
  choose_claim_v3(Ring, ClaimNode) ->
      Params = [{target_n_val, app_helper:get_env(riak_core, target_n_val, 
                                                  ?DEF_TARGET_N)}],
      choose_claim_v3(Ring, ClaimNode, Params).
  
  choose_claim_v3(Ring, _ClaimNode, Params) ->
      S = length(riak_core_ring:active_members(Ring)),
      Q = riak_core_ring:num_partitions(Ring),
      TN = proplists:get_value(target_n_val, Params, ?DEF_TARGET_N),
      Wants = wants(Ring),
      lager:debug("Claim3 started: S=~p Q=~p TN=~p\n", [S, Q, TN]),
      lager:debug("       wants: ~p\n", [Wants]),
  