diff options
| -rw-r--r-- | clojurescript/boot.js | 2916 | ||||
| -rw-r--r-- | clojurescript/clj.js | 893 | ||||
| -rw-r--r-- | clojurescript/hashtopology.js | 28 | ||||
| -rw-r--r-- | clojurescript/tojs.clj | 34 |
4 files changed, 2456 insertions, 1415 deletions
diff --git a/clojurescript/boot.js b/clojurescript/boot.js index b1c87679..4d673c87 100644 --- a/clojurescript/boot.js +++ b/clojurescript/boot.js @@ -3,13 +3,13 @@ //(in-ns (quote clojure)) //--- (function __tmp_fn_2662(){ -return (clojure.in_ns("'clojure"))})(); +return (clojure.in_ns.apply(null,["'clojure"]))}).apply(null,[]); //====== //(def list (. clojure.lang.PersistentList creator)) //--- (function __clojure_fn_2671(){ -return (clojure.JS.def(clojure,"list",clojure.lang.PersistentList.creator))})(); +return (clojure.JS.def(clojure,"list",clojure.lang.PersistentList.creator))}).apply(null,[]); //====== //(def cons (fn* cons [x seq] (. clojure.lang.RT (cons x seq)))) @@ -17,18 +17,18 @@ return (clojure.JS.def(clojure,"list",clojure.lang.PersistentList.creator))})(); (function __clojure_fn_2679(){ return (clojure.JS.def(clojure,"cons",(function __clojure_fn_2679_cons_2681(x_1,seq_2){ var cons_0=arguments.callee; -return (clojure.lang.RT.cons(x_1,seq_2))})))})(); +return (clojure.lang.RT.cons(x_1,seq_2))})))}).apply(null,[]); //====== //(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_2714(){ -return (clojure.JS.def(clojure,"conj",clojure.JS.variatic(2,(function __clojure_fn_2714_conj_2716(coll_1,x_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"conj",clojure.JS.variadic(2,(function __clojure_fn_2714_conj_2716(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,_rtn=[conj_0(coll_1,x_2),clojure.first(xs_3),clojure.rest(xs_3)],coll_1=_rtn[0],x_2=_rtn[1],xs_3=_rtn[2])):(conj_0(coll_1,x_2))) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_rtn=[conj_0.apply(null,[coll_1,x_2]),clojure.first.apply(null,[xs_3]),clojure.rest.apply(null,[xs_3])],coll_1=_rtn[0],x_2=_rtn[1],xs_3=_rtn[2])):(conj_0.apply(null,[coll_1,x_2]))) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(def second (fn second [x] (first (rest x)))) @@ -36,7 +36,7 @@ do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_rtn=[conj_0(coll_1,x_2),clojure.first(xs_3),clo (function __clojure_fn_2724(){ return (clojure.JS.def(clojure,"second",(function __clojure_fn_2724_second_2726(x_1){ var second_0=arguments.callee; -return (clojure.first(clojure.rest(x_1)))})))})(); +return (clojure.first.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]); //====== //(def ffirst (fn ffirst [x] (first (first x)))) @@ -44,7 +44,7 @@ return (clojure.first(clojure.rest(x_1)))})))})(); (function __clojure_fn_2734(){ return (clojure.JS.def(clojure,"ffirst",(function __clojure_fn_2734_ffirst_2736(x_1){ var ffirst_0=arguments.callee; -return (clojure.first(clojure.first(x_1)))})))})(); +return (clojure.first.apply(null,[clojure.first.apply(null,[x_1])]))})))}).apply(null,[]); //====== //(def rfirst (fn rfirst [x] (rest (first x)))) @@ -52,7 +52,7 @@ return (clojure.first(clojure.first(x_1)))})))})(); (function __clojure_fn_2744(){ return (clojure.JS.def(clojure,"rfirst",(function __clojure_fn_2744_rfirst_2746(x_1){ var rfirst_0=arguments.callee; -return (clojure.rest(clojure.first(x_1)))})))})(); +return (clojure.rest.apply(null,[clojure.first.apply(null,[x_1])]))})))}).apply(null,[]); //====== //(def frest (fn frest [x] (first (rest x)))) @@ -60,7 +60,7 @@ return (clojure.rest(clojure.first(x_1)))})))})(); (function __clojure_fn_2754(){ return (clojure.JS.def(clojure,"frest",(function __clojure_fn_2754_frest_2756(x_1){ var frest_0=arguments.callee; -return (clojure.first(clojure.rest(x_1)))})))})(); +return (clojure.first.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]); //====== //(def rrest (fn rrest [x] (rest (rest x)))) @@ -68,7 +68,7 @@ return (clojure.first(clojure.rest(x_1)))})))})(); (function __clojure_fn_2764(){ return (clojure.JS.def(clojure,"rrest",(function __clojure_fn_2764_rrest_2766(x_1){ var rrest_0=arguments.callee; -return (clojure.rest(clojure.rest(x_1)))})))})(); +return (clojure.rest.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]); //====== //(def seq? (fn seq? [x] (instance? clojure.lang.ISeq x))) @@ -76,7 +76,7 @@ return (clojure.rest(clojure.rest(x_1)))})))})(); (function __clojure_fn_2784(){ return (clojure.JS.def(clojure,"seq_QMARK_",(function __clojure_fn_2784_seq_QMARK_2786(x_1){ var seq_QMARK__0=arguments.callee; -return (clojure.instance_QMARK_(clojure.lang.ISeq,x_1))})))})(); +return (clojure.instance_QMARK_.apply(null,[clojure.lang.ISeq,x_1]))})))}).apply(null,[]); //====== //(def string? (fn string? [x] (instance? String x))) @@ -84,7 +84,7 @@ return (clojure.instance_QMARK_(clojure.lang.ISeq,x_1))})))})(); (function __clojure_fn_2794(){ return (clojure.JS.def(clojure,"string_QMARK_",(function __clojure_fn_2794_string_QMARK_2796(x_1){ var string_QMARK__0=arguments.callee; -return (clojure.instance_QMARK_(java.lang.String,x_1))})))})(); +return (clojure.instance_QMARK_.apply(null,[java.lang.String,x_1]))})))}).apply(null,[]); //====== //(def map? (fn map? [x] (instance? clojure.lang.IPersistentMap x))) @@ -92,7 +92,7 @@ return (clojure.instance_QMARK_(java.lang.String,x_1))})))})(); (function __clojure_fn_2804(){ return (clojure.JS.def(clojure,"map_QMARK_",(function __clojure_fn_2804_map_QMARK_2806(x_1){ var map_QMARK__0=arguments.callee; -return (clojure.instance_QMARK_(clojure.lang.IPersistentMap,x_1))})))})(); +return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentMap,x_1]))})))}).apply(null,[]); //====== //(def vector? (fn vector? [x] (instance? clojure.lang.IPersistentVector x))) @@ -100,17 +100,17 @@ return (clojure.instance_QMARK_(clojure.lang.IPersistentMap,x_1))})))})(); (function __clojure_fn_2814(){ return (clojure.JS.def(clojure,"vector_QMARK_",(function __clojure_fn_2814_vector_QMARK_2816(x_1){ var vector_QMARK__0=arguments.callee; -return (clojure.instance_QMARK_(clojure.lang.IPersistentVector,x_1))})))})(); +return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentVector,x_1]))})))}).apply(null,[]); //====== //(def sigs (fn [fdecl] (if (seq? (first fdecl)) (loop [ret [] fdecl fdecl] (if fdecl (recur (conj ret (first (first fdecl))) (rest fdecl)) (seq ret))) (list (first fdecl))))) //--- (function __clojure_fn_2825(){ return (clojure.JS.def(clojure,"sigs",(function __clojure_fn_2825_sigs_2827(fdecl_1){ -var fdecl_3,ret_2; -return (((clojure.seq_QMARK_(clojure.first(fdecl_1)))?(((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY), +var ret_2,fdecl_3; +return (((clojure.seq_QMARK_.apply(null,[clojure.first.apply(null,[fdecl_1])]))?(((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY), (fdecl_3=fdecl_1);do{_cnt=0; -_rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.conj(ret_2,clojure.first(clojure.first(fdecl_3))),clojure.rest(fdecl_3)],ret_2=_rtn[0],fdecl_3=_rtn[1])):(clojure.seq(ret_2)))}while(_cnt);return _rtn;})())):(clojure.list(clojure.first(fdecl_1)))))})))})(); +_rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.conj.apply(null,[ret_2,clojure.first.apply(null,[clojure.first.apply(null,[fdecl_3])])]),clojure.rest.apply(null,[fdecl_3])],ret_2=_rtn[0],fdecl_3=_rtn[1])):(clojure.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})())):(clojure.list.apply(null,[clojure.first.apply(null,[fdecl_1])]))))})))}).apply(null,[]); //====== //(def meta (fn meta [x] (if (instance? clojure.lang.IObj x) (. x (meta))))) @@ -118,7 +118,7 @@ _rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.conj(ret_2,clojure.first(clojure.first(fd (function __clojure_fn_2841(){ return (clojure.JS.def(clojure,"meta",(function __clojure_fn_2841_meta_2843(x_1){ var meta_0=arguments.callee; -return (((clojure.instance_QMARK_(clojure.lang.IObj,x_1))?((x_1).meta()):(null)))})))})(); +return (((clojure.instance_QMARK_.apply(null,[clojure.lang.IObj,x_1]))?((x_1).meta()):(null)))})))}).apply(null,[]); //====== //(def with-meta (fn with-meta [x m] (. x (withMeta m)))) @@ -126,7 +126,7 @@ return (((clojure.instance_QMARK_(clojure.lang.IObj,x_1))?((x_1).meta()):(null)) (function __clojure_fn_2851(){ return (clojure.JS.def(clojure,"with_meta",(function __clojure_fn_2851_with_meta_2853(x_1,m_2){ var with_meta_0=arguments.callee; -return ((x_1).withMeta(m_2))})))})(); +return ((x_1).withMeta(m_2))})))}).apply(null,[]); //====== //(def last (fn last [s] (if (rest s) (recur (rest s)) (first s)))) @@ -134,121 +134,121 @@ return ((x_1).withMeta(m_2))})))})(); (function __clojure_fn_2861(){ return (clojure.JS.def(clojure,"last",(function __clojure_fn_2861_last_2863(s_1){ var _cnt,_rtn,last_0=arguments.callee; -do{_cnt=0;_rtn=((clojure.rest(s_1))?((_cnt=1,_rtn=[clojure.rest(s_1)],s_1=_rtn[0])):(clojure.first(s_1))) -}while(_cnt);return _rtn;})))})(); +do{_cnt=0;_rtn=((clojure.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.rest.apply(null,[s_1])],s_1=_rtn[0])):(clojure.first.apply(null,[s_1]))) +}while(_cnt);return _rtn;})))}).apply(null,[]); //====== //(def butlast (fn butlast [s] (loop [ret [] s s] (if (rest s) (recur (conj ret (first s)) (rest s)) (seq ret))))) //--- (function __clojure_fn_2871(){ return (clojure.JS.def(clojure,"butlast",(function __clojure_fn_2871_butlast_2873(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,_rtn=[clojure.conj(ret_2,clojure.first(s_3)),clojure.rest(s_3)],ret_2=_rtn[0],s_3=_rtn[1])):(clojure.seq(ret_2)))}while(_cnt);return _rtn;})()))})))})(); +_rtn=((clojure.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.conj.apply(null,[ret_2,clojure.first.apply(null,[s_3])]),clojure.rest.apply(null,[s_3])],ret_2=_rtn[0],s_3=_rtn[1])):(clojure.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})()))})))}).apply(null,[]); //====== //(defn cast "Throws a ClassCastException if x is not a c, else returns x." [c x] (. c (cast x))) //--- (function __clojure_fn_2890(){ return (clojure.JS.def(clojure,"cast",(function __clojure_fn_2890_cast_2892(c_1,x_2){ -return ((c_1).cast(x_2))})))})(); +return ((c_1).cast(x_2))})))}).apply(null,[]); //====== //(defn to-array "Returns an array of Objects containing the contents of coll, which\n can be any Collection. Maps to java.util.Collection.toArray()." [coll] (. clojure.lang.RT (toArray coll))) //--- (function __clojure_fn_2902(){ return (clojure.JS.def(clojure,"to_array",(function __clojure_fn_2902_to_array_2904(coll_1){ -return (clojure.lang.RT.toArray(coll_1))})))})(); +return (clojure.lang.RT.toArray(coll_1))})))}).apply(null,[]); //====== //(defn vector "Creates a new vector containing the args." ([] []) ([& args] (. clojure.lang.LazilyPersistentVector (create args)))) //--- (function __clojure_fn_2915(){ -return (clojure.JS.def(clojure,"vector",clojure.JS.variatic(0,(function __clojure_fn_2915_vector_2917(){switch(arguments.length){ +return (clojure.JS.def(clojure,"vector",clojure.JS.variadic(0,(function __clojure_fn_2915_vector_2917(){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))}))))}).apply(null,[]); //====== //(defn vec "Creates a new vector containing the contents of coll." ([coll] (. clojure.lang.LazilyPersistentVector (createOwning (to-array coll))))) //--- (function __clojure_fn_2928(){ return (clojure.JS.def(clojure,"vec",(function __clojure_fn_2928_vec_2930(coll_1){ -return (clojure.lang.LazilyPersistentVector.createOwning(clojure.to_array(coll_1)))})))})(); +return (clojure.lang.LazilyPersistentVector.createOwning(clojure.to_array.apply(null,[coll_1])))})))}).apply(null,[]); //====== //(defn hash-set "Returns a new hash set with supplied keys." ([] #{}) ([& keys] (. clojure.lang.PersistentHashSet (create keys)))) //--- (function __clojure_fn_2948(){ -return (clojure.JS.def(clojure,"hash_set",clojure.JS.variatic(0,(function __clojure_fn_2948_hash_set_2950(){switch(arguments.length){ +return (clojure.JS.def(clojure,"hash_set",clojure.JS.variadic(0,(function __clojure_fn_2948_hash_set_2950(){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))}))))}).apply(null,[]); //====== //(defn sorted-map "keyval => key val\n Returns a new sorted map with supplied mappings." ([& keyvals] (. clojure.lang.PersistentTreeMap (create keyvals)))) //--- (function __clojure_fn_2961(){ -return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variatic(0,(function __clojure_fn_2961_sorted_map_2963(){ +return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variadic(0,(function __clojure_fn_2961_sorted_map_2963(){ 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))}))))}).apply(null,[]); //====== //(defn sorted-set "Returns a new sorted set with supplied keys." ([& keys] (. clojure.lang.PersistentTreeSet (create keys)))) //--- (function __clojure_fn_2973(){ -return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variatic(0,(function __clojure_fn_2973_sorted_set_2975(){ +return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variadic(0,(function __clojure_fn_2973_sorted_set_2975(){ 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))}))))}).apply(null,[]); //====== //(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_2985(){ -return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variatic(1,(function __clojure_fn_2985_sorted_map_by_2987(comparator_1){ +return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_fn_2985_sorted_map_by_2987(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))}))))}).apply(null,[]); //====== //(defn nil? "Returns true if x is nil, false otherwise." {:tag Boolean} [x] (identical? x nil)) //--- (function __clojure_fn_3018(){ return (clojure.JS.def(clojure,"nil_QMARK_",(function __clojure_fn_3018_nil_QMARK_3020(x_1){ -return (clojure.identical_QMARK_(x_1,null))})))})(); +return (clojure.identical_QMARK_.apply(null,[x_1,null]))})))}).apply(null,[]); //====== //(defn false? "Returns true if x is the value false, false otherwise." {:tag Boolean} [x] (identical? x false)) //--- (function __clojure_fn_3030(){ return (clojure.JS.def(clojure,"false_QMARK_",(function __clojure_fn_3030_false_QMARK_3032(x_1){ -return (clojure.identical_QMARK_(x_1,false))})))})(); +return (clojure.identical_QMARK_.apply(null,[x_1,false]))})))}).apply(null,[]); //====== //(defn true? "Returns true if x is the value true, false otherwise." {:tag Boolean} [x] (identical? x true)) //--- (function __clojure_fn_3042(){ return (clojure.JS.def(clojure,"true_QMARK_",(function __clojure_fn_3042_true_QMARK_3044(x_1){ -return (clojure.identical_QMARK_(x_1,true))})))})(); +return (clojure.identical_QMARK_.apply(null,[x_1,true]))})))}).apply(null,[]); //====== //(defn not "Returns true if x is logical false, false otherwise." {:tag Boolean} [x] (if x false true)) //--- (function __clojure_fn_3054(){ return (clojure.JS.def(clojure,"not",(function __clojure_fn_3054_not_3056(x_1){ -return (((x_1)?(false):(true)))})))})(); +return (((x_1)?(false):(true)))})))}).apply(null,[]); //====== //(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_3068(){ -return (clojure.JS.def(clojure,"str",clojure.JS.variatic(1,(function __clojure_fn_3068_str_3070(x_1){switch(arguments.length){ -case 1:return (((clojure.nil_QMARK_(x_1))?(""):((x_1).toString()))) +return (clojure.JS.def(clojure,"str",clojure.JS.variadic(1,(function __clojure_fn_3068_str_3070(x_1){switch(arguments.length){ +case 1:return (((clojure.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString()))) case 0:return ("")} -var ys_2,more_4,sb_3,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)))), +var more_4,ys_2,sb_3,ys_2=clojure.JS.rest_args(this,arguments,1); +return (((function __loop(){var _rtn,_cnt;(sb_3=(new java.lang.StringBuilder(clojure.str.apply(null,[x_1])))), (more_4=ys_2);do{_cnt=0; -_rtn=((more_4)?((_cnt=1,_rtn=[(sb_3).append(clojure.str(clojure.first(more_4))),clojure.rest(more_4)],sb_3=_rtn[0],more_4=_rtn[1])):(clojure.str(sb_3)))}while(_cnt);return _rtn;})()))}))))})(); +_rtn=((more_4)?((_cnt=1,_rtn=[(sb_3).append(clojure.str.apply(null,[clojure.first.apply(null,[more_4])])),clojure.rest.apply(null,[more_4])],sb_3=_rtn[0],more_4=_rtn[1])):(clojure.str.apply(null,[sb_3])))}while(_cnt);return _rtn;})()))}))))}).apply(null,[]); //====== //(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)))) @@ -257,7 +257,7 @@ _rtn=((more_4)?((_cnt=1,_rtn=[(sb_3).append(clojure.str(clojure.first(more_4))), return (clojure.JS.def(clojure,"symbol",(function __clojure_fn_3083_symbol_3085(ns_1,name_2){switch(arguments.length){ case 1:var name_1=arguments[0]; return (clojure.lang.Symbol.intern(name_1))} -return (clojure.lang.Symbol.intern(ns_1,name_2))})))})(); +return (clojure.lang.Symbol.intern(ns_1,name_2))})))}).apply(null,[]); //====== //(defn keyword "Returns a Keyword with the given namespace and name. Do not use :\n in the keyword strings, it will be added automatically." ([name] (. clojure.lang.Keyword (intern nil name))) ([ns name] (. clojure.lang.Keyword (intern ns name)))) @@ -266,105 +266,105 @@ return (clojure.lang.Symbol.intern(ns_1,name_2))})))})(); return (clojure.JS.def(clojure,"keyword",(function __clojure_fn_3097_keyword_3099(ns_1,name_2){switch(arguments.length){ case 1:var name_1=arguments[0]; return (clojure.lang.Keyword.intern(null,name_1))} -return (clojure.lang.Keyword.intern(ns_1,name_2))})))})(); +return (clojure.lang.Keyword.intern(ns_1,name_2))})))}).apply(null,[]); //====== //(defn gensym "Returns a new symbol with a unique name. If a prefix string is\n supplied, the name is prefix# where # is some unique number. If\n prefix is not supplied, the prefix is 'G'." ([] (gensym "G__")) ([prefix-string] (. clojure.lang.Symbol (intern (str prefix-string (str (. clojure.lang.RT (nextID)))))))) //--- (function __clojure_fn_3111(){ return (clojure.JS.def(clojure,"gensym",(function __clojure_fn_3111_gensym_3113(prefix_string_1){switch(arguments.length){ -case 0:return (clojure.gensym("G__"))} -return (clojure.lang.Symbol.intern(clojure.str(prefix_string_1,clojure.str(clojure.lang.RT.nextID()))))})))})(); +case 0:return (clojure.gensym.apply(null,["G__"]))} +return (clojure.lang.Symbol.intern(clojure.str.apply(null,[prefix_string_1,clojure.str.apply(null,[clojure.lang.RT.nextID()])])))})))}).apply(null,[]); //====== //(defn spread {:private true} [arglist] (cond (nil? arglist) nil (nil? (rest arglist)) (seq (first arglist)) :else (cons (first arglist) (spread (rest arglist))))) //--- (function __clojure_fn_3130(){ return (clojure.JS.def(clojure,"spread",(function __clojure_fn_3130_spread_3132(arglist_1){ -return (((clojure.nil_QMARK_(arglist_1))?(null):(((clojure.nil_QMARK_(clojure.rest(arglist_1)))?(clojure.seq(clojure.first(arglist_1))):(((":else")?(clojure.cons(clojure.first(arglist_1),clojure.spread(clojure.rest(arglist_1)))):(null)))))))})))})(); +return (((clojure.nil_QMARK_.apply(null,[arglist_1]))?(null):(((clojure.nil_QMARK_.apply(null,[clojure.rest.apply(null,[arglist_1])]))?(clojure.seq.apply(null,[clojure.first.apply(null,[arglist_1])])):(((clojure.keyword("","else"))?(clojure.cons.apply(null,[clojure.first.apply(null,[arglist_1]),clojure.spread.apply(null,[clojure.rest.apply(null,[arglist_1])])])):(null)))))))})))}).apply(null,[]); //====== //(defn list* "Creates a new list containing the item prepended to more." [item & more] (spread (cons item more))) //--- (function __clojure_fn_3148(){ -return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variatic(1,(function __clojure_fn_3148_list_STAR_3150(item_1){ +return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variadic(1,(function __clojure_fn_3148_list_STAR_3150(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.apply(null,[clojure.cons.apply(null,[item_1,more_2])]))}))))}).apply(null,[]); //====== //(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x)) //--- (function __clojure_fn_3166(){ return (clojure.JS.def(clojure,"delay_QMARK_",(function __clojure_fn_3166_delay_QMARK_3168(x_1){ -return (clojure.instance_QMARK_(clojure.lang.Delay,x_1))})))})(); +return (clojure.instance_QMARK_.apply(null,[clojure.lang.Delay,x_1]))})))}).apply(null,[]); //====== //(defn force "If x is a Delay, returns the (possibly cached) value of its expression, else returns x" [x] (. clojure.lang.Delay (force x))) //--- (function __clojure_fn_3178(){ return (clojure.JS.def(clojure,"force",(function __clojure_fn_3178_force_3180(x_1){ -return (clojure.lang.Delay.force(x_1))})))})(); +return (clojure.lang.Delay.force(x_1))})))}).apply(null,[]); //====== //(defn fnseq "Returns a seq object whose first is first and whose rest is the\n value produced by calling restfn with no arguments. restfn will be\n called at most once per step in the sequence, e.g. calling rest\n repeatedly on the head of the seq calls restfn once - the value it\n yields is cached." [first restfn] (new clojure.lang.FnSeq first restfn)) //--- (function __clojure_fn_3190(){ return (clojure.JS.def(clojure,"fnseq",(function __clojure_fn_3190_fnseq_3192(first_1,restfn_2){ -return ((new clojure.lang.FnSeq(first_1,restfn_2)))})))})(); +return ((new clojure.lang.FnSeq(first_1,restfn_2)))})))}).apply(null,[]); //====== //(defn cache-seq "Given a seq s, returns a lazy seq that will touch each element of s\n at most once, caching the results." [s] (when s (clojure.lang.CachedSeq. s))) //--- (function __clojure_fn_3208(){ return (clojure.JS.def(clojure,"cache_seq",(function __clojure_fn_3208_cache_seq_3210(s_1){ -return (((s_1)?((new clojure.lang.CachedSeq(s_1))):(null)))})))})(); +return (((s_1)?((new clojure.lang.CachedSeq(s_1))):(null)))})))}).apply(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_3235(){ -return (clojure.JS.def(clojure,"concat",clojure.JS.variatic(2,(function __clojure_fn_3235_concat_3237(x_1,y_2){switch(arguments.length){ -case 2:return (((clojure.seq(x_1))?((new clojure.lang.LazyCons((function __clojure_fn_3235_concat_3237_fn_3242(G__3241_1){switch(arguments.length){ -case 0:return (clojure.first(x_1))} -return (clojure.concat(clojure.rest(x_1),y_2))})))):(clojure.seq(y_2)))) -case 1:return (clojure.seq(x_1)) +return (clojure.JS.def(clojure,"concat",clojure.JS.variadic(2,(function __clojure_fn_3235_concat_3237(x_1,y_2){switch(arguments.length){ +case 2:return (((clojure.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3235_concat_3237_fn_3242(G__3241_1){switch(arguments.length){ +case 0:return (clojure.first.apply(null,[x_1]))} +return (clojure.concat.apply(null,[clojure.rest.apply(null,[x_1]),y_2]))})))):(clojure.seq.apply(null,[y_2])))) +case 1:return (clojure.seq.apply(null,[x_1])) case 0:return (null)} var cat_4,zs_3,zs_3=clojure.JS.rest_args(this,arguments,2); return (((cat_4=(function __clojure_fn_3235_concat_3237_cat_3247(xys_1,zs_2){ var _cnt,_rtn,cat_0=arguments.callee; -do{_cnt=0;_rtn=((clojure.seq(xys_1))?((new clojure.lang.LazyCons((function __clojure_fn_3235_concat_3237_cat_3247_fn_3249(G__3248_1){switch(arguments.length){ -case 0:return (clojure.first(xys_1))} -return (cat_0(clojure.rest(xys_1),zs_2))})))):(((zs_2)?((_cnt=1,_rtn=[clojure.first(zs_2),clojure.rest(zs_2)],xys_1=_rtn[0],zs_2=_rtn[1])):(null)))) +do{_cnt=0;_rtn=((clojure.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3235_concat_3237_cat_3247_fn_3249(G__3248_1){switch(arguments.length){ +case 0:return (clojure.first.apply(null,[xys_1]))} +return (cat_0.apply(null,[clojure.rest.apply(null,[xys_1]),zs_2]))})))):(((zs_2)?((_cnt=1,_rtn=[clojure.first.apply(null,[zs_2]),clojure.rest.apply(null,[zs_2])],xys_1=_rtn[0],zs_2=_rtn[1])):(null)))) }while(_cnt);return _rtn;})), -cat_4(clojure.concat(x_1,y_2),zs_3)))}))))})(); +cat_4.apply(null,[clojure.concat.apply(null,[x_1,y_2]),zs_3])))}))))}).apply(null,[]); //====== //(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_3267(){ -return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variatic(2,(function __clojure_fn_3267_EQ_3272(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3267_EQ_3272(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Util.equal(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Util.equal(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Util.equal(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3286(){ -return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variatic(2,(function __clojure_fn_3286_not_EQ_3288(x_1,y_2){switch(arguments.length){ -case 2:return (clojure.not(clojure.lang.Util.equal(x_1,y_2))) +return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3286_not_EQ_3288(x_1,y_2){switch(arguments.length){ +case 2:return (clojure.not.apply(null,[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.apply(null,[clojure.apply.apply(null,[clojure._EQ_,x_1,y_2,more_3])]))}))))}).apply(null,[]); //====== //(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))) //--- (function __clojure_fn_3303(){ return (clojure.JS.def(clojure,"compare",(function __clojure_fn_3303_compare_3308(x_1,y_2){ -return (clojure.lang.Util.compare(x_1,y_2))})))})(); +return (clojure.lang.Util.compare(x_1,y_2))})))}).apply(null,[]); //====== //(defn reduce "f should be a function of 2 arguments. If val is not supplied,\n returns the result of applying f to the first 2 items in coll, then\n applying f to that result and the 3rd item, etc. If coll contains no\n items, f must accept no arguments as well, and reduce returns the\n result of calling f with no arguments. If coll has only 1 item, it\n is returned and f is not called. If val is supplied, returns the\n result of applying f to val and the first item in coll, then\n applying f to that result and the 2nd item, etc. If coll contains no\n items, returns val and f is not called." ([f coll] (let [s (seq coll)] (if s (if (instance? clojure.lang.IReduce s) (. s (reduce f)) (reduce f (first s) (rest s))) (f)))) ([f val coll] (let [s (seq coll)] (if (instance? clojure.lang.IReduce s) (. s (reduce f val)) ((fn [f val s] (if s (recur f (f val (first s)) (rest s)) val)) f val s))))) @@ -372,359 +372,359 @@ return (clojure.lang.Util.compare(x_1,y_2))})))})(); (function __clojure_fn_3340(){ return (clojure.JS.def(clojure,"reduce",(function __clojure_fn_3340_reduce_3342(f_1,val_2,coll_3){switch(arguments.length){ case 2:var s_3,coll_2=arguments[1]; -return (((s_3=clojure.seq(coll_2)), -((s_3)?(((clojure.instance_QMARK_(clojure.lang.IReduce,s_3))?((s_3).reduce(f_1)):(clojure.reduce(f_1,clojure.first(s_3),clojure.rest(s_3))))):(f_1()))))} +return (((s_3=clojure.seq.apply(null,[coll_2])), +((s_3)?(((clojure.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_3]))?((s_3).reduce(f_1)):(clojure.reduce.apply(null,[f_1,clojure.first.apply(null,[s_3]),clojure.rest.apply(null,[s_3])])))):(f_1.apply(null,[])))))} var s_4; -return (((s_4=clojure.seq(coll_3)), -((clojure.instance_QMARK_(clojure.lang.IReduce,s_4))?((s_4).reduce(f_1,val_2)):((function __clojure_fn_3340_reduce_3342_fn_3345(f_1,val_2,s_3){ +return (((s_4=clojure.seq.apply(null,[coll_3])), +((clojure.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_fn_3340_reduce_3342_fn_3345(f_1,val_2,s_3){ var _cnt,_rtn; -do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1(val_2,clojure.first(s_3)),clojure.rest(s_3)],f_1=_rtn[0],val_2=_rtn[1],s_3=_rtn[2])):(val_2)) -}while(_cnt);return _rtn;})(f_1,val_2,s_4)))))})))})(); +do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1.apply(null,[val_2,clojure.first.apply(null,[s_3])]),clojure.rest.apply(null,[s_3])],f_1=_rtn[0],val_2=_rtn[1],s_3=_rtn[2])):(val_2)) +}while(_cnt);return _rtn;}).apply(null,[f_1,val_2,s_4])))))})))}).apply(null,[]); //====== //(defn reverse "Returns a seq of the items in coll in reverse order. Not lazy." [coll] (reduce conj nil coll)) //--- (function __clojure_fn_3356(){ return (clojure.JS.def(clojure,"reverse",(function __clojure_fn_3356_reverse_3358(coll_1){ -return (clojure.reduce(clojure.conj,null,coll_1))})))})(); +return (clojure.reduce.apply(null,[clojure.conj,null,coll_1]))})))}).apply(null,[]); //====== //(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_3374(){ -return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variatic(2,(function __clojure_fn_3374_PLUS_3379(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variadic(2,(function __clojure_fn_3374_PLUS_3379(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 1:return (clojure.cast.apply(null,[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.apply(null,[clojure._PLUS_,clojure.lang.Numbers.add(x_1,y_2),more_3]))}))))}).apply(null,[]); //====== //(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_3398(){ -return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variatic(2,(function __clojure_fn_3398_STAR_3403(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variadic(2,(function __clojure_fn_3398_STAR_3403(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 1:return (clojure.cast.apply(null,[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.apply(null,[clojure._STAR_,clojure.lang.Numbers.multiply(x_1,y_2),more_3]))}))))}).apply(null,[]); //====== //(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_3421(){ -return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variatic(2,(function __clojure_fn_3421_SLASH_3426(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variadic(2,(function __clojure_fn_3421_SLASH_3426(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.apply(null,[clojure._SLASH_,clojure.lang.Numbers.divide(x_1,y_2),more_3]))}))))}).apply(null,[]); //====== //(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_3443(){ -return (clojure.JS.def(clojure,"_",clojure.JS.variatic(2,(function __clojure_fn_3443_3448(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_",clojure.JS.variadic(2,(function __clojure_fn_3443_3448(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.apply(null,[clojure._,clojure.lang.Numbers.minus(x_1,y_2),more_3]))}))))}).apply(null,[]); //====== //(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_3465(){ -return (clojure.JS.def(clojure,"_LT_",clojure.JS.variatic(2,(function __clojure_fn_3465_LT_3470(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_LT_",clojure.JS.variadic(2,(function __clojure_fn_3465_LT_3470(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lt(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lt(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3487(){ -return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3487_LT_EQ_3492(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3487_LT_EQ_3492(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lte(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lte(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3509(){ -return (clojure.JS.def(clojure,"_GT_",clojure.JS.variatic(2,(function __clojure_fn_3509_GT_3514(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_GT_",clojure.JS.variadic(2,(function __clojure_fn_3509_GT_3514(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gt(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gt(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3531(){ -return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3531_GT_EQ_3536(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3531_GT_EQ_3536(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gte(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gte(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3553(){ -return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variatic(2,(function __clojure_fn_3553_EQ_EQ_3558(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3553_EQ_EQ_3558(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,_rtn=[y_2,clojure.first(more_3),clojure.rest(more_3)],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.equiv(y_2,clojure.first(more_3))))):(false)) -}while(_cnt);return _rtn;}))))})(); +do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.equiv(y_2,clojure.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); //====== //(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_3572(){ -return (clojure.JS.def(clojure,"max",clojure.JS.variatic(2,(function __clojure_fn_3572_max_3574(x_1,y_2){switch(arguments.length){ +return (clojure.JS.def(clojure,"max",clojure.JS.variadic(2,(function __clojure_fn_3572_max_3574(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.apply(null,[clojure.max,clojure.max.ap |