anchor.diff:  balance_test_() ->
       MapSizes = [1,2,1024,4096],
       NodeNums = [1,2,3,4,5,10,100],
  -    CopySizes = [1,2,3,4],
  +    CopySizes = [1,2,3],
       SlaveNums = [1,2,10],
       {inparallel,
        [balance_test_gen(MapSize, CopySize, NumNodes, NumSlaves)
  
positive.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([{C, Node} = CN | Rest], Turn, Counts) ->
      Total = dict:fetch({total, Node, Turn}, Counts),
      case Rest of
          [{C1, _}|_] when C1 == C->
              {Total1, CN1, Rest1} = best_node(Rest, Turn, Counts),
              if Total =< Total1 ->
                      {Total, CN, Rest};
                 true ->
                      {Total1, CN1, [CN|Rest1]}
              end;
          _ ->
              {Total, CN, Rest}
      end.
  
  
  %% @private
  
negative.code:                                        lists:min(ChainHist) =< 2
                             end, lists:sublist(Histograms, NumCopies)) of
                          false ->
                              io:fwrite("Histograms = ~w~n", [Histograms]),
                              io:fwrite("Counts = ~p~n", [dict:to_list(counts(Map))]),
                              false;
                          true ->
  