anchor.diff:                                        Acc andalso SlaveCount == NumSlaves
                                             andalso Min /= really_big
                                             andalso Max > 0
  -                                          andalso Max - Min =< 1
  +                                          andalso Max - Min =< 2
                                 end, true, SlaveCounts)
                       end
               end
  
positive.code: 
  
  %% @private
  %% @doc Insert an item in the proper place in an already-sorted list.
  sorted_insert(Element, [H|_] = List) when Element =< H ->
      [Element|List];
  sorted_insert(Element, [H|T]) ->
      [H|sorted_insert(Element, T)];
  sorted_insert(Element, []) ->
      [Element].
  
  
  %% @private
  %% @doc Generate a list of nodes for testing.
  testnodes(NumNodes) ->
      [list_to_atom([$n | integer_to_list(N)]) || N <- lists:seq(1, NumNodes)].
  
negative.code: %% beginning of a sorted list consisting of counts of vbuckets *at
  %% this turn for this master* followed by the node name. Also returns
  %% the remainder of the list to make it easy to update the count.
  best_node(NodeCounts, Turn, Counts, Blacklist) ->
      NodeCounts1 = [{Count, dict:fetch({total, Node, Turn}, Counts), Node}
                     || {Count, Node} <- NodeCounts,
                        not lists:member(Node, Blacklist)],
      {Count, _, Node} = lists:min(NodeCounts1),
      {Count, Node}.
  
  
  %% @private
  