diff options
Diffstat (limited to 'clojurescript/core.js')
| -rw-r--r-- | clojurescript/core.js | 3370 |
1 files changed, 0 insertions, 3370 deletions
diff --git a/clojurescript/core.js b/clojurescript/core.js deleted file mode 100644 index 1542d3f2..00000000 --- a/clojurescript/core.js +++ /dev/null @@ -1,3370 +0,0 @@ - -//====== -//(in-ns (quote clojure.core)) -//--- -(function __user_fn_2(){ -return (clojure.core.in_ns.apply(null,[clojure.core.symbol("clojure.core")]))}).apply(null,[]); - -//====== -//(def list (. clojure.lang.PersistentList creator)) -//--- -(function __clojure_core_fn_8(){ -return (clojure.JS.def(clojure.core,"list",clojure.JS.getOrRun(clojure.lang.PersistentList,"creator")))}).apply(null,[]); -// Skipping: (def cons (fn* cons [x seq] (. clojure.lang.RT (cons x seq)))) -// Skipping: (def let (fn* let [& decl] (cons (quote let*) decl))) -// Skipping: (def loop (fn* loop [& decl] (cons (quote loop*) decl))) -// Skipping: (def fn (fn* fn [& decl] (cons (quote fn*) decl))) -// Skipping: (def first (fn first [coll] (. clojure.lang.RT (first coll)))) -// Skipping: (def rest (fn rest [x] (. clojure.lang.RT (rest x)))) - -//====== -//(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_core_fn_41(){ -return (clojure.JS.def(clojure.core,"conj",clojure.JS.variadic(2,(function __clojure_core_fn_41_conj_43(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,conj_0=arguments.callee,xs_3=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_rtn=[conj_0.apply(null,[coll_1,x_2]),clojure.core.first.apply(null,[xs_3]),clojure.core.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)))) -//--- -(function __clojure_core_fn_46(){ -return (clojure.JS.def(clojure.core,"second",(function __clojure_core_fn_46_second_48(x_1){ -var second_0=arguments.callee; -return (clojure.core.first.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); - -//====== -//(def ffirst (fn ffirst [x] (first (first x)))) -//--- -(function __clojure_core_fn_51(){ -return (clojure.JS.def(clojure.core,"ffirst",(function __clojure_core_fn_51_ffirst_53(x_1){ -var ffirst_0=arguments.callee; -return (clojure.core.first.apply(null,[clojure.core.first.apply(null,[x_1])]))})))}).apply(null,[]); - -//====== -//(def rfirst (fn rfirst [x] (rest (first x)))) -//--- -(function __clojure_core_fn_56(){ -return (clojure.JS.def(clojure.core,"rfirst",(function __clojure_core_fn_56_rfirst_58(x_1){ -var rfirst_0=arguments.callee; -return (clojure.core.rest.apply(null,[clojure.core.first.apply(null,[x_1])]))})))}).apply(null,[]); - -//====== -//(def frest (fn frest [x] (first (rest x)))) -//--- -(function __clojure_core_fn_61(){ -return (clojure.JS.def(clojure.core,"frest",(function __clojure_core_fn_61_frest_63(x_1){ -var frest_0=arguments.callee; -return (clojure.core.first.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); - -//====== -//(def rrest (fn rrest [x] (rest (rest x)))) -//--- -(function __clojure_core_fn_66(){ -return (clojure.JS.def(clojure.core,"rrest",(function __clojure_core_fn_66_rrest_68(x_1){ -var rrest_0=arguments.callee; -return (clojure.core.rest.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); -// Skipping: (def seq (fn seq [coll] (. clojure.lang.RT (seq coll)))) -// Skipping: (def instance? (fn instance? [c x] (. c (isInstance x)))) - -//====== -//(def seq? (fn seq? [x] (instance? clojure.lang.ISeq x))) -//--- -(function __clojure_core_fn_81(){ -return (clojure.JS.def(clojure.core,"seq_QMARK_",(function __clojure_core_fn_81_seq_QMARK_83(x_1){ -var seq_QMARK__0=arguments.callee; -return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.ISeq,x_1]))})))}).apply(null,[]); -// Skipping: (def string? (fn string? [x] (instance? String x))) - -//====== -//(def map? (fn map? [x] (instance? clojure.lang.IPersistentMap x))) -//--- -(function __clojure_core_fn_91(){ -return (clojure.JS.def(clojure.core,"map_QMARK_",(function __clojure_core_fn_91_map_QMARK_93(x_1){ -var map_QMARK__0=arguments.callee; -return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.IPersistentMap,x_1]))})))}).apply(null,[]); - -//====== -//(def vector? (fn vector? [x] (instance? clojure.lang.IPersistentVector x))) -//--- -(function __clojure_core_fn_96(){ -return (clojure.JS.def(clojure.core,"vector_QMARK_",(function __clojure_core_fn_96_vector_QMARK_98(x_1){ -var vector_QMARK__0=arguments.callee; -return (clojure.core.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_core_fn_101(){ -return (clojure.JS.def(clojure.core,"sigs",(function __clojure_core_fn_101_sigs_103(fdecl_1){ -var fdecl_3,ret_2; -return (((clojure.core.seq_QMARK_.apply(null,[clojure.core.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.core.conj.apply(null,[ret_2,clojure.core.first.apply(null,[clojure.core.first.apply(null,[fdecl_3])])]),clojure.core.rest.apply(null,[fdecl_3])],ret_2=_rtn[0],fdecl_3=_rtn[1])):(clojure.core.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})())):(clojure.core.list.apply(null,[clojure.core.first.apply(null,[fdecl_1])]))))})))}).apply(null,[]); -// Skipping: (def assoc (fn assoc ([map key val] (. clojure.lang.RT (assoc map key val))) ([map key val & kvs] (let [ret (assoc map key val)] (if kvs (recur ret (first kvs) (second kvs) (rrest kvs)) ret))))) - -//====== -//(def meta (fn meta [x] (if (instance? clojure.lang.IObj x) (. x (meta))))) -//--- -(function __clojure_core_fn_112(){ -return (clojure.JS.def(clojure.core,"meta",(function __clojure_core_fn_112_meta_114(x_1){ -var meta_0=arguments.callee; -return (((clojure.core.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)))) -//--- -(function __clojure_core_fn_117(){ -return (clojure.JS.def(clojure.core,"with_meta",(function __clojure_core_fn_117_with_meta_119(x_1,m_2){ -var with_meta_0=arguments.callee; -return ((x_1).withMeta(m_2))})))}).apply(null,[]); - -//====== -//(def last (fn last [s] (if (rest s) (recur (rest s)) (first s)))) -//--- -(function __clojure_core_fn_122(){ -return (clojure.JS.def(clojure.core,"last",(function __clojure_core_fn_122_last_124(s_1){ -var _cnt,_rtn,last_0=arguments.callee; -do{_cnt=0;_rtn=((clojure.core.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s_1])],s_1=_rtn[0])):(clojure.core.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_core_fn_127(){ -return (clojure.JS.def(clojure.core,"butlast",(function __clojure_core_fn_127_butlast_129(s_1){ -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.core.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.core.conj.apply(null,[ret_2,clojure.core.first.apply(null,[s_3])]),clojure.core.rest.apply(null,[s_3])],ret_2=_rtn[0],s_3=_rtn[1])):(clojure.core.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})()))})))}).apply(null,[]); -// Skipping: (def defn (fn defn [name & fdecl] (let [m (if (string? (first fdecl)) {:doc (first fdecl)} {}) fdecl (if (string? (first fdecl)) (rest fdecl) fdecl) m (if (map? (first fdecl)) (conj m (first fdecl)) m) fdecl (if (map? (first fdecl)) (rest fdecl) fdecl) fdecl (if (vector? (first fdecl)) (list fdecl) fdecl) m (if (map? (last fdecl)) (conj m (last fdecl)) m) fdecl (if (map? (last fdecl)) (butlast fdecl) fdecl) m (conj {:arglists (list (quote quote) (sigs fdecl))} m)] (list (quote def) (with-meta name (conj (if (meta name) (meta name) {}) m)) (cons (quote clojure.core/fn) fdecl))))) -// Skipping: (. (var defn) (setMacro)) - -//====== -//(defn cast "Throws a ClassCastException if x is not a c, else returns x." [c x] (. c (cast x))) -//--- -(function __clojure_core_fn_140(){ -return (clojure.JS.def(clojure.core,"cast",(function __clojure_core_fn_140_cast_142(c_1,x_2){ -return ((c_1).cast(x_2))})))}).apply(null,[]); -// Skipping: (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))) - -//====== -//(defn vector "Creates a new vector containing the args." ([] []) ([& args] (. clojure.lang.LazilyPersistentVector (create args)))) -//--- -(function __clojure_core_fn_152(){ -return (clojure.JS.def(clojure.core,"vector",clojure.JS.variadic(0,(function __clojure_core_fn_152_vector_154(){switch(arguments.length){ -case 0:return (clojure.lang.PersistentVector.EMPTY)} -var args_1=clojure.JS.rest_args(this,arguments,0); -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_core_fn_159(){ -return (clojure.JS.def(clojure.core,"vec",(function __clojure_core_fn_159_vec_161(coll_1){ -return (clojure.lang.LazilyPersistentVector.createOwning(clojure.core.to_array.apply(null,[coll_1])))})))}).apply(null,[]); -// Skipping: (defn hash-map "keyval => key val\n Returns a new hash map with supplied mappings." ([] {}) ([& keyvals] (. clojure.lang.PersistentHashMap (create keyvals)))) - -//====== -//(defn hash-set "Returns a new hash set with supplied keys." ([] #{}) ([& keys] (. clojure.lang.PersistentHashSet (create keys)))) -//--- -(function __clojure_core_fn_172(){ -return (clojure.JS.def(clojure.core,"hash_set",clojure.JS.variadic(0,(function __clojure_core_fn_172_hash_set_174(){switch(arguments.length){ -case 0:return (clojure.lang.PersistentHashSet.EMPTY)} -var keys_1=clojure.JS.rest_args(this,arguments,0); -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_core_fn_179(){ -return (clojure.JS.def(clojure.core,"sorted_map",clojure.JS.variadic(0,(function __clojure_core_fn_179_sorted_map_181(){ -var keyvals_1=clojure.JS.rest_args(this,arguments,0); -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_core_fn_185(){ -return (clojure.JS.def(clojure.core,"sorted_set",clojure.JS.variadic(0,(function __clojure_core_fn_185_sorted_set_187(){ -var keys_1=clojure.JS.rest_args(this,arguments,0); -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_core_fn_191(){ -return (clojure.JS.def(clojure.core,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_core_fn_191_sorted_map_by_193(comparator_1){ -var keyvals_2=clojure.JS.rest_args(this,arguments,1); -return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))}))))}).apply(null,[]); -// Skipping: (def defmacro (fn [name & args] (list (quote do) (cons (quote clojure.core/defn) (cons name args)) (list (quote .) (list (quote var) name) (quote (setMacro)))))) -// Skipping: (. (var defmacro) (setMacro)) -// Skipping: (defmacro when "Evaluates test. If logical true, evaluates body in an implicit do." [test & body] (list (quote if) test (cons (quote do) body))) -// Skipping: (defmacro when-not "Evaluates test. If logical false, evaluates body in an implicit do." [test & body] (list (quote if) test nil (cons (quote do) body))) - -//====== -//(defn nil? "Returns true if x is nil, false otherwise." {:tag Boolean} [x] (identical? x nil)) -//--- -(function __clojure_core_fn_224(){ -return (clojure.JS.def(clojure.core,"nil_QMARK_",(function __clojure_core_fn_224_nil_QMARK_226(x_1){ -return (clojure.core.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_core_fn_230(){ -return (clojure.JS.def(clojure.core,"false_QMARK_",(function __clojure_core_fn_230_false_QMARK_232(x_1){ -return (clojure.core.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_core_fn_236(){ -return (clojure.JS.def(clojure.core,"true_QMARK_",(function __clojure_core_fn_236_true_QMARK_238(x_1){ -return (clojure.core.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_core_fn_242(){ -return (clojure.JS.def(clojure.core,"not",(function __clojure_core_fn_242_not_244(x_1){ -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] ((fn [sb more] (if more (recur (. sb (append (str (first more)))) (rest more)) (str sb))) (clojure.lang.RT/makeStringBuilder (str x)) ys))) -//--- -(function __clojure_core_fn_248(){ -return (clojure.JS.def(clojure.core,"str",clojure.JS.variadic(1,(function __clojure_core_fn_248_str_250(x_1){switch(arguments.length){ -case 1:return (((clojure.core.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString()))) -case 0:return ("")} -var ys_2=clojure.JS.rest_args(this,arguments,1); -return ((function __clojure_core_fn_248_str_250_fn_254(sb_1,more_2){ -var _cnt,_rtn; -do{_cnt=0;_rtn=((more_2)?((_cnt=1,_rtn=[(sb_1).append(clojure.core.str.apply(null,[clojure.core.first.apply(null,[more_2])])),clojure.core.rest.apply(null,[more_2])],sb_1=_rtn[0],more_2=_rtn[1])):(clojure.core.str.apply(null,[sb_1]))) -}while(_cnt);return _rtn;}).apply(null,[clojure.lang.RT.makeStringBuilder(clojure.core.str.apply(null,[x_1])),ys_2]))}))))}).apply(null,[]); - -//====== -//(defn symbol? "Return true if x is a Symbol" [x] (instance? clojure.lang.Symbol x)) -//--- -(function __clojure_core_fn_259(){ -return (clojure.JS.def(clojure.core,"symbol_QMARK_",(function __clojure_core_fn_259_symbol_QMARK_261(x_1){ -return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Symbol,x_1]))})))}).apply(null,[]); - -//====== -//(defn keyword? "Return true if x is a Keyword" [x] (instance? clojure.lang.Keyword x)) -//--- -(function __clojure_core_fn_265(){ -return (clojure.JS.def(clojure.core,"keyword_QMARK_",(function __clojure_core_fn_265_keyword_QMARK_267(x_1){ -return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Keyword,x_1]))})))}).apply(null,[]); -// Skipping: (defn symbol "Returns a Symbol with the given namespace and name." ([name] (if (symbol? name) name (. clojure.lang.Symbol (intern name)))) ([ns name] (. clojure.lang.Symbol (intern ns name)))) -// Skipping: (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] (if (keyword? name) name (. clojure.lang.Keyword (intern nil name)))) ([ns name] (. clojure.lang.Keyword (intern ns name)))) - -//====== -//(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_core_fn_285(){ -return (clojure.JS.def(clojure.core,"gensym",(function __clojure_core_fn_285_gensym_287(prefix_string_1){switch(arguments.length){ -case 0:return (clojure.core.gensym.apply(null,["G__"]))} -return (clojure.lang.Symbol.intern(clojure.core.str.apply(null,[prefix_string_1,clojure.core.str.apply(null,[clojure.lang.RT.nextID()])])))})))}).apply(null,[]); -// Skipping: (defmacro cond "Takes a set of test/expr pairs. It evaluates each test one at a\n time. If a test returns logical true, cond evaluates and returns\n the value of the corresponding expr and doesn't evaluate any of the\n other tests or exprs. (cond) returns nil." [& clauses] (when clauses (list (quote if) (first clauses) (second clauses) (cons (quote clojure.core/cond) (rest (rest clauses)))))) - -//====== -//(defn spread {:private true} [arglist] (cond (nil? arglist) nil (nil? (rest arglist)) (seq (first arglist)) :else (cons (first arglist) (spread (rest arglist))))) -//--- -(function __clojure_core_fn_301(){ -return (clojure.JS.def(clojure.core,"spread",(function __clojure_core_fn_301_spread_303(arglist_1){ -return (((clojure.core.nil_QMARK_.apply(null,[arglist_1]))?(null):(((clojure.core.nil_QMARK_.apply(null,[clojure.core.rest.apply(null,[arglist_1])]))?(clojure.core.seq.apply(null,[clojure.core.first.apply(null,[arglist_1])])):(((clojure.core.keyword("","else"))?(clojure.core.cons.apply(null,[clojure.core.first.apply(null,[arglist_1]),clojure.core.spread.apply(null,[clojure.core.rest.apply(null,[arglist_1])])])):(null)))))))})))}).apply(null,[]); -// Skipping: (defn apply "Applies fn f to the argument list formed by prepending args to argseq." {:arglists (quote ([f args* argseq]))} [f & args] (. f (applyTo (spread args)))) - -//====== -//(defn list* "Creates a new list containing the item prepended to more." [item & more] (spread (cons item more))) -//--- -(function __clojure_core_fn_313(){ -return (clojure.JS.def(clojure.core,"list_STAR_",clojure.JS.variadic(1,(function __clojure_core_fn_313_list_STAR_315(item_1){ -var more_2=clojure.JS.rest_args(this,arguments,1); -return (clojure.core.spread.apply(null,[clojure.core.cons.apply(null,[item_1,more_2])]))}))))}).apply(null,[]); -// Skipping: (defmacro delay "Takes a body of expressions and yields a Delay object than will\n invoke the body only the first time it is forced (with force), and\n will cache the result and return it on all subsequent force calls" [& body] (list (quote new) (quote clojure.lang.Delay) (list* (quote clojure.core/fn) [] body))) - -//====== -//(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x)) -//--- -(function __clojure_core_fn_328(){ -return (clojure.JS.def(clojure.core,"delay_QMARK_",(function __clojure_core_fn_328_delay_QMARK_330(x_1){ -return (clojure.core.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_core_fn_334(){ -return (clojure.JS.def(clojure.core,"force",(function __clojure_core_fn_334_force_336(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_core_fn_340(){ -return (clojure.JS.def(clojure.core,"fnseq",(function __clojure_core_fn_340_fnseq_342(first_1,restfn_2){ -return ((new clojure.lang.FnSeq(first_1,restfn_2)))})))}).apply(null,[]); -// Skipping: (defmacro lazy-cons "Expands to code which produces a seq object whose first is\n first-expr and whose rest is rest-expr, neither of which is\n evaluated until first/rest is called. Each expr will be evaluated at most\n once per step in the sequence, e.g. calling first/rest repeatedly on the\n same node of the seq evaluates first/rest-expr once - the values they yield are\n cached." [first-expr & rest-expr] (list (quote new) (quote clojure.lang.LazyCons) (list (quote clojure.core/fn) (list [] first-expr) (list* [(gensym)] rest-expr)))) - -//====== -//(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_core_fn_355(){ -return (clojure.JS.def(clojure.core,"cache_seq",(function __clojure_core_fn_355_cache_seq_357(s_1){ -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_core_fn_361(){ -return (clojure.JS.def(clojure.core,"concat",clojure.JS.variadic(2,(function __clojure_core_fn_361_concat_363(x_1,y_2){switch(arguments.length){ -case 2:return (((clojure.core.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_361_concat_363_fn_368(G__367_1){switch(arguments.length){ -case 0:return (clojure.core.first.apply(null,[x_1]))} -return (clojure.core.concat.apply(null,[clojure.core.rest.apply(null,[x_1]),y_2]))})))):(clojure.core.seq.apply(null,[y_2])))) -case 0:return (null) -case 1:return (clojure.core.seq.apply(null,[x_1]))} -var cat_4,zs_3=clojure.JS.rest_args(this,arguments,2); -return (((cat_4=(function __clojure_core_fn_361_concat_363_cat_373(xys_1,zs_2){ -var _cnt,_rtn,cat_0=arguments.callee; -do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_361_concat_363_cat_373_fn_375(G__374_1){switch(arguments.length){ -case 0:return (clojure.core.first.apply(null,[xys_1]))} -return (cat_0.apply(null,[clojure.core.rest.apply(null,[xys_1]),zs_2]))})))):(((zs_2)?((_cnt=1,_rtn=[clojure.core.first.apply(null,[zs_2]),clojure.core.rest.apply(null,[zs_2])],xys_1=_rtn[0],zs_2=_rtn[1])):(null)))) -}while(_cnt);return _rtn;})), -cat_4.apply(null,[clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Util)) (clojure.core/list (quote clojure.core/equal)) (clojure.core/list x) (clojure.core/list y))), :tag Boolean, :inline-arities #{2}} ([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_core_fn_382(){ -return (clojure.JS.def(clojure.core,"_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_382_EQ_387(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=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Util.equal(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Util.equal(y_2,clojure.core.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_core_fn_393(){ -return (clojure.JS.def(clojure.core,"not_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_393_not_EQ_395(x_1,y_2){switch(arguments.length){ -case 2:return (clojure.core.not.apply(null,[clojure.lang.Util.equal(x_1,y_2)])) -case 1:return (false)} -var more_3=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.not.apply(null,[clojure.core.apply.apply(null,[clojure.core._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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Util)) (clojure.core/list (quote clojure.core/compare)) (clojure.core/list x) (clojure.core/list y))), :tag Integer} [x y] (. clojure.lang.Util (compare x y))) -//--- -(function __clojure_core_fn_401(){ -return (clojure.JS.def(clojure.core,"compare",(function __clojure_core_fn_401_compare_406(x_1,y_2){ -return (clojure.lang.Util.compare(x_1,y_2))})))}).apply(null,[]); -// Skipping: (defmacro and "Evaluates exprs one at a time, from left to right. If a form\n returns logical false (nil or false), and returns that value and\n doesn't evaluate any of the other expressions, otherwise it returns\n the value of the last expr. (and) returns true." ([] true) ([x] x) ([x & rest] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote and__410)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote and__410)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/and)) rest)) (clojure.core/list (quote and__410))))))) -// Skipping: (defmacro or "Evaluates exprs one at a time, from left to right. If a form\n returns a logical true value, or returns that value and doesn't\n evaluate any of the other expressions, otherwise it returns the\n value of the last expression. (or) returns nil." ([] nil) ([x] x) ([x & rest] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote or__424)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote or__424)) (clojure.core/list (quote or__424)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/or)) rest))))))) - -//====== -//(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))))) -//--- -(function __clojure_core_fn_438(){ -return (clojure.JS.def(clojure.core,"reduce",(function __clojure_core_fn_438_reduce_440(f_1,val_2,coll_3){switch(arguments.length){ -case 2:var s_3,coll_2=arguments[1]; -return (((s_3=clojure.core.seq.apply(null,[coll_2])), -((s_3)?(((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_3]))?((s_3).reduce(f_1)):(clojure.core.reduce.apply(null,[f_1,clojure.core.first.apply(null,[s_3]),clojure.core.rest.apply(null,[s_3])])))):(f_1.apply(null,[])))))} -var s_4; -return (((s_4=clojure.core.seq.apply(null,[coll_3])), -((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_core_fn_438_reduce_440_fn_443(f_1,val_2,s_3){ -var _cnt,_rtn; -do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1.apply(null,[val_2,clojure.core.first.apply(null,[s_3])]),clojure.core.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_core_fn_448(){ -return (clojure.JS.def(clojure.core,"reverse",(function __clojure_core_fn_448_reverse_450(coll_1){ -return (clojure.core.reduce.apply(null,[clojure.core.conj,null,coll_1]))})))}).apply(null,[]); - -//====== -//(defn + "Returns the sum of nums. (+) returns 0." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/add)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([] 0) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (add x y))) ([x y & more] (reduce + (+ x y) more))) -//--- -(function __clojure_core_fn_454(){ -return (clojure.JS.def(clojure.core,"_PLUS_",clojure.JS.variadic(2,(function __clojure_core_fn_454_PLUS_459(x_1,y_2){switch(arguments.length){ -case 0:return ((0)) -case 2:return (clojure.lang.Numbers.add(x_1,y_2)) -case 1:return (clojure.lang.RT.numberCast(x_1))} -var more_3=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core._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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/multiply)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([] 1) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more))) -//--- -(function __clojure_core_fn_466(){ -return (clojure.JS.def(clojure.core,"_STAR_",clojure.JS.variadic(2,(function __clojure_core_fn_466_STAR_471(x_1,y_2){switch(arguments.length){ -case 0:return ((1)) -case 1:return (clojure.lang.RT.numberCast(x_1)) -case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))} -var more_3=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core._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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/divide)) (clojure.core/list x) (clojure.core/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_core_fn_478(){ -return (clojure.JS.def(clojure.core,"_SLASH_",clojure.JS.variadic(2,(function __clojure_core_fn_478_SLASH_483(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=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core._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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/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_core_fn_489(){ -return (clojure.JS.def(clojure.core,"_",clojure.JS.variadic(2,(function __clojure_core_fn_489_494(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=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core._,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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lt)) (clojure.core/list x) (clojure.core/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_core_fn_500(){ -return (clojure.JS.def(clojure.core,"_LT_",clojure.JS.variadic(2,(function __clojure_core_fn_500_LT_505(x_1,y_2){switch(arguments.length){ -case 1:return (true) -case 2:return (clojure.lang.Numbers.lt(x_1,y_2))} -var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lt(y_2,clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lte)) (clojure.core/list x) (clojure.core/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_core_fn_511(){ -return (clojure.JS.def(clojure.core,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_511_LT_EQ_516(x_1,y_2){switch(arguments.length){ -case 1:return (true) -case 2:return (clojure.lang.Numbers.lte(x_1,y_2))} -var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lte(y_2,clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/gt)) (clojure.core/list x) (clojure.core/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_core_fn_522(){ -return (clojure.JS.def(clojure.core,"_GT_",clojure.JS.variadic(2,(function __clojure_core_fn_522_GT_527(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=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gt(y_2,clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/gte)) (clojure.core/list x) (clojure.core/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_core_fn_533(){ -return (clojure.JS.def(clojure.core,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_533_GT_EQ_538(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=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gte(y_2,clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/equiv)) (clojure.core/list x) (clojure.core/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_core_fn_544(){ -return (clojure.JS.def(clojure.core,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_544_EQ_EQ_549(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=clojure.JS.rest_args(this,arguments,2); -do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.equiv(y_2,clojure.core.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_core_fn_555(){ -return (clojure.JS.def(clojure.core,"max",clojure.JS.variadic(2,(function __clojure_core_fn_555_max_557(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=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core.max,clojure.core.max.apply(null,[x_1,y_2]),more_3]))}))))}).apply(null,[]); - -//====== -//(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_core_fn_563(){ -return (clojure.JS.def(clojure.core,"min",clojure.JS.variadic(2,(function __clojure_core_fn_563_min_565(x_1,y_2){switch(arguments.length){ -case 1:return (x_1) -case 2:return (((clojure.lang.Numbers.lt(x_1,y_2))?(x_1):(y_2)))} -var more_3=clojure.JS.rest_args(this,arguments,2); -return (clojure.core.reduce.apply(null,[clojure.core.min,clojure.core.min.apply(null,[x_1,y_2]),more_3]))}))))}).apply(null,[]); - -//====== -//(defn inc "Returns a number one greater than num." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/inc)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (inc x))) -//--- -(function __clojure_core_fn_571(){ -return (clojure.JS.def(clojure.core,"inc",(function __clojure_core_fn_571_inc_576(x_1){ -return (clojure.lang.Numbers.inc(x_1))})))}).apply(null,[]); - -//====== -//(defn dec "Returns a number one less than num." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/dec)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (dec x))) -//--- -(function __clojure_core_fn_580(){ -return (clojure.JS.def(clojure.core,"dec",(function __clojure_core_fn_580_dec_585(x_1){ -return (clojure.lang.Numbers.dec(x_1))})))}).apply(null,[]); - -//====== -//(defn unchecked-inc "Returns a number one greater than x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_inc)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_inc x))) -//--- -(function __clojure_core_fn_589(){ -return (clojure.JS.def(clojure.core,"unchecked_inc",(function __clojure_core_fn_589_unchecked_inc_594(x_1){ -return (clojure.lang.Numbers.unchecked_inc(x_1))})))}).apply(null,[]); - -//====== -//(defn unchecked-dec "Returns a number one less than x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_dec)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_dec x))) -//--- -(function __clojure_core_fn_598(){ -return (clojure.JS.def(clojure.core,"unchecked_dec",(function __clojure_core_fn_598_unchecked_dec_603(x_1){ -return (clojure.lang.Numbers.unchecked_dec(x_1))})))}).apply(null,[]); - -//====== -//(defn unchecked-negate "Returns the negation of x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_negate)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_negate x))) -//--- -(function __clojure_core_fn_607(){ -return (clojure.JS.def(clojure.core,"unchecked_negate",(function __clojure_core_fn_607_unchecked_negate_612(x_1){ -return (clojure.lang.Numbers.unchecked_negate(x_1))})))}).apply(null,[]); - -//====== -//(defn unchecked-add "Returns the sum of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_add)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_add x y))) -//--- -(function __clojure_core_fn_616(){ -return (clojure.JS.def(clojure.core,"unchecked_add",(function __clojure_core_fn_616_unchecked_add_621(x_1,y_2){ -return (clojure.lang.Numbers.unchecked_add(x_1,y_2))})))}).apply(null,[]); - -//====== -//(defn unchecked-subtract "Returns the difference of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_subtract)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_subtract x y))) -//--- -(function __clojure_core_fn_625(){ -return (clojure.JS.def(clojure.core,"unchecked_subtract",(function __clojure_core_fn_625_unchecked_subtract_630(x_1,y_2){ -return (clojure.lang.Numbers.unchecked_subtract(x_1,y_2))})))}).apply(null,[]); - -//====== -//(defn unchecked-multiply "Returns the product of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_multiply)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_multiply x y))) -//--- -(function __clojure_core_fn_634(){ -return (clojure.JS.def(clojure.core,"unchecked_multiply",(function __clojure_core_fn_634_unchecked_multiply_639(x_1,y_2){ -return (clojure.lang.Numbers.unchecked_multiply(x_1,y_2))})))}).apply(null,[]); - -//====== -//(defn unchecked-divide "Returns the division of x by y, both int or long. \n Note - uses a primitive operator subject to truncation." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_divide)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_divide x y))) -//--- -(function __clojure_core_fn_643(){ -return (clojure.JS.def(clojure.core,"unchecked_divide",(function __clojure_core_fn_643_unchecked_divide_648(x_1,y_2){ -return (clojure.lang.Numbers.unchecked_divide(x_1,y_2))})))}).apply(null,[]); - -//====== -//(defn pos? "Returns true if num is gre |