aboutsummaryrefslogtreecommitdiff
path: root/clojurescript
diff options
context:
space:
mode:
authorChouser <chouser@n01se.net>2008-10-16 03:28:58 +0000
committerChouser <chouser@n01se.net>2008-10-16 03:28:58 +0000
commit7194e3d2c4d031339bd12bf1963384c41a25d21d (patch)
treefdccf568a833eb0fe127859eedba7b4de54c0254 /clojurescript
parentba31da0866de0a825ac2a7d7ddeec7b145ddfd63 (diff)
ClojureScript: simple browser-based repl now functional.
Diffstat (limited to 'clojurescript')
-rw-r--r--clojurescript/boot.js2072
-rw-r--r--clojurescript/clj.js7
-rw-r--r--clojurescript/test.html57
-rw-r--r--clojurescript/tojs.clj25
4 files changed, 1114 insertions, 1047 deletions
diff --git a/clojurescript/boot.js b/clojurescript/boot.js
index 780c4cd9..0a8175ac 100644
--- a/clojurescript/boot.js
+++ b/clojurescript/boot.js
@@ -2,20 +2,20 @@
//======
//(in-ns (quote clojure))
//---
-(function __tmp_fn_2757(){
+(function __user_fn_2766(){
return (clojure.in_ns.apply(null,["'clojure"]))}).apply(null,[]);
//======
//(def list (. clojure.lang.PersistentList creator))
//---
-(function __clojure_fn_2766(){
+(function __clojure_fn_2772(){
return (clojure.JS.def(clojure,"list",clojure.lang.PersistentList.creator))}).apply(null,[]);
//======
//(def cons (fn* cons [x seq] (. clojure.lang.RT (cons x seq))))
//---
-(function __clojure_fn_2774(){
-return (clojure.JS.def(clojure,"cons",(function __clojure_fn_2774_cons_2776(x_1,seq_2){
+(function __clojure_fn_2775(){
+return (clojure.JS.def(clojure,"cons",(function __clojure_fn_2775_cons_2777(x_1,seq_2){
var cons_0=arguments.callee;
return (clojure.lang.RT.cons(x_1,seq_2))})))}).apply(null,[]);
// Skipping: (def let (fn* let [& decl] (cons (quote let*) decl)))
@@ -27,8 +27,8 @@ return (clojure.lang.RT.cons(x_1,seq_2))})))}).apply(null,[]);
//======
//(def conj (fn conj ([coll x] (. clojure.lang.RT (conj coll x))) ([coll x & xs] (if xs (recur (conj coll x) (first xs) (rest xs)) (conj coll x)))))
//---
-(function __clojure_fn_2809(){
-return (clojure.JS.def(clojure,"conj",clojure.JS.variadic(2,(function __clojure_fn_2809_conj_2811(coll_1,x_2){switch(arguments.length){
+(function __clojure_fn_2805(){
+return (clojure.JS.def(clojure,"conj",clojure.JS.variadic(2,(function __clojure_fn_2805_conj_2807(coll_1,x_2){switch(arguments.length){
case 2:var conj_0=arguments.callee;
return (clojure.lang.RT.conj(coll_1,x_2))}
var _cnt,_rtn,conj_0=arguments.callee,xs_3=clojure.JS.rest_args(this,arguments,2);
@@ -38,40 +38,40 @@ do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_rtn=[conj_0.apply(null,[coll_1,x_2]),clojure.fi
//======
//(def second (fn second [x] (first (rest x))))
//---
-(function __clojure_fn_2819(){
-return (clojure.JS.def(clojure,"second",(function __clojure_fn_2819_second_2821(x_1){
+(function __clojure_fn_2810(){
+return (clojure.JS.def(clojure,"second",(function __clojure_fn_2810_second_2812(x_1){
var second_0=arguments.callee;
return (clojure.first.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]);
//======
//(def ffirst (fn ffirst [x] (first (first x))))
//---
-(function __clojure_fn_2829(){
-return (clojure.JS.def(clojure,"ffirst",(function __clojure_fn_2829_ffirst_2831(x_1){
+(function __clojure_fn_2815(){
+return (clojure.JS.def(clojure,"ffirst",(function __clojure_fn_2815_ffirst_2817(x_1){
var ffirst_0=arguments.callee;
return (clojure.first.apply(null,[clojure.first.apply(null,[x_1])]))})))}).apply(null,[]);
//======
//(def rfirst (fn rfirst [x] (rest (first x))))
//---
-(function __clojure_fn_2839(){
-return (clojure.JS.def(clojure,"rfirst",(function __clojure_fn_2839_rfirst_2841(x_1){
+(function __clojure_fn_2820(){
+return (clojure.JS.def(clojure,"rfirst",(function __clojure_fn_2820_rfirst_2822(x_1){
var rfirst_0=arguments.callee;
return (clojure.rest.apply(null,[clojure.first.apply(null,[x_1])]))})))}).apply(null,[]);
//======
//(def frest (fn frest [x] (first (rest x))))
//---
-(function __clojure_fn_2849(){
-return (clojure.JS.def(clojure,"frest",(function __clojure_fn_2849_frest_2851(x_1){
+(function __clojure_fn_2825(){
+return (clojure.JS.def(clojure,"frest",(function __clojure_fn_2825_frest_2827(x_1){
var frest_0=arguments.callee;
return (clojure.first.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]);
//======
//(def rrest (fn rrest [x] (rest (rest x))))
//---
-(function __clojure_fn_2859(){
-return (clojure.JS.def(clojure,"rrest",(function __clojure_fn_2859_rrest_2861(x_1){
+(function __clojure_fn_2830(){
+return (clojure.JS.def(clojure,"rrest",(function __clojure_fn_2830_rrest_2832(x_1){
var rrest_0=arguments.callee;
return (clojure.rest.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(null,[]);
// Skipping: (def seq (fn seq [coll] (. clojure.lang.RT (seq coll))))
@@ -80,8 +80,8 @@ return (clojure.rest.apply(null,[clojure.rest.apply(null,[x_1])]))})))}).apply(n
//======
//(def seq? (fn seq? [x] (instance? clojure.lang.ISeq x)))
//---
-(function __clojure_fn_2879(){
-return (clojure.JS.def(clojure,"seq_QMARK_",(function __clojure_fn_2879_seq_QMARK_2881(x_1){
+(function __clojure_fn_2845(){
+return (clojure.JS.def(clojure,"seq_QMARK_",(function __clojure_fn_2845_seq_QMARK_2847(x_1){
var seq_QMARK__0=arguments.callee;
return (clojure.instance_QMARK_.apply(null,[clojure.lang.ISeq,x_1]))})))}).apply(null,[]);
// Skipping: (def string? (fn string? [x] (instance? String x)))
@@ -89,24 +89,24 @@ return (clojure.instance_QMARK_.apply(null,[clojure.lang.ISeq,x_1]))})))}).apply
//======
//(def map? (fn map? [x] (instance? clojure.lang.IPersistentMap x)))
//---
-(function __clojure_fn_2894(){
-return (clojure.JS.def(clojure,"map_QMARK_",(function __clojure_fn_2894_map_QMARK_2896(x_1){
+(function __clojure_fn_2855(){
+return (clojure.JS.def(clojure,"map_QMARK_",(function __clojure_fn_2855_map_QMARK_2857(x_1){
var map_QMARK__0=arguments.callee;
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentMap,x_1]))})))}).apply(null,[]);
//======
//(def vector? (fn vector? [x] (instance? clojure.lang.IPersistentVector x)))
//---
-(function __clojure_fn_2904(){
-return (clojure.JS.def(clojure,"vector_QMARK_",(function __clojure_fn_2904_vector_QMARK_2906(x_1){
+(function __clojure_fn_2860(){
+return (clojure.JS.def(clojure,"vector_QMARK_",(function __clojure_fn_2860_vector_QMARK_2862(x_1){
var vector_QMARK__0=arguments.callee;
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentVector,x_1]))})))}).apply(null,[]);
//======
//(def sigs (fn [fdecl] (if (seq? (first fdecl)) (loop [ret [] fdecl fdecl] (if fdecl (recur (conj ret (first (first fdecl))) (rest fdecl)) (seq ret))) (list (first fdecl)))))
//---
-(function __clojure_fn_2915(){
-return (clojure.JS.def(clojure,"sigs",(function __clojure_fn_2915_sigs_2917(fdecl_1){
+(function __clojure_fn_2865(){
+return (clojure.JS.def(clojure,"sigs",(function __clojure_fn_2865_sigs_2867(fdecl_1){
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;
@@ -116,24 +116,24 @@ _rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.conj.apply(null,[ret_2,clojure.first.appl
//======
//(def meta (fn meta [x] (if (instance? clojure.lang.IObj x) (. x (meta)))))
//---
-(function __clojure_fn_2931(){
-return (clojure.JS.def(clojure,"meta",(function __clojure_fn_2931_meta_2933(x_1){
+(function __clojure_fn_2876(){
+return (clojure.JS.def(clojure,"meta",(function __clojure_fn_2876_meta_2878(x_1){
var meta_0=arguments.callee;
return (((clojure.instance_QMARK_.apply(null,[clojure.lang.IObj,x_1]))?((x_1).meta()):(null)))})))}).apply(null,[]);
//======
//(def with-meta (fn with-meta [x m] (. x (withMeta m))))
//---
-(function __clojure_fn_2941(){
-return (clojure.JS.def(clojure,"with_meta",(function __clojure_fn_2941_with_meta_2943(x_1,m_2){
+(function __clojure_fn_2881(){
+return (clojure.JS.def(clojure,"with_meta",(function __clojure_fn_2881_with_meta_2883(x_1,m_2){
var with_meta_0=arguments.callee;
return ((x_1).withMeta(m_2))})))}).apply(null,[]);
//======
//(def last (fn last [s] (if (rest s) (recur (rest s)) (first s))))
//---
-(function __clojure_fn_2951(){
-return (clojure.JS.def(clojure,"last",(function __clojure_fn_2951_last_2953(s_1){
+(function __clojure_fn_2886(){
+return (clojure.JS.def(clojure,"last",(function __clojure_fn_2886_last_2888(s_1){
var _cnt,_rtn,last_0=arguments.callee;
do{_cnt=0;_rtn=((clojure.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.rest.apply(null,[s_1])],s_1=_rtn[0])):(clojure.first.apply(null,[s_1])))
}while(_cnt);return _rtn;})))}).apply(null,[]);
@@ -141,8 +141,8 @@ do{_cnt=0;_rtn=((clojure.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.rest.app
//======
//(def butlast (fn butlast [s] (loop [ret [] s s] (if (rest s) (recur (conj ret (first s)) (rest s)) (seq ret)))))
//---
-(function __clojure_fn_2961(){
-return (clojure.JS.def(clojure,"butlast",(function __clojure_fn_2961_butlast_2963(s_1){
+(function __clojure_fn_2891(){
+return (clojure.JS.def(clojure,"butlast",(function __clojure_fn_2891_butlast_2893(s_1){
var s_3,ret_2,butlast_0=arguments.callee;
return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY),
(s_3=s_1);do{_cnt=0;
@@ -153,16 +153,16 @@ _rtn=((clojure.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.conj.apply(null,[r
//======
//(defn cast "Throws a ClassCastException if x is not a c, else returns x." [c x] (. c (cast x)))
//---
-(function __clojure_fn_2980(){
-return (clojure.JS.def(clojure,"cast",(function __clojure_fn_2980_cast_2982(c_1,x_2){
+(function __clojure_fn_2904(){
+return (clojure.JS.def(clojure,"cast",(function __clojure_fn_2904_cast_2906(c_1,x_2){
return ((c_1).cast(x_2))})))}).apply(null,[]);
// Skipping: (defn to-array "Returns an array of Objects containing the contents of coll, which\n can be any Collection. Maps to java.util.Collection.toArray()." [coll] (. clojure.lang.RT (toArray coll)))
//======
//(defn vector "Creates a new vector containing the args." ([] []) ([& args] (. clojure.lang.LazilyPersistentVector (create args))))
//---
-(function __clojure_fn_2999(){
-return (clojure.JS.def(clojure,"vector",clojure.JS.variadic(0,(function __clojure_fn_2999_vector_3001(){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=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.LazilyPersistentVector.create(args_1))}))))}).apply(null,[]);
@@ -170,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_3012(){
-return (clojure.JS.def(clojure,"vec",(function __clojure_fn_3012_vec_3014(coll_1){
+(function __clojure_fn_2923(){
+return (clojure.JS.def(clojure,"vec",(function __clojure_fn_2923_vec_2925(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_3032(){
-return (clojure.JS.def(clojure,"hash_set",clojure.JS.variadic(0,(function __clojure_fn_3032_hash_set_3034(){switch(arguments.length){
+(function __clojure_fn_2936(){
+return (clojure.JS.def(clojure,"hash_set",clojure.JS.variadic(0,(function __clojure_fn_2936_hash_set_2938(){switch(arguments.length){
case 0:return (clojure.lang.PersistentHashSet.EMPTY)}
var keys_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.PersistentHashSet.create(keys_1))}))))}).apply(null,[]);
@@ -187,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_3045(){
-return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variadic(0,(function __clojure_fn_3045_sorted_map_3047(){
+(function __clojure_fn_2943(){
+return (clojure.JS.def(clojure,"sorted_map",clojure.JS.variadic(0,(function __clojure_fn_2943_sorted_map_2945(){
var keyvals_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.PersistentTreeMap.create(keyvals_1))}))))}).apply(null,[]);
//======
//(defn sorted-set "Returns a new sorted set with supplied keys." ([& keys] (. clojure.lang.PersistentTreeSet (create keys))))
//---
-(function __clojure_fn_3057(){
-return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variadic(0,(function __clojure_fn_3057_sorted_set_3059(){
+(function __clojure_fn_2949(){
+return (clojure.JS.def(clojure,"sorted_set",clojure.JS.variadic(0,(function __clojure_fn_2949_sorted_set_2951(){
var keys_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.PersistentTreeSet.create(keys_1))}))))}).apply(null,[]);
//======
//(defn sorted-map-by "keyval => key val\n Returns a new sorted map with supplied mappings, using the supplied comparator." ([comparator & keyvals] (. clojure.lang.PersistentTreeMap (create comparator keyvals))))
//---
-(function __clojure_fn_3069(){
-return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_fn_3069_sorted_map_by_3071(comparator_1){
+(function __clojure_fn_2955(){
+return (clojure.JS.def(clojure,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_fn_2955_sorted_map_by_2957(comparator_1){
var keyvals_2=clojure.JS.rest_args(this,arguments,1);
return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))}))))}).apply(null,[]);
// Skipping: (def defmacro (fn [name & args] (list (quote do) (cons (quote clojure/defn) (cons name args)) (list (quote .) (list (quote var) name) (quote (setMacro))))))
@@ -215,48 +215,48 @@ 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_3102(){
-return (clojure.JS.def(clojure,"nil_QMARK_",(function __clojure_fn_3102_nil_QMARK_3104(x_1){
+(function __clojure_fn_2982(){
+return (clojure.JS.def(clojure,"nil_QMARK_",(function __clojure_fn_2982_nil_QMARK_2984(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_3114(){
-return (clojure.JS.def(clojure,"false_QMARK_",(function __clojure_fn_3114_false_QMARK_3116(x_1){
+(function __clojure_fn_2988(){
+return (clojure.JS.def(clojure,"false_QMARK_",(function __clojure_fn_2988_false_QMARK_2990(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_3126(){
-return (clojure.JS.def(clojure,"true_QMARK_",(function __clojure_fn_3126_true_QMARK_3128(x_1){
+(function __clojure_fn_2994(){
+return (clojure.JS.def(clojure,"true_QMARK_",(function __clojure_fn_2994_true_QMARK_2996(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_3138(){
-return (clojure.JS.def(clojure,"not",(function __clojure_fn_3138_not_3140(x_1){
+(function __clojure_fn_3000(){
+return (clojure.JS.def(clojure,"not",(function __clojure_fn_3000_not_3002(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)))))
+//(defn str "With no args, returns the empty string. With one arg x, returns\n x.toString(). (str nil) returns the empty string. With more than\n one arg, returns the concatenation of the str values of the args." {:tag String} ([] "") ([x] (if (nil? x) "" (. x (toString)))) ([x & ys] (loop [sb (new StringBuilder (str x)) more ys] (if more (recur (. sb (append (str (first more)))) (rest more)) (str sb)))))
//---
-(function __clojure_fn_3152(){
-return (clojure.JS.def(clojure,"str",clojure.JS.variadic(1,(function __clojure_fn_3152_str_3154(x_1){switch(arguments.length){
-case 0:return ("")
-case 1:return (((clojure.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString())))}
-var more_4,sb_3,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]))),
+(function __clojure_fn_3006(){
+return (clojure.JS.def(clojure,"str",clojure.JS.variadic(1,(function __clojure_fn_3006_str_3008(x_1){switch(arguments.length){
+case 1:return (((clojure.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString())))
+case 0:return ("")}
+var sb_3,more_4,ys_2=clojure.JS.rest_args(this,arguments,1);
+return (((function __loop(){var _rtn,_cnt;(sb_3=(new java.lang.StringBuilder(clojure.str.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,[]);
//======
//(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_3167(){
-return (clojure.JS.def(clojure,"symbol",(function __clojure_fn_3167_symbol_3169(ns_1,name_2){switch(arguments.length){
+(function __clojure_fn_3014(){
+return (clojure.JS.def(clojure,"symbol",(function __clojure_fn_3014_symbol_3016(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,[]);
@@ -264,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_3181(){
-return (clojure.JS.def(clojure,"keyword",(function __clojure_fn_3181_keyword_3183(ns_1,name_2){switch(arguments.length){
+(function __clojure_fn_3021(){
+return (clojure.JS.def(clojure,"keyword",(function __clojure_fn_3021_keyword_3023(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,[]);
@@ -273,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_3195(){
-return (clojure.JS.def(clojure,"gensym",(function __clojure_fn_3195_gensym_3197(prefix_string_1){switch(arguments.length){
+(function __clojure_fn_3028(){
+return (clojure.JS.def(clojure,"gensym",(function __clojure_fn_3028_gensym_3030(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))))))
@@ -282,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_3214(){
-return (clojure.JS.def(clojure,"spread",(function __clojure_fn_3214_spread_3216(arglist_1){
+(function __clojure_fn_3041(){
+return (clojure.JS.def(clojure,"spread",(function __clojure_fn_3041_spread_3043(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_3232(){
-return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variadic(1,(function __clojure_fn_3232_list_STAR_3234(item_1){
+(function __clojure_fn_3053(){
+return (clojure.JS.def(clojure,"list_STAR_",clojure.JS.variadic(1,(function __clojure_fn_3053_list_STAR_3055(item_1){
var 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)))
@@ -299,46 +299,46 @@ 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_3250(){
-return (clojure.JS.def(clojure,"delay_QMARK_",(function __clojure_fn_3250_delay_QMARK_3252(x_1){
+(function __clojure_fn_3065(){
+return (clojure.JS.def(clojure,"delay_QMARK_",(function __clojure_fn_3065_delay_QMARK_3067(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_3262(){
-return (clojure.JS.def(clojure,"force",(function __clojure_fn_3262_force_3264(x_1){
+(function __clojure_fn_3071(){
+return (clojure.JS.def(clojure,"force",(function __clojure_fn_3071_force_3073(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_3274(){
-return (clojure.JS.def(clojure,"fnseq",(function __clojure_fn_3274_fnseq_3276(first_1,restfn_2){
+(function __clojure_fn_3077(){
+return (clojure.JS.def(clojure,"fnseq",(function __clojure_fn_3077_fnseq_3079(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_3292(){
-return (clojure.JS.def(clojure,"cache_seq",(function __clojure_fn_3292_cache_seq_3294(s_1){
+(function __clojure_fn_3089(){
+return (clojure.JS.def(clojure,"cache_seq",(function __clojure_fn_3089_cache_seq_3091(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_3319(){
-return (clojure.JS.def(clojure,"concat",clojure.JS.variadic(2,(function __clojure_fn_3319_concat_3321(x_1,y_2){switch(arguments.length){
-case 2:return (((clojure.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3319_concat_3321_fn_3326(G__3325_1){switch(arguments.length){
+(function __clojure_fn_3095(){
+return (clojure.JS.def(clojure,"concat",clojure.JS.variadic(2,(function __clojure_fn_3095_concat_3097(x_1,y_2){switch(arguments.length){
+case 0:return (null)
+case 2:return (((clojure.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3095_concat_3097_fn_3102(G__3101_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 0:return (null)
case 1:return (clojure.seq.apply(null,[x_1]))}
var cat_4,zs_3=clojure.JS.rest_args(this,arguments,2);
-return (((cat_4=(function __clojure_fn_3319_concat_3321_cat_3331(xys_1,zs_2){
+return (((cat_4=(function __clojure_fn_3095_concat_3097_cat_3107(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_3319_concat_3321_cat_3331_fn_3333(G__3332_1){switch(arguments.length){
+do{_cnt=0;_rtn=((clojure.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3095_concat_3097_cat_3107_fn_3109(G__3108_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;})),
@@ -347,10 +347,10 @@ cat_4.apply(null,[clojure.concat.apply(null,[x_1,y_2]),zs_3])))}))))}).apply(nul
//======
//(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." {:tag Boolean, :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}} ([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_3351(){
-return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3351_EQ_3356(x_1,y_2){switch(arguments.length){
-case 2:return (clojure.lang.Util.equal(x_1,y_2))
-case 1:return (true)}
+(function __clojure_fn_3116(){
+return (clojure.JS.def(clojure,"_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3116_EQ_3121(x_1,y_2){switch(arguments.length){
+case 1:return (true)
+case 2:return (clojure.lang.Util.equal(x_1,y_2))}
var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2);
do{_cnt=0;_rtn=((clojure.lang.Util.equal(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Util.equal(y_2,clojure.first.apply(null,[more_3]))))):(false))
}while(_cnt);return _rtn;}))))}).apply(null,[]);
@@ -358,33 +358,33 @@ 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_3370(){
-return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3370_not_EQ_3372(x_1,y_2){switch(arguments.length){
-case 1:return (false)
-case 2:return (clojure.not.apply(null,[clojure.lang.Util.equal(x_1,y_2)]))}
+(function __clojure_fn_3127(){
+return (clojure.JS.def(clojure,"not_EQ_",clojure.JS.variadic(2,(function __clojure_fn_3127_not_EQ_3129(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=clojure.JS.rest_args(this,arguments,2);
return (clojure.not.apply(null,[clojure.apply.apply(null,[clojure._EQ_,x_1,y_2,more_3])]))}))))}).apply(null,[]);
//======
//(defn compare "Comparator. Returns 0 if x equals y, -1 if x is logically 'less\n than' y, else 1. Same as Java x.compareTo(y) except it also works\n for nil, and compares numbers in a type-independent manner. x must\n implement Comparable" {:tag Integer, :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)))} [x y] (. clojure.lang.Util (compare x y)))
//---
-(function __clojure_fn_3387(){
-return (clojure.JS.def(clojure,"compare",(function __clojure_fn_3387_compare_3392(x_1,y_2){
+(function __clojure_fn_3135(){
+return (clojure.JS.def(clojure,"compare",(function __clojure_fn_3135_compare_3140(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__3396)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote and__3396)) (clojure/list (clojure/concat (clojure/list (quote clojure/and)) rest)) (clojure/list (quote and__3396)))))))
-// 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__3405)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote or__3405)) (clojure/list (quote or__3405)) (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__3144)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote and__3144)) (clojure/list (clojure/concat (clojure/list (quote clojure/and)) rest)) (clojure/list (quote and__3144)))))))
+// 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__3153)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote or__3153)) (clojure/list (quote or__3153)) (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_3424(){
-return (clojure.JS.def(clojure,"reduce",(function __clojure_fn_3424_reduce_3426(f_1,val_2,coll_3){switch(arguments.length){
+(function __clojure_fn_3162(){
+return (clojure.JS.def(clojure,"reduce",(function __clojure_fn_3162_reduce_3164(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_3424_reduce_3426_fn_3429(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_3162_reduce_3164_fn_3167(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,[]);
@@ -392,47 +392,47 @@ 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_3440(){
-return (clojure.JS.def(clojure,"reverse",(function __clojure_fn_3440_reverse_3442(coll_1){
+(function __clojure_fn_3172(){
+return (clojure.JS.def(clojure,"reverse",(function __clojure_fn_3172_reverse_3174(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)))
+//(defn + "Returns the sum of nums. (+) returns 0." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/add)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 0) ([x] (cast Number x)) ([x y] (. clojure.lang.Numbers (add x y))) ([x y & more] (reduce + (+ x y) more)))
//---
-(function __clojure_fn_3458(){
-return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variadic(2,(function __clojure_fn_3458_PLUS_3463(x_1,y_2){switch(arguments.length){
-case 1:return (clojure.lang.RT.numberCast(x_1))
+(function __clojure_fn_3178(){
+return (clojure.JS.def(clojure,"_PLUS_",clojure.JS.variadic(2,(function __clojure_fn_3178_PLUS_3183(x_1,y_2){switch(arguments.length){
case 0:return (0)
+case 1:return (clojure.cast.apply(null,[java.lang.Number,x_1]))
case 2:return (clojure.lang.Numbers.add(x_1,y_2))}
var more_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.reduce.apply(null,[clojure._PLUS_,clojure.lang.Numbers.add(x_1,y_2),more_3]))}))))}).apply(null,[]);
//======
-//(defn * "Returns the product of nums. (*) returns 1." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/multiply)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 1) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more)))
+//(defn * "Returns the product of nums. (*) returns 1." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/multiply)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([] 1) ([x] (cast Number x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more)))
//---
-(function __clojure_fn_3482(){
-return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variadic(2,(function __clojure_fn_3482_STAR_3487(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3190(){
+return (clojure.JS.def(clojure,"_STAR_",clojure.JS.variadic(2,(function __clojure_fn_3190_STAR_3195(x_1,y_2){switch(arguments.length){
+case 1:return (clojure.cast.apply(null,[java.lang.Number,x_1]))
case 0:return (1)
-case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))
-case 1:return (clojure.lang.RT.numberCast(x_1))}
+case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))}
var more_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.reduce.apply(null,[clojure._STAR_,clojure.lang.Numbers.multiply(x_1,y_2),more_3]))}))))}).apply(null,[]);
//======
//(defn / "If no denominators are supplied, returns 1/numerator,\n else returns numerator divided by all of the denominators." {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/divide)) (clojure/list x) (clojure/list y))))), :inline-arities #{2}} ([x] (/ 1 x)) ([x y] (. clojure.lang.Numbers (divide x y))) ([x y & more] (reduce / (/ x y) more)))
//---
-(function __clojure_fn_3505(){
-return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variadic(2,(function __clojure_fn_3505_SLASH_3510(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))}
+(function __clojure_fn_3202(){
+return (clojure.JS.def(clojure,"_SLASH_",clojure.JS.variadic(2,(function __clojure_fn_3202_SLASH_3207(x_1,y_2){switch(arguments.length){
+case 2:return (clojure.lang.Numbers.divide(x_1,y_2))
+case 1:return (clojure.lang.Numbers.divide(1,x_1))}
var more_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.reduce.apply(null,[clojure._SLASH_,clojure.lang.Numbers.divide(x_1,y_2),more_3]))}))))}).apply(null,[]);
//======
//(defn - "If no ys are supplied, returns the negation of x, else subtracts\n the ys from x and returns the result." {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/minus)) args)))), :inline-arities #{1 2}} ([x] (. clojure.lang.Numbers (minus x))) ([x y] (. clojure.lang.Numbers (minus x y))) ([x y & more] (reduce - (- x y) more)))
//---
-(function __clojure_fn_3527(){
-return (clojure.JS.def(clojure,"_",clojure.JS.variadic(2,(function __clojure_fn_3527_3532(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3213(){
+return (clojure.JS.def(clojure,"_",clojure.JS.variadic(2,(function __clojure_fn_3213_3218(x_1,y_2){switch(arguments.length){
case 2:return (clojure.lang.Numbers.minus(x_1,y_2))
case 1:return (clojure.lang.Numbers.minus(x_1))}
var more_3=clojure.JS.rest_args(this,arguments,2);
@@ -441,10 +441,10 @@ 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_3549(){
-return (clojure.JS.def(clojure,"_LT_",clojure.JS.variadic(2,(function __clojure_fn_3549_LT_3554(x_1,y_2){switch(arguments.length){
-case 1:return (true)
-case 2:return (clojure.lang.Numbers.lt(x_1,y_2))}
+(function __clojure_fn_3224(){
+return (clojure.JS.def(clojure,"_LT_",clojure.JS.variadic(2,(function __clojure_fn_3224_LT_3229(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=clojure.JS.rest_args(this,arguments,2);
do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lt(y_2,clojure.first.apply(null,[more_3]))))):(false))
}while(_cnt);return _rtn;}))))}).apply(null,[]);
@@ -452,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_3571(){
-return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3571_LT_EQ_3576(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3235(){
+return (clojure.JS.def(clojure,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3235_LT_EQ_3240(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);
@@ -463,10 +463,10 @@ 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_3593(){
-return (clojure.JS.def(clojure,"_GT_",clojure.JS.variadic(2,(function __clojure_fn_3593_GT_3598(x_1,y_2){switch(arguments.length){
-case 1:return (true)
-case 2:return (clojure.lang.Numbers.gt(x_1,y_2))}
+(function __clojure_fn_3246(){
+return (clojure.JS.def(clojure,"_GT_",clojure.JS.variadic(2,(function __clojure_fn_3246_GT_3251(x_1,y_2){switch(arguments.length){
+case 2:return (clojure.lang.Numbers.gt(x_1,y_2))
+case 1:return (true)}
var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2);
do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gt(y_2,clojure.first.apply(null,[more_3]))))):(false))
}while(_cnt);return _rtn;}))))}).apply(null,[]);
@@ -474,10 +474,10 @@ 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_3615(){
-return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3615_GT_EQ_3620(x_1,y_2){switch(arguments.length){
-case 2:return (clojure.lang.Numbers.gte(x_1,y_2))
-case 1:return (true)}
+(function __clojure_fn_3257(){
+return (clojure.JS.def(clojure,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3257_GT_EQ_3262(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);
do{_cnt=0;_rtn=((clojure.lang.Numbers.gte(x_1,y_2))?(((clojure.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.first.apply(null,[more_3]),clojure.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gte(y_2,clojure.first.apply(null,[more_3]))))):(false))
}while(_cnt);return _rtn;}))))}).apply(null,[]);
@@ -485,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_3637(){
-return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3637_EQ_EQ_3642(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3268(){
+return (clojure.JS.def(clojure,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_fn_3268_EQ_EQ_3273(x_1,y_2){switch(arguments.length){
case 2:return (clojure.lang.Numbers.equiv(x_1,y_2))
case 1:return (true)}
var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2);
@@ -496,18 +496,18 @@ 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_3656(){
-return (clojure.JS.def(clojure,"max",clojure.JS.variadic(2,(function __clojure_fn_3656_max_3658(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)))}
+(function __clojure_fn_3279(){
+return (clojure.JS.def(clojure,"max",clojure.JS.variadic(2,(function __clojure_fn_3279_max_3281(x_1,y_2){switch(arguments.length){
+case 2:return (((clojure.lang.Numbers.gt(x_1,y_2))?(x_1):(y_2)))
+case 1:return (x_1)}
var more_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.reduce.apply(null,[clojure.max,clojure.max.apply(null,[x_1,y_2]),more_3]))}))))}).apply(null,[]);
//======
//(defn min "Returns the least of the nums." ([x] x) ([x y] (if (< x y) x y)) ([x y & more] (reduce min (min x y) more)))
//---
-(function __clojure_fn_3672(){
-return (clojure.JS.def(clojure,"min",clojure.JS.variadic(2,(function __clojure_fn_3672_min_3674(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_3287(){
+return (clojure.JS.def(clojure,"min",clojure.JS.variadic(2,(function __clojure_fn_3287_min_3289(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=clojure.JS.rest_args(this,arguments,2);
@@ -516,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_3689(){
-return (clojure.JS.def(clojure,"inc",(function __clojure_fn_3689_inc_3694(x_1){
+(function __clojure_fn_3295(){
+return (clojure.JS.def(clojure,"inc",(function __clojure_fn_3295_inc_3300(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_3707(){
-return (clojure.JS.def(clojure,"dec",(function __clojure_fn_3707_dec_3712(x_1){
+(function __clojure_fn_3304(){
+return (clojure.JS.def(clojure,"dec",(function __clojure_fn_3304_dec_3309(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_3725(){
-return (clojure.JS.def(clojure,"unchecked_inc",(function __clojure_fn_3725_unchecked_inc_3730(x_1){
+(function __clojure_fn_3313(){
+return (clojure.JS.def(clojure,"unchecked_inc",(function __clojure_fn_3313_unchecked_inc_3318(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_3743(){
-return (clojure.JS.def(clojure,"unchecked_dec",(function __clojure_fn_3743_unchecked_dec_3748(x_1){
+(function __clojure_fn_3322(){
+return (clojure.JS.def(clojure,"unchecked_dec",(function __clojure_fn_3322_unchecked_dec_3327(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_3761(){
-return (clojure.JS.def(clojure,"unchecked_negate",(function __clojure_fn_3761_unchecked_negate_3766(x_1){
+(function __clojure_fn_3331(){
+return (clojure.JS.def(clojure,"unchecked_negate",(function __clojure_fn_3331_unchecked_negate_3336(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_3779(){
-return (clojure.JS.def(clojure,"unchecked_add",(function __clojure_fn_3779_unchecked_add_3784(x_1,y_2){
+(function __clojure_fn_3340(){
+return (clojure.JS.def(clojure,"unchecked_add",(function __clojure_fn_3340_unchecked_add_3345(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_3797(){
-return (clojure.JS.def(clojure,"unchecked_subtract",(function __clojure_fn_3797_unchecked_subtract_3802(x_1,y_2){
+(function __clojure_fn_3349(){
+return (clojure.JS.def(clojure,"unchecked_subtract",(function __clojure_fn_3349_unchecked_subtract_3354(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_3815(){
-return (clojure.JS.def(clojure,"unchecked_multiply",(function __clojure_fn_3815_unchecked_multiply_3820(x_1,y_2){
+(function __clojure_fn_3358(){
+return (clojure.JS.def(clojure,"unchecked_multiply",(function __clojure_fn_3358_unchecked_multiply_3363(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_3833(){
-return (clojure.JS.def(clojure,"unchecked_divide",(function __clojure_fn_3833_unchecked_divide_3838(x_1,y_2){
+(function __clojure_fn_3367(){
+return (clojure.JS.def(clojure,"unchecked_divide",(function __clojure_fn_3367_unchecked_divide_3372(x_1,y_2){
return (clojure.lang.Numbers.unchecked_divide(x_1,y_2))})))}).apply(null,[]);
//======
//(defn pos? "Returns true if num is greater than zero, else false" {:tag Boolean, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/isPos)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (isPos x)))
//---
-(function __clojure_fn_3851(){
-return (clojure.JS.def(clojure,"pos_QMARK_",(function __clojure_fn_3851_pos_QMARK_3856(x_1){
+(function __clojure_fn_3376(){
+return (clojure.JS.def(clojure,"pos_QMARK_",(function __clojure_fn_3376_pos_QMARK_3381(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/isNeg)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (isNeg x)))
//---
-(function __clojure_fn_3869(){
-return (clojure.JS.def(clojure,"neg_QMARK_",(function __clojure_fn_3869_neg_QMARK_3874(x_1){
+(function __clojure_fn_3385(){
+return (clojure.JS.def(clojure,"neg_QMARK_",(function __clojure_fn_3385_neg_QMARK_3390(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/isZero)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (isZero x)))
//---
-(function __clojure_fn_3887(){
-return (clojure.JS.def(clojure,"zero_QMARK_",(function __clojure_fn_3887_zero_QMARK_3892(x_1){
+(function __clojure_fn_3394(){
+return (clojure.JS.def(clojure,"zero_QMARK_",(function __clojure_fn_3394_zero_QMARK_3399(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_fn_3902(){
-return (clojure.JS.def(clojure,"quot",(function __clojure_fn_3902_quot_3904(num_1,div_2){
+(function __clojure_fn_3403(){
+return (clojure.JS.def(clojure,"quot",(function __clojure_fn_3403_quot_3405(num_1,div_2){
return (clojure.lang.Numbers.quotient(num_1,div_2))})))}).apply(null,[]);
//======
//(defn rem "rem[ainder] of dividing numerator by denominator." [num div] (. clojure.lang.Numbers (remainder num div)))
//---
-(function __clojure_fn_3914(){
-return (clojure.JS.def(clojure,"rem",(function __clojure_fn_3914_rem_3916(num_1,div_2){
+(function __clojure_fn_3409(){
+return (clojure.JS.def(clojure,"rem",(function __clojure_fn_3409_rem_3411(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_fn_3926(){
-return (clojure.JS.def(clojure,"rationalize",(function __clojure_fn_3926_rationalize_3928(num_1){
+(function __clojure_fn_3415(){
+return (clojure.JS.def(clojure,"rationalize",(function __clojure_fn_3415_rationalize_3417(num_1){
return (clojure.lang.Numbers.rationalize(num_1))})))}).apply(null,[]);
//======
//(defn bit-not "Bitwise complement" {:inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/not)) (clojure/list x)))))} [x] (. clojure.lang.Numbers not x))
//---
-(function __clojure_fn_3941(){
-return (clojure.JS.def(clojure,"bit_not",(function __clojure_fn_3941_bit_not_3946(x_1){
+(function __clojure_fn_3421(){
+return (clojure.JS.def(clojure,"bit_not",(function __clojure_fn_3421_bit_not_3426(x_1){
return (clojure.lang.Numbers.not(x_1))})))}).apply(null,[]);
//======
//(defn bit-and "Bitwise and" {:inline (fn [x y] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/and)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers and x y))
//---
-(function __clojure_fn_3959(){
-return (clojure.JS.def(clojure,"bit_and",(function __clojure_fn_3959_bit_and_3964(x_1,y_2){
+(function __clojure_fn_3430(){
+return (clojure.JS.def(clojure,"bit_and",(function __clojure_fn_3430_bit_and_3435(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/or)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers or x y))
//---
-(function __clojure_fn_3977(){
-return (clojure.JS.def(clojure,"bit_or",(function __clojure_fn_3977_bit_or_3982(x_1,y_2){
+(function __clojure_fn_3439(){
+return (clojure.JS.def(clojure,"bit_or",(function __clojure_fn_3439_bit_or_3444(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/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/xor)) (clojure/list x) (clojure/list y)))))} [x y] (. clojure.lang.Numbers xor x y))
//---
-(function __clojure_fn_3995(){
-return (clojure.JS.def(clojure,"bit_xor",(function __clojure_fn_3995_bit_xor_4000(x_1,y_2){
+(function __clojure_fn_3448(){
+return (clojure.JS.def(clojure,"bit_xor",(function __clojure_fn_3448_bit_xor_3453(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_fn_4010(){
-return (clojure.JS.def(clojure,"bit_and_not",(function __clojure_fn_4010_bit_and_not_4012(x_1,y_2){
+(function __clojure_fn_3457(){
+return (clojure.JS.def(clojure,"bit_and_not",(function __clojure_fn_3457_bit_and_not_3459(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_fn_4022(){
-return (clojure.JS.def(clojure,"bit_clear",(function __clojure_fn_4022_bit_clear_4024(x_1,n_2){
+(function __clojure_fn_3463(){
+return (clojure.JS.def(clojure,"bit_clear",(function __clojure_fn_3463_bit_clear_3465(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_fn_4034(){
-return (clojure.JS.def(clojure,"bit_set",(function __clojure_fn_4034_bit_set_4036(x_1,n_2){
+(function __clojure_fn_3469(){
+return (clojure.JS.def(clojure,"bit_set",(function __clojure_fn_3469_bit_set_3471(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_fn_4046(){
-return (clojure.JS.def(clojure,"bit_flip",(function __clojure_fn_4046_bit_flip_4048(x_1,n_2){
+(function __clojure_fn_3475(){
+return (clojure.JS.def(clojure,"bit_flip",(function __clojure_fn_3475_bit_flip_3477(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_fn_4058(){
-return (clojure.JS.def(clojure,"bit_test",(function __clojure_fn_4058_bit_test_4060(x_1,n_2){
+(function __clojure_fn_3481(){
+return (clojure.JS.def(clojure,"bit_test",(function __clojure_fn_3481_bit_test_3483(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_fn_4070(){
-return (clojure.JS.def(clojure,"bit_shift_left",(function __clojure_fn_4070_bit_shift_left_4072(x_1,n_2){
+(function __clojure_fn_3487(){
+return (clojure.JS.def(clojure,"bit_shift_left",(function __clojure_fn_3487_bit_shift_left_3489(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_fn_4082(){
-return (clojure.JS.def(clojure,"bit_shift_right",(function __clojure_fn_4082_bit_shift_right_4084(x_1,n_2){
+(function __clojure_fn_3493(){
+return (clojure.JS.def(clojure,"bit_shift_right",(function __clojure_fn_3493_bit_shift_right_3495(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_fn_4094(){
-return (clojure.JS.def(clojure,"even_QMARK_",(function __clojure_fn_4094_even_QMARK_4096(n_1){
+(function __clojure_fn_3499(){
+return (clojure.JS.def(clojure,"even_QMARK_",(function __clojure_fn_3499_even_QMARK_3501(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_fn_4106(){
-return (clojure.JS.def(clojure,"odd_QMARK_",(function __clojure_fn_4106_odd_QMARK_4108(n_1){
+(function __clojure_fn_3505(){
+return (clojure.JS.def(clojure,"odd_QMARK_",(function __clojure_fn_3505_odd_QMARK_3507(n_1){
return (clojure.not.apply(null,[clojure.even_QMARK_.apply(null,[n_1])]))})))}).apply(null,[]);
//======
//(defn complement "Takes a fn f and returns a fn that takes the same arguments as f,\n has the same effects, if any, and returns the opposite truth value." [f] (fn [& args] (not (apply f args))))
//---
-(function __clojure_fn_4121(){
-return (clojure.JS.def(clojure,"complement",(function __clojure_fn_4121_complement_4123(f_1){
-return (clojure.JS.variadic(0,(function __clojure_fn_4121_complement_4123_fn_4125(){
+(function __clojure_fn_3511(){
+return (clojure.JS.def(clojure,"complement",(function __clojure_fn_3511_complement_3513(f_1){
+return (clojure.JS.variadic(0,(function __clojure_fn_3511_complement_3513_fn_3515(){
var args_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.not.apply(null,[clojure.apply.apply(null,[f_1,args_1])]))})))})))}).apply(null,[]);
//======
//(defn constantly "Returns a function that takes any number of arguments and returns x." [x] (fn [& args] x))
//---
-(function __clojure_fn_4139(){
-return (clojure.JS.def(clojure,"constantly",(function __clojure_fn_4139_constantly_4141(x_1){
-return (clojure.JS.variadic(0,(function __clojure_fn_4139_constantly_4141_fn_4143(){
+(function __clojure_fn_3520(){
+return (clojure.JS.def(clojure,"constantly",(function __clojure_fn_3520_constantly_3522(x_1){
+return (clojure.JS.variadic(0,(function __clojure_fn_3520_constantly_3522_fn_3524(){
var args_1=clojure.JS.rest_args(this,arguments,0);
return (x_1)})))})))}).apply(null,[]);
//======
//(defn identity "Returns its argument." [x] x)
//---
-(function __clojure_fn_4154(){
-return (clojure.JS.def(clojure,"identity",(function __clojure_fn_4154_identity_4156(x_1){
+(function __clojure_fn_3529(){
+return (clojure.JS.def(clojure,"identity",(function __clojure_fn_3529_identity_3531(x_1){
return (x_1)})))}).apply(null,[]);
// Skipping: (defn count "Returns the number of items in the collection. (count nil) returns\n 0. Also works on strings, arrays, and Java Collections and Maps" [coll] (. clojure.lang.RT (count coll)))
//======
//(defn peek "For a list or queue, same as first, for a vector, same as, but much\n more efficient than, last. If the collection is empty, returns nil." [coll] (. clojure.lang.RT (peek coll)))
//---
-(function __clojure_fn_4172(){
-return (clojure.JS.def(clojure,"peek",(function __clojure_fn_4172_peek_4174(coll_1){
+(function __clojure_fn_3541(){
+return (clojure.JS.def(clojure,"peek",(function __clojure_fn_3541_peek_3543(coll_1){
return (clojure.lang.RT.peek(coll_1))})))}).apply(null,[]);
//======
//(defn pop "For a list or queue, returns a new list/queue without the first\n item, for a vector, returns a new vector without the last item. If\n the collection is empty, throws an exception. Note - not the same\n as rest/butlast." [coll] (. clojure.lang.RT (pop coll)))
//---
-(function __clojure_fn_4184(){
-return (clojure.JS.def(clojure,"pop",(function __clojure_fn_4184_pop_4186(coll_1){
+(function __clojure_fn_3547(){
+return (clojure.JS.def(clojure,"pop",(function __clojure_fn_3547_pop_3549(coll_1){
return (clojure.lang.RT.pop(coll_1))})))}).apply(null,[]);
// Skipping: (defn nth "Returns the value at the index. get returns nil if index out of\n bounds, nth throws an exception unless not-found is supplied. nth\n also works for strings, Java arrays, regex Matchers and Lists, and,\n in O(n) time, for sequences." ([coll index] (. clojure.lang.RT (nth coll index))) ([coll index not-found] (. clojure.lang.RT (nth coll index not-found))))
// Skipping: (defn contains? "Returns true if key is present, else false." [map key] (. clojure.lang.RT (contains map key)))
@@ -755,8 +755,8 @@ return (clojure.lang.RT.pop(coll_1))})))}).apply(null,[]);
//======
//(defn dissoc "dissoc[iate]. Returns a new map of the same (hashed/sorted) type,\n that does not contain a mapping for key(s)." ([map] map) ([map key] (. clojure.lang.RT (dissoc map key))) ([map key & ks] (let [ret (dissoc map key)] (if ks (recur ret (first ks) (rest ks)) ret))))
//---
-(function __clojure_fn_4218(){
-return (clojure.JS.def(clojure,"dissoc",clojure.JS.variadic(2,(function __clojure_fn_4218_dissoc_4220(map_1,key_2){switch(arguments.length){
+(function __clojure_fn_3573(){
+return (clojure.JS.def(clojure,"dissoc",clojure.JS.variadic(2,(function __clojure_fn_3573_dissoc_3575(map_1,key_2){switch(arguments.length){
case 2:return (clojure.lang.RT.dissoc(map_1,key_2))
case 1:return (map_1)}
var _cnt,_rtn,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2);
@@ -767,8 +767,8 @@ do{_cnt=0;_rtn=((ret_4=clojure.dissoc.apply(null,[map_1,key_2])),
//======
//(defn disj "disj[oin]. Returns a new set of the same (hashed/sorted) type, that\n does not contain key(s)." ([set] set) ([set key] (. set (disjoin key))) ([set key & ks] (let [ret (disj set key)] (if ks (recur ret (first ks) (rest ks)) ret))))
//---
-(function __clojure_fn_4234(){
-return (clojure.JS.def(clojure,"disj",clojure.JS.variadic(2,(function __clojure_fn_4234_disj_4236(set_1,key_2){switch(arguments.length){
+(function __clojure_fn_3581(){
+return (clojure.JS.def(clojure,"disj",clojure.JS.variadic(2,(function __clojure_fn_3581_disj_3583(set_1,key_2){switch(arguments.length){
case 2:return ((set_1).disjoin(key_2))
case 1:return (set_1)}
var _cnt,_rtn,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2);
@@ -780,9 +780,9 @@ do{_cnt=0;_rtn=((ret_4=clojure.disj.apply(null,[set_1,key_2])),
//======
//(defn select-keys "Returns a map containing only those entries in map whose key is in keys" [map keyseq] (loop [ret {} keys (seq keyseq)] (if keys (let [entry (. clojure.lang.RT (find map (first keys)))] (recur (if entry (conj ret entry) ret) (rest keys))) ret)))
//---
-(function __clojure_fn_4254(){
-return (clojure.JS.def(clojure,"select_keys",(function __clojure_fn_4254_select_keys_4256(map_1,keyseq_2){
-var ret_3,keys_4,entry_5;
+(function __clojure_fn_3595(){
+return (clojure.JS.def(clojure,"select_keys",(function __clojure_fn_3595_select_keys_3597(map_1,keyseq_2){
+var keys_4,ret_3,entry_5;
return (((function __loop(){var _rtn,_cnt;(ret_3=clojure.lang.PersistentHashMap.EMPTY),
(keys_4=clojure.seq.apply(null,[keyseq_2]));do{_cnt=0;
_rtn=((keys_4)?(((entry_5=clojure.lang.RT.find(map_1,clojure.first.apply(null,[keys_4]))),
@@ -793,38 +793,38 @@ _rtn=((keys_4)?(((entry_5=clojure.lang.RT.find(map_1,clojure.first.apply(null,[k
//======
//(defn key "Returns the key of the map entry." [e] (. e (getKey)))
//---
-(function __clojure_fn_4278(){
-return (clojure.JS.def(clojure,"key",(function __clojure_fn_4278_key_4280(e_1){
+(function __clojure_fn_3613(){
+return (clojure.JS.def(clojure,"key",(function __clojure_fn_3613_key_3615(e_1){
return ((e_1).getKey())})))}).apply(null,[]);
//======
//(defn val "Returns the value in the map entry." [e] (. e (getValue)))
//---
-(function __clojure_fn_4290(){
-return (clojure.JS.def(clojure,"val",(function __clojure_fn_4290_val_4292(e_1){
+(function __clojure_fn_3619(){
+return (clojure.JS.def(clojure,"val",(function __clojure_fn_3619_val_3621(e_1){
return ((e_1).getValue())})))}).apply(null,[]);
//======
//(defn rseq "Returns, in constant time, a sequence of the items in rev (which\n can be a vector or sorted-map), in reverse order." [rev] (. rev (rseq)))
//---
-(function __clojure_fn_4302(){
-return (clojure.JS.def(clojure,"rseq",(function __clojure_fn_4302_rseq_4304(rev_1){
+(function __clojure_fn_3625(){
+return (clojure.JS.def(clojure,"rseq",(function __clojure_fn_3625_rseq_3627(rev_1){
return ((rev_1).rseq())})))}).apply(null,[]);
//======
//(defn name "Returns the name String of a symbol or keyword." [x] (. x (getName)))
//---
-(function __clojure_fn_4314(){
-return (clojure.JS.def(clojure,"name",(function __clojure_fn_4314_name_4316(x_1){
+(function __clojure_fn_3631(){
+return (clojure.JS.def(clojure,"name",(function __clojure_fn_3631_name_3633(x_1){
return ((x_1).getName())})))}).apply(null,[]);
//======
//(defn namespace "Returns the namespace String of a symbol or keyword, or nil if not present." [x] (. x (getNamespace)))
//---
-(function __clojure_fn_4326(){
-return (clojure.JS.def(clojure,"namespace",(function __clojure_fn_4326_namespace_4328(x_1){
+(function __clojure_fn_3637(){
+return (clojure.JS.def(clojure,"namespace",(function __clojure_fn_3637_namespace_3639(x_1){
return ((x_1).getNamespace())})))}).apply(null,[]);
-// Skipping: (defmacro locking "Executes exprs in an implicit do, while holding the monitor of x.\n Will release the monitor of x in all circumstances." [x & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote lockee__4332)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote try)) (clojure/list (clojure/concat (clojure/list (quote monitor-enter)) (clojure/list (quote lockee__4332)))) body (clojure/list (clojure/concat (clojure/list (quote finally)) (clojure/list (clojure/concat (clojure/list (quote monitor-exit)) (clojure/list (quote lockee__4332))))))))))
+// Skipping: (defmacro locking "Executes exprs in an implicit do, while holding the monitor of x.\n Will release the monitor of x in all circumstances." [x & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote lockee__3643)) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote try)) (clojure/list (clojure/concat (clojure/list (quote monitor-enter)) (clojure/list (quote lockee__3643)))) body (clojure/list (clojure/concat (clojure/list (quote finally)) (clojure/list (clojure/concat (clojure/list (quote monitor-exit)) (clojure/list (quote lockee__3643))))))))))
// Skipping: (defmacro .. "form => fieldName-symbol or (instanceMethodName-symbol args*)\n\n Expands into a member access (.) of the first member on the first\n argument, followed by the next member on the result, etc. For\n instance:\n\n (.. System (getProperties) (get \"os.name\"))\n\n expands to:\n\n (. (. System (getProperties)) (get \"os.name\"))\n\n but is easier to write, read, and understand." ([x form] (clojure/concat (clojure/list (quote .)) (clojure/list x) (clojure/list form))) ([x form & more] (clojure/concat (clojure/list (quote clojure/..)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list x) (clojure/list form))) more)))
// Skipping: (defmacro -> "Macro. Threads the expr through the forms. Inserts x as the\n second item in the first form, making a list of it if it is not a\n list already. If there are more forms, inserts the first form as the\n second item in second form, etc." ([x form] (if (seq? form) (clojure/concat (clojure/list (first form)) (clojure/list x) (rest form)) (list form x))) ([x form & more] (clojure/concat (clojure/list (quote clojure/->)) (clojure/list (clojure/concat (clojure/list (quote clojure/->)) (clojure/list x) (clojure/list form))) more)))
// Skipping: (defmacro defmulti "Creates a new multimethod with the associated dispatch function. If\n default-dispatch-val is supplied it becomes the default dispatch\n value of the multimethod, otherwise the default dispatch value\n is :default." ([name dispatch-fn] (clojure/concat (clojure/list (quote clojure/defmulti)) (clojure/list name) (clojure/list dispatch-fn) (clojure/list :default))) ([name dispatch-fn default-val] (clojure/concat (clojure/list (quote def)) (clojure/list (with-meta name (assoc (clojure/meta name) :tag (quote clojure.lang.MultiFn)))) (clojure/list (clojure/concat (clojure/list (quote new)) (clojure/list (quote clojure.lang.MultiFn)) (clojure/list dispatch-fn) (clojure/list default-val))))))
@@ -836,134 +836,134 @@ return ((x_1).getNamespace())})))}).apply(null,[]);
//======
//(defn find-var "Returns the global var named by the namespace-qualified symbol, or\n nil if no var with that name." [sym] (. clojure.lang.Var (find sym)))
//---
-(function __clojure_fn_4393(){
-return (clojure.JS.def(clojure,"find_var",(function __clojure_fn_4393_find_var_4395(sym_1){
+(function __clojure_fn_3698(){
+return (clojure.JS.def(clojure,"find_var",(function __clojure_fn_3698_find_var_3700(sym_1){
return (clojure.lang.Var.find(sym_1))})))}).apply(null,[]);
//======
//(defn agent "Creates and returns an agent with an initial value of state and an\n optional validate fn. validate-fn must be nil or a side-effect-free fn of\n one argument, which will be passed the intended new state on any state\n change. If the new state is unacceptable, the validate-fn should\n throw an exception." ([state] (new clojure.lang.Agent state)) ([state validate-fn] (new clojure.lang.Agent state validate-fn)))
//---
-(function __clojure_fn_4406(){
-return (clojure.JS.def(clojure,"agent",(function __clojure_fn_4406_agent_4408(state_1,validate_fn_2){switch(arguments.length){
+(function __clojure_fn_3704(){
+return (clojure.JS.def(clojure,"agent",(function __clojure_fn_3704_agent_3706(state_1,validate_fn_2){switch(arguments.length){
case 1:return ((new clojure.lang.Agent(state_1)))}
return ((new clojure.lang.Agent(state_1,validate_fn_2)))})))}).apply(null,[]);
//======
-//(defn ! [& args] (throw (clojure.lang.RT/makeException "! is now send. See also send-off")))
+//(defn ! [& args] (throw (new Exception "! is now send. See also send-off")))
//---
-(function __clojure_fn_4419(){
-return (clojure.JS.def(clojure,"_BANG_",clojure.JS.variadic(0,(function __clojure_fn_4419_BANG_4421(){
+(function __clojure_fn_3711(){
+return (clojure.JS.def(clojure,"_BANG_",clojure.JS.variadic(0,(function __clojure_fn_3711_BANG_3713(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw clojure.lang.RT.makeException("! is now send. See also send-off")})())}))))}).apply(null,[]);
+return ((function __throw(){throw (new java.lang.Exception("! is now send. See also send-off"))})())}))))}).apply(null,[]);
//======
//(defn send "Dispatch an action to an agent. Returns the agent immediately.\n Subsequently, in a thread from a thread pool, the state of the agent\n will be set to the value of:\n\n (apply action-fn state-of-agent args)" [a f & args] (. a (dispatch f args false)))
//---
-(function __clojure_fn_4431(){
-return (clojure.JS.def(clojure,"send",clojure.JS.variadic(2,(function __clojure_fn_4431_send_4433(a_1,f_2){
+(function __clojure_fn_3717(){
+return (clojure.JS.def(clojure,"send",clojure.JS.variadic(2,(function __clojure_fn_3717_send_3719(a_1,f_2){
var args_3=clojure.JS.rest_args(this,arguments,2);
return ((a_1).dispatch(f_2,args_3,false))}))))}).apply(null,[]);
//======
//(defn send-off "Dispatch a potentially blocking action to an agent. Returns the\n agent immediately. Subsequently, in a separate thread, the state of\n the agent will be set to the value of:\n\n (apply action-fn state-of-agent args)" [a f & args] (. a (dispatch f args true)))
//---
-(function __clojure_fn_4443(){
-return (clojure.JS.def(clojure,"send_off",clojure.JS.variadic(2,(function __clojure_fn_4443_send_off_4445(a_1,f_2){
+(function __clojure_fn_3723(){
+return (clojure.JS.def(clojure,"send_off",clojure.JS.variadic(2,(function __clojure_fn_3723_send_off_3725(a_1,f_2){
var args_3=clojure.JS.rest_args(this,arguments,2);
return ((a_1).dispatch(f_2,args_3,true))}))))}).apply(null,[]);
//======
//(defn add-watch "Experimental.\n Adds a watcher to an agent. Whenever the agent runs an action, any\n registered watchers will have their callback function called. The\n callback fn will be passed 3 args, the watcher, the agent and a boolean\n which will be true if the agent's state was (potentially) changed by\n the action. The callback fn is run synchronously with the action,\n and thus derefs of the agent in the callback will see the value set\n during that action. Because it is run on the action thread, the\n callback should not block, but can send messages." [a watcher callback] (.addWatch a watcher callback))
//---
-(function __clojure_fn_4455(){
-return (clojure.JS.def(clojure,"add_watch",(function __clojure_fn_4455_add_watch_4457(a_1,watcher_2,callback_3){
+(function __clojure_fn_3729(){
+return (clojure.JS.def(clojure,"add_watch",(function __clojure_fn_3729_add_watch_3731(a_1,watcher_2,callback_3){
return ((a_1).addWatch(watcher_2,callback_3))})))}).apply(null,[]);
//======
//(defn remove-watch "Experimental.\n Removes a watcher (set by add-watch) from an agent" [a watcher] (.removeWatch a watcher))
//---
-(function __clojure_fn_4467(){
-return (clojure.JS.def(clojure,"remove_watch",(function __clojure_fn_4467_remove_watch_4469(a_1,watcher_2){
+(function __clojure_fn_3735(){
+return (clojure.JS.def(clojure,"remove_watch",(function __clojure_fn_3735_remove_watch_3737(a_1,watcher_2){
return ((a_1).removeWatch(watcher_2))})))}).apply(null,[]);
//======
//(defn agent-errors "Returns a sequence of the exceptions thrown during asynchronous\n actions of the agent." [a] (. a (getErrors)))
//---
-(function __clojure_fn_4479(){
-return (clojure.JS.def(clojure,"agent_errors",(function __clojure_fn_4479_agent_errors_4481(a_1){
+(function __clojure_fn_3741(){
+return (clojure.JS.def(clojure,"agent_errors",(function __clojure_fn_3741_agent_errors_3743(a_1){
return ((a_1).getErrors())})))}).apply(null,[]);
//======
//(defn clear-agent-errors "Clears any exceptions thrown during asynchronous actions of the\n agent, allowing subsequent actions to occur." [a] (. a (clearErrors)))
//---
-(function __clojure_fn_4491(){
-return (clojure.JS.def(clojure,"clear_agent_errors",(function __clojure_fn_4491_clear_agent_errors_4493(a_1){
+(function __clojure_fn_3747(){
+return (clojure.JS.def(clojure,"clear_agent_errors",(function __clojure_fn_3747_clear_agent_errors_3749(a_1){
return ((a_1).clearErrors())})))}).apply(null,[]);
//======
//(defn shutdown-agents "Initiates a shutdown of the thread pools that back the agent\n system. Running actions will complete, but no new actions will be\n accepted" [] (. clojure.lang.Agent shutdown))
//---
-(function __clojure_fn_4503(){
-return (clojure.JS.def(clojure,"shutdown_agents",(function __clojure_fn_4503_shutdown_agents_4505(){
+(function __clojure_fn_3753(){
+return (clojure.JS.def(clojure,"shutdown_agents",(function __clojure_fn_3753_shutdown_agents_3755(){
return (clojure.lang.Agent.shutdown())})))}).apply(null,[]);
//======
//(defn ref "Creates and returns a Ref with an initial value of x and an optional validate fn.\n validate-fn must be nil or a side-effect-free fn of one argument, which will\n be passed the intended new state on any state change. If the new\n state is unacceptable, the validate-fn should throw an\n exception. validate-fn will be called on transaction commit, when\n all refs have their final values." ([x] (new clojure.lang.Ref x)) ([x validate-fn] (new clojure.lang.Ref x validate-fn)))
//---
-(function __clojure_fn_4516(){
-return (clojure.JS.def(clojure,"ref",(function __clojure_fn_4516_ref_4518(x_1,validate_fn_2){switch(arguments.length){
+(function __clojure_fn_3759(){
+return (clojure.JS.def(clojure,"ref",(function __clojure_fn_3759_ref_3761(x_1,validate_fn_2){switch(arguments.length){
case 1:return ((new clojure.lang.Ref(x_1)))}
return ((new clojure.lang.Ref(x_1,validate_fn_2)))})))}).apply(null,[]);
//======
//(defn deref "Also reader macro: @ref/@agent Within a transaction, returns the\n in-transaction-value of ref, else returns the\n most-recently-committed value of ref. When applied to an agent,\n returns its current state." [ref] (. ref (get)))
//---
-(function __clojure_fn_4529(){
-return (clojure.JS.def(clojure,"deref",(function __clojure_fn_4529_deref_4531(ref_1){
+(function __clojure_fn_3766(){
+return (clojure.JS.def(clojure,"deref",(function __clojure_fn_3766_deref_3768(ref_1){
return ((ref_1).get())})))}).apply(null,[]);
//======
//(defn set-validator "Sets the validator-fn for a var/ref/agent. validator-fn must be nil or a\n side-effect-free fn of one argument, which will be passed the intended\n new state on any state change. If the new state is unacceptable, the\n validator-fn should throw an exception. If the current state (root\n value if var) is not acceptable to the new validator, an exception\n will be thrown and the validator will not be changed." [iref validator-fn] (. iref (setValidator validator-fn)))
//---
-(function __clojure_fn_4541(){
-return (clojure.JS.def(clojure,"set_validator",(function __clojure_fn_4541_set_validator_4543(iref_1,validator_fn_2){
+(function __clojure_fn_3772(){
+return (clojure.JS.def(clojure,"set_validator",(function __clojure_fn_3772_set_validator_3774(iref_1,validator_fn_2){
return ((iref_1).setValidator(validator_fn_2))})))}).apply(null,[]);
//======
//(defn get-validator "Gets the validator-fn for a var/ref/agent." [iref] (. iref (getValidator)))
//---
-(function __clojure_fn_4553(){
-return (clojure.JS.def(clojure,"get_validator",(function __clojure_fn_4553_get_validator_4555(iref_1){
+(function __clojure_fn_3778(){
+return (clojure.JS.def(clojure,"get_validator",(function __clojure_fn_3778_get_validator_3780(iref_1){
return ((iref_1).getValidator())})))}).apply(null,[]);
//======
//(defn commute "Must be called in a transaction. Sets the in-transaction-value of\n ref to:\n\n (apply fun in-transaction-value-of-ref args)\n\n and returns the in-transaction-value of ref.\n\n At the commit point of the transaction, sets the value of ref to be:\n\n (apply fun most-recently-committed-value-of-ref args)\n\n Thus fun should be commutative, or, failing that, you must accept\n last-one-in-wins behavior. commute allows for more concurrency than\n ref-set." [ref fun & args] (. ref (commute fun args)))
//---
-(function __clojure_fn_4565(){
-return (clojure.JS.def(clojure,"commute",clojure.JS.variadic(2,(function __clojure_fn_4565_commute_4567(ref_1,fun_2){
+(function __clojure_fn_3784(){
+return (clojure.JS.def(clojure,"commute",clojure.JS.variadic(2,(function __clojure_fn_3784_commute_3786(ref_1,fun_2){
var args_3=clojure.JS.rest_args(this,arguments,2);
return ((ref_1).commute(fun_2,args_3))}))))}).apply(null,[]);
//======
//(defn alter "Must be called in a transaction. Sets the in-transaction-value of\n ref to:\n\n (apply fun in-transaction-value-of-ref args)\n\n and returns the in-transaction-value of ref." [ref fun & args] (. ref (alter fun args)))
//---
-(function __clojure_fn_4577(){
-return (clojure.JS.def(clojure,"alter",clojure.JS.variadic(2,(function __clojure_fn_4577_alter_4579(ref_1,fun_2){
+(function __clojure_fn_3790(){
+return (clojure.JS.def(clojure,"alter",clojure.JS.variadic(2,(function __clojure_fn_3790_alter_3792(ref_1,fun_2){
var args_3=clojure.JS.rest_args(this,arguments,2);
return ((ref_1).alter(fun_2,args_3))}))))}).apply(null,[]);
//======
//(defn ref-set "Must be called in a transaction. Sets the value of ref.\n Returns val." [ref val] (. ref (set val)))
//---
-(function __clojure_fn_4589(){
-return (clojure.JS.def(clojure,"ref_set",(function __clojure_fn_4589_ref_set_4591(ref_1,val_2){
+(function __clojure_fn_3796(){
+return (clojure.JS.def(clojure,"ref_set",(function __clojure_fn_3796_ref_set_3798(ref_1,val_2){
return ((ref_1).set(val_2))})))}).apply(null,[]);
//======
//(defn ensure "Must be called in a transaction. Protects the ref from modification\n by other transactions. Returns the in-transaction-value of\n ref. Allows for more concurrency than (ref-set ref @ref)" [ref] (. ref (touch)) (. ref (get)))
//---
-(function __clojure_fn_4601(){
-return (clojure.JS.def(clojure,"ensure",(function __clojure_fn_4601_ensure_4603(ref_1){
+(function __clojure_fn_3802(){
+return (clojure.JS.def(clojure,"ensure",(function __clojure_fn_3802_ensure_3804(ref_1){
return ((ref_1).touch(),
(ref_1).get())})))}).apply(null,[]);
// Skipping: (defmacro sync "transaction-flags => TBD, pass nil for now\n\n Runs the exprs (in an implicit do) in a transaction that encompasses\n exprs and any nested calls. Starts a transaction if none is already\n running on this thread. Any uncaught exception will abort the\n transaction and flow out of sync. The exprs may be run more than\n once, but any effects on Refs will be atomic." [flags-ignored-for-now & body] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.LockingTransaction)) (clojure/list (clojure/concat (clojure/list (quote clojure/runInTransaction)) (clojure/list (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list (clojure/apply clojure/vector (clojure/concat))) body))))))
@@ -971,11 +971,11 @@ return ((ref_1).touch(),
//======
//(defn comp "Takes a set of functions and returns a fn that is the composition\n of those fns. The returned fn takes a variable number of args,\n applies the rightmost of fns to the args, the next\n fn (right-to-left) to the result, etc." [& fs] (let [fs (reverse fs)] (fn [& args] (loop [ret (apply (first fs) args) fs (rest fs)] (if fs (recur ((first fs) ret) (rest fs)) ret)))))
//---
-(function __clojure_fn_4622(){
-return (clojure.JS.def(clojure,"comp",clojure.JS.variadic(0,(function __clojure_fn_4622_comp_4624(){
+(function __clojure_fn_3814(){
+return (clojure.JS.def(clojure,"comp",clojure.JS.variadic(0,(function __clojure_fn_3814_comp_3816(){
var fs_2,fs_1=clojure.JS.rest_args(this,arguments,0);
return (((fs_2=clojure.reverse.apply(null,[fs_1])),
-clojure.JS.variadic(0,(function __clojure_fn_4622_comp_4624_fn_4626(){
+clojure.JS.variadic(0,(function __clojure_fn_3814_comp_3816_fn_3818(){
var fs_3,ret_2,args_1=clojure.JS.rest_args(this,arguments,0);
return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.apply.apply(null,[clojure.first.apply(null,[fs_2]),args_1])),
(fs_3=clojure.rest.apply(null,[fs_2]));do{_cnt=0;
@@ -984,27 +984,27 @@ _rtn=((fs_3)?((_cnt=1,_rtn=[clojure.first.apply(null,[fs_3]).apply(null,[ret_2])
//======
//(defn partial "Takes a function f and fewer than the normal arguments to f, and\n returns a fn that takes a variable number of additional args. When\n called, the returned function calls f with args + additional args." ([f arg1] (fn [& args] (apply f arg1 args))) ([f arg1 arg2] (fn [& args] (apply f arg1 arg2 args))) ([f arg1 arg2 arg3] (fn [& args] (apply f arg1 arg2 arg3 args))) ([f arg1 arg2 arg3 & more] (fn [& args] (apply f arg1 arg2 arg3 (concat more args)))))
//---
-(function __clojure_fn_4652(){
-return (clojure.JS.def(clojure,"partial",clojure.JS.variadic(4,(function __clojure_fn_4652_partial_4654(f_1,arg1_2,arg2_3,arg3_4){switch(arguments.length){
-case 2:return (clojure.JS.variadic(0,(function __clojure_fn_4652_partial_4654_fn_4656(){
+(function __clojure_fn_3823(){
+return (clojure.JS.def(clojure,"partial",clojure.JS.variadic(4,(function __clojure_fn_3823_partial_3825(f_1,arg1_2,arg2_3,arg3_4){switch(arguments.length){
+case 3:return (clojure.JS.variadic(0,(function __clojure_fn_3823_partial_3825_fn_3831(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply.apply(null,[f_1,arg1_2,args_1]))})))
-case 4:return (clojure.JS.variadic(0,(function __clojure_fn_4652_partial_4654_fn_4664(){
+return (clojure.apply.apply(null,[f_1,arg1_2,arg2_3,args_1]))})))
+case 2:return (clojure.JS.variadic(0,(function __clojure_fn_3823_partial_3825_fn_3827(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply.apply(null,[f_1,arg1_2,arg2_3,arg3_4,args_1]))})))
-case 3:return (clojure.JS.variadic(0,(function __clojure_fn_4652_partial_4654_fn_4660(){
+return (clojure.apply.apply(null,[f_1,arg1_2,args_1]))})))
+case 4:return (clojure.JS.variadic(0,(function __clojure_fn_3823_partial_3825_fn_3835(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return (clojure.apply.apply(null,[f_1,arg1_2,arg2_3,args_1]))})))}
+return (clojure.apply.apply(null,[f_1,arg1_2,arg2_3,arg3_4,args_1]))})))}
var more_5=clojure.JS.rest_args(this,arguments,4);
-return (clojure.JS.variadic(0,(function __clojure_fn_4652_partial_4654_fn_4668(){
+return (clojure.JS.variadic(0,(function __clojure_fn_3823_partial_3825_fn_3839(){
var args_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.apply.apply(null,[f_1,arg1_2,arg2_3,arg3_4,clojure.concat.apply(null,[more_5,args_1])]))})))}))))}).apply(null,[]);
//======
//(defn every? "Returns true if (pred x) is logical true for every x in coll, else\n false." {:tag Boolean} [pred coll] (if (seq coll) (and (pred (first coll)) (recur pred (rest coll))) true))
//---
-(function __clojure_fn_4679(){
-return (clojure.JS.def(clojure,"every_QMARK_",(function __clojure_fn_4679_every_QMARK_4681(pred_1,coll_2){
+(function __clojure_fn_3844(){
+return (clojure.JS.def(clojure,"every_QMARK_",(function __clojure_fn_3844_every_QMARK_3846(pred_1,coll_2){
var _cnt,_rtn,and__196_3;
do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((and__196_3=pred_1.apply(null,[clojure.first.apply(null,[coll_2])])),
((and__196_3)?((_cnt=1,_rtn=[pred_1,clojure.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])):(and__196_3)))):(true))
@@ -1013,14 +1013,14 @@ do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((and__196_3=pred_1.apply(nu
//======
//(def not-every? (comp not every?))
//---
-(function __clojure_fn_4688(){
+(function __clojure_fn_3850(){
return (clojure.JS.def(clojure,"not_every_QMARK_",clojure.comp.apply(null,[clojure.not,clojure.every_QMARK_])))}).apply(null,[]);
//======
//(defn some "Returns the first logical true value of (pred x) for any x in coll,\n else nil." [pred coll] (when (seq coll) (or (pred (first coll)) (recur pred (rest coll)))))
//---
-(function __clojure_fn_4697(){
-return (clojure.JS.def(clojure,"some",(function __clojure_fn_4697_some_4699(pred_1,coll_2){
+(function __clojure_fn_3853(){
+return (clojure.JS.def(clojure,"some",(function __clojure_fn_3853_some_3855(pred_1,coll_2){
var _cnt,_rtn,or__202_3;
do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((or__202_3=pred_1.apply(null,[clojure.first.apply(null,[coll_2])])),
((or__202_3)?(or__202_3):((_cnt=1,_rtn=[pred_1,clojure.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1]))))):(null))
@@ -1029,53 +1029,53 @@ do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((or__202_3=pred_1.apply(nul
//======
//(def not-any? (comp not some))
//---
-(function __clojure_fn_4706(){
+(function __clojure_fn_3859(){
return (clojure.JS.def(clojure,"not_any_QMARK_",clojure.comp.apply(null,[clojure.not,clojure.some])))}).apply(null,[]);
//======
-//(defn map "Returns a lazy seq consisting of the result of applying f to the\n set of first items of each coll, followed by applying f to the set\n of second items in each coll, until any one of the colls is\n exhausted. Any remaining items in other colls are ignored. Function\n f should accept number-of-colls arguments." ([f coll] (when (seq coll) (lazy-cons (f (first coll)) (map f (rest coll))))) ([f c1 c2] (when (and (seq c1) (seq c2)) (lazy-cons (f (first c1) (first c2)) (map f (rest c1) (rest c2))))) ([f c1 c2 c3] (when (and (seq c1) (seq c2) (seq c3)) (lazy-cons (f (first c1) (first c2) (first c3)) (map f (rest c1) (rest c2) (rest c3))))) ([f c1 c2 c3 & colls] (let [step (fn step [cs] (when (every? seq cs) (lazy-cons (map first cs) (step (map rest cs)))))] (map (fn* [p1__4709] (apply f p1__4709)) (step (conj colls c3 c2 c1))))))
+//(defn map "Returns a lazy seq consisting of the result of applying f to the\n set of first items of each coll, followed by applying f to the set\n of second items in each coll, until any one of the colls is\n exhausted. Any remaining items in other colls are ignored. Function\n f should accept number-of-colls arguments." ([f coll] (when (seq coll) (lazy-cons (f (first coll)) (map f (rest coll))))) ([f c1 c2] (when (and (seq c1) (seq c2)) (lazy-cons (f (first c1) (first c2)) (map f (rest c1) (rest c2))))) ([f c1 c2 c3] (when (and (seq c1) (seq c2) (seq c3)) (lazy-cons (f (first c1) (first c2) (first c3)) (map f (rest c1) (rest c2) (rest c3))))) ([f c1 c2 c3 & colls] (let [step (fn step [cs] (when (every? seq cs) (lazy-cons (map first cs) (step (map rest cs)))))] (map (fn* [p1__3862] (apply f p1__3862)) (step (conj colls c3 c2 c1))))))
//---
-(function __clojure_fn_4744(){
-return (clojure.JS.def(clojure,"map",clojure.JS.variadic(4,(function __clojure_fn_4744_map_4746(f_1,c1_2,c2_3,c3_4){switch(arguments.length){
-case 4:var and__196_6,and__196_5;
+(function __clojure_fn_3863(){
+return (clojure.JS.def(clojure,"map",clojure.JS.variadic(4,(function __clojure_fn_3863_map_3865(f_1,c1_2,c2_3,c3_4){switch(arguments.length){
+case 2:var coll_2=arguments[1];
+return (((clojure.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_fn_3863_map_3865_fn_3868(G__3867_1){switch(arguments.length){
+case 0:return (f_1.apply(null,[clojure.first.apply(null,[coll_2])]))}
+return (clojure.map.apply(null,[f_1,clojure.rest.apply(null,[coll_2])]))})))):(null)))
+case 4:var and__196_5,and__196_6;
return (((((and__196_5=clojure.seq.apply(null,[c1_2])),
((and__196_5)?(((and__196_6=clojure.seq.apply(null,[c2_3])),
-((and__196_6)?(clojure.seq.apply(null,[c3_4])):(and__196_6)))):(and__196_5))))?((new clojure.lang.LazyCons((function __clojure_fn_4744_map_4746_fn_4761(G__4760_1){switch(arguments.length){
+((and__196_6)?(clojure.seq.apply(null,[c3_4])):(and__196_6)))):(and__196_5))))?((new clojure.lang.LazyCons((function __clojure_fn_3863_map_3865_fn_3880(G__3879_1){switch(arguments.length){
case 0:return (f_1.apply(null,[clojure.first.apply(null,[c1_2]),clojure.first.apply(null,[c2_3]),clojure.first.apply(null,[c3_4])]))}
return (clojure.map.apply(null,[f_1,clojure.rest.apply(null,[c1_2]),clojure.rest.apply(null,[c2_3]),clojure.rest.apply(null,[c3_4])]))})))):(null)))
-case 2:var coll_2=arguments[1];
-return (((clojure.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_fn_4744_map_4746_fn_4749(G__4748_1){switch(arguments.length){
-case 0:return (f_1.apply(null,[clojure.first.apply(null,[coll_2])]))}
-return (clojure.map.apply(null,[f_1,clojure.rest.apply(null,[coll_2])]))})))):(null)))
case 3:var and__196_4;
return (((((and__196_4=clojure.seq.apply(null,[c1_2])),
-((and__196_4)?(clojure.seq.apply(null,[c2_3])):(and__196_4))))?((new clojure.lang.LazyCons((function __clojure_fn_4744_map_4746_fn_4755(G__4754_1){switch(arguments.length){
+((and__196_4)?(clojure.seq.apply(null,[c2_3])):(and__196_4))))?((new clojure.lang.LazyCons((function __clojure_fn_3863_map_3865_fn_3874(G__3873_1){switch(arguments.length){
case 0:return (f_1.apply(null,[clojure.first.apply(null,[c1_2]),clojure.first.apply(null,[c2_3])]))}
return (clojure.map.apply(null,[f_1,clojure.rest.apply(null,[c1_2]),clojure.rest.apply(null,[c2_3])]))})))):(null)))}
var step_6,colls_5=clojure.JS.rest_args(this,arguments,4);
-return (((step_6=(function __clojure_fn_4744_map_4746_step_4766(cs_1){
+return (((step_6=(function __clojure_fn_3863_map_3865_step_3885(cs_1){
var step_0=arguments.callee;
-return (((clojure.every_QMARK_.apply(null,[clojure.seq,cs_1]))?((new clojure.lang.LazyCons((function __clojure_fn_4744_map_4746_step_4766_fn_4768(G__4767_1){switch(arguments.length){
+return (((clojure.every_QMARK_.apply(null,[clojure.seq,cs_1]))?((new clojure.lang.LazyCons((function __clojure_fn_3863_map_3865_step_3885_fn_3887(G__3886_1){switch(arguments.length){
case 0:return (clojure.map.apply(null,[clojure.first,cs_1]))}
return (step_0.apply(null,[clojure.map.apply(null,[clojure.rest,cs_1])]))})))):(null)))})),
-clojure.map.apply(null,[(function __clojure_fn_4744_map_4746_fn_4773(p1__4709_1){
-return (clojure.apply.apply(null,[f_1,p1__4709_1]))}),step_6.apply(null,[clojure.conj.apply(null,[colls_5,c3_4,c2_3,c1_2])])])))}))))}).apply(null,[]);
+clojure.map.apply(null,[(function __clojure_fn_3863_map_3865_fn_3892(p1__3862_1){
+return (clojure.apply.apply(null,[f_1,p1__3862_1]))}),step_6.apply(null,[clojure.conj.apply(null,[colls_5,c3_4,c2_3,c1_2])])])))}))))}).apply(null,[]);
//======
//(defn mapcat "Returns the result of applying concat to the result of applying map\n to f and colls. Thus function f should return a collection." [f & colls] (apply concat (apply map f colls)))
//---
-(function __clojure_fn_4784(){
-return (clojure.JS.def(clojure,"mapcat",clojure.JS.variadic(1,(function __clojure_fn_4784_mapcat_4786(f_1){
+(function __clojure_fn_3897(){
+return (clojure.JS.def(clojure,"mapcat",clojure.JS.variadic(1,(function __clojure_fn_3897_mapcat_3899(f_1){
var colls_2=clojure.JS.rest_args(this,arguments,1);
return (clojure.apply.apply(null,[clojure.concat,clojure.apply.apply(null,[clojure.map,f_1,colls_2])]))}))))}).apply(null,[]);
//======
//(defn filter "Returns a lazy seq of the items in coll for which\n (pred item) returns true. pred must be free of side-effects." [pred coll] (when (seq coll) (if (pred (first coll)) (lazy-cons (first coll) (filter pred (rest coll))) (recur pred (rest coll)))))
//---
-(function __clojure_fn_4801(){
-return (clojure.JS.def(clojure,"filter",(function __clojure_fn_4801_filter_4803(pred_1,coll_2){
+(function __clojure_fn_3903(){
+return (clojure.JS.def(clojure,"filter",(function __clojure_fn_3903_filter_3905(pred_1,coll_2){
var _cnt,_rtn;
-do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((pred_1.apply(null,[clojure.first.apply(null,[coll_2])]))?((new clojure.lang.LazyCons((function __clojure_fn_4801_filter_4803_fn_4806(G__4805_1){switch(arguments.length){
+do{_cnt=0;_rtn=((clojure.seq.apply(null,[coll_2]))?(((pred_1.apply(null,[clojure.first.apply(null,[coll_2])]))?((new clojure.lang.LazyCons((function __clojure_fn_3903_filter_3905_fn_3908(G__3907_1){switch(arguments.length){
case 0:return (clojure.first.apply(null,[coll_2]))}
return (clojure.filter.apply(null,[pred_1,clojure.rest.apply(null,[coll_2])]))})))):((_cnt=1,_rtn=[pred_1,clojure.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])))):(null))
}while(_cnt);return _rtn;})))}).apply(null,[]);
@@ -1083,30 +1083,30 @@ return (clojure.filter.apply(null,[pred_1,clojure.rest.apply(null,[coll_2])]))})
//======
//(defn take "Returns a lazy seq of the first n items in coll, or all items if\n there are fewer than n." [n coll] (when (and (pos? n) (seq coll)) (lazy-cons (first coll) (take (dec n) (rest coll)))))
//---
-(function __clojure_fn_4823(){
-return (clojure.JS.def(clojure,"take",(function __clojure_fn_4823_take_4825(n_1,coll_2){
+(function __clojure_fn_3914(){
+return (clojure.JS.def(clojure,"take",(function __clojure_fn_3914_take_3916(n_1,coll_2){
var and__196_3;
return (((((and__196_3=clojure.lang.Numbers.isPos(n_1)),
-((and__196_3)?(clojure.seq.apply(null,[coll_2])):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_4823_take_4825_fn_4828(G__4827_1){switch(arguments.length){
+((and__196_3)?(clojure.seq.apply(null,[coll_2])):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_3914_take_3916_fn_3919(G__3918_1){switch(arguments.length){
case 0:return (clojure.first.apply(null,[coll_2]))}
return (clojure.take.apply(null,[clojure.lang.Numbers.dec(n_1),clojure.rest.apply(null,[coll_2])]))})))):(null)))})))}).apply(null,[]);
//======
//(defn take-while "Returns a lazy seq of successive items from coll while\n (pred item) returns true. pred must be free of side-effects." [pred coll] (when (and (seq coll) (pred (first coll))) (lazy-cons (first coll) (take-while pred (rest coll)))))
//---
-(function __clojure_fn_4845(){
-return (clojure.JS.def(clojure,"take_while",(function __clojure_fn_4845_take_while_4847(pred_1,coll_2){
+(function __clojure_fn_3925(){
+return (clojure.JS.def(clojure,"take_while",(function __clojure_fn_3925_take_while_3927(pred_1,coll_2){
var and__196_3;
return (((((and__196_3=clojure.seq.apply(null,[coll_2])),
-((and__196_3)?(pred_1.apply(null,[clojure.first.apply(null,[coll_2])])):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_4845_take_while_4847_fn_4850(G__4849_1){switch(arguments.length){
+((and__196_3)?(pred_1.apply(null,[clojure.first.apply(null,[coll_2])])):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_3925_take_while_3927_fn_3930(G__3929_1){switch(arguments.length){
case 0:return (clojure.first.apply(null,[coll_2]))}
return (clojure.take_while.apply(null,[pred_1,clojure.rest.apply(null,[coll_2])]))})))):(null)))})))}).apply(null,[]);
//======
//(defn drop "Returns a lazy seq of all but the first n items in coll." [n coll] (if (and (pos? n) (seq coll)) (recur (dec n) (rest coll)) (seq coll)))
//---
-(function __clojure_fn_4862(){
-return (clojure.JS.def(clojure,"drop",(function __clojure_fn_4862_drop_4864(n_1,coll_2){
+(function __clojure_fn_3936(){
+return (clojure.JS.def(clojure,"drop",(function __clojure_fn_3936_drop_3938(n_1,coll_2){
var _cnt,_rtn,and__196_3;
do{_cnt=0;_rtn=((((and__196_3=clojure.lang.Numbers.isPos(n_1)),
((and__196_3)?(clojure.seq.apply(null,[coll_2])):(and__196_3))))?((_cnt=1,_rtn=[clojure.lang.Numbers.dec(n_1),clojure.rest.apply(null,[coll_2])],n_1=_rtn[0],coll_2=_rtn[1])):(clojure.seq.apply(null,[coll_2])))
@@ -1115,18 +1115,18 @@ do{_cnt=0;_rtn=((((and__196_3=clojure.lang.Numbers.isPos(n_1)),
//======
//(defn drop-last "Return a lazy seq of all but the last n (default 1) items in coll" ([s] (drop-last 1 s)) ([n s] (map (fn [x _] x) (seq s) (drop n s))))
//---
-(function __clojure_fn_4878(){
-return (clojure.JS.def(clojure,"drop_last",(function __clojure_fn_4878_drop_last_4880(n_1,s_2){switch(arguments.length){
+(function __clojure_fn_3942(){
+return (clojure.JS.def(clojure,"drop_last",(function __clojure_fn_3942_drop_last_3944(n_1,s_2){switch(arguments.length){
case 1:var s_1=arguments[0];
return (clojure.drop_last.apply(null,[1,s_1]))}
-return (clojure.map.apply(null,[(function __clojure_fn_4878_drop_last_4880_fn_4883(x_1,__2){
+return (clojure.map.apply(null,[(function __clojure_fn_3942_drop_last_3944_fn_3947(x_1,__2){
return (x_1)}),clojure.seq.apply(null,[s_2]),clojure.drop.apply(null,[n_1,s_2])]))})))}).apply(null,[]);
//======
//(defn drop-while "Returns a lazy seq of the items in coll starting from the first\n item for which (pred item) returns nil." [pred coll] (if (and (seq coll) (pred (first coll))) (recur pred (rest coll)) (seq coll)))
//---
-(function __clojure_fn_4894(){
-return (clojure.JS.def(clojure,"drop_while",(function __clojure_fn_4894_drop_while_4896(pred_1,coll_2){
+(function __clojure_fn_3952(){
+return (clojure.JS.def(clojure,"drop_while",(function __clojure_fn_3952_drop_while_3954(pred_1,coll_2){
var _cnt,_rtn,and__196_3;
do{_cnt=0;_rtn=((((and__196_3=clojure.seq.apply(null,[coll_2])),
((and__196_3)?(pred_1.apply(null,[clojure.first.apply(null,[coll_2])])):(and__196_3))))?((_cnt=1,_rtn=[pred_1,clojure.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])):(clojure.seq.apply(null,[coll_2])))
@@ -1135,12 +1135,12 @@ do{_cnt=0;_rtn=((((and__196_3=clojure.seq.apply(null,[coll_2])),
//======
//(defn cycle "Returns a lazy (infinite!) seq of repetitions of the items in\n coll." [coll] (when (seq coll) (let [rep (fn thisfn [xs] (if xs (lazy-cons (first xs) (thisfn (rest xs))) (recur (seq coll))))] (rep (seq coll)))))
//---
-(function __clojure_fn_4913(){
-return (clojure.JS.def(clojure,"cycle",(function __clojure_fn_4913_cycle_4915(coll_1){
+(function __clojure_fn_3958(){
+return (clojure.JS.def(clojure,"cycle",(function __clojure_fn_3958_cycle_3960(coll_1){
var rep_2;
-return (((clojure.seq.apply(null,[coll_1]))?(((rep_2=(function __clojure_fn_4913_cycle_4915_thisfn_4917(xs_1){
+return (((clojure.seq.apply(null,[coll_1]))?(((rep_2=(function __clojure_fn_3958_cycle_3960_thisfn_3962(xs_1){
var _cnt,_rtn,thisfn_0=arguments.callee;
-do{_cnt=0;_rtn=((xs_1)?((new clojure.lang.LazyCons((function __clojure_fn_4913_cycle_4915_thisfn_4917_fn_4919(G__4918_1){switch(arguments.length){
+do{_cnt=0;_rtn=((xs_1)?((new clojure.lang.LazyCons((function __clojure_fn_3958_cycle_3960_thisfn_3962_fn_3964(G__3963_1){switch(arguments.length){
case 0:return (clojure.first.apply(null,[xs_1]))}
return (thisfn_0.apply(null,[clojure.rest.apply(null,[xs_1])]))})))):((_cnt=1,_rtn=[clojure.seq.apply(null,[coll_1])],xs_1=_rtn[0])))
}while(_cnt);return _rtn;})),
@@ -1149,84 +1149,84 @@ rep_2.apply(null,[clojure.seq.apply(null,[coll_1])]))):(null)))})))}).apply(null
//======
//(defn split-at "Returns a vector of [(take n coll) (drop n coll)]" [n coll] [(take n coll) (drop n coll)])
//---
-(function __clojure_fn_4932(){
-return (clojure.JS.def(clojure,"split_at",(function __clojure_fn_4932_split_at_4934(n_1,coll_2){
+(function __clojure_fn_3971(){
+return (clojure.JS.def(clojure,"split_at",(function __clojure_fn_3971_split_at_3973(n_1,coll_2){
return (clojure.JS.lit_vector([clojure.take.apply(null,[n_1,coll_2]),clojure.drop.apply(null,[n_1,coll_2])]))})))}).apply(null,[]);
//======
//(defn split-with "Returns a vector of [(take-while pred coll) (drop-while pred coll)]" [pred coll] [(take-while pred coll) (drop-while pred coll)])
//---
-(function __clojure_fn_4944(){
-return (clojure.JS.def(clojure,"split_with",(function __clojure_fn_4944_split_with_4946(pred_1,coll_2){
+(function __clojure_fn_3977(){
+return (clojure.JS.def(clojure,"split_with",(function __clojure_fn_3977_split_with_3979(pred_1,coll_2){
return (clojure.JS.lit_vector([clojure.take_while.apply(null,[pred_1,coll_2]),clojure.drop_while.apply(null,[pred_1,coll_2])]))})))}).apply(null,[]);
//======
//(defn repeat "Returns a lazy (infinite!) seq of xs." [x] (lazy-cons x (repeat x)))
//---
-(function __clojure_fn_4961(){
-return (clojure.JS.def(clojure,"repeat",(function __clojure_fn_4961_repeat_4963(x_1){
-return ((new clojure.lang.LazyCons((function __clojure_fn_4961_repeat_4963_fn_4966(G__4965_1){switch(arguments.length){
+(function __clojure_fn_3983(){
+return (clojure.JS.def(clojure,"repeat",(function __clojure_fn_3983_repeat_3985(x_1){
+return ((new clojure.lang.LazyCons((function __clojure_fn_3983_repeat_3985_fn_3988(G__3987_1){switch(arguments.length){
case 0:return (x_1)}
return (clojure.repeat.apply(null,[x_1]))}))))})))}).apply(null,[]);
//======
//(defn replicate "Returns a lazy seq of n xs." [n x] (take n (repeat x)))
//---
-(function __clojure_fn_4978(){
-return (clojure.JS.def(clojure,"replicate",(function __clojure_fn_4978_replicate_4980(n_1,x_2){
+(function __clojure_fn_3994(){
+return (clojure.JS.def(clojure,"replicate",(function __clojure_fn_3994_replicate_3996(n_1,x_2){
return (clojure.take.apply(null,[n_1,clojure.repeat.apply(null,[x_2])]))})))}).apply(null,[]);
//======
//(defn iterate "Returns a lazy seq of x, (f x), (f (f x)) etc. f must be free of side-effects" [f x] (lazy-cons x (iterate f (f x))))
//---
-(function __clojure_fn_4995(){
-return (clojure.JS.def(clojure,"iterate",(function __clojure_fn_4995_iterate_4997(f_1,x_2){
-return ((new clojure.lang.LazyCons((function __clojure_fn_4995_iterate_4997_fn_5000(G__4999_1){switch(arguments.length){
+(function __clojure_fn_4000(){
+return (clojure.JS.def(clojure,"iterate",(function __clojure_fn_4000_iterate_4002(f_1,x_2){
+return ((new clojure.lang.LazyCons((function __clojure_fn_4000_iterate_4002_fn_4005(G__4004_1){switch(arguments.length){
case 0:return (x_2)}
return (clojure.iterate.apply(null,[f_1,f_1.apply(null,[x_2])]))}))))})))}).apply(null,[]);
//======
-//(defn range "Returns a lazy seq of nums from start (inclusive) to end\n (exclusive), by step, where start defaults to 0 and step to 1." ([end] (if (and (> end 0) (< end clojure.lang.RT/IntegerMaxValue)) (new clojure.lang.Range 0 end) (take end (iterate inc 0)))) ([start end] (if (and (< start end) (< end clojure.lang.RT/IntegerMaxValue)) (new clojure.lang.Range start end) (take (- end start) (iterate inc start)))) ([start end step] (take-while (partial (if (pos? step) > <) end) (iterate (partial + step) start))))
+//(defn range "Returns a lazy seq of nums from start (inclusive) to end\n (exclusive), by step, where start defaults to 0 and step to 1." ([end] (if (and (> end 0) (< end (. Integer MAX_VALUE))) (new clojure.lang.Range 0 end) (take end (iterate inc 0)))) ([start end] (if (and (< start end) (< end (. Integer MAX_VALUE))) (new clojure.lang.Range start end) (take (- end start) (iterate inc start)))) ([start end step] (take-while (partial (if (pos? step) > <) end) (iterate (partial + step) start))))
//---
-(function __clojure_fn_5014(){
-return (clojure.JS.def(clojure,"range",(function __clojure_fn_5014_range_5016(start_1,end_2,step_3){switch(arguments.length){
-case 1:var and__196_2,end_1=arguments[0];
-return (((((and__196_2=clojure.lang.Numbers.gt(end_1,0)),
-((and__196_2)?(clojure.lang.Numbers.lt(end_1,clojure.lang.RT.IntegerMaxValue)):(and__196_2))))?((new clojure.lang.Range(0,end_1))):(clojure.take.apply(null,[end_1,clojure.iterate.apply(null,[clojure.inc,0])]))))
+(function __clojure_fn_4011(){
+return (clojure.JS.def(clojure,"range",(function __clojure_fn_4011_range_4013(start_1,end_2,step_3){switch(arguments.length){
case 2:var and__196_3;
return (((((and__196_3=clojure.lang.Numbers.lt(start_1,end_2)),
-((and__196_3)?(clojure.lang.Numbers.lt(end_2,clojure.lang.RT.IntegerMaxValue)):(and__196_3))))?((new clojure.lang.Range(start_1,end_2))):(clojure.take.apply(null,[clojure.lang.Numbers.minus(end_2,start_1),clojure.iterate.apply(null,[clojure.inc,start_1])]))))}
+((and__196_3)?(clojure.lang.Numbers.lt(end_2,java.lang.Integer.MAX_VALUE)):(and__196_3))))?((new clojure.lang.Range(start_1,end_2))):(clojure.take.apply(null,[clojure.lang.Numbers.minus(end_2,start_1),clojure.iterate.apply(null,[clojure.inc,start_1])]))))
+case 1:var and__196_2,end_1=arguments[0];
+return (((((and__196_2=clojure.lang.Numbers.gt(end_1,0)),
+((and__196_2)?(clojure.lang.Numbers.lt(end_1,java.lang.Integer.MAX_VALUE)):(and__196_2))))?((new clojure.lang.Range(0,end_1))):(clojure.take.apply(null,[end_1,clojure.iterate.apply(null,[clojure.inc,0])]))))}
return (clojure.take_while.apply(null,[clojure.partial.apply(null,[((clojure.lang.Numbers.isPos(step_3))?(clojure._GT_):(clojure._LT_)),end_2]),clojure.iterate.apply(null,[clojure.partial.apply(null,[clojure._PLUS_,step_3]),start_1])]))})))}).apply(null,[]);
//======
//(defn merge "Returns a map that consists of the rest of the maps conj-ed onto\n the first. If a key occurs in more than one map, the mapping from\n the latter (left-to-right) will be the mapping in the result." [& maps] (reduce conj maps))
//---
-(function __clojure_fn_5028(){
-return (clojure.JS.def(clojure,"merge",clojure.JS.variadic(0,(function __clojure_fn_5028_merge_5030(){
+(function __clojure_fn_4019(){
+return (clojure.JS.def(clojure,"merge",clojure.JS.variadic(0,(function __clojure_fn_4019_merge_4021(){
var maps_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.reduce.apply(null,[clojure.conj,maps_1]))}))))}).apply(null,[]);
//======
//(defn merge-with "Returns a map that consists of the rest of the maps conj-ed onto\n the first. If a key occurs in more than one map, the mapping(s)\n from the latter (left-to-right) will be combined with the mapping in\n the result by calling (f val-in-result val-in-latter)." [f & maps] (let [merge-entry (fn [m e] (let [k (key e) v (val e)] (if (contains? m k) (assoc m k (f (m k) v)) (assoc m k v)))) merge2 (fn [m1 m2] (reduce merge-entry m1 (seq m2)))] (reduce merge2 maps)))
//---
-(function __clojure_fn_5046(){
-return (clojure.JS.def(clojure,"merge_with",clojure.JS.variadic(1,(function __clojure_fn_5046_merge_with_5048(f_1){
-var merge2_4,merge_entry_3,maps_2=clojure.JS.rest_args(this,arguments,1);
-return (((merge_entry_3=(function __clojure_fn_5046_merge_with_5048_merge_entry_5050(m_1,e_2){
+(function __clojure_fn_4025(){
+return (clojure.JS.def(clojure,"merge_with",clojure.JS.variadic(1,(function __clojure_fn_4025_merge_with_4027(f_1){
+var merge_entry_3,merge2_4,maps_2=clojure.JS.rest_args(this,arguments,1);
+return (((merge_entry_3=(function __clojure_fn_4025_merge_with_4027_merge_entry_4029(m_1,e_2){
var v_4,k_3;
return (((k_3=clojure.key.apply(null,[e_2])),
(v_4=clojure.val.apply(null,[e_2])),
((clojure.contains_QMARK_.apply(null,[m_1,k_3]))?(clojure.assoc.apply(null,[m_1,k_3,f_1.apply(null,[m_1.apply(null,[k_3]),v_4])])):(clojure.assoc.apply(null,[m_1,k_3,v_4])))))})),
-(merge2_4=(function __clojure_fn_5046_merge_with_5048_merge2_5053(m1_1,m2_2){
+(merge2_4=(function __clojure_fn_4025_merge_with_4027_merge2_4032(m1_1,m2_2){
return (clojure.reduce.apply(null,[merge_entry_3,m1_1,clojure.seq.apply(null,[m2_2])]))})),
clojure.reduce.apply(null,[merge2_4,maps_2])))}))))}).apply(null,[]);
//======
//(defn zipmap "Returns a map with the keys mapped to the corresponding vals." [keys vals] (loop [map {} ks (seq keys) vs (seq vals)] (if (and ks vs) (recur (assoc map (first ks) (first vs)) (rest ks) (rest vs)) map)))
//---
-(function __clojure_fn_5064(){
-return (clojure.JS.def(clojure,"zipmap",(function __clojure_fn_5064_zipmap_5066(keys_1,vals_2){
-var ks_4,vs_5,map_3,and__196_6;
+(function __clojure_fn_4037(){
+return (clojure.JS.def(clojure,"zipmap",(function __clojure_fn_4037_zipmap_4039(keys_1,vals_2){
+var vs_5,ks_4,and__196_6,map_3;
return (((function __loop(){var _rtn,_cnt;(map_3=clojure.lang.PersistentHashMap.EMPTY),
(ks_4=clojure.seq.apply(null,[keys_1])),
(vs_5=clojure.seq.apply(null,[vals_2]));do{_cnt=0;
@@ -1236,69 +1236,69 @@ _rtn=((((and__196_6=ks_4),
//======
//(defn line-seq "Returns the lines of text from rdr as a lazy sequence of strings.\n rdr must implement java.io.BufferedReader." [rdr] (let [line (. rdr (readLine))] (when line (lazy-cons line (line-seq rdr)))))
//---
-(function __clojure_fn_5081(){
-return (clojure.JS.def(clojure,"line_seq",(function __clojure_fn_5081_line_seq_5083(rdr_1){
+(function __clojure_fn_4043(){
+return (clojure.JS.def(clojure,"line_seq",(function __clojure_fn_4043_line_seq_4045(rdr_1){
var line_2;
return (((line_2=(rdr_1).readLine()),
-((line_2)?((new clojure.lang.LazyCons((function __clojure_fn_5081_line_seq_5083_fn_5086(G__5085_1){switch(arguments.length){
+((line_2)?((new clojure.lang.LazyCons((function __clojure_fn_4043_line_seq_4045_fn_4048(G__4047_1){switch(arguments.length){
case 0:return (line_2)}
return (clojure.line_seq.apply(null,[rdr_1]))})))):(null))))})))}).apply(null,[]);
//======
//(defn comparator "Returns an implementation of java.util.Comparator based upon pred." [pred] (fn [x y] (cond (pred x y) -1 (pred y x) 1 :else 0)))
//---
-(function __clojure_fn_5101(){
-return (clojure.JS.def(clojure,"comparator",(function __clojure_fn_5101_comparator_5103(pred_1){
-return ((function __clojure_fn_5101_comparator_5103_fn_5105(x_1,y_2){
+(function __clojure_fn_4054(){
+return (clojure.JS.def(clojure,"comparator",(function __clojure_fn_4054_comparator_4056(pred_1){
+return ((function __clojure_fn_4054_comparator_4056_fn_4058(x_1,y_2){
return (((pred_1.apply(null,[x_1,y_2]))?(-1):(((pred_1.apply(null,[y_2,x_1]))?(1):(((clojure.keyword("","else"))?(0):(null)))))))}))})))}).apply(null,[]);
//======
-//(defn sort "Returns a sorted sequence of the items in coll. If no comparator is\n supplied, uses compare. comparator must\n implement java.util.Comparator." ([coll] (sort compare coll)) ([comp coll] (when (and coll (not (zero? (count coll)))) (let [a (to-array coll)] (clojure.lang.RT/sortArray a comp) (seq a)))))
+//(defn sort "Returns a sorted sequence of the items in coll. If no comparator is\n supplied, uses compare. comparator must\n implement java.util.Comparator." ([coll] (sort compare coll)) ([comp coll] (when (and coll (not (zero? (count coll)))) (let [a (to-array coll)] (. java.util.Arrays (sort a comp)) (seq a)))))
//---
-(function __clojure_fn_5117(){
-return (clojure.JS.def(clojure,"sort",(function __clojure_fn_5117_sort_5119(comp_1,coll_2){switch(arguments.length){
+(function __clojure_fn_4063(){
+return (clojure.JS.def(clojure,"sort",(function __clojure_fn_4063_sort_4065(comp_1,coll_2){switch(arguments.length){
case 1:var coll_1=arguments[0];
return (clojure.sort.apply(null,[clojure.compare,coll_1]))}
var a_3,and__196_3;
return (((((and__196_3=coll_2),
((and__196_3)?(clojure.not.apply(null,[clojure.lang.Numbers.isZero(clojure.count.apply(null,[coll_2]))])):(and__196_3))))?(((a_3=clojure.to_array.apply(null,[coll_2])),
-clojure.lang.RT.sortArray(a_3,comp_1),
+java.util.Arrays.sort(a_3,comp_1),
clojure.seq.apply(null,[a_3]))):(null)))})))}).apply(null,[]);
//======
//(defn sort-by "Returns a sorted sequence of the items in coll, where the sort\n order is determined by comparing (keyfn item). If no comparator is\n supplied, uses compare. comparator must\n implement java.util.Comparator." ([keyfn coll] (sort-by keyfn compare coll)) ([keyfn comp coll] (sort (fn [x y] (. comp (compare (keyfn x) (keyfn y)))) coll)))
//---
-(function __clojure_fn_5134(){
-return (clojure.JS.def(clojure,"sort_by",(function __clojure_fn_5134_sort_by_5136(keyfn_1,comp_2,coll_3){switch(arguments.length){
+(function __clojure_fn_4070(){
+return (clojure.JS.def(clojure,"sort_by",(function __clojure_fn_4070_sort_by_4072(keyfn_1,comp_2,coll_3){switch(arguments.length){
case 2:var coll_2=arguments[1];
return (clojure.sort_by.apply(null,[keyfn_1,clojure.compare,coll_2]))}
-return (clojure.sort.apply(null,[(function __clojure_fn_5134_sort_by_5136_fn_5139(x_1,y_2){
+return (clojure.sort.apply(null,[(function __clojure_fn_4070_sort_by_4072_fn_4075(x_1,y_2){
return ((comp_2).compare(keyfn_1.apply(null,[x_1]),keyfn_1.apply(null,[y_2])))}),coll_3]))})))}).apply(null,[]);
// Skipping: (defn eval "Evaluates the form data structure (not text!) and returns the result." [form] (. clojure.lang.Compiler (eval form)))
-// Skipping: (defmacro doseq "Repeatedly executes body (presumably for side-effects) with\n binding-form bound to successive items from coll. Does not retain\n the head of the sequence. Returns nil." [item list & body] (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote list__5150)) (clojure/list (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list list)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (quote list__5150)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list item) (clojure/list (clojure/concat (clojure/list (quote clojure/first)) (clojure/list (quote list__5150))))))) body)) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list (quote list__5150))))))))))
+// Skipping: (defmacro doseq "Repeatedly executes body (presumably for side-effects) with\n binding-form bound to successive items from coll. Does not retain\n the head of the sequence. Returns nil." [item list & body] (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote list__4086)) (clojure/list (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list list)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (quote list__4086)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list item) (clojure/list (clojure/concat (clojure/list (quote clojure/first)) (clojure/list (quote list__4086))))))) body)) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list (quote list__4086))))))))))
//======
-//(defn scan [& args] (throw (clojure.lang.RT/makeException "scan is now called dorun")))
+//(defn scan [& args] (throw (new Exception "scan is now called dorun")))
//---
-(function __clojure_fn_5163(){
-return (clojure.JS.def(clojure,"scan",clojure.JS.variadic(0,(function __clojure_fn_5163_scan_5165(){
+(function __clojure_fn_4093(){
+return (clojure.JS.def(clojure,"scan",clojure.JS.variadic(0,(function __clojure_fn_4093_scan_4095(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw clojure.lang.RT.makeException("scan is now called dorun")})())}))))}).apply(null,[]);
+return ((function __throw(){throw (new java.lang.Exception("scan is now called dorun"))})())}))))}).apply(null,[]);
//======
-//(defn touch [& args] (throw (clojure.lang.RT/makeException "touch is now called doall")))
+//(defn touch [& args] (throw (new Exception "touch is now called doall")))
//---
-(function __clojure_fn_5175(){
-return (clojure.JS.def(clojure,"touch",clojure.JS.variadic(0,(function __clojure_fn_5175_touch_5177(){
+(function __clojure_fn_4099(){
+return (clojure.JS.def(clojure,"touch",clojure.JS.variadic(0,(function __clojure_fn_4099_touch_4101(){
var args_1=clojure.JS.rest_args(this,arguments,0);
-return ((function __throw(){throw clojure.lang.RT.makeException("touch is now called doall")})())}))))}).apply(null,[]);
+return ((function __throw(){throw (new java.lang.Exception("touch is now called doall"))})())}))))}).apply(null,[]);
//======
//(defn dorun "When lazy sequences are produced via functions that have side\n effects, any effects other than those needed to produce the first\n element in the seq do not occur until the seq is consumed. dorun can\n be used to force any effects. Walks through the successive rests of\n the seq, does not retain the head and returns nil." ([coll] (when (and (seq coll) (or (first coll) true)) (recur (rest coll)))) ([n coll] (when (and (seq coll) (pos? n) (or (first coll) true)) (recur (dec n) (rest coll)))))
//---
-(function __clojure_fn_5188(){
-return (clojure.JS.def(clojure,"dorun",(function __clojure_fn_5188_dorun_5190(n_1,coll_2){switch(arguments.length){
-case 1:var _cnt,_rtn,or__202_3,and__196_2,coll_1=arguments[0];
+(function __clojure_fn_4105(){
+return (clojure.JS.def(clojure,"dorun",(function __clojure_fn_4105_dorun_4107(n_1,coll_2){switch(arguments.length){
+case 1:var _cnt,_rtn,and__196_2,or__202_3,coll_1=arguments[0];
do{_cnt=0;_rtn=((((and__196_2=clojure.seq.apply(null,[coll_1])),
((and__196_2)?(((or__202_3=clojure.first.apply(null,[coll_1])),
((or__202_3)?(or__202_3):(true)))):(and__196_2))))?((_cnt=1,_rtn=[clojure.rest.apply(null,[coll_1])],coll_1=_rtn[0])):(null))
@@ -1313,44 +1313,38 @@ do{_cnt=0;_rtn=((((and__196_3=clojure.seq.apply(null,[coll_2])),
//======
//(defn doall "When lazy sequences are produced via functions that have side\n effects, any effects other than those needed to produce the first\n element in the seq do not occur until the seq is consumed. doall can\n be used to force any effects. Walks through the successive rests of\n the seq, retains the head and returns it, thus causing the entire\n seq to reside in memory at one time." ([coll] (dorun coll) coll) ([n coll] (dorun n coll) coll))
//---
-(function __clojure_fn_5202(){
-return (clojure.JS.def(clojure,"doall",(function __clojure_fn_5202_doall_5204(n_1,coll_2){switch(arguments.length){
+(function __clojure_fn_4112(){
+return (clojure.JS.def(clojure,"doall",(function __clojure_fn_4112_doall_4114(n_1,coll_2){switch(arguments.length){
case 1:var coll_1=arguments[0];
return (clojure.dorun.apply(null,[coll_1]),
coll_1)}
return (clojure.dorun.apply(null,[n_1,coll_2]),
coll_2)})))}).apply(null,[]);
-// Skipping: (defn await "Blocks the current thread (indefinitely!) until all actions\n dispatched thus far, from this thread or agent, to the agent(s) have\n occurred." [& agents] (when *agent* (throw (clojure.lang.RT/makeException "Can't await in agent action"))) (let [latch (new java.util.concurrent.CountDownLatch (count agents)) count-down (fn [agent] (. latch (countDown)) agent)] (doseq agent agents (send agent count-down)) (. latch (await))))
+// Skipping: (defn await "Blocks the current thread (indefinitely!) until all actions\n dispatched thus far, from this thread or agent, to the agent(s) have\n occurred." [& agents] (when *agent* (throw (new Exception "Can't await in agent action"))) (let [latch (new java.util.concurrent.CountDownLatch (count agents)) count-down (fn [agent] (. latch (countDown)) agent)] (doseq agent agents (send agent count-down)) (. latch (await))))
//======
//(defn await1 [a] (when (pos? (.getQueueCount a)) (await a)) a)
//---
-(function __clojure_fn_5224(){
-return (clojure.JS.def(clojure,"await1",(function __clojure_fn_5224_await1_5226(a_1){
+(function __clojure_fn_4128(){
+return (clojure.JS.def(clojure,"await1",(function __clojure_fn_4128_await1_4130(a_1){
return (((clojure.lang.Numbers.isPos((a_1).getQueueCount()))?(clojure.await.apply(null,[a_1])):(null)),
a_1)})))}).apply(null,[]);
-// Skipping: (defn await-for "Blocks the current thread until all actions dispatched thus\n far (from this thread or agent) to the agents have occurred, or the\n timeout (in milliseconds) has elapsed. Returns nil if returning due\n to timeout, non-nil otherwise." [timeout-ms & agents] (when *agent* (throw (clojure.lang.RT/makeException "Can't await in agent action"))) (let [latch (new java.util.concurrent.CountDownLatch (count agents)) count-down (fn [agent] (. latch (countDown)) agent)] (doseq agent agents (send agent count-down)) (. latch (await timeout-ms (. java.util.concurrent.TimeUnit MILLISECONDS)))))
-// Skipping: (defmacro dotimes "Repeatedly executes body (presumably for side-effects) with name\n bound to integers from 0 through n-1." [i n & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote n__5239)) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list n)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list i) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list i) (clojure/list (quote n__5239)))) body (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list i)))))))))))
+// Skipping: (defn await-for "Blocks the current thread until all actions dispatched thus\n far (from this thread or agent) to the agents have occurred, or the\n timeout (in milliseconds) has elapsed. Returns nil if returning due\n to timeout, non-nil otherwise." [timeout-ms & agents] (when *agent* (throw (new Exception "Can't await in agent action"))) (let [latch (new java.util.concurrent.CountDownLatch (count agents)) count-down (fn [agent] (. latch (countDown)) agent)] (doseq agent agents (send agent count-down)) (. latch (await timeout-ms (. java.util.concurrent.TimeUnit MILLISECONDS)))))
+// Skipping: (defmacro dotimes "Repeatedly executes body (presumably for side-effects) with name\n bound to integers from 0 through n-1." [i n & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote n__4143)) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list n)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list i) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list i) (clojure/list (quote n__4143)))) body (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list i)))))))))))
// Skipping: (defn import "import-list => (package-symbol class-name-symbols*)\n\n For each name in class-name-symbols, adds a mapping from name to the\n class named by package.name to the current namespace. Use :import in the ns \n macro in preference to calling this directly." [& import-lists] (when import-lists (let [ns *ns* pkg (ffirst import-lists) classes (rfirst import-lists)] (doseq c classes (. ns (importClass c (. Class (forName (str pkg "." c))))))) (apply import (rest import-lists))))
//======
-//(import (quote (clojure.lang RT)))
-//---
-(function __clojure_fn_5255(){
-return (clojure.import_.apply(null,[clojure.JS.lit_list(["'clojure.lang","'RT"])]))}).apply(null,[]);
-
-//======
//(defn into-array "Returns an array of the type of the first element in coll,\n containing the contents of coll, which must be of a compatible\n type." [aseq] (. clojure.lang.RT (seqToTypedArray (seq aseq))))
//---
-(function __clojure_fn_5264(){
-return (clojure.JS.def(clojure,"into_array",(function __clojure_fn_5264_into_array_5266(aseq_1){
+(function __clojure_fn_4156(){
+return (clojure.JS.def(clojure,"into_array",(function __clojure_fn_4156_into_array_4158(aseq_1){
return (clojure.lang.RT.seqToTypedArray(clojure.seq.apply(null,[aseq_1])))})))}).apply(null,[]);
//======
//(defn into "Returns a new coll consisting of to-coll with all of the items of\n from-coll conjoined." [to from] (let [ret to items (seq from)] (if items (recur (conj ret (first items)) (rest items)) ret)))
//---
-(function __clojure_fn_5276(){
-return (clojure.JS.def(clojure,"into",(function __clojure_fn_5276_into_5278(to_1,from_2){
+(function __clojure_fn_4162(){
+return (clojure.JS.def(clojure,"into",(function __clojure_fn_4162_into_4164(to_1,from_2){
var _cnt,_rtn,ret_3,items_4;
do{_cnt=0;_rtn=((ret_3=to_1),
(items_4=clojure.seq.apply(null,[from_2])),
@@ -1360,18 +1354,83 @@ do{_cnt=0;_rtn=((ret_3=to_1),
//======
//(defn array [& items] (into-array items))
//---
-(function __clojure_fn_5288(){
-return (clojure.JS.def(clojure,"array",clojure.JS.variadic(0,(function __clojure_fn_5288_array_5290(){
+(function __clojure_fn_4168(){
+return (clojure.JS.def(clojure,"array",clojure.JS.variadic(0,(function __clojure_fn_4168_array_4170(){
var items_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.into_array.apply(null,[items_1]))}))))}).apply(null,[]);
// Skipping: (defn class "Returns the Class of x" [x] (if (nil? x) x (. x (getClass))))
+
+//======
+//(defn num "Coerce to Number" {:tag Number, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/num)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (num x)))
+//---
+(function __clojure_fn_4180(){
+return (clojure.JS.def(clojure,"num",(function __clojure_fn_4180_num_4185(x_1){
+return (clojure.lang.Numbers.num(x_1))})))}).apply(null,[]);
+
+//======
+//(defn int "Coerce to int" {:tag Integer, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/intCast)) (clojure/list x)))))} [x] (. clojure.lang.RT (intCast x)))
+//---
+(function __clojure_fn_4189(){
+return (clojure.JS.def(clojure,"int",(function __clojure_fn_4189_int_4194(x_1){
+return (clojure.lang.RT.intCast(x_1))})))}).apply(null,[]);
+
+//======
+//(defn long "Coerce to long" {:tag Long, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/longCast)) (clojure/list x)))))} [x] (. x (longValue)))
+//---
+(function __clojure_fn_4198(){
+return (clojure.JS.def(clojure,"long",(function __clojure_fn_4198_long_4203(x_1){
+return ((x_1).longValue())})))}).apply(null,[]);
+
+//======
+//(defn float "Coerce to float" {:tag Float, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/floatCast)) (clojure/list x)))))} [x] (. x (floatValue)))
+//---
+(function __clojure_fn_4207(){
+return (clojure.JS.def(clojure,"float",(function __clojure_fn_4207_float_4212(x_1){
+return ((x_1).floatValue())})))}).apply(null,[]);
+
+//======
+//(defn double "Coerce to double" {:tag Double, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/doubleCast)) (clojure/list x)))))} [x] (. x (doubleValue)))
+//---
+(function __clojure_fn_4216(){
+return (clojure.JS.def(clojure,"double",(function __clojure_fn_4216_double_4221(x_1){
+return ((x_1).doubleValue())})))}).apply(null,[]);
+
+//======
+//(defn short "Coerce to short" {:tag Short} [x] (. x (shortValue)))
+//---
+(function __clojure_fn_4225(){
+return (clojure.JS.def(clojure,"short_",(function __clojure_fn_4225_short_4227(x_1){
+return ((x_1).shortValue())})))}).apply(null,[]);
+
+//======
+//(defn byte "Coerce to byte" {:tag Byte} [x] (. x (byteValue)))
+//---
+(function __clojure_fn_4231(){
+return (clojure.JS.def(clojure,"byte_",(function __clojure_fn_4231_byte_4233(x_1){
+return ((x_1).byteValue())})))}).apply(null,[]);
+
+//======
+//(defn char "Coerce to char" {:tag Character} [x] (. clojure.lang.RT (charCast x)))
+//---
+(function __clojure_fn_4237(){
+return (clojure.JS.def(clojure,"char_",(function __clojure_fn_4237_char_4239(x_1){
+return (clojure.lang.RT.charCast(x_1))})))}).apply(null,[]);
+
+//======
+//(defn boolean "Coerce to boolean" {:tag Boolean} [x] (if x true false))
+//---
+(function __clojure_fn_4243(){
+return (clojure.JS.def(clojure,"boolean_",(function __clojure_fn_4243_boolean_4245(x_1){
+return (((x_1)?(true):(false)))})))}).apply(null,[]);
+// Skipping: (defn bigint "Coerce to BigInteger" {:tag BigInteger} [x] (. BigInteger valueOf x))
+// Skipping: (defn bigdec "Coerce to BigDecimal" {:tag BigDecimal} [x] (. BigDecimal valueOf x))
// Skipping: (defmulti print-method (fn [x writer] (class x)))
//======
//(defn pr "Prints the object(s) to the output stream that is the current value\n of *out*. Prints the object(s), separated by spaces if there is\n more than one. By default, pr and prn print in a way that objects\n can be read by the reader" ([] nil) ([x] (print-method x *out*) nil) ([x & more] (pr x) (. *out* (append \space)) (apply pr more)))
//---
-(function __clojure_fn_5314(){
-return (clojure.JS.def(clojure,"pr",clojure.JS.variadic(1,(function __clojure_fn_5314_pr_5316(x_1){switch(arguments.length){
+(function __clojure_fn_4267(){
+return (clojure.JS.def(clojure,"pr",clojure.JS.variadic(1,(function __clojure_fn_4267_pr_4269(x_1){switch(arguments.length){
case 0:return (null)
case 1:return (clojure.print_method.apply(null,[x_1,clojure._STAR_out_STAR_]),
null)}
@@ -1383,24 +1442,24 @@ clojure.apply.apply(null,[clojure.pr,more_2]))}))))}).apply(null,[]);
//======
//(defn newline "Writes a newline to the output stream that is the current value of\n *out*" [] (. *out* (append \newline)) nil)
//---
-(function __clojure_fn_5328(){
-return (clojure.JS.def(clojure,"newline",(function __clojure_fn_5328_newline_5330(){
+(function __clojure_fn_4275(){
+return (clojure.JS.def(clojure,"newline",(function __clojure_fn_4275_newline_4277(){
return ((clojure._STAR_out_STAR_).append("\n"),
null)})))}).apply(null,[]);
//======
//(defn flush "Flushes the output stream that is the current value of\n *out*" [] (. *out* (flush)) nil)
//---
-(function __clojure_fn_5340(){
-return (clojure.JS.def(clojure,"flush",(function __clojure_fn_5340_flush_5342(){
+(function __clojure_fn_4281(){
+return (clojure.JS.def(clojure,"flush",(function __clojure_fn_4281_flush_4283(){
return ((clojure._STAR_out_STAR_).flush(),
null)})))}).apply(null,[]);
//======
//(defn prn "Same as pr followed by (newline). Observes *flush-on-newline*" [& more] (apply pr more) (newline) (when *flush-on-newline* (flush)))
//---
-(function __clojure_fn_5352(){
-return (clojure.JS.def(clojure,"prn",clojure.JS.variadic(0,(function __clojure_fn_5352_prn_5354(){
+(function __clojure_fn_4287(){
+return (clojure.JS.def(clojure,"prn",clojure.JS.variadic(0,(function __clojure_fn_4287_prn_4289(){
var more_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.apply.apply(null,[clojure.pr,more_1]),
clojure.newline.apply(null,[]),
@@ -1409,8 +1468,8 @@ clojure.newline.apply(null,[]),
//======
//(defn print "Prints the object(s) to the output stream that is the current value\n of *out*. print and println produce output for human consumption." [& more] (binding [*print-readably* nil] (apply pr more)))
//---
-(function __clojure_fn_5364(){
-return (clojure.JS.def(clojure,"print",clojure.JS.variadic(0,(function __clojure_fn_5364_print_5366(){
+(function __clojure_fn_4293(){
+return (clojure.JS.def(clojure,"print",clojure.JS.variadic(0,(function __clojure_fn_4293_print_4295(){
var more_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_print_readably_STAR_,null])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.pr,more_1]))}
@@ -1419,139 +1478,74 @@ finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}))))}).apply(null,
//======
//(defn println "Same as print followed by (newline)" [& more] (binding [*print-readably* nil] (apply prn more)))
//---
-(function __clojure_fn_5376(){
-return (clojure.JS.def(clojure,"println",clojure.JS.variadic(0,(function __clojure_fn_5376_println_5378(){
+(function __clojure_fn_4299(){
+return (clojure.JS.def(clojure,"println",clojure.JS.variadic(0,(function __clojure_fn_4299_println_4301(){
var more_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_print_readably_STAR_,null])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.prn,more_1]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}))))}).apply(null,[]);
//======
-//(defn read "Reads the next object from stream, which must be an instance of\n java.io.PushbackReader or some derivee. stream defaults to the\n current value of *in* ." ([] (read *in*)) ([stream] (read stream true nil)) ([stream eof-error? eof-value] (read stream eof-error? eof-value false)) ([stream eof-error? eof-value recursive?] (. clojure.lang.LispReader (read stream eof-error? eof-value recursive?))))
+//(defn read "Reads the next object from stream, which must be an instance of\n java.io.PushbackReader or some derivee. stream defaults to the\n current value of *in* ." ([] (read *in*)) ([stream] (read stream true nil)) ([stream eof-error? eof-value] (read stream eof-error? eof-value false)) ([stream eof-error? eof-value recursive?] (. clojure.lang.LispReader (read stream (boolean eof-error?) eof-value recursive?))))
//---
-(function __clojure_fn_5391(){
-return (clojure.JS.def(clojure,"read",(function __clojure_fn_5391_read_5393(stream_1,eof_error_QMARK__2,eof_value_3,recursive_QMARK__4){switch(arguments.length){
+(function __clojure_fn_4305(){
+return (clojure.JS.def(clojure,"read",(function __clojure_fn_4305_read_4307(stream_1,eof_error_QMARK__2,eof_value_3,recursive_QMARK__4){switch(arguments.length){
case 3:return (clojure.read.apply(null,[stream_1,eof_error_QMARK__2,eof_value_3,false]))
case 0:return (clojure.read.apply(null,[clojure._STAR_in_STAR_]))
case 1:return (clojure.read.apply(null,[stream_1,true,null]))}
-return (clojure.lang.LispReader.read(stream_1,eof_error_QMARK__2,eof_value_3,recursive_QMARK__4))})))}).apply(null,[]);
+return (clojure.lang.LispReader.read(stream_1,clojure.boolean_.apply(null,[eof_error_QMARK__2]),eof_value_3,recursive_QMARK__4))})))}).apply(null,[]);
//======
//(defn read-line "Reads the next line from stream that is the current value of *in* ." [] (. *in* (readLine)))
//---
-(function __clojure_fn_5406(){
-return (clojure.JS.def(clojure,"read_line",(function __clojure_fn_5406_read_line_5408(){
+(function __clojure_fn_4314(){
+return (clojure.JS.def(clojure,"read_line",(function __clojure_fn_4314_read_line_4316(){
return ((clojure._STAR_in_STAR_).readLine())})))}).apply(null,[]);
// Skipping: (defmacro with-open "Evaluates body in a try expression with name bound to the value of\n init, and a finally clause that calls (. name (close))." [name init & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list name) (clojure/list init)))) (clojure/list (clojure/concat (clojure/list (quote try)) body (clojure/list (clojure/concat (clojure/list (quote finally)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list name) (clojure/list (clojure/concat (clojure/list (quote clojure/close))))))))))))
// Skipping: (defmacro doto "Evaluates x then calls all of the methods with the supplied\n arguments in succession on the resulting object, returning it.\n\n (doto (new java.util.HashMap) (put \"a\" 1) (put \"b\" 2))" [x & members] (let [gx (gensym)] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list gx) (clojure/list x)))) (clojure/list (clojure/concat (clojure/list (quote do)) (map (fn [m] (list (quote .) gx m)) members))) (clojure/list gx))))
-// Skipping: (defmacro memfn "Expands into code that creates a fn that expects to be passed an\n object and any args and calls the named instance method on the\n object passing the args. Use when you want to treat a Java method as\n a first-class fn." [name & args] (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote target__5427)) args))) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote target__5427)) (clojure/list (clojure/concat (clojure/list name) args))))))
-// Skipping: (defmacro time "Evaluates expr and prints the time it took. Returns the value of\n expr." [expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote start__5434)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.System)) (clojure/list (clojure/concat (clojure/list (quote clojure/nanoTime)))))) (clojure/list (quote ret__5435)) (clojure/list expr)))) (clojure/list (clojure/concat (clojure/list (quote clojure/prn)) (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list "Elapsed time: ") (clojure/list (clojure/concat (clojure/list (quote clojure//)) (clojure/list (clojure/concat (clojure/list (quote clojure/double)) (clojure/list (clojure/concat (clojure/list (quote clojure/-)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.System)) (clojure/list (clojure/concat (clojure/list (quote clojure/nanoTime)))))) (clojure/list (quote start__5434)))))) (clojure/list 1000000.0))) (clojure/list " msecs"))))) (clojure/list (quote ret__5435))))
-
-//======
-//(defn num "Coerce to Number" {:tag Number, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (clojure/concat (clojure/list (quote clojure/num)) (clojure/list x)))))} [x] (. clojure.lang.Numbers (num x)))
-//---
-(function __clojure_fn_5451(){
-return (clojure.JS.def(clojure,"num",(function __clojure_fn_5451_num_5456(x_1){
-return (clojure.lang.Numbers.num(x_1))})))}).apply(null,[]);
-
-//======
-//(defn int "Coerce to int" {:tag Integer, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/intCast)) (clojure/list x)))))} [x] (. clojure.lang.RT (intCast x)))
-//---
-(function __clojure_fn_5469(){
-return (clojure.JS.def(clojure,"int",(function __clojure_fn_5469_int_5474(x_1){
-return (clojure.lang.RT.intCast(x_1))})))}).apply(null,[]);
-
-//======
-//(defn long "Coerce to long" {:tag Long, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/longCast)) (clojure/list x)))))} [x] (. x (longValue)))
-//---
-(function __clojure_fn_5487(){
-return (clojure.JS.def(clojure,"long",(function __clojure_fn_5487_long_5492(x_1){
-return ((x_1).longValue())})))}).apply(null,[]);
-
-//======
-//(defn float "Coerce to float" {:tag Float, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/floatCast)) (clojure/list x)))))} [x] (. x (floatValue)))
-//---
-(function __clojure_fn_5505(){
-return (clojure.JS.def(clojure,"float",(function __clojure_fn_5505_float_5510(x_1){
-return ((x_1).floatValue())})))}).apply(null,[]);
-
-//======
-//(defn double "Coerce to double" {:tag Double, :inline (fn [x] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/doubleCast)) (clojure/list x)))))} [x] (. x (doubleValue)))
-//---
-(function __clojure_fn_5523(){
-return (clojure.JS.def(clojure,"double",(function __clojure_fn_5523_double_5528(x_1){
-return ((x_1).doubleValue())})))}).apply(null,[]);
-
-//======
-//(defn short "Coerce to short" {:tag Short} [x] (. x (shortValue)))
-//---
-(function __clojure_fn_5538(){
-return (clojure.JS.def(clojure,"short_",(function __clojure_fn_5538_short_5540(x_1){
-return ((x_1).shortValue())})))}).apply(null,[]);
-
-//======
-//(defn byte "Coerce to byte" {:tag Byte} [x] (. x (byteValue)))
-//---
-(function __clojure_fn_5550(){
-return (clojure.JS.def(clojure,"byte_",(function __clojure_fn_5550_byte_5552(x_1){
-return ((x_1).byteValue())})))}).apply(null,[]);
-
-//======
-//(defn char "Coerce to char" {:tag Character} [x] (. clojure.lang.RT (charCast x)))
-//---
-(function __clojure_fn_5562(){
-return (clojure.JS.def(clojure,"char_",(function __clojure_fn_5562_char_5564(x_1){
-return (clojure.lang.RT.charCast(x_1))})))}).apply(null,[]);
-
-//======
-//(defn boolean "Coerce to boolean" {:tag Boolean} [x] (if x true false))
-//---
-(function __clojure_fn_5574(){
-return (clojure.JS.def(clojure,"boolean_",(function __clojure_fn_5574_boolean_5576(x_1){
-return (((x_1)?(true):(false)))})))}).apply(null,[]);
-// Skipping: (defn bigint "Coerce to BigInteger" {:tag BigInteger} [x] (. BigInteger valueOf x))
-// Skipping: (defn bigdec "Coerce to BigDecimal" {:tag BigDecimal} [x] (. BigDecimal valueOf x))
+// Skipping: (defmacro memfn "Expands into code that creates a fn that expects to be passed an\n object and any args and calls the named instance method on the\n object passing the args. Use when you want to treat a Java method as\n a first-class fn." [name & args] (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote target__4335)) args))) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote target__4335)) (clojure/list (clojure/concat (clojure/list name) args))))))
+// Skipping: (defmacro time "Evaluates expr and prints the time it took. Returns the value of\n expr." [expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote start__4342)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.System)) (clojure/list (clojure/concat (clojure/list (quote clojure/nanoTime)))))) (clojure/list (quote ret__4343)) (clojure/list expr)))) (clojure/list (clojure/concat (clojure/list (quote clojure/prn)) (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list "Elapsed time: ") (clojure/list (clojure/concat (clojure/list (quote clojure//)) (clojure/list (clojure/concat (clojure/list (quote clojure/double)) (clojure/list (clojure/concat (clojure/list (quote clojure/-)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.System)) (clojure/list (clojure/concat (clojure/list (quote clojure/nanoTime)))))) (clojure/list (quote start__4342)))))) (clojure/list 1000000.0))) (clojure/list " msecs"))))) (clojure/list (quote ret__4343))))
//======
//(import (quote (java.lang.reflect Array)))
//---
-(function __clojure_fn_5595(){
+(function __clojure_fn_4350(){
return (clojure.import_.apply(null,[clojure.JS.lit_list(["'java.lang.reflect","'Array"])]))}).apply(null,[]);
//======
//(defn alength "Returns the length of the Java array. Works on arrays of all\n types." {:inline (fn [a] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/alength)) (clojure/list a)))))} [array] (. clojure.lang.RT (alength array)))
//---
-(function __clojure_fn_5607(){
-return (clojure.JS.def(clojure,"alength",(function __clojure_fn_5607_alength_5612(array_1){
+(function __clojure_fn_4353(){
+return (clojure.JS.def(clojure,"alength",(function __clojure_fn_4353_alength_4358(array_1){
return (clojure.lang.RT.alength(array_1))})))}).apply(null,[]);
//======
//(defn aclone "Returns a clone of the Java array. Works on arrays of known\n types." {:inline (fn [a] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/aclone)) (clojure/list a)))))} [array] (. clojure.lang.RT (aclone array)))
//---
-(function __clojure_fn_5625(){
-return (clojure.JS.def(clojure,"aclone",(function __clojure_fn_5625_aclone_5630(array_1){
+(function __clojure_fn_4362(){
+return (clojure.JS.def(clojure,"aclone",(function __clojure_fn_4362_aclone_4367(array_1){
return (clojure.lang.RT.aclone(array_1))})))}).apply(null,[]);
//======
-//(defn aget "Returns the value at the index/indices. Works on Java arrays of all\n types." {:inline (fn [a i] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/aget)) (clojure/list a) (clojure/list i))))), :inline-arities #{2}} ([array idx] (RT/aget array idx)) ([array idx & idxs] (apply aget (aget array idx) idxs)))
+//(defn aget "Returns the value at the index/indices. Works on Java arrays of all\n types." {:inline (fn [a i] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/aget)) (clojure/list a) (clojure/list i))))), :inline-arities #{2}} ([array idx] (. Array (get array idx))) ([array idx & idxs] (apply aget (aget array idx) idxs)))
//---
-(function __clojure_fn_5644(){
-return (clojure.JS.def(clojure,"aget",clojure.JS.variadic(2,(function __clojure_fn_5644_aget_5649(array_1,idx_2){switch(arguments.length){
-case 2:return (clojure.lang.RT.aget(array_1,idx_2))}
+(function __clojure_fn_4371(){
+return (clojure.JS.def(clojure,"aget",clojure.JS.variadic(2,(function __clojure_fn_4371_aget_4376(array_1,idx_2){switch(arguments.length){
+case 2:return (java.lang.reflect.Array.get(array_1,idx_2))}
var idxs_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.apply.apply(null,[clojure.aget,clojure.lang.RT.aget(array_1,idx_2),idxs_3]))}))))}).apply(null,[]);
//======
-//(defn aset "Sets the value at the index/indices. Works on Java arrays of\n reference types. Returns val." {:inline (fn [a i v] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/aset)) (clojure/list a) (clojure/list i) (clojure/list v))))), :inline-arities #{3}} ([array idx val] (RT/aset array idx val) val) ([array idx idx2 & idxv] (apply aset (aget array idx) idx2 idxv)))
+//(defn aset "Sets the value at the index/indices. Works on Java arrays of\n reference types. Returns val." {:inline (fn [a i v] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.RT)) (clojure/list (clojure/concat (clojure/list (quote clojure/aset)) (clojure/list a) (clojure/list i) (clojure/list v))))), :inline-arities #{3}} ([array idx val] (. Array (set array idx val)) val) ([array idx idx2 & idxv] (apply aset (aget array idx) idx2 idxv)))
//---
-(function __clojure_fn_5664(){
-return (clojure.JS.def(clojure,"aset",clojure.JS.variadic(3,(function __clojure_fn_5664_aset_5669(array_1,idx_2,idx2_3){switch(arguments.length){
+(function __clojure_fn_4381(){
+return (clojure.JS.def(clojure,"aset",clojure.JS.variadic(3,(function __clojure_fn_4381_aset_4386(array_1,idx_2,idx2_3){switch(arguments.length){
case 3:var val_3=arguments[2];
-return (clojure.lang.RT.aset(array_1,idx_2,val_3),
+return (java.lang.reflect.Array.set(array_1,idx_2,val_3),
val_3)}
var idxv_4=clojure.JS.rest_args(this,arguments,3);
return (clojure.apply.apply(null,[clojure.aset,clojure.lang.RT.aget(array_1,idx_2),idx2_3,idxv_4]))}))))}).apply(null,[]);
-// Skipping: (defmacro def-aset [name method coerce] (clojure/concat (clojure/list (quote clojure/defn)) (clojure/list name) (clojure/list (clojure/apply clojure/hash-map (clojure/concat (clojure/list :arglists) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array)) (clojure/list (quote idx)) (clojure/list (quote val))))) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array)) (clojure/list (quote idx)) (clojure/list (quote idx2)) (clojure/list (quote &)) (clojure/list (quote idxv)))))))))))) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array__5674)) (clojure/list (quote idx__5675)) (clojure/list (quote val__5676))))) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.reflect.Array)) (clojure/list (clojure/concat (clojure/list method) (clojure/list (quote array__5674)) (clojure/list (quote idx__5675)) (clojure/list (clojure/concat (clojure/list coerce) (clojure/list (quote val__5676)))))))) (clojure/list (quote val__5676)))) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array__5674)) (clojure/list (quote idx__5675)) (clojure/list (quote idx2__5677)) (clojure/list (quote &)) (clojure/list (quote idxv__5678))))) (clojure/list (clojure/concat (clojure/list (quote clojure/apply)) (clojure/list name) (clojure/list (clojure/concat (clojure/list (quote clojure/aget)) (clojure/list (quote array__5674)) (clojure/list (quote idx__5675)))) (clojure/list (quote idx2__5677)) (clojure/list (quote idxv__5678))))))))
+// Skipping: (defmacro def-aset [name method coerce] (clojure/concat (clojure/list (quote clojure/defn)) (clojure/list name) (clojure/list (clojure/apply clojure/hash-map (clojure/concat (clojure/list :arglists) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array)) (clojure/list (quote idx)) (clojure/list (quote val))))) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array)) (clojure/list (quote idx)) (clojure/list (quote idx2)) (clojure/list (quote &)) (clojure/list (quote idxv)))))))))))) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array__4391)) (clojure/list (quote idx__4392)) (clojure/list (quote val__4393))))) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.lang.reflect.Array)) (clojure/list (clojure/concat (clojure/list method) (clojure/list (quote array__4391)) (clojure/list (quote idx__4392)) (clojure/list (clojure/concat (clojure/list coerce) (clojure/list (quote val__4393)))))))) (clojure/list (quote val__4393)))) (clojure/list (clojure/concat (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote array__4391)) (clojure/list (quote idx__4392)) (clojure/list (quote idx2__4394)) (clojure/list (quote &)) (clojure/list (quote idxv__4395))))) (clojure/list (clojure/concat (clojure/list (quote clojure/apply)) (clojure/list name) (clojure/list (clojure/concat (clojure/list (quote clojure/aget)) (clojure/list (quote array__4391)) (clojure/list (quote idx__4392)))) (clojure/list (quote idx2__4394)) (clojure/list (quote idxv__4395))))))))
// Skipping: (def-aset aset-int setInt int)
// Skipping: (def-aset aset-long setLong long)
// Skipping: (def-aset aset-boolean setBoolean boolean)
@@ -1568,8 +1562,8 @@ return (clojure.apply.apply(null,[clojure.aset,clojure.lang.RT.aget(array_1,idx_
//======
//(defn create-struct "Returns a structure basis object." [& keys] (. clojure.lang.PersistentStructMap (createSlotMap keys)))
//---
-(function __clojure_fn_5772(){
-return (clojure.JS.def(clojure,"create_struct",clojure.JS.variadic(0,(function __clojure_fn_5772_create_struct_5774(){
+(function __clojure_fn_4483(){
+return (clojure.JS.def(clojure,"create_struct",clojure.JS.variadic(0,(function __clojure_fn_4483_create_struct_4485(){
var keys_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.lang.PersistentStructMap.createSlotMap(keys_1))}))))}).apply(null,[]);
// Skipping: (defmacro defstruct "Same as (def name (create-struct keys...))" [name & keys] (clojure/concat (clojure/list (quote def)) (clojure/list name) (clojure/list (clojure/concat (clojure/list (quote clojure/create-struct)) keys))))
@@ -1577,31 +1571,31 @@ return (clojure.lang.PersistentStructMap.createSlotMap(keys_1))}))))}).apply(nul
//======
//(defn struct-map "Returns a new structmap instance with the keys of the\n structure-basis. keyvals may contain all, some or none of the basis\n keys - where values are not supplied they will default to nil.\n keyvals can also contain keys not in the basis." [s & inits] (. clojure.lang.PersistentStructMap (create s inits)))
//---
-(function __clojure_fn_5790(){
-return (clojure.JS.def(clojure,"struct_map",clojure.JS.variadic(1,(function __clojure_fn_5790_struct_map_5792(s_1){
+(function __clojure_fn_4495(){
+return (clojure.JS.def(clojure,"struct_map",clojure.JS.variadic(1,(function __clojure_fn_4495_struct_map_4497(s_1){
var inits_2=clojure.JS.rest_args(this,arguments,1);
return (clojure.lang.PersistentStructMap.create(s_1,inits_2))}))))}).apply(null,[]);
//======
//(defn struct "Returns a new structmap instance with the keys of the\n structure-basis. vals must be supplied for basis keys in order -\n where values are not supplied they will default to nil." [s & vals] (. clojure.lang.PersistentStructMap (construct s vals)))
//---
-(function __clojure_fn_5802(){
-return (clojure.JS.def(clojure,"struct",clojure.JS.variadic(1,(function __clojure_fn_5802_struct_5804(s_1){
+(function __clojure_fn_4501(){
+return (clojure.JS.def(clojure,"struct",clojure.JS.variadic(1,(function __clojure_fn_4501_struct_4503(s_1){
var vals_2=clojure.JS.rest_args(this,arguments,1);
return (clojure.lang.PersistentStructMap.construct(s_1,vals_2))}))))}).apply(null,[]);
//======
//(defn accessor "Returns a fn that, given an instance of a structmap with the basis,\n returns the value at the key. The key must be in the basis. The\n returned function should be (slightly) more efficient than using\n get, but such use of accessors should be limited to known\n performance-critical areas." [s key] (. clojure.lang.PersistentStructMap (getAccessor s key)))
//---
-(function __clojure_fn_5814(){
-return (clojure.JS.def(clojure,"accessor",(function __clojure_fn_5814_accessor_5816(s_1,key_2){
+(function __clojure_fn_4507(){
+return (clojure.JS.def(clojure,"accessor",(function __clojure_fn_4507_accessor_4509(s_1,key_2){
return (clojure.lang.PersistentStructMap.getAccessor(s_1,key_2))})))}).apply(null,[]);
//======
//(defn subvec "Returns a persistent vector of the items in vector from\n start (inclusive) to end (exclusive). If end is not supplied,\n defaults to (count vector). This operation is O(1) and very fast, as\n the resulting vector shares structure with the original and no\n trimming is done." ([v start] (subvec v start (count v))) ([v start end] (. clojure.lang.RT (subvec v start end))))
//---
-(function __clojure_fn_5827(){
-return (clojure.JS.def(clojure,"subvec",(function __clojure_fn_5827_subvec_5829(v_1,start_2,end_3){switch(arguments.length){
+(function __clojure_fn_4513(){
+return (clojure.JS.def(clojure,"subvec",(function __clojure_fn_4513_subvec_4515(v_1,start_2,end_3){switch(arguments.length){
case 2:return (clojure.subvec.apply(null,[v_1,start_2,clojure.count.apply(null,[v_1])]))}
return (clojure.lang.RT.subvec(v_1,start_2,end_3))})))}).apply(null,[]);
// Skipping: (defn load-reader "Sequentially read and evaluate the set of forms contained in the\n stream/file" [rdr] (. clojure.lang.Compiler (load rdr)))
@@ -1610,21 +1604,21 @@ return (clojure.lang.RT.subvec(v_1,start_2,end_3))})))}).apply(null,[]);
//======
//(defn resultset-seq "Creates and returns a lazy sequence of structmaps corresponding to\n the rows in the java.sql.ResultSet rs" [rs] (let [rsmeta (. rs (getMetaData)) idxs (range 1 (inc (. rsmeta (getColumnCount)))) keys (map (comp keyword (memfn toLowerCase)) (map (fn [i] (. rsmeta (getColumnName i))) idxs)) row-struct (apply create-struct keys) row-values (fn [] (map (fn [i] (. rs (getObject i))) idxs)) rows (fn thisfn [] (when (. rs (next)) (lazy-cons (apply struct row-struct (row-values)) (thisfn))))] (rows)))
//---
-(function __clojure_fn_5871(){
-return (clojure.JS.def(clojure,"resultset_seq",(function __clojure_fn_5871_resultset_seq_5873(rs_1){
-var keys_4,rows_7,row_values_6,idxs_3,row_struct_5,rsmeta_2;
+(function __clojure_fn_4532(){
+return (clojure.JS.def(clojure,"resultset_seq",(function __clojure_fn_4532_resultset_seq_4534(rs_1){
+var idxs_3,rows_7,row_values_6,row_struct_5,rsmeta_2,keys_4;
return (((rsmeta_2=(rs_1).getMetaData()),
(idxs_3=clojure.range.apply(null,[1,clojure.lang.Numbers.inc((rsmeta_2).getColumnCount())])),
-(keys_4=clojure.map.apply(null,[clojure.comp.apply(null,[clojure.keyword,(function __clojure_fn_5871_resultset_seq_5873_fn_5875(target__877_1){
-return ((target__877_1).toLowerCase())})]),clojure.map.apply(null,[(function __clojure_fn_5871_resultset_seq_5873_fn_5878(i_1){
+(keys_4=clojure.map.apply(null,[clojure.comp.apply(null,[clojure.keyword,(function __clojure_fn_4532_resultset_seq_4534_fn_4536(target__922_1){
+return ((target__922_1).toLowerCase())})]),clojure.map.apply(null,[(function __clojure_fn_4532_resultset_seq_4534_fn_4539(i_1){
return ((rsmeta_2).getColumnName(i_1))}),idxs_3])])),
(row_struct_5=clojure.apply.apply(null,[clojure.create_struct,keys_4])),
-(row_values_6=(function __clojure_fn_5871_resultset_seq_5873_row_values_5881(){
-return (clojure.map.apply(null,[(function __clojure_fn_5871_resultset_seq_5873_row_values_5881_fn_5883(i_1){
+(row_values_6=(function __clojure_fn_4532_resultset_seq_4534_row_values_4542(){
+return (clojure.map.apply(null,[(function __clojure_fn_4532_resultset_seq_4534_row_values_4542_fn_4544(i_1){
return ((rs_1).getObject(i_1))}),idxs_3]))})),
-(rows_7=(function __clojure_fn_5871_resultset_seq_5873_thisfn_5887(){
+(rows_7=(function __clojure_fn_4532_resultset_seq_4534_thisfn_4548(){
var thisfn_0=arguments.callee;
-return ((((rs_1).next())?((new clojure.lang.LazyCons((function __clojure_fn_5871_resultset_seq_5873_thisfn_5887_fn_5889(G__5888_1){switch(arguments.length){
+return ((((rs_1).next())?((new clojure.lang.LazyCons((function __clojure_fn_4532_resultset_seq_4534_thisfn_4548_fn_4550(G__4549_1){switch(arguments.length){
case 0:return (clojure.apply.apply(null,[clojure.struct,row_struct_5,row_values_6.apply(null,[])]))}
return (thisfn_0.apply(null,[]))})))):(null)))})),
rows_7.apply(null,[])))})))}).apply(null,[]);
@@ -1632,17 +1626,16 @@ rows_7.apply(null,[])))})))}).apply(null,[]);
//======
//(defn set "Returns a set of the distinct elements of coll." [coll] (apply hash-set coll))
//---
-(function __clojure_fn_5902(){
-return (clojure.JS.def(clojure,"set",(function __clojure_fn_5902_set_5904(coll_1){
+(function __clojure_fn_4557(){
+return (clojure.JS.def(clojure,"set",(function __clojure_fn_4557_set_4559(coll_1){
return (clojure.apply.apply(null,[clojure.hash_set,coll_1]))})))}).apply(null,[]);
-// Skipping: (defn class? "Returns true if x is an instance of Class" [x] (instance? Class x))
//======
//(defn filter-key [keyfn pred amap] (loop [ret {} es (seq amap)] (if es (if (pred (keyfn (first es))) (recur (assoc ret (key (first es)) (val (first es))) (rest es)) (recur ret (rest es))) ret)))
//---
-(function __clojure_fn_5920(){
-return (clojure.JS.def(clojure,"filter_key",(function __clojure_fn_5920_filter_key_5922(keyfn_1,pred_2,amap_3){
-var ret_4,es_5;
+(function __clojure_fn_4563(){
+return (clojure.JS.def(clojure,"filter_key",(function __clojure_fn_4563_filter_key_4565(keyfn_1,pred_2,amap_3){
+var es_5,ret_4;
return (((function __loop(){var _rtn,_cnt;(ret_4=clojure.lang.PersistentHashMap.EMPTY),
(es_5=clojure.seq.apply(null,[amap_3]));do{_cnt=0;
_rtn=((es_5)?(((pred_2.apply(null,[keyfn_1.apply(null,[clojure.first.apply(null,[es_5])])]))?((_cnt=1,_rtn=[clojure.assoc.apply(null,[ret_4,clojure.key.apply(null,[clojure.first.apply(null,[es_5])]),clojure.val.apply(null,[clojure.first.apply(null,[es_5])])]),clojure.rest.apply(null,[es_5])],ret_4=_rtn[0],es_5=_rtn[1])):((_cnt=1,_rtn=[ret_4,clojure.rest.apply(null,[es_5])],ret_4=_rtn[0],es_5=_rtn[1])))):(ret_4))}while(_cnt);return _rtn;})()))})))}).apply(null,[]);
@@ -1650,90 +1643,90 @@ _rtn=((es_5)?(((pred_2.apply(null,[keyfn_1.apply(null,[clojure.first.apply(null,
//======
//(defn find-ns "Returns the namespace named by the symbol or nil if it doesn't exist." [sym] (clojure.lang.Namespace/find sym))
//---
-(function __clojure_fn_5932(){
-return (clojure.JS.def(clojure,"find_ns",(function __clojure_fn_5932_find_ns_5934(sym_1){
+(function __clojure_fn_4569(){
+return (clojure.JS.def(clojure,"find_ns",(function __clojure_fn_4569_find_ns_4571(sym_1){
return (clojure.lang.Namespace.find(sym_1))})))}).apply(null,[]);
//======
//(defn create-ns "Create a new namespace named by the symbol if one doesn't already\n exist, returns it or the already-existing namespace of the same\n name." [sym] (clojure.lang.Namespace/findOrCreate sym))
//---
-(function __clojure_fn_5944(){
-return (clojure.JS.def(clojure,"create_ns",(function __clojure_fn_5944_create_ns_5946(sym_1){
+(function __clojure_fn_4575(){
+return (clojure.JS.def(clojure,"create_ns",(function __clojure_fn_4575_create_ns_4577(sym_1){
return (clojure.lang.Namespace.findOrCreate(sym_1))})))}).apply(null,[]);
//======
//(defn remove-ns "Removes the namespace named by the symbol. Use with caution.\n Cannot be used to remove the clojure namespace." [sym] (clojure.lang.Namespace/remove sym))
//---
-(function __clojure_fn_5956(){
-return (clojure.JS.def(clojure,"remove_ns",(function __clojure_fn_5956_remove_ns_5958(sym_1){
+(function __clojure_fn_4581(){
+return (clojure.JS.def(clojure,"remove_ns",(function __clojure_fn_4581_remove_ns_4583(sym_1){
return (clojure.lang.Namespace.remove(sym_1))})))}).apply(null,[]);
//======
//(defn all-ns "Returns a sequence of all namespaces." [] (clojure.lang.Namespace/all))
//---
-(function __clojure_fn_5968(){
-return (clojure.JS.def(clojure,"all_ns",(function __clojure_fn_5968_all_ns_5970(){
+(function __clojure_fn_4587(){
+return (clojure.JS.def(clojure,"all_ns",(function __clojure_fn_4587_all_ns_4589(){
return (clojure.lang.Namespace.all())})))}).apply(null,[]);
//======
-//(defn the-ns [x] (if (instance? clojure.lang.Namespace x) x (or (find-ns x) (throw (RT/makeException (str "No namespace: " x " found"))))))
+//(defn the-ns [x] (if (instance? clojure.lang.Namespace x) x (or (find-ns x) (throw (Exception. (str "No namespace: " x " found"))))))
//---
-(function __clojure_fn_5980(){
-return (clojure.JS.def(clojure,"the_ns",(function __clojure_fn_5980_the_ns_5982(x_1){
+(function __clojure_fn_4593(){
+return (clojure.JS.def(clojure,"the_ns",(function __clojure_fn_4593_the_ns_4595(x_1){
var or__202_2;
return (((clojure.instance_QMARK_.apply(null,[clojure.lang.Namespace,x_1]))?(x_1):(((or__202_2=clojure.find_ns.apply(null,[x_1])),
-((or__202_2)?(or__202_2):((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["No namespace: ",x_1," found"]))})()))))))})))}).apply(null,[]);
+((or__202_2)?(or__202_2):((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["No namespace: ",x_1," found"])))})()))))))})))}).apply(null,[]);
//======
//(defn ns-name "Returns the name of the namespace, a symbol." [ns] (.getName (the-ns ns)))
//---
-(function __clojure_fn_5992(){
-return (clojure.JS.def(clojure,"ns_name",(function __clojure_fn_5992_ns_name_5994(ns_1){
+(function __clojure_fn_4599(){
+return (clojure.JS.def(clojure,"ns_name",(function __clojure_fn_4599_ns_name_4601(ns_1){
return ((clojure.the_ns.apply(null,[ns_1])).getName())})))}).apply(null,[]);
//======
//(defn ns-map "Returns a map of all the mappings for the namespace." [ns] (.getMappings (the-ns ns)))
//---
-(function __clojure_fn_6004(){
-return (clojure.JS.def(clojure,"ns_map",(function __clojure_fn_6004_ns_map_6006(ns_1){
+(function __clojure_fn_4605(){
+return (clojure.JS.def(clojure,"ns_map",(function __clojure_fn_4605_ns_map_4607(ns_1){
return ((clojure.the_ns.apply(null,[ns_1])).getMappings())})))}).apply(null,[]);
//======
//(defn ns-unmap "Removes the mappings for the symbol from the namespace." [ns sym] (.unmap (the-ns ns) sym))
//---
-(function __clojure_fn_6016(){
-return (clojure.JS.def(clojure,"ns_unmap",(function __clojure_fn_6016_ns_unmap_6018(ns_1,sym_2){
+(function __clojure_fn_4611(){
+return (clojure.JS.def(clojure,"ns_unmap",(function __clojure_fn_4611_ns_unmap_4613(ns_1,sym_2){
return ((clojure.the_ns.apply(null,[ns_1])).unmap(sym_2))})))}).apply(null,[]);
//======
//(defn ns-publics "Returns a map of the public intern mappings for the namespace." [ns] (let [ns (the-ns ns)] (filter-key val (fn [v] (and (instance? clojure.lang.Var v) (= ns (.ns v)) (.isPublic v))) (ns-map ns))))
//---
-(function __clojure_fn_6031(){
-return (clojure.JS.def(clojure,"ns_publics",(function __clojure_fn_6031_ns_publics_6033(ns_1){
+(function __clojure_fn_4617(){
+return (clojure.JS.def(clojure,"ns_publics",(function __clojure_fn_4617_ns_publics_4619(ns_1){
var ns_2;
return (((ns_2=clojure.the_ns.apply(null,[ns_1])),
-clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_6031_ns_publics_6033_fn_6035(v_1){
+clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_4617_ns_publics_4619_fn_4621(v_1){
var and__196_2,and__196_3;
return (((and__196_2=clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])),
((and__196_2)?(((and__196_3=clojure.lang.Util.equal(ns_2,(v_1).ns)),
((and__196_3)?((v_1).isPublic()):(and__196_3)))):(and__196_2))))}),clojure.ns_map.apply(null,[ns_2])])))})))}).apply(null,[]);
//======
-//(defn ns-imports "Returns a map of the import mappings for the namespace." [ns] (filter-key val class? (ns-map ns)))
+//(defn ns-imports "Returns a map of the import mappings for the namespace." [ns] (filter-key val (partial instance? Class) (ns-map ns)))
//---
-(function __clojure_fn_6046(){
-return (clojure.JS.def(clojure,"ns_imports",(function __clojure_fn_6046_ns_imports_6048(ns_1){
-return (clojure.filter_key.apply(null,[clojure.val,clojure.class_QMARK_,clojure.ns_map.apply(null,[ns_1])]))})))}).apply(null,[]);
-// Skipping: (defn refer "refers to all public vars of ns, subject to filters.\n filters can include at most one each of:\n\n :exclude list-of-symbols\n :only list-of-symbols\n :rename map-of-fromsymbol-tosymbol\n\n For each public interned var in the namespace named by the symbol,\n adds a mapping from the name of the var to the var to the current\n namespace. Throws an exception if name is already mapped to\n something else in the current namespace. Filters can be used to\n select a subset, via inclusion or exclusion, or to provide a mapping\n to a symbol different from the var's name, in order to prevent\n clashes. Use :use in the ns macro in preference to calling this directly." [ns-sym & filters] (let [ns (or (find-ns ns-sym) (throw (RT/makeException (str "No namespace: " ns-sym)))) fs (apply hash-map filters) nspublics (ns-publics ns) rename (or (:rename fs) {}) exclude (set (:exclude fs)) to-do (or (:only fs) (keys nspublics))] (doseq sym to-do (when-not (exclude sym) (let [v (nspublics sym)] (when-not v (throw (new java.lang.IllegalAccessError (str sym " is not public")))) (. *ns* (refer (or (rename sym) sym) v)))))))
+(function __clojure_fn_4626(){
+return (clojure.JS.def(clojure,"ns_imports",(function __clojure_fn_4626_ns_imports_4628(ns_1){
+return (clojure.filter_key.apply(null,[clojure.val,clojure.partial.apply(null,[clojure.instance_QMARK_,java.lang.Class]),clojure.ns_map.apply(null,[ns_1])]))})))}).apply(null,[]);
+// Skipping: (defn refer "refers to all public vars of ns, subject to filters.\n filters can include at most one each of:\n\n :exclude list-of-symbols\n :only list-of-symbols\n :rename map-of-fromsymbol-tosymbol\n\n For each public interned var in the namespace named by the symbol,\n adds a mapping from the name of the var to the var to the current\n namespace. Throws an exception if name is already mapped to\n something else in the current namespace. Filters can be used to\n select a subset, via inclusion or exclusion, or to provide a mapping\n to a symbol different from the var's name, in order to prevent\n clashes. Use :use in the ns macro in preference to calling this directly." [ns-sym & filters] (let [ns (or (find-ns ns-sym) (throw (new Exception (str "No namespace: " ns-sym)))) fs (apply hash-map filters) nspublics (ns-publics ns) rename (or (:rename fs) {}) exclude (set (:exclude fs)) to-do (or (:only fs) (keys nspublics))] (doseq sym to-do (when-not (exclude sym) (let [v (nspublics sym)] (when-not v (throw (new java.lang.IllegalAccessError (str sym " is not public")))) (. *ns* (refer (or (rename sym) sym) v)))))))
//======
//(defn ns-refers "Returns a map of the refer mappings for the namespace." [ns] (let [ns (the-ns ns)] (filter-key val (fn [v] (and (instance? clojure.lang.Var v) (not= ns (.ns v)))) (ns-map ns))))
//---
-(function __clojure_fn_6067(){
-return (clojure.JS.def(clojure,"ns_refers",(function __clojure_fn_6067_ns_refers_6069(ns_1){
+(function __clojure_fn_4638(){
+return (clojure.JS.def(clojure,"ns_refers",(function __clojure_fn_4638_ns_refers_4640(ns_1){
var ns_2;
return (((ns_2=clojure.the_ns.apply(null,[ns_1])),
-clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_6067_ns_refers_6069_fn_6071(v_1){
+clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_4638_ns_refers_4640_fn_4642(v_1){
var and__196_2;
return (((and__196_2=clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])),
((and__196_2)?(clojure.not_EQ_.apply(null,[ns_2,(v_1).ns])):(and__196_2))))}),clojure.ns_map.apply(null,[ns_2])])))})))}).apply(null,[]);
@@ -1741,11 +1734,11 @@ return (((and__196_2=clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1]))
//======
//(defn ns-interns "Returns a map of the intern mappings for the namespace." [ns] (let [ns (the-ns ns)] (filter-key val (fn [v] (and (instance? clojure.lang.Var v) (= ns (.ns v)))) (ns-map ns))))
//---
-(function __clojure_fn_6085(){
-return (clojure.JS.def(clojure,"ns_interns",(function __clojure_fn_6085_ns_interns_6087(ns_1){
+(function __clojure_fn_4647(){
+return (clojure.JS.def(clojure,"ns_interns",(function __clojure_fn_4647_ns_interns_4649(ns_1){
var ns_2;
return (((ns_2=clojure.the_ns.apply(null,[ns_1])),
-clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_6085_ns_interns_6087_fn_6089(v_1){
+clojure.filter_key.apply(null,[clojure.val,(function __clojure_fn_4647_ns_interns_4649_fn_4651(v_1){
var and__196_2;
return (((and__196_2=clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])),
((and__196_2)?(clojure.lang.Util.equal(ns_2,(v_1).ns)):(and__196_2))))}),clojure.ns_map.apply(null,[ns_2])])))})))}).apply(null,[]);
@@ -1753,53 +1746,53 @@ return (((and__196_2=clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1]))
//======
//(defn alias "Add an alias in the current namespace to another\n namespace. Arguments are two symbols: the alias to be used, and\n the symbolic name of the target namespace. Use :as in the ns macro in preference \n to calling this directly." [alias namespace-sym] (.addAlias *ns* alias (find-ns namespace-sym)))
//---
-(function __clojure_fn_6100(){
-return (clojure.JS.def(clojure,"alias",(function __clojure_fn_6100_alias_6102(alias_1,namespace_sym_2){
+(function __clojure_fn_4656(){
+return (clojure.JS.def(clojure,"alias",(function __clojure_fn_4656_alias_4658(alias_1,namespace_sym_2){
return ((clojure._STAR_ns_STAR_).addAlias(alias_1,clojure.find_ns.apply(null,[namespace_sym_2])))})))}).apply(null,[]);
//======
//(defn ns-aliases "Returns a map of the aliases for the namespace." [ns] (.getAliases (the-ns ns)))
//---
-(function __clojure_fn_6112(){
-return (clojure.JS.def(clojure,"ns_aliases",(function __clojure_fn_6112_ns_aliases_6114(ns_1){
+(function __clojure_fn_4662(){
+return (clojure.JS.def(clojure,"ns_aliases",(function __clojure_fn_4662_ns_aliases_4664(ns_1){
return ((clojure.the_ns.apply(null,[ns_1])).getAliases())})))}).apply(null,[]);
//======
//(defn ns-unalias "Removes the alias for the symbol from the namespace." [ns sym] (.removeAlias (the-ns ns) sym))
//---
-(function __clojure_fn_6124(){
-return (clojure.JS.def(clojure,"ns_unalias",(function __clojure_fn_6124_ns_unalias_6126(ns_1,sym_2){
+(function __clojure_fn_4668(){
+return (clojure.JS.def(clojure,"ns_unalias",(function __clojure_fn_4668_ns_unalias_4670(ns_1,sym_2){
return ((clojure.the_ns.apply(null,[ns_1])).removeAlias(sym_2))})))}).apply(null,[]);
//======
//(defn take-nth "Returns a lazy seq of every nth item in coll." [n coll] (when (seq coll) (lazy-cons (first coll) (take-nth n (drop n coll)))))
//---
-(function __clojure_fn_6141(){
-return (clojure.JS.def(clojure,"take_nth",(function __clojure_fn_6141_take_nth_6143(n_1,coll_2){
-return (((clojure.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_fn_6141_take_nth_6143_fn_6146(G__6145_1){switch(arguments.length){
+(function __clojure_fn_4674(){
+return (clojure.JS.def(clojure,"take_nth",(function __clojure_fn_4674_take_nth_4676(n_1,coll_2){
+return (((clojure.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_fn_4674_take_nth_4676_fn_4679(G__4678_1){switch(arguments.length){
case 0:return (clojure.first.apply(null,[coll_2]))}
return (clojure.take_nth.apply(null,[n_1,clojure.drop.apply(null,[n_1,coll_2])]))})))):(null)))})))}).apply(null,[]);
//======
//(defn interleave "Returns a lazy seq of the first item in each coll, then the second\n etc." [& colls] (apply concat (apply map list colls)))
//---
-(function __clojure_fn_6158(){
-return (clojure.JS.def(clojure,"interleave",clojure.JS.variadic(0,(function __clojure_fn_6158_interleave_6160(){
+(function __clojure_fn_4685(){
+return (clojure.JS.def(clojure,"interleave",clojure.JS.variadic(0,(function __clojure_fn_4685_interleave_4687(){
var colls_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.apply.apply(null,[clojure.concat,clojure.apply.apply(null,[clojure.map,clojure.list,colls_1])]))}))))}).apply(null,[]);
//======
//(defn var-get "Gets the value in the var object" [x] (. x (get)))
//---
-(function __clojure_fn_6170(){
-return (clojure.JS.def(clojure,"var_get",(function __clojure_fn_6170_var_get_6172(x_1){
+(function __clojure_fn_4691(){
+return (clojure.JS.def(clojure,"var_get",(function __clojure_fn_4691_var_get_4693(x_1){
return ((x_1).get())})))}).apply(null,[]);
//======
//(defn var-set "Sets the value in the var object to val. The var must be\n thread-locally bound." [x val] (. x (set val)))
//---
-(function __clojure_fn_6182(){
-return (clojure.JS.def(clojure,"var_set",(function __clojure_fn_6182_var_set_6184(x_1,val_2){
+(function __clojure_fn_4697(){
+return (clojure.JS.def(clojure,"var_set",(function __clojure_fn_4697_var_set_4699(x_1,val_2){
return ((x_1).set(val_2))})))}).apply(null,[]);
// Skipping: (defmacro with-local-vars "varbinding=> symbol init-expr\n\n Executes the exprs in a context in which the symbols are bound to\n vars with per-thread bindings to the init-exprs. The symbols refer\n to the var objects themselves, and must be accessed with var-get and\n var-set" [name-vals-vec & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (interleave (take-nth 2 name-vals-vec) (repeat (quote (. clojure.lang.Var (create)))))))) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Var)) (clojure/list (clojure/concat (clojure/list (quote clojure/pushThreadBindings)) (clojure/list (clojure/concat (clojure/list (quote clojure/hash-map)) name-vals-vec)))))) (clojure/list (clojure/concat (clojure/list (quote try)) body (clojure/list (clojure/concat (clojure/list (quote finally)) (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Var)) (clojure/list (clojure/concat (clojure/list (quote clojure/popThreadBindings))))))))))))
// Skipping: (defn ns-resolve "Returns the var or Class to which a symbol will be resolved in the\n namespace, else nil. Note that if the symbol is fully qualified,\n the var/Class to which it resolves need not be present in the\n namespace." [ns sym] (clojure.lang.Compiler/maybeResolveIn (the-ns ns) sym))
@@ -1808,8 +1801,8 @@ return ((x_1).set(val_2))})))}).apply(null,[]);
//======
//(defn array-map "Constructs an array-map." ([] (. clojure.lang.PersistentArrayMap EMPTY)) ([& keyvals] (new clojure.lang.PersistentArrayMap (to-array keyvals))))
//---
-(function __clojure_fn_6213(){
-return (clojure.JS.def(clojure,"array_map",clojure.JS.variadic(0,(function __clojure_fn_6213_array_map_6215(){switch(arguments.length){
+(function __clojure_fn_4721(){
+return (clojure.JS.def(clojure,"array_map",clojure.JS.variadic(0,(function __clojure_fn_4721_array_map_4723(){switch(arguments.length){
case 0:return (clojure.lang.PersistentArrayMap.EMPTY)}
var keyvals_1=clojure.JS.rest_args(this,arguments,0);
return ((new clojure.lang.PersistentArrayMap(clojure.to_array.apply(null,[keyvals_1]))))}))))}).apply(null,[]);
@@ -1817,9 +1810,9 @@ return ((new clojure.lang.PersistentArrayMap(clojure.to_array.apply(null,[keyval
//======
//(defn nthrest "Returns the nth rest of coll, (seq coll) when n is 0." [coll n] (loop [n n xs (seq coll)] (if (and xs (pos? n)) (recur (dec n) (rest xs)) xs)))
//---
-(function __clojure_fn_6226(){
-return (clojure.JS.def(clojure,"nthrest",(function __clojure_fn_6226_nthrest_6228(coll_1,n_2){
-var and__196_5,xs_4,n_3;
+(function __clojure_fn_4728(){
+return (clojure.JS.def(clojure,"nthrest",(function __clojure_fn_4728_nthrest_4730(coll_1,n_2){
+var n_3,xs_4,and__196_5;
return (((function __loop(){var _rtn,_cnt;(n_3=n_2),
(xs_4=clojure.seq.apply(null,[coll_1]));do{_cnt=0;
_rtn=((((and__196_5=xs_4),
@@ -1828,118 +1821,118 @@ _rtn=((((and__196_5=xs_4),
//======
//(defn symbol? "Return true if x is a Symbol" [x] (instance? clojure.lang.Symbol x))
//---
-(function __clojure_fn_6238(){
-return (clojure.JS.def(clojure,"symbol_QMARK_",(function __clojure_fn_6238_symbol_QMARK_6240(x_1){
+(function __clojure_fn_4734(){
+return (clojure.JS.def(clojure,"symbol_QMARK_",(function __clojure_fn_4734_symbol_QMARK_4736(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Symbol,x_1]))})))}).apply(null,[]);
//======
//(defn keyword? "Return true if x is a Keyword" [x] (instance? clojure.lang.Keyword x))
//---
-(function __clojure_fn_6250(){
-return (clojure.JS.def(clojure,"keyword_QMARK_",(function __clojure_fn_6250_keyword_QMARK_6252(x_1){
+(function __clojure_fn_4740(){
+return (clojure.JS.def(clojure,"keyword_QMARK_",(function __clojure_fn_4740_keyword_QMARK_4742(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Keyword,x_1]))})))}).apply(null,[]);
//======
-//(defn destructure [bindings] (let [bmap (apply array-map bindings) pb (fn pb [bvec b v] (let [pvec (fn [bvec b val] (let [gvec (gensym "vec__")] (loop [ret (-> bvec (conj gvec) (conj val)) n 0 bs b seen-rest? false] (if (seq bs) (let [firstb (first bs)] (cond (= firstb (quote &)) (recur (pb ret (second bs) (list (quote clojure/nthrest) gvec n)) n (rrest bs) true) (= firstb :as) (pb ret (second bs) gvec) :else (if seen-rest? (throw (RT/makeException "Unsupported binding form, only :as can follow & parameter")) (recur (pb ret firstb (list (quote clojure/nth) gvec n nil)) (inc n) (rest bs) seen-rest?)))) ret)))) pmap (fn [bvec b v] (let [gmap (or (:as b) (gensym "map__")) defaults (:or b)] (loop [ret (-> bvec (conj gmap) (conj v)) bes (reduce (fn [bes entry] (reduce (fn* [p1__6256 p2__6257] (assoc p1__6256 p2__6257 ((val entry) p2__6257))) (dissoc bes (key entry)) ((key entry) bes))) (dissoc b :as :or) {:keys (fn* [p1__6258] (keyword (str p1__6258))), :strs str, :syms (fn* [p1__6259] (list (quote quote) p1__6259))})] (if (seq bes) (let [bb (key (first bes)) bk (val (first bes)) has-default (contains? defaults bb)] (recur (pb ret bb (if has-default (list (quote clojure/get) gmap bk (defaults bb)) (list (quote clojure/get) gmap bk))) (rest bes))) ret))))] (cond (symbol? b) (-> bvec (conj b) (conj v)) (vector? b) (pvec bvec b v) (map? b) (pmap bvec b v) :else (throw (RT/makeException (str "Unsupported binding form: " b)))))) process-entry (fn [bvec b] (pb bvec (key b) (val b)))] (if (every? symbol? (keys bmap)) bindings (reduce process-entry [] bmap))))
+//(defn destructure [bindings] (let [bmap (apply array-map bindings) pb (fn pb [bvec b v] (let [pvec (fn [bvec b val] (let [gvec (gensym "vec__")] (loop [ret (-> bvec (conj gvec) (conj val)) n 0 bs b seen-rest? false] (if (seq bs) (let [firstb (first bs)] (cond (= firstb (quote &)) (recur (pb ret (second bs) (list (quote clojure/nthrest) gvec n)) n (rrest bs) true) (= firstb :as) (pb ret (second bs) gvec) :else (if seen-rest? (throw (new Exception "Unsupported binding form, only :as can follow & parameter")) (recur (pb ret firstb (list (quote clojure/nth) gvec n nil)) (inc n) (rest bs) seen-rest?)))) ret)))) pmap (fn [bvec b v] (let [gmap (or (:as b) (gensym "map__")) defaults (:or b)] (loop [ret (-> bvec (conj gmap) (conj v)) bes (reduce (fn [bes entry] (reduce (fn* [p1__4746 p2__4747] (assoc p1__4746 p2__4747 ((val entry) p2__4747))) (dissoc bes (key entry)) ((key entry) bes))) (dissoc b :as :or) {:keys (fn* [p1__4748] (keyword (str p1__4748))), :strs str, :syms (fn* [p1__4749] (list (quote quote) p1__4749))})] (if (seq bes) (let [bb (key (first bes)) bk (val (first bes)) has-default (contains? defaults bb)] (recur (pb ret bb (if has-default (list (quote clojure/get) gmap bk (defaults bb)) (list (quote clojure/get) gmap bk))) (rest bes))) ret))))] (cond (symbol? b) (-> bvec (conj b) (conj v)) (vector? b) (pvec bvec b v) (map? b) (pmap bvec b v) :else (throw (new Exception (str "Unsupported binding form: " b)))))) process-entry (fn [bvec b] (pb bvec (key b) (val b)))] (if (every? symbol? (keys bmap)) bindings (reduce process-entry [] bmap))))
//---
-(function __clojure_fn_6289(){
-return (clojure.JS.def(clojure,"destructure",(function __clojure_fn_6289_destructure_6291(bindings_1){
-var bmap_2,pb_3,process_entry_4;
+(function __clojure_fn_4750(){
+return (clojure.JS.def(clojure,"destructure",(function __clojure_fn_4750_destructure_4752(bindings_1){
+var bmap_2,process_entry_4,pb_3;
return (((bmap_2=clojure.apply.apply(null,[clojure.array_map,bindings_1])),
-(pb_3=(function __clojure_fn_6289_destructure_6291_pb_6293(bvec_1,b_2,v_3){
+(pb_3=(function __clojure_fn_4750_destructure_4752_pb_4754(bvec_1,b_2,v_3){
var pmap_5,pvec_4,pb_0=arguments.callee;
-return (((pvec_4=(function __clojure_fn_6289_destructure_6291_pb_6293_pvec_6294(bvec_1,b_2,val_3){
-var seen_rest_QMARK__8,ret_5,bs_7,gvec_4,n_6,firstb_9;
+return (((pvec_4=(function __clojure_fn_4750_destructure_4752_pb_4754_pvec_4755(bvec_1,b_2,val_3){
+var n_6,seen_rest_QMARK__8,ret_5,bs_7,gvec_4,firstb_9;
return (((gvec_4=clojure.gensym.apply(null,["vec__"])),
((function __loop(){var _rtn,_cnt;(ret_5=clojure.conj.apply(null,[clojure.conj.apply(null,[bvec_1,gvec_4]),val_3])),
(n_6=0),
(bs_7=b_2),
(seen_rest_QMARK__8=false);do{_cnt=0;
_rtn=((clojure.seq.apply(null,[bs_7]))?(((firstb_9=clojure.first.apply(null,[bs_7])),
-((clojure.lang.Util.equal(firstb_9,"'&"))?((_cnt=1,_rtn=[pb_0.apply(null,[ret_5,clojure.second.apply(null,[bs_7]),clojure.list.apply(null,["'clojure/nthrest",gvec_4,n_6])]),n_6,clojure.rrest.apply(null,[bs_7]),true],ret_5=_rtn[0],n_6=_rtn[1],bs_7=_rtn[2],seen_rest_QMARK__8=_rtn[3])):(((clojure.lang.Util.equal(firstb_9,clojure.keyword("","as")))?(pb_0.apply(null,[ret_5,clojure.second.apply(null,[bs_7]),gvec_4])):(((clojure.keyword("","else"))?(((seen_rest_QMARK__8)?((function __throw(){throw clojure.lang.RT.makeException("Unsupported binding form, only :as can follow & parameter")})()):((_cnt=1,_rtn=[pb_0.apply(null,[ret_5,firstb_9,clojure.list.apply(null,["'clojure/nth",gvec_4,n_6,null])]),clojure.lang.Numbers.inc(n_6),clojure.rest.apply(null,[bs_7]),seen_rest_QMARK__8],ret_5=_rtn[0],n_6=_rtn[1],bs_7=_rtn[2],seen_rest_QMARK__8=_rtn[3])))):(null)))))))):(ret_5))}while(_cnt);return _rtn;})())))})),
-(pmap_5=(function __clojure_fn_6289_destructure_6291_pb_6293_pmap_6297(bvec_1,b_2,v_3){
-var bb_8,or__202_4,has_default_10,ret_6,defaults_5,bes_7,bk_9,gmap_4;
+((clojure.lang.Util.equal(firstb_9,"'&"))?((_cnt=1,_rtn=[pb_0.apply(null,[ret_5,clojure.second.apply(null,[bs_7]),clojure.list.apply(null,["'clojure/nthrest",gvec_4,n_6])]),n_6,clojure.rrest.apply(null,[bs_7]),true],ret_5=_rtn[0],n_6=_rtn[1],bs_7=_rtn[2],seen_rest_QMARK__8=_rtn[3])):(((clojure.lang.Util.equal(firstb_9,clojure.keyword("","as")))?(pb_0.apply(null,[ret_5,clojure.second.apply(null,[bs_7]),gvec_4])):(((clojure.keyword("","else"))?(((seen_rest_QMARK__8)?((function __throw(){throw (new java.lang.Exception("Unsupported binding form, only :as can follow & parameter"))})()):((_cnt=1,_rtn=[pb_0.apply(null,[ret_5,firstb_9,clojure.list.apply(null,["'clojure/nth",gvec_4,n_6,null])]),clojure.lang.Numbers.inc(n_6),clojure.rest.apply(null,[bs_7]),seen_rest_QMARK__8],ret_5=_rtn[0],n_6=_rtn[1],bs_7=_rtn[2],seen_rest_QMARK__8=_rtn[3])))):(null)))))))):(ret_5))}while(_cnt);return _rtn;})())))})),
+(pmap_5=(function __clojure_fn_4750_destructure_4752_pb_4754_pmap_4758(bvec_1,b_2,v_3){
+var bes_7,bb_8,has_default_10,bk_9,defaults_5,gmap_4,ret_6,or__202_4;
return (((gmap_4=((or__202_4=clojure.keyword("","as").apply(null,[b_2])),
((or__202_4)?(or__202_4):(clojure.gensym.apply(null,["map__"]))))),
(defaults_5=clojure.keyword("","or").apply(null,[b_2])),
((function __loop(){var _rtn,_cnt;(ret_6=clojure.conj.apply(null,[clojure.conj.apply(null,[bvec_1,gmap_4]),v_3])),
-(bes_7=clojure.reduce.apply(null,[(function __clojure_fn_6289_destructure_6291_pb_6293_pmap_6297_fn_6299(bes_1,entry_2){
-return (clojure.reduce.apply(null,[(function __clojure_fn_6289_destructure_6291_pb_6293_pmap_6297_fn_6299_fn_6301(p1__6256_1,p2__6257_2){
-return (clojure.assoc.apply(null,[p1__6256_1,p2__6257_2,clojure.val.apply(null,[entry_2]).apply(null,[p2__6257_2])]))}),clojure.dissoc.apply(null,[bes_1,clojure.key.apply(null,[entry_2])]),clojure.key.apply(null,[entry_2]).apply(null,[bes_1])]))}),clojure.dissoc.apply(null,[b_2,clojure.keyword("","as"),clojure.keyword("","or")]),clojure.hash_map(clojure.keyword("","keys"),(function __clojure_fn_6289_destructure_6291_pb_6293_pmap_6297_fn_6305(p1__6258_1){
-return (clojure.keyword.apply(null,[clojure.str.apply(null,[p1__6258_1])]))}),clojure.keyword("","strs"),clojure.str,clojure.keyword("","syms"),(function __clojure_fn_6289_destructure_6291_pb_6293_pmap_6297_fn_6308(p1__6259_1){
-return (clojure.list.apply(null,["'quote",p1__6259_1]))}))]));do{_cnt=0;
+(bes_7=clojure.reduce.apply(null,[(function __clojure_fn_4750_destructure_4752_pb_4754_pmap_4758_fn_4760(bes_1,entry_2){
+return (clojure.reduce.apply(null,[(function __clojure_fn_4750_destructure_4752_pb_4754_pmap_4758_fn_4760_fn_4762(p1__4746_1,p2__4747_2){
+return (clojure.assoc.apply(null,[p1__4746_1,p2__4747_2,clojure.val.apply(null,[entry_2]).apply(null,[p2__4747_2])]))}),clojure.dissoc.apply(null,[bes_1,clojure.key.apply(null,[entry_2])]),clojure.key.apply(null,[entry_2]).apply(null,[bes_1])]))}),clojure.dissoc.apply(null,[b_2,clojure.keyword("","as"),clojure.keyword("","or")]),clojure.hash_map(clojure.keyword("","keys"),(function __clojure_fn_4750_destructure_4752_pb_4754_pmap_4758_fn_4766(p1__4748_1){
+return (clojure.keyword.apply(null,[clojure.str.apply(null,[p1__4748_1])]))}),clojure.keyword("","strs"),clojure.str,clojure.keyword("","syms"),(function __clojure_fn_4750_destructure_4752_pb_4754_pmap_4758_fn_4769(p1__4749_1){
+return (clojure.list.apply(null,["'quote",p1__4749_1]))}))]));do{_cnt=0;
_rtn=((clojure.seq.apply(null,[bes_7]))?(((bb_8=clojure.key.apply(null,[clojure.first.apply(null,[bes_7])])),
(bk_9=clojure.val.apply(null,[clojure.first.apply(null,[bes_7])])),
(has_default_10=clojure.contains_QMARK_.apply(null,[defaults_5,bb_8])),
(_cnt=1,_rtn=[pb_0.apply(null,[ret_6,bb_8,((has_default_10)?(clojure.list.apply(null,["'clojure/get",gmap_4,bk_9,defaults_5.apply(null,[bb_8])])):(clojure.list.apply(null,["'clojure/get",gmap_4,bk_9])))]),clojure.rest.apply(null,[bes_7])],ret_6=_rtn[0],bes_7=_rtn[1]))):(ret_6))}while(_cnt);return _rtn;})())))})),
-((clojure.symbol_QMARK_.apply(null,[b_2]))?(clojure.conj.apply(null,[clojure.conj.apply(null,[bvec_1,b_2]),v_3])):(((clojure.vector_QMARK_.apply(null,[b_2]))?(pvec_4.apply(null,[bvec_1,b_2,v_3])):(((clojure.map_QMARK_.apply(null,[b_2]))?(pmap_5.apply(null,[bvec_1,b_2,v_3])):(((clojure.keyword("","else"))?((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["Unsupported binding form: ",b_2]))})()):(null))))))))))})),
-(process_entry_4=(function __clojure_fn_6289_destructure_6291_process_entry_6313(bvec_1,b_2){
+((clojure.symbol_QMARK_.apply(null,[b_2]))?(clojure.conj.apply(null,[clojure.conj.apply(null,[bvec_1,b_2]),v_3])):(((clojure.vector_QMARK_.apply(null,[b_2]))?(pvec_4.apply(null,[bvec_1,b_2,v_3])):(((clojure.map_QMARK_.apply(null,[b_2]))?(pmap_5.apply(null,[bvec_1,b_2,v_3])):(((clojure.keyword("","else"))?((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["Unsupported binding form: ",b_2])))})()):(null))))))))))})),
+(process_entry_4=(function __clojure_fn_4750_destructure_4752_process_entry_4774(bvec_1,b_2){
return (pb_3.apply(null,[bvec_1,clojure.key.apply(null,[b_2]),clojure.val.apply(null,[b_2])]))})),
((clojure.every_QMARK_.apply(null,[clojure.symbol_QMARK_,clojure.keys.apply(null,[bmap_2])]))?(bindings_1):(clojure.reduce.apply(null,[process_entry_4,clojure.lang.PersistentVector.EMPTY,bmap_2])))))})))}).apply(null,[]);
// Skipping: (defmacro let "Evaluates the exprs in a lexical context in which the symbols in\n the binding-forms are bound to their respective init-exprs or parts\n therein." [bindings & body] (when (odd? (count bindings)) (throw (Exception. "Odd number of elements in let bindings"))) (clojure/concat (clojure/list (quote let*)) (clojure/list (destructure bindings)) body))
// Skipping: (defmacro fn "(fn name? [params* ] exprs*)\n (fn name? ([params* ] exprs*)+)\n\n params => positional-params* , or positional-params* & rest-param\n positional-param => binding-form\n rest-param => binding-form\n name => symbol\n\n Defines a function" [& sigs] (let [name (if (symbol? (first sigs)) (first sigs) nil) sigs (if name (rest sigs) sigs) sigs (if (vector? (first sigs)) (list sigs) sigs) psig (fn [sig] (let [[params & body] sig] (if (every? symbol? params) sig (loop [params params new-params [] lets []] (if params (if (symbol? (first params)) (recur (rest params) (conj new-params (first params)) lets) (let [gparam (gensym "p__")] (recur (rest params) (conj new-params gparam) (-> lets (conj (first params)) (conj gparam))))) (clojure/concat (clojure/list new-params) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list lets) body)))))))) new-sigs (map psig sigs)] (with-meta (if name (list* (quote fn*) name new-sigs) (cons (quote fn*) new-sigs)) *macro-meta*)))
// Skipping: (defmacro loop "Evaluates the exprs in a lexical context in which the symbols in\n the binding-forms are bound to their respective init-exprs or parts\n therein. Acts as a recur target." [bindings & body] (let [db (destructure bindings)] (if (= db bindings) (clojure/concat (clojure/list (quote loop*)) (clojure/list bindings) body) (let [vs (take-nth 2 (drop 1 bindings)) bs (take-nth 2 bindings) gs (map (fn [b] (if (symbol? b) b (gensym))) bs) bfs (reduce (fn [ret [b v g]] (if (symbol? b) (conj ret g v) (conj ret g v b g))) [] (map vector bs vs gs))] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list bfs) (clojure/list (clojure/concat (clojure/list (quote loop*)) (clojure/list (vec (interleave gs gs))) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (vec (interleave bs gs))) body)))))))))
// Skipping: (defmacro when-first "Same as (when (seq xs) (let [x (first xs)] body))" [x xs & body] (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list xs))) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list x) (clojure/list (clojure/concat (clojure/list (quote clojure/first)) (clojure/list xs)))))) body))))
-// Skipping: (defmacro lazy-cat "Expands to code which yields a lazy sequence of the concatenation\n of the supplied colls. Each coll expr is not evaluated until it is\n needed." ([coll] (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list coll))) ([coll & colls] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iter__6354)) (clojure/list (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list (quote iter__6354)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote coll__6355))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list (quote coll__6355)))) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cons)) (clojure/list (clojure/concat (clojure/list (quote clojure/first)) (clojure/list (quote coll__6355)))) (clojure/list (clojure/concat (clojure/list (quote iter__6354)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list (quote coll__6355)))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cat)) colls))))))))) (clojure/list (clojure/concat (clojure/list (quote iter__6354)) (clojure/list coll))))))
-// Skipping: (defmacro for "List comprehension. Takes a vector of one or more\n binding-form/collection-expr pairs, each followed by an optional filtering\n :when/:while expression (:when test or :while test), and yields a\n lazy sequence of evaluations of expr. Collections are iterated in a\n nested fashion, rightmost fastest, and nested coll-exprs can refer to\n bindings created in prior binding-forms.\n\n (take 100 (for [x (range 100000000) y (range 1000000) :while (< y x)] [x y]))" ([seq-exprs expr] (let [pargs (fn [xs] (loop [ret [] [b e & [w f & wr :as r] :as xs] (seq xs)] (if xs (cond (= w :when) (recur (conj ret {:e e, :f f, :w :when, :b b}) wr) (= w :while) (recur (conj ret {:e e, :f f, :w :while, :b b}) wr) :else (recur (conj ret {:e e, :f true, :w :while, :b b}) r)) (seq ret)))) emit (fn emit [[{w :w, b :b, f :f} & [{ys :e} :as rses]]] (let [giter (gensym "iter__") gxs (gensym "s__")] (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list giter) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list gxs)))) (clojure/list (clojure/concat (clojure/list (quote clojure/when-first)) (clojure/list b) (clojure/list gxs) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list f) (clojure/list (if rses (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iterys__6363)) (clojure/list (emit rses)) (clojure/list (quote fs__6364)) (clojure/list (clojure/concat (clojure/list (quote iterys__6363)) (clojure/list ys)))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote fs__6364)) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cat)) (clojure/list (quote fs__6364)) (clojure/list (clojure/concat (clojure/list giter) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs))))))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))))))) (clojure/concat (clojure/list (quote clojure/lazy-cons)) (clojure/list expr) (clojure/list (clojure/concat (clojure/list giter) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))))))) (clojure/list (if (= w :when) (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))) nil)))))))))] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iter__6365)) (clojure/list (emit (pargs seq-exprs)))))) (clojure/list (clojure/concat (clojure/list (quote iter__6365)) (clojure/list (second seq-exprs))))))))
+// Skipping: (defmacro lazy-cat "Expands to code which yields a lazy sequence of the concatenation\n of the supplied colls. Each coll expr is not evaluated until it is\n needed." ([coll] (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list coll))) ([coll & colls] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iter__4815)) (clojure/list (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list (quote iter__4815)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote coll__4816))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/seq)) (clojure/list (quote coll__4816)))) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cons)) (clojure/list (clojure/concat (clojure/list (quote clojure/first)) (clojure/list (quote coll__4816)))) (clojure/list (clojure/concat (clojure/list (quote iter__4815)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list (quote coll__4816)))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cat)) colls))))))))) (clojure/list (clojure/concat (clojure/list (quote iter__4815)) (clojure/list coll))))))
+// Skipping: (defmacro for "List comprehension. Takes a vector of one or more\n binding-form/collection-expr pairs, each followed by an optional filtering\n :when/:while expression (:when test or :while test), and yields a\n lazy sequence of evaluations of expr. Collections are iterated in a\n nested fashion, rightmost fastest, and nested coll-exprs can refer to\n bindings created in prior binding-forms.\n\n (take 100 (for [x (range 100000000) y (range 1000000) :while (< y x)] [x y]))" ([seq-exprs expr] (let [pargs (fn [xs] (loop [ret [] [b e & [w f & wr :as r] :as xs] (seq xs)] (if xs (cond (= w :when) (recur (conj ret {:e e, :f f, :w :when, :b b}) wr) (= w :while) (recur (conj ret {:e e, :f f, :w :while, :b b}) wr) :else (recur (conj ret {:e e, :f true, :w :while, :b b}) r)) (seq ret)))) emit (fn emit [[{w :w, b :b, f :f} & [{ys :e} :as rses]]] (let [giter (gensym "iter__") gxs (gensym "s__")] (clojure/concat (clojure/list (quote clojure/fn)) (clojure/list giter) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list gxs)))) (clojure/list (clojure/concat (clojure/list (quote clojure/when-first)) (clojure/list b) (clojure/list gxs) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list f) (clojure/list (if rses (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iterys__4824)) (clojure/list (emit rses)) (clojure/list (quote fs__4825)) (clojure/list (clojure/concat (clojure/list (quote iterys__4824)) (clojure/list ys)))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote fs__4825)) (clojure/list (clojure/concat (clojure/list (quote clojure/lazy-cat)) (clojure/list (quote fs__4825)) (clojure/list (clojure/concat (clojure/list giter) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs))))))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))))))) (clojure/concat (clojure/list (quote clojure/lazy-cons)) (clojure/list expr) (clojure/list (clojure/concat (clojure/list giter) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))))))) (clojure/list (if (= w :when) (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/rest)) (clojure/list gxs)))) nil)))))))))] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote iter__4826)) (clojure/list (emit (pargs seq-exprs)))))) (clojure/list (clojure/concat (clojure/list (quote iter__4826)) (clojure/list (second seq-exprs))))))))
// Skipping: (defmacro comment "Ignores body, yields nil" [& body])
-// Skipping: (defmacro with-out-str "Evaluates exprs in a context in which *out* is bound to a fresh\n StringWriter. Returns the string created by any nested printing\n calls." [& body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote s__6395)) (clojure/list (clojure/concat (clojure/list (quote RT/makeStringWriter))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/binding)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote clojure/*out*)) (clojure/list (quote s__6395))))) body (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list (quote s__6395))))))))
-// Skipping: (defmacro with-in-str "Evaluates body in a context in which *in* is bound to a fresh\n StringReader initialized with the string s." [s & body] (clojure/concat (clojure/list (quote clojure/with-open)) (clojure/list (quote s__6402)) (clojure/list (clojure/concat (clojure/list (quote clojure/->)) (clojure/list (clojure/concat (clojure/list (quote java.io.StringReader.)) (clojure/list s))) (clojure/list (quote clojure.lang.LineNumberingPushbackReader.)))) (clojure/list (clojure/concat (clojure/list (quote clojure/binding)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote clojure/*in*)) (clojure/list (quote s__6402))))) body))))
+// Skipping: (defmacro with-out-str "Evaluates exprs in a context in which *out* is bound to a fresh\n StringWriter. Returns the string created by any nested printing\n calls." [& body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote s__4856)) (clojure/list (clojure/concat (clojure/list (quote new)) (clojure/list (quote java.io.StringWriter))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/binding)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote clojure/*out*)) (clojure/list (quote s__4856))))) body (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list (quote s__4856))))))))
+// Skipping: (defmacro with-in-str "Evaluates body in a context in which *in* is bound to a fresh\n StringReader initialized with the string s." [s & body] (clojure/concat (clojure/list (quote clojure/with-open)) (clojure/list (quote s__4863)) (clojure/list (clojure/concat (clojure/list (quote clojure/->)) (clojure/list (clojure/concat (clojure/list (quote java.io.StringReader.)) (clojure/list s))) (clojure/list (quote clojure.lang.LineNumberingPushbackReader.)))) (clojure/list (clojure/concat (clojure/list (quote clojure/binding)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote clojure/*in*)) (clojure/list (quote s__4863))))) body))))
//======
//(defn pr-str "pr to a string, returning it" {:tag String} [& xs] (with-out-str (apply pr xs)))
//---
-(function __clojure_fn_6415(){
-return (clojure.JS.def(clojure,"pr_str",clojure.JS.variadic(0,(function __clojure_fn_6415_pr_str_6417(){
-var s__1254_2,xs_1=clojure.JS.rest_args(this,arguments,0);
-return (((s__1254_2=clojure.lang.RT.makeStringWriter()),
-clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1254_2])),
+(function __clojure_fn_4870(){
+return (clojure.JS.def(clojure,"pr_str",clojure.JS.variadic(0,(function __clojure_fn_4870_pr_str_4872(){
+var s__1248_2,xs_1=clojure.JS.rest_args(this,arguments,0);
+return (((s__1248_2=(new java.io.StringWriter())),
+clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1248_2])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.pr,xs_1]),
-clojure.str.apply(null,[s__1254_2]))}
+clojure.str.apply(null,[s__1248_2]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})()))}))))}).apply(null,[]);
//======
//(defn prn-str "prn to a string, returning it" {:tag String} [& xs] (with-out-str (apply prn xs)))
//---
-(function __clojure_fn_6427(){
-return (clojure.JS.def(clojure,"prn_str",clojure.JS.variadic(0,(function __clojure_fn_6427_prn_str_6429(){
-var s__1254_2,xs_1=clojure.JS.rest_args(this,arguments,0);
-return (((s__1254_2=clojure.lang.RT.makeStringWriter()),
-clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1254_2])),
+(function __clojure_fn_4876(){
+return (clojure.JS.def(clojure,"prn_str",clojure.JS.variadic(0,(function __clojure_fn_4876_prn_str_4878(){
+var s__1248_2,xs_1=clojure.JS.rest_args(this,arguments,0);
+return (((s__1248_2=(new java.io.StringWriter())),
+clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1248_2])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.prn,xs_1]),
-clojure.str.apply(null,[s__1254_2]))}
+clojure.str.apply(null,[s__1248_2]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})()))}))))}).apply(null,[]);
//======
//(defn print-str "print to a string, returning it" {:tag String} [& xs] (with-out-str (apply print xs)))
//---
-(function __clojure_fn_6439(){
-return (clojure.JS.def(clojure,"print_str",clojure.JS.variadic(0,(function __clojure_fn_6439_print_str_6441(){
-var s__1254_2,xs_1=clojure.JS.rest_args(this,arguments,0);
-return (((s__1254_2=clojure.lang.RT.makeStringWriter()),
-clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1254_2])),
+(function __clojure_fn_4882(){
+return (clojure.JS.def(clojure,"print_str",clojure.JS.variadic(0,(function __clojure_fn_4882_print_str_4884(){
+var s__1248_2,xs_1=clojure.JS.rest_args(this,arguments,0);
+return (((s__1248_2=(new java.io.StringWriter())),
+clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1248_2])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.print,xs_1]),
-clojure.str.apply(null,[s__1254_2]))}
+clojure.str.apply(null,[s__1248_2]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})()))}))))}).apply(null,[]);
//======
//(defn println-str "println to a string, returning it" {:tag String} [& xs] (with-out-str (apply println xs)))
//---
-(function __clojure_fn_6451(){
-return (clojure.JS.def(clojure,"println_str",clojure.JS.variadic(0,(function __clojure_fn_6451_println_str_6453(){
-var s__1254_2,xs_1=clojure.JS.rest_args(this,arguments,0);
-return (((s__1254_2=clojure.lang.RT.makeStringWriter()),
-clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1254_2])),
+(function __clojure_fn_4888(){
+return (clojure.JS.def(clojure,"println_str",clojure.JS.variadic(0,(function __clojure_fn_4888_println_str_4890(){
+var s__1248_2,xs_1=clojure.JS.rest_args(this,arguments,0);
+return (((s__1248_2=(new java.io.StringWriter())),
+clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_out_STAR_,s__1248_2])),
(function __try(){try{var _rtn=(clojure.apply.apply(null,[clojure.println,xs_1]),
-clojure.str.apply(null,[s__1254_2]))}
+clojure.str.apply(null,[s__1248_2]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})()))}))))}).apply(null,[]);
-// Skipping: (defmacro assert "Evaluates expr and throws an exception if it does not evaluate to\n logical true." [x] (clojure/concat (clojure/list (quote clojure/when-not)) (clojure/list x) (clojure/list (clojure/concat (clojure/list (quote throw)) (clojure/list (clojure/concat (clojure/list (quote RT/makeException)) (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list "Assert failed: ") (clojure/list (clojure/concat (clojure/list (quote clojure/pr-str)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list x)))))))))))))
+// Skipping: (defmacro assert "Evaluates expr and throws an exception if it does not evaluate to\n logical true." [x] (clojure/concat (clojure/list (quote clojure/when-not)) (clojure/list x) (clojure/list (clojure/concat (clojure/list (quote throw)) (clojure/list (clojure/concat (clojure/list (quote new)) (clojure/list (quote java.lang.Exception)) (clojure/list (clojure/concat (clojure/list (quote clojure/str)) (clojure/list "Assert failed: ") (clojure/list (clojure/concat (clojure/list (quote clojure/pr-str)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list x)))))))))))))
//======
//(defn test "test [v] finds fn at key :test in var metadata and calls it,\n presuming failure will throw exception" [v] (let [f (:test (clojure/meta v))] (if f (do (f) :ok) :no-test)))
//---
-(function __clojure_fn_6469(){
-return (clojure.JS.def(clojure,"test",(function __clojure_fn_6469_test_6471(v_1){
+(function __clojure_fn_4900(){
+return (clojure.JS.def(clojure,"test",(function __clojure_fn_4900_test_4902(v_1){
var f_2;
return (((f_2=clojure.keyword("","test").apply(null,[clojure.meta.apply(null,[v_1])])),
((f_2)?(f_2.apply(null,[]),
@@ -1952,26 +1945,26 @@ clojure.keyword("","ok")):(clojure.keyword("","no-test")))))})))}).apply(null,[]
// Skipping: (defn re-find "Returns the next regex match, if any, of string to pattern, using\n java.util.regex.Matcher.find(). Uses re-groups to return the\n groups." ([m] (when (. m (find)) (re-groups m))) ([re s] (let [m (re-matcher re s)] (re-find m))))
//======
-//(defn rand "Returns a random floating point number between 0 (inclusive) and\n 1 (exclusive)." ([] (RT/random)) ([n] (* n (rand))))
+//(defn rand "Returns a random floating point number between 0 (inclusive) and\n 1 (exclusive)." ([] (. Math (random))) ([n] (* n (rand))))
//---
-(function __clojure_fn_6526(){
-return (clojure.JS.def(clojure,"rand",(function __clojure_fn_6526_rand_6528(n_1){switch(arguments.length){
-case 0:return (clojure.lang.RT.random())}
+(function __clojure_fn_4950(){
+return (clojure.JS.def(clojure,"rand",(function __clojure_fn_4950_rand_4952(n_1){switch(arguments.length){
+case 0:return (java.lang.Math.random())}
return (clojure.lang.Numbers.multiply(n_1,clojure.rand.apply(null,[])))})))}).apply(null,[]);
//======
//(defn rand-int "Returns a random integer between 0 (inclusive) and n (exclusive)." [n] (int (rand n)))
//---
-(function __clojure_fn_6539(){
-return (clojure.JS.def(clojure,"rand_int",(function __clojure_fn_6539_rand_int_6541(n_1){
+(function __clojure_fn_4957(){
+return (clojure.JS.def(clojure,"rand_int",(function __clojure_fn_4957_rand_int_4959(n_1){
return (clojure.lang.RT.intCast(clojure.rand.apply(null,[n_1])))})))}).apply(null,[]);
// Skipping: (defmacro defn- "same as defn, yielding non-public def" [name & decls] (list* (quote clojure/defn) (with-meta name (assoc (meta name) :private true)) decls))
//======
//(defn print-doc [v] (println "-------------------------") (println (str (ns-name (:ns (clojure/meta v))) "/" (:name (clojure/meta v)))) (prn (:arglists (clojure/meta v))) (when (:macro (clojure/meta v)) (println "Macro")) (println " " (:doc (clojure/meta v))))
//---
-(function __clojure_fn_6557(){
-return (clojure.JS.def(clojure,"print_doc",(function __clojure_fn_6557_print_doc_6559(v_1){
+(function __clojure_fn_4969(){
+return (clojure.JS.def(clojure,"print_doc",(function __clojure_fn_4969_print_doc_4971(v_1){
return (clojure.println.apply(null,["-------------------------"]),
clojure.println.apply(null,[clojure.str.apply(null,[clojure.ns_name.apply(null,[clojure.keyword("","ns").apply(null,[clojure.meta.apply(null,[v_1])])]),"/",clojure.keyword("","name").apply(null,[clojure.meta.apply(null,[v_1])])])]),
clojure.prn.apply(null,[clojure.keyword("","arglists").apply(null,[clojure.meta.apply(null,[v_1])])]),
@@ -1981,51 +1974,51 @@ clojure.println.apply(null,[" ",clojure.keyword("","doc").apply(null,[clojure.me
//======
//(defn find-doc "Prints documentation for any var whose documentation or name\n contains a match for re-string" [re-string] (let [re (re-pattern re-string)] (dorun (for [ns (all-ns) v (sort-by (comp :name meta) (vals (ns-interns ns))) :when (and (:doc (clojure/meta v)) (or (re-find (re-matcher re (:doc (clojure/meta v)))) (re-find (re-matcher re (str (:name (clojure/meta v)))))))] (print-doc v)))))
//---
-(function __clojure_fn_6589(){
-return (clojure.JS.def(clojure,"find_doc",(function __clojure_fn_6589_find_doc_6591(re_string_1){
-var iter__1230_3,re_2;
+(function __clojure_fn_4975(){
+return (clojure.JS.def(clojure,"find_doc",(function __clojure_fn_4975_find_doc_4977(re_string_1){
+var iter__1224_3,re_2;
return (((re_2=clojure.re_pattern.apply(null,[re_string_1])),
-clojure.dorun.apply(null,[((iter__1230_3=(function __clojure_fn_6589_find_doc_6591_iter_6593_6597(s__6594_1){
-var _cnt,_rtn,iter__1222_5,iterys__1228_3,ns_2,fs__1229_4,iter__6593_0=arguments.callee;
-do{_cnt=0;_rtn=((clojure.seq.apply(null,[s__6594_1]))?(((ns_2=clojure.first.apply(null,[s__6594_1])),
-((true)?(((iterys__1228_3=(function __clojure_fn_6589_find_doc_6591_iter_6593_6597_iter_6595_6598(s__6596_1){
-var _cnt,_rtn,and__196_3,or__202_4,v_2,iter__6595_0=arguments.callee;
-do{_cnt=0;_rtn=((clojure.seq.apply(null,[s__6596_1]))?(((v_2=clojure.first.apply(null,[s__6596_1])),
+clojure.dorun.apply(null,[((iter__1224_3=(function __clojure_fn_4975_find_doc_4977_iter_4979_4983(s__4980_1){
+var _cnt,_rtn,iter__1216_5,ns_2,fs__1223_4,iterys__1222_3,iter__4979_0=arguments.callee;
+do{_cnt=0;_rtn=((clojure.seq.apply(null,[s__4980_1]))?(((ns_2=clojure.first.apply(null,[s__4980_1])),
+((true)?(((iterys__1222_3=(function __clojure_fn_4975_find_doc_4977_iter_4979_4983_iter_4981_4984(s__4982_1){
+var _cnt,_rtn,and__196_3,or__202_4,v_2,iter__4981_0=arguments.callee;
+do{_cnt=0;_rtn=((clojure.seq.apply(null,[s__4982_1]))?(((v_2=clojure.first.apply(null,[s__4982_1])),
((((and__196_3=clojure.keyword("","doc").apply(null,[clojure.meta.apply(null,[v_2])])),
((and__196_3)?(((or__202_4=clojure.re_find.apply(null,[clojure.re_matcher.apply(null,[re_2,clojure.keyword("","doc").apply(null,[clojure.meta.apply(null,[v_2])])])])),
-((or__202_4)?(or__202_4):(clojure.re_find.apply(null,[clojure.re_matcher.apply(null,[re_2,clojure.str.apply(null,[clojure.keyword("","name").apply(null,[clojure.meta.apply(null,[v_2])])])])]))))):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_6589_find_doc_6591_iter_6593_6597_iter_6595_6598_fn_6600(G__6599_1){switch(arguments.length){
+((or__202_4)?(or__202_4):(clojure.re_find.apply(null,[clojure.re_matcher.apply(null,[re_2,clojure.str.apply(null,[clojure.keyword("","name").apply(null,[clojure.meta.apply(null,[v_2])])])])]))))):(and__196_3))))?((new clojure.lang.LazyCons((function __clojure_fn_4975_find_doc_4977_iter_4979_4983_iter_4981_4984_fn_4986(G__4985_1){switch(arguments.length){
case 0:return (clojure.print_doc.apply(null,[v_2]))}
-return (iter__6595_0.apply(null,[clojure.rest.apply(null,[s__6596_1])]))})))):((_cnt=1,_rtn=[clojure.rest.apply(null,[s__6596_1])],s__6596_1=_rtn[0]))))):(null))
+return (iter__4981_0.apply(null,[clojure.rest.apply(null,[s__4982_1])]))})))):((_cnt=1,_rtn=[clojure.rest.apply(null,[s__4982_1])],s__4982_1=_rtn[0]))))):(null))
}while(_cnt);return _rtn;})),
-(fs__1229_4=iterys__1228_3.apply(null,[clojure.sort_by.apply(null,[clojure.comp.apply(null,[clojure.keyword("","name"),clojure.meta]),clojure.vals.apply(null,[clojure.ns_interns.apply(null,[ns_2])])])])),
-((fs__1229_4)?(((iter__1222_5=(function __clojure_fn_6589_find_doc_6591_iter_6593_6597_iter_1222_6605(coll__1223_1){
-var iter__1222_0=arguments.callee;
-return (((clojure.seq.apply(null,[coll__1223_1]))?((new clojure.lang.LazyCons((function __clojure_fn_6589_find_doc_6591_iter_6593_6597_iter_1222_6605_fn_6607(G__6606_1){switch(arguments.length){
-case 0:return (clojure.first.apply(null,[coll__1223_1]))}
-return (iter__1222_0.apply(null,[clojure.rest.apply(null,[coll__1223_1])]))})))):(clojure.seq.apply(null,[iter__6593_0.apply(null,[clojure.rest.apply(null,[s__6594_1])])]))))})),
-iter__1222_5.apply(null,[fs__1229_4]))):((_cnt=1,_rtn=[clojure.rest.apply(null,[s__6594_1])],s__6594_1=_rtn[0]))))):(null)))):(null))
+(fs__1223_4=iterys__1222_3.apply(null,[clojure.sort_by.apply(null,[clojure.comp.apply(null,[clojure.keyword("","name"),clojure.meta]),clojure.vals.apply(null,[clojure.ns_interns.apply(null,[ns_2])])])])),
+((fs__1223_4)?(((iter__1216_5=(function __clojure_fn_4975_find_doc_4977_iter_4979_4983_iter_1216_4991(coll__1217_1){
+var iter__1216_0=arguments.callee;
+return (((clojure.seq.apply(null,[coll__1217_1]))?((new clojure.lang.LazyCons((function __clojure_fn_4975_find_doc_4977_iter_4979_4983_iter_1216_4991_fn_4993(G__4992_1){switch(arguments.length){
+case 0:return (clojure.first.apply(null,[coll__1217_1]))}
+return (iter__1216_0.apply(null,[clojure.rest.apply(null,[coll__1217_1])]))})))):(clojure.seq.apply(null,[iter__4979_0.apply(null,[clojure.rest.apply(null,[s__4980_1])])]))))})),
+iter__1216_5.apply(null,[fs__1223_4]))):((_cnt=1,_rtn=[clojure.rest.apply(null,[s__4980_1])],s__4980_1=_rtn[0]))))):(null)))):(null))
}while(_cnt);return _rtn;})),
-iter__1230_3.apply(null,[clojure.all_ns.apply(null,[])]))])))})))}).apply(null,[]);
+iter__1224_3.apply(null,[clojure.all_ns.apply(null,[])]))])))})))}).apply(null,[]);
//======
//(defn special-form-anchor "Returns the anchor tag on http://clojure.org/special_forms for the\n special form x, or nil" [x] (#{(quote recur) (quote .) (quote var) (quote let) (quote quote) (quote set!) (quote monitor-enter) (quote loop) (quote new) (quote fn) (quote if) (quote try) (quote def) (quote monitor-exit) (quote throw) (quote do)} x))
//---
-(function __clojure_fn_6621(){
-return (clojure.JS.def(clojure,"special_form_anchor",(function __clojure_fn_6621_special_form_anchor_6623(x_1){
+(function __clojure_fn_5001(){
+return (clojure.JS.def(clojure,"special_form_anchor",(function __clojure_fn_5001_special_form_anchor_5003(x_1){
return (clojure.hash_set("'recur","'.","'var","'let","'quote","'set!","'monitor-enter","'loop","'new","'fn","'if","'try","'def","'monitor-exit","'throw","'do").apply(null,[x_1]))})))}).apply(null,[]);
//======
//(defn syntax-symbol-anchor "Returns the anchor tag on http://clojure.org/special_forms for the\n special form that uses syntax symbol x, or nil" [x] ({(quote &) (quote fn), (quote catch) (quote try), (quote finally) (quote try)} x))
//---
-(function __clojure_fn_6633(){
-return (clojure.JS.def(clojure,"syntax_symbol_anchor",(function __clojure_fn_6633_syntax_symbol_anchor_6635(x_1){
+(function __clojure_fn_5007(){
+return (clojure.JS.def(clojure,"syntax_symbol_anchor",(function __clojure_fn_5007_syntax_symbol_anchor_5009(x_1){
return (clojure.hash_map("'&","'fn","'catch","'try","'finally","'try").apply(null,[x_1]))})))}).apply(null,[]);
//======
//(defn print-special-doc [name type anchor] (println "-------------------------") (println name) (println type) (println (str " Please see http://clojure.org/special_forms#" anchor)))
//---
-(function __clojure_fn_6645(){
-return (clojure.JS.def(clojure,"print_special_doc",(function __clojure_fn_6645_print_special_doc_6647(name_1,type_2,anchor_3){
+(function __clojure_fn_5013(){
+return (clojure.JS.def(clojure,"print_special_doc",(function __clojure_fn_5013_print_special_doc_5015(name_1,type_2,anchor_3){
return (clojure.println.apply(null,["-------------------------"]),
clojure.println.apply(null,[name_1]),
clojure.println.apply(null,[type_2]),
@@ -2035,221 +2028,221 @@ clojure.println.apply(null,[clojure.str.apply(null,[" Please see http://clojure
//======
//(defn tree-seq "returns a lazy sequence of the nodes in a tree, via a depth-first walk.\n branch? must be a fn of one arg that returns true if passed a node\n that can have children (but may not). children must be a fn of one\n arg that returns a sequence of the children. Will only be called on\n nodes for which branch? returns true. Root is the root node of the\n tree, must be a branch." [branch? children root] (let [walk (fn walk [nodes] (when-first node nodes (lazy-cons node (if (branch? node) (lazy-cat (walk (children node)) (walk (rest nodes))) (walk (rest nodes))))))] (lazy-cons root (walk (children root)))))
//---
-(function __clojure_fn_6682(){
-return (clojure.JS.def(clojure,"tree_seq",(function __clojure_fn_6682_tree_seq_6684(branch_QMARK__1,children_2,root_3){
+(function __clojure_fn_5025(){
+return (clojure.JS.def(clojure,"tree_seq",(function __clojure_fn_5025_tree_seq_5027(branch_QMARK__1,children_2,root_3){
var walk_4;
-return (((walk_4=(function __clojure_fn_6682_tree_seq_6684_walk_6686(nodes_1){
+return (((walk_4=(function __clojure_fn_5025_tree_seq_5027_walk_5029(nodes_1){
var node_2,walk_0=arguments.callee;
return (((clojure.seq.apply(null,[nodes_1]))?(((node_2=clojure.first.apply(null,[nodes_1])),
-(new clojure.lang.LazyCons((function __clojure_fn_6682_tree_seq_6684_walk_6686_fn_6688(G__6687_1){switch(arguments.length){
+(new clojure.lang.LazyCons((function __clojure_fn_5025_tree_seq_5027_walk_5029_fn_5031(G__5030_1){switch(arguments.length){
case 0:return (node_2)}
-var iter__1222_2;
-return (((branch_QMARK__1.apply(null,[node_2]))?(((iter__1222_2=(function __clojure_fn_6682_tree_seq_6684_walk_6686_fn_6688_iter_1222_6691(coll__1223_1){
-var iter__1222_0=arguments.callee;
-return (((clojure.seq.apply(null,[coll__1223_1]))?((new clojure.lang.LazyCons((function __clojure_fn_6682_tree_seq_6684_walk_6686_fn_6688_iter_1222_6691_fn_6693(G__6692_1){switch(arguments.length){
-case 0:return (clojure.first.apply(null,[coll__1223_1]))}
-return (iter__1222_0.apply(null,[clojure.rest.apply(null,[coll__1223_1])]))})))):(clojure.seq.apply(null,[walk_0.apply(null,[clojure.rest.apply(null,[nodes_1])])]))))})),
-iter__1222_2.apply(null,[walk_0.apply(null,[children_2.apply(null,[node_2])])]))):(walk_0.apply(null,[clojure.rest.apply(null,[nodes_1])]))))}))))):(null)))})),
-(new clojure.lang.LazyCons((function __clojure_fn_6682_tree_seq_6684_fn_6701(G__6700_1){switch(arguments.length){
+var iter__1216_2;
+return (((branch_QMARK__1.apply(null,[node_2]))?(((iter__1216_2=(function __clojure_fn_5025_tree_seq_5027_walk_5029_fn_5031_iter_1216_5034(coll__1217_1){
+var iter__1216_0=arguments.callee;
+return (((clojure.seq.apply(null,[coll__1217_1]))?((new clojure.lang.LazyCons((function __clojure_fn_5025_tree_seq_5027_walk_5029_fn_5031_iter_1216_5034_fn_5036(G__5035_1){switch(arguments.length){
+case 0:return (clojure.first.apply(null,[coll__1217_1]))}
+return (iter__1216_0.apply(null,[clojure.rest.apply(null,[coll__1217_1])]))})))):(clojure.seq.apply(null,[walk_0.apply(null,[clojure.rest.apply(null,[nodes_1])])]))))})),
+iter__1216_2.apply(null,[walk_0.apply(null,[children_2.apply(null,[node_2])])]))):(walk_0.apply(null,[clojure.rest.apply(null,[nodes_1])]))))}))))):(null)))})),
+(new clojure.lang.LazyCons((function __clojure_fn_5025_tree_seq_5027_fn_5044(G__5043_1){switch(arguments.length){
case 0:return (root_3)}
return (walk_4.apply(null,[children_2.apply(null,[root_3])]))})))))})))}).apply(null,[]);
//======
//(defn file-seq "A tree seq on java.io.Files" [dir] (tree-seq (fn [f] (. f (isDirectory))) (fn [d] (seq (. d (listFiles)))) dir))
//---
-(function __clojure_fn_6719(){
-return (clojure.JS.def(clojure,"file_seq",(function __clojure_fn_6719_file_seq_6721(dir_1){
-return (clojure.tree_seq.apply(null,[(function __clojure_fn_6719_file_seq_6721_fn_6723(f_1){
-return ((f_1).isDirectory())}),(function __clojure_fn_6719_file_seq_6721_fn_6726(d_1){
+(function __clojure_fn_5050(){
+return (clojure.JS.def(clojure,"file_seq",(function __clojure_fn_5050_file_seq_5052(dir_1){
+return (clojure.tree_seq.apply(null,[(function __clojure_fn_5050_file_seq_5052_fn_5054(f_1){
+return ((f_1).isDirectory())}),(function __clojure_fn_5050_file_seq_5052_fn_5057(d_1){
return (clojure.seq.apply(null,[(d_1).listFiles()]))}),dir_1]))})))}).apply(null,[]);
//======
//(defn xml-seq "A tree seq on the xml elements as per xml/parse" [root] (tree-seq (complement string?) (comp seq :content) root))
//---
-(function __clojure_fn_6737(){
-return (clojure.JS.def(clojure,"xml_seq",(function __clojure_fn_6737_xml_seq_6739(root_1){
+(function __clojure_fn_5062(){
+return (clojure.JS.def(clojure,"xml_seq",(function __clojure_fn_5062_xml_seq_5064(root_1){
return (clojure.tree_seq.apply(null,[clojure.complement.apply(null,[clojure.string_QMARK_]),clojure.comp.apply(null,[clojure.seq,clojure.keyword("","content")]),root_1]))})))}).apply(null,[]);
// Skipping: (defn special-symbol? "Returns true if s names a special form" [s] (contains? (. clojure.lang.Compiler specials) s))
//======
//(defn var? "Returns true if v is of type clojure.lang.Var" [v] (instance? clojure.lang.Var v))
//---
-(function __clojure_fn_6755(){
-return (clojure.JS.def(clojure,"var_QMARK_",(function __clojure_fn_6755_var_QMARK_6757(v_1){
+(function __clojure_fn_5074(){
+return (clojure.JS.def(clojure,"var_QMARK_",(function __clojure_fn_5074_var_QMARK_5076(v_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Var,v_1]))})))}).apply(null,[]);
-// Skipping: (defn slurp "Reads the file named by f into a string and returns it." [f] (with-open r (new java.io.BufferedReader (new java.io.FileReader f)) (let [sb (RT/makeStringBuilder)] (loop [c (. r (read))] (if (neg? c) (str sb) (do (. sb (append (char c))) (recur (. r (read)))))))))
+// Skipping: (defn slurp "Reads the file named by f into a string and returns it." [f] (with-open r (new java.io.BufferedReader (new java.io.FileReader f)) (let [sb (new StringBuilder)] (loop [c (. r (read))] (if (neg? c) (str sb) (do (. sb (append (char c))) (recur (. r (read)))))))))
//======
//(defn subs "Returns the substring of s beginning at start inclusive, and ending\n at end (defaults to length of string), exclusive." ([s start] (. s (substring start))) ([s start end] (. s (substring start end))))
//---
-(function __clojure_fn_6774(){
-return (clojure.JS.def(clojure,"subs",(function __clojure_fn_6774_subs_6776(s_1,start_2,end_3){switch(arguments.length){
+(function __clojure_fn_5086(){
+return (clojure.JS.def(clojure,"subs",(function __clojure_fn_5086_subs_5088(s_1,start_2,end_3){switch(arguments.length){
case 2:return ((s_1).substring(start_2))}
return ((s_1).substring(start_2,end_3))})))}).apply(null,[]);
//======
-//(defn max-key "Returns the x for which (k x), a number, is greatest." ([k x] x) ([k x y] (if (> (k x) (k y)) x y)) ([k x y & more] (reduce (fn* [p1__6781 p2__6782] (max-key k p1__6781 p2__6782)) (max-key k x y) more)))
+//(defn max-key "Returns the x for which (k x), a number, is greatest." ([k x] x) ([k x y] (if (> (k x) (k y)) x y)) ([k x y & more] (reduce (fn* [p1__5093 p2__5094] (max-key k p1__5093 p2__5094)) (max-key k x y) more)))
//---
-(function __clojure_fn_6794(){
-return (clojure.JS.def(clojure,"max_key",clojure.JS.variadic(3,(function __clojure_fn_6794_max_key_6796(k_1,x_2,y_3){switch(arguments.length){
+(function __clojure_fn_5095(){
+return (clojure.JS.def(clojure,"max_key",clojure.JS.variadic(3,(function __clojure_fn_5095_max_key_5097(k_1,x_2,y_3){switch(arguments.length){
case 2:return (x_2)
case 3:return (((clojure.lang.Numbers.gt(k_1.apply(null,[x_2]),k_1.apply(null,[y_3])))?(x_2):(y_3)))}
var more_4=clojure.JS.rest_args(this,arguments,3);
-return (clojure.reduce.apply(null,[(function __clojure_fn_6794_max_key_6796_fn_6800(p1__6781_1,p2__6782_2){
-return (clojure.max_key.apply(null,[k_1,p1__6781_1,p2__6782_2]))}),clojure.max_key.apply(null,[k_1,x_2,y_3]),more_4]))}))))}).apply(null,[]);
+return (clojure.reduce.apply(null,[(function __clojure_fn_5095_max_key_5097_fn_5101(p1__5093_1,p2__5094_2){
+return (clojure.max_key.apply(null,[k_1,p1__5093_1,p2__5094_2]))}),clojure.max_key.apply(null,[k_1,x_2,y_3]),more_4]))}))))}).apply(null,[]);
//======
-//(defn min-key "Returns the x for which (k x), a number, is least." ([k x] x) ([k x y] (if (< (k x) (k y)) x y)) ([k x y & more] (reduce (fn* [p1__6805 p2__6806] (min-key k p1__6805 p2__6806)) (min-key k x y) more)))
+//(defn min-key "Returns the x for which (k x), a number, is least." ([k x] x) ([k x y] (if (< (k x) (k y)) x y)) ([k x y & more] (reduce (fn* [p1__5106 p2__5107] (min-key k p1__5106 p2__5107)) (min-key k x y) more)))
//---
-(function __clojure_fn_6818(){
-return (clojure.JS.def(clojure,"min_key",clojure.JS.variadic(3,(function __clojure_fn_6818_min_key_6820(k_1,x_2,y_3){switch(arguments.length){
+(function __clojure_fn_5108(){
+return (clojure.JS.def(clojure,"min_key",clojure.JS.variadic(3,(function __clojure_fn_5108_min_key_5110(k_1,x_2,y_3){switch(arguments.length){
case 2:return (x_2)
case 3:return (((clojure.lang.Numbers.lt(k_1.apply(null,[x_2]),k_1.apply(null,[y_3])))?(x_2):(y_3)))}
var more_4=clojure.JS.rest_args(this,arguments,3);
-return (clojure.reduce.apply(null,[(function __clojure_fn_6818_min_key_6820_fn_6824(p1__6805_1,p2__6806_2){
-return (clojure.min_key.apply(null,[k_1,p1__6805_1,p2__6806_2]))}),clojure.min_key.apply(null,[k_1,x_2,y_3]),more_4]))}))))}).apply(null,[]);
+return (clojure.reduce.apply(null,[(function __clojure_fn_5108_min_key_5110_fn_5114(p1__5106_1,p2__5107_2){
+return (clojure.min_key.apply(null,[k_1,p1__5106_1,p2__5107_2]))}),clojure.min_key.apply(null,[k_1,x_2,y_3]),more_4]))}))))}).apply(null,[]);
//======
//(defn distinct "Returns a lazy sequence of the elements of coll with duplicates removed" [coll] (let [step (fn step [[f & r :as xs] seen] (when xs (if (seen f) (recur r seen) (lazy-cons f (step r (conj seen f))))))] (step (seq coll) #{})))
//---
-(function __clojure_fn_6844(){
-return (clojure.JS.def(clojure,"distinct",(function __clojure_fn_6844_distinct_6846(coll_1){
+(function __clojure_fn_5119(){
+return (clojure.JS.def(clojure,"distinct",(function __clojure_fn_5119_distinct_5121(coll_1){
var step_2;
-return (((step_2=(function __clojure_fn_6844_distinct_6846_step_6849(p__6848_1,seen_2){
-var _cnt,_rtn,xs_6,vec__6850_3,r_5,f_4,step_0=arguments.callee;
-do{_cnt=0;_rtn=((vec__6850_3=p__6848_1),
-(f_4=clojure.nth.apply(null,[vec__6850_3,0,null])),
-(r_5=clojure.nthrest.apply(null,[vec__6850_3,1])),
-(xs_6=vec__6850_3),
-((xs_6)?(((seen_2.apply(null,[f_4]))?((_cnt=1,_rtn=[r_5,seen_2],p__6848_1=_rtn[0],seen_2=_rtn[1])):((new clojure.lang.LazyCons((function __clojure_fn_6844_distinct_6846_step_6849_fn_6852(G__6851_1){switch(arguments.length){
+return (((step_2=(function __clojure_fn_5119_distinct_5121_step_5124(p__5123_1,seen_2){
+var _cnt,_rtn,f_4,r_5,vec__5125_3,xs_6,step_0=arguments.callee;
+do{_cnt=0;_rtn=((vec__5125_3=p__5123_1),
+(f_4=clojure.nth.apply(null,[vec__5125_3,0,null])),
+(r_5=clojure.nthrest.apply(null,[vec__5125_3,1])),
+(xs_6=vec__5125_3),
+((xs_6)?(((seen_2.apply(null,[f_4]))?((_cnt=1,_rtn=[r_5,seen_2],p__5123_1=_rtn[0],seen_2=_rtn[1])):((new clojure.lang.LazyCons((function __clojure_fn_5119_distinct_5121_step_5124_fn_5127(G__5126_1){switch(arguments.length){
case 0:return (f_4)}
return (step_0.apply(null,[r_5,clojure.conj.apply(null,[seen_2,f_4])]))})))))):(null)))
}while(_cnt);return _rtn;})),
step_2.apply(null,[clojure.seq.apply(null,[coll_1]),clojure.lang.PersistentHashSet.EMPTY])))})))}).apply(null,[]);
-// Skipping: (defmacro if-let "if test is true, evaluates then with binding-form bound to the value of test, if not, yields else" ([binding-form test then] (clojure/concat (clojure/list (quote clojure/if-let)) (clojure/list binding-form) (clojure/list test) (clojure/list then) (clojure/list (quote nil)))) ([binding-form test then else] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote temp__6859)) (clojure/list test)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote temp__6859)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list binding-form) (clojure/list (quote temp__6859))))) (clojure/list then))) (clojure/list else))))))
-// Skipping: (defmacro when-let "when test is true, evaluates body with binding-form bound to the value of test" [binding-form test & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote temp__6867)) (clojure/list test)))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (quote temp__6867)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list binding-form) (clojure/list (quote temp__6867))))) body))))))
-
-//======
-//(defn replace "Given a map of replacement pairs and a vector/collection, returns a\n vector/seq with any elements = a key in smap replaced with the\n corresponding val in smap" [smap coll] (if (vector? coll) (reduce (fn [v i] (if-let e (find smap (nth v i)) (assoc v i (val e)) v)) coll (range (count coll))) (map (fn* [p1__6874] (if-let e (find smap p1__6874) (val e) p1__6874)) coll)))
-//---
-(function __clojure_fn_6887(){
-return (clojure.JS.def(clojure,"replace",(function __clojure_fn_6887_replace_6889(smap_1,coll_2){
-return (((clojure.vector_QMARK_.apply(null,[coll_2]))?(clojure.reduce.apply(null,[(function __clojure_fn_6887_replace_6889_fn_6891(v_1,i_2){
-var temp__1433_3,e_4;
-return (((temp__1433_3=clojure.find.apply(null,[smap_1,clojure.nth.apply(null,[v_1,i_2])])),
-((temp__1433_3)?(((e_4=temp__1433_3),
-clojure.assoc.apply(null,[v_1,i_2,clojure.val.apply(null,[e_4])]))):(v_1))))}),coll_2,clojure.range.apply(null,[clojure.count.apply(null,[coll_2])])])):(clojure.map.apply(null,[(function __clojure_fn_6887_replace_6889_fn_6894(p1__6874_1){
-var e_3,temp__1433_2;
-return (((temp__1433_2=clojure.find.apply(null,[smap_1,p1__6874_1])),
-((temp__1433_2)?(((e_3=temp__1433_2),
-clojure.val.apply(null,[e_3]))):(p1__6874_1))))}),coll_2]))))})))}).apply(null,[]);
+// Skipping: (defmacro if-let "if test is true, evaluates then with binding-form bound to the value of test, if not, yields else" ([binding-form test then] (clojure/concat (clojure/list (quote clojure/if-let)) (clojure/list binding-form) (clojure/list test) (clojure/list then) (clojure/list (quote nil)))) ([binding-form test then else] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote temp__5134)) (clojure/list test)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (quote temp__5134)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list binding-form) (clojure/list (quote temp__5134))))) (clojure/list then))) (clojure/list else))))))
+// Skipping: (defmacro when-let "when test is true, evaluates body with binding-form bound to the value of test" [binding-form test & body] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote temp__5142)) (clojure/list test)))) (clojure/list (clojure/concat (clojure/list (quote clojure/when)) (clojure/list (quote temp__5142)) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list binding-form) (clojure/list (quote temp__5142))))) body))))))
+
+//======
+//(defn replace "Given a map of replacement pairs and a vector/collection, returns a\n vector/seq with any elements = a key in smap replaced with the\n corresponding val in smap" [smap coll] (if (vector? coll) (reduce (fn [v i] (if-let e (find smap (nth v i)) (assoc v i (val e)) v)) coll (range (count coll))) (map (fn* [p1__5149] (if-let e (find smap p1__5149) (val e) p1__5149)) coll)))
+//---
+(function __clojure_fn_5150(){
+return (clojure.JS.def(clojure,"replace",(function __clojure_fn_5150_replace_5152(smap_1,coll_2){
+return (((clojure.vector_QMARK_.apply(null,[coll_2]))?(clojure.reduce.apply(null,[(function __clojure_fn_5150_replace_5152_fn_5154(v_1,i_2){
+var temp__1427_3,e_4;
+return (((temp__1427_3=clojure.find.apply(null,[smap_1,clojure.nth.apply(null,[v_1,i_2])])),
+((temp__1427_3)?(((e_4=temp__1427_3),
+clojure.assoc.apply(null,[v_1,i_2,clojure.val.apply(null,[e_4])]))):(v_1))))}),coll_2,clojure.range.apply(null,[clojure.count.apply(null,[coll_2])])])):(clojure.map.apply(null,[(function __clojure_fn_5150_replace_5152_fn_5157(p1__5149_1){
+var e_3,temp__1427_2;
+return (((temp__1427_2=clojure.find.apply(null,[smap_1,p1__5149_1])),
+((temp__1427_2)?(((e_3=temp__1427_2),
+clojure.val.apply(null,[e_3]))):(p1__5149_1))))}),coll_2]))))})))}).apply(null,[]);
// Skipping: (defmacro dosync "Runs the exprs (in an implicit do) in a transaction that encompasses\n exprs and any nested calls. Starts a transaction if none is already\n running on this thread. Any uncaught exception will abort the\n transaction and flow out of dosync. The exprs may be run more than\n once, but any effects on Refs will be atomic." [& exprs] (clojure/concat (clojure/list (quote clojure/sync)) (clojure/list (quote nil)) exprs))
// Skipping: (defmacro with-precision "Sets the precision and rounding mode to be used for BigDecimal operations.\n\n Usage: (with-precision 10 (/ 1M 3))\n or: (with-precision 10 :rounding HALF_DOWN (/ 1M 3))\n \n The rounding mode is one of CEILING, FLOOR, HALF_UP, HALF_DOWN,\n HALF_EVEN, UP, DOWN and UNNECESSARY; it defaults to HALF_UP." [precision & exprs] (let [[body rm] (if (= (first exprs) :rounding) [(rest (rest exprs)) (clojure/concat (clojure/list (clojure/concat (clojure/list (quote .)) (clojure/list (quote java.math.RoundingMode)) (clojure/list (second exprs)))))] [exprs nil])] (clojure/concat (clojure/list (quote clojure/binding)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote clojure/*math-context*)) (clojure/list (clojure/concat (clojure/list (quote java.math.MathContext.)) (clojure/list precision) rm))))) body)))
//======
//(defn bound-fn {:private true} [sc test key] (fn [e] (test (.. sc comparator (compare (. sc entryKey e) key)) 0)))
//---
-(function __clojure_fn_6921(){
-return (clojure.JS.def(clojure,"bound_fn",(function __clojure_fn_6921_bound_fn_6923(sc_1,test_2,key_3){
-return ((function __clojure_fn_6921_bound_fn_6923_fn_6925(e_1){
+(function __clojure_fn_5175(){
+return (clojure.JS.def(clojure,"bound_fn",(function __clojure_fn_5175_bound_fn_5177(sc_1,test_2,key_3){
+return ((function __clojure_fn_5175_bound_fn_5177_fn_5179(e_1){
return (test_2.apply(null,[((sc_1).comparator()).compare((sc_1).entryKey(e_1),key_3),0]))}))})))}).apply(null,[]);
//======
//(defn subseq "sc must be a sorted collection, test(s) one of <, <=, > or\n >=. Returns a seq of those entries with keys ek for\n which (test (.. sc comparator (compare ek key)) 0) is true" ([sc test key] (let [include (bound-fn sc test key)] (if (#{> >=} test) (when-let [e :as s] (. sc seqFrom key true) (if (include e) s (rest s))) (take-while include (. sc seq true))))) ([sc start-test start-key end-test end-key] (when-let [e :as s] (. sc seqFrom start-key true) (take-while (bound-fn sc end-test end-key) (if ((bound-fn sc start-test start-key) e) s (rest s))))))
//---
-(function __clojure_fn_6939(){
-return (clojure.JS.def(clojure,"subseq",(function __clojure_fn_6939_subseq_6941(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){
-case 3:var e_7,temp__1438_5,s_8,vec__6943_6,include_4,test_2=arguments[1],key_3=arguments[2];
+(function __clojure_fn_5184(){
+return (clojure.JS.def(clojure,"subseq",(function __clojure_fn_5184_subseq_5186(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){
+case 3:var temp__1432_5,s_8,e_7,include_4,vec__5188_6,test_2=arguments[1],key_3=arguments[2];
return (((include_4=clojure.bound_fn.apply(null,[sc_1,test_2,key_3])),
-((clojure.hash_set(clojure._GT_,clojure._GT__EQ_).apply(null,[test_2]))?(((temp__1438_5=(sc_1).seqFrom(key_3,true)),
-((temp__1438_5)?(((vec__6943_6=temp__1438_5),
-(e_7=clojure.nth.apply(null,[vec__6943_6,0,null])),
-(s_8=vec__6943_6),
+((clojure.hash_set(clojure._GT_,clojure._GT__EQ_).apply(null,[test_2]))?(((temp__1432_5=(sc_1).seqFrom(key_3,true)),
+((temp__1432_5)?(((vec__5188_6=temp__1432_5),
+(e_7=clojure.nth.apply(null,[vec__5188_6,0,null])),
+(s_8=vec__5188_6),
((include_4.apply(null,[e_7]))?(s_8):(clojure.rest.apply(null,[s_8]))))):(null)))):(clojure.take_while.apply(null,[include_4,(sc_1).seq(true)])))))}
-var e_8,s_9,temp__1438_6,vec__6945_7;
-return (((temp__1438_6=(sc_1).seqFrom(start_key_3,true)),
-((temp__1438_6)?(((vec__6945_7=temp__1438_6),
-(e_8=clojure.nth.apply(null,[vec__6945_7,0,null])),
-(s_9=vec__6945_7),
+var temp__1432_6,vec__5190_7,e_8,s_9;
+return (((temp__1432_6=(sc_1).seqFrom(start_key_3,true)),
+((temp__1432_6)?(((vec__5190_7=temp__1432_6),
+(e_8=clojure.nth.apply(null,[vec__5190_7,0,null])),
+(s_9=vec__5190_7),
clojure.take_while.apply(null,[clojure.bound_fn.apply(null,[sc_1,end_test_4,end_key_5]),((clojure.bound_fn.apply(null,[sc_1,start_test_2,start_key_3]).apply(null,[e_8]))?(s_9):(clojure.rest.apply(null,[s_9])))]))):(null))))})))}).apply(null,[]);
//======
//(defn rsubseq "sc must be a sorted collection, test(s) one of <, <=, > or\n >=. Returns a reverse seq of those entries with keys ek for\n which (test (.. sc comparator (compare ek key)) 0) is true" ([sc test key] (let [include (bound-fn sc test key)] (if (#{< <=} test) (when-let [e :as s] (. sc seqFrom key false) (if (include e) s (rest s))) (take-while include (. sc seq false))))) ([sc start-test start-key end-test end-key] (when-let [e :as s] (. sc seqFrom end-key false) (take-while (bound-fn sc start-test start-key) (if ((bound-fn sc end-test end-key) e) s (rest s))))))
//---
-(function __clojure_fn_6957(){
-return (clojure.JS.def(clojure,"rsubseq",(function __clojure_fn_6957_rsubseq_6959(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){
-case 3:var e_7,vec__6961_6,include_4,temp__1438_5,s_8,test_2=arguments[1],key_3=arguments[2];
+(function __clojure_fn_5193(){
+return (clojure.JS.def(clojure,"rsubseq",(function __clojure_fn_5193_rsubseq_5195(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){
+case 3:var s_8,temp__1432_5,include_4,e_7,vec__5197_6,test_2=arguments[1],key_3=arguments[2];
return (((include_4=clojure.bound_fn.apply(null,[sc_1,test_2,key_3])),
-((clojure.hash_set(clojure._LT_,clojure._LT__EQ_).apply(null,[test_2]))?(((temp__1438_5=(sc_1).seqFrom(key_3,false)),
-((temp__1438_5)?(((vec__6961_6=temp__1438_5),
-(e_7=clojure.nth.apply(null,[vec__6961_6,0,null])),
-(s_8=vec__6961_6),
+((clojure.hash_set(clojure._LT_,clojure._LT__EQ_).apply(null,[test_2]))?(((temp__1432_5=(sc_1).seqFrom(key_3,false)),
+((temp__1432_5)?(((vec__5197_6=temp__1432_5),
+(e_7=clojure.nth.apply(null,[vec__5197_6,0,null])),
+(s_8=vec__5197_6),
((include_4.apply(null,[e_7]))?(s_8):(clojure.rest.apply(null,[s_8]))))):(null)))):(clojure.take_while.apply(null,[include_4,(sc_1).seq(false)])))))}
-var vec__6963_7,e_8,temp__1438_6,s_9;
-return (((temp__1438_6=(sc_1).seqFrom(end_key_5,false)),
-((temp__1438_6)?(((vec__6963_7=temp__1438_6),
-(e_8=clojure.nth.apply(null,[vec__6963_7,0,null])),
-(s_9=vec__6963_7),
+var vec__5199_7,e_8,s_9,temp__1432_6;
+return (((temp__1432_6=(sc_1).seqFrom(end_key_5,false)),
+((temp__1432_6)?(((vec__5199_7=temp__1432_6),
+(e_8=clojure.nth.apply(null,[vec__5199_7,0,null])),
+(s_9=vec__5199_7),
clojure.take_while.apply(null,[clojure.bound_fn.apply(null,[sc_1,start_test_2,start_key_3]),((clojure.bound_fn.apply(null,[sc_1,end_test_4,end_key_5]).apply(null,[e_8]))?(s_9):(clojure.rest.apply(null,[s_9])))]))):(null))))})))}).apply(null,[]);
//======
//(defn repeatedly "Takes a function of no args, presumably with side effects, and returns an infinite\n lazy sequence of calls to it" [f] (lazy-cons (f) (repeatedly f)))
//---
-(function __clojure_fn_6977(){
-return (clojure.JS.def(clojure,"repeatedly",(function __clojure_fn_6977_repeatedly_6979(f_1){
-return ((new clojure.lang.LazyCons((function __clojure_fn_6977_repeatedly_6979_fn_6982(G__6981_1){switch(arguments.length){
+(function __clojure_fn_5202(){
+return (clojure.JS.def(clojure,"repeatedly",(function __clojure_fn_5202_repeatedly_5204(f_1){
+return ((new clojure.lang.LazyCons((function __clojure_fn_5202_repeatedly_5204_fn_5207(G__5206_1){switch(arguments.length){
case 0:return (f_1.apply(null,[]))}
return (clojure.repeatedly.apply(null,[f_1]))}))))})))}).apply(null,[]);
//======
//(defn add-classpath "Adds the url (String or URL object) to the classpath per URLClassLoader.addURL" [url] (. clojure.lang.RT addURL url))
//---
-(function __clojure_fn_6994(){
-return (clojure.JS.def(clojure,"add_classpath",(function __clojure_fn_6994_add_classpath_6996(url_1){
+(function __clojure_fn_5213(){
+return (clojure.JS.def(clojure,"add_classpath",(function __clojure_fn_5213_add_classpath_5215(url_1){
return (clojure.lang.RT.addURL(url_1))})))}).apply(null,[]);
//======
//(defn hash "Returns the hash code of its argument" [x] (. clojure.lang.Util (hash x)))
//---
-(function __clojure_fn_7006(){
-return (clojure.JS.def(clojure,"hash",(function __clojure_fn_7006_hash_7008(x_1){
+(function __clojure_fn_5219(){
+return (clojure.JS.def(clojure,"hash",(function __clojure_fn_5219_hash_5221(x_1){
return (clojure.lang.Util.hash(x_1))})))}).apply(null,[]);
//======
//(defn interpose "Returns a lazy seq of the elements of coll separated by sep" [sep coll] (drop 1 (interleave (repeat sep) coll)))
//---
-(function __clojure_fn_7018(){
-return (clojure.JS.def(clojure,"interpose",(function __clojure_fn_7018_interpose_7020(sep_1,coll_2){
+(function __clojure_fn_5225(){
+return (clojure.JS.def(clojure,"interpose",(function __clojure_fn_5225_interpose_5227(sep_1,coll_2){
return (clojure.drop.apply(null,[1,clojure.interleave.apply(null,[clojure.repeat.apply(null,[sep_1]),coll_2])]))})))}).apply(null,[]);
//======
//(defn partition "Returns a lazy sequence of lists of n items each, at offsets step\n apart. If step is not supplied, defaults to n, i.e. the partitions\n do not overlap." ([n coll] (partition n n coll)) ([n step coll] (when (seq coll) (let [p (take n coll)] (when (= n (count p)) (lazy-cons p (partition n step (drop step coll))))))))
//---
-(function __clojure_fn_7036(){
-return (clojure.JS.def(clojure,"partition",(function __clojure_fn_7036_partition_7038(n_1,step_2,coll_3){switch(arguments.length){
+(function __clojure_fn_5231(){
+return (clojure.JS.def(clojure,"partition",(function __clojure_fn_5231_partition_5233(n_1,step_2,coll_3){switch(arguments.length){
case 2:var coll_2=arguments[1];
return (clojure.partition.apply(null,[n_1,n_1,coll_2]))}
var p_4;
return (((clojure.seq.apply(null,[coll_3]))?(((p_4=clojure.take.apply(null,[n_1,coll_3])),
-((clojure.lang.Util.equal(n_1,clojure.count.apply(null,[p_4])))?((new clojure.lang.LazyCons((function __clojure_fn_7036_partition_7038_fn_7042(G__7041_1){switch(arguments.length){
+((clojure.lang.Util.equal(n_1,clojure.count.apply(null,[p_4])))?((new clojure.lang.LazyCons((function __clojure_fn_5231_partition_5233_fn_5237(G__5236_1){switch(arguments.length){
case 0:return (p_4)}
return (clojure.partition.apply(null,[n_1,step_2,clojure.drop.apply(null,[step_2,coll_3])]))})))):(null)))):(null)))})))}).apply(null,[]);
-// Skipping: (defmacro definline "Experimental - like defmacro, except defines a named function whose\n body is the expansion, calls to which may be expanded inline as if\n it were a macro. Cannot be used with variadic (&) args." [name & decl] (let [[args expr] (drop-while (comp not vector?) decl) inline (eval (list (quote fn) args expr))] (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/defn)) (clojure/list name) (clojure/list args) (clojure/list (apply inline args)))) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote v__7048)) (clojure/list (clojure/concat (clojure/list (quote var)) (clojure/list name)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/.setMeta)) (clojure/list (quote v__7048)) (clojure/list (clojure/concat (clojure/list (quote clojure/assoc)) (clojure/list (clojure/concat (clojure/list (quote clojure/meta)) (clojure/list (quote v__7048)))) (clojure/list :inline) (clojure/list inline))))))))))
+// Skipping: (defmacro definline "Experimental - like defmacro, except defines a named function whose\n body is the expansion, calls to which may be expanded inline as if\n it were a macro. Cannot be used with variadic (&) args." [name & decl] (let [[args expr] (drop-while (comp not vector?) decl) inline (eval (list (quote fn) args expr))] (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/defn)) (clojure/list name) (clojure/list args) (clojure/list (apply inline args)))) (clojure/list (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote v__5243)) (clojure/list (clojure/concat (clojure/list (quote var)) (clojure/list name)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/.setMeta)) (clojure/list (quote v__5243)) (clojure/list (clojure/concat (clojure/list (quote clojure/assoc)) (clojure/list (clojure/concat (clojure/list (quote clojure/meta)) (clojure/list (quote v__5243)))) (clojure/list :inline) (clojure/list inline))))))))))
//======
//(defn empty "Returns an empty collection of the same category as coll, or nil" [coll] (.empty coll))
//---
-(function __clojure_fn_7062(){
-return (clojure.JS.def(clojure,"empty",(function __clojure_fn_7062_empty_7064(coll_1){
+(function __clojure_fn_5251(){
+return (clojure.JS.def(clojure,"empty",(function __clojure_fn_5251_empty_5253(coll_1){
return ((coll_1).empty())})))}).apply(null,[]);
-// Skipping: (defmacro amap "Maps an expression across an array a, using an index named idx, and\n return value named ret, initialized to a clone of a, then setting each element of\n ret to the evaluation of expr, returning the new array ret." [a idx ret expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote a__7068)) (clojure/list a) (clojure/list ret) (clojure/list (clojure/concat (clojure/list (quote clojure/aclone)) (clojure/list (quote a__7068))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0)))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/alength)) (clojure/list (quote a__7068)))))) (clojure/list (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/aset)) (clojure/list ret) (clojure/list idx) (clojure/list expr))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list idx))))))) (clojure/list ret)))))))
-// Skipping: (defmacro areduce "Reduces an expression across an array a, using an index named idx,\n and return value named ret, initialized to init, setting ret to the evaluation of expr at\n each step, returning ret." [a idx ret init expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote a__7075)) (clojure/list a)))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0))) (clojure/list ret) (clojure/list init)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/alength)) (clojure/list (quote a__7075)))))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list idx))) (clojure/list expr))) (clojure/list ret)))))))
+// Skipping: (defmacro amap "Maps an expression across an array a, using an index named idx, and\n return value named ret, initialized to a clone of a, then setting each element of\n ret to the evaluation of expr, returning the new array ret." [a idx ret expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote a__5257)) (clojure/list a) (clojure/list ret) (clojure/list (clojure/concat (clojure/list (quote clojure/aclone)) (clojure/list (quote a__5257))))))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0)))))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/alength)) (clojure/list (quote a__5257)))))) (clojure/list (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/aset)) (clojure/list ret) (clojure/list idx) (clojure/list expr))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list idx))))))) (clojure/list ret)))))))
+// Skipping: (defmacro areduce "Reduces an expression across an array a, using an index named idx,\n and return value named ret, initialized to init, setting ret to the evaluation of expr at\n each step, returning ret." [a idx ret init expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote a__5264)) (clojure/list a)))) (clojure/list (clojure/concat (clojure/list (quote clojure/loop)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/int)) (clojure/list 0))) (clojure/list ret) (clojure/list init)))) (clojure/list (clojure/concat (clojure/list (quote if)) (clojure/list (clojure/concat (clojure/list (quote clojure/<)) (clojure/list idx) (clojure/list (clojure/concat (clojure/list (quote clojure/alength)) (clojure/list (quote a__5264)))))) (clojure/list (clojure/concat (clojure/list (quote recur)) (clojure/list (clojure/concat (clojure/list (quote clojure/unchecked-inc)) (clojure/list idx))) (clojure/list expr))) (clojure/list ret)))))))
//======
//(defn float-array "Creates an array of floats" {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (quote clojure/float_array)) args)), :inline-arities #{1 2}} ([size-or-seq] (. clojure.lang.Numbers float_array size-or-seq)) ([size init-val-or-seq] (. clojure.lang.Numbers float_array size init-val-or-seq)))
//---
-(function __clojure_fn_7092(){
-return (clojure.JS.def(clojure,"float_array",(function __clojure_fn_7092_float_array_7097(size_1,init_val_or_seq_2){switch(arguments.length){
+(function __clojure_fn_5271(){
+return (clojure.JS.def(clojure,"float_array",(function __clojure_fn_5271_float_array_5276(size_1,init_val_or_seq_2){switch(arguments.length){
case 1:var size_or_seq_1=arguments[0];
return (clojure.lang.Numbers.float_array(size_or_seq_1))}
return (clojure.lang.Numbers.float_array(size_1,init_val_or_seq_2))})))}).apply(null,[]);
@@ -2257,8 +2250,8 @@ return (clojure.lang.Numbers.float_array(size_1,init_val_or_seq_2))})))}).apply(
//======
//(defn double-array "Creates an array of doubles" {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (quote clojure/double_array)) args)), :inline-arities #{1 2}} ([size-or-seq] (. clojure.lang.Numbers double_array size-or-seq)) ([size init-val-or-seq] (. clojure.lang.Numbers double_array size init-val-or-seq)))
//---
-(function __clojure_fn_7112(){
-return (clojure.JS.def(clojure,"double_array",(function __clojure_fn_7112_double_array_7117(size_1,init_val_or_seq_2){switch(arguments.length){
+(function __clojure_fn_5281(){
+return (clojure.JS.def(clojure,"double_array",(function __clojure_fn_5281_double_array_5286(size_1,init_val_or_seq_2){switch(arguments.length){
case 1:var size_or_seq_1=arguments[0];
return (clojure.lang.Numbers.double_array(size_or_seq_1))}
return (clojure.lang.Numbers.double_array(size_1,init_val_or_seq_2))})))}).apply(null,[]);
@@ -2266,8 +2259,8 @@ return (clojure.lang.Numbers.double_array(size_1,init_val_or_seq_2))})))}).apply
//======
//(defn int-array "Creates an array of ints" {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (quote clojure/int_array)) args)), :inline-arities #{1 2}} ([size-or-seq] (. clojure.lang.Numbers int_array size-or-seq)) ([size init-val-or-seq] (. clojure.lang.Numbers int_array size init-val-or-seq)))
//---
-(function __clojure_fn_7132(){
-return (clojure.JS.def(clojure,"int_array",(function __clojure_fn_7132_int_array_7137(size_1,init_val_or_seq_2){switch(arguments.length){
+(function __clojure_fn_5291(){
+return (clojure.JS.def(clojure,"int_array",(function __clojure_fn_5291_int_array_5296(size_1,init_val_or_seq_2){switch(arguments.length){
case 1:var size_or_seq_1=arguments[0];
return (clojure.lang.Numbers.int_array(size_or_seq_1))}
return (clojure.lang.Numbers.int_array(size_1,init_val_or_seq_2))})))}).apply(null,[]);
@@ -2275,8 +2268,8 @@ return (clojure.lang.Numbers.int_array(size_1,init_val_or_seq_2))})))}).apply(nu
//======
//(defn long-array "Creates an array of ints" {:inline (fn [& args] (clojure/concat (clojure/list (quote .)) (clojure/list (quote clojure.lang.Numbers)) (clojure/list (quote clojure/long_array)) args)), :inline-arities #{1 2}} ([size-or-seq] (. clojure.lang.Numbers long_array size-or-seq)) ([size init-val-or-seq] (. clojure.lang.Numbers long_array size init-val-or-seq)))
//---
-(function __clojure_fn_7152(){
-return (clojure.JS.def(clojure,"long_array",(function __clojure_fn_7152_long_array_7157(size_1,init_val_or_seq_2){switch(arguments.length){
+(function __clojure_fn_5301(){
+return (clojure.JS.def(clojure,"long_array",(function __clojure_fn_5301_long_array_5306(size_1,init_val_or_seq_2){switch(arguments.length){
case 1:var size_or_seq_1=arguments[0];
return (clojure.lang.Numbers.long_array(size_or_seq_1))}
return (clojure.lang.Numbers.long_array(size_1,init_val_or_seq_2))})))}).apply(null,[]);
@@ -2288,43 +2281,44 @@ return (clojure.lang.Numbers.long_array(size_1,init_val_or_seq_2))})))}).apply(n
//======
//(import (quote (java.util.concurrent BlockingQueue LinkedBlockingQueue)))
//---
-(function __clojure_fn_7213(){
+(function __clojure_fn_5359(){
return (clojure.import_.apply(null,[clojure.JS.lit_list(["'java.util.concurrent","'BlockingQueue","'LinkedBlockingQueue"])]))}).apply(null,[]);
// Skipping: (defn seque "Creates a queued seq on another (presumably lazy) seq s. The queued\n seq will produce a concrete seq in the background, and can get up to\n n items ahead of the consumer. n-or-q can be an integer n buffer\n size, or an instance of java.util.concurrent BlockingQueue. Note\n that reading from a seque can block if the reader gets ahead of the\n producer." ([s] (seque 100 s)) ([n-or-q s] (let [q (if (instance? BlockingQueue n-or-q) n-or-q (LinkedBlockingQueue. (int n-or-q))) NIL (Object.) agt (agent (seq s)) fill (fn [s] (try (loop [[x & xs :as s] s] (if s (if (.offer q (if (nil? x) NIL x)) (recur xs) s) (.put q q))) (catch Exception e (.put q q) (throw e)))) drain (fn drain [] (let [x (.take q)] (if (identical? x q) (clojure/deref agt) (do (send-off agt fill) (lazy-cons (if (identical? x NIL) nil x) (drain))))))] (send-off agt fill) (drain))))
+// Skipping: (defn class? "Returns true if x is an instance of Class" [x] (instance? Class x))
//======
//(defn alter-var-root "Atomically alters the root binding of var v by applying f to its\n current value plus any args" [v f & args] (.alterRoot v f args))
//---
-(function __clojure_fn_7243(){
-return (clojure.JS.def(clojure,"alter_var_root",clojure.JS.variadic(2,(function __clojure_fn_7243_alter_var_root_7245(v_1,f_2){
+(function __clojure_fn_5389(){
+return (clojure.JS.def(clojure,"alter_var_root",clojure.JS.variadic(2,(function __clojure_fn_5389_alter_var_root_5391(v_1,f_2){
var args_3=clojure.JS.rest_args(this,arguments,2);
return ((v_1).alterRoot(f_2,args_3))}))))}).apply(null,[]);
//======
-//(defn make-hierarchy "Creates a hierarchy object for use with derive, isa? etc." [] {:parents {}, :descendants {}, :ancestors {}})
+//(defn make-hierarchy "Creates a hierarchy object for use with derive, isa? etc." [] {:ancestors {}, :descendants {}, :parents {}})
//---
-(function __clojure_fn_7255(){
-return (clojure.JS.def(clojure,"make_hierarchy",(function __clojure_fn_7255_make_hierarchy_7257(){
-return (clojure.hash_map(clojure.keyword("","parents"),clojure.lang.PersistentHashMap.EMPTY,clojure.keyword("","descendants"),clojure.lang.PersistentHashMap.EMPTY,clojure.keyword("","ancestors"),clojure.lang.PersistentHashMap.EMPTY))})))}).apply(null,[]);
+(function __clojure_fn_5395(){
+return (clojure.JS.def(clojure,"make_hierarchy",(function __clojure_fn_5395_make_hierarchy_5397(){
+return (clojure.hash_map(clojure.keyword("","ancestors"),clojure.lang.PersistentHashMap.EMPTY,clojure.keyword("","descendants"),clojure.lang.PersistentHashMap.EMPTY,clojure.keyword("","parents"),clojure.lang.PersistentHashMap.EMPTY))})))}).apply(null,[]);
//======
//(def global-hierarchy (make-hierarchy))
//---
-(function __clojure_fn_7264(){
+(function __clojure_fn_5401(){
return (clojure.JS.def(clojure,"global_hierarchy",clojure.make_hierarchy.apply(null,[])))}).apply(null,[]);
//======
//(defn not-empty "If coll is empty, returns nil, else coll" [coll] (when (seq coll) coll))
//---
-(function __clojure_fn_7273(){
-return (clojure.JS.def(clojure,"not_empty",(function __clojure_fn_7273_not_empty_7275(coll_1){
+(function __clojure_fn_5404(){
+return (clojure.JS.def(clojure,"not_empty",(function __clojure_fn_5404_not_empty_5406(coll_1){
return (((clojure.seq.apply(null,[coll_1]))?(coll_1):(null)))})))}).apply(null,[]);
//======
//(defn bases "Returns the immediate superclass and direct interfaces of c, if any" [c] (let [i (.getInterfaces c) s (.getSuperclass c)] (not-empty (if s (cons s i) i))))
//---
-(function __clojure_fn_7285(){
-return (clojure.JS.def(clojure,"bases",(function __clojure_fn_7285_bases_7287(c_1){
+(function __clojure_fn_5410(){
+return (clojure.JS.def(clojure,"bases",(function __clojure_fn_5410_bases_5412(c_1){
var i_2,s_3;
return (((i_2=(c_1).getInterfaces()),
(s_3=(c_1).getSuperclass()),
@@ -2333,9 +2327,9 @@ clojure.not_empty.apply(null,[((s_3)?(clojure.cons.apply(null,[s_3,i_2])):(i_2))
//======
//(defn supers "Returns the immediate and indirect superclasses and interfaces of c, if any" [class] (loop [ret (set (bases class)) cs ret] (if (seq cs) (let [c (first cs) bs (bases c)] (recur (into ret bs) (into (disj cs c) bs))) (not-empty ret))))
//---
-(function __clojure_fn_7297(){
-return (clojure.JS.def(clojure,"supers",(function __clojure_fn_7297_supers_7299(class_1){
-var cs_3,c_4,ret_2,bs_5;
+(function __clojure_fn_5416(){
+return (clojure.JS.def(clojure,"supers",(function __clojure_fn_5416_supers_5418(class_1){
+var cs_3,ret_2,bs_5,c_4;
return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.set.apply(null,[clojure.bases.apply(null,[class_1])])),
(cs_3=ret_2);do{_cnt=0;
_rtn=((clojure.seq.apply(null,[cs_3]))?(((c_4=clojure.first.apply(null,[cs_3])),
@@ -2343,21 +2337,21 @@ _rtn=((clojure.seq.apply(null,[cs_3]))?(((c_4=clojure.first.apply(null,[cs_3])),
(_cnt=1,_rtn=[clojure.into.apply(null,[ret_2,bs_5]),clojure.into.apply(null,[clojure.disj.apply(null,[cs_3,c_4]),bs_5])],ret_2=_rtn[0],cs_3=_rtn[1]))):(clojure.not_empty.apply(null,[ret_2])))}while(_cnt);return _rtn;})()))})))}).apply(null,[]);
//======
-//(defn isa? "Returns true if (= child parent), or child is directly or indirectly derived from\n parent, either via a Java type inheritance relationship or a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy" ([child parent] (isa? global-hierarchy child parent)) ([h child parent] (or (= child parent) (and (class? parent) (class? child) (. parent isAssignableFrom child)) (contains? ((:ancestors h) child) parent) (and (class? child) (some (fn* [p1__7303] (contains? ((:ancestors h) p1__7303) parent)) (supers child))) (and (vector? parent) (vector? child) (= (count parent) (count child)) (loop [ret true i 0] (if (or (not ret) (= i (count parent))) ret (recur (isa? h (child i) (parent i)) (inc i))))))))
+//(defn isa? "Returns true if (= child parent), or child is directly or indirectly derived from\n parent, either via a Java type inheritance relationship or a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy" ([child parent] (isa? global-hierarchy child parent)) ([h child parent] (or (= child parent) (and (class? parent) (class? child) (. parent isAssignableFrom child)) (contains? ((:ancestors h) child) parent) (and (class? child) (some (fn* [p1__5422] (contains? ((:ancestors h) p1__5422) parent)) (supers child))) (and (vector? parent) (vector? child) (= (count parent) (count child)) (loop [ret true i 0] (if (or (not ret) (= i (count parent))) ret (recur (isa? h (child i) (parent i)) (inc i))))))))
//---
-(function __clojure_fn_7314(){
-return (clojure.JS.def(clojure,"isa_QMARK_",(function __clojure_fn_7314_isa_QMARK_7316(h_1,child_2,parent_3){switch(arguments.length){
+(function __clojure_fn_5423(){
+return (clojure.JS.def(clojure,"isa_QMARK_",(function __clojure_fn_5423_isa_QMARK_5425(h_1,child_2,parent_3){switch(arguments.length){
case 2:var child_1=arguments[0],parent_2=arguments[1];
return (clojure.isa_QMARK_.apply(null,[clojure.global_hierarchy,child_1,parent_2]))}
-var and__196_9,or__202_7,i_12,or__202_6,or__202_5,or__202_4,and__196_10,and__196_8,and__196_6,and__196_7,or__202_13,ret_11,and__196_5;
+var and__196_10,and__196_8,or__202_5,or__202_4,and__196_9,or__202_13,and__196_6,i_12,ret_11,or__202_6,and__196_7,and__196_5,or__202_7;
return (((or__202_4=clojure.lang.Util.equal(child_2,parent_3)),
((or__202_4)?(or__202_4):(((or__202_5=((and__196_5=clojure.class_QMARK_.apply(null,[parent_3])),
((and__196_5)?(((and__196_6=clojure.class_QMARK_.apply(null,[child_2])),
((and__196_6)?((parent_3).isAssignableFrom(child_2)):(and__196_6)))):(and__196_5)))),
((or__202_5)?(or__202_5):(((or__202_6=clojure.contains_QMARK_.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]).apply(null,[child_2]),parent_3])),
((or__202_6)?(or__202_6):(((or__202_7=((and__196_7=clojure.class_QMARK_.apply(null,[child_2])),
-((and__196_7)?(clojure.some.apply(null,[(function __clojure_fn_7314_isa_QMARK_7316_fn_7319(p1__7303_1){
-return (clojure.contains_QMARK_.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]).apply(null,[p1__7303_1]),parent_3]))}),clojure.supers.apply(null,[child_2])])):(and__196_7)))),
+((and__196_7)?(clojure.some.apply(null,[(function __clojure_fn_5423_isa_QMARK_5425_fn_5428(p1__5422_1){
+return (clojure.contains_QMARK_.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]).apply(null,[p1__5422_1]),parent_3]))}),clojure.supers.apply(null,[child_2])])):(and__196_7)))),
((or__202_7)?(or__202_7):(((and__196_8=clojure.vector_QMARK_.apply(null,[parent_3])),
((and__196_8)?(((and__196_9=clojure.vector_QMARK_.apply(null,[child_2])),
((and__196_9)?(((and__196_10=clojure.lang.Util.equal(clojure.count.apply(null,[parent_3]),clojure.count.apply(null,[child_2]))),
@@ -2369,8 +2363,8 @@ _rtn=((((or__202_13=clojure.not.apply(null,[ret_11])),
//======
//(defn parents "Returns the immediate parents of tag, either via a Java type\n inheritance relationship or a relationship established via derive. h\n must be a hierarchy obtained from make-hierarchy, if not supplied\n defaults to the global hierarchy" ([tag] (parents global-hierarchy tag)) ([h tag] (not-empty (let [tp (get (:parents h) tag)] (if (class? tag) (into (set (bases tag)) tp) tp)))))
//---
-(function __clojure_fn_7331(){
-return (clojure.JS.def(clojure,"parents",(function __clojure_fn_7331_parents_7333(h_1,tag_2){switch(arguments.length){
+(function __clojure_fn_5433(){
+return (clojure.JS.def(clojure,"parents",(function __clojure_fn_5433_parents_5435(h_1,tag_2){switch(arguments.length){
case 1:var tag_1=arguments[0];
return (clojure.parents.apply(null,[clojure.global_hierarchy,tag_1]))}
var tp_3;
@@ -2380,8 +2374,8 @@ return (clojure.not_empty.apply(null,[((tp_3=clojure.get.apply(null,[clojure.key
//======
//(defn ancestors "Returns the immediate and indirect parents of tag, either via a Java type\n inheritance relationship or a relationship established via derive. h\n must be a hierarchy obtained from make-hierarchy, if not supplied\n defaults to the global hierarchy" ([tag] (ancestors global-hierarchy tag)) ([h tag] (not-empty (let [ta (get (:ancestors h) tag)] (if (class? tag) (into (set (supers tag)) ta) ta)))))
//---
-(function __clojure_fn_7345(){
-return (clojure.JS.def(clojure,"ancestors",(function __clojure_fn_7345_ancestors_7347(h_1,tag_2){switch(arguments.length){
+(function __clojure_fn_5440(){
+return (clojure.JS.def(clojure,"ancestors",(function __clojure_fn_5440_ancestors_5442(h_1,tag_2){switch(arguments.length){
case 1:var tag_1=arguments[0];
return (clojure.ancestors.apply(null,[clojure.global_hierarchy,tag_1]))}
var ta_3;
@@ -2389,141 +2383,141 @@ return (clojure.not_empty.apply(null,[((ta_3=clojure.get.apply(null,[clojure.key
((clojure.class_QMARK_.apply(null,[tag_2]))?(clojure.into.apply(null,[clojure.set.apply(null,[clojure.supers.apply(null,[tag_2])]),ta_3])):(ta_3)))]))})))}).apply(null,[]);
//======
-//(defn descendants "Returns the immediate and indirect children of tag, through a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy. Note: does not work on Java type inheritance\n relationships." ([tag] (descendants global-hierarchy tag)) ([h tag] (if (class? tag) (throw (RT/makeUnsupportedException "Can't get descendants of classes")) (not-empty (get (:descendants h) tag)))))
+//(defn descendants "Returns the immediate and indirect children of tag, through a\n relationship established via derive. h must be a hierarchy obtained\n from make-hierarchy, if not supplied defaults to the global\n hierarchy. Note: does not work on Java type inheritance\n relationships." ([tag] (descendants global-hierarchy tag)) ([h tag] (if (class? tag) (throw (java.lang.UnsupportedOperationException. "Can't get descendants of classes")) (not-empty (get (:descendants h) tag)))))
//---
-(function __clojure_fn_7359(){
-return (clojure.JS.def(clojure,"descendants",(function __clojure_fn_7359_descendants_7361(h_1,tag_2){switch(arguments.length){
+(function __clojure_fn_5447(){
+return (clojure.JS.def(clojure,"descendants",(function __clojure_fn_5447_descendants_5449(h_1,tag_2){switch(arguments.length){
case 1:var tag_1=arguments[0];
return (clojure.descendants.apply(null,[clojure.global_hierarchy,tag_1]))}
-return (((clojure.class_QMARK_.apply(null,[tag_2]))?((function __throw(){throw clojure.lang.RT.makeUnsupportedException("Can't get descendants of classes")})()):(clojure.not_empty.apply(null,[clojure.get.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),tag_2])]))))})))}).apply(null,[]);
+return (((clojure.class_QMARK_.apply(null,[tag_2]))?((function __throw(){throw (new java.lang.UnsupportedOperationException("Can't get descendants of classes"))})()):(clojure.not_empty.apply(null,[clojure.get.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),tag_2])]))))})))}).apply(null,[]);
//======
-//(defn derive "Establishes a parent/child relationship between parent and\n tag. Parent must be a namespace-qualified symbol or keyword and\n child can be either a namespace-qualified symbol or keyword or a\n class. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy." ([tag parent] (alter-var-root (var global-hierarchy) derive tag parent) nil) ([h tag parent] (assert (not= tag parent)) (assert (or (class? tag) (and (instance? clojure.lang.Named tag) (namespace tag)))) (assert (instance? clojure.lang.Named parent)) (assert (namespace parent)) (let [tp (:parents h) td (:descendants h) ta (:ancestors h) tf (fn [m source sources target targets] (reduce (fn [ret k] (assoc ret k (reduce conj (get targets k #{}) (cons target (targets target))))) m (cons source (sources source))))] (or (when-not (contains? (tp tag) parent) (when (contains? (ta tag) parent) (throw (RT/makeException (print-str tag "already has" parent "as ancestor")))) (when (contains? (ta parent) tag) (throw (RT/makeException (print-str "Cyclic derivation:" parent "has" tag "as ancestor")))) {:parents (assoc (:parents h) tag (conj (get tp tag #{}) parent)), :descendants (tf (:descendants h) parent ta tag td), :ancestors (tf (:ancestors h) tag td parent ta)}) h))))
+//(defn derive "Establishes a parent/child relationship between parent and\n tag. Parent must be a namespace-qualified symbol or keyword and\n child can be either a namespace-qualified symbol or keyword or a\n class. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy." ([tag parent] (alter-var-root (var global-hierarchy) derive tag parent) nil) ([h tag parent] (assert (not= tag parent)) (assert (or (class? tag) (and (instance? clojure.lang.Named tag) (namespace tag)))) (assert (instance? clojure.lang.Named parent)) (assert (namespace parent)) (let [tp (:parents h) td (:descendants h) ta (:ancestors h) tf (fn [m source sources target targets] (reduce (fn [ret k] (assoc ret k (reduce conj (get targets k #{}) (cons target (targets target))))) m (cons source (sources source))))] (or (when-not (contains? (tp tag) parent) (when (contains? (ta tag) parent) (throw (Exception. (print-str tag "already has" parent "as ancestor")))) (when (contains? (ta parent) tag) (throw (Exception. (print-str "Cyclic derivation:" parent "has" tag "as ancestor")))) {:ancestors (tf (:ancestors h) tag td parent ta), :descendants (tf (:descendants h) parent ta tag td), :parents (assoc (:parents h) tag (conj (get tp tag #{}) parent))}) h))))
//---
-(function __clojure_fn_7379(){
-return (clojure.JS.def(clojure,"derive",(function __clojure_fn_7379_derive_7381(h_1,tag_2,parent_3){switch(arguments.length){
+(function __clojure_fn_5454(){
+return (clojure.JS.def(clojure,"derive",(function __clojure_fn_5454_derive_5456(h_1,tag_2,parent_3){switch(arguments.length){
case 2:var tag_1=arguments[0],parent_2=arguments[1];
return (clojure.alter_var_root.apply(null,[clojure._var_global_hierarchy,clojure.derive,tag_1,parent_2]),
null)}
-var tp_4,td_5,tf_7,or__202_8,ta_6,or__202_4,and__196_5;
-return (((clojure.not_EQ_.apply(null,[tag_2,parent_3]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'not=","'tag","'parent"])])]))})())),
+var tf_7,or__202_8,and__196_5,td_5,tp_4,or__202_4,ta_6;
+return (((clojure.not_EQ_.apply(null,[tag_2,parent_3]))?(null):((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'not=","'tag","'parent"])])])))})())),
((((or__202_4=clojure.class_QMARK_.apply(null,[tag_2])),
((or__202_4)?(or__202_4):(((and__196_5=clojure.instance_QMARK_.apply(null,[clojure.lang.Named,tag_2])),
-((and__196_5)?(clojure.namespace.apply(null,[tag_2])):(and__196_5)))))))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'or",clojure.JS.lit_list(["'class?","'tag"]),clojure.JS.lit_list(["'and",clojure.JS.lit_list(["'instance?","'clojure.lang.Named","'tag"]),clojure.JS.lit_list(["'namespace","'tag"])])])])]))})())),
-((clojure.instance_QMARK_.apply(null,[clojure.lang.Named,parent_3]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'instance?","'clojure.lang.Named","'parent"])])]))})())),
-((clojure.namespace.apply(null,[parent_3]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'namespace","'parent"])])]))})())),
+((and__196_5)?(clojure.namespace.apply(null,[tag_2])):(and__196_5)))))))?(null):((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'or",clojure.JS.lit_list(["'class?","'tag"]),clojure.JS.lit_list(["'and",clojure.JS.lit_list(["'instance?","'clojure.lang.Named","'tag"]),clojure.JS.lit_list(["'namespace","'tag"])])])])])))})())),
+((clojure.instance_QMARK_.apply(null,[clojure.lang.Named,parent_3]))?(null):((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'instance?","'clojure.lang.Named","'parent"])])])))})())),
+((clojure.namespace.apply(null,[parent_3]))?(null):((function __throw(){throw (new java.lang.Exception(clojure.str.apply(null,["Assert failed: ",clojure.pr_str.apply(null,[clojure.JS.lit_list(["'namespace","'parent"])])])))})())),
((tp_4=clojure.keyword("","parents").apply(null,[h_1])),
(td_5=clojure.keyword("","descendants").apply(null,[h_1])),
(ta_6=clojure.keyword("","ancestors").apply(null,[h_1])),
-(tf_7=(function __clojure_fn_7379_derive_7381_tf_7384(m_1,source_2,sources_3,target_4,targets_5){
-return (clojure.reduce.apply(null,[(function __clojure_fn_7379_derive_7381_tf_7384_fn_7386(ret_1,k_2){
+(tf_7=(function __clojure_fn_5454_derive_5456_tf_5459(m_1,source_2,sources_3,target_4,targets_5){
+return (clojure.reduce.apply(null,[(function __clojure_fn_5454_derive_5456_tf_5459_fn_5461(ret_1,k_2){
return (clojure.assoc.apply(null,[ret_1,k_2,clojure.reduce.apply(null,[clojure.conj,clojure.get.apply(null,[targets_5,k_2,clojure.lang.PersistentHashSet.EMPTY]),clojure.cons.apply(null,[target_4,targets_5.apply(null,[target_4])])])]))}),m_1,clojure.cons.apply(null,[source_2,sources_3.apply(null,[source_2])])]))})),
-((or__202_8=((clojure.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(null):(((clojure.contains_QMARK_.apply(null,[ta_6.apply(null,[tag_2]),parent_3]))?((function __throw(){throw clojure.lang.RT.makeException(clojure.print_str.apply(null,[tag_2,"already has",parent_3,"as ancestor"]))})()):(null)),
-((clojure.contains_QMARK_.apply(null,[ta_6.apply(null,[parent_3]),tag_2]))?((function __throw(){throw clojure.lang.RT.makeException(clojure.print_str.apply(null,["Cyclic derivation:",parent_3,"has",tag_2,"as ancestor"]))})()):(null)),
-clojure.hash_map(clojure.keyword("","parents"),clojure.assoc.apply(null,[clojure.keyword("","parents").apply(null,[h_1]),tag_2,clojure.conj.apply(null,[clojure.get.apply(null,[tp_4,tag_2,clojure.lang.PersistentHashSet.EMPTY]),parent_3])]),clojure.keyword("","descendants"),tf_7.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]),clojure.keyword("","ancestors"),tf_7.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]))))),
+((or__202_8=((clojure.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(null):(((clojure.contains_QMARK_.apply(null,[ta_6.apply(null,[tag_2]),parent_3]))?((function __throw(){throw (new java.lang.Exception(clojure.print_str.apply(null,[tag_2,"already has",parent_3,"as ancestor"])))})()):(null)),
+((clojure.contains_QMARK_.apply(null,[ta_6.apply(null,[parent_3]),tag_2]))?((function __throw(){throw (new java.lang.Exception(clojure.print_str.apply(null,["Cyclic derivation:",parent_3,"has",tag_2,"as ancestor"])))})()):(null)),
+clojure.hash_map(clojure.keyword("","ancestors"),tf_7.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]),clojure.keyword("","descendants"),tf_7.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]),clojure.keyword("","parents"),clojure.assoc.apply(null,[clojure.keyword("","parents").apply(null,[h_1]),tag_2,clojure.conj.apply(null,[clojure.get.apply(null,[tp_4,tag_2,clojure.lang.PersistentHashSet.EMPTY]),parent_3])]))))),
((or__202_8)?(or__202_8):(h_1)))))})))}).apply(null,[]);
//======
-//(defn underive "Removes a parent/child relationship between parent and\n tag. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy." ([tag parent] (alter-var-root (var global-hierarchy) underive tag parent) nil) ([h tag parent] (let [tp (:parents h) td (:descendants h) ta (:ancestors h) tf (fn [m source sources target targets] (reduce (fn [ret k] (assoc ret k (reduce disj (get targets k) (cons target (targets target))))) m (cons source (sources source))))] (if (contains? (tp tag) parent) {:parent (assoc (:parents h) tag (disj (get tp tag) parent)), :descendants (tf (:descendants h) parent ta tag td), :ancestors (tf (:ancestors h) tag td parent ta)} h))))
+//(defn underive "Removes a parent/child relationship between parent and\n tag. h must be a hierarchy obtained from make-hierarchy, if not\n supplied defaults to, and modifies, the global hierarchy." ([tag parent] (alter-var-root (var global-hierarchy) underive tag parent) nil) ([h tag parent] (let [tp (:parents h) td (:descendants h) ta (:ancestors h) tf (fn [m source sources target targets] (reduce (fn [ret k] (assoc ret k (reduce disj (get targets k) (cons target (targets target))))) m (cons source (sources source))))] (if (contains? (tp tag) parent) {:ancestors (tf (:ancestors h) tag td parent ta), :descendants (tf (:descendants h) parent ta tag td), :parent (assoc (:parents h) tag (disj (get tp tag) parent))} h))))
//---
-(function __clojure_fn_7405(){
-return (clojure.JS.def(clojure,"underive",(function __clojure_fn_7405_underive_7407(h_1,tag_2,parent_3){switch(arguments.length){
+(function __clojure_fn_5467(){
+return (clojure.JS.def(clojure,"underive",(function __clojure_fn_5467_underive_5469(h_1,tag_2,parent_3){switch(arguments.length){
case 2:var tag_1=arguments[0],parent_2=arguments[1];
return (clojure.alter_var_root.apply(null,[clojure._var_global_hierarchy,clojure.underive,tag_1,parent_2]),
null)}
-var td_5,tf_7,tp_4,ta_6;
+var ta_6,tp_4,tf_7,td_5;
return (((tp_4=clojure.keyword("","parents").apply(null,[h_1])),
(td_5=clojure.keyword("","descendants").apply(null,[h_1])),
(ta_6=clojure.keyword("","ancestors").apply(null,[h_1])),
-(tf_7=(function __clojure_fn_7405_underive_7407_tf_7410(m_1,source_2,sources_3,target_4,targets_5){
-return (clojure.reduce.apply(null,[(function __clojure_fn_7405_underive_7407_tf_7410_fn_7412(ret_1,k_2){
+(tf_7=(function __clojure_fn_5467_underive_5469_tf_5472(m_1,source_2,sources_3,target_4,targets_5){
+return (clojure.reduce.apply(null,[(function __clojure_fn_5467_underive_5469_tf_5472_fn_5474(ret_1,k_2){
return (clojure.assoc.apply(null,[ret_1,k_2,clojure.reduce.apply(null,[clojure.disj,clojure.get.apply(null,[targets_5,k_2]),clojure.cons.apply(null,[target_4,targets_5.apply(null,[target_4])])])]))}),m_1,clojure.cons.apply(null,[source_2,sources_3.apply(null,[source_2])])]))})),
-((clojure.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(clojure.hash_map(clojure.keyword("","parent"),clojure.assoc.apply(null,[clojure.keyword("","parents").apply(null,[h_1]),tag_2,clojure.disj.apply(null,[clojure.get.apply(null,[tp_4,tag_2]),parent_3])]),clojure.keyword("","descendants"),tf_7.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]),clojure.keyword("","ancestors"),tf_7.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]))):(h_1))))})))}).apply(null,[]);
+((clojure.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(clojure.hash_map(clojure.keyword("","ancestors"),tf_7.apply(null,[clojure.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]),clojure.keyword("","descendants"),tf_7.apply(null,[clojure.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]),clojure.keyword("","parent"),clojure.assoc.apply(null,[clojure.keyword("","parents").apply(null,[h_1]),tag_2,clojure.disj.apply(null,[clojure.get.apply(null,[tp_4,tag_2]),parent_3])]))):(h_1))))})))}).apply(null,[]);
//======
//(defn distinct? "Returns true if no two of the arguments are equal" {:tag Boolean} ([x] true) ([x y] (not (= x y))) ([x y & more] (if (not= x y) (loop [s #{y x} [x & etc :as xs] more] (if xs (if (contains? s x) false (recur (conj s x) etc)) true)) false)))
//---
-(function __clojure_fn_7430(){
-return (clojure.JS.def(clojure,"distinct_QMARK_",clojure.JS.variadic(2,(function __clojure_fn_7430_distinct_QMARK_7432(x_1,y_2){switch(arguments.length){
+(function __clojure_fn_5480(){
+return (clojure.JS.def(clojure,"distinct_QMARK_",clojure.JS.variadic(2,(function __clojure_fn_5480_distinct_QMARK_5482(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 (true)}
-var etc_15,vec__7438_6,G__7437_5,s_12,s_10,xs_16,xs_9,G__7437_11,etc_8,s_4,x_14,vec__7439_13,x_7,more_3=clojure.JS.rest_args(this,arguments,2);
+var s_12,xs_16,s_4,vec__5489_13,etc_8,x_14,s_10,x_7,G__5487_5,vec__5488_6,xs_9,etc_15,G__5487_11,more_3=clojure.JS.rest_args(this,arguments,2);
return (((clojure.not_EQ_.apply(null,[x_1,y_2]))?(((s_4=clojure.hash_set(y_2,x_1)),
-(G__7437_5=more_3),
-(vec__7438_6=G__7437_5),
-(x_7=clojure.nth.apply(null,[vec__7438_6,0,null])),
-(etc_8=clojure.nthrest.apply(null,[vec__7438_6,1])),
-(xs_9=vec__7438_6),
+(G__5487_5=more_3),
+(vec__5488_6=G__5487_5),
+(x_7=clojure.nth.apply(null,[vec__5488_6,0,null])),
+(etc_8=clojure.nthrest.apply(null,[vec__5488_6,1])),
+(xs_9=vec__5488_6),
((function __loop(){var _rtn,_cnt;(s_10=s_4),
-(G__7437_11=G__7437_5);do{_cnt=0;
+(G__5487_11=G__5487_5);do{_cnt=0;
_rtn=((s_12=s_10),
-(vec__7439_13=G__7437_11),
-(x_14=clojure.nth.apply(null,[vec__7439_13,0,null])),
-(etc_15=clojure.nthrest.apply(null,[vec__7439_13,1])),
-(xs_16=vec__7439_13),
-((xs_16)?(((clojure.contains_QMARK_.apply(null,[s_12,x_14]))?(false):((_cnt=1,_rtn=[clojure.conj.apply(null,[s_12,x_14]),etc_15],s_10=_rtn[0],G__7437_11=_rtn[1])))):(true)))}while(_cnt);return _rtn;})()))):(false)))}))))}).apply(null,[]);
+(vec__5489_13=G__5487_11),
+(x_14=clojure.nth.apply(null,[vec__5489_13,0,null])),
+(etc_15=clojure.nthrest.apply(null,[vec__5489_13,1])),
+(xs_16=vec__5489_13),
+((xs_16)?(((clojure.contains_QMARK_.apply(null,[s_12,x_14]))?(false):((_cnt=1,_rtn=[clojure.conj.apply(null,[s_12,x_14]),etc_15],s_10=_rtn[0],G__5487_11=_rtn[1])))):(true)))}while(_cnt);return _rtn;})()))):(false)))}))))}).apply(null,[]);
//======
//(defn iterator-seq "Returns a seq on a java.util.Iterator. Note that most collections\n providing iterators implement Iterable and thus support seq directly." [iter] (clojure.lang.IteratorSeq/create iter))
//---
-(function __clojure_fn_7448(){
-return (clojure.JS.def(clojure,"iterator_seq",(function __clojure_fn_7448_iterator_seq_7450(iter_1){
+(function __clojure_fn_5492(){
+return (clojure.JS.def(clojure,"iterator_seq",(function __clojure_fn_5492_iterator_seq_5494(iter_1){
return (clojure.lang.IteratorSeq.create(iter_1))})))}).apply(null,[]);
//======
//(defn enumeration-seq "Returns a seq on a java.lang.Enumeration" [e] (clojure.lang.EnumerationSeq/create e))
//---
-(function __clojure_fn_7460(){
-return (clojure.JS.def(clojure,"enumeration_seq",(function __clojure_fn_7460_enumeration_seq_7462(e_1){
+(function __clojure_fn_5498(){
+return (clojure.JS.def(clojure,"enumeration_seq",(function __clojure_fn_5498_enumeration_seq_5500(e_1){
return (clojure.lang.EnumerationSeq.create(e_1))})))}).apply(null,[]);
// Skipping: (defn format "Formats a string using java.lang.String.format, see java.util.Formatter for format\n string syntax" [fmt & args] (String/format fmt (to-array args)))
//======
//(defn printf "Prints formatted output, as per format" [fmt & args] (print (apply format fmt args)))
//---
-(function __clojure_fn_7478(){
-return (clojure.JS.def(clojure,"printf",clojure.JS.variadic(1,(function __clojure_fn_7478_printf_7480(fmt_1){
+(function __clojure_fn_5510(){
+return (clojure.JS.def(clojure,"printf",clojure.JS.variadic(1,(function __clojure_fn_5510_printf_5512(fmt_1){
var args_2=clojure.JS.rest_args(this,arguments,1);
return (clojure.print.apply(null,[clojure.apply.apply(null,[clojure.format,fmt_1,args_2])]))}))))}).apply(null,[]);
-// Skipping: (defmacro ns "Sets *ns* to the namespace named by name (unevaluated), creating it\n if needed. references can be zero or more of: (:refer-clojure ...)\n (:require ...) (:use ...) (:import ...) (:load ...) with the syntax\n of refer-clojure/require/use/import/load respectively, except the\n arguments are unevaluated and need not be quoted. If :refer-clojure\n is not used, a default (refer 'clojure) is used. Use of ns is preferred\n to individual calls to in-ns/require/use/import:\n\n (ns foo\n (:refer-clojure :exclude [ancestors printf])\n (:require (clojure.contrib sql sql.tests))\n (:use (my.lib this that))\n (:import (java.util Date Timer Random)\n (java.sql Connection Statement))\n (:load \"/mystuff/foo.clj\"))" [name & references] (let [process-reference (fn [[kname & args]] (clojure/concat (clojure/list (symbol "clojure" (clojure/name kname))) (map (fn* [p1__7484] (list (quote quote) p1__7484)) args)))] (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/in-ns)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list name))))) (when (not-any? (fn* [p1__7485] (= :refer-clojure (first p1__7485))) references) (clojure/concat (clojure/list (clojure/concat (clojure/list (quote clojure/refer)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list (quote clojure)))))))) (map process-reference references))))
+// Skipping: (defmacro ns "Sets *ns* to the namespace named by name (unevaluated), creating it\n if needed. references can be zero or more of: (:refer-clojure ...)\n (:require ...) (:use ...) (:import ...) (:load ...) with the syntax\n of refer-clojure/require/use/import/load respectively, except the\n arguments are unevaluated and need not be quoted. If :refer-clojure\n is not used, a default (refer 'clojure) is used. Use of ns is preferred\n to individual calls to in-ns/require/use/import:\n\n (ns foo\n (:refer-clojure :exclude [ancestors printf])\n (:require (clojure.contrib sql sql.tests))\n (:use (my.lib this that))\n (:import (java.util Date Timer Random)\n (java.sql Connection Statement))\n (:load \"/mystuff/foo.clj\"))" [name & references] (let [process-reference (fn [[kname & args]] (clojure/concat (clojure/list (symbol "clojure" (clojure/name kname))) (map (fn* [p1__5516] (list (quote quote) p1__5516)) args)))] (clojure/concat (clojure/list (quote do)) (clojure/list (clojure/concat (clojure/list (quote clojure/in-ns)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list name))))) (when (not-any? (fn* [p1__5517] (= :refer-clojure (first p1__5517))) references) (clojure/concat (clojure/list (clojure/concat (clojure/list (quote clojure/refer)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list (quote clojure)))))))) (map process-reference references))))
// Skipping: (defmacro refer-clojure "Same as (refer 'clojure <filters>)" [& filters] (clojure/concat (clojure/list (quote clojure/refer)) (clojure/list (clojure/concat (clojure/list (quote quote)) (clojure/list (quote clojure)))) filters))
-// Skipping: (defmacro defonce "defs name to have the root value of the expr iff the named var has no root value, \n else expr is unevaluated" [name expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote v__7509)) (clojure/list (clojure/concat (clojure/list (quote def)) (clojure/list name)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when-not)) (clojure/list (clojure/concat (clojure/list (quote clojure/.hasRoot)) (clojure/list (quote v__7509)))) (clojure/list (clojure/concat (clojure/list (quote def)) (clojure/list name) (clojure/list expr)))))))
+// Skipping: (defmacro defonce "defs name to have the root value of the expr iff the named var has no root value, \n else expr is unevaluated" [name expr] (clojure/concat (clojure/list (quote clojure/let)) (clojure/list (clojure/apply clojure/vector (clojure/concat (clojure/list (quote v__5541)) (clojure/list (clojure/concat (clojure/list (quote def)) (clojure/list name)))))) (clojure/list (clojure/concat (clojure/list (quote clojure/when-not)) (clojure/list (clojure/concat (clojure/list (quote clojure/.hasRoot)) (clojure/list (quote v__5541)))) (clojure/list (clojure/concat (clojure/list (quote def)) (clojure/list name) (clojure/list expr)))))))
//======
//(defonce *loaded-libs* (ref (sorted-set)))
//---
-(function __clojure_fn_7519(){
-var v__1711_1;
-return (((v__1711_1=clojure.JS.def(clojure,"_STAR_loaded_libs_STAR_",null)),
-(((v__1711_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_loaded_libs_STAR_",clojure.ref.apply(null,[clojure.sorted_set.apply(null,[])]))))))}).apply(null,[]);
+(function __clojure_fn_5548(){
+var v__1708_1;
+return (((v__1708_1=clojure.JS.def(clojure,"_STAR_loaded_libs_STAR_",null)),
+(((v__1708_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_loaded_libs_STAR_",clojure.ref.apply(null,[clojure.sorted_set.apply(null,[])]))))))}).apply(null,[]);
//======
//(defonce *pending-paths* #{})
//---
-(function __clojure_fn_7525(){
-var v__1711_1;
-return (((v__1711_1=clojure.JS.def(clojure,"_STAR_pending_paths_STAR_",null)),
-(((v__1711_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_pending_paths_STAR_",clojure.lang.PersistentHashSet.EMPTY)))))}).apply(null,[]);
+(function __clojure_fn_5551(){
+var v__1708_1;
+return (((v__1708_1=clojure.JS.def(clojure,"_STAR_pending_paths_STAR_",null)),
+(((v__1708_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_pending_paths_STAR_",clojure.lang.PersistentHashSet.EMPTY)))))}).apply(null,[]);
//======
//(defonce *loading-verbosely* false)
//---
-(function __clojure_fn_7531(){
-var v__1711_1;
-return (((v__1711_1=clojure.JS.def(clojure,"_STAR_loading_verbosely_STAR_",null)),
-(((v__1711_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_loading_verbosely_STAR_",false)))))}).apply(null,[]);
+(function __clojure_fn_5554(){
+var v__1708_1;
+return (((v__1708_1=clojure.JS.def(clojure,"_STAR_loading_verbosely_STAR_",null)),
+(((v__1708_1).hasRoot())?(null):(clojure.JS.def(clojure,"_STAR_loading_verbosely_STAR_",false)))))}).apply(null,[]);
//======
-//(defn- throw-if "Throws an exception with a message if pred is true" [pred fmt & args] (when pred (let [message (apply format fmt args) exception (RT/makeException message) raw-trace (.getStackTrace exception) boring? (fn* [p1__7534] (not= (.getMethodName p1__7534) "doInvoke")) trace (into-array (drop 2 (drop-while boring? raw-trace)))] (.setStackTrace exception trace) (throw exception))))
+//(defn- throw-if "Throws an exception with a message if pred is true" [pred fmt & args] (when pred (let [message (apply format fmt args) exception (Exception. message) raw-trace (.getStackTrace exception) boring? (fn* [p1__5557] (not= (.getMethodName p1__5557) "doInvoke")) trace (into-array (drop 2 (drop-while boring? raw-trace)))] (.setStackTrace exception trace) (throw exception))))
//---
-(function __clojure_fn_7544(){
-return (clojure.JS.def(clojure,"throw_if",clojure.JS.variadic(2,(function __clojure_fn_7544_throw_if_7546(pred_1,fmt_2){
-var boring_QMARK__7,message_4,exception_5,raw_trace_6,trace_8,args_3=clojure.JS.rest_args(this,arguments,2);
+(function __clojure_fn_5558(){
+return (clojure.JS.def(clojure,"throw_if",clojure.JS.variadic(2,(function __clojure_fn_5558_throw_if_5560(pred_1,fmt_2){
+var message_4,boring_QMARK__7,raw_trace_6,trace_8,exception_5,args_3=clojure.JS.rest_args(this,arguments,2);
return (((pred_1)?(((message_4=clojure.apply.apply(null,[clojure.format,fmt_2,args_3])),
-(exception_5=clojure.lang.RT.makeException(message_4)),
+(exception_5=(new java.lang.Exception(message_4))),
(raw_trace_6=(exception_5).getStackTrace()),
-(boring_QMARK__7=(function __clojure_fn_7544_throw_if_7546_boring_QMARK_7548(p1__7534_1){
-return (clojure.not_EQ_.apply(null,[(p1__7534_1).getMethodName,"doInvoke"]))})),
+(boring_QMARK__7=(function __clojure_fn_5558_throw_if_5560_boring_QMARK_5562(p1__5557_1){
+return (clojure.not_EQ_.apply(null,[(p1__5557_1).getMethodName,"doInvoke"]))})),
(trace_8=clojure.into_array.apply(null,[clojure.drop.apply(null,[2,clojure.drop_while.apply(null,[boring_QMARK__7,raw_trace_6])])])),
(exception_5).setStackTrace(trace_8),
(function __throw(){throw exception_5})())):(null)))}))))}).apply(null,[]);
@@ -2531,9 +2525,9 @@ return (clojure.not_EQ_.apply(null,[(p1__7534_1).getMethodName,"doInvoke"]))})),
//======
//(defn- libspec? "Returns true if x is a libspec" [x] (or (symbol? x) (and (vector? x) (or (nil? (second x)) (keyword? (second x))))))
//---
-(function __clojure_fn_7559(){
-return (clojure.JS.def(clojure,"libspec_QMARK_",(function __clojure_fn_7559_libspec_QMARK_7561(x_1){
-var or__202_4,and__196_3,or__202_2;
+(function __clojure_fn_5567(){
+return (clojure.JS.def(clojure,"libspec_QMARK_",(function __clojure_fn_5567_libspec_QMARK_5569(x_1){
+var or__202_4,or__202_2,and__196_3;
return (((or__202_2=clojure.symbol_QMARK_.apply(null,[x_1])),
((or__202_2)?(or__202_2):(((and__196_3=clojure.vector_QMARK_.apply(null,[x_1])),
((and__196_3)?(((or__202_4=clojure.nil_QMARK_.apply(null,[clojure.second.apply(null,[x_1])])),
@@ -2542,23 +2536,23 @@ return (((or__202_2=clojure.symbol_QMARK_.apply(null,[x_1])),
//======
//(defn- prependss "Prepends a symbol or a seq to coll" [x coll] (if (symbol? x) (cons x coll) (concat x coll)))
//---
-(function __clojure_fn_7571(){
-return (clojure.JS.def(clojure,"prependss",(function __clojure_fn_7571_prependss_7573(x_1,coll_2){
+(function __clojure_fn_5573(){
+return (clojure.JS.def(clojure,"prependss",(function __clojure_fn_5573_prependss_5575(x_1,coll_2){
return (((clojure.symbol_QMARK_.apply(null,[x_1]))?(clojure.cons.apply(null,[x_1,coll_2])):(clojure.concat.apply(null,[x_1,coll_2]))))})))}).apply(null,[]);
//======
//(defn- root-directory "Returns the root directory path for a lib" [lib] (str \/ (.. (name lib) (replace \- \_) (replace \. \/))))
//---
-(function __clojure_fn_7583(){
-return (clojure.JS.def(clojure,"root_directory",(function __clojure_fn_7583_root_directory_7585(lib_1){
+(function __clojure_fn_5579(){
+return (clojure.JS.def(clojure,"root_directory",(function __clojure_fn_5579_root_directory_5581(lib_1){
return (clojure.str.apply(null,["/",((clojure.name.apply(null,[lib_1])).replace("-","_")).replace(".","/")]))})))}).apply(null,[]);
//======
//(defn- root-resource "Returns the root resource path for a lib" [lib] (let [d (root-directory lib) i (inc (.lastIndexOf d (int \/))) leaf (.substring d i)] (str d \/ leaf ".clj")))
//---
-(function __clojure_fn_7595(){
-return (clojure.JS.def(clojure,"root_resource",(function __clojure_fn_7595_root_resource_7597(lib_1){
-var leaf_4,d_2,i_3;
+(function __clojure_fn_5585(){
+return (clojure.JS.def(clojure,"root_resource",(function __clojure_fn_5585_root_resource_5587(lib_1){
+var d_2,i_3,leaf_4;
return (((d_2=clojure.root_directory.apply(null,[lib_1])),
(i_3=clojure.lang.Numbers.inc((d_2).lastIndexOf(clojure.lang.RT.intCast("/")))),
(leaf_4=(d_2).substring(i_3)),
@@ -2567,30 +2561,30 @@ clojure.str.apply(null,[d_2,"/",leaf_4,".clj"])))})))}).apply(null,[]);
//======
//(def load)
//---
-(function __clojure_fn_7604(){
+(function __clojure_fn_5591(){
return (clojure.JS.def(clojure,"load",null))}).apply(null,[]);
//======
//(defn- load-one "Loads a lib given its name. If need-ns, ensures that the associated\n namespace exists after loading. If require, records the load so any\n duplicate loads can be skipped." [lib need-ns require] (load (root-resource lib)) (throw-if (and need-ns (not (find-ns lib))) "namespace '%s' not found after loading '%s'" lib (root-resource lib)) (when require (dosync (commute *loaded-libs* conj lib))))
//---
-(function __clojure_fn_7616(){
-return (clojure.JS.def(clojure,"load_one",(function __clojure_fn_7616_load_one_7618(lib_1,need_ns_2,require_3){
+(function __clojure_fn_5594(){
+return (clojure.JS.def(clojure,"load_one",(function __clojure_fn_5594_load_one_5596(lib_1,need_ns_2,require_3){
var and__196_4;
return (clojure.load.apply(null,[clojure.root_resource.apply(null,[lib_1])]),
clojure.throw_if.apply(null,[((and__196_4=need_ns_2),
((and__196_4)?(clojure.not.apply(null,[clojure.find_ns.apply(null,[lib_1])])):(and__196_4))),"namespace '%s' not found after loading '%s'",lib_1,clojure.root_resource.apply(null,[lib_1])]),
-((require_3)?(clojure.lang.LockingTransaction.runInTransaction((function __clojure_fn_7616_load_one_7618_fn_7620(){
+((require_3)?(clojure.lang.LockingTransaction.runInTransaction((function __clojure_fn_5594_load_one_5596_fn_5598(){
return (clojure.commute.apply(null,[clojure._STAR_loaded_libs_STAR_,clojure.conj,lib_1]))}))):(null)))})))}).apply(null,[]);
//======
-//(defn- load-all "Loads a lib given its name and forces a load of any libs it directly or\n indirectly loads. If need-ns, ensures that the associated namespace\n exists after loading. If require, records the load so any duplicate loads\n can be skipped." [lib need-ns require] (dosync (commute *loaded-libs* (fn* [p1__7625 p2__7626] (reduce conj p1__7625 p2__7626)) (binding [*loaded-libs* (ref (sorted-set))] (load-one lib need-ns require) (clojure/deref *loaded-libs*)))))
+//(defn- load-all "Loads a lib given its name and forces a load of any libs it directly or\n indirectly loads. If need-ns, ensures that the associated namespace\n exists after loading. If require, records the load so any duplicate loads\n can be skipped." [lib need-ns require] (dosync (commute *loaded-libs* (fn* [p1__5603 p2__5604] (reduce conj p1__5603 p2__5604)) (binding [*loaded-libs* (ref (sorted-set))] (load-one lib need-ns require) (clojure/deref *loaded-libs*)))))
//---
-(function __clojure_fn_7642(){
-return (clojure.JS.def(clojure,"load_all",(function __clojure_fn_7642_load_all_7644(lib_1,need_ns_2,require_3){
-return (clojure.lang.LockingTransaction.runInTransaction((function __clojure_fn_7642_load_all_7644_fn_7646(){
-return (clojure.commute.apply(null,[clojure._STAR_loaded_libs_STAR_,(function __clojure_fn_7642_load_all_7644_fn_7646_fn_7648(p1__7625_1,p2__7626_2){
-return (clojure.reduce.apply(null,[clojure.conj,p1__7625_1,p2__7626_2]))}),clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_loaded_libs_STAR_,clojure.ref.apply(null,[clojure.sorted_set.apply(null,[])])])),
-(function __clojure_fn_7642_load_all_7644_fn_7646_fn_7651(){
+(function __clojure_fn_5605(){
+return (clojure.JS.def(clojure,"load_all",(function __clojure_fn_5605_load_all_5607(lib_1,need_ns_2,require_3){
+return (clojure.lang.LockingTransaction.runInTransaction((function __clojure_fn_5605_load_all_5607_fn_5609(){
+return (clojure.commute.apply(null,[clojure._STAR_loaded_libs_STAR_,(function __clojure_fn_5605_load_all_5607_fn_5609_fn_5611(p1__5603_1,p2__5604_2){
+return (clojure.reduce.apply(null,[clojure.conj,p1__5603_1,p2__5604_2]))}),clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_loaded_libs_STAR_,clojure.ref.apply(null,[clojure.sorted_set.apply(null,[])])])),
+(function __clojure_fn_5605_load_all_5607_fn_5609_fn_5614(){
return ((function __try(){try{var _rtn=(clojure.load_one.apply(null,[lib_1,need_ns_2,require_3]),
clojure.deref.apply(null,[clojure._STAR_loaded_libs_STAR_]))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[])]))})))})))}).apply(null,[]);
@@ -2598,20 +2592,20 @@ finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[])])
//======
//(defn- load-lib "Loads a lib with options" [prefix lib & options] (throw-if (and prefix (pos? (.indexOf (name lib) (int \.)))) "lib names inside prefix lists must not contain periods") (let [lib (if prefix (symbol (str prefix \. lib)) lib) opts (apply hash-map options) {:keys [as reload reload-all require use verbose]} opts loaded (contains? (clojure/deref *loaded-libs*) lib) load (cond reload-all load-all (or reload (not require) (not loaded)) load-one) need-ns (or as use) filter-opts (select-keys opts (quote (:exclude :only :rename)))] (binding [*loading-verbosely* (or *loading-verbosely* verbose)] (if load (load lib need-ns require) (throw-if (and need-ns (not (find-ns lib))) "namespace '%s' not found" lib)) (when (and need-ns *loading-verbosely*) (printf "(clojure/in-ns '%s)\n" (ns-name *ns*))) (when as (when *loading-verbosely* (printf "(clojure/alias '%s '%s)\n" as lib)) (alias as lib)) (when use (when *loading-verbosely* (printf "(clojure/refer '%s" lib) (doseq opt filter-opts (printf " %s '%s" (key opt) (print-str (val opt)))) (printf ")\n")) (apply refer lib (mapcat seq filter-opts))))))
//---
-(function __clojure_fn_7664(){
-return (clojure.JS.def(clojure,"load_lib",clojure.JS.variadic(2,(function __clojure_fn_7664_load_lib_7666(prefix_1,lib_2){
-var or__202_15,loaded_13,filter_opts_16,use_12,need_ns_15,map__7668_6,reload_7,list__781_19,opt_20,opts_5,require_9,or__202_14,and__196_19,lib_4,reload_all_10,or__202_15,verbose_11,load_14,and__196_4,as_8,or__202_17,and__196_19,options_3=clojure.JS.rest_args(this,arguments,2);
+(function __clojure_fn_5620(){
+return (clojure.JS.def(clojure,"load_lib",clojure.JS.variadic(2,(function __clojure_fn_5620_load_lib_5622(prefix_1,lib_2){
+var require_9,need_ns_15,or__202_15,as_8,opt_20,filter_opts_16,use_12,map__5624_6,loaded_13,reload_7,verbose_11,reload_all_10,or__202_17,lib_4,load_14,and__196_19,and__196_19,list__781_19,or__202_15,and__196_4,opts_5,or__202_14,options_3=clojure.JS.rest_args(this,arguments,2);
return (clojure.throw_if.apply(null,[((and__196_4=prefix_1),
((and__196_4)?(clojure.lang.Numbers.isPos((clojure.name.apply(null,[lib_2])).indexOf(clojure.lang.RT.intCast(".")))):(and__196_4))),"lib names inside prefix lists must not contain periods"]),
((lib_4=((prefix_1)?(clojure.symbol.apply(null,[clojure.str.apply(null,[prefix_1,".",lib_2])])):(lib_2))),
(opts_5=clojure.apply.apply(null,[clojure.hash_map,options_3])),
-(map__7668_6=opts_5),
-(reload_7=clojure.get.apply(null,[map__7668_6,clojure.keyword("","reload")])),
-(as_8=clojure.get.apply(null,[map__7668_6,clojure.keyword("","as")])),
-(require_9=clojure.get.apply(null,[map__7668_6,clojure.keyword("","require")])),
-(reload_all_10=clojure.get.apply(null,[map__7668_6,clojure.keyword("","reload-all")])),
-(verbose_11=clojure.get.apply(null,[map__7668_6,clojure.keyword("","verbose")])),
-(use_12=clojure.get.apply(null,[map__7668_6,clojure.keyword("","use")])),
+(map__5624_6=opts_5),
+(reload_7=clojure.get.apply(null,[map__5624_6,clojure.keyword("","reload")])),
+(as_8=clojure.get.apply(null,[map__5624_6,clojure.keyword("","as")])),
+(require_9=clojure.get.apply(null,[map__5624_6,clojure.keyword("","require")])),
+(reload_all_10=clojure.get.apply(null,[map__5624_6,clojure.keyword("","reload-all")])),
+(verbose_11=clojure.get.apply(null,[map__5624_6,clojure.keyword("","verbose")])),
+(use_12=clojure.get.apply(null,[map__5624_6,clojure.keyword("","use")])),
(loaded_13=clojure.contains_QMARK_.apply(null,[clojure.deref.apply(null,[clojure._STAR_loaded_libs_STAR_]),lib_4])),
(load_14=((reload_all_10)?(clojure.load_all):(((((or__202_14=reload_7),
((or__202_14)?(or__202_14):(((or__202_15=clojure.not.apply(null,[require_9])),
@@ -2639,17 +2633,17 @@ finally{clojure.lang.Var.popThreadBindings()}return _rtn})()))}))))}).apply(null
//======
//(defn- load-libs "Loads libs, interpreting libspecs, prefix lists, and flags for\n forwarding to load-lib" [& args] (let [flags (filter keyword? args) opts (interleave flags (repeat true)) args (filter (complement keyword?) args)] (doseq arg args (if (libspec? arg) (apply load-lib nil (prependss arg opts)) (let [[prefix & args] arg] (throw-if (nil? prefix) "prefix cannot be nil") (doseq arg args (apply load-lib prefix (prependss arg opts))))))))
//---
-(function __clojure_fn_7678(){
-return (clojure.JS.def(clojure,"load_libs",clojure.JS.variadic(0,(function __clojure_fn_7678_load_libs_7680(){
-var opts_3,arg_6,flags_2,prefix_8,list__781_10,arg_11,vec__7682_7,list__781_5,args_4,args_9,args_1=clojure.JS.rest_args(this,arguments,0);
+(function __clojure_fn_5627(){
+return (clojure.JS.def(clojure,"load_libs",clojure.JS.variadic(0,(function __clojure_fn_5627_load_libs_5629(){
+var list__781_10,flags_2,vec__5631_7,arg_6,arg_11,list__781_5,args_4,prefix_8,opts_3,args_9,args_1=clojure.JS.rest_args(this,arguments,0);
return (((flags_2=clojure.filter.apply(null,[clojure.keyword_QMARK_,args_1])),
(opts_3=clojure.interleave.apply(null,[flags_2,clojure.repeat.apply(null,[true])])),
(args_4=clojure.filter.apply(null,[clojure.complement.apply(null,[clojure.keyword_QMARK_]),args_1])),
((function __loop(){var _rtn,_cnt;(list__781_5=clojure.seq.apply(null,[args_4]));do{_cnt=0;
_rtn=((list__781_5)?(((arg_6=clojure.first.apply(null,[list__781_5])),
-((clojure.libspec_QMARK_.apply(null,[arg_6]))?(clojure.apply.apply(null,[clojure.load_lib,null,clojure.prependss.apply(null,[arg_6,opts_3])])):(((vec__7682_7=arg_6),
-(prefix_8=clojure.nth.apply(null,[vec__7682_7,0,null])),
-(args_9=clojure.nthrest.apply(null,[vec__7682_7,1])),
+((clojure.libspec_QMARK_.apply(null,[arg_6]))?(clojure.apply.apply(null,[clojure.load_lib,null,clojure.prependss.apply(null,[arg_6,opts_3])])):(((vec__5631_7=arg_6),
+(prefix_8=clojure.nth.apply(null,[vec__5631_7,0,null])),
+(args_9=clojure.nthrest.apply(null,[vec__5631_7,1])),
clojure.throw_if.apply(null,[clojure.nil_QMARK_.apply(null,[prefix_8]),"prefix cannot be nil"]),
((function __loop(){var _rtn,_cnt;(list__781_10=clojure.seq.apply(null,[args_9]));do{_cnt=0;
_rtn=((list__781_10)?(((arg_11=clojure.first.apply(null,[list__781_10])),
@@ -2660,32 +2654,32 @@ clojure.apply.apply(null,[clojure.load_lib,prefix_8,clojure.prependss.apply(null
//======
//(defn require "Loads libs, skipping any that are already loaded. Each argument is\n either a libspec that identifies a lib, a prefix list that identifies\n multiple libs whose names share a common prefix, or a flag that modifies\n how all the identified libs are loaded. Use :require in the ns macro \n in preference to calling this directly.\n\n Libs\n\n A 'lib' is a named set of resources in classpath whose contents define a\n library of Clojure code. Lib names are symbols and each lib is associated\n with a Clojure namespace and a Java package that share its name. A lib's\n name also locates its root directory within classpath using Java's\n package name to classpath-relative path mapping. All resources in a lib\n should be contained in the directory structure under its root directory.\n All definitions a lib makes should be in its associated namespace.\n\n 'require loads a lib by loading its root resource. The root resource path\n is derived from the root directory path by repeating its last component\n and appending '.clj'. For example, the lib 'x.y.z has root directory\n <classpath>/x/y/z; root resource <classpath>/x/y/z/z.clj. The root\n resource should contain code to create the lib's namespace and load any\n additional lib resources.\n\n Libspecs\n\n A libspec is a lib name or a vector containing a lib name followed by\n options expressed as sequential keywords and arguments.\n\n Recognized options: :as\n :as takes a symbol as its argument and makes that symbol an alias to the\n lib's namespace in the current namespace.\n\n Prefix Lists\n\n It's common for Clojure code to depend on several libs whose names have\n the same prefix. When specifying libs, prefix lists can be used to reduce\n repetition. A prefix list contains the shared prefix followed by libspecs\n with the shared prefix removed from the lib names. After removing the\n prefix, the names that remain must not contain any periods.\n\n Flags\n\n A flag is a keyword.\n Recognized flags: :reload, :reload-all, :verbose\n :reload forces loading of all the identified libs even if they are\n already loaded\n :reload-all implies :reload and also forces loading of all libs that the\n identified libs directly or indirectly load via require or use\n :verbose triggers printing information about each load, alias, and refer" [& args] (apply load-libs :require args))
//---
-(function __clojure_fn_7691(){
-return (clojure.JS.def(clojure,"require",clojure.JS.variadic(0,(function __clojure_fn_7691_require_7693(){
+(function __clojure_fn_5634(){
+return (clojure.JS.def(clojure,"require",clojure.JS.variadic(0,(function __clojure_fn_5634_require_5636(){
var args_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.apply.apply(null,[clojure.load_libs,clojure.keyword("","require"),args_1]))}))))}).apply(null,[]);
//======
//(defn use "Like 'require, but also refers to each lib's namespace using\n clojure/refer. Use :use in the ns macro in preference to calling\n this directly.\n\n 'use accepts additional options in libspecs: :exclude, :only, :rename.\n The arguments and semantics for :exclude, :only, and :rename are the same\n as those documented for clojure/refer." [& args] (apply load-libs :require :use args))
//---
-(function __clojure_fn_7703(){
-return (clojure.JS.def(clojure,"use",clojure.JS.variadic(0,(function __clojure_fn_7703_use_7705(){
+(function __clojure_fn_5640(){
+return (clojure.JS.def(clojure,"use",clojure.JS.variadic(0,(function __clojure_fn_5640_use_5642(){
var args_1=clojure.JS.rest_args(this,arguments,0);
return (clojure.apply.apply(null,[clojure.load_libs,clojure.keyword("","require"),clojure.keyword("","use"),args_1]))}))))}).apply(null,[]);
//======
//(defn loaded-libs "Returns a sorted set of symbols naming the currently loaded libs" [] (clojure/deref *loaded-libs*))
//---
-(function __clojure_fn_7715(){
-return (clojure.JS.def(clojure,"loaded_libs",(function __clojure_fn_7715_loaded_libs_7717(){
+(function __clojure_fn_5646(){
+return (clojure.JS.def(clojure,"loaded_libs",(function __clojure_fn_5646_loaded_libs_5648(){
return (clojure.deref.apply(null,[clojure._STAR_loaded_libs_STAR_]))})))}).apply(null,[]);
//======
//(defn load "Loads Clojure code from resources in classpath. A path is interpreted as\n classpath-relative if it begins with a slash or relative to the root\n directory for the current namespace otherwise." [& paths] (doseq path paths (let [path (if (.startsWith path "/") path (str (root-directory (ns-name *ns*)) \/ path))] (when *loading-verbosely* (printf "(clojure/load \"%s\")\n" path) (flush)) (throw-if (*pending-paths* path) "cannot load '%s' again while it is loading" path) (binding [*pending-paths* (conj *pending-paths* path)] (.loadResourceScript clojure.lang.RT (.substring path 1))))))
//---
-(function __clojure_fn_7730(){
-return (clojure.JS.def(clojure,"load",clojure.JS.variadic(0,(function __clojure_fn_7730_load_7732(){
-var path_3,list__781_2,path_4,paths_1=clojure.JS.rest_args(this,arguments,0);
+(function __clojure_fn_5652(){
+return (clojure.JS.def(clojure,"load",clojure.JS.variadic(0,(function __clojure_fn_5652_load_5654(){
+var path_4,list__781_2,path_3,paths_1=clojure.JS.rest_args(this,arguments,0);
return (((function __loop(){var _rtn,_cnt;(list__781_2=clojure.seq.apply(null,[paths_1]));do{_cnt=0;
_rtn=((list__781_2)?(((path_3=clojure.first.apply(null,[list__781_2])),
((path_4=(((path_3).startsWith("/"))?(path_3):(clojure.str.apply(null,[clojure.root_directory.apply(null,[clojure.ns_name.apply(null,[clojure._STAR_ns_STAR_])]),"/",path_3])))),
@@ -2693,7 +2687,7 @@ _rtn=((list__781_2)?(((path_3=clojure.first.apply(null,[list__781_2])),
clojure.flush.apply(null,[])):(null)),
clojure.throw_if.apply(null,[clojure._STAR_pending_paths_STAR_.apply(null,[path_4]),"cannot load '%s' again while it is loading",path_4]),
clojure.lang.Var.pushThreadBindings(clojure.hash_map.apply(null,[clojure._var__STAR_pending_paths_STAR_,clojure.conj.apply(null,[clojure._STAR_pending_paths_STAR_,path_4])])),
-(function __clojure_fn_7730_load_7732_fn_7734(){
+(function __clojure_fn_5652_load_5654_fn_5656(){
return ((function __try(){try{var _rtn=(clojure.lang.RT.loadResourceScript((path_4).substring(1)))}
finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[]))),
(_cnt=1,_rtn=[clojure.rest.apply(null,[list__781_2])],list__781_2=_rtn[0])):(null))}while(_cnt);return _rtn;})()))}))))}).apply(null,[]);
@@ -2701,74 +2695,74 @@ finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[])))
//======
//(defn get-in "returns the value in a nested associative structure, where ks is a sequence of keys" [m ks] (reduce get m ks))
//---
-(function __clojure_fn_7745(){
-return (clojure.JS.def(clojure,"get_in",(function __clojure_fn_7745_get_in_7747(m_1,ks_2){
+(function __clojure_fn_5661(){
+return (clojure.JS.def(clojure,"get_in",(function __clojure_fn_5661_get_in_5663(m_1,ks_2){
return (clojure.reduce.apply(null,[clojure.get,m_1,ks_2]))})))}).apply(null,[]);
//======
//(defn assoc-in "Associates a value in a nested associative structure, where ks is a\n sequence of keys and v is the new value and returns a new nested structure. \n If any levels do not exist, hash-maps will be created." [m [k & ks] v] (if ks (assoc m k (assoc-in (get m k) ks v)) (assoc m k v)))
//---
-(function __clojure_fn_7759(){
-return (clojure.JS.def(clojure,"assoc_in",(function __clojure_fn_7759_assoc_in_7762(m_1,p__7761_2,v_3){
-var vec__7764_4,k_5,ks_6;
-return (((vec__7764_4=p__7761_2),
-(k_5=clojure.nth.apply(null,[vec__7764_4,0,null])),
-(ks_6=clojure.nthrest.apply(null,[vec__7764_4,1])),
+(function __clojure_fn_5667(){
+return (clojure.JS.def(clojure,"assoc_in",(function __clojure_fn_5667_assoc_in_5670(m_1,p__5669_2,v_3){
+var k_5,vec__5672_4,ks_6;
+return (((vec__5672_4=p__5669_2),
+(k_5=clojure.nth.apply(null,[vec__5672_4,0,null])),
+(ks_6=clojure.nthrest.apply(null,[vec__5672_4,1])),
((ks_6)?(clojure.assoc.apply(null,[m_1,k_5,clojure.assoc_in.apply(null,[clojure.get.apply(null,[m_1,k_5]),ks_6,v_3])])):(clojure.assoc.apply(null,[m_1,k_5,v_3])))))})))}).apply(null,[]);
//======
-//(defn update-in "'Updates' a value in a nested associative structure, where ks is a\n sequence of keys and f is a function that will take the old value\n and return the new value, and returns a new nested structure. \n If any levels do not exist, hash-maps will be created." ([m [k & ks] f] (if ks (assoc m k (update-in (get m k) ks f)) (assoc m k (f (get m k))))))
+//(defn update-in "'Updates' a value in a nested associative structure, where ks is a\n sequence of keys and f is a function that will take the old value\n and any supplied args and return the new value, and returns a new\n nested structure. If any levels do not exist, hash-maps will be\n created." ([m [k & ks] f & args] (if ks (assoc m k (apply update-in (get m k) ks f args)) (assoc m k (apply f (get m k) args)))))
//---
-(function __clojure_fn_7775(){
-return (clojure.JS.def(clojure,"update_in",(function __clojure_fn_7775_update_in_7778(m_1,p__7777_2,f_3){
-var vec__7780_4,ks_6,k_5;
-return (((vec__7780_4=p__7777_2),
-(k_5=clojure.nth.apply(null,[vec__7780_4,0,null])),
-(ks_6=clojure.nthrest.apply(null,[vec__7780_4,1])),
-((ks_6)?(clojure.assoc.apply(null,[m_1,k_5,clojure.update_in.apply(null,[clojure.get.apply(null,[m_1,k_5]),ks_6,f_3])])):(clojure.assoc.apply(null,[m_1,k_5,f_3.apply(null,[clojure.get.apply(null,[m_1,k_5])])])))))})))}).apply(null,[]);
+(function __clojure_fn_5675(){
+return (clojure.JS.def(clojure,"update_in",clojure.JS.variadic(3,(function __clojure_fn_5675_update_in_5678(m_1,p__5677_2,f_3){
+var k_6,ks_7,vec__5680_5,args_4=clojure.JS.rest_args(this,arguments,3);
+return (((vec__5680_5=p__5677_2),
+(k_6=clojure.nth.apply(null,[vec__5680_5,0,null])),
+(ks_7=clojure.nthrest.apply(null,[vec__5680_5,1])),
+((ks_7)?(clojure.assoc.apply(null,[m_1,k_6,clojure.apply.apply(null,[clojure.update_in,clojure.get.apply(null,[m_1,k_6]),ks_7,f_3,args_4])])):(clojure.assoc.apply(null,[m_1,k_6,clojure.apply.apply(null,[f_3,clojure.get.apply(null,[m_1,k_6]),args_4])])))))}))))}).apply(null,[]);
//======
//(defn empty? "Returns true if coll has no items - same as (not (seq coll)). \n Please use the idiom (seq x) rather than (not (empty? x))" [coll] (not (seq coll)))
//---
-(function __clojure_fn_7789(){
-return (clojure.JS.def(clojure,"empty_QMARK_",(function __clojure_fn_7789_empty_QMARK_7791(coll_1){
+(function __clojure_fn_5683(){
+return (clojure.JS.def(clojure,"empty_QMARK_",(function __clojure_fn_5683_empty_QMARK_5685(coll_1){
return (clojure.not.apply(null,[clojure.seq.apply(null,[coll_1])]))})))}).apply(null,[]);
//======
//(defn coll? "Returns true if x implements IPersistentCollection" [x] (instance? clojure.lang.IPersistentCollection x))
//---
-(function __clojure_fn_7801(){
-return (clojure.JS.def(clojure,"coll_QMARK_",(function __clojure_fn_7801_coll_QMARK_7803(x_1){
+(function __clojure_fn_5689(){
+return (clojure.JS.def(clojure,"coll_QMARK_",(function __clojure_fn_5689_coll_QMARK_5691(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentCollection,x_1]))})))}).apply(null,[]);
//======
//(defn list? "Returns true if x implements IPersistentList" [x] (instance? clojure.lang.IPersistentList x))
//---
-(function __clojure_fn_7813(){
-return (clojure.JS.def(clojure,"list_QMARK_",(function __clojure_fn_7813_list_QMARK_7815(x_1){
+(function __clojure_fn_5695(){
+return (clojure.JS.def(clojure,"list_QMARK_",(function __clojure_fn_5695_list_QMARK_5697(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentList,x_1]))})))}).apply(null,[]);
//======
//(defn set? "Returns true if x implements IPersistentSet" [x] (instance? clojure.lang.IPersistentSet x))
//---
-(function __clojure_fn_7825(){
-return (clojure.JS.def(clojure,"set_QMARK_",(function __clojure_fn_7825_set_QMARK_7827(x_1){
+(function __clojure_fn_5701(){
+return (clojure.JS.def(clojure,"set_QMARK_",(function __clojure_fn_5701_set_QMARK_5703(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IPersistentSet,x_1]))})))}).apply(null,[]);
// Skipping: (defn number? "Returns true if x is a Number" [x] (instance? Number x))
//======
//(defn fn? "Returns true if x implements IFn. Note that many data structures \n (e.g. sets and maps) implement IFn" [x] (instance? clojure.lang.IFn x))
//---
-(function __clojure_fn_7843(){
-return (clojure.JS.def(clojure,"fn_QMARK_",(function __clojure_fn_7843_fn_QMARK_7845(x_1){
+(function __clojure_fn_5713(){
+return (clojure.JS.def(clojure,"fn_QMARK_",(function __clojure_fn_5713_fn_QMARK_5715(x_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.IFn,x_1]))})))}).apply(null,[]);
// Skipping: (defn integer? "Returns true if n is an integer" [n] (or (instance? Integer n) (instance? Long n) (instance? BigInteger n)))
//======
//(defn ratio? "Returns true if n is a Ratio" [n] (instance? clojure.lang.Ratio n))
//---
-(function __clojure_fn_7861(){
-return (clojure.JS.def(clojure,"ratio_QMARK_",(function __clojure_fn_7861_ratio_QMARK_7863(n_1){
+(function __clojure_fn_5725(){
+return (clojure.JS.def(clojure,"ratio_QMARK_",(function __clojure_fn_5725_ratio_QMARK_5727(n_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Ratio,n_1]))})))}).apply(null,[]);
// Skipping: (defn decimal? "Returns true if n is a BigDecimal" [n] (instance? BigDecimal n))
// Skipping: (defn float? "Returns true if n is a floating point number" [n] (or (instance? Double n) (instance? Float n)))
@@ -2776,9 +2770,9 @@ return (clojure.instance_QMARK_.apply(null,[clojure.lang.Ratio,n_1]))})))}).appl
//======
//(defn rational? [n] "Returns true if n is a rational number" (or (integer? n) (ratio? n) (decimal? n)))
//---
-(function __clojure_fn_7885(){
-return (clojure.JS.def(clojure,"rational_QMARK_",(function __clojure_fn_7885_rational_QMARK_7887(n_1){
-var or__202_3,or__202_2;
+(function __clojure_fn_5743(){
+return (clojure.JS.def(clojure,"rational_QMARK_",(function __clojure_fn_5743_rational_QMARK_5745(n_1){
+var or__202_2,or__202_3;
return ("Returns true if n is a rational number",
((or__202_2=clojure.integer_QMARK_.apply(null,[n_1])),
((or__202_2)?(or__202_2):(((or__202_3=clojure.ratio_QMARK_.apply(null,[n_1])),
@@ -2787,67 +2781,67 @@ return ("Returns true if n is a rational number",
//======
//(defn associative? "Returns true if coll implements Associative" [coll] (instance? clojure.lang.Associative coll))
//---
-(function __clojure_fn_7897(){
-return (clojure.JS.def(clojure,"associative_QMARK_",(function __clojure_fn_7897_associative_QMARK_7899(coll_1){
+(function __clojure_fn_5749(){
+return (clojure.JS.def(clojure,"associative_QMARK_",(function __clojure_fn_5749_associative_QMARK_5751(coll_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Associative,coll_1]))})))}).apply(null,[]);
//======
//(defn sequential? "Returns true if coll implements Sequential" [coll] (instance? clojure.lang.Sequential coll))
//---
-(function __clojure_fn_7909(){
-return (clojure.JS.def(clojure,"sequential_QMARK_",(function __clojure_fn_7909_sequential_QMARK_7911(coll_1){
+(function __clojure_fn_5755(){
+return (clojure.JS.def(clojure,"sequential_QMARK_",(function __clojure_fn_5755_sequential_QMARK_5757(coll_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Sequential,coll_1]))})))}).apply(null,[]);
//======
//(defn sorted? "Returns true if coll implements Sorted" [coll] (instance? clojure.lang.Sorted coll))
//---
-(function __clojure_fn_7921(){
-return (clojure.JS.def(clojure,"sorted_QMARK_",(function __clojure_fn_7921_sorted_QMARK_7923(coll_1){
+(function __clojure_fn_5761(){
+return (clojure.JS.def(clojure,"sorted_QMARK_",(function __clojure_fn_5761_sorted_QMARK_5763(coll_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Sorted,coll_1]))})))}).apply(null,[]);
//======
//(defn reversible? "Returns true if coll implements Reversible" [coll] (instance? clojure.lang.Reversible coll))
//---
-(function __clojure_fn_7933(){
-return (clojure.JS.def(clojure,"reversible_QMARK_",(function __clojure_fn_7933_reversible_QMARK_7935(coll_1){
+(function __clojure_fn_5767(){
+return (clojure.JS.def(clojure,"reversible_QMARK_",(function __clojure_fn_5767_reversible_QMARK_5769(coll_1){
return (clojure.instance_QMARK_.apply(null,[clojure.lang.Reversible,coll_1]))})))}).apply(null,[]);
-// Skipping: (defn pmap "Like map, except f is applied in parallel. Semi-lazy in that the\n parallel computation stays ahead of the consumption, but doesn't\n realize the entire result unless required. Only useful for\n computationally intensive functions where the time of f dominates\n the coordination overhead." ([f coll] (let [n (inc (.. Runtime getRuntime availableProcessors)) agents (doall (map (fn* [p1__7939] (agent (f p1__7939))) (take n coll))) wget (fn [a] (await1 a) (clojure/deref a)) step (fn step [[x & xs :as s] [a & as :as acycle]] (if s (let [v (wget a)] (send a (fn [_] (f x))) (lazy-cons v (step xs as))) (map wget (take (count agents) acycle))))] (step (drop n coll) (cycle agents)))) ([f coll & colls] (let [step (fn step [cs] (when (every? seq cs) (lazy-cons (map first cs) (step (map rest cs)))))] (pmap (fn* [p1__7940] (apply f p1__7940)) (step (cons coll colls))))))
+// Skipping: (defn pmap "Like map, except f is applied in parallel. Semi-lazy in that the\n parallel computation stays ahead of the consumption, but doesn't\n realize the entire result unless required. Only useful for\n computationally intensive functions where the time of f dominates\n the coordination overhead." ([f coll] (let [n (inc (.. Runtime getRuntime availableProcessors)) agents (doall (map (fn* [p1__5773] (agent (f p1__5773))) (take n coll))) wget (fn [a] (await1 a) (clojure/deref a)) step (fn step [[x & xs :as s] [a & as :as acycle]] (if s (let [v (wget a)] (send a (fn [_] (f x))) (lazy-cons v (step xs as))) (map wget (take (count agents) acycle))))] (step (drop n coll) (cycle agents)))) ([f coll & colls] (let [step (fn step [cs] (when (every? seq cs) (lazy-cons (map first cs) (step (map rest cs)))))] (pmap (fn* [p1__5774] (apply f p1__5774)) (step (cons coll colls))))))
//======
//(def *1)
//---
-(function __clojure_fn_7981(){
+(function __clojure_fn_5812(){
return (clojure.JS.def(clojure,"_STAR_1",null))}).apply(null,[]);
//======
//(def *2)
//---
-(function __clojure_fn_7987(){
+(function __clojure_fn_5815(){
return (clojure.JS.def(clojure,"_STAR_2",null))}).apply(null,[]);
//======
//(def *3)
//---
-(function __clojure_fn_7993(){
+(function __clojure_fn_5818(){
return (clojure.JS.def(clojure,"_STAR_3",null))}).apply(null,[]);
//======
//(def *e)
//---
-(function __clojure_fn_7999(){
+(function __clojure_fn_5821(){
return (clojure.JS.def(clojure,"_STAR_e",null))}).apply(null,[]);
//======
//(import (quote (java.io Writer)))
//---
-(function __clojure_fn_8005(){
+(function __clojure_fn_5824(){
return (clojure.import_.apply(null,[clojure.JS.lit_list(["'java.io","'Writer"])]))}).apply(null,[]);
//======
//(defn- print-sequential [begin print-one sep end sequence w] (.write w begin) (loop [s (seq sequence)] (if (rest s) (do (print-one (first s) w) (.write w sep) (recur (rest s))) (when s (print-one (first s) w)))) (.write w end))
//---
-(function __clojure_fn_8014(){
-return (clojure.JS.def(clojure,"print_sequential",(function __clojure_fn_8014_print_sequential_8016(begin_1,print_one_2,sep_3,end_4,sequence_5,w_6){
+(function __clojure_fn_5827(){
+return (clojure.JS.def(clojure,"print_sequential",(function __clojure_fn_5827_print_sequential_5829(begin_1,print_one_2,sep_3,end_4,sequence_5,w_6){
var s_7;
return ((w_6).write(begin_1),
((function __loop(){var _rtn,_cnt;(s_7=clojure.seq.apply(null,[sequence_5]));do{_cnt=0;
@@ -2859,11 +2853,11 @@ _rtn=((clojure.rest.apply(null,[s_7]))?(print_one_2.apply(null,[clojure.first.ap
//======
//(defn- print-meta [o w] (when-let m (meta o) (when (and *print-meta* *print-readably* (pos? (count m))) (.write w "#^") (if (and (= (count m) 1) (:tag m)) (print-method (:tag m) w) (print-method m w)) (.write w " "))))
//---
-(function __clojure_fn_8026(){
-return (clojure.JS.def(clojure,"print_meta",(function __clojure_fn_8026_print_meta_8028(o_1,w_2){
-var and__196_5,and__196_5,and__196_6,m_4,temp__1438_3;
-return (((temp__1438_3=clojure.meta.apply(null,[o_1])),
-((temp__1438_3)?(((m_4=temp__1438_3),
+(function __clojure_fn_5833(){
+return (clojure.JS.def(clojure,"print_meta",(function __clojure_fn_5833_print_meta_5835(o_1,w_2){
+var and__196_5,m_4,and__196_5,temp__1432_3,and__196_6;
+return (((temp__1432_3=clojure.meta.apply(null,[o_1])),
+((temp__1432_3)?(((m_4=temp__1432_3),
((((and__196_5=clojure._STAR_print_meta_STAR_),
((and__196_5)?(((and__196_6=clojure._STAR_print_readably_STAR_),
((and__196_6)?(clojure.lang.Numbers.isPos(clojure.count.apply(null,[m_4]))):(and__196_6)))):(and__196_5))))?((w_2).write("#^"),
@@ -2874,120 +2868,120 @@ return (((temp__1438_3=clojure.meta.apply(null,[o_1])),
//======
//(defmethod print-method nil [o w] (.write w "nil"))
//---
-(function __clojure_fn_8038(){
-return ((clojure.print_method).addMethod(null,(function __clojure_fn_8038_fn_8040(o_1,w_2){
+(function __clojure_fn_5839(){
+return ((clojure.print_method).addMethod(null,(function __clojure_fn_5839_fn_5841(o_1,w_2){
return ((w_2).write("nil"))})))}).apply(null,[]);
//======
-//(defn print-ctor [o print-args w] (.write w "#=(") (.write w (RT/className (class o))) (.write w ". ") (print-args o w) (.write w ")"))
+//(defn print-ctor [o print-args w] (.write w "#=(") (.write w (.getName (class o))) (.write w ". ") (print-args o w) (.write w ")"))
//---
-(function __clojure_fn_8050(){
-return (clojure.JS.def(clojure,"print_ctor",(function __clojure_fn_8050_print_ctor_8052(o_1,print_args_2,w_3){
+(function __clojure_fn_5845(){
+return (clojure.JS.def(clojure,"print_ctor",(function __clojure_fn_5845_print_ctor_5847(o_1,print_args_2,w_3){
return ((w_3).write("#=("),
-(w_3).write(clojure.lang.RT.className(clojure.class_.apply(null,[o_1]))),
+(w_3).write((clojure.class_.apply(null,[o_1])).getName),
(w_3).write(". "),
print_args_2.apply(null,[o_1,w_3]),
(w_3).write(")"))})))}).apply(null,[]);
//======
-//(defmethod print-method :default [o w] (print-ctor o (fn* [p1__8056 p2__8057] (print-method (str p1__8056) p2__8057)) w))
+//(defmethod print-method :default [o w] (print-ctor o (fn* [p1__5851 p2__5852] (print-method (str p1__5851) p2__5852)) w))
//---
-(function __clojure_fn_8067(){
-return ((clojure.print_method).addMethod(clojure.keyword("","default"),(function __clojure_fn_8067_fn_8069(o_1,w_2){
-return (clojure.print_ctor.apply(null,[o_1,(function __clojure_fn_8067_fn_8069_fn_8071(p1__8056_1,p2__8057_2){
-return (clojure.print_method.apply(null,[clojure.str.apply(null,[p1__8056_1]),p2__8057_2]))}),w_2]))})))}).apply(null,[]);
+(function __clojure_fn_5853(){
+return ((clojure.print_method).addMethod(clojure.keyword("","default"),(function __clojure_fn_5853_fn_5855(o_1,w_2){
+return (clojure.print_ctor.apply(null,[o_1,(function __clojure_fn_5853_fn_5855_fn_5857(p1__5851_1,p2__5852_2){
+return (clojure.print_method.apply(null,[clojure.str.apply(null,[p1__5851_1]),p2__5852_2]))}),w_2]))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.Keyword [o w] (.write w (str o)))
//---
-(function __clojure_fn_8082(){
-return ((clojure.print_method).addMethod(clojure.lang.Keyword,(function __clojure_fn_8082_fn_8084(o_1,w_2){
+(function __clojure_fn_5862(){
+return ((clojure.print_method).addMethod(clojure.lang.Keyword,(function __clojure_fn_5862_fn_5864(o_1,w_2){
return ((w_2).write(clojure.str.apply(null,[o_1])))})))}).apply(null,[]);
//======
//(defmethod print-method Number [o w] (.write w (str o)))
//---
-(function __clojure_fn_8094(){
-return ((clojure.print_method).addMethod(java.lang.Number,(function __clojure_fn_8094_fn_8096(o_1,w_2){
+(function __clojure_fn_5868(){
+return ((clojure.print_method).addMethod(java.lang.Number,(function __clojure_fn_5868_fn_5870(o_1,w_2){
return ((w_2).write(clojure.str.apply(null,[o_1])))})))}).apply(null,[]);
//======
//(defmethod print-method Boolean [o w] (.write w (str o)))
//---
-(function __clojure_fn_8106(){
-return ((clojure.print_method).addMethod(java.lang.Boolean,(function __clojure_fn_8106_fn_8108(o_1,w_2){
+(function __clojure_fn_5874(){
+return ((clojure.print_method).addMethod(java.lang.Boolean,(function __clojure_fn_5874_fn_5876(o_1,w_2){
return ((w_2).write(clojure.str.apply(null,[o_1])))})))}).apply(null,[]);
//======
//(defn print-simple [o w] (print-meta o w) (.write w (str o)))
//---
-(function __clojure_fn_8118(){
-return (clojure.JS.def(clojure,"print_simple",(function __clojure_fn_8118_print_simple_8120(o_1,w_2){
+(function __clojure_fn_5880(){
+return (clojure.JS.def(clojure,"print_simple",(function __clojure_fn_5880_print_simple_5882(o_1,w_2){
return (clojure.print_meta.apply(null,[o_1,w_2]),
(w_2).write(clojure.str.apply(null,[o_1])))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.Symbol [o w] (print-simple o w))
//---
-(function __clojure_fn_8130(){
-return ((clojure.print_method).addMethod(clojure.lang.Symbol,(function __clojure_fn_8130_fn_8132(o_1,w_2){
+(function __clojure_fn_5886(){
+return ((clojure.print_method).addMethod(clojure.lang.Symbol,(function __clojure_fn_5886_fn_5888(o_1,w_2){
return (clojure.print_simple.apply(null,[o_1,w_2]))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.Var [o w] (print-simple o w))
//---
-(function __clojure_fn_8142(){
-return ((clojure.print_method).addMethod(clojure.lang.Var,(function __clojure_fn_8142_fn_8144(o_1,w_2){
+(function __clojure_fn_5892(){
+return ((clojure.print_method).addMethod(clojure.lang.Var,(function __clojure_fn_5892_fn_5894(o_1,w_2){
return (clojure.print_simple.apply(null,[o_1,w_2]))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.ISeq [o w] (print-meta o w) (print-sequential "(" print-method " " ")" o w))
//---
-(function __clojure_fn_8154(){
-return ((clojure.print_method).addMethod(clojure.lang.ISeq,(function __clojure_fn_8154_fn_8156(o_1,w_2){
+(function __clojure_fn_5898(){
+return ((clojure.print_method).addMethod(clojure.lang.ISeq,(function __clojure_fn_5898_fn_5900(o_1,w_2){
return (clojure.print_meta.apply(null,[o_1,w_2]),
clojure.print_sequential.apply(null,["(",clojure.print_method," ",")",o_1,w_2]))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.IPersistentList [o w] (print-meta o w) (print-sequential "(" print-method " " ")" o w))
//---
-(function __clojure_fn_8166(){
-return ((clojure.print_method).addMethod(clojure.lang.IPersistentList,(function __clojure_fn_8166_fn_8168(o_1,w_2){
+(function __clojure_fn_5904(){
+return ((clojure.print_method).addMethod(clojure.lang.IPersistentList,(function __clojure_fn_5904_fn_5906(o_1,w_2){
return (clojure.print_meta.apply(null,[o_1,w_2]),
clojure.print_sequential.apply(null,["(",clojure.print_method," ",")",o_1,w_2]))})))}).apply(null,[]);
//======
//(prefer-method print-method clojure.lang.IPersistentList clojure.lang.ISeq)
//---
-(function __clojure_fn_8175(){
+(function __clojure_fn_5910(){
return ((clojure.print_method).preferMethod(clojure.lang.IPersistentList,clojure.lang.ISeq))}).apply(null,[]);
//======
-//(defmethod print-method java.util.Collection [o w] (print-ctor o (fn* [p1__8178 p2__8179] (print-sequential "[" print-method " " "]" p1__8178 p2__8179)) w))
+//(defmethod print-method java.util.Collection [o w] (print-ctor o (fn* [p1__5913 p2__5914] (print-sequential "[" print-method " " "]" p1__5913 p2__5914)) w))
//---
-(function __clojure_fn_8189(){
-return ((clojure.print_method).addMethod(java.util.Collection,(function __clojure_fn_8189_fn_8191(o_1,w_2){
-return (clojure.print_ctor.apply(null,[o_1,(function __clojure_fn_8189_fn_8191_fn_8193(p1__8178_1,p2__8179_2){
-return (clojure.print_sequential.apply(null,["[",clojure.print_method," ","]",p1__8178_1,p2__8179_2]))}),w_2]))})))}).apply(null,[]);
+(function __clojure_fn_5915(){
+return ((clojure.print_method).addMethod(java.util.Collection,(function __clojure_fn_5915_fn_5917(o_1,w_2){
+return (clojure.print_ctor.apply(null,[o_1,(function __clojure_fn_5915_fn_5917_fn_5919(p1__5913_1,p2__5914_2){
+return (clojure.print_sequential.apply(null,["[",clojure.print_method," ","]",p1__5913_1,p2__5914_2]))}),w_2]))})))}).apply(null,[]);
//======
//(prefer-method print-method clojure.lang.IPersistentCollection java.util.Collection)
//---
-(function __clojure_fn_8201(){
+(function __clojure_fn_5924(){
return ((clojure.print_method).preferMethod(clojure.lang.IPersistentCollection,java.util.Collection))}).apply(null,[]);
//======
//(def char-escape-string {\" "\\\"", \backspace "\\b", \tab "\\t", \newline "\\n", \formfeed "\\f", \return "\\r", \\ "\\\\"})
//---
-(function __clojure_fn_8207(){
+(function __clojure_fn_5927(){
return (clojure.JS.def(clojure,"char_escape_string",clojure.hash_map("\"","\\\"","\b","\\b","\t","\\t","\n","\\n","\f","\\f","\r","\\r","\\","\\\\")))}).apply(null,[]);
//======
//(defmethod print-method String [s w] (if *print-readably* (do (.append w \") (dotimes n (count s) (let [c (.charAt s n) e (char-escape-string c)] (if e (.write w e) (.append w c)))) (.append w \")) (.write w s)) nil)
//---
-(function __clojure_fn_8216(){
-return ((clojure.print_method).addMethod(java.lang.String,(function __clojure_fn_8216_fn_8218(s_1,w_2){
-var c_5,n__814_3,e_6,n_4;
+(function __clojure_fn_5930(){
+return ((clojure.print_method).addMethod(java.lang.String,(function __clojure_fn_5930_fn_5932(s_1,w_2){
+var n__814_3,c_5,e_6,n_4;
return (((clojure._STAR_print_readably_STAR_)?((w_2).append("\""),
((n__814_3=clojure.lang.RT.intCast(clojure.count.apply(null,[s_1]))),
((function __loop(){var _rtn,_cnt;(n_4=clojure.lang.RT.intCast(0));do{_cnt=0;
@@ -3001,9 +2995,9 @@ null)})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.IPersistentVector [v w] (print-meta v w) (.append w \[) (dotimes n (count v) (print-method (nth v n) w) (when (< n (dec (count v))) (.append w \space))) (.append w \]) nil)
//---
-(function __clojure_fn_8228(){
-return ((clojure.print_method).addMethod(clojure.lang.IPersistentVector,(function __clojure_fn_8228_fn_8230(v_1,w_2){
-var n_4,n__814_3;
+(function __clojure_fn_5936(){
+return ((clojure.print_method).addMethod(clojure.lang.IPersistentVector,(function __clojure_fn_5936_fn_5938(v_1,w_2){
+var n__814_3,n_4;
return (clojure.print_meta.apply(null,[v_1,w_2]),
(w_2).append("["),
((n__814_3=clojure.lang.RT.intCast(clojure.count.apply(null,[v_1]))),
@@ -3017,58 +3011,58 @@ null)})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.IPersistentMap [m w] (print-meta m w) (print-sequential "{" (fn [e w] (do (print-method (key e) w) (.append w \space) (print-method (val e) w))) ", " "}" (seq m) w))
//---
-(function __clojure_fn_8243(){
-return ((clojure.print_method).addMethod(clojure.lang.IPersistentMap,(function __clojure_fn_8243_fn_8245(m_1,w_2){
+(function __clojure_fn_5942(){
+return ((clojure.print_method).addMethod(clojure.lang.IPersistentMap,(function __clojure_fn_5942_fn_5944(m_1,w_2){
return (clojure.print_meta.apply(null,[m_1,w_2]),
-clojure.print_sequential.apply(null,["{",(function __clojure_fn_8243_fn_8245_fn_8247(e_1,w_2){
+clojure.print_sequential.apply(null,["{",(function __clojure_fn_5942_fn_5944_fn_5946(e_1,w_2){
return (clojure.print_method.apply(null,[clojure.key.apply(null,[e_1]),w_2]),
(w_2).append(" "),
clojure.print_method.apply(null,[clojure.val.apply(null,[e_1]),w_2]))}),", ","}",clojure.seq.apply(null,[m_1]),w_2]))})))}).apply(null,[]);
//======
-//(defmethod print-method java.util.Map [m w] (print-ctor m (fn* [p1__8252 p2__8253] (print-sequential "{" (fn [e w] (do (print-method (key e) w) (.append w \space) (print-method (val e) w))) ", " "}" (seq p1__8252) p2__8253)) w))
+//(defmethod print-method java.util.Map [m w] (print-ctor m (fn* [p1__5951 p2__5952] (print-sequential "{" (fn [e w] (do (print-method (key e) w) (.append w \space) (print-method (val e) w))) ", " "}" (seq p1__5951) p2__5952)) w))
//---
-(function __clojure_fn_8266(){
-return ((clojure.print_method).addMethod(java.util.Map,(function __clojure_fn_8266_fn_8268(m_1,w_2){
-return (clojure.print_ctor.apply(null,[m_1,(function __clojure_fn_8266_fn_8268_fn_8270(p1__8252_1,p2__8253_2){
-return (clojure.print_sequential.apply(null,["{",(function __clojure_fn_8266_fn_8268_fn_8270_fn_8272(e_1,w_2){
+(function __clojure_fn_5953(){
+return ((clojure.print_method).addMethod(java.util.Map,(function __clojure_fn_5953_fn_5955(m_1,w_2){
+return (clojure.print_ctor.apply(null,[m_1,(function __clojure_fn_5953_fn_5955_fn_5957(p1__5951_1,p2__5952_2){
+return (clojure.print_sequential.apply(null,["{",(function __clojure_fn_5953_fn_5955_fn_5957_fn_5959(e_1,w_2){
return (clojure.print_method.apply(null,[clojure.key.apply(null,[e_1]),w_2]),
(w_2).append(" "),
-clojure.print_method.apply(null,[clojure.val.apply(null,[e_1]),w_2]))}),", ","}",clojure.seq.apply(null,[p1__8252_1]),p2__8253_2]))}),w_2]))})))}).apply(null,[]);
+clojure.print_method.apply(null,[clojure.val.apply(null,[e_1]),w_2]))}),", ","}",clojure.seq.apply(null,[p1__5951_1]),p2__5952_2]))}),w_2]))})))}).apply(null,[]);
//======
//(prefer-method print-method clojure.lang.IPersistentMap java.util.Map)
//---
-(function __clojure_fn_8281(){
+(function __clojure_fn_5965(){
return ((clojure.print_method).preferMethod(clojure.lang.IPersistentMap,java.util.Map))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.IPersistentSet [s w] (print-meta s w) (print-sequential "#{" print-method " " "}" (seq s) w))
//---
-(function __clojure_fn_8290(){
-return ((clojure.print_method).addMethod(clojure.lang.IPersistentSet,(function __clojure_fn_8290_fn_8292(s_1,w_2){
+(function __clojure_fn_5968(){
+return ((clojure.print_method).addMethod(clojure.lang.IPersistentSet,(function __clojure_fn_5968_fn_5970(s_1,w_2){
return (clojure.print_meta.apply(null,[s_1,w_2]),
clojure.print_sequential.apply(null,["#{",clojure.print_method," ","}",clojure.seq.apply(null,[s_1]),w_2]))})))}).apply(null,[]);
//======
-//(defmethod print-method java.util.Set [s w] (print-ctor s (fn* [p1__8296 p2__8297] (print-sequential "#{" print-method " " "}" (seq p1__8296) p2__8297)) w))
+//(defmethod print-method java.util.Set [s w] (print-ctor s (fn* [p1__5974 p2__5975] (print-sequential "#{" print-method " " "}" (seq p1__5974) p2__5975)) w))
//---
-(function __clojure_fn_8307(){
-return ((clojure.print_method).addMethod(java.util.Set,(function __clojure_fn_8307_fn_8309(s_1,w_2){
-return (clojure.print_ctor.apply(null,[s_1,(function __clojure_fn_8307_fn_8309_fn_8311(p1__8296_1,p2__8297_2){
-return (clojure.print_sequential.apply(null,["#{",clojure.print_method," ","}",clojure.seq.apply(null,[p1__8296_1]),p2__8297_2]))}),w_2]))})))}).apply(null,[]);
+(function __clojure_fn_5976(){
+return ((clojure.print_method).addMethod(java.util.Set,(function __clojure_fn_5976_fn_5978(s_1,w_2){
+return (clojure.print_ctor.apply(null,[s_1,(function __clojure_fn_5976_fn_5978_fn_5980(p1__5974_1,p2__5975_2){
+return (clojure.print_sequential.apply(null,["#{",clojure.print_method," ","}",clojure.seq.apply(null,[p1__5974_1]),p2__5975_2]))}),w_2]))})))}).apply(null,[]);
//======
//(def char-name-string {\space "space", \backspace "backspace", \tab "tab", \newline "newline", \formfeed "formfeed", \return "return"})
//---
-(function __clojure_fn_8319(){
+(function __clojure_fn_5985(){
return (clojure.JS.def(clojure,"char_name_string",clojure.hash_map(" ","space","\b","backspace","\t","tab","\n","newline","\f","formfeed","\r","return")))}).apply(null,[]);
//======
//(defmethod print-method java.lang.Character [c w] (if *print-readably* (do (.append w \\) (let [n (char-name-string c)] (if n (.write w n) (.append w c)))) (.append w c)) nil)
//---
-(function __clojure_fn_8328(){
-return ((clojure.print_method).addMethod(java.lang.Character,(function __clojure_fn_8328_fn_8330(c_1,w_2){
+(function __clojure_fn_5988(){
+return ((clojure.print_method).addMethod(java.lang.Character,(function __clojure_fn_5988_fn_5990(c_1,w_2){
var n_3;
return (((clojure._STAR_print_readably_STAR_)?((w_2).append("\\"),
((n_3=clojure.char_name_string.apply(null,[c_1])),
@@ -3076,34 +3070,56 @@ return (((clojure._STAR_print_readably_STAR_)?((w_2).append("\\"),
null)})))}).apply(null,[]);
//======
-//(defmethod print-method Class [c w] (.write w "#=") (.write w (RT/className c)))
+//(defmethod print-method Class [c w] (.write w "#=") (.write w (.getName c)))
//---
-(function __clojure_fn_8340(){
-return ((clojure.print_method).addMethod(java.lang.Class,(function __clojure_fn_8340_fn_8342(c_1,w_2){
+(function __clojure_fn_5994(){
+return ((clojure.print_method).addMethod(java.lang.Class,(function __clojure_fn_5994_fn_5996(c_1,w_2){
return ((w_2).write("#="),
-(w_2).write(clojure.lang.RT.className(c_1)))})))}).apply(null,[]);
+(w_2).write((c_1).getName()))})))}).apply(null,[]);
//======
//(defmethod print-method java.math.BigDecimal [b w] (.write w (str b)) (.write w "M"))
//---
-(function __clojure_fn_8352(){
-return ((clojure.print_method).addMethod(java.math.BigDecimal,(function __clojure_fn_8352_fn_8354(b_1,w_2){
+(function __clojure_fn_6000(){
+return ((clojure.print_method).addMethod(java.math.BigDecimal,(function __clojure_fn_6000_fn_6002(b_1,w_2){
return ((w_2).write(clojure.str.apply(null,[b_1])),
(w_2).write("M"))})))}).apply(null,[]);
//======
-//(defmethod print-method java.util.regex.Pattern [p w] (.append w \#) (print-method (str p) w))
-//---
-(function __clojure_fn_8364(){
-return ((clojure.print_method).addMethod(java.util.regex.Pattern,(function __clojure_fn_8364_fn_8366(p_1,w_2){
-return ((w_2).append("#"),
-clojure.print_method.apply(null,[clojure.str.apply(null,[p_1]),w_2]))})))}).apply(null,[]);
+//(defmethod print-method java.util.regex.Pattern [p w] (.write w "#\"") (loop [[c & r :as s] (seq (.pattern p)) qmode false] (when s (cond (= c \\) (let [[c2 & r2] r] (.append w \\) (.append w c2) (if qmode (recur r2 (not= c2 \E)) (recur r2 (= c2 \Q)))) (= c \") (do (if qmode (.write w "\\E\\\"\\Q") (.write w "\\\"")) (recur r qmode)) :else (do (.append w c) (recur r qmode))))) (.append w \"))
+//---
+(function __clojure_fn_6006(){
+return ((clojure.print_method).addMethod(java.util.regex.Pattern,(function __clojure_fn_6006_fn_6008(p_1,w_2){
+var c2_17,vec__6012_4,qmode_8,vec__6013_11,c_5,r_6,qmode_10,r_13,G__6011_9,s_7,qmode_15,r2_18,G__6011_3,c_12,vec__6014_16,s_14;
+return ((w_2).write("#\""),
+((G__6011_3=clojure.seq.apply(null,[(p_1).pattern()])),
+(vec__6012_4=G__6011_3),
+(c_5=clojure.nth.apply(null,[vec__6012_4,0,null])),
+(r_6=clojure.nthrest.apply(null,[vec__6012_4,1])),
+(s_7=vec__6012_4),
+(qmode_8=false),
+((function __loop(){var _rtn,_cnt;(G__6011_9=G__6011_3),
+(qmode_10=qmode_8);do{_cnt=0;
+_rtn=((vec__6013_11=G__6011_9),
+(c_12=clojure.nth.apply(null,[vec__6013_11,0,null])),
+(r_13=clojure.nthrest.apply(null,[vec__6013_11,1])),
+(s_14=vec__6013_11),
+(qmode_15=qmode_10),
+((s_14)?(((clojure.lang.Util.equal(c_12,"\\"))?(((vec__6014_16=r_13),
+(c2_17=clojure.nth.apply(null,[vec__6014_16,0,null])),
+(r2_18=clojure.nthrest.apply(null,[vec__6014_16,1])),
+(w_2).append("\\"),
+(w_2).append(c2_17),
+((qmode_15)?((_cnt=1,_rtn=[r2_18,clojure.not_EQ_.apply(null,[c2_17,"E"])],G__6011_9=_rtn[0],qmode_10=_rtn[1])):((_cnt=1,_rtn=[r2_18,clojure.lang.Util.equal(c2_17,"Q")],G__6011_9=_rtn[0],qmode_10=_rtn[1]))))):(((clojure.lang.Util.equal(c_12,"\""))?(((qmode_15)?((w_2).write("\\E\\\"\\Q")):((w_2).write("\\\""))),
+(_cnt=1,_rtn=[r_13,qmode_15],G__6011_9=_rtn[0],qmode_10=_rtn[1])):(((clojure.keyword("","else"))?((w_2).append(c_12),
+(_cnt=1,_rtn=[r_13,qmode_15],G__6011_9=_rtn[0],qmode_10=_rtn[1])):(null))))))):(null)))}while(_cnt);return _rtn;})())),
+(w_2).append("\""))})))}).apply(null,[]);
//======
//(defmethod print-method clojure.lang.Namespace [n w] (.write w "#=(find-ns ") (print-method (.name n) w) (.write w ")"))
//---
-(function __clojure_fn_8376(){
-return ((clojure.print_method).addMethod(clojure.lang.Namespace,(function __clojure_fn_8376_fn_8378(n_1,w_2){
+(function __clojure_fn_6017(){
+return ((clojure.print_method).addMethod(clojure.lang.Namespace,(function __clojure_fn_6017_fn_6019(n_1,w_2){
return ((w_2).write("#=(find-ns "),
clojure.print_method.apply(null,[(n_1).name,w_2]),
(w_2).write(")"))})))}).apply(null,[]);
@@ -3111,6 +3127,6 @@ clojure.print_method.apply(null,[(n_1).name,w_2]),
//======
//(def print-initialized true)
//---
-(function __clojure_fn_8385(){
+(function __clojure_fn_6023(){
return (clojure.JS.def(clojure,"print_initialized",true))}).apply(null,[]);
-// Skipping: (defmacro declare "defs the supplied var names with no bindings, useful for making forward declarations." [& names] (clojure/concat (clojure/list (quote do)) (map (fn* [p1__8388] (list (quote def) p1__8388)) names)))
+// Skipping: (defmacro declare "defs the supplied var names with no bindings, useful for making forward declarations." [& names] (clojure/concat (clojure/list (quote do)) (map (fn* [p1__6026] (list (quote def) p1__6026)) names)))
diff --git a/clojurescript/clj.js b/clojurescript/clj.js
index b5c1a84e..79f3721e 100644
--- a/clojurescript/clj.js
+++ b/clojurescript/clj.js
@@ -644,6 +644,11 @@ clojure.JS.defclass( clojure.lang, "Var", {
this.push( val );
},
hasRoot: function() { return this.stack.length > 0; },
+ toString: function() {
+ if( this.ns !== null )
+ return "#=(var " + this.ns.name + "/" + this.name + ")";
+ return "#<Var: " + (this.name !== null ? this.name : "--unnamed--") + ">";
+ },
hashCode: function() {
return clojure.lang.Util.hash( this.ns + "/" + this.name );
}
@@ -1926,6 +1931,8 @@ clojure.lang.Namespace.prototype.hashCode = function() {
return clojure.hash( this.name );
};
+clojure.in_ns("'user");
+
(function() {
var buf = [];
function write(s) {
diff --git a/clojurescript/test.html b/clojurescript/test.html
index bc3c2a31..92cd1f32 100644
--- a/clojurescript/test.html
+++ b/clojurescript/test.html
@@ -1,7 +1,12 @@
<html>
<body>
- <textarea rows="24" cols="80" id="ta"></textarea>
- <form onsubmit="run(); return false" id="f">
+ <textarea rows="24" cols="80" id="ta"></textarea><br />
+ <span style="font-family: monospace">user=&gt;</span>
+ <textarea id="text" rows="6" cols="80"
+ style="vertical-align: top"></textarea>
+ <div id="status"></div>
+ <!--
+ <form onsubmit="jsrepl.runtest(); return false">
<select id="t">
<option>t01.js</option>
<option>t02.js</option>
@@ -12,16 +17,46 @@
</select>
<input type="submit" value="Run test" />
</form>
+ -->
<script type="text/javascript">
- var ta = document.getElementById( 'ta' );
- function print( x ) { ta.value += x + "\n"; }
- var f = document.getElementById( 'f' );
- var t = document.getElementById( 't' );
- function run() {
- var s = document.createElement('script');
- s.src = t.value;
- document.body.appendChild( s );
- }
+ jsrepl = {
+ ta: document.getElementById( 'ta' ),
+ t: document.getElementById( 't' ),
+ text: document.getElementById( 'text' ),
+ status: document.getElementById( 'status' ),
+ runtest: function() {
+ var s = document.createElement('script');
+ s.src = jsrepl.t.value;
+ document.body.appendChild( s );
+ },
+ posttext: function() {
+ print( "user=> " + jsrepl.text.value.replace("\n","\n "));
+ jsrepl.text.value = "";
+ },
+ state: function(s,m) {
+ jsrepl.status.innerHTML = s;
+ switch( s ) {
+ case 'error':
+ jsrepl.posttext();
+ print( m );
+ break;
+ case 'compiled':
+ jsrepl.posttext();
+ break;
+ }
+ jsrepl.ta.scrollTop = jsrepl.ta.scrollHeight;
+ }
+ };
+ jsrepl.text.onkeypress = function(e) {
+ e = e || event;
+ if( e.keyCode == 13 ) {
+ var s = document.createElement('script');
+ s.src = "http://localhost:8081/" +
+ escape(jsrepl.text.value).replace(/\+/,'%2b');
+ document.body.appendChild( s );
+ }
+ };
+ function print( x ) { jsrepl.ta.value += x + "\n"; }
</script>
<script type="text/javascript" src="clj.js"></script>
<script type="text/javascript" src="boot.js"></script>
diff --git a/clojurescript/tojs.clj b/clojurescript/tojs.clj
index 029beadc..4a8bc2dd 100644
--- a/clojurescript/tojs.clj
+++ b/clojurescript/tojs.clj
@@ -354,6 +354,7 @@
;(println (formtojs '(binding [*out* 5] (set! *out* 10))))
(println (formtojs '(.replace "a/b/c" "/" ".")))
+ (println (formtojs '(.getName ":foo")))
(println (formtojs '(list '(1 "str" 'sym :key) 4 "str2" 6 #{:set 9 8})))
(println (formtojs '(fn forever[] (forever))))
(println (formtojs '(fn forever[] (loop [] (recur))))))
@@ -361,21 +362,29 @@
(defn serve [port]
(loop [server (java.net.ServerSocket. port)]
(with-open socket (.accept server)
- (binding [*out* (-> socket .getOutputStream ds/writer)]
+ (binding [*debug-fn-names* false
+ *debug-comments* false
+ *out* (-> socket .getOutputStream ds/writer)]
(try
(print "HTTP/1.0 200 OK\nContent-Type: text/javascript\n\n")
(let [line1 (-> socket .getInputStream ds/reader .readLine)
[_ url] (re-find #"^GET /(.*?) HTTP" line1)
- codestr (str "(prn " (URLDecoder/decode url) ")")]
- (filetojs (StringReader. codestr)))
- (catch Exception e
- (println "clojure.prn(\"")
- (.printStackTrace e (PrintWriter. *out*))
- (println "\");")))))
+ codestr (str "(prn " (URLDecoder/decode url) ")")
+ js (with-out-str (filetojs (StringReader. codestr)))]
+ (println "jsrepl.state('compiled');")
+ (println js)
+ (println "jsrepl.state('done');"))
+ (catch Exception e
+ (if (= (.getMessage e) "EOF while reading")
+ (println "jsrepl.state('incomplete');")
+ (let [trace (with-out-str
+ (.printStackTrace e (PrintWriter. *out*)))]
+ (println "jsrepl.state('error',\""
+ (.replace trace "\n" "\\n") "\");")))))))
(recur server)))
;(simple-tests)
-;(serve 8080)
+;(serve 8081)
(filetojs (first *command-line-args*))