ClojureScript: Chrome doesn't set function.arity: changed lazy apply so it doesn't rely on arity.

3 files changed, 233 insertions, 229 deletions

diff --git a/clojurescript/boot.js b/clojurescript/boot.js
index 0bb23e4a..ad20443f 100644
--- a/clojurescript/boot.js
+++ b/clojurescript/boot.js
@@ -23,12 +23,12 @@ return (clojure.lang.RT.cons(x_1,seq_2))})))})();
 //(def conj (fn conj ([coll x] (. clojure.lang.RT (conj coll x))) ([coll x & xs] (if xs (recur (conj coll x) (first xs) (rest xs)) (conj coll x)))))
 //---
 (function __clojure_fn_2633(){
-return (clojure.JS.def(clojure,"conj",clojure.JS.variatic(function __clojure_fn_2633_conj_2635(coll_1,x_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"conj",clojure.JS.variatic(2,(function __clojure_fn_2633_conj_2635(coll_1,x_2){switch(arguments.length){
 case 2:var conj_0=arguments.callee;
 return (clojure.lang.RT.conj(coll_1,x_2))}
 var _cnt,_rtn,xs_3,conj_0=arguments.callee,xs_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_t0=conj_0(coll_1,x_2),_t1=clojure.first(xs_3),_t2=clojure.rest(xs_3),coll_1=_t0,x_2=_t1,xs_3=_t2)):(conj_0(coll_1,x_2)))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(def second (fn second [x] (first (rest x))))
@@ -142,7 +142,7 @@ do{_cnt=0;_rtn=((clojure.rest(s_1))?((_cnt=1,_t0=clojure.rest(s_1),s_1=_t0)):(cl
 //---
 (function __clojure_fn_2790(){
 return (clojure.JS.def(clojure,"butlast",(function __clojure_fn_2790_butlast_2792(s_1){
-var s_3,ret_2,butlast_0=arguments.callee;
+var ret_2,s_3,butlast_0=arguments.callee;
 return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY),
 (s_3=s_1);do{_cnt=0;
 _rtn=((clojure.rest(s_3))?((_cnt=1,_t0=clojure.conj(ret_2,clojure.first(s_3)),_t1=clojure.rest(s_3),ret_2=_t0,s_3=_t1)):(clojure.seq(ret_2)))}while(_cnt);return _rtn;})()))})))})();
@@ -165,10 +165,10 @@ return (clojure.lang.RT.toArray(coll_1))})))})();
 //(defn vector "Creates a new vector containing the args." ([] []) ([& args] (. clojure.lang.LazilyPersistentVector (create args))))
 //---
 (function __clojure_fn_2834(){
-return (clojure.JS.def(clojure,"vector",clojure.JS.variatic(function __clojure_fn_2834_vector_2836(){switch(arguments.length){
+return (clojure.JS.def(clojure,"vector",clojure.JS.variatic(0,(function __clojure_fn_2834_vector_2836(){switch(arguments.length){
 case 0:return (clojure.lang.PersistentVector.EMPTY)}
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.lang.LazilyPersistentVector.create(args_1))})))})();
+return (clojure.lang.LazilyPersistentVector.create(args_1))}))))})();
 
 //======
 //(defn vec "Creates a new vector containing the contents of coll." ([coll] (. clojure.lang.LazilyPersistentVector (createOwning (to-array coll)))))
@@ -181,34 +181,34 @@ return (clojure.lang.LazilyPersistentVector.createOwning(clojure.to_array(coll_1
 //(defn hash-set "Returns a new hash set with supplied keys." ([] #{}) ([& keys] (. clojure.lang.PersistentHashSet (create keys))))
 //---
 (function __clojure_fn_2867(){
-return (clojure.JS.def(clojure,"hash_set",clojure.JS.variatic(function __clojure_fn_2867_hash_set_2869(){switch(arguments.length){
+return (clojure.JS.def(clojure,"hash_set",clojure.JS.variatic(0,(function __clojure_fn_2867_hash_set_2869(){switch(arguments.length){
 case 0:return (clojure.lang.PersistentHashSet.EMPTY)}
 var keys_1,keys_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.lang.PersistentHashSet.create(keys_1))})))})();
+return (clojure.lang.PersistentHashSet.create(keys_1))}))))})();
 
 //======
 //(defn sorted-map "keyval => key val\n  Returns a new sorted map with supplied mappings." ([& keyvals] (. clojure.lang.PersistentTreeMap (create keyvals))))
 //---
 (function __clojure_fn_2880(){
-return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variatic(function __clojure_fn_2880_sorted_map_2882(){
+return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variatic(0,(function __clojure_fn_2880_sorted_map_2882(){
 var keyvals_1,keyvals_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.lang.PersistentTreeMap.create(keyvals_1))})))})();
+return (clojure.lang.PersistentTreeMap.create(keyvals_1))}))))})();
 
 //======
 //(defn sorted-set "Returns a new sorted set with supplied keys." ([& keys] (. clojure.lang.PersistentTreeSet (create keys))))
 //---
 (function __clojure_fn_2892(){
-return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variatic(function __clojure_fn_2892_sorted_set_2894(){
+return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variatic(0,(function __clojure_fn_2892_sorted_set_2894(){
 var keys_1,keys_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.lang.PersistentTreeSet.create(keys_1))})))})();
