ClojureScript: Add LazilyPersistentVector. Clean up hash and several vector functions.

3 files changed, 881 insertions, 806 deletions

diff --git a/clojurescript/boot.js b/clojurescript/boot.js
index ebd5b0da..018e18ff 100644
--- a/clojurescript/boot.js
+++ b/clojurescript/boot.js
@@ -107,7 +107,7 @@ return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentVector,x_1])
 //---
 (function __clojure_fn_2832(){
 return (clojure.JS.def(clojure,"sigs",(function __clojure_fn_2832_sigs_2834(fdecl_1){
-var fdecl_3,ret_2;
+var ret_2,fdecl_3;
 return (((clojure.seq_QMARK_.apply(null,[clojure.first.apply(null,[fdecl_1])]))?(((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY),
 (fdecl_3=fdecl_1);do{_cnt=0;
 _rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.conj.apply(null,[ret_2,clojure.first.apply(null,[clojure.first.apply(null,[fdecl_3])])]),clojure.rest.apply(null,[fdecl_3])],ret_2=_rtn[0],fdecl_3=_rtn[1])):(clojure.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})())):(clojure.list.apply(null,[clojure.first.apply(null,[fdecl_1])]))))})))}).apply(null,[]);
@@ -143,7 +143,7 @@ do{_cnt=0;_rtn=((clojure.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.rest.app
 //---
 (function __clojure_fn_2878(){
 return (clojure.JS.def(clojure,"butlast",(function __clojure_fn_2878_butlast_2880(s_1){
-var s_3,ret_2,butlast_0=arguments.callee;
+var ret_2,s_3,butlast_0=arguments.callee;
 return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY),
 (s_3=s_1);do{_cnt=0;
 _rtn=((clojure.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.conj.apply(null,[ret_2,clojure.first.apply(null,[s_3])]),clojure.rest.apply(null,[s_3])],ret_2=_rtn[0],s_3=_rtn[1])):(clojure.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})()))})))}).apply(null,[]);
