diff options
Diffstat (limited to 'clojurescript/src')
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript.clj | 357 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/cli.clj | 95 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/core.js | 3525 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/blank.gif | bin | 0 -> 48 bytes | |||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/clojure-logo-anim-03.gif | bin | 0 -> 4919 bytes | |||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/dots.png | bin | 0 -> 437 bytes | |||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/repl.cljs | 91 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/repl.html | 60 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/repl/repl.js | 89 | ||||
| -rw-r--r-- | clojurescript/src/clojure/contrib/clojurescript/rt.js | 2057 |
10 files changed, 6274 insertions, 0 deletions
diff --git a/clojurescript/src/clojure/contrib/clojurescript.clj b/clojurescript/src/clojure/contrib/clojurescript.clj new file mode 100644 index 00000000..66e7eac3 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript.clj @@ -0,0 +1,357 @@ +; Copyright (c) Chris Houser, Sep 2008-Jan 2009. All rights reserved. +; The use and distribution terms for this software are covered by the +; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) +; which can be found in the file epl-v10.html at the root of this distribution. +; By using this software in any fashion, you are agreeing to be bound by +; the terms of this license. +; You must not remove this notice, or any other, from this software. + +; Reads Clojure code and emits equivalent JavaScript + +(ns clojure.contrib.clojurescript + (:import (clojure.lang Compiler Compiler$C Compiler$BodyExpr + Compiler$DefExpr Compiler$InstanceMethodExpr)) + (:require [clojure.contrib.duck-streams :as ds])) + +(defn- vstr [v] + (let [sb (StringBuilder.) + lvl (fn lvl [v] + (doseq [i v] + (if (vector? i) + (lvl i) + (.append sb (str i)))))] + (lvl v) + (str sb))) + +(def *debug-fn-names* true) +(def *debug-comments* true) +(def *eval-defmacro* true) + +; used internally +(def *has-recur*) +(def *local-names* {}) + +(defmulti #^{:private true} tojs (fn [e ctx] (class e))) + +(defn- fnmethod [fm maxm ctx] + (let [lm (into {} (for [[lb lb] (.locals fm)] + [lb (str (.name lb) "_" (.idx lb))])) + thisfn (first (filter #(= 0 (.idx %)) (keys lm))) + [body has-recur] (binding [*has-recur* false] + [(tojs (.body fm) + (merge-with merge ctx {:localmap lm})) + *has-recur*]) + mparm (into {} (for [p (.reqParms maxm)] [(.idx p) p])) + inits (concat + (when has-recur ["_cnt" "_rtn"]) + (vals (reduce dissoc lm + (conj (.reqParms fm) thisfn (.restParm fm)))) + (when (:fnname ctx) [(str (lm thisfn) "=arguments.callee")]) + (when (not= fm maxm) + (for [lb (.reqParms fm) + :when (not= (.name lb) (.name (mparm (.idx lb))))] + [(lm lb) "=arguments[" (dec (.idx lb)) "]"])) + (when-let [lb (.restParm fm)] + [(str (lm lb) "=clojure.JS.rest_args(this,arguments," + (count (.reqParms fm)) ")")]))] + (.reqParms maxm) + (vstr [(when (seq inits) + [(apply vector "var " (interpose "," inits)) ";\n"]) + (if has-recur + ["do{_cnt=0;_rtn=" + body + "\n}while(_cnt);return _rtn;"] + ["return (" body ")"])]))) + +(defmethod tojs clojure.lang.Compiler$FnExpr [e ctx] + (let [maxm (or (.variadicMethod e) + (-> (into (sorted-map) + (for [fm (.methods e) + :when (not= fm (.variadicMethod e))] + [(count (.reqParms fm)) fm])) + last val)) + manym (< 1 (count (.methods e))) + newctx (assoc ctx :fnname (.thisName e)) + [methods local-names] (binding [*local-names* *local-names*] + [(into {} (for [fm (.methods e)] + [fm (fnmethod fm maxm newctx)])) + *local-names*])] + (vstr [(when (.variadicMethod e) + ["clojure.JS.variadic(" (count (.reqParms maxm)) ","]) + "(function" + (when *debug-fn-names* + [" __" (.replaceAll (.name e) "[\\W_]+" "_")]) + "(" + (vec (interpose "," (for [lb (.reqParms maxm)] + [(.name lb) "_" (.idx lb)]))) + "){" + ;"\n//" (vec (interpose "," (vals local-names))) "\n" + (when manym + ["switch(arguments.length){" + (vec (for [[fm body] methods :when (not= fm maxm)] + ["\ncase " (count (.reqParms fm)) ":" body])) + "}"]) + "\n" + (methods maxm) "})" + (when (.variadicMethod e) + ")") + ]))) + +(defmethod tojs clojure.lang.Compiler$BodyExpr [e ctx] + (apply str (interpose ",\n" (map #(tojs % ctx) (.exprs e))))) + +(defmethod tojs clojure.lang.Compiler$LetExpr [e ctx] + (let [inits (vec (interpose ",\n" (for [bi (.bindingInits e)] + ["(" ((:localmap ctx) (.binding bi)) + "=" (tojs (.init bi) ctx) ")"])))] + (if (.isLoop e) + (binding [*has-recur* false] + (vstr ["((function" + (when *debug-fn-names* " __loop") + "(){var _rtn,_cnt;" + inits ";" + "do{_cnt=0;\n_rtn=" (tojs (.body e) ctx) + "}while(_cnt);return _rtn;})())"])) + (vstr ["(" inits ",\n" (tojs (.body e) ctx) ")"])))) + +(defmethod tojs clojure.lang.Compiler$VectorExpr [e ctx] + (vstr ["clojure.JS.lit_vector([" + (vec (interpose "," (map #(tojs % ctx) (.args e)))) + "])"])) + +(defn- const-str [c] + (cond + (or (instance? Character c) + (string? c)) (pr-str (str c)) + (keyword? c) (str "clojure.core.keyword(\"" (namespace c) "\",\"" (name c) "\")") + (symbol? c) (str "clojure.core.symbol(\"" c "\")") + (class? c) (.getCanonicalName c) + (list? c) (vstr ["clojure.JS.lit_list([" + (vec (interpose "," (map const-str c))) + "])"]) + (fn? c) (str \" c \") + (instance? java.util.regex.Pattern c) (str "(/" + (.replace (str c) "/" "\\/") + "/)") + :else (str "(" c ")"))) + +(defmethod tojs clojure.lang.Compiler$ConstantExpr [e ctx] + (const-str (.v e))) + +(def js-reserved '#{import boolean short byte char class}) + +(defn- var-munge [x] + (let [n (-> x str Compiler/munge (.replace "." "_DOT_"))] + (if (js-reserved (symbol n)) + (str n "_") + n))) + +(defn- var-parts [e] + (let [{:keys [name ns]} ^(.var e)] + [(Compiler/munge (str (.getName ns))) (var-munge name)])) + +(defmethod tojs clojure.lang.Compiler$UnresolvedVarExpr [e ctx] + (vstr ["clojure.JS.resolveVar(\"" + (var-munge (name (.symbol e))) "\"," + (Compiler/munge (name (.name *ns*))) ")"])) + +(defmethod tojs clojure.lang.Compiler$VarExpr [e ctx] + (let [[vns vname] (var-parts e)] + (if (and (= vns "clojurescript.js") (#{"this"} vname)) + vname + (str vns "." vname)))) + +(defmethod tojs clojure.lang.Compiler$TheVarExpr [e ctx] + (let [[vns vname] (var-parts e)] + (str vns "._var_" vname))) + +(defmethod tojs clojure.lang.Compiler$AssignExpr [e ctx] + (let [target (.target e)] + (if (instance? clojure.lang.Compiler$InstanceFieldExpr target) + (vstr ["(" (tojs (.target target) ctx) "." + (var-munge (.fieldName target)) "=" (tojs (.val e) ctx) ")"]) + (let [[vns vname] (var-parts target)] + (str vns "._var_" vname ".set(" (tojs (.val e) ctx) ")"))))) + +(defmethod tojs clojure.lang.Compiler$DefExpr [e ctx] + (let [[vns vname] (var-parts e)] + (str "clojure.JS.def(" vns ",\"" vname "\"," (tojs (.init e) ctx) ")"))) + + +(defmethod tojs clojure.lang.Compiler$InvokeExpr [e ctx] + (vstr [(tojs (.fexpr e) ctx) + ".apply(null,[" + (vec (interpose "," (map #(tojs % ctx) (.args e)))) + "])"])) + +(defmethod tojs clojure.lang.Compiler$LocalBindingExpr [e ctx] + (let [local-name ((:localmap ctx) (.b e))] + (set! *local-names* (assoc *local-names* (.b e) local-name)) + local-name)) + +(defmethod tojs clojure.lang.Compiler$NilExpr [e ctx] + "null") + +(defmethod tojs clojure.lang.Compiler$EmptyExpr [e ctx] + (str (.getCanonicalName (class (.coll e))) ".EMPTY")) + +(defmethod tojs clojure.lang.Compiler$StringExpr [e ctx] + (const-str (.str e))) + +(defmethod tojs clojure.lang.Compiler$KeywordExpr [e ctx] + (const-str (.k e))) + +(defmethod tojs clojure.lang.Compiler$StaticFieldExpr [e ctx] + (str "clojure.JS.getOrRun(" (.getCanonicalName (.c e)) ",\"" + (var-munge (.fieldName e)) "\")")) + +(defmethod tojs clojure.lang.Compiler$StaticMethodExpr [e ctx] + (vstr [(.getCanonicalName (.c e)) "." (.methodName e) "(" + (vec (interpose "," (map #(tojs % ctx) (.args e)))) + ")"])) + +(defmethod tojs clojure.lang.Compiler$NewExpr [e ctx] + (vstr ["(new " (.getCanonicalName (.c e)) "(" + (vec (interpose "," (map #(tojs % ctx) (.args e)))) + "))"])) + +(defmethod tojs clojure.lang.Compiler$InstanceMethodExpr [e ctx] + (vstr ["(" (tojs (.target e) ctx) ")." (var-munge (.methodName e)) + "(" (vec (interpose "," (map #(tojs % ctx) (.args e)))) ")"])) + +(defmethod tojs clojure.lang.Compiler$InstanceFieldExpr [e ctx] + (vstr ["clojure.JS.getOrRun(" (tojs (.target e) ctx) ",\"" + (var-munge (.fieldName e)) "\")"])) + +(defmethod tojs clojure.lang.Compiler$IfExpr [e ctx] + (str "((" (tojs (.testExpr e) ctx) + ")?(" (tojs (.thenExpr e) ctx) + "):(" (tojs (.elseExpr e) ctx) "))")) + +(defmethod tojs clojure.lang.Compiler$RecurExpr [e ctx] + (set! *has-recur* true) + (vstr ["(_cnt=1,_rtn=[" + (vec (interpose "," (map #(tojs % ctx) (.args e)))) + "]" + (vec (map #(str "," ((:localmap ctx) %1) "=_rtn[" %2 "]") + (.loopLocals e) (iterate inc 0))) + ")"])) + +(defmethod tojs clojure.lang.Compiler$MapExpr [e ctx] + (vstr ["clojure.core.hash_map(" + (vec (interpose "," (map #(tojs % ctx) (.keyvals e)))) + ")"])) + +(defmethod tojs clojure.lang.Compiler$SetExpr [e ctx] + (vstr ["clojure.core.hash_set(" + (vec (interpose "," (map #(tojs % ctx) (.keys e)))) + ")"])) + +(defmethod tojs clojure.lang.Compiler$BooleanExpr [e ctx] + (if (.val e) "true" "false")) + +(defmethod tojs clojure.lang.Compiler$ThrowExpr [e ctx] + (vstr ["(function" + (when *debug-fn-names* " __throw") + "(){throw " (tojs (.excExpr e) ctx) "})()"])) + +(defmethod tojs clojure.lang.Compiler$TryExpr [e ctx] + (vstr ["(function" + (when *debug-fn-names* " __try") + "(){try{var _rtn=(" + (tojs (.tryExpr e) ctx) + ")}" + (when (seq (.catchExprs e)) + (when (not= 1 (count (.catchExprs e))) + (throw (Exception. "tojs only supports one catch clause per try"))) + (let [cc (first (.catchExprs e))] + ["\ncatch(" ((:localmap ctx) (.lb cc)) "){_rtn=" + (tojs (.handler cc) ctx) + "}"])) + (when (.finallyExpr e) + ["\nfinally{" + (tojs (.finallyExpr e) ctx) + "}"]) + "return _rtn})()"])) + + +(defmulti toclj class) +(defmethod toclj clojure.lang.Compiler$KeywordExpr [e] (.k e)) +(defmethod toclj clojure.lang.Compiler$StringExpr [e] (.str e)) +(defmethod toclj clojure.lang.Compiler$ConstantExpr [e] (.v e)) + + +(def skip-def '#{;-- implemented directly in clj.js + seq instance? assoc apply refer first rest import + hash-map count find keys vals get class contains? + print-method class? number? string? integer? nth + to-array cons keyword symbol load + ;-- not supported yet + make-array to-array-2d re-pattern re-matcher re-groups + re-seq re-matches re-find format + ;-- macros defined without using defmacro + let loop fn defn defmacro + ;-- will probably never be supported in clojurescript + eval resolve ns-resolve await await-for macroexpand + macroexpand-1 load-reader load-string special-symbol? + bigint bigdec floats doubles ints longs float-array + double-array int-array long-array aset-int + aset-long aset-boolean aset-float aset-double + aset-short aset-char aset-byte slurp seque + decimal? float? pmap primitives-classnames}) + +(def skip-method #{"java.lang.Class"}) + +(defn formtojs [f] + (when-not (and (coll? f) (= 'definline (first f))) + (binding [*allow-unresolved-vars* true + *private-compiler-loader* (clojure.lang.RT/makeClassLoader)] + (let [expr (Compiler/analyze Compiler$C/STATEMENT `((fn [] ~f))) + mainexpr (-> expr .fexpr .methods first .body .exprs first) + defmacro? (and (instance? Compiler$BodyExpr mainexpr) + (instance? Compiler$DefExpr (first (.exprs mainexpr))) + (instance? Compiler$InstanceMethodExpr (second (.exprs mainexpr))) + (= "setMacro" (.methodName (second (.exprs mainexpr)))))] + (if defmacro? + (when *eval-defmacro* + (eval f) + nil) + (when-not (or (and (instance? Compiler$DefExpr mainexpr) + (skip-def (:name ^(.var mainexpr)))) + (and (instance? Compiler$InstanceMethodExpr mainexpr) + (or (= "setMacro" (.methodName mainexpr)) + (and (= "addMethod" (.methodName mainexpr)) + (skip-method (tojs (first (.args mainexpr)) + nil))))) + (and (instance? Compiler$BodyExpr mainexpr) + (instance? Compiler$DefExpr (first (.exprs mainexpr))) + (instance? Compiler$InstanceMethodExpr (second (.exprs mainexpr))) + (= "setMacro" (.methodName (second (.exprs mainexpr)))))) + (tojs expr {:localmap {}}))))))) + +(defn filetojs [filename & optseq] + (let [reader (java.io.PushbackReader. (ds/reader filename)) + opts (apply array-map optseq)] + (binding [*ns* (create-ns 'user) + *debug-fn-names* (:debug-fn-names opts true) + *debug-comments* (:debug-comments opts true) + *eval-defmacro* (:eval-defmacro opts true)] + (loop [] + (let [f (read reader false reader false)] + (when-not (identical? f reader) + (if-let [js (formtojs f)] + (do + (when *debug-comments* + (println "\n//======") + (print "//") + (prn f) + (println "//---")) + (println (str js ";")) + (when (and (coll? f) + (or (= 'ns (first f)) + (= 'in-ns (first f)))) + (eval f))) + (when *debug-comments* + (print "// Skipping: ") + (prn f))) + (recur))))))) diff --git a/clojurescript/src/clojure/contrib/clojurescript/cli.clj b/clojurescript/src/clojure/contrib/clojurescript/cli.clj new file mode 100644 index 00000000..da823b75 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/cli.clj @@ -0,0 +1,95 @@ +; Copyright (c) Chris Houser, Sep 2008-Jan 2009. All rights reserved. +; The use and distribution terms for this software are covered by the +; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) +; which can be found in the file epl-v10.html at the root of this distribution. +; By using this software in any fashion, you are agreeing to be bound by +; the terms of this license. +; You must not remove this notice, or any other, from this software. + +; Command Line Interface for generating JavaScript from Clojure code. + +(ns clojure.contrib.clojurescript.cli + (:import (java.io PrintWriter StringReader) + (java.net URLDecoder)) + (:use [clojure.contrib.command-line :only (with-command-line)] + [clojure.contrib.clojurescript :only (formtojs filetojs)]) + (:require [clojure.contrib.duck-streams :as ds])) + +(defn start-server [port] + ;(println "Opening port" port) + (loop [server (java.net.ServerSocket. port)] ; TODO bind only to 127.0.0.1 + (send-off (agent (.accept server)) + (fn [socket] + (with-open [socket socket] + (binding [*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 (URLDecoder/decode url) + js (with-out-str (filetojs (StringReader. codestr) + :debug-fn-names false + :debug-comments false + :eval-defmacro false))] + (println "jsrepl.state('compiled');try{") + (println "jsrepl.lastval=" js ) + (println "jsrepl.state('done');}catch(e){jsrepl.err(e)};")) + (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))) + +(defn mkcore [] + (binding [*out* (ds/writer "core.js")] + (doseq [file ["clojure/core.clj" "clojure/core_print.clj"]] + (filetojs (.getResourceAsStream (clojure.lang.RT/baseLoader) file))))) + +(defn simple-tests [] + (println (formtojs + '(defn foo + ([a b c & d] (prn 3 a b c)) + ([c] + ;(String/asd "hello") + ;(.foo 55) + (let [[a b] [1 2]] + (prn a b c) + "hi"))))) + + (println (formtojs + '(defn foo [a] + (prn "hi") + (let [a 5] + (let [a 10] + (prn "yo") + (prn a)) + (prn a)) + (prn a)))) + + (println (formtojs + '(defn x [] (conj [] (loop [i 5] (if (pos? i) (recur (- i 2)) i)))))) + + ;(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)))))) + +(when-not *compile-files* + (with-command-line *command-line-args* + "clojurescript.cli -- Compile ClojureScript to JavaScript" + [[simple? "Runs some simple built-in tests"] + [serve "Starts a repl server on the given port" 8081] + [mkcore? "Generates a core.js file"] + [v? "Includes extra fn names and comments in js"] + filenames] + (cond + simple? (simple-tests) + serve (start-server (Integer/parseInt serve)) + mkcore? (mkcore) + :else (doseq [filename filenames] + (filetojs filename :debug-fn-names v? :debug-comments v?))))) diff --git a/clojurescript/src/clojure/contrib/clojurescript/core.js b/clojurescript/src/clojure/contrib/clojurescript/core.js new file mode 100644 index 00000000..7726b43f --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/core.js @@ -0,0 +1,3525 @@ + +//====== +//(ns clojure.core) +//--- +(function __user_fn_538(){ +return (clojure.core.in_ns.apply(null,[clojure.core.symbol("clojure.core")]))}).apply(null,[]); + +//====== +//(def unquote) +//--- +(function __clojure_core_fn_544(){ +return (clojure.JS.def(clojure.core,"unquote",null))}).apply(null,[]); + +//====== +//(def list (. clojure.lang.PersistentList creator)) +//--- +(function __clojure_core_fn_547(){ +return (clojure.JS.def(clojure.core,"list",clojure.JS.getOrRun(clojure.lang.PersistentList,"creator")))}).apply(null,[]); +// Skipping: (def cons (fn* cons [x seq] (. clojure.lang.RT (cons x seq)))) +// Skipping: (def let (fn* let [& decl] (cons (quote let*) decl))) +// Skipping: (def loop (fn* loop [& decl] (cons (quote loop*) decl))) +// Skipping: (def fn (fn* fn [& decl] (cons (quote fn*) decl))) +// Skipping: (def first (fn first [coll] (. clojure.lang.RT (first coll)))) +// Skipping: (def rest (fn rest [x] (. clojure.lang.RT (rest x)))) + +//====== +//(def conj (fn conj ([coll x] (. clojure.lang.RT (conj coll x))) ([coll x & xs] (if xs (recur (conj coll x) (first xs) (rest xs)) (conj coll x))))) +//--- +(function __clojure_core_fn_580(){ +return (clojure.JS.def(clojure.core,"conj",clojure.JS.variadic(2,(function __clojure_core_fn_580_conj_582(coll_1,x_2){switch(arguments.length){ +case 2:var conj_0=arguments.callee; +return (clojure.lang.RT.conj(coll_1,x_2))} +var _cnt,_rtn,conj_0=arguments.callee,xs_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((xs_3)?((_cnt=1,_rtn=[conj_0.apply(null,[coll_1,x_2]),clojure.core.first.apply(null,[xs_3]),clojure.core.rest.apply(null,[xs_3])],coll_1=_rtn[0],x_2=_rtn[1],xs_3=_rtn[2])):(conj_0.apply(null,[coll_1,x_2]))) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(def second (fn second [x] (first (rest x)))) +//--- +(function __clojure_core_fn_585(){ +return (clojure.JS.def(clojure.core,"second",(function __clojure_core_fn_585_second_587(x_1){ +var second_0=arguments.callee; +return (clojure.core.first.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); + +//====== +//(def ffirst (fn ffirst [x] (first (first x)))) +//--- +(function __clojure_core_fn_590(){ +return (clojure.JS.def(clojure.core,"ffirst",(function __clojure_core_fn_590_ffirst_592(x_1){ +var ffirst_0=arguments.callee; +return (clojure.core.first.apply(null,[clojure.core.first.apply(null,[x_1])]))})))}).apply(null,[]); + +//====== +//(def rfirst (fn rfirst [x] (rest (first x)))) +//--- +(function __clojure_core_fn_595(){ +return (clojure.JS.def(clojure.core,"rfirst",(function __clojure_core_fn_595_rfirst_597(x_1){ +var rfirst_0=arguments.callee; +return (clojure.core.rest.apply(null,[clojure.core.first.apply(null,[x_1])]))})))}).apply(null,[]); + +//====== +//(def frest (fn frest [x] (first (rest x)))) +//--- +(function __clojure_core_fn_600(){ +return (clojure.JS.def(clojure.core,"frest",(function __clojure_core_fn_600_frest_602(x_1){ +var frest_0=arguments.callee; +return (clojure.core.first.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); + +//====== +//(def rrest (fn rrest [x] (rest (rest x)))) +//--- +(function __clojure_core_fn_605(){ +return (clojure.JS.def(clojure.core,"rrest",(function __clojure_core_fn_605_rrest_607(x_1){ +var rrest_0=arguments.callee; +return (clojure.core.rest.apply(null,[clojure.core.rest.apply(null,[x_1])]))})))}).apply(null,[]); +// Skipping: (def seq (fn seq [coll] (. clojure.lang.RT (seq coll)))) +// Skipping: (def instance? (fn instance? [c x] (. c (isInstance x)))) + +//====== +//(def seq? (fn seq? [x] (instance? clojure.lang.ISeq x))) +//--- +(function __clojure_core_fn_620(){ +return (clojure.JS.def(clojure.core,"seq_QMARK_",(function __clojure_core_fn_620_seq_QMARK_622(x_1){ +var seq_QMARK__0=arguments.callee; +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.ISeq,x_1]))})))}).apply(null,[]); +// Skipping: (def string? (fn string? [x] (instance? String x))) + +//====== +//(def map? (fn map? [x] (instance? clojure.lang.IPersistentMap x))) +//--- +(function __clojure_core_fn_630(){ +return (clojure.JS.def(clojure.core,"map_QMARK_",(function __clojure_core_fn_630_map_QMARK_632(x_1){ +var map_QMARK__0=arguments.callee; +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.IPersistentMap,x_1]))})))}).apply(null,[]); + +//====== +//(def vector? (fn vector? [x] (instance? clojure.lang.IPersistentVector x))) +//--- +(function __clojure_core_fn_635(){ +return (clojure.JS.def(clojure.core,"vector_QMARK_",(function __clojure_core_fn_635_vector_QMARK_637(x_1){ +var vector_QMARK__0=arguments.callee; +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.IPersistentVector,x_1]))})))}).apply(null,[]); + +//====== +//(def sigs (fn [fdecl] (if (seq? (first fdecl)) (loop [ret [] fdecl fdecl] (if fdecl (recur (conj ret (first (first fdecl))) (rest fdecl)) (seq ret))) (list (first fdecl))))) +//--- +(function __clojure_core_fn_640(){ +return (clojure.JS.def(clojure.core,"sigs",(function __clojure_core_fn_640_sigs_642(fdecl_1){ +var ret_2,fdecl_3; +return (((clojure.core.seq_QMARK_.apply(null,[clojure.core.first.apply(null,[fdecl_1])]))?(((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY), +(fdecl_3=fdecl_1);do{_cnt=0; +_rtn=((fdecl_3)?((_cnt=1,_rtn=[clojure.core.conj.apply(null,[ret_2,clojure.core.first.apply(null,[clojure.core.first.apply(null,[fdecl_3])])]),clojure.core.rest.apply(null,[fdecl_3])],ret_2=_rtn[0],fdecl_3=_rtn[1])):(clojure.core.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})())):(clojure.core.list.apply(null,[clojure.core.first.apply(null,[fdecl_1])]))))})))}).apply(null,[]); +// Skipping: (def assoc (fn assoc ([map key val] (. clojure.lang.RT (assoc map key val))) ([map key val & kvs] (let [ret (assoc map key val)] (if kvs (recur ret (first kvs) (second kvs) (rrest kvs)) ret))))) + +//====== +//(def meta (fn meta [x] (if (instance? clojure.lang.IMeta x) (. x (meta))))) +//--- +(function __clojure_core_fn_651(){ +return (clojure.JS.def(clojure.core,"meta",(function __clojure_core_fn_651_meta_653(x_1){ +var meta_0=arguments.callee; +return (((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IMeta,x_1]))?((x_1).meta()):(null)))})))}).apply(null,[]); + +//====== +//(def with-meta (fn with-meta [x m] (. x (withMeta m)))) +//--- +(function __clojure_core_fn_656(){ +return (clojure.JS.def(clojure.core,"with_meta",(function __clojure_core_fn_656_with_meta_658(x_1,m_2){ +var with_meta_0=arguments.callee; +return ((x_1).withMeta(m_2))})))}).apply(null,[]); + +//====== +//(def last (fn last [s] (if (rest s) (recur (rest s)) (first s)))) +//--- +(function __clojure_core_fn_661(){ +return (clojure.JS.def(clojure.core,"last",(function __clojure_core_fn_661_last_663(s_1){ +var _cnt,_rtn,last_0=arguments.callee; +do{_cnt=0;_rtn=((clojure.core.rest.apply(null,[s_1]))?((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s_1])],s_1=_rtn[0])):(clojure.core.first.apply(null,[s_1]))) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(def butlast (fn butlast [s] (loop [ret [] s s] (if (rest s) (recur (conj ret (first s)) (rest s)) (seq ret))))) +//--- +(function __clojure_core_fn_666(){ +return (clojure.JS.def(clojure.core,"butlast",(function __clojure_core_fn_666_butlast_668(s_1){ +var ret_2,s_3,butlast_0=arguments.callee; +return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.lang.PersistentVector.EMPTY), +(s_3=s_1);do{_cnt=0; +_rtn=((clojure.core.rest.apply(null,[s_3]))?((_cnt=1,_rtn=[clojure.core.conj.apply(null,[ret_2,clojure.core.first.apply(null,[s_3])]),clojure.core.rest.apply(null,[s_3])],ret_2=_rtn[0],s_3=_rtn[1])):(clojure.core.seq.apply(null,[ret_2])))}while(_cnt);return _rtn;})()))})))}).apply(null,[]); +// Skipping: (def defn (fn defn [name & fdecl] (let [m (if (string? (first fdecl)) {:doc (first fdecl)} {}) fdecl (if (string? (first fdecl)) (rest fdecl) fdecl) m (if (map? (first fdecl)) (conj m (first fdecl)) m) fdecl (if (map? (first fdecl)) (rest fdecl) fdecl) fdecl (if (vector? (first fdecl)) (list fdecl) fdecl) m (if (map? (last fdecl)) (conj m (last fdecl)) m) fdecl (if (map? (last fdecl)) (butlast fdecl) fdecl) m (conj {:arglists (list (quote quote) (sigs fdecl))} m)] (list (quote def) (with-meta name (conj (if (meta name) (meta name) {}) m)) (cons (quote clojure.core/fn) fdecl))))) +// Skipping: (. (var defn) (setMacro)) + +//====== +//(defn cast "Throws a ClassCastException if x is not a c, else returns x." [c x] (. c (cast x))) +//--- +(function __clojure_core_fn_679(){ +return (clojure.JS.def(clojure.core,"cast",(function __clojure_core_fn_679_cast_681(c_1,x_2){ +return ((c_1).cast(x_2))})))}).apply(null,[]); +// Skipping: (defn to-array "Returns an array of Objects containing the contents of coll, which\n can be any Collection. Maps to java.util.Collection.toArray()." [coll] (. clojure.lang.RT (toArray coll))) + +//====== +//(defn vector "Creates a new vector containing the args." ([] []) ([& args] (. clojure.lang.LazilyPersistentVector (create args)))) +//--- +(function __clojure_core_fn_691(){ +return (clojure.JS.def(clojure.core,"vector",clojure.JS.variadic(0,(function __clojure_core_fn_691_vector_693(){switch(arguments.length){ +case 0:return (clojure.lang.PersistentVector.EMPTY)} +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.LazilyPersistentVector.create(args_1))}))))}).apply(null,[]); + +//====== +//(defn vec "Creates a new vector containing the contents of coll." ([coll] (. clojure.lang.LazilyPersistentVector (createOwning (to-array coll))))) +//--- +(function __clojure_core_fn_698(){ +return (clojure.JS.def(clojure.core,"vec",(function __clojure_core_fn_698_vec_700(coll_1){ +return (clojure.lang.LazilyPersistentVector.createOwning(clojure.core.to_array.apply(null,[coll_1])))})))}).apply(null,[]); +// Skipping: (defn hash-map "keyval => key val\n Returns a new hash map with supplied mappings." ([] {}) ([& keyvals] (. clojure.lang.PersistentHashMap (create keyvals)))) + +//====== +//(defn hash-set "Returns a new hash set with supplied keys." ([] #{}) ([& keys] (. clojure.lang.PersistentHashSet (create keys)))) +//--- +(function __clojure_core_fn_711(){ +return (clojure.JS.def(clojure.core,"hash_set",clojure.JS.variadic(0,(function __clojure_core_fn_711_hash_set_713(){switch(arguments.length){ +case 0:return (clojure.lang.PersistentHashSet.EMPTY)} +var keys_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.PersistentHashSet.create(keys_1))}))))}).apply(null,[]); + +//====== +//(defn sorted-map "keyval => key val\n Returns a new sorted map with supplied mappings." ([& keyvals] (. clojure.lang.PersistentTreeMap (create keyvals)))) +//--- +(function __clojure_core_fn_718(){ +return (clojure.JS.def(clojure.core,"sorted_map",clojure.JS.variadic(0,(function __clojure_core_fn_718_sorted_map_720(){ +var keyvals_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.PersistentTreeMap.create(keyvals_1))}))))}).apply(null,[]); + +//====== +//(defn sorted-set "Returns a new sorted set with supplied keys." ([& keys] (. clojure.lang.PersistentTreeSet (create keys)))) +//--- +(function __clojure_core_fn_724(){ +return (clojure.JS.def(clojure.core,"sorted_set",clojure.JS.variadic(0,(function __clojure_core_fn_724_sorted_set_726(){ +var keys_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.PersistentTreeSet.create(keys_1))}))))}).apply(null,[]); + +//====== +//(defn sorted-map-by "keyval => key val\n Returns a new sorted map with supplied mappings, using the supplied comparator." ([comparator & keyvals] (. clojure.lang.PersistentTreeMap (create comparator keyvals)))) +//--- +(function __clojure_core_fn_730(){ +return (clojure.JS.def(clojure.core,"sorted_map_by",clojure.JS.variadic(1,(function __clojure_core_fn_730_sorted_map_by_732(comparator_1){ +var keyvals_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.lang.PersistentTreeMap.create(comparator_1,keyvals_2))}))))}).apply(null,[]); +// Skipping: (def defmacro (fn [name & args] (list (quote do) (cons (quote clojure.core/defn) (cons name args)) (list (quote .) (list (quote var) name) (quote (setMacro)))))) +// Skipping: (. (var defmacro) (setMacro)) +// Skipping: (defmacro when "Evaluates test. If logical true, evaluates body in an implicit do." [test & body] (list (quote if) test (cons (quote do) body))) +// Skipping: (defmacro when-not "Evaluates test. If logical false, evaluates body in an implicit do." [test & body] (list (quote if) test nil (cons (quote do) body))) + +//====== +//(defn nil? "Returns true if x is nil, false otherwise." {:tag Boolean} [x] (identical? x nil)) +//--- +(function __clojure_core_fn_763(){ +return (clojure.JS.def(clojure.core,"nil_QMARK_",(function __clojure_core_fn_763_nil_QMARK_765(x_1){ +return (clojure.core.identical_QMARK_.apply(null,[x_1,null]))})))}).apply(null,[]); + +//====== +//(defn false? "Returns true if x is the value false, false otherwise." {:tag Boolean} [x] (identical? x false)) +//--- +(function __clojure_core_fn_769(){ +return (clojure.JS.def(clojure.core,"false_QMARK_",(function __clojure_core_fn_769_false_QMARK_771(x_1){ +return (clojure.core.identical_QMARK_.apply(null,[x_1,false]))})))}).apply(null,[]); + +//====== +//(defn true? "Returns true if x is the value true, false otherwise." {:tag Boolean} [x] (identical? x true)) +//--- +(function __clojure_core_fn_775(){ +return (clojure.JS.def(clojure.core,"true_QMARK_",(function __clojure_core_fn_775_true_QMARK_777(x_1){ +return (clojure.core.identical_QMARK_.apply(null,[x_1,true]))})))}).apply(null,[]); + +//====== +//(defn not "Returns true if x is logical false, false otherwise." {:tag Boolean} [x] (if x false true)) +//--- +(function __clojure_core_fn_781(){ +return (clojure.JS.def(clojure.core,"not",(function __clojure_core_fn_781_not_783(x_1){ +return (((x_1)?(false):(true)))})))}).apply(null,[]); + +//====== +//(defn str "With no args, returns the empty string. With one arg x, returns\n x.toString(). (str nil) returns the empty string. With more than\n one arg, returns the concatenation of the str values of the args." {:tag String} ([] "") ([x] (if (nil? x) "" (. x (toString)))) ([x & ys] ((fn [sb more] (if more (recur (. sb (append (str (first more)))) (rest more)) (str sb))) (clojure.lang.RT/makeStringBuilder (str x)) ys))) +//--- +(function __clojure_core_fn_787(){ +return (clojure.JS.def(clojure.core,"str",clojure.JS.variadic(1,(function __clojure_core_fn_787_str_789(x_1){switch(arguments.length){ +case 0:return ("") +case 1:return (((clojure.core.nil_QMARK_.apply(null,[x_1]))?(""):((x_1).toString())))} +var ys_2=clojure.JS.rest_args(this,arguments,1); +return ((function __clojure_core_fn_787_str_789_fn_793(sb_1,more_2){ +var _cnt,_rtn; +do{_cnt=0;_rtn=((more_2)?((_cnt=1,_rtn=[(sb_1).append(clojure.core.str.apply(null,[clojure.core.first.apply(null,[more_2])])),clojure.core.rest.apply(null,[more_2])],sb_1=_rtn[0],more_2=_rtn[1])):(clojure.core.str.apply(null,[sb_1]))) +}while(_cnt);return _rtn;}).apply(null,[clojure.lang.RT.makeStringBuilder(clojure.core.str.apply(null,[x_1])),ys_2]))}))))}).apply(null,[]); + +//====== +//(defn symbol? "Return true if x is a Symbol" [x] (instance? clojure.lang.Symbol x)) +//--- +(function __clojure_core_fn_798(){ +return (clojure.JS.def(clojure.core,"symbol_QMARK_",(function __clojure_core_fn_798_symbol_QMARK_800(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Symbol,x_1]))})))}).apply(null,[]); + +//====== +//(defn keyword? "Return true if x is a Keyword" [x] (instance? clojure.lang.Keyword x)) +//--- +(function __clojure_core_fn_804(){ +return (clojure.JS.def(clojure.core,"keyword_QMARK_",(function __clojure_core_fn_804_keyword_QMARK_806(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Keyword,x_1]))})))}).apply(null,[]); +// Skipping: (defn symbol "Returns a Symbol with the given namespace and name." ([name] (if (symbol? name) name (. clojure.lang.Symbol (intern name)))) ([ns name] (. clojure.lang.Symbol (intern ns name)))) +// Skipping: (defn keyword "Returns a Keyword with the given namespace and name. Do not use :\n in the keyword strings, it will be added automatically." ([name] (if (keyword? name) name (. clojure.lang.Keyword (intern nil name)))) ([ns name] (. clojure.lang.Keyword (intern ns name)))) + +//====== +//(defn gensym "Returns a new symbol with a unique name. If a prefix string is\n supplied, the name is prefix# where # is some unique number. If\n prefix is not supplied, the prefix is 'G__'." ([] (gensym "G__")) ([prefix-string] (. clojure.lang.Symbol (intern (str prefix-string (str (. clojure.lang.RT (nextID)))))))) +//--- +(function __clojure_core_fn_824(){ +return (clojure.JS.def(clojure.core,"gensym",(function __clojure_core_fn_824_gensym_826(prefix_string_1){switch(arguments.length){ +case 0:return (clojure.core.gensym.apply(null,["G__"]))} +return (clojure.lang.Symbol.intern(clojure.core.str.apply(null,[prefix_string_1,clojure.core.str.apply(null,[clojure.lang.RT.nextID()])])))})))}).apply(null,[]); +// Skipping: (defmacro cond "Takes a set of test/expr pairs. It evaluates each test one at a\n time. If a test returns logical true, cond evaluates and returns\n the value of the corresponding expr and doesn't evaluate any of the\n other tests or exprs. (cond) returns nil." [& clauses] (when clauses (list (quote if) (first clauses) (if (rest clauses) (second clauses) (throw (IllegalArgumentException. "cond requires an even number of forms"))) (cons (quote clojure.core/cond) (rest (rest clauses)))))) + +//====== +//(defn spread {:private true} [arglist] (cond (nil? arglist) nil (nil? (rest arglist)) (seq (first arglist)) :else (cons (first arglist) (spread (rest arglist))))) +//--- +(function __clojure_core_fn_840(){ +return (clojure.JS.def(clojure.core,"spread",(function __clojure_core_fn_840_spread_842(arglist_1){ +return (((clojure.core.nil_QMARK_.apply(null,[arglist_1]))?(null):(((clojure.core.nil_QMARK_.apply(null,[clojure.core.rest.apply(null,[arglist_1])]))?(clojure.core.seq.apply(null,[clojure.core.first.apply(null,[arglist_1])])):(((clojure.core.keyword("","else"))?(clojure.core.cons.apply(null,[clojure.core.first.apply(null,[arglist_1]),clojure.core.spread.apply(null,[clojure.core.rest.apply(null,[arglist_1])])])):(null)))))))})))}).apply(null,[]); +// Skipping: (defn apply "Applies fn f to the argument list formed by prepending args to argseq." {:arglists (quote ([f args* argseq]))} [f & args] (. f (applyTo (spread args)))) + +//====== +//(defn list* "Creates a new list containing the item prepended to more." [item & more] (spread (cons item more))) +//--- +(function __clojure_core_fn_852(){ +return (clojure.JS.def(clojure.core,"list_STAR_",clojure.JS.variadic(1,(function __clojure_core_fn_852_list_STAR_854(item_1){ +var more_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.spread.apply(null,[clojure.core.cons.apply(null,[item_1,more_2])]))}))))}).apply(null,[]); +// Skipping: (defmacro delay "Takes a body of expressions and yields a Delay object that will\n invoke the body only the first time it is forced (with force), and\n will cache the result and return it on all subsequent force calls" [& body] (list (quote new) (quote clojure.lang.Delay) (list* (quote clojure.core/fn) [] body))) + +//====== +//(defn delay? "returns true if x is a Delay created with delay" [x] (instance? clojure.lang.Delay x)) +//--- +(function __clojure_core_fn_867(){ +return (clojure.JS.def(clojure.core,"delay_QMARK_",(function __clojure_core_fn_867_delay_QMARK_869(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Delay,x_1]))})))}).apply(null,[]); + +//====== +//(defn force "If x is a Delay, returns the (possibly cached) value of its expression, else returns x" [x] (. clojure.lang.Delay (force x))) +//--- +(function __clojure_core_fn_873(){ +return (clojure.JS.def(clojure.core,"force",(function __clojure_core_fn_873_force_875(x_1){ +return (clojure.lang.Delay.force(x_1))})))}).apply(null,[]); + +//====== +//(defn fnseq "Returns a seq object whose first is first and whose rest is the\n value produced by calling restfn with no arguments. restfn will be\n called at most once per step in the sequence, e.g. calling rest\n repeatedly on the head of the seq calls restfn once - the value it\n yields is cached." [first restfn] (new clojure.lang.FnSeq first restfn)) +//--- +(function __clojure_core_fn_879(){ +return (clojure.JS.def(clojure.core,"fnseq",(function __clojure_core_fn_879_fnseq_881(first_1,restfn_2){ +return ((new clojure.lang.FnSeq(first_1,restfn_2)))})))}).apply(null,[]); +// Skipping: (defmacro lazy-cons "Expands to code which produces a seq object whose first is\n first-expr and whose rest is rest-expr, neither of which is\n evaluated until first/rest is called. Each expr will be evaluated at most\n once per step in the sequence, e.g. calling first/rest repeatedly on the\n same node of the seq evaluates first/rest-expr once - the values they yield are\n cached." [first-expr & rest-expr] (list (quote new) (quote clojure.lang.LazyCons) (list (quote clojure.core/fn) (list [] first-expr) (list* [(gensym)] rest-expr)))) + +//====== +//(defn cache-seq "Given a seq s, returns a lazy seq that will touch each element of s\n at most once, caching the results." [s] (when s (clojure.lang.CachedSeq. s))) +//--- +(function __clojure_core_fn_894(){ +return (clojure.JS.def(clojure.core,"cache_seq",(function __clojure_core_fn_894_cache_seq_896(s_1){ +return (((s_1)?((new clojure.lang.CachedSeq(s_1))):(null)))})))}).apply(null,[]); + +//====== +//(defn concat "Returns a lazy seq representing the concatenation of\tthe elements in the supplied colls." ([] nil) ([x] (seq x)) ([x y] (if (seq x) (lazy-cons (first x) (concat (rest x) y)) (seq y))) ([x y & zs] (let [cat (fn cat [xys zs] (if (seq xys) (lazy-cons (first xys) (cat (rest xys) zs)) (when zs (recur (first zs) (rest zs)))))] (cat (concat x y) zs)))) +//--- +(function __clojure_core_fn_900(){ +return (clojure.JS.def(clojure.core,"concat",clojure.JS.variadic(2,(function __clojure_core_fn_900_concat_902(x_1,y_2){switch(arguments.length){ +case 0:return (null) +case 1:return (clojure.core.seq.apply(null,[x_1])) +case 2:return (((clojure.core.seq.apply(null,[x_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_900_concat_902_fn_907(G__906_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[x_1]))} +return (clojure.core.concat.apply(null,[clojure.core.rest.apply(null,[x_1]),y_2]))})))):(clojure.core.seq.apply(null,[y_2]))))} +var cat_4,zs_3=clojure.JS.rest_args(this,arguments,2); +return (((cat_4=(function __clojure_core_fn_900_concat_902_cat_912(xys_1,zs_2){ +var _cnt,_rtn,cat_0=arguments.callee; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[xys_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_900_concat_902_cat_912_fn_914(G__913_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[xys_1]))} +return (cat_0.apply(null,[clojure.core.rest.apply(null,[xys_1]),zs_2]))})))):(((zs_2)?((_cnt=1,_rtn=[clojure.core.first.apply(null,[zs_2]),clojure.core.rest.apply(null,[zs_2])],xys_1=_rtn[0],zs_2=_rtn[1])):(null)))) +}while(_cnt);return _rtn;})), +cat_4.apply(null,[clojure.core.concat.apply(null,[x_1,y_2]),zs_3])))}))))}).apply(null,[]); +// Skipping: (defmacro if-not "Evaluates test. If logical false, evaluates and returns then expr, otherwise else expr, if supplied, else nil." ([test then] (clojure.core/concat (clojure.core/list (quote clojure.core/if-not)) (clojure.core/list test) (clojure.core/list then) (clojure.core/list (quote nil)))) ([test then else] (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/not)) (clojure.core/list test))) (clojure.core/list then) (clojure.core/list else)))) + +//====== +//(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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Util)) (clojure.core/list (quote clojure.core/equal)) (clojure.core/list x) (clojure.core/list y))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Util (equal x y))) ([x y & more] (if (= x y) (if (rest more) (recur y (first more) (rest more)) (= y (first more))) false))) +//--- +(function __clojure_core_fn_932(){ +return (clojure.JS.def(clojure.core,"_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_932_EQ_937(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.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Util.equal(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn not= "Same as (not (= obj1 obj2))" {:tag Boolean} ([x] false) ([x y] (not (= x y))) ([x y & more] (not (apply = x y more)))) +//--- +(function __clojure_core_fn_943(){ +return (clojure.JS.def(clojure.core,"not_EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_943_not_EQ_945(x_1,y_2){switch(arguments.length){ +case 1:return (false) +case 2:return (clojure.core.not.apply(null,[clojure.lang.Util.equal(x_1,y_2)]))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.not.apply(null,[clojure.core.apply.apply(null,[clojure.core._EQ_,x_1,y_2,more_3])]))}))))}).apply(null,[]); + +//====== +//(defn compare "Comparator. Returns 0 if x equals y, -1 if x is logically 'less\n than' y, else 1. Same as Java x.compareTo(y) except it also works\n for nil, and compares numbers in a type-independent manner. x must\n implement Comparable" {:tag Integer, :inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Util)) (clojure.core/list (quote clojure.core/compare)) (clojure.core/list x) (clojure.core/list y)))} [x y] (. clojure.lang.Util (compare x y))) +//--- +(function __clojure_core_fn_951(){ +return (clojure.JS.def(clojure.core,"compare",(function __clojure_core_fn_951_compare_956(x_1,y_2){ +return (clojure.lang.Util.compare(x_1,y_2))})))}).apply(null,[]); +// Skipping: (defmacro and "Evaluates exprs one at a time, from left to right. If a form\n returns logical false (nil or false), and returns that value and\n doesn't evaluate any of the other expressions, otherwise it returns\n the value of the last expr. (and) returns true." ([] true) ([x] x) ([x & rest] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote and__960__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote and__960__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/and)) rest)) (clojure.core/list (quote and__960__auto__))))))) +// Skipping: (defmacro or "Evaluates exprs one at a time, from left to right. If a form\n returns a logical true value, or returns that value and doesn't\n evaluate any of the other expressions, otherwise it returns the\n value of the last expression. (or) returns nil." ([] nil) ([x] x) ([x & rest] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote or__974__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote or__974__auto__)) (clojure.core/list (quote or__974__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/or)) rest))))))) + +//====== +//(defn reduce "f should be a function of 2 arguments. If val is not supplied,\n returns the result of applying f to the first 2 items in coll, then\n applying f to that result and the 3rd item, etc. If coll contains no\n items, f must accept no arguments as well, and reduce returns the\n result of calling f with no arguments. If coll has only 1 item, it\n is returned and f is not called. If val is supplied, returns the\n result of applying f to val and the first item in coll, then\n applying f to that result and the 2nd item, etc. If coll contains no\n items, returns val and f is not called." ([f coll] (let [s (seq coll)] (if s (if (instance? clojure.lang.IReduce s) (. s (reduce f)) (reduce f (first s) (rest s))) (f)))) ([f val coll] (let [s (seq coll)] (if (instance? clojure.lang.IReduce s) (. s (reduce f val)) ((fn [f val s] (if s (recur f (f val (first s)) (rest s)) val)) f val s))))) +//--- +(function __clojure_core_fn_988(){ +return (clojure.JS.def(clojure.core,"reduce",(function __clojure_core_fn_988_reduce_990(f_1,val_2,coll_3){switch(arguments.length){ +case 2:var s_3,coll_2=arguments[1]; +return (((s_3=clojure.core.seq.apply(null,[coll_2])), +((s_3)?(((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_3]))?((s_3).reduce(f_1)):(clojure.core.reduce.apply(null,[f_1,clojure.core.first.apply(null,[s_3]),clojure.core.rest.apply(null,[s_3])])))):(f_1.apply(null,[])))))} +var s_4; +return (((s_4=clojure.core.seq.apply(null,[coll_3])), +((clojure.core.instance_QMARK_.apply(null,[clojure.lang.IReduce,s_4]))?((s_4).reduce(f_1,val_2)):((function __clojure_core_fn_988_reduce_990_fn_993(f_1,val_2,s_3){ +var _cnt,_rtn; +do{_cnt=0;_rtn=((s_3)?((_cnt=1,_rtn=[f_1,f_1.apply(null,[val_2,clojure.core.first.apply(null,[s_3])]),clojure.core.rest.apply(null,[s_3])],f_1=_rtn[0],val_2=_rtn[1],s_3=_rtn[2])):(val_2)) +}while(_cnt);return _rtn;}).apply(null,[f_1,val_2,s_4])))))})))}).apply(null,[]); + +//====== +//(defn reverse "Returns a seq of the items in coll in reverse order. Not lazy." [coll] (reduce conj nil coll)) +//--- +(function __clojure_core_fn_998(){ +return (clojure.JS.def(clojure.core,"reverse",(function __clojure_core_fn_998_reverse_1000(coll_1){ +return (clojure.core.reduce.apply(null,[clojure.core.conj,null,coll_1]))})))}).apply(null,[]); + +//====== +//(defn + "Returns the sum of nums. (+) returns 0." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/add)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([] 0) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (add x y))) ([x y & more] (reduce + (+ x y) more))) +//--- +(function __clojure_core_fn_1004(){ +return (clojure.JS.def(clojure.core,"_PLUS_",clojure.JS.variadic(2,(function __clojure_core_fn_1004_PLUS_1009(x_1,y_2){switch(arguments.length){ +case 0:return ((0)) +case 1:return (clojure.lang.RT.numberCast(x_1)) +case 2:return (clojure.lang.Numbers.add(x_1,y_2))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core._PLUS_,clojure.lang.Numbers.add(x_1,y_2),more_3]))}))))}).apply(null,[]); + +//====== +//(defn * "Returns the product of nums. (*) returns 1." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/multiply)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([] 1) ([x] (clojure.lang.RT/numberCast x)) ([x y] (. clojure.lang.Numbers (multiply x y))) ([x y & more] (reduce * (* x y) more))) +//--- +(function __clojure_core_fn_1016(){ +return (clojure.JS.def(clojure.core,"_STAR_",clojure.JS.variadic(2,(function __clojure_core_fn_1016_STAR_1021(x_1,y_2){switch(arguments.length){ +case 0:return ((1)) +case 1:return (clojure.lang.RT.numberCast(x_1)) +case 2:return (clojure.lang.Numbers.multiply(x_1,y_2))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core._STAR_,clojure.lang.Numbers.multiply(x_1,y_2),more_3]))}))))}).apply(null,[]); + +//====== +//(defn / "If no denominators are supplied, returns 1/numerator,\n else returns numerator divided by all of the denominators." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/divide)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] (/ 1 x)) ([x y] (. clojure.lang.Numbers (divide x y))) ([x y & more] (reduce / (/ x y) more))) +//--- +(function __clojure_core_fn_1028(){ +return (clojure.JS.def(clojure.core,"_SLASH_",clojure.JS.variadic(2,(function __clojure_core_fn_1028_SLASH_1033(x_1,y_2){switch(arguments.length){ +case 1:return (clojure.lang.Numbers.divide((1),x_1)) +case 2:return (clojure.lang.Numbers.divide(x_1,y_2))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core._SLASH_,clojure.lang.Numbers.divide(x_1,y_2),more_3]))}))))}).apply(null,[]); + +//====== +//(defn - "If no ys are supplied, returns the negation of x, else subtracts\n the ys from x and returns the result." {:inline (fn [& args] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/minus)) args)))), :inline-arities #{1 2}} ([x] (. clojure.lang.Numbers (minus x))) ([x y] (. clojure.lang.Numbers (minus x y))) ([x y & more] (reduce - (- x y) more))) +//--- +(function __clojure_core_fn_1039(){ +return (clojure.JS.def(clojure.core,"_",clojure.JS.variadic(2,(function __clojure_core_fn_1039_1044(x_1,y_2){switch(arguments.length){ +case 1:return (clojure.lang.Numbers.minus(x_1)) +case 2:return (clojure.lang.Numbers.minus(x_1,y_2))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core._,clojure.lang.Numbers.minus(x_1,y_2),more_3]))}))))}).apply(null,[]); + +//====== +//(defn < "Returns non-nil if nums are in monotonically increasing order,\n otherwise false." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lt)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lt x y))) ([x y & more] (if (< x y) (if (rest more) (recur y (first more) (rest more)) (< y (first more))) false))) +//--- +(function __clojure_core_fn_1050(){ +return (clojure.JS.def(clojure.core,"_LT_",clojure.JS.variadic(2,(function __clojure_core_fn_1050_LT_1055(x_1,y_2){switch(arguments.length){ +case 1:return (true) +case 2:return (clojure.lang.Numbers.lt(x_1,y_2))} +var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((clojure.lang.Numbers.lt(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lt(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn <= "Returns non-nil if nums are in monotonically non-decreasing order,\n otherwise false." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lte)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (lte x y))) ([x y & more] (if (<= x y) (if (rest more) (recur y (first more) (rest more)) (<= y (first more))) false))) +//--- +(function __clojure_core_fn_1061(){ +return (clojure.JS.def(clojure.core,"_LT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1061_LT_EQ_1066(x_1,y_2){switch(arguments.length){ +case 1:return (true) +case 2:return (clojure.lang.Numbers.lte(x_1,y_2))} +var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((clojure.lang.Numbers.lte(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.lte(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn > "Returns non-nil if nums are in monotonically decreasing order,\n otherwise false." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/gt)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gt x y))) ([x y & more] (if (> x y) (if (rest more) (recur y (first more) (rest more)) (> y (first more))) false))) +//--- +(function __clojure_core_fn_1072(){ +return (clojure.JS.def(clojure.core,"_GT_",clojure.JS.variadic(2,(function __clojure_core_fn_1072_GT_1077(x_1,y_2){switch(arguments.length){ +case 1:return (true) +case 2:return (clojure.lang.Numbers.gt(x_1,y_2))} +var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((clojure.lang.Numbers.gt(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gt(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn >= "Returns non-nil if nums are in monotonically non-increasing order,\n otherwise false." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/gte)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (gte x y))) ([x y & more] (if (>= x y) (if (rest more) (recur y (first more) (rest more)) (>= y (first more))) false))) +//--- +(function __clojure_core_fn_1083(){ +return (clojure.JS.def(clojure.core,"_GT__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1083_GT_EQ_1088(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.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.gte(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn == "Returns non-nil if nums all have the same value, otherwise false" {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/equiv)) (clojure.core/list x) (clojure.core/list y))))), :inline-arities #{2}} ([x] true) ([x y] (. clojure.lang.Numbers (equiv x y))) ([x y & more] (if (== x y) (if (rest more) (recur y (first more) (rest more)) (== y (first more))) false))) +//--- +(function __clojure_core_fn_1094(){ +return (clojure.JS.def(clojure.core,"_EQ__EQ_",clojure.JS.variadic(2,(function __clojure_core_fn_1094_EQ_EQ_1099(x_1,y_2){switch(arguments.length){ +case 1:return (true) +case 2:return (clojure.lang.Numbers.equiv(x_1,y_2))} +var _cnt,_rtn,more_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((clojure.lang.Numbers.equiv(x_1,y_2))?(((clojure.core.rest.apply(null,[more_3]))?((_cnt=1,_rtn=[y_2,clojure.core.first.apply(null,[more_3]),clojure.core.rest.apply(null,[more_3])],x_1=_rtn[0],y_2=_rtn[1],more_3=_rtn[2])):(clojure.lang.Numbers.equiv(y_2,clojure.core.first.apply(null,[more_3]))))):(false)) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(defn max "Returns the greatest of the nums." ([x] x) ([x y] (if (> x y) x y)) ([x y & more] (reduce max (max x y) more))) +//--- +(function __clojure_core_fn_1105(){ +return (clojure.JS.def(clojure.core,"max",clojure.JS.variadic(2,(function __clojure_core_fn_1105_max_1107(x_1,y_2){switch(arguments.length){ +case 1:return (x_1) +case 2:return (((clojure.lang.Numbers.gt(x_1,y_2))?(x_1):(y_2)))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core.max,clojure.core.max.apply(null,[x_1,y_2]),more_3]))}))))}).apply(null,[]); + +//====== +//(defn min "Returns the least of the nums." ([x] x) ([x y] (if (< x y) x y)) ([x y & more] (reduce min (min x y) more))) +//--- +(function __clojure_core_fn_1113(){ +return (clojure.JS.def(clojure.core,"min",clojure.JS.variadic(2,(function __clojure_core_fn_1113_min_1115(x_1,y_2){switch(arguments.length){ +case 1:return (x_1) +case 2:return (((clojure.lang.Numbers.lt(x_1,y_2))?(x_1):(y_2)))} +var more_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.reduce.apply(null,[clojure.core.min,clojure.core.min.apply(null,[x_1,y_2]),more_3]))}))))}).apply(null,[]); + +//====== +//(defn inc "Returns a number one greater than num." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/inc)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (inc x))) +//--- +(function __clojure_core_fn_1121(){ +return (clojure.JS.def(clojure.core,"inc",(function __clojure_core_fn_1121_inc_1126(x_1){ +return (clojure.lang.Numbers.inc(x_1))})))}).apply(null,[]); + +//====== +//(defn dec "Returns a number one less than num." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/dec)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (dec x))) +//--- +(function __clojure_core_fn_1130(){ +return (clojure.JS.def(clojure.core,"dec",(function __clojure_core_fn_1130_dec_1135(x_1){ +return (clojure.lang.Numbers.dec(x_1))})))}).apply(null,[]); + +//====== +//(defn unchecked-inc "Returns a number one greater than x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_inc)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_inc x))) +//--- +(function __clojure_core_fn_1139(){ +return (clojure.JS.def(clojure.core,"unchecked_inc",(function __clojure_core_fn_1139_unchecked_inc_1144(x_1){ +return (clojure.lang.Numbers.unchecked_inc(x_1))})))}).apply(null,[]); + +//====== +//(defn unchecked-dec "Returns a number one less than x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_dec)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_dec x))) +//--- +(function __clojure_core_fn_1148(){ +return (clojure.JS.def(clojure.core,"unchecked_dec",(function __clojure_core_fn_1148_unchecked_dec_1153(x_1){ +return (clojure.lang.Numbers.unchecked_dec(x_1))})))}).apply(null,[]); + +//====== +//(defn unchecked-negate "Returns the negation of x, an int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_negate)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (unchecked_negate x))) +//--- +(function __clojure_core_fn_1157(){ +return (clojure.JS.def(clojure.core,"unchecked_negate",(function __clojure_core_fn_1157_unchecked_negate_1162(x_1){ +return (clojure.lang.Numbers.unchecked_negate(x_1))})))}).apply(null,[]); + +//====== +//(defn unchecked-add "Returns the sum of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_add)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_add x y))) +//--- +(function __clojure_core_fn_1166(){ +return (clojure.JS.def(clojure.core,"unchecked_add",(function __clojure_core_fn_1166_unchecked_add_1171(x_1,y_2){ +return (clojure.lang.Numbers.unchecked_add(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn unchecked-subtract "Returns the difference of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_subtract)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_subtract x y))) +//--- +(function __clojure_core_fn_1175(){ +return (clojure.JS.def(clojure.core,"unchecked_subtract",(function __clojure_core_fn_1175_unchecked_subtract_1180(x_1,y_2){ +return (clojure.lang.Numbers.unchecked_subtract(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn unchecked-multiply "Returns the product of x and y, both int or long. \n Note - uses a primitive operator subject to overflow." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_multiply)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_multiply x y))) +//--- +(function __clojure_core_fn_1184(){ +return (clojure.JS.def(clojure.core,"unchecked_multiply",(function __clojure_core_fn_1184_unchecked_multiply_1189(x_1,y_2){ +return (clojure.lang.Numbers.unchecked_multiply(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn unchecked-divide "Returns the division of x by y, both int or long. \n Note - uses a primitive operator subject to truncation." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_divide)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_divide x y))) +//--- +(function __clojure_core_fn_1193(){ +return (clojure.JS.def(clojure.core,"unchecked_divide",(function __clojure_core_fn_1193_unchecked_divide_1198(x_1,y_2){ +return (clojure.lang.Numbers.unchecked_divide(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn unchecked-remainder "Returns the remainder of division of x by y, both int or long. \n Note - uses a primitive operator subject to truncation." {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked_remainder)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers (unchecked_remainder x y))) +//--- +(function __clojure_core_fn_1202(){ +return (clojure.JS.def(clojure.core,"unchecked_remainder",(function __clojure_core_fn_1202_unchecked_remainder_1207(x_1,y_2){ +return (clojure.lang.Numbers.unchecked_remainder(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn pos? "Returns true if num is greater than zero, else false" {:tag Boolean, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/isPos)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isPos x))) +//--- +(function __clojure_core_fn_1211(){ +return (clojure.JS.def(clojure.core,"pos_QMARK_",(function __clojure_core_fn_1211_pos_QMARK_1216(x_1){ +return (clojure.lang.Numbers.isPos(x_1))})))}).apply(null,[]); + +//====== +//(defn neg? "Returns true if num is less than zero, else false" {:tag Boolean, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/isNeg)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isNeg x))) +//--- +(function __clojure_core_fn_1220(){ +return (clojure.JS.def(clojure.core,"neg_QMARK_",(function __clojure_core_fn_1220_neg_QMARK_1225(x_1){ +return (clojure.lang.Numbers.isNeg(x_1))})))}).apply(null,[]); + +//====== +//(defn zero? "Returns true if num is zero, else false" {:tag Boolean, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/isZero)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (isZero x))) +//--- +(function __clojure_core_fn_1229(){ +return (clojure.JS.def(clojure.core,"zero_QMARK_",(function __clojure_core_fn_1229_zero_QMARK_1234(x_1){ +return (clojure.lang.Numbers.isZero(x_1))})))}).apply(null,[]); + +//====== +//(defn quot "quot[ient] of dividing numerator by denominator." [num div] (. clojure.lang.Numbers (quotient num div))) +//--- +(function __clojure_core_fn_1238(){ +return (clojure.JS.def(clojure.core,"quot",(function __clojure_core_fn_1238_quot_1240(num_1,div_2){ +return (clojure.lang.Numbers.quotient(num_1,div_2))})))}).apply(null,[]); + +//====== +//(defn rem "remainder of dividing numerator by denominator." [num div] (. clojure.lang.Numbers (remainder num div))) +//--- +(function __clojure_core_fn_1244(){ +return (clojure.JS.def(clojure.core,"rem",(function __clojure_core_fn_1244_rem_1246(num_1,div_2){ +return (clojure.lang.Numbers.remainder(num_1,div_2))})))}).apply(null,[]); + +//====== +//(defn rationalize "returns the rational value of num" [num] (. clojure.lang.Numbers (rationalize num))) +//--- +(function __clojure_core_fn_1250(){ +return (clojure.JS.def(clojure.core,"rationalize",(function __clojure_core_fn_1250_rationalize_1252(num_1){ +return (clojure.lang.Numbers.rationalize(num_1))})))}).apply(null,[]); + +//====== +//(defn bit-not "Bitwise complement" {:inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/not)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers not x)) +//--- +(function __clojure_core_fn_1256(){ +return (clojure.JS.def(clojure.core,"bit_not",(function __clojure_core_fn_1256_bit_not_1261(x_1){ +return (clojure.lang.Numbers.not(x_1))})))}).apply(null,[]); + +//====== +//(defn bit-and "Bitwise and" {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/and)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers and x y)) +//--- +(function __clojure_core_fn_1265(){ +return (clojure.JS.def(clojure.core,"bit_and",(function __clojure_core_fn_1265_bit_and_1270(x_1,y_2){ +return (clojure.lang.Numbers.and(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn bit-or "Bitwise or" {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/or)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers or x y)) +//--- +(function __clojure_core_fn_1274(){ +return (clojure.JS.def(clojure.core,"bit_or",(function __clojure_core_fn_1274_bit_or_1279(x_1,y_2){ +return (clojure.lang.Numbers.or(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn bit-xor "Bitwise exclusive or" {:inline (fn [x y] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/xor)) (clojure.core/list x) (clojure.core/list y)))))} [x y] (. clojure.lang.Numbers xor x y)) +//--- +(function __clojure_core_fn_1283(){ +return (clojure.JS.def(clojure.core,"bit_xor",(function __clojure_core_fn_1283_bit_xor_1288(x_1,y_2){ +return (clojure.lang.Numbers.xor(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn bit-and-not "Bitwise and with complement" [x y] (. clojure.lang.Numbers andNot x y)) +//--- +(function __clojure_core_fn_1292(){ +return (clojure.JS.def(clojure.core,"bit_and_not",(function __clojure_core_fn_1292_bit_and_not_1294(x_1,y_2){ +return (clojure.lang.Numbers.andNot(x_1,y_2))})))}).apply(null,[]); + +//====== +//(defn bit-clear "Clear bit at index n" [x n] (. clojure.lang.Numbers clearBit x n)) +//--- +(function __clojure_core_fn_1298(){ +return (clojure.JS.def(clojure.core,"bit_clear",(function __clojure_core_fn_1298_bit_clear_1300(x_1,n_2){ +return (clojure.lang.Numbers.clearBit(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn bit-set "Set bit at index n" [x n] (. clojure.lang.Numbers setBit x n)) +//--- +(function __clojure_core_fn_1304(){ +return (clojure.JS.def(clojure.core,"bit_set",(function __clojure_core_fn_1304_bit_set_1306(x_1,n_2){ +return (clojure.lang.Numbers.setBit(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn bit-flip "Flip bit at index n" [x n] (. clojure.lang.Numbers flipBit x n)) +//--- +(function __clojure_core_fn_1310(){ +return (clojure.JS.def(clojure.core,"bit_flip",(function __clojure_core_fn_1310_bit_flip_1312(x_1,n_2){ +return (clojure.lang.Numbers.flipBit(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn bit-test "Test bit at index n" [x n] (. clojure.lang.Numbers testBit x n)) +//--- +(function __clojure_core_fn_1316(){ +return (clojure.JS.def(clojure.core,"bit_test",(function __clojure_core_fn_1316_bit_test_1318(x_1,n_2){ +return (clojure.lang.Numbers.testBit(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn bit-shift-left "Bitwise shift left" [x n] (. clojure.lang.Numbers shiftLeft x n)) +//--- +(function __clojure_core_fn_1322(){ +return (clojure.JS.def(clojure.core,"bit_shift_left",(function __clojure_core_fn_1322_bit_shift_left_1324(x_1,n_2){ +return (clojure.lang.Numbers.shiftLeft(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn bit-shift-right "Bitwise shift right" [x n] (. clojure.lang.Numbers shiftRight x n)) +//--- +(function __clojure_core_fn_1328(){ +return (clojure.JS.def(clojure.core,"bit_shift_right",(function __clojure_core_fn_1328_bit_shift_right_1330(x_1,n_2){ +return (clojure.lang.Numbers.shiftRight(x_1,n_2))})))}).apply(null,[]); + +//====== +//(defn even? "Returns true if n is even, throws an exception if n is not an integer" [n] (zero? (bit-and n 1))) +//--- +(function __clojure_core_fn_1334(){ +return (clojure.JS.def(clojure.core,"even_QMARK_",(function __clojure_core_fn_1334_even_QMARK_1336(n_1){ +return (clojure.lang.Numbers.isZero(clojure.lang.Numbers.and(n_1,(1))))})))}).apply(null,[]); + +//====== +//(defn odd? "Returns true if n is odd, throws an exception if n is not an integer" [n] (not (even? n))) +//--- +(function __clojure_core_fn_1340(){ +return (clojure.JS.def(clojure.core,"odd_QMARK_",(function __clojure_core_fn_1340_odd_QMARK_1342(n_1){ +return (clojure.core.not.apply(null,[clojure.core.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_core_fn_1346(){ +return (clojure.JS.def(clojure.core,"complement",(function __clojure_core_fn_1346_complement_1348(f_1){ +return (clojure.JS.variadic(0,(function __clojure_core_fn_1346_complement_1348_fn_1350(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.not.apply(null,[clojure.core.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_core_fn_1355(){ +return (clojure.JS.def(clojure.core,"constantly",(function __clojure_core_fn_1355_constantly_1357(x_1){ +return (clojure.JS.variadic(0,(function __clojure_core_fn_1355_constantly_1357_fn_1359(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (x_1)})))})))}).apply(null,[]); + +//====== +//(defn identity "Returns its argument." [x] x) +//--- +(function __clojure_core_fn_1364(){ +return (clojure.JS.def(clojure.core,"identity",(function __clojure_core_fn_1364_identity_1366(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_core_fn_1376(){ +return (clojure.JS.def(clojure.core,"peek",(function __clojure_core_fn_1376_peek_1378(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_core_fn_1382(){ +return (clojure.JS.def(clojure.core,"pop",(function __clojure_core_fn_1382_pop_1384(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))) +// Skipping: (defn get "Returns the value mapped to key, not-found or nil if key not present." ([map key] (. clojure.lang.RT (get map key))) ([map key not-found] (. clojure.lang.RT (get map key not-found)))) + +//====== +//(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_core_fn_1408(){ +return (clojure.JS.def(clojure.core,"dissoc",clojure.JS.variadic(2,(function __clojure_core_fn_1408_dissoc_1410(map_1,key_2){switch(arguments.length){ +case 1:return (map_1) +case 2:return (clojure.lang.RT.dissoc(map_1,key_2))} +var _cnt,_rtn,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((ret_4=clojure.core.dissoc.apply(null,[map_1,key_2])), +((ks_3)?((_cnt=1,_rtn=[ret_4,clojure.core.first.apply(null,[ks_3]),clojure.core.rest.apply(null,[ks_3])],map_1=_rtn[0],key_2=_rtn[1],ks_3=_rtn[2])):(ret_4))) +}while(_cnt);return _rtn;}))))}).apply(null,[]); + +//====== +//(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_core_fn_1416(){ +return (clojure.JS.def(clojure.core,"disj",clojure.JS.variadic(2,(function __clojure_core_fn_1416_disj_1418(set_1,key_2){switch(arguments.length){ +case 1:return (set_1) +case 2:return ((set_1).disjoin(key_2))} +var _cnt,_rtn,ret_4,ks_3=clojure.JS.rest_args(this,arguments,2); +do{_cnt=0;_rtn=((ret_4=clojure.core.disj.apply(null,[set_1,key_2])), +((ks_3)?((_cnt=1,_rtn=[ret_4,clojure.core.first.apply(null,[ks_3]),clojure.core.rest.apply(null,[ks_3])],set_1=_rtn[0],key_2=_rtn[1],ks_3=_rtn[2])):(ret_4))) +}while(_cnt);return _rtn;}))))}).apply(null,[]); +// Skipping: (defn find "Returns the map entry for key, or nil if key not present." [map key] (. clojure.lang.RT (find map key))) + +//====== +//(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_core_fn_1430(){ +return (clojure.JS.def(clojure.core,"select_keys",(function __clojure_core_fn_1430_select_keys_1432(map_1,keyseq_2){ +var ret_3,keys_4,entry_5; +return (((function __loop(){var _rtn,_cnt;(ret_3=clojure.lang.PersistentArrayMap.EMPTY), +(keys_4=clojure.core.seq.apply(null,[keyseq_2]));do{_cnt=0; +_rtn=((keys_4)?(((entry_5=clojure.lang.RT.find(map_1,clojure.core.first.apply(null,[keys_4]))), +(_cnt=1,_rtn=[((entry_5)?(clojure.core.conj.apply(null,[ret_3,entry_5])):(ret_3)),clojure.core.rest.apply(null,[keys_4])],ret_3=_rtn[0],keys_4=_rtn[1]))):(ret_3))}while(_cnt);return _rtn;})()))})))}).apply(null,[]); +// Skipping: (defn keys "Returns a sequence of the map's keys." [map] (. clojure.lang.RT (keys map))) +// Skipping: (defn vals "Returns a sequence of the map's values." [map] (. clojure.lang.RT (vals map))) + +//====== +//(defn key "Returns the key of the map entry." [e] (. e (getKey))) +//--- +(function __clojure_core_fn_1448(){ +return (clojure.JS.def(clojure.core,"key",(function __clojure_core_fn_1448_key_1450(e_1){ +return ((e_1).getKey())})))}).apply(null,[]); + +//====== +//(defn val "Returns the value in the map entry." [e] (. e (getValue))) +//--- +(function __clojure_core_fn_1454(){ +return (clojure.JS.def(clojure.core,"val",(function __clojure_core_fn_1454_val_1456(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_core_fn_1460(){ +return (clojure.JS.def(clojure.core,"rseq",(function __clojure_core_fn_1460_rseq_1462(rev_1){ +return ((rev_1).rseq())})))}).apply(null,[]); + +//====== +//(defn name "Returns the name String of a symbol or keyword." [x] (. x (getName))) +//--- +(function __clojure_core_fn_1466(){ +return (clojure.JS.def(clojure.core,"name",(function __clojure_core_fn_1466_name_1468(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_core_fn_1472(){ +return (clojure.JS.def(clojure.core,"namespace",(function __clojure_core_fn_1472_namespace_1474(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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote lockee__1478__auto__)) (clojure.core/list x)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote try)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote monitor-enter)) (clojure.core/list (quote lockee__1478__auto__)))) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote finally)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote monitor-exit)) (clojure.core/list (quote lockee__1478__auto__)))))))))) +// 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.core/concat (clojure.core/list (quote .)) (clojure.core/list x) (clojure.core/list form))) ([x form & more] (clojure.core/concat (clojure.core/list (quote ..)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list x) (clojure.core/list form))) more))) +// Skipping: (defmacro -> "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.core/concat (clojure.core/list (first form)) (clojure.core/list x) (rest form)) (list form x))) ([x form & more] (clojure.core/concat (clojure.core/list (quote clojure.core/->)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/->)) (clojure.core/list x) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/defmulti)) (clojure.core/list name) (clojure.core/list dispatch-fn) (clojure.core/list :default))) ([name dispatch-fn default-val] (clojure.core/concat (clojure.core/list (quote def)) (clojure.core/list (with-meta name (assoc (clojure.core/meta name) :tag (quote clojure.lang.MultiFn)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote new)) (clojure.core/list (quote clojure.lang.MultiFn)) (clojure.core/list dispatch-fn) (clojure.core/list default-val)))))) +// Skipping: (defmacro defmethod "Creates and installs a new method of multimethod associated with dispatch-value. " [multifn dispatch-val & fn-tail] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list multifn) (clojure.core/list (quote clojure.core/addMethod)) (clojure.core/list dispatch-val) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/fn)) fn-tail)))) + +//====== +//(defn remove-method "Removes the method of multimethod associated\twith dispatch-value." [multifn dispatch-val] (. multifn removeMethod dispatch-val)) +//--- +(function __clojure_core_fn_1530(){ +return (clojure.JS.def(clojure.core,"remove_method",(function __clojure_core_fn_1530_remove_method_1532(multifn_1,dispatch_val_2){ +return ((multifn_1).removeMethod(dispatch_val_2))})))}).apply(null,[]); + +//====== +//(defn prefer-method "Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y when there is a conflict" [multifn dispatch-val-x dispatch-val-y] (. multifn preferMethod dispatch-val-x dispatch-val-y)) +//--- +(function __clojure_core_fn_1536(){ +return (clojure.JS.def(clojure.core,"prefer_method",(function __clojure_core_fn_1536_prefer_method_1538(multifn_1,dispatch_val_x_2,dispatch_val_y_3){ +return ((multifn_1).preferMethod(dispatch_val_x_2,dispatch_val_y_3))})))}).apply(null,[]); +// Skipping: (defmacro assert-args [fnname & pairs] (clojure.core/concat (clojure.core/list (quote do)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when-not)) (clojure.core/list (first pairs)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote throw)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote java.lang.IllegalArgumentException.)) (clojure.core/list (str fnname " requires " (second pairs))))))))) (clojure.core/list (let [more (rrest pairs)] (when more (list* (quote clojure.core/assert-args) fnname more)))))) +// Skipping: (defmacro binding "binding => var-symbol init-expr \n\n Creates new bindings for the (already-existing) vars, with the\n supplied initial values, executes the exprs in an implicit do, then\n re-establishes the bindings that existed before." [bindings & body] (assert-args binding (vector? bindings) "a vector for its binding" (even? (count bindings)) "an even number of forms in binding vector") (let [var-ize (fn [var-vals] (loop [ret [] vvs (seq var-vals)] (if vvs (recur (conj (conj ret (clojure.core/concat (clojure.core/list (quote var)) (clojure.core/list (first vvs)))) (second vvs)) (rest (rest vvs))) (seq ret))))] (clojure.core/concat (clojure.core/list (quote do)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Var)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/pushThreadBindings)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/hash-map)) (var-ize bindings))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote try)) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote finally)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Var)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/popThreadBindings))))))))))))) + +//====== +//(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_core_fn_1566(){ +return (clojure.JS.def(clojure.core,"find_var",(function __clojure_core_fn_1566_find_var_1568(sym_1){ +return (clojure.lang.Var.find(sym_1))})))}).apply(null,[]); + +//====== +//(defn setup-reference [r options] (let [opts (apply hash-map options)] (when (:meta opts) (.resetMeta r (:meta opts))) (when (:validator opts) (.setValidator r (:validator opts))) r)) +//--- +(function __clojure_core_fn_1572(){ +return (clojure.JS.def(clojure.core,"setup_reference",(function __clojure_core_fn_1572_setup_reference_1574(r_1,options_2){ +var opts_3; +return (((opts_3=clojure.core.apply.apply(null,[clojure.core.hash_map,options_2])), +((clojure.core.keyword("","meta").apply(null,[opts_3]))?((r_1).resetMeta(clojure.core.keyword("","meta").apply(null,[opts_3]))):(null)), +((clojure.core.keyword("","validator").apply(null,[opts_3]))?((r_1).setValidator(clojure.core.keyword("","validator").apply(null,[opts_3]))):(null)), +r_1))})))}).apply(null,[]); + +//====== +//(defn agent "Creates and returns an agent with an initial value of state and\n zero or more options (in any order):\n \n :meta metadata-map\n \n :validator validate-fn\n\n If metadata-map is supplied, it will be come the metadata on the\n agent. validate-fn must be nil or a side-effect-free fn of one\n 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 return false or throw an exception." ([state] (new clojure.lang.Agent state)) ([state & options] (setup-reference (agent state) options))) +//--- +(function __clojure_core_fn_1578(){ +return (clojure.JS.def(clojure.core,"agent",clojure.JS.variadic(1,(function __clojure_core_fn_1578_agent_1580(state_1){switch(arguments.length){ +case 1:return ((new clojure.lang.Agent(state_1)))} +var options_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.setup_reference.apply(null,[clojure.core.agent.apply(null,[state_1]),options_2]))}))))}).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_core_fn_1585(){ +return (clojure.JS.def(clojure.core,"send",clojure.JS.variadic(2,(function __clojure_core_fn_1585_send_1587(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_core_fn_1591(){ +return (clojure.JS.def(clojure.core,"send_off",clojure.JS.variadic(2,(function __clojure_core_fn_1591_send_off_1593(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 release-pending-sends "Normally, actions sent directly or indirectly during another action\n are held until the action completes (changes the agent's\n state). This function can be used to dispatch any pending sent\n actions immediately. This has no impact on actions sent during a\n transaction, which are still held until commit. If no action is\n occurring, does nothing. Returns the number of actions dispatched." [] (clojure.lang.Agent/releasePendingSends)) +//--- +(function __clojure_core_fn_1597(){ +return (clojure.JS.def(clojure.core,"release_pending_sends",(function __clojure_core_fn_1597_release_pending_sends_1599(){ +return (clojure.lang.Agent.releasePendingSends())})))}).apply(null,[]); + +//====== +//(defn add-watcher "Experimental.\n Adds a watcher to an agent/atom/var/ref reference. The watcher must\n be an Agent, and the action a function of the agent's state and one\n additional arg, the reference. Whenever the reference's state\n changes, any registered watchers will have their actions\n sent. send-type must be one of :send or :send-off. The actions will\n be sent after the reference's state is changed. Var watchers are\n triggered only by root binding changes, not thread-local set!s" [reference send-type watcher-agent action-fn] (.addWatch reference watcher-agent action-fn (= send-type :send-off))) +//--- +(function __clojure_core_fn_1603(){ +return (clojure.JS.def(clojure.core,"add_watcher",(function __clojure_core_fn_1603_add_watcher_1605(reference_1,send_type_2,watcher_agent_3,action_fn_4){ +return ((reference_1).addWatch(watcher_agent_3,action_fn_4,clojure.lang.Util.equal(send_type_2,clojure.core.keyword("","send-off"))))})))}).apply(null,[]); + +//====== +//(defn remove-watcher "Experimental.\n Removes a watcher (set by add-watcher) from a reference" [reference watcher-agent] (.removeWatch reference watcher-agent)) +//--- +(function __clojure_core_fn_1609(){ +return (clojure.JS.def(clojure.core,"remove_watcher",(function __clojure_core_fn_1609_remove_watcher_1611(reference_1,watcher_agent_2){ +return ((reference_1).removeWatch(watcher_agent_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_core_fn_1615(){ +return (clojure.JS.def(clojure.core,"agent_errors",(function __clojure_core_fn_1615_agent_errors_1617(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_core_fn_1621(){ +return (clojure.JS.def(clojure.core,"clear_agent_errors",(function __clojure_core_fn_1621_clear_agent_errors_1623(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_core_fn_1627(){ +return (clojure.JS.def(clojure.core,"shutdown_agents",(function __clojure_core_fn_1627_shutdown_agents_1629(){ +return (clojure.lang.Agent.shutdown())})))}).apply(null,[]); + +//====== +//(defn ref "Creates and returns a Ref with an initial value of x and zero or\n more options (in any order):\n \n :meta metadata-map\n \n :validator validate-fn\n\n If metadata-map is supplied, it will be come the metadata on the\n ref. validate-fn must be nil or a side-effect-free fn of one\n 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 return false or throw an exception. validate-fn will be called on\n transaction commit, when all refs have their final values." ([x] (new clojure.lang.Ref x)) ([x & options] (setup-reference (ref x) options))) +//--- +(function __clojure_core_fn_1633(){ +return (clojure.JS.def(clojure.core,"ref",clojure.JS.variadic(1,(function __clojure_core_fn_1633_ref_1635(x_1){switch(arguments.length){ +case 1:return ((new clojure.lang.Ref(x_1)))} +var options_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.setup_reference.apply(null,[clojure.core.ref.apply(null,[x_1]),options_2]))}))))}).apply(null,[]); + +//====== +//(defn deref "Also reader macro: @ref/@agent/@var/@atom Within a transaction,\n returns the in-transaction-value of ref, else returns the\n most-recently-committed value of ref. When applied to a var, agent\n or atom, returns its current state." [ref] (. ref (get))) +//--- +(function __clojure_core_fn_1640(){ +return (clojure.JS.def(clojure.core,"deref",(function __clojure_core_fn_1640_deref_1642(ref_1){ +return ((ref_1).get())})))}).apply(null,[]); + +//====== +//(defn atom "Creates and returns an Atom with an initial value of x and zero or\n more options (in any order):\n \n :meta metadata-map\n \n :validator validate-fn\n\n If metadata-map is supplied, it will be come the metadata on the\n atom. validate-fn must be nil or a side-effect-free fn of one\n 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 return false or throw an exception." ([x] (new clojure.lang.Atom x)) ([x & options] (setup-reference (atom x) options))) +//--- +(function __clojure_core_fn_1646(){ +return (clojure.JS.def(clojure.core,"atom",clojure.JS.variadic(1,(function __clojure_core_fn_1646_atom_1648(x_1){switch(arguments.length){ +case 1:return ((new clojure.lang.Atom(x_1)))} +var options_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.setup_reference.apply(null,[clojure.core.atom.apply(null,[x_1]),options_2]))}))))}).apply(null,[]); + +//====== +//(defn swap! "Atomically swaps the value of atom to be:\n (apply f current-value-of-atom args). Note that f may be called\n multiple times, and thus should be free of side effects. Returns\n the value that was swapped in." [atom f & args] (.swap atom f args)) +//--- +(function __clojure_core_fn_1653(){ +return (clojure.JS.def(clojure.core,"swap_BANG_",clojure.JS.variadic(2,(function __clojure_core_fn_1653_swap_BANG_1655(atom_1,f_2){ +var args_3=clojure.JS.rest_args(this,arguments,2); +return ((atom_1).swap(f_2,args_3))}))))}).apply(null,[]); + +//====== +//(defn compare-and-set! "Atomically sets the value of atom to newval if and only if the\n current value of the atom is identical to oldval. Returns true if\n set happened, else false" [atom oldval newval] (.compareAndSet atom oldval newval)) +//--- +(function __clojure_core_fn_1659(){ +return (clojure.JS.def(clojure.core,"compare_and_set_BANG_",(function __clojure_core_fn_1659_compare_and_set_BANG_1661(atom_1,oldval_2,newval_3){ +return ((atom_1).compareAndSet(oldval_2,newval_3))})))}).apply(null,[]); + +//====== +//(defn reset! "Sets the value of atom to newval without regard for the\n current value. Returns newval." [atom newval] (.reset atom newval)) +//--- +(function __clojure_core_fn_1665(){ +return (clojure.JS.def(clojure.core,"reset_BANG_",(function __clojure_core_fn_1665_reset_BANG_1667(atom_1,newval_2){ +return ((atom_1).reset(newval_2))})))}).apply(null,[]); + +//====== +//(defn set-validator! "Sets the validator-fn for a var/ref/agent/atom. 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 return false or 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_core_fn_1671(){ +return (clojure.JS.def(clojure.core,"set_validator_BANG_",(function __clojure_core_fn_1671_set_validator_BANG_1673(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/atom." [iref] (. iref (getValidator))) +//--- +(function __clojure_core_fn_1677(){ +return (clojure.JS.def(clojure.core,"get_validator",(function __clojure_core_fn_1677_get_validator_1679(iref_1){ +return ((iref_1).getValidator())})))}).apply(null,[]); + +//====== +//(defn alter-meta! "Atomically sets the metadata for a namespace/var/ref/agent/atom to be: \n \n (apply f its-current-meta args) \n \n f must be free of side-effects" [iref f & args] (.alterMeta iref f args)) +//--- +(function __clojure_core_fn_1683(){ +return (clojure.JS.def(clojure.core,"alter_meta_BANG_",clojure.JS.variadic(2,(function __clojure_core_fn_1683_alter_meta_BANG_1685(iref_1,f_2){ +var args_3=clojure.JS.rest_args(this,arguments,2); +return ((iref_1).alterMeta(f_2,args_3))}))))}).apply(null,[]); + +//====== +//(defn reset-meta! "Atomically resets the metadata for a namespace/var/ref/agent/atom" [iref metadata-map] (.resetMeta iref metadata-map)) +//--- +(function __clojure_core_fn_1689(){ +return (clojure.JS.def(clojure.core,"reset_meta_BANG_",(function __clojure_core_fn_1689_reset_meta_BANG_1691(iref_1,metadata_map_2){ +return ((iref_1).resetMeta(metadata_map_2))})))}).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_core_fn_1695(){ +return (clojure.JS.def(clojure.core,"commute",clojure.JS.variadic(2,(function __clojure_core_fn_1695_commute_1697(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_core_fn_1701(){ +return (clojure.JS.def(clojure.core,"alter",clojure.JS.variadic(2,(function __clojure_core_fn_1701_alter_1703(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_core_fn_1707(){ +return (clojure.JS.def(clojure.core,"ref_set",(function __clojure_core_fn_1707_ref_set_1709(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_core_fn_1713(){ +return (clojure.JS.def(clojure.core,"ensure",(function __clojure_core_fn_1713_ensure_1715(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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.LockingTransaction)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/runInTransaction)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/fn)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat))) body)))))) +// Skipping: (defmacro io! "If an io! block occurs in a transaction, throws an\n IllegalStateException, else runs body in an implicit do. If the\n first expression in body is a literal string, will use that as the\n exception message." [& body] (let [message (when (string? (first body)) (first body)) body (if message (rest body) body)] (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.lang.LockingTransaction/isRunning)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote throw)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote new)) (clojure.core/list (quote java.lang.IllegalStateException)) (clojure.core/list (or message "I/O in transaction")))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote do)) body))))) + +//====== +//(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_core_fn_1739(){ +return (clojure.JS.def(clojure.core,"comp",clojure.JS.variadic(0,(function __clojure_core_fn_1739_comp_1741(){ +var fs_2,fs_1=clojure.JS.rest_args(this,arguments,0); +return (((fs_2=clojure.core.reverse.apply(null,[fs_1])), +clojure.JS.variadic(0,(function __clojure_core_fn_1739_comp_1741_fn_1743(){ +var ret_2,fs_3,args_1=clojure.JS.rest_args(this,arguments,0); +return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.core.apply.apply(null,[clojure.core.first.apply(null,[fs_2]),args_1])), +(fs_3=clojure.core.rest.apply(null,[fs_2]));do{_cnt=0; +_rtn=((fs_3)?((_cnt=1,_rtn=[clojure.core.first.apply(null,[fs_3]).apply(null,[ret_2]),clojure.core.rest.apply(null,[fs_3])],ret_2=_rtn[0],fs_3=_rtn[1])):(ret_2))}while(_cnt);return _rtn;})()))}))))}))))}).apply(null,[]); + +//====== +//(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_core_fn_1748(){ +return (clojure.JS.def(clojure.core,"partial",clojure.JS.variadic(4,(function __clojure_core_fn_1748_partial_1750(f_1,arg1_2,arg2_3,arg3_4){switch(arguments.length){ +case 2:return (clojure.JS.variadic(0,(function __clojure_core_fn_1748_partial_1750_fn_1752(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[f_1,arg1_2,args_1]))}))) +case 3:return (clojure.JS.variadic(0,(function __clojure_core_fn_1748_partial_1750_fn_1756(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[f_1,arg1_2,arg2_3,args_1]))}))) +case 4:return (clojure.JS.variadic(0,(function __clojure_core_fn_1748_partial_1750_fn_1760(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.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_core_fn_1748_partial_1750_fn_1764(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[f_1,arg1_2,arg2_3,arg3_4,clojure.core.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_core_fn_1769(){ +return (clojure.JS.def(clojure.core,"every_QMARK_",(function __clojure_core_fn_1769_every_QMARK_1771(pred_1,coll_2){ +var _cnt,_rtn,and__960__auto___3; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[coll_2]))?(((and__960__auto___3=pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])])), +((and__960__auto___3)?((_cnt=1,_rtn=[pred_1,clojure.core.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])):(and__960__auto___3)))):(true)) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(def not-every? (comp not every?)) +//--- +(function __clojure_core_fn_1776(){ +return (clojure.JS.def(clojure.core,"not_every_QMARK_",clojure.core.comp.apply(null,[clojure.core.not,clojure.core.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_core_fn_1779(){ +return (clojure.JS.def(clojure.core,"some",(function __clojure_core_fn_1779_some_1781(pred_1,coll_2){ +var _cnt,_rtn,or__974__auto___3; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[coll_2]))?(((or__974__auto___3=pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])])), +((or__974__auto___3)?(or__974__auto___3):((_cnt=1,_rtn=[pred_1,clojure.core.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1]))))):(null)) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(def not-any? (comp not some)) +//--- +(function __clojure_core_fn_1786(){ +return (clojure.JS.def(clojure.core,"not_any_QMARK_",clojure.core.comp.apply(null,[clojure.core.not,clojure.core.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__1789] (apply f p1__1789)) (step (conj colls c3 c2 c1)))))) +//--- +(function __clojure_core_fn_1790(){ +return (clojure.JS.def(clojure.core,"map",clojure.JS.variadic(4,(function __clojure_core_fn_1790_map_1792(f_1,c1_2,c2_3,c3_4){switch(arguments.length){ +case 2:var coll_2=arguments[1]; +return (((clojure.core.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_core_fn_1790_map_1792_fn_1795(G__1794_1){switch(arguments.length){ +case 0:return (f_1.apply(null,[clojure.core.first.apply(null,[coll_2])]))} +return (clojure.core.map.apply(null,[f_1,clojure.core.rest.apply(null,[coll_2])]))})))):(null))) +case 3:var and__960__auto___4; +return (((((and__960__auto___4=clojure.core.seq.apply(null,[c1_2])), +((and__960__auto___4)?(clojure.core.seq.apply(null,[c2_3])):(and__960__auto___4))))?((new clojure.lang.LazyCons((function __clojure_core_fn_1790_map_1792_fn_1801(G__1800_1){switch(arguments.length){ +case 0:return (f_1.apply(null,[clojure.core.first.apply(null,[c1_2]),clojure.core.first.apply(null,[c2_3])]))} +return (clojure.core.map.apply(null,[f_1,clojure.core.rest.apply(null,[c1_2]),clojure.core.rest.apply(null,[c2_3])]))})))):(null))) +case 4:var and__960__auto___5,and__960__auto___6; +return (((((and__960__auto___5=clojure.core.seq.apply(null,[c1_2])), +((and__960__auto___5)?(((and__960__auto___6=clojure.core.seq.apply(null,[c2_3])), +((and__960__auto___6)?(clojure.core.seq.apply(null,[c3_4])):(and__960__auto___6)))):(and__960__auto___5))))?((new clojure.lang.LazyCons((function __clojure_core_fn_1790_map_1792_fn_1807(G__1806_1){switch(arguments.length){ +case 0:return (f_1.apply(null,[clojure.core.first.apply(null,[c1_2]),clojure.core.first.apply(null,[c2_3]),clojure.core.first.apply(null,[c3_4])]))} +return (clojure.core.map.apply(null,[f_1,clojure.core.rest.apply(null,[c1_2]),clojure.core.rest.apply(null,[c2_3]),clojure.core.rest.apply(null,[c3_4])]))})))):(null)))} +var step_6,colls_5=clojure.JS.rest_args(this,arguments,4); +return (((step_6=(function __clojure_core_fn_1790_map_1792_step_1812(cs_1){ +var step_0=arguments.callee; +return (((clojure.core.every_QMARK_.apply(null,[clojure.core.seq,cs_1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_1790_map_1792_step_1812_fn_1814(G__1813_1){switch(arguments.length){ +case 0:return (clojure.core.map.apply(null,[clojure.core.first,cs_1]))} +return (step_0.apply(null,[clojure.core.map.apply(null,[clojure.core.rest,cs_1])]))})))):(null)))})), +clojure.core.map.apply(null,[(function __clojure_core_fn_1790_map_1792_fn_1819(p1__1789_1){ +return (clojure.core.apply.apply(null,[f_1,p1__1789_1]))}),step_6.apply(null,[clojure.core.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_core_fn_1827(){ +return (clojure.JS.def(clojure.core,"mapcat",clojure.JS.variadic(1,(function __clojure_core_fn_1827_mapcat_1829(f_1){ +var colls_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.apply.apply(null,[clojure.core.concat,clojure.core.apply.apply(null,[clojure.core.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_core_fn_1833(){ +return (clojure.JS.def(clojure.core,"filter",(function __clojure_core_fn_1833_filter_1835(pred_1,coll_2){ +var _cnt,_rtn; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[coll_2]))?(((pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])]))?((new clojure.lang.LazyCons((function __clojure_core_fn_1833_filter_1835_fn_1838(G__1837_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll_2]))} +return (clojure.core.filter.apply(null,[pred_1,clojure.core.rest.apply(null,[coll_2])]))})))):((_cnt=1,_rtn=[pred_1,clojure.core.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])))):(null)) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(defn remove "Returns a lazy seq of the items in coll for which\n (pred item) returns false. pred must be free of side-effects." [pred coll] (when (seq coll) (if (pred (first coll)) (recur pred (rest coll)) (lazy-cons (first coll) (remove pred (rest coll)))))) +//--- +(function __clojure_core_fn_1844(){ +return (clojure.JS.def(clojure.core,"remove",(function __clojure_core_fn_1844_remove_1846(pred_1,coll_2){ +var _cnt,_rtn; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[coll_2]))?(((pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])]))?((_cnt=1,_rtn=[pred_1,clojure.core.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])):((new clojure.lang.LazyCons((function __clojure_core_fn_1844_remove_1846_fn_1849(G__1848_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll_2]))} +return (clojure.core.remove.apply(null,[pred_1,clojure.core.rest.apply(null,[coll_2])]))})))))):(null)) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(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) (when (> n 1) (take (dec n) (rest coll)))))) +//--- +(function __clojure_core_fn_1855(){ +return (clojure.JS.def(clojure.core,"take",(function __clojure_core_fn_1855_take_1857(n_1,coll_2){ +var and__960__auto___3; +return (((((and__960__auto___3=clojure.lang.Numbers.isPos(n_1)), +((and__960__auto___3)?(clojure.core.seq.apply(null,[coll_2])):(and__960__auto___3))))?((new clojure.lang.LazyCons((function __clojure_core_fn_1855_take_1857_fn_1860(G__1859_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll_2]))} +return (((clojure.lang.Numbers.gt(n_1,(1)))?(clojure.core.take.apply(null,[clojure.lang.Numbers.dec(n_1),clojure.core.rest.apply(null,[coll_2])])):(null)))})))):(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_core_fn_1867(){ +return (clojure.JS.def(clojure.core,"take_while",(function __clojure_core_fn_1867_take_while_1869(pred_1,coll_2){ +var and__960__auto___3; +return (((((and__960__auto___3=clojure.core.seq.apply(null,[coll_2])), +((and__960__auto___3)?(pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])])):(and__960__auto___3))))?((new clojure.lang.LazyCons((function __clojure_core_fn_1867_take_while_1869_fn_1872(G__1871_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll_2]))} +return (clojure.core.take_while.apply(null,[pred_1,clojure.core.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_core_fn_1879(){ +return (clojure.JS.def(clojure.core,"drop",(function __clojure_core_fn_1879_drop_1881(n_1,coll_2){ +var _cnt,_rtn,and__960__auto___3; +do{_cnt=0;_rtn=((((and__960__auto___3=clojure.lang.Numbers.isPos(n_1)), +((and__960__auto___3)?(clojure.core.seq.apply(null,[coll_2])):(and__960__auto___3))))?((_cnt=1,_rtn=[clojure.lang.Numbers.dec(n_1),clojure.core.rest.apply(null,[coll_2])],n_1=_rtn[0],coll_2=_rtn[1])):(clojure.core.seq.apply(null,[coll_2]))) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(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_core_fn_1886(){ +return (clojure.JS.def(clojure.core,"drop_last",(function __clojure_core_fn_1886_drop_last_1888(n_1,s_2){switch(arguments.length){ +case 1:var s_1=arguments[0]; +return (clojure.core.drop_last.apply(null,[(1),s_1]))} +return (clojure.core.map.apply(null,[(function __clojure_core_fn_1886_drop_last_1888_fn_1891(x_1,__2){ +return (x_1)}),clojure.core.seq.apply(null,[s_2]),clojure.core.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_core_fn_1896(){ +return (clojure.JS.def(clojure.core,"drop_while",(function __clojure_core_fn_1896_drop_while_1898(pred_1,coll_2){ +var _cnt,_rtn,and__960__auto___3; +do{_cnt=0;_rtn=((((and__960__auto___3=clojure.core.seq.apply(null,[coll_2])), +((and__960__auto___3)?(pred_1.apply(null,[clojure.core.first.apply(null,[coll_2])])):(and__960__auto___3))))?((_cnt=1,_rtn=[pred_1,clojure.core.rest.apply(null,[coll_2])],pred_1=_rtn[0],coll_2=_rtn[1])):(clojure.core.seq.apply(null,[coll_2]))) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(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_core_fn_1903(){ +return (clojure.JS.def(clojure.core,"cycle",(function __clojure_core_fn_1903_cycle_1905(coll_1){ +var rep_2; +return (((clojure.core.seq.apply(null,[coll_1]))?(((rep_2=(function __clojure_core_fn_1903_cycle_1905_thisfn_1907(xs_1){ +var _cnt,_rtn,thisfn_0=arguments.callee; +do{_cnt=0;_rtn=((xs_1)?((new clojure.lang.LazyCons((function __clojure_core_fn_1903_cycle_1905_thisfn_1907_fn_1909(G__1908_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[xs_1]))} +return (thisfn_0.apply(null,[clojure.core.rest.apply(null,[xs_1])]))})))):((_cnt=1,_rtn=[clojure.core.seq.apply(null,[coll_1])],xs_1=_rtn[0]))) +}while(_cnt);return _rtn;})), +rep_2.apply(null,[clojure.core.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_core_fn_1916(){ +return (clojure.JS.def(clojure.core,"split_at",(function __clojure_core_fn_1916_split_at_1918(n_1,coll_2){ +return (clojure.JS.lit_vector([clojure.core.take.apply(null,[n_1,coll_2]),clojure.core.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_core_fn_1922(){ +return (clojure.JS.def(clojure.core,"split_with",(function __clojure_core_fn_1922_split_with_1924(pred_1,coll_2){ +return (clojure.JS.lit_vector([clojure.core.take_while.apply(null,[pred_1,coll_2]),clojure.core.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_core_fn_1928(){ +return (clojure.JS.def(clojure.core,"repeat",(function __clojure_core_fn_1928_repeat_1930(x_1){ +return ((new clojure.lang.LazyCons((function __clojure_core_fn_1928_repeat_1930_fn_1933(G__1932_1){switch(arguments.length){ +case 0:return (x_1)} +return (clojure.core.repeat.apply(null,[x_1]))}))))})))}).apply(null,[]); + +//====== +//(defn replicate "Returns a lazy seq of n xs." [n x] (take n (repeat x))) +//--- +(function __clojure_core_fn_1939(){ +return (clojure.JS.def(clojure.core,"replicate",(function __clojure_core_fn_1939_replicate_1941(n_1,x_2){ +return (clojure.core.take.apply(null,[n_1,clojure.core.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_core_fn_1945(){ +return (clojure.JS.def(clojure.core,"iterate",(function __clojure_core_fn_1945_iterate_1947(f_1,x_2){ +return ((new clojure.lang.LazyCons((function __clojure_core_fn_1945_iterate_1947_fn_1950(G__1949_1){switch(arguments.length){ +case 0:return (x_2)} +return (clojure.core.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) (>= start clojure.lang.RT/IntegerMinValue) (<= 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)))) +//--- +(function __clojure_core_fn_1956(){ +return (clojure.JS.def(clojure.core,"range",(function __clojure_core_fn_1956_range_1958(start_1,end_2,step_3){switch(arguments.length){ +case 1:var and__960__auto___2,end_1=arguments[0]; +return (((((and__960__auto___2=clojure.lang.Numbers.gt(end_1,(0))), +((and__960__auto___2)?(clojure.lang.Numbers.lte(end_1,clojure.JS.getOrRun(clojure.lang.RT,"IntegerMaxValue"))):(and__960__auto___2))))?((new clojure.lang.Range((0),end_1))):(clojure.core.take.apply(null,[end_1,clojure.core.iterate.apply(null,[clojure.core.inc,(0)])])))) +case 2:var and__960__auto___3,and__960__auto___4; +return (((((and__960__auto___3=clojure.lang.Numbers.lt(start_1,end_2)), +((and__960__auto___3)?(((and__960__auto___4=clojure.lang.Numbers.gte(start_1,clojure.JS.getOrRun(clojure.lang.RT,"IntegerMinValue"))), +((and__960__auto___4)?(clojure.lang.Numbers.lte(end_2,clojure.JS.getOrRun(clojure.lang.RT,"IntegerMaxValue"))):(and__960__auto___4)))):(and__960__auto___3))))?((new clojure.lang.Range(start_1,end_2))):(clojure.core.take.apply(null,[clojure.lang.Numbers.minus(end_2,start_1),clojure.core.iterate.apply(null,[clojure.core.inc,start_1])]))))} +return (clojure.core.take_while.apply(null,[clojure.core.partial.apply(null,[((clojure.lang.Numbers.isPos(step_3))?(clojure.core._GT_):(clojure.core._LT_)),end_2]),clojure.core.iterate.apply(null,[clojure.core.partial.apply(null,[clojure.core._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] (when (some identity maps) (reduce (fn* [p1__1967 p2__1968] (conj (or p1__1967 {}) p2__1968)) maps))) +//--- +(function __clojure_core_fn_1969(){ +return (clojure.JS.def(clojure.core,"merge",clojure.JS.variadic(0,(function __clojure_core_fn_1969_merge_1971(){ +var maps_1=clojure.JS.rest_args(this,arguments,0); +return (((clojure.core.some.apply(null,[clojure.core.identity,maps_1]))?(clojure.core.reduce.apply(null,[(function __clojure_core_fn_1969_merge_1971_fn_1973(p1__1967_1,p2__1968_2){ +var or__974__auto___3; +return (clojure.core.conj.apply(null,[((or__974__auto___3=p1__1967_1), +((or__974__auto___3)?(or__974__auto___3):(clojure.lang.PersistentArrayMap.EMPTY))),p2__1968_2]))}),maps_1])):(null)))}))))}).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] (when (some identity 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 (or m1 {}) (seq m2)))] (reduce merge2 maps)))) +//--- +(function __clojure_core_fn_1979(){ +return (clojure.JS.def(clojure.core,"merge_with",clojure.JS.variadic(1,(function __clojure_core_fn_1979_merge_with_1981(f_1){ +var merge_entry_3,merge2_4,maps_2=clojure.JS.rest_args(this,arguments,1); +return (((clojure.core.some.apply(null,[clojure.core.identity,maps_2]))?(((merge_entry_3=(function __clojure_core_fn_1979_merge_with_1981_merge_entry_1983(m_1,e_2){ +var k_3,v_4; +return (((k_3=clojure.core.key.apply(null,[e_2])), +(v_4=clojure.core.val.apply(null,[e_2])), +((clojure.core.contains_QMARK_.apply(null,[m_1,k_3]))?(clojure.core.assoc.apply(null,[m_1,k_3,f_1.apply(null,[m_1.apply(null,[k_3]),v_4])])):(clojure.core.assoc.apply(null,[m_1,k_3,v_4])))))})), +(merge2_4=(function __clojure_core_fn_1979_merge_with_1981_merge2_1986(m1_1,m2_2){ +var or__974__auto___3; +return (clojure.core.reduce.apply(null,[merge_entry_3,((or__974__auto___3=m1_1), +((or__974__auto___3)?(or__974__auto___3):(clojure.lang.PersistentArrayMap.EMPTY))),clojure.core.seq.apply(null,[m2_2])]))})), +clojure.core.reduce.apply(null,[merge2_4,maps_2]))):(null)))}))))}).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_core_fn_1992(){ +return (clojure.JS.def(clojure.core,"zipmap",(function __clojure_core_fn_1992_zipmap_1994(keys_1,vals_2){ +var map_3,ks_4,vs_5,and__960__auto___6; +return (((function __loop(){var _rtn,_cnt;(map_3=clojure.lang.PersistentArrayMap.EMPTY), +(ks_4=clojure.core.seq.apply(null,[keys_1])), +(vs_5=clojure.core.seq.apply(null,[vals_2]));do{_cnt=0; +_rtn=((((and__960__auto___6=ks_4), +((and__960__auto___6)?(vs_5):(and__960__auto___6))))?((_cnt=1,_rtn=[clojure.core.assoc.apply(null,[map_3,clojure.core.first.apply(null,[ks_4]),clojure.core.first.apply(null,[vs_5])]),clojure.core.rest.apply(null,[ks_4]),clojure.core.rest.apply(null,[vs_5])],map_3=_rtn[0],ks_4=_rtn[1],vs_5=_rtn[2])):(map_3))}while(_cnt);return _rtn;})()))})))}).apply(null,[]); + +//====== +//(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_core_fn_1999(){ +return (clojure.JS.def(clojure.core,"line_seq",(function __clojure_core_fn_1999_line_seq_2001(rdr_1){ +var line_2; +return (((line_2=(rdr_1).readLine()), +((line_2)?((new clojure.lang.LazyCons((function __clojure_core_fn_1999_line_seq_2001_fn_2004(G__2003_1){switch(arguments.length){ +case 0:return (line_2)} +return (clojure.core.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_core_fn_2010(){ +return (clojure.JS.def(clojure.core,"comparator",(function __clojure_core_fn_2010_comparator_2012(pred_1){ +return ((function __clojure_core_fn_2010_comparator_2012_fn_2014(x_1,y_2){ +return (((pred_1.apply(null,[x_1,y_2]))?((-1)):(((pred_1.apply(null,[y_2,x_1]))?((1)):(((clojure.core.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))))) +//--- +(function __clojure_core_fn_2019(){ +return (clojure.JS.def(clojure.core,"sort",(function __clojure_core_fn_2019_sort_2021(comp_1,coll_2){switch(arguments.length){ +case 1:var coll_1=arguments[0]; +return (clojure.core.sort.apply(null,[clojure.core.compare,coll_1]))} +var and__960__auto___3,a_3; +return (((((and__960__auto___3=coll_2), +((and__960__auto___3)?(clojure.core.not.apply(null,[clojure.lang.Numbers.isZero(clojure.core.count.apply(null,[coll_2]))])):(and__960__auto___3))))?(((a_3=clojure.core.to_array.apply(null,[coll_2])), +clojure.lang.RT.sortArray(a_3,comp_1), +clojure.core.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_core_fn_2027(){ +return (clojure.JS.def(clojure.core,"sort_by",(function __clojure_core_fn_2027_sort_by_2029(keyfn_1,comp_2,coll_3){switch(arguments.length){ +case 2:var coll_2=arguments[1]; +return (clojure.core.sort_by.apply(null,[keyfn_1,clojure.core.compare,coll_2]))} +return (clojure.core.sort.apply(null,[(function __clojure_core_fn_2027_sort_by_2029_fn_2032(x_1,y_2){ +return ((comp_2).compare(keyfn_1.apply(null,[x_1]),keyfn_1.apply(null,[y_2])))}),coll_3]))})))}).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_core_fn_2037(){ +return (clojure.JS.def(clojure.core,"partition",(function __clojure_core_fn_2037_partition_2039(n_1,step_2,coll_3){switch(arguments.length){ +case 2:var coll_2=arguments[1]; +return (clojure.core.partition.apply(null,[n_1,n_1,coll_2]))} +var p_4; +return (((clojure.core.seq.apply(null,[coll_3]))?(((p_4=clojure.core.take.apply(null,[n_1,coll_3])), +((clojure.lang.Util.equal(n_1,clojure.core.count.apply(null,[p_4])))?((new clojure.lang.LazyCons((function __clojure_core_fn_2037_partition_2039_fn_2043(G__2042_1){switch(arguments.length){ +case 0:return (p_4)} +return (clojure.core.partition.apply(null,[n_1,step_2,clojure.core.drop.apply(null,[step_2,coll_3])]))})))):(null)))):(null)))})))}).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 bindings and filtering as provided by \"for\". Does not retain\n the head of the sequence. Returns nil." [seq-exprs & body] (assert-args doseq (vector? seq-exprs) "a vector for its binding" (even? (count seq-exprs)) "an even number of forms in binding vector") (let [groups (reduce (fn [groups p] (if (keyword? (first p)) (conj (pop groups) (apply assoc (peek groups) p)) (conj groups {:bind (first p), :seq (second p)}))) [] (partition 2 seq-exprs)) emit (fn emit [group & more-groups] (clojure.core/concat (clojure.core/list (quote clojure.core/loop)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote sq__2055__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/seq)) (clojure.core/list (:seq group))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (quote sq__2055__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (:bind group)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/first)) (clojure.core/list (quote sq__2055__auto__))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (or (:while group) true)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (or (:when group) true)) (clojure.core/list (if more-groups (apply emit more-groups) (clojure.core/concat (clojure.core/list (quote do)) body))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list (quote sq__2055__auto__))))))))))))))] (apply emit groups))) + +//====== +//(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_core_fn_2079(){ +return (clojure.JS.def(clojure.core,"dorun",(function __clojure_core_fn_2079_dorun_2081(n_1,coll_2){switch(arguments.length){ +case 1:var _cnt,_rtn,and__960__auto___2,or__974__auto___3,coll_1=arguments[0]; +do{_cnt=0;_rtn=((((and__960__auto___2=clojure.core.seq.apply(null,[coll_1])), +((and__960__auto___2)?(((or__974__auto___3=clojure.core.first.apply(null,[coll_1])), +((or__974__auto___3)?(or__974__auto___3):(true)))):(and__960__auto___2))))?((_cnt=1,_rtn=[clojure.core.rest.apply(null,[coll_1])],coll_1=_rtn[0])):(null)) +}while(_cnt);return _rtn;} +var _cnt,_rtn,and__960__auto___3,and__960__auto___4,or__974__auto___5; +do{_cnt=0;_rtn=((((and__960__auto___3=clojure.core.seq.apply(null,[coll_2])), +((and__960__auto___3)?(((and__960__auto___4=clojure.lang.Numbers.isPos(n_1)), +((and__960__auto___4)?(((or__974__auto___5=clojure.core.first.apply(null,[coll_2])), +((or__974__auto___5)?(or__974__auto___5):(true)))):(and__960__auto___4)))):(and__960__auto___3))))?((_cnt=1,_rtn=[clojure.lang.Numbers.dec(n_1),clojure.core.rest.apply(null,[coll_2])],n_1=_rtn[0],coll_2=_rtn[1])):(null)) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(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_core_fn_2091(){ +return (clojure.JS.def(clojure.core,"doall",(function __clojure_core_fn_2091_doall_2093(n_1,coll_2){switch(arguments.length){ +case 1:var coll_1=arguments[0]; +return (clojure.core.dorun.apply(null,[coll_1]), +coll_1)} +return (clojure.core.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] (io! "await in transaction" (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))))) + +//====== +//(defn await1 [a] (when (pos? (.getQueueCount a)) (await a)) a) +//--- +(function __clojure_core_fn_2108(){ +return (clojure.JS.def(clojure.core,"await1",(function __clojure_core_fn_2108_await1_2110(a_1){ +return (((clojure.lang.Numbers.isPos((a_1).getQueueCount()))?(clojure.core.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] (io! "await-for in transaction" (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 "bindings => name n\n\n Repeatedly executes body (presumably for side-effects) with name\n bound to integers from 0 through n-1." [bindings & body] (assert-args dotimes (vector? bindings) "a vector for its binding" (even? (count bindings)) "exactly 2 forms in binding vector") (let [i (first bindings) n (second bindings)] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote n__2124__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/int)) (clojure.core/list n)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/loop)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list i) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/int)) (clojure.core/list 0)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/<)) (clojure.core/list i) (clojure.core/list (quote n__2124__auto__)))) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked-inc)) (clojure.core/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-symbols-or-lists] (let [ns *ns*] (doseq [spec import-symbols-or-lists] (if (symbol? spec) (let [n (name spec) dot (.lastIndexOf n (. clojure.lang.RT (intCast \.))) c (symbol (.substring n (inc dot)))] (. ns (importClass c (. clojure.lang.RT (classForName (name spec)))))) (let [pkg (first spec) classes (rest spec)] (doseq [c classes] (. ns (importClass c (. clojure.lang.RT (classForName (str pkg "." c))))))))))) + +//====== +//(defn into-array "Returns an array with components set to the values in aseq. The array's\n component type is type if provided, or the type of the first value in\n aseq if present, or Object. All values in aseq must be compatible with\n the component type. Class objects for the primitive types can be obtained\n using, e.g., Integer/TYPE." ([aseq] (clojure.lang.RT/seqToTypedArray (seq aseq))) ([type aseq] (clojure.lang.RT/seqToTypedArray type (seq aseq)))) +//--- +(function __clojure_core_fn_2142(){ +return (clojure.JS.def(clojure.core,"into_array",(function __clojure_core_fn_2142_into_array_2144(type_1,aseq_2){switch(arguments.length){ +case 1:var aseq_1=arguments[0]; +return (clojure.lang.RT.seqToTypedArray(clojure.core.seq.apply(null,[aseq_1])))} +return (clojure.lang.RT.seqToTypedArray(type_1,clojure.core.seq.apply(null,[aseq_2])))})))}).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_core_fn_2149(){ +return (clojure.JS.def(clojure.core,"into",(function __clojure_core_fn_2149_into_2151(to_1,from_2){ +var _cnt,_rtn,ret_3,items_4; +do{_cnt=0;_rtn=((ret_3=to_1), +(items_4=clojure.core.seq.apply(null,[from_2])), +((items_4)?((_cnt=1,_rtn=[clojure.core.conj.apply(null,[ret_3,clojure.core.first.apply(null,[items_4])]),clojure.core.rest.apply(null,[items_4])],to_1=_rtn[0],from_2=_rtn[1])):(ret_3))) +}while(_cnt);return _rtn;})))}).apply(null,[]); + +//====== +//(defn array [& items] (into-array items)) +//--- +(function __clojure_core_fn_2155(){ +return (clojure.JS.def(clojure.core,"array",clojure.JS.variadic(0,(function __clojure_core_fn_2155_array_2157(){ +var items_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/num)) (clojure.core/list x)))))} [x] (. clojure.lang.Numbers (num x))) +//--- +(function __clojure_core_fn_2167(){ +return (clojure.JS.def(clojure.core,"num",(function __clojure_core_fn_2167_num_2172(x_1){ +return (clojure.lang.Numbers.num(x_1))})))}).apply(null,[]); + +//====== +//(defn int "Coerce to int" {:tag Integer, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/intCast)) (clojure.core/list x)))))} [x] (. clojure.lang.RT (intCast x))) +//--- +(function __clojure_core_fn_2176(){ +return (clojure.JS.def(clojure.core,"int",(function __clojure_core_fn_2176_int_2181(x_1){ +return (clojure.lang.RT.intCast(x_1))})))}).apply(null,[]); + +//====== +//(defn long "Coerce to long" {:tag Long, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/longCast)) (clojure.core/list x)))))} [x] (. x (longValue))) +//--- +(function __clojure_core_fn_2185(){ +return (clojure.JS.def(clojure.core,"long",(function __clojure_core_fn_2185_long_2190(x_1){ +return ((x_1).longValue())})))}).apply(null,[]); + +//====== +//(defn float "Coerce to float" {:tag Float, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/floatCast)) (clojure.core/list x)))))} [x] (. x (floatValue))) +//--- +(function __clojure_core_fn_2194(){ +return (clojure.JS.def(clojure.core,"float",(function __clojure_core_fn_2194_float_2199(x_1){ +return ((x_1).floatValue())})))}).apply(null,[]); + +//====== +//(defn double "Coerce to double" {:tag Double, :inline (fn [x] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/doubleCast)) (clojure.core/list x)))))} [x] (. x (doubleValue))) +//--- +(function __clojure_core_fn_2203(){ +return (clojure.JS.def(clojure.core,"double",(function __clojure_core_fn_2203_double_2208(x_1){ +return ((x_1).doubleValue())})))}).apply(null,[]); + +//====== +//(defn short "Coerce to short" {:tag Short} [x] (. x (shortValue))) +//--- +(function __clojure_core_fn_2212(){ +return (clojure.JS.def(clojure.core,"short_",(function __clojure_core_fn_2212_short_2214(x_1){ +return ((x_1).shortValue())})))}).apply(null,[]); + +//====== +//(defn byte "Coerce to byte" {:tag Byte} [x] (. x (byteValue))) +//--- +(function __clojure_core_fn_2218(){ +return (clojure.JS.def(clojure.core,"byte_",(function __clojure_core_fn_2218_byte_2220(x_1){ +return ((x_1).byteValue())})))}).apply(null,[]); + +//====== +//(defn char "Coerce to char" {:tag Character} [x] (. clojure.lang.RT (charCast x))) +//--- +(function __clojure_core_fn_2224(){ +return (clojure.JS.def(clojure.core,"char_",(function __clojure_core_fn_2224_char_2226(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_core_fn_2230(){ +return (clojure.JS.def(clojure.core,"boolean_",(function __clojure_core_fn_2230_boolean_2232(x_1){ +return (((x_1)?(true):(false)))})))}).apply(null,[]); +// Skipping: (defn number? "Returns true if x is a Number" [x] (instance? Number x)) +// Skipping: (defn integer? "Returns true if n is an integer" [n] (or (instance? Integer n) (instance? Long n) (instance? BigInteger n) (instance? Short n) (instance? Byte n))) + +//====== +//(defn ratio? "Returns true if n is a Ratio" [n] (instance? clojure.lang.Ratio n)) +//--- +(function __clojure_core_fn_2252(){ +return (clojure.JS.def(clojure.core,"ratio_QMARK_",(function __clojure_core_fn_2252_ratio_QMARK_2254(n_1){ +return (clojure.core.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))) + +//====== +//(defn rational? [n] "Returns true if n is a rational number" (or (integer? n) (ratio? n) (decimal? n))) +//--- +(function __clojure_core_fn_2271(){ +return (clojure.JS.def(clojure.core,"rational_QMARK_",(function __clojure_core_fn_2271_rational_QMARK_2273(n_1){ +var or__974__auto___2,or__974__auto___3; +return ("Returns true if n is a rational number", +((or__974__auto___2=clojure.core.integer_QMARK_.apply(null,[n_1])), +((or__974__auto___2)?(or__974__auto___2):(((or__974__auto___3=clojure.core.ratio_QMARK_.apply(null,[n_1])), +((or__974__auto___3)?(or__974__auto___3):(clojure.core.decimal_QMARK_.apply(null,[n_1]))))))))})))}).apply(null,[]); +// Skipping: (defn bigint "Coerce to BigInteger" {:tag BigInteger} [x] (cond (instance? BigInteger x) x (decimal? x) (.toBigInteger x) (number? x) (BigInteger/valueOf (long x)) :else (BigInteger. x))) +// Skipping: (defn bigdec "Coerce to BigDecimal" {:tag BigDecimal} [x] (cond (decimal? x) x (float? x) (. BigDecimal valueOf (double x)) (instance? BigInteger x) (BigDecimal. x) (number? x) (BigDecimal/valueOf (long x)) :else (BigDecimal. x))) + +//====== +//(def print-initialized false) +//--- +(function __clojure_core_fn_2291(){ +return (clojure.JS.def(clojure.core,"print_initialized",false))}).apply(null,[]); +// Skipping: (defmulti print-method (fn [x writer] (class x))) + +//====== +//(defmulti print-dup (fn [x writer] (class x))) +//--- +(function __clojure_core_fn_2300(){ +return (clojure.JS.def(clojure.core,"print_dup",(new clojure.lang.MultiFn((function __clojure_core_fn_2300_fn_2302(x_1,writer_2){ +return (clojure.core.class_.apply(null,[x_1]))}),clojure.core.keyword("","default")))))}).apply(null,[]); + +//====== +//(defn pr-on {:private true} [x w] (if *print-dup* (print-dup x w) (print-method x w)) nil) +//--- +(function __clojure_core_fn_2306(){ +return (clojure.JS.def(clojure.core,"pr_on",(function __clojure_core_fn_2306_pr_on_2308(x_1,w_2){ +return (((clojure.core._STAR_print_dup_STAR_)?(clojure.core.print_dup.apply(null,[x_1,w_2])):(clojure.core.print_method.apply(null,[x_1,w_2]))), +null)})))}).apply(null,[]); + +//====== +//(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] (pr-on x *out*)) ([x & more] (pr x) (. *out* (append \space)) (apply pr more))) +//--- +(function __clojure_core_fn_2312(){ +return (clojure.JS.def(clojure.core,"pr",clojure.JS.variadic(1,(function __clojure_core_fn_2312_pr_2314(x_1){switch(arguments.length){ +case 0:return (null) +case 1:return (clojure.core.pr_on.apply(null,[x_1,clojure.core._STAR_out_STAR_]))} +var more_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.pr.apply(null,[x_1]), +(clojure.core._STAR_out_STAR_).append(" "), +clojure.core.apply.apply(null,[clojure.core.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_core_fn_2320(){ +return (clojure.JS.def(clojure.core,"newline",(function __clojure_core_fn_2320_newline_2322(){ +return ((clojure.core._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_core_fn_2326(){ +return (clojure.JS.def(clojure.core,"flush",(function __clojure_core_fn_2326_flush_2328(){ +return ((clojure.core._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_core_fn_2332(){ +return (clojure.JS.def(clojure.core,"prn",clojure.JS.variadic(0,(function __clojure_core_fn_2332_prn_2334(){ +var more_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[clojure.core.pr,more_1]), +clojure.core.newline.apply(null,[]), +((clojure.core._STAR_flush_on_newline_STAR_)?(clojure.core.flush.apply(null,[])):(null)))}))))}).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_core_fn_2338(){ +return (clojure.JS.def(clojure.core,"print",clojure.JS.variadic(0,(function __clojure_core_fn_2338_print_2340(){ +var more_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_print_readably_STAR_,null])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.pr,more_1]))} +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_core_fn_2344(){ +return (clojure.JS.def(clojure.core,"println",clojure.JS.variadic(0,(function __clojure_core_fn_2344_println_2346(){ +var more_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_print_readably_STAR_,null])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.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 (boolean eof-error?) eof-value recursive?)))) +//--- +(function __clojure_core_fn_2350(){ +return (clojure.JS.def(clojure.core,"read",(function __clojure_core_fn_2350_read_2352(stream_1,eof_error_QMARK__2,eof_value_3,recursive_QMARK__4){switch(arguments.length){ +case 0:return (clojure.core.read.apply(null,[clojure.core._STAR_in_STAR_])) +case 1:return (clojure.core.read.apply(null,[stream_1,true,null])) +case 3:return (clojure.core.read.apply(null,[stream_1,eof_error_QMARK__2,eof_value_3,false]))} +return (clojure.lang.LispReader.read(stream_1,clojure.core.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_core_fn_2359(){ +return (clojure.JS.def(clojure.core,"read_line",(function __clojure_core_fn_2359_read_line_2361(){ +return ((clojure.core._STAR_in_STAR_).readLine())})))}).apply(null,[]); + +//====== +//(defn read-string "Reads one object from the string s" [s] (clojure.lang.RT/readString s)) +//--- +(function __clojure_core_fn_2365(){ +return (clojure.JS.def(clojure.core,"read_string",(function __clojure_core_fn_2365_read_string_2367(s_1){ +return (clojure.lang.RT.readString(s_1))})))}).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_core_fn_2371(){ +return (clojure.JS.def(clojure.core,"subvec",(function __clojure_core_fn_2371_subvec_2373(v_1,start_2,end_3){switch(arguments.length){ +case 2:return (clojure.core.subvec.apply(null,[v_1,start_2,clojure.core.count.apply(null,[v_1])]))} +return (clojure.lang.RT.subvec(v_1,start_2,end_3))})))}).apply(null,[]); +// Skipping: (defmacro with-open "bindings => [name init ...]\n\n Evaluates body in a try expression with names bound to the values\n of the inits, and a finally clause that calls (.close name) on each\n name in reverse order." [bindings & body] (assert-args with-open (vector? bindings) "a vector for its binding" (even? (count bindings)) "an even number of forms in binding vector") (cond (= (count bindings) 0) (clojure.core/concat (clojure.core/list (quote do)) body) (symbol? (bindings 0)) (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (subvec bindings 0 2)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote try)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/with-open)) (clojure.core/list (subvec bindings 2)) body)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote finally)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (bindings 0)) (clojure.core/list (quote clojure.core/close))))))))) :else (throw (IllegalArgumentException. "with-open only allows Symbols in bindings")))) +// Skipping: (defmacro doto "Evaluates x then calls all of the methods and functions with the \n value of x supplied at the from of the given arguments. The forms\n are evaluated in order. Returns x.\n\n (doto (new java.util.HashMap) (.put \"a\" 1) (.put \"b\" 2))" [x & forms] (let [gx (gensym)] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list gx) (clojure.core/list x)))) (map (fn [f] (if (seq? f) (clojure.core/concat (clojure.core/list (first f)) (clojure.core/list gx) (rest f)) (clojure.core/concat (clojure.core/list f) (clojure.core/list gx)))) forms) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/fn)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote target__2402__auto__)) args))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote target__2402__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list name) args)))))) +// Skipping: (defmacro time "Evaluates expr and prints the time it took. Returns the value of\n expr." [expr] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote start__2412__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote java.lang.System)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/nanoTime)))))) (clojure.core/list (quote ret__2413__auto__)) (clojure.core/list expr)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/prn)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/str)) (clojure.core/list "Elapsed time: ") (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core//)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/double)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/-)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote java.lang.System)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/nanoTime)))))) (clojure.core/list (quote start__2412__auto__)))))) (clojure.core/list 1000000.0))) (clojure.core/list " msecs"))))) (clojure.core/list (quote ret__2413__auto__)))) + +//====== +//(import (quote (java.lang.reflect Array))) +//--- +(function __clojure_core_fn_2423(){ +return (clojure.core.import_.apply(null,[clojure.JS.lit_list([clojure.core.symbol("java.lang.reflect"),clojure.core.symbol("Array")])]))}).apply(null,[]); + +//====== +//(import (quote (clojure.lang RT))) +//--- +(function __clojure_core_fn_2426(){ +return (clojure.core.import_.apply(null,[clojure.JS.lit_list([clojure.core.symbol("clojure.lang"),clojure.core.symbol("RT")])]))}).apply(null,[]); + +//====== +//(defn alength "Returns the length of the Java array. Works on arrays of all\n types." {:inline (fn [a] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/alength)) (clojure.core/list a)))))} [array] (. clojure.lang.RT (alength array))) +//--- +(function __clojure_core_fn_2429(){ +return (clojure.JS.def(clojure.core,"alength",(function __clojure_core_fn_2429_alength_2434(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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aclone)) (clojure.core/list a)))))} [array] (. clojure.lang.RT (aclone array))) +//--- +(function __clojure_core_fn_2438(){ +return (clojure.JS.def(clojure.core,"aclone",(function __clojure_core_fn_2438_aclone_2443(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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aget)) (clojure.core/list a) (clojure.core/list i))))), :inline-arities #{2}} ([array idx] (clojure.lang.Reflector/prepRet (RT/aget array idx))) ([array idx & idxs] (apply aget (aget array idx) idxs))) +//--- +(function __clojure_core_fn_2447(){ +return (clojure.JS.def(clojure.core,"aget",clojure.JS.variadic(2,(function __clojure_core_fn_2447_aget_2452(array_1,idx_2){switch(arguments.length){ +case 2:return (clojure.lang.Reflector.prepRet(clojure.lang.RT.aget(array_1,idx_2)))} +var idxs_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.apply.apply(null,[clojure.core.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.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.RT)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aset)) (clojure.core/list a) (clojure.core/list i) (clojure.core/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))) +//--- +(function __clojure_core_fn_2457(){ +return (clojure.JS.def(clojure.core,"aset",clojure.JS.variadic(3,(function __clojure_core_fn_2457_aset_2462(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), +val_3)} +var idxv_4=clojure.JS.rest_args(this,arguments,3); +return (clojure.core.apply.apply(null,[clojure.core.aset,clojure.lang.RT.aget(array_1,idx_2),idx2_3,idxv_4]))}))))}).apply(null,[]); +// Skipping: (defmacro def-aset [name method coerce] (clojure.core/concat (clojure.core/list (quote clojure.core/defn)) (clojure.core/list name) (clojure.core/list (clojure.core/apply clojure.core/hash-map (clojure.core/concat (clojure.core/list :arglists) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list (clojure.core/concat (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote array)) (clojure.core/list (quote idx)) (clojure.core/list (quote val))))) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote array)) (clojure.core/list (quote idx)) (clojure.core/list (quote idx2)) (clojure.core/list (quote &)) (clojure.core/list (quote idxv)))))))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote array__2467__auto__)) (clojure.core/list (quote idx__2468__auto__)) (clojure.core/list (quote val__2469__auto__))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote java.lang.reflect.Array)) (clojure.core/list (clojure.core/concat (clojure.core/list method) (clojure.core/list (quote array__2467__auto__)) (clojure.core/list (quote idx__2468__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list coerce) (clojure.core/list (quote val__2469__auto__)))))))) (clojure.core/list (quote val__2469__auto__)))) (clojure.core/list (clojure.core/concat (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote array__2467__auto__)) (clojure.core/list (quote idx__2468__auto__)) (clojure.core/list (quote idx2__2470__auto__)) (clojure.core/list (quote &)) (clojure.core/list (quote idxv__2471__auto__))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/apply)) (clojure.core/list name) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aget)) (clojure.core/list (quote array__2467__auto__)) (clojure.core/list (quote idx__2468__auto__)))) (clojure.core/list (quote idx2__2470__auto__)) (clojure.core/list (quote idxv__2471__auto__)))))))) +// Skipping: (def-aset aset-int setInt int) +// Skipping: (def-aset aset-long setLong long) +// Skipping: (def-aset aset-boolean setBoolean boolean) +// Skipping: (def-aset aset-float setFloat float) +// Skipping: (def-aset aset-double setDouble double) +// Skipping: (def-aset aset-short setShort short) +// Skipping: (def-aset aset-byte setByte byte) +// Skipping: (def-aset aset-char setChar char) +// Skipping: (defn make-array "Creates and returns an array of instances of the specified class of\n the specified dimension(s). Note that a class object is required.\n Class objects can be obtained by using their imported or\n fully-qualified name. Class objects for the primitive types can be\n obtained using, e.g., Integer/TYPE." ([type len] (. Array (newInstance type (int len)))) ([type dim & more-dims] (let [dims (cons dim more-dims) dimarray (make-array (. Integer TYPE) (count dims))] (dotimes [i (alength dimarray)] (aset-int dimarray i (nth dims i))) (. Array (newInstance type dimarray))))) +// Skipping: (defn to-array-2d "Returns a (potentially-ragged) 2-dimensional array of Objects\n containing the contents of coll, which can be any Collection of any\n Collection." [coll] (let [ret (make-array (. Class (forName "[Ljava.lang.Object;")) (. coll (size)))] (loop [i 0 xs (seq coll)] (when xs (aset ret i (to-array (first xs))) (recur (inc i) (rest xs)))) ret)) +// Skipping: (defn macroexpand-1 "If form represents a macro form, returns its expansion,\n else returns form." [form] (. clojure.lang.Compiler (macroexpand1 form))) +// Skipping: (defn macroexpand "Repeatedly calls macroexpand-1 on form until it no longer\n represents a macro form, then returns it. Note neither\n macroexpand-1 nor macroexpand expand macros in subforms." [form] (let [ex (macroexpand-1 form)] (if (identical? ex form) form (macroexpand ex)))) + +//====== +//(defn create-struct "Returns a structure basis object." [& keys] (. clojure.lang.PersistentStructMap (createSlotMap keys))) +//--- +(function __clojure_core_fn_2563(){ +return (clojure.JS.def(clojure.core,"create_struct",clojure.JS.variadic(0,(function __clojure_core_fn_2563_create_struct_2565(){ +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.core/concat (clojure.core/list (quote def)) (clojure.core/list name) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/create-struct)) keys)))) + +//====== +//(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_core_fn_2578(){ +return (clojure.JS.def(clojure.core,"struct_map",clojure.JS.variadic(1,(function __clojure_core_fn_2578_struct_map_2580(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_core_fn_2584(){ +return (clojure.JS.def(clojure.core,"struct",clojure.JS.variadic(1,(function __clojure_core_fn_2584_struct_2586(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_core_fn_2590(){ +return (clojure.JS.def(clojure.core,"accessor",(function __clojure_core_fn_2590_accessor_2592(s_1,key_2){ +return (clojure.lang.PersistentStructMap.getAccessor(s_1,key_2))})))}).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))) +// Skipping: (defn load-string "Sequentially read and evaluate the set of forms contained in the\n string" [s] (let [rdr (-> (java.io.StringReader. s) (clojure.lang.LineNumberingPushbackReader.))] (load-reader rdr))) + +//====== +//(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_core_fn_2608(){ +return (clojure.JS.def(clojure.core,"resultset_seq",(function __clojure_core_fn_2608_resultset_seq_2610(rs_1){ +var rsmeta_2,idxs_3,keys_4,row_struct_5,row_values_6,rows_7; +return (((rsmeta_2=(rs_1).getMetaData()), +(idxs_3=clojure.core.range.apply(null,[(1),clojure.lang.Numbers.inc((rsmeta_2).getColumnCount())])), +(keys_4=clojure.core.map.apply(null,[clojure.core.comp.apply(null,[clojure.core.keyword,(function __clojure_core_fn_2608_resultset_seq_2610_fn_2612(target__2402__auto___1){ +return ((target__2402__auto___1).toLowerCase())})]),clojure.core.map.apply(null,[(function __clojure_core_fn_2608_resultset_seq_2610_fn_2615(i_1){ +return ((rsmeta_2).getColumnName(i_1))}),idxs_3])])), +(row_struct_5=clojure.core.apply.apply(null,[clojure.core.create_struct,keys_4])), +(row_values_6=(function __clojure_core_fn_2608_resultset_seq_2610_row_values_2618(){ +return (clojure.core.map.apply(null,[(function __clojure_core_fn_2608_resultset_seq_2610_row_values_2618_fn_2620(i_1){ +return ((rs_1).getObject(i_1))}),idxs_3]))})), +(rows_7=(function __clojure_core_fn_2608_resultset_seq_2610_thisfn_2624(){ +var thisfn_0=arguments.callee; +return ((((rs_1).next())?((new clojure.lang.LazyCons((function __clojure_core_fn_2608_resultset_seq_2610_thisfn_2624_fn_2626(G__2625_1){switch(arguments.length){ +case 0:return (clojure.core.apply.apply(null,[clojure.core.struct,row_struct_5,row_values_6.apply(null,[])]))} +return (thisfn_0.apply(null,[]))})))):(null)))})), +rows_7.apply(null,[])))})))}).apply(null,[]); + +//====== +//(defn set "Returns a set of the distinct elements of coll." [coll] (apply hash-set coll)) +//--- +(function __clojure_core_fn_2633(){ +return (clojure.JS.def(clojure.core,"set",(function __clojure_core_fn_2633_set_2635(coll_1){ +return (clojure.core.apply.apply(null,[clojure.core.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_core_fn_2645(){ +return (clojure.JS.def(clojure.core,"filter_key",(function __clojure_core_fn_2645_filter_key_2647(keyfn_1,pred_2,amap_3){ +var ret_4,es_5; +return (((function __loop(){var _rtn,_cnt;(ret_4=clojure.lang.PersistentArrayMap.EMPTY), +(es_5=clojure.core.seq.apply(null,[amap_3]));do{_cnt=0; +_rtn=((es_5)?(((pred_2.apply(null,[keyfn_1.apply(null,[clojure.core.first.apply(null,[es_5])])]))?((_cnt=1,_rtn=[clojure.core.assoc.apply(null,[ret_4,clojure.core.key.apply(null,[clojure.core.first.apply(null,[es_5])]),clojure.core.val.apply(null,[clojure.core.first.apply(null,[es_5])])]),clojure.core.rest.apply(null,[es_5])],ret_4=_rtn[0],es_5=_rtn[1])):((_cnt=1,_rtn=[ret_4,clojure.core.rest.apply(null,[es_5])],ret_4=_rtn[0],es_5=_rtn[1])))):(ret_4))}while(_cnt);return _rtn;})()))})))}).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_core_fn_2651(){ +return (clojure.JS.def(clojure.core,"find_ns",(function __clojure_core_fn_2651_find_ns_2653(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_core_fn_2657(){ +return (clojure.JS.def(clojure.core,"create_ns",(function __clojure_core_fn_2657_create_ns_2659(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_core_fn_2663(){ +return (clojure.JS.def(clojure.core,"remove_ns",(function __clojure_core_fn_2663_remove_ns_2665(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_core_fn_2669(){ +return (clojure.JS.def(clojure.core,"all_ns",(function __clojure_core_fn_2669_all_ns_2671(){ +return (clojure.lang.Namespace.all())})))}).apply(null,[]); + +//====== +//(defn the-ns "If passed a namespace, returns it. Else, when passed a symbol,\n returns the namespace named by it, throwing an exception if not\n found." [x] (if (instance? clojure.lang.Namespace x) x (or (find-ns x) (throw (RT/makeException (str "No namespace: " x " found")))))) +//--- +(function __clojure_core_fn_2675(){ +return (clojure.JS.def(clojure.core,"the_ns",(function __clojure_core_fn_2675_the_ns_2677(x_1){ +var or__974__auto___2; +return (((clojure.core.instance_QMARK_.apply(null,[clojure.lang.Namespace,x_1]))?(x_1):(((or__974__auto___2=clojure.core.find_ns.apply(null,[x_1])), +((or__974__auto___2)?(or__974__auto___2):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.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_core_fn_2682(){ +return (clojure.JS.def(clojure.core,"ns_name",(function __clojure_core_fn_2682_ns_name_2684(ns_1){ +return ((clojure.core.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_core_fn_2688(){ +return (clojure.JS.def(clojure.core,"ns_map",(function __clojure_core_fn_2688_ns_map_2690(ns_1){ +return ((clojure.core.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_core_fn_2694(){ +return (clojure.JS.def(clojure.core,"ns_unmap",(function __clojure_core_fn_2694_ns_unmap_2696(ns_1,sym_2){ +return ((clojure.core.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_core_fn_2700(){ +return (clojure.JS.def(clojure.core,"ns_publics",(function __clojure_core_fn_2700_ns_publics_2702(ns_1){ +var ns_2; +return (((ns_2=clojure.core.the_ns.apply(null,[ns_1])), +clojure.core.filter_key.apply(null,[clojure.core.val,(function __clojure_core_fn_2700_ns_publics_2702_fn_2704(v_1){ +var and__960__auto___2,and__960__auto___3; +return (((and__960__auto___2=clojure.core.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])), +((and__960__auto___2)?(((and__960__auto___3=clojure.lang.Util.equal(ns_2,clojure.JS.getOrRun(v_1,"ns"))), +((and__960__auto___3)?((v_1).isPublic()):(and__960__auto___3)))):(and__960__auto___2))))}),clojure.core.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))) +//--- +(function __clojure_core_fn_2711(){ +return (clojure.JS.def(clojure.core,"ns_imports",(function __clojure_core_fn_2711_ns_imports_2713(ns_1){ +return (clojure.core.filter_key.apply(null,[clojure.core.val,clojure.core.class_QMARK_,clojure.core.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))))))) + +//====== +//(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_core_fn_2728(){ +return (clojure.JS.def(clojure.core,"ns_refers",(function __clojure_core_fn_2728_ns_refers_2730(ns_1){ +var ns_2; +return (((ns_2=clojure.core.the_ns.apply(null,[ns_1])), +clojure.core.filter_key.apply(null,[clojure.core.val,(function __clojure_core_fn_2728_ns_refers_2730_fn_2732(v_1){ +var and__960__auto___2; +return (((and__960__auto___2=clojure.core.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])), +((and__960__auto___2)?(clojure.core.not_EQ_.apply(null,[ns_2,clojure.JS.getOrRun(v_1,"ns")])):(and__960__auto___2))))}),clojure.core.ns_map.apply(null,[ns_2])])))})))}).apply(null,[]); + +//====== +//(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_core_fn_2738(){ +return (clojure.JS.def(clojure.core,"ns_interns",(function __clojure_core_fn_2738_ns_interns_2740(ns_1){ +var ns_2; +return (((ns_2=clojure.core.the_ns.apply(null,[ns_1])), +clojure.core.filter_key.apply(null,[clojure.core.val,(function __clojure_core_fn_2738_ns_interns_2740_fn_2742(v_1){ +var and__960__auto___2; +return (((and__960__auto___2=clojure.core.instance_QMARK_.apply(null,[clojure.lang.Var,v_1])), +((and__960__auto___2)?(clojure.lang.Util.equal(ns_2,clojure.JS.getOrRun(v_1,"ns"))):(and__960__auto___2))))}),clojure.core.ns_map.apply(null,[ns_2])])))})))}).apply(null,[]); + +//====== +//(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_core_fn_2748(){ +return (clojure.JS.def(clojure.core,"alias",(function __clojure_core_fn_2748_alias_2750(alias_1,namespace_sym_2){ +return ((clojure.core._STAR_ns_STAR_).addAlias(alias_1,clojure.core.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_core_fn_2754(){ +return (clojure.JS.def(clojure.core,"ns_aliases",(function __clojure_core_fn_2754_ns_aliases_2756(ns_1){ +return ((clojure.core.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_core_fn_2760(){ +return (clojure.JS.def(clojure.core,"ns_unalias",(function __clojure_core_fn_2760_ns_unalias_2762(ns_1,sym_2){ +return ((clojure.core.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_core_fn_2766(){ +return (clojure.JS.def(clojure.core,"take_nth",(function __clojure_core_fn_2766_take_nth_2768(n_1,coll_2){ +return (((clojure.core.seq.apply(null,[coll_2]))?((new clojure.lang.LazyCons((function __clojure_core_fn_2766_take_nth_2768_fn_2771(G__2770_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll_2]))} +return (clojure.core.take_nth.apply(null,[n_1,clojure.core.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_core_fn_2777(){ +return (clojure.JS.def(clojure.core,"interleave",clojure.JS.variadic(0,(function __clojure_core_fn_2777_interleave_2779(){ +var colls_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[clojure.core.concat,clojure.core.apply.apply(null,[clojure.core.map,clojure.core.list,colls_1])]))}))))}).apply(null,[]); + +//====== +//(defn var-get "Gets the value in the var object" [x] (. x (get))) +//--- +(function __clojure_core_fn_2783(){ +return (clojure.JS.def(clojure.core,"var_get",(function __clojure_core_fn_2783_var_get_2785(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_core_fn_2789(){ +return (clojure.JS.def(clojure.core,"var_set",(function __clojure_core_fn_2789_var_set_2791(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] (assert-args with-local-vars (vector? name-vals-vec) "a vector for its binding" (even? (count name-vals-vec)) "an even number of forms in binding vector") (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (interleave (take-nth 2 name-vals-vec) (repeat (quote (. clojure.lang.Var (create)))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Var)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/pushThreadBindings)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/hash-map)) name-vals-vec)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote try)) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote finally)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Var)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/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)) +// Skipping: (defn resolve "same as (ns-resolve *ns* symbol)" [sym] (ns-resolve *ns* sym)) + +//====== +//(defn array-map "Constructs an array-map." ([] (. clojure.lang.PersistentArrayMap EMPTY)) ([& keyvals] (new clojure.lang.PersistentArrayMap (to-array keyvals)))) +//--- +(function __clojure_core_fn_2816(){ +return (clojure.JS.def(clojure.core,"array_map",clojure.JS.variadic(0,(function __clojure_core_fn_2816_array_map_2818(){switch(arguments.length){ +case 0:return (clojure.JS.getOrRun(clojure.lang.PersistentArrayMap,"EMPTY"))} +var keyvals_1=clojure.JS.rest_args(this,arguments,0); +return ((new clojure.lang.PersistentArrayMap(clojure.core.to_array.apply(null,[keyvals_1]))))}))))}).apply(null,[]); + +//====== +//(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_core_fn_2823(){ +return (clojure.JS.def(clojure.core,"nthrest",(function __clojure_core_fn_2823_nthrest_2825(coll_1,n_2){ +var n_3,xs_4,and__960__auto___5; +return (((function __loop(){var _rtn,_cnt;(n_3=n_2), +(xs_4=clojure.core.seq.apply(null,[coll_1]));do{_cnt=0; +_rtn=((((and__960__auto___5=xs_4), +((and__960__auto___5)?(clojure.lang.Numbers.isPos(n_3)):(and__960__auto___5))))?((_cnt=1,_rtn=[clojure.lang.Numbers.dec(n_3),clojure.core.rest.apply(null,[xs_4])],n_3=_rtn[0],xs_4=_rtn[1])):(xs_4))}while(_cnt);return _rtn;})()))})))}).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.core/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.core/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__2830 p2__2831] (assoc p1__2830 p2__2831 ((val entry) p2__2831))) (dissoc bes (key entry)) ((key entry) bes))) (dissoc b :as :or) {:keys (fn* [p1__2832] (keyword (str p1__2832))), :strs str, :syms (fn* [p1__2833] (list (quote quote) p1__2833))})] (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.core/get) gmap bk (defaults bb)) (list (quote clojure.core/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)))) +//--- +(function __clojure_core_fn_2834(){ +return (clojure.JS.def(clojure.core,"destructure",(function __clojure_core_fn_2834_destructure_2836(bindings_1){ +var bmap_2,pb_3,process_entry_4; +return (((bmap_2=clojure.core.apply.apply(null,[clojure.core.array_map,bindings_1])), +(pb_3=(function __clojure_core_fn_2834_destructure_2836_pb_2838(bvec_1,b_2,v_3){ +var pvec_4,pmap_5,pb_0=arguments.callee; +return (((pvec_4=(function __clojure_core_fn_2834_destructure_2836_pb_2838_pvec_2839(bvec_1,b_2,val_3){ +var bs_7,n_6,ret_5,seen_rest_QMARK__8,gvec_4,firstb_9; +return (((gvec_4=clojure.core.gensym.apply(null,["vec__"])), +((function __loop(){var _rtn,_cnt;(ret_5=clojure.core.conj.apply(null,[clojure.core.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.core.seq.apply(null,[bs_7]))?(((firstb_9=clojure.core.first.apply(null,[bs_7])), +((clojure.lang.Util.equal(firstb_9,clojure.core.symbol("&")))?((_cnt=1,_rtn=[pb_0.apply(null,[ret_5,clojure.core.second.apply(null,[bs_7]),clojure.core.list.apply(null,[clojure.core.symbol("clojure.core/nthrest"),gvec_4,n_6])]),n_6,clojure.core.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.core.keyword("","as")))?(pb_0.apply(null,[ret_5,clojure.core.second.apply(null,[bs_7]),gvec_4])):(((clojure.core.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.core.list.apply(null,[clojure.core.symbol("clojure.core/nth"),gvec_4,n_6,null])]),clojure.lang.Numbers.inc(n_6),clojure.core.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_core_fn_2834_destructure_2836_pb_2838_pmap_2842(bvec_1,b_2,v_3){ +var bk_9,ret_6,gmap_4,bes_7,defaults_5,bb_8,or__974__auto___4,has_default_10; +return (((gmap_4=((or__974__auto___4=clojure.core.keyword("","as").apply(null,[b_2])), +((or__974__auto___4)?(or__974__auto___4):(clojure.core.gensym.apply(null,["map__"]))))), +(defaults_5=clojure.core.keyword("","or").apply(null,[b_2])), +((function __loop(){var _rtn,_cnt;(ret_6=clojure.core.conj.apply(null,[clojure.core.conj.apply(null,[bvec_1,gmap_4]),v_3])), +(bes_7=clojure.core.reduce.apply(null,[(function __clojure_core_fn_2834_destructure_2836_pb_2838_pmap_2842_fn_2844(bes_1,entry_2){ +return (clojure.core.reduce.apply(null,[(function __clojure_core_fn_2834_destructure_2836_pb_2838_pmap_2842_fn_2844_fn_2846(p1__2830_1,p2__2831_2){ +return (clojure.core.assoc.apply(null,[p1__2830_1,p2__2831_2,clojure.core.val.apply(null,[entry_2]).apply(null,[p2__2831_2])]))}),clojure.core.dissoc.apply(null,[bes_1,clojure.core.key.apply(null,[entry_2])]),clojure.core.key.apply(null,[entry_2]).apply(null,[bes_1])]))}),clojure.core.dissoc.apply(null,[b_2,clojure.core.keyword("","as"),clojure.core.keyword("","or")]),clojure.core.hash_map(clojure.core.keyword("","keys"),(function __clojure_core_fn_2834_destructure_2836_pb_2838_pmap_2842_fn_2850(p1__2832_1){ +return (clojure.core.keyword.apply(null,[clojure.core.str.apply(null,[p1__2832_1])]))}),clojure.core.keyword("","strs"),clojure.core.str,clojure.core.keyword("","syms"),(function __clojure_core_fn_2834_destructure_2836_pb_2838_pmap_2842_fn_2853(p1__2833_1){ +return (clojure.core.list.apply(null,[clojure.core.symbol("quote"),p1__2833_1]))}))]));do{_cnt=0; +_rtn=((clojure.core.seq.apply(null,[bes_7]))?(((bb_8=clojure.core.key.apply(null,[clojure.core.first.apply(null,[bes_7])])), +(bk_9=clojure.core.val.apply(null,[clojure.core.first.apply(null,[bes_7])])), +(has_default_10=clojure.core.contains_QMARK_.apply(null,[defaults_5,bb_8])), +(_cnt=1,_rtn=[pb_0.apply(null,[ret_6,bb_8,((has_default_10)?(clojure.core.list.apply(null,[clojure.core.symbol("clojure.core/get"),gmap_4,bk_9,defaults_5.apply(null,[bb_8])])):(clojure.core.list.apply(null,[clojure.core.symbol("clojure.core/get"),gmap_4,bk_9])))]),clojure.core.rest.apply(null,[bes_7])],ret_6=_rtn[0],bes_7=_rtn[1]))):(ret_6))}while(_cnt);return _rtn;})())))})), +((clojure.core.symbol_QMARK_.apply(null,[b_2]))?(clojure.core.conj.apply(null,[clojure.core.conj.apply(null,[bvec_1,b_2]),v_3])):(((clojure.core.vector_QMARK_.apply(null,[b_2]))?(pvec_4.apply(null,[bvec_1,b_2,v_3])):(((clojure.core.map_QMARK_.apply(null,[b_2]))?(pmap_5.apply(null,[bvec_1,b_2,v_3])):(((clojure.core.keyword("","else"))?((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Unsupported binding form: ",b_2]))})()):(null))))))))))})), +(process_entry_4=(function __clojure_core_fn_2834_destructure_2836_process_entry_2859(bvec_1,b_2){ +return (pb_3.apply(null,[bvec_1,clojure.core.key.apply(null,[b_2]),clojure.core.val.apply(null,[b_2])]))})), +((clojure.core.every_QMARK_.apply(null,[clojure.core.symbol_QMARK_,clojure.core.keys.apply(null,[bmap_2])]))?(bindings_1):(clojure.core.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] (assert-args let (vector? bindings) "a vector for its binding" (even? (count bindings)) "an even number of forms in binding vector") (clojure.core/concat (clojure.core/list (quote let*)) (clojure.core/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.core/concat (clojure.core/list new-params) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/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] (assert-args loop (vector? bindings) "a vector for its binding" (even? (count bindings)) "an even number of forms in binding vector") (let [db (destructure bindings)] (if (= db bindings) (clojure.core/concat (clojure.core/list (quote loop*)) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list bfs) (clojure.core/list (clojure.core/concat (clojure.core/list (quote loop*)) (clojure.core/list (vec (interleave gs gs))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (vec (interleave bs gs))) body))))))))) +// Skipping: (defmacro when-first "bindings => x xs\n\n Same as (when (seq xs) (let [x (first xs)] body))" [bindings & body] (assert-args when-first (vector? bindings) "a vector for its binding" (even? (count bindings)) "exactly 2 forms in binding vector") (let [[x xs] bindings] (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/seq)) (clojure.core/list xs))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list x) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/first)) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/seq)) (clojure.core/list coll))) ([coll & colls] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote iter__2926__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/fn)) (clojure.core/list (quote iter__2926__auto__)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote coll__2927__auto__))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/seq)) (clojure.core/list (quote coll__2927__auto__)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lazy-cons)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/first)) (clojure.core/list (quote coll__2927__auto__)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote iter__2926__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list (quote coll__2927__auto__)))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lazy-cat)) colls))))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote iter__2926__auto__)) (clojure.core/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] (assert-args for (vector? seq-exprs) "a vector for its binding" (even? (count seq-exprs)) "an even number of forms in binding vector") (let [to-groups (fn [seq-exprs] (reduce (fn [groups [k v]] (if (keyword? k) (conj (pop groups) (assoc (peek groups) k v)) (conj groups {:bind k, :seq v}))) [] (partition 2 seq-exprs))) emit (fn emit [[group & [{next-seq :seq} :as more-groups]]] (let [giter (gensym "iter__") gxs (gensym "s__")] (clojure.core/concat (clojure.core/list (quote clojure.core/fn)) (clojure.core/list giter) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list gxs)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when-first)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (:bind group)) (clojure.core/list gxs)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (or (:while group) true)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (or (:when group) true)) (clojure.core/list (if more-groups (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote iterys__2939__auto__)) (clojure.core/list (emit more-groups)) (clojure.core/list (quote fs__2940__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote iterys__2939__auto__)) (clojure.core/list next-seq)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote fs__2940__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/lazy-cat)) (clojure.core/list (quote fs__2940__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list giter) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list gxs))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list gxs)))))))) (clojure.core/concat (clojure.core/list (quote clojure.core/lazy-cons)) (clojure.core/list expr) (clojure.core/list (clojure.core/concat (clojure.core/list giter) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list gxs)))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/rest)) (clojure.core/list gxs))))))))))))))] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote iter__2941__auto__)) (clojure.core/list (emit (to-groups seq-exprs)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote iter__2941__auto__)) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote s__2992__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.lang.RT/makeStringWriter))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/binding)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote clojure.core/*out*)) (clojure.core/list (quote s__2992__auto__))))) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/str)) (clojure.core/list (quote s__2992__auto__)))))))) +// 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.core/concat (clojure.core/list (quote clojure.core/with-open)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote s__3002__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/->)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote java.io.StringReader.)) (clojure.core/list s))) (clojure.core/list (quote clojure.lang.LineNumberingPushbackReader.))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/binding)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote clojure.core/*in*)) (clojure.core/list (quote s__3002__auto__))))) body)))) + +//====== +//(defn pr-str "pr to a string, returning it" {:tag String} [& xs] (with-out-str (apply pr xs))) +//--- +(function __clojure_core_fn_3012(){ +return (clojure.JS.def(clojure.core,"pr_str",clojure.JS.variadic(0,(function __clojure_core_fn_3012_pr_str_3014(){ +var s__2992__auto___2,xs_1=clojure.JS.rest_args(this,arguments,0); +return (((s__2992__auto___2=clojure.lang.RT.makeStringWriter()), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_out_STAR_,s__2992__auto___2])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.pr,xs_1]), +clojure.core.str.apply(null,[s__2992__auto___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_core_fn_3019(){ +return (clojure.JS.def(clojure.core,"prn_str",clojure.JS.variadic(0,(function __clojure_core_fn_3019_prn_str_3021(){ +var s__2992__auto___2,xs_1=clojure.JS.rest_args(this,arguments,0); +return (((s__2992__auto___2=clojure.lang.RT.makeStringWriter()), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_out_STAR_,s__2992__auto___2])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.prn,xs_1]), +clojure.core.str.apply(null,[s__2992__auto___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_core_fn_3026(){ +return (clojure.JS.def(clojure.core,"print_str",clojure.JS.variadic(0,(function __clojure_core_fn_3026_print_str_3028(){ +var s__2992__auto___2,xs_1=clojure.JS.rest_args(this,arguments,0); +return (((s__2992__auto___2=clojure.lang.RT.makeStringWriter()), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_out_STAR_,s__2992__auto___2])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.print,xs_1]), +clojure.core.str.apply(null,[s__2992__auto___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_core_fn_3033(){ +return (clojure.JS.def(clojure.core,"println_str",clojure.JS.variadic(0,(function __clojure_core_fn_3033_println_str_3035(){ +var s__2992__auto___2,xs_1=clojure.JS.rest_args(this,arguments,0); +return (((s__2992__auto___2=clojure.lang.RT.makeStringWriter()), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_out_STAR_,s__2992__auto___2])), +(function __try(){try{var _rtn=(clojure.core.apply.apply(null,[clojure.core.println,xs_1]), +clojure.core.str.apply(null,[s__2992__auto___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.core/concat (clojure.core/list (quote clojure.core/when-not)) (clojure.core/list x) (clojure.core/list (clojure.core/concat (clojure.core/list (quote throw)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.lang.RT/makeException)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/str)) (clojure.core/list "Assert failed: ") (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/pr-str)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/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.core/meta v))] (if f (do (f) :ok) :no-test))) +//--- +(function __clojure_core_fn_3049(){ +return (clojure.JS.def(clojure.core,"test",(function __clojure_core_fn_3049_test_3051(v_1){ +var f_2; +return (((f_2=clojure.core.keyword("","test").apply(null,[clojure.core.meta.apply(null,[v_1])])), +((f_2)?(f_2.apply(null,[]), +clojure.core.keyword("","ok")):(clojure.core.keyword("","no-test")))))})))}).apply(null,[]); +// Skipping: (defn re-pattern "Returns an instance of java.util.regex.Pattern, for use, e.g. in\n re-matcher." {:tag java.util.regex.Pattern} [s] (if (instance? java.util.regex.Pattern s) s (. java.util.regex.Pattern (compile s)))) +// Skipping: (defn re-matcher "Returns an instance of java.util.regex.Matcher, for use, e.g. in\n re-find." {:tag java.util.regex.Matcher} [re s] (. re (matcher s))) +// Skipping: (defn re-groups "Returns the groups from the most recent match/find. If there are no\n nested groups, returns a string of the entire match. If there are\n nested groups, returns a vector of the groups, the first element\n being the entire match." [m] (let [gc (. m (groupCount))] (if (zero? gc) (. m (group)) (loop [ret [] c 0] (if (<= c gc) (recur (conj ret (. m (group c))) (inc c)) ret))))) +// Skipping: (defn re-seq "Returns a lazy sequence of successive matches of pattern in string,\n using java.util.regex.Matcher.find(), each such match processed with\n re-groups." [re s] (let [m (re-matcher re s)] ((fn step [] (when (. m (find)) (lazy-cons (re-groups m) (step))))))) +// Skipping: (defn re-matches "Returns the match, if any, of string to pattern, using\n java.util.regex.Matcher.matches(). Uses re-groups to return the\n groups." [re s] (let [m (re-matcher re s)] (when (. m (matches)) (re-groups m)))) +// 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)))) +//--- +(function __clojure_core_fn_3099(){ +return (clojure.JS.def(clojure.core,"rand",(function __clojure_core_fn_3099_rand_3101(n_1){switch(arguments.length){ +case 0:return (clojure.lang.RT.random())} +return (clojure.lang.Numbers.multiply(n_1,clojure.core.rand.apply(null,[])))})))}).apply(null,[]); + +//====== +//(defn rand-int "Returns a random integer between 0 (inclusive) and n (exclusive)." [n] (int (rand n))) +//--- +(function __clojure_core_fn_3106(){ +return (clojure.JS.def(clojure.core,"rand_int",(function __clojure_core_fn_3106_rand_int_3108(n_1){ +return (clojure.lang.RT.intCast(clojure.core.rand.apply(null,[n_1])))})))}).apply(null,[]); +// Skipping: (defmacro defn- "same as defn, yielding non-public def" [name & decls] (list* (quote clojure.core/defn) (with-meta name (assoc (meta name) :private true)) decls)) + +//====== +//(defn print-doc [v] (println "-------------------------") (println (str (ns-name (:ns (clojure.core/meta v))) "/" (:name (clojure.core/meta v)))) (prn (:arglists (clojure.core/meta v))) (when (:macro (clojure.core/meta v)) (println "Macro")) (println " " (:doc (clojure.core/meta v)))) +//--- +(function __clojure_core_fn_3121(){ +return (clojure.JS.def(clojure.core,"print_doc",(function __clojure_core_fn_3121_print_doc_3123(v_1){ +return (clojure.core.println.apply(null,["-------------------------"]), +clojure.core.println.apply(null,[clojure.core.str.apply(null,[clojure.core.ns_name.apply(null,[clojure.core.keyword("","ns").apply(null,[clojure.core.meta.apply(null,[v_1])])]),"/",clojure.core.keyword("","name").apply(null,[clojure.core.meta.apply(null,[v_1])])])]), +clojure.core.prn.apply(null,[clojure.core.keyword("","arglists").apply(null,[clojure.core.meta.apply(null,[v_1])])]), +((clojure.core.keyword("","macro").apply(null,[clojure.core.meta.apply(null,[v_1])]))?(clojure.core.println.apply(null,["Macro"])):(null)), +clojure.core.println.apply(null,[" ",clojure.core.keyword("","doc").apply(null,[clojure.core.meta.apply(null,[v_1])])]))})))}).apply(null,[]); + +//====== +//(defn find-doc "Prints documentation for any var whose documentation or name\n contains a match for re-string-or-pattern" [re-string-or-pattern] (let [re (re-pattern re-string-or-pattern)] (dorun (for [ns (all-ns) v (sort-by (comp :name meta) (vals (ns-interns ns))) :when (and (:doc (clojure.core/meta v)) (or (re-find (re-matcher re (:doc (clojure.core/meta v)))) (re-find (re-matcher re (str (:name (clojure.core/meta v)))))))] (print-doc v))))) +//--- +(function __clojure_core_fn_3127(){ +return (clojure.JS.def(clojure.core,"find_doc",(function __clojure_core_fn_3127_find_doc_3129(re_string_or_pattern_1){ +var re_2,iter__2941__auto___3; +return (((re_2=clojure.core.re_pattern.apply(null,[re_string_or_pattern_1])), +clojure.core.dorun.apply(null,[((iter__2941__auto___3=(function __clojure_core_fn_3127_find_doc_3129_iter_3131_3135(s__3132_1){ +var _cnt,_rtn,ns_2,iterys__2939__auto___3,fs__2940__auto___4,iter__2926__auto___5,iter__3131_0=arguments.callee; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[s__3132_1]))?(((ns_2=clojure.core.first.apply(null,[s__3132_1])), +((true)?(((true)?(((iterys__2939__auto___3=(function __clojure_core_fn_3127_find_doc_3129_iter_3131_3135_iter_3133_3136(s__3134_1){ +var _cnt,_rtn,v_2,and__960__auto___3,or__974__auto___4,iter__3133_0=arguments.callee; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[s__3134_1]))?(((v_2=clojure.core.first.apply(null,[s__3134_1])), +((true)?(((((and__960__auto___3=clojure.core.keyword("","doc").apply(null,[clojure.core.meta.apply(null,[v_2])])), +((and__960__auto___3)?(((or__974__auto___4=clojure.core.re_find.apply(null,[clojure.core.re_matcher.apply(null,[re_2,clojure.core.keyword("","doc").apply(null,[clojure.core.meta.apply(null,[v_2])])])])), +((or__974__auto___4)?(or__974__auto___4):(clojure.core.re_find.apply(null,[clojure.core.re_matcher.apply(null,[re_2,clojure.core.str.apply(null,[clojure.core.keyword("","name").apply(null,[clojure.core.meta.apply(null,[v_2])])])])]))))):(and__960__auto___3))))?((new clojure.lang.LazyCons((function __clojure_core_fn_3127_find_doc_3129_iter_3131_3135_iter_3133_3136_fn_3138(G__3137_1){switch(arguments.length){ +case 0:return (clojure.core.print_doc.apply(null,[v_2]))} +return (iter__3133_0.apply(null,[clojure.core.rest.apply(null,[s__3134_1])]))})))):((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s__3134_1])],s__3134_1=_rtn[0])))):(null)))):(null)) +}while(_cnt);return _rtn;})), +(fs__2940__auto___4=iterys__2939__auto___3.apply(null,[clojure.core.sort_by.apply(null,[clojure.core.comp.apply(null,[clojure.core.keyword("","name"),clojure.core.meta]),clojure.core.vals.apply(null,[clojure.core.ns_interns.apply(null,[ns_2])])])])), +((fs__2940__auto___4)?(((iter__2926__auto___5=(function __clojure_core_fn_3127_find_doc_3129_iter_3131_3135_iter_2926_auto_3145(coll__2927__auto___1){ +var iter__2926__auto___0=arguments.callee; +return (((clojure.core.seq.apply(null,[coll__2927__auto___1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_3127_find_doc_3129_iter_3131_3135_iter_2926_auto_3145_fn_3147(G__3146_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll__2927__auto___1]))} +return (iter__2926__auto___0.apply(null,[clojure.core.rest.apply(null,[coll__2927__auto___1])]))})))):(clojure.core.seq.apply(null,[iter__3131_0.apply(null,[clojure.core.rest.apply(null,[s__3132_1])])]))))})), +iter__2926__auto___5.apply(null,[fs__2940__auto___4]))):((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s__3132_1])],s__3132_1=_rtn[0]))))):((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s__3132_1])],s__3132_1=_rtn[0])))):(null)))):(null)) +}while(_cnt);return _rtn;})), +iter__2941__auto___3.apply(null,[clojure.core.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 fn) (quote quote) (quote let) (quote var) (quote loop) (quote set!) (quote monitor-enter) (quote recur) (quote .) (quote do) (quote throw) (quote monitor-exit) (quote try) (quote if) (quote def) (quote new)} x)) +//--- +(function __clojure_core_fn_3159(){ +return (clojure.JS.def(clojure.core,"special_form_anchor",(function __clojure_core_fn_3159_special_form_anchor_3161(x_1){ +return (clojure.core.hash_set(clojure.core.symbol("fn"),clojure.core.symbol("quote"),clojure.core.symbol("let"),clojure.core.symbol("var"),clojure.core.symbol("loop"),clojure.core.symbol("set!"),clojure.core.symbol("monitor-enter"),clojure.core.symbol("recur"),clojure.core.symbol("."),clojure.core.symbol("do"),clojure.core.symbol("throw"),clojure.core.symbol("monitor-exit"),clojure.core.symbol("try"),clojure.core.symbol("if"),clojure.core.symbol("def"),clojure.core.symbol("new")).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_core_fn_3165(){ +return (clojure.JS.def(clojure.core,"syntax_symbol_anchor",(function __clojure_core_fn_3165_syntax_symbol_anchor_3167(x_1){ +return (clojure.core.hash_map(clojure.core.symbol("&"),clojure.core.symbol("fn"),clojure.core.symbol("catch"),clojure.core.symbol("try"),clojure.core.symbol("finally"),clojure.core.symbol("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_core_fn_3171(){ +return (clojure.JS.def(clojure.core,"print_special_doc",(function __clojure_core_fn_3171_print_special_doc_3173(name_1,type_2,anchor_3){ +return (clojure.core.println.apply(null,["-------------------------"]), +clojure.core.println.apply(null,[name_1]), +clojure.core.println.apply(null,[type_2]), +clojure.core.println.apply(null,[clojure.core.str.apply(null,[" Please see http://clojure.org/special_forms#",anchor_3])]))})))}).apply(null,[]); +// Skipping: (defmacro doc "Prints documentation for a var or special form given its name" [name] (cond (special-form-anchor name) (clojure.core/concat (clojure.core/list (quote clojure.core/print-special-doc)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list name))) (clojure.core/list "Special Form") (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/special-form-anchor)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list name)))))) (syntax-symbol-anchor name) (clojure.core/concat (clojure.core/list (quote clojure.core/print-special-doc)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list name))) (clojure.core/list "Syntax Symbol") (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/syntax-symbol-anchor)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list name)))))) :else (clojure.core/concat (clojure.core/list (quote clojure.core/print-doc)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote var)) (clojure.core/list name)))))) + +//====== +//(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_core_fn_3186(){ +return (clojure.JS.def(clojure.core,"tree_seq",(function __clojure_core_fn_3186_tree_seq_3188(branch_QMARK__1,children_2,root_3){ +var walk_4; +return (((walk_4=(function __clojure_core_fn_3186_tree_seq_3188_walk_3190(nodes_1){ +var node_2,walk_0=arguments.callee; +return (((clojure.core.seq.apply(null,[nodes_1]))?(((node_2=clojure.core.first.apply(null,[nodes_1])), +(new clojure.lang.LazyCons((function __clojure_core_fn_3186_tree_seq_3188_walk_3190_fn_3192(G__3191_1){switch(arguments.length){ +case 0:return (node_2)} +var iter__2926__auto___2; +return (((branch_QMARK__1.apply(null,[node_2]))?(((iter__2926__auto___2=(function __clojure_core_fn_3186_tree_seq_3188_walk_3190_fn_3192_iter_2926_auto_3195(coll__2927__auto___1){ +var iter__2926__auto___0=arguments.callee; +return (((clojure.core.seq.apply(null,[coll__2927__auto___1]))?((new clojure.lang.LazyCons((function __clojure_core_fn_3186_tree_seq_3188_walk_3190_fn_3192_iter_2926_auto_3195_fn_3197(G__3196_1){switch(arguments.length){ +case 0:return (clojure.core.first.apply(null,[coll__2927__auto___1]))} +return (iter__2926__auto___0.apply(null,[clojure.core.rest.apply(null,[coll__2927__auto___1])]))})))):(clojure.core.seq.apply(null,[walk_0.apply(null,[clojure.core.rest.apply(null,[nodes_1])])]))))})), +iter__2926__auto___2.apply(null,[walk_0.apply(null,[children_2.apply(null,[node_2])])]))):(walk_0.apply(null,[clojure.core.rest.apply(null,[nodes_1])]))))}))))):(null)))})), +(new clojure.lang.LazyCons((function __clojure_core_fn_3186_tree_seq_3188_fn_3206(G__3205_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_core_fn_3212(){ +return (clojure.JS.def(clojure.core,"file_seq",(function __clojure_core_fn_3212_file_seq_3214(dir_1){ +return (clojure.core.tree_seq.apply(null,[(function __clojure_core_fn_3212_file_seq_3214_fn_3216(f_1){ +return ((f_1).isDirectory())}),(function __clojure_core_fn_3212_file_seq_3214_fn_3219(d_1){ +return (clojure.core.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_core_fn_3224(){ +return (clojure.JS.def(clojure.core,"xml_seq",(function __clojure_core_fn_3224_xml_seq_3226(root_1){ +return (clojure.core.tree_seq.apply(null,[clojure.core.complement.apply(null,[clojure.core.string_QMARK_]),clojure.core.comp.apply(null,[clojure.core.seq,clojure.core.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_core_fn_3236(){ +return (clojure.JS.def(clojure.core,"var_QMARK_",(function __clojure_core_fn_3236_var_QMARK_3238(v_1){ +return (clojure.core.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))))))))) + +//====== +//(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_core_fn_3248(){ +return (clojure.JS.def(clojure.core,"subs",(function __clojure_core_fn_3248_subs_3250(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__3255 p2__3256] (max-key k p1__3255 p2__3256)) (max-key k x y) more))) +//--- +(function __clojure_core_fn_3257(){ +return (clojure.JS.def(clojure.core,"max_key",clojure.JS.variadic(3,(function __clojure_core_fn_3257_max_key_3259(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.core.reduce.apply(null,[(function __clojure_core_fn_3257_max_key_3259_fn_3263(p1__3255_1,p2__3256_2){ +return (clojure.core.max_key.apply(null,[k_1,p1__3255_1,p2__3256_2]))}),clojure.core.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__3268 p2__3269] (min-key k p1__3268 p2__3269)) (min-key k x y) more))) +//--- +(function __clojure_core_fn_3270(){ +return (clojure.JS.def(clojure.core,"min_key",clojure.JS.variadic(3,(function __clojure_core_fn_3270_min_key_3272(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.core.reduce.apply(null,[(function __clojure_core_fn_3270_min_key_3272_fn_3276(p1__3268_1,p2__3269_2){ +return (clojure.core.min_key.apply(null,[k_1,p1__3268_1,p2__3269_2]))}),clojure.core.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_core_fn_3281(){ +return (clojure.JS.def(clojure.core,"distinct",(function __clojure_core_fn_3281_distinct_3283(coll_1){ +var step_2; +return (((step_2=(function __clojure_core_fn_3281_distinct_3283_step_3286(p__3285_1,seen_2){ +var _cnt,_rtn,vec__3287_3,f_4,r_5,xs_6,step_0=arguments.callee; +do{_cnt=0;_rtn=((vec__3287_3=p__3285_1), +(f_4=clojure.core.nth.apply(null,[vec__3287_3,(0),null])), +(r_5=clojure.core.nthrest.apply(null,[vec__3287_3,(1)])), +(xs_6=vec__3287_3), +((xs_6)?(((seen_2.apply(null,[f_4]))?((_cnt=1,_rtn=[r_5,seen_2],p__3285_1=_rtn[0],seen_2=_rtn[1])):((new clojure.lang.LazyCons((function __clojure_core_fn_3281_distinct_3283_step_3286_fn_3289(G__3288_1){switch(arguments.length){ +case 0:return (f_4)} +return (step_0.apply(null,[r_5,clojure.core.conj.apply(null,[seen_2,f_4])]))})))))):(null))) +}while(_cnt);return _rtn;})), +step_2.apply(null,[clojure.core.seq.apply(null,[coll_1]),clojure.lang.PersistentHashSet.EMPTY])))})))}).apply(null,[]); +// Skipping: (defmacro if-let "bindings => binding-form test\n\n If test is true, evaluates then with binding-form bound to the value of test, if not, yields else" ([bindings then] (clojure.core/concat (clojure.core/list (quote clojure.core/if-let)) (clojure.core/list bindings) (clojure.core/list then) (clojure.core/list (quote nil)))) ([bindings then else & oldform] (assert-args if-let (and (vector? bindings) (nil? oldform)) "a vector for its binding" (even? (count bindings)) "exactly 2 forms in binding vector") (let [[form tst] bindings] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote temp__3296__auto__)) (clojure.core/list tst)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (quote temp__3296__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list form) (clojure.core/list (quote temp__3296__auto__))))) (clojure.core/list then))) (clojure.core/list else))))))) +// Skipping: (defmacro when-let "bindings => binding-form test\n\n When test is true, evaluates body with binding-form bound to the value of test" [bindings & body] (assert-args when-let (vector? bindings) "a vector for its binding" (even? (count bindings)) "exactly 2 forms in binding vector") (let [[form tst] bindings] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote temp__3312__auto__)) (clojure.core/list tst)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list (quote temp__3312__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list form) (clojure.core/list (quote temp__3312__auto__))))) 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__3324] (if-let [e (find smap p1__3324)] (val e) p1__3324)) coll))) +//--- +(function __clojure_core_fn_3325(){ +return (clojure.JS.def(clojure.core,"replace",(function __clojure_core_fn_3325_replace_3327(smap_1,coll_2){ +return (((clojure.core.vector_QMARK_.apply(null,[coll_2]))?(clojure.core.reduce.apply(null,[(function __clojure_core_fn_3325_replace_3327_fn_3329(v_1,i_2){ +var temp__3296__auto___3,e_4; +return (((temp__3296__auto___3=clojure.core.find.apply(null,[smap_1,clojure.core.nth.apply(null,[v_1,i_2])])), +((temp__3296__auto___3)?(((e_4=temp__3296__auto___3), +clojure.core.assoc.apply(null,[v_1,i_2,clojure.core.val.apply(null,[e_4])]))):(v_1))))}),coll_2,clojure.core.range.apply(null,[clojure.core.count.apply(null,[coll_2])])])):(clojure.core.map.apply(null,[(function __clojure_core_fn_3325_replace_3327_fn_3333(p1__3324_1){ +var temp__3296__auto___2,e_3; +return (((temp__3296__auto___2=clojure.core.find.apply(null,[smap_1,p1__3324_1])), +((temp__3296__auto___2)?(((e_3=temp__3296__auto___2), +clojure.core.val.apply(null,[e_3]))):(p1__3324_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.core/concat (clojure.core/list (quote clojure.core/sync)) (clojure.core/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.core/concat (clojure.core/list (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote java.math.RoundingMode)) (clojure.core/list (second exprs)))))] [exprs nil])] (clojure.core/concat (clojure.core/list (quote clojure.core/binding)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote clojure.core/*math-context*)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote java.math.MathContext.)) (clojure.core/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_core_fn_3359(){ +return (clojure.JS.def(clojure.core,"bound_fn",(function __clojure_core_fn_3359_bound_fn_3361(sc_1,test_2,key_3){ +return ((function __clojure_core_fn_3359_bound_fn_3361_fn_3363(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_core_fn_3368(){ +return (clojure.JS.def(clojure.core,"subseq",(function __clojure_core_fn_3368_subseq_3370(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){ +case 3:var include_4,temp__3312__auto___5,vec__3372_6,e_7,s_8,test_2=arguments[1],key_3=arguments[2]; +return (((include_4=clojure.core.bound_fn.apply(null,[sc_1,test_2,key_3])), +((clojure.core.hash_set(clojure.core._GT_,clojure.core._GT__EQ_).apply(null,[test_2]))?(((temp__3312__auto___5=(sc_1).seqFrom(key_3,true)), +((temp__3312__auto___5)?(((vec__3372_6=temp__3312__auto___5), +(e_7=clojure.core.nth.apply(null,[vec__3372_6,(0),null])), +(s_8=vec__3372_6), +((include_4.apply(null,[e_7]))?(s_8):(clojure.core.rest.apply(null,[s_8]))))):(null)))):(clojure.core.take_while.apply(null,[include_4,(sc_1).seq(true)])))))} +var vec__3374_7,s_9,e_8,temp__3312__auto___6; +return (((temp__3312__auto___6=(sc_1).seqFrom(start_key_3,true)), +((temp__3312__auto___6)?(((vec__3374_7=temp__3312__auto___6), +(e_8=clojure.core.nth.apply(null,[vec__3374_7,(0),null])), +(s_9=vec__3374_7), +clojure.core.take_while.apply(null,[clojure.core.bound_fn.apply(null,[sc_1,end_test_4,end_key_5]),((clojure.core.bound_fn.apply(null,[sc_1,start_test_2,start_key_3]).apply(null,[e_8]))?(s_9):(clojure.core.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_core_fn_3379(){ +return (clojure.JS.def(clojure.core,"rsubseq",(function __clojure_core_fn_3379_rsubseq_3381(sc_1,start_test_2,start_key_3,end_test_4,end_key_5){switch(arguments.length){ +case 3:var include_4,temp__3312__auto___5,vec__3383_6,e_7,s_8,test_2=arguments[1],key_3=arguments[2]; +return (((include_4=clojure.core.bound_fn.apply(null,[sc_1,test_2,key_3])), +((clojure.core.hash_set(clojure.core._LT_,clojure.core._LT__EQ_).apply(null,[test_2]))?(((temp__3312__auto___5=(sc_1).seqFrom(key_3,false)), +((temp__3312__auto___5)?(((vec__3383_6=temp__3312__auto___5), +(e_7=clojure.core.nth.apply(null,[vec__3383_6,(0),null])), +(s_8=vec__3383_6), +((include_4.apply(null,[e_7]))?(s_8):(clojure.core.rest.apply(null,[s_8]))))):(null)))):(clojure.core.take_while.apply(null,[include_4,(sc_1).seq(false)])))))} +var e_8,vec__3385_7,s_9,temp__3312__auto___6; +return (((temp__3312__auto___6=(sc_1).seqFrom(end_key_5,false)), +((temp__3312__auto___6)?(((vec__3385_7=temp__3312__auto___6), +(e_8=clojure.core.nth.apply(null,[vec__3385_7,(0),null])), +(s_9=vec__3385_7), +clojure.core.take_while.apply(null,[clojure.core.bound_fn.apply(null,[sc_1,start_test_2,start_key_3]),((clojure.core.bound_fn.apply(null,[sc_1,end_test_4,end_key_5]).apply(null,[e_8]))?(s_9):(clojure.core.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_core_fn_3390(){ +return (clojure.JS.def(clojure.core,"repeatedly",(function __clojure_core_fn_3390_repeatedly_3392(f_1){ +return ((new clojure.lang.LazyCons((function __clojure_core_fn_3390_repeatedly_3392_fn_3395(G__3394_1){switch(arguments.length){ +case 0:return (f_1.apply(null,[]))} +return (clojure.core.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_core_fn_3401(){ +return (clojure.JS.def(clojure.core,"add_classpath",(function __clojure_core_fn_3401_add_classpath_3403(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_core_fn_3407(){ +return (clojure.JS.def(clojure.core,"hash",(function __clojure_core_fn_3407_hash_3409(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_core_fn_3413(){ +return (clojure.JS.def(clojure.core,"interpose",(function __clojure_core_fn_3413_interpose_3415(sep_1,coll_2){ +return (clojure.core.drop.apply(null,[(1),clojure.core.interleave.apply(null,[clojure.core.repeat.apply(null,[sep_1]),coll_2])]))})))}).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 clojure.core/fn) args expr))] (clojure.core/concat (clojure.core/list (quote do)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/defn)) (clojure.core/list name) (clojure.core/list args) (clojure.core/list (apply inline args)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote v__3419__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote var)) (clojure.core/list name)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .setMeta)) (clojure.core/list (quote v__3419__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/assoc)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/meta)) (clojure.core/list (quote v__3419__auto__)))) (clojure.core/list :inline) (clojure.core/list inline)))))))))) + +//====== +//(defn empty "Returns an empty collection of the same category as coll, or nil" [coll] (.empty coll)) +//--- +(function __clojure_core_fn_3431(){ +return (clojure.JS.def(clojure.core,"empty",(function __clojure_core_fn_3431_empty_3433(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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote a__3437__auto__)) (clojure.core/list a) (clojure.core/list ret) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aclone)) (clojure.core/list (quote a__3437__auto__))))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/loop)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list idx) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/int)) (clojure.core/list 0)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/<)) (clojure.core/list idx) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/alength)) (clojure.core/list (quote a__3437__auto__)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote do)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/aset)) (clojure.core/list ret) (clojure.core/list idx) (clojure.core/list expr))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked-inc)) (clojure.core/list idx))))))) (clojure.core/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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote a__3447__auto__)) (clojure.core/list a)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/loop)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list idx) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/int)) (clojure.core/list 0))) (clojure.core/list ret) (clojure.core/list init)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/<)) (clojure.core/list idx) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/alength)) (clojure.core/list (quote a__3447__auto__)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/unchecked-inc)) (clojure.core/list idx))) (clojure.core/list expr))) (clojure.core/list ret))))))) +// Skipping: (defn float-array "Creates an array of floats" {:inline (fn [& args] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/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))) +// Skipping: (defn double-array "Creates an array of doubles" {:inline (fn [& args] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/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))) +// Skipping: (defn int-array "Creates an array of ints" {:inline (fn [& args] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/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))) +// Skipping: (defn long-array "Creates an array of ints" {:inline (fn [& args] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/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))) +// Skipping: (definline floats "Casts to float[]" [xs] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/floats)) (clojure.core/list xs))) +// Skipping: (definline ints "Casts to int[]" [xs] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/ints)) (clojure.core/list xs))) +// Skipping: (definline doubles "Casts to double[]" [xs] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/doubles)) (clojure.core/list xs))) +// Skipping: (definline longs "Casts to long[]" [xs] (clojure.core/concat (clojure.core/list (quote .)) (clojure.core/list (quote clojure.lang.Numbers)) (clojure.core/list (quote clojure.core/longs)) (clojure.core/list xs))) + +//====== +//(import (quote (java.util.concurrent BlockingQueue LinkedBlockingQueue))) +//--- +(function __clojure_core_fn_3497(){ +return (clojure.core.import_.apply(null,[clojure.JS.lit_list([clojure.core.symbol("java.util.concurrent"),clojure.core.symbol("BlockingQueue"),clojure.core.symbol("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.core/deref agt) (do (send-off agt fill) (lazy-cons (if (identical? x NIL) nil x) (drain))))))] (send-off agt fill) (drain)))) + +//====== +//(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_core_fn_3521(){ +return (clojure.JS.def(clojure.core,"alter_var_root",clojure.JS.variadic(2,(function __clojure_core_fn_3521_alter_var_root_3523(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 {}}) +//--- +(function __clojure_core_fn_3527(){ +return (clojure.JS.def(clojure.core,"make_hierarchy",(function __clojure_core_fn_3527_make_hierarchy_3529(){ +return (clojure.core.hash_map(clojure.core.keyword("","parents"),clojure.lang.PersistentArrayMap.EMPTY,clojure.core.keyword("","descendants"),clojure.lang.PersistentArrayMap.EMPTY,clojure.core.keyword("","ancestors"),clojure.lang.PersistentArrayMap.EMPTY))})))}).apply(null,[]); + +//====== +//(def global-hierarchy (make-hierarchy)) +//--- +(function __clojure_core_fn_3533(){ +return (clojure.JS.def(clojure.core,"global_hierarchy",clojure.core.make_hierarchy.apply(null,[])))}).apply(null,[]); + +//====== +//(defn not-empty "If coll is empty, returns nil, else coll" [coll] (when (seq coll) coll)) +//--- +(function __clojure_core_fn_3536(){ +return (clojure.JS.def(clojure.core,"not_empty",(function __clojure_core_fn_3536_not_empty_3538(coll_1){ +return (((clojure.core.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_core_fn_3542(){ +return (clojure.JS.def(clojure.core,"bases",(function __clojure_core_fn_3542_bases_3544(c_1){ +var i_2,s_3; +return (((i_2=(c_1).getInterfaces()), +(s_3=(c_1).getSuperclass()), +clojure.core.not_empty.apply(null,[((s_3)?(clojure.core.cons.apply(null,[s_3,i_2])):(i_2))])))})))}).apply(null,[]); + +//====== +//(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_core_fn_3548(){ +return (clojure.JS.def(clojure.core,"supers",(function __clojure_core_fn_3548_supers_3550(class_1){ +var ret_2,cs_3,c_4,bs_5; +return (((function __loop(){var _rtn,_cnt;(ret_2=clojure.core.set.apply(null,[clojure.core.bases.apply(null,[class_1])])), +(cs_3=ret_2);do{_cnt=0; +_rtn=((clojure.core.seq.apply(null,[cs_3]))?(((c_4=clojure.core.first.apply(null,[cs_3])), +(bs_5=clojure.core.bases.apply(null,[c_4])), +(_cnt=1,_rtn=[clojure.core.into.apply(null,[ret_2,bs_5]),clojure.core.into.apply(null,[clojure.core.disj.apply(null,[cs_3,c_4]),bs_5])],ret_2=_rtn[0],cs_3=_rtn[1]))):(clojure.core.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__3554] (contains? ((:ancestors h) p1__3554) 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_core_fn_3555(){ +return (clojure.JS.def(clojure.core,"isa_QMARK_",(function __clojure_core_fn_3555_isa_QMARK_3557(h_1,child_2,parent_3){switch(arguments.length){ +case 2:var child_1=arguments[0],parent_2=arguments[1]; +return (clojure.core.isa_QMARK_.apply(null,[clojure.core.global_hierarchy,child_1,parent_2]))} +var or__974__auto___7,or__974__auto___6,and__960__auto___6,and__960__auto___7,and__960__auto___8,or__974__auto___5,and__960__auto___5,and__960__auto___9,and__960__auto___10,i_12,ret_11,or__974__auto___13,or__974__auto___4; +return (((or__974__auto___4=clojure.lang.Util.equal(child_2,parent_3)), +((or__974__auto___4)?(or__974__auto___4):(((or__974__auto___5=((and__960__auto___5=clojure.core.class_QMARK_.apply(null,[parent_3])), +((and__960__auto___5)?(((and__960__auto___6=clojure.core.class_QMARK_.apply(null,[child_2])), +((and__960__auto___6)?((parent_3).isAssignableFrom(child_2)):(and__960__auto___6)))):(and__960__auto___5)))), +((or__974__auto___5)?(or__974__auto___5):(((or__974__auto___6=clojure.core.contains_QMARK_.apply(null,[clojure.core.keyword("","ancestors").apply(null,[h_1]).apply(null,[child_2]),parent_3])), +((or__974__auto___6)?(or__974__auto___6):(((or__974__auto___7=((and__960__auto___7=clojure.core.class_QMARK_.apply(null,[child_2])), +((and__960__auto___7)?(clojure.core.some.apply(null,[(function __clojure_core_fn_3555_isa_QMARK_3557_fn_3560(p1__3554_1){ +return (clojure.core.contains_QMARK_.apply(null,[clojure.core.keyword("","ancestors").apply(null,[h_1]).apply(null,[p1__3554_1]),parent_3]))}),clojure.core.supers.apply(null,[child_2])])):(and__960__auto___7)))), +((or__974__auto___7)?(or__974__auto___7):(((and__960__auto___8=clojure.core.vector_QMARK_.apply(null,[parent_3])), +((and__960__auto___8)?(((and__960__auto___9=clojure.core.vector_QMARK_.apply(null,[child_2])), +((and__960__auto___9)?(((and__960__auto___10=clojure.lang.Util.equal(clojure.core.count.apply(null,[parent_3]),clojure.core.count.apply(null,[child_2]))), +((and__960__auto___10)?(((function __loop(){var _rtn,_cnt;(ret_11=true), +(i_12=(0));do{_cnt=0; +_rtn=((((or__974__auto___13=clojure.core.not.apply(null,[ret_11])), +((or__974__auto___13)?(or__974__auto___13):(clojure.lang.Util.equal(i_12,clojure.core.count.apply(null,[parent_3]))))))?(ret_11):((_cnt=1,_rtn=[clojure.core.isa_QMARK_.apply(null,[h_1,child_2.apply(null,[i_12]),parent_3.apply(null,[i_12])]),clojure.lang.Numbers.inc(i_12)],ret_11=_rtn[0],i_12=_rtn[1])))}while(_cnt);return _rtn;})())):(and__960__auto___10)))):(and__960__auto___9)))):(and__960__auto___8))))))))))))))))})))}).apply(null,[]); + +//====== +//(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_core_fn_3576(){ +return (clojure.JS.def(clojure.core,"parents",(function __clojure_core_fn_3576_parents_3578(h_1,tag_2){switch(arguments.length){ +case 1:var tag_1=arguments[0]; +return (clojure.core.parents.apply(null,[clojure.core.global_hierarchy,tag_1]))} +var tp_3; +return (clojure.core.not_empty.apply(null,[((tp_3=clojure.core.get.apply(null,[clojure.core.keyword("","parents").apply(null,[h_1]),tag_2])), +((clojure.core.class_QMARK_.apply(null,[tag_2]))?(clojure.core.into.apply(null,[clojure.core.set.apply(null,[clojure.core.bases.apply(null,[tag_2])]),tp_3])):(tp_3)))]))})))}).apply(null,[]); + +//====== +//(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_core_fn_3583(){ +return (clojure.JS.def(clojure.core,"ancestors",(function __clojure_core_fn_3583_ancestors_3585(h_1,tag_2){switch(arguments.length){ +case 1:var tag_1=arguments[0]; +return (clojure.core.ancestors.apply(null,[clojure.core.global_hierarchy,tag_1]))} +var ta_3; +return (clojure.core.not_empty.apply(null,[((ta_3=clojure.core.get.apply(null,[clojure.core.keyword("","ancestors").apply(null,[h_1]),tag_2])), +((clojure.core.class_QMARK_.apply(null,[tag_2]))?(clojure.core.into.apply(null,[clojure.core.set.apply(null,[clojure.core.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))))) +//--- +(function __clojure_core_fn_3590(){ +return (clojure.JS.def(clojure.core,"descendants",(function __clojure_core_fn_3590_descendants_3592(h_1,tag_2){switch(arguments.length){ +case 1:var tag_1=arguments[0]; +return (clojure.core.descendants.apply(null,[clojure.core.global_hierarchy,tag_1]))} +return (((clojure.core.class_QMARK_.apply(null,[tag_2]))?((function __throw(){throw clojure.lang.RT.makeUnsupportedException("Can't get descendants of classes")})()):(clojure.core.not_empty.apply(null,[clojure.core.get.apply(null,[clojure.core.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] (assert (namespace parent)) (assert (or (class? tag) (and (instance? clojure.lang.Named tag) (namespace tag)))) (alter-var-root (var global-hierarchy) derive tag parent) nil) ([h tag parent] (assert (not= tag parent)) (assert (or (class? tag) (instance? clojure.lang.Named tag))) (assert (instance? clojure.lang.Named 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)), :ancestors (tf (:ancestors h) tag td parent ta), :descendants (tf (:descendants h) parent ta tag td)}) h)))) +//--- +(function __clojure_core_fn_3597(){ +return (clojure.JS.def(clojure.core,"derive",(function __clojure_core_fn_3597_derive_3599(h_1,tag_2,parent_3){switch(arguments.length){ +case 2:var or__974__auto___3,and__960__auto___4,tag_1=arguments[0],parent_2=arguments[1]; +return (((clojure.core.namespace.apply(null,[parent_2]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Assert failed: ",clojure.core.pr_str.apply(null,[clojure.JS.lit_list([clojure.core.symbol("namespace"),clojure.core.symbol("parent")])])]))})())), +((((or__974__auto___3=clojure.core.class_QMARK_.apply(null,[tag_1])), +((or__974__auto___3)?(or__974__auto___3):(((and__960__auto___4=clojure.core.instance_QMARK_.apply(null,[clojure.lang.Named,tag_1])), +((and__960__auto___4)?(clojure.core.namespace.apply(null,[tag_1])):(and__960__auto___4)))))))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Assert failed: ",clojure.core.pr_str.apply(null,[clojure.JS.lit_list([clojure.core.symbol("or"),clojure.JS.lit_list([clojure.core.symbol("class?"),clojure.core.symbol("tag")]),clojure.JS.lit_list([clojure.core.symbol("and"),clojure.JS.lit_list([clojure.core.symbol("instance?"),clojure.core.symbol("clojure.lang.Named"),clojure.core.symbol("tag")]),clojure.JS.lit_list([clojure.core.symbol("namespace"),clojure.core.symbol("tag")])])])])]))})())), +clojure.core.alter_var_root.apply(null,[clojure.core._var_global_hierarchy,clojure.core.derive,tag_1,parent_2]), +null)} +var tf_7,td_5,ta_6,or__974__auto___4,or__974__auto___8,tp_4; +return (((clojure.core.not_EQ_.apply(null,[tag_2,parent_3]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Assert failed: ",clojure.core.pr_str.apply(null,[clojure.JS.lit_list([clojure.core.symbol("not="),clojure.core.symbol("tag"),clojure.core.symbol("parent")])])]))})())), +((((or__974__auto___4=clojure.core.class_QMARK_.apply(null,[tag_2])), +((or__974__auto___4)?(or__974__auto___4):(clojure.core.instance_QMARK_.apply(null,[clojure.lang.Named,tag_2])))))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Assert failed: ",clojure.core.pr_str.apply(null,[clojure.JS.lit_list([clojure.core.symbol("or"),clojure.JS.lit_list([clojure.core.symbol("class?"),clojure.core.symbol("tag")]),clojure.JS.lit_list([clojure.core.symbol("instance?"),clojure.core.symbol("clojure.lang.Named"),clojure.core.symbol("tag")])])])]))})())), +((clojure.core.instance_QMARK_.apply(null,[clojure.lang.Named,parent_3]))?(null):((function __throw(){throw clojure.lang.RT.makeException(clojure.core.str.apply(null,["Assert failed: ",clojure.core.pr_str.apply(null,[clojure.JS.lit_list([clojure.core.symbol("instance?"),clojure.core.symbol("clojure.lang.Named"),clojure.core.symbol("parent")])])]))})())), +((tp_4=clojure.core.keyword("","parents").apply(null,[h_1])), +(td_5=clojure.core.keyword("","descendants").apply(null,[h_1])), +(ta_6=clojure.core.keyword("","ancestors").apply(null,[h_1])), +(tf_7=(function __clojure_core_fn_3597_derive_3599_tf_3602(m_1,source_2,sources_3,target_4,targets_5){ +return (clojure.core.reduce.apply(null,[(function __clojure_core_fn_3597_derive_3599_tf_3602_fn_3604(ret_1,k_2){ +return (clojure.core.assoc.apply(null,[ret_1,k_2,clojure.core.reduce.apply(null,[clojure.core.conj,clojure.core.get.apply(null,[targets_5,k_2,clojure.lang.PersistentHashSet.EMPTY]),clojure.core.cons.apply(null,[target_4,targets_5.apply(null,[target_4])])])]))}),m_1,clojure.core.cons.apply(null,[source_2,sources_3.apply(null,[source_2])])]))})), +((or__974__auto___8=((clojure.core.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(null):(((clojure.core.contains_QMARK_.apply(null,[ta_6.apply(null,[tag_2]),parent_3]))?((function __throw(){throw clojure.lang.RT.makeException(clojure.core.print_str.apply(null,[tag_2,"already has",parent_3,"as ancestor"]))})()):(null)), +((clojure.core.contains_QMARK_.apply(null,[ta_6.apply(null,[parent_3]),tag_2]))?((function __throw(){throw clojure.lang.RT.makeException(clojure.core.print_str.apply(null,["Cyclic derivation:",parent_3,"has",tag_2,"as ancestor"]))})()):(null)), +clojure.core.hash_map(clojure.core.keyword("","parents"),clojure.core.assoc.apply(null,[clojure.core.keyword("","parents").apply(null,[h_1]),tag_2,clojure.core.conj.apply(null,[clojure.core.get.apply(null,[tp_4,tag_2,clojure.lang.PersistentHashSet.EMPTY]),parent_3])]),clojure.core.keyword("","ancestors"),tf_7.apply(null,[clojure.core.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]),clojure.core.keyword("","descendants"),tf_7.apply(null,[clojure.core.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]))))), +((or__974__auto___8)?(or__974__auto___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)), :ancestors (tf (:ancestors h) tag td parent ta), :descendants (tf (:descendants h) parent ta tag td)} h)))) +//--- +(function __clojure_core_fn_3614(){ +return (clojure.JS.def(clojure.core,"underive",(function __clojure_core_fn_3614_underive_3616(h_1,tag_2,parent_3){switch(arguments.length){ +case 2:var tag_1=arguments[0],parent_2=arguments[1]; +return (clojure.core.alter_var_root.apply(null,[clojure.core._var_global_hierarchy,clojure.core.underive,tag_1,parent_2]), +null)} +var tp_4,td_5,ta_6,tf_7; +return (((tp_4=clojure.core.keyword("","parents").apply(null,[h_1])), +(td_5=clojure.core.keyword("","descendants").apply(null,[h_1])), +(ta_6=clojure.core.keyword("","ancestors").apply(null,[h_1])), +(tf_7=(function __clojure_core_fn_3614_underive_3616_tf_3619(m_1,source_2,sources_3,target_4,targets_5){ +return (clojure.core.reduce.apply(null,[(function __clojure_core_fn_3614_underive_3616_tf_3619_fn_3621(ret_1,k_2){ +return (clojure.core.assoc.apply(null,[ret_1,k_2,clojure.core.reduce.apply(null,[clojure.core.disj,clojure.core.get.apply(null,[targets_5,k_2]),clojure.core.cons.apply(null,[target_4,targets_5.apply(null,[target_4])])])]))}),m_1,clojure.core.cons.apply(null,[source_2,sources_3.apply(null,[source_2])])]))})), +((clojure.core.contains_QMARK_.apply(null,[tp_4.apply(null,[tag_2]),parent_3]))?(clojure.core.hash_map(clojure.core.keyword("","parent"),clojure.core.assoc.apply(null,[clojure.core.keyword("","parents").apply(null,[h_1]),tag_2,clojure.core.disj.apply(null,[clojure.core.get.apply(null,[tp_4,tag_2]),parent_3])]),clojure.core.keyword("","ancestors"),tf_7.apply(null,[clojure.core.keyword("","ancestors").apply(null,[h_1]),tag_2,td_5,parent_3,ta_6]),clojure.core.keyword("","descendants"),tf_7.apply(null,[clojure.core.keyword("","descendants").apply(null,[h_1]),parent_3,ta_6,tag_2,td_5]))):(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_core_fn_3627(){ +return (clojure.JS.def(clojure.core,"distinct_QMARK_",clojure.JS.variadic(2,(function __clojure_core_fn_3627_distinct_QMARK_3629(x_1,y_2){switch(arguments.length){ +case 1:return (true) +case 2:return (clojure.core.not.apply(null,[clojure.lang.Util.equal(x_1,y_2)]))} +var xs_16,xs_9,G__3634_11,vec__3635_6,etc_15,etc_8,x_14,G__3634_5,x_7,s_4,s_10,s_12,vec__3636_13,more_3=clojure.JS.rest_args(this,arguments,2); +return (((clojure.core.not_EQ_.apply(null,[x_1,y_2]))?(((s_4=clojure.core.hash_set(y_2,x_1)), +(G__3634_5=more_3), +(vec__3635_6=G__3634_5), +(x_7=clojure.core.nth.apply(null,[vec__3635_6,(0),null])), +(etc_8=clojure.core.nthrest.apply(null,[vec__3635_6,(1)])), +(xs_9=vec__3635_6), +((function __loop(){var _rtn,_cnt;(s_10=s_4), +(G__3634_11=G__3634_5);do{_cnt=0; +_rtn=((s_12=s_10), +(vec__3636_13=G__3634_11), +(x_14=clojure.core.nth.apply(null,[vec__3636_13,(0),null])), +(etc_15=clojure.core.nthrest.apply(null,[vec__3636_13,(1)])), +(xs_16=vec__3636_13), +((xs_16)?(((clojure.core.contains_QMARK_.apply(null,[s_12,x_14]))?(false):((_cnt=1,_rtn=[clojure.core.conj.apply(null,[s_12,x_14]),etc_15],s_10=_rtn[0],G__3634_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_core_fn_3639(){ +return (clojure.JS.def(clojure.core,"iterator_seq",(function __clojure_core_fn_3639_iterator_seq_3641(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_core_fn_3645(){ +return (clojure.JS.def(clojure.core,"enumeration_seq",(function __clojure_core_fn_3645_enumeration_seq_3647(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_core_fn_3657(){ +return (clojure.JS.def(clojure.core,"printf",clojure.JS.variadic(1,(function __clojure_core_fn_3657_printf_3659(fmt_1){ +var args_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.print.apply(null,[clojure.core.apply.apply(null,[clojure.core.format,fmt_1,args_2])]))}))))}).apply(null,[]); + +//====== +//(def gen-class) +//--- +(function __clojure_core_fn_3663(){ +return (clojure.JS.def(clojure.core,"gen_class",null))}).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 ...) (:gen-class)\n with the syntax of refer-clojure/require/use/import/load/gen-class\n respectively, except the arguments are unevaluated and need not be\n quoted. (:gen-class ...), when supplied, defaults to :name\n corresponding to the ns name, :main true, :impl-ns same as ns, and\n :init-impl-ns true. All options of gen-class are\n supported. The :gen-class directive is ignored when not\n compiling. If :gen-class is not supplied, when compiled only an\n nsname__init.class will be generated. If :refer-clojure is not used, a\n default (refer 'clojure) is used. Use of ns is preferred to\n individual calls to in-ns/require/use/import:\n\n (ns foo.bar\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)))" [name & references] (let [process-reference (fn [[kname & args]] (clojure.core/concat (clojure.core/list (symbol "clojure.core" (clojure.core/name kname))) (map (fn* [p1__3666] (list (quote quote) p1__3666)) args))) gen-class-clause (first (filter (fn* [p1__3667] (= :gen-class (first p1__3667))) references)) gen-class-call (when gen-class-clause (list* (quote clojure.core/gen-class) :name (.replace (str name) \- \_) :impl-ns name :main true (rest gen-class-clause))) references (remove (fn* [p1__3668] (= :gen-class (first p1__3668))) references)] (clojure.core/concat (clojure.core/list (quote do)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/in-ns)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list name))))) (when gen-class-call (list gen-class-call)) (when (and (not= name (quote clojure.core)) (not-any? (fn* [p1__3669] (= :refer-clojure (first p1__3669))) references)) (clojure.core/concat (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/refer)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list (quote clojure.core)))))))) (map process-reference references)))) +// Skipping: (defmacro refer-clojure "Same as (refer 'clojure <filters>)" [& filters] (clojure.core/concat (clojure.core/list (quote clojure.core/refer)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote quote)) (clojure.core/list (quote clojure.core)))) 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.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote v__3724__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote def)) (clojure.core/list name)))))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when-not)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote .hasRoot)) (clojure.core/list (quote v__3724__auto__)))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote def)) (clojure.core/list name) (clojure.core/list expr))))))) + +//====== +//(defonce *loaded-libs* (ref (sorted-set))) +//--- +(function __clojure_core_fn_3734(){ +var v__3724__auto___1; +return (((v__3724__auto___1=clojure.JS.def(clojure.core,"_STAR_loaded_libs_STAR_",null)), +(((v__3724__auto___1).hasRoot())?(null):(clojure.JS.def(clojure.core,"_STAR_loaded_libs_STAR_",clojure.core.ref.apply(null,[clojure.core.sorted_set.apply(null,[])]))))))}).apply(null,[]); + +//====== +//(defonce *pending-paths* #{}) +//--- +(function __clojure_core_fn_3738(){ +var v__3724__auto___1; +return (((v__3724__auto___1=clojure.JS.def(clojure.core,"_STAR_pending_paths_STAR_",null)), +(((v__3724__auto___1).hasRoot())?(null):(clojure.JS.def(clojure.core,"_STAR_pending_paths_STAR_",clojure.lang.PersistentHashSet.EMPTY)))))}).apply(null,[]); + +//====== +//(defonce *loading-verbosely* false) +//--- +(function __clojure_core_fn_3742(){ +var v__3724__auto___1; +return (((v__3724__auto___1=clojure.JS.def(clojure.core,"_STAR_loading_verbosely_STAR_",null)), +(((v__3724__auto___1).hasRoot())?(null):(clojure.JS.def(clojure.core,"_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__3746] (not= (.getMethodName p1__3746) "doInvoke")) trace (into-array (drop 2 (drop-while boring? raw-trace)))] (.setStackTrace exception trace) (throw exception)))) +//--- +(function __clojure_core_fn_3747(){ +return (clojure.JS.def(clojure.core,"throw_if",clojure.JS.variadic(2,(function __clojure_core_fn_3747_throw_if_3749(pred_1,fmt_2){ +var message_4,exception_5,raw_trace_6,boring_QMARK__7,trace_8,args_3=clojure.JS.rest_args(this,arguments,2); +return (((pred_1)?(((message_4=clojure.core.apply.apply(null,[clojure.core.format,fmt_2,args_3])), +(exception_5=clojure.lang.RT.makeException(message_4)), +(raw_trace_6=(exception_5).getStackTrace()), +(boring_QMARK__7=(function __clojure_core_fn_3747_throw_if_3749_boring_QMARK_3751(p1__3746_1){ +return (clojure.core.not_EQ_.apply(null,[clojure.JS.getOrRun(p1__3746_1,"getMethodName"),"doInvoke"]))})), +(trace_8=clojure.core.into_array.apply(null,[clojure.core.drop.apply(null,[(2),clojure.core.drop_while.apply(null,[boring_QMARK__7,raw_trace_6])])])), +(exception_5).setStackTrace(trace_8), +(function __throw(){throw exception_5})())):(null)))}))))}).apply(null,[]); + +//====== +//(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_core_fn_3756(){ +return (clojure.JS.def(clojure.core,"libspec_QMARK_",(function __clojure_core_fn_3756_libspec_QMARK_3758(x_1){ +var or__974__auto___2,and__960__auto___3,or__974__auto___4; +return (((or__974__auto___2=clojure.core.symbol_QMARK_.apply(null,[x_1])), +((or__974__auto___2)?(or__974__auto___2):(((and__960__auto___3=clojure.core.vector_QMARK_.apply(null,[x_1])), +((and__960__auto___3)?(((or__974__auto___4=clojure.core.nil_QMARK_.apply(null,[clojure.core.second.apply(null,[x_1])])), +((or__974__auto___4)?(or__974__auto___4):(clojure.core.keyword_QMARK_.apply(null,[clojure.core.second.apply(null,[x_1])]))))):(and__960__auto___3)))))))})))}).apply(null,[]); + +//====== +//(defn- prependss "Prepends a symbol or a seq to coll" [x coll] (if (symbol? x) (cons x coll) (concat x coll))) +//--- +(function __clojure_core_fn_3765(){ +return (clojure.JS.def(clojure.core,"prependss",(function __clojure_core_fn_3765_prependss_3767(x_1,coll_2){ +return (((clojure.core.symbol_QMARK_.apply(null,[x_1]))?(clojure.core.cons.apply(null,[x_1,coll_2])):(clojure.core.concat.apply(null,[x_1,coll_2]))))})))}).apply(null,[]); + +//====== +//(defn- root-resource "Returns the root directory path for a lib" [lib] (str \/ (.. (name lib) (replace \- \_) (replace \. \/)))) +//--- +(function __clojure_core_fn_3771(){ +return (clojure.JS.def(clojure.core,"root_resource",(function __clojure_core_fn_3771_root_resource_3773(lib_1){ +return (clojure.core.str.apply(null,["/",((clojure.core.name.apply(null,[lib_1])).replace("-","_")).replace(".","/")]))})))}).apply(null,[]); + +//====== +//(defn- root-directory "Returns the root resource path for a lib" [lib] (let [d (root-resource lib)] (subs d 0 (.lastIndexOf d "/")))) +//--- +(function __clojure_core_fn_3777(){ +return (clojure.JS.def(clojure.core,"root_directory",(function __clojure_core_fn_3777_root_directory_3779(lib_1){ +var d_2; +return (((d_2=clojure.core.root_resource.apply(null,[lib_1])), +clojure.core.subs.apply(null,[d_2,(0),(d_2).lastIndexOf("/")])))})))}).apply(null,[]); +// Skipping: (def load) + +//====== +//(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_core_fn_3786(){ +return (clojure.JS.def(clojure.core,"load_one",(function __clojure_core_fn_3786_load_one_3788(lib_1,need_ns_2,require_3){ +var and__960__auto___4; +return (clojure.core.load.apply(null,[clojure.core.root_resource.apply(null,[lib_1])]), +clojure.core.throw_if.apply(null,[((and__960__auto___4=need_ns_2), +((and__960__auto___4)?(clojure.core.not.apply(null,[clojure.core.find_ns.apply(null,[lib_1])])):(and__960__auto___4))),"namespace '%s' not found after loading '%s'",lib_1,clojure.core.root_resource.apply(null,[lib_1])]), +((require_3)?(clojure.lang.LockingTransaction.runInTransaction((function __clojure_core_fn_3786_load_one_3788_fn_3790(){ +return (clojure.core.commute.apply(null,[clojure.core._STAR_loaded_libs_STAR_,clojure.core.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__3796 p2__3797] (reduce conj p1__3796 p2__3797)) (binding [*loaded-libs* (ref (sorted-set))] (load-one lib need-ns require) (clojure.core/deref *loaded-libs*))))) +//--- +(function __clojure_core_fn_3798(){ +return (clojure.JS.def(clojure.core,"load_all",(function __clojure_core_fn_3798_load_all_3800(lib_1,need_ns_2,require_3){ +return (clojure.lang.LockingTransaction.runInTransaction((function __clojure_core_fn_3798_load_all_3800_fn_3802(){ +return (clojure.core.commute.apply(null,[clojure.core._STAR_loaded_libs_STAR_,(function __clojure_core_fn_3798_load_all_3800_fn_3802_fn_3804(p1__3796_1,p2__3797_2){ +return (clojure.core.reduce.apply(null,[clojure.core.conj,p1__3796_1,p2__3797_2]))}),clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_loaded_libs_STAR_,clojure.core.ref.apply(null,[clojure.core.sorted_set.apply(null,[])])])), +(function __clojure_core_fn_3798_load_all_3800_fn_3802_fn_3807(){ +return ((function __try(){try{var _rtn=(clojure.core.load_one.apply(null,[lib_1,need_ns_2,require_3]), +clojure.core.deref.apply(null,[clojure.core._STAR_loaded_libs_STAR_]))} +finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[])]))})))})))}).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.core/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.core/in-ns '%s)\n" (ns-name *ns*))) (when as (when *loading-verbosely* (printf "(clojure.core/alias '%s '%s)\n" as lib)) (alias as lib)) (when use (when *loading-verbosely* (printf "(clojure.core/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_core_fn_3813(){ +return (clojure.JS.def(clojure.core,"load_lib",clojure.JS.variadic(2,(function __clojure_core_fn_3813_load_lib_3815(prefix_1,lib_2){ +var map__3817_6,loaded_13,require_9,reload_11,and__960__auto___19,load_14,opts_5,lib_4,as_12,and__960__auto___4,verbose_7,or__974__auto___15,use_8,and__960__auto___19,filter_opts_16,or__974__auto___14,reload_all_10,sq__2055__auto___19,or__974__auto___17,need_ns_15,or__974__auto___15,opt_20,options_3=clojure.JS.rest_args(this,arguments,2); +return (clojure.core.throw_if.apply(null,[((and__960__auto___4=prefix_1), +((and__960__auto___4)?(clojure.lang.Numbers.isPos((clojure.core.name.apply(null,[lib_2])).indexOf(clojure.lang.RT.intCast(".")))):(and__960__auto___4))),"lib names inside prefix lists must not contain periods"]), +((lib_4=((prefix_1)?(clojure.core.symbol.apply(null,[clojure.core.str.apply(null,[prefix_1,".",lib_2])])):(lib_2))), +(opts_5=clojure.core.apply.apply(null,[clojure.core.hash_map,options_3])), +(map__3817_6=opts_5), +(verbose_7=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","verbose")])), +(use_8=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","use")])), +(require_9=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","require")])), +(reload_all_10=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","reload-all")])), +(reload_11=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","reload")])), +(as_12=clojure.core.get.apply(null,[map__3817_6,clojure.core.keyword("","as")])), +(loaded_13=clojure.core.contains_QMARK_.apply(null,[clojure.core.deref.apply(null,[clojure.core._STAR_loaded_libs_STAR_]),lib_4])), +(load_14=((reload_all_10)?(clojure.core.load_all):(((((or__974__auto___14=reload_11), +((or__974__auto___14)?(or__974__auto___14):(((or__974__auto___15=clojure.core.not.apply(null,[require_9])), +((or__974__auto___15)?(or__974__auto___15):(clojure.core.not.apply(null,[loaded_13]))))))))?(clojure.core.load_one):(null))))), +(need_ns_15=((or__974__auto___15=as_12), +((or__974__auto___15)?(or__974__auto___15):(use_8)))), +(filter_opts_16=clojure.core.select_keys.apply(null,[opts_5,clojure.JS.lit_list([clojure.core.keyword("","exclude"),clojure.core.keyword("","only"),clojure.core.keyword("","rename")])])), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_loading_verbosely_STAR_,((or__974__auto___17=clojure.core._STAR_loading_verbosely_STAR_), +((or__974__auto___17)?(or__974__auto___17):(verbose_7)))])), +(function __try(){try{var _rtn=(((load_14)?(load_14.apply(null,[lib_4,need_ns_15,require_9])):(clojure.core.throw_if.apply(null,[((and__960__auto___19=need_ns_15), +((and__960__auto___19)?(clojure.core.not.apply(null,[clojure.core.find_ns.apply(null,[lib_4])])):(and__960__auto___19))),"namespace '%s' not found",lib_4]))), +((((and__960__auto___19=need_ns_15), +((and__960__auto___19)?(clojure.core._STAR_loading_verbosely_STAR_):(and__960__auto___19))))?(clojure.core.printf.apply(null,["(clojure.core/in-ns '%s)\n",clojure.core.ns_name.apply(null,[clojure.core._STAR_ns_STAR_])])):(null)), +((as_12)?(((clojure.core._STAR_loading_verbosely_STAR_)?(clojure.core.printf.apply(null,["(clojure.core/alias '%s '%s)\n",as_12,lib_4])):(null)), +clojure.core.alias.apply(null,[as_12,lib_4])):(null)), +((use_8)?(((clojure.core._STAR_loading_verbosely_STAR_)?(clojure.core.printf.apply(null,["(clojure.core/refer '%s",lib_4]), +((function __loop(){var _rtn,_cnt;(sq__2055__auto___19=clojure.core.seq.apply(null,[filter_opts_16]));do{_cnt=0; +_rtn=((sq__2055__auto___19)?(((opt_20=clojure.core.first.apply(null,[sq__2055__auto___19])), +((true)?(((true)?(clojure.core.printf.apply(null,[" %s '%s",clojure.core.key.apply(null,[opt_20]),clojure.core.print_str.apply(null,[clojure.core.val.apply(null,[opt_20])])])):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__2055__auto___19])],sq__2055__auto___19=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})()), +clojure.core.printf.apply(null,[")\n"])):(null)), +clojure.core.apply.apply(null,[clojure.core.refer,lib_4,clojure.core.mapcat.apply(null,[clojure.core.seq,filter_opts_16])])):(null)))} +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_core_fn_3828(){ +return (clojure.JS.def(clojure.core,"load_libs",clojure.JS.variadic(0,(function __clojure_core_fn_3828_load_libs_3830(){ +var flags_2,vec__3832_7,arg_6,prefix_8,sq__2055__auto___5,sq__2055__auto___10,opts_3,arg_11,args_4,args_9,args_1=clojure.JS.rest_args(this,arguments,0); +return (((flags_2=clojure.core.filter.apply(null,[clojure.core.keyword_QMARK_,args_1])), +(opts_3=clojure.core.interleave.apply(null,[flags_2,clojure.core.repeat.apply(null,[true])])), +(args_4=clojure.core.filter.apply(null,[clojure.core.complement.apply(null,[clojure.core.keyword_QMARK_]),args_1])), +((function __loop(){var _rtn,_cnt;(sq__2055__auto___5=clojure.core.seq.apply(null,[args_4]));do{_cnt=0; +_rtn=((sq__2055__auto___5)?(((arg_6=clojure.core.first.apply(null,[sq__2055__auto___5])), +((true)?(((true)?(((clojure.core.libspec_QMARK_.apply(null,[arg_6]))?(clojure.core.apply.apply(null,[clojure.core.load_lib,null,clojure.core.prependss.apply(null,[arg_6,opts_3])])):(((vec__3832_7=arg_6), +(prefix_8=clojure.core.nth.apply(null,[vec__3832_7,(0),null])), +(args_9=clojure.core.nthrest.apply(null,[vec__3832_7,(1)])), +clojure.core.throw_if.apply(null,[clojure.core.nil_QMARK_.apply(null,[prefix_8]),"prefix cannot be nil"]), +((function __loop(){var _rtn,_cnt;(sq__2055__auto___10=clojure.core.seq.apply(null,[args_9]));do{_cnt=0; +_rtn=((sq__2055__auto___10)?(((arg_11=clojure.core.first.apply(null,[sq__2055__auto___10])), +((true)?(((true)?(clojure.core.apply.apply(null,[clojure.core.load_lib,prefix_8,clojure.core.prependss.apply(null,[arg_11,opts_3])])):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__2055__auto___10])],sq__2055__auto___10=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})()))))):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__2055__auto___5])],sq__2055__auto___5=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})())))}))))}).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_core_fn_3837(){ +return (clojure.JS.def(clojure.core,"require",clojure.JS.variadic(0,(function __clojure_core_fn_3837_require_3839(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[clojure.core.load_libs,clojure.core.keyword("","require"),args_1]))}))))}).apply(null,[]); + +//====== +//(defn use "Like 'require, but also refers to each lib's namespace using\n clojure.core/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.core/refer." [& args] (apply load-libs :require :use args)) +//--- +(function __clojure_core_fn_3843(){ +return (clojure.JS.def(clojure.core,"use",clojure.JS.variadic(0,(function __clojure_core_fn_3843_use_3845(){ +var args_1=clojure.JS.rest_args(this,arguments,0); +return (clojure.core.apply.apply(null,[clojure.core.load_libs,clojure.core.keyword("","require"),clojure.core.keyword("","use"),args_1]))}))))}).apply(null,[]); + +//====== +//(defn loaded-libs "Returns a sorted set of symbols naming the currently loaded libs" [] (clojure.core/deref *loaded-libs*)) +//--- +(function __clojure_core_fn_3849(){ +return (clojure.JS.def(clojure.core,"loaded_libs",(function __clojure_core_fn_3849_loaded_libs_3851(){ +return (clojure.core.deref.apply(null,[clojure.core._STAR_loaded_libs_STAR_]))})))}).apply(null,[]); +// Skipping: (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.core/load \"%s\")\n" path) (flush)) (when-not (*pending-paths* path) (binding [*pending-paths* (conj *pending-paths* path)] (clojure.lang.RT/load (.substring path 1))))))) + +//====== +//(defn compile "Compiles the namespace named by the symbol lib into a set of\n classfiles. The source for the lib must be in a proper\n classpath-relative directory. The output files will go into the\n directory specified by *compile-path*, and that directory too must\n be in the classpath." [lib] (binding [*compile-files* true] (load-one lib true true)) lib) +//--- +(function __clojure_core_fn_3865(){ +return (clojure.JS.def(clojure.core,"compile",(function __clojure_core_fn_3865_compile_3867(lib_1){ +return (clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_compile_files_STAR_,true])), +(function __clojure_core_fn_3865_compile_3867_fn_3869(){ +return ((function __try(){try{var _rtn=(clojure.core.load_one.apply(null,[lib_1,true,true]))} +finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[]), +lib_1)})))}).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_core_fn_3874(){ +return (clojure.JS.def(clojure.core,"get_in",(function __clojure_core_fn_3874_get_in_3876(m_1,ks_2){ +return (clojure.core.reduce.apply(null,[clojure.core.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_core_fn_3880(){ +return (clojure.JS.def(clojure.core,"assoc_in",(function __clojure_core_fn_3880_assoc_in_3883(m_1,p__3882_2,v_3){ +var vec__3885_4,k_5,ks_6; +return (((vec__3885_4=p__3882_2), +(k_5=clojure.core.nth.apply(null,[vec__3885_4,(0),null])), +(ks_6=clojure.core.nthrest.apply(null,[vec__3885_4,(1)])), +((ks_6)?(clojure.core.assoc.apply(null,[m_1,k_5,clojure.core.assoc_in.apply(null,[clojure.core.get.apply(null,[m_1,k_5]),ks_6,v_3])])):(clojure.core.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 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_core_fn_3888(){ +return (clojure.JS.def(clojure.core,"update_in",clojure.JS.variadic(3,(function __clojure_core_fn_3888_update_in_3891(m_1,p__3890_2,f_3){ +var vec__3893_5,k_6,ks_7,args_4=clojure.JS.rest_args(this,arguments,3); +return (((vec__3893_5=p__3890_2), +(k_6=clojure.core.nth.apply(null,[vec__3893_5,(0),null])), +(ks_7=clojure.core.nthrest.apply(null,[vec__3893_5,(1)])), +((ks_7)?(clojure.core.assoc.apply(null,[m_1,k_6,clojure.core.apply.apply(null,[clojure.core.update_in,clojure.core.get.apply(null,[m_1,k_6]),ks_7,f_3,args_4])])):(clojure.core.assoc.apply(null,[m_1,k_6,clojure.core.apply.apply(null,[f_3,clojure.core.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_core_fn_3896(){ +return (clojure.JS.def(clojure.core,"empty_QMARK_",(function __clojure_core_fn_3896_empty_QMARK_3898(coll_1){ +return (clojure.core.not.apply(null,[clojure.core.seq.apply(null,[coll_1])]))})))}).apply(null,[]); + +//====== +//(defn coll? "Returns true if x implements IPersistentCollection" [x] (instance? clojure.lang.IPersistentCollection x)) +//--- +(function __clojure_core_fn_3902(){ +return (clojure.JS.def(clojure.core,"coll_QMARK_",(function __clojure_core_fn_3902_coll_QMARK_3904(x_1){ +return (clojure.core.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_core_fn_3908(){ +return (clojure.JS.def(clojure.core,"list_QMARK_",(function __clojure_core_fn_3908_list_QMARK_3910(x_1){ +return (clojure.core.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_core_fn_3914(){ +return (clojure.JS.def(clojure.core,"set_QMARK_",(function __clojure_core_fn_3914_set_QMARK_3916(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.IPersistentSet,x_1]))})))}).apply(null,[]); + +//====== +//(defn ifn? "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_core_fn_3920(){ +return (clojure.JS.def(clojure.core,"ifn_QMARK_",(function __clojure_core_fn_3920_ifn_QMARK_3922(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.IFn,x_1]))})))}).apply(null,[]); + +//====== +//(defn fn? "Returns true if x implements Fn, i.e. is an object created via fn." [x] (instance? clojure.lang.Fn x)) +//--- +(function __clojure_core_fn_3926(){ +return (clojure.JS.def(clojure.core,"fn_QMARK_",(function __clojure_core_fn_3926_fn_QMARK_3928(x_1){ +return (clojure.core.instance_QMARK_.apply(null,[clojure.lang.Fn,x_1]))})))}).apply(null,[]); + +//====== +//(defn associative? "Returns true if coll implements Associative" [coll] (instance? clojure.lang.Associative coll)) +//--- +(function __clojure_core_fn_3932(){ +return (clojure.JS.def(clojure.core,"associative_QMARK_",(function __clojure_core_fn_3932_associative_QMARK_3934(coll_1){ +return (clojure.core.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_core_fn_3938(){ +return (clojure.JS.def(clojure.core,"sequential_QMARK_",(function __clojure_core_fn_3938_sequential_QMARK_3940(coll_1){ +return (clojure.core.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_core_fn_3944(){ +return (clojure.JS.def(clojure.core,"sorted_QMARK_",(function __clojure_core_fn_3944_sorted_QMARK_3946(coll_1){ +return (clojure.core.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_core_fn_3950(){ +return (clojure.JS.def(clojure.core,"reversible_QMARK_",(function __clojure_core_fn_3950_reversible_QMARK_3952(coll_1){ +return (clojure.core.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__3956] (agent (f p1__3956))) (take n coll))) wget (fn [a] (await1 a) (clojure.core/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__3957] (apply f p1__3957)) (step (cons coll colls)))))) + +//====== +//(def *1) +//--- +(function __clojure_core_fn_3995(){ +return (clojure.JS.def(clojure.core,"_STAR_1",null))}).apply(null,[]); + +//====== +//(def *2) +//--- +(function __clojure_core_fn_3998(){ +return (clojure.JS.def(clojure.core,"_STAR_2",null))}).apply(null,[]); + +//====== +//(def *3) +//--- +(function __clojure_core_fn_4001(){ +return (clojure.JS.def(clojure.core,"_STAR_3",null))}).apply(null,[]); + +//====== +//(def *e) +//--- +(function __clojure_core_fn_4004(){ +return (clojure.JS.def(clojure.core,"_STAR_e",null))}).apply(null,[]); +// Skipping: (defmacro declare "defs the supplied var names with no bindings, useful for making forward declarations." [& names] (clojure.core/concat (clojure.core/list (quote do)) (map (fn* [p1__4007] (list (quote def) p1__4007)) names))) + +//====== +//(defn trampoline "trampoline can be used to convert algorithms requiring mutual\n recursion without stack consumption. Calls f with supplied args, if\n any. If f returns a fn, calls that fn with no arguments, and\n continues to repeat, until the return value is not a fn, then\n returns that non-fn value. Note that if you want to return a fn as a\n final value, you must wrap it in some data structure and unpack it\n after trampoline returns." ([f] (let [ret (f)] (if (fn? ret) (recur ret) ret))) ([f & args] (trampoline (fn* [] (apply f args))))) +//--- +(function __clojure_core_fn_4023(){ +return (clojure.JS.def(clojure.core,"trampoline",clojure.JS.variadic(1,(function __clojure_core_fn_4023_trampoline_4025(f_1){switch(arguments.length){ +case 1:var _cnt,_rtn,ret_2; +do{_cnt=0;_rtn=((ret_2=f_1.apply(null,[])), +((clojure.core.fn_QMARK_.apply(null,[ret_2]))?((_cnt=1,_rtn=[ret_2],f_1=_rtn[0])):(ret_2))) +}while(_cnt);return _rtn;} +var args_2=clojure.JS.rest_args(this,arguments,1); +return (clojure.core.trampoline.apply(null,[(function __clojure_core_fn_4023_trampoline_4025_fn_4028(){ +return (clojure.core.apply.apply(null,[f_1,args_2]))})]))}))))}).apply(null,[]); + +//====== +//(defn intern "Finds or creates a var named by the symbol name in the namespace\n ns (which can be a symbol or a namespace), setting its root binding\n to val if supplied. The namespace must exist. The var will adopt any\n metadata from the name symbol. Returns the var." ([ns name] (let [v (clojure.lang.Var/intern (the-ns ns) name)] (when (clojure.core/meta name) (.setMeta v (clojure.core/meta name))) v)) ([ns name val] (let [v (clojure.lang.Var/intern (the-ns ns) name val)] (when (clojure.core/meta name) (.setMeta v (clojure.core/meta name))) v))) +//--- +(function __clojure_core_fn_4033(){ +return (clojure.JS.def(clojure.core,"intern",(function __clojure_core_fn_4033_intern_4035(ns_1,name_2,val_3){switch(arguments.length){ +case 2:var v_3; +return (((v_3=clojure.lang.Var.intern(clojure.core.the_ns.apply(null,[ns_1]),name_2)), +((clojure.core.meta.apply(null,[name_2]))?((v_3).setMeta(clojure.core.meta.apply(null,[name_2]))):(null)), +v_3))} +var v_4; +return (((v_4=clojure.lang.Var.intern(clojure.core.the_ns.apply(null,[ns_1]),name_2,val_3)), +((clojure.core.meta.apply(null,[name_2]))?((v_4).setMeta(clojure.core.meta.apply(null,[name_2]))):(null)), +v_4))})))}).apply(null,[]); +// Skipping: (defmacro while "Repeatedly executes body while test expression is true. Presumes\n some side-effect will cause test to become false/nil. Returns nil" [test & body] (clojure.core/concat (clojure.core/list (quote clojure.core/loop)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat))) (clojure.core/list (clojure.core/concat (clojure.core/list (quote clojure.core/when)) (clojure.core/list test) body (clojure.core/list (clojure.core/concat (clojure.core/list (quote recur)))))))) + +//====== +//(defn memoize "Returns a memoized version of a referentially transparent function. The\n memoized version of the function keeps a cache of the mapping from arguments\n to results and, when calls with the same arguments are repeated often, has\n higher performance at the expense of higher memory use." [f] (let [mem (atom {})] (fn [& args] (if-let [e (find (clojure.core/deref mem) args)] (val e) (let [ret (apply f args)] (swap! mem assoc args ret) ret))))) +//--- +(function __clojure_core_fn_4049(){ +return (clojure.JS.def(clojure.core,"memoize",(function __clojure_core_fn_4049_memoize_4051(f_1){ +var mem_2; +return (((mem_2=clojure.core.atom.apply(null,[clojure.lang.PersistentArrayMap.EMPTY])), +clojure.JS.variadic(0,(function __clojure_core_fn_4049_memoize_4051_fn_4053(){ +var temp__3296__auto___2,e_3,ret_3,args_1=clojure.JS.rest_args(this,arguments,0); +return (((temp__3296__auto___2=clojure.core.find.apply(null,[clojure.core.deref.apply(null,[mem_2]),args_1])), +((temp__3296__auto___2)?(((e_3=temp__3296__auto___2), +clojure.core.val.apply(null,[e_3]))):(((ret_3=clojure.core.apply.apply(null,[f_1,args_1])), +clojure.core.swap_BANG_.apply(null,[mem_2,clojure.core.assoc,args_1,ret_3]), +ret_3)))))}))))})))}).apply(null,[]); +// Skipping: (defmacro condp "Takes a binary predicate, an expression, and a set of clauses.\n Each clause can take the form of either:\n \n test-expr result-expr\n\n test-expr :>> result-fn\n\n Note :>> is an ordinary keyword.\n\n For each clause, (pred test-expr expr) is evaluated. If it returns\n logical true, the clause is a match. If a binary clause matches, the\n result-expr is returned, if a ternary clause matches, its result-fn,\n which must be a unary function, is called with the result of the\n predicate as its argument, the result of that call being the return\n value of condp. A single default expression can follow the clauses,\n and its value will be returned if no clause matches. If no default\n expression is provided and no clause matches, an\n IllegalArgumentException is thrown." [pred expr & clauses] (let [gpred (gensym "pred__") gexpr (gensym "expr__") emit (fn emit [pred expr args] (let [[[a b c :as clause] more] (split-at (if (= :>> (second args)) 3 2) args) n (count clause)] (cond (= 0 n) (clojure.core/concat (clojure.core/list (quote throw)) (clojure.core/list (clojure.core/concat (clojure.core/list (quote java.lang.IllegalArgumentException.)) (clojure.core/list "No matching clause")))) (= 1 n) a (= 2 n) (clojure.core/concat (clojure.core/list (quote if)) (clojure.core/list (clojure.core/concat (clojure.core/list pred) (clojure.core/list a) (clojure.core/list expr))) (clojure.core/list b) (clojure.core/list (emit pred expr more))) :else (clojure.core/concat (clojure.core/list (quote clojure.core/if-let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list (quote p__4059__auto__)) (clojure.core/list (clojure.core/concat (clojure.core/list pred) (clojure.core/list a) (clojure.core/list expr)))))) (clojure.core/list (clojure.core/concat (clojure.core/list c) (clojure.core/list (quote p__4059__auto__)))) (clojure.core/list (emit pred expr more)))))) gres (gensym "res__")] (clojure.core/concat (clojure.core/list (quote clojure.core/let)) (clojure.core/list (clojure.core/apply clojure.core/vector (clojure.core/concat (clojure.core/list gpred) (clojure.core/list pred) (clojure.core/list gexpr) (clojure.core/list expr)))) (clojure.core/list (emit gpred gexpr clauses))))) + +//====== +//(load "core_proxy") +//--- +(function __clojure_core_fn_4077(){ +return (clojure.core.load.apply(null,["core_proxy"]))}).apply(null,[]); + +//====== +//(load "core_print") +//--- +(function __clojure_core_fn_4080(){ +return (clojure.core.load.apply(null,["core_print"]))}).apply(null,[]); + +//====== +//(load "genclass") +//--- +(function __clojure_core_fn_4083(){ +return (clojure.core.load.apply(null,["genclass"]))}).apply(null,[]); + +//====== +//(in-ns (quote clojure.core)) +//--- +(function __user_fn_4086(){ +return (clojure.core.in_ns.apply(null,[clojure.core.symbol("clojure.core")]))}).apply(null,[]); + +//====== +//(import (quote (java.io Writer))) +//--- +(function __clojure_core_fn_4092(){ +return (clojure.core.import_.apply(null,[clojure.JS.lit_list([clojure.core.symbol("java.io"),clojure.core.symbol("Writer")])]))}).apply(null,[]); + +//====== +//(def *print-length* nil) +//--- +(function __clojure_core_fn_4095(){ +return (clojure.JS.def(clojure.core,"_STAR_print_length_STAR_",null))}).apply(null,[]); + +//====== +//(def *print-level* nil) +//--- +(function __clojure_core_fn_4098(){ +return (clojure.JS.def(clojure.core,"_STAR_print_level_STAR_",null))}).apply(null,[]); + +//====== +//(defn- print-sequential [begin print-one sep end sequence w] (binding [*print-level* (and (not *print-dup*) *print-level* (dec *print-level*))] (if (and *print-level* (neg? *print-level*)) (.write w "#") (do (.write w begin) (when-let [xs (seq sequence)] (if (and (not *print-dup*) *print-length*) (loop [[x & xs] xs print-length *print-length*] (if (zero? print-length) (.write w "...") (do (print-one x w) (when xs (.write w sep) (recur xs (dec print-length)))))) (loop [[x & xs] xs] (print-one x w) (when xs (.write w sep) (recur xs))))) (.write w end))))) +//--- +(function __clojure_core_fn_4101(){ +return (clojure.JS.def(clojure.core,"print_sequential",(function __clojure_core_fn_4101_print_sequential_4103(begin_1,print_one_2,sep_3,end_4,sequence_5,w_6){ +var and__960__auto___9,vec__4107_12,xs_18,xs_14,G__4106_11,G__4110_15,temp__3312__auto___9,print_length_15,x_19,and__960__auto___8,x_13,vec__4112_16,G__4106_16,xs_14,print_length_21,vec__4111_12,vec__4108_18,and__960__auto___11,and__960__auto___7,xs_10,G__4110_11,print_length_17,x_17,x_13,xs_20; +return (clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[clojure.core._var__STAR_print_level_STAR_,((and__960__auto___7=clojure.core.not.apply(null,[clojure.core._STAR_print_dup_STAR_])), +((and__960__auto___7)?(((and__960__auto___8=clojure.core._STAR_print_level_STAR_), +((and__960__auto___8)?(clojure.lang.Numbers.dec(clojure.core._STAR_print_level_STAR_)):(and__960__auto___8)))):(and__960__auto___7)))])), +(function __try(){try{var _rtn=(((((and__960__auto___9=clojure.core._STAR_print_level_STAR_), +((and__960__auto___9)?(clojure.lang.Numbers.isNeg(clojure.core._STAR_print_level_STAR_)):(and__960__auto___9))))?((w_6).write("#")):((w_6).write(begin_1), +((temp__3312__auto___9=clojure.core.seq.apply(null,[sequence_5])), +((temp__3312__auto___9)?(((xs_10=temp__3312__auto___9), +((((and__960__auto___11=clojure.core.not.apply(null,[clojure.core._STAR_print_dup_STAR_])), +((and__960__auto___11)?(clojure.core._STAR_print_length_STAR_):(and__960__auto___11))))?(((G__4106_11=xs_10), +(vec__4107_12=G__4106_11), +(x_13=clojure.core.nth.apply(null,[vec__4107_12,(0),null])), +(xs_14=clojure.core.nthrest.apply(null,[vec__4107_12,(1)])), +(print_length_15=clojure.core._STAR_print_length_STAR_), +((function __loop(){var _rtn,_cnt;(G__4106_16=G__4106_11), +(print_length_17=print_length_15);do{_cnt=0; +_rtn=((vec__4108_18=G__4106_16), +(x_19=clojure.core.nth.apply(null,[vec__4108_18,(0),null])), +(xs_20=clojure.core.nthrest.apply(null,[vec__4108_18,(1)])), +(print_length_21=print_length_17), +((clojure.lang.Numbers.isZero(print_length_21))?((w_6).write("...")):(print_one_2.apply(null,[x_19,w_6]), +((xs_20)?((w_6).write(sep_3), +(_cnt=1,_rtn=[xs_20,clojure.lang.Numbers.dec(print_length_21)],G__4106_16=_rtn[0],print_length_17=_rtn[1])):(null)))))}while(_cnt);return _rtn;})()))):(((G__4110_11=xs_10), +(vec__4111_12=G__4110_11), +(x_13=clojure.core.nth.apply(null,[vec__4111_12,(0),null])), +(xs_14=clojure.core.nthrest.apply(null,[vec__4111_12,(1)])), +((function __loop(){var _rtn,_cnt;(G__4110_15=G__4110_11);do{_cnt=0; +_rtn=((vec__4112_16=G__4110_15), +(x_17=clojure.core.nth.apply(null,[vec__4112_16,(0),null])), +(xs_18=clojure.core.nthrest.apply(null,[vec__4112_16,(1)])), +print_one_2.apply(null,[x_17,w_6]), +((xs_18)?((w_6).write(sep_3), +(_cnt=1,_rtn=[xs_18],G__4110_15=_rtn[0])):(null)))}while(_cnt);return _rtn;})())))))):(null))), +(w_6).write(end_4))))} +finally{clojure.lang.Var.popThreadBindings()}return _rtn})())})))}).apply(null,[]); + +//====== +//(defn- print-meta [o w] (when-let [m (meta o)] (when (and (pos? (count m)) (or *print-dup* (and *print-meta* *print-readably*))) (.write w "#^") (if (and (= (count m) 1) (:tag m)) (pr-on (:tag m) w) (pr-on m w)) (.write w " ")))) +//--- +(function __clojure_core_fn_4120(){ +return (clojure.JS.def(clojure.core,"print_meta",(function __clojure_core_fn_4120_print_meta_4122(o_1,w_2){ +var temp__3312__auto___3,m_4,and__960__auto___5,or__974__auto___6,and__960__auto___7,and__960__auto___5; +return (((temp__3312__auto___3=clojure.core.meta.apply(null,[o_1])), +((temp__3312__auto___3)?(((m_4=temp__3312__auto___3), +((((and__960__auto___5=clojure.lang.Numbers.isPos(clojure.core.count.apply(null,[m_4]))), +((and__960__auto___5)?(((or__974__auto___6=clojure.core._STAR_print_dup_STAR_), +((or__974__auto___6)?(or__974__auto___6):(((and__960__auto___7=clojure.core._STAR_print_meta_STAR_), +((and__960__auto___7)?(clojure.core._STAR_print_readably_STAR_):(and__960__auto___7))))))):(and__960__auto___5))))?((w_2).write("#^"), +((((and__960__auto___5=clojure.lang.Util.equal(clojure.core.count.apply(null,[m_4]),(1))), +((and__960__auto___5)?(clojure.core.keyword("","tag").apply(null,[m_4])):(and__960__auto___5))))?(clojure.core.pr_on.apply(null,[clojure.core.keyword("","tag").apply(null,[m_4]),w_2])):(clojure.core.pr_on.apply(null,[m_4,w_2]))), +(w_2).write(" ")):(null)))):(null))))})))}).apply(null,[]); + +//====== +//(defmethod print-method nil [o w] (.write w "nil")) +//--- +(function __clojure_core_fn_4131(){ +return ((clojure.core.print_method).addMethod(null,(function __clojure_core_fn_4131_fn_4133(o_1,w_2){ +return ((w_2).write("nil"))})))}).apply(null,[]); + +//====== +//(defmethod print-dup nil [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4137(){ +return ((clojure.core.print_dup).addMethod(null,(function __clojure_core_fn_4137_fn_4139(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).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 ")")) +//--- +(function __clojure_core_fn_4143(){ +return (clojure.JS.def(clojure.core,"print_ctor",(function __clojure_core_fn_4143_print_ctor_4145(o_1,print_args_2,w_3){ +return ((w_3).write("#=("), +(w_3).write(clojure.lang.RT.className(clojure.core.class_.apply(null,[o_1]))), +(w_3).write(". "), +print_args_2.apply(null,[o_1,w_3]), +(w_3).write(")"))})))}).apply(null,[]); + +//====== +//(defmethod print-method :default [o w] (.write w "#<") (.write w (RT/simpleClassName (class o))) (.write w " ") (.write w (str o)) (.write w ">")) +//--- +(function __clojure_core_fn_4149(){ +return ((clojure.core.print_method).addMethod(clojure.core.keyword("","default"),(function __clojure_core_fn_4149_fn_4151(o_1,w_2){ +return ((w_2).write("#<"), +(w_2).write(clojure.lang.RT.simpleClassName(clojure.core.class_.apply(null,[o_1]))), +(w_2).write(" "), +(w_2).write(clojure.core.str.apply(null,[o_1])), +(w_2).write(">"))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.Keyword [o w] (.write w (str o))) +//--- +(function __clojure_core_fn_4155(){ +return ((clojure.core.print_method).addMethod(clojure.lang.Keyword,(function __clojure_core_fn_4155_fn_4157(o_1,w_2){ +return ((w_2).write(clojure.core.str.apply(null,[o_1])))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.Keyword [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4161(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.Keyword,(function __clojure_core_fn_4161_fn_4163(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method Number [o w] (.write w (str o))) +//--- +(function __clojure_core_fn_4167(){ +return ((clojure.core.print_method).addMethod(java.lang.Number,(function __clojure_core_fn_4167_fn_4169(o_1,w_2){ +return ((w_2).write(clojure.core.str.apply(null,[o_1])))})))}).apply(null,[]); + +//====== +//(defmethod print-dup Number [o w] (print-ctor o (fn [o w] (print-dup (str o) w)) w)) +//--- +(function __clojure_core_fn_4173(){ +return ((clojure.core.print_dup).addMethod(java.lang.Number,(function __clojure_core_fn_4173_fn_4175(o_1,w_2){ +return (clojure.core.print_ctor.apply(null,[o_1,(function __clojure_core_fn_4173_fn_4175_fn_4177(o_1,w_2){ +return (clojure.core.print_dup.apply(null,[clojure.core.str.apply(null,[o_1]),w_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.AFn [o w] (print-ctor o (fn [o w]) w)) +//--- +(function __clojure_core_fn_4182(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.AFn,(function __clojure_core_fn_4182_fn_4184(o_1,w_2){ +return (clojure.core.print_ctor.apply(null,[o_1,(function __clojure_core_fn_4182_fn_4184_fn_4186(o_1,w_2){ +return (null)}),w_2]))})))}).apply(null,[]); + +//====== +//(prefer-method print-dup clojure.lang.IPersistentCollection clojure.lang.AFn) +//--- +(function __clojure_core_fn_4191(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,clojure.lang.IPersistentCollection,clojure.lang.AFn]))}).apply(null,[]); + +//====== +//(prefer-method print-dup java.util.Map clojure.lang.AFn) +//--- +(function __clojure_core_fn_4194(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,java.util.Map,clojure.lang.AFn]))}).apply(null,[]); + +//====== +//(prefer-method print-dup java.util.Collection clojure.lang.AFn) +//--- +(function __clojure_core_fn_4197(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,java.util.Collection,clojure.lang.AFn]))}).apply(null,[]); + +//====== +//(defmethod print-method Boolean [o w] (.write w (str o))) +//--- +(function __clojure_core_fn_4200(){ +return ((clojure.core.print_method).addMethod(java.lang.Boolean,(function __clojure_core_fn_4200_fn_4202(o_1,w_2){ +return ((w_2).write(clojure.core.str.apply(null,[o_1])))})))}).apply(null,[]); + +//====== +//(defmethod print-dup Boolean [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4206(){ +return ((clojure.core.print_dup).addMethod(java.lang.Boolean,(function __clojure_core_fn_4206_fn_4208(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defn print-simple [o w] (print-meta o w) (.write w (str o))) +//--- +(function __clojure_core_fn_4212(){ +return (clojure.JS.def(clojure.core,"print_simple",(function __clojure_core_fn_4212_print_simple_4214(o_1,w_2){ +return (clojure.core.print_meta.apply(null,[o_1,w_2]), +(w_2).write(clojure.core.str.apply(null,[o_1])))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.Symbol [o w] (print-simple o w)) +//--- +(function __clojure_core_fn_4218(){ +return ((clojure.core.print_method).addMethod(clojure.lang.Symbol,(function __clojure_core_fn_4218_fn_4220(o_1,w_2){ +return (clojure.core.print_simple.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.Symbol [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4224(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.Symbol,(function __clojure_core_fn_4224_fn_4226(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.Var [o w] (print-simple o w)) +//--- +(function __clojure_core_fn_4230(){ +return ((clojure.core.print_method).addMethod(clojure.lang.Var,(function __clojure_core_fn_4230_fn_4232(o_1,w_2){ +return (clojure.core.print_simple.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.Var [o w] (.write w (str "#=(var " (.name (.ns o)) "/" (.sym o) ")"))) +//--- +(function __clojure_core_fn_4236(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.Var,(function __clojure_core_fn_4236_fn_4238(o_1,w_2){ +return ((w_2).write(clojure.core.str.apply(null,["#=(var ",clojure.JS.getOrRun(clojure.JS.getOrRun(o_1,"ns"),"name"),"/",clojure.JS.getOrRun(o_1,"sym"),")"])))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.ISeq [o w] (print-meta o w) (print-sequential "(" pr-on " " ")" o w)) +//--- +(function __clojure_core_fn_4242(){ +return ((clojure.core.print_method).addMethod(clojure.lang.ISeq,(function __clojure_core_fn_4242_fn_4244(o_1,w_2){ +return (clojure.core.print_meta.apply(null,[o_1,w_2]), +clojure.core.print_sequential.apply(null,["(",clojure.core.pr_on," ",")",o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.ISeq [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4248(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.ISeq,(function __clojure_core_fn_4248_fn_4250(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.IPersistentList [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4254(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.IPersistentList,(function __clojure_core_fn_4254_fn_4256(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(prefer-method print-method clojure.lang.IPersistentList clojure.lang.ISeq) +//--- +(function __clojure_core_fn_4260(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_method,clojure.lang.IPersistentList,clojure.lang.ISeq]))}).apply(null,[]); + +//====== +//(prefer-method print-dup clojure.lang.IPersistentList clojure.lang.ISeq) +//--- +(function __clojure_core_fn_4263(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,clojure.lang.IPersistentList,clojure.lang.ISeq]))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.IPersistentList [o w] (print-meta o w) (print-sequential "(" print-method " " ")" o w)) +//--- +(function __clojure_core_fn_4266(){ +return ((clojure.core.print_method).addMethod(clojure.lang.IPersistentList,(function __clojure_core_fn_4266_fn_4268(o_1,w_2){ +return (clojure.core.print_meta.apply(null,[o_1,w_2]), +clojure.core.print_sequential.apply(null,["(",clojure.core.print_method," ",")",o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method java.util.Collection [o w] (print-ctor o (fn* [p1__4272 p2__4273] (print-sequential "[" print-method " " "]" p1__4272 p2__4273)) w)) +//--- +(function __clojure_core_fn_4274(){ +return ((clojure.core.print_method).addMethod(java.util.Collection,(function __clojure_core_fn_4274_fn_4276(o_1,w_2){ +return (clojure.core.print_ctor.apply(null,[o_1,(function __clojure_core_fn_4274_fn_4276_fn_4278(p1__4272_1,p2__4273_2){ +return (clojure.core.print_sequential.apply(null,["[",clojure.core.print_method," ","]",p1__4272_1,p2__4273_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(prefer-method print-method clojure.lang.IPersistentCollection java.util.Collection) +//--- +(function __clojure_core_fn_4283(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_method,clojure.lang.IPersistentCollection,java.util.Collection]))}).apply(null,[]); + +//====== +//(defmethod print-dup java.util.Collection [o w] (print-ctor o (fn* [p1__4286 p2__4287] (print-sequential "[" print-dup " " "]" p1__4286 p2__4287)) w)) +//--- +(function __clojure_core_fn_4288(){ +return ((clojure.core.print_dup).addMethod(java.util.Collection,(function __clojure_core_fn_4288_fn_4290(o_1,w_2){ +return (clojure.core.print_ctor.apply(null,[o_1,(function __clojure_core_fn_4288_fn_4290_fn_4292(p1__4286_1,p2__4287_2){ +return (clojure.core.print_sequential.apply(null,["[",clojure.core.print_dup," ","]",p1__4286_1,p2__4287_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.IPersistentCollection [o w] (print-meta o w) (.write w "#=(") (.write w (RT/className (class o))) (.write w "/create ") (print-sequential "[" print-dup " " "]" o w) (.write w ")")) +//--- +(function __clojure_core_fn_4297(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.IPersistentCollection,(function __clojure_core_fn_4297_fn_4299(o_1,w_2){ +return (clojure.core.print_meta.apply(null,[o_1,w_2]), +(w_2).write("#=("), +(w_2).write(clojure.lang.RT.className(clojure.core.class_.apply(null,[o_1]))), +(w_2).write("/create "), +clojure.core.print_sequential.apply(null,["[",clojure.core.print_dup," ","]",o_1,w_2]), +(w_2).write(")"))})))}).apply(null,[]); + +//====== +//(prefer-method print-dup clojure.lang.IPersistentCollection java.util.Collection) +//--- +(function __clojure_core_fn_4303(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,clojure.lang.IPersistentCollection,java.util.Collection]))}).apply(null,[]); + +//====== +//(def char-escape-string {\newline "\\n", \tab "\\t", \return "\\r", \" "\\\"", \\ "\\\\", \formfeed "\\f", \backspace "\\b"}) +//--- +(function __clojure_core_fn_4306(){ +return (clojure.JS.def(clojure.core,"char_escape_string",clojure.core.hash_map("\n","\\n","\t","\\t","\r","\\r","\"","\\\"","\\","\\\\","\f","\\f","\b","\\b")))}).apply(null,[]); + +//====== +//(defmethod print-method String [s w] (if (or *print-dup* *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_core_fn_4309(){ +return ((clojure.core.print_method).addMethod(java.lang.String,(function __clojure_core_fn_4309_fn_4311(s_1,w_2){ +var or__974__auto___3,n__2124__auto___3,n_4,c_5,e_6; +return (((((or__974__auto___3=clojure.core._STAR_print_dup_STAR_), +((or__974__auto___3)?(or__974__auto___3):(clojure.core._STAR_print_readably_STAR_))))?((w_2).append("\""), +((n__2124__auto___3=clojure.lang.RT.intCast(clojure.core.count.apply(null,[s_1]))), +((function __loop(){var _rtn,_cnt;(n_4=clojure.lang.RT.intCast((0)));do{_cnt=0; +_rtn=((clojure.lang.Numbers.lt(n_4,n__2124__auto___3))?(((c_5=(s_1).charAt(n_4)), +(e_6=clojure.core.char_escape_string.apply(null,[c_5])), +((e_6)?((w_2).write(e_6)):((w_2).append(c_5)))), +(_cnt=1,_rtn=[clojure.lang.Numbers.unchecked_inc(n_4)],n_4=_rtn[0])):(null))}while(_cnt);return _rtn;})())), +(w_2).append("\"")):((w_2).write(s_1))), +null)})))}).apply(null,[]); + +//====== +//(defmethod print-dup String [s w] (print-method s w)) +//--- +(function __clojure_core_fn_4317(){ +return ((clojure.core.print_dup).addMethod(java.lang.String,(function __clojure_core_fn_4317_fn_4319(s_1,w_2){ +return (clojure.core.print_method.apply(null,[s_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.IPersistentVector [v w] (print-meta v w) (print-sequential "[" pr-on " " "]" v w)) +//--- +(function __clojure_core_fn_4323(){ +return ((clojure.core.print_method).addMethod(clojure.lang.IPersistentVector,(function __clojure_core_fn_4323_fn_4325(v_1,w_2){ +return (clojure.core.print_meta.apply(null,[v_1,w_2]), +clojure.core.print_sequential.apply(null,["[",clojure.core.pr_on," ","]",v_1,w_2]))})))}).apply(null,[]); + +//====== +//(defn- print-map [m print-one w] (print-sequential "{" (fn [e w] (do (print-one (key e) w) (.append w \space) (print-one (val e) w))) ", " "}" (seq m) w)) +//--- +(function __clojure_core_fn_4329(){ +return (clojure.JS.def(clojure.core,"print_map",(function __clojure_core_fn_4329_print_map_4331(m_1,print_one_2,w_3){ +return (clojure.core.print_sequential.apply(null,["{",(function __clojure_core_fn_4329_print_map_4331_fn_4333(e_1,w_2){ +return (print_one_2.apply(null,[clojure.core.key.apply(null,[e_1]),w_2]), +(w_2).append(" "), +print_one_2.apply(null,[clojure.core.val.apply(null,[e_1]),w_2]))}),", ","}",clojure.core.seq.apply(null,[m_1]),w_3]))})))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.IPersistentMap [m w] (print-meta m w) (print-map m pr-on w)) +//--- +(function __clojure_core_fn_4338(){ +return ((clojure.core.print_method).addMethod(clojure.lang.IPersistentMap,(function __clojure_core_fn_4338_fn_4340(m_1,w_2){ +return (clojure.core.print_meta.apply(null,[m_1,w_2]), +clojure.core.print_map.apply(null,[m_1,clojure.core.pr_on,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method java.util.Map [m w] (print-ctor m (fn* [p1__4344 p2__4345] (print-map (seq p1__4344) print-method p2__4345)) w)) +//--- +(function __clojure_core_fn_4346(){ +return ((clojure.core.print_method).addMethod(java.util.Map,(function __clojure_core_fn_4346_fn_4348(m_1,w_2){ +return (clojure.core.print_ctor.apply(null,[m_1,(function __clojure_core_fn_4346_fn_4348_fn_4350(p1__4344_1,p2__4345_2){ +return (clojure.core.print_map.apply(null,[clojure.core.seq.apply(null,[p1__4344_1]),clojure.core.print_method,p2__4345_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(prefer-method print-method clojure.lang.IPersistentMap java.util.Map) +//--- +(function __clojure_core_fn_4355(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_method,clojure.lang.IPersistentMap,java.util.Map]))}).apply(null,[]); + +//====== +//(defmethod print-dup java.util.Map [m w] (print-ctor m (fn* [p1__4358 p2__4359] (print-map (seq p1__4358) print-dup p2__4359)) w)) +//--- +(function __clojure_core_fn_4360(){ +return ((clojure.core.print_dup).addMethod(java.util.Map,(function __clojure_core_fn_4360_fn_4362(m_1,w_2){ +return (clojure.core.print_ctor.apply(null,[m_1,(function __clojure_core_fn_4360_fn_4362_fn_4364(p1__4358_1,p2__4359_2){ +return (clojure.core.print_map.apply(null,[clojure.core.seq.apply(null,[p1__4358_1]),clojure.core.print_dup,p2__4359_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.IPersistentMap [m w] (print-meta m w) (.write w "#=(") (.write w (RT/className (class m))) (.write w "/create ") (print-map m print-dup w) (.write w ")")) +//--- +(function __clojure_core_fn_4369(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.IPersistentMap,(function __clojure_core_fn_4369_fn_4371(m_1,w_2){ +return (clojure.core.print_meta.apply(null,[m_1,w_2]), +(w_2).write("#=("), +(w_2).write(clojure.lang.RT.className(clojure.core.class_.apply(null,[m_1]))), +(w_2).write("/create "), +clojure.core.print_map.apply(null,[m_1,clojure.core.print_dup,w_2]), +(w_2).write(")"))})))}).apply(null,[]); + +//====== +//(prefer-method print-dup clojure.lang.IPersistentCollection java.util.Map) +//--- +(function __clojure_core_fn_4375(){ +return (clojure.core.prefer_method.apply(null,[clojure.core.print_dup,clojure.lang.IPersistentCollection,java.util.Map]))}).apply(null,[]); + +//====== +//(defmethod print-method clojure.lang.IPersistentSet [s w] (print-meta s w) (print-sequential "#{" pr-on " " "}" (seq s) w)) +//--- +(function __clojure_core_fn_4378(){ +return ((clojure.core.print_method).addMethod(clojure.lang.IPersistentSet,(function __clojure_core_fn_4378_fn_4380(s_1,w_2){ +return (clojure.core.print_meta.apply(null,[s_1,w_2]), +clojure.core.print_sequential.apply(null,["#{",clojure.core.pr_on," ","}",clojure.core.seq.apply(null,[s_1]),w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-method java.util.Set [s w] (print-ctor s (fn* [p1__4384 p2__4385] (print-sequential "#{" print-method " " "}" (seq p1__4384) p2__4385)) w)) +//--- +(function __clojure_core_fn_4386(){ +return ((clojure.core.print_method).addMethod(java.util.Set,(function __clojure_core_fn_4386_fn_4388(s_1,w_2){ +return (clojure.core.print_ctor.apply(null,[s_1,(function __clojure_core_fn_4386_fn_4388_fn_4390(p1__4384_1,p2__4385_2){ +return (clojure.core.print_sequential.apply(null,["#{",clojure.core.print_method," ","}",clojure.core.seq.apply(null,[p1__4384_1]),p2__4385_2]))}),w_2]))})))}).apply(null,[]); + +//====== +//(def char-name-string {\newline "newline", \tab "tab", \space "space", \backspace "backspace", \formfeed "formfeed", \return "return"}) +//--- +(function __clojure_core_fn_4395(){ +return (clojure.JS.def(clojure.core,"char_name_string",clojure.core.hash_map("\n","newline","\t","tab"," ","space","\b","backspace","\f","formfeed","\r","return")))}).apply(null,[]); + +//====== +//(defmethod print-method java.lang.Character [c w] (if (or *print-dup* *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_core_fn_4398(){ +return ((clojure.core.print_method).addMethod(java.lang.Character,(function __clojure_core_fn_4398_fn_4400(c_1,w_2){ +var or__974__auto___3,n_3; +return (((((or__974__auto___3=clojure.core._STAR_print_dup_STAR_), +((or__974__auto___3)?(or__974__auto___3):(clojure.core._STAR_print_readably_STAR_))))?((w_2).append("\\"), +((n_3=clojure.core.char_name_string.apply(null,[c_1])), +((n_3)?((w_2).write(n_3)):((w_2).append(c_1))))):((w_2).append(c_1))), +null)})))}).apply(null,[]); + +//====== +//(defmethod print-dup java.lang.Character [c w] (print-method c w)) +//--- +(function __clojure_core_fn_4405(){ +return ((clojure.core.print_dup).addMethod(java.lang.Character,(function __clojure_core_fn_4405_fn_4407(c_1,w_2){ +return (clojure.core.print_method.apply(null,[c_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup java.lang.Integer [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4411(){ +return ((clojure.core.print_dup).addMethod(java.lang.Integer,(function __clojure_core_fn_4411_fn_4413(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup java.lang.Double [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4417(){ +return ((clojure.core.print_dup).addMethod(java.lang.Double,(function __clojure_core_fn_4417_fn_4419(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.Ratio [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4423(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.Ratio,(function __clojure_core_fn_4423_fn_4425(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup java.math.BigDecimal [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4429(){ +return ((clojure.core.print_dup).addMethod(java.math.BigDecimal,(function __clojure_core_fn_4429_fn_4431(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.PersistentHashMap [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4435(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.PersistentHashMap,(function __clojure_core_fn_4435_fn_4437(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.PersistentHashSet [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4441(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.PersistentHashSet,(function __clojure_core_fn_4441_fn_4443(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.PersistentVector [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4447(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.PersistentVector,(function __clojure_core_fn_4447_fn_4449(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.LazilyPersistentVector [o w] (print-method o w)) +//--- +(function __clojure_core_fn_4453(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.LazilyPersistentVector,(function __clojure_core_fn_4453_fn_4455(o_1,w_2){ +return (clojure.core.print_method.apply(null,[o_1,w_2]))})))}).apply(null,[]); +// Skipping: (def primitives-classnames {Float/TYPE "Float/TYPE", Integer/TYPE "Integer/TYPE", Long/TYPE "Long/TYPE", Boolean/TYPE "Boolean/TYPE", Character/TYPE "Character/TYPE", Double/TYPE "Double/TYPE", Byte/TYPE "Byte/TYPE", Short/TYPE "Short/TYPE"}) +// Skipping: (defmethod print-method Class [c w] (.write w (RT/className c))) +// Skipping: (defmethod print-dup Class [c w] (cond (.isPrimitive c) (do (.write w "#=(identity ") (.write w (primitives-classnames c)) (.write w ")")) (.isArray c) (do (.write w "#=(java.lang.Class/forName \"") (.write w (RT/className c)) (.write w "\")")) :else (do (.write w "#=") (.write w (RT/className c))))) + +//====== +//(defmethod print-method java.math.BigDecimal [b w] (.write w (str b)) (.write w "M")) +//--- +(function __clojure_core_fn_4474(){ +return ((clojure.core.print_method).addMethod(java.math.BigDecimal,(function __clojure_core_fn_4474_fn_4476(b_1,w_2){ +return ((w_2).write(clojure.core.str.apply(null,[b_1])), +(w_2).write("M"))})))}).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_core_fn_4480(){ +return ((clojure.core.print_method).addMethod(java.util.regex.Pattern,(function __clojure_core_fn_4480_fn_4482(p_1,w_2){ +var G__4485_9,qmode_8,c_5,s_14,s_7,vec__4486_4,vec__4488_16,G__4485_3,r2_18,r_6,vec__4487_11,c_12,qmode_15,qmode_10,c2_17,r_13; +return ((w_2).write("#\""), +((G__4485_3=clojure.core.seq.apply(null,[(p_1).pattern()])), +(vec__4486_4=G__4485_3), +(c_5=clojure.core.nth.apply(null,[vec__4486_4,(0),null])), +(r_6=clojure.core.nthrest.apply(null,[vec__4486_4,(1)])), +(s_7=vec__4486_4), +(qmode_8=false), +((function __loop(){var _rtn,_cnt;(G__4485_9=G__4485_3), +(qmode_10=qmode_8);do{_cnt=0; +_rtn=((vec__4487_11=G__4485_9), +(c_12=clojure.core.nth.apply(null,[vec__4487_11,(0),null])), +(r_13=clojure.core.nthrest.apply(null,[vec__4487_11,(1)])), +(s_14=vec__4487_11), +(qmode_15=qmode_10), +((s_14)?(((clojure.lang.Util.equal(c_12,"\\"))?(((vec__4488_16=r_13), +(c2_17=clojure.core.nth.apply(null,[vec__4488_16,(0),null])), +(r2_18=clojure.core.nthrest.apply(null,[vec__4488_16,(1)])), +(w_2).append("\\"), +(w_2).append(c2_17), +((qmode_15)?((_cnt=1,_rtn=[r2_18,clojure.core.not_EQ_.apply(null,[c2_17,"E"])],G__4485_9=_rtn[0],qmode_10=_rtn[1])):((_cnt=1,_rtn=[r2_18,clojure.lang.Util.equal(c2_17,"Q")],G__4485_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__4485_9=_rtn[0],qmode_10=_rtn[1])):(((clojure.core.keyword("","else"))?((w_2).append(c_12), +(_cnt=1,_rtn=[r_13,qmode_15],G__4485_9=_rtn[0],qmode_10=_rtn[1])):(null))))))):(null)))}while(_cnt);return _rtn;})())), +(w_2).append("\""))})))}).apply(null,[]); + +//====== +//(defmethod print-dup java.util.regex.Pattern [p w] (print-method p w)) +//--- +(function __clojure_core_fn_4491(){ +return ((clojure.core.print_dup).addMethod(java.util.regex.Pattern,(function __clojure_core_fn_4491_fn_4493(p_1,w_2){ +return (clojure.core.print_method.apply(null,[p_1,w_2]))})))}).apply(null,[]); + +//====== +//(defmethod print-dup clojure.lang.Namespace [n w] (.write w "#=(find-ns ") (print-dup (.name n) w) (.write w ")")) +//--- +(function __clojure_core_fn_4497(){ +return ((clojure.core.print_dup).addMethod(clojure.lang.Namespace,(function __clojure_core_fn_4497_fn_4499(n_1,w_2){ +return ((w_2).write("#=(find-ns "), +clojure.core.print_dup.apply(null,[clojure.JS.getOrRun(n_1,"name"),w_2]), +(w_2).write(")"))})))}).apply(null,[]); + +//====== +//(def print-initialized true) +//--- +(function __clojure_core_fn_4503(){ +return (clojure.JS.def(clojure.core,"print_initialized",true))}).apply(null,[]); diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/blank.gif b/clojurescript/src/clojure/contrib/clojurescript/repl/blank.gif Binary files differnew file mode 100644 index 00000000..7dd151aa --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/blank.gif diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/clojure-logo-anim-03.gif b/clojurescript/src/clojure/contrib/clojurescript/repl/clojure-logo-anim-03.gif Binary files differnew file mode 100644 index 00000000..47ceca66 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/clojure-logo-anim-03.gif diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/dots.png b/clojurescript/src/clojure/contrib/clojurescript/repl/dots.png Binary files differnew file mode 100644 index 00000000..545dbbf7 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/dots.png diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/repl.cljs b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.cljs new file mode 100644 index 00000000..ce6eb450 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.cljs @@ -0,0 +1,91 @@ +(ns jsrepl) + +(def append-dom) + +(defn dom [o] + (if (coll? o) + (let [[tag attrs & body] o] + (if (keyword? tag) + (let [elem (.createElement document (name tag))] + (when (map? attrs) + (doseq [[k v] attrs] + (when v (.setAttribute elem (name k) v)))) + [(append-dom elem (if (map? attrs) body (cons attrs body)))]) + (mapcat dom o))) + (when o + [(.createTextNode document (str o))]))) + +(defn append-dom [parent v] + (doseq [i (dom v)] + (.appendChild parent i)) + parent) + +(def elems) +(def lastval) +(def *print-class* nil) + +(defn repl-print [text] + (let [log (:log elems)] + (doseq [line (.split text #"\n")] + (append-dom log + [:div {:class (str "cg " + (when *print-class* + (str " " *print-class*)))} + line])) + (set! (.scrollTop log) (.scrollHeight log)))) + +(defn postexpr [] + (append-dom (:log elems) + [:table + [:tbody + [:tr + [:td {:class "cg"} "user=> "] + [:td (-> :input elems .value (.replace #"\n$" ""))]]]]) + (set! (-> :scripts elems .innerHTML) "") + (set! (-> :input elems .value) "")) + +(defmacro print-with-class [c m] + `(binding [*print-class* ~c] + (println ~m))) + +(defn show-state [url] + (set! (-> :status elems .src) url)) + +(defn state [status msg] + (cond + (= status "incomplete") (show-state "dots.png") + (= status "done") (prn lastval) + (= status "error") (do + (postexpr) + (show-state "blank.gif") + (print-with-class "err" msg)) + (= status "compiled") (do + (postexpr) + (setTimeout #(show-state "blank.gif") 0)))) + +(defn err [e] + (print-with-class "err" e) + (set! *e e)) + +(set! *print-length* 103) + +(set! (.onload window) (fn [] + ; no refs yet, so just re-def + (set! elems (into {} (for [n '(log input status scripts)] + [(keyword n) (.getElementById document (str n))]))) + + (set! (.print window) repl-print) + + (set! (.onkeypress (:input elems)) + (fn [e] + (let [e (or e event)] + (when (== (.keyCode e) 13) + (set! (-> :status elems .src) "clojure-logo-anim-03.gif") + (append-dom (:scripts elems) + [:script {:src (str "http://clojurescript.n01se.net:8081/?" + (-> :input elems .value escape + (.replace #"\+" "%2b")))}]))))) + + (println "ClojureScript") + + (.focus (:input elems)))) diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/repl.html b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.html new file mode 100644 index 00000000..1a3a6285 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.html @@ -0,0 +1,60 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" + "http://www.w3.org/TR/html4/strict.dtd"> +<html> + <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /> + <head> + <title>ClojureScript REPL</title> + <style type="text/css"> + body { + font-family: Monaco,monospace; + font-size: 10pt; + } + .pad { + height: 20em; + } + #log { + height: 20em; + overflow: auto; + white-space: pre-wrap; + } + #log table { + border-collapse: collapse; + } + #log td { + vertical-align: top; + padding: 0; + } + .ns { + float: left; + } + .cg { + color: #00b; + } + .err { + color: #b00; + } + textarea#input { + padding: 0; + margin: 0; + border: none; + width: 90%; + height: 6em; + background: #f3f3f3; + } + </style> + <script type="text/javascript" src="../rt.js"></script> + <script type="text/javascript" src="../core.js"></script> + <script type="text/javascript" src="repl.js"></script> + </head> + <body> + <div id="log"> + <div class="pad"></div> + </div> + <div class="ns cg"> + user=> <br /> + <img id="status" src="blank.gif"> + </div> + <textarea id="input"></textarea> + <div id="scripts"></div> + </body> +</html> diff --git a/clojurescript/src/clojure/contrib/clojurescript/repl/repl.js b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.js new file mode 100644 index 00000000..a3c47aa3 --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/repl/repl.js @@ -0,0 +1,89 @@ +(function(){ +return (clojure.core.in_ns.apply(null,[clojure.core.symbol("jsrepl")]), +clojure.core.refer.apply(null,[clojure.core.symbol("clojure.core")]))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"append_dom",null))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"dom",(function(o_1){ +var sq__3769__auto___7,v_10,vec__546_8,elem_6,body_5,attrs_4,vec__545_2,k_9,tag_3; +return (((clojure.core.coll_QMARK_.apply(null,[o_1]))?(((vec__545_2=o_1), +(tag_3=clojure.core.nth.apply(null,[vec__545_2,(0),null])), +(attrs_4=clojure.core.nth.apply(null,[vec__545_2,(1),null])), +(body_5=clojure.core.nthrest.apply(null,[vec__545_2,(2)])), +((clojure.core.keyword_QMARK_.apply(null,[tag_3]))?(((elem_6=(clojure.JS.resolveVar("document",jsrepl)).createElement(clojure.core.name.apply(null,[tag_3]))), +((clojure.core.map_QMARK_.apply(null,[attrs_4]))?(((function(){var _rtn,_cnt;(sq__3769__auto___7=clojure.core.seq.apply(null,[attrs_4]));do{_cnt=0; +_rtn=((sq__3769__auto___7)?(((vec__546_8=clojure.core.first.apply(null,[sq__3769__auto___7])), +(k_9=clojure.core.nth.apply(null,[vec__546_8,(0),null])), +(v_10=clojure.core.nth.apply(null,[vec__546_8,(1),null])), +((true)?(((true)?(((v_10)?((elem_6).setAttribute(clojure.core.name.apply(null,[k_9]),v_10)):(null))):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__3769__auto___7])],sq__3769__auto___7=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})())):(null)), +clojure.JS.lit_vector([jsrepl.append_dom.apply(null,[elem_6,((clojure.core.map_QMARK_.apply(null,[attrs_4]))?(body_5):(clojure.core.cons.apply(null,[attrs_4,body_5])))])]))):(clojure.core.mapcat.apply(null,[jsrepl.dom,o_1]))))):(((o_1)?(clojure.JS.lit_vector([(clojure.JS.resolveVar("document",jsrepl)).createTextNode(clojure.core.str.apply(null,[o_1]))])):(null)))))})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"append_dom",(function(parent_1,v_2){ +var sq__3769__auto___3,i_4; +return (((function(){var _rtn,_cnt;(sq__3769__auto___3=clojure.core.seq.apply(null,[jsrepl.dom.apply(null,[v_2])]));do{_cnt=0; +_rtn=((sq__3769__auto___3)?(((i_4=clojure.core.first.apply(null,[sq__3769__auto___3])), +((true)?(((true)?((parent_1).appendChild(i_4)):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__3769__auto___3])],sq__3769__auto___3=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})()), +parent_1)})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"elems",null))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"lastval",null))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"_STAR_print_class_STAR_",null))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"repl_print",(function(text_1){ +var log_2,sq__3769__auto___3,line_4; +return (((log_2=clojure.core.keyword("","log").apply(null,[jsrepl.elems])), +((function(){var _rtn,_cnt;(sq__3769__auto___3=clojure.core.seq.apply(null,[(text_1).split((/\n/))]));do{_cnt=0; +_rtn=((sq__3769__auto___3)?(((line_4=clojure.core.first.apply(null,[sq__3769__auto___3])), +((true)?(((true)?(jsrepl.append_dom.apply(null,[log_2,clojure.JS.lit_vector([clojure.core.keyword("","div"),clojure.core.hash_map(clojure.core.keyword("","class"),clojure.core.str.apply(null,["cg ",((jsrepl._STAR_print_class_STAR_)?(clojure.core.str.apply(null,[" ",jsrepl._STAR_print_class_STAR_])):(null))])),line_4])])):(null)), +(_cnt=1,_rtn=[clojure.core.rest.apply(null,[sq__3769__auto___3])],sq__3769__auto___3=_rtn[0])):(null)))):(null))}while(_cnt);return _rtn;})()), +(log_2.scrollTop=clojure.JS.getOrRun(log_2,"scrollHeight"))))})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"postexpr",(function(){ +return (jsrepl.append_dom.apply(null,[clojure.core.keyword("","log").apply(null,[jsrepl.elems]),clojure.JS.lit_vector([clojure.core.keyword("","table"),clojure.JS.lit_vector([clojure.core.keyword("","tbody"),clojure.JS.lit_vector([clojure.core.keyword("","tr"),clojure.JS.lit_vector([clojure.core.keyword("","td"),clojure.core.hash_map(clojure.core.keyword("","class"),"cg"),"user=> "]),clojure.JS.lit_vector([clojure.core.keyword("","td"),(clojure.JS.getOrRun(jsrepl.elems.apply(null,[clojure.core.keyword("","input")]),"value")).replace((/\n$/),"")])])])])]), +(jsrepl.elems.apply(null,[clojure.core.keyword("","scripts")]).innerHTML=""), +(jsrepl.elems.apply(null,[clojure.core.keyword("","input")]).value=""))})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"show_state",(function(url_1){ +return ((jsrepl.elems.apply(null,[clojure.core.keyword("","status")]).src=url_1))})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"state",(function(status_1,msg_2){ +return (((clojure.lang.Util.equal(status_1,"incomplete"))?(jsrepl.show_state.apply(null,["dots.png"])):(((clojure.lang.Util.equal(status_1,"done"))?(clojure.core.prn.apply(null,[jsrepl.lastval])):(((clojure.lang.Util.equal(status_1,"error"))?(jsrepl.postexpr.apply(null,[]), +jsrepl.show_state.apply(null,["blank.gif"]), +clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[jsrepl._var__STAR_print_class_STAR_,"err"])), +(function(){try{var _rtn=(clojure.core.println.apply(null,[msg_2]))} +finally{clojure.lang.Var.popThreadBindings()}return _rtn})()):(((clojure.lang.Util.equal(status_1,"compiled"))?(jsrepl.postexpr.apply(null,[]), +clojure.JS.resolveVar("setTimeout",jsrepl).apply(null,[(function(){ +return (jsrepl.show_state.apply(null,["blank.gif"]))}),(0)])):(null)))))))))})))}).apply(null,[]); +(function(){ +return (clojure.JS.def(jsrepl,"err",(function(e_1){ +return (clojure.lang.Var.pushThreadBindings(clojure.core.hash_map.apply(null,[jsrepl._var__STAR_print_class_STAR_,"err"])), +(function(){ +return ((function(){try{var _rtn=(clojure.core.println.apply(null,[e_1]))} +finally{clojure.lang.Var.popThreadBindings()}return _rtn})())}).apply(null,[]), +clojure.core._var__STAR_e.set(e_1))})))}).apply(null,[]); +(function(){ +return (clojure.core._var__STAR_print_length_STAR_.set((103)))}).apply(null,[]); +(function(){ +return ((clojure.JS.resolveVar("window",jsrepl).onload=(function(){ +var iter__4265__auto___1; +return (jsrepl._var_elems.set(clojure.core.into.apply(null,[clojure.lang.PersistentArrayMap.EMPTY,((iter__4265__auto___1=(function(s__620_1){ +var _cnt,_rtn,n_2,iter__619_0=arguments.callee; +do{_cnt=0;_rtn=((clojure.core.seq.apply(null,[s__620_1]))?(((n_2=clojure.core.first.apply(null,[s__620_1])), +((true)?(((true)?((new clojure.lang.LazyCons((function(G__622_1){switch(arguments.length){ +case 0:return (clojure.JS.lit_vector([clojure.core.keyword.apply(null,[n_2]),(clojure.JS.resolveVar("document",jsrepl)).getElementById(clojure.core.str.apply(null,[n_2]))]))} +return (iter__619_0.apply(null,[clojure.core.rest.apply(null,[s__620_1])]))})))):((_cnt=1,_rtn=[clojure.core.rest.apply(null,[s__620_1])],s__620_1=_rtn[0])))):(null)))):(null)) +}while(_cnt);return _rtn;})), +iter__4265__auto___1.apply(null,[clojure.JS.lit_list([clojure.core.symbol("log"),clojure.core.symbol("input"),clojure.core.symbol("status"),clojure.core.symbol("scripts")])]))])), +(clojure.JS.resolveVar("window",jsrepl).print=jsrepl.repl_print), +(clojure.core.keyword("","input").apply(null,[jsrepl.elems]).onkeypress=(function(e_1){ +var or__3117__auto___2,e_2; +return (((e_2=((or__3117__auto___2=e_1), +((or__3117__auto___2)?(or__3117__auto___2):(clojure.JS.resolveVar("event",jsrepl))))), +((clojure.lang.Numbers.equiv(clojure.JS.getOrRun(e_2,"keyCode"),(13)))?((jsrepl.elems.apply(null,[clojure.core.keyword("","status")]).src="clojure-logo-anim-03.gif"), +jsrepl.append_dom.apply(null,[clojure.core.keyword("","scripts").apply(null,[jsrepl.elems]),clojure.JS.lit_vector([clojure.core.keyword("","script"),clojure.core.hash_map(clojure.core.keyword("","src"),clojure.core.str.apply(null,["http://localhost:8081/?",(clojure.JS.resolveVar("escape",jsrepl).apply(null,[clojure.JS.getOrRun(jsrepl.elems.apply(null,[clojure.core.keyword("","input")]),"value")])).replace((/\+/),"%2b")]))])])):(null))))})), +clojure.core.println.apply(null,["ClojureScript"]), +clojure.JS.getOrRun(clojure.core.keyword("","input").apply(null,[jsrepl.elems]),"focus"))})))}).apply(null,[]); diff --git a/clojurescript/src/clojure/contrib/clojurescript/rt.js b/clojurescript/src/clojure/contrib/clojurescript/rt.js new file mode 100644 index 00000000..480ee03b --- /dev/null +++ b/clojurescript/src/clojure/contrib/clojurescript/rt.js @@ -0,0 +1,2057 @@ +// Copyright (c) Chris Houser, Sep 2008 - Jan 2009. All rights reserved. +// The use and distribution terms for this software are covered by the +// Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) +// which can be found in the file epl-v10.html at the root of this distribution. +// By using this software in any fashion, you are agreeing to be bound by +// the terms of this license. +// You must not remove this notice, or any other, from this software. + +// Runtime support for code generated by tojs.clj + +clojure = { + JS: { + global: this, + merge: function( t, s ) { + for( var i in s ) { + t[ i ] = s[ i ]; + } + return t; + }, + Class: { + classname: "clojure.JS.Class", + hashCode: function() { return clojure.lang.Util.hash( this.classname ); }, + isAssignableFrom: function(base) { return base.classset[this.classname];}, + getSuperclass: function() { return this.extend || null; }, + getInterfaces: function() { return this.implement || null; } + } + }, + lang: { + Namespace: function( n, m ) { + this.name = n; // FIXME: this pollutes the namespace + clojure.JS.merge( this, m || {} ); + } + } +}; + +clojure.JS.Class.constructor = clojure.JS.Class; +clojure.JS.Class.classset = { Class: true }; + +if( ! clojure.JS.global["java"] ) { + java = { lang: { String: {}, Character: {}, Class: {}, Number: {}, + Boolean: {} }, + math: { BigDecimal: {} }, + util: { Collection: {}, Map: {}, Set: {}, regex: { Pattern: {} } } }; +} + +clojure = { + JS: { + merge: clojure.JS.merge, + global: clojure.JS.global, + Class: clojure.JS.Class, + objectType: typeof {}, + functionType: typeof function(){}, + stringType: typeof "", + numberType: typeof 0, + variadic: function( arity, f ) { + f.arity = arity; + f.isVariadic = true; + return f; + }, + resolveVar: function( sym, ctxns ) { + return ctxns[ sym ] || clojure[ sym ] || clojure.JS.global[ sym ]; + }, + def: function( ns, name, init ) { + var v = new clojure.lang.Var( ns, name ); + ns["_var_" + name] = v; + v.push( init ); + return v; + }, + variadic_sentinel: {}, + rest_args: function( varflag, args, i ) { + if( varflag === clojure.JS.variadic_sentinel ) + return args[ args.length - 1 ]; + return new clojure.lang.ArraySeq( null, args, i ); + }, + invoke: function( obj, methodname, args ) { + return obj[ methodname ].apply( obj, args ); + }, + getOrRun: function( obj, prop ) { + var val = obj[ prop ]; + if( typeof val === clojure.JS.functionType + || (typeof val === clojure.JS.objectType && "apply" in val) ) + { + return val.apply( obj, [] ); + } + return val; + }, + lit_list: function( a ) { + if( a.length > 0 ) + return new clojure.lang.ArraySeq( null, a, 0 ); + return clojure.lang.PersistentList.EMPTY; + }, + lit_vector: function( a ) { + return clojure.lang.LazilyPersistentVector.createOwning( a ); + }, + implement: function( cls, name, extend, implement ) { + clojure.JS.merge( cls, clojure.JS.Class ); + cls.classname = name; + cls.extend = extend; + cls.implement = implement; + cls.classset = {}; + cls.classset[ name ] = true; + if( implement ) { + for( var i = 0; i < implement.length; ++i ) { + if( ! implement[ i ] ) + throw "Can't implement null: " + name; + clojure.JS.merge( cls.classset, implement[ i ].classset ); + } + } + }, + definterface: function( pkg, name, implement ) { + var cls = pkg[ name ] = {}; + clojure.JS.implement( cls, name, null, implement ); + return cls; + }, + defclass: function( pkg, name, opts ) { + var cls = pkg[ name ] = opts.init || function() {}; + clojure.JS.implement( cls, name, opts.extend, opts.implement ); + if( 'extend' in opts ) { + cls.prototype = new opts.extend; + cls.prototype.constructor = cls; + clojure.JS.merge( cls.classset, opts.extend.classset ); + } + if( opts.statics ) { clojure.JS.merge( cls, opts.statics ); } + if( opts.methods ) { clojure.JS.merge( cls.prototype, opts.methods ); } + return cls; + }, + instanceq: function( c, o ){ + if( o === null ) + return false; + if( typeof o === clojure.JS.functionType && ! ("constructor" in o) ) + return false; // a Java class? + if( o.constructor === c ) + return true; + if( ! o.constructor.classset ) + return false; // builtin class that doesn't match? + return o.constructor.classset[ c.classname ]; + }, + relayPrintMethod: function( jsclass, javaclass, ctor ) { + var m = clojure.core.print_method; + m.addMethod( jsclass, function(o,w) { + return (clojure.core.get( m.methodTable, javaclass ) + .apply(null, [ctor ? ctor(o) : o, w])); + }); + }, + bitcount: function(n){ + var rtn = 0; + for( ; n; n >>= 1) { + rtn += n & 1; + } + return rtn; + }, + ObjSeq: { + create: function( obj ) { + var i, pairs = []; + for( i in obj ) { + pairs.push( [i, obj[i]] ); + } + return clojure.lang.ArraySeq.create( pairs ); + } + } + }, + lang: { + Namespace: clojure.lang.Namespace, + Numbers: { + isZero: function(x) { return x === 0; }, + isPos: function(x) { return x > 0; }, + isNeg: function(x) { return x < 0; }, + minus: function(x,y) { return y === undefined ? -x : x - y; }, + inc: function(x) { return x + 1; }, + dec: function(x) { return x - 1; }, + add: function(x,y) { return x + y; }, + multiply: function(x,y) { return x * y; }, + divide: function(x,y) { return x / y; }, + quotient: function(x,y) { return parseInt(x / y); }, + remainder: function(x,y) { return x % y; }, + equiv: function(x,y) { return x == y; }, + lt: function(x,y) { return x < y; }, + lte: function(x,y) { return x <= y; }, + gt: function(x,y) { return x > y; }, + gte: function(x,y) { return x >= y; }, + compare: function(x,y) { return (x<y) ? -1 :( (y<x) ? 1 : 0 ); }, + unchecked_inc: function(x) { return x + 1; } + }, + Util: { + hash: function(o){ + switch( o ) { + case null: return 0; + case Array: return 0x7A837A71; + case Boolean: return 0x7A837A72; + case Function: return 0x7A837A73; + case Number: return 0x7A837A74; + case Object: return 0x7A837A75; + case RegExp: return 0x7A837A76; + case String: return 0x7A837A77; + case java.lang.Boolean: + case java.lang.Character: + case java.lang.Class: + case java.lang.Double: + case java.lang.Integer: + case java.lang.Number: + case java.lang.String: + case java.math.BigDecimal: + case java.util.Collection: + case java.util.Map: + case java.util.Set: + case java.util.regex.Pattern: + return 0x7A830001; + } + var i = 0, ret = o.length; + switch( typeof o ) { + case clojure.JS.stringType: + // lousy hand-made string hash + for( ; i < o.length; ++i ) { + ret ^= o.charCodeAt(i) << ((i % 4) * 8); + } + return ret; + case clojure.JS.numberType: + return o & 0xffffffff; + } + switch( o.constructor ) { + case Array: + for( ; i < o.length; ++i ) { + ret = clojure.lang.Util.hashCombine( + ret, clojure.lang.Util.hash( o[i] ) ); + } + return ret; + } + if( o.hashCode ) + return o.hashCode(); + return 0x11111111; + }, + hashCombine: function(seed, hash){ + return seed ^ (hash + 0x9e3779b9 + (seed << 6) + (seed >> 2)); + }, + equal: function(x,y) { return x == y; }, + isInteger: function(x) { return typeof x == clojure.JS.numberType; } + }, + RT: { + EMPTY_ARRAY: [], + conj: function( coll, x ) { + if( coll === null ) + return new clojure.lang.PersistentList( null, x ); + return coll.cons( x ); + }, + seqToArray: function(s) { + var i = 0, ret = new Array( clojure.count( s ) ); + for( ; s !== null; ++i, s = s.rest() ) + ret[ i ] = s.first(); + return ret; + }, + intCast: function(i) { + return parseInt(i); + }, + makeStringBuilder: function(s) { + return new clojure.JS.StringBuilder( s===undefined ? "" : s ); + }, + className: function(c) { + if( "classname" in c ) + return c.classname; + if( "name" in c ) + return c.name; + var s = "" + c, + m = /^\[JavaClass (.*)]$/.exec(s); + if( m ) + return m[1]; + return s; + }, + simpleClassName: function(c) { + // FIXME: should generate simple name + return clojure.lang.RT.className(c); + } + } + } +}; + +clojure.core = new clojure.lang.Namespace("clojure.core",{ + in_ns: function(s) { + var i, nsparts = s.getName().split('.'), + base = clojure.JS.global; + for( i = 0; i < nsparts.length; ++i ) { + if( ! base[nsparts[i]] ) { + base[nsparts[i]] = new clojure.lang.Namespace(nsparts[i]); + } + base = base[nsparts[i]]; + } + }, + refer: function(s) {}, + load: function(s) {}, + seq: function(coll){ + if( coll === null ) return null; + else if( coll.seq ) return coll.seq(); + //else if( coll.constructor === String ) + // return clojure.lang.StringSeq.create(coll); + else if( typeof coll.length == clojure.JS.numberType ) + return clojure.lang.ArraySeq.create(coll); + else if( typeof coll === clojure.JS.objectType ) + return clojure.JS.ObjSeq.create(coll); + throw ("Don't know how to create ISeq from: " + + (typeof coll) + " " + coll.constructor.name); + }, + apply: function( f ) { + var i, newargs = [], s, eagercount, + oldargs = arguments, arglen = oldargs.length; + if( f.isVariadic ) { + // lazy + eagercount = Math.min( f.arity, arglen - 2 ); + for( i = 0; i < eagercount; ++i ) { + newargs.push( oldargs[ i + 1 ] ); + } + if( eagercount == f.arity ) { + if( arglen - eagercount < 3 ) { + newargs.push( clojure.core.seq( oldargs[ arglen - 1 ] ) ); + } + else { + newargs.push( clojure.core.concat( + new clojure.lang.ArraySeq( + null, oldargs, eagercount + 1, arglen - 1 ), + oldargs[ arglen - 1 ] ) ); + } + } + else { + s = clojure.core.seq( oldargs[ arglen - 1 ] ); + for( ; s && newargs.length < f.arity; s = s.rest() ) { + newargs.push( s.first() ); + } + if( s ) + newargs.push( s ); + } + return f.apply( clojure.JS.variadic_sentinel, newargs ); + } + else { + // non-lazy + for( i = 1; i < arglen - 1; ++i ) { + newargs.push( oldargs[ i ] ); + } + for( s = oldargs[ arglen - 1]; s; s = s.rest()) { + newargs.push( s.first() ); + } + return f.apply( null, newargs ); + } + }, + first: function(x) { + if( x === null ) return null; + if( x.first ) return x.first(); + var seq = clojure.core.seq( x ); + if( seq === null ) return null; + return seq.first(); + }, + rest: function(x) { + if( x === null ) return null; + if( x.rest ) return x.rest(); + var seq = clojure.core.seq( x ); + if( seq === null ) return null; + return seq.rest(); + }, + second: function(x) { return clojure.first(clojure.rest(x)); }, + cons: function( x, coll ) { + var y = clojure.core.seq( coll ); + if( y === null ) + return new clojure.lang.PersistentList( null, x ); + return y.cons( x ); + }, + instance_QMARK_: function( c, o ) { + return clojure.JS.instanceq( c, o ); + }, + class_QMARK_: function(o) { return clojure.JS.instanceq(clojure.JS.Class,o);}, + number_QMARK_: function(o) { return clojure.JS.instanceq( Number, o ); }, + string_QMARK_: function(o) { return clojure.JS.instanceq( String, o ); }, + integer_QMARK_: function(o) { return parseInt( o ) === o; }, + find: function(coll, key) { + if( coll == null ) + return null; + else if( coll.containsKey ) { + if( coll.containsKey( key ) ) + return new clojure.lang.MapEntry( key, coll.get( key ) ); + return null; + } + return coll.entryAt( key ); + }, + get: function(coll, key, notFound ) { + var usenull = notFound === undefined; + if( coll === null ) + return usenull ? null : notFound; + if( coll.valAt ) + return coll.valAt( key, notFound ); + if( coll.containsKey ) + return (usenull || coll.containsKey( key )) ? coll.get( key ) : notFound; + if( coll.contains ) + return (usenull || coll.contains( key )) ? coll.get( key ) : notFound; + return (usenull || key in coll) ? coll[ key ] : notFound; + }, + nth: function(coll, n, notFound) { + var usenull = (notFound === undefined), seq, i; + if( coll === null ) + return usenull ? null : notFound; + if( coll.nth ) + return usenull || n < coll.count() ? coll.nth(n) : notFound; + if( coll.get ) + return usenull || n < coll.size() ? coll.get(n) : notFound; + if( coll.seq ) { + for( seq = coll.seq(), i = 0; i <= n && seq; seq = seq.rest() ) { + if( i == n ) + return seq.first(); + } + if( usenull ) + throw "IndexOutOfBoundsException"; + return notFound; + } + return usenull || n < coll.length ? coll[n] : notFound; + }, + contains_QMARK_: function(coll, key) { + if( coll === null ) + return false; + if( coll.containsKey ) + return coll.containsKey( key ) ? true : false; + if( coll.contains ) + return coll.contains( key ) ? true : false; + return key in coll; + }, + hash_map: function() { + return clojure.lang.PersistentHashMap.create( arguments ); + }, + hash_set: function() { + return clojure.lang.PersistentHashSet.create( arguments ); + }, + to_array: function(coll){ + if( coll === null ) + return clojure.lang.RT.EMPTY_ARRAY; + if( coll.toArray ) + return coll.toArray(); + if( typeof coll === clojure.JS.stringType ) { + var i = 0, rtn = new Array( coll.length ); + for( ; i < coll.length; ++i ) { + rtn[i] = coll[i]; + } + return rtn; + } + if( coll.constructor === Array ) { + return coll.slice(0); + } + throw "Unable to convert: " + coll.constructor.classname + " to Array"; + }, + keyword: function(a,b) { + if( b === undefined ) + return clojure.lang.Keyword.intern( null, a ); + return clojure.lang.Keyword.intern( a, b ); + }, + symbol: function(a,b) { + if( b === undefined ) + return clojure.lang.Symbol.intern( null, a ); + return clojure.lang.Symbol.intern( a, b ); + }, + assoc: function( coll, key, val ) { + if( coll === null ) + return new clojure.lang.PersistentArrayMap([key, val]); + return coll.assoc( key, val ); + }, + count: function(x) { + if( x === null ) return 0; + if( x.count ) return x.count(); + if( x.length != undefined ) return x.length; + throw ("count not supported on: " + (typeof x) + " " + x.constructor); + }, + class_: function(o) { + if( o === null || o === undefined ) + return null; + if( typeof o === clojure.JS.functionType && ! ("constructor" in o) ) + return java.lang.Class; + return o.constructor || typeof o; + }, + import_: function() { + // do nothing + }, + identical_QMARK_: function( a, b ) { + return a === b; + }, + keys: function(coll) { + return clojure.lang.APersistentMap.KeySeq.create(clojure.core.seq(coll)); + }, + vals: function(coll) { + return clojure.lang.APersistentMap.ValSeq.create(clojure.core.seq(coll)); + } +}); + +clojure.JS.definterface( clojure.JS, "Collection" ); + +clojure.JS.defclass( clojure.JS, "StringBuilder", { + init: function( x ) { this.a = [ x ]; }, + methods: { + append: function( x ) { this.a.push( x ); return this; }, + toString: function() { return this.a.join(''); } + } +}); + +clojure.JS.defclass( clojure.JS, "String", { + init: function(s) { + this.s = s; + this.length = s.length; + }, + methods: { + charAt: function(x) { return this.s.charAt(x); }, + toString: function() { return this.s; } + } +}); + +clojure.JS.definterface( clojure.lang, "IObj" ); +clojure.JS.definterface( clojure.lang, "IMeta" ); + +clojure.JS.defclass( clojure.lang, "Obj", { + implement: [ clojure.lang.IObj ], + init: function(_meta) { this._meta = _meta; }, + methods: { + meta: function() { return this._meta; } + } +}); + +clojure.JS.definterface( clojure.lang, "IReduce" ); + +clojure.JS.definterface( clojure.lang, "IPersistentCollection" ); + +clojure.JS.definterface( clojure.lang, "ISeq", + [clojure.lang.IPersistentCollection] ); + +clojure.JS.definterface( clojure.lang, "IndexedSeq", + [clojure.lang.ISeq] ); + +clojure.JS.defclass( clojure.lang, "ASeq", { + implement: [clojure.lang.ISeq], + methods: { + equals: function( obj ) { + var s = this.seq(), ms = obj.seq(); + for( ; s !== null; s = s.rest(), ms = ms.rest() ) { + if( ms === null || !clojure.lang.Util.equal( s.first(), ms.first() )) + return false; + } + if( ms !== null ) + return false; + return true; + }, + hashCode: function() { throw "not yet implemented"; }, + count: function() { + var i = 1, s = this.rest(); + for( ; s; s = s.rest() ) + i += 1; + return i; + }, + seq: function(){ return this; }, + cons: function(o){ return new clojure.lang.Cons( null, o, this ); }, + toArray: function(){ return clojure.lang.RT.seqToArray( this.seq() ); }, + containsAll: function(c){ throw "not yet implemented"; }, + size: function(){ return this.count(); }, + isEmpty: function(){ return this.count() == 0; }, + contains: function(c){ throw "not yet implemented"; } + } +}); + +clojure.JS.defclass( clojure.lang, "Cons", { + extend: clojure.lang.ASeq, + init: function( _meta, _first, _rest ) { + this._meta = _meta; + this._first = _first; + this._rest = _rest; + }, + methods: { + first: function(){ return this._first; }, + rest: function(){ return this._rest; }, + count: function(){ return 1 + clojure.count( this._rest ); }, + seq: function(){ return this; }, + withMeta: function(_meta){ + return new clojure.lang.Cons( _meta, this._first, this._rest ); + } + } +}); + +clojure.JS.defclass( clojure.lang, "ArraySeq", { + extend: clojure.lang.ASeq, + implement: [clojure.lang.IndexedSeq, clojure.lang.IReduce], + init: function( _meta, a, i, len ) { + this._meta = _meta; + this.a = a; + this.i = i; + this.len = (len === undefined) ? a.length : len; + }, + statics: { + create: function( a ) { + if( a && a.length ) + return new clojure.lang.ArraySeq( null, a, 0 ); + return null; + } + }, + methods: { + first: function() { return this.a[this.i]; }, + rest: function() { + if( this.i + 1 < this.len ) + return new clojure.lang.ArraySeq( + this._meta, this.a, this.i + 1, this.len); + return null; + }, + count: function() { return this.len - this.i; }, + index: function() { return this.i; }, + withMeta: function( _meta ) { + return new clojure.lang.ArraySeq( _meta, this.array, this.i, this.len ); + }, + reduce: function( fn, start ) { + var ret = (start===undefined) ? this.a[this.i] : fn(start,this.a[this.i]), + x = this.i + 1; + for( ; x < this.len; ++x ) { + ret = fn( ret, this.a[x] ); + } + return ret; + }, + seq: function() { return this; } + } +}); + + +clojure.JS.defclass( clojure.lang, "LazyCons", { + extend: clojure.lang.ASeq, + init: function(f,_first,_rest) { + this.f = f; + this._first = _first === undefined ? clojure.lang.LazyCons.sentinel :_first; + this._rest = _rest === undefined ? clojure.lang.LazyCons.sentinel :_rest; + }, + statics: { + sentinel: {} + }, + methods: { + first: function() { + if( this._first === clojure.lang.LazyCons.sentinel ) + this._first = this.f(); + return this._first; + }, + rest: function() { + if( this._rest === clojure.lang.LazyCons.sentinel ) { + if( this._first === clojure.lang.LazyCons.sentinel ) { + this.first(); + } + this._rest = clojure.core.seq( this.f(null) ); + this.f = null; + } + return this._rest; + }, + withMeta: function(_meta) { + if( _meta == this.meta() ) + return this; + //force before copying + this.rest(); + return new clojure.lang.LazyCons( _meta, this._first, this._rest ); + }, + seq: function() { return this; } + } +}); + + +clojure.JS.defclass( clojure.lang, "Var", { + init: function( ns, name ) { + this.ns = ns; + this.name = name; + this.stack = []; + }, + statics: { + stack: [], + pushThreadBindings: function( m ) { + var vars=[], bs = m.seq(), e; + for( ; bs; bs = bs.rest()) { + e = bs.first(); + vars.push( e.key() ); + e.key().push( e.val() ); + } + clojure.lang.Var.stack.push( vars ); + }, + popThreadBindings: function() { + var i = 0, vars = clojure.lang.Var.stack.pop(); + for( ; i < vars.length; ++i ) { + vars[i].pop(); + } + } + }, + methods: { + push: function( val ) { + this.stack.push( val ); + this.ns[ this.name ] = val; + }, + pop: function() { + this.stack.pop(); + this.ns[ this.name ] = this.stack[ this.stack.length - 1 ]; + }, + set: function( val ) { + this.stack.pop(); + this.push( val ); + }, + get: function() { + return this.ns[ this.name ]; + }, + 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 ); + } + } +}); + +clojure.JS.definterface( clojure.lang, "IFn" ); + +clojure.JS.defclass( clojure.lang, "AFn", { + extend: clojure.lang.Obj, + implement: [clojure.lang.IFn], + methods: { + apply: function( obj, args ){ + return this.invoke.apply( this, args ); + } + } +}); + +clojure.JS.definterface( clojure.lang, "IPersistentStack", + [clojure.lang.IPersistentCollection] ); + +clojure.JS.definterface( clojure.lang, "Sequential" ); + +clojure.JS.definterface( clojure.lang, "Reversible" ); + +clojure.JS.definterface( clojure.lang, "Named" ); + +clojure.JS.defclass( clojure.lang, "Keyword", { + extend: clojure.lang.AFn, + implement: [clojure.lang.Named], + init: function( ns, name ) { + this._ns = ns; + this._name = name; + }, + statics: { + table: {}, + intern: function( ns, name ) { + var key = (ns || "") + "/" + name, + obj = clojure.lang.Keyword.table[ key ]; + if( obj ) + return obj; + return clojure.lang.Keyword.table[ key ] = + new clojure.lang.Keyword( ns, name ); + } + }, + methods: { + toString: function() { + return ":" + (this.ns ? this.ns+"/" : "") + this._name; + }, + compareTo: function(o) { + if( this == o ) + return 0; + if( this._ns === null && o._ns !== null ) + return -1; + if( this._ns !== null ) { + if( o._ns === null ) + return 1; + var nsc = clojure.JS.compare(this._ns, o._ns); + if( nsc !== 0 ) + return nsc; + } + return clojure.JS.compare(this._name, o._name); + }, + getNamespace: function() { return this._ns; }, + getName: function() { return this._name; }, + hashCode: function() { + return clojure.lang.Util.hash( this._ns + "/" + this._name ); + }, + invoke: function(coll, notFound) { return clojure.core.get( coll,this,notFound);} + } +}); + +clojure.JS.defclass( clojure.lang, "Ratio", {} ); + +clojure.JS.defclass( clojure.lang, "Symbol", { + extend: clojure.lang.AFn, + implement: [clojure.lang.Named], + init: function( ns, name ) { + this._ns = ns; + this._name = name; + }, + statics: { + table: {}, + intern: function( ns, name ) { + var key = (ns || "") + "/" + name, + obj = clojure.lang.Symbol.table[ key ]; + if( obj ) + return obj; + return clojure.lang.Symbol.table[ key ] = + new clojure.lang.Symbol( ns, name ); + } + }, + methods: { + toString: function() { + return (this.ns ? this.ns+"/" : "") + this._name; + }, + compareTo: function(o) { + if( this == o ) + return 0; + if( this._ns === null && o._ns !== null ) + return -1; + if( this._ns !== null ) { + if( o._ns === null ) + return 1; + var nsc = clojure.JS.compare(this._ns, o._ns); + if( nsc !== 0 ) + return nsc; + } + return clojure.JS.compare(this._name, o._name); + }, + getNamespace: function() { return this._ns; }, + getName: function() { return this._name; }, + hashCode: function() { + return clojure.lang.Util.hash( this._ns + "/" + this._name ); + }, + invoke: function(coll, notFound) { + return clojure.core.get( coll,this,notFound); + } + } +}); + + +clojure.JS.definterface( clojure.lang, "IPersistentList", + [clojure.lang.Sequential, clojure.lang.IPersistentStack] ); + +clojure.JS.defclass( clojure.lang, "EmptyList", { + extend: clojure.lang.Obj, + implement: [clojure.lang.IPersistentList, clojure.JS.Collection], + init: function( _meta ) { this._meta = _meta; }, + methods: { + cons: function(o) { + return new clojure.lang.PersistentList( this.meta(), o ); + }, + empty: function() { return this; }, + withMeta: function(m) { + if( m != this.meta() ) + return new clojure.lang.EmptyList( m ); + return this; + }, + peek: function() { return null; }, + pop: function() { throw "Can't pop empty list"; }, + count: function() { return 0; }, + seq: function() { return null; }, + size: function() { return 0; }, + isEmpty: function() { return true; }, + contains: function() { return false; }, + toArray: function() { return clojure.lang.RT.EMPTY_ARRAY; }, + containsAll: function( coll ) { return coll.isEmpty(); } + } +}); + +clojure.JS.definterface( clojure.lang, "IMapEntry" ); + +clojure.JS.definterface( clojure.lang, "Associative", + [ clojure.lang.IPersistentCollection ] ); + +clojure.JS.definterface( clojure.lang, "IPersistentVector", + [ clojure.lang.Associative, clojure.lang.Sequential, + clojure.lang.IPersistentStack, clojure.lang.Reversible ]); + +clojure.JS.defclass( clojure.lang, "AMapEntry", { + implement: [ clojure.lang.IMapEntry, clojure.lang.IPersistentVector ], + methods: { + empty: function(){ return null; }, + equals: function(o){ + return clojure.lang.APersistentVector.doEquals(this,o); + }, + hashCode: function(){ throw "not implemented yet"; }, + toString: function(){ + return this.key() + " " + this.val(); + var sw = new clojure.JS.StringWriter(); + clojure.lang.RT.print( this, sw ); + return sw.toString(); + }, + length: function(){ return 2; }, + nth: function(i){ + switch(i){ + case 0: return this.key(); + case 1: return this.val(); + default: throw "Index out of bounds"; + } + }, + asVector: function(){ + return clojure.lang.LazilyPersistentVector.createOwning( + this.key(), this.val() ); + }, + assocN: function(i,v){ return this.asVector().assocN(i,v); }, + count: function(){ return 2; }, + seq: function(){ return this.asVector().seq(); }, + cons: function(o){ return this.asVector().cons(o); }, + containsKey: function(k){ return this.asVector().containsKey(k); }, + entryAt: function(k){ return this.asVector().entryAt(k); }, + assoc: function(k,v){ return this.asVector().assoc(k,v); }, + valAt: function(k,notFound){ return this.asVector().valAt(k,notFound); }, + peek: function(){ return this.val(); }, + pop: function(){ + return clojure.lang.LazilyPersistentVector.createOwning( this.key() ); + }, + rseq: function(){ return this.asVector().rseq(); } + } +}); + +clojure.JS.defclass( clojure.lang, "MapEntry", { + extend: clojure.lang.AMapEntry, + init: function(k,v){ + this._key = k; + this._val = v; + }, + methods: { + key: function(){ return this._key; }, + val: function(){ return this._val; }, + getKey: function(){ return this._key; }, + getValue: function(){ return this._val; } + } +}); + +clojure.JS.defclass( clojure.lang, "PersistentList", { + extend: clojure.lang.ASeq, + implement: [clojure.lang.IPersistentList, clojure.lang.IReduce], + init: function( _meta, _first, _rest, _count ) { + this._meta = _meta || null; + this._first = _first; + this._rest = _rest || null; + this._count = _count || 1; + }, + statics: { + creator: clojure.JS.variadic(0,function(){ + var args = clojure.JS.rest_args(this,arguments,0), + ret, i; + if( clojure.JS.instanceq( clojure.lang.ArraySeq, args ) ) { + ret = clojure.lang.PersistentList.EMPTY; + for( i = args.a.length - 1; i >= 0; --i ) { + ret = ret.cons( args.a[ i ] ); + } + return ret; + } + throw "Not yet implemented: clojure.lang.PersistentList.creator with non-ArraySeq"; + }), + EMPTY: new clojure.lang.EmptyList(null) + }, + methods: { + first: function(){ return this._first; }, + rest: function(){ + if( this._count == 1 ) + return null; + return this._rest; + }, + peek: function(){ return this.first; }, + pop: function(){ + if( this._rest === null ) + return this.empty(); + return this._rest; + }, + count: function(){ return this._count; }, + cons: function(o){ + return new clojure.lang.PersistentList( + this._meta, o, this, this._count + 1 ); + }, + empty: function(){ + return clojure.lang.PersistentList.EMPTY.withMeta( this._meta ); + }, + withMeta: function( _meta ){ + if( _meta != this._meta ) + return new clojure.lang.PersistentList( + this._meta, this._first, this._rest, this._count ); + return this; + }, + reduce: function( f, start ){ + var ret = (start === undefined) ? this.first() : f( start, this.first() ), + s = this.rest(); + for( ; s !== null; s = s.rest() ) + ret = f( ret, s.first() ); + return ret; + } + } +}); + +clojure.JS.defclass( clojure.lang, "APersistentVector", { + extend: clojure.lang.AFn, + implement: [clojure.lang.IPersistentVector], + init: function( _meta ) { this._meta = _meta; }, + methods: { + meta: function() { return this._meta; }, + peek: function() { + if( this.count() > 0 ) + return this.nth( this.count() - 1 ); + return null; + }, + seq: function() { + if( this.count() > 0 ) + return new clojure.lang.APersistentVector.Seq( null, this, 0 ); + return null; + }, + rseq: function() { + if( this.count() > 0 ) + return new clojure.lang.APersistentVector.RSeq( null, this, this.count() - 1); + return null; + }, + equals: function() { throw "not implemented yet"; }, + hashCode: function() { throw "not implemented yet"; }, + get: function(i) { return this.nth(i); }, + indexOf: function( o ){ + var i = 0, len = this.count(); + for( ; i < len; ++i ) + if( clojure.lang.Util.equal( this.nth( i ), o ) ) + return i; + return -1; + }, + lastIndexOf: function( o ){ + for( var i = this.count() - 1; i >= 0; --i ) + if( clojure.lang.Util.equal( this.nth( i ), o ) ) + return i; + return -1; + }, + subList: function( fromi, toi ) { + return clojure.lang.RT.subvec( this, fromi, toi ); + }, + invoke: function( i ) { + if( clojure.lang.Util.isInteger(i) ) + return this.nth( parseInt( i ) ); + throw "Key must be integer"; + }, + peek: function() { + if( this.count() > 0 ) + return this.nth( this.count() - 1 ); + return null + }, + constainsKey: function(k){ + if( ! clojure.lang.Util.isInteger( k ) ) + return false; + var i = parseInt(k); + return i >= 0 && i < this.count(); + }, + entryAt: function(k){ + if( clojure.lang.Util.isInteger( k ) ) { + var i = parseInt(k); + if( i >= 0 && i < this.count() ) + return new clojure.lang.MapEntry( k, this.nth(i) ); + } + return null; + }, + assoc: function(k,v){ + if( clojure.lang.Util.isInteger( k ) ) { + var i = parseInt(k); + return this.assocN(i,v); + } + throw "Key must be integer"; + }, + valAt: function(k, notFound){ + if( clojure.lang.Util.isInteger( k ) ) { + var i = parseInt(k); + if( i >= 0 && i < this.count() ) + return this.nth(i); + } + if( notFound === undefined ) + return null; + return notFound; + }, + toArray: function(){ return clojure.lang.RT.seqToArray( this.seq() ); }, + containsAll: function(){ throw "not implemented yet"; }, + size: function(){ return this.count(); }, + isEmpty: function(){ return this.count() === 0; }, + contains: function(o){ + for( var s = this.seq(); s !== null; s = s.rest() ) { + if( clojure.lang.Util.equal( s.first(), o ) ) + return true; + } + return false; + }, + length: function(){ return this.count(); }, + compareTo: function(v){ + var i, c, len = this.count(); + if( len < v.count() ) + return -1; + else if( len > v.count() ) + return 1; + for( i = 0; i < len; ++i ) { + c = this.nth(i).compareTo( v.nth(i) ); + if( c != 0 ) + return c; + } + return 0; + } + } +}); + +clojure.JS.defclass( clojure.lang.APersistentVector, "Seq", { + extend: clojure.lang.ASeq, + implement: [clojure.lang.IndexedSeq, clojure.lang.IReduce], + init: function( _meta, v, i){ + this._meta = _meta; + this.v = v; + this.i = i; + }, + methods: { + seq: function(){ return this; }, + first: function(){ return this.v.nth(this.i); }, + rest: function(){ + if( this.i + 1 < this.v.count() ) + return new clojure.lang.APersistentVector.Seq( + this._meta, this.v, this.i + 1 ); + return null; + }, + index: function(){ return this.i; }, + count: function(){ return this.v.count() - this.i; }, + withMeta: function(_meta){ + return new clojure.lang.APersistentVector.Seq( _meta, this.v, this.i ); + }, + reduce: function( fn, start ) { + var ret = (start === undefined) ? + this.v.nth(this.i) : fn(start,this.v.nth(this.i)), + x = this.i + 1; + for( ; x < this.count(); ++x ) { + ret = fn( ret, this.v.nth(x) ); + } + return ret; + } + } +}); + +clojure.JS.defclass( clojure.lang.APersistentVector, "RSeq", { + init: function( _meta, v, i){ + this._meta = _meta; + this.v = v; + this.i = i; + }, + methods: { + seq: function(){ return this; }, + first: function(){ return this.v.nth(this.i); }, + rest: function(){ + if( this.i > 0 ) + return new clojure.lang.APersistentVector.RSeq( this._meta, this.v, this.i - 1 ); + return null; + }, + index: function(){ return this.i; }, + count: function(){ return this.i + 1; }, + withMeta: function(_meta){ + return new clojure.lang.APersistentVector.RSeq( _meta, this.v, this.i ); + } + } +}); + +clojure.JS.defclass( clojure.lang, "LazilyPersistentVector", { + extend: clojure.lang.APersistentVector, + init: function( _meta, ary, v ) { + this._meta = _meta; + this.ary = ary; + this._v = v; + }, + statics: { + createOwning: function(ary) { + if(ary.length === 0) + return clojure.lang.PersistentVector.EMPTY; + return new clojure.lang.LazilyPersistentVector( null, ary, null ); + }, + create: function(coll) { + return clojure.lang.LazilyPersistentVector.createOwning(coll.toArray()); + } + }, + methods: { + toArray: function() { return this.ary; }, + nth: function(i) { return this.ary[i]; }, + assocN: function(i,val) { return this.v().assoc(i,val); }, + count: function() { return this.ary.length; }, + cons: function(o) { return this.v().cons(o); }, + empty: function() { return clojure.lang.PersistentVector.EMPTY.withMeta(this._meta); }, + pop: function() { return this.v().pop(); }, + v: function() { + if( this._v === null ) + this._v = clojure.lang.PersistentVector.create(this.ary); + return this._v; + }, + withMeta: function(meta) { + if( meta != this._meta ) + return new clojure.lang.LazilyPersistentVector( meta, this.ary, this.v ); + return this; + } + } +}); + +clojure.JS.defclass( clojure.lang, "PersistentVector", { + extend: clojure.lang.APersistentVector, + init: function( _meta, cnt, shift, root, tail ) { + clojure.lang.APersistentVector.call( this, _meta ); + this.cnt = cnt; + this.shift = shift; + this.root = root; + this.tail = tail; + }, + statics: { + create: function( items ) { + var i = 0, ret = clojure.lang.PersistentVector.EMPTY; + for( ; i < items.length; ++i ) { + ret = ret.cons( items[ i ] ); + } + return ret; + } + }, + methods: { + tailoff: function() { return this.cnt - this.tail.length; }, + nth: function( i ) { + if( i >= 0 && i < this.cnt ) { + if( i >= this.tailoff() ) { + return this.tail[ i & 0x01f ]; + } + var arr = this.root, + level = this.shift; + for( ; level > 0; level -= 5 ) { + arr = arr[ (i >>> level) & 0x01f ]; + } + return arr[ i & 0x01f ]; + } + throw "IndexOutOfBoundsException"; + }, + assocN: function( i, val ) { + if( i >= 0 && i < this.cnt ) { + if( i >= this.tailoff() ) { + var newTail = this.tail.slice( 0 ); + newTail[ i & 0x01f ] = val; + return new clojure.lang.PersistentVector( + this.meta(), this.cnt, this.shift, this.root, newTail ); + } + return new clojure.lang.PersistentVector( + this.meta(), this.cnt, this.shift, + this.doAssoc( this.shift, this.root, i, val), this.tail ); + } + if( i == this.cnt ) { + return this.cons( val ); + } + throw "IndexOutOfBoundsException"; + }, + doAssoc: function( level, arr, i, val ) { + var subidx, ret = arr.slice( 0 ); + if( level == 0 ) { + ret[ i & 0x01f ] = val; + } + else { + subidx = (i >>> level) & 0x01f; + ret[ subidx ] = this.doAssoc( level - 5, arr[ subidx ], i, val ); + } + return ret; + }, + count: function() { return this.cnt; }, + withMeta: function( _meta ) { + return new clojure.lang.PersistentVector( + _meta, this.cnt, this.shift, this.root, this.tail ); + }, + cons: function( val ) { + var newTail, expansion, newroot, newshift; + if( this.tail.length < 32 ) { + newTail = this.tail.concat( [val] ); + return new clojure.lang.PersistentVector( + this.meta(), this.cnt + 1, this.shift, this.root, newTail ); + } + expansion = [null]; + newroot = this.pushTail( this.shift-5, this.root, this.tail, expansion); + newshift = this.shift; + if( expansion[0] != null ) { + newroot = [newroot, expansion[0]]; + newshift += 5; + } + return new clojure.lang.PersistentVector( + this.meta(), this.cnt+1, newshift, newroot, [val] ); + }, + empty: function() { + return clojure.lang.PersistentVector.EMPTY.withMeta( this.meta() ); + }, + pushTail: function( level, arr, tailNode, expansion) + { + var ret, newchild; + if( level == 0 ) { + newchild = tailNode; + } + else { + newchild = this.pushTail( + level - 5, arr[arr.length - 1], tailNode, expansion); + if( expansion[0] == null ) { + ret = arr.slice( 0 ); + ret[ arr.length - 1 ] = newchild; + return ret; + } + else { + newchild = expansion[0]; + } + } + //expansion + if( arr.length == 32 ) { + expansion[0] = [newchild]; + return arr; + } + expansion[0] = null; + return arr.concat([newchild]); + }, + pop: function() { + if( this.cnt == 0 ) { + throw "IllegalStateException: Can't pop empty vector"; + } + if( this.cnt == 1 ) { + return clojure.lang.PersistentVector.EMPTY.withMeta( this.meta() ); + } + var newTail, ptail, newroot, newshift; + if( this.tail.length > 1 ) { + newTail = this.tail.slice( 0, this.tail.length - 1 ); + return new clojure.lang.PersistentVector( + this.meta(), this.cnt - 1, this.shift, this.root, newTail ); + } + ptail = [null]; + newroot = this.popTail( this.shift - 5, this.root, ptail ); + newshift = this.shift; + if( newroot == null ) { + newroot = clojure.lang.RT.EMPTY_ARRAY; + } + if( this.shift > 5 && newroot.length == 1 ) { + newroot = newroot[0]; + newshift -= 5; + } + return new clojure.lang.PersistentVector( + this.meta(), this.cnt - 1, newshift, newroot, ptail[0] ); + }, + popTail: function( shift, arr, ptail ) { + if( shift > 0 ) { + var newchild = this.popTail( shift - 5, arr[ arr.length - 1 ], ptail ), + ret; + if( newchild != null ) { + ret = arr.slice( 0 ); + ret[ arr.length - 1 ] = newchild; + return ret; + } + } + if( shift == 0 ) { + ptail[0] = arr[ arr.length - 1 ]; + } + //contraction + if( arr.length == 1 ) { + return null; + } + return arr.slice( 0, arr.length - 1 ); + } + } +}); + +clojure.lang.PersistentVector.EMPTY = + new clojure.lang.PersistentVector( + {}, 0, 5, clojure.lang.RT.EMPTY_ARRAY, clojure.lang.RT.EMPTY_ARRAY ); + +clojure.JS.definterface( clojure.lang, "IPersistentMap", + [clojure.lang.Associative]); + +clojure.JS.defclass( clojure.lang, "APersistentMap", { + extend: clojure.lang.AFn, + implement: [clojure.lang.IPersistentMap, clojure.JS.Collection], + init: function(_meta) { + this._meta = _meta; + this._hash = -1; + }, + methods: { + cons: function(o){ + if( clojure.JS.instanceq( clojure.lang.IPersistentVector, o ) ) { + if( o.count() != 2 ) + throw "Vector arg to map conj must be a pair"; + return this.assoc( o.nth(0), o.nth(1) ); + } + var e, ret = this, es = clojure.core.seq( o ); + for( ; es; es = es.rest() ) { + e = es.first(); + ret = ret.assoc( e.getKey(), e.getValue() ); + } + return ret; + }, + equals: function(m){ + if( ! clojure.JS.instanceq( clojure.lang.IPersistentMap, m ) ) + return false; + if( m.count() != this.count() || m.hashCode() != this.hashCode() ) + return false; + var e, me, s = this.seq(); + for( ; s; s = s.rest() ) { + e = s.first(); + me = m.entryAt( e.getKey() ); + if( me === null + || ! clojure.lang.Util.equal( e.getValue(), me.getValue() )) + { + return false; + } + } + return true; + }, + hashCode: function(){ + if( this._hash == -1 ) { + var e, hash = this.count(), + s = this.seq(); + for( ; s; s = s.rest() ) { + e = s.first(); + hash ^= clojure.lang.Util.hashCombine( + clojure.lang.Util.hash( e.getKey() ), + clojure.lang.Util.hash( e.getValue() ) ); + } + this._hash = hash; + } + return _hash; + }, + containsAll: function(){ throw "not implemented yet"; }, + invoke: function(k,notFound){ return this.valAt(k,notFound); }, + toArray: function(){ return clojure.lang.RT.seqToArray( this.seq() ); }, + size: function(){ return this.count(); }, + isEmpty: function(){ return this.count() === 0; }, + contains: function(e){ + if( clojure.JS.instanceq( clojure.lang.MapEntry, e ) ) { + var v = this.entryAt( e.getKey() ); + return (v!==null && clojure.lang.Util.equal(v.getValue(),e.getValue())); + } + return false; + } + } +}); + +clojure.JS.defclass( clojure.lang.APersistentMap, "KeySeq", { + extend: clojure.lang.ASeq, + init: function(_meta, _seq) { + this._meta = _meta; + this._seq = _seq; + }, + statics: { + create: function(seq){ + if(seq === null) + return null; + return new clojure.lang.APersistentMap.KeySeq(null,seq); + } + }, + methods: { + first: function(){ return this._seq.first().getKey(); }, + rest: function(){ + return clojure.lang.APersistentMap.KeySeq.create( this._seq.rest() ); + }, + withMeta: function(_meta){ + return new clojure.lang.APersistentMap.KeySeq( _meta, this._seq ); + } + } +}); + +clojure.JS.defclass( clojure.lang.APersistentMap, "ValSeq", { + extend: clojure.lang.ASeq, + init: function(_meta, _seq) { + this._meta = _meta; + this._seq = _seq; + }, + statics: { + create: function(seq){ + if(seq === null) + return null; + return new clojure.lang.APersistentMap.ValSeq(seq); + } + }, + methods: { + first: function(){ return this._seq.first().getValue(); }, + rest: function(){ + return clojure.lang.APersistentMap.ValSeq.create( this._seq.rest() ); + }, + withMeta: function(_meta){ + return new clojure.lang.APersistentMap.ValSeq( _meta, this._seq ); + } + } +}); + +clojure.JS.defclass( clojure.lang, "PersistentHashMap", { + extend: clojure.lang.APersistentMap, + init: function(_meta, _count, _root){ + this._meta = _meta; + this._count = _count; + this._root = _root; + }, + statics: { + create: function(init){ + var ret = clojure.lang.PersistentHashMap.EMPTY, + s = clojure.core.seq( init ); + for( ; s; s=s.rest().rest() ){ + if( s.rest() === null ) + throw "No value supplied for key: " + s.first(); + ret = ret.assoc( s.first(), clojure.core.second( s ) ); + } + return ret; + }, + mask: function(hash, shift){ return (hash >>> shift) & 0x01f; } + }, + methods:{ + containsKey: function(key){ return this.entryAt(key) !== null; }, + entryAt: function(k){ return this._root.find(clojure.lang.Util.hash(k),k);}, + assoc: function(k,v){ + var addedLeaf=[null], + newroot = this._root.assoc( + 0, clojure.lang.Util.hash(k), k, v, addedLeaf ); + if( newroot == this._root ) + return this; + return new clojure.lang.PersistentHashMap( + this._meta, this._count + (addedLeaf[0] === null ? 0 : 1), newroot ); + }, + valAt: function(k, notFound){ + var e = this.entryAt(k); + if( e !== null ) + return e.val(); + if( notFound === undefined ) + return null; + return notFound; + }, + assocEx: function(k,v){ + if(this.containsKey(k)) + throw "Key already present"; + return this.assoc(k,v); + }, + without: function(k){ + var newroot = this._root.without( clojure.lang.Util.hash(k), k ); + if( newroot == this._root ) + return this; + if( newroot == null ) + return this.empty(); + return new clojure.lang.PersistentHashMap( + this._meta, this._count-1, newroot ); + }, + count: function(){ return this._count; }, + seq: function(){ return this._root.nodeSeq(); }, + empty: function(){ + return clojure.lang.PersistentHashMap.EMPTY.withMeta( this._meta ); + }, + withMeta: function(_meta){ + return new clojure.lang.PersistentHashMap( _meta, this._count,this._root); + } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap, "EmptyNode", { + methods: { + assoc: function(shift, hash, key, val, addedLeaf){ + var ret = new clojure.lang.PersistentHashMap.LeafNode( hash, key, val ); + addedLeaf[0] = ret; + return ret; + }, + without: function(h,k){ return this; }, + find: function(h,k){ return null; }, + nodeSeq: function(){ return null;}, + getHash: function(){ return 0;} + } +}); + +clojure.lang.PersistentHashMap.EMPTY = new clojure.lang.PersistentHashMap( + null, 0, new clojure.lang.PersistentHashMap.EmptyNode() ); + +clojure.JS.defclass( clojure.lang.PersistentHashMap, "FullNode", { + init: function(nodes, shift){ + this._nodes = nodes; + this._shift = shift; + this._hash = nodes[0].getHash(); + }, + statics: { + bitpos: function(hash, shift) { + return 1 << clojure.lang.PersistentHashMap.mask( hash, shift ); + } + }, + methods: { + assoc: function( levelShift, hash, key, val, addedLeaf ) { + var newnodes, + PHM = clojure.lang.PersistentHashMap, + idx = PHM.mask( hash, this._shift ), + n = this._nodes[idx].assoc( this._shift+5, hash, key, val, addedLeaf); + if( n == this._nodes[idx] ) + return this; + else { + newnodes = nodes.slice(); + newnodes[idx] = n; + return new PHM.FullNode( newnodes, this._shift ); + } + }, + without: function(hash, key){ + var newnodes, + PHM = clojure.lang.PersistentHashMap, + idx = PHM.mask( hash, this._shift ), + n = this._nodes[idx].without( hash, key ); + if( n != this._nodes[idx] ) { + newnodes = nodes.slice(); + if( n == null ) { + nodes.splice( idx, 1 ); + return new PHM.BitmapIndexedNode( + ~PHM.FullNode.bitpos(hash,this._shift), newnodes, this._shift ); + } + newnodes[ idx ] = n; + return new PHM.FullNode( newnodes, this._shift ); + } + return this; + }, + find: function(hash, key) { + return (nodes[clojure.lang.PersistentHashMap.mask( hash, this._shift )] + .find( hash, key )); + }, + nodeSeq: function(){ + return clojure.lang.PersistentHashMap.FullNode.Seq.create( this, 0 ); + }, + getHash: function(){ return this._hash; } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap.FullNode, "Seq", { + extend: clojure.lang.ASeq, + init: function( _meta, s, i, node ) { + this._meta = _meta; + this.s = s; + this.i = i; + this.node = node; + }, + statics: { + create: function(node, i){ + if( i >= node.nodes.length ) + return null; + return new clojure.lang.PersistentHashMap.FullNode.Seq( + null, node.nodes[i].nodeSeq(), i, node ); + } + }, + methods: { + first: function(){ return this.s.first(); }, + rest: function(){ + var Seq = clojure.lang.PersistentHashMap.FullNode.Seq, + nexts = this.s.rest(); + if( nexts ) + return new Seq( null, nexts, this.i, this.node ); + return Seq.create( node,this.i+1); + }, + withMeta: function(_meta){ + return new clojure.lang.PersistentHashMap.FullNode.Seq( + _meta, this.s, this.i, this.node ); + } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap, "BitmapIndexedNode", { + init: function(bitmap, nodes, shift) { + this.bitmap = bitmap; + this.nodes = nodes; + this.shift = shift; + this._hash = nodes[0].getHash(); + }, + statics: { + bitpos: function(hash, shift) { + return 1 << clojure.lang.PersistentHashMap.mask( hash, shift ); + }, + createA: function(bitmap, nodes, shift){ + var PHM = clojure.lang.PersistentHashMap; + if(bitmap == -1) + return new PHM.FullNode( nodes, shift ); + return new PHM.BitmapIndexedNode( bitmap, nodes, shift ); + }, + createB: function(shift, branch, hash, key, val, addedLeaf){ + var PHM = clojure.lang.PersistentHashMap; + return (new PHM.BitmapIndexedNode( + PHM.BitmapIndexedNode.bitpos(branch.getHash(), shift), + [branch], + shift)).assoc( shift, hash, key, val, addedLeaf ); + } + }, + methods: { + index: function(bit) { return clojure.JS.bitcount(this.bitmap & (bit-1) );}, + assoc: function(levelShift, hash, key, val, addedLeaf){ + var newnodes, n, + BIN = clojure.lang.PersistentHashMap.BitmapIndexedNode, + bit = BIN.bitpos( hash, this.shift ), + idx = this.index( bit ); + if((this.bitmap & bit) != 0) { + n = this.nodes[idx].assoc( this.shift+5, hash, key, val, addedLeaf); + if( n == this.nodes[idx] ) + return this; + else { + newnodes = this.nodes.slice(); + newnodes[idx] = n; + return new BIN( this.bitmap, newnodes, this.shift ); + } + } + else { + addedLeaf[0]= new clojure.lang.PersistentHashMap.LeafNode(hash,key,val); + newnodes = this.nodes.slice(); + newnodes.splice( idx, 0, addedLeaf[0] ); + return BIN.createA( this.bitmap | bit, newnodes, this.shift ); + } + }, + without: function( hash, key ) { + var BIN = clojure.lang.PersistentHashMap.BitmapIndexedNode, + bit = BIN.bitpos( hash, this.shift ), + idx, n, newnodes; + if((this.bitmap & bit) !== 0) { + idx = this.index( bit ); + n = this.nodes[ idx ].without( hash, key ); + if( n != this.nodes[ idx ] ) { + if( n === null ) { + if( this.bitmap == bit ) + return null; + newnodes = this.nodes.slice(); + newnodes.splice( idx, 1 ); + return new BIN( this.bitmap & ~bit, newnodes, this.shift ); + } + newnodes = this.nodes.slice(); + newnodes[ idx ] = n; + return new BIN( this.bitmap, newnodes, this.shift ); + } + } + return this; + }, + find: function( hash, key ) { + var BIN = clojure.lang.PersistentHashMap.BitmapIndexedNode, + bit = BIN.bitpos( hash, this.shift ); + if((this.bitmap & bit) !== 0) + return this.nodes[ this.index(bit) ].find( hash, key ); + return null; + }, + getHash: function(){ return this._hash; }, + nodeSeq: function(){ + return clojure.lang.PersistentHashMap.BitmapIndexedNode.Seq.create( + this, 0 ); + } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap.BitmapIndexedNode, "Seq", { + extend: clojure.lang.ASeq, + init: function( _meta, s, i, node ) { + this._meta = _meta; + this.s = s; + this.i = i; + this.node = node; + }, + statics: { + create: function(node, i){ + if( i >= node.nodes.length ) + return null; + return new clojure.lang.PersistentHashMap.BitmapIndexedNode.Seq( + null, node.nodes[i].nodeSeq(), i, node ); + } + }, + methods: { + first: function(){ return this.s.first(); }, + rest: function(){ + var Seq = clojure.lang.PersistentHashMap.BitmapIndexedNode.Seq, + nexts = this.s.rest(); + if( nexts ) + return new Seq( null, nexts, this.i, this.node ); + return Seq.create( this.node, this.i+1 ); + }, + withMeta: function(_meta){ + return new clojure.lang.PersistentHashMap.BitmapIndexedNode.Seq( + _meta, this.s, this.i, this.node ); + } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap, "LeafNode", { + extend: clojure.lang.AMapEntry, + init: function( hash, key, val ) { + this.hash = hash; + this._key = key; + this._val = val; + }, + methods: { + assoc: function(shift, hash, key, val, addedLeaf) { + var newLeaf, PHM = clojure.lang.PersistentHashMap; + if( hash == this.hash ) { + if( clojure.lang.Util.equal( key, this._key ) ) { + if( val == this._val ) + return this; + return new PHM.LeafNode( hash, key, val ); + } + newLeaf = new PHM.LeafNode( hash, key, val ); + addedLeaf[0] = newLeaf; + return new PHM.HashCollisionNode( hash, [this, newLeaf] ); + } + return PHM.BitmapIndexedNode.createB( + shift, this, hash, key, val, addedLeaf ); + }, + without: function(hash, key){ + if(hash == this.hash && clojure.lang.Util.equal( key, this._key )) + return null; + return this; + }, + find: function(hash, key){ + if(hash == this.hash && clojure.lang.Util.equal( key, this._key )) + return this; + return null; + }, + nodeSeq: function(){ return clojure.core.cons( this, null ); }, + getHash: function(){ return this.hash; }, + key: function(){ return this._key; }, + val: function(){ return this._val; }, + getKey: function(){ return this._key; }, + getValue: function(){ return this._val; } + } +}); + +clojure.JS.defclass( clojure.lang.PersistentHashMap, "HashCollisionNode", { + init: function(hash, leaves){ + this.hash = hash; + this.leaves = leaves; + }, + methods: { + assoc: function(shift, hash, key, val, addedLeaf) { + var idx, newLeaves, PHM = clojure.lang.PersistentHashMap; + if( hash == this.hash ) { + idx = this.findIndex( hash, key ); + if( idx != -1 ) { + if( this.leaves[idx].val == val ) + return this; + newLeaves = this.leaves.slice(); + newLeaves[idx] = new PHM.LeafNode( hash, key, val ); + return new PHM.HashCollisionNode( hash, newLeaves ); + } + addedLeaf[0] = new PHM.LeafNode( hash, key, val ); + newLeaves = this.leaves.concat( addedLeaf ); + return new PHM.HashCollisionNode( hash, newLeaves ); + } + return PHM.BitmapIndexedNode.createB(shift,this,hash,key,val,addedLeaf); + }, + without: function(hash, key){ + var idx = this.findIndex( hash, key ); + if( idx != -1 ) + return leaves[ idx ]; + return null; + }, + find: function(hash, key){ + var idx = this.findIndex(hash, key); + if(idx != -1) + return this.leaves[idx]; + return null; + }, + nodeSeq: function(){ + return clojure.lang.ArraySeq.create(this.leaves); + }, + findIndex: function(hash, key){ + for( var i = 0; i < this.leaves.length; ++i ) { + if( this.leaves[i].find( hash, key ) != null ) + return i; + } + return -1; + }, + getHash: function(){ return this.hash; } + } +}); + +// XXX dirty little hack until such time as PersistentArrayMap is ported +clojure.lang.PersistentArrayMap = clojure.lang.PersistentHashMap; + +clojure.JS.definterface( clojure.lang, "IPersistentSet", + [ clojure.lang.IPersistentCollection ] ); + +clojure.JS.defclass( clojure.lang, "APersistentSet", { + extend: clojure.lang.AFn, + implement: [ clojure.lang.IPersistentSet ], + init: function( meta, impl ) { + this._meta = meta; + this.impl = impl; + this._hash = -1; + }, + methods: { + contains: function(key){ return this.impl.containsKey(key); }, + get: function(key){ return this.impl.valAt(key); }, + count: function(){ return this.impl.count(); }, + seq: function(){ return clojure.core.keys( this.impl ); }, + invoke: function(key){ return this.get(key); }, + equals: function(m) { + if( ! clojure.instanceq( clojure.lang.IPersistentSet ) ) + return false; + if( m.count() != this.count() || m.hashCode() != this.hashCode() ) + return false; + for( var s = this.seq(); s; s = s.rest() ) { + if( ! m.contains( s.first() ) ) + return false; + } + return true; + }, + hashCode: function() { + if( this._hash == -1 ) { + var hash = this.count(), + s = this.seq(); + for( ; s; s = s.rest() ) { + hash = clojure.lang.Util.hashCombine( + hash, clojure.lang.Util.hash( s.first() ) ); + } + this._hash = hash; + } + return this._hash; + }, + toArray: function(){ return clojure.lang.RT.seqToArray( this.seq() ); }, + containsAll: function(c){ throw "not yet implemented"; }, + size: function(){ return this.count(); }, + isEmpty: function(){ return this.count() == 0; } + } +}); + +clojure.JS.defclass( clojure.lang, "PersistentHashSet", { + extend: clojure.lang.APersistentSet, + init: function( meta, impl ) { + clojure.lang.APersistentSet.call( this, meta, impl ); + }, + statics: { + create: function(init){ + var ret = clojure.lang.PersistentHashSet.EMPTY, + s = clojure.core.seq( init ); + for( ; s; s=s.rest() ){ + ret = ret.cons( s.first() ); + } + return ret; + } + }, + methods: { + disjoin: function(key) { + if( this.contains(key) ) + return new clojure.lang.PersistentHashSet( + this._meta, this.impl.without(key)); + return this; + }, + cons: function(o) { + if( this.contains(o) ) + return this; + return new clojure.lang.PersistentHashSet( + this._meta, this.impl.assoc(o)); + }, + empty: function(){ + return clojure.lang.PersistentHashSet.EMPTY.withMeta( this._meta ); + }, + withMeta: function(_meta){ + return new clojure.lang.PersistentHashSet( _meta, this.impl ); + } + } +}); + +clojure.lang.PersistentHashSet.EMPTY = new clojure.lang.PersistentHashSet( + null, clojure.lang.PersistentHashMap.EMPTY ); + +clojure.JS.defclass( clojure.lang, "MultiFn", { + extend: clojure.lang.AFn, + init: function( dispatchFn, defaultDispatchVal ) { + this.dispatchFn = dispatchFn; + this.defaultDispatchVal = defaultDispatchVal; + this.methodTable = clojure.lang.PersistentHashMap.EMPTY; + this.methodCache = clojure.lang.PersistentHashMap.EMPTY; + this.preferTable = clojure.lang.PersistentHashMap.EMPTY; + this.cachedHierarchy = null; + }, + methods: { + addMethod: function( dispatchVal, method ){ + this.methodTable = this.methodTable.assoc( dispatchVal, method ); + this.resetCache(); + return this; + }, + removeMethod: function( dispatchVal ){ + this.methodTable = this.methodTable.without( dispatchVal ); + this.resetCache(); + return this; + }, + preferMethod: function( dispatchValX, dispatchValY ){ + if( this.prefers( dispatchValY, dispatchValX ) ) + throw ("Preference conflict: " + dispatchValY + + " is already preferred to" + dispatchValX); + var oldset = clojure.core.get( + this.preferTable, dispatchValX, clojure.lang.PersistentHashSet.EMPTY); + this.preferTable = this.preferTable.assoc( + dispatchValX, clojure.core.conj( oldset, dispatchValY ) ); + this.resetCache(); + return this; + }, + prefers: function(x,y) { + var xprefs = this.preferTable.valAt(x); + return xprefs && xprefs.contains(y); + }, + isA: function(x,y) { return clojure.core.isa_QMARK_( x, y ); }, + dominates: function(x,y) { return this.prefers(x,y) || this.isA(x,y); }, + resetCache: function() { + this.methodCache = this.methodTable; + this.cachedHierarchy = clojure.core.global_hierarchy; + return this.methodCache; + }, + getFn: function(dispatchVal) { + if( this.cachedHierarchy != clojure.core.global_hierarchy ) + this.resetCache(); + var targetFn = + this.methodCache.valAt( dispatchVal ) || + this.findAndCacheBestMethod( dispatchVal ) || + this.methodTable.valAt( this.defaultDispatchVal ); + if( targetFn === null ) + throw "No method for dispatch value: " + dispatchVal; + return targetFn; + }, + findAndCacheBestMethod: function( dispatchVal ) { + var e, bestEntry = null, + s = this.methodTable.seq(); + for( ; s; s = s.rest() ) { + e = s.first(); + if( this.isA( dispatchVal, e.getKey() ) ) { + if( bestEntry===null || this.dominates(e.getKey(),bestEntry.getKey())) + bestEntry = e; + if( ! this.dominates( bestEntry.getKey(), e.getKey() ) ) + throw ["Multiple methods match dispatch value:", dispatchVal, + "->", e.getKey(), "and", bestEntry.getKey(), + "and neither is preferred"].join(' '); + } + } + if( bestEntry === null ) + return null; + // skip multi-threading protection + this.methodCache = this.methodCache.assoc( + dispatchVal, bestEntry.getValue()); + return bestEntry.getValue(); + }, + invoke: function() { + return (this.getFn( this.dispatchFn.apply( null, arguments ) ) + .apply( null, arguments )); + } + } +}); + +clojure.core.print_method = new clojure.lang.MultiFn( + function (x, writer){ return clojure.core.class_(x); }, + clojure.core.keyword("","default")); + +clojure.core.print_method.addMethod( java.lang.Class, function(o,w) { + w.write("#="+clojure.lang.RT.className(o)); +}); + +clojure.JS.relayPrintMethod( Number, java.lang.Number ); +clojure.JS.relayPrintMethod( Array, java.util.Collection ); +clojure.JS.relayPrintMethod( Boolean, java.lang.Boolean ); +clojure.JS.relayPrintMethod( String, java.lang.String, + function(o) { return new clojure.JS.String(o); } ); +clojure.JS.relayPrintMethod( clojure.JS.Class, java.lang.Class ); + +clojure.JS.def(clojure.core,"_STAR_print_readably_STAR_",true); + +clojure.JS.implement( clojure.lang.Namespace, "Namespace" ); + +clojure.lang.Namespace.find = function( s ) { + return clojure.JS.global[ s.getName() ]; +}; + +clojure.JS.merge( clojure.lang.Namespace.prototype, { + getMappings: function() { return this; }, + hashCode: function() { return clojure.hash( this.name ); } +}); + +clojure.core.in_ns(clojure.core.symbol("user")); + +(function() { + var buf = []; + function write(s) { + s = s.toString(); + var last, parts = s.split(/\n/); + if( parts.length == 1 ) { + buf.push(s); + } + else { + last = parts.pop(); + print( buf.join('') + parts.join('\n') ); + buf = [ last ]; + } + } + clojure.core._STAR_out_STAR_ = { append: write, write: write }; +})(); |
