@@ -1,39 +1,31 @@
11
2−(function() {
3−
4−for(var i in Elm) { this[i] = Elm[i]; }
52Elm.Set=function(){
6− var hiddenVars=[];
7− for(var i in Elm.Prelude){
8− if (hiddenVars.indexOf(i) >= 0) continue;
9− this[i]=Elm.Prelude[i];}
10− var empty_0=Dict.empty;
11− var remove_3=Dict.remove;
12− var member_4=Dict.member;
13− var union_5=Dict.union;
14− var intersect_6=Dict.intersect;
15− var diff_7=Dict.diff;
16− var toList_8=Dict.keys;
17− var fromList_9=List.foldl(function(k_15){
3+ var empty_0=Elm.Dict.empty;
4+ var remove_3=Elm.Dict.remove;
5+ var member_4=Elm.Dict.member;
6+ var union_5=Elm.Dict.union;
7+ var intersect_6=Elm.Dict.intersect;
8+ var diff_7=Elm.Dict.diff;
9+ var toList_8=Elm.Dict.keys;
10+ var fromList_9=Elm.List.foldl(function(k_15){
1811 return function(t_16){
19− return Dict.insert(k_15)(["Tuple0"])(t_16);};})(empty_0);
12+ return Elm.Dict.insert(k_15)(["Tuple0"])(t_16);};})(empty_0);
2013 function singleton_1(k_13){
21− return Dict.singleton(k_13)(["Tuple0"]);};
14+ return Elm.Dict.singleton(k_13)(["Tuple0"]);};
2215 function insert_2(k_14){
23− return Dict.insert(k_14)(["Tuple0"]);};
16+ return Elm.Dict.insert(k_14)(["Tuple0"]);};
2417 function foldl_10(f_17){
25− return Dict.foldl(function(k_18){
18+ return Elm.Dict.foldl(function(k_18){
2619 return function(v_19){
2720 return function(b_20){
2821 return f_17(k_18)(b_20);};};});};
2922 function foldr_11(f_21){
30− return Dict.foldr(function(k_22){
23+ return Elm.Dict.foldr(function(k_22){
3124 return function(v_23){
3225 return function(b_24){
3326 return f_21(k_22)(b_24);};};});};
3427 function map_12(f_25){
3528 return function(t_26){
3629 return function(x){
37− return fromList_9(List.map(f_25)(x));}(toList_8(t_26));};};
30+ return fromList_9(Elm.List.map(f_25)(x));}(toList_8(t_26));};};
3831 return {empty:empty_0,singleton:singleton_1,insert:insert_2,remove:remove_3,member:member_4,union:union_5,intersect:intersect_6,diff:diff_7,toList:toList_8,fromList:fromList_9,foldl:foldl_10,foldr:foldr_11,map:map_12};}();
39−}());