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:     Seed = erlang:now(),
      io:format("seed = ~p\n", [Seed]),
      random:seed(Seed),
      repeat(100, fun(_) -> float_int_compare(maps) end, []),
      repeat(100, fun(_) -> float_int_compare(hashmap) end, []),
      repeat(100, fun(_) -> recursive_compare() end, []),
      ok.
  
  float_int_compare(MapMod) ->
      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(MapMod, list_to_tuple(Pairs), Size) end,
  			  repeat(100, fun do_compare/1, [MapMod, MapGen, MapGen])
  		  end,
  		  lists:seq(1,length(Terms))),
      ok.
  
negative.code: 		  random:uniform(size(Leafs)+3)
  	  end,
      case Rnd of
  	1 -> % Make map
  	    Size = random:uniform(size(Leafs)),
  	    lists:foldl(fun(_, {Acc1,Acc2}) ->
  				{K1,K2} = term_gen_recursive(Leafs, Flags,
  							     Depth+1),
  				{V1,V2} = term_gen_recursive(Leafs, Flags, Depth+1),
  				%%ok = check_keys(K1,K2, 0),
  				{maps:put(K1,V1, Acc1), maps:put(K2,V2, Acc2)}
  			end,
  			{maps:new(), maps:new()},
  			lists:seq(1,Size));
  	2 -> % Make cons
  	    {Car1,Car2} = term_gen_recursive(Leafs, Flags, Depth+1),
  