+return (clojure.lang.PersistentTreeSet.create(keys_1))}))))})();
 
 //======
 //(defn sorted-map-by "keyval => key val\n  Returns a new sorted map with supplied mappings, using the supplied comparator." ([comparator & keyvals] (. clojure.lang.PersistentTreeMap (create comparator keyvals))))
 //---
 (function __clojure_fn_2904(){
-return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variatic(function __clojure_fn_2904_sorted_map_by_2906(comparator_1){
+return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variatic(1,(function __clojure_fn_2904_sorted_map_by_2906(comparator_1){
 var keyvals_2,keyvals_2=clojure.JS.rest_args(this,arguments,1);
-return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))})))})();
+return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))}))))})();
 
 //======
 //(defn nil? "Returns true if x is nil, false otherwise." {:tag Boolean} [x] (identical? x nil))
@@ -242,13 +242,13 @@ return (((x_1)?(false):(true)))})))})();
 //(defn str "With no args, returns the empty string. With one arg x, returns\n  x.toString().  (str nil) returns the empty string. With more than\n  one arg, returns the concatenation of the str values of the args." {:tag String} ([] "") ([x] (if (nil? x) "" (. x (toString)))) ([x & ys] (loop [sb (new StringBuilder (str x)) more ys] (if more (recur (. sb (append (str (first more)))) (rest more)) (str sb)))))
 //---
 (function __clojure_fn_2987(){
-return (clojure.JS.def(clojure,"str",clojure.JS.variatic(function __clojure_fn_2987_str_2989(x_1){switch(arguments.length){
+return (clojure.JS.def(clojure,"str",clojure.JS.variatic(1,(function __clojure_fn_2987_str_2989(x_1){switch(arguments.length){
 case 1:return (((clojure.nil_QMARK_(x_1))?(""):((x_1).toString())))
 case 0:return ("")}
-var more_4,sb_3,ys_2,ys_2=clojure.JS.rest_args(this,arguments,1);
+var ys_2,sb_3,more_4,ys_2=clojure.JS.rest_args(this,arguments,1);
 return (((function __loop(){var _rtn,_cnt;(sb_3=(new java.lang.StringBuilder(clojure.str(x_1)))),
 (more_4=ys_2);do{_cnt=0;
-_rtn=((more_4)?((_cnt=1,_t0=(sb_3).append(clojure.str(clojure.first(more_4))),_t1=clojure.rest(more_4),sb_3=_t0,more_4=_t1)):(clojure.str(sb_3)))}while(_cnt);return _rtn;})()))})))})();
+_rtn=((more_4)?((_cnt=1,_t0=(sb_3).append(clojure.str(clojure.first(more_4))),_t1=clojure.rest(more_4),sb_3=_t0,more_4=_t1)):(clojure.str(sb_3)))}while(_cnt);return _rtn;})()))}))))})();
 
 //======
 //(defn symbol "Returns a Symbol with the given namespace and name." ([name] (. clojure.lang.Symbol (intern name))) ([ns name] (. clojure.lang.Symbol (intern ns name))))
@@ -287,9 +287,9 @@ return (((clojure.nil_QMARK_(arglist_1))?(null):(((clojure.nil_QMARK_(clojure.re
 //(defn list* "Creates a new list containing the item prepended to more." [item & more] (spread (cons item more)))
 //---
 (function __clojure_fn_3067(){
-return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variatic(function __clojure_fn_3067_list_STAR_3069(item_1){
+return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variatic(1,(function __clojure_fn_3067_list_STAR_3069(item_1){
 var more_2,more_2=clojure.JS.rest_args(this,arguments,1);
-return (clojure.spread(clojure.cons(item_1,more_2)))})))})();
+return (clojure.spread(clojure.cons(item_1,more_2)))}))))})();
 
 //======
 //(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x))
