diff options
Diffstat (limited to 'clojurescript/src/clojure/contrib')
3 files changed, 1118 insertions, 1080 deletions
diff --git a/clojurescript/src/clojure/contrib/clojurescript/core.js b/clojurescript/src/clojure/contrib/clojurescript/core.js index 5e521f7c..1989d011 100644 --- a/clojurescript/src/clojure/contrib/clojurescript/core.js +++ b/clojurescript/src/clojure/contrib/clojurescript/core.js @@ -286,10 +286,18 @@ return (((clojure.core.nil_QMARK_.apply(null,[arglist_1]))?(null):(((clojure.cor // 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))) +//(defn vary-meta "Returns an object of the same type and value as obj, with\n (apply f (meta obj) args) as its metadata." [obj f & args] (with-meta obj (apply f (meta obj) args))) //--- (function __clojure_core_fn_834(){ -return (clojure.JS.def(clojure.core,"list_STAR_",clojure.JS.variadic(1,(function __clojure_core_fn_834_list_STAR_836(item_1){ +return (clojure.JS.def(clojure.core,"vary_meta",clojure.JS.variadic(2,(function __clojure_core_fn_834_vary_meta_836(obj_1,f_2){ +var args_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.with_meta.apply(null,[obj_1,clojure.core.apply.apply(null,[f_2,clojure.core.meta.apply(null,[obj_1]),args_3])]))}))))}).apply(null,[]); + +//====== +//(defn list* "Creates a new list containing the item prepended to more." [item & more] (spread (cons item more))) +//--- +(function __clojure_core_fn_840(){ +return (clojure.JS.def(clojure.core,"list_STAR_",clojure.JS.variadic(1,(function __clojure_core_fn_840_list_STAR_842(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 that 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))) @@ -297,46 +305,46 @@ return (clojure.core.spread.apply(null,[clojure.core.cons.apply(null,[item_1,mor //====== //(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x)) //--- -(function __clojure_core_fn_849(){ -return (clojure.JS.def(clojure.core,"delay_QMARK_",(function __clojure_core_fn_849_delay_QMARK_851(x_1){ +(function __clojure_core_fn_855(){ +return (clojure.JS.def(clojure.core,"delay_QMARK_",(function __clojure_core_fn_855_delay_QMARK_857(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_855(){ -return (clojure.JS.def(clojure.core,"force",(function __clojure_core_fn_855_force_857(x_1){ +(function __clojure_core_fn_861(){ +return (clojure.JS.def(clojure.core,"force",(function __clojure_core_fn_861_force_863(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_861(){ -return (clojure.JS.def(clojure.core,"fnseq",(function __clojure_core_fn_861_fnseq_863(first_1,restfn_2){ +(function __clojure_core_fn_867(){ +return (clojure.JS.def(clojure.core,"fnseq",(function __clojure_core_fn_867_fnseq_869(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_876(){ -return (clojure.JS.def(clojure.core,"cache_seq",(function __clojure_core_fn_876_cache_seq_878(s_1){ +(function __clojure_core_fn_882(){ +return (clojure.JS.def(clojure.core,"cache_seq",(function __clojure_core_fn_882_cache_seq_884(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_882(){ -return (clojure.JS.def(clojure.core,"concat",clojure.JS.variadic(2,(function __clojure_core_fn_882_concat_884(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_888(){ +return (clojure.JS.def(clojure.core,"concat",clojure.JS.variadic(2,(function __clojure_core_fn_888_concat_890(x_1,y_2){switch(arguments.length){ case 0:return (null) case 1:return (clojure.core.seq.apply(null,[x_1])) -case 2:return (((clojure.core.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_882_concat_884_fn_889(G__888_1){switch(arguments.length){ +case 2:return (((clojure.core.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_888_concat_890_fn_895(G__894_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]))))} var cat_4,zs_3=clojure.JS.rest_args(this,arguments,2); -return (((cat_4=(function __clojure_core_fn_882_concat_884_cat_894(xys_1,zs_2){ +return (((cat_4=(function __clojure_core_fn_888_concat_890_cat_900(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_882_concat_884_cat_894_fn_896(G__895_1){switch(arguments.length){ +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_888_concat_890_cat_900_fn_902(G__901_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;})), @@ -346,8 +354,8 @@ cat_4.apply(null,[clojure.core.concat.apply(null,[x_1,y_2]),zs_3])))}))))}).appl //====== //(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 and collections in a type-independent manner. Clojure's immutable data\n structures define equals() (and thus =) as a value, not an identity,\n comparison." {:tag Boolean, :inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Util)) (clojure.core/list (quote clojure.core/equiv)) (clojure.core/list x) (clojure.core/list y))), :inline-arities #{2}} ([x] true) ([x y] (clojure.lang.Util/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_914(){ -return (clojure.JS.def(clojure.core,"_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_914_EQ_919(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_920(){ +return (clojure.JS.def(clojure.core,"_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_920_EQ_925(x_1,y_2){switch(arguments.length){ case 1:return (true) case 2:return (clojure.lang.Util.equiv(x_1,y_2))} var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); @@ -357,8 +365,8 @@ do{_cnt=0;_rtn=((clojure.lang.Util.equiv(x_1,y_2))?(((clojure.core.rest.apply(nu //====== //(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_925(){ -return (clojure.JS.def(clojure.core,"not_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_925_not_EQ_927(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_931(){ +return (clojure.JS.def(clojure.core,"not_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_931_not_EQ_933(x_1,y_2){switch(arguments.length){ case 1:return (false) case 2:return (clojure.core.not.apply(null,[clojure.lang.Util.equiv(x_1,y_2)]))} var more_3=clojure.JS.rest_args(this,arguments,2); @@ -367,23 +375,23 @@ return (clojure.core.not.apply(null,[clojure.core.apply.apply(null,[clojure.core //====== //(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 and collections in a type-independent\n manner. x must implement Comparable" {:tag Integer, :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)))} [x y] (. clojure.lang.Util (compare x y))) //--- -(function __clojure_core_fn_933(){ -return (clojure.JS.def(clojure.core,"compare",(function __clojure_core_fn_933_compare_938(x_1,y_2){ +(function __clojure_core_fn_939(){ +return (clojure.JS.def(clojure.core,"compare",(function __clojure_core_fn_939_compare_944(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__942__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote and__942__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/and)) rest)) (clojure.core/list (quote and__942__auto__))))))) -// 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__956__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote or__956__auto__)) (clojure.core/list (quote or__956__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/or)) rest))))))) +// 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__948__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote and__948__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/and)) rest)) (clojure.core/list (quote and__948__auto__))))))) +// 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__962__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote or__962__auto__)) (clojure.core/list (quote or__962__auto__)) (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_970(){ -return (clojure.JS.def(clojure.core,"reduce",(function __clojure_core_fn_970_reduce_972(f_1,val_2,coll_3){switch(arguments.length){ +(function __clojure_core_fn_976(){ +return (clojure.JS.def(clojure.core,"reduce",(function __clojure_core_fn_976_reduce_978(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_970_reduce_972_fn_975(f_1,val_2,s_3){ +((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_core_fn_976_reduce_978_fn_981(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,[]); @@ -391,15 +399,15 @@ do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1.apply(null,[val_2,clojure.core.firs //====== //(defn reverse "Returns a seq of the items in coll in reverse order. Not lazy." [coll] (reduce conj nil coll)) //--- -(function __clojure_core_fn_980(){ -return (clojure.JS.def(clojure.core,"reverse",(function __clojure_core_fn_980_reverse_982(coll_1){ +(function __clojure_core_fn_986(){ +return (clojure.JS.def(clojure.core,"reverse",(function __clojure_core_fn_986_reverse_988(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_986(){ -return (clojure.JS.def(clojure.core,"_PLUS_",clojure.JS.variadic(2,(function __clojure_core_fn_986_PLUS_991(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_992(){ +return (clojure.JS.def(clojure.core,"_PLUS_",clojure.JS.variadic(2,(function __clojure_core_fn_992_PLUS_997(x_1,y_2){switch(arguments.length){ case 0:return ((0)) case 1:return (clojure.lang.RT.numberCast(x_1)) case 2:return (clojure.lang.Numbers.add(x_1,y_2))} @@ -409,8 +417,8 @@ return (clojure.core.reduce.apply(null,[clojure.core._PLUS_,clojure.lang.Numbers //====== //(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_998(){ -return (clojure.JS.def(clojure.core,"_STAR_",clojure.JS.variadic(2,(function __clojure_core_fn_998_STAR_1003(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1004(){ +return (clojure.JS.def(clojure.core,"_STAR_",clojure.JS.variadic(2,(function __clojure_core_fn_1004_STAR_1009(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))} @@ -420,8 +428,8 @@ return (clojure.core.reduce.apply(null,[clojure.core._STAR_,clojure.lang.Numbers //====== //(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_1010(){ -return (clojure.JS.def(clojure.core,"_SLASH_",clojure.JS.variadic(2,(function __clojure_core_fn_1010_SLASH_1015(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1016(){ +return (clojure.JS.def(clojure.core,"_SLASH_",clojure.JS.variadic(2,(function __clojure_core_fn_1016_SLASH_1021(x_1,y_2){switch(arguments.length){ case 1:return (clojure.lang.Numbers.divide((1),x_1)) case 2:return (clojure.lang.Numbers.divide(x_1,y_2))} var more_3=clojure.JS.rest_args(this,arguments,2); @@ -430,8 +438,8 @@ return (clojure.core.reduce.apply(null,[clojure.core._SLASH_,clojure.lang.Number //====== //(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_1021(){ -return (clojure.JS.def(clojure.core,"_",clojure.JS.variadic(2,(function __clojure_core_fn_1021_1026(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1027(){ +return (clojure.JS.def(clojure.core,"_",clojure.JS.variadic(2,(function __clojure_core_fn_1027_1032(x_1,y_2){switch(arguments.length){ case 1:return (clojure.lang.Numbers.minus(x_1)) case 2:return (clojure.lang.Numbers.minus(x_1,y_2))} var more_3=clojure.JS.rest_args(this,arguments,2); @@ -440,8 +448,8 @@ return (clojure.core.reduce.apply(null,[clojure.core._,clojure.lang.Numbers.minu //====== //(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_1032(){ -return (clojure.JS.def(clojure.core,"_LT_",clojure.JS.variadic(2,(function __clojure_core_fn_1032_LT_1037(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1038(){ +return (clojure.JS.def(clojure.core,"_LT_",clojure.JS.variadic(2,(function __clojure_core_fn_1038_LT_1043(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); @@ -451,8 +459,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.core.rest.apply(nu //====== //(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_1043(){ -return (clojure.JS.def(clojure.core,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1043_LT_EQ_1048(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1049(){ +return (clojure.JS.def(clojure.core,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1049_LT_EQ_1054(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); @@ -462,8 +470,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.core.rest.apply(n //====== //(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_1054(){ -return (clojure.JS.def(clojure.core,"_GT_",clojure.JS.variadic(2,(function __clojure_core_fn_1054_GT_1059(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1060(){ +return (clojure.JS.def(clojure.core,"_GT_",clojure.JS.variadic(2,(function __clojure_core_fn_1060_GT_1065(x_1,y_2){switch(arguments.length){ case 1:return (true) case 2:return (clojure.lang.Numbers.gt(x_1,y_2))} var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); @@ -473,8 +481,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.core.rest.apply(nu //====== //(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_1065(){ -return (clojure.JS.def(clojure.core,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1065_GT_EQ_1070(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1071(){ +return (clojure.JS.def(clojure.core,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1071_GT_EQ_1076(x_1,y_2){switch(arguments.length){ case 1:return (true) case 2:return (clojure.lang.Numbers.gte(x_1,y_2))} var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); @@ -484,8 +492,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.core.rest.apply(n //====== //(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_1076(){ -return (clojure.JS.def(clojure.core,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1076_EQ_EQ_1081(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1082(){ +return (clojure.JS.def(clojure.core,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1082_EQ_EQ_1087(x_1,y_2){switch(arguments.length){ case 1:return (true) case 2:return (clojure.lang.Numbers.equiv(x_1,y_2))} var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); @@ -495,8 +503,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.core.rest.apply //====== //(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_1087(){ -return (clojure.JS.def(clojure.core,"max",clojure.JS.variadic(2,(function __clojure_core_fn_1087_max_1089(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1093(){ +return (clojure.JS.def(clojure.core,"max",clojure.JS.variadic(2,(function __clojure_core_fn_1093_max_1095(x_1,y_2){switch(arguments.length){ case 1:return (x_1) case 2:return (((clojure.lang.Numbers.gt(x_1,y_2))?(x_1):(y_2)))} var more_3=clojure.JS.rest_args(this,arguments,2); @@ -505,8 +513,8 @@ return (clojure.core.reduce.apply(null,[clojure.core.max,clojure.core.max.apply( //====== //(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_1095(){ -return (clojure.JS.def(clojure.core,"min",clojure.JS.variadic(2,(function __clojure_core_fn_1095_min_1097(x_1,y_2){switch(arguments.length){ +(function __clojure_core_fn_1101(){ +return (clojure.JS.def(clojure.core,"min",clojure.JS.variadic(2,(function __clojure_core_fn_1101_min_1103(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); @@ -515,244 +523,244 @@ return (clojure.core.reduce.apply(null,[clojure.core.min,clojure.core.min.apply( //====== //(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_1103(){ -return (clojure.JS.def(clojure.core,"inc",(function __clojure_core_fn_1103_inc_1108(x_1){ +(function __clojure_core_fn_1109(){ +return (clojure.JS.def(clojure.core,"inc",(function __clojure_core_fn_1109_inc_1114(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_1112(){ -return (clojure.JS.def(clojure.core,"dec",(function __clojure_core_fn_1112_dec_1117(x_1){ +(function __clojure_core_fn_1118(){ +return (clojure.JS.def(clojure.core,"dec",(function __clojure_core_fn_1118_dec_1123(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_1121(){ -return (clojure.JS.def(clojure.core,"unchecked_inc",(function __clojure_core_fn_1121_unchecked_inc_1126(x_1){ +(function __clojure_core_fn_1127(){ +return (clojure.JS.def(clojure.core,"unchecked_inc",(function __clojure_core_fn_1127_unchecked_inc_1132(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_1130(){ -return (clojure.JS.def(clojure.core,"unchecked_dec",(function __clojure_core_fn_1130_unchecked_dec_1135(x_1){ +(function __clojure_core_fn_1136(){ +return (clojure.JS.def(clojure.core,"unchecked_dec",(function __clojure_core_fn_1136_unchecked_dec_1141(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_1139(){ -return (clojure.JS.def(clojure.core,"unchecked_negate",(function __clojure_core_fn_1139_unchecked_negate_1144(x_1){ +(function __clojure_core_fn_1145(){ +return (clojure.JS.def(clojure.core,"unchecked_negate",(function __clojure_core_fn_1145_unchecked_negate_1150(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_1148(){ -return (clojure.JS.def(clojure.core,"unchecked_add",(function __clojure_core_fn_1148_unchecked_add_1153(x_1,y_2){ +(function __clojure_core_fn_1154(){ +return (clojure.JS.def(clojure.core,"unchecked_add",(function __clojure_core_fn_1154_unchecked_add_1159(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_1157(){ -return (clojure.JS.def(clojure.core,"unchecked_subtract",(function __clojure_core_fn_1157_unchecked_subtract_1162(x_1,y_2){ +(function __clojure_core_fn_1163(){ +return (clojure.JS.def(clojure.core,"unchecked_subtract",(function __clojure_core_fn_1163_unchecked_subtract_1168(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_1166(){ -return (clojure.JS.def(clojure.core,"unchecked_multiply",(function __clojure_core_fn_1166_unchecked_multiply_1171(x_1,y_2){ +(function __clojure_core_fn_1172(){ +return (clojure.JS.def(clojure.core,"unchecked_multiply",(function __clojure_core_fn_1172_unchecked_multiply_1177(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_1175(){ -return (clojure.JS.def(clojure.core,"unchecked_divide",(function __clojure_core_fn_1175_unchecked_divide_1180(x_1,y_2){ +(function __clojure_core_fn_1181(){ +return (clojure.JS.def(clojure.core,"unchecked_divide",(function __clojure_core_fn_1181_unchecked_divide_1186(x_1,y_2){ return (clojure.lang.Numbers.unchecked_divide(x_1,y_2))})))}).apply(null,[]); //====== //(defn unchecked-remainder "Returns the remainder of 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_remainder)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_remainder x y))) //--- -(function __clojure_core_fn_1184(){ -return (clojure.JS.def(clojure.core,"unchecked_remainder",(function __clojure_core_fn_1184_unchecked_remainder_1189(x_1,y_2){ +(function __clojure_core_fn_1190(){ +return (clojure.JS.def(clojure.core,"unchecked_remainder",(function __clojure_core_fn_1190_unchecked_remainder_1195(x_1,y_2){ return (clojure.lang.Numbers.unchecked_remainder(x_1,y_2))})))}).apply(null,[]); //====== //(defn pos? "Returns true if num is greater than zero, else false" {:tag Boolean, :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/isPos)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isPos x))) //--- -(function __clojure_core_fn_1193(){ -return (clojure.JS.def(clojure.core,"pos_QMARK_",(function __clojure_core_fn_1193_pos_QMARK_1198(x_1){ +(function __clojure_core_fn_1199(){ +return (clojure.JS.def(clojure.core,"pos_QMARK_",(function __clojure_core_fn_1199_pos_QMARK_1204(x_1){ return (clojure.lang.Numbers.isPos(x_1))})))}).apply(null,[]); //====== //(defn neg? "Returns true if num is less than zero, else false" {:tag Boolean, :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/isNeg)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isNeg x))) //--- -(function __clojure_core_fn_1202(){ -return (clojure.JS.def(clojure.core,"neg_QMARK_",(function __clojure_core_fn_1202_neg_QMARK_1207(x_1){ +(function __clojure_core_fn_1208(){ +return (clojure.JS.def(clojure.core,"neg_QMARK_",(function __clojure_core_fn_1208_neg_QMARK_1213(x_1){ return (clojure.lang.Numbers.isNeg(x_1))})))}).apply(null,[]); //====== //(defn zero? "Returns true if num is zero, else false" {:tag Boolean, :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/isZero)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isZero x))) //--- -(function __clojure_core_fn_1211(){ -return (clojure.JS.def(clojure.core,"zero_QMARK_",(function __clojure_core_fn_1211_zero_QMARK_1216(x_1){ +(function __clojure_core_fn_1217(){ +return (clojure.JS.def(clojure.core,"zero_QMARK_",(function __clojure_core_fn_1217_zero_QMARK_1222(x_1){ return (clojure.lang.Numbers.isZero(x_1))})))}).apply(null,[]); //====== //(defn quot "quot[ient] of dividing numerator by denominator." [num div] (. clojure.lang.Numbers (quotient num div))) //--- -(function __clojure_core_fn_1220(){ -return (clojure.JS.def(clojure.core,"quot",(function __clojure_core_fn_1220_quot_1222(num_1,div_2){ +(function __clojure_core_fn_1226(){ +return (clojure.JS.def(clojure.core,"quot",(function __clojure_core_fn_1226_quot_1228(num_1,div_2){ return (clojure.lang.Numbers.quotient(num_1,div_2))})))}).apply(null,[]); //====== //(defn rem "remainder of dividing numerator by denominator." [num div] (. clojure.lang.Numbers (remainder num div))) //--- -(function __clojure_core_fn_1226(){ -return (clojure.JS.def(clojure.core,"rem",(function __clojure_core_fn_1226_rem_1228(num_1,div_2){ +(function __clojure_core_fn_1232(){ +return (clojure.JS.def(clojure.core,"rem",(function __clojure_core_fn_1232_rem_1234(num_1,div_2){ return (clojure.lang.Numbers.remainder(num_1,div_2))})))}).apply(null,[]); //====== //(defn rationalize "returns the rational value of num" [num] (. clojure.lang.Numbers (rationalize num))) //--- -(function __clojure_core_fn_1232(){ -return (clojure.JS.def(clojure.core,"rationalize",(function __clojure_core_fn_1232_rationalize_1234(num_1){ +(function __clojure_core_fn_1238(){ +return (clojure.JS.def(clojure.core,"rationalize",(function __clojure_core_fn_1238_rationalize_1240(num_1){ return (clojure.lang.Numbers.rationalize(num_1))})))}).apply(null,[]); //====== //(defn bit-not "Bitwise complement" {: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/not)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers not x)) //--- -(function __clojure_core_fn_1238(){ -return (clojure.JS.def(clojure.core,"bit_not",(function __clojure_core_fn_1238_bit_not_1243(x_1){ +(function __clojure_core_fn_1244(){ +return (clojure.JS.def(clojure.core,"bit_not",(function __clojure_core_fn_1244_bit_not_1249(x_1){ return (clojure.lang.Numbers.not(x_1))})))}).apply(null,[]); //====== //(defn bit-and "Bitwise and" {: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/and)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers and x y)) //--- -(function __clojure_core_fn_1247(){ -return (clojure.JS.def(clojure.core,"bit_and",(function __clojure_core_fn_1247_bit_and_1252(x_1,y_2){ +(function __clojure_core_fn_1253(){ +return (clojure.JS.def(clojure.core,"bit_and",(function __clojure_core_fn_1253_bit_and_1258(x_1,y_2){ return (clojure.lang.Numbers.and(x_1,y_2))})))}).apply(null,[]); //====== //(defn bit-or "Bitwise or" {: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/or)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers or x y)) //--- -(function __clojure_core_fn_1256(){ -return (clojure.JS.def(clojure.core,"bit_or",(function __clojure_core_fn_1256_bit_or_1261(x_1,y_2){ +(function __clojure_core_fn_1262(){ +return (clojure.JS.def(clojure.core,"bit_or",(function __clojure_core_fn_1262_bit_or_1267(x_1,y_2){ return (clojure.lang.Numbers.or(x_1,y_2))})))}).apply(null,[]); //====== //(defn bit-xor "Bitwise exclusive or" {: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/xor)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers xor x y)) //--- -(function __clojure_core_fn_1265(){ -return (clojure.JS.def(clojure.core,"bit_xor",(function __clojure_core_fn_1265_bit_xor_1270(x_1,y_2){ +(function __clojure_core_fn_1271(){ +return (clojure.JS.def(clojure.core,"bit_xor",(function __clojure_core_fn_1271_bit_xor_1276(x_1,y_2){ return (clojure.lang.Numbers.xor(x_1,y_2))})))}).apply(null,[]); //====== //(defn bit-and-not "Bitwise and with complement" [x y] (. clojure.lang.Numbers andNot x y)) //--- -(function __clojure_core_fn_1274(){ -return (clojure.JS.def(clojure.core,"bit_and_not",(function __clojure_core_fn_1274_bit_and_not_1276(x_1,y_2){ +(function __clojure_core_fn_1280(){ +return (clojure.JS.def(clojure.core,"bit_and_not",(function __clojure_core_fn_1280_bit_and_not_1282(x_1,y_2){ return (clojure.lang.Numbers.andNot(x_1,y_2))})))}).apply(null,[]); //====== //(defn bit-clear "Clear bit at index n" [x n] (. clojure.lang.Numbers clearBit x n)) //--- -(function __clojure_core_fn_1280(){ -return (clojure.JS.def(clojure.core,"bit_clear",(function __clojure_core_fn_1280_bit_clear_1282(x_1,n_2){ +(function __clojure_core_fn_1286(){ +return (clojure.JS.def(clojure.core,"bit_clear",(function __clojure_core_fn_1286_bit_clear_1288(x_1,n_2){ return (clojure.lang.Numbers.clearBit(x_1,n_2))})))}).apply(null,[]); //====== //(defn bit-set "Set bit at index n" [x n] (. clojure.lang.Numbers setBit x n)) //--- -(function __clojure_core_fn_1286(){ -return (clojure.JS.def(clojure.core,"bit_set",(function __clojure_core_fn_1286_bit_set_1288(x_1,n_2){ +(function __clojure_core_fn_1292(){ +return (clojure.JS.def(clojure.core,"bit_set",(function __clojure_core_fn_1292_bit_set_1294(x_1,n_2){ return (clojure.lang.Numbers.setBit(x_1,n_2))})))}).apply(null,[]); //====== //(defn bit-flip "Flip bit at index n" [x n] (. clojure.lang.Numbers flipBit x n)) //--- -(function __clojure_core_fn_1292(){ -return (clojure.JS.def(clojure.core,"bit_flip",(function __clojure_core_fn_1292_bit_flip_1294(x_1,n_2){ +(function __clojure_core_fn_1298(){ +return (clojure.JS.def(clojure.core,"bit_flip",(function __clojure_core_fn_1298_bit_flip_1300(x_1,n_2){ return (clojure.lang.Numbers.flipBit(x_1,n_2))})))}).apply(null,[]); //====== //(defn bit-test "Test bit at index n" [x n] (. clojure.lang.Numbers testBit x n)) //--- -(function __clojure_core_fn_1298(){ -return (clojure.JS.def(clojure.core,"bit_test",(function __clojure_core_fn_1298_bit_test_1300(x_1,n_2){ +(function __clojure_core_fn_1304(){ +return (clojure.JS.def(clojure.core,"bit_test",(function __clojure_core_fn_1304_bit_test_1306(x_1,n_2){ return (clojure.lang.Numbers.testBit(x_1,n_2))})))}).apply(null,[]); //====== //(defn bit-shift-left "Bitwise shift left" [x n] (. clojure.lang.Numbers shiftLeft x n)) //--- -(function __clojure_core_fn_1304(){ -return (clojure.JS.def(clojure.core,"bit_shift_left",(function __clojure_core_fn_1304_bit_shift_left_1306(x_1,n_2){ +(function __clojure_core_fn_1310(){ +return (clojure.JS.def(clojure.core,"bit_shift_left",(function __clojure_core_fn_1310_bit_shift_left_1312(x_1,n_2){ return (clojure.lang.Numbers.shiftLeft(x_1,n_2))})))}).apply(null,[]); //====== //(defn bit-shift-right "Bitwise shift right" [x n] (. clojure.lang.Numbers shiftRight x n)) //--- -(function __clojure_core_fn_1310(){ -return (clojure.JS.def(clojure.core,"bit_shift_right",(function __clojure_core_fn_1310_bit_shift_right_1312(x_1,n_2){ +(function __clojure_core_fn_1316(){ +return (clojure.JS.def(clojure.core,"bit_shift_right",(function __clojure_core_fn_1316_bit_shift_right_1318(x_1,n_2){ return (clojure.lang.Numbers.shiftRight(x_1,n_2))})))}).apply(null,[]); //====== //(defn even? "Returns true if n is even, throws an exception if n is not an integer" [n] (zero? (bit-and n 1))) //--- -(function __clojure_core_fn_1316(){ -return (clojure.JS.def(clojure.core,"even_QMARK_",(function __clojure_core_fn_1316_even_QMARK_1318(n_1){ +(function __clojure_core_fn_1322(){ +return (clojure.JS.def(clojure.core,"even_QMARK_",(function __clojure_core_fn_1322_even_QMARK_1324(n_1){ return (clojure.lang.Numbers.isZero(clojure.lang.Numbers.and(n_1,(1))))})))}).apply(null,[]); //====== //(defn odd? "Returns true if n is odd, throws an exception if n is not an integer" [n] (not (even? n))) //--- -(function __clojure_core_fn_1322(){ -return (clojure.JS.def(clojure.core,"odd_QMARK_",(function __clojure_core_fn_1322_odd_QMARK_1324(n_1){ +(function __clojure_core_fn_1328(){ +return (clojure.JS.def(clojure.core,"odd_QMARK_",(function __clojure_core_fn_1328_odd_QMARK_1330(n_1){ re |