anchor.diff:  	{false,false} -> 1
       end.
   
  -map_gen(MapMod, Pairs, Size) ->
  +map_gen(Pairs, Size) ->
       {_,L} = lists:foldl(fun(_, {Keys, Acc}) ->
   				KI = random:uniform(size(Keys)),
   				K = element(KI,Keys),
  
positive.code: 			{Pairs, []},
  			lists:seq(1,Size)),
  
      map_from_list(MapMod, L).
  
  
  recursive_compare() ->
  
negative.code:     Seed = erlang:now(),
      io:format("seed = ~p\n", [Seed]),
      random:seed(Seed),
      repeat(100, fun(_) -> float_int_compare() end, []),
      repeat(100, fun(_) -> recursive_compare() end, []),
      ok.
  
  float_int_compare() ->
      Terms = numeric_keys(3),
      %%io:format("Keys to use: ~p\n", [Terms]),
      Pairs = lists:map(fun(K) -> list_to_tuple([{K,V} || V <- Terms]) end, Terms),
      lists:foreach(fun(Size) ->
  			  MapGen = fun() -> map_gen(list_to_tuple(Pairs), Size) end,
  			  repeat(100, fun do_compare/1, [MapGen, MapGen])
  		  end,
  		  lists:seq(1,length(Terms))),
      ok.
  