@@ -323,7 +323,7 @@ return (((s_1)?((new clojure.lang.CachedSeq(s_1))):(null)))})))})();
 //(defn concat "Returns a lazy seq representing the concatenation of\tthe elements in the supplied colls." ([] nil) ([x] (seq x)) ([x y] (if (seq x) (lazy-cons (first x) (concat (rest x) y)) (seq y))) ([x y & zs] (let [cat (fn cat [xys zs] (if (seq xys) (lazy-cons (first xys) (cat (rest xys) zs)) (when zs (recur (first zs) (rest zs)))))] (cat (concat x y) zs))))
 //---
 (function __clojure_fn_3154(){
-return (clojure.JS.def(clojure,"concat",clojure.JS.variatic(function __clojure_fn_3154_concat_3156(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"concat",clojure.JS.variatic(2,(function __clojure_fn_3154_concat_3156(x_1,y_2){switch(arguments.length){
 case 2:return (((clojure.seq(x_1))?((new clojure.lang.LazyCons((function __clojure_fn_3154_concat_3156_fn_3161(G__3160_1){switch(arguments.length){
 case 0:return (clojure.first(x_1))}
 return (clojure.concat(clojure.rest(x_1),y_2))})))):(clojure.seq(y_2))))
@@ -336,28 +336,28 @@ do{_cnt=0;_rtn=((clojure.seq(xys_1))?((new clojure.lang.LazyCons((function __clo
 case 0:return (clojure.first(xys_1))}
 return (cat_0(clojure.rest(xys_1),zs_2))})))):(((zs_2)?((_cnt=1,_t0=clojure.first(zs_2),_t1=clojure.rest(zs_2),xys_1=_t0,zs_2=_t1)):(null))))
 }while(_cnt);return _rtn;})),
-cat_4(clojure.concat(x_1,y_2),zs_3)))})))})();
+cat_4(clojure.concat(x_1,y_2),zs_3)))}))))})();
 
 //======
 //(defn = "Equality. Returns true if x equals y, false if not. Same as\n  Java x.equals(y) except it also works for nil, and compares\n  numbers in a type-independent manner.  Clojure's immutable data\n  structures define equals() (and thus =) as a value, not an identity,\n  comparison." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Util)) (clojure/list (quote clojure/equal)) (clojure/list x) (clojure/list y))), :inline-arities #{2}, :tag Boolean} ([x] true) ([x y] (. clojure.lang.Util (equal x y))) ([x y & more] (if (= x y) (if (rest more) (recur y (first more) (rest more)) (= y (first more))) false)))
 //---
 (function __clojure_fn_3186(){
-return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variatic(function __clojure_fn_3186_EQ_3191(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variatic(2,(function __clojure_fn_3186_EQ_3191(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Util.equal(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Util.equal(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Util.equal(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn not= "Same as (not (= obj1 obj2))" {:tag Boolean} ([x] false) ([x y] (not (= x y))) ([x y & more] (not (apply = x y more))))
 //---
 (function __clojure_fn_3205(){
-return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variatic(function __clojure_fn_3205_not_EQ_3207(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variatic(2,(function __clojure_fn_3205_not_EQ_3207(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.not(clojure.lang.Util.equal(x_1,y_2)))
 case 1:return (false)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.not(clojure.apply(clojure._EQ_,x_1,y_2,more_3)))})))})();
+return (clojure.not(clojure.apply(clojure._EQ_,x_1,y_2,more_3)))}))))})();
 
 //======
 //(defn compare "Comparator. Returns 0 if x equals y, -1 if x is logically 'less\n  than' y, else 1. Same as Java x.compareTo(y) except it also works\n  for nil, and compares numbers in a type-independent manner. x must\n  implement Comparable" {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Util)) (clojure/list (quote clojure/compare)) (clojure/list x) (clojure/list y))), :tag Integer} [x y] (. clojure.lang.Util (compare x y)))
@@ -392,118 +392,118 @@ return (clojure.reduce(clojure.conj,null,coll_1))})))})();
 //(defn + "Returns the sum of nums. (+) returns 0." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/add)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 0) ([x] (cast Number x)) ([x y] (. clojure.lang.Numbers (add x y))) ([x y & more] (reduce + (+ x y) more)))
 //---
 (function __clojure_fn_3293(){
-return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variatic(function __clojure_fn_3293_PLUS_3298(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variatic(2,(function __clojure_fn_3293_PLUS_3298(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.add(x_1,y_2))
 case 1:return (clojure.cast(java.lang.Number,x_1))
 case 0:return (0)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure._PLUS_,clojure.lang.Numbers.add(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure._PLUS_,clojure.lang.Numbers.add(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn * "Returns the product of nums. (*) returns 1." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/multiply)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 1) ([x] (cast Number x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more)))
 //---
 (function __clojure_fn_3317(){
-return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variatic(function __clojure_fn_3317_STAR_3322(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variatic(2,(function __clojure_fn_3317_STAR_3322(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))
 case 1:return (clojure.cast(java.lang.Number,x_1))
 case 0:return (1)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure._STAR_,clojure.lang.Numbers.multiply(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure._STAR_,clojure.lang.Numbers.multiply(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn / "If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/divide)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] (/ 1 x)) ([x y] (. clojure.lang.Numbers (divide x y))) ([x y & more] (reduce / (/ x y) more)))
 //---
 (function __clojure_fn_3340(){
-return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variatic(function __clojure_fn_3340_SLASH_3345(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variatic(2,(function __clojure_fn_3340_SLASH_3345(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.divide(x_1,y_2))
 case 1:return (clojure.lang.Numbers.divide(1,x_1))}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure._SLASH_,clojure.lang.Numbers.divide(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure._SLASH_,clojure.lang.Numbers.divide(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn - "If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result." {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/minus)) args)))), :inline-arities #{1 2}} ([x] (. clojure.lang.Numbers (minus x))) ([x y] (. clojure.lang.Numbers (minus x y))) ([x y & more] (reduce - (- x y) more)))
 //---
 (function __clojure_fn_3362(){
-return (clojure.JS.def(clojure,"_",clojure.JS.variatic(function __clojure_fn_3362_3367(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_",clojure.JS.variatic(2,(function __clojure_fn_3362_3367(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.minus(x_1,y_2))
 case 1:return (clojure.lang.Numbers.minus(x_1))}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure._,clojure.lang.Numbers.minus(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure._,clojure.lang.Numbers.minus(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn < "Returns non-nil if nums are in monotonically increasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/lt)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lt x y))) ([x y & more] (if (< x y) (if (rest more) (recur y (first more) (rest more)) (< y (first more))) false)))
 //---
 (function __clojure_fn_3384(){
-return (clojure.JS.def(clojure,"_LT_",clojure.JS.variatic(function __clojure_fn_3384_LT_3389(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_LT_",clojure.JS.variatic(2,(function __clojure_fn_3384_LT_3389(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.lt(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Numbers.lt(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn <= "Returns non-nil if nums are in monotonically non-decreasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/lte)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lte x y))) ([x y & more] (if (<= x y) (if (rest more) (recur y (first more) (rest more)) (<= y (first more))) false)))
 //---
 (function __clojure_fn_3406(){
-return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variatic(function __clojure_fn_3406_LT_EQ_3411(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3406_LT_EQ_3411(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.lte(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Numbers.lte(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn > "Returns non-nil if nums are in monotonically decreasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/gt)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gt x y))) ([x y & more] (if (> x y) (if (rest more) (recur y (first more) (rest more)) (> y (first more))) false)))
 //---
 (function __clojure_fn_3428(){
-return (clojure.JS.def(clojure,"_GT_",clojure.JS.variatic(function __clojure_fn_3428_GT_3433(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_GT_",clojure.JS.variatic(2,(function __clojure_fn_3428_GT_3433(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.gt(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Numbers.gt(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn >= "Returns non-nil if nums are in monotonically non-increasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/gte)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gte x y))) ([x y & more] (if (>= x y) (if (rest more) (recur y (first more) (rest more)) (>= y (first more))) false)))
 //---
 (function __clojure_fn_3450(){
-return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variatic(function __clojure_fn_3450_GT_EQ_3455(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3450_GT_EQ_3455(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.gte(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Numbers.gte(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn == "Returns non-nil if nums all have the same value, otherwise false" {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/equiv)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (equiv x y))) ([x y & more] (if (== x y) (if (rest more) (recur y (first more) (rest more)) (== y (first more))) false)))
 //---
 (function __clojure_fn_3472(){
-return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variatic(function __clojure_fn_3472_EQ_EQ_3477(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3472_EQ_EQ_3477(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.equiv(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.rest(more_3))?((_cnt=1,_t0=y_2,_t1=clojure.first(more_3),_t2=clojure.rest(more_3),x_1=_t0,y_2=_t1,more_3=_t2)):(clojure.lang.Numbers.equiv(y_2,clojure.first(more_3))))):(false))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn max "Returns the greatest of the nums." ([x] x) ([x y] (if (> x y) x y)) ([x y & more] (reduce max (max x y) more)))
 //---
 (function __clojure_fn_3491(){
-return (clojure.JS.def(clojure,"max",clojure.JS.variatic(function __clojure_fn_3491_max_3493(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"max",clojure.JS.variatic(2,(function __clojure_fn_3491_max_3493(x_1,y_2){switch(arguments.length){
 case 2:return (((clojure.lang.Numbers.gt(x_1,y_2))?(x_1):(y_2)))
 case 1:return (x_1)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure.max,clojure.max(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure.max,clojure.max(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn min "Returns the least of the nums." ([x] x) ([x y] (if (< x y) x y)) ([x y & more] (reduce min (min x y) more)))
 //---
 (function __clojure_fn_3507(){
-return (clojure.JS.def(clojure,"min",clojure.JS.variatic(function __clojure_fn_3507_min_3509(x_1,y_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"min",clojure.JS.variatic(2,(function __clojure_fn_3507_min_3509(x_1,y_2){switch(arguments.length){
 case 2:return (((clojure.lang.Numbers.lt(x_1,y_2))?(x_1):(y_2)))
 case 1:return (x_1)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
-return (clojure.reduce(clojure.min,clojure.min(x_1,y_2),more_3))})))})();
+return (clojure.reduce(clojure.min,clojure.min(x_1,y_2),more_3))}))))})();
 
 //======
 //(defn inc "Returns a number one greater than num." {:inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/inc)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (inc x)))
@@ -692,18 +692,18 @@ return (clojure.lang.Numbers.shiftRight(x_1,n_2))})))})();
 //---
 (function __clojure_fn_3908(){
 return (clojure.JS.def(clojure,"complement",(function __clojure_fn_3908_complement_3910(f_1){
-return (clojure.JS.variatic(function __clojure_fn_3908_complement_3910_fn_3912(){
+return (clojure.JS.variatic(0,(function __clojure_fn_3908_complement_3910_fn_3912(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.not(clojure.apply(f_1,args_1)))}))})))})();
+return (clojure.not(clojure.apply(f_1,args_1)))})))})))})();
 
 //======
 //(defn constantly "Returns a function that takes any number of arguments and returns x." [x] (fn [& args] x))
 //---
 (function __clojure_fn_3926(){
 return (clojure.JS.def(clojure,"constantly",(function __clojure_fn_3926_constantly_3928(x_1){
-return (clojure.JS.variatic(function __clojure_fn_3926_constantly_3928_fn_3930(){
+return (clojure.JS.variatic(0,(function __clojure_fn_3926_constantly_3928_fn_3930(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (x_1)}))})))})();
+return (x_1)})))})))})();
 
 //======
 //(defn identity "Returns its argument." [x] x)
@@ -753,32 +753,32 @@ return (clojure.lang.RT.get(map_1,key_2,not_found_3))})))})();
 //(defn dissoc "dissoc[iate]. Returns a new map of the same (hashed/sorted) type,\n  that does not contain a mapping for key(s)." ([map] map) ([map key] (. clojure.lang.RT (dissoc map key))) ([map key & ks] (let [ret (dissoc map key)] (if ks (recur ret (first ks) (rest ks)) ret))))
 //---
 (function __clojure_fn_4025(){
-return (clojure.JS.def(clojure,"dissoc",clojure.JS.variatic(function __clojure_fn_4025_dissoc_4027(map_1,key_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"dissoc",clojure.JS.variatic(2,(function __clojure_fn_4025_dissoc_4027(map_1,key_2){switch(arguments.length){
 case 2:return (clojure.lang.RT.dissoc(map_1,key_2))
 case 1:return (map_1)}
-var _cnt,_rtn,ret_4,ks_3,ks_3=clojure.JS.rest_args(this,arguments,2);
+var _cnt,_rtn,ks_3,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((ret_4=clojure.dissoc(map_1,key_2)),
 ((ks_3)?((_cnt=1,_t0=ret_4,_t1=clojure.first(ks_3),_t2=clojure.rest(ks_3),map_1=_t0,key_2=_t1,ks_3=_t2)):(ret_4)))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn disj "disj[oin]. Returns a new set of the same (hashed/sorted) type, that\n  does not contain key(s)." ([set] set) ([set key] (. set (disjoin key))) ([set key & ks] (let [ret (disj set key)] (if ks (recur ret (first ks) (rest ks)) ret))))
 //---
 (function __clojure_fn_4041(){
-return (clojure.JS.def(clojure,"disj",clojure.JS.variatic(function __clojure_fn_4041_disj_4043(set_1,key_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"disj",clojure.JS.variatic(2,(function __clojure_fn_4041_disj_4043(set_1,key_2){switch(arguments.length){
 case 2:return ((set_1).disjoin(key_2))
 case 1:return (set_1)}
 var _cnt,_rtn,ks_3,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2);
 do{_cnt=0;_rtn=((ret_4=clojure.disj(set_1,key_2)),
 ((ks_3)?((_cnt=1,_t0=ret_4,_t1=clojure.first(ks_3),_t2=clojure.rest(ks_3),set_1=_t0,key_2=_t1,ks_3=_t2)):(ret_4)))
-}while(_cnt);return _rtn;})))})();
+}while(_cnt);return _rtn;}))))})();
 
 //======
 //(defn select-keys "Returns a map containing only those entries in map whose key is in keys" [map keyseq] (loop [ret {} keys (seq keyseq)] (if keys (let [entry (. clojure.lang.RT (find map (first keys)))] (recur (if entry (conj ret entry) ret) (rest keys))) ret)))
 //---
 (function __clojure_fn_4061(){
 return (clojure.JS.def(clojure,"select_keys",(function __clojure_fn_4061_select_keys_4063(map_1,keyseq_2){
-var entry_5,ret_3,keys_4;
+var ret_3,entry_5,keys_4;
 return (((function __loop(){var _rtn,_cnt;(ret_3=clojure.lang.PersistentHashMap.EMPTY),
 (keys_4=clojure.seq(keyseq_2));do{_cnt=0;
 _rtn=((keys_4)?(((entry_5=clojure.lang.RT.find(map_1,clojure.first(keys_4))),
@@ -852,25 +852,25 @@ return ((new clojure.lang.Agent(state_1,validate_fn_2)))})))})();
 //(defn ! [& args] (throw (new Exception "! is now send. See also send-off")))
 //---
 (function __clojure_fn_4238(){
-return (clojure.JS.def(clojure,"_BANG_",clojure.JS.variatic(function __clojure_fn_4238_BANG_4240(){
+return (clojure.JS.def(clojure,"_BANG_",clojure.JS.variatic(0,(function __clojure_fn_4238_BANG_4240(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw (new java.lang.Exception("! is now send. See also send-off"))})())})))})();
+return ((function __throw(){throw (new java.lang.Exception("! is now send. See also send-off"))})())}))))})();
 
 //======
 //(defn send "Dispatch an action to an agent. Returns the agent immediately.\n  Subsequently, in a thread from a thread pool, the state of the agent\n  will be set to the value of:\n\n  (apply action-fn state-of-agent args)" [a f & args] (. a (dispatch f args false)))
 //---
 (function __clojure_fn_4250(){
-return (clojure.JS.def(clojure,"send",clojure.JS.variatic(function __clojure_fn_4250_send_4252(a_1,f_2){
+return (clojure.JS.def(clojure,"send",clojure.JS.variatic(2,(function __clojure_fn_4250_send_4252(a_1,f_2){
 var args_3,args_3=clojure.JS.rest_args(this,arguments,2);
-return ((a_1).dispatch(f_2,args_3,false))})))})();
+return ((a_1).dispatch(f_2,args_3,false))}))))})();
 
 //======
 //(defn send-off "Dispatch a potentially blocking action to an agent. Returns the\n  agent immediately. Subsequently, in a separate thread, the state of\n  the agent will be set to the value of:\n\n  (apply action-fn state-of-agent args)" [a f & args] (. a (dispatch f args true)))
 //---
 (function __clojure_fn_4262(){
-return (clojure.JS.def(clojure,"send_off",clojure.JS.variatic(function __clojure_fn_4262_send_off_4264(a_1,f_2){
+return (clojure.JS.def(clojure,"send_off",clojure.JS.variatic(2,(function __clojure_fn_4262_send_off_4264(a_1,f_2){
 var args_3,args_3=clojure.JS.rest_args(this,arguments,2);
-return ((a_1).dispatch(f_2,args_3,true))})))})();
+return ((a_1).dispatch(f_2,args_3,true))}))))})();
 
 //======
 //(defn agent-errors "Returns a sequence of the exceptions thrown during asynchronous\n  actions of the agent." [a] (. a (getErrors)))
@@ -926,17 +926,17 @@ return ((iref_1).getValidator())})))})();
 //(defn commute "Must be called in a transaction. Sets the in-transaction-value of\n  ref to:\n\n  (apply fun in-transaction-value-of-ref args)\n\n  and returns the in-transaction-value of ref.\n\n  At the commit point of the transaction, sets the value of ref to be:\n\n  (apply fun most-recently-committed-value-of-ref args)\n\n  Thus fun should be commutative, or, failing that, you must accept\n  last-one-in-wins behavior.  commute allows for more concurrency than\n  ref-set." [ref fun & args] (. ref (commute fun args)))
 //---
 (function __clojure_fn_4360(){
-return (clojure.JS.def(clojure,"commute",clojure.JS.variatic(function __clojure_fn_4360_commute_4362(ref_1,fun_2){
+return (clojure.JS.def(clojure,"commute",clojure.JS.variatic(2,(function __clojure_fn_4360_commute_4362(ref_1,fun_2){
 var args_3,args_3=clojure.JS.rest_args(this,arguments,2);
-return ((ref_1).commute(fun_2,args_3))})))})();
+return ((ref_1).commute(fun_2,args_3))}))))})();
 
 //======
 //(defn alter "Must be called in a transaction. Sets the in-transaction-value of\n  ref to:\n\n  (apply fun in-transaction-value-of-ref args)\n\n  and returns the in-transaction-value of ref." [ref fun & args] (. ref (alter fun args)))
 //---
 (function __clojure_fn_4372(){
-return (clojure.JS.def(clojure,"alter",clojure.JS.variatic(function __clojure_fn_4372_alter_4374(ref_1,fun_2){
+return (clojure.JS.def(clojure,"alter",clojure.JS.variatic(2,(function __clojure_fn_4372_alter_4374(ref_1,fun_2){
 var args_3,args_3=clojure.JS.rest_args(this,arguments,2);
-return ((ref_1).alter(fun_2,args_3))})))})();
+return ((ref_1).alter(fun_2,args_3))}))))})();
 
 //======
 //(defn ref-set "Must be called in a transaction. Sets the value of ref.\n  Returns val." [ref val] (. ref (set val)))
@@ -957,33 +957,33 @@ return ((ref_1).touch(),
 //(defn comp "Takes a set of functions and returns a fn that is the composition\n  of those fns.  The returned fn takes a variable number of args,\n  applies the rightmost of fns to the args, the next\n  fn (right-to-left) to the result, etc." [& fs] (let [fs (reverse fs)] (fn [& args] (loop [ret (apply (first fs) args) fs (rest fs)] (if fs (recur ((first fs) ret) (rest fs)) ret)))))
 //---
 (function __clojure_fn_4417(){
-return (clojure.JS.def(clojure,"comp",clojure.JS.variatic(function __clojure_fn_4417_comp_4419(){
+return (clojure.JS.def(clojure,"comp",clojure.JS.variatic(0,(function __clojure_fn_4417_comp_4419(){
 var fs_2,fs_1,fs_1=clojure.JS.rest_args(this,arguments,0);
 return (((fs_2=clojure.reverse(fs_1)),
-clojure.JS.variatic(function __clojure_fn_4417_comp_4419_fn_4421(){
-var args_1,fs_3,ret_2,args_1=clojure.JS.rest_args(this,arguments,0);
+clojure.JS.variatic(0,(function __clojure_fn_4417_comp_4419_fn_4421(){
+var fs_3,args_1,ret_2,args_1=clojure.JS.rest_args(this,arguments,0);
 return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.apply(clojure.first(fs_2),args_1)),
 (fs_3=clojure.rest(fs_2));do{_cnt=0;
-_rtn=((fs_3)?((_cnt=1,_t0=clojure.first(fs_3)(ret_2),_t1=clojure.rest(fs_3),ret_2=_t0,fs_3=_t1)):(ret_2))}while(_cnt);return _rtn;})()))})))})))})();
+_rtn=((fs_3)?((_cnt=1,_t0=clojure.first(fs_3)(ret_2),_t1=clojure.rest(fs_3),ret_2=_t0,fs_3=_t1)):(ret_2))}while(_cnt);return _rtn;})()))}))))}))))})();
 
 //======
 //(defn partial "Takes a function f and fewer than the normal arguments to f, and\n  returns a fn that takes a variable number of additional args. When\n  called, the returned function calls f with args + additional args." ([f arg1] (fn [& args] (apply f arg1 args))) ([f arg1 arg2] (fn [& args] (apply f arg1 arg2 args))) ([f arg1 arg2 arg3] (fn [& args] (apply f arg1 arg2 arg3 args))) ([f arg1 arg2 arg3 & more] (fn [& args] (apply f arg1 arg2 arg3 (concat more args)))))
 //---
 (function __clojure_fn_4447(){
-return (clojure.JS.def(clojure,"partial",clojure.JS.variatic(function __clojure_fn_4447_partial_4449(f_1,arg1_2,arg2_3,arg3_4){switch(arguments.length){
-case 4:return (clojure.JS.variatic(function __clojure_fn_4447_partial_4449_fn_4459(){
+return (clojure.JS.def(clojure,"partial",clojure.JS.variatic(4,(function __clojure_fn_4447_partial_4449(f_1,arg1_2,arg2_3,arg3_4){switch(arguments.length){
+case 4:return (clojure.JS.variatic(0,(function __clojure_fn_4447_partial_4449_fn_4459(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply(f_1,arg1_2,arg2_3,arg3_4,args_1))}))
-case 3:return (clojure.JS.variatic(function __clojure_fn_4447_partial_4449_fn_4455(){
+return (clojure.apply(f_1,arg1_2,arg2_3,arg3_4,args_1))})))
+case 3:return (clojure.JS.variatic(0,(function __clojure_fn_4447_partial_4449_fn_4455(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply(f_1,arg1_2,arg2_3,args_1))}))
-case 2:return (clojure.JS.variatic(function __clojure_fn_4447_partial_4449_fn_4451(){
+return (clojure.apply(f_1,arg1_2,arg2_3,args_1))})))
+case 2:return (clojure.JS.variatic(0,(function __clojure_fn_4447_partial_4449_fn_4451(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply(f_1,arg1_2,args_1))}))}
+return (clojure.apply(f_1,arg1_2,args_1))})))}
 var more_5,more_5=clojure.JS.rest_args(this,arguments,4);
-return (clojure.JS.variatic(function __clojure_fn_4447_partial_4449_fn_4463(){
+return (clojure.JS.variatic(0,(function __clojure_fn_4447_partial_4449_fn_4463(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply(f_1,arg1_2,arg2_3,arg3_4,clojure.concat(more_5,args_1)))}))})))})();
+return (clojure.apply(f_1,arg1_2,arg2_3,arg3_4,clojure.concat(more_5,args_1)))})))}))))})();
 
 //======
 //(defn every? "Returns true if (pred x) is logical true for every x in coll, else\n  false." {:tag Boolean} [pred coll] (if (seq coll) (and (pred (first coll)) (recur pred (rest coll))) true))