@@ -156,19 +156,13 @@ _rtn=((clojure.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.conj.apply(null,[r
 (function __clojure_fn_2897(){
 return (clojure.JS.def(clojure,"cast",(function __clojure_fn_2897_cast_2899(c_1,x_2){
 return ((c_1).cast(x_2))})))}).apply(null,[]);
-
-//======
-//(defn to-array "Returns an array of Objects containing the contents of coll, which\n  can be any Collection.  Maps to java.util.Collection.toArray()." [coll] (. clojure.lang.RT (toArray coll)))
-//---
-(function __clojure_fn_2909(){
-return (clojure.JS.def(clojure,"to_array",(function __clojure_fn_2909_to_array_2911(coll_1){
-return (clojure.lang.RT.toArray(coll_1))})))}).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_fn_2922(){
-return (clojure.JS.def(clojure,"vector",clojure.JS.variadic(0,(function __clojure_fn_2922_vector_2924(){switch(arguments.length){
+(function __clojure_fn_2916(){
+return (clojure.JS.def(clojure,"vector",clojure.JS.variadic(0,(function __clojure_fn_2916_vector_2918(){switch(arguments.length){
 case 0:return (clojure.lang.PersistentVector.EMPTY)}
 var args_1,args_1=clojure.JS.rest_args(this,arguments,0);
 return (clojure.lang.LazilyPersistentVector.create(args_1))}))))}).apply(null,[]);
@@ -176,16 +170,16 @@ return (clojure.lang.LazilyPersistentVector.create(args_1))}))))}).apply(null,[]
 //======
 //(defn vec "Creates a new vector containing the contents of coll." ([coll] (. clojure.lang.LazilyPersistentVector (createOwning (to-array coll)))))
 //---
-(function __clojure_fn_2935(){
-return (clojure.JS.def(clojure,"vec",(function __clojure_fn_2935_vec_2937(coll_1){
+(function __clojure_fn_2929(){
+return (clojure.JS.def(clojure,"vec",(function __clojure_fn_2929_vec_2931(coll_1){
 return (clojure.lang.LazilyPersistentVector.createOwning(clojure.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_fn_2955(){
-return (clojure.JS.def(clojure,"hash_set",clojure.JS.variadic(0,(function __clojure_fn_2955_hash_set_2957(){switch(arguments.length){
+(function __clojure_fn_2949(){
+return (clojure.JS.def(clojure,"hash_set",clojure.JS.variadic(0,(function __clojure_fn_2949_hash_set_2951(){switch(arguments.length){
 case 0:return (clojure.lang.PersistentHashSet.EMPTY)}
 var keys_1,keys_1=clojure.JS.rest_args(this,arguments,0);
 return (clojure.lang.PersistentHashSet.create(keys_1))}))))}).apply(null,[]);
@@ -193,24 +187,24 @@ return (clojure.lang.PersistentHashSet.create(keys_1))}))))}).apply(null,[]);
 //======
 //(defn sorted-map "keyval => key val\n  Returns a new sorted map with supplied mappings." ([& keyvals] (. clojure.lang.PersistentTreeMap (create keyvals))))
 //---
-(function __clojure_fn_2968(){
-return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variadic(0,(function __clojure_fn_2968_sorted_map_2970(){
+(function __clojure_fn_2962(){
+return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variadic(0,(function __clojure_fn_2962_sorted_map_2964(){
 var keyvals_1,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_fn_2980(){
-return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variadic(0,(function __clojure_fn_2980_sorted_set_2982(){
+(function __clojure_fn_2974(){
+return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variadic(0,(function __clojure_fn_2974_sorted_set_2976(){
 var keys_1,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_fn_2992(){
-return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_fn_2992_sorted_map_by_2994(comparator_1){
+(function __clojure_fn_2986(){
+return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_fn_2986_sorted_map_by_2988(comparator_1){
 var keyvals_2,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/defn) (cons name args)) (list (quote .) (list (quote var) name) (quote (setMacro))))))
@@ -221,39 +215,39 @@ return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))}))))}).ap
 //======
 //(defn nil? "Returns true if x is nil, false otherwise." {:tag Boolean} [x] (identical? x nil))
 //---
-(function __clojure_fn_3025(){
-return (clojure.JS.def(clojure,"nil_QMARK_",(function __clojure_fn_3025_nil_QMARK_3027(x_1){
+(function __clojure_fn_3019(){
+return (clojure.JS.def(clojure,"nil_QMARK_",(function __clojure_fn_3019_nil_QMARK_3021(x_1){
 return (clojure.identical_QMARK_.apply(null,[x_1,null]))})))}).apply(null,[]);
 
 //======
 //(defn false? "Returns true if x is the value false, false otherwise." {:tag Boolean} [x] (identical? x false))
 //---
-(function __clojure_fn_3037(){
-return (clojure.JS.def(clojure,"false_QMARK_",(function __clojure_fn_3037_false_QMARK_3039(x_1){
+(function __clojure_fn_3031(){
+return (clojure.JS.def(clojure,"false_QMARK_",(function __clojure_fn_3031_false_QMARK_3033(x_1){
 return (clojure.identical_QMARK_.apply(null,[x_1,false]))})))}).apply(null,[]);
 
 //======
 //(defn true? "Returns true if x is the value true, false otherwise." {:tag Boolean} [x] (identical? x true))
 //---
-(function __clojure_fn_3049(){
-return (clojure.JS.def(clojure,"true_QMARK_",(function __clojure_fn_3049_true_QMARK_3051(x_1){
+(function __clojure_fn_3043(){
+return (clojure.JS.def(clojure,"true_QMARK_",(function __clojure_fn_3043_true_QMARK_3045(x_1){
 return (clojure.identical_QMARK_.apply(null,[x_1,true]))})))}).apply(null,[]);
 
 //======
 //(defn not "Returns true if x is logical false, false otherwise." {:tag Boolean} [x] (if x false true))
 //---
-(function __clojure_fn_3061(){
-return (clojure.JS.def(clojure,"not",(function __clojure_fn_3061_not_3063(x_1){
+(function __clojure_fn_3055(){
+return (clojure.JS.def(clojure,"not",(function __clojure_fn_3055_not_3057(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] (loop [sb (clojure.lang.RT/makeStringBuilder (str x)) more ys] (if more (recur (. sb (append (str (first more)))) (rest more)) (str sb)))))
 //---
-(function __clojure_fn_3075(){
-return (clojure.JS.def(clojure,"str",clojure.JS.variadic(1,(function __clojure_fn_3075_str_3077(x_1){switch(arguments.length){
+(function __clojure_fn_3069(){
+return (clojure.JS.def(clojure,"str",clojure.JS.variadic(1,(function __clojure_fn_3069_str_3071(x_1){switch(arguments.length){
 case 1:return (((clojure.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString())))
 case 0:return ("")}
-var ys_2,sb_3,more_4,ys_2=clojure.JS.rest_args(this,arguments,1);
+var sb_3,ys_2,more_4,ys_2=clojure.JS.rest_args(this,arguments,1);
 return (((function __loop(){var _rtn,_cnt;(sb_3=clojure.lang.RT.makeStringBuilder(clojure.str.apply(null,[x_1]))),
 (more_4=ys_2);do{_cnt=0;
 _rtn=((more_4)?((_cnt=1,_rtn=[(sb_3).append(clojure.str.apply(null,[clojure.first.apply(null,[more_4])])),clojure.rest.apply(null,[more_4])],sb_3=_rtn[0],more_4=_rtn[1])):(clojure.str.apply(null,[sb_3])))}while(_cnt);return _rtn;})()))}))))}).apply(null,[]);
@@ -261,8 +255,8 @@ _rtn=((more_4)?((_cnt=1,_rtn=[(sb_3).append(clojure.str.apply(null,[clojure.firs
 //======
 //(defn symbol "Returns a Symbol with the given namespace and name." ([name] (. clojure.lang.Symbol (intern name))) ([ns name] (. clojure.lang.Symbol (intern ns name))))
 //---
-(function __clojure_fn_3090(){
-return (clojure.JS.def(clojure,"symbol",(function __clojure_fn_3090_symbol_3092(ns_1,name_2){switch(arguments.length){
+(function __clojure_fn_3084(){
+return (clojure.JS.def(clojure,"symbol",(function __clojure_fn_3084_symbol_3086(ns_1,name_2){switch(arguments.length){
 case 1:var name_1=arguments[0];
 return (clojure.lang.Symbol.intern(name_1))}
 return (clojure.lang.Symbol.intern(ns_1,name_2))})))}).apply(null,[]);
@@ -270,8 +264,8 @@ return (clojure.lang.Symbol.intern(ns_1,name_2))})))}).apply(null,[]);
 //======
 //(defn keyword "Returns a Keyword with the given namespace and name.  Do not use :\n  in the keyword strings, it will be added automatically." ([name] (. clojure.lang.Keyword (intern nil name))) ([ns name] (. clojure.lang.Keyword (intern ns name))))
 //---
-(function __clojure_fn_3104(){
-return (clojure.JS.def(clojure,"keyword",(function __clojure_fn_3104_keyword_3106(ns_1,name_2){switch(arguments.length){
+(function __clojure_fn_3098(){
+return (clojure.JS.def(clojure,"keyword",(function __clojure_fn_3098_keyword_3100(ns_1,name_2){switch(arguments.length){
 case 1:var name_1=arguments[0];
 return (clojure.lang.Keyword.intern(null,name_1))}
 return (clojure.lang.Keyword.intern(ns_1,name_2))})))}).apply(null,[]);
@@ -279,8 +273,8 @@ return (clojure.lang.Keyword.intern(ns_1,name_2))})))}).apply(null,[]);
 //======
 //(defn gensym "Returns a new symbol with a unique name. If a prefix string is\n  supplied, the name is prefix# where # is some unique number. If\n  prefix is not supplied, the prefix is 'G'." ([] (gensym "G__")) ([prefix-string] (. clojure.lang.Symbol (intern (str prefix-string (str (. clojure.lang.RT (nextID))))))))
 //---
-(function __clojure_fn_3118(){
-return (clojure.JS.def(clojure,"gensym",(function __clojure_fn_3118_gensym_3120(prefix_string_1){switch(arguments.length){
+(function __clojure_fn_3112(){
+return (clojure.JS.def(clojure,"gensym",(function __clojure_fn_3112_gensym_3114(prefix_string_1){switch(arguments.length){
 case 0:return (clojure.gensym.apply(null,["G__"]))}
 return (clojure.lang.Symbol.intern(clojure.str.apply(null,[prefix_string_1,clojure.str.apply(null,[clojure.lang.RT.nextID()])])))})))}).apply(null,[]);
 // 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 cond) (rest (rest clauses))))))
@@ -288,16 +282,16 @@ return (clojure.lang.Symbol.intern(clojure.str.apply(null,[prefix_string_1,cloju
 //======
 //(defn spread {:private true} [arglist] (cond (nil? arglist) nil (nil? (rest arglist)) (seq (first arglist)) :else (cons (first arglist) (spread (rest arglist)))))
 //---
-(function __clojure_fn_3137(){
-return (clojure.JS.def(clojure,"spread",(function __clojure_fn_3137_spread_3139(arglist_1){
+(function __clojure_fn_3131(){
+return (clojure.JS.def(clojure,"spread",(function __clojure_fn_3131_spread_3133(arglist_1){
 return (((clojure.nil_QMARK_.apply(null,[arglist_1]))?(null):(((clojure.nil_QMARK_.apply(null,[clojure.rest.apply(null,[arglist_1])]))?(clojure.seq.apply(null,[clojure.first.apply(null,[arglist_1])])):(((clojure.keyword("","else"))?(clojure.cons.apply(null,[clojure.first.apply(null,[arglist_1]),clojure.spread.apply(null,[clojure.rest.apply(null,[arglist_1])])])):(null)))))))})))}).apply(null,[]);
 // 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_fn_3155(){
-return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variadic(1,(function __clojure_fn_3155_list_STAR_3157(item_1){
+(function __clojure_fn_3149(){
+return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variadic(1,(function __clojure_fn_3149_list_STAR_3151(item_1){
 var more_2,more_2=clojure.JS.rest_args(this,arguments,1);
 return (clojure.spread.apply(null,[clojure.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/fn) [] body)))
@@ -305,56 +299,56 @@ return (clojure.spread.apply(null,[clojure.cons.apply(null,[item_1,more_2])]))})
 //======
 //(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x))
 //---
-(function __clojure_fn_3173(){
-return (clojure.JS.def(clojure,"delay_QMARK_",(function __clojure_fn_3173_delay_QMARK_3175(x_1){
+(function __clojure_fn_3167(){
+return (clojure.JS.def(clojure,"delay_QMARK_",(function __clojure_fn_3167_delay_QMARK_3169(x_1){
 return (clojure.instance_QMARK_.apply(null,[clojure.lang.Delay,x_1]))})))}).apply(null,[]);
 
 //======
 //(defn force "If x is a Delay, returns the (possibly cached) value of its expression, else returns x" [x] (. clojure.lang.Delay (force x)))
 //---
-(function __clojure_fn_3185(){
-return (clojure.JS.def(clojure,"force",(function __clojure_fn_3185_force_3187(x_1){
+(function __clojure_fn_3179(){
+return (clojure.JS.def(clojure,"force",(function __clojure_fn_3179_force_3181(x_1){
 return (clojure.lang.Delay.force(x_1))})))}).apply(null,[]);
 
 //======
 //(defn fnseq "Returns a seq object whose first is first and whose rest is the\n  value produced by calling restfn with no arguments. restfn will be\n  called at most once per step in the sequence, e.g. calling rest\n  repeatedly on the head of the seq calls restfn once - the value it\n  yields is cached." [first restfn] (new clojure.lang.FnSeq first restfn))
 //---
-(function __clojure_fn_3197(){
-return (clojure.JS.def(clojure,"fnseq",(function __clojure_fn_3197_fnseq_3199(first_1,restfn_2){
+(function __clojure_fn_3191(){
+return (clojure.JS.def(clojure,"fnseq",(function __clojure_fn_3191_fnseq_3193(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/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_fn_3215(){
-return (clojure.JS.def(clojure,"cache_seq",(function __clojure_fn_3215_cache_seq_3217(s_1){
+(function __clojure_fn_3209(){
+return (clojure.JS.def(clojure,"cache_seq",(function __clojure_fn_3209_cache_seq_3211(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_fn_3242(){
-return (clojure.JS.def(clojure,"concat",clojure.JS.variadic(2,(function __clojure_fn_3242_concat_3244(x_1,y_2){switch(arguments.length){
-case 2:return (((clojure.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3242_concat_3244_fn_3249(G__3248_1){switch(arguments.length){
+(function __clojure_fn_3236(){
+return (clojure.JS.def(clojure,"concat",clojure.JS.variadic(2,(function __clojure_fn_3236_concat_3238(x_1,y_2){switch(arguments.length){
+case 2:return (((clojure.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3236_concat_3238_fn_3243(G__3242_1){switch(arguments.length){
 case 0:return (clojure.first.apply(null,[x_1]))}
 return (clojure.concat.apply(null,[clojure.rest.apply(null,[x_1]),y_2]))})))):(clojure.seq.apply(null,[y_2]))))
 case 1:return (clojure.seq.apply(null,[x_1]))
 case 0:return (null)}
 var zs_3,cat_4,zs_3=clojure.JS.rest_args(this,arguments,2);
-return (((cat_4=(function __clojure_fn_3242_concat_3244_cat_3254(xys_1,zs_2){
+return (((cat_4=(function __clojure_fn_3236_concat_3238_cat_3248(xys_1,zs_2){
 var _cnt,_rtn,cat_0=arguments.callee;
-do{_cnt=0;_rtn=((clojure.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3242_concat_3244_cat_3254_fn_3256(G__3255_1){switch(arguments.length){
+do{_cnt=0;_rtn=((clojure.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3236_concat_3238_cat_3248_fn_3250(G__3249_1){switch(arguments.length){
 case 0:return (clojure.first.apply(null,[xys_1]))}
 return (cat_0.apply(null,[clojure.rest.apply(null,[xys_1]),zs_2]))})))):(((zs_2)?((_cnt=1,_rtn=[clojure.first.apply(null,[zs_2]),clojure.rest.apply(null,[zs_2])],xys_1=_rtn[0],zs_2=_rtn[1])):(null))))
 }while(_cnt);return _rtn;})),
 cat_4.apply(null,[clojure.concat.apply(null,[x_1,y_2]),zs_3])))}))))}).apply(null,[]);
 
 //======
-//(defn = "Equality. Returns true if x equals y, false if not. Same as\n  Java x.equals(y) except it also works for nil, and compares\n  numbers in a type-independent manner.  Clojure's immutable data\n  structures define equals() (and thus =) as a value, not an identity,\n  comparison." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Util)) (clojure/list (quote clojure/equal)) (clojure/list x) (clojure/list y))), :inline-arities #{2}, :tag Boolean} ([x] true) ([x y] (. clojure.lang.Util (equal x y))) ([x y & more] (if (= x y) (if (rest more) (recur y (first more) (rest more)) (= y (first more))) false)))
+//(defn = "Equality. Returns true if x equals y, false if not. Same as\n  Java x.equals(y) except it also works for nil, and compares\n  numbers in a type-independent manner.  Clojure's immutable data\n  structures define equals() (and thus =) as a value, not an identity,\n  comparison." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Util)) (clojure/list (quote clojure/equal)) (clojure/list x) (clojure/list y))), :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_fn_3274(){
-return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3274_EQ_3279(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3268(){
+return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3268_EQ_3273(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Util.equal(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -364,8 +358,8 @@ do{_cnt=0;_rtn=((clojure.lang.Util.equal(x_1,y_2))?(((clojure.rest.apply(null,[m
 //======
 //(defn not= "Same as (not (= obj1 obj2))" {:tag Boolean} ([x] false) ([x y] (not (= x y))) ([x y & more] (not (apply = x y more))))
 //---
-(function __clojure_fn_3293(){
-return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3293_not_EQ_3295(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3287(){
+return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3287_not_EQ_3289(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.not.apply(null,[clojure.lang.Util.equal(x_1,y_2)]))
 case 1:return (false)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -374,23 +368,23 @@ return (clojure.not.apply(null,[clojure.apply.apply(null,[clojure._EQ_,x_1,y_2,m
 //======
 //(defn compare "Comparator. Returns 0 if x equals y, -1 if x is logically 'less\n  than' y, else 1. Same as Java x.compareTo(y) except it also works\n  for nil, and compares numbers in a type-independent manner. x must\n  implement Comparable" {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Util)) (clojure/list (quote clojure/compare)) (clojure/list x) (clojure/list y))), :tag Integer} [x y] (. clojure.lang.Util (compare x y)))
 //---
-(function __clojure_fn_3310(){
-return (clojure.JS.def(clojure,"compare",(function __clojure_fn_3310_compare_3315(x_1,y_2){
+(function __clojure_fn_3304(){
+return (clojure.JS.def(clojure,"compare",(function __clojure_fn_3304_compare_3309(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/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote and__3319)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote and__3319)) (clojure/list (clojure/concat (clojure/list (quote clojure/and)) rest)) (clojure/list (quote and__3319)))))))
-// 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/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote or__3328)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote or__3328)) (clojure/list (quote or__3328)) (clojure/list (clojure/concat (clojure/list (quote clojure/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/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote and__3313)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote and__3313)) (clojure/list (clojure/concat (clojure/list (quote clojure/and)) rest)) (clojure/list (quote and__3313)))))))
+// 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/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote or__3322)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote or__3322)) (clojure/list (quote or__3322)) (clojure/list (clojure/concat (clojure/list (quote clojure/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_fn_3347(){
-return (clojure.JS.def(clojure,"reduce",(function __clojure_fn_3347_reduce_3349(f_1,val_2,coll_3){switch(arguments.length){
+(function __clojure_fn_3341(){
+return (clojure.JS.def(clojure,"reduce",(function __clojure_fn_3341_reduce_3343(f_1,val_2,coll_3){switch(arguments.length){
 case 2:var s_3,coll_2=arguments[1];
 return (((s_3=clojure.seq.apply(null,[coll_2])),
 ((s_3)?(((clojure.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_3]))?((s_3).reduce(f_1)):(clojure.reduce.apply(null,[f_1,clojure.first.apply(null,[s_3]),clojure.rest.apply(null,[s_3])])))):(f_1.apply(null,[])))))}
 var s_4;
 return (((s_4=clojure.seq.apply(null,[coll_3])),
-((clojure.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_fn_3347_reduce_3349_fn_3352(f_1,val_2,s_3){
+((clojure.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_fn_3341_reduce_3343_fn_3346(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.first.apply(null,[s_3])]),clojure.rest.apply(null,[s_3])],f_1=_rtn[0],val_2=_rtn[1],s_3=_rtn[2])):(val_2))
 }while(_cnt);return _rtn;}).apply(null,[f_1,val_2,s_4])))))})))}).apply(null,[]);
@@ -398,15 +392,15 @@ do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1.apply(null,[val_2,clojure.first.app
 //======
 //(defn reverse "Returns a seq of the items in coll in reverse order. Not lazy." [coll] (reduce conj nil coll))
 //---
-(function __clojure_fn_3363(){
-return (clojure.JS.def(clojure,"reverse",(function __clojure_fn_3363_reverse_3365(coll_1){
+(function __clojure_fn_3357(){
+return (clojure.JS.def(clojure,"reverse",(function __clojure_fn_3357_reverse_3359(coll_1){
 return (clojure.reduce.apply(null,[clojure.conj,null,coll_1]))})))}).apply(null,[]);
 
 //======
 //(defn + "Returns the sum of nums. (+) returns 0." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/add)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 0) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (add x y))) ([x y & more] (reduce + (+ x y) more)))
 //---
-(function __clojure_fn_3381(){
-return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variadic(2,(function __clojure_fn_3381_PLUS_3386(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3375(){
+return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variadic(2,(function __clojure_fn_3375_PLUS_3380(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.add(x_1,y_2))
 case 1:return (clojure.lang.RT.numberCast(x_1))
 case 0:return (0)}
@@ -416,8 +410,8 @@ return (clojure.reduce.apply(null,[clojure._PLUS_,clojure.lang.Numbers.add(x_1,y
 //======
 //(defn * "Returns the product of nums. (*) returns 1." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/multiply)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 1) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more)))
 //---
-(function __clojure_fn_3405(){
-return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variadic(2,(function __clojure_fn_3405_STAR_3410(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3399(){
+return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variadic(2,(function __clojure_fn_3399_STAR_3404(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))
 case 1:return (clojure.lang.RT.numberCast(x_1))
 case 0:return (1)}
@@ -427,8 +421,8 @@ return (clojure.reduce.apply(null,[clojure._STAR_,clojure.lang.Numbers.multiply(
 //======
 //(defn / "If no denominators are supplied, returns 1/numerator,\n  else returns numerator divided by all of the denominators." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/divide)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] (/ 1 x)) ([x y] (. clojure.lang.Numbers (divide x y))) ([x y & more] (reduce / (/ x y) more)))
 //---
-(function __clojure_fn_3428(){
-return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variadic(2,(function __clojure_fn_3428_SLASH_3433(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3422(){
+return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variadic(2,(function __clojure_fn_3422_SLASH_3427(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.divide(x_1,y_2))
 case 1:return (clojure.lang.Numbers.divide(1,x_1))}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -437,8 +431,8 @@ return (clojure.reduce.apply(null,[clojure._SLASH_,clojure.lang.Numbers.divide(x
 //======
 //(defn - "If no ys are supplied, returns the negation of x, else subtracts\n  the ys from x and returns the result." {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/minus)) args)))), :inline-arities #{1 2}} ([x] (. clojure.lang.Numbers (minus x))) ([x y] (. clojure.lang.Numbers (minus x y))) ([x y & more] (reduce - (- x y) more)))
 //---
-(function __clojure_fn_3450(){
-return (clojure.JS.def(clojure,"_",clojure.JS.variadic(2,(function __clojure_fn_3450_3455(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3444(){
+return (clojure.JS.def(clojure,"_",clojure.JS.variadic(2,(function __clojure_fn_3444_3449(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.minus(x_1,y_2))
 case 1:return (clojure.lang.Numbers.minus(x_1))}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -447,8 +441,8 @@ return (clojure.reduce.apply(null,[clojure._,clojure.lang.Numbers.minus(x_1,y_2)
 //======
 //(defn < "Returns non-nil if nums are in monotonically increasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/lt)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lt x y))) ([x y & more] (if (< x y) (if (rest more) (recur y (first more) (rest more)) (< y (first more))) false)))
 //---
-(function __clojure_fn_3472(){
-return (clojure.JS.def(clojure,"_LT_",clojure.JS.variadic(2,(function __clojure_fn_3472_LT_3477(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3466(){
+return (clojure.JS.def(clojure,"_LT_",clojure.JS.variadic(2,(function __clojure_fn_3466_LT_3471(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.lt(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -458,8 +452,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.rest.apply(null,[m
 //======
 //(defn <= "Returns non-nil if nums are in monotonically non-decreasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/lte)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lte x y))) ([x y & more] (if (<= x y) (if (rest more) (recur y (first more) (rest more)) (<= y (first more))) false)))
 //---
-(function __clojure_fn_3494(){
-return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3494_LT_EQ_3499(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3488(){
+return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3488_LT_EQ_3493(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.lte(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -469,8 +463,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.rest.apply(null,[
 //======
 //(defn > "Returns non-nil if nums are in monotonically decreasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/gt)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gt x y))) ([x y & more] (if (> x y) (if (rest more) (recur y (first more) (rest more)) (> y (first more))) false)))
 //---
-(function __clojure_fn_3516(){
-return (clojure.JS.def(clojure,"_GT_",clojure.JS.variadic(2,(function __clojure_fn_3516_GT_3521(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3510(){
+return (clojure.JS.def(clojure,"_GT_",clojure.JS.variadic(2,(function __clojure_fn_3510_GT_3515(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.gt(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -480,8 +474,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.rest.apply(null,[m
 //======
 //(defn >= "Returns non-nil if nums are in monotonically non-increasing order,\n  otherwise false." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/gte)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gte x y))) ([x y & more] (if (>= x y) (if (rest more) (recur y (first more) (rest more)) (>= y (first more))) false)))
 //---
-(function __clojure_fn_3538(){
-return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3538_GT_EQ_3543(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3532(){
+return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3532_GT_EQ_3537(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.gte(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -491,8 +485,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.rest.apply(null,[
 //======
 //(defn == "Returns non-nil if nums all have the same value, otherwise false" {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/equiv)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (equiv x y))) ([x y & more] (if (== x y) (if (rest more) (recur y (first more) (rest more)) (== y (first more))) false)))
 //---
-(function __clojure_fn_3560(){
-return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3560_EQ_EQ_3565(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3554(){
+return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3554_EQ_EQ_3559(x_1,y_2){switch(arguments.length){
 case 2:return (clojure.lang.Numbers.equiv(x_1,y_2))
 case 1:return (true)}
 var _cnt,_rtn,more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -502,8 +496,8 @@ do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.rest.apply(null
 //======
 //(defn max "Returns the greatest of the nums." ([x] x) ([x y] (if (> x y) x y)) ([x y & more] (reduce max (max x y) more)))
 //---
-(function __clojure_fn_3579(){
-return (clojure.JS.def(clojure,"max",clojure.JS.variadic(2,(function __clojure_fn_3579_max_3581(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3573(){
+return (clojure.JS.def(clojure,"max",clojure.JS.variadic(2,(function __clojure_fn_3573_max_3575(x_1,y_2){switch(arguments.length){
 case 2:return (((clojure.lang.Numbers.gt(x_1,y_2))?(x_1):(y_2)))
 case 1:return (x_1)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -512,8 +506,8 @@ return (clojure.reduce.apply(null,[clojure.max,clojure.max.apply(null,[x_1,y_2])
 //======
 //(defn min "Returns the least of the nums." ([x] x) ([x y] (if (< x y) x y)) ([x y & more] (reduce min (min x y) more)))
 //---
-(function __clojure_fn_3595(){
-return (clojure.JS.def(clojure,"min",clojure.JS.variadic(2,(function __clojure_fn_3595_min_3597(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3589(){
+return (clojure.JS.def(clojure,"min",clojure.JS.variadic(2,(function __clojure_fn_3589_min_3591(x_1,y_2){switch(arguments.length){
 case 2:return (((clojure.lang.Numbers.lt(x_1,y_2))?(x_1):(y_2)))
 case 1:return (x_1)}
 var more_3,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -522,237 +516,237 @@ return (clojure.reduce.apply(null,[clojure.min,clojure.min.apply(null,[x_1,y_2])
 //======
 //(defn inc "Returns a number one greater than num." {:inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/inc)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (inc x)))
 //---
-(function __clojure_fn_3612(){
-return (clojure.JS.def(clojure,"inc",(function __clojure_fn_3612_inc_3617(x_1){
+(function __clojure_fn_3606(){
+return (clojure.JS.def(clojure,"inc",(function __clojure_fn_3606_inc_3611(x_1){
 return (clojure.lang.Numbers.inc(x_1))})))}).apply(null,[]);
 
 //======
 //(defn dec "Returns a number one less than num." {:inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/dec)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (dec x)))
 //---
-(function __clojure_fn_3630(){
-return (clojure.JS.def(clojure,"dec",(function __clojure_fn_3630_dec_3635(x_1){
+(function __clojure_fn_3624(){
+return (clojure.JS.def(clojure,"dec",(function __clojure_fn_3624_dec_3629(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_inc)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (unchecked_inc x)))
 //---
-(function __clojure_fn_3648(){
-return (clojure.JS.def(clojure,"unchecked_inc",(function __clojure_fn_3648_unchecked_inc_3653(x_1){
+(function __clojure_fn_3642(){
+return (clojure.JS.def(clojure,"unchecked_inc",(function __clojure_fn_3642_unchecked_inc_3647(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_dec)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (unchecked_dec x)))
 //---
-(function __clojure_fn_3666(){
-return (clojure.JS.def(clojure,"unchecked_dec",(function __clojure_fn_3666_unchecked_dec_3671(x_1){
+(function __clojure_fn_3660(){
+return (clojure.JS.def(clojure,"unchecked_dec",(function __clojure_fn_3660_unchecked_dec_3665(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_negate)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (unchecked_negate x)))
 //---
-(function __clojure_fn_3684(){
-return (clojure.JS.def(clojure,"unchecked_negate",(function __clojure_fn_3684_unchecked_negate_3689(x_1){
+(function __clojure_fn_3678(){
+return (clojure.JS.def(clojure,"unchecked_negate",(function __clojure_fn_3678_unchecked_negate_3683(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_add)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_add x y)))
 //---
-(function __clojure_fn_3702(){
-return (clojure.JS.def(clojure,"unchecked_add",(function __clojure_fn_3702_unchecked_add_3707(x_1,y_2){
+(function __clojure_fn_3696(){
+return (clojure.JS.def(clojure,"unchecked_add",(function __clojure_fn_3696_unchecked_add_3701(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_subtract)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_subtract x y)))
 //---
-(function __clojure_fn_3720(){
-return (clojure.JS.def(clojure,"unchecked_subtract",(function __clojure_fn_3720_unchecked_subtract_3725(x_1,y_2){
+(function __clojure_fn_3714(){
+return (clojure.JS.def(clojure,"unchecked_subtract",(function __clojure_fn_3714_unchecked_subtract_3719(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_multiply)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_multiply x y)))
 //---
-(function __clojure_fn_3738(){
-return (clojure.JS.def(clojure,"unchecked_multiply",(function __clojure_fn_3738_unchecked_multiply_3743(x_1,y_2){
+(function __clojure_fn_3732(){
+return (clojure.JS.def(clojure,"unchecked_multiply",(function __clojure_fn_3732_unchecked_multiply_3737(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked_divide)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_divide x y)))
 //---
-(function __clojure_fn_3756(){
-return (clojure.JS.def(clojure,"unchec