@@ -1021,7 +1021,7 @@ return (clojure.JS.def(clojure,"not_any_QMARK_",clojure.comp(clojure.not,clojure
 //(defn map "Returns a lazy seq consisting of the result of applying f to the\n  set of first items of each coll, followed by applying f to the set\n  of second items in each coll, until any one of the colls is\n  exhausted.  Any remaining items in other colls are ignored. Function\n  f should accept number-of-colls arguments." ([f coll] (when (seq coll) (lazy-cons (f (first coll)) (map f (rest coll))))) ([f coll & colls] (when (and (seq coll) (every? seq colls)) (lazy-cons (apply f (first coll) (map first colls)) (apply map f (rest coll) (map rest colls))))))
 //---
 (function __clojure_fn_4521(){
-return (clojure.JS.def(clojure,"map",clojure.JS.variatic(function __clojure_fn_4521_map_4523(f_1,coll_2){switch(arguments.length){
+return (clojure.JS.def(clojure,"map",clojure.JS.variatic(2,(function __clojure_fn_4521_map_4523(f_1,coll_2){switch(arguments.length){
 case 2:return (((clojure.seq(coll_2))?((new clojure.lang.LazyCons((function __clojure_fn_4521_map_4523_fn_4526(G__4525_1){switch(arguments.length){
 case 0:return (f_1(clojure.first(coll_2)))}
 return (clojure.map(f_1,clojure.rest(coll_2)))})))):(null)))}
@@ -1029,15 +1029,15 @@ var and__196_4,colls_3,colls_3=clojure.JS.rest_args(this,arguments,2);
 return (((((and__196_4=clojure.seq(coll_2)),
 ((and__196_4)?(clojure.every_QMARK_(clojure.seq,colls_3)):(and__196_4))))?((new clojure.lang.LazyCons((function __clojure_fn_4521_map_4523_fn_4532(G__4531_1){switch(arguments.length){
 case 0:return (clojure.apply(f_1,clojure.first(coll_2),clojure.map(clojure.first,colls_3)))}
-return (clojure.apply(clojure.map,f_1,clojure.rest(coll_2),clojure.map(clojure.rest,colls_3)))})))):(null)))})))})();
+return (clojure.apply(clojure.map,f_1,clojure.rest(coll_2),clojure.map(clojure.rest,colls_3)))})))):(null)))}))))})();
 
 //======
 //(defn mapcat "Returns the result of applying concat to the result of applying map\n  to f and colls.  Thus function f should return a collection." [f & colls] (apply concat (apply map f colls)))
 //---
 (function __clojure_fn_4544(){
-return (clojure.JS.def(clojure,"mapcat",clojure.JS.variatic(function __clojure_fn_4544_mapcat_4546(f_1){
+return (clojure.JS.def(clojure,"mapcat",clojure.JS.variatic(1,(function __clojure_fn_4544_mapcat_4546(f_1){
 var colls_2,colls_2=clojure.JS.rest_args(this,arguments,1);
-return (clojure.apply(clojure.concat,clojure.apply(clojure.map,f_1,colls_2)))})))})();
+return (clojure.apply(clojure.concat,clojure.apply(clojure.map,f_1,colls_2)))}))))})();
 
 //======
 //(defn filter "Returns a lazy seq of the items in coll for which\n  (pred item) returns true. pred must be free of side-effects." [pred coll] (when (seq coll) (if (pred (first coll)) (lazy-cons (first coll) (filter pred (rest coll))) (recur pred (rest coll)))))
@@ -1172,15 +1172,15 @@ return (clojure.take_while(clojure.partial(((clojure.lang.Numbers.isPos(step_3))
 //(defn merge "Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping from\n  the latter (left-to-right) will be the mapping in the result." [& maps] (reduce conj maps))
 //---
 (function __clojure_fn_4788(){
-return (clojure.JS.def(clojure,"merge",clojure.JS.variatic(function __clojure_fn_4788_merge_4790(){
+return (clojure.JS.def(clojure,"merge",clojure.JS.variatic(0,(function __clojure_fn_4788_merge_4790(){
 var maps_1,maps_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.reduce(clojure.conj,maps_1))})))})();
+return (clojure.reduce(clojure.conj,maps_1))}))))})();
 
 //======
 //(defn merge-with "Returns a map that consists of the rest of the maps conj-ed onto\n  the first.  If a key occurs in more than one map, the mapping(s)\n  from the latter (left-to-right) will be combined with the mapping in\n  the result by calling (f val-in-result val-in-latter)." [f & maps] (let [merge-entry (fn [m e] (let [k (key e) v (val e)] (if (contains? m k) (assoc m k (f (m k) v)) (assoc m k v)))) merge2 (fn [m1 m2] (reduce merge-entry m1 (seq m2)))] (reduce merge2 maps)))
 //---
 (function __clojure_fn_4806(){
-return (clojure.JS.def(clojure,"merge_with",clojure.JS.variatic(function __clojure_fn_4806_merge_with_4808(f_1){
+return (clojure.JS.def(clojure,"merge_with",clojure.JS.variatic(1,(function __clojure_fn_4806_merge_with_4808(f_1){
 var merge2_4,merge_entry_3,maps_2,maps_2=clojure.JS.rest_args(this,arguments,1);
 return (((merge_entry_3=(function __clojure_fn_4806_merge_with_4808_merge_entry_4810(m_1,e_2){
 var k_3,v_4;
@@ -1189,14 +1189,14 @@ return (((k_3=clojure.key(e_2)),
 ((clojure.contains_QMARK_(m_1,k_3))?(clojure.assoc(m_1,k_3,f_1(m_1(k_3),v_4))):(clojure.assoc(m_1,k_3,v_4)))))})),
 (merge2_4=(function __clojure_fn_4806_merge_with_4808_merge2_4813(m1_1,m2_2){
 return (clojure.reduce(merge_entry_3,m1_1,clojure.seq(m2_2)))})),
-clojure.reduce(merge2_4,maps_2)))})))})();
+clojure.reduce(merge2_4,maps_2)))}))))})();
 
 //======
 //(defn zipmap "Returns a map with the keys mapped to the corresponding vals." [keys vals] (loop [map {} ks (seq keys) vs (seq vals)] (if (and ks vs) (recur (assoc map (first ks) (first vs)) (rest ks) (rest vs)) map)))
 //---
 (function __clojure_fn_4824(){
 return (clojure.JS.def(clojure,"zipmap",(function __clojure_fn_4824_zipmap_4826(keys_1,vals_2){
-var and__196_6,ks_4,map_3,vs_5;
+var and__196_6,ks_4,vs_5,map_3;
 return (((function __loop(){var _rtn,_cnt;(map_3=clojure.lang.PersistentHashMap.EMPTY),
 (ks_4=clojure.seq(keys_1)),
 (vs_5=clojure.seq(vals_2));do{_cnt=0;
@@ -1256,17 +1256,17 @@ return (clojure.lang.Compiler.eval(form_1))})))})();
 //(defn scan [& args] (throw (new Exception "scan is now called dorun")))
 //---
 (function __clojure_fn_4929(){
-return (clojure.JS.def(clojure,"scan",clojure.JS.variatic(function __clojure_fn_4929_scan_4931(){
+return (clojure.JS.def(clojure,"scan",clojure.JS.variatic(0,(function __clojure_fn_4929_scan_4931(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw (new java.lang.Exception("scan is now called dorun"))})())})))})();
+return ((function __throw(){throw (new java.lang.Exception("scan is now called dorun"))})())}))))})();
 
 //======
 //(defn touch [& args] (throw (new Exception "touch is now called doall")))
 //---
 (function __clojure_fn_4941(){
-return (clojure.JS.def(clojure,"touch",clojure.JS.variatic(function __clojure_fn_4941_touch_4943(){
+return (clojure.JS.def(clojure,"touch",clojure.JS.variatic(0,(function __clojure_fn_4941_touch_4943(){
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw (new java.lang.Exception("touch is now called doall"))})())})))})();
+return ((function __throw(){throw (new java.lang.Exception("touch is now called doall"))})())}))))})();
 
 //======
 //(defn dorun "When lazy sequences are produced via functions that have side\n  effects, any effects other than those needed to produce the first\n  element in the seq do not occur until the seq is consumed. dorun can\n  be used to force any effects. Walks through the successive rests of\n  the seq, does not retain the head and returns nil." ([coll] (when (and (seq coll) (or (first coll) true)) (recur (rest coll)))) ([n coll] (when (and (seq coll) (pos? n) (or (first coll) true)) (recur (dec n) (rest coll)))))
@@ -1300,8 +1300,8 @@ coll_2)})))})();
 //(defn await "Blocks the current thread (indefinitely!) until all actions\n  dispatched thus far, from this thread or agent, to the agent(s) have\n  occurred." [& agents] (when *agent* (throw (new Exception "Can't await in agent action"))) (let [latch (new java.util.concurrent.CountDownLatch (count agents)) count-down (fn [agent] (. latch (countDown)) agent)] (doseq agent agents (send agent count-down)) (. latch (await))))
 //---
 (function __clojure_fn_4984(){
-return (clojure.JS.def(clojure,"await",clojure.JS.variatic(function __clojure_fn_4984_await_4986(){
-var count_down_3,agents_1,latch_2,list__739_4,agent_5,agents_1=clojure.JS.rest_args(this,arguments,0);
+return (clojure.JS.def(clojure,"await",clojure.JS.variatic(0,(function __clojure_fn_4984_await_4986(){
+var list__739_4,latch_2,agent_5,agents_1,count_down_3,agents_1=clojure.JS.rest_args(this,arguments,0);
 return (((clojure._STAR_agent_STAR_)?((function __throw(){throw (new java.lang.Exception("Can't await in agent action"))})()):(null)),
 ((latch_2=(new java.util.concurrent.CountDownLatch(clojure.count(agents_1)))),
 (count_down_3=(function __clojure_fn_4984_await_4986_count_down_4988(agent_1){
@@ -1311,7 +1311,7 @@ agent_1)})),
 _rtn=((list__739_4)?(((agent_5=clojure.first(list__739_4)),
 clojure.send(agent_5,count_down_3)),
 (_cnt=1,_t0=clojure.rest(list__739_4),list__739_4=_t0)):(null))}whi