mirror of
https://github.com/status-im/pluto.git
synced 2026-08-31 12:31:08 +00:00
37632 lines
1.2 MiB
Plaintext
37632 lines
1.2 MiB
Plaintext
// Compiled by ClojureScript 1.10.439 {:static-fns true, :optimize-constants true}
|
|
goog.provide('cljs.core');
|
|
goog.require('goog.math.Long');
|
|
goog.require('goog.math.Integer');
|
|
goog.require('goog.string');
|
|
goog.require('goog.object');
|
|
goog.require('goog.array');
|
|
goog.require('goog.Uri');
|
|
goog.require('goog.string.StringBuffer');
|
|
cljs.core._STAR_clojurescript_version_STAR_ = "1.10.439";
|
|
cljs.core._STAR_unchecked_if_STAR_ = false;
|
|
cljs.core._STAR_unchecked_arrays_STAR_ = false;
|
|
cljs.core._STAR_warn_on_infer_STAR_ = false;
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.PROTOCOL_SENTINEL !== 'undefined')){
|
|
} else {
|
|
cljs.core.PROTOCOL_SENTINEL = ({});
|
|
}
|
|
cljs.core.MODULE_URIS = null;
|
|
cljs.core.MODULE_INFOS = null;
|
|
|
|
/** @define {string} */
|
|
goog.define("cljs.core._STAR_target_STAR_","default");
|
|
/**
|
|
* Var bound to the current namespace. Only used for bootstrapping.
|
|
* @type {*}
|
|
*/
|
|
cljs.core._STAR_ns_STAR_ = null;
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core._STAR_out_STAR_ = null;
|
|
cljs.core._STAR_assert_STAR_ = true;
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_print_fn_STAR_ !== 'undefined')){
|
|
} else {
|
|
/**
|
|
* Each runtime environment provides a different way to print output.
|
|
* Whatever function *print-fn* is bound to will be passed any
|
|
* Strings which should be printed.
|
|
*/
|
|
cljs.core._STAR_print_fn_STAR_ = null;
|
|
}
|
|
/**
|
|
* Arranges to have tap functions executed via the supplied f, a
|
|
* function of no arguments. Returns true if successful, false otherwise.
|
|
*/
|
|
cljs.core._STAR_exec_tap_fn_STAR_ = (function cljs$core$_STAR_exec_tap_fn_STAR_(f){
|
|
var and__4036__auto__ = (typeof setTimeout !== 'undefined');
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = setTimeout(f,(0));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return true;
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_print_err_fn_STAR_ !== 'undefined')){
|
|
} else {
|
|
/**
|
|
* Each runtime environment provides a different way to print error output.
|
|
* Whatever function *print-err-fn* is bound to will be passed any
|
|
* Strings which should be printed.
|
|
*/
|
|
cljs.core._STAR_print_err_fn_STAR_ = null;
|
|
}
|
|
/**
|
|
* Set *print-fn* to f.
|
|
*/
|
|
cljs.core.set_print_fn_BANG_ = (function cljs$core$set_print_fn_BANG_(f){
|
|
return cljs.core._STAR_print_fn_STAR_ = f;
|
|
});
|
|
/**
|
|
* Set *print-err-fn* to f.
|
|
*/
|
|
cljs.core.set_print_err_fn_BANG_ = (function cljs$core$set_print_err_fn_BANG_(f){
|
|
return cljs.core._STAR_print_err_fn_STAR_ = f;
|
|
});
|
|
/**
|
|
* When set to true, output will be flushed whenever a newline is printed.
|
|
*
|
|
* Defaults to true.
|
|
*/
|
|
cljs.core._STAR_flush_on_newline_STAR_ = true;
|
|
/**
|
|
* When set to logical false will drop newlines from printing calls.
|
|
* This is to work around the implicit newlines emitted by standard JavaScript
|
|
* console objects.
|
|
*/
|
|
cljs.core._STAR_print_newline_STAR_ = true;
|
|
/**
|
|
* When set to logical false, strings and characters will be printed with
|
|
* non-alphanumeric characters converted to the appropriate escape sequences.
|
|
*
|
|
* Defaults to true
|
|
*/
|
|
cljs.core._STAR_print_readably_STAR_ = true;
|
|
/**
|
|
* If set to logical true, when printing an object, its metadata will also
|
|
* be printed in a form that can be read back by the reader.
|
|
*
|
|
* Defaults to false.
|
|
*/
|
|
cljs.core._STAR_print_meta_STAR_ = false;
|
|
/**
|
|
* When set to logical true, objects will be printed in a way that preserves
|
|
* their type when read in later.
|
|
*
|
|
* Defaults to false.
|
|
*/
|
|
cljs.core._STAR_print_dup_STAR_ = false;
|
|
/**
|
|
* *print-namespace-maps* controls whether the printer will print
|
|
* namespace map literal syntax.
|
|
*
|
|
* Defaults to false, but the REPL binds it to true.
|
|
*/
|
|
cljs.core._STAR_print_namespace_maps_STAR_ = false;
|
|
/**
|
|
* *print-length* controls how many items of each collection the
|
|
* printer will print. If it is bound to logical false, there is no
|
|
* limit. Otherwise, it must be bound to an integer indicating the maximum
|
|
* number of items of each collection to print. If a collection contains
|
|
* more items, the printer will print items up to the limit followed by
|
|
* '...' to represent the remaining items. The root binding is nil
|
|
* indicating no limit.
|
|
* @type {null|number}
|
|
*/
|
|
cljs.core._STAR_print_length_STAR_ = null;
|
|
/**
|
|
* *print-level* controls how many levels deep the printer will
|
|
* print nested objects. If it is bound to logical false, there is no
|
|
* limit. Otherwise, it must be bound to an integer indicating the maximum
|
|
* level to print. Each argument to print is at level 0; if an argument is a
|
|
* collection, its items are at level 1; and so on. If an object is a
|
|
* collection and is at a level greater than or equal to the value bound to
|
|
* *print-level*, the printer prints '#' to represent it. The root binding
|
|
* is nil indicating no limit.
|
|
* @type {null|number}
|
|
*/
|
|
cljs.core._STAR_print_level_STAR_ = null;
|
|
/**
|
|
* *print-fns-bodies* controls whether functions print their source or
|
|
* only their names.
|
|
*/
|
|
cljs.core._STAR_print_fn_bodies_STAR_ = false;
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_loaded_libs_STAR_ !== 'undefined')){
|
|
} else {
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core._STAR_loaded_libs_STAR_ = null;
|
|
}
|
|
cljs.core.pr_opts = (function cljs$core$pr_opts(){
|
|
return new cljs.core.PersistentArrayMap(null, 5, [cljs.core.cst$kw$flush_DASH_on_DASH_newline,cljs.core._STAR_flush_on_newline_STAR_,cljs.core.cst$kw$readably,cljs.core._STAR_print_readably_STAR_,cljs.core.cst$kw$meta,cljs.core._STAR_print_meta_STAR_,cljs.core.cst$kw$dup,cljs.core._STAR_print_dup_STAR_,cljs.core.cst$kw$print_DASH_length,cljs.core._STAR_print_length_STAR_], null);
|
|
});
|
|
/**
|
|
* Set *print-fn* to console.log
|
|
*/
|
|
cljs.core.enable_console_print_BANG_ = (function cljs$core$enable_console_print_BANG_(){
|
|
cljs.core._STAR_print_newline_STAR_ = false;
|
|
|
|
cljs.core.set_print_fn_BANG_((function (){
|
|
var xs = arguments;
|
|
return console.log.apply(console,goog.array.clone(xs));
|
|
}));
|
|
|
|
cljs.core.set_print_err_fn_BANG_((function (){
|
|
var xs = arguments;
|
|
return console.error.apply(console,goog.array.clone(xs));
|
|
}));
|
|
|
|
return null;
|
|
});
|
|
/**
|
|
* Internal - do not use!
|
|
*/
|
|
cljs.core.truth_ = (function cljs$core$truth_(x){
|
|
return (x != null && x !== false);
|
|
});
|
|
cljs.core.not_native = null;
|
|
|
|
/**
|
|
* Tests if 2 arguments are the same object
|
|
*/
|
|
cljs.core.identical_QMARK_ = (function cljs$core$identical_QMARK_(x,y){
|
|
return (x === y);
|
|
});
|
|
/**
|
|
* Returns true if x is nil, false otherwise.
|
|
*/
|
|
cljs.core.nil_QMARK_ = (function cljs$core$nil_QMARK_(x){
|
|
return (x == null);
|
|
});
|
|
/**
|
|
* Returns true if x is a JavaScript array.
|
|
*/
|
|
cljs.core.array_QMARK_ = (function cljs$core$array_QMARK_(x){
|
|
if((cljs.core._STAR_target_STAR_ === "nodejs")){
|
|
return Array.isArray(x);
|
|
} else {
|
|
return (x instanceof Array);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if x is a JavaScript number.
|
|
*/
|
|
cljs.core.number_QMARK_ = (function cljs$core$number_QMARK_(x){
|
|
return typeof x === 'number';
|
|
});
|
|
/**
|
|
* Returns true if x is logical false, false otherwise.
|
|
*/
|
|
cljs.core.not = (function cljs$core$not(x){
|
|
if((x == null)){
|
|
return true;
|
|
} else {
|
|
if(x === false){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if x is not nil, false otherwise.
|
|
*/
|
|
cljs.core.some_QMARK_ = (function cljs$core$some_QMARK_(x){
|
|
return (!((x == null)));
|
|
});
|
|
/**
|
|
* Returns true if x's constructor is Object
|
|
*/
|
|
cljs.core.object_QMARK_ = (function cljs$core$object_QMARK_(x){
|
|
if((!((x == null)))){
|
|
return (x.constructor === Object);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if x is a JavaScript string.
|
|
*/
|
|
cljs.core.string_QMARK_ = (function cljs$core$string_QMARK_(x){
|
|
return goog.isString(x);
|
|
});
|
|
/**
|
|
* Returns true if x is a JavaScript string of length one.
|
|
*/
|
|
cljs.core.char_QMARK_ = (function cljs$core$char_QMARK_(x){
|
|
return ((typeof x === 'string') && (((1) === x.length)));
|
|
});
|
|
/**
|
|
* Returns true if given any argument.
|
|
*/
|
|
cljs.core.any_QMARK_ = (function cljs$core$any_QMARK_(x){
|
|
return true;
|
|
});
|
|
/**
|
|
* Internal - do not use!
|
|
*/
|
|
cljs.core.native_satisfies_QMARK_ = (function cljs$core$native_satisfies_QMARK_(p,x){
|
|
var x__$1 = (((x == null))?null:x);
|
|
if((p[goog.typeOf(x__$1)])){
|
|
return true;
|
|
} else {
|
|
if((p["_"])){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
});
|
|
cljs.core.is_proto_ = (function cljs$core$is_proto_(x){
|
|
return (x.constructor.prototype === x);
|
|
});
|
|
/**
|
|
* When compiled for a command-line target, whatever function
|
|
* *main-cli-fn* is set to will be called with the command-line
|
|
* argv as arguments
|
|
*/
|
|
cljs.core._STAR_main_cli_fn_STAR_ = null;
|
|
/**
|
|
* A sequence of the supplied command line arguments, or nil if
|
|
* none were supplied
|
|
*/
|
|
cljs.core._STAR_command_line_args_STAR_ = null;
|
|
/**
|
|
* Return x's constructor.
|
|
*/
|
|
cljs.core.type = (function cljs$core$type(x){
|
|
if((x == null)){
|
|
return null;
|
|
} else {
|
|
return x.constructor;
|
|
}
|
|
});
|
|
cljs.core.missing_protocol = (function cljs$core$missing_protocol(proto,obj){
|
|
var ty = cljs.core.type(obj);
|
|
var ty__$1 = (cljs.core.truth_((function (){var and__4036__auto__ = ty;
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return ty.cljs$lang$type;
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())?ty.cljs$lang$ctorStr:goog.typeOf(obj));
|
|
return (new Error(["No protocol method ",proto," defined for type ",ty__$1,": ",obj].join("")));
|
|
});
|
|
cljs.core.type__GT_str = (function cljs$core$type__GT_str(ty){
|
|
var temp__5455__auto__ = ty.cljs$lang$ctorStr;
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var s = temp__5455__auto__;
|
|
return s;
|
|
} else {
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(ty);
|
|
}
|
|
});
|
|
cljs.core.load_file = (function cljs$core$load_file(file){
|
|
if(cljs.core.truth_(COMPILED)){
|
|
return null;
|
|
} else {
|
|
return goog.nodeGlobalRequire(file);
|
|
}
|
|
});
|
|
if((((typeof Symbol !== 'undefined')) && ((goog.typeOf(Symbol) === "function")))){
|
|
cljs.core.ITER_SYMBOL = Symbol.iterator;
|
|
} else {
|
|
cljs.core.ITER_SYMBOL = "@@iterator";
|
|
}
|
|
/**
|
|
* @enum {string}
|
|
*/
|
|
cljs.core.CHAR_MAP = ({"]": "_RBRACK_", "'": "_SINGLEQUOTE_", "=": "_EQ_", "\"": "_DOUBLEQUOTE_", "!": "_BANG_", "*": "_STAR_", "%": "_PERCENT_", "|": "_BAR_", "~": "_TILDE_", "/": "_SLASH_", "\\": "_BSLASH_", "-": "_", "?": "_QMARK_", "&": "_AMPERSAND_", ":": "_COLON_", "<": "_LT_", "{": "_LBRACE_", "}": "_RBRACE_", "[": "_LBRACK_", "#": "_SHARP_", "^": "_CARET_", "+": "_PLUS_", "@": "_CIRCA_", ">": "_GT_"});
|
|
/**
|
|
* @enum {string}
|
|
*/
|
|
cljs.core.DEMUNGE_MAP = ({"_RBRACE_": "}", "_COLON_": ":", "_BANG_": "!", "_QMARK_": "?", "_BSLASH_": "\\\\", "_SLASH_": "/", "_PERCENT_": "%", "_PLUS_": "+", "_SHARP_": "#", "_LBRACE_": "{", "_BAR_": "|", "_LBRACK_": "[", "_EQ_": "=", "_": "-", "_TILDE_": "~", "_RBRACK_": "]", "_GT_": ">", "_SINGLEQUOTE_": "'", "_CIRCA_": "@", "_AMPERSAND_": "&", "_DOUBLEQUOTE_": "\\\"", "_CARET_": "^", "_LT_": "<", "_STAR_": "*"});
|
|
cljs.core.DEMUNGE_PATTERN = null;
|
|
/**
|
|
* Returns highest resolution time offered by host in milliseconds.
|
|
*/
|
|
cljs.core.system_time = (function cljs$core$system_time(){
|
|
if((((typeof performance !== 'undefined')) && ((!((performance.now == null)))))){
|
|
return performance.now();
|
|
} else {
|
|
if((((typeof process !== 'undefined')) && ((!((process.hrtime == null)))))){
|
|
var t = process.hrtime();
|
|
return ((((t[(0)]) * 1.0E9) + (t[(1)])) / 1000000.0);
|
|
} else {
|
|
return (new Date()).getTime();
|
|
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Construct a JavaScript array of the specified dimensions. Accepts ignored
|
|
* type argument for compatibility with Clojure. Note that there is no efficient
|
|
* way to allocate multi-dimensional arrays in JavaScript; as such, this function
|
|
* will run in polynomial time when called with 3 or more arguments.
|
|
*/
|
|
cljs.core.make_array = (function cljs$core$make_array(var_args){
|
|
var G__536 = arguments.length;
|
|
switch (G__536) {
|
|
case 1:
|
|
return cljs.core.make_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.make_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___538 = arguments.length;
|
|
var i__4642__auto___539 = (0);
|
|
while(true){
|
|
if((i__4642__auto___539 < len__4641__auto___538)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___539]));
|
|
|
|
var G__540 = (i__4642__auto___539 + (1));
|
|
i__4642__auto___539 = G__540;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.make_array.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.make_array.cljs$core$IFn$_invoke$arity$1 = (function (size){
|
|
return (new Array(size));
|
|
});
|
|
|
|
cljs.core.make_array.cljs$core$IFn$_invoke$arity$2 = (function (type,size){
|
|
return (new Array(size));
|
|
});
|
|
|
|
cljs.core.make_array.cljs$core$IFn$_invoke$arity$variadic = (function (type,size,more_sizes){
|
|
var dims = more_sizes;
|
|
var dimarray = (new Array(size));
|
|
var n__4518__auto___541 = dimarray.length;
|
|
var i_542 = (0);
|
|
while(true){
|
|
if((i_542 < n__4518__auto___541)){
|
|
(dimarray[i_542] = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.make_array,null,dims));
|
|
|
|
var G__543 = (i_542 + (1));
|
|
i_542 = G__543;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return dimarray;
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.make_array.cljs$lang$applyTo = (function (seq533){
|
|
var G__534 = cljs.core.first(seq533);
|
|
var seq533__$1 = cljs.core.next(seq533);
|
|
var G__535 = cljs.core.first(seq533__$1);
|
|
var seq533__$2 = cljs.core.next(seq533__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__534,G__535,seq533__$2);
|
|
});
|
|
|
|
cljs.core.make_array.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns a javascript array, cloned from the passed in array
|
|
*/
|
|
cljs.core.aclone = (function cljs$core$aclone(arr){
|
|
var len = arr.length;
|
|
var new_arr = (new Array(len));
|
|
var n__4518__auto___544 = len;
|
|
var i_545 = (0);
|
|
while(true){
|
|
if((i_545 < n__4518__auto___544)){
|
|
(new_arr[i_545] = (arr[i_545]));
|
|
|
|
var G__546 = (i_545 + (1));
|
|
i_545 = G__546;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return new_arr;
|
|
});
|
|
/**
|
|
* Creates a new javascript array.
|
|
* @param {...*} var_args
|
|
*/
|
|
cljs.core.array = (function cljs$core$array(var_args){
|
|
var a = (new Array(arguments.length));
|
|
var i = (0);
|
|
while(true){
|
|
if((i < a.length)){
|
|
(a[i] = (arguments[i]));
|
|
|
|
var G__547 = (i + (1));
|
|
i = G__547;
|
|
continue;
|
|
} else {
|
|
return a;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.maybe_warn = (function cljs$core$maybe_warn(e){
|
|
if(cljs.core.truth_(cljs.core._STAR_print_err_fn_STAR_)){
|
|
return (cljs.core._STAR_print_err_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_print_err_fn_STAR_.cljs$core$IFn$_invoke$arity$1(e) : cljs.core._STAR_print_err_fn_STAR_.call(null,e));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
cljs.core.checked_aget = (function cljs$core$checked_aget(var_args){
|
|
var G__552 = arguments.length;
|
|
switch (G__552) {
|
|
case 2:
|
|
return cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___555 = arguments.length;
|
|
var i__4642__auto___556 = (0);
|
|
while(true){
|
|
if((i__4642__auto___556 < len__4641__auto___555)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___556]));
|
|
|
|
var G__557 = (i__4642__auto___556 + (1));
|
|
i__4642__auto___556 = G__557;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
|
|
try{if(cljs.core.truth_((function (){var or__4047__auto__ = cljs.core.array_QMARK_(array);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.isArrayLike(array);
|
|
}
|
|
})())){
|
|
} else {
|
|
throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
|
|
}
|
|
|
|
if(typeof idx === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? idx)"));
|
|
}
|
|
|
|
if((!((idx < (0))))){
|
|
} else {
|
|
throw (new Error("Assert failed: (not (neg? idx))"));
|
|
}
|
|
|
|
if((idx < array.length)){
|
|
} else {
|
|
throw (new Error("Assert failed: (< idx (alength array))"));
|
|
}
|
|
}catch (e553){var e_558 = e553;
|
|
cljs.core.maybe_warn(e_558);
|
|
}
|
|
return (array[idx]);
|
|
});
|
|
|
|
cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.checked_aget,cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2(array,idx),idxs);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.checked_aget.cljs$lang$applyTo = (function (seq549){
|
|
var G__550 = cljs.core.first(seq549);
|
|
var seq549__$1 = cljs.core.next(seq549);
|
|
var G__551 = cljs.core.first(seq549__$1);
|
|
var seq549__$2 = cljs.core.next(seq549__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__550,G__551,seq549__$2);
|
|
});
|
|
|
|
cljs.core.checked_aget.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.checked_aset = (function cljs$core$checked_aset(var_args){
|
|
var G__564 = arguments.length;
|
|
switch (G__564) {
|
|
case 3:
|
|
return cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___567 = arguments.length;
|
|
var i__4642__auto___568 = (0);
|
|
while(true){
|
|
if((i__4642__auto___568 < len__4641__auto___567)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___568]));
|
|
|
|
var G__569 = (i__4642__auto___568 + (1));
|
|
i__4642__auto___568 = G__569;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
|
|
try{if(cljs.core.truth_((function (){var or__4047__auto__ = cljs.core.array_QMARK_(array);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.isArrayLike(array);
|
|
}
|
|
})())){
|
|
} else {
|
|
throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
|
|
}
|
|
|
|
if(typeof idx === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? idx)"));
|
|
}
|
|
|
|
if((!((idx < (0))))){
|
|
} else {
|
|
throw (new Error("Assert failed: (not (neg? idx))"));
|
|
}
|
|
|
|
if((idx < array.length)){
|
|
} else {
|
|
throw (new Error("Assert failed: (< idx (alength array))"));
|
|
}
|
|
}catch (e565){var e_570 = e565;
|
|
cljs.core.maybe_warn(e_570);
|
|
}
|
|
return (array[idx] = val);
|
|
});
|
|
|
|
cljs.core.checked_aset.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.checked_aset,cljs.core.checked_aget.cljs$core$IFn$_invoke$arity$2(array,idx),idx2,idxv);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.checked_aset.cljs$lang$applyTo = (function (seq560){
|
|
var G__561 = cljs.core.first(seq560);
|
|
var seq560__$1 = cljs.core.next(seq560);
|
|
var G__562 = cljs.core.first(seq560__$1);
|
|
var seq560__$2 = cljs.core.next(seq560__$1);
|
|
var G__563 = cljs.core.first(seq560__$2);
|
|
var seq560__$3 = cljs.core.next(seq560__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__561,G__562,G__563,seq560__$3);
|
|
});
|
|
|
|
cljs.core.checked_aset.cljs$lang$maxFixedArity = (3);
|
|
|
|
cljs.core.checked_aget_SINGLEQUOTE_ = (function cljs$core$checked_aget_SINGLEQUOTE_(var_args){
|
|
var G__575 = arguments.length;
|
|
switch (G__575) {
|
|
case 2:
|
|
return cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___577 = arguments.length;
|
|
var i__4642__auto___578 = (0);
|
|
while(true){
|
|
if((i__4642__auto___578 < len__4641__auto___577)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___578]));
|
|
|
|
var G__579 = (i__4642__auto___578 + (1));
|
|
i__4642__auto___578 = G__579;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
|
|
if(cljs.core.truth_((function (){var or__4047__auto__ = cljs.core.array_QMARK_(array);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.isArrayLike(array);
|
|
}
|
|
})())){
|
|
} else {
|
|
throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
|
|
}
|
|
|
|
if(typeof idx === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? idx)"));
|
|
}
|
|
|
|
if((!((idx < (0))))){
|
|
} else {
|
|
throw (new Error("Assert failed: (not (neg? idx))"));
|
|
}
|
|
|
|
if((idx < array.length)){
|
|
} else {
|
|
throw (new Error("Assert failed: (< idx (alength array))"));
|
|
}
|
|
|
|
return (array[idx]);
|
|
});
|
|
|
|
cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.checked_aget_SINGLEQUOTE_,cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2(array,idx),idxs);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.checked_aget_SINGLEQUOTE_.cljs$lang$applyTo = (function (seq572){
|
|
var G__573 = cljs.core.first(seq572);
|
|
var seq572__$1 = cljs.core.next(seq572);
|
|
var G__574 = cljs.core.first(seq572__$1);
|
|
var seq572__$2 = cljs.core.next(seq572__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__573,G__574,seq572__$2);
|
|
});
|
|
|
|
cljs.core.checked_aget_SINGLEQUOTE_.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.checked_aset_SINGLEQUOTE_ = (function cljs$core$checked_aset_SINGLEQUOTE_(var_args){
|
|
var G__585 = arguments.length;
|
|
switch (G__585) {
|
|
case 3:
|
|
return cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___587 = arguments.length;
|
|
var i__4642__auto___588 = (0);
|
|
while(true){
|
|
if((i__4642__auto___588 < len__4641__auto___587)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___588]));
|
|
|
|
var G__589 = (i__4642__auto___588 + (1));
|
|
i__4642__auto___588 = G__589;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
|
|
if(cljs.core.truth_((function (){var or__4047__auto__ = cljs.core.array_QMARK_(array);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.isArrayLike(array);
|
|
}
|
|
})())){
|
|
} else {
|
|
throw (new Error("Assert failed: (or (array? array) (goog/isArrayLike array))"));
|
|
}
|
|
|
|
if(typeof idx === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? idx)"));
|
|
}
|
|
|
|
if((!((idx < (0))))){
|
|
} else {
|
|
throw (new Error("Assert failed: (not (neg? idx))"));
|
|
}
|
|
|
|
if((idx < array.length)){
|
|
} else {
|
|
throw (new Error("Assert failed: (< idx (alength array))"));
|
|
}
|
|
|
|
return (array[idx] = val);
|
|
});
|
|
|
|
cljs.core.checked_aset_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.checked_aset_SINGLEQUOTE_,cljs.core.checked_aget_SINGLEQUOTE_.cljs$core$IFn$_invoke$arity$2(array,idx),idx2,idxv);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.checked_aset_SINGLEQUOTE_.cljs$lang$applyTo = (function (seq581){
|
|
var G__582 = cljs.core.first(seq581);
|
|
var seq581__$1 = cljs.core.next(seq581);
|
|
var G__583 = cljs.core.first(seq581__$1);
|
|
var seq581__$2 = cljs.core.next(seq581__$1);
|
|
var G__584 = cljs.core.first(seq581__$2);
|
|
var seq581__$3 = cljs.core.next(seq581__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__582,G__583,G__584,seq581__$3);
|
|
});
|
|
|
|
cljs.core.checked_aset_SINGLEQUOTE_.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Returns the value at the index/indices. Works on JavaScript arrays.
|
|
*/
|
|
cljs.core.aget = (function cljs$core$aget(var_args){
|
|
var G__594 = arguments.length;
|
|
switch (G__594) {
|
|
case 2:
|
|
return cljs.core.aget.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___596 = arguments.length;
|
|
var i__4642__auto___597 = (0);
|
|
while(true){
|
|
if((i__4642__auto___597 < len__4641__auto___596)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___597]));
|
|
|
|
var G__598 = (i__4642__auto___597 + (1));
|
|
i__4642__auto___597 = G__598;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.aget.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.aget.cljs$core$IFn$_invoke$arity$2 = (function (array,idx){
|
|
return (array[idx]);
|
|
});
|
|
|
|
cljs.core.aget.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idxs){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.aget,(array[idx]),idxs);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.aget.cljs$lang$applyTo = (function (seq591){
|
|
var G__592 = cljs.core.first(seq591);
|
|
var seq591__$1 = cljs.core.next(seq591);
|
|
var G__593 = cljs.core.first(seq591__$1);
|
|
var seq591__$2 = cljs.core.next(seq591__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__592,G__593,seq591__$2);
|
|
});
|
|
|
|
cljs.core.aget.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Sets the value at the index/indices. Works on JavaScript arrays.
|
|
* Returns val.
|
|
*/
|
|
cljs.core.aset = (function cljs$core$aset(var_args){
|
|
var G__604 = arguments.length;
|
|
switch (G__604) {
|
|
case 3:
|
|
return cljs.core.aset.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___606 = arguments.length;
|
|
var i__4642__auto___607 = (0);
|
|
while(true){
|
|
if((i__4642__auto___607 < len__4641__auto___606)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___607]));
|
|
|
|
var G__608 = (i__4642__auto___607 + (1));
|
|
i__4642__auto___607 = G__608;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.aset.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.aset.cljs$core$IFn$_invoke$arity$3 = (function (array,idx,val){
|
|
return (array[idx] = val);
|
|
});
|
|
|
|
cljs.core.aset.cljs$core$IFn$_invoke$arity$variadic = (function (array,idx,idx2,idxv){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.aset,(array[idx]),idx2,idxv);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.aset.cljs$lang$applyTo = (function (seq600){
|
|
var G__601 = cljs.core.first(seq600);
|
|
var seq600__$1 = cljs.core.next(seq600);
|
|
var G__602 = cljs.core.first(seq600__$1);
|
|
var seq600__$2 = cljs.core.next(seq600__$1);
|
|
var G__603 = cljs.core.first(seq600__$2);
|
|
var seq600__$3 = cljs.core.next(seq600__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__601,G__602,G__603,seq600__$3);
|
|
});
|
|
|
|
cljs.core.aset.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Returns the length of the array. Works on arrays of all types.
|
|
*/
|
|
cljs.core.alength = (function cljs$core$alength(array){
|
|
return array.length;
|
|
});
|
|
/**
|
|
* Returns an array with components set to the values in aseq. Optional type
|
|
* argument accepted for compatibility with Clojure.
|
|
*/
|
|
cljs.core.into_array = (function cljs$core$into_array(var_args){
|
|
var G__610 = arguments.length;
|
|
switch (G__610) {
|
|
case 1:
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.into_array.cljs$core$IFn$_invoke$arity$1 = (function (aseq){
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$2(null,aseq);
|
|
});
|
|
|
|
cljs.core.into_array.cljs$core$IFn$_invoke$arity$2 = (function (type,aseq){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (a,x){
|
|
a.push(x);
|
|
|
|
return a;
|
|
}),[],aseq);
|
|
});
|
|
|
|
cljs.core.into_array.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Invoke JavaScript object method via string. Needed when the
|
|
* string is not a valid unquoted property name.
|
|
*/
|
|
cljs.core.js_invoke = (function cljs$core$js_invoke(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___615 = arguments.length;
|
|
var i__4642__auto___616 = (0);
|
|
while(true){
|
|
if((i__4642__auto___616 < len__4641__auto___615)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___616]));
|
|
|
|
var G__617 = (i__4642__auto___616 + (1));
|
|
i__4642__auto___616 = G__617;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((2) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((2)),(0),null)):null);
|
|
return cljs.core.js_invoke.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.js_invoke.cljs$core$IFn$_invoke$arity$variadic = (function (obj,s,args){
|
|
return (obj[s]).apply(obj,cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(args));
|
|
});
|
|
|
|
cljs.core.js_invoke.cljs$lang$maxFixedArity = (2);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.js_invoke.cljs$lang$applyTo = (function (seq612){
|
|
var G__613 = cljs.core.first(seq612);
|
|
var seq612__$1 = cljs.core.next(seq612);
|
|
var G__614 = cljs.core.first(seq612__$1);
|
|
var seq612__$2 = cljs.core.next(seq612__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__613,G__614,seq612__$2);
|
|
});
|
|
|
|
|
|
/**
|
|
* Marker protocol
|
|
* @interface
|
|
*/
|
|
cljs.core.Fn = function(){};
|
|
|
|
|
|
/**
|
|
* Protocol for adding the ability to invoke an object as a function.
|
|
* For example, a vector can also be used to look up a value:
|
|
* ([1 2 3 4] 1) => 2
|
|
* @interface
|
|
*/
|
|
cljs.core.IFn = function(){};
|
|
|
|
cljs.core._invoke = (function cljs$core$_invoke(var_args){
|
|
var G__619 = arguments.length;
|
|
switch (G__619) {
|
|
case 1:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
case 7:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$7((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]));
|
|
|
|
break;
|
|
case 8:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$8((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]));
|
|
|
|
break;
|
|
case 9:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$9((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]));
|
|
|
|
break;
|
|
case 10:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$10((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]));
|
|
|
|
break;
|
|
case 11:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$11((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]));
|
|
|
|
break;
|
|
case 12:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$12((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]));
|
|
|
|
break;
|
|
case 13:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$13((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]));
|
|
|
|
break;
|
|
case 14:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$14((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]));
|
|
|
|
break;
|
|
case 15:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$15((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]));
|
|
|
|
break;
|
|
case 16:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$16((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]));
|
|
|
|
break;
|
|
case 17:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$17((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]));
|
|
|
|
break;
|
|
case 18:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$18((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]));
|
|
|
|
break;
|
|
case 19:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$19((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]));
|
|
|
|
break;
|
|
case 20:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$20((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]));
|
|
|
|
break;
|
|
case 21:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$21((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]),(arguments[(20)]));
|
|
|
|
break;
|
|
case 22:
|
|
return cljs.core._invoke.cljs$core$IFn$_invoke$arity$22((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]),(arguments[(7)]),(arguments[(8)]),(arguments[(9)]),(arguments[(10)]),(arguments[(11)]),(arguments[(12)]),(arguments[(13)]),(arguments[(14)]),(arguments[(15)]),(arguments[(16)]),(arguments[(17)]),(arguments[(18)]),(arguments[(19)]),(arguments[(20)]),(arguments[(21)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$1 = (function (this$){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$1 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$1(this$);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(this$) : m__4348__auto__.call(null,this$));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(this$) : m__4348__auto____$1.call(null,this$));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$2 = (function (this$,a){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$2 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$2(this$,a);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(this$,a) : m__4348__auto__.call(null,this$,a));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,a) : m__4348__auto____$1.call(null,this$,a));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$3 = (function (this$,a,b){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$3 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$3(this$,a,b);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(this$,a,b) : m__4348__auto__.call(null,this$,a,b));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,a,b) : m__4348__auto____$1.call(null,this$,a,b));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$4 = (function (this$,a,b,c){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$4 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$4(this$,a,b,c);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$4 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$4(this$,a,b,c) : m__4348__auto__.call(null,this$,a,b,c));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$4 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$4(this$,a,b,c) : m__4348__auto____$1.call(null,this$,a,b,c));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$5 = (function (this$,a,b,c,d){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$5 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$5 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d) : m__4348__auto__.call(null,this$,a,b,c,d));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$5 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$5(this$,a,b,c,d) : m__4348__auto____$1.call(null,this$,a,b,c,d));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$6 = (function (this$,a,b,c,d,e){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$6 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$6 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e) : m__4348__auto__.call(null,this$,a,b,c,d,e));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$6 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$6(this$,a,b,c,d,e) : m__4348__auto____$1.call(null,this$,a,b,c,d,e));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$7 = (function (this$,a,b,c,d,e,f){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$7 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$7 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f) : m__4348__auto__.call(null,this$,a,b,c,d,e,f));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$7 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$7(this$,a,b,c,d,e,f) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$8 = (function (this$,a,b,c,d,e,f,g){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$8 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$8 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$8 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$8(this$,a,b,c,d,e,f,g) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$9 = (function (this$,a,b,c,d,e,f,g,h){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$9 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$9 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$9 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$9(this$,a,b,c,d,e,f,g,h) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$10 = (function (this$,a,b,c,d,e,f,g,h,i){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$10 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$10 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$10 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$10(this$,a,b,c,d,e,f,g,h,i) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$11 = (function (this$,a,b,c,d,e,f,g,h,i,j){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$11 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$11 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$11 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$11(this$,a,b,c,d,e,f,g,h,i,j) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$12 = (function (this$,a,b,c,d,e,f,g,h,i,j,k){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$12 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$12 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$12 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$12(this$,a,b,c,d,e,f,g,h,i,j,k) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$13 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$13 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$13 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$13 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$13(this$,a,b,c,d,e,f,g,h,i,j,k,l) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$14 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$14 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$14 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$14 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$14(this$,a,b,c,d,e,f,g,h,i,j,k,l,m) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$15 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$15 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$15 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$15 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$15(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$16 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$16 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$16 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$16 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$16(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$17 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$17 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$17 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$17 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$17(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$18 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$18 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$18 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$18 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$18(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$19 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$19 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$19 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$19 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$19(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$20 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$20 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$20 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$20 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$20(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$21 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$21 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$21 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$21 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$21(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$core$IFn$_invoke$arity$22 = (function (this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IFn$_invoke$arity$22 == null)))))){
|
|
return this$.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._invoke[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$22 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest) : m__4348__auto__.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._invoke["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$22 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$22(this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest) : m__4348__auto____$1.call(null,this$,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFn.-invoke",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._invoke.cljs$lang$maxFixedArity = 22;
|
|
|
|
|
|
|
|
/**
|
|
* Protocol for cloning a value.
|
|
* @interface
|
|
*/
|
|
cljs.core.ICloneable = function(){};
|
|
|
|
/**
|
|
* Creates a clone of value.
|
|
*/
|
|
cljs.core._clone = (function cljs$core$_clone(value){
|
|
if((((!((value == null)))) && ((!((value.cljs$core$ICloneable$_clone$arity$1 == null)))))){
|
|
return value.cljs$core$ICloneable$_clone$arity$1(value);
|
|
} else {
|
|
var x__4347__auto__ = (((value == null))?null:value);
|
|
var m__4348__auto__ = (cljs.core._clone[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(value) : m__4348__auto__.call(null,value));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._clone["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(value) : m__4348__auto____$1.call(null,value));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ICloneable.-clone",value);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding the ability to count a collection in constant time.
|
|
* @interface
|
|
*/
|
|
cljs.core.ICounted = function(){};
|
|
|
|
/**
|
|
* Calculates the count of coll in constant time. Used by cljs.core/count.
|
|
*/
|
|
cljs.core._count = (function cljs$core$_count(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ICounted$_count$arity$1 == null)))))){
|
|
return coll.cljs$core$ICounted$_count$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._count[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._count["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ICounted.-count",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for creating an empty collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.IEmptyableCollection = function(){};
|
|
|
|
/**
|
|
* Returns an empty collection of the same category as coll. Used
|
|
* by cljs.core/empty.
|
|
*/
|
|
cljs.core._empty = (function cljs$core$_empty(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IEmptyableCollection$_empty$arity$1 == null)))))){
|
|
return coll.cljs$core$IEmptyableCollection$_empty$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._empty[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._empty["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEmptyableCollection.-empty",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding to a collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.ICollection = function(){};
|
|
|
|
/**
|
|
* Returns a new collection of coll with o added to it. The new item
|
|
* should be added to the most efficient place, e.g.
|
|
* (conj [1 2 3 4] 5) => [1 2 3 4 5]
|
|
* (conj '(2 3 4 5) 1) => '(1 2 3 4 5)
|
|
*/
|
|
cljs.core._conj = (function cljs$core$_conj(coll,o){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ICollection$_conj$arity$2 == null)))))){
|
|
return coll.cljs$core$ICollection$_conj$arity$2(coll,o);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._conj[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,o) : m__4348__auto__.call(null,coll,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._conj["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,o) : m__4348__auto____$1.call(null,coll,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ICollection.-conj",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for collections to provide indexed-based access to their items.
|
|
* @interface
|
|
*/
|
|
cljs.core.IIndexed = function(){};
|
|
|
|
/**
|
|
* Returns the value at the index n in the collection coll.
|
|
* Returns not-found if index n is out of bounds and not-found is supplied.
|
|
*/
|
|
cljs.core._nth = (function cljs$core$_nth(var_args){
|
|
var G__622 = arguments.length;
|
|
switch (G__622) {
|
|
case 2:
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IIndexed$_nth$arity$2 == null)))))){
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(coll,n);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._nth[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,n) : m__4348__auto__.call(null,coll,n));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._nth["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,n) : m__4348__auto____$1.call(null,coll,n));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IIndexed.-nth",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IIndexed$_nth$arity$3 == null)))))){
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(coll,n,not_found);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._nth[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,n,not_found) : m__4348__auto__.call(null,coll,n,not_found));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._nth["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,n,not_found) : m__4348__auto____$1.call(null,coll,n,not_found));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IIndexed.-nth",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._nth.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
|
|
/**
|
|
* Marker protocol indicating an array sequence.
|
|
* @interface
|
|
*/
|
|
cljs.core.ASeq = function(){};
|
|
|
|
|
|
/**
|
|
* Protocol for collections to provide access to their items as sequences.
|
|
* @interface
|
|
*/
|
|
cljs.core.ISeq = function(){};
|
|
|
|
/**
|
|
* Returns the first item in the collection coll. Used by cljs.core/first.
|
|
*/
|
|
cljs.core._first = (function cljs$core$_first(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISeq$_first$arity$1 == null)))))){
|
|
return coll.cljs$core$ISeq$_first$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._first[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._first["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISeq.-first",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns a new collection of coll without the first item. It should
|
|
* always return a seq, e.g.
|
|
* (rest []) => ()
|
|
* (rest nil) => ()
|
|
*/
|
|
cljs.core._rest = (function cljs$core$_rest(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISeq$_rest$arity$1 == null)))))){
|
|
return coll.cljs$core$ISeq$_rest$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._rest[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._rest["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISeq.-rest",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for accessing the next items of a collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.INext = function(){};
|
|
|
|
/**
|
|
* Returns a new collection of coll without the first item. In contrast to
|
|
* rest, it should return nil if there are no more items, e.g.
|
|
* (next []) => nil
|
|
* (next nil) => nil
|
|
*/
|
|
cljs.core._next = (function cljs$core$_next(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$INext$_next$arity$1 == null)))))){
|
|
return coll.cljs$core$INext$_next$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._next[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._next["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("INext.-next",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for looking up a value in a data structure.
|
|
* @interface
|
|
*/
|
|
cljs.core.ILookup = function(){};
|
|
|
|
/**
|
|
* Use k to look up a value in o. If not-found is supplied and k is not
|
|
* a valid value that can be used for look up, not-found is returned.
|
|
*/
|
|
cljs.core._lookup = (function cljs$core$_lookup(var_args){
|
|
var G__625 = arguments.length;
|
|
switch (G__625) {
|
|
case 2:
|
|
return cljs.core._lookup.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._lookup.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._lookup.cljs$core$IFn$_invoke$arity$2 = (function (o,k){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ILookup$_lookup$arity$2 == null)))))){
|
|
return o.cljs$core$ILookup$_lookup$arity$2(o,k);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._lookup[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,k) : m__4348__auto__.call(null,o,k));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._lookup["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,k) : m__4348__auto____$1.call(null,o,k));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ILookup.-lookup",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._lookup.cljs$core$IFn$_invoke$arity$3 = (function (o,k,not_found){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ILookup$_lookup$arity$3 == null)))))){
|
|
return o.cljs$core$ILookup$_lookup$arity$3(o,k,not_found);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._lookup[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(o,k,not_found) : m__4348__auto__.call(null,o,k,not_found));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._lookup["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(o,k,not_found) : m__4348__auto____$1.call(null,o,k,not_found));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ILookup.-lookup",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._lookup.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
|
|
/**
|
|
* Protocol for adding associativity to collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.IAssociative = function(){};
|
|
|
|
/**
|
|
* Returns true if k is a key in coll.
|
|
*/
|
|
cljs.core._contains_key_QMARK_ = (function cljs$core$_contains_key_QMARK_(coll,k){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 == null)))))){
|
|
return coll.cljs$core$IAssociative$_contains_key_QMARK_$arity$2(coll,k);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._contains_key_QMARK_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto__.call(null,coll,k));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._contains_key_QMARK_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto____$1.call(null,coll,k));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IAssociative.-contains-key?",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns a new collection of coll with a mapping from key k to
|
|
* value v added to it.
|
|
*/
|
|
cljs.core._assoc = (function cljs$core$_assoc(coll,k,v){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IAssociative$_assoc$arity$3 == null)))))){
|
|
return coll.cljs$core$IAssociative$_assoc$arity$3(coll,k,v);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._assoc[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,k,v) : m__4348__auto__.call(null,coll,k,v));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._assoc["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,k,v) : m__4348__auto____$1.call(null,coll,k,v));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IAssociative.-assoc",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for implementing entry finding in collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.IFind = function(){};
|
|
|
|
/**
|
|
* Returns the map entry for key, or nil if key not present.
|
|
*/
|
|
cljs.core._find = (function cljs$core$_find(coll,k){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IFind$_find$arity$2 == null)))))){
|
|
return coll.cljs$core$IFind$_find$arity$2(coll,k);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._find[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto__.call(null,coll,k));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._find["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto____$1.call(null,coll,k));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IFind.-find",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding mapping functionality to collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.IMap = function(){};
|
|
|
|
/**
|
|
* Returns a new collection of coll without the mapping for key k.
|
|
*/
|
|
cljs.core._dissoc = (function cljs$core$_dissoc(coll,k){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IMap$_dissoc$arity$2 == null)))))){
|
|
return coll.cljs$core$IMap$_dissoc$arity$2(coll,k);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._dissoc[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto__.call(null,coll,k));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._dissoc["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,k) : m__4348__auto____$1.call(null,coll,k));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMap.-dissoc",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for examining a map entry.
|
|
* @interface
|
|
*/
|
|
cljs.core.IMapEntry = function(){};
|
|
|
|
/**
|
|
* Returns the key of the map entry.
|
|
*/
|
|
cljs.core._key = (function cljs$core$_key(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IMapEntry$_key$arity$1 == null)))))){
|
|
return coll.cljs$core$IMapEntry$_key$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._key[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._key["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMapEntry.-key",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns the value of the map entry.
|
|
*/
|
|
cljs.core._val = (function cljs$core$_val(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IMapEntry$_val$arity$1 == null)))))){
|
|
return coll.cljs$core$IMapEntry$_val$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._val[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._val["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMapEntry.-val",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding set functionality to a collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.ISet = function(){};
|
|
|
|
/**
|
|
* Returns a new collection of coll that does not contain v.
|
|
*/
|
|
cljs.core._disjoin = (function cljs$core$_disjoin(coll,v){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISet$_disjoin$arity$2 == null)))))){
|
|
return coll.cljs$core$ISet$_disjoin$arity$2(coll,v);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._disjoin[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,v) : m__4348__auto__.call(null,coll,v));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._disjoin["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,v) : m__4348__auto____$1.call(null,coll,v));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISet.-disjoin",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for collections to provide access to their items as stacks. The top
|
|
* of the stack should be accessed in the most efficient way for the different
|
|
* data structures.
|
|
* @interface
|
|
*/
|
|
cljs.core.IStack = function(){};
|
|
|
|
/**
|
|
* Returns the item from the top of the stack. Is used by cljs.core/peek.
|
|
*/
|
|
cljs.core._peek = (function cljs$core$_peek(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IStack$_peek$arity$1 == null)))))){
|
|
return coll.cljs$core$IStack$_peek$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._peek[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._peek["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IStack.-peek",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns a new stack without the item on top of the stack. Is used
|
|
* by cljs.core/pop.
|
|
*/
|
|
cljs.core._pop = (function cljs$core$_pop(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IStack$_pop$arity$1 == null)))))){
|
|
return coll.cljs$core$IStack$_pop$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._pop[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._pop["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IStack.-pop",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding vector functionality to collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.IVector = function(){};
|
|
|
|
/**
|
|
* Returns a new vector with value val added at position n.
|
|
*/
|
|
cljs.core._assoc_n = (function cljs$core$_assoc_n(coll,n,val){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IVector$_assoc_n$arity$3 == null)))))){
|
|
return coll.cljs$core$IVector$_assoc_n$arity$3(coll,n,val);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._assoc_n[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,n,val) : m__4348__auto__.call(null,coll,n,val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._assoc_n["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,n,val) : m__4348__auto____$1.call(null,coll,n,val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IVector.-assoc-n",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding dereference functionality to a reference.
|
|
* @interface
|
|
*/
|
|
cljs.core.IDeref = function(){};
|
|
|
|
/**
|
|
* Returns the value of the reference o.
|
|
*/
|
|
cljs.core._deref = (function cljs$core$_deref(o){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IDeref$_deref$arity$1 == null)))))){
|
|
return o.cljs$core$IDeref$_deref$arity$1(o);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._deref[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto__.call(null,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._deref["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto____$1.call(null,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IDeref.-deref",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* @interface
|
|
*/
|
|
cljs.core.IDerefWithTimeout = function(){};
|
|
|
|
cljs.core._deref_with_timeout = (function cljs$core$_deref_with_timeout(o,msec,timeout_val){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IDerefWithTimeout$_deref_with_timeout$arity$3 == null)))))){
|
|
return o.cljs$core$IDerefWithTimeout$_deref_with_timeout$arity$3(o,msec,timeout_val);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._deref_with_timeout[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(o,msec,timeout_val) : m__4348__auto__.call(null,o,msec,timeout_val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._deref_with_timeout["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(o,msec,timeout_val) : m__4348__auto____$1.call(null,o,msec,timeout_val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IDerefWithTimeout.-deref-with-timeout",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for accessing the metadata of an object.
|
|
* @interface
|
|
*/
|
|
cljs.core.IMeta = function(){};
|
|
|
|
/**
|
|
* Returns the metadata of object o.
|
|
*/
|
|
cljs.core._meta = (function cljs$core$_meta(o){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IMeta$_meta$arity$1 == null)))))){
|
|
return o.cljs$core$IMeta$_meta$arity$1(o);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._meta[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto__.call(null,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._meta["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto____$1.call(null,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMeta.-meta",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding metadata to an object.
|
|
* @interface
|
|
*/
|
|
cljs.core.IWithMeta = function(){};
|
|
|
|
/**
|
|
* Returns a new object with value of o and metadata meta added to it.
|
|
*/
|
|
cljs.core._with_meta = (function cljs$core$_with_meta(o,meta){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IWithMeta$_with_meta$arity$2 == null)))))){
|
|
return o.cljs$core$IWithMeta$_with_meta$arity$2(o,meta);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._with_meta[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,meta) : m__4348__auto__.call(null,o,meta));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._with_meta["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,meta) : m__4348__auto____$1.call(null,o,meta));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWithMeta.-with-meta",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for seq types that can reduce themselves.
|
|
* Called by cljs.core/reduce.
|
|
* @interface
|
|
*/
|
|
cljs.core.IReduce = function(){};
|
|
|
|
/**
|
|
* f should be a function of 2 arguments. If start is not supplied,
|
|
* returns the result of applying f to the first 2 items in coll, then
|
|
* applying f to that result and the 3rd item, etc.
|
|
*/
|
|
cljs.core._reduce = (function cljs$core$_reduce(var_args){
|
|
var G__628 = arguments.length;
|
|
switch (G__628) {
|
|
case 2:
|
|
return cljs.core._reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._reduce.cljs$core$IFn$_invoke$arity$2 = (function (coll,f){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IReduce$_reduce$arity$2 == null)))))){
|
|
return coll.cljs$core$IReduce$_reduce$arity$2(coll,f);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._reduce[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,f) : m__4348__auto__.call(null,coll,f));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._reduce["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,f) : m__4348__auto____$1.call(null,coll,f));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IReduce.-reduce",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._reduce.cljs$core$IFn$_invoke$arity$3 = (function (coll,f,start){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IReduce$_reduce$arity$3 == null)))))){
|
|
return coll.cljs$core$IReduce$_reduce$arity$3(coll,f,start);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._reduce[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,f,start) : m__4348__auto__.call(null,coll,f,start));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._reduce["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,f,start) : m__4348__auto____$1.call(null,coll,f,start));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IReduce.-reduce",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._reduce.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
|
|
/**
|
|
* Protocol for associative types that can reduce themselves
|
|
* via a function of key and val. Called by cljs.core/reduce-kv.
|
|
* @interface
|
|
*/
|
|
cljs.core.IKVReduce = function(){};
|
|
|
|
/**
|
|
* Reduces an associative collection and returns the result. f should be
|
|
* a function that takes three arguments.
|
|
*/
|
|
cljs.core._kv_reduce = (function cljs$core$_kv_reduce(coll,f,init){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IKVReduce$_kv_reduce$arity$3 == null)))))){
|
|
return coll.cljs$core$IKVReduce$_kv_reduce$arity$3(coll,f,init);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._kv_reduce[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,f,init) : m__4348__auto__.call(null,coll,f,init));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._kv_reduce["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,f,init) : m__4348__auto____$1.call(null,coll,f,init));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IKVReduce.-kv-reduce",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding value comparison functionality to a type.
|
|
* @interface
|
|
*/
|
|
cljs.core.IEquiv = function(){};
|
|
|
|
/**
|
|
* Returns true if o and other are equal, false otherwise.
|
|
*/
|
|
cljs.core._equiv = (function cljs$core$_equiv(o,other){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IEquiv$_equiv$arity$2 == null)))))){
|
|
return o.cljs$core$IEquiv$_equiv$arity$2(o,other);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._equiv[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,other) : m__4348__auto__.call(null,o,other));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._equiv["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,other) : m__4348__auto____$1.call(null,o,other));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEquiv.-equiv",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding hashing functionality to a type.
|
|
* @interface
|
|
*/
|
|
cljs.core.IHash = function(){};
|
|
|
|
/**
|
|
* Returns the hash code of o.
|
|
*/
|
|
cljs.core._hash = (function cljs$core$_hash(o){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IHash$_hash$arity$1 == null)))))){
|
|
return o.cljs$core$IHash$_hash$arity$1(o);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._hash[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto__.call(null,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._hash["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto____$1.call(null,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IHash.-hash",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding the ability to a type to be transformed into a sequence.
|
|
* @interface
|
|
*/
|
|
cljs.core.ISeqable = function(){};
|
|
|
|
/**
|
|
* Returns a seq of o, or nil if o is empty.
|
|
*/
|
|
cljs.core._seq = (function cljs$core$_seq(o){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ISeqable$_seq$arity$1 == null)))))){
|
|
return o.cljs$core$ISeqable$_seq$arity$1(o);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._seq[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto__.call(null,o));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._seq["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(o) : m__4348__auto____$1.call(null,o));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISeqable.-seq",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Marker interface indicating a persistent collection of sequential items
|
|
* @interface
|
|
*/
|
|
cljs.core.ISequential = function(){};
|
|
|
|
|
|
/**
|
|
* Marker interface indicating a persistent list
|
|
* @interface
|
|
*/
|
|
cljs.core.IList = function(){};
|
|
|
|
|
|
/**
|
|
* Marker interface indicating a record object
|
|
* @interface
|
|
*/
|
|
cljs.core.IRecord = function(){};
|
|
|
|
|
|
/**
|
|
* Protocol for reversing a seq.
|
|
* @interface
|
|
*/
|
|
cljs.core.IReversible = function(){};
|
|
|
|
/**
|
|
* Returns a seq of the items in coll in reversed order.
|
|
*/
|
|
cljs.core._rseq = (function cljs$core$_rseq(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IReversible$_rseq$arity$1 == null)))))){
|
|
return coll.cljs$core$IReversible$_rseq$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._rseq[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._rseq["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IReversible.-rseq",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for a collection which can represent their items
|
|
* in a sorted manner.
|
|
* @interface
|
|
*/
|
|
cljs.core.ISorted = function(){};
|
|
|
|
/**
|
|
* Returns a sorted seq from coll in either ascending or descending order.
|
|
*/
|
|
cljs.core._sorted_seq = (function cljs$core$_sorted_seq(coll,ascending_QMARK_){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISorted$_sorted_seq$arity$2 == null)))))){
|
|
return coll.cljs$core$ISorted$_sorted_seq$arity$2(coll,ascending_QMARK_);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._sorted_seq[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,ascending_QMARK_) : m__4348__auto__.call(null,coll,ascending_QMARK_));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._sorted_seq["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,ascending_QMARK_) : m__4348__auto____$1.call(null,coll,ascending_QMARK_));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISorted.-sorted-seq",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns a sorted seq from coll in either ascending or descending order.
|
|
* If ascending is true, the result should contain all items which are > or >=
|
|
* than k. If ascending is false, the result should contain all items which
|
|
* are < or <= than k, e.g.
|
|
* (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 true) => (3 4 5)
|
|
* (-sorted-seq-from (sorted-set 1 2 3 4 5) 3 false) => (3 2 1)
|
|
*/
|
|
cljs.core._sorted_seq_from = (function cljs$core$_sorted_seq_from(coll,k,ascending_QMARK_){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISorted$_sorted_seq_from$arity$3 == null)))))){
|
|
return coll.cljs$core$ISorted$_sorted_seq_from$arity$3(coll,k,ascending_QMARK_);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._sorted_seq_from[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(coll,k,ascending_QMARK_) : m__4348__auto__.call(null,coll,k,ascending_QMARK_));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._sorted_seq_from["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(coll,k,ascending_QMARK_) : m__4348__auto____$1.call(null,coll,k,ascending_QMARK_));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISorted.-sorted-seq-from",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns the key for entry.
|
|
*/
|
|
cljs.core._entry_key = (function cljs$core$_entry_key(coll,entry){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISorted$_entry_key$arity$2 == null)))))){
|
|
return coll.cljs$core$ISorted$_entry_key$arity$2(coll,entry);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._entry_key[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(coll,entry) : m__4348__auto__.call(null,coll,entry));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._entry_key["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(coll,entry) : m__4348__auto____$1.call(null,coll,entry));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISorted.-entry-key",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns the comparator for coll.
|
|
*/
|
|
cljs.core._comparator = (function cljs$core$_comparator(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$ISorted$_comparator$arity$1 == null)))))){
|
|
return coll.cljs$core$ISorted$_comparator$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._comparator[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._comparator["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISorted.-comparator",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for writing. Currently only implemented by StringBufferWriter.
|
|
* @interface
|
|
*/
|
|
cljs.core.IWriter = function(){};
|
|
|
|
/**
|
|
* Writes s with writer and returns the result.
|
|
*/
|
|
cljs.core._write = (function cljs$core$_write(writer,s){
|
|
if((((!((writer == null)))) && ((!((writer.cljs$core$IWriter$_write$arity$2 == null)))))){
|
|
return writer.cljs$core$IWriter$_write$arity$2(writer,s);
|
|
} else {
|
|
var x__4347__auto__ = (((writer == null))?null:writer);
|
|
var m__4348__auto__ = (cljs.core._write[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(writer,s) : m__4348__auto__.call(null,writer,s));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._write["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(writer,s) : m__4348__auto____$1.call(null,writer,s));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWriter.-write",writer);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Flush writer.
|
|
*/
|
|
cljs.core._flush = (function cljs$core$_flush(writer){
|
|
if((((!((writer == null)))) && ((!((writer.cljs$core$IWriter$_flush$arity$1 == null)))))){
|
|
return writer.cljs$core$IWriter$_flush$arity$1(writer);
|
|
} else {
|
|
var x__4347__auto__ = (((writer == null))?null:writer);
|
|
var m__4348__auto__ = (cljs.core._flush[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(writer) : m__4348__auto__.call(null,writer));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._flush["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(writer) : m__4348__auto____$1.call(null,writer));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWriter.-flush",writer);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* The old IPrintable protocol's implementation consisted of building a giant
|
|
* list of strings to concatenate. This involved lots of concat calls,
|
|
* intermediate vectors, and lazy-seqs, and was very slow in some older JS
|
|
* engines. IPrintWithWriter implements printing via the IWriter protocol, so it
|
|
* be implemented efficiently in terms of e.g. a StringBuffer append.
|
|
* @interface
|
|
*/
|
|
cljs.core.IPrintWithWriter = function(){};
|
|
|
|
cljs.core._pr_writer = (function cljs$core$_pr_writer(o,writer,opts){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IPrintWithWriter$_pr_writer$arity$3 == null)))))){
|
|
return o.cljs$core$IPrintWithWriter$_pr_writer$arity$3(o,writer,opts);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._pr_writer[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(o,writer,opts) : m__4348__auto__.call(null,o,writer,opts));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._pr_writer["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(o,writer,opts) : m__4348__auto____$1.call(null,o,writer,opts));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IPrintWithWriter.-pr-writer",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for types which can have a deferred realization. Currently only
|
|
* implemented by Delay and LazySeq.
|
|
* @interface
|
|
*/
|
|
cljs.core.IPending = function(){};
|
|
|
|
/**
|
|
* Returns true if a value for x has been produced, false otherwise.
|
|
*/
|
|
cljs.core._realized_QMARK_ = (function cljs$core$_realized_QMARK_(x){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$IPending$_realized_QMARK_$arity$1 == null)))))){
|
|
return x.cljs$core$IPending$_realized_QMARK_$arity$1(x);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._realized_QMARK_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto__.call(null,x));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._realized_QMARK_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto____$1.call(null,x));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IPending.-realized?",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for types that can be watched. Currently only implemented by Atom.
|
|
* @interface
|
|
*/
|
|
cljs.core.IWatchable = function(){};
|
|
|
|
/**
|
|
* Calls all watchers with this, oldval and newval.
|
|
*/
|
|
cljs.core._notify_watches = (function cljs$core$_notify_watches(this$,oldval,newval){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IWatchable$_notify_watches$arity$3 == null)))))){
|
|
return this$.cljs$core$IWatchable$_notify_watches$arity$3(this$,oldval,newval);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._notify_watches[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(this$,oldval,newval) : m__4348__auto__.call(null,this$,oldval,newval));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._notify_watches["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,oldval,newval) : m__4348__auto____$1.call(null,this$,oldval,newval));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWatchable.-notify-watches",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Adds a watcher function f to this. Keys must be unique per reference,
|
|
* and can be used to remove the watch with -remove-watch.
|
|
*/
|
|
cljs.core._add_watch = (function cljs$core$_add_watch(this$,key,f){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IWatchable$_add_watch$arity$3 == null)))))){
|
|
return this$.cljs$core$IWatchable$_add_watch$arity$3(this$,key,f);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._add_watch[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(this$,key,f) : m__4348__auto__.call(null,this$,key,f));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._add_watch["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(this$,key,f) : m__4348__auto____$1.call(null,this$,key,f));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWatchable.-add-watch",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Removes watcher that corresponds to key from this.
|
|
*/
|
|
cljs.core._remove_watch = (function cljs$core$_remove_watch(this$,key){
|
|
if((((!((this$ == null)))) && ((!((this$.cljs$core$IWatchable$_remove_watch$arity$2 == null)))))){
|
|
return this$.cljs$core$IWatchable$_remove_watch$arity$2(this$,key);
|
|
} else {
|
|
var x__4347__auto__ = (((this$ == null))?null:this$);
|
|
var m__4348__auto__ = (cljs.core._remove_watch[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(this$,key) : m__4348__auto__.call(null,this$,key));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._remove_watch["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(this$,key) : m__4348__auto____$1.call(null,this$,key));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IWatchable.-remove-watch",this$);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for collections which can transformed to transients.
|
|
* @interface
|
|
*/
|
|
cljs.core.IEditableCollection = function(){};
|
|
|
|
/**
|
|
* Returns a new, transient version of the collection, in constant time.
|
|
*/
|
|
cljs.core._as_transient = (function cljs$core$_as_transient(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IEditableCollection$_as_transient$arity$1 == null)))))){
|
|
return coll.cljs$core$IEditableCollection$_as_transient$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._as_transient[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._as_transient["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEditableCollection.-as-transient",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding basic functionality to transient collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.ITransientCollection = function(){};
|
|
|
|
/**
|
|
* Adds value val to tcoll and returns tcoll.
|
|
*/
|
|
cljs.core._conj_BANG_ = (function cljs$core$_conj_BANG_(tcoll,val){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientCollection$_conj_BANG_$arity$2 == null)))))){
|
|
return tcoll.cljs$core$ITransientCollection$_conj_BANG_$arity$2(tcoll,val);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._conj_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,val) : m__4348__auto__.call(null,tcoll,val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._conj_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,val) : m__4348__auto____$1.call(null,tcoll,val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientCollection.-conj!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Creates a persistent data structure from tcoll and returns it.
|
|
*/
|
|
cljs.core._persistent_BANG_ = (function cljs$core$_persistent_BANG_(tcoll){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 == null)))))){
|
|
return tcoll.cljs$core$ITransientCollection$_persistent_BANG_$arity$1(tcoll);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._persistent_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4348__auto__.call(null,tcoll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._persistent_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4348__auto____$1.call(null,tcoll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientCollection.-persistent!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding associativity to transient collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.ITransientAssociative = function(){};
|
|
|
|
/**
|
|
* Returns a new transient collection of tcoll with a mapping from key to
|
|
* val added to it.
|
|
*/
|
|
cljs.core._assoc_BANG_ = (function cljs$core$_assoc_BANG_(tcoll,key,val){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 == null)))))){
|
|
return tcoll.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(tcoll,key,val);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._assoc_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(tcoll,key,val) : m__4348__auto__.call(null,tcoll,key,val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._assoc_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(tcoll,key,val) : m__4348__auto____$1.call(null,tcoll,key,val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientAssociative.-assoc!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding mapping functionality to transient collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.ITransientMap = function(){};
|
|
|
|
/**
|
|
* Returns a new transient collection of tcoll without the mapping for key.
|
|
*/
|
|
cljs.core._dissoc_BANG_ = (function cljs$core$_dissoc_BANG_(tcoll,key){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 == null)))))){
|
|
return tcoll.cljs$core$ITransientMap$_dissoc_BANG_$arity$2(tcoll,key);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._dissoc_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,key) : m__4348__auto__.call(null,tcoll,key));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._dissoc_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,key) : m__4348__auto____$1.call(null,tcoll,key));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientMap.-dissoc!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding vector functionality to transient collections.
|
|
* @interface
|
|
*/
|
|
cljs.core.ITransientVector = function(){};
|
|
|
|
/**
|
|
* Returns tcoll with value val added at position n.
|
|
*/
|
|
cljs.core._assoc_n_BANG_ = (function cljs$core$_assoc_n_BANG_(tcoll,n,val){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3 == null)))))){
|
|
return tcoll.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3(tcoll,n,val);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._assoc_n_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(tcoll,n,val) : m__4348__auto__.call(null,tcoll,n,val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._assoc_n_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(tcoll,n,val) : m__4348__auto____$1.call(null,tcoll,n,val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientVector.-assoc-n!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns tcoll with the last item removed from it.
|
|
*/
|
|
cljs.core._pop_BANG_ = (function cljs$core$_pop_BANG_(tcoll){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientVector$_pop_BANG_$arity$1 == null)))))){
|
|
return tcoll.cljs$core$ITransientVector$_pop_BANG_$arity$1(tcoll);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._pop_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4348__auto__.call(null,tcoll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._pop_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(tcoll) : m__4348__auto____$1.call(null,tcoll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientVector.-pop!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding set functionality to a transient collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.ITransientSet = function(){};
|
|
|
|
/**
|
|
* Returns tcoll without v.
|
|
*/
|
|
cljs.core._disjoin_BANG_ = (function cljs$core$_disjoin_BANG_(tcoll,v){
|
|
if((((!((tcoll == null)))) && ((!((tcoll.cljs$core$ITransientSet$_disjoin_BANG_$arity$2 == null)))))){
|
|
return tcoll.cljs$core$ITransientSet$_disjoin_BANG_$arity$2(tcoll,v);
|
|
} else {
|
|
var x__4347__auto__ = (((tcoll == null))?null:tcoll);
|
|
var m__4348__auto__ = (cljs.core._disjoin_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(tcoll,v) : m__4348__auto__.call(null,tcoll,v));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._disjoin_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(tcoll,v) : m__4348__auto____$1.call(null,tcoll,v));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ITransientSet.-disjoin!",tcoll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for values that can be compared.
|
|
* @interface
|
|
*/
|
|
cljs.core.IComparable = function(){};
|
|
|
|
/**
|
|
* Returns a negative number, zero, or a positive number when x is logically
|
|
* 'less than', 'equal to', or 'greater than' y.
|
|
*/
|
|
cljs.core._compare = (function cljs$core$_compare(x,y){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$IComparable$_compare$arity$2 == null)))))){
|
|
return x.cljs$core$IComparable$_compare$arity$2(x,y);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._compare[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(x,y) : m__4348__auto__.call(null,x,y));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._compare["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(x,y) : m__4348__auto____$1.call(null,x,y));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IComparable.-compare",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for accessing the items of a chunk.
|
|
* @interface
|
|
*/
|
|
cljs.core.IChunk = function(){};
|
|
|
|
/**
|
|
* Return a new chunk of coll with the first item removed.
|
|
*/
|
|
cljs.core._drop_first = (function cljs$core$_drop_first(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IChunk$_drop_first$arity$1 == null)))))){
|
|
return coll.cljs$core$IChunk$_drop_first$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._drop_first[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._drop_first["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IChunk.-drop-first",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for accessing a collection as sequential chunks.
|
|
* @interface
|
|
*/
|
|
cljs.core.IChunkedSeq = function(){};
|
|
|
|
/**
|
|
* Returns the first chunk in coll.
|
|
*/
|
|
cljs.core._chunked_first = (function cljs$core$_chunked_first(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IChunkedSeq$_chunked_first$arity$1 == null)))))){
|
|
return coll.cljs$core$IChunkedSeq$_chunked_first$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._chunked_first[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._chunked_first["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IChunkedSeq.-chunked-first",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Return a new collection of coll with the first chunk removed.
|
|
*/
|
|
cljs.core._chunked_rest = (function cljs$core$_chunked_rest(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IChunkedSeq$_chunked_rest$arity$1 == null)))))){
|
|
return coll.cljs$core$IChunkedSeq$_chunked_rest$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._chunked_rest[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._chunked_rest["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IChunkedSeq.-chunked-rest",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for accessing the chunks of a collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.IChunkedNext = function(){};
|
|
|
|
/**
|
|
* Returns a new collection of coll without the first chunk.
|
|
*/
|
|
cljs.core._chunked_next = (function cljs$core$_chunked_next(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IChunkedNext$_chunked_next$arity$1 == null)))))){
|
|
return coll.cljs$core$IChunkedNext$_chunked_next$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._chunked_next[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._chunked_next["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IChunkedNext.-chunked-next",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding a name.
|
|
* @interface
|
|
*/
|
|
cljs.core.INamed = function(){};
|
|
|
|
/**
|
|
* Returns the name String of x.
|
|
*/
|
|
cljs.core._name = (function cljs$core$_name(x){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$INamed$_name$arity$1 == null)))))){
|
|
return x.cljs$core$INamed$_name$arity$1(x);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._name[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto__.call(null,x));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._name["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto____$1.call(null,x));
|
|
} else {
|
|
throw cljs.core.missing_protocol("INamed.-name",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Returns the namespace String of x.
|
|
*/
|
|
cljs.core._namespace = (function cljs$core$_namespace(x){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$INamed$_namespace$arity$1 == null)))))){
|
|
return x.cljs$core$INamed$_namespace$arity$1(x);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._namespace[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto__.call(null,x));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._namespace["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto____$1.call(null,x));
|
|
} else {
|
|
throw cljs.core.missing_protocol("INamed.-namespace",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Marker protocol indicating an atom.
|
|
* @interface
|
|
*/
|
|
cljs.core.IAtom = function(){};
|
|
|
|
|
|
/**
|
|
* Protocol for adding resetting functionality.
|
|
* @interface
|
|
*/
|
|
cljs.core.IReset = function(){};
|
|
|
|
/**
|
|
* Sets the value of o to new-value.
|
|
*/
|
|
cljs.core._reset_BANG_ = (function cljs$core$_reset_BANG_(o,new_value){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IReset$_reset_BANG_$arity$2 == null)))))){
|
|
return o.cljs$core$IReset$_reset_BANG_$arity$2(o,new_value);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._reset_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4348__auto__.call(null,o,new_value));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._reset_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4348__auto____$1.call(null,o,new_value));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IReset.-reset!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for adding swapping functionality.
|
|
* @interface
|
|
*/
|
|
cljs.core.ISwap = function(){};
|
|
|
|
/**
|
|
* Swaps the value of o to be (apply f current-value-of-atom args).
|
|
*/
|
|
cljs.core._swap_BANG_ = (function cljs$core$_swap_BANG_(var_args){
|
|
var G__631 = arguments.length;
|
|
switch (G__631) {
|
|
case 2:
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (o,f){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ISwap$_swap_BANG_$arity$2 == null)))))){
|
|
return o.cljs$core$ISwap$_swap_BANG_$arity$2(o,f);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,f) : m__4348__auto__.call(null,o,f));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._swap_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,f) : m__4348__auto____$1.call(null,o,f));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISwap.-swap!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (o,f,a){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ISwap$_swap_BANG_$arity$3 == null)))))){
|
|
return o.cljs$core$ISwap$_swap_BANG_$arity$3(o,f,a);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(o,f,a) : m__4348__auto__.call(null,o,f,a));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._swap_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(o,f,a) : m__4348__auto____$1.call(null,o,f,a));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISwap.-swap!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (o,f,a,b){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ISwap$_swap_BANG_$arity$4 == null)))))){
|
|
return o.cljs$core$ISwap$_swap_BANG_$arity$4(o,f,a,b);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$4 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$4(o,f,a,b) : m__4348__auto__.call(null,o,f,a,b));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._swap_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$4 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$4(o,f,a,b) : m__4348__auto____$1.call(null,o,f,a,b));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISwap.-swap!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5 = (function (o,f,a,b,xs){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$ISwap$_swap_BANG_$arity$5 == null)))))){
|
|
return o.cljs$core$ISwap$_swap_BANG_$arity$5(o,f,a,b,xs);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._swap_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$5 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$5(o,f,a,b,xs) : m__4348__auto__.call(null,o,f,a,b,xs));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._swap_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$5 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$5(o,f,a,b,xs) : m__4348__auto____$1.call(null,o,f,a,b,xs));
|
|
} else {
|
|
throw cljs.core.missing_protocol("ISwap.-swap!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._swap_BANG_.cljs$lang$maxFixedArity = 5;
|
|
|
|
|
|
|
|
/**
|
|
* Protocol for adding volatile functionality.
|
|
* @interface
|
|
*/
|
|
cljs.core.IVolatile = function(){};
|
|
|
|
/**
|
|
* Sets the value of volatile o to new-value without regard for the
|
|
* current value. Returns new-value.
|
|
*/
|
|
cljs.core._vreset_BANG_ = (function cljs$core$_vreset_BANG_(o,new_value){
|
|
if((((!((o == null)))) && ((!((o.cljs$core$IVolatile$_vreset_BANG_$arity$2 == null)))))){
|
|
return o.cljs$core$IVolatile$_vreset_BANG_$arity$2(o,new_value);
|
|
} else {
|
|
var x__4347__auto__ = (((o == null))?null:o);
|
|
var m__4348__auto__ = (cljs.core._vreset_BANG_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4348__auto__.call(null,o,new_value));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._vreset_BANG_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(o,new_value) : m__4348__auto____$1.call(null,o,new_value));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IVolatile.-vreset!",o);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Protocol for iterating over a collection.
|
|
* @interface
|
|
*/
|
|
cljs.core.IIterable = function(){};
|
|
|
|
/**
|
|
* Returns an iterator for coll.
|
|
*/
|
|
cljs.core._iterator = (function cljs$core$_iterator(coll){
|
|
if((((!((coll == null)))) && ((!((coll.cljs$core$IIterable$_iterator$arity$1 == null)))))){
|
|
return coll.cljs$core$IIterable$_iterator$arity$1(coll);
|
|
} else {
|
|
var x__4347__auto__ = (((coll == null))?null:coll);
|
|
var m__4348__auto__ = (cljs.core._iterator[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto__.call(null,coll));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._iterator["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(coll) : m__4348__auto____$1.call(null,coll));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IIterable.-iterator",coll);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IWriter}
|
|
*/
|
|
cljs.core.StringBufferWriter = (function (sb){
|
|
this.sb = sb;
|
|
this.cljs$lang$protocol_mask$partition0$ = 1073741824;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.StringBufferWriter.prototype.cljs$core$IWriter$_write$arity$2 = (function (_,s){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.sb.append(s);
|
|
});
|
|
|
|
cljs.core.StringBufferWriter.prototype.cljs$core$IWriter$_flush$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.StringBufferWriter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$sb], null);
|
|
});
|
|
|
|
cljs.core.StringBufferWriter.cljs$lang$type = true;
|
|
|
|
cljs.core.StringBufferWriter.cljs$lang$ctorStr = "cljs.core/StringBufferWriter";
|
|
|
|
cljs.core.StringBufferWriter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/StringBufferWriter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/StringBufferWriter.
|
|
*/
|
|
cljs.core.__GT_StringBufferWriter = (function cljs$core$__GT_StringBufferWriter(sb){
|
|
return (new cljs.core.StringBufferWriter(sb));
|
|
});
|
|
|
|
/**
|
|
* Support so that collections can implement toString without
|
|
* loading all the printing machinery.
|
|
*/
|
|
cljs.core.pr_str_STAR_ = (function cljs$core$pr_str_STAR_(obj){
|
|
var sb = (new goog.string.StringBuffer());
|
|
var writer = (new cljs.core.StringBufferWriter(sb));
|
|
obj.cljs$core$IPrintWithWriter$_pr_writer$arity$3(null,writer,cljs.core.pr_opts());
|
|
|
|
writer.cljs$core$IWriter$_flush$arity$1(null);
|
|
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb);
|
|
});
|
|
cljs.core.int_rotate_left = (function cljs$core$int_rotate_left(x,n){
|
|
return ((x << n) | (x >>> (- n)));
|
|
});
|
|
if((((typeof Math !== 'undefined') && (typeof Math.imul !== 'undefined')) && ((!((Math.imul((4294967295),(5)) === (0))))))){
|
|
cljs.core.imul = (function cljs$core$imul(a,b){
|
|
return Math.imul(a,b);
|
|
});
|
|
} else {
|
|
cljs.core.imul = (function cljs$core$imul(a,b){
|
|
var ah = ((a >>> (16)) & (65535));
|
|
var al = (a & (65535));
|
|
var bh = ((b >>> (16)) & (65535));
|
|
var bl = (b & (65535));
|
|
return (((al * bl) + ((((ah * bl) + (al * bh)) << (16)) >>> (0))) | (0));
|
|
});
|
|
}
|
|
cljs.core.m3_seed = (0);
|
|
cljs.core.m3_C1 = ((3432918353) | (0));
|
|
cljs.core.m3_C2 = ((461845907) | (0));
|
|
cljs.core.m3_mix_K1 = (function cljs$core$m3_mix_K1(k1){
|
|
return cljs.core.imul(cljs.core.int_rotate_left(cljs.core.imul((k1 | (0)),cljs.core.m3_C1),(15)),cljs.core.m3_C2);
|
|
});
|
|
cljs.core.m3_mix_H1 = (function cljs$core$m3_mix_H1(h1,k1){
|
|
return ((cljs.core.imul(cljs.core.int_rotate_left(((h1 | (0)) ^ (k1 | (0))),(13)),(5)) + ((3864292196) | (0))) | (0));
|
|
});
|
|
cljs.core.m3_fmix = (function cljs$core$m3_fmix(h1,len){
|
|
var h1__$1 = (h1 | (0));
|
|
var h1__$2 = (h1__$1 ^ len);
|
|
var h1__$3 = (h1__$2 ^ (h1__$2 >>> (16)));
|
|
var h1__$4 = cljs.core.imul(h1__$3,((2246822507) | (0)));
|
|
var h1__$5 = (h1__$4 ^ (h1__$4 >>> (13)));
|
|
var h1__$6 = cljs.core.imul(h1__$5,((3266489909) | (0)));
|
|
return (h1__$6 ^ (h1__$6 >>> (16)));
|
|
});
|
|
cljs.core.m3_hash_int = (function cljs$core$m3_hash_int(in$){
|
|
if((in$ === (0))){
|
|
return in$;
|
|
} else {
|
|
var k1 = cljs.core.m3_mix_K1(in$);
|
|
var h1 = cljs.core.m3_mix_H1(cljs.core.m3_seed,k1);
|
|
return cljs.core.m3_fmix(h1,(4));
|
|
}
|
|
});
|
|
cljs.core.m3_hash_unencoded_chars = (function cljs$core$m3_hash_unencoded_chars(in$){
|
|
var h1 = (function (){var i = (1);
|
|
var h1 = cljs.core.m3_seed;
|
|
while(true){
|
|
if((i < in$.length)){
|
|
var G__633 = (i + (2));
|
|
var G__634 = cljs.core.m3_mix_H1(h1,cljs.core.m3_mix_K1((in$.charCodeAt((i - (1))) | (in$.charCodeAt(i) << (16)))));
|
|
i = G__633;
|
|
h1 = G__634;
|
|
continue;
|
|
} else {
|
|
return h1;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
var h1__$1 = ((((in$.length & (1)) === (1)))?(h1 ^ cljs.core.m3_mix_K1(in$.charCodeAt((in$.length - (1))))):h1);
|
|
return cljs.core.m3_fmix(h1__$1,cljs.core.imul((2),in$.length));
|
|
});
|
|
|
|
|
|
|
|
cljs.core.string_hash_cache = {};
|
|
cljs.core.string_hash_cache_count = (0);
|
|
cljs.core.hash_string_STAR_ = (function cljs$core$hash_string_STAR_(s){
|
|
if((!((s == null)))){
|
|
var len = s.length;
|
|
if((len > (0))){
|
|
var i = (0);
|
|
var hash = (0);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__637 = (i + (1));
|
|
var G__638 = (cljs.core.imul((31),hash) + s.charCodeAt(i));
|
|
i = G__637;
|
|
hash = G__638;
|
|
continue;
|
|
} else {
|
|
return hash;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return (0);
|
|
}
|
|
} else {
|
|
return (0);
|
|
}
|
|
});
|
|
cljs.core.add_to_string_hash_cache = (function cljs$core$add_to_string_hash_cache(k){
|
|
var h = cljs.core.hash_string_STAR_(k);
|
|
goog.object.set(cljs.core.string_hash_cache,k,h);
|
|
|
|
cljs.core.string_hash_cache_count = (cljs.core.string_hash_cache_count + (1));
|
|
|
|
return h;
|
|
});
|
|
cljs.core.hash_string = (function cljs$core$hash_string(k){
|
|
if((cljs.core.string_hash_cache_count > (255))){
|
|
cljs.core.string_hash_cache = {};
|
|
|
|
cljs.core.string_hash_cache_count = (0);
|
|
} else {
|
|
}
|
|
|
|
if((k == null)){
|
|
return (0);
|
|
} else {
|
|
var h = (cljs.core.string_hash_cache[k]);
|
|
if(typeof h === 'number'){
|
|
return h;
|
|
} else {
|
|
return cljs.core.add_to_string_hash_cache(k);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the hash code of its argument. Note this is the hash code
|
|
* consistent with =.
|
|
*/
|
|
cljs.core.hash = (function cljs$core$hash(o){
|
|
if((((!((o == null))))?(((((o.cljs$lang$protocol_mask$partition0$ & (4194304))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IHash$))))?true:false):false)){
|
|
return (o.cljs$core$IHash$_hash$arity$1(null) ^ (0));
|
|
} else {
|
|
if(typeof o === 'number'){
|
|
if(cljs.core.truth_(isFinite(o))){
|
|
return (Math.floor(o) % (2147483647));
|
|
} else {
|
|
var G__642 = o;
|
|
switch (G__642) {
|
|
case Infinity:
|
|
return (2146435072);
|
|
|
|
break;
|
|
case -Infinity:
|
|
return (-1048576);
|
|
|
|
break;
|
|
default:
|
|
return (2146959360);
|
|
|
|
}
|
|
}
|
|
} else {
|
|
if(o === true){
|
|
return (1231);
|
|
} else {
|
|
if(o === false){
|
|
return (1237);
|
|
} else {
|
|
if(typeof o === 'string'){
|
|
return cljs.core.m3_hash_int(cljs.core.hash_string(o));
|
|
} else {
|
|
if((o instanceof Date)){
|
|
return (o.valueOf() ^ (0));
|
|
} else {
|
|
if((o == null)){
|
|
return (0);
|
|
} else {
|
|
return (cljs.core._hash(o) ^ (0));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.hash_combine = (function cljs$core$hash_combine(seed,hash){
|
|
return (seed ^ (((hash + (2654435769)) + (seed << (6))) + (seed >> (2))));
|
|
});
|
|
/**
|
|
* Evaluates x and tests if it is an instance of the type
|
|
* c. Returns true or false
|
|
*/
|
|
cljs.core.instance_QMARK_ = (function cljs$core$instance_QMARK_(c,x){
|
|
return (x instanceof c);
|
|
});
|
|
/**
|
|
* Return true if x is a Symbol
|
|
*/
|
|
cljs.core.symbol_QMARK_ = (function cljs$core$symbol_QMARK_(x){
|
|
return (x instanceof cljs.core.Symbol);
|
|
});
|
|
cljs.core.hash_symbol = (function cljs$core$hash_symbol(sym){
|
|
return cljs.core.hash_combine(cljs.core.m3_hash_unencoded_chars(sym.name),cljs.core.hash_string(sym.ns));
|
|
});
|
|
cljs.core.compare_symbols = (function cljs$core$compare_symbols(a,b){
|
|
if((a.str === b.str)){
|
|
return (0);
|
|
} else {
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = cljs.core.not(a.ns);
|
|
if(and__4036__auto__){
|
|
return b.ns;
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
return (-1);
|
|
} else {
|
|
if(cljs.core.truth_(a.ns)){
|
|
if(cljs.core.not(b.ns)){
|
|
return (1);
|
|
} else {
|
|
var nsc = (function (){var G__644 = a.ns;
|
|
var G__645 = b.ns;
|
|
return goog.array.defaultCompare(G__644,G__645);
|
|
})();
|
|
if(((0) === nsc)){
|
|
var G__646 = a.name;
|
|
var G__647 = b.name;
|
|
return goog.array.defaultCompare(G__646,G__647);
|
|
} else {
|
|
return nsc;
|
|
}
|
|
}
|
|
} else {
|
|
var G__648 = a.name;
|
|
var G__649 = b.name;
|
|
return goog.array.defaultCompare(G__648,G__649);
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.INamed}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.Symbol = (function (ns,name,str,_hash,_meta){
|
|
this.ns = ns;
|
|
this.name = name;
|
|
this.str = str;
|
|
this._hash = _hash;
|
|
this._meta = _meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2154168321;
|
|
this.cljs$lang$protocol_mask$partition1$ = 4096;
|
|
});
|
|
cljs.core.Symbol.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.str;
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if((other instanceof cljs.core.Symbol)){
|
|
return (self__.str === other.str);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.call = (function() {
|
|
var G__651 = null;
|
|
var G__651__2 = (function (self__,coll){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var sym = self____$1;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,sym);
|
|
});
|
|
var G__651__3 = (function (self__,coll,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var sym = self____$1;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,sym,not_found);
|
|
});
|
|
G__651 = function(self__,coll,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__651__2.call(this,self__,coll);
|
|
case 3:
|
|
return G__651__3.call(this,self__,coll,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__651.cljs$core$IFn$_invoke$arity$2 = G__651__2;
|
|
G__651.cljs$core$IFn$_invoke$arity$3 = G__651__3;
|
|
return G__651;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Symbol.prototype.apply = (function (self__,args650){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args650)));
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var sym = this;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,sym);
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IFn$_invoke$arity$2 = (function (coll,not_found){
|
|
var self__ = this;
|
|
var sym = this;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,sym,not_found);
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__._meta;
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.Symbol(self__.ns,self__.name,self__.str,self__._hash,new_meta));
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IHash$_hash$arity$1 = (function (sym){
|
|
var self__ = this;
|
|
var sym__$1 = this;
|
|
var h__4159__auto__ = self__._hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_symbol(sym__$1);
|
|
self__._hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$INamed$_name$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.name;
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$INamed$_namespace$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.ns;
|
|
});
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,_){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
return cljs.core._write(writer,self__.str);
|
|
});
|
|
|
|
cljs.core.Symbol.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ns,cljs.core.cst$sym$name,cljs.core.cst$sym$str,cljs.core.with_meta(cljs.core.cst$sym$_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$_meta], null);
|
|
});
|
|
|
|
cljs.core.Symbol.cljs$lang$type = true;
|
|
|
|
cljs.core.Symbol.cljs$lang$ctorStr = "cljs.core/Symbol";
|
|
|
|
cljs.core.Symbol.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Symbol");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Symbol.
|
|
*/
|
|
cljs.core.__GT_Symbol = (function cljs$core$__GT_Symbol(ns,name,str,_hash,_meta){
|
|
return (new cljs.core.Symbol(ns,name,str,_hash,_meta));
|
|
});
|
|
|
|
/**
|
|
* Returns a Symbol with the given namespace and name.
|
|
*/
|
|
cljs.core.symbol = (function cljs$core$symbol(var_args){
|
|
var G__653 = arguments.length;
|
|
switch (G__653) {
|
|
case 1:
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.symbol.cljs$core$IFn$_invoke$arity$1 = (function (name){
|
|
if((name instanceof cljs.core.Symbol)){
|
|
return name;
|
|
} else {
|
|
var idx = name.indexOf("/");
|
|
if((idx < (1))){
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(null,name);
|
|
} else {
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(name.substring((0),idx),name.substring((idx + (1)),name.length));
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.symbol.cljs$core$IFn$_invoke$arity$2 = (function (ns,name){
|
|
var sym_str = (((!((ns == null))))?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns),"/",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name)].join(''):name);
|
|
return (new cljs.core.Symbol(ns,name,sym_str,null,null));
|
|
});
|
|
|
|
cljs.core.symbol.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.Fn}
|
|
* @implements {cljs.core.IDeref}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.Var = (function (val,sym,_meta){
|
|
this.val = val;
|
|
this.sym = sym;
|
|
this._meta = _meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 6717441;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.Var.prototype.isMacro = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)).cljs$lang$macro;
|
|
});
|
|
|
|
cljs.core.Var.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return ["#'",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.sym)].join('');
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__._meta;
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.Var(self__.val,self__.sym,new_meta));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this$,other){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
if((other instanceof cljs.core.Var)){
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(this$__$1.sym,other.sym);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.hash_symbol(self__.sym);
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$Fn$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Var.prototype.call = (function() {
|
|
var G__698 = null;
|
|
var G__698__1 = (function (self__){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__656 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__656.cljs$core$IFn$_invoke$arity$0 ? fexpr__656.cljs$core$IFn$_invoke$arity$0() : fexpr__656.call(null));
|
|
});
|
|
var G__698__2 = (function (self__,a){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__657 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__657.cljs$core$IFn$_invoke$arity$1 ? fexpr__657.cljs$core$IFn$_invoke$arity$1(a) : fexpr__657.call(null,a));
|
|
});
|
|
var G__698__3 = (function (self__,a,b){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__658 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__658.cljs$core$IFn$_invoke$arity$2 ? fexpr__658.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__658.call(null,a,b));
|
|
});
|
|
var G__698__4 = (function (self__,a,b,c){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__659 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__659.cljs$core$IFn$_invoke$arity$3 ? fexpr__659.cljs$core$IFn$_invoke$arity$3(a,b,c) : fexpr__659.call(null,a,b,c));
|
|
});
|
|
var G__698__5 = (function (self__,a,b,c,d){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__660 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__660.cljs$core$IFn$_invoke$arity$4 ? fexpr__660.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : fexpr__660.call(null,a,b,c,d));
|
|
});
|
|
var G__698__6 = (function (self__,a,b,c,d,e){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__661 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__661.cljs$core$IFn$_invoke$arity$5 ? fexpr__661.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : fexpr__661.call(null,a,b,c,d,e));
|
|
});
|
|
var G__698__7 = (function (self__,a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__662 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__662.cljs$core$IFn$_invoke$arity$6 ? fexpr__662.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : fexpr__662.call(null,a,b,c,d,e,f));
|
|
});
|
|
var G__698__8 = (function (self__,a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__663 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__663.cljs$core$IFn$_invoke$arity$7 ? fexpr__663.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : fexpr__663.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
var G__698__9 = (function (self__,a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__664 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__664.cljs$core$IFn$_invoke$arity$8 ? fexpr__664.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : fexpr__664.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
var G__698__10 = (function (self__,a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__665 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__665.cljs$core$IFn$_invoke$arity$9 ? fexpr__665.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : fexpr__665.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
var G__698__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__666 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__666.cljs$core$IFn$_invoke$arity$10 ? fexpr__666.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : fexpr__666.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
var G__698__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__667 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__667.cljs$core$IFn$_invoke$arity$11 ? fexpr__667.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : fexpr__667.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
var G__698__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__668 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__668.cljs$core$IFn$_invoke$arity$12 ? fexpr__668.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : fexpr__668.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
var G__698__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__669 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__669.cljs$core$IFn$_invoke$arity$13 ? fexpr__669.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : fexpr__669.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
var G__698__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__670 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__670.cljs$core$IFn$_invoke$arity$14 ? fexpr__670.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : fexpr__670.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
var G__698__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__671 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__671.cljs$core$IFn$_invoke$arity$15 ? fexpr__671.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : fexpr__671.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
var G__698__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__672 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__672.cljs$core$IFn$_invoke$arity$16 ? fexpr__672.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : fexpr__672.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
var G__698__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__673 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__673.cljs$core$IFn$_invoke$arity$17 ? fexpr__673.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : fexpr__673.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
var G__698__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__674 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__674.cljs$core$IFn$_invoke$arity$18 ? fexpr__674.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : fexpr__674.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
var G__698__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__675 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__675.cljs$core$IFn$_invoke$arity$19 ? fexpr__675.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : fexpr__675.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
var G__698__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
var fexpr__676 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__676.cljs$core$IFn$_invoke$arity$20 ? fexpr__676.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : fexpr__676.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
var G__698__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)),a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
G__698 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__698__1.call(this,self__);
|
|
case 2:
|
|
return G__698__2.call(this,self__,a);
|
|
case 3:
|
|
return G__698__3.call(this,self__,a,b);
|
|
case 4:
|
|
return G__698__4.call(this,self__,a,b,c);
|
|
case 5:
|
|
return G__698__5.call(this,self__,a,b,c,d);
|
|
case 6:
|
|
return G__698__6.call(this,self__,a,b,c,d,e);
|
|
case 7:
|
|
return G__698__7.call(this,self__,a,b,c,d,e,f);
|
|
case 8:
|
|
return G__698__8.call(this,self__,a,b,c,d,e,f,g);
|
|
case 9:
|
|
return G__698__9.call(this,self__,a,b,c,d,e,f,g,h);
|
|
case 10:
|
|
return G__698__10.call(this,self__,a,b,c,d,e,f,g,h,i);
|
|
case 11:
|
|
return G__698__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
|
|
case 12:
|
|
return G__698__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
|
|
case 13:
|
|
return G__698__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
|
|
case 14:
|
|
return G__698__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
|
|
case 15:
|
|
return G__698__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
|
|
case 16:
|
|
return G__698__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
|
|
case 17:
|
|
return G__698__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
|
|
case 18:
|
|
return G__698__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
|
|
case 19:
|
|
return G__698__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
|
|
case 20:
|
|
return G__698__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
|
|
case 21:
|
|
return G__698__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
|
|
case 22:
|
|
return G__698__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__698.cljs$core$IFn$_invoke$arity$1 = G__698__1;
|
|
G__698.cljs$core$IFn$_invoke$arity$2 = G__698__2;
|
|
G__698.cljs$core$IFn$_invoke$arity$3 = G__698__3;
|
|
G__698.cljs$core$IFn$_invoke$arity$4 = G__698__4;
|
|
G__698.cljs$core$IFn$_invoke$arity$5 = G__698__5;
|
|
G__698.cljs$core$IFn$_invoke$arity$6 = G__698__6;
|
|
G__698.cljs$core$IFn$_invoke$arity$7 = G__698__7;
|
|
G__698.cljs$core$IFn$_invoke$arity$8 = G__698__8;
|
|
G__698.cljs$core$IFn$_invoke$arity$9 = G__698__9;
|
|
G__698.cljs$core$IFn$_invoke$arity$10 = G__698__10;
|
|
G__698.cljs$core$IFn$_invoke$arity$11 = G__698__11;
|
|
G__698.cljs$core$IFn$_invoke$arity$12 = G__698__12;
|
|
G__698.cljs$core$IFn$_invoke$arity$13 = G__698__13;
|
|
G__698.cljs$core$IFn$_invoke$arity$14 = G__698__14;
|
|
G__698.cljs$core$IFn$_invoke$arity$15 = G__698__15;
|
|
G__698.cljs$core$IFn$_invoke$arity$16 = G__698__16;
|
|
G__698.cljs$core$IFn$_invoke$arity$17 = G__698__17;
|
|
G__698.cljs$core$IFn$_invoke$arity$18 = G__698__18;
|
|
G__698.cljs$core$IFn$_invoke$arity$19 = G__698__19;
|
|
G__698.cljs$core$IFn$_invoke$arity$20 = G__698__20;
|
|
G__698.cljs$core$IFn$_invoke$arity$21 = G__698__21;
|
|
G__698.cljs$core$IFn$_invoke$arity$22 = G__698__22;
|
|
return G__698;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Var.prototype.apply = (function (self__,args655){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args655)));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__677 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__677.cljs$core$IFn$_invoke$arity$0 ? fexpr__677.cljs$core$IFn$_invoke$arity$0() : fexpr__677.call(null));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__678 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__678.cljs$core$IFn$_invoke$arity$1 ? fexpr__678.cljs$core$IFn$_invoke$arity$1(a) : fexpr__678.call(null,a));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__679 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__679.cljs$core$IFn$_invoke$arity$2 ? fexpr__679.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__679.call(null,a,b));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__680 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__680.cljs$core$IFn$_invoke$arity$3 ? fexpr__680.cljs$core$IFn$_invoke$arity$3(a,b,c) : fexpr__680.call(null,a,b,c));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__681 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__681.cljs$core$IFn$_invoke$arity$4 ? fexpr__681.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : fexpr__681.call(null,a,b,c,d));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__682 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__682.cljs$core$IFn$_invoke$arity$5 ? fexpr__682.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : fexpr__682.call(null,a,b,c,d,e));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__683 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__683.cljs$core$IFn$_invoke$arity$6 ? fexpr__683.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : fexpr__683.call(null,a,b,c,d,e,f));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__684 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__684.cljs$core$IFn$_invoke$arity$7 ? fexpr__684.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : fexpr__684.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__685 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__685.cljs$core$IFn$_invoke$arity$8 ? fexpr__685.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : fexpr__685.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__686 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__686.cljs$core$IFn$_invoke$arity$9 ? fexpr__686.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : fexpr__686.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__687 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__687.cljs$core$IFn$_invoke$arity$10 ? fexpr__687.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : fexpr__687.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__688 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__688.cljs$core$IFn$_invoke$arity$11 ? fexpr__688.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : fexpr__688.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__689 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__689.cljs$core$IFn$_invoke$arity$12 ? fexpr__689.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : fexpr__689.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__690 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__690.cljs$core$IFn$_invoke$arity$13 ? fexpr__690.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : fexpr__690.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__691 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__691.cljs$core$IFn$_invoke$arity$14 ? fexpr__691.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : fexpr__691.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__692 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__692.cljs$core$IFn$_invoke$arity$15 ? fexpr__692.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : fexpr__692.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__693 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__693.cljs$core$IFn$_invoke$arity$16 ? fexpr__693.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : fexpr__693.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__694 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__694.cljs$core$IFn$_invoke$arity$17 ? fexpr__694.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : fexpr__694.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__695 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__695.cljs$core$IFn$_invoke$arity$18 ? fexpr__695.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : fexpr__695.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__696 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__696.cljs$core$IFn$_invoke$arity$19 ? fexpr__696.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : fexpr__696.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var fexpr__697 = (self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null));
|
|
return (fexpr__697.cljs$core$IFn$_invoke$arity$20 ? fexpr__697.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : fexpr__697.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((self__.val.cljs$core$IFn$_invoke$arity$0 ? self__.val.cljs$core$IFn$_invoke$arity$0() : self__.val.call(null)),a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
|
|
cljs.core.Var.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$val,cljs.core.cst$sym$sym,cljs.core.cst$sym$_meta], null);
|
|
});
|
|
|
|
cljs.core.Var.cljs$lang$type = true;
|
|
|
|
cljs.core.Var.cljs$lang$ctorStr = "cljs.core/Var";
|
|
|
|
cljs.core.Var.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Var");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Var.
|
|
*/
|
|
cljs.core.__GT_Var = (function cljs$core$__GT_Var(val,sym,_meta){
|
|
return (new cljs.core.Var(val,sym,_meta));
|
|
});
|
|
|
|
/**
|
|
* Returns true if v is of type cljs.core.Var
|
|
*/
|
|
cljs.core.var_QMARK_ = (function cljs$core$var_QMARK_(v){
|
|
return (v instanceof cljs.core.Var);
|
|
});
|
|
|
|
|
|
/**
|
|
* Return true if x implements IIterable protocol.
|
|
*/
|
|
cljs.core.iterable_QMARK_ = (function cljs$core$iterable_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition1$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IIterable$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition1$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IIterable,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IIterable,x);
|
|
}
|
|
});
|
|
/**
|
|
* Clone the supplied value which must implement ICloneable.
|
|
*/
|
|
cljs.core.clone = (function cljs$core$clone(value){
|
|
return cljs.core._clone(value);
|
|
});
|
|
/**
|
|
* Return true if x implements ICloneable protocol.
|
|
*/
|
|
cljs.core.cloneable_QMARK_ = (function cljs$core$cloneable_QMARK_(value){
|
|
if((!((value == null)))){
|
|
if((((value.cljs$lang$protocol_mask$partition1$ & (8192))) || ((cljs.core.PROTOCOL_SENTINEL === value.cljs$core$ICloneable$)))){
|
|
return true;
|
|
} else {
|
|
if((!value.cljs$lang$protocol_mask$partition1$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICloneable,value);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICloneable,value);
|
|
}
|
|
});
|
|
/**
|
|
* Returns a seq on the collection. If the collection is
|
|
* empty, returns nil. (seq nil) returns nil. seq also works on
|
|
* Strings.
|
|
*/
|
|
cljs.core.seq = (function cljs$core$seq(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeqable$))))?true:false):false)){
|
|
return coll.cljs$core$ISeqable$_seq$arity$1(null);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
if((coll.length === (0))){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.IndexedSeq(coll,(0),null));
|
|
}
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
if((coll.length === (0))){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.IndexedSeq(coll,(0),null));
|
|
}
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,coll)){
|
|
return cljs.core._seq(coll);
|
|
} else {
|
|
throw (new Error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll)," is not ISeqable"].join('')));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the first item in the collection. Calls seq on its
|
|
* argument. If coll is nil, returns nil.
|
|
*/
|
|
cljs.core.first = (function cljs$core$first(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false)){
|
|
return coll.cljs$core$ISeq$_first$arity$1(null);
|
|
} else {
|
|
var s = cljs.core.seq(coll);
|
|
if((s == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._first(s);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns a possibly empty seq of the items after the first. Calls seq on its
|
|
* argument.
|
|
*/
|
|
cljs.core.rest = (function cljs$core$rest(coll){
|
|
if((!((coll == null)))){
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false)){
|
|
return coll.cljs$core$ISeq$_rest$arity$1(null);
|
|
} else {
|
|
var s = cljs.core.seq(coll);
|
|
if(s){
|
|
return s.cljs$core$ISeq$_rest$arity$1(null);
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
/**
|
|
* Returns a seq of the items after the first. Calls seq on its
|
|
* argument. If there are no more items, returns nil
|
|
*/
|
|
cljs.core.next = (function cljs$core$next(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$INext$))))?true:false):false)){
|
|
return coll.cljs$core$INext$_next$arity$1(null);
|
|
} else {
|
|
return cljs.core.seq(cljs.core.rest(coll));
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Equality. Returns true if x equals y, false if not. Compares
|
|
* numbers and collections in a type-independent manner. Clojure's immutable data
|
|
* structures define -equiv (and thus =) as a value, not an identity,
|
|
* comparison.
|
|
*/
|
|
cljs.core._EQ_ = (function cljs$core$_EQ_(var_args){
|
|
var G__709 = arguments.length;
|
|
switch (G__709) {
|
|
case 1:
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___711 = arguments.length;
|
|
var i__4642__auto___712 = (0);
|
|
while(true){
|
|
if((i__4642__auto___712 < len__4641__auto___711)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___712]));
|
|
|
|
var G__713 = (i__4642__auto___712 + (1));
|
|
i__4642__auto___712 = G__713;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
if((x == null)){
|
|
return (y == null);
|
|
} else {
|
|
return (((x === y)) || (cljs.core._equiv(x,y)));
|
|
}
|
|
});
|
|
|
|
cljs.core._EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)){
|
|
if(cljs.core.next(more)){
|
|
var G__714 = y;
|
|
var G__715 = cljs.core.first(more);
|
|
var G__716 = cljs.core.next(more);
|
|
x = G__714;
|
|
y = G__715;
|
|
more = G__716;
|
|
continue;
|
|
} else {
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(y,cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._EQ_.cljs$lang$applyTo = (function (seq706){
|
|
var G__707 = cljs.core.first(seq706);
|
|
var seq706__$1 = cljs.core.next(seq706);
|
|
var G__708 = cljs.core.first(seq706__$1);
|
|
var seq706__$2 = cljs.core.next(seq706__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__707,G__708,seq706__$2);
|
|
});
|
|
|
|
cljs.core._EQ_.cljs$lang$maxFixedArity = (2);
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ES6Iterator = (function (s){
|
|
this.s = s;
|
|
});
|
|
cljs.core.ES6Iterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((!((self__.s == null)))){
|
|
var x = cljs.core.first(self__.s);
|
|
self__.s = cljs.core.next(self__.s);
|
|
|
|
return ({"value": x, "done": false});
|
|
} else {
|
|
return ({"value": null, "done": true});
|
|
}
|
|
});
|
|
|
|
cljs.core.ES6Iterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ES6Iterator.cljs$lang$type = true;
|
|
|
|
cljs.core.ES6Iterator.cljs$lang$ctorStr = "cljs.core/ES6Iterator";
|
|
|
|
cljs.core.ES6Iterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ES6Iterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ES6Iterator.
|
|
*/
|
|
cljs.core.__GT_ES6Iterator = (function cljs$core$__GT_ES6Iterator(s){
|
|
return (new cljs.core.ES6Iterator(s));
|
|
});
|
|
|
|
/**
|
|
* EXPERIMENTAL: Return a ES2015 compatible iterator for coll.
|
|
*/
|
|
cljs.core.es6_iterator = (function cljs$core$es6_iterator(coll){
|
|
return (new cljs.core.ES6Iterator(cljs.core.seq(coll)));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.ISeqable}
|
|
*/
|
|
cljs.core.ES6IteratorSeq = (function (value,iter,_rest){
|
|
this.value = value;
|
|
this.iter = iter;
|
|
this._rest = _rest;
|
|
this.cljs$lang$protocol_mask$partition0$ = 8388672;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1;
|
|
});
|
|
|
|
cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.value;
|
|
});
|
|
|
|
cljs.core.ES6IteratorSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if((self__._rest == null)){
|
|
self__._rest = cljs.core.es6_iterator_seq(self__.iter);
|
|
} else {
|
|
}
|
|
|
|
return self__._rest;
|
|
});
|
|
|
|
cljs.core.ES6IteratorSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$value,cljs.core.cst$sym$iter,cljs.core.with_meta(cljs.core.cst$sym$_rest,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ES6IteratorSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.ES6IteratorSeq.cljs$lang$ctorStr = "cljs.core/ES6IteratorSeq";
|
|
|
|
cljs.core.ES6IteratorSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ES6IteratorSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ES6IteratorSeq.
|
|
*/
|
|
cljs.core.__GT_ES6IteratorSeq = (function cljs$core$__GT_ES6IteratorSeq(value,iter,_rest){
|
|
return (new cljs.core.ES6IteratorSeq(value,iter,_rest));
|
|
});
|
|
|
|
/**
|
|
* EXPERIMENTAL: Given an ES2015 compatible iterator return a seq.
|
|
*/
|
|
cljs.core.es6_iterator_seq = (function cljs$core$es6_iterator_seq(iter){
|
|
var v = iter.next();
|
|
if(cljs.core.truth_(v.done)){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return (new cljs.core.ES6IteratorSeq(v.value,iter,null));
|
|
}
|
|
});
|
|
/**
|
|
* Mix final collection hash for ordered or unordered collections.
|
|
* hash-basis is the combined collection hash, count is the number
|
|
* of elements included in the basis. Note this is the hash code
|
|
* consistent with =, different from .hashCode.
|
|
* See http://clojure.org/data_structures#hash for full algorithms.
|
|
*/
|
|
cljs.core.mix_collection_hash = (function cljs$core$mix_collection_hash(hash_basis,count){
|
|
var h1 = cljs.core.m3_seed;
|
|
var k1 = cljs.core.m3_mix_K1(hash_basis);
|
|
var h1__$1 = cljs.core.m3_mix_H1(h1,k1);
|
|
return cljs.core.m3_fmix(h1__$1,count);
|
|
});
|
|
/**
|
|
* Returns the hash code, consistent with =, for an external ordered
|
|
* collection implementing Iterable.
|
|
* See http://clojure.org/data_structures#hash for full algorithms.
|
|
*/
|
|
cljs.core.hash_ordered_coll = (function cljs$core$hash_ordered_coll(coll){
|
|
var n = (0);
|
|
var hash_code = (1);
|
|
var coll__$1 = cljs.core.seq(coll);
|
|
while(true){
|
|
if((!((coll__$1 == null)))){
|
|
var G__717 = (n + (1));
|
|
var G__718 = ((cljs.core.imul((31),hash_code) + cljs.core.hash(cljs.core.first(coll__$1))) | (0));
|
|
var G__719 = cljs.core.next(coll__$1);
|
|
n = G__717;
|
|
hash_code = G__718;
|
|
coll__$1 = G__719;
|
|
continue;
|
|
} else {
|
|
return cljs.core.mix_collection_hash(hash_code,n);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.empty_ordered_hash = cljs.core.mix_collection_hash((1),(0));
|
|
/**
|
|
* Returns the hash code, consistent with =, for an external unordered
|
|
* collection implementing Iterable. For maps, the iterator should
|
|
* return map entries whose hash is computed as
|
|
* (hash-ordered-coll [k v]).
|
|
* See http://clojure.org/data_structures#hash for full algorithms.
|
|
*/
|
|
cljs.core.hash_unordered_coll = (function cljs$core$hash_unordered_coll(coll){
|
|
var n = (0);
|
|
var hash_code = (0);
|
|
var coll__$1 = cljs.core.seq(coll);
|
|
while(true){
|
|
if((!((coll__$1 == null)))){
|
|
var G__720 = (n + (1));
|
|
var G__721 = ((hash_code + cljs.core.hash(cljs.core.first(coll__$1))) | (0));
|
|
var G__722 = cljs.core.next(coll__$1);
|
|
n = G__720;
|
|
hash_code = G__721;
|
|
coll__$1 = G__722;
|
|
continue;
|
|
} else {
|
|
return cljs.core.mix_collection_hash(hash_code,n);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.empty_unordered_hash = cljs.core.mix_collection_hash((0),(0));
|
|
|
|
|
|
goog.object.set(cljs.core.ICounted,"null",true);
|
|
|
|
var G__723_726 = cljs.core._count;
|
|
var G__724_727 = "null";
|
|
var G__725_728 = ((function (G__723_726,G__724_727){
|
|
return (function (_){
|
|
return (0);
|
|
});})(G__723_726,G__724_727))
|
|
;
|
|
goog.object.set(G__723_726,G__724_727,G__725_728);
|
|
Date.prototype.cljs$core$IEquiv$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
Date.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
|
|
var o__$1 = this;
|
|
return (((other instanceof Date)) && ((o__$1.valueOf() === other.valueOf())));
|
|
});
|
|
|
|
Date.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
Date.prototype.cljs$core$IComparable$_compare$arity$2 = (function (this$,other){
|
|
var this$__$1 = this;
|
|
if((other instanceof Date)){
|
|
var G__729 = this$__$1.valueOf();
|
|
var G__730 = other.valueOf();
|
|
return goog.array.defaultCompare(G__729,G__730);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(this$__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(other)].join('')));
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @interface
|
|
*/
|
|
cljs.core.Inst = function(){};
|
|
|
|
cljs.core.inst_ms_STAR_ = (function cljs$core$inst_ms_STAR_(inst){
|
|
if((((!((inst == null)))) && ((!((inst.cljs$core$Inst$inst_ms_STAR_$arity$1 == null)))))){
|
|
return inst.cljs$core$Inst$inst_ms_STAR_$arity$1(inst);
|
|
} else {
|
|
var x__4347__auto__ = (((inst == null))?null:inst);
|
|
var m__4348__auto__ = (cljs.core.inst_ms_STAR_[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(inst) : m__4348__auto__.call(null,inst));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core.inst_ms_STAR_["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(inst) : m__4348__auto____$1.call(null,inst));
|
|
} else {
|
|
throw cljs.core.missing_protocol("Inst.inst-ms*",inst);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
Date.prototype.cljs$core$Inst$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
Date.prototype.cljs$core$Inst$inst_ms_STAR_$arity$1 = (function (inst){
|
|
var inst__$1 = this;
|
|
return inst__$1.getTime();
|
|
});
|
|
/**
|
|
* Return the number of milliseconds since January 1, 1970, 00:00:00 GMT
|
|
*/
|
|
cljs.core.inst_ms = (function cljs$core$inst_ms(inst){
|
|
return cljs.core.inst_ms_STAR_(inst);
|
|
});
|
|
/**
|
|
* Return true if x satisfies Inst
|
|
*/
|
|
cljs.core.inst_QMARK_ = (function cljs$core$inst_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$Inst$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.Inst,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.Inst,x);
|
|
}
|
|
});
|
|
goog.object.set(cljs.core.IEquiv,"number",true);
|
|
|
|
var G__732_735 = cljs.core._equiv;
|
|
var G__733_736 = "number";
|
|
var G__734_737 = ((function (G__732_735,G__733_736){
|
|
return (function (x,o){
|
|
return (x === o);
|
|
});})(G__732_735,G__733_736))
|
|
;
|
|
goog.object.set(G__732_735,G__733_736,G__734_737);
|
|
goog.object.set(cljs.core.Fn,"function",true);
|
|
|
|
goog.object.set(cljs.core.IMeta,"function",true);
|
|
|
|
var G__738_741 = cljs.core._meta;
|
|
var G__739_742 = "function";
|
|
var G__740_743 = ((function (G__738_741,G__739_742){
|
|
return (function (_){
|
|
return null;
|
|
});})(G__738_741,G__739_742))
|
|
;
|
|
goog.object.set(G__738_741,G__739_742,G__740_743);
|
|
goog.object.set(cljs.core.IHash,"_",true);
|
|
|
|
var G__744_747 = cljs.core._hash;
|
|
var G__745_748 = "_";
|
|
var G__746_749 = ((function (G__744_747,G__745_748){
|
|
return (function (o){
|
|
return goog.getUid(o);
|
|
});})(G__744_747,G__745_748))
|
|
;
|
|
goog.object.set(G__744_747,G__745_748,G__746_749);
|
|
/**
|
|
* Returns a number one greater than num.
|
|
*/
|
|
cljs.core.inc = (function cljs$core$inc(x){
|
|
return (x + (1));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IDeref}
|
|
*/
|
|
cljs.core.Reduced = (function (val){
|
|
this.val = val;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32768;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.Reduced.prototype.cljs$core$IDeref$_deref$arity$1 = (function (o){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.Reduced.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$val], null);
|
|
});
|
|
|
|
cljs.core.Reduced.cljs$lang$type = true;
|
|
|
|
cljs.core.Reduced.cljs$lang$ctorStr = "cljs.core/Reduced";
|
|
|
|
cljs.core.Reduced.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Reduced");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Reduced.
|
|
*/
|
|
cljs.core.__GT_Reduced = (function cljs$core$__GT_Reduced(val){
|
|
return (new cljs.core.Reduced(val));
|
|
});
|
|
|
|
/**
|
|
* Wraps x in a way such that a reduce will terminate with the value x
|
|
*/
|
|
cljs.core.reduced = (function cljs$core$reduced(x){
|
|
return (new cljs.core.Reduced(x));
|
|
});
|
|
/**
|
|
* Returns true if x is the result of a call to reduced
|
|
*/
|
|
cljs.core.reduced_QMARK_ = (function cljs$core$reduced_QMARK_(r){
|
|
return (r instanceof cljs.core.Reduced);
|
|
});
|
|
/**
|
|
* If x is already reduced?, returns it, else returns (reduced x)
|
|
*/
|
|
cljs.core.ensure_reduced = (function cljs$core$ensure_reduced(x){
|
|
if(cljs.core.reduced_QMARK_(x)){
|
|
return x;
|
|
} else {
|
|
return cljs.core.reduced(x);
|
|
}
|
|
});
|
|
/**
|
|
* If x is reduced?, returns (deref x), else returns x
|
|
*/
|
|
cljs.core.unreduced = (function cljs$core$unreduced(x){
|
|
if(cljs.core.reduced_QMARK_(x)){
|
|
return cljs.core.deref(x);
|
|
} else {
|
|
return x;
|
|
}
|
|
});
|
|
/**
|
|
* Also reader macro: @var/@atom/@delay. Returns the
|
|
* most-recently-committed value of ref. When applied to a var
|
|
* or atom, returns its current state. When applied to a delay, forces
|
|
* it if not already forced. See also - realized?.
|
|
*/
|
|
cljs.core.deref = (function cljs$core$deref(o){
|
|
return cljs.core._deref(o);
|
|
});
|
|
/**
|
|
* Accepts any collection which satisfies the ICount and IIndexed protocols and
|
|
* reduces them without incurring seq initialization
|
|
*/
|
|
cljs.core.ci_reduce = (function cljs$core$ci_reduce(var_args){
|
|
var G__751 = arguments.length;
|
|
switch (G__751) {
|
|
case 2:
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2 = (function (cicoll,f){
|
|
var cnt = cljs.core._count(cicoll);
|
|
if((cnt === (0))){
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
} else {
|
|
var val = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,(0));
|
|
var n = (1);
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__752 = val;
|
|
var G__753 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__752,G__753) : f.call(null,G__752,G__753));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__759 = nval;
|
|
var G__760 = (n + (1));
|
|
val = G__759;
|
|
n = G__760;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3 = (function (cicoll,f,val){
|
|
var cnt = cljs.core._count(cicoll);
|
|
var val__$1 = val;
|
|
var n = (0);
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__754 = val__$1;
|
|
var G__755 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__754,G__755) : f.call(null,G__754,G__755));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__761 = nval;
|
|
var G__762 = (n + (1));
|
|
val__$1 = G__761;
|
|
n = G__762;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$4 = (function (cicoll,f,val,idx){
|
|
var cnt = cljs.core._count(cicoll);
|
|
var val__$1 = val;
|
|
var n = idx;
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__756 = val__$1;
|
|
var G__757 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(cicoll,n);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__756,G__757) : f.call(null,G__756,G__757));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__763 = nval;
|
|
var G__764 = (n + (1));
|
|
val__$1 = G__763;
|
|
n = G__764;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.ci_reduce.cljs$lang$maxFixedArity = 4;
|
|
|
|
cljs.core.array_reduce = (function cljs$core$array_reduce(var_args){
|
|
var G__766 = arguments.length;
|
|
switch (G__766) {
|
|
case 2:
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2 = (function (arr,f){
|
|
var cnt = arr.length;
|
|
if((arr.length === (0))){
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
} else {
|
|
var val = (arr[(0)]);
|
|
var n = (1);
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__767 = val;
|
|
var G__768 = (arr[n]);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__767,G__768) : f.call(null,G__767,G__768));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__774 = nval;
|
|
var G__775 = (n + (1));
|
|
val = G__774;
|
|
n = G__775;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3 = (function (arr,f,val){
|
|
var cnt = arr.length;
|
|
var val__$1 = val;
|
|
var n = (0);
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__769 = val__$1;
|
|
var G__770 = (arr[n]);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__769,G__770) : f.call(null,G__769,G__770));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__776 = nval;
|
|
var G__777 = (n + (1));
|
|
val__$1 = G__776;
|
|
n = G__777;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4 = (function (arr,f,val,idx){
|
|
var cnt = arr.length;
|
|
var val__$1 = val;
|
|
var n = idx;
|
|
while(true){
|
|
if((n < cnt)){
|
|
var nval = (function (){var G__771 = val__$1;
|
|
var G__772 = (arr[n]);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__771,G__772) : f.call(null,G__771,G__772));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__778 = nval;
|
|
var G__779 = (n + (1));
|
|
val__$1 = G__778;
|
|
n = G__779;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.array_reduce.cljs$lang$maxFixedArity = 4;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
* Returns true if coll implements count in constant time
|
|
*/
|
|
cljs.core.counted_QMARK_ = (function cljs$core$counted_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (2))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ICounted$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICounted,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICounted,x);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll implements nth in constant time
|
|
*/
|
|
cljs.core.indexed_QMARK_ = (function cljs$core$indexed_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IIndexed$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,x);
|
|
}
|
|
});
|
|
cljs.core._indexOf = (function cljs$core$_indexOf(var_args){
|
|
var G__783 = arguments.length;
|
|
switch (G__783) {
|
|
case 2:
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._indexOf.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
|
|
cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3 = (function (coll,x,start){
|
|
var len = cljs.core.count(coll);
|
|
if((start >= len)){
|
|
return (-1);
|
|
} else {
|
|
var idx = (((start > (0)))?start:(((start < (0)))?(function (){var x__4135__auto__ = (0);
|
|
var y__4136__auto__ = (start + len);
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
})():start
|
|
));
|
|
while(true){
|
|
if((idx < len)){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,idx),x)){
|
|
return idx;
|
|
} else {
|
|
var G__785 = (idx + (1));
|
|
idx = G__785;
|
|
continue;
|
|
}
|
|
} else {
|
|
return (-1);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._indexOf.cljs$lang$maxFixedArity = 3;
|
|
|
|
cljs.core._lastIndexOf = (function cljs$core$_lastIndexOf(var_args){
|
|
var G__787 = arguments.length;
|
|
switch (G__787) {
|
|
case 2:
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
|
|
cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3 = (function (coll,x,start){
|
|
var len = cljs.core.count(coll);
|
|
if((len === (0))){
|
|
return (-1);
|
|
} else {
|
|
var idx = (((start > (0)))?(function (){var x__4138__auto__ = (len - (1));
|
|
var y__4139__auto__ = start;
|
|
return ((x__4138__auto__ < y__4139__auto__) ? x__4138__auto__ : y__4139__auto__);
|
|
})():(((start < (0)))?(len + start):start
|
|
));
|
|
while(true){
|
|
if((idx >= (0))){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,idx),x)){
|
|
return idx;
|
|
} else {
|
|
var G__789 = (idx - (1));
|
|
idx = G__789;
|
|
continue;
|
|
}
|
|
} else {
|
|
return (-1);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._lastIndexOf.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.IndexedSeqIterator = (function (arr,i){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
});
|
|
cljs.core.IndexedSeqIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.i < self__.arr.length);
|
|
});
|
|
|
|
cljs.core.IndexedSeqIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = (self__.arr[self__.i]);
|
|
self__.i = (self__.i + (1));
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.IndexedSeqIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.IndexedSeqIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.IndexedSeqIterator.cljs$lang$ctorStr = "cljs.core/IndexedSeqIterator";
|
|
|
|
cljs.core.IndexedSeqIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/IndexedSeqIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/IndexedSeqIterator.
|
|
*/
|
|
cljs.core.__GT_IndexedSeqIterator = (function cljs$core$__GT_IndexedSeqIterator(arr,i){
|
|
return (new cljs.core.IndexedSeqIterator(arr,i));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ASeq}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.IndexedSeq = (function (arr,i,meta){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
this.meta = meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 166592766;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139264;
|
|
});
|
|
cljs.core.IndexedSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.indexOf = (function() {
|
|
var G__790 = null;
|
|
var G__790__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__790__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__790 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__790__1.call(this,x);
|
|
case 2:
|
|
return G__790__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__790.cljs$core$IFn$_invoke$arity$1 = G__790__1;
|
|
G__790.cljs$core$IFn$_invoke$arity$2 = G__790__2;
|
|
return G__790;
|
|
})()
|
|
;
|
|
|
|
cljs.core.IndexedSeq.prototype.lastIndexOf = (function() {
|
|
var G__791 = null;
|
|
var G__791__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__791__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__791 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__791__1.call(this,x);
|
|
case 2:
|
|
return G__791__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__791.cljs$core$IFn$_invoke$arity$1 = G__791__1;
|
|
G__791.cljs$core$IFn$_invoke$arity$2 = G__791__2;
|
|
return G__791;
|
|
})()
|
|
;
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var i__$1 = (n + self__.i);
|
|
if(((((0) <= i__$1)) && ((i__$1 < self__.arr.length)))){
|
|
return (self__.arr[i__$1]);
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var i__$1 = (n + self__.i);
|
|
if(((((0) <= i__$1)) && ((i__$1 < self__.arr.length)))){
|
|
return (self__.arr[i__$1]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.IndexedSeqIterator(self__.arr,self__.i));
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.IndexedSeq(self__.arr,self__.i,self__.meta));
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$INext$_next$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if(((self__.i + (1)) < self__.arr.length)){
|
|
return (new cljs.core.IndexedSeq(self__.arr,(self__.i + (1)),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
var x__4135__auto__ = (0);
|
|
var y__4136__auto__ = (self__.arr.length - self__.i);
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var c = coll__$1.cljs$core$ICounted$_count$arity$1(null);
|
|
if((c > (0))){
|
|
return (new cljs.core.RSeq(coll__$1,(c - (1)),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.hash_ordered_coll(coll__$1);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.List.EMPTY;
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,(self__.arr[self__.i]),(self__.i + (1)));
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,start,self__.i);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (self__.arr[self__.i]);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if(((self__.i + (1)) < self__.arr.length)){
|
|
return (new cljs.core.IndexedSeq(self__.arr,(self__.i + (1)),null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
if((self__.i < self__.arr.length)){
|
|
return this$__$1;
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.IndexedSeq(self__.arr,self__.i,new_meta));
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$i,cljs.core.cst$sym$meta], null);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.IndexedSeq.cljs$lang$ctorStr = "cljs.core/IndexedSeq";
|
|
|
|
cljs.core.IndexedSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/IndexedSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/IndexedSeq.
|
|
*/
|
|
cljs.core.__GT_IndexedSeq = (function cljs$core$__GT_IndexedSeq(arr,i,meta){
|
|
return (new cljs.core.IndexedSeq(arr,i,meta));
|
|
});
|
|
|
|
var G__792_795 = cljs.core.IndexedSeq.prototype;
|
|
var G__793_796 = cljs.core.ITER_SYMBOL;
|
|
var G__794_797 = ((function (G__792_795,G__793_796){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__792_795,G__793_796))
|
|
;
|
|
goog.object.set(G__792_795,G__793_796,G__794_797);
|
|
/**
|
|
* Create seq from a primitive JavaScript Array-like.
|
|
*/
|
|
cljs.core.prim_seq = (function cljs$core$prim_seq(var_args){
|
|
var G__799 = arguments.length;
|
|
switch (G__799) {
|
|
case 1:
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$1 = (function (prim){
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(prim,(0));
|
|
});
|
|
|
|
cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2 = (function (prim,i){
|
|
if((i < prim.length)){
|
|
return (new cljs.core.IndexedSeq(prim,i,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.prim_seq.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Create a seq from a JavaScript array.
|
|
*/
|
|
cljs.core.array_seq = (function cljs$core$array_seq(var_args){
|
|
var G__802 = arguments.length;
|
|
switch (G__802) {
|
|
case 1:
|
|
return cljs.core.array_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.array_seq.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.array_seq.cljs$core$IFn$_invoke$arity$1 = (function (array){
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(array,(0));
|
|
});
|
|
|
|
cljs.core.array_seq.cljs$core$IFn$_invoke$arity$2 = (function (array,i){
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(array,i);
|
|
});
|
|
|
|
cljs.core.array_seq.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.RSeq = (function (ci,i,meta){
|
|
this.ci = ci;
|
|
this.i = i;
|
|
this.meta = meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374990;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.RSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.indexOf = (function() {
|
|
var G__804 = null;
|
|
var G__804__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__804__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__804 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__804__1.call(this,x);
|
|
case 2:
|
|
return G__804__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__804.cljs$core$IFn$_invoke$arity$1 = G__804__1;
|
|
G__804.cljs$core$IFn$_invoke$arity$2 = G__804__2;
|
|
return G__804;
|
|
})()
|
|
;
|
|
|
|
cljs.core.RSeq.prototype.lastIndexOf = (function() {
|
|
var G__805 = null;
|
|
var G__805__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__805__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__805 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__805__1.call(this,x);
|
|
case 2:
|
|
return G__805__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__805.cljs$core$IFn$_invoke$arity$1 = G__805__1;
|
|
G__805.cljs$core$IFn$_invoke$arity$2 = G__805__2;
|
|
return G__805;
|
|
})()
|
|
;
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.RSeq(self__.ci,self__.i,self__.meta));
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.i > (0))){
|
|
return (new cljs.core.RSeq(self__.ci,(self__.i - (1)),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (self__.i + (1));
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.hash_ordered_coll(coll__$1);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (col,f){
|
|
var self__ = this;
|
|
var col__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,col__$1);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (col,f,start){
|
|
var self__ = this;
|
|
var col__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,col__$1);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.ci,self__.i);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.i > (0))){
|
|
return (new cljs.core.RSeq(self__.ci,(self__.i - (1)),null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.RSeq(self__.ci,self__.i,new_meta));
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.RSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ci,cljs.core.cst$sym$i,cljs.core.cst$sym$meta], null);
|
|
});
|
|
|
|
cljs.core.RSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.RSeq.cljs$lang$ctorStr = "cljs.core/RSeq";
|
|
|
|
cljs.core.RSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/RSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/RSeq.
|
|
*/
|
|
cljs.core.__GT_RSeq = (function cljs$core$__GT_RSeq(ci,i,meta){
|
|
return (new cljs.core.RSeq(ci,i,meta));
|
|
});
|
|
|
|
var G__806_809 = cljs.core.RSeq.prototype;
|
|
var G__807_810 = cljs.core.ITER_SYMBOL;
|
|
var G__808_811 = ((function (G__806_809,G__807_810){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__806_809,G__807_810))
|
|
;
|
|
goog.object.set(G__806_809,G__807_810,G__808_811);
|
|
/**
|
|
* Same as (first (next x))
|
|
*/
|
|
cljs.core.second = (function cljs$core$second(coll){
|
|
return cljs.core.first(cljs.core.next(coll));
|
|
});
|
|
/**
|
|
* Same as (first (first x))
|
|
*/
|
|
cljs.core.ffirst = (function cljs$core$ffirst(coll){
|
|
return cljs.core.first(cljs.core.first(coll));
|
|
});
|
|
/**
|
|
* Same as (next (first x))
|
|
*/
|
|
cljs.core.nfirst = (function cljs$core$nfirst(coll){
|
|
return cljs.core.next(cljs.core.first(coll));
|
|
});
|
|
/**
|
|
* Same as (first (next x))
|
|
*/
|
|
cljs.core.fnext = (function cljs$core$fnext(coll){
|
|
return cljs.core.first(cljs.core.next(coll));
|
|
});
|
|
/**
|
|
* Same as (next (next x))
|
|
*/
|
|
cljs.core.nnext = (function cljs$core$nnext(coll){
|
|
return cljs.core.next(cljs.core.next(coll));
|
|
});
|
|
/**
|
|
* Return the last item in coll, in linear time
|
|
*/
|
|
cljs.core.last = (function cljs$core$last(s){
|
|
while(true){
|
|
var sn = cljs.core.next(s);
|
|
if((!((sn == null)))){
|
|
var G__812 = sn;
|
|
s = G__812;
|
|
continue;
|
|
} else {
|
|
return cljs.core.first(s);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
goog.object.set(cljs.core.IEquiv,"_",true);
|
|
|
|
var G__813_816 = cljs.core._equiv;
|
|
var G__814_817 = "_";
|
|
var G__815_818 = ((function (G__813_816,G__814_817){
|
|
return (function (x,o){
|
|
return (x === o);
|
|
});})(G__813_816,G__814_817))
|
|
;
|
|
goog.object.set(G__813_816,G__814_817,G__815_818);
|
|
/**
|
|
* conj[oin]. Returns a new collection with the xs
|
|
* 'added'. (conj nil item) returns (item). The 'addition' may
|
|
* happen at different 'places' depending on the concrete type.
|
|
*/
|
|
cljs.core.conj = (function cljs$core$conj(var_args){
|
|
var G__823 = arguments.length;
|
|
switch (G__823) {
|
|
case 0:
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___825 = arguments.length;
|
|
var i__4642__auto___826 = (0);
|
|
while(true){
|
|
if((i__4642__auto___826 < len__4641__auto___825)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___826]));
|
|
|
|
var G__827 = (i__4642__auto___826 + (1));
|
|
i__4642__auto___826 = G__827;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.conj.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.PersistentVector.EMPTY;
|
|
});
|
|
|
|
cljs.core.conj.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
return coll;
|
|
});
|
|
|
|
cljs.core.conj.cljs$core$IFn$_invoke$arity$2 = (function (coll,x){
|
|
if((!((coll == null)))){
|
|
return cljs.core._conj(coll,x);
|
|
} else {
|
|
return (new cljs.core.List(null,x,null,(1),null));
|
|
}
|
|
});
|
|
|
|
cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic = (function (coll,x,xs){
|
|
while(true){
|
|
if(cljs.core.truth_(xs)){
|
|
var G__828 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(coll,x);
|
|
var G__829 = cljs.core.first(xs);
|
|
var G__830 = cljs.core.next(xs);
|
|
coll = G__828;
|
|
x = G__829;
|
|
xs = G__830;
|
|
continue;
|
|
} else {
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(coll,x);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.conj.cljs$lang$applyTo = (function (seq820){
|
|
var G__821 = cljs.core.first(seq820);
|
|
var seq820__$1 = cljs.core.next(seq820);
|
|
var G__822 = cljs.core.first(seq820__$1);
|
|
var seq820__$2 = cljs.core.next(seq820__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__821,G__822,seq820__$2);
|
|
});
|
|
|
|
cljs.core.conj.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns an empty collection of the same category as coll, or nil
|
|
*/
|
|
cljs.core.empty = (function cljs$core$empty(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._empty(coll);
|
|
}
|
|
});
|
|
cljs.core.accumulating_seq_count = (function cljs$core$accumulating_seq_count(coll){
|
|
var s = cljs.core.seq(coll);
|
|
var acc = (0);
|
|
while(true){
|
|
if(cljs.core.counted_QMARK_(s)){
|
|
return (acc + cljs.core._count(s));
|
|
} else {
|
|
var G__831 = cljs.core.next(s);
|
|
var G__832 = (acc + (1));
|
|
s = G__831;
|
|
acc = G__832;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the number of items in the collection. (count nil) returns
|
|
* 0. Also works on strings, arrays, and Maps
|
|
*/
|
|
cljs.core.count = (function cljs$core$count(coll){
|
|
if((!((coll == null)))){
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (2))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ICounted$))))?true:false):false)){
|
|
return coll.cljs$core$ICounted$_count$arity$1(null);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
return coll.length;
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
return coll.length;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeqable$))))?true:false):false)){
|
|
return cljs.core.accumulating_seq_count(coll);
|
|
} else {
|
|
return cljs.core._count(coll);
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
return (0);
|
|
}
|
|
});
|
|
cljs.core.linear_traversal_nth = (function cljs$core$linear_traversal_nth(var_args){
|
|
var G__836 = arguments.length;
|
|
switch (G__836) {
|
|
case 2:
|
|
return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
|
|
while(true){
|
|
if((coll == null)){
|
|
throw (new Error("Index out of bounds"));
|
|
} else {
|
|
if((n === (0))){
|
|
if(cljs.core.seq(coll)){
|
|
return cljs.core.first(coll);
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
}
|
|
} else {
|
|
if(cljs.core.indexed_QMARK_(coll)){
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(coll,n);
|
|
} else {
|
|
if(cljs.core.seq(coll)){
|
|
var G__838 = cljs.core.next(coll);
|
|
var G__839 = (n - (1));
|
|
coll = G__838;
|
|
n = G__839;
|
|
continue;
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
|
|
while(true){
|
|
if((coll == null)){
|
|
return not_found;
|
|
} else {
|
|
if((n === (0))){
|
|
if(cljs.core.seq(coll)){
|
|
return cljs.core.first(coll);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if(cljs.core.indexed_QMARK_(coll)){
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
|
|
} else {
|
|
if(cljs.core.seq(coll)){
|
|
var G__840 = cljs.core.next(coll);
|
|
var G__841 = (n - (1));
|
|
var G__842 = not_found;
|
|
coll = G__840;
|
|
n = G__841;
|
|
not_found = G__842;
|
|
continue;
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.linear_traversal_nth.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns the value at the index. get returns nil if index out of
|
|
* bounds, nth throws an exception unless not-found is supplied. nth
|
|
* also works for strings, arrays, regex Matchers and Lists, and,
|
|
* in O(n) time, for sequences.
|
|
*/
|
|
cljs.core.nth = (function cljs$core$nth(var_args){
|
|
var G__844 = arguments.length;
|
|
switch (G__844) {
|
|
case 2:
|
|
return cljs.core.nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.nth.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.nth.cljs$core$IFn$_invoke$arity$2 = (function (coll,n){
|
|
if((!(typeof n === 'number'))){
|
|
throw (new Error("Index argument to nth must be a number"));
|
|
} else {
|
|
if((coll == null)){
|
|
return coll;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IIndexed$))))?true:false):false)){
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(null,n);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
if((((n >= (0))) && ((n < coll.length)))){
|
|
return (coll[n]);
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
}
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
if((((n >= (0))) && ((n < coll.length)))){
|
|
return coll.charAt(n);
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
}
|
|
} else {
|
|
if((function (){var or__4047__auto__ = (((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
if((!((coll == null)))){
|
|
if((((coll.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISequential$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
})()){
|
|
if((n < (0))){
|
|
throw (new Error("Index out of bounds"));
|
|
} else {
|
|
return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$2(coll,n);
|
|
}
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,coll)){
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(coll,n);
|
|
} else {
|
|
throw (new Error(["nth not supported on this type ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.type__GT_str(cljs.core.type(coll)))].join('')));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.nth.cljs$core$IFn$_invoke$arity$3 = (function (coll,n,not_found){
|
|
if((!(typeof n === 'number'))){
|
|
throw (new Error("Index argument to nth must be a number."));
|
|
} else {
|
|
if((coll == null)){
|
|
return not_found;
|
|
} else {
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (16))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IIndexed$))))?true:false):false)){
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(null,n,not_found);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
if((((n >= (0))) && ((n < coll.length)))){
|
|
return (coll[n]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
if((((n >= (0))) && ((n < coll.length)))){
|
|
return coll.charAt(n);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if((function (){var or__4047__auto__ = (((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$))))?true:false):false);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
if((!((coll == null)))){
|
|
if((((coll.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISequential$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
})()){
|
|
if((n < (0))){
|
|
return not_found;
|
|
} else {
|
|
return cljs.core.linear_traversal_nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
|
|
}
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.IIndexed,coll)){
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(coll,n,not_found);
|
|
} else {
|
|
throw (new Error(["nth not supported on this type ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.type__GT_str(cljs.core.type(coll)))].join('')));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.nth.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns the nth rest of coll, coll when n is 0.
|
|
*/
|
|
cljs.core.nthrest = (function cljs$core$nthrest(coll,n){
|
|
var n__$1 = n;
|
|
var xs = coll;
|
|
while(true){
|
|
var temp__5455__auto__ = (((n__$1 > (0))) && (cljs.core.seq(xs)));
|
|
if(temp__5455__auto__){
|
|
var xs__$1 = temp__5455__auto__;
|
|
var G__854 = (n__$1 - (1));
|
|
var G__855 = cljs.core.rest(xs__$1);
|
|
n__$1 = G__854;
|
|
xs = G__855;
|
|
continue;
|
|
} else {
|
|
return xs;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the value mapped to key, not-found or nil if key not present.
|
|
*/
|
|
cljs.core.get = (function cljs$core$get(var_args){
|
|
var G__857 = arguments.length;
|
|
switch (G__857) {
|
|
case 2:
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.get.cljs$core$IFn$_invoke$arity$2 = (function (o,k){
|
|
if((o == null)){
|
|
return null;
|
|
} else {
|
|
if((((!((o == null))))?(((((o.cljs$lang$protocol_mask$partition0$ & (256))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$ILookup$))))?true:false):false)){
|
|
return o.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(o)){
|
|
if((((!((k == null)))) && ((k < o.length)))){
|
|
return (o[(k | (0))]);
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if(typeof o === 'string'){
|
|
if((((!((k == null)))) && ((k < o.length)))){
|
|
return o.charAt((k | (0)));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.ILookup,o)){
|
|
return cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(o,k);
|
|
} else {
|
|
return null;
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.get.cljs$core$IFn$_invoke$arity$3 = (function (o,k,not_found){
|
|
if((!((o == null)))){
|
|
if((((!((o == null))))?(((((o.cljs$lang$protocol_mask$partition0$ & (256))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$ILookup$))))?true:false):false)){
|
|
return o.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(o)){
|
|
if((((!((k == null)))) && ((k >= (0))) && ((k < o.length)))){
|
|
return (o[(k | (0))]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if(typeof o === 'string'){
|
|
if((((!((k == null)))) && ((k >= (0))) && ((k < o.length)))){
|
|
return o.charAt((k | (0)));
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.ILookup,o)){
|
|
return cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(o,k,not_found);
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.get.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
|
|
/**
|
|
* assoc[iate]. When applied to a map, returns a new map of the
|
|
* same (hashed/sorted) type, that contains the mapping of key(s) to
|
|
* val(s). When applied to a vector, returns a new vector that
|
|
* contains val at index.
|
|
*/
|
|
cljs.core.assoc = (function cljs$core$assoc(var_args){
|
|
var G__866 = arguments.length;
|
|
switch (G__866) {
|
|
case 3:
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___868 = arguments.length;
|
|
var i__4642__auto___869 = (0);
|
|
while(true){
|
|
if((i__4642__auto___869 < len__4641__auto___868)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___869]));
|
|
|
|
var G__870 = (i__4642__auto___869 + (1));
|
|
i__4642__auto___869 = G__870;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.assoc.cljs$core$IFn$_invoke$arity$3 = (function (coll,k,v){
|
|
if((!((coll == null)))){
|
|
return cljs.core._assoc(coll,k,v);
|
|
} else {
|
|
return cljs.core.PersistentArrayMap.createAsIfByAssoc([k,v]);
|
|
}
|
|
});
|
|
|
|
cljs.core.assoc.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,v,kvs){
|
|
while(true){
|
|
var ret = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(coll,k,v);
|
|
if(cljs.core.truth_(kvs)){
|
|
var G__871 = ret;
|
|
var G__872 = cljs.core.first(kvs);
|
|
var G__873 = cljs.core.second(kvs);
|
|
var G__874 = cljs.core.nnext(kvs);
|
|
coll = G__871;
|
|
k = G__872;
|
|
v = G__873;
|
|
kvs = G__874;
|
|
continue;
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.assoc.cljs$lang$applyTo = (function (seq862){
|
|
var G__863 = cljs.core.first(seq862);
|
|
var seq862__$1 = cljs.core.next(seq862);
|
|
var G__864 = cljs.core.first(seq862__$1);
|
|
var seq862__$2 = cljs.core.next(seq862__$1);
|
|
var G__865 = cljs.core.first(seq862__$2);
|
|
var seq862__$3 = cljs.core.next(seq862__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__863,G__864,G__865,seq862__$3);
|
|
});
|
|
|
|
cljs.core.assoc.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* dissoc[iate]. Returns a new map of the same (hashed/sorted) type,
|
|
* that does not contain a mapping for key(s).
|
|
*/
|
|
cljs.core.dissoc = (function cljs$core$dissoc(var_args){
|
|
var G__879 = arguments.length;
|
|
switch (G__879) {
|
|
case 1:
|
|
return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___881 = arguments.length;
|
|
var i__4642__auto___882 = (0);
|
|
while(true){
|
|
if((i__4642__auto___882 < len__4641__auto___881)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___882]));
|
|
|
|
var G__883 = (i__4642__auto___882 + (1));
|
|
i__4642__auto___882 = G__883;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.dissoc.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
return coll;
|
|
});
|
|
|
|
cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2 = (function (coll,k){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._dissoc(coll,k);
|
|
}
|
|
});
|
|
|
|
cljs.core.dissoc.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,ks){
|
|
while(true){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
var ret = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(coll,k);
|
|
if(cljs.core.truth_(ks)){
|
|
var G__884 = ret;
|
|
var G__885 = cljs.core.first(ks);
|
|
var G__886 = cljs.core.next(ks);
|
|
coll = G__884;
|
|
k = G__885;
|
|
ks = G__886;
|
|
continue;
|
|
} else {
|
|
return ret;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.dissoc.cljs$lang$applyTo = (function (seq876){
|
|
var G__877 = cljs.core.first(seq876);
|
|
var seq876__$1 = cljs.core.next(seq876);
|
|
var G__878 = cljs.core.first(seq876__$1);
|
|
var seq876__$2 = cljs.core.next(seq876__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__877,G__878,seq876__$2);
|
|
});
|
|
|
|
cljs.core.dissoc.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Return true if f is a JavaScript function or satisfies the Fn protocol.
|
|
*/
|
|
cljs.core.fn_QMARK_ = (function cljs$core$fn_QMARK_(f){
|
|
var or__4047__auto__ = goog.isFunction(f);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
if((!((f == null)))){
|
|
if(((false) || ((cljs.core.PROTOCOL_SENTINEL === f.cljs$core$Fn$)))){
|
|
return true;
|
|
} else {
|
|
if((!f.cljs$lang$protocol_mask$partition$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.Fn,f);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.Fn,f);
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.Fn}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.MetaFn = (function (afn,meta){
|
|
this.afn = afn;
|
|
this.meta = meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 393217;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.MetaFn.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_,new_meta){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.MetaFn(self__.afn,new_meta));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$Fn$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.MetaFn.prototype.call = (function() {
|
|
var G__890 = null;
|
|
var G__890__1 = (function (self__){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$0 ? self__.afn.cljs$core$IFn$_invoke$arity$0() : self__.afn.call(null));
|
|
});
|
|
var G__890__2 = (function (self__,a){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$1 ? self__.afn.cljs$core$IFn$_invoke$arity$1(a) : self__.afn.call(null,a));
|
|
});
|
|
var G__890__3 = (function (self__,a,b){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$2 ? self__.afn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.afn.call(null,a,b));
|
|
});
|
|
var G__890__4 = (function (self__,a,b,c){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$3 ? self__.afn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.afn.call(null,a,b,c));
|
|
});
|
|
var G__890__5 = (function (self__,a,b,c,d){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$4 ? self__.afn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.afn.call(null,a,b,c,d));
|
|
});
|
|
var G__890__6 = (function (self__,a,b,c,d,e){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$5 ? self__.afn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.afn.call(null,a,b,c,d,e));
|
|
});
|
|
var G__890__7 = (function (self__,a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$6 ? self__.afn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.afn.call(null,a,b,c,d,e,f));
|
|
});
|
|
var G__890__8 = (function (self__,a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$7 ? self__.afn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.afn.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
var G__890__9 = (function (self__,a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$8 ? self__.afn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.afn.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
var G__890__10 = (function (self__,a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$9 ? self__.afn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.afn.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
var G__890__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$10 ? self__.afn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
var G__890__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$11 ? self__.afn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
var G__890__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$12 ? self__.afn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
var G__890__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$13 ? self__.afn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
var G__890__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$14 ? self__.afn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
var G__890__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$15 ? self__.afn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
var G__890__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$16 ? self__.afn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
var G__890__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$17 ? self__.afn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
var G__890__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$18 ? self__.afn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
var G__890__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$19 ? self__.afn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
var G__890__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$20 ? self__.afn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
var G__890__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var _ = self____$1;
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.afn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
G__890 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__890__1.call(this,self__);
|
|
case 2:
|
|
return G__890__2.call(this,self__,a);
|
|
case 3:
|
|
return G__890__3.call(this,self__,a,b);
|
|
case 4:
|
|
return G__890__4.call(this,self__,a,b,c);
|
|
case 5:
|
|
return G__890__5.call(this,self__,a,b,c,d);
|
|
case 6:
|
|
return G__890__6.call(this,self__,a,b,c,d,e);
|
|
case 7:
|
|
return G__890__7.call(this,self__,a,b,c,d,e,f);
|
|
case 8:
|
|
return G__890__8.call(this,self__,a,b,c,d,e,f,g);
|
|
case 9:
|
|
return G__890__9.call(this,self__,a,b,c,d,e,f,g,h);
|
|
case 10:
|
|
return G__890__10.call(this,self__,a,b,c,d,e,f,g,h,i);
|
|
case 11:
|
|
return G__890__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
|
|
case 12:
|
|
return G__890__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
|
|
case 13:
|
|
return G__890__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
|
|
case 14:
|
|
return G__890__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
|
|
case 15:
|
|
return G__890__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
|
|
case 16:
|
|
return G__890__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
|
|
case 17:
|
|
return G__890__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
|
|
case 18:
|
|
return G__890__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
|
|
case 19:
|
|
return G__890__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
|
|
case 20:
|
|
return G__890__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
|
|
case 21:
|
|
return G__890__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
|
|
case 22:
|
|
return G__890__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__890.cljs$core$IFn$_invoke$arity$1 = G__890__1;
|
|
G__890.cljs$core$IFn$_invoke$arity$2 = G__890__2;
|
|
G__890.cljs$core$IFn$_invoke$arity$3 = G__890__3;
|
|
G__890.cljs$core$IFn$_invoke$arity$4 = G__890__4;
|
|
G__890.cljs$core$IFn$_invoke$arity$5 = G__890__5;
|
|
G__890.cljs$core$IFn$_invoke$arity$6 = G__890__6;
|
|
G__890.cljs$core$IFn$_invoke$arity$7 = G__890__7;
|
|
G__890.cljs$core$IFn$_invoke$arity$8 = G__890__8;
|
|
G__890.cljs$core$IFn$_invoke$arity$9 = G__890__9;
|
|
G__890.cljs$core$IFn$_invoke$arity$10 = G__890__10;
|
|
G__890.cljs$core$IFn$_invoke$arity$11 = G__890__11;
|
|
G__890.cljs$core$IFn$_invoke$arity$12 = G__890__12;
|
|
G__890.cljs$core$IFn$_invoke$arity$13 = G__890__13;
|
|
G__890.cljs$core$IFn$_invoke$arity$14 = G__890__14;
|
|
G__890.cljs$core$IFn$_invoke$arity$15 = G__890__15;
|
|
G__890.cljs$core$IFn$_invoke$arity$16 = G__890__16;
|
|
G__890.cljs$core$IFn$_invoke$arity$17 = G__890__17;
|
|
G__890.cljs$core$IFn$_invoke$arity$18 = G__890__18;
|
|
G__890.cljs$core$IFn$_invoke$arity$19 = G__890__19;
|
|
G__890.cljs$core$IFn$_invoke$arity$20 = G__890__20;
|
|
G__890.cljs$core$IFn$_invoke$arity$21 = G__890__21;
|
|
G__890.cljs$core$IFn$_invoke$arity$22 = G__890__22;
|
|
return G__890;
|
|
})()
|
|
;
|
|
|
|
cljs.core.MetaFn.prototype.apply = (function (self__,args889){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args889)));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$0 ? self__.afn.cljs$core$IFn$_invoke$arity$0() : self__.afn.call(null));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$1 ? self__.afn.cljs$core$IFn$_invoke$arity$1(a) : self__.afn.call(null,a));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$2 ? self__.afn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.afn.call(null,a,b));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$3 ? self__.afn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.afn.call(null,a,b,c));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$4 ? self__.afn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.afn.call(null,a,b,c,d));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$5 ? self__.afn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.afn.call(null,a,b,c,d,e));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$6 ? self__.afn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.afn.call(null,a,b,c,d,e,f));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$7 ? self__.afn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.afn.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$8 ? self__.afn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.afn.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$9 ? self__.afn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.afn.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$10 ? self__.afn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$11 ? self__.afn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$12 ? self__.afn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$13 ? self__.afn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$14 ? self__.afn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$15 ? self__.afn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$16 ? self__.afn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$17 ? self__.afn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$18 ? self__.afn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$19 ? self__.afn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.afn.cljs$core$IFn$_invoke$arity$20 ? self__.afn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.afn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
|
|
cljs.core.MetaFn.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.afn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
|
|
cljs.core.MetaFn.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$afn,cljs.core.cst$sym$meta], null);
|
|
});
|
|
|
|
cljs.core.MetaFn.cljs$lang$type = true;
|
|
|
|
cljs.core.MetaFn.cljs$lang$ctorStr = "cljs.core/MetaFn";
|
|
|
|
cljs.core.MetaFn.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/MetaFn");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/MetaFn.
|
|
*/
|
|
cljs.core.__GT_MetaFn = (function cljs$core$__GT_MetaFn(afn,meta){
|
|
return (new cljs.core.MetaFn(afn,meta));
|
|
});
|
|
|
|
/**
|
|
* Returns an object of the same type and value as obj, with
|
|
* map m as its metadata.
|
|
*/
|
|
cljs.core.with_meta = (function cljs$core$with_meta(o,meta){
|
|
if(goog.isFunction(o)){
|
|
return (new cljs.core.MetaFn(o,meta));
|
|
} else {
|
|
if((o == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._with_meta(o,meta);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the metadata of obj, returns nil if there is no metadata.
|
|
*/
|
|
cljs.core.meta = (function cljs$core$meta(o){
|
|
if((function (){var and__4036__auto__ = (!((o == null)));
|
|
if(and__4036__auto__){
|
|
if((!((o == null)))){
|
|
if((((o.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === o.cljs$core$IMeta$)))){
|
|
return true;
|
|
} else {
|
|
if((!o.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IMeta,o);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IMeta,o);
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})()){
|
|
return cljs.core._meta(o);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* For a list or queue, same as first, for a vector, same as, but much
|
|
* more efficient than, last. If the collection is empty, returns nil.
|
|
*/
|
|
cljs.core.peek = (function cljs$core$peek(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._peek(coll);
|
|
}
|
|
});
|
|
/**
|
|
* For a list or queue, returns a new list/queue without the first
|
|
* item, for a vector, returns a new vector without the last item.
|
|
* Note - not the same as next/butlast.
|
|
*/
|
|
cljs.core.pop = (function cljs$core$pop(coll){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._pop(coll);
|
|
}
|
|
});
|
|
/**
|
|
* disj[oin]. Returns a new set of the same (hashed/sorted) type, that
|
|
* does not contain key(s).
|
|
*/
|
|
cljs.core.disj = (function cljs$core$disj(var_args){
|
|
var G__897 = arguments.length;
|
|
switch (G__897) {
|
|
case 1:
|
|
return cljs.core.disj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.disj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___899 = arguments.length;
|
|
var i__4642__auto___900 = (0);
|
|
while(true){
|
|
if((i__4642__auto___900 < len__4641__auto___899)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___900]));
|
|
|
|
var G__901 = (i__4642__auto___900 + (1));
|
|
i__4642__auto___900 = G__901;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.disj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.disj.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
return coll;
|
|
});
|
|
|
|
cljs.core.disj.cljs$core$IFn$_invoke$arity$2 = (function (coll,k){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._disjoin(coll,k);
|
|
}
|
|
});
|
|
|
|
cljs.core.disj.cljs$core$IFn$_invoke$arity$variadic = (function (coll,k,ks){
|
|
while(true){
|
|
if((coll == null)){
|
|
return null;
|
|
} else {
|
|
var ret = cljs.core.disj.cljs$core$IFn$_invoke$arity$2(coll,k);
|
|
if(cljs.core.truth_(ks)){
|
|
var G__902 = ret;
|
|
var G__903 = cljs.core.first(ks);
|
|
var G__904 = cljs.core.next(ks);
|
|
coll = G__902;
|
|
k = G__903;
|
|
ks = G__904;
|
|
continue;
|
|
} else {
|
|
return ret;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.disj.cljs$lang$applyTo = (function (seq894){
|
|
var G__895 = cljs.core.first(seq894);
|
|
var seq894__$1 = cljs.core.next(seq894);
|
|
var G__896 = cljs.core.first(seq894__$1);
|
|
var seq894__$2 = cljs.core.next(seq894__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__895,G__896,seq894__$2);
|
|
});
|
|
|
|
cljs.core.disj.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns true if coll has no items - same as (not (seq coll)).
|
|
* Please use the idiom (seq x) rather than (not (empty? x))
|
|
*/
|
|
cljs.core.empty_QMARK_ = (function cljs$core$empty_QMARK_(coll){
|
|
return (((coll == null)) || (cljs.core.not(cljs.core.seq(coll))));
|
|
});
|
|
/**
|
|
* Returns true if x satisfies ICollection
|
|
*/
|
|
cljs.core.coll_QMARK_ = (function cljs$core$coll_QMARK_(x){
|
|
if((x == null)){
|
|
return false;
|
|
} else {
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (8))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ICollection$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICollection,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ICollection,x);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if x satisfies ISet
|
|
*/
|
|
cljs.core.set_QMARK_ = (function cljs$core$set_QMARK_(x){
|
|
if((x == null)){
|
|
return false;
|
|
} else {
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISet$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll implements IAssociative
|
|
*/
|
|
cljs.core.associative_QMARK_ = (function cljs$core$associative_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (512))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IAssociative$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IAssociative,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IAssociative,x);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll implements IFind
|
|
*/
|
|
cljs.core.ifind_QMARK_ = (function cljs$core$ifind_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IFind$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IFind,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IFind,x);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll satisfies ISequential
|
|
*/
|
|
cljs.core.sequential_QMARK_ = (function cljs$core$sequential_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISequential$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll satisfies ISorted
|
|
*/
|
|
cljs.core.sorted_QMARK_ = (function cljs$core$sorted_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (268435456))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISorted$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISorted,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISorted,x);
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if coll satisfies IReduce
|
|
*/
|
|
cljs.core.reduceable_QMARK_ = (function cljs$core$reduceable_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IReduce$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,x);
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x satisfies IMap
|
|
*/
|
|
cljs.core.map_QMARK_ = (function cljs$core$map_QMARK_(x){
|
|
if((x == null)){
|
|
return false;
|
|
} else {
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMap$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x satisfies IRecord
|
|
*/
|
|
cljs.core.record_QMARK_ = (function cljs$core$record_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (67108864))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IRecord$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IRecord,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IRecord,x);
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x satisfies IVector
|
|
*/
|
|
cljs.core.vector_QMARK_ = (function cljs$core$vector_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (16384))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IVector$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IVector,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IVector,x);
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Return true if x is satisfies IChunkedSeq.
|
|
*/
|
|
cljs.core.chunked_seq_QMARK_ = (function cljs$core$chunked_seq_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition1$ & (512))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IChunkedSeq$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
/**
|
|
* Create JavaSript object from an even number arguments representing
|
|
* interleaved keys and values.
|
|
*/
|
|
cljs.core.js_obj = (function cljs$core$js_obj(var_args){
|
|
var G__918 = arguments.length;
|
|
switch (G__918) {
|
|
case 0:
|
|
return cljs.core.js_obj.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___922 = arguments.length;
|
|
var i__4642__auto___923 = (0);
|
|
while(true){
|
|
if((i__4642__auto___923 < len__4641__auto___922)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___923]));
|
|
|
|
var G__924 = (i__4642__auto___923 + (1));
|
|
i__4642__auto___923 = G__924;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((0)),(0),null));
|
|
return cljs.core.js_obj.cljs$core$IFn$_invoke$arity$variadic(argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.js_obj.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return {};
|
|
});
|
|
|
|
cljs.core.js_obj.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(goog.object.create,keyvals);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.js_obj.cljs$lang$applyTo = (function (seq917){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq917));
|
|
});
|
|
|
|
cljs.core.js_obj.cljs$lang$maxFixedArity = (0);
|
|
|
|
/**
|
|
* Return the JavaScript keys for an object.
|
|
*/
|
|
cljs.core.js_keys = (function cljs$core$js_keys(obj){
|
|
return goog.object.getKeys(obj);
|
|
});
|
|
/**
|
|
* Delete a property from a JavaScript object.
|
|
* Returns true upon success, false otherwise.
|
|
*/
|
|
cljs.core.js_delete = (function cljs$core$js_delete(obj,key){
|
|
return delete obj[key];
|
|
});
|
|
cljs.core.array_copy = (function cljs$core$array_copy(from,i,to,j,len){
|
|
var i__$1 = i;
|
|
var j__$1 = j;
|
|
var len__$1 = len;
|
|
while(true){
|
|
if((len__$1 === (0))){
|
|
return to;
|
|
} else {
|
|
(to[j__$1] = (from[i__$1]));
|
|
|
|
var G__925 = (i__$1 + (1));
|
|
var G__926 = (j__$1 + (1));
|
|
var G__927 = (len__$1 - (1));
|
|
i__$1 = G__925;
|
|
j__$1 = G__926;
|
|
len__$1 = G__927;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_copy_downward = (function cljs$core$array_copy_downward(from,i,to,j,len){
|
|
var i__$1 = (i + (len - (1)));
|
|
var j__$1 = (j + (len - (1)));
|
|
var len__$1 = len;
|
|
while(true){
|
|
if((len__$1 === (0))){
|
|
return to;
|
|
} else {
|
|
(to[j__$1] = (from[i__$1]));
|
|
|
|
var G__928 = (i__$1 - (1));
|
|
var G__929 = (j__$1 - (1));
|
|
var G__930 = (len__$1 - (1));
|
|
i__$1 = G__928;
|
|
j__$1 = G__929;
|
|
len__$1 = G__930;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.lookup_sentinel = {};
|
|
/**
|
|
* Returns true if x is the value false, false otherwise.
|
|
*/
|
|
cljs.core.false_QMARK_ = (function cljs$core$false_QMARK_(x){
|
|
return x === false;
|
|
});
|
|
/**
|
|
* Returns true if x is the value true, false otherwise.
|
|
*/
|
|
cljs.core.true_QMARK_ = (function cljs$core$true_QMARK_(x){
|
|
return x === true;
|
|
});
|
|
/**
|
|
* Return true if x is a Boolean
|
|
*/
|
|
cljs.core.boolean_QMARK_ = (function cljs$core$boolean_QMARK_(x){
|
|
return ((x === true) || (x === false));
|
|
});
|
|
/**
|
|
* Returns true if x identical to the JavaScript undefined value.
|
|
*/
|
|
cljs.core.undefined_QMARK_ = (function cljs$core$undefined_QMARK_(x){
|
|
return (void 0 === x);
|
|
});
|
|
/**
|
|
* Return true if s satisfies ISeq
|
|
*/
|
|
cljs.core.seq_QMARK_ = (function cljs$core$seq_QMARK_(s){
|
|
if((s == null)){
|
|
return false;
|
|
} else {
|
|
if((!((s == null)))){
|
|
if((((s.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$ISeq$)))){
|
|
return true;
|
|
} else {
|
|
if((!s.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISeq,s);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.ISeq,s);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Return true if the seq function is supported for s
|
|
*/
|
|
cljs.core.seqable_QMARK_ = (function cljs$core$seqable_QMARK_(s){
|
|
var or__4047__auto__ = (s == null);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (((!((s == null))))?(((((s.cljs$lang$protocol_mask$partition0$ & (8388608))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$ISeqable$))))?true:(((!s.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,s):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISeqable,s));
|
|
if(or__4047__auto____$1){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return ((cljs.core.array_QMARK_(s)) || (typeof s === 'string'));
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Coerce to boolean
|
|
*/
|
|
cljs.core.boolean$ = (function cljs$core$boolean(x){
|
|
if((x == null)){
|
|
return false;
|
|
} else {
|
|
if(x === false){
|
|
return false;
|
|
} else {
|
|
return true;
|
|
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if f returns true for fn? or satisfies IFn.
|
|
*/
|
|
cljs.core.ifn_QMARK_ = (function cljs$core$ifn_QMARK_(f){
|
|
var or__4047__auto__ = cljs.core.fn_QMARK_(f);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
if((!((f == null)))){
|
|
if((((f.cljs$lang$protocol_mask$partition0$ & (1))) || ((cljs.core.PROTOCOL_SENTINEL === f.cljs$core$IFn$)))){
|
|
return true;
|
|
} else {
|
|
if((!f.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IFn,f);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IFn,f);
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if n is a JavaScript number with no decimal part.
|
|
*/
|
|
cljs.core.integer_QMARK_ = (function cljs$core$integer_QMARK_(n){
|
|
return ((typeof n === 'number') && ((!(isNaN(n)))) && ((!((n === Infinity)))) && ((parseFloat(n) === parseInt(n,(10)))));
|
|
});
|
|
/**
|
|
* Return true if x satisfies integer? or is an instance of goog.math.Integer
|
|
* or goog.math.Long.
|
|
*/
|
|
cljs.core.int_QMARK_ = (function cljs$core$int_QMARK_(x){
|
|
return ((cljs.core.integer_QMARK_(x)) || ((x instanceof goog.math.Integer)) || ((x instanceof goog.math.Long)));
|
|
});
|
|
/**
|
|
* Return true if x satisfies int? and is positive.
|
|
*/
|
|
cljs.core.pos_int_QMARK_ = (function cljs$core$pos_int_QMARK_(x){
|
|
if(cljs.core.integer_QMARK_(x)){
|
|
return (x > (0));
|
|
} else {
|
|
if((x instanceof goog.math.Integer)){
|
|
return ((cljs.core.not(x.isNegative())) && (cljs.core.not(x.isZero())));
|
|
} else {
|
|
if((x instanceof goog.math.Long)){
|
|
return ((cljs.core.not(x.isNegative())) && (cljs.core.not(x.isZero())));
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x satisfies int? and is negative.
|
|
*/
|
|
cljs.core.neg_int_QMARK_ = (function cljs$core$neg_int_QMARK_(x){
|
|
if(cljs.core.integer_QMARK_(x)){
|
|
return (x < (0));
|
|
} else {
|
|
if((x instanceof goog.math.Integer)){
|
|
return x.isNegative();
|
|
} else {
|
|
if((x instanceof goog.math.Long)){
|
|
return x.isNegative();
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x satisfies int? and is a natural integer value.
|
|
*/
|
|
cljs.core.nat_int_QMARK_ = (function cljs$core$nat_int_QMARK_(x){
|
|
if(cljs.core.integer_QMARK_(x)){
|
|
return (!((x < (0))));
|
|
} else {
|
|
if((x instanceof goog.math.Integer)){
|
|
return cljs.core.not(x.isNegative());
|
|
} else {
|
|
if((x instanceof goog.math.Long)){
|
|
return cljs.core.not(x.isNegative());
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true for JavaScript numbers, false otherwise.
|
|
*/
|
|
cljs.core.float_QMARK_ = (function cljs$core$float_QMARK_(x){
|
|
return typeof x === 'number';
|
|
});
|
|
/**
|
|
* Returns true for JavaScript numbers, false otherwise.
|
|
*/
|
|
cljs.core.double_QMARK_ = (function cljs$core$double_QMARK_(x){
|
|
return typeof x === 'number';
|
|
});
|
|
/**
|
|
* Returns true for Infinity and -Infinity values.
|
|
*/
|
|
cljs.core.infinite_QMARK_ = (function cljs$core$infinite_QMARK_(x){
|
|
return (((x === Number.POSITIVE_INFINITY)) || ((x === Number.NEGATIVE_INFINITY)));
|
|
});
|
|
/**
|
|
* Returns true if key is present in the given collection, otherwise
|
|
* returns false. Note that for numerically indexed collections like
|
|
* vectors and arrays, this tests if the numeric key is within the
|
|
* range of indexes. 'contains?' operates constant or logarithmic time;
|
|
* it will not perform a linear search for a value. See also 'some'.
|
|
*/
|
|
cljs.core.contains_QMARK_ = (function cljs$core$contains_QMARK_(coll,v){
|
|
if((cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,v,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return false;
|
|
} else {
|
|
return true;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the map entry for key, or nil if key not present.
|
|
*/
|
|
cljs.core.find = (function cljs$core$find(coll,k){
|
|
if(cljs.core.ifind_QMARK_(coll)){
|
|
return cljs.core._find(coll,k);
|
|
} else {
|
|
if((((!((coll == null)))) && (cljs.core.associative_QMARK_(coll)) && (cljs.core.contains_QMARK_(coll,k)))){
|
|
return (new cljs.core.MapEntry(k,cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,k),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if no two of the arguments are =
|
|
*/
|
|
cljs.core.distinct_QMARK_ = (function cljs$core$distinct_QMARK_(var_args){
|
|
var G__943 = arguments.length;
|
|
switch (G__943) {
|
|
case 1:
|
|
return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___945 = arguments.length;
|
|
var i__4642__auto___946 = (0);
|
|
while(true){
|
|
if((i__4642__auto___946 < len__4641__auto___945)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___946]));
|
|
|
|
var G__947 = (i__4642__auto___946 + (1));
|
|
i__4642__auto___946 = G__947;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (!(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)));
|
|
});
|
|
|
|
cljs.core.distinct_QMARK_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
if((!(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)))){
|
|
var s = cljs.core.PersistentHashSet.createAsIfByAssoc([x,y]);
|
|
var xs = more;
|
|
while(true){
|
|
var x__$1 = cljs.core.first(xs);
|
|
var etc = cljs.core.next(xs);
|
|
if(cljs.core.truth_(xs)){
|
|
if(cljs.core.contains_QMARK_(s,x__$1)){
|
|
return false;
|
|
} else {
|
|
var G__948 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(s,x__$1);
|
|
var G__949 = etc;
|
|
s = G__948;
|
|
xs = G__949;
|
|
continue;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.distinct_QMARK_.cljs$lang$applyTo = (function (seq940){
|
|
var G__941 = cljs.core.first(seq940);
|
|
var seq940__$1 = cljs.core.next(seq940);
|
|
var G__942 = cljs.core.first(seq940__$1);
|
|
var seq940__$2 = cljs.core.next(seq940__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__941,G__942,seq940__$2);
|
|
});
|
|
|
|
cljs.core.distinct_QMARK_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Comparator. Returns a negative number, zero, or a positive number
|
|
* when x is logically 'less than', 'equal to', or 'greater than'
|
|
* y. Uses IComparable if available and google.array.defaultCompare for objects
|
|
* of the same type and special-cases nil to be less than any other object.
|
|
*/
|
|
cljs.core.compare = (function cljs$core$compare(x,y){
|
|
if((x === y)){
|
|
return (0);
|
|
} else {
|
|
if((x == null)){
|
|
return (-1);
|
|
} else {
|
|
if((y == null)){
|
|
return (1);
|
|
} else {
|
|
if(typeof x === 'number'){
|
|
if(typeof y === 'number'){
|
|
return goog.array.defaultCompare(x,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
} else {
|
|
if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition1$ & (2048))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IComparable$))))?true:(((!x.cljs$lang$protocol_mask$partition1$))?cljs.core.native_satisfies_QMARK_(cljs.core.IComparable,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IComparable,x))){
|
|
return cljs.core._compare(x,y);
|
|
} else {
|
|
if(((((typeof x === 'string') || (cljs.core.array_QMARK_(x)) || (x === true) || (x === false))) && ((cljs.core.type(x) === cljs.core.type(y))))){
|
|
return goog.array.defaultCompare(x,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Compare indexed collection.
|
|
*/
|
|
cljs.core.compare_indexed = (function cljs$core$compare_indexed(var_args){
|
|
var G__952 = arguments.length;
|
|
switch (G__952) {
|
|
case 2:
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2 = (function (xs,ys){
|
|
var xl = cljs.core.count(xs);
|
|
var yl = cljs.core.count(ys);
|
|
if((xl < yl)){
|
|
return (-1);
|
|
} else {
|
|
if((xl > yl)){
|
|
return (1);
|
|
} else {
|
|
if((xl === (0))){
|
|
return (0);
|
|
} else {
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4(xs,ys,xl,(0));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$4 = (function (xs,ys,len,n){
|
|
while(true){
|
|
var d = cljs.core.compare(cljs.core.nth.cljs$core$IFn$_invoke$arity$2(xs,n),cljs.core.nth.cljs$core$IFn$_invoke$arity$2(ys,n));
|
|
if((((d === (0))) && (((n + (1)) < len)))){
|
|
var G__954 = xs;
|
|
var G__955 = ys;
|
|
var G__956 = len;
|
|
var G__957 = (n + (1));
|
|
xs = G__954;
|
|
ys = G__955;
|
|
len = G__956;
|
|
n = G__957;
|
|
continue;
|
|
} else {
|
|
return d;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.compare_indexed.cljs$lang$maxFixedArity = 4;
|
|
|
|
/**
|
|
* Given a fn that might be boolean valued or a comparator,
|
|
* return a fn that is a comparator.
|
|
*/
|
|
cljs.core.fn__GT_comparator = (function cljs$core$fn__GT_comparator(f){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(f,cljs.core.compare)){
|
|
return cljs.core.compare;
|
|
} else {
|
|
return (function (x,y){
|
|
var r = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y));
|
|
if(typeof r === 'number'){
|
|
return r;
|
|
} else {
|
|
if(cljs.core.truth_(r)){
|
|
return (-1);
|
|
} else {
|
|
if(cljs.core.truth_((f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(y,x) : f.call(null,y,x)))){
|
|
return (1);
|
|
} else {
|
|
return (0);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
});
|
|
/**
|
|
* Returns a sorted sequence of the items in coll. Comp can be
|
|
* boolean-valued comparison function, or a -/0/+ valued comparator.
|
|
* Comp defaults to compare.
|
|
*/
|
|
cljs.core.sort = (function cljs$core$sort(var_args){
|
|
var G__959 = arguments.length;
|
|
switch (G__959) {
|
|
case 1:
|
|
return cljs.core.sort.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.sort.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.sort.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
return cljs.core.sort.cljs$core$IFn$_invoke$arity$2(cljs.core.compare,coll);
|
|
});
|
|
|
|
cljs.core.sort.cljs$core$IFn$_invoke$arity$2 = (function (comp,coll){
|
|
if(cljs.core.seq(coll)){
|
|
var a = cljs.core.to_array(coll);
|
|
var G__960_963 = a;
|
|
var G__961_964 = cljs.core.fn__GT_comparator(comp);
|
|
goog.array.stableSort(G__960_963,G__961_964);
|
|
|
|
return cljs.core.seq(a);
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.sort.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a sorted sequence of the items in coll, where the sort
|
|
* order is determined by comparing (keyfn item). Comp can be
|
|
* boolean-valued comparison function, or a -/0/+ valued comparator.
|
|
* Comp defaults to compare.
|
|
*/
|
|
cljs.core.sort_by = (function cljs$core$sort_by(var_args){
|
|
var G__966 = arguments.length;
|
|
switch (G__966) {
|
|
case 2:
|
|
return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.sort_by.cljs$core$IFn$_invoke$arity$2 = (function (keyfn,coll){
|
|
return cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3(keyfn,cljs.core.compare,coll);
|
|
});
|
|
|
|
cljs.core.sort_by.cljs$core$IFn$_invoke$arity$3 = (function (keyfn,comp,coll){
|
|
return cljs.core.sort.cljs$core$IFn$_invoke$arity$2((function (x,y){
|
|
var G__968 = (keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(x) : keyfn.call(null,x));
|
|
var G__969 = (keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(y) : keyfn.call(null,y));
|
|
var fexpr__967 = cljs.core.fn__GT_comparator(comp);
|
|
return (fexpr__967.cljs$core$IFn$_invoke$arity$2 ? fexpr__967.cljs$core$IFn$_invoke$arity$2(G__968,G__969) : fexpr__967.call(null,G__968,G__969));
|
|
}),coll);
|
|
});
|
|
|
|
cljs.core.sort_by.cljs$lang$maxFixedArity = 3;
|
|
|
|
cljs.core.seq_reduce = (function cljs$core$seq_reduce(var_args){
|
|
var G__972 = arguments.length;
|
|
switch (G__972) {
|
|
case 2:
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
var temp__5455__auto__ = cljs.core.seq(coll);
|
|
if(temp__5455__auto__){
|
|
var s = temp__5455__auto__;
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(f,cljs.core.first(s),cljs.core.next(s));
|
|
} else {
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
}
|
|
});
|
|
|
|
cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3 = (function (f,val,coll){
|
|
var val__$1 = val;
|
|
var coll__$1 = cljs.core.seq(coll);
|
|
while(true){
|
|
if(coll__$1){
|
|
var nval = (function (){var G__973 = val__$1;
|
|
var G__974 = cljs.core.first(coll__$1);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__973,G__974) : f.call(null,G__973,G__974));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nval)){
|
|
return cljs.core.deref(nval);
|
|
} else {
|
|
var G__976 = nval;
|
|
var G__977 = cljs.core.next(coll__$1);
|
|
val__$1 = G__976;
|
|
coll__$1 = G__977;
|
|
continue;
|
|
}
|
|
} else {
|
|
return val__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.seq_reduce.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Return a random permutation of coll
|
|
*/
|
|
cljs.core.shuffle = (function cljs$core$shuffle(coll){
|
|
var a = cljs.core.to_array(coll);
|
|
goog.array.shuffle(a);
|
|
|
|
return cljs.core.vec(a);
|
|
});
|
|
cljs.core.iter_reduce = (function cljs$core$iter_reduce(var_args){
|
|
var G__979 = arguments.length;
|
|
switch (G__979) {
|
|
case 2:
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2 = (function (coll,f){
|
|
var iter = cljs.core._iterator(coll);
|
|
if(cljs.core.truth_(iter.hasNext())){
|
|
var init = iter.next();
|
|
var acc = init;
|
|
while(true){
|
|
if(iter.hasNext()){
|
|
var nacc = (function (){var G__980 = acc;
|
|
var G__981 = iter.next();
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__980,G__981) : f.call(null,G__980,G__981));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nacc)){
|
|
return cljs.core.deref(nacc);
|
|
} else {
|
|
var G__985 = nacc;
|
|
acc = G__985;
|
|
continue;
|
|
}
|
|
} else {
|
|
return acc;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
}
|
|
});
|
|
|
|
cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3 = (function (coll,f,init){
|
|
var iter = cljs.core._iterator(coll);
|
|
var acc = init;
|
|
while(true){
|
|
if(iter.hasNext()){
|
|
var nacc = (function (){var G__982 = acc;
|
|
var G__983 = iter.next();
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__982,G__983) : f.call(null,G__982,G__983));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nacc)){
|
|
return cljs.core.deref(nacc);
|
|
} else {
|
|
var G__986 = nacc;
|
|
acc = G__986;
|
|
continue;
|
|
}
|
|
} else {
|
|
return acc;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.iter_reduce.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* f should be a function of 2 arguments. If val is not supplied,
|
|
* returns the result of applying f to the first 2 items in coll, then
|
|
* applying f to that result and the 3rd item, etc. If coll contains no
|
|
* items, f must accept no arguments as well, and reduce returns the
|
|
* result of calling f with no arguments. If coll has only 1 item, it
|
|
* is returned and f is not called. If val is supplied, returns the
|
|
* result of applying f to val and the first item in coll, then
|
|
* applying f to that result and the 2nd item, etc. If coll contains no
|
|
* items, returns val and f is not called.
|
|
*/
|
|
cljs.core.reduce = (function cljs$core$reduce(var_args){
|
|
var G__988 = arguments.length;
|
|
switch (G__988) {
|
|
case 2:
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.reduce.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReduce$))))?true:false):false)){
|
|
return coll.cljs$core$IReduce$_reduce$arity$2(null,f);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,coll)){
|
|
return cljs.core._reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
|
|
} else {
|
|
if(cljs.core.iterable_QMARK_(coll)){
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2(coll,f);
|
|
} else {
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll);
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.reduce.cljs$core$IFn$_invoke$arity$3 = (function (f,val,coll){
|
|
if((((!((coll == null))))?(((((coll.cljs$lang$protocol_mask$partition0$ & (524288))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReduce$))))?true:false):false)){
|
|
return coll.cljs$core$IReduce$_reduce$arity$3(null,f,val);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
|
|
} else {
|
|
if(cljs.core.native_satisfies_QMARK_(cljs.core.IReduce,coll)){
|
|
return cljs.core._reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
|
|
} else {
|
|
if(cljs.core.iterable_QMARK_(coll)){
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3(coll,f,val);
|
|
} else {
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,val,coll);
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.reduce.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Reduces an associative collection. f should be a function of 3
|
|
* arguments. Returns the result of applying f to init, the first key
|
|
* and the first value in coll, then applying f to that result and the
|
|
* 2nd key and value, etc. If coll contains no entries, returns init
|
|
* and f is not called. Note that reduce-kv is supported on vectors,
|
|
* where the keys will be the ordinals.
|
|
*/
|
|
cljs.core.reduce_kv = (function cljs$core$reduce_kv(f,init,coll){
|
|
if((!((coll == null)))){
|
|
return cljs.core._kv_reduce(coll,f,init);
|
|
} else {
|
|
return init;
|
|
}
|
|
});
|
|
/**
|
|
* Returns its argument.
|
|
*/
|
|
cljs.core.identity = (function cljs$core$identity(x){
|
|
return x;
|
|
});
|
|
/**
|
|
* Takes a reducing function f of 2 args and returns a fn suitable for
|
|
* transduce by adding an arity-1 signature that calls cf (default -
|
|
* identity) on the result argument.
|
|
*/
|
|
cljs.core.completing = (function cljs$core$completing(var_args){
|
|
var G__993 = arguments.length;
|
|
switch (G__993) {
|
|
case 1:
|
|
return cljs.core.completing.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.completing.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.completing.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return cljs.core.completing.cljs$core$IFn$_invoke$arity$2(f,cljs.core.identity);
|
|
});
|
|
|
|
cljs.core.completing.cljs$core$IFn$_invoke$arity$2 = (function (f,cf){
|
|
return (function() {
|
|
var G__995 = null;
|
|
var G__995__0 = (function (){
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
});
|
|
var G__995__1 = (function (x){
|
|
return (cf.cljs$core$IFn$_invoke$arity$1 ? cf.cljs$core$IFn$_invoke$arity$1(x) : cf.call(null,x));
|
|
});
|
|
var G__995__2 = (function (x,y){
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y));
|
|
});
|
|
G__995 = function(x,y){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__995__0.call(this);
|
|
case 1:
|
|
return G__995__1.call(this,x);
|
|
case 2:
|
|
return G__995__2.call(this,x,y);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__995.cljs$core$IFn$_invoke$arity$0 = G__995__0;
|
|
G__995.cljs$core$IFn$_invoke$arity$1 = G__995__1;
|
|
G__995.cljs$core$IFn$_invoke$arity$2 = G__995__2;
|
|
return G__995;
|
|
})()
|
|
});
|
|
|
|
cljs.core.completing.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* reduce with a transformation of f (xf). If init is not
|
|
* supplied, (f) will be called to produce it. f should be a reducing
|
|
* step function that accepts both 1 and 2 arguments, if it accepts
|
|
* only 2 you can add the arity-1 with 'completing'. Returns the result
|
|
* of applying (the transformed) xf to init and the first item in coll,
|
|
* then applying xf to that result and the 2nd item, etc. If coll
|
|
* contains no items, returns init and f is not called. Note that
|
|
* certain transforms may inject or skip items.
|
|
*/
|
|
cljs.core.transduce = (function cljs$core$transduce(var_args){
|
|
var G__997 = arguments.length;
|
|
switch (G__997) {
|
|
case 3:
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.transduce.cljs$core$IFn$_invoke$arity$3 = (function (xform,f,coll){
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,f,(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),coll);
|
|
});
|
|
|
|
cljs.core.transduce.cljs$core$IFn$_invoke$arity$4 = (function (xform,f,init,coll){
|
|
var f__$1 = (xform.cljs$core$IFn$_invoke$arity$1 ? xform.cljs$core$IFn$_invoke$arity$1(f) : xform.call(null,f));
|
|
var ret = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(f__$1,init,coll);
|
|
return (f__$1.cljs$core$IFn$_invoke$arity$1 ? f__$1.cljs$core$IFn$_invoke$arity$1(ret) : f__$1.call(null,ret));
|
|
});
|
|
|
|
cljs.core.transduce.cljs$lang$maxFixedArity = 4;
|
|
|
|
/**
|
|
* Returns the sum of nums. (+) returns 0.
|
|
*/
|
|
cljs.core._PLUS_ = (function cljs$core$_PLUS_(var_args){
|
|
var G__1003 = arguments.length;
|
|
switch (G__1003) {
|
|
case 0:
|
|
return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1005 = arguments.length;
|
|
var i__4642__auto___1006 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1006 < len__4641__auto___1005)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1006]));
|
|
|
|
var G__1007 = (i__4642__auto___1006 + (1));
|
|
i__4642__auto___1006 = G__1007;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (0);
|
|
});
|
|
|
|
cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x + y);
|
|
});
|
|
|
|
cljs.core._PLUS_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._PLUS_,(x + y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._PLUS_.cljs$lang$applyTo = (function (seq1000){
|
|
var G__1001 = cljs.core.first(seq1000);
|
|
var seq1000__$1 = cljs.core.next(seq1000);
|
|
var G__1002 = cljs.core.first(seq1000__$1);
|
|
var seq1000__$2 = cljs.core.next(seq1000__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1001,G__1002,seq1000__$2);
|
|
});
|
|
|
|
cljs.core._PLUS_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* If no ys are supplied, returns the negation of x, else subtracts
|
|
* the ys from x and returns the result.
|
|
*/
|
|
cljs.core._ = (function cljs$core$_(var_args){
|
|
var G__1012 = arguments.length;
|
|
switch (G__1012) {
|
|
case 1:
|
|
return cljs.core._.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1014 = arguments.length;
|
|
var i__4642__auto___1015 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1015 < len__4641__auto___1014)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1015]));
|
|
|
|
var G__1016 = (i__4642__auto___1015 + (1));
|
|
i__4642__auto___1015 = G__1016;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (- x);
|
|
});
|
|
|
|
cljs.core._.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x - y);
|
|
});
|
|
|
|
cljs.core._.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._,(x - y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._.cljs$lang$applyTo = (function (seq1009){
|
|
var G__1010 = cljs.core.first(seq1009);
|
|
var seq1009__$1 = cljs.core.next(seq1009);
|
|
var G__1011 = cljs.core.first(seq1009__$1);
|
|
var seq1009__$2 = cljs.core.next(seq1009__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1010,G__1011,seq1009__$2);
|
|
});
|
|
|
|
cljs.core._.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns the product of nums. (*) returns 1.
|
|
*/
|
|
cljs.core._STAR_ = (function cljs$core$_STAR_(var_args){
|
|
var G__1021 = arguments.length;
|
|
switch (G__1021) {
|
|
case 0:
|
|
return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1023 = arguments.length;
|
|
var i__4642__auto___1024 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1024 < len__4641__auto___1023)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1024]));
|
|
|
|
var G__1025 = (i__4642__auto___1024 + (1));
|
|
i__4642__auto___1024 = G__1025;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._STAR_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._STAR_.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (1);
|
|
});
|
|
|
|
cljs.core._STAR_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core._STAR_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x * y);
|
|
});
|
|
|
|
cljs.core._STAR_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._STAR_,(x * y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._STAR_.cljs$lang$applyTo = (function (seq1018){
|
|
var G__1019 = cljs.core.first(seq1018);
|
|
var seq1018__$1 = cljs.core.next(seq1018);
|
|
var G__1020 = cljs.core.first(seq1018__$1);
|
|
var seq1018__$2 = cljs.core.next(seq1018__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1019,G__1020,seq1018__$2);
|
|
});
|
|
|
|
cljs.core._STAR_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* If no denominators are supplied, returns 1/numerator,
|
|
* else returns numerator divided by all of the denominators.
|
|
*/
|
|
cljs.core._SLASH_ = (function cljs$core$_SLASH_(var_args){
|
|
var G__1030 = arguments.length;
|
|
switch (G__1030) {
|
|
case 1:
|
|
return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1032 = arguments.length;
|
|
var i__4642__auto___1033 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1033 < len__4641__auto___1032)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1033]));
|
|
|
|
var G__1034 = (i__4642__auto___1033 + (1));
|
|
i__4642__auto___1033 = G__1034;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return ((1) / x);
|
|
});
|
|
|
|
cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x / y);
|
|
});
|
|
|
|
cljs.core._SLASH_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._SLASH_,(x / y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._SLASH_.cljs$lang$applyTo = (function (seq1027){
|
|
var G__1028 = cljs.core.first(seq1027);
|
|
var seq1027__$1 = cljs.core.next(seq1027);
|
|
var G__1029 = cljs.core.first(seq1027__$1);
|
|
var seq1027__$2 = cljs.core.next(seq1027__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1028,G__1029,seq1027__$2);
|
|
});
|
|
|
|
cljs.core._SLASH_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns non-nil if nums are in monotonically increasing order,
|
|
* otherwise false.
|
|
*/
|
|
cljs.core._LT_ = (function cljs$core$_LT_(var_args){
|
|
var G__1039 = arguments.length;
|
|
switch (G__1039) {
|
|
case 1:
|
|
return cljs.core._LT_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._LT_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1041 = arguments.length;
|
|
var i__4642__auto___1042 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1042 < len__4641__auto___1041)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1042]));
|
|
|
|
var G__1043 = (i__4642__auto___1042 + (1));
|
|
i__4642__auto___1042 = G__1043;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._LT_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._LT_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._LT_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x < y);
|
|
});
|
|
|
|
cljs.core._LT_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if((x < y)){
|
|
if(cljs.core.next(more)){
|
|
var G__1044 = y;
|
|
var G__1045 = cljs.core.first(more);
|
|
var G__1046 = cljs.core.next(more);
|
|
x = G__1044;
|
|
y = G__1045;
|
|
more = G__1046;
|
|
continue;
|
|
} else {
|
|
return (y < cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._LT_.cljs$lang$applyTo = (function (seq1036){
|
|
var G__1037 = cljs.core.first(seq1036);
|
|
var seq1036__$1 = cljs.core.next(seq1036);
|
|
var G__1038 = cljs.core.first(seq1036__$1);
|
|
var seq1036__$2 = cljs.core.next(seq1036__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1037,G__1038,seq1036__$2);
|
|
});
|
|
|
|
cljs.core._LT_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns non-nil if nums are in monotonically non-decreasing order,
|
|
* otherwise false.
|
|
*/
|
|
cljs.core._LT__EQ_ = (function cljs$core$_LT__EQ_(var_args){
|
|
var G__1051 = arguments.length;
|
|
switch (G__1051) {
|
|
case 1:
|
|
return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1053 = arguments.length;
|
|
var i__4642__auto___1054 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1054 < len__4641__auto___1053)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1054]));
|
|
|
|
var G__1055 = (i__4642__auto___1054 + (1));
|
|
i__4642__auto___1054 = G__1055;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x <= y);
|
|
});
|
|
|
|
cljs.core._LT__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if((x <= y)){
|
|
if(cljs.core.next(more)){
|
|
var G__1056 = y;
|
|
var G__1057 = cljs.core.first(more);
|
|
var G__1058 = cljs.core.next(more);
|
|
x = G__1056;
|
|
y = G__1057;
|
|
more = G__1058;
|
|
continue;
|
|
} else {
|
|
return (y <= cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._LT__EQ_.cljs$lang$applyTo = (function (seq1048){
|
|
var G__1049 = cljs.core.first(seq1048);
|
|
var seq1048__$1 = cljs.core.next(seq1048);
|
|
var G__1050 = cljs.core.first(seq1048__$1);
|
|
var seq1048__$2 = cljs.core.next(seq1048__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1049,G__1050,seq1048__$2);
|
|
});
|
|
|
|
cljs.core._LT__EQ_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns non-nil if nums are in monotonically decreasing order,
|
|
* otherwise false.
|
|
*/
|
|
cljs.core._GT_ = (function cljs$core$_GT_(var_args){
|
|
var G__1063 = arguments.length;
|
|
switch (G__1063) {
|
|
case 1:
|
|
return cljs.core._GT_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._GT_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1065 = arguments.length;
|
|
var i__4642__auto___1066 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1066 < len__4641__auto___1065)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1066]));
|
|
|
|
var G__1067 = (i__4642__auto___1066 + (1));
|
|
i__4642__auto___1066 = G__1067;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._GT_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._GT_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._GT_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x > y);
|
|
});
|
|
|
|
cljs.core._GT_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if((x > y)){
|
|
if(cljs.core.next(more)){
|
|
var G__1068 = y;
|
|
var G__1069 = cljs.core.first(more);
|
|
var G__1070 = cljs.core.next(more);
|
|
x = G__1068;
|
|
y = G__1069;
|
|
more = G__1070;
|
|
continue;
|
|
} else {
|
|
return (y > cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._GT_.cljs$lang$applyTo = (function (seq1060){
|
|
var G__1061 = cljs.core.first(seq1060);
|
|
var seq1060__$1 = cljs.core.next(seq1060);
|
|
var G__1062 = cljs.core.first(seq1060__$1);
|
|
var seq1060__$2 = cljs.core.next(seq1060__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1061,G__1062,seq1060__$2);
|
|
});
|
|
|
|
cljs.core._GT_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns non-nil if nums are in monotonically non-increasing order,
|
|
* otherwise false.
|
|
*/
|
|
cljs.core._GT__EQ_ = (function cljs$core$_GT__EQ_(var_args){
|
|
var G__1075 = arguments.length;
|
|
switch (G__1075) {
|
|
case 1:
|
|
return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1077 = arguments.length;
|
|
var i__4642__auto___1078 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1078 < len__4641__auto___1077)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1078]));
|
|
|
|
var G__1079 = (i__4642__auto___1078 + (1));
|
|
i__4642__auto___1078 = G__1079;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x >= y);
|
|
});
|
|
|
|
cljs.core._GT__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if((x >= y)){
|
|
if(cljs.core.next(more)){
|
|
var G__1080 = y;
|
|
var G__1081 = cljs.core.first(more);
|
|
var G__1082 = cljs.core.next(more);
|
|
x = G__1080;
|
|
y = G__1081;
|
|
more = G__1082;
|
|
continue;
|
|
} else {
|
|
return (y >= cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._GT__EQ_.cljs$lang$applyTo = (function (seq1072){
|
|
var G__1073 = cljs.core.first(seq1072);
|
|
var seq1072__$1 = cljs.core.next(seq1072);
|
|
var G__1074 = cljs.core.first(seq1072__$1);
|
|
var seq1072__$2 = cljs.core.next(seq1072__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1073,G__1074,seq1072__$2);
|
|
});
|
|
|
|
cljs.core._GT__EQ_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns a number one less than num.
|
|
*/
|
|
cljs.core.dec = (function cljs$core$dec(x){
|
|
return (x - (1));
|
|
});
|
|
/**
|
|
* Returns the greatest of the nums.
|
|
*/
|
|
cljs.core.max = (function cljs$core$max(var_args){
|
|
var G__1087 = arguments.length;
|
|
switch (G__1087) {
|
|
case 1:
|
|
return cljs.core.max.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.max.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1089 = arguments.length;
|
|
var i__4642__auto___1090 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1090 < len__4641__auto___1089)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1090]));
|
|
|
|
var G__1091 = (i__4642__auto___1090 + (1));
|
|
i__4642__auto___1090 = G__1091;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.max.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.max.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.max.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
var x__4135__auto__ = x;
|
|
var y__4136__auto__ = y;
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
});
|
|
|
|
cljs.core.max.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.max,(function (){var x__4135__auto__ = x;
|
|
var y__4136__auto__ = y;
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
})(),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.max.cljs$lang$applyTo = (function (seq1084){
|
|
var G__1085 = cljs.core.first(seq1084);
|
|
var seq1084__$1 = cljs.core.next(seq1084);
|
|
var G__1086 = cljs.core.first(seq1084__$1);
|
|
var seq1084__$2 = cljs.core.next(seq1084__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1085,G__1086,seq1084__$2);
|
|
});
|
|
|
|
cljs.core.max.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns the least of the nums.
|
|
*/
|
|
cljs.core.min = (function cljs$core$min(var_args){
|
|
var G__1096 = arguments.length;
|
|
switch (G__1096) {
|
|
case 1:
|
|
return cljs.core.min.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.min.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1098 = arguments.length;
|
|
var i__4642__auto___1099 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1099 < len__4641__auto___1098)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1099]));
|
|
|
|
var G__1100 = (i__4642__auto___1099 + (1));
|
|
i__4642__auto___1099 = G__1100;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.min.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.min.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.min.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
var x__4138__auto__ = x;
|
|
var y__4139__auto__ = y;
|
|
return ((x__4138__auto__ < y__4139__auto__) ? x__4138__auto__ : y__4139__auto__);
|
|
});
|
|
|
|
cljs.core.min.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.min,(function (){var x__4138__auto__ = x;
|
|
var y__4139__auto__ = y;
|
|
return ((x__4138__auto__ < y__4139__auto__) ? x__4138__auto__ : y__4139__auto__);
|
|
})(),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.min.cljs$lang$applyTo = (function (seq1093){
|
|
var G__1094 = cljs.core.first(seq1093);
|
|
var seq1093__$1 = cljs.core.next(seq1093);
|
|
var G__1095 = cljs.core.first(seq1093__$1);
|
|
var seq1093__$2 = cljs.core.next(seq1093__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1094,G__1095,seq1093__$2);
|
|
});
|
|
|
|
cljs.core.min.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.byte$ = (function cljs$core$byte(x){
|
|
return x;
|
|
});
|
|
/**
|
|
* Coerce to char
|
|
*/
|
|
cljs.core.char$ = (function cljs$core$char(x){
|
|
if(typeof x === 'number'){
|
|
return String.fromCharCode(x);
|
|
} else {
|
|
if(((typeof x === 'string') && ((x.length === (1))))){
|
|
return x;
|
|
} else {
|
|
throw (new Error("Argument to char must be a character or number"));
|
|
|
|
}
|
|
}
|
|
});
|
|
cljs.core.short$ = (function cljs$core$short(x){
|
|
return x;
|
|
});
|
|
cljs.core.float$ = (function cljs$core$float(x){
|
|
return x;
|
|
});
|
|
cljs.core.double$ = (function cljs$core$double(x){
|
|
return x;
|
|
});
|
|
cljs.core.unchecked_byte = (function cljs$core$unchecked_byte(x){
|
|
return x;
|
|
});
|
|
cljs.core.unchecked_char = (function cljs$core$unchecked_char(x){
|
|
return x;
|
|
});
|
|
cljs.core.unchecked_short = (function cljs$core$unchecked_short(x){
|
|
return x;
|
|
});
|
|
cljs.core.unchecked_float = (function cljs$core$unchecked_float(x){
|
|
return x;
|
|
});
|
|
cljs.core.unchecked_double = (function cljs$core$unchecked_double(x){
|
|
return x;
|
|
});
|
|
/**
|
|
* Returns the sum of nums. (+) returns 0.
|
|
*/
|
|
cljs.core.unchecked_add = (function cljs$core$unchecked_add(var_args){
|
|
var G__1105 = arguments.length;
|
|
switch (G__1105) {
|
|
case 0:
|
|
return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1107 = arguments.length;
|
|
var i__4642__auto___1108 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1108 < len__4641__auto___1107)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1108]));
|
|
|
|
var G__1109 = (i__4642__auto___1108 + (1));
|
|
i__4642__auto___1108 = G__1109;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (0);
|
|
});
|
|
|
|
cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x + y);
|
|
});
|
|
|
|
cljs.core.unchecked_add.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_add,(x + y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_add.cljs$lang$applyTo = (function (seq1102){
|
|
var G__1103 = cljs.core.first(seq1102);
|
|
var seq1102__$1 = cljs.core.next(seq1102);
|
|
var G__1104 = cljs.core.first(seq1102__$1);
|
|
var seq1102__$2 = cljs.core.next(seq1102__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1103,G__1104,seq1102__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_add.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns the sum of nums. (+) returns 0.
|
|
*/
|
|
cljs.core.unchecked_add_int = (function cljs$core$unchecked_add_int(var_args){
|
|
var G__1114 = arguments.length;
|
|
switch (G__1114) {
|
|
case 0:
|
|
return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1116 = arguments.length;
|
|
var i__4642__auto___1117 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1117 < len__4641__auto___1116)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1117]));
|
|
|
|
var G__1118 = (i__4642__auto___1117 + (1));
|
|
i__4642__auto___1117 = G__1118;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (0);
|
|
});
|
|
|
|
cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x + y);
|
|
});
|
|
|
|
cljs.core.unchecked_add_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_add_int,(x + y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_add_int.cljs$lang$applyTo = (function (seq1111){
|
|
var G__1112 = cljs.core.first(seq1111);
|
|
var seq1111__$1 = cljs.core.next(seq1111);
|
|
var G__1113 = cljs.core.first(seq1111__$1);
|
|
var seq1111__$2 = cljs.core.next(seq1111__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1112,G__1113,seq1111__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_add_int.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns a number one less than x, an int.
|
|
*/
|
|
cljs.core.unchecked_dec = (function cljs$core$unchecked_dec(x){
|
|
return (x - (1));
|
|
});
|
|
/**
|
|
* Returns a number one less than x, an int.
|
|
*/
|
|
cljs.core.unchecked_dec_int = (function cljs$core$unchecked_dec_int(x){
|
|
return (x - (1));
|
|
});
|
|
/**
|
|
* If no denominators are supplied, returns 1/numerator,
|
|
* else returns numerator divided by all of the denominators.
|
|
*/
|
|
cljs.core.unchecked_divide_int = (function cljs$core$unchecked_divide_int(var_args){
|
|
var G__1123 = arguments.length;
|
|
switch (G__1123) {
|
|
case 1:
|
|
return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1125 = arguments.length;
|
|
var i__4642__auto___1126 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1126 < len__4641__auto___1125)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1126]));
|
|
|
|
var G__1127 = (i__4642__auto___1126 + (1));
|
|
i__4642__auto___1126 = G__1127;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return ((1) / x);
|
|
});
|
|
|
|
cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x / y);
|
|
});
|
|
|
|
cljs.core.unchecked_divide_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_divide_int,(x / y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_divide_int.cljs$lang$applyTo = (function (seq1120){
|
|
var G__1121 = cljs.core.first(seq1120);
|
|
var seq1120__$1 = cljs.core.next(seq1120);
|
|
var G__1122 = cljs.core.first(seq1120__$1);
|
|
var seq1120__$2 = cljs.core.next(seq1120__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1121,G__1122,seq1120__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_divide_int.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.unchecked_inc = (function cljs$core$unchecked_inc(x){
|
|
return (x + (1));
|
|
});
|
|
cljs.core.unchecked_inc_int = (function cljs$core$unchecked_inc_int(x){
|
|
return (x + (1));
|
|
});
|
|
/**
|
|
* Returns the product of nums. (*) returns 1.
|
|
*/
|
|
cljs.core.unchecked_multiply = (function cljs$core$unchecked_multiply(var_args){
|
|
var G__1132 = arguments.length;
|
|
switch (G__1132) {
|
|
case 0:
|
|
return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1134 = arguments.length;
|
|
var i__4642__auto___1135 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1135 < len__4641__auto___1134)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1135]));
|
|
|
|
var G__1136 = (i__4642__auto___1135 + (1));
|
|
i__4642__auto___1135 = G__1136;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (1);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x * y);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_multiply,(x * y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_multiply.cljs$lang$applyTo = (function (seq1129){
|
|
var G__1130 = cljs.core.first(seq1129);
|
|
var seq1129__$1 = cljs.core.next(seq1129);
|
|
var G__1131 = cljs.core.first(seq1129__$1);
|
|
var seq1129__$2 = cljs.core.next(seq1129__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1130,G__1131,seq1129__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns the product of nums. (*) returns 1.
|
|
*/
|
|
cljs.core.unchecked_multiply_int = (function cljs$core$unchecked_multiply_int(var_args){
|
|
var G__1141 = arguments.length;
|
|
switch (G__1141) {
|
|
case 0:
|
|
return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1143 = arguments.length;
|
|
var i__4642__auto___1144 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1144 < len__4641__auto___1143)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1144]));
|
|
|
|
var G__1145 = (i__4642__auto___1144 + (1));
|
|
i__4642__auto___1144 = G__1145;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (1);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x * y);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_multiply_int,(x * y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_multiply_int.cljs$lang$applyTo = (function (seq1138){
|
|
var G__1139 = cljs.core.first(seq1138);
|
|
var seq1138__$1 = cljs.core.next(seq1138);
|
|
var G__1140 = cljs.core.first(seq1138__$1);
|
|
var seq1138__$2 = cljs.core.next(seq1138__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1139,G__1140,seq1138__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_multiply_int.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.unchecked_negate = (function cljs$core$unchecked_negate(x){
|
|
return (- x);
|
|
});
|
|
cljs.core.unchecked_negate_int = (function cljs$core$unchecked_negate_int(x){
|
|
return (- x);
|
|
});
|
|
cljs.core.unchecked_remainder_int = (function cljs$core$unchecked_remainder_int(x,n){
|
|
return cljs.core.mod(x,n);
|
|
});
|
|
/**
|
|
* If no ys are supplied, returns the negation of x, else subtracts
|
|
* the ys from x and returns the result.
|
|
*/
|
|
cljs.core.unchecked_subtract = (function cljs$core$unchecked_subtract(var_args){
|
|
var G__1150 = arguments.length;
|
|
switch (G__1150) {
|
|
case 1:
|
|
return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1152 = arguments.length;
|
|
var i__4642__auto___1153 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1153 < len__4641__auto___1152)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1153]));
|
|
|
|
var G__1154 = (i__4642__auto___1153 + (1));
|
|
i__4642__auto___1153 = G__1154;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (- x);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x - y);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_subtract,(x - y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_subtract.cljs$lang$applyTo = (function (seq1147){
|
|
var G__1148 = cljs.core.first(seq1147);
|
|
var seq1147__$1 = cljs.core.next(seq1147);
|
|
var G__1149 = cljs.core.first(seq1147__$1);
|
|
var seq1147__$2 = cljs.core.next(seq1147__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1148,G__1149,seq1147__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* If no ys are supplied, returns the negation of x, else subtracts
|
|
* the ys from x and returns the result.
|
|
*/
|
|
cljs.core.unchecked_subtract_int = (function cljs$core$unchecked_subtract_int(var_args){
|
|
var G__1159 = arguments.length;
|
|
switch (G__1159) {
|
|
case 1:
|
|
return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1161 = arguments.length;
|
|
var i__4642__auto___1162 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1162 < len__4641__auto___1161)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1162]));
|
|
|
|
var G__1163 = (i__4642__auto___1162 + (1));
|
|
i__4642__auto___1162 = G__1163;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (- x);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x - y);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract_int.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.unchecked_subtract_int,(x - y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.unchecked_subtract_int.cljs$lang$applyTo = (function (seq1156){
|
|
var G__1157 = cljs.core.first(seq1156);
|
|
var seq1156__$1 = cljs.core.next(seq1156);
|
|
var G__1158 = cljs.core.first(seq1156__$1);
|
|
var seq1156__$2 = cljs.core.next(seq1156__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1157,G__1158,seq1156__$2);
|
|
});
|
|
|
|
cljs.core.unchecked_subtract_int.cljs$lang$maxFixedArity = (2);
|
|
|
|
cljs.core.fix = (function cljs$core$fix(q){
|
|
if((q >= (0))){
|
|
return Math.floor(q);
|
|
} else {
|
|
return Math.ceil(q);
|
|
}
|
|
});
|
|
/**
|
|
* Coerce to int by stripping decimal places.
|
|
*/
|
|
cljs.core.int$ = (function cljs$core$int(x){
|
|
return (x | (0));
|
|
});
|
|
/**
|
|
* Coerce to int by stripping decimal places.
|
|
*/
|
|
cljs.core.unchecked_int = (function cljs$core$unchecked_int(x){
|
|
return cljs.core.fix(x);
|
|
});
|
|
/**
|
|
* Coerce to long by stripping decimal places. Identical to `int'.
|
|
*/
|
|
cljs.core.long$ = (function cljs$core$long(x){
|
|
return cljs.core.fix(x);
|
|
});
|
|
/**
|
|
* Coerce to long by stripping decimal places. Identical to `int'.
|
|
*/
|
|
cljs.core.unchecked_long = (function cljs$core$unchecked_long(x){
|
|
return cljs.core.fix(x);
|
|
});
|
|
cljs.core.booleans = (function cljs$core$booleans(x){
|
|
return x;
|
|
});
|
|
cljs.core.bytes = (function cljs$core$bytes(x){
|
|
return x;
|
|
});
|
|
cljs.core.chars = (function cljs$core$chars(x){
|
|
return x;
|
|
});
|
|
cljs.core.shorts = (function cljs$core$shorts(x){
|
|
return x;
|
|
});
|
|
cljs.core.ints = (function cljs$core$ints(x){
|
|
return x;
|
|
});
|
|
cljs.core.floats = (function cljs$core$floats(x){
|
|
return x;
|
|
});
|
|
cljs.core.doubles = (function cljs$core$doubles(x){
|
|
return x;
|
|
});
|
|
cljs.core.longs = (function cljs$core$longs(x){
|
|
return x;
|
|
});
|
|
/**
|
|
* Modulus of num and div with original javascript behavior. i.e. bug for negative numbers
|
|
*/
|
|
cljs.core.js_mod = (function cljs$core$js_mod(n,d){
|
|
return (n % d);
|
|
});
|
|
/**
|
|
* Modulus of num and div. Truncates toward negative infinity.
|
|
*/
|
|
cljs.core.mod = (function cljs$core$mod(n,d){
|
|
return (((n % d) + d) % d);
|
|
});
|
|
/**
|
|
* quot[ient] of dividing numerator by denominator.
|
|
*/
|
|
cljs.core.quot = (function cljs$core$quot(n,d){
|
|
var rem = (n % d);
|
|
return cljs.core.fix(((n - rem) / d));
|
|
});
|
|
/**
|
|
* remainder of dividing numerator by denominator.
|
|
*/
|
|
cljs.core.rem = (function cljs$core$rem(n,d){
|
|
var q = cljs.core.quot(n,d);
|
|
return (n - (d * q));
|
|
});
|
|
/**
|
|
* Bitwise exclusive or
|
|
*/
|
|
cljs.core.bit_xor = (function cljs$core$bit_xor(var_args){
|
|
var G__1168 = arguments.length;
|
|
switch (G__1168) {
|
|
case 2:
|
|
return cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1170 = arguments.length;
|
|
var i__4642__auto___1171 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1171 < len__4641__auto___1170)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1171]));
|
|
|
|
var G__1172 = (i__4642__auto___1171 + (1));
|
|
i__4642__auto___1171 = G__1172;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x ^ y);
|
|
});
|
|
|
|
cljs.core.bit_xor.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_xor,(x ^ y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.bit_xor.cljs$lang$applyTo = (function (seq1165){
|
|
var G__1166 = cljs.core.first(seq1165);
|
|
var seq1165__$1 = cljs.core.next(seq1165);
|
|
var G__1167 = cljs.core.first(seq1165__$1);
|
|
var seq1165__$2 = cljs.core.next(seq1165__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1166,G__1167,seq1165__$2);
|
|
});
|
|
|
|
cljs.core.bit_xor.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Bitwise and
|
|
*/
|
|
cljs.core.bit_and = (function cljs$core$bit_and(var_args){
|
|
var G__1177 = arguments.length;
|
|
switch (G__1177) {
|
|
case 2:
|
|
return cljs.core.bit_and.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1179 = arguments.length;
|
|
var i__4642__auto___1180 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1180 < len__4641__auto___1179)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1180]));
|
|
|
|
var G__1181 = (i__4642__auto___1180 + (1));
|
|
i__4642__auto___1180 = G__1181;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.bit_and.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.bit_and.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x & y);
|
|
});
|
|
|
|
cljs.core.bit_and.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_and,(x & y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.bit_and.cljs$lang$applyTo = (function (seq1174){
|
|
var G__1175 = cljs.core.first(seq1174);
|
|
var seq1174__$1 = cljs.core.next(seq1174);
|
|
var G__1176 = cljs.core.first(seq1174__$1);
|
|
var seq1174__$2 = cljs.core.next(seq1174__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1175,G__1176,seq1174__$2);
|
|
});
|
|
|
|
cljs.core.bit_and.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Bitwise or
|
|
*/
|
|
cljs.core.bit_or = (function cljs$core$bit_or(var_args){
|
|
var G__1186 = arguments.length;
|
|
switch (G__1186) {
|
|
case 2:
|
|
return cljs.core.bit_or.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1188 = arguments.length;
|
|
var i__4642__auto___1189 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1189 < len__4641__auto___1188)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1189]));
|
|
|
|
var G__1190 = (i__4642__auto___1189 + (1));
|
|
i__4642__auto___1189 = G__1190;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.bit_or.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.bit_or.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x | y);
|
|
});
|
|
|
|
cljs.core.bit_or.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_or,(x | y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.bit_or.cljs$lang$applyTo = (function (seq1183){
|
|
var G__1184 = cljs.core.first(seq1183);
|
|
var seq1183__$1 = cljs.core.next(seq1183);
|
|
var G__1185 = cljs.core.first(seq1183__$1);
|
|
var seq1183__$2 = cljs.core.next(seq1183__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1184,G__1185,seq1183__$2);
|
|
});
|
|
|
|
cljs.core.bit_or.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Bitwise and with complement
|
|
*/
|
|
cljs.core.bit_and_not = (function cljs$core$bit_and_not(var_args){
|
|
var G__1195 = arguments.length;
|
|
switch (G__1195) {
|
|
case 2:
|
|
return cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1197 = arguments.length;
|
|
var i__4642__auto___1198 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1198 < len__4641__auto___1197)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1198]));
|
|
|
|
var G__1199 = (i__4642__auto___1198 + (1));
|
|
i__4642__auto___1198 = G__1199;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (x & ~y);
|
|
});
|
|
|
|
cljs.core.bit_and_not.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.bit_and_not,(x & ~y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.bit_and_not.cljs$lang$applyTo = (function (seq1192){
|
|
var G__1193 = cljs.core.first(seq1192);
|
|
var seq1192__$1 = cljs.core.next(seq1192);
|
|
var G__1194 = cljs.core.first(seq1192__$1);
|
|
var seq1192__$2 = cljs.core.next(seq1192__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1193,G__1194,seq1192__$2);
|
|
});
|
|
|
|
cljs.core.bit_and_not.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Clear bit at index n
|
|
*/
|
|
cljs.core.bit_clear = (function cljs$core$bit_clear(x,n){
|
|
return (x & ~(1 << n));
|
|
});
|
|
/**
|
|
* Flip bit at index n
|
|
*/
|
|
cljs.core.bit_flip = (function cljs$core$bit_flip(x,n){
|
|
return (x ^ (1 << n));
|
|
});
|
|
/**
|
|
* Bitwise complement
|
|
*/
|
|
cljs.core.bit_not = (function cljs$core$bit_not(x){
|
|
return (~ x);
|
|
});
|
|
/**
|
|
* Set bit at index n
|
|
*/
|
|
cljs.core.bit_set = (function cljs$core$bit_set(x,n){
|
|
return (x | (1 << n));
|
|
});
|
|
/**
|
|
* Test bit at index n
|
|
*/
|
|
cljs.core.bit_test = (function cljs$core$bit_test(x,n){
|
|
return ((x & (1 << n)) != 0);
|
|
});
|
|
/**
|
|
* Bitwise shift left
|
|
*/
|
|
cljs.core.bit_shift_left = (function cljs$core$bit_shift_left(x,n){
|
|
return (x << n);
|
|
});
|
|
/**
|
|
* Bitwise shift right
|
|
*/
|
|
cljs.core.bit_shift_right = (function cljs$core$bit_shift_right(x,n){
|
|
return (x >> n);
|
|
});
|
|
/**
|
|
* DEPRECATED: Bitwise shift right with zero fill
|
|
*/
|
|
cljs.core.bit_shift_right_zero_fill = (function cljs$core$bit_shift_right_zero_fill(x,n){
|
|
return (x >>> n);
|
|
});
|
|
/**
|
|
* Bitwise shift right with zero fill
|
|
*/
|
|
cljs.core.unsigned_bit_shift_right = (function cljs$core$unsigned_bit_shift_right(x,n){
|
|
return (x >>> n);
|
|
});
|
|
/**
|
|
* Counts the number of bits set in n
|
|
*/
|
|
cljs.core.bit_count = (function cljs$core$bit_count(v){
|
|
var v__$1 = (v - ((v >> (1)) & (1431655765)));
|
|
var v__$2 = ((v__$1 & (858993459)) + ((v__$1 >> (2)) & (858993459)));
|
|
return ((((v__$2 + (v__$2 >> (4))) & (252645135)) * (16843009)) >> (24));
|
|
});
|
|
/**
|
|
* Returns non-nil if nums all have the equivalent
|
|
* value, otherwise false. Behavior on non nums is
|
|
* undefined.
|
|
*/
|
|
cljs.core._EQ__EQ_ = (function cljs$core$_EQ__EQ_(var_args){
|
|
var G__1204 = arguments.length;
|
|
switch (G__1204) {
|
|
case 1:
|
|
return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1206 = arguments.length;
|
|
var i__4642__auto___1207 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1207 < len__4641__auto___1206)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1207]));
|
|
|
|
var G__1208 = (i__4642__auto___1207 + (1));
|
|
i__4642__auto___1207 = G__1208;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return true;
|
|
});
|
|
|
|
cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return cljs.core._equiv(x,y);
|
|
});
|
|
|
|
cljs.core._EQ__EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
while(true){
|
|
if((x === y)){
|
|
if(cljs.core.next(more)){
|
|
var G__1209 = y;
|
|
var G__1210 = cljs.core.first(more);
|
|
var G__1211 = cljs.core.next(more);
|
|
x = G__1209;
|
|
y = G__1210;
|
|
more = G__1211;
|
|
continue;
|
|
} else {
|
|
return (y === cljs.core.first(more));
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core._EQ__EQ_.cljs$lang$applyTo = (function (seq1201){
|
|
var G__1202 = cljs.core.first(seq1201);
|
|
var seq1201__$1 = cljs.core.next(seq1201);
|
|
var G__1203 = cljs.core.first(seq1201__$1);
|
|
var seq1201__$2 = cljs.core.next(seq1201__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1202,G__1203,seq1201__$2);
|
|
});
|
|
|
|
cljs.core._EQ__EQ_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns true if num is greater than zero, else false
|
|
*/
|
|
cljs.core.pos_QMARK_ = (function cljs$core$pos_QMARK_(x){
|
|
return (x > (0));
|
|
});
|
|
/**
|
|
* Returns true if num is zero, else false
|
|
*/
|
|
cljs.core.zero_QMARK_ = (function cljs$core$zero_QMARK_(x){
|
|
return (x === (0));
|
|
});
|
|
/**
|
|
* Returns true if num is less than zero, else false
|
|
*/
|
|
cljs.core.neg_QMARK_ = (function cljs$core$neg_QMARK_(x){
|
|
return (x < (0));
|
|
});
|
|
/**
|
|
* Returns the nth next of coll, (seq coll) when n is 0.
|
|
*/
|
|
cljs.core.nthnext = (function cljs$core$nthnext(coll,n){
|
|
var n__$1 = n;
|
|
var xs = cljs.core.seq(coll);
|
|
while(true){
|
|
if(((xs) && ((n__$1 > (0))))){
|
|
var G__1212 = (n__$1 - (1));
|
|
var G__1213 = cljs.core.next(xs);
|
|
n__$1 = G__1212;
|
|
xs = G__1213;
|
|
continue;
|
|
} else {
|
|
return xs;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* With no args, returns the empty string. With one arg x, returns
|
|
* x.toString(). (str nil) returns the empty string. With more than
|
|
* one arg, returns the concatenation of the str values of the args.
|
|
*/
|
|
cljs.core.str = (function cljs$core$str(var_args){
|
|
var G__1217 = arguments.length;
|
|
switch (G__1217) {
|
|
case 0:
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1219 = arguments.length;
|
|
var i__4642__auto___1220 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1220 < len__4641__auto___1219)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1220]));
|
|
|
|
var G__1221 = (i__4642__auto___1220 + (1));
|
|
i__4642__auto___1220 = G__1221;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((1)),(0),null));
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.str.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return "";
|
|
});
|
|
|
|
cljs.core.str.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
if((x == null)){
|
|
return "";
|
|
} else {
|
|
return [x].join("");
|
|
}
|
|
});
|
|
|
|
cljs.core.str.cljs$core$IFn$_invoke$arity$variadic = (function (x,ys){
|
|
var sb = (new goog.string.StringBuffer(cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)));
|
|
var more = ys;
|
|
while(true){
|
|
if(cljs.core.truth_(more)){
|
|
var G__1222 = sb.append(cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(more)));
|
|
var G__1223 = cljs.core.next(more);
|
|
sb = G__1222;
|
|
more = G__1223;
|
|
continue;
|
|
} else {
|
|
return sb.toString();
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.str.cljs$lang$applyTo = (function (seq1215){
|
|
var G__1216 = cljs.core.first(seq1215);
|
|
var seq1215__$1 = cljs.core.next(seq1215);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1216,seq1215__$1);
|
|
});
|
|
|
|
cljs.core.str.cljs$lang$maxFixedArity = (1);
|
|
|
|
/**
|
|
* Returns the substring of s beginning at start inclusive, and ending
|
|
* at end (defaults to length of string), exclusive.
|
|
*/
|
|
cljs.core.subs = (function cljs$core$subs(var_args){
|
|
var G__1225 = arguments.length;
|
|
switch (G__1225) {
|
|
case 2:
|
|
return cljs.core.subs.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.subs.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.subs.cljs$core$IFn$_invoke$arity$2 = (function (s,start){
|
|
return s.substring(start);
|
|
});
|
|
|
|
cljs.core.subs.cljs$core$IFn$_invoke$arity$3 = (function (s,start,end){
|
|
return s.substring(start,end);
|
|
});
|
|
|
|
cljs.core.subs.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
/**
|
|
* Assumes x is sequential. Returns true if x equals y, otherwise
|
|
* returns false.
|
|
*/
|
|
cljs.core.equiv_sequential = (function cljs$core$equiv_sequential(x,y){
|
|
return cljs.core.boolean$(((cljs.core.sequential_QMARK_(y))?((((cljs.core.counted_QMARK_(x)) && (cljs.core.counted_QMARK_(y)) && ((!((cljs.core.count(x) === cljs.core.count(y)))))))?false:(function (){var xs = cljs.core.seq(x);
|
|
var ys = cljs.core.seq(y);
|
|
while(true){
|
|
if((xs == null)){
|
|
return (ys == null);
|
|
} else {
|
|
if((ys == null)){
|
|
return false;
|
|
} else {
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(xs),cljs.core.first(ys))){
|
|
var G__1227 = cljs.core.next(xs);
|
|
var G__1228 = cljs.core.next(ys);
|
|
xs = G__1227;
|
|
ys = G__1228;
|
|
continue;
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
})()):null));
|
|
});
|
|
cljs.core.hash_coll = (function cljs$core$hash_coll(coll){
|
|
if(cljs.core.seq(coll)){
|
|
var res = cljs.core.hash(cljs.core.first(coll));
|
|
var s = cljs.core.next(coll);
|
|
while(true){
|
|
if((s == null)){
|
|
return res;
|
|
} else {
|
|
var G__1229 = cljs.core.hash_combine(res,cljs.core.hash(cljs.core.first(s)));
|
|
var G__1230 = cljs.core.next(s);
|
|
res = G__1229;
|
|
s = G__1230;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return (0);
|
|
}
|
|
});
|
|
|
|
cljs.core.hash_imap = (function cljs$core$hash_imap(m){
|
|
var h = (0);
|
|
var s = cljs.core.seq(m);
|
|
while(true){
|
|
if(s){
|
|
var e = cljs.core.first(s);
|
|
var G__1231 = ((h + (cljs.core.hash(cljs.core.key(e)) ^ cljs.core.hash(cljs.core.val(e)))) % (4503599627370496));
|
|
var G__1232 = cljs.core.next(s);
|
|
h = G__1231;
|
|
s = G__1232;
|
|
continue;
|
|
} else {
|
|
return h;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.hash_iset = (function cljs$core$hash_iset(s){
|
|
var h = (0);
|
|
var s__$1 = cljs.core.seq(s);
|
|
while(true){
|
|
if(s__$1){
|
|
var e = cljs.core.first(s__$1);
|
|
var G__1233 = ((h + cljs.core.hash(e)) % (4503599627370496));
|
|
var G__1234 = cljs.core.next(s__$1);
|
|
h = G__1233;
|
|
s__$1 = G__1234;
|
|
continue;
|
|
} else {
|
|
return h;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* Takes a JavaScript object and a map of names to functions and
|
|
* attaches said functions as methods on the object. Any references to
|
|
* JavaScript's implicit this (via the this-as macro) will resolve to the
|
|
* object that the function is attached.
|
|
*/
|
|
cljs.core.extend_object_BANG_ = (function cljs$core$extend_object_BANG_(obj,fn_map){
|
|
var seq__1235_1245 = cljs.core.seq(fn_map);
|
|
var chunk__1236_1246 = null;
|
|
var count__1237_1247 = (0);
|
|
var i__1238_1248 = (0);
|
|
while(true){
|
|
if((i__1238_1248 < count__1237_1247)){
|
|
var vec__1239_1249 = chunk__1236_1246.cljs$core$IIndexed$_nth$arity$2(null,i__1238_1248);
|
|
var key_name_1250 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1239_1249,(0),null);
|
|
var f_1251 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1239_1249,(1),null);
|
|
var str_name_1252 = cljs.core.name(key_name_1250);
|
|
goog.object.set(obj,str_name_1252,f_1251);
|
|
|
|
|
|
var G__1253 = seq__1235_1245;
|
|
var G__1254 = chunk__1236_1246;
|
|
var G__1255 = count__1237_1247;
|
|
var G__1256 = (i__1238_1248 + (1));
|
|
seq__1235_1245 = G__1253;
|
|
chunk__1236_1246 = G__1254;
|
|
count__1237_1247 = G__1255;
|
|
i__1238_1248 = G__1256;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto___1257 = cljs.core.seq(seq__1235_1245);
|
|
if(temp__5457__auto___1257){
|
|
var seq__1235_1258__$1 = temp__5457__auto___1257;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__1235_1258__$1)){
|
|
var c__4461__auto___1259 = cljs.core.chunk_first(seq__1235_1258__$1);
|
|
var G__1260 = cljs.core.chunk_rest(seq__1235_1258__$1);
|
|
var G__1261 = c__4461__auto___1259;
|
|
var G__1262 = cljs.core.count(c__4461__auto___1259);
|
|
var G__1263 = (0);
|
|
seq__1235_1245 = G__1260;
|
|
chunk__1236_1246 = G__1261;
|
|
count__1237_1247 = G__1262;
|
|
i__1238_1248 = G__1263;
|
|
continue;
|
|
} else {
|
|
var vec__1242_1264 = cljs.core.first(seq__1235_1258__$1);
|
|
var key_name_1265 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1242_1264,(0),null);
|
|
var f_1266 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1242_1264,(1),null);
|
|
var str_name_1267 = cljs.core.name(key_name_1265);
|
|
goog.object.set(obj,str_name_1267,f_1266);
|
|
|
|
|
|
var G__1268 = cljs.core.next(seq__1235_1258__$1);
|
|
var G__1269 = null;
|
|
var G__1270 = (0);
|
|
var G__1271 = (0);
|
|
seq__1235_1245 = G__1268;
|
|
chunk__1236_1246 = G__1269;
|
|
count__1237_1247 = G__1270;
|
|
i__1238_1248 = G__1271;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
|
|
return obj;
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IList}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ASeq}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.List = (function (meta,first,rest,count,__hash){
|
|
this.meta = meta;
|
|
this.first = first;
|
|
this.rest = rest;
|
|
this.count = count;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 65937646;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.List.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.List.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.List.prototype.indexOf = (function() {
|
|
var G__1272 = null;
|
|
var G__1272__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1272__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1272 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1272__1.call(this,x);
|
|
case 2:
|
|
return G__1272__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1272.cljs$core$IFn$_invoke$arity$1 = G__1272__1;
|
|
G__1272.cljs$core$IFn$_invoke$arity$2 = G__1272__2;
|
|
return G__1272;
|
|
})()
|
|
;
|
|
|
|
cljs.core.List.prototype.lastIndexOf = (function() {
|
|
var G__1273 = null;
|
|
var G__1273__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,self__.count);
|
|
});
|
|
var G__1273__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1273 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1273__1.call(this,x);
|
|
case 2:
|
|
return G__1273__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1273.cljs$core$IFn$_invoke$arity$1 = G__1273__1;
|
|
G__1273.cljs$core$IFn$_invoke$arity$2 = G__1273__2;
|
|
return G__1273;
|
|
})()
|
|
;
|
|
|
|
cljs.core.List.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.List(self__.meta,self__.first,self__.rest,self__.count,self__.__hash));
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.count === (1))){
|
|
return null;
|
|
} else {
|
|
return self__.rest;
|
|
}
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.count;
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.first;
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.first;
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.count === (1))){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return self__.rest;
|
|
}
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.List(meta__$1,self__.first,self__.rest,self__.count,self__.__hash));
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.List(self__.meta,o,coll__$1,(self__.count + (1)),null));
|
|
});
|
|
|
|
cljs.core.List.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$first,cljs.core.cst$sym$rest,cljs.core.cst$sym$count,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.List.cljs$lang$type = true;
|
|
|
|
cljs.core.List.cljs$lang$ctorStr = "cljs.core/List";
|
|
|
|
cljs.core.List.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/List");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/List.
|
|
*/
|
|
cljs.core.__GT_List = (function cljs$core$__GT_List(meta,first,rest,count,__hash){
|
|
return (new cljs.core.List(meta,first,rest,count,__hash));
|
|
});
|
|
|
|
/**
|
|
* Returns true if x implements IList
|
|
*/
|
|
cljs.core.list_QMARK_ = (function cljs$core$list_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (33554432))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IList$)))){
|
|
return true;
|
|
} else {
|
|
if((!x.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IList,x);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IList,x);
|
|
}
|
|
});
|
|
var G__1275_1278 = cljs.core.List.prototype;
|
|
var G__1276_1279 = cljs.core.ITER_SYMBOL;
|
|
var G__1277_1280 = ((function (G__1275_1278,G__1276_1279){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1275_1278,G__1276_1279))
|
|
;
|
|
goog.object.set(G__1275_1278,G__1276_1279,G__1277_1280);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IList}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.EmptyList = (function (meta){
|
|
this.meta = meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 65937614;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.EmptyList.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.indexOf = (function() {
|
|
var G__1281 = null;
|
|
var G__1281__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1281__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1281 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1281__1.call(this,x);
|
|
case 2:
|
|
return G__1281__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1281.cljs$core$IFn$_invoke$arity$1 = G__1281__1;
|
|
G__1281.cljs$core$IFn$_invoke$arity$2 = G__1281__2;
|
|
return G__1281;
|
|
})()
|
|
;
|
|
|
|
cljs.core.EmptyList.prototype.lastIndexOf = (function() {
|
|
var G__1282 = null;
|
|
var G__1282__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__1282__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1282 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1282__1.call(this,x);
|
|
case 2:
|
|
return G__1282__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1282.cljs$core$IFn$_invoke$arity$1 = G__1282__1;
|
|
G__1282.cljs$core$IFn$_invoke$arity$2 = G__1282__2;
|
|
return G__1282;
|
|
})()
|
|
;
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.EmptyList(self__.meta));
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (0);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
throw (new Error("Can't pop empty list"));
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.empty_ordered_hash;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((cljs.core.list_QMARK_(other)) || (cljs.core.sequential_QMARK_(other)))){
|
|
return (cljs.core.seq(other) == null);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.List.EMPTY;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.EmptyList(meta__$1));
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.List(self__.meta,o,null,(1),null));
|
|
});
|
|
|
|
cljs.core.EmptyList.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta], null);
|
|
});
|
|
|
|
cljs.core.EmptyList.cljs$lang$type = true;
|
|
|
|
cljs.core.EmptyList.cljs$lang$ctorStr = "cljs.core/EmptyList";
|
|
|
|
cljs.core.EmptyList.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/EmptyList");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/EmptyList.
|
|
*/
|
|
cljs.core.__GT_EmptyList = (function cljs$core$__GT_EmptyList(meta){
|
|
return (new cljs.core.EmptyList(meta));
|
|
});
|
|
|
|
cljs.core.List.EMPTY = (new cljs.core.EmptyList(null));
|
|
var G__1283_1286 = cljs.core.EmptyList.prototype;
|
|
var G__1284_1287 = cljs.core.ITER_SYMBOL;
|
|
var G__1285_1288 = ((function (G__1283_1286,G__1284_1287){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1283_1286,G__1284_1287))
|
|
;
|
|
goog.object.set(G__1283_1286,G__1284_1287,G__1285_1288);
|
|
/**
|
|
* Returns true if coll satisfies? IReversible.
|
|
*/
|
|
cljs.core.reversible_QMARK_ = (function cljs$core$reversible_QMARK_(coll){
|
|
if((!((coll == null)))){
|
|
if((((coll.cljs$lang$protocol_mask$partition0$ & (134217728))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$IReversible$)))){
|
|
return true;
|
|
} else {
|
|
if((!coll.cljs$lang$protocol_mask$partition0$)){
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IReversible,coll);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.native_satisfies_QMARK_(cljs.core.IReversible,coll);
|
|
}
|
|
});
|
|
/**
|
|
* Returns, in constant time, a seq of the items in rev (which
|
|
* can be a vector or sorted-map), in reverse order. If rev is empty returns nil
|
|
*/
|
|
cljs.core.rseq = (function cljs$core$rseq(rev){
|
|
return cljs.core._rseq(rev);
|
|
});
|
|
/**
|
|
* Returns a seq of the items in coll in reverse order. Not lazy.
|
|
*/
|
|
cljs.core.reverse = (function cljs$core$reverse(coll){
|
|
if(cljs.core.reversible_QMARK_(coll)){
|
|
var or__4047__auto__ = cljs.core.rseq(coll);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
} else {
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.List.EMPTY,coll);
|
|
}
|
|
});
|
|
/**
|
|
* Creates a new list containing the items.
|
|
*/
|
|
cljs.core.list = (function cljs$core$list(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___1291 = arguments.length;
|
|
var i__4642__auto___1292 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1292 < len__4641__auto___1291)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___1292]));
|
|
|
|
var G__1293 = (i__4642__auto___1292 + (1));
|
|
i__4642__auto___1292 = G__1293;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.list.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.list.cljs$core$IFn$_invoke$arity$variadic = (function (xs){
|
|
var arr = (((((xs instanceof cljs.core.IndexedSeq)) && ((xs.i === (0)))))?xs.arr:(function (){var arr = [];
|
|
var xs__$1 = xs;
|
|
while(true){
|
|
if((!((xs__$1 == null)))){
|
|
arr.push(xs__$1.cljs$core$ISeq$_first$arity$1(null));
|
|
|
|
var G__1294 = xs__$1.cljs$core$INext$_next$arity$1(null);
|
|
xs__$1 = G__1294;
|
|
continue;
|
|
} else {
|
|
return arr;
|
|
}
|
|
break;
|
|
}
|
|
})());
|
|
var i = arr.length;
|
|
var r = cljs.core.List.EMPTY;
|
|
while(true){
|
|
if((i > (0))){
|
|
var G__1295 = (i - (1));
|
|
var G__1296 = r.cljs$core$ICollection$_conj$arity$2(null,(arr[(i - (1))]));
|
|
i = G__1295;
|
|
r = G__1296;
|
|
continue;
|
|
} else {
|
|
return r;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.list.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.list.cljs$lang$applyTo = (function (seq1290){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq1290));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IList}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ASeq}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Cons = (function (meta,first,rest,__hash){
|
|
this.meta = meta;
|
|
this.first = first;
|
|
this.rest = rest;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 65929452;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.Cons.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.indexOf = (function() {
|
|
var G__1297 = null;
|
|
var G__1297__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1297__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1297 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1297__1.call(this,x);
|
|
case 2:
|
|
return G__1297__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1297.cljs$core$IFn$_invoke$arity$1 = G__1297__1;
|
|
G__1297.cljs$core$IFn$_invoke$arity$2 = G__1297__2;
|
|
return G__1297;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Cons.prototype.lastIndexOf = (function() {
|
|
var G__1298 = null;
|
|
var G__1298__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__1298__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1298 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1298__1.call(this,x);
|
|
case 2:
|
|
return G__1298__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1298.cljs$core$IFn$_invoke$arity$1 = G__1298__1;
|
|
G__1298.cljs$core$IFn$_invoke$arity$2 = G__1298__2;
|
|
return G__1298;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.Cons(self__.meta,self__.first,self__.rest,self__.__hash));
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.rest == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core.seq(self__.rest);
|
|
}
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.first;
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.rest == null)){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return self__.rest;
|
|
}
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.Cons(meta__$1,self__.first,self__.rest,self__.__hash));
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.Cons(null,o,coll__$1,null));
|
|
});
|
|
|
|
cljs.core.Cons.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$first,cljs.core.cst$sym$rest,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Cons.cljs$lang$type = true;
|
|
|
|
cljs.core.Cons.cljs$lang$ctorStr = "cljs.core/Cons";
|
|
|
|
cljs.core.Cons.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Cons");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Cons.
|
|
*/
|
|
cljs.core.__GT_Cons = (function cljs$core$__GT_Cons(meta,first,rest,__hash){
|
|
return (new cljs.core.Cons(meta,first,rest,__hash));
|
|
});
|
|
|
|
var G__1299_1302 = cljs.core.Cons.prototype;
|
|
var G__1300_1303 = cljs.core.ITER_SYMBOL;
|
|
var G__1301_1304 = ((function (G__1299_1302,G__1300_1303){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1299_1302,G__1300_1303))
|
|
;
|
|
goog.object.set(G__1299_1302,G__1300_1303,G__1301_1304);
|
|
/**
|
|
* Returns a new seq where x is the first element and coll is the rest.
|
|
*/
|
|
cljs.core.cons = (function cljs$core$cons(x,coll){
|
|
if((function (){var or__4047__auto__ = (coll == null);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
if((!((coll == null)))){
|
|
if((((coll.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === coll.cljs$core$ISeq$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
})()){
|
|
return (new cljs.core.Cons(null,x,coll,null));
|
|
} else {
|
|
return (new cljs.core.Cons(null,x,cljs.core.seq(coll),null));
|
|
}
|
|
});
|
|
cljs.core.hash_keyword = (function cljs$core$hash_keyword(k){
|
|
return ((cljs.core.hash_symbol(k) + (2654435769)) | (0));
|
|
});
|
|
cljs.core.compare_keywords = (function cljs$core$compare_keywords(a,b){
|
|
if((a.fqn === b.fqn)){
|
|
return (0);
|
|
} else {
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = cljs.core.not(a.ns);
|
|
if(and__4036__auto__){
|
|
return b.ns;
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
return (-1);
|
|
} else {
|
|
if(cljs.core.truth_(a.ns)){
|
|
if(cljs.core.not(b.ns)){
|
|
return (1);
|
|
} else {
|
|
var nsc = (function (){var G__1307 = a.ns;
|
|
var G__1308 = b.ns;
|
|
return goog.array.defaultCompare(G__1307,G__1308);
|
|
})();
|
|
if(((0) === nsc)){
|
|
var G__1309 = a.name;
|
|
var G__1310 = b.name;
|
|
return goog.array.defaultCompare(G__1309,G__1310);
|
|
} else {
|
|
return nsc;
|
|
}
|
|
}
|
|
} else {
|
|
var G__1311 = a.name;
|
|
var G__1312 = b.name;
|
|
return goog.array.defaultCompare(G__1311,G__1312);
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.INamed}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
*/
|
|
cljs.core.Keyword = (function (ns,name,fqn,_hash){
|
|
this.ns = ns;
|
|
this.name = name;
|
|
this.fqn = fqn;
|
|
this._hash = _hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2153775105;
|
|
this.cljs$lang$protocol_mask$partition1$ = 4096;
|
|
});
|
|
cljs.core.Keyword.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return [":",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fqn)].join('');
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if((other instanceof cljs.core.Keyword)){
|
|
return (self__.fqn === other.fqn);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.call = (function() {
|
|
var G__1314 = null;
|
|
var G__1314__2 = (function (self__,coll){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var kw = self____$1;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,kw);
|
|
});
|
|
var G__1314__3 = (function (self__,coll,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var kw = self____$1;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,kw,not_found);
|
|
});
|
|
G__1314 = function(self__,coll,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__1314__2.call(this,self__,coll);
|
|
case 3:
|
|
return G__1314__3.call(this,self__,coll,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__1314.cljs$core$IFn$_invoke$arity$2 = G__1314__2;
|
|
G__1314.cljs$core$IFn$_invoke$arity$3 = G__1314__3;
|
|
return G__1314;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Keyword.prototype.apply = (function (self__,args1313){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args1313)));
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var kw = this;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$2(coll,kw);
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IFn$_invoke$arity$2 = (function (coll,not_found){
|
|
var self__ = this;
|
|
var kw = this;
|
|
return cljs.core.get.cljs$core$IFn$_invoke$arity$3(coll,kw,not_found);
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
var h__4159__auto__ = self__._hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_keyword(this$__$1);
|
|
self__._hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$INamed$_name$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.name;
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$INamed$_namespace$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.ns;
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,_){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
return cljs.core._write(writer,[":",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.fqn)].join(''));
|
|
});
|
|
|
|
cljs.core.Keyword.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$ns,cljs.core.cst$sym$name,cljs.core.cst$sym$fqn,cljs.core.with_meta(cljs.core.cst$sym$_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Keyword.cljs$lang$type = true;
|
|
|
|
cljs.core.Keyword.cljs$lang$ctorStr = "cljs.core/Keyword";
|
|
|
|
cljs.core.Keyword.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Keyword");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Keyword.
|
|
*/
|
|
cljs.core.__GT_Keyword = (function cljs$core$__GT_Keyword(ns,name,fqn,_hash){
|
|
return (new cljs.core.Keyword(ns,name,fqn,_hash));
|
|
});
|
|
|
|
/**
|
|
* Return true if x is a Keyword
|
|
*/
|
|
cljs.core.keyword_QMARK_ = (function cljs$core$keyword_QMARK_(x){
|
|
return (x instanceof cljs.core.Keyword);
|
|
});
|
|
/**
|
|
* Efficient test to determine that two keywords are identical.
|
|
*/
|
|
cljs.core.keyword_identical_QMARK_ = (function cljs$core$keyword_identical_QMARK_(x,y){
|
|
if((x === y)){
|
|
return true;
|
|
} else {
|
|
if((((x instanceof cljs.core.Keyword)) && ((y instanceof cljs.core.Keyword)))){
|
|
return (x.fqn === y.fqn);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Efficient test to determine that two symbols are identical.
|
|
*/
|
|
cljs.core.symbol_identical_QMARK_ = (function cljs$core$symbol_identical_QMARK_(x,y){
|
|
if((x === y)){
|
|
return true;
|
|
} else {
|
|
if((((x instanceof cljs.core.Symbol)) && ((y instanceof cljs.core.Symbol)))){
|
|
return (x.str === y.str);
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the namespace String of a symbol or keyword, or nil if not present.
|
|
*/
|
|
cljs.core.namespace = (function cljs$core$namespace(x){
|
|
if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition1$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$INamed$))))?true:false):false)){
|
|
return x.cljs$core$INamed$_namespace$arity$1(null);
|
|
} else {
|
|
throw (new Error(["Doesn't support namespace: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('')));
|
|
}
|
|
});
|
|
/**
|
|
* Return true if x is a symbol or keyword
|
|
*/
|
|
cljs.core.ident_QMARK_ = (function cljs$core$ident_QMARK_(x){
|
|
return (((x instanceof cljs.core.Keyword)) || ((x instanceof cljs.core.Symbol)));
|
|
});
|
|
/**
|
|
* Return true if x is a symbol or keyword without a namespace
|
|
*/
|
|
cljs.core.simple_ident_QMARK_ = (function cljs$core$simple_ident_QMARK_(x){
|
|
return ((cljs.core.ident_QMARK_(x)) && ((cljs.core.namespace(x) == null)));
|
|
});
|
|
/**
|
|
* Return true if x is a symbol or keyword with a namespace
|
|
*/
|
|
cljs.core.qualified_ident_QMARK_ = (function cljs$core$qualified_ident_QMARK_(x){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = cljs.core.ident_QMARK_(x);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = cljs.core.namespace(x);
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return true;
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
/**
|
|
* Return true if x is a symbol without a namespace
|
|
*/
|
|
cljs.core.simple_symbol_QMARK_ = (function cljs$core$simple_symbol_QMARK_(x){
|
|
return (((x instanceof cljs.core.Symbol)) && ((cljs.core.namespace(x) == null)));
|
|
});
|
|
/**
|
|
* Return true if x is a symbol with a namespace
|
|
*/
|
|
cljs.core.qualified_symbol_QMARK_ = (function cljs$core$qualified_symbol_QMARK_(x){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (x instanceof cljs.core.Symbol);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = cljs.core.namespace(x);
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return true;
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
/**
|
|
* Return true if x is a keyword without a namespace
|
|
*/
|
|
cljs.core.simple_keyword_QMARK_ = (function cljs$core$simple_keyword_QMARK_(x){
|
|
return (((x instanceof cljs.core.Keyword)) && ((cljs.core.namespace(x) == null)));
|
|
});
|
|
/**
|
|
* Return true if x is a keyword with a namespace
|
|
*/
|
|
cljs.core.qualified_keyword_QMARK_ = (function cljs$core$qualified_keyword_QMARK_(x){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (x instanceof cljs.core.Keyword);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = cljs.core.namespace(x);
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return true;
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
/**
|
|
* Returns a Keyword with the given namespace and name. Do not use :
|
|
* in the keyword strings, it will be added automatically.
|
|
*/
|
|
cljs.core.keyword = (function cljs$core$keyword(var_args){
|
|
var G__1317 = arguments.length;
|
|
switch (G__1317) {
|
|
case 1:
|
|
return cljs.core.keyword.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.keyword.cljs$core$IFn$_invoke$arity$1 = (function (name){
|
|
if((name instanceof cljs.core.Keyword)){
|
|
return name;
|
|
} else {
|
|
if((name instanceof cljs.core.Symbol)){
|
|
return (new cljs.core.Keyword(cljs.core.namespace(name),cljs.core.name(name),name.str,null));
|
|
} else {
|
|
if(typeof name === 'string'){
|
|
var parts = name.split("/");
|
|
if((parts.length === (2))){
|
|
return (new cljs.core.Keyword((parts[(0)]),(parts[(1)]),name,null));
|
|
} else {
|
|
return (new cljs.core.Keyword(null,(parts[(0)]),name,null));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.keyword.cljs$core$IFn$_invoke$arity$2 = (function (ns,name){
|
|
var ns__$1 = (((ns instanceof cljs.core.Keyword))?cljs.core.name(ns):(((ns instanceof cljs.core.Symbol))?cljs.core.name(ns):ns
|
|
));
|
|
var name__$1 = (((name instanceof cljs.core.Keyword))?cljs.core.name(name):(((name instanceof cljs.core.Symbol))?cljs.core.name(name):name
|
|
));
|
|
return (new cljs.core.Keyword(ns__$1,name__$1,[cljs.core.str.cljs$core$IFn$_invoke$arity$1((cljs.core.truth_(ns__$1)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns__$1),"/"].join(''):null)),cljs.core.str.cljs$core$IFn$_invoke$arity$1(name__$1)].join(''),null));
|
|
});
|
|
|
|
cljs.core.keyword.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IPending}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.LazySeq = (function (meta,fn,s,__hash){
|
|
this.meta = meta;
|
|
this.fn = fn;
|
|
this.s = s;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1;
|
|
});
|
|
cljs.core.LazySeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.sval = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
if((self__.fn == null)){
|
|
return self__.s;
|
|
} else {
|
|
self__.s = (self__.fn.cljs$core$IFn$_invoke$arity$0 ? self__.fn.cljs$core$IFn$_invoke$arity$0() : self__.fn.call(null));
|
|
|
|
self__.fn = null;
|
|
|
|
return self__.s;
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.indexOf = (function() {
|
|
var G__1319 = null;
|
|
var G__1319__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1319__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1319 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1319__1.call(this,x);
|
|
case 2:
|
|
return G__1319__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1319.cljs$core$IFn$_invoke$arity$1 = G__1319__1;
|
|
G__1319.cljs$core$IFn$_invoke$arity$2 = G__1319__2;
|
|
return G__1319;
|
|
})()
|
|
;
|
|
|
|
cljs.core.LazySeq.prototype.lastIndexOf = (function() {
|
|
var G__1320 = null;
|
|
var G__1320__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__1320__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1320 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1320__1.call(this,x);
|
|
case 2:
|
|
return G__1320__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1320.cljs$core$IFn$_invoke$arity$1 = G__1320__1;
|
|
G__1320.cljs$core$IFn$_invoke$arity$2 = G__1320__2;
|
|
return G__1320;
|
|
})()
|
|
;
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
|
|
|
|
if((self__.s == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core.next(self__.s);
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.not(self__.fn);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
|
|
|
|
if((self__.s == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core.first(self__.s);
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
|
|
|
|
if((!((self__.s == null)))){
|
|
return cljs.core.rest(self__.s);
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
coll__$1.sval();
|
|
|
|
if((self__.s == null)){
|
|
return null;
|
|
} else {
|
|
var ls = self__.s;
|
|
while(true){
|
|
if((ls instanceof cljs.core.LazySeq)){
|
|
var G__1321 = ls.sval();
|
|
ls = G__1321;
|
|
continue;
|
|
} else {
|
|
self__.s = ls;
|
|
|
|
return cljs.core.seq(self__.s);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.LazySeq(meta__$1,((function (coll__$1){
|
|
return (function (){
|
|
return coll__$1.cljs$core$ISeqable$_seq$arity$1(null);
|
|
});})(coll__$1))
|
|
,null,self__.__hash));
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.LazySeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$fn,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.LazySeq.cljs$lang$type = true;
|
|
|
|
cljs.core.LazySeq.cljs$lang$ctorStr = "cljs.core/LazySeq";
|
|
|
|
cljs.core.LazySeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/LazySeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/LazySeq.
|
|
*/
|
|
cljs.core.__GT_LazySeq = (function cljs$core$__GT_LazySeq(meta,fn,s,__hash){
|
|
return (new cljs.core.LazySeq(meta,fn,s,__hash));
|
|
});
|
|
|
|
var G__1322_1325 = cljs.core.LazySeq.prototype;
|
|
var G__1323_1326 = cljs.core.ITER_SYMBOL;
|
|
var G__1324_1327 = ((function (G__1322_1325,G__1323_1326){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1322_1325,G__1323_1326))
|
|
;
|
|
goog.object.set(G__1322_1325,G__1323_1326,G__1324_1327);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ICounted}
|
|
*/
|
|
cljs.core.ChunkBuffer = (function (buf,end){
|
|
this.buf = buf;
|
|
this.end = end;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.ChunkBuffer.prototype.add = (function (o){
|
|
var self__ = this;
|
|
var _ = this;
|
|
(self__.buf[self__.end] = o);
|
|
|
|
return self__.end = (self__.end + (1));
|
|
});
|
|
|
|
cljs.core.ChunkBuffer.prototype.chunk = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = (new cljs.core.ArrayChunk(self__.buf,(0),self__.end));
|
|
self__.buf = null;
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.ChunkBuffer.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.end;
|
|
});
|
|
|
|
cljs.core.ChunkBuffer.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$buf,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$end,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ChunkBuffer.cljs$lang$type = true;
|
|
|
|
cljs.core.ChunkBuffer.cljs$lang$ctorStr = "cljs.core/ChunkBuffer";
|
|
|
|
cljs.core.ChunkBuffer.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ChunkBuffer");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ChunkBuffer.
|
|
*/
|
|
cljs.core.__GT_ChunkBuffer = (function cljs$core$__GT_ChunkBuffer(buf,end){
|
|
return (new cljs.core.ChunkBuffer(buf,end));
|
|
});
|
|
|
|
cljs.core.chunk_buffer = (function cljs$core$chunk_buffer(capacity){
|
|
return (new cljs.core.ChunkBuffer((new Array(capacity)),(0)));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.IChunk}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.ArrayChunk = (function (arr,off,end){
|
|
this.arr = arr;
|
|
this.off = off;
|
|
this.end = end;
|
|
this.cljs$lang$protocol_mask$partition0$ = 524306;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.ArrayChunk.prototype.cljs$core$ICounted$_count$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (self__.end - self__.off);
|
|
});
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,i){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (self__.arr[(self__.off + i)]);
|
|
});
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,i,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((i >= (0))) && ((i < (self__.end - self__.off))))){
|
|
return (self__.arr[(self__.off + i)]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IChunk$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IChunk$_drop_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.off === self__.end)){
|
|
throw (new Error("-drop-first of empty chunk"));
|
|
} else {
|
|
return (new cljs.core.ArrayChunk(self__.arr,(self__.off + (1)),self__.end));
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,(self__.arr[self__.off]),(self__.off + (1)));
|
|
});
|
|
|
|
cljs.core.ArrayChunk.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.array_reduce.cljs$core$IFn$_invoke$arity$4(self__.arr,f,start,self__.off);
|
|
});
|
|
|
|
cljs.core.ArrayChunk.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$off,cljs.core.cst$sym$end], null);
|
|
});
|
|
|
|
cljs.core.ArrayChunk.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayChunk.cljs$lang$ctorStr = "cljs.core/ArrayChunk";
|
|
|
|
cljs.core.ArrayChunk.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayChunk");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayChunk.
|
|
*/
|
|
cljs.core.__GT_ArrayChunk = (function cljs$core$__GT_ArrayChunk(arr,off,end){
|
|
return (new cljs.core.ArrayChunk(arr,off,end));
|
|
});
|
|
|
|
cljs.core.array_chunk = (function cljs$core$array_chunk(var_args){
|
|
var G__1329 = arguments.length;
|
|
switch (G__1329) {
|
|
case 1:
|
|
return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$1 = (function (arr){
|
|
return (new cljs.core.ArrayChunk(arr,(0),arr.length));
|
|
});
|
|
|
|
cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2 = (function (arr,off){
|
|
return (new cljs.core.ArrayChunk(arr,off,arr.length));
|
|
});
|
|
|
|
cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3 = (function (arr,off,end){
|
|
return (new cljs.core.ArrayChunk(arr,off,end));
|
|
});
|
|
|
|
cljs.core.array_chunk.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ASeq}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IChunkedNext}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IChunkedSeq}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.ChunkedCons = (function (chunk,more,meta,__hash){
|
|
this.chunk = chunk;
|
|
this.more = more;
|
|
this.meta = meta;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 31850732;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1536;
|
|
});
|
|
cljs.core.ChunkedCons.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.indexOf = (function() {
|
|
var G__1331 = null;
|
|
var G__1331__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1331__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1331 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1331__1.call(this,x);
|
|
case 2:
|
|
return G__1331__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1331.cljs$core$IFn$_invoke$arity$1 = G__1331__1;
|
|
G__1331.cljs$core$IFn$_invoke$arity$2 = G__1331__2;
|
|
return G__1331;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ChunkedCons.prototype.lastIndexOf = (function() {
|
|
var G__1332 = null;
|
|
var G__1332__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__1332__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1332 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1332__1.call(this,x);
|
|
case 2:
|
|
return G__1332__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1332.cljs$core$IFn$_invoke$arity$1 = G__1332__1;
|
|
G__1332.cljs$core$IFn$_invoke$arity$2 = G__1332__2;
|
|
return G__1332;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((cljs.core._count(self__.chunk) > (1))){
|
|
return (new cljs.core.ChunkedCons(cljs.core._drop_first(self__.chunk),self__.more,self__.meta,null));
|
|
} else {
|
|
if((self__.more == null)){
|
|
return null;
|
|
} else {
|
|
return cljs.core._seq(self__.more);
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.chunk,(0));
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((cljs.core._count(self__.chunk) > (1))){
|
|
return (new cljs.core.ChunkedCons(cljs.core._drop_first(self__.chunk),self__.more,self__.meta,null));
|
|
} else {
|
|
if((self__.more == null)){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return self__.more;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IChunkedSeq$_chunked_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.chunk;
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IChunkedSeq$_chunked_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.more == null)){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return self__.more;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,m){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.ChunkedCons(self__.chunk,self__.more,m,self__.__hash));
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$ICollection$_conj$arity$2 = (function (this$,o){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return cljs.core.cons(o,this$__$1);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IChunkedNext$_chunked_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.more == null)){
|
|
return null;
|
|
} else {
|
|
return self__.more;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedCons.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$chunk,cljs.core.cst$sym$more,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.cljs$lang$type = true;
|
|
|
|
cljs.core.ChunkedCons.cljs$lang$ctorStr = "cljs.core/ChunkedCons";
|
|
|
|
cljs.core.ChunkedCons.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ChunkedCons");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ChunkedCons.
|
|
*/
|
|
cljs.core.__GT_ChunkedCons = (function cljs$core$__GT_ChunkedCons(chunk,more,meta,__hash){
|
|
return (new cljs.core.ChunkedCons(chunk,more,meta,__hash));
|
|
});
|
|
|
|
var G__1333_1336 = cljs.core.ChunkedCons.prototype;
|
|
var G__1334_1337 = cljs.core.ITER_SYMBOL;
|
|
var G__1335_1338 = ((function (G__1333_1336,G__1334_1337){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1333_1336,G__1334_1337))
|
|
;
|
|
goog.object.set(G__1333_1336,G__1334_1337,G__1335_1338);
|
|
cljs.core.chunk_cons = (function cljs$core$chunk_cons(chunk,rest){
|
|
if((cljs.core._count(chunk) === (0))){
|
|
return rest;
|
|
} else {
|
|
return (new cljs.core.ChunkedCons(chunk,rest,null,null));
|
|
}
|
|
});
|
|
cljs.core.chunk_append = (function cljs$core$chunk_append(b,x){
|
|
return b.add(x);
|
|
});
|
|
cljs.core.chunk = (function cljs$core$chunk(b){
|
|
return b.chunk();
|
|
});
|
|
cljs.core.chunk_first = (function cljs$core$chunk_first(s){
|
|
return cljs.core._chunked_first(s);
|
|
});
|
|
cljs.core.chunk_rest = (function cljs$core$chunk_rest(s){
|
|
return cljs.core._chunked_rest(s);
|
|
});
|
|
cljs.core.chunk_next = (function cljs$core$chunk_next(s){
|
|
if((((!((s == null))))?(((((s.cljs$lang$protocol_mask$partition1$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === s.cljs$core$IChunkedNext$))))?true:false):false)){
|
|
return cljs.core._chunked_next(s);
|
|
} else {
|
|
return cljs.core.seq(cljs.core._chunked_rest(s));
|
|
}
|
|
});
|
|
/**
|
|
* Returns an array containing the contents of coll.
|
|
*/
|
|
cljs.core.to_array = (function cljs$core$to_array(coll){
|
|
var ary = [];
|
|
var s = cljs.core.seq(coll);
|
|
while(true){
|
|
if((!((s == null)))){
|
|
ary.push(cljs.core.first(s));
|
|
|
|
var G__1340 = cljs.core.next(s);
|
|
s = G__1340;
|
|
continue;
|
|
} else {
|
|
return ary;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns a (potentially-ragged) 2-dimensional array
|
|
* containing the contents of coll.
|
|
*/
|
|
cljs.core.to_array_2d = (function cljs$core$to_array_2d(coll){
|
|
var ret = (new Array(cljs.core.count(coll)));
|
|
var i_1341 = (0);
|
|
var xs_1342 = cljs.core.seq(coll);
|
|
while(true){
|
|
if((xs_1342 == null)){
|
|
} else {
|
|
(ret[i_1341] = cljs.core.to_array(cljs.core.first(xs_1342)));
|
|
|
|
var G__1343 = (i_1341 + (1));
|
|
var G__1344 = cljs.core.next(xs_1342);
|
|
i_1341 = G__1343;
|
|
xs_1342 = G__1344;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
|
|
return ret;
|
|
});
|
|
/**
|
|
* Creates an array of ints. Does not coerce array, provided for compatibility
|
|
* with Clojure.
|
|
*/
|
|
cljs.core.int_array = (function cljs$core$int_array(var_args){
|
|
var G__1346 = arguments.length;
|
|
switch (G__1346) {
|
|
case 1:
|
|
return cljs.core.int_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.int_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.int_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
|
|
if(typeof size_or_seq === 'number'){
|
|
return cljs.core.int_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
|
|
} else {
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
|
|
}
|
|
});
|
|
|
|
cljs.core.int_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
|
|
var a = (new Array(size));
|
|
if(cljs.core.seq_QMARK_(init_val_or_seq)){
|
|
var s = cljs.core.seq(init_val_or_seq);
|
|
var i = (0);
|
|
var s__$1 = s;
|
|
while(true){
|
|
if(((s__$1) && ((i < size)))){
|
|
(a[i] = cljs.core.first(s__$1));
|
|
|
|
var G__1348 = (i + (1));
|
|
var G__1349 = cljs.core.next(s__$1);
|
|
i = G__1348;
|
|
s__$1 = G__1349;
|
|
continue;
|
|
} else {
|
|
return a;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var n__4518__auto___1350 = size;
|
|
var i_1351 = (0);
|
|
while(true){
|
|
if((i_1351 < n__4518__auto___1350)){
|
|
(a[i_1351] = init_val_or_seq);
|
|
|
|
var G__1352 = (i_1351 + (1));
|
|
i_1351 = G__1352;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return a;
|
|
}
|
|
});
|
|
|
|
cljs.core.int_array.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Creates an array of longs. Does not coerce array, provided for compatibility
|
|
* with Clojure.
|
|
*/
|
|
cljs.core.long_array = (function cljs$core$long_array(var_args){
|
|
var G__1354 = arguments.length;
|
|
switch (G__1354) {
|
|
case 1:
|
|
return cljs.core.long_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.long_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.long_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
|
|
if(typeof size_or_seq === 'number'){
|
|
return cljs.core.long_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
|
|
} else {
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
|
|
}
|
|
});
|
|
|
|
cljs.core.long_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
|
|
var a = (new Array(size));
|
|
if(cljs.core.seq_QMARK_(init_val_or_seq)){
|
|
var s = cljs.core.seq(init_val_or_seq);
|
|
var i = (0);
|
|
var s__$1 = s;
|
|
while(true){
|
|
if(((s__$1) && ((i < size)))){
|
|
(a[i] = cljs.core.first(s__$1));
|
|
|
|
var G__1356 = (i + (1));
|
|
var G__1357 = cljs.core.next(s__$1);
|
|
i = G__1356;
|
|
s__$1 = G__1357;
|
|
continue;
|
|
} else {
|
|
return a;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var n__4518__auto___1358 = size;
|
|
var i_1359 = (0);
|
|
while(true){
|
|
if((i_1359 < n__4518__auto___1358)){
|
|
(a[i_1359] = init_val_or_seq);
|
|
|
|
var G__1360 = (i_1359 + (1));
|
|
i_1359 = G__1360;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return a;
|
|
}
|
|
});
|
|
|
|
cljs.core.long_array.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Creates an array of doubles. Does not coerce array, provided for compatibility
|
|
* with Clojure.
|
|
*/
|
|
cljs.core.double_array = (function cljs$core$double_array(var_args){
|
|
var G__1362 = arguments.length;
|
|
switch (G__1362) {
|
|
case 1:
|
|
return cljs.core.double_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.double_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.double_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
|
|
if(typeof size_or_seq === 'number'){
|
|
return cljs.core.double_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
|
|
} else {
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
|
|
}
|
|
});
|
|
|
|
cljs.core.double_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
|
|
var a = (new Array(size));
|
|
if(cljs.core.seq_QMARK_(init_val_or_seq)){
|
|
var s = cljs.core.seq(init_val_or_seq);
|
|
var i = (0);
|
|
var s__$1 = s;
|
|
while(true){
|
|
if(((s__$1) && ((i < size)))){
|
|
(a[i] = cljs.core.first(s__$1));
|
|
|
|
var G__1364 = (i + (1));
|
|
var G__1365 = cljs.core.next(s__$1);
|
|
i = G__1364;
|
|
s__$1 = G__1365;
|
|
continue;
|
|
} else {
|
|
return a;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var n__4518__auto___1366 = size;
|
|
var i_1367 = (0);
|
|
while(true){
|
|
if((i_1367 < n__4518__auto___1366)){
|
|
(a[i_1367] = init_val_or_seq);
|
|
|
|
var G__1368 = (i_1367 + (1));
|
|
i_1367 = G__1368;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return a;
|
|
}
|
|
});
|
|
|
|
cljs.core.double_array.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Creates an array of objects. Does not coerce array, provided for compatibility
|
|
* with Clojure.
|
|
*/
|
|
cljs.core.object_array = (function cljs$core$object_array(var_args){
|
|
var G__1370 = arguments.length;
|
|
switch (G__1370) {
|
|
case 1:
|
|
return cljs.core.object_array.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.object_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.object_array.cljs$core$IFn$_invoke$arity$1 = (function (size_or_seq){
|
|
if(typeof size_or_seq === 'number'){
|
|
return cljs.core.object_array.cljs$core$IFn$_invoke$arity$2(size_or_seq,null);
|
|
} else {
|
|
return cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(size_or_seq);
|
|
}
|
|
});
|
|
|
|
cljs.core.object_array.cljs$core$IFn$_invoke$arity$2 = (function (size,init_val_or_seq){
|
|
var a = (new Array(size));
|
|
if(cljs.core.seq_QMARK_(init_val_or_seq)){
|
|
var s = cljs.core.seq(init_val_or_seq);
|
|
var i = (0);
|
|
var s__$1 = s;
|
|
while(true){
|
|
if(((s__$1) && ((i < size)))){
|
|
(a[i] = cljs.core.first(s__$1));
|
|
|
|
var G__1372 = (i + (1));
|
|
var G__1373 = cljs.core.next(s__$1);
|
|
i = G__1372;
|
|
s__$1 = G__1373;
|
|
continue;
|
|
} else {
|
|
return a;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var n__4518__auto___1374 = size;
|
|
var i_1375 = (0);
|
|
while(true){
|
|
if((i_1375 < n__4518__auto___1374)){
|
|
(a[i_1375] = init_val_or_seq);
|
|
|
|
var G__1376 = (i_1375 + (1));
|
|
i_1375 = G__1376;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return a;
|
|
}
|
|
});
|
|
|
|
cljs.core.object_array.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* If coll is counted? returns its count, else will count at most the first n
|
|
* elements of coll using its seq
|
|
*/
|
|
cljs.core.bounded_count = (function cljs$core$bounded_count(n,coll){
|
|
if(cljs.core.counted_QMARK_(coll)){
|
|
return cljs.core.count(coll);
|
|
} else {
|
|
var i = (0);
|
|
var s = cljs.core.seq(coll);
|
|
while(true){
|
|
if((((!((s == null)))) && ((i < n)))){
|
|
var G__1377 = (i + (1));
|
|
var G__1378 = cljs.core.next(s);
|
|
i = G__1377;
|
|
s = G__1378;
|
|
continue;
|
|
} else {
|
|
return i;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
cljs.core.spread = (function cljs$core$spread(arglist){
|
|
if((arglist == null)){
|
|
return null;
|
|
} else {
|
|
var n = cljs.core.next(arglist);
|
|
if((n == null)){
|
|
return cljs.core.seq(cljs.core.first(arglist));
|
|
} else {
|
|
return cljs.core.cons(cljs.core.first(arglist),(cljs.core.spread.cljs$core$IFn$_invoke$arity$1 ? cljs.core.spread.cljs$core$IFn$_invoke$arity$1(n) : cljs.core.spread.call(null,n)));
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns a lazy seq representing the concatenation of the elements in the supplied colls.
|
|
*/
|
|
cljs.core.concat = (function cljs$core$concat(var_args){
|
|
var G__1383 = arguments.length;
|
|
switch (G__1383) {
|
|
case 0:
|
|
return cljs.core.concat.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.concat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.concat.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1385 = arguments.length;
|
|
var i__4642__auto___1386 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1386 < len__4641__auto___1385)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1386]));
|
|
|
|
var G__1387 = (i__4642__auto___1386 + (1));
|
|
i__4642__auto___1386 = G__1387;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.concat.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
return null;
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.concat.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
return x;
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.concat.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var s = cljs.core.seq(x);
|
|
if(s){
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
return cljs.core.chunk_cons(cljs.core.chunk_first(s),cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.chunk_rest(s),y));
|
|
} else {
|
|
return cljs.core.cons(cljs.core.first(s),cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.rest(s),y));
|
|
}
|
|
} else {
|
|
return y;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,zs){
|
|
var cat = (function cljs$core$cat(xys,zs__$1){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var xys__$1 = cljs.core.seq(xys);
|
|
if(xys__$1){
|
|
if(cljs.core.chunked_seq_QMARK_(xys__$1)){
|
|
return cljs.core.chunk_cons(cljs.core.chunk_first(xys__$1),cljs$core$cat(cljs.core.chunk_rest(xys__$1),zs__$1));
|
|
} else {
|
|
return cljs.core.cons(cljs.core.first(xys__$1),cljs$core$cat(cljs.core.rest(xys__$1),zs__$1));
|
|
}
|
|
} else {
|
|
if(cljs.core.truth_(zs__$1)){
|
|
return cljs$core$cat(cljs.core.first(zs__$1),cljs.core.next(zs__$1));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
}),null,null));
|
|
});
|
|
return cat(cljs.core.concat.cljs$core$IFn$_invoke$arity$2(x,y),zs);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.concat.cljs$lang$applyTo = (function (seq1380){
|
|
var G__1381 = cljs.core.first(seq1380);
|
|
var seq1380__$1 = cljs.core.next(seq1380);
|
|
var G__1382 = cljs.core.first(seq1380__$1);
|
|
var seq1380__$2 = cljs.core.next(seq1380__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1381,G__1382,seq1380__$2);
|
|
});
|
|
|
|
cljs.core.concat.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Creates a new list containing the items prepended to the rest, the
|
|
* last of which will be treated as a sequence.
|
|
*/
|
|
cljs.core.list_STAR_ = (function cljs$core$list_STAR_(var_args){
|
|
var G__1394 = arguments.length;
|
|
switch (G__1394) {
|
|
case 1:
|
|
return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1396 = arguments.length;
|
|
var i__4642__auto___1397 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1397 < len__4641__auto___1396)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1397]));
|
|
|
|
var G__1398 = (i__4642__auto___1397 + (1));
|
|
i__4642__auto___1397 = G__1398;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$1 = (function (args){
|
|
return cljs.core.seq(args);
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2 = (function (a,args){
|
|
return cljs.core.cons(a,args);
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3 = (function (a,b,args){
|
|
return cljs.core.cons(a,cljs.core.cons(b,args));
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,args){
|
|
return cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,args)));
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$variadic = (function (a,b,c,d,more){
|
|
return cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,cljs.core.cons(d,cljs.core.spread(more)))));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.list_STAR_.cljs$lang$applyTo = (function (seq1389){
|
|
var G__1390 = cljs.core.first(seq1389);
|
|
var seq1389__$1 = cljs.core.next(seq1389);
|
|
var G__1391 = cljs.core.first(seq1389__$1);
|
|
var seq1389__$2 = cljs.core.next(seq1389__$1);
|
|
var G__1392 = cljs.core.first(seq1389__$2);
|
|
var seq1389__$3 = cljs.core.next(seq1389__$2);
|
|
var G__1393 = cljs.core.first(seq1389__$3);
|
|
var seq1389__$4 = cljs.core.next(seq1389__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1390,G__1391,G__1392,G__1393,seq1389__$4);
|
|
});
|
|
|
|
cljs.core.list_STAR_.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Returns a new, transient version of the collection, in constant time.
|
|
*/
|
|
cljs.core.transient$ = (function cljs$core$transient(coll){
|
|
return cljs.core._as_transient(coll);
|
|
});
|
|
/**
|
|
* Returns a new, persistent version of the transient collection, in
|
|
* constant time. The transient collection cannot be used after this
|
|
* call, any such use will throw an exception.
|
|
*/
|
|
cljs.core.persistent_BANG_ = (function cljs$core$persistent_BANG_(tcoll){
|
|
return cljs.core._persistent_BANG_(tcoll);
|
|
});
|
|
/**
|
|
* Adds val to the transient collection, and return tcoll. The 'addition'
|
|
* may happen at different 'places' depending on the concrete type.
|
|
*/
|
|
cljs.core.conj_BANG_ = (function cljs$core$conj_BANG_(var_args){
|
|
var G__1403 = arguments.length;
|
|
switch (G__1403) {
|
|
case 0:
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1405 = arguments.length;
|
|
var i__4642__auto___1406 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1406 < len__4641__auto___1405)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1406]));
|
|
|
|
var G__1407 = (i__4642__auto___1406 + (1));
|
|
i__4642__auto___1406 = G__1407;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.transient$(cljs.core.PersistentVector.EMPTY);
|
|
});
|
|
|
|
cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$1 = (function (tcoll){
|
|
return tcoll;
|
|
});
|
|
|
|
cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,val){
|
|
return cljs.core._conj_BANG_(tcoll,val);
|
|
});
|
|
|
|
cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,val,vals){
|
|
while(true){
|
|
var ntcoll = cljs.core._conj_BANG_(tcoll,val);
|
|
if(cljs.core.truth_(vals)){
|
|
var G__1408 = ntcoll;
|
|
var G__1409 = cljs.core.first(vals);
|
|
var G__1410 = cljs.core.next(vals);
|
|
tcoll = G__1408;
|
|
val = G__1409;
|
|
vals = G__1410;
|
|
continue;
|
|
} else {
|
|
return ntcoll;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.conj_BANG_.cljs$lang$applyTo = (function (seq1400){
|
|
var G__1401 = cljs.core.first(seq1400);
|
|
var seq1400__$1 = cljs.core.next(seq1400);
|
|
var G__1402 = cljs.core.first(seq1400__$1);
|
|
var seq1400__$2 = cljs.core.next(seq1400__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1401,G__1402,seq1400__$2);
|
|
});
|
|
|
|
cljs.core.conj_BANG_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* When applied to a transient map, adds mapping of key(s) to
|
|
* val(s). When applied to a transient vector, sets the val at index.
|
|
* Note - index must be <= (count vector). Returns coll.
|
|
*/
|
|
cljs.core.assoc_BANG_ = (function cljs$core$assoc_BANG_(var_args){
|
|
var G__1416 = arguments.length;
|
|
switch (G__1416) {
|
|
case 3:
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1418 = arguments.length;
|
|
var i__4642__auto___1419 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1419 < len__4641__auto___1418)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1419]));
|
|
|
|
var G__1420 = (i__4642__auto___1419 + (1));
|
|
i__4642__auto___1419 = G__1420;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (tcoll,key,val){
|
|
return cljs.core._assoc_BANG_(tcoll,key,val);
|
|
});
|
|
|
|
cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,key,val,kvs){
|
|
while(true){
|
|
var ntcoll = cljs.core._assoc_BANG_(tcoll,key,val);
|
|
if(cljs.core.truth_(kvs)){
|
|
var G__1421 = ntcoll;
|
|
var G__1422 = cljs.core.first(kvs);
|
|
var G__1423 = cljs.core.second(kvs);
|
|
var G__1424 = cljs.core.nnext(kvs);
|
|
tcoll = G__1421;
|
|
key = G__1422;
|
|
val = G__1423;
|
|
kvs = G__1424;
|
|
continue;
|
|
} else {
|
|
return ntcoll;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.assoc_BANG_.cljs$lang$applyTo = (function (seq1412){
|
|
var G__1413 = cljs.core.first(seq1412);
|
|
var seq1412__$1 = cljs.core.next(seq1412);
|
|
var G__1414 = cljs.core.first(seq1412__$1);
|
|
var seq1412__$2 = cljs.core.next(seq1412__$1);
|
|
var G__1415 = cljs.core.first(seq1412__$2);
|
|
var seq1412__$3 = cljs.core.next(seq1412__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1413,G__1414,G__1415,seq1412__$3);
|
|
});
|
|
|
|
cljs.core.assoc_BANG_.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Returns a transient map that doesn't contain a mapping for key(s).
|
|
*/
|
|
cljs.core.dissoc_BANG_ = (function cljs$core$dissoc_BANG_(var_args){
|
|
var G__1429 = arguments.length;
|
|
switch (G__1429) {
|
|
case 2:
|
|
return cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1431 = arguments.length;
|
|
var i__4642__auto___1432 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1432 < len__4641__auto___1431)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1432]));
|
|
|
|
var G__1433 = (i__4642__auto___1432 + (1));
|
|
i__4642__auto___1432 = G__1433;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,key){
|
|
return cljs.core._dissoc_BANG_(tcoll,key);
|
|
});
|
|
|
|
cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,key,ks){
|
|
while(true){
|
|
var ntcoll = cljs.core._dissoc_BANG_(tcoll,key);
|
|
if(cljs.core.truth_(ks)){
|
|
var G__1434 = ntcoll;
|
|
var G__1435 = cljs.core.first(ks);
|
|
var G__1436 = cljs.core.next(ks);
|
|
tcoll = G__1434;
|
|
key = G__1435;
|
|
ks = G__1436;
|
|
continue;
|
|
} else {
|
|
return ntcoll;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.dissoc_BANG_.cljs$lang$applyTo = (function (seq1426){
|
|
var G__1427 = cljs.core.first(seq1426);
|
|
var seq1426__$1 = cljs.core.next(seq1426);
|
|
var G__1428 = cljs.core.first(seq1426__$1);
|
|
var seq1426__$2 = cljs.core.next(seq1426__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1427,G__1428,seq1426__$2);
|
|
});
|
|
|
|
cljs.core.dissoc_BANG_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Removes the last item from a transient vector. If
|
|
* the collection is empty, throws an exception. Returns tcoll
|
|
*/
|
|
cljs.core.pop_BANG_ = (function cljs$core$pop_BANG_(tcoll){
|
|
return cljs.core._pop_BANG_(tcoll);
|
|
});
|
|
/**
|
|
* disj[oin]. Returns a transient set of the same (hashed/sorted) type, that
|
|
* does not contain key(s).
|
|
*/
|
|
cljs.core.disj_BANG_ = (function cljs$core$disj_BANG_(var_args){
|
|
var G__1441 = arguments.length;
|
|
switch (G__1441) {
|
|
case 2:
|
|
return cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1443 = arguments.length;
|
|
var i__4642__auto___1444 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1444 < len__4641__auto___1443)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1444]));
|
|
|
|
var G__1445 = (i__4642__auto___1444 + (1));
|
|
i__4642__auto___1444 = G__1445;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (tcoll,val){
|
|
return cljs.core._disjoin_BANG_(tcoll,val);
|
|
});
|
|
|
|
cljs.core.disj_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (tcoll,val,vals){
|
|
while(true){
|
|
var ntcoll = cljs.core._disjoin_BANG_(tcoll,val);
|
|
if(cljs.core.truth_(vals)){
|
|
var G__1446 = ntcoll;
|
|
var G__1447 = cljs.core.first(vals);
|
|
var G__1448 = cljs.core.next(vals);
|
|
tcoll = G__1446;
|
|
val = G__1447;
|
|
vals = G__1448;
|
|
continue;
|
|
} else {
|
|
return ntcoll;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.disj_BANG_.cljs$lang$applyTo = (function (seq1438){
|
|
var G__1439 = cljs.core.first(seq1438);
|
|
var seq1438__$1 = cljs.core.next(seq1438);
|
|
var G__1440 = cljs.core.first(seq1438__$1);
|
|
var seq1438__$2 = cljs.core.next(seq1438__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1439,G__1440,seq1438__$2);
|
|
});
|
|
|
|
cljs.core.disj_BANG_.cljs$lang$maxFixedArity = (2);
|
|
|
|
|
|
cljs.core.apply_to = (function cljs$core$apply_to(f,argc,args){
|
|
var args__$1 = cljs.core.seq(args);
|
|
if((argc === (0))){
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
} else {
|
|
var a151 = cljs.core._first(args__$1);
|
|
var args__$2 = cljs.core._rest(args__$1);
|
|
if((argc === (1))){
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(a151) : f.call(null,a151));
|
|
} else {
|
|
var b152 = cljs.core._first(args__$2);
|
|
var args__$3 = cljs.core._rest(args__$2);
|
|
if((argc === (2))){
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(a151,b152) : f.call(null,a151,b152));
|
|
} else {
|
|
var c153 = cljs.core._first(args__$3);
|
|
var args__$4 = cljs.core._rest(args__$3);
|
|
if((argc === (3))){
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(a151,b152,c153) : f.call(null,a151,b152,c153));
|
|
} else {
|
|
var d154 = cljs.core._first(args__$4);
|
|
var args__$5 = cljs.core._rest(args__$4);
|
|
if((argc === (4))){
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(a151,b152,c153,d154) : f.call(null,a151,b152,c153,d154));
|
|
} else {
|
|
var e155 = cljs.core._first(args__$5);
|
|
var args__$6 = cljs.core._rest(args__$5);
|
|
if((argc === (5))){
|
|
return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(a151,b152,c153,d154,e155) : f.call(null,a151,b152,c153,d154,e155));
|
|
} else {
|
|
var f156 = cljs.core._first(args__$6);
|
|
var args__$7 = cljs.core._rest(args__$6);
|
|
if((argc === (6))){
|
|
return (f.cljs$core$IFn$_invoke$arity$6 ? f.cljs$core$IFn$_invoke$arity$6(a151,b152,c153,d154,e155,f156) : f.call(null,a151,b152,c153,d154,e155,f156));
|
|
} else {
|
|
var g157 = cljs.core._first(args__$7);
|
|
var args__$8 = cljs.core._rest(args__$7);
|
|
if((argc === (7))){
|
|
return (f.cljs$core$IFn$_invoke$arity$7 ? f.cljs$core$IFn$_invoke$arity$7(a151,b152,c153,d154,e155,f156,g157) : f.call(null,a151,b152,c153,d154,e155,f156,g157));
|
|
} else {
|
|
var h158 = cljs.core._first(args__$8);
|
|
var args__$9 = cljs.core._rest(args__$8);
|
|
if((argc === (8))){
|
|
return (f.cljs$core$IFn$_invoke$arity$8 ? f.cljs$core$IFn$_invoke$arity$8(a151,b152,c153,d154,e155,f156,g157,h158) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158));
|
|
} else {
|
|
var i159 = cljs.core._first(args__$9);
|
|
var args__$10 = cljs.core._rest(args__$9);
|
|
if((argc === (9))){
|
|
return (f.cljs$core$IFn$_invoke$arity$9 ? f.cljs$core$IFn$_invoke$arity$9(a151,b152,c153,d154,e155,f156,g157,h158,i159) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159));
|
|
} else {
|
|
var j160 = cljs.core._first(args__$10);
|
|
var args__$11 = cljs.core._rest(args__$10);
|
|
if((argc === (10))){
|
|
return (f.cljs$core$IFn$_invoke$arity$10 ? f.cljs$core$IFn$_invoke$arity$10(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160));
|
|
} else {
|
|
var k161 = cljs.core._first(args__$11);
|
|
var args__$12 = cljs.core._rest(args__$11);
|
|
if((argc === (11))){
|
|
return (f.cljs$core$IFn$_invoke$arity$11 ? f.cljs$core$IFn$_invoke$arity$11(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161));
|
|
} else {
|
|
var l162 = cljs.core._first(args__$12);
|
|
var args__$13 = cljs.core._rest(args__$12);
|
|
if((argc === (12))){
|
|
return (f.cljs$core$IFn$_invoke$arity$12 ? f.cljs$core$IFn$_invoke$arity$12(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162));
|
|
} else {
|
|
var m163 = cljs.core._first(args__$13);
|
|
var args__$14 = cljs.core._rest(args__$13);
|
|
if((argc === (13))){
|
|
return (f.cljs$core$IFn$_invoke$arity$13 ? f.cljs$core$IFn$_invoke$arity$13(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163));
|
|
} else {
|
|
var n164 = cljs.core._first(args__$14);
|
|
var args__$15 = cljs.core._rest(args__$14);
|
|
if((argc === (14))){
|
|
return (f.cljs$core$IFn$_invoke$arity$14 ? f.cljs$core$IFn$_invoke$arity$14(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164));
|
|
} else {
|
|
var o165 = cljs.core._first(args__$15);
|
|
var args__$16 = cljs.core._rest(args__$15);
|
|
if((argc === (15))){
|
|
return (f.cljs$core$IFn$_invoke$arity$15 ? f.cljs$core$IFn$_invoke$arity$15(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165));
|
|
} else {
|
|
var p166 = cljs.core._first(args__$16);
|
|
var args__$17 = cljs.core._rest(args__$16);
|
|
if((argc === (16))){
|
|
return (f.cljs$core$IFn$_invoke$arity$16 ? f.cljs$core$IFn$_invoke$arity$16(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166));
|
|
} else {
|
|
var q167 = cljs.core._first(args__$17);
|
|
var args__$18 = cljs.core._rest(args__$17);
|
|
if((argc === (17))){
|
|
return (f.cljs$core$IFn$_invoke$arity$17 ? f.cljs$core$IFn$_invoke$arity$17(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167));
|
|
} else {
|
|
var r168 = cljs.core._first(args__$18);
|
|
var args__$19 = cljs.core._rest(args__$18);
|
|
if((argc === (18))){
|
|
return (f.cljs$core$IFn$_invoke$arity$18 ? f.cljs$core$IFn$_invoke$arity$18(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168));
|
|
} else {
|
|
var s169 = cljs.core._first(args__$19);
|
|
var args__$20 = cljs.core._rest(args__$19);
|
|
if((argc === (19))){
|
|
return (f.cljs$core$IFn$_invoke$arity$19 ? f.cljs$core$IFn$_invoke$arity$19(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169));
|
|
} else {
|
|
var t170 = cljs.core._first(args__$20);
|
|
var args__$21 = cljs.core._rest(args__$20);
|
|
if((argc === (20))){
|
|
return (f.cljs$core$IFn$_invoke$arity$20 ? f.cljs$core$IFn$_invoke$arity$20(a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169,t170) : f.call(null,a151,b152,c153,d154,e155,f156,g157,h158,i159,j160,k161,l162,m163,n164,o165,p166,q167,r168,s169,t170));
|
|
} else {
|
|
throw (new Error("Only up to 20 arguments supported on functions"));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Internal. DO NOT USE!
|
|
* Assumes args was already called with seq beforehand!
|
|
*/
|
|
cljs.core.apply_to_simple = (function cljs$core$apply_to_simple(var_args){
|
|
var G__1450 = arguments.length;
|
|
switch (G__1450) {
|
|
case 2:
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2 = (function (f,args){
|
|
if((args == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$0){
|
|
return f.cljs$core$IFn$_invoke$arity$0();
|
|
} else {
|
|
return f.call(f);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3(f,cljs.core._first(args),cljs.core.next(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3 = (function (f,a0,args){
|
|
if((args == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$1){
|
|
return f.cljs$core$IFn$_invoke$arity$1(a0);
|
|
} else {
|
|
return f.call(f,a0);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4(f,a0,cljs.core._first(args),cljs.core.next(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4 = (function (f,a0,a1,args){
|
|
if((args == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$2){
|
|
return f.cljs$core$IFn$_invoke$arity$2(a0,a1);
|
|
} else {
|
|
return f.call(f,a0,a1);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5(f,a0,a1,cljs.core._first(args),cljs.core.next(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5 = (function (f,a0,a1,a2,args){
|
|
if((args == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$3){
|
|
return f.cljs$core$IFn$_invoke$arity$3(a0,a1,a2);
|
|
} else {
|
|
return f.call(f,a0,a1,a2);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6(f,a0,a1,a2,cljs.core._first(args),cljs.core.next(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6 = (function (f,a0,a1,a2,a3,args){
|
|
if((args == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$4){
|
|
return f.cljs$core$IFn$_invoke$arity$4(a0,a1,a2,a3);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3);
|
|
}
|
|
} else {
|
|
var a4 = cljs.core._first(args);
|
|
var next_4 = cljs.core.next(args);
|
|
if((next_4 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$5){
|
|
return f.cljs$core$IFn$_invoke$arity$5(a0,a1,a2,a3,a4);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4);
|
|
}
|
|
} else {
|
|
var a5 = cljs.core._first(next_4);
|
|
var next_5 = cljs.core.next(next_4);
|
|
if((next_5 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$6){
|
|
return f.cljs$core$IFn$_invoke$arity$6(a0,a1,a2,a3,a4,a5);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5);
|
|
}
|
|
} else {
|
|
var a6 = cljs.core._first(next_5);
|
|
var next_6 = cljs.core.next(next_5);
|
|
if((next_6 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$7){
|
|
return f.cljs$core$IFn$_invoke$arity$7(a0,a1,a2,a3,a4,a5,a6);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6);
|
|
}
|
|
} else {
|
|
var a7 = cljs.core._first(next_6);
|
|
var next_7 = cljs.core.next(next_6);
|
|
if((next_7 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$8){
|
|
return f.cljs$core$IFn$_invoke$arity$8(a0,a1,a2,a3,a4,a5,a6,a7);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7);
|
|
}
|
|
} else {
|
|
var a8 = cljs.core._first(next_7);
|
|
var next_8 = cljs.core.next(next_7);
|
|
if((next_8 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$9){
|
|
return f.cljs$core$IFn$_invoke$arity$9(a0,a1,a2,a3,a4,a5,a6,a7,a8);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8);
|
|
}
|
|
} else {
|
|
var a9 = cljs.core._first(next_8);
|
|
var next_9 = cljs.core.next(next_8);
|
|
if((next_9 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$10){
|
|
return f.cljs$core$IFn$_invoke$arity$10(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9);
|
|
}
|
|
} else {
|
|
var a10 = cljs.core._first(next_9);
|
|
var next_10 = cljs.core.next(next_9);
|
|
if((next_10 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$11){
|
|
return f.cljs$core$IFn$_invoke$arity$11(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);
|
|
}
|
|
} else {
|
|
var a11 = cljs.core._first(next_10);
|
|
var next_11 = cljs.core.next(next_10);
|
|
if((next_11 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$12){
|
|
return f.cljs$core$IFn$_invoke$arity$12(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11);
|
|
}
|
|
} else {
|
|
var a12 = cljs.core._first(next_11);
|
|
var next_12 = cljs.core.next(next_11);
|
|
if((next_12 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$13){
|
|
return f.cljs$core$IFn$_invoke$arity$13(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12);
|
|
}
|
|
} else {
|
|
var a13 = cljs.core._first(next_12);
|
|
var next_13 = cljs.core.next(next_12);
|
|
if((next_13 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$14){
|
|
return f.cljs$core$IFn$_invoke$arity$14(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13);
|
|
}
|
|
} else {
|
|
var a14 = cljs.core._first(next_13);
|
|
var next_14 = cljs.core.next(next_13);
|
|
if((next_14 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$15){
|
|
return f.cljs$core$IFn$_invoke$arity$15(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14);
|
|
}
|
|
} else {
|
|
var a15 = cljs.core._first(next_14);
|
|
var next_15 = cljs.core.next(next_14);
|
|
if((next_15 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$16){
|
|
return f.cljs$core$IFn$_invoke$arity$16(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15);
|
|
}
|
|
} else {
|
|
var a16 = cljs.core._first(next_15);
|
|
var next_16 = cljs.core.next(next_15);
|
|
if((next_16 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$17){
|
|
return f.cljs$core$IFn$_invoke$arity$17(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16);
|
|
}
|
|
} else {
|
|
var a17 = cljs.core._first(next_16);
|
|
var next_17 = cljs.core.next(next_16);
|
|
if((next_17 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$18){
|
|
return f.cljs$core$IFn$_invoke$arity$18(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17);
|
|
}
|
|
} else {
|
|
var a18 = cljs.core._first(next_17);
|
|
var next_18 = cljs.core.next(next_17);
|
|
if((next_18 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$19){
|
|
return f.cljs$core$IFn$_invoke$arity$19(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18);
|
|
}
|
|
} else {
|
|
var a19 = cljs.core._first(next_18);
|
|
var next_19 = cljs.core.next(next_18);
|
|
if((next_19 == null)){
|
|
if(f.cljs$core$IFn$_invoke$arity$20){
|
|
return f.cljs$core$IFn$_invoke$arity$20(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19);
|
|
} else {
|
|
return f.call(f,a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19);
|
|
}
|
|
} else {
|
|
var arr__4566__auto__ = [a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19];
|
|
var s__4567__auto___1452 = next_19;
|
|
while(true){
|
|
if(s__4567__auto___1452){
|
|
arr__4566__auto__.push(cljs.core._first(s__4567__auto___1452));
|
|
|
|
var G__1453 = cljs.core.next(s__4567__auto___1452);
|
|
s__4567__auto___1452 = G__1453;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return f.apply(f,arr__4566__auto__);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.apply_to_simple.cljs$lang$maxFixedArity = 6;
|
|
|
|
/**
|
|
* Applies fn f to the argument list formed by prepending intervening arguments to args.
|
|
*/
|
|
cljs.core.apply = (function cljs$core$apply(var_args){
|
|
var G__1461 = arguments.length;
|
|
switch (G__1461) {
|
|
case 2:
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1463 = arguments.length;
|
|
var i__4642__auto___1464 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1464 < len__4641__auto___1463)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1464]));
|
|
|
|
var G__1465 = (i__4642__auto___1464 + (1));
|
|
i__4642__auto___1464 = G__1465;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((5)),(0),null));
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.apply.cljs$core$IFn$_invoke$arity$2 = (function (f,args){
|
|
if(f.cljs$lang$applyTo){
|
|
var fixed_arity = f.cljs$lang$maxFixedArity;
|
|
var bc = cljs.core.bounded_count((fixed_arity + (1)),args);
|
|
if((bc <= fixed_arity)){
|
|
return cljs.core.apply_to(f,bc,args);
|
|
} else {
|
|
return f.cljs$lang$applyTo(args);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$2(f,cljs.core.seq(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply.cljs$core$IFn$_invoke$arity$3 = (function (f,x,args){
|
|
if(f.cljs$lang$applyTo){
|
|
var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$2(x,args);
|
|
var fixed_arity = f.cljs$lang$maxFixedArity;
|
|
var bc = (cljs.core.bounded_count(fixed_arity,args) + (1));
|
|
if((bc <= fixed_arity)){
|
|
return cljs.core.apply_to(f,bc,arglist);
|
|
} else {
|
|
return f.cljs$lang$applyTo(arglist);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$3(f,x,cljs.core.seq(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply.cljs$core$IFn$_invoke$arity$4 = (function (f,x,y,args){
|
|
if(f.cljs$lang$applyTo){
|
|
var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$3(x,y,args);
|
|
var fixed_arity = f.cljs$lang$maxFixedArity;
|
|
var bc = ((2) + cljs.core.bounded_count((fixed_arity - (1)),args));
|
|
if((bc <= fixed_arity)){
|
|
return cljs.core.apply_to(f,bc,arglist);
|
|
} else {
|
|
return f.cljs$lang$applyTo(arglist);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$4(f,x,y,cljs.core.seq(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply.cljs$core$IFn$_invoke$arity$5 = (function (f,x,y,z,args){
|
|
if(f.cljs$lang$applyTo){
|
|
var arglist = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(x,y,z,args);
|
|
var fixed_arity = f.cljs$lang$maxFixedArity;
|
|
var bc = ((3) + cljs.core.bounded_count((fixed_arity - (2)),args));
|
|
if((bc <= fixed_arity)){
|
|
return cljs.core.apply_to(f,bc,arglist);
|
|
} else {
|
|
return f.cljs$lang$applyTo(arglist);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$5(f,x,y,z,cljs.core.seq(args));
|
|
}
|
|
});
|
|
|
|
cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic = (function (f,a,b,c,d,args){
|
|
if(f.cljs$lang$applyTo){
|
|
var spread_args = cljs.core.spread(args);
|
|
var arglist = cljs.core.cons(a,cljs.core.cons(b,cljs.core.cons(c,cljs.core.cons(d,spread_args))));
|
|
var fixed_arity = f.cljs$lang$maxFixedArity;
|
|
var bc = ((4) + cljs.core.bounded_count((fixed_arity - (3)),spread_args));
|
|
if((bc <= fixed_arity)){
|
|
return cljs.core.apply_to(f,bc,arglist);
|
|
} else {
|
|
return f.cljs$lang$applyTo(arglist);
|
|
}
|
|
} else {
|
|
return cljs.core.apply_to_simple.cljs$core$IFn$_invoke$arity$6(f,a,b,c,d,cljs.core.spread(args));
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.apply.cljs$lang$applyTo = (function (seq1455){
|
|
var G__1456 = cljs.core.first(seq1455);
|
|
var seq1455__$1 = cljs.core.next(seq1455);
|
|
var G__1457 = cljs.core.first(seq1455__$1);
|
|
var seq1455__$2 = cljs.core.next(seq1455__$1);
|
|
var G__1458 = cljs.core.first(seq1455__$2);
|
|
var seq1455__$3 = cljs.core.next(seq1455__$2);
|
|
var G__1459 = cljs.core.first(seq1455__$3);
|
|
var seq1455__$4 = cljs.core.next(seq1455__$3);
|
|
var G__1460 = cljs.core.first(seq1455__$4);
|
|
var seq1455__$5 = cljs.core.next(seq1455__$4);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1456,G__1457,G__1458,G__1459,G__1460,seq1455__$5);
|
|
});
|
|
|
|
cljs.core.apply.cljs$lang$maxFixedArity = (5);
|
|
|
|
/**
|
|
* Returns an object of the same type and value as obj, with
|
|
* (apply f (meta obj) args) as its metadata.
|
|
*/
|
|
cljs.core.vary_meta = (function cljs$core$vary_meta(var_args){
|
|
var G__1474 = arguments.length;
|
|
switch (G__1474) {
|
|
case 2:
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1491 = arguments.length;
|
|
var i__4642__auto___1492 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1492 < len__4641__auto___1491)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1492]));
|
|
|
|
var G__1493 = (i__4642__auto___1492 + (1));
|
|
i__4642__auto___1492 = G__1493;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((6)),(0),null));
|
|
return cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$2 = (function (obj,f){
|
|
return cljs.core.with_meta(obj,(function (){var G__1475 = cljs.core.meta(obj);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1475) : f.call(null,G__1475));
|
|
})());
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$3 = (function (obj,f,a){
|
|
return cljs.core.with_meta(obj,(function (){var G__1476 = cljs.core.meta(obj);
|
|
var G__1477 = a;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1476,G__1477) : f.call(null,G__1476,G__1477));
|
|
})());
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$4 = (function (obj,f,a,b){
|
|
return cljs.core.with_meta(obj,(function (){var G__1478 = cljs.core.meta(obj);
|
|
var G__1479 = a;
|
|
var G__1480 = b;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1478,G__1479,G__1480) : f.call(null,G__1478,G__1479,G__1480));
|
|
})());
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$5 = (function (obj,f,a,b,c){
|
|
return cljs.core.with_meta(obj,(function (){var G__1481 = cljs.core.meta(obj);
|
|
var G__1482 = a;
|
|
var G__1483 = b;
|
|
var G__1484 = c;
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__1481,G__1482,G__1483,G__1484) : f.call(null,G__1481,G__1482,G__1483,G__1484));
|
|
})());
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$6 = (function (obj,f,a,b,c,d){
|
|
return cljs.core.with_meta(obj,(function (){var G__1485 = cljs.core.meta(obj);
|
|
var G__1486 = a;
|
|
var G__1487 = b;
|
|
var G__1488 = c;
|
|
var G__1489 = d;
|
|
return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(G__1485,G__1486,G__1487,G__1488,G__1489) : f.call(null,G__1485,G__1486,G__1487,G__1488,G__1489));
|
|
})());
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$core$IFn$_invoke$arity$variadic = (function (obj,f,a,b,c,d,args){
|
|
return cljs.core.with_meta(obj,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.meta(obj),a,b,c,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([d,args], 0)));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.vary_meta.cljs$lang$applyTo = (function (seq1467){
|
|
var G__1468 = cljs.core.first(seq1467);
|
|
var seq1467__$1 = cljs.core.next(seq1467);
|
|
var G__1469 = cljs.core.first(seq1467__$1);
|
|
var seq1467__$2 = cljs.core.next(seq1467__$1);
|
|
var G__1470 = cljs.core.first(seq1467__$2);
|
|
var seq1467__$3 = cljs.core.next(seq1467__$2);
|
|
var G__1471 = cljs.core.first(seq1467__$3);
|
|
var seq1467__$4 = cljs.core.next(seq1467__$3);
|
|
var G__1472 = cljs.core.first(seq1467__$4);
|
|
var seq1467__$5 = cljs.core.next(seq1467__$4);
|
|
var G__1473 = cljs.core.first(seq1467__$5);
|
|
var seq1467__$6 = cljs.core.next(seq1467__$5);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1468,G__1469,G__1470,G__1471,G__1472,G__1473,seq1467__$6);
|
|
});
|
|
|
|
cljs.core.vary_meta.cljs$lang$maxFixedArity = (6);
|
|
|
|
/**
|
|
* Same as (not (= obj1 obj2))
|
|
*/
|
|
cljs.core.not_EQ_ = (function cljs$core$not_EQ_(var_args){
|
|
var G__1498 = arguments.length;
|
|
switch (G__1498) {
|
|
case 1:
|
|
return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1500 = arguments.length;
|
|
var i__4642__auto___1501 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1501 < len__4641__auto___1500)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1501]));
|
|
|
|
var G__1502 = (i__4642__auto___1501 + (1));
|
|
i__4642__auto___1501 = G__1502;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return false;
|
|
});
|
|
|
|
cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2 = (function (x,y){
|
|
return (!(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)));
|
|
});
|
|
|
|
cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$variadic = (function (x,y,more){
|
|
return cljs.core.not(cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core._EQ_,x,y,more));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.not_EQ_.cljs$lang$applyTo = (function (seq1495){
|
|
var G__1496 = cljs.core.first(seq1495);
|
|
var seq1495__$1 = cljs.core.next(seq1495);
|
|
var G__1497 = cljs.core.first(seq1495__$1);
|
|
var seq1495__$2 = cljs.core.next(seq1495__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1496,G__1497,seq1495__$2);
|
|
});
|
|
|
|
cljs.core.not_EQ_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* If coll is empty, returns nil, else coll
|
|
*/
|
|
cljs.core.not_empty = (function cljs$core$not_empty(coll){
|
|
if(cljs.core.seq(coll)){
|
|
return coll;
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
cljs.core.nil_iter = (function cljs$core$nil_iter(){
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.t_cljs$core1503 !== 'undefined')){
|
|
} else {
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.t_cljs$core1503 = (function (meta1504){
|
|
this.meta1504 = meta1504;
|
|
this.cljs$lang$protocol_mask$partition0$ = 393216;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.t_cljs$core1503.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (_1505,meta1504__$1){
|
|
var self__ = this;
|
|
var _1505__$1 = this;
|
|
return (new cljs.core.t_cljs$core1503(meta1504__$1));
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_1505){
|
|
var self__ = this;
|
|
var _1505__$1 = this;
|
|
return self__.meta1504;
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return false;
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("No such element"));
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta1504], null);
|
|
});
|
|
|
|
cljs.core.t_cljs$core1503.cljs$lang$type = true;
|
|
|
|
cljs.core.t_cljs$core1503.cljs$lang$ctorStr = "cljs.core/t_cljs$core1503";
|
|
|
|
cljs.core.t_cljs$core1503.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/t_cljs$core1503");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/t_cljs$core1503.
|
|
*/
|
|
cljs.core.__GT_t_cljs$core1503 = (function cljs$core$nil_iter_$___GT_t_cljs$core1503(meta1504){
|
|
return (new cljs.core.t_cljs$core1503(meta1504));
|
|
});
|
|
|
|
}
|
|
|
|
return (new cljs.core.t_cljs$core1503(cljs.core.PersistentArrayMap.EMPTY));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.StringIter = (function (s,i){
|
|
this.s = s;
|
|
this.i = i;
|
|
});
|
|
cljs.core.StringIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.i < self__.s.length);
|
|
});
|
|
|
|
cljs.core.StringIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = self__.s.charAt(self__.i);
|
|
self__.i = (self__.i + (1));
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.StringIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.StringIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.StringIter.cljs$lang$type = true;
|
|
|
|
cljs.core.StringIter.cljs$lang$ctorStr = "cljs.core/StringIter";
|
|
|
|
cljs.core.StringIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/StringIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/StringIter.
|
|
*/
|
|
cljs.core.__GT_StringIter = (function cljs$core$__GT_StringIter(s,i){
|
|
return (new cljs.core.StringIter(s,i));
|
|
});
|
|
|
|
cljs.core.string_iter = (function cljs$core$string_iter(x){
|
|
return (new cljs.core.StringIter(x,(0)));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ArrayIter = (function (arr,i){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
});
|
|
cljs.core.ArrayIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.i < self__.arr.length);
|
|
});
|
|
|
|
cljs.core.ArrayIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = (self__.arr[self__.i]);
|
|
self__.i = (self__.i + (1));
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.ArrayIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.ArrayIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ArrayIter.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayIter.cljs$lang$ctorStr = "cljs.core/ArrayIter";
|
|
|
|
cljs.core.ArrayIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayIter.
|
|
*/
|
|
cljs.core.__GT_ArrayIter = (function cljs$core$__GT_ArrayIter(arr,i){
|
|
return (new cljs.core.ArrayIter(arr,i));
|
|
});
|
|
|
|
cljs.core.array_iter = (function cljs$core$array_iter(x){
|
|
return (new cljs.core.ArrayIter(x,(0)));
|
|
});
|
|
cljs.core.INIT = ({});
|
|
cljs.core.START = ({});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.SeqIter = (function (_seq,_next){
|
|
this._seq = _seq;
|
|
this._next = _next;
|
|
});
|
|
cljs.core.SeqIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((self__._seq === cljs.core.INIT)){
|
|
self__._seq = cljs.core.START;
|
|
|
|
self__._next = cljs.core.seq(self__._next);
|
|
} else {
|
|
if((self__._seq === self__._next)){
|
|
self__._next = cljs.core.next(self__._seq);
|
|
} else {
|
|
}
|
|
}
|
|
|
|
return (!((self__._next == null)));
|
|
});
|
|
|
|
cljs.core.SeqIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if((!(this$.hasNext()))){
|
|
throw (new Error("No such element"));
|
|
} else {
|
|
self__._seq = self__._next;
|
|
|
|
return cljs.core.first(self__._next);
|
|
}
|
|
});
|
|
|
|
cljs.core.SeqIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.SeqIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$_seq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.SeqIter.cljs$lang$type = true;
|
|
|
|
cljs.core.SeqIter.cljs$lang$ctorStr = "cljs.core/SeqIter";
|
|
|
|
cljs.core.SeqIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/SeqIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/SeqIter.
|
|
*/
|
|
cljs.core.__GT_SeqIter = (function cljs$core$__GT_SeqIter(_seq,_next){
|
|
return (new cljs.core.SeqIter(_seq,_next));
|
|
});
|
|
|
|
cljs.core.seq_iter = (function cljs$core$seq_iter(coll){
|
|
return (new cljs.core.SeqIter(cljs.core.INIT,coll));
|
|
});
|
|
cljs.core.iter = (function cljs$core$iter(coll){
|
|
if(cljs.core.iterable_QMARK_(coll)){
|
|
return cljs.core._iterator(coll);
|
|
} else {
|
|
if((coll == null)){
|
|
return cljs.core.nil_iter();
|
|
} else {
|
|
if(typeof coll === 'string'){
|
|
return cljs.core.string_iter(coll);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
return cljs.core.array_iter(coll);
|
|
} else {
|
|
if(cljs.core.seqable_QMARK_(coll)){
|
|
return cljs.core.seq_iter(coll);
|
|
} else {
|
|
throw (new Error(["Cannot create iterator from ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll)].join('')));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.Many = (function (vals){
|
|
this.vals = vals;
|
|
});
|
|
cljs.core.Many.prototype.add = (function (o){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
self__.vals.push(o);
|
|
|
|
return this$;
|
|
});
|
|
|
|
cljs.core.Many.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return self__.vals.shift();
|
|
});
|
|
|
|
cljs.core.Many.prototype.isEmpty = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return (self__.vals.length === (0));
|
|
});
|
|
|
|
cljs.core.Many.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return ["Many: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.vals)].join('');
|
|
});
|
|
|
|
cljs.core.Many.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$vals], null);
|
|
});
|
|
|
|
cljs.core.Many.cljs$lang$type = true;
|
|
|
|
cljs.core.Many.cljs$lang$ctorStr = "cljs.core/Many";
|
|
|
|
cljs.core.Many.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Many");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Many.
|
|
*/
|
|
cljs.core.__GT_Many = (function cljs$core$__GT_Many(vals){
|
|
return (new cljs.core.Many(vals));
|
|
});
|
|
|
|
cljs.core.NONE = ({});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.Single = (function (val){
|
|
this.val = val;
|
|
});
|
|
cljs.core.Single.prototype.add = (function (o){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if((self__.val === cljs.core.NONE)){
|
|
self__.val = o;
|
|
|
|
return this$;
|
|
} else {
|
|
return (new cljs.core.Many([self__.val,o]));
|
|
}
|
|
});
|
|
|
|
cljs.core.Single.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if((self__.val === cljs.core.NONE)){
|
|
throw (new Error("Removing object from empty buffer"));
|
|
} else {
|
|
var ret = self__.val;
|
|
self__.val = cljs.core.NONE;
|
|
|
|
return ret;
|
|
}
|
|
});
|
|
|
|
cljs.core.Single.prototype.isEmpty = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return (self__.val === cljs.core.NONE);
|
|
});
|
|
|
|
cljs.core.Single.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return ["Single: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.val)].join('');
|
|
});
|
|
|
|
cljs.core.Single.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Single.cljs$lang$type = true;
|
|
|
|
cljs.core.Single.cljs$lang$ctorStr = "cljs.core/Single";
|
|
|
|
cljs.core.Single.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Single");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Single.
|
|
*/
|
|
cljs.core.__GT_Single = (function cljs$core$__GT_Single(val){
|
|
return (new cljs.core.Single(val));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.Empty = (function (){
|
|
});
|
|
cljs.core.Empty.prototype.add = (function (o){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return (new cljs.core.Single(o));
|
|
});
|
|
|
|
cljs.core.Empty.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
throw (new Error("Removing object from empty buffer"));
|
|
});
|
|
|
|
cljs.core.Empty.prototype.isEmpty = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return true;
|
|
});
|
|
|
|
cljs.core.Empty.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return "Empty";
|
|
});
|
|
|
|
cljs.core.Empty.getBasis = (function (){
|
|
return cljs.core.PersistentVector.EMPTY;
|
|
});
|
|
|
|
cljs.core.Empty.cljs$lang$type = true;
|
|
|
|
cljs.core.Empty.cljs$lang$ctorStr = "cljs.core/Empty";
|
|
|
|
cljs.core.Empty.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Empty");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Empty.
|
|
*/
|
|
cljs.core.__GT_Empty = (function cljs$core$__GT_Empty(){
|
|
return (new cljs.core.Empty());
|
|
});
|
|
|
|
cljs.core.EMPTY = (new cljs.core.Empty());
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.MultiIterator = (function (iters){
|
|
this.iters = iters;
|
|
});
|
|
cljs.core.MultiIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var iters__$1 = cljs.core.seq(self__.iters);
|
|
while(true){
|
|
if((!((iters__$1 == null)))){
|
|
var iter = cljs.core.first(iters__$1);
|
|
if((!(iter.hasNext()))){
|
|
return false;
|
|
} else {
|
|
var G__1506 = cljs.core.next(iters__$1);
|
|
iters__$1 = G__1506;
|
|
continue;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.MultiIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var nexts = [];
|
|
var n__4518__auto___1507 = self__.iters.length;
|
|
var i_1508 = (0);
|
|
while(true){
|
|
if((i_1508 < n__4518__auto___1507)){
|
|
(nexts[i_1508] = (self__.iters[i_1508]).next());
|
|
|
|
var G__1509 = (i_1508 + (1));
|
|
i_1508 = G__1509;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(nexts,(0));
|
|
});
|
|
|
|
cljs.core.MultiIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$iters], null);
|
|
});
|
|
|
|
cljs.core.MultiIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.MultiIterator.cljs$lang$ctorStr = "cljs.core/MultiIterator";
|
|
|
|
cljs.core.MultiIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/MultiIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/MultiIterator.
|
|
*/
|
|
cljs.core.__GT_MultiIterator = (function cljs$core$__GT_MultiIterator(iters){
|
|
return (new cljs.core.MultiIterator(iters));
|
|
});
|
|
|
|
cljs.core.chunkIteratorSeq = (function cljs$core$chunkIteratorSeq(iter){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
if(iter.hasNext()){
|
|
var arr = [];
|
|
var n = (0);
|
|
while(true){
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = iter.hasNext();
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (n < (32));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
(arr[n] = iter.next());
|
|
|
|
var G__1510 = (n + (1));
|
|
n = G__1510;
|
|
continue;
|
|
} else {
|
|
return cljs.core.chunk_cons(cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$3(arr,(0),n),(cljs.core.chunkIteratorSeq.cljs$core$IFn$_invoke$arity$1 ? cljs.core.chunkIteratorSeq.cljs$core$IFn$_invoke$arity$1(iter) : cljs.core.chunkIteratorSeq.call(null,iter)));
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.TransformerIterator = (function (buffer,_next,completed,xf,sourceIter,multi){
|
|
this.buffer = buffer;
|
|
this._next = _next;
|
|
this.completed = completed;
|
|
this.xf = xf;
|
|
this.sourceIter = sourceIter;
|
|
this.multi = multi;
|
|
});
|
|
cljs.core.TransformerIterator.prototype.step = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if((!((self__._next === cljs.core.NONE)))){
|
|
return true;
|
|
} else {
|
|
while(true){
|
|
if((self__._next === cljs.core.NONE)){
|
|
if(self__.buffer.isEmpty()){
|
|
if(self__.completed){
|
|
return false;
|
|
} else {
|
|
if(self__.sourceIter.hasNext()){
|
|
var iter = ((self__.multi)?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(self__.xf,cljs.core.cons(null,self__.sourceIter.next())):(function (){var G__1511 = null;
|
|
var G__1512 = self__.sourceIter.next();
|
|
return (self__.xf.cljs$core$IFn$_invoke$arity$2 ? self__.xf.cljs$core$IFn$_invoke$arity$2(G__1511,G__1512) : self__.xf.call(null,G__1511,G__1512));
|
|
})());
|
|
if(cljs.core.reduced_QMARK_(iter)){
|
|
(self__.xf.cljs$core$IFn$_invoke$arity$1 ? self__.xf.cljs$core$IFn$_invoke$arity$1(null) : self__.xf.call(null,null));
|
|
|
|
self__.completed = true;
|
|
} else {
|
|
}
|
|
|
|
continue;
|
|
} else {
|
|
(self__.xf.cljs$core$IFn$_invoke$arity$1 ? self__.xf.cljs$core$IFn$_invoke$arity$1(null) : self__.xf.call(null,null));
|
|
|
|
self__.completed = true;
|
|
|
|
continue;
|
|
}
|
|
}
|
|
} else {
|
|
self__._next = self__.buffer.remove();
|
|
|
|
continue;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.TransformerIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.step();
|
|
});
|
|
|
|
cljs.core.TransformerIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if(this$.hasNext()){
|
|
var ret = self__._next;
|
|
self__._next = cljs.core.NONE;
|
|
|
|
return ret;
|
|
} else {
|
|
throw (new Error("No such element"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransformerIterator.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.TransformerIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$buffer,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$completed,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$xf,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$sourceIter,cljs.core.cst$sym$multi], null);
|
|
});
|
|
|
|
cljs.core.TransformerIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.TransformerIterator.cljs$lang$ctorStr = "cljs.core/TransformerIterator";
|
|
|
|
cljs.core.TransformerIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TransformerIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TransformerIterator.
|
|
*/
|
|
cljs.core.__GT_TransformerIterator = (function cljs$core$__GT_TransformerIterator(buffer,_next,completed,xf,sourceIter,multi){
|
|
return (new cljs.core.TransformerIterator(buffer,_next,completed,xf,sourceIter,multi));
|
|
});
|
|
|
|
var G__1513_1516 = cljs.core.TransformerIterator.prototype;
|
|
var G__1514_1517 = cljs.core.ITER_SYMBOL;
|
|
var G__1515_1518 = ((function (G__1513_1516,G__1514_1517){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__1513_1516,G__1514_1517))
|
|
;
|
|
goog.object.set(G__1513_1516,G__1514_1517,G__1515_1518);
|
|
cljs.core.transformer_iterator = (function cljs$core$transformer_iterator(xform,sourceIter,multi){
|
|
var iterator = (new cljs.core.TransformerIterator(cljs.core.EMPTY,cljs.core.NONE,false,null,sourceIter,multi));
|
|
iterator.xf = (function (){var G__1519 = ((function (iterator){
|
|
return (function() {
|
|
var G__1520 = null;
|
|
var G__1520__0 = (function (){
|
|
return null;
|
|
});
|
|
var G__1520__1 = (function (acc){
|
|
return acc;
|
|
});
|
|
var G__1520__2 = (function (acc,o){
|
|
iterator.buffer = iterator.buffer.add(o);
|
|
|
|
return acc;
|
|
});
|
|
G__1520 = function(acc,o){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1520__0.call(this);
|
|
case 1:
|
|
return G__1520__1.call(this,acc);
|
|
case 2:
|
|
return G__1520__2.call(this,acc,o);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1520.cljs$core$IFn$_invoke$arity$0 = G__1520__0;
|
|
G__1520.cljs$core$IFn$_invoke$arity$1 = G__1520__1;
|
|
G__1520.cljs$core$IFn$_invoke$arity$2 = G__1520__2;
|
|
return G__1520;
|
|
})()
|
|
;})(iterator))
|
|
;
|
|
return (xform.cljs$core$IFn$_invoke$arity$1 ? xform.cljs$core$IFn$_invoke$arity$1(G__1519) : xform.call(null,G__1519));
|
|
})();
|
|
|
|
return iterator;
|
|
});
|
|
cljs.core.TransformerIterator.create = (function (xform,source){
|
|
return cljs.core.transformer_iterator(xform,source,false);
|
|
});
|
|
cljs.core.TransformerIterator.createMulti = (function (xform,sources){
|
|
return cljs.core.transformer_iterator(xform,(new cljs.core.MultiIterator(cljs.core.to_array(sources))),true);
|
|
});
|
|
/**
|
|
* Coerces coll to a (possibly empty) sequence, if it is not already
|
|
* one. Will not force a lazy seq. (sequence nil) yields (), When a
|
|
* transducer is supplied, returns a lazy sequence of applications of
|
|
* the transform to the items in coll(s), i.e. to the set of first
|
|
* items of each coll, followed by the set of second
|
|
* items in each coll, until any one of the colls is exhausted. Any
|
|
* remaining items in other colls are ignored. The transform should accept
|
|
* number-of-colls arguments
|
|
*/
|
|
cljs.core.sequence = (function cljs$core$sequence(var_args){
|
|
var G__1525 = arguments.length;
|
|
switch (G__1525) {
|
|
case 1:
|
|
return cljs.core.sequence.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.sequence.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1527 = arguments.length;
|
|
var i__4642__auto___1528 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1528 < len__4641__auto___1527)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1528]));
|
|
|
|
var G__1529 = (i__4642__auto___1528 + (1));
|
|
i__4642__auto___1528 = G__1529;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.sequence.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.sequence.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
if(cljs.core.seq_QMARK_(coll)){
|
|
return coll;
|
|
} else {
|
|
var or__4047__auto__ = cljs.core.seq(coll);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.sequence.cljs$core$IFn$_invoke$arity$2 = (function (xform,coll){
|
|
var or__4047__auto__ = cljs.core.chunkIteratorSeq(cljs.core.TransformerIterator.create(xform,cljs.core.iter(coll)));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.sequence.cljs$core$IFn$_invoke$arity$variadic = (function (xform,coll,colls){
|
|
var or__4047__auto__ = cljs.core.chunkIteratorSeq(cljs.core.TransformerIterator.createMulti(xform,cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.iter,cljs.core.cons(coll,colls))));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.sequence.cljs$lang$applyTo = (function (seq1522){
|
|
var G__1523 = cljs.core.first(seq1522);
|
|
var seq1522__$1 = cljs.core.next(seq1522);
|
|
var G__1524 = cljs.core.first(seq1522__$1);
|
|
var seq1522__$2 = cljs.core.next(seq1522__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1523,G__1524,seq1522__$2);
|
|
});
|
|
|
|
cljs.core.sequence.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns true if (pred x) is logical true for every x in coll, else
|
|
* false.
|
|
*/
|
|
cljs.core.every_QMARK_ = (function cljs$core$every_QMARK_(pred,coll){
|
|
while(true){
|
|
if((cljs.core.seq(coll) == null)){
|
|
return true;
|
|
} else {
|
|
if(cljs.core.truth_((function (){var G__1530 = cljs.core.first(coll);
|
|
return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1530) : pred.call(null,G__1530));
|
|
})())){
|
|
var G__1531 = pred;
|
|
var G__1532 = cljs.core.next(coll);
|
|
pred = G__1531;
|
|
coll = G__1532;
|
|
continue;
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns false if (pred x) is logical true for every x in
|
|
* coll, else true.
|
|
*/
|
|
cljs.core.not_every_QMARK_ = (function cljs$core$not_every_QMARK_(pred,coll){
|
|
return (!(cljs.core.every_QMARK_(pred,coll)));
|
|
});
|
|
/**
|
|
* Returns the first logical true value of (pred x) for any x in coll,
|
|
* else nil. One common idiom is to use a set as pred, for example
|
|
* this will return :fred if :fred is in the sequence, otherwise nil:
|
|
* (some #{:fred} coll)
|
|
*/
|
|
cljs.core.some = (function cljs$core$some(pred,coll){
|
|
while(true){
|
|
if(cljs.core.seq(coll)){
|
|
var or__4047__auto__ = (function (){var G__1534 = cljs.core.first(coll);
|
|
return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1534) : pred.call(null,G__1534));
|
|
})();
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var G__1535 = pred;
|
|
var G__1536 = cljs.core.next(coll);
|
|
pred = G__1535;
|
|
coll = G__1536;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns false if (pred x) is logical true for any x in coll,
|
|
* else true.
|
|
*/
|
|
cljs.core.not_any_QMARK_ = (function cljs$core$not_any_QMARK_(pred,coll){
|
|
return cljs.core.not(cljs.core.some(pred,coll));
|
|
});
|
|
/**
|
|
* Returns true if n is even, throws an exception if n is not an integer
|
|
*/
|
|
cljs.core.even_QMARK_ = (function cljs$core$even_QMARK_(n){
|
|
if(cljs.core.integer_QMARK_(n)){
|
|
return ((n & (1)) === (0));
|
|
} else {
|
|
throw (new Error(["Argument must be an integer: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)].join('')));
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if n is odd, throws an exception if n is not an integer
|
|
*/
|
|
cljs.core.odd_QMARK_ = (function cljs$core$odd_QMARK_(n){
|
|
return (!(cljs.core.even_QMARK_(n)));
|
|
});
|
|
/**
|
|
* Takes a fn f and returns a fn that takes the same arguments as f,
|
|
* has the same effects, if any, and returns the opposite truth value.
|
|
*/
|
|
cljs.core.complement = (function cljs$core$complement(f){
|
|
return (function() {
|
|
var G__1537 = null;
|
|
var G__1537__0 = (function (){
|
|
return cljs.core.not((f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)));
|
|
});
|
|
var G__1537__1 = (function (x){
|
|
return cljs.core.not((f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)));
|
|
});
|
|
var G__1537__2 = (function (x,y){
|
|
return cljs.core.not((f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)));
|
|
});
|
|
var G__1537__3 = (function() {
|
|
var G__1538__delegate = function (x,y,zs){
|
|
return cljs.core.not(cljs.core.apply.cljs$core$IFn$_invoke$arity$4(f,x,y,zs));
|
|
};
|
|
var G__1538 = function (x,y,var_args){
|
|
var zs = null;
|
|
if (arguments.length > 2) {
|
|
var G__1539__i = 0, G__1539__a = new Array(arguments.length - 2);
|
|
while (G__1539__i < G__1539__a.length) {G__1539__a[G__1539__i] = arguments[G__1539__i + 2]; ++G__1539__i;}
|
|
zs = new cljs.core.IndexedSeq(G__1539__a,0,null);
|
|
}
|
|
return G__1538__delegate.call(this,x,y,zs);};
|
|
G__1538.cljs$lang$maxFixedArity = 2;
|
|
G__1538.cljs$lang$applyTo = (function (arglist__1540){
|
|
var x = cljs.core.first(arglist__1540);
|
|
arglist__1540 = cljs.core.next(arglist__1540);
|
|
var y = cljs.core.first(arglist__1540);
|
|
var zs = cljs.core.rest(arglist__1540);
|
|
return G__1538__delegate(x,y,zs);
|
|
});
|
|
G__1538.cljs$core$IFn$_invoke$arity$variadic = G__1538__delegate;
|
|
return G__1538;
|
|
})()
|
|
;
|
|
G__1537 = function(x,y,var_args){
|
|
var zs = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1537__0.call(this);
|
|
case 1:
|
|
return G__1537__1.call(this,x);
|
|
case 2:
|
|
return G__1537__2.call(this,x,y);
|
|
default:
|
|
var G__1541 = null;
|
|
if (arguments.length > 2) {
|
|
var G__1542__i = 0, G__1542__a = new Array(arguments.length - 2);
|
|
while (G__1542__i < G__1542__a.length) {G__1542__a[G__1542__i] = arguments[G__1542__i + 2]; ++G__1542__i;}
|
|
G__1541 = new cljs.core.IndexedSeq(G__1542__a,0,null);
|
|
}
|
|
return G__1537__3.cljs$core$IFn$_invoke$arity$variadic(x,y, G__1541);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1537.cljs$lang$maxFixedArity = 2;
|
|
G__1537.cljs$lang$applyTo = G__1537__3.cljs$lang$applyTo;
|
|
G__1537.cljs$core$IFn$_invoke$arity$0 = G__1537__0;
|
|
G__1537.cljs$core$IFn$_invoke$arity$1 = G__1537__1;
|
|
G__1537.cljs$core$IFn$_invoke$arity$2 = G__1537__2;
|
|
G__1537.cljs$core$IFn$_invoke$arity$variadic = G__1537__3.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1537;
|
|
})()
|
|
});
|
|
/**
|
|
* Returns a function that takes any number of arguments and returns x.
|
|
*/
|
|
cljs.core.constantly = (function cljs$core$constantly(x){
|
|
return (function() {
|
|
var G__1543__delegate = function (args){
|
|
return x;
|
|
};
|
|
var G__1543 = function (var_args){
|
|
var args = null;
|
|
if (arguments.length > 0) {
|
|
var G__1544__i = 0, G__1544__a = new Array(arguments.length - 0);
|
|
while (G__1544__i < G__1544__a.length) {G__1544__a[G__1544__i] = arguments[G__1544__i + 0]; ++G__1544__i;}
|
|
args = new cljs.core.IndexedSeq(G__1544__a,0,null);
|
|
}
|
|
return G__1543__delegate.call(this,args);};
|
|
G__1543.cljs$lang$maxFixedArity = 0;
|
|
G__1543.cljs$lang$applyTo = (function (arglist__1545){
|
|
var args = cljs.core.seq(arglist__1545);
|
|
return G__1543__delegate(args);
|
|
});
|
|
G__1543.cljs$core$IFn$_invoke$arity$variadic = G__1543__delegate;
|
|
return G__1543;
|
|
})()
|
|
;
|
|
});
|
|
/**
|
|
* Takes a set of functions and returns a fn that is the composition
|
|
* of those fns. The returned fn takes a variable number of args,
|
|
* applies the rightmost of fns to the args, the next
|
|
* fn (right-to-left) to the result, etc.
|
|
*/
|
|
cljs.core.comp = (function cljs$core$comp(var_args){
|
|
var G__1551 = arguments.length;
|
|
switch (G__1551) {
|
|
case 0:
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1569 = arguments.length;
|
|
var i__4642__auto___1570 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1570 < len__4641__auto___1569)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1570]));
|
|
|
|
var G__1571 = (i__4642__auto___1570 + (1));
|
|
i__4642__auto___1570 = G__1571;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.comp.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.identity;
|
|
});
|
|
|
|
cljs.core.comp.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return f;
|
|
});
|
|
|
|
cljs.core.comp.cljs$core$IFn$_invoke$arity$2 = (function (f,g){
|
|
return (function() {
|
|
var G__1572 = null;
|
|
var G__1572__0 = (function (){
|
|
var G__1552 = (g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null));
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1552) : f.call(null,G__1552));
|
|
});
|
|
var G__1572__1 = (function (x){
|
|
var G__1553 = (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x));
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1553) : f.call(null,G__1553));
|
|
});
|
|
var G__1572__2 = (function (x,y){
|
|
var G__1554 = (g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y));
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1554) : f.call(null,G__1554));
|
|
});
|
|
var G__1572__3 = (function (x,y,z){
|
|
var G__1555 = (g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z));
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1555) : f.call(null,G__1555));
|
|
});
|
|
var G__1572__4 = (function() {
|
|
var G__1573__delegate = function (x,y,z,args){
|
|
var G__1556 = cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1556) : f.call(null,G__1556));
|
|
};
|
|
var G__1573 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1574__i = 0, G__1574__a = new Array(arguments.length - 3);
|
|
while (G__1574__i < G__1574__a.length) {G__1574__a[G__1574__i] = arguments[G__1574__i + 3]; ++G__1574__i;}
|
|
args = new cljs.core.IndexedSeq(G__1574__a,0,null);
|
|
}
|
|
return G__1573__delegate.call(this,x,y,z,args);};
|
|
G__1573.cljs$lang$maxFixedArity = 3;
|
|
G__1573.cljs$lang$applyTo = (function (arglist__1575){
|
|
var x = cljs.core.first(arglist__1575);
|
|
arglist__1575 = cljs.core.next(arglist__1575);
|
|
var y = cljs.core.first(arglist__1575);
|
|
arglist__1575 = cljs.core.next(arglist__1575);
|
|
var z = cljs.core.first(arglist__1575);
|
|
var args = cljs.core.rest(arglist__1575);
|
|
return G__1573__delegate(x,y,z,args);
|
|
});
|
|
G__1573.cljs$core$IFn$_invoke$arity$variadic = G__1573__delegate;
|
|
return G__1573;
|
|
})()
|
|
;
|
|
G__1572 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1572__0.call(this);
|
|
case 1:
|
|
return G__1572__1.call(this,x);
|
|
case 2:
|
|
return G__1572__2.call(this,x,y);
|
|
case 3:
|
|
return G__1572__3.call(this,x,y,z);
|
|
default:
|
|
var G__1576 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1577__i = 0, G__1577__a = new Array(arguments.length - 3);
|
|
while (G__1577__i < G__1577__a.length) {G__1577__a[G__1577__i] = arguments[G__1577__i + 3]; ++G__1577__i;}
|
|
G__1576 = new cljs.core.IndexedSeq(G__1577__a,0,null);
|
|
}
|
|
return G__1572__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1576);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1572.cljs$lang$maxFixedArity = 3;
|
|
G__1572.cljs$lang$applyTo = G__1572__4.cljs$lang$applyTo;
|
|
G__1572.cljs$core$IFn$_invoke$arity$0 = G__1572__0;
|
|
G__1572.cljs$core$IFn$_invoke$arity$1 = G__1572__1;
|
|
G__1572.cljs$core$IFn$_invoke$arity$2 = G__1572__2;
|
|
G__1572.cljs$core$IFn$_invoke$arity$3 = G__1572__3;
|
|
G__1572.cljs$core$IFn$_invoke$arity$variadic = G__1572__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1572;
|
|
})()
|
|
});
|
|
|
|
cljs.core.comp.cljs$core$IFn$_invoke$arity$3 = (function (f,g,h){
|
|
return (function() {
|
|
var G__1578 = null;
|
|
var G__1578__0 = (function (){
|
|
var G__1557 = (function (){var G__1558 = (h.cljs$core$IFn$_invoke$arity$0 ? h.cljs$core$IFn$_invoke$arity$0() : h.call(null));
|
|
return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1558) : g.call(null,G__1558));
|
|
})();
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1557) : f.call(null,G__1557));
|
|
});
|
|
var G__1578__1 = (function (x){
|
|
var G__1559 = (function (){var G__1560 = (h.cljs$core$IFn$_invoke$arity$1 ? h.cljs$core$IFn$_invoke$arity$1(x) : h.call(null,x));
|
|
return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1560) : g.call(null,G__1560));
|
|
})();
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1559) : f.call(null,G__1559));
|
|
});
|
|
var G__1578__2 = (function (x,y){
|
|
var G__1561 = (function (){var G__1562 = (h.cljs$core$IFn$_invoke$arity$2 ? h.cljs$core$IFn$_invoke$arity$2(x,y) : h.call(null,x,y));
|
|
return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1562) : g.call(null,G__1562));
|
|
})();
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1561) : f.call(null,G__1561));
|
|
});
|
|
var G__1578__3 = (function (x,y,z){
|
|
var G__1563 = (function (){var G__1564 = (h.cljs$core$IFn$_invoke$arity$3 ? h.cljs$core$IFn$_invoke$arity$3(x,y,z) : h.call(null,x,y,z));
|
|
return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1564) : g.call(null,G__1564));
|
|
})();
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1563) : f.call(null,G__1563));
|
|
});
|
|
var G__1578__4 = (function() {
|
|
var G__1579__delegate = function (x,y,z,args){
|
|
var G__1565 = (function (){var G__1566 = cljs.core.apply.cljs$core$IFn$_invoke$arity$5(h,x,y,z,args);
|
|
return (g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(G__1566) : g.call(null,G__1566));
|
|
})();
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1565) : f.call(null,G__1565));
|
|
};
|
|
var G__1579 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1580__i = 0, G__1580__a = new Array(arguments.length - 3);
|
|
while (G__1580__i < G__1580__a.length) {G__1580__a[G__1580__i] = arguments[G__1580__i + 3]; ++G__1580__i;}
|
|
args = new cljs.core.IndexedSeq(G__1580__a,0,null);
|
|
}
|
|
return G__1579__delegate.call(this,x,y,z,args);};
|
|
G__1579.cljs$lang$maxFixedArity = 3;
|
|
G__1579.cljs$lang$applyTo = (function (arglist__1581){
|
|
var x = cljs.core.first(arglist__1581);
|
|
arglist__1581 = cljs.core.next(arglist__1581);
|
|
var y = cljs.core.first(arglist__1581);
|
|
arglist__1581 = cljs.core.next(arglist__1581);
|
|
var z = cljs.core.first(arglist__1581);
|
|
var args = cljs.core.rest(arglist__1581);
|
|
return G__1579__delegate(x,y,z,args);
|
|
});
|
|
G__1579.cljs$core$IFn$_invoke$arity$variadic = G__1579__delegate;
|
|
return G__1579;
|
|
})()
|
|
;
|
|
G__1578 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1578__0.call(this);
|
|
case 1:
|
|
return G__1578__1.call(this,x);
|
|
case 2:
|
|
return G__1578__2.call(this,x,y);
|
|
case 3:
|
|
return G__1578__3.call(this,x,y,z);
|
|
default:
|
|
var G__1582 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1583__i = 0, G__1583__a = new Array(arguments.length - 3);
|
|
while (G__1583__i < G__1583__a.length) {G__1583__a[G__1583__i] = arguments[G__1583__i + 3]; ++G__1583__i;}
|
|
G__1582 = new cljs.core.IndexedSeq(G__1583__a,0,null);
|
|
}
|
|
return G__1578__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1582);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1578.cljs$lang$maxFixedArity = 3;
|
|
G__1578.cljs$lang$applyTo = G__1578__4.cljs$lang$applyTo;
|
|
G__1578.cljs$core$IFn$_invoke$arity$0 = G__1578__0;
|
|
G__1578.cljs$core$IFn$_invoke$arity$1 = G__1578__1;
|
|
G__1578.cljs$core$IFn$_invoke$arity$2 = G__1578__2;
|
|
G__1578.cljs$core$IFn$_invoke$arity$3 = G__1578__3;
|
|
G__1578.cljs$core$IFn$_invoke$arity$variadic = G__1578__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1578;
|
|
})()
|
|
});
|
|
|
|
cljs.core.comp.cljs$core$IFn$_invoke$arity$variadic = (function (f1,f2,f3,fs){
|
|
var fs__$1 = cljs.core.reverse(cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(f1,f2,f3,fs));
|
|
return ((function (fs__$1){
|
|
return (function() {
|
|
var G__1584__delegate = function (args){
|
|
var ret = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.first(fs__$1),args);
|
|
var fs__$2 = cljs.core.next(fs__$1);
|
|
while(true){
|
|
if(fs__$2){
|
|
var G__1585 = (function (){var fexpr__1567 = cljs.core.first(fs__$2);
|
|
return (fexpr__1567.cljs$core$IFn$_invoke$arity$1 ? fexpr__1567.cljs$core$IFn$_invoke$arity$1(ret) : fexpr__1567.call(null,ret));
|
|
})();
|
|
var G__1586 = cljs.core.next(fs__$2);
|
|
ret = G__1585;
|
|
fs__$2 = G__1586;
|
|
continue;
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
};
|
|
var G__1584 = function (var_args){
|
|
var args = null;
|
|
if (arguments.length > 0) {
|
|
var G__1587__i = 0, G__1587__a = new Array(arguments.length - 0);
|
|
while (G__1587__i < G__1587__a.length) {G__1587__a[G__1587__i] = arguments[G__1587__i + 0]; ++G__1587__i;}
|
|
args = new cljs.core.IndexedSeq(G__1587__a,0,null);
|
|
}
|
|
return G__1584__delegate.call(this,args);};
|
|
G__1584.cljs$lang$maxFixedArity = 0;
|
|
G__1584.cljs$lang$applyTo = (function (arglist__1588){
|
|
var args = cljs.core.seq(arglist__1588);
|
|
return G__1584__delegate(args);
|
|
});
|
|
G__1584.cljs$core$IFn$_invoke$arity$variadic = G__1584__delegate;
|
|
return G__1584;
|
|
})()
|
|
;
|
|
;})(fs__$1))
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.comp.cljs$lang$applyTo = (function (seq1547){
|
|
var G__1548 = cljs.core.first(seq1547);
|
|
var seq1547__$1 = cljs.core.next(seq1547);
|
|
var G__1549 = cljs.core.first(seq1547__$1);
|
|
var seq1547__$2 = cljs.core.next(seq1547__$1);
|
|
var G__1550 = cljs.core.first(seq1547__$2);
|
|
var seq1547__$3 = cljs.core.next(seq1547__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1548,G__1549,G__1550,seq1547__$3);
|
|
});
|
|
|
|
cljs.core.comp.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Takes a function f and fewer than the normal arguments to f, and
|
|
* returns a fn that takes a variable number of additional args. When
|
|
* called, the returned function calls f with args + additional args.
|
|
*/
|
|
cljs.core.partial = (function cljs$core$partial(var_args){
|
|
var G__1595 = arguments.length;
|
|
switch (G__1595) {
|
|
case 1:
|
|
return cljs.core.partial.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.partial.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.partial.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.partial.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1597 = arguments.length;
|
|
var i__4642__auto___1598 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1598 < len__4641__auto___1597)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1598]));
|
|
|
|
var G__1599 = (i__4642__auto___1598 + (1));
|
|
i__4642__auto___1598 = G__1599;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.partial.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.partial.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return f;
|
|
});
|
|
|
|
cljs.core.partial.cljs$core$IFn$_invoke$arity$2 = (function (f,arg1){
|
|
return (function() {
|
|
var G__1600 = null;
|
|
var G__1600__0 = (function (){
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(arg1) : f.call(null,arg1));
|
|
});
|
|
var G__1600__1 = (function (x){
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(arg1,x) : f.call(null,arg1,x));
|
|
});
|
|
var G__1600__2 = (function (x,y){
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,x,y) : f.call(null,arg1,x,y));
|
|
});
|
|
var G__1600__3 = (function (x,y,z){
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,x,y,z) : f.call(null,arg1,x,y,z));
|
|
});
|
|
var G__1600__4 = (function() {
|
|
var G__1601__delegate = function (x,y,z,args){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,x,y,z,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([args], 0));
|
|
};
|
|
var G__1601 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1602__i = 0, G__1602__a = new Array(arguments.length - 3);
|
|
while (G__1602__i < G__1602__a.length) {G__1602__a[G__1602__i] = arguments[G__1602__i + 3]; ++G__1602__i;}
|
|
args = new cljs.core.IndexedSeq(G__1602__a,0,null);
|
|
}
|
|
return G__1601__delegate.call(this,x,y,z,args);};
|
|
G__1601.cljs$lang$maxFixedArity = 3;
|
|
G__1601.cljs$lang$applyTo = (function (arglist__1603){
|
|
var x = cljs.core.first(arglist__1603);
|
|
arglist__1603 = cljs.core.next(arglist__1603);
|
|
var y = cljs.core.first(arglist__1603);
|
|
arglist__1603 = cljs.core.next(arglist__1603);
|
|
var z = cljs.core.first(arglist__1603);
|
|
var args = cljs.core.rest(arglist__1603);
|
|
return G__1601__delegate(x,y,z,args);
|
|
});
|
|
G__1601.cljs$core$IFn$_invoke$arity$variadic = G__1601__delegate;
|
|
return G__1601;
|
|
})()
|
|
;
|
|
G__1600 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1600__0.call(this);
|
|
case 1:
|
|
return G__1600__1.call(this,x);
|
|
case 2:
|
|
return G__1600__2.call(this,x,y);
|
|
case 3:
|
|
return G__1600__3.call(this,x,y,z);
|
|
default:
|
|
var G__1604 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1605__i = 0, G__1605__a = new Array(arguments.length - 3);
|
|
while (G__1605__i < G__1605__a.length) {G__1605__a[G__1605__i] = arguments[G__1605__i + 3]; ++G__1605__i;}
|
|
G__1604 = new cljs.core.IndexedSeq(G__1605__a,0,null);
|
|
}
|
|
return G__1600__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1604);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1600.cljs$lang$maxFixedArity = 3;
|
|
G__1600.cljs$lang$applyTo = G__1600__4.cljs$lang$applyTo;
|
|
G__1600.cljs$core$IFn$_invoke$arity$0 = G__1600__0;
|
|
G__1600.cljs$core$IFn$_invoke$arity$1 = G__1600__1;
|
|
G__1600.cljs$core$IFn$_invoke$arity$2 = G__1600__2;
|
|
G__1600.cljs$core$IFn$_invoke$arity$3 = G__1600__3;
|
|
G__1600.cljs$core$IFn$_invoke$arity$variadic = G__1600__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1600;
|
|
})()
|
|
});
|
|
|
|
cljs.core.partial.cljs$core$IFn$_invoke$arity$3 = (function (f,arg1,arg2){
|
|
return (function() {
|
|
var G__1606 = null;
|
|
var G__1606__0 = (function (){
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(arg1,arg2) : f.call(null,arg1,arg2));
|
|
});
|
|
var G__1606__1 = (function (x){
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,arg2,x) : f.call(null,arg1,arg2,x));
|
|
});
|
|
var G__1606__2 = (function (x,y){
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,arg2,x,y) : f.call(null,arg1,arg2,x,y));
|
|
});
|
|
var G__1606__3 = (function (x,y,z){
|
|
return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(arg1,arg2,x,y,z) : f.call(null,arg1,arg2,x,y,z));
|
|
});
|
|
var G__1606__4 = (function() {
|
|
var G__1607__delegate = function (x,y,z,args){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,arg2,x,y,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([z,args], 0));
|
|
};
|
|
var G__1607 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1608__i = 0, G__1608__a = new Array(arguments.length - 3);
|
|
while (G__1608__i < G__1608__a.length) {G__1608__a[G__1608__i] = arguments[G__1608__i + 3]; ++G__1608__i;}
|
|
args = new cljs.core.IndexedSeq(G__1608__a,0,null);
|
|
}
|
|
return G__1607__delegate.call(this,x,y,z,args);};
|
|
G__1607.cljs$lang$maxFixedArity = 3;
|
|
G__1607.cljs$lang$applyTo = (function (arglist__1609){
|
|
var x = cljs.core.first(arglist__1609);
|
|
arglist__1609 = cljs.core.next(arglist__1609);
|
|
var y = cljs.core.first(arglist__1609);
|
|
arglist__1609 = cljs.core.next(arglist__1609);
|
|
var z = cljs.core.first(arglist__1609);
|
|
var args = cljs.core.rest(arglist__1609);
|
|
return G__1607__delegate(x,y,z,args);
|
|
});
|
|
G__1607.cljs$core$IFn$_invoke$arity$variadic = G__1607__delegate;
|
|
return G__1607;
|
|
})()
|
|
;
|
|
G__1606 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1606__0.call(this);
|
|
case 1:
|
|
return G__1606__1.call(this,x);
|
|
case 2:
|
|
return G__1606__2.call(this,x,y);
|
|
case 3:
|
|
return G__1606__3.call(this,x,y,z);
|
|
default:
|
|
var G__1610 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1611__i = 0, G__1611__a = new Array(arguments.length - 3);
|
|
while (G__1611__i < G__1611__a.length) {G__1611__a[G__1611__i] = arguments[G__1611__i + 3]; ++G__1611__i;}
|
|
G__1610 = new cljs.core.IndexedSeq(G__1611__a,0,null);
|
|
}
|
|
return G__1606__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1610);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1606.cljs$lang$maxFixedArity = 3;
|
|
G__1606.cljs$lang$applyTo = G__1606__4.cljs$lang$applyTo;
|
|
G__1606.cljs$core$IFn$_invoke$arity$0 = G__1606__0;
|
|
G__1606.cljs$core$IFn$_invoke$arity$1 = G__1606__1;
|
|
G__1606.cljs$core$IFn$_invoke$arity$2 = G__1606__2;
|
|
G__1606.cljs$core$IFn$_invoke$arity$3 = G__1606__3;
|
|
G__1606.cljs$core$IFn$_invoke$arity$variadic = G__1606__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1606;
|
|
})()
|
|
});
|
|
|
|
cljs.core.partial.cljs$core$IFn$_invoke$arity$4 = (function (f,arg1,arg2,arg3){
|
|
return (function() {
|
|
var G__1612 = null;
|
|
var G__1612__0 = (function (){
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(arg1,arg2,arg3) : f.call(null,arg1,arg2,arg3));
|
|
});
|
|
var G__1612__1 = (function (x){
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(arg1,arg2,arg3,x) : f.call(null,arg1,arg2,arg3,x));
|
|
});
|
|
var G__1612__2 = (function (x,y){
|
|
return (f.cljs$core$IFn$_invoke$arity$5 ? f.cljs$core$IFn$_invoke$arity$5(arg1,arg2,arg3,x,y) : f.call(null,arg1,arg2,arg3,x,y));
|
|
});
|
|
var G__1612__3 = (function (x,y,z){
|
|
return (f.cljs$core$IFn$_invoke$arity$6 ? f.cljs$core$IFn$_invoke$arity$6(arg1,arg2,arg3,x,y,z) : f.call(null,arg1,arg2,arg3,x,y,z));
|
|
});
|
|
var G__1612__4 = (function() {
|
|
var G__1613__delegate = function (x,y,z,args){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,arg1,arg2,arg3,x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([y,z,args], 0));
|
|
};
|
|
var G__1613 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1614__i = 0, G__1614__a = new Array(arguments.length - 3);
|
|
while (G__1614__i < G__1614__a.length) {G__1614__a[G__1614__i] = arguments[G__1614__i + 3]; ++G__1614__i;}
|
|
args = new cljs.core.IndexedSeq(G__1614__a,0,null);
|
|
}
|
|
return G__1613__delegate.call(this,x,y,z,args);};
|
|
G__1613.cljs$lang$maxFixedArity = 3;
|
|
G__1613.cljs$lang$applyTo = (function (arglist__1615){
|
|
var x = cljs.core.first(arglist__1615);
|
|
arglist__1615 = cljs.core.next(arglist__1615);
|
|
var y = cljs.core.first(arglist__1615);
|
|
arglist__1615 = cljs.core.next(arglist__1615);
|
|
var z = cljs.core.first(arglist__1615);
|
|
var args = cljs.core.rest(arglist__1615);
|
|
return G__1613__delegate(x,y,z,args);
|
|
});
|
|
G__1613.cljs$core$IFn$_invoke$arity$variadic = G__1613__delegate;
|
|
return G__1613;
|
|
})()
|
|
;
|
|
G__1612 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1612__0.call(this);
|
|
case 1:
|
|
return G__1612__1.call(this,x);
|
|
case 2:
|
|
return G__1612__2.call(this,x,y);
|
|
case 3:
|
|
return G__1612__3.call(this,x,y,z);
|
|
default:
|
|
var G__1616 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1617__i = 0, G__1617__a = new Array(arguments.length - 3);
|
|
while (G__1617__i < G__1617__a.length) {G__1617__a[G__1617__i] = arguments[G__1617__i + 3]; ++G__1617__i;}
|
|
G__1616 = new cljs.core.IndexedSeq(G__1617__a,0,null);
|
|
}
|
|
return G__1612__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1616);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1612.cljs$lang$maxFixedArity = 3;
|
|
G__1612.cljs$lang$applyTo = G__1612__4.cljs$lang$applyTo;
|
|
G__1612.cljs$core$IFn$_invoke$arity$0 = G__1612__0;
|
|
G__1612.cljs$core$IFn$_invoke$arity$1 = G__1612__1;
|
|
G__1612.cljs$core$IFn$_invoke$arity$2 = G__1612__2;
|
|
G__1612.cljs$core$IFn$_invoke$arity$3 = G__1612__3;
|
|
G__1612.cljs$core$IFn$_invoke$arity$variadic = G__1612__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1612;
|
|
})()
|
|
});
|
|
|
|
cljs.core.partial.cljs$core$IFn$_invoke$arity$variadic = (function (f,arg1,arg2,arg3,more){
|
|
return (function() {
|
|
var G__1618__delegate = function (args){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,arg1,arg2,arg3,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(more,args));
|
|
};
|
|
var G__1618 = function (var_args){
|
|
var args = null;
|
|
if (arguments.length > 0) {
|
|
var G__1619__i = 0, G__1619__a = new Array(arguments.length - 0);
|
|
while (G__1619__i < G__1619__a.length) {G__1619__a[G__1619__i] = arguments[G__1619__i + 0]; ++G__1619__i;}
|
|
args = new cljs.core.IndexedSeq(G__1619__a,0,null);
|
|
}
|
|
return G__1618__delegate.call(this,args);};
|
|
G__1618.cljs$lang$maxFixedArity = 0;
|
|
G__1618.cljs$lang$applyTo = (function (arglist__1620){
|
|
var args = cljs.core.seq(arglist__1620);
|
|
return G__1618__delegate(args);
|
|
});
|
|
G__1618.cljs$core$IFn$_invoke$arity$variadic = G__1618__delegate;
|
|
return G__1618;
|
|
})()
|
|
;
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.partial.cljs$lang$applyTo = (function (seq1590){
|
|
var G__1591 = cljs.core.first(seq1590);
|
|
var seq1590__$1 = cljs.core.next(seq1590);
|
|
var G__1592 = cljs.core.first(seq1590__$1);
|
|
var seq1590__$2 = cljs.core.next(seq1590__$1);
|
|
var G__1593 = cljs.core.first(seq1590__$2);
|
|
var seq1590__$3 = cljs.core.next(seq1590__$2);
|
|
var G__1594 = cljs.core.first(seq1590__$3);
|
|
var seq1590__$4 = cljs.core.next(seq1590__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1591,G__1592,G__1593,G__1594,seq1590__$4);
|
|
});
|
|
|
|
cljs.core.partial.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Takes a function f, and returns a function that calls f, replacing
|
|
* a nil first argument to f with the supplied value x. Higher arity
|
|
* versions can replace arguments in the second and third
|
|
* positions (y, z). Note that the function f can take any number of
|
|
* arguments, not just the one(s) being nil-patched.
|
|
*/
|
|
cljs.core.fnil = (function cljs$core$fnil(var_args){
|
|
var G__1622 = arguments.length;
|
|
switch (G__1622) {
|
|
case 2:
|
|
return cljs.core.fnil.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.fnil.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.fnil.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.fnil.cljs$core$IFn$_invoke$arity$2 = (function (f,x){
|
|
return (function() {
|
|
var G__1640 = null;
|
|
var G__1640__1 = (function (a){
|
|
var G__1623 = (((a == null))?x:a);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1623) : f.call(null,G__1623));
|
|
});
|
|
var G__1640__2 = (function (a,b){
|
|
var G__1624 = (((a == null))?x:a);
|
|
var G__1625 = b;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1624,G__1625) : f.call(null,G__1624,G__1625));
|
|
});
|
|
var G__1640__3 = (function (a,b,c){
|
|
var G__1626 = (((a == null))?x:a);
|
|
var G__1627 = b;
|
|
var G__1628 = c;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1626,G__1627,G__1628) : f.call(null,G__1626,G__1627,G__1628));
|
|
});
|
|
var G__1640__4 = (function() {
|
|
var G__1641__delegate = function (a,b,c,ds){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),b,c,ds);
|
|
};
|
|
var G__1641 = function (a,b,c,var_args){
|
|
var ds = null;
|
|
if (arguments.length > 3) {
|
|
var G__1642__i = 0, G__1642__a = new Array(arguments.length - 3);
|
|
while (G__1642__i < G__1642__a.length) {G__1642__a[G__1642__i] = arguments[G__1642__i + 3]; ++G__1642__i;}
|
|
ds = new cljs.core.IndexedSeq(G__1642__a,0,null);
|
|
}
|
|
return G__1641__delegate.call(this,a,b,c,ds);};
|
|
G__1641.cljs$lang$maxFixedArity = 3;
|
|
G__1641.cljs$lang$applyTo = (function (arglist__1643){
|
|
var a = cljs.core.first(arglist__1643);
|
|
arglist__1643 = cljs.core.next(arglist__1643);
|
|
var b = cljs.core.first(arglist__1643);
|
|
arglist__1643 = cljs.core.next(arglist__1643);
|
|
var c = cljs.core.first(arglist__1643);
|
|
var ds = cljs.core.rest(arglist__1643);
|
|
return G__1641__delegate(a,b,c,ds);
|
|
});
|
|
G__1641.cljs$core$IFn$_invoke$arity$variadic = G__1641__delegate;
|
|
return G__1641;
|
|
})()
|
|
;
|
|
G__1640 = function(a,b,c,var_args){
|
|
var ds = var_args;
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1640__1.call(this,a);
|
|
case 2:
|
|
return G__1640__2.call(this,a,b);
|
|
case 3:
|
|
return G__1640__3.call(this,a,b,c);
|
|
default:
|
|
var G__1644 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1645__i = 0, G__1645__a = new Array(arguments.length - 3);
|
|
while (G__1645__i < G__1645__a.length) {G__1645__a[G__1645__i] = arguments[G__1645__i + 3]; ++G__1645__i;}
|
|
G__1644 = new cljs.core.IndexedSeq(G__1645__a,0,null);
|
|
}
|
|
return G__1640__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1644);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1640.cljs$lang$maxFixedArity = 3;
|
|
G__1640.cljs$lang$applyTo = G__1640__4.cljs$lang$applyTo;
|
|
G__1640.cljs$core$IFn$_invoke$arity$1 = G__1640__1;
|
|
G__1640.cljs$core$IFn$_invoke$arity$2 = G__1640__2;
|
|
G__1640.cljs$core$IFn$_invoke$arity$3 = G__1640__3;
|
|
G__1640.cljs$core$IFn$_invoke$arity$variadic = G__1640__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1640;
|
|
})()
|
|
});
|
|
|
|
cljs.core.fnil.cljs$core$IFn$_invoke$arity$3 = (function (f,x,y){
|
|
return (function() {
|
|
var G__1646 = null;
|
|
var G__1646__2 = (function (a,b){
|
|
var G__1629 = (((a == null))?x:a);
|
|
var G__1630 = (((b == null))?y:b);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1629,G__1630) : f.call(null,G__1629,G__1630));
|
|
});
|
|
var G__1646__3 = (function (a,b,c){
|
|
var G__1631 = (((a == null))?x:a);
|
|
var G__1632 = (((b == null))?y:b);
|
|
var G__1633 = c;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1631,G__1632,G__1633) : f.call(null,G__1631,G__1632,G__1633));
|
|
});
|
|
var G__1646__4 = (function() {
|
|
var G__1647__delegate = function (a,b,c,ds){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),(((b == null))?y:b),c,ds);
|
|
};
|
|
var G__1647 = function (a,b,c,var_args){
|
|
var ds = null;
|
|
if (arguments.length > 3) {
|
|
var G__1648__i = 0, G__1648__a = new Array(arguments.length - 3);
|
|
while (G__1648__i < G__1648__a.length) {G__1648__a[G__1648__i] = arguments[G__1648__i + 3]; ++G__1648__i;}
|
|
ds = new cljs.core.IndexedSeq(G__1648__a,0,null);
|
|
}
|
|
return G__1647__delegate.call(this,a,b,c,ds);};
|
|
G__1647.cljs$lang$maxFixedArity = 3;
|
|
G__1647.cljs$lang$applyTo = (function (arglist__1649){
|
|
var a = cljs.core.first(arglist__1649);
|
|
arglist__1649 = cljs.core.next(arglist__1649);
|
|
var b = cljs.core.first(arglist__1649);
|
|
arglist__1649 = cljs.core.next(arglist__1649);
|
|
var c = cljs.core.first(arglist__1649);
|
|
var ds = cljs.core.rest(arglist__1649);
|
|
return G__1647__delegate(a,b,c,ds);
|
|
});
|
|
G__1647.cljs$core$IFn$_invoke$arity$variadic = G__1647__delegate;
|
|
return G__1647;
|
|
})()
|
|
;
|
|
G__1646 = function(a,b,c,var_args){
|
|
var ds = var_args;
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__1646__2.call(this,a,b);
|
|
case 3:
|
|
return G__1646__3.call(this,a,b,c);
|
|
default:
|
|
var G__1650 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1651__i = 0, G__1651__a = new Array(arguments.length - 3);
|
|
while (G__1651__i < G__1651__a.length) {G__1651__a[G__1651__i] = arguments[G__1651__i + 3]; ++G__1651__i;}
|
|
G__1650 = new cljs.core.IndexedSeq(G__1651__a,0,null);
|
|
}
|
|
return G__1646__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1650);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1646.cljs$lang$maxFixedArity = 3;
|
|
G__1646.cljs$lang$applyTo = G__1646__4.cljs$lang$applyTo;
|
|
G__1646.cljs$core$IFn$_invoke$arity$2 = G__1646__2;
|
|
G__1646.cljs$core$IFn$_invoke$arity$3 = G__1646__3;
|
|
G__1646.cljs$core$IFn$_invoke$arity$variadic = G__1646__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1646;
|
|
})()
|
|
});
|
|
|
|
cljs.core.fnil.cljs$core$IFn$_invoke$arity$4 = (function (f,x,y,z){
|
|
return (function() {
|
|
var G__1652 = null;
|
|
var G__1652__2 = (function (a,b){
|
|
var G__1634 = (((a == null))?x:a);
|
|
var G__1635 = (((b == null))?y:b);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1634,G__1635) : f.call(null,G__1634,G__1635));
|
|
});
|
|
var G__1652__3 = (function (a,b,c){
|
|
var G__1636 = (((a == null))?x:a);
|
|
var G__1637 = (((b == null))?y:b);
|
|
var G__1638 = (((c == null))?z:c);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1636,G__1637,G__1638) : f.call(null,G__1636,G__1637,G__1638));
|
|
});
|
|
var G__1652__4 = (function() {
|
|
var G__1653__delegate = function (a,b,c,ds){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,(((a == null))?x:a),(((b == null))?y:b),(((c == null))?z:c),ds);
|
|
};
|
|
var G__1653 = function (a,b,c,var_args){
|
|
var ds = null;
|
|
if (arguments.length > 3) {
|
|
var G__1654__i = 0, G__1654__a = new Array(arguments.length - 3);
|
|
while (G__1654__i < G__1654__a.length) {G__1654__a[G__1654__i] = arguments[G__1654__i + 3]; ++G__1654__i;}
|
|
ds = new cljs.core.IndexedSeq(G__1654__a,0,null);
|
|
}
|
|
return G__1653__delegate.call(this,a,b,c,ds);};
|
|
G__1653.cljs$lang$maxFixedArity = 3;
|
|
G__1653.cljs$lang$applyTo = (function (arglist__1655){
|
|
var a = cljs.core.first(arglist__1655);
|
|
arglist__1655 = cljs.core.next(arglist__1655);
|
|
var b = cljs.core.first(arglist__1655);
|
|
arglist__1655 = cljs.core.next(arglist__1655);
|
|
var c = cljs.core.first(arglist__1655);
|
|
var ds = cljs.core.rest(arglist__1655);
|
|
return G__1653__delegate(a,b,c,ds);
|
|
});
|
|
G__1653.cljs$core$IFn$_invoke$arity$variadic = G__1653__delegate;
|
|
return G__1653;
|
|
})()
|
|
;
|
|
G__1652 = function(a,b,c,var_args){
|
|
var ds = var_args;
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__1652__2.call(this,a,b);
|
|
case 3:
|
|
return G__1652__3.call(this,a,b,c);
|
|
default:
|
|
var G__1656 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1657__i = 0, G__1657__a = new Array(arguments.length - 3);
|
|
while (G__1657__i < G__1657__a.length) {G__1657__a[G__1657__i] = arguments[G__1657__i + 3]; ++G__1657__i;}
|
|
G__1656 = new cljs.core.IndexedSeq(G__1657__a,0,null);
|
|
}
|
|
return G__1652__4.cljs$core$IFn$_invoke$arity$variadic(a,b,c, G__1656);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1652.cljs$lang$maxFixedArity = 3;
|
|
G__1652.cljs$lang$applyTo = G__1652__4.cljs$lang$applyTo;
|
|
G__1652.cljs$core$IFn$_invoke$arity$2 = G__1652__2;
|
|
G__1652.cljs$core$IFn$_invoke$arity$3 = G__1652__3;
|
|
G__1652.cljs$core$IFn$_invoke$arity$variadic = G__1652__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1652;
|
|
})()
|
|
});
|
|
|
|
cljs.core.fnil.cljs$lang$maxFixedArity = 4;
|
|
|
|
/**
|
|
* Returns a lazy sequence consisting of the result of applying f to 0
|
|
* and the first item of coll, followed by applying f to 1 and the second
|
|
* item in coll, etc, until coll is exhausted. Thus function f should
|
|
* accept 2 arguments, index and item. Returns a stateful transducer when
|
|
* no collection is provided.
|
|
*/
|
|
cljs.core.map_indexed = (function cljs$core$map_indexed(var_args){
|
|
var G__1659 = arguments.length;
|
|
switch (G__1659) {
|
|
case 1:
|
|
return cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function (rf){
|
|
var i = cljs.core.volatile_BANG_((-1));
|
|
return ((function (i){
|
|
return (function() {
|
|
var G__1673 = null;
|
|
var G__1673__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1673__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1673__2 = (function (result,input){
|
|
var G__1660 = result;
|
|
var G__1661 = (function (){var G__1662 = i.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,(i.cljs$core$IDeref$_deref$arity$1(null) + (1)));
|
|
var G__1663 = input;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1662,G__1663) : f.call(null,G__1662,G__1663));
|
|
})();
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1660,G__1661) : rf.call(null,G__1660,G__1661));
|
|
});
|
|
G__1673 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1673__0.call(this);
|
|
case 1:
|
|
return G__1673__1.call(this,result);
|
|
case 2:
|
|
return G__1673__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1673.cljs$core$IFn$_invoke$arity$0 = G__1673__0;
|
|
G__1673.cljs$core$IFn$_invoke$arity$1 = G__1673__1;
|
|
G__1673.cljs$core$IFn$_invoke$arity$2 = G__1673__2;
|
|
return G__1673;
|
|
})()
|
|
;})(i))
|
|
});
|
|
});
|
|
|
|
cljs.core.map_indexed.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
var mapi = (function cljs$core$mapi(idx,coll__$1){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll__$1);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
var c = cljs.core.chunk_first(s);
|
|
var size = cljs.core.count(c);
|
|
var b = cljs.core.chunk_buffer(size);
|
|
var n__4518__auto___1674 = size;
|
|
var i_1675 = (0);
|
|
while(true){
|
|
if((i_1675 < n__4518__auto___1674)){
|
|
cljs.core.chunk_append(b,(function (){var G__1668 = (idx + i_1675);
|
|
var G__1669 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1675);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1668,G__1669) : f.call(null,G__1668,G__1669));
|
|
})());
|
|
|
|
var G__1676 = (i_1675 + (1));
|
|
i_1675 = G__1676;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.chunk_cons(cljs.core.chunk(b),cljs$core$mapi((idx + size),cljs.core.chunk_rest(s)));
|
|
} else {
|
|
return cljs.core.cons((function (){var G__1670 = idx;
|
|
var G__1671 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1670,G__1671) : f.call(null,G__1670,G__1671));
|
|
})(),cljs$core$mapi((idx + (1)),cljs.core.rest(s)));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
return mapi((0),coll);
|
|
});
|
|
|
|
cljs.core.map_indexed.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence of the non-nil results of (f item). Note,
|
|
* this means false return values will be included. f must be free of
|
|
* side-effects. Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.keep = (function cljs$core$keep(var_args){
|
|
var G__1678 = arguments.length;
|
|
switch (G__1678) {
|
|
case 1:
|
|
return cljs.core.keep.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.keep.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.keep.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function (rf){
|
|
return (function() {
|
|
var G__1682 = null;
|
|
var G__1682__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1682__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1682__2 = (function (result,input){
|
|
var v = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
|
|
if((v == null)){
|
|
return result;
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
|
|
}
|
|
});
|
|
G__1682 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1682__0.call(this);
|
|
case 1:
|
|
return G__1682__1.call(this,result);
|
|
case 2:
|
|
return G__1682__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1682.cljs$core$IFn$_invoke$arity$0 = G__1682__0;
|
|
G__1682.cljs$core$IFn$_invoke$arity$1 = G__1682__1;
|
|
G__1682.cljs$core$IFn$_invoke$arity$2 = G__1682__2;
|
|
return G__1682;
|
|
})()
|
|
});
|
|
});
|
|
|
|
cljs.core.keep.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
var c = cljs.core.chunk_first(s);
|
|
var size = cljs.core.count(c);
|
|
var b = cljs.core.chunk_buffer(size);
|
|
var n__4518__auto___1683 = size;
|
|
var i_1684 = (0);
|
|
while(true){
|
|
if((i_1684 < n__4518__auto___1683)){
|
|
var x_1685 = (function (){var G__1679 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1684);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1679) : f.call(null,G__1679));
|
|
})();
|
|
if((x_1685 == null)){
|
|
} else {
|
|
cljs.core.chunk_append(b,x_1685);
|
|
}
|
|
|
|
var G__1686 = (i_1684 + (1));
|
|
i_1684 = G__1686;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.chunk_rest(s)));
|
|
} else {
|
|
var x = (function (){var G__1680 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1680) : f.call(null,G__1680));
|
|
})();
|
|
if((x == null)){
|
|
return cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s));
|
|
} else {
|
|
return cljs.core.cons(x,cljs.core.keep.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s)));
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.keep.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IWatchable}
|
|
* @implements {cljs.core.IAtom}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IDeref}
|
|
*/
|
|
cljs.core.Atom = (function (state,meta,validator,watches){
|
|
this.state = state;
|
|
this.meta = meta;
|
|
this.validator = validator;
|
|
this.watches = watches;
|
|
this.cljs$lang$protocol_mask$partition1$ = 16386;
|
|
this.cljs$lang$protocol_mask$partition0$ = 6455296;
|
|
});
|
|
cljs.core.Atom.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
return (o__$1 === other);
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.state;
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IMeta$_meta$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IWatchable$_notify_watches$arity$3 = (function (this$,oldval,newval){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
var seq__1687 = cljs.core.seq(self__.watches);
|
|
var chunk__1688 = null;
|
|
var count__1689 = (0);
|
|
var i__1690 = (0);
|
|
while(true){
|
|
if((i__1690 < count__1689)){
|
|
var vec__1691 = chunk__1688.cljs$core$IIndexed$_nth$arity$2(null,i__1690);
|
|
var key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1691,(0),null);
|
|
var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1691,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(key,this$__$1,oldval,newval) : f.call(null,key,this$__$1,oldval,newval));
|
|
|
|
|
|
var G__1697 = seq__1687;
|
|
var G__1698 = chunk__1688;
|
|
var G__1699 = count__1689;
|
|
var G__1700 = (i__1690 + (1));
|
|
seq__1687 = G__1697;
|
|
chunk__1688 = G__1698;
|
|
count__1689 = G__1699;
|
|
i__1690 = G__1700;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__1687);
|
|
if(temp__5457__auto__){
|
|
var seq__1687__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__1687__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__1687__$1);
|
|
var G__1701 = cljs.core.chunk_rest(seq__1687__$1);
|
|
var G__1702 = c__4461__auto__;
|
|
var G__1703 = cljs.core.count(c__4461__auto__);
|
|
var G__1704 = (0);
|
|
seq__1687 = G__1701;
|
|
chunk__1688 = G__1702;
|
|
count__1689 = G__1703;
|
|
i__1690 = G__1704;
|
|
continue;
|
|
} else {
|
|
var vec__1694 = cljs.core.first(seq__1687__$1);
|
|
var key = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1694,(0),null);
|
|
var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__1694,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(key,this$__$1,oldval,newval) : f.call(null,key,this$__$1,oldval,newval));
|
|
|
|
|
|
var G__1705 = cljs.core.next(seq__1687__$1);
|
|
var G__1706 = null;
|
|
var G__1707 = (0);
|
|
var G__1708 = (0);
|
|
seq__1687 = G__1705;
|
|
chunk__1688 = G__1706;
|
|
count__1689 = G__1707;
|
|
i__1690 = G__1708;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IWatchable$_add_watch$arity$3 = (function (this$,key,f){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
this$__$1.watches = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.watches,key,f);
|
|
|
|
return this$__$1;
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IWatchable$_remove_watch$arity$2 = (function (this$,key){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1.watches = cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.watches,key);
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return goog.getUid(this$__$1);
|
|
});
|
|
|
|
cljs.core.Atom.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$state,cljs.core.cst$sym$meta,cljs.core.cst$sym$validator,cljs.core.cst$sym$watches], null);
|
|
});
|
|
|
|
cljs.core.Atom.cljs$lang$type = true;
|
|
|
|
cljs.core.Atom.cljs$lang$ctorStr = "cljs.core/Atom";
|
|
|
|
cljs.core.Atom.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Atom");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Atom.
|
|
*/
|
|
cljs.core.__GT_Atom = (function cljs$core$__GT_Atom(state,meta,validator,watches){
|
|
return (new cljs.core.Atom(state,meta,validator,watches));
|
|
});
|
|
|
|
/**
|
|
* Creates and returns an Atom with an initial value of x and zero or
|
|
* more options (in any order):
|
|
*
|
|
* :meta metadata-map
|
|
*
|
|
* :validator validate-fn
|
|
*
|
|
* If metadata-map is supplied, it will be come the metadata on the
|
|
* atom. validate-fn must be nil or a side-effect-free fn of one
|
|
* argument, which will be passed the intended new state on any state
|
|
* change. If the new state is unacceptable, the validate-fn should
|
|
* return false or throw an Error. If either of these error conditions
|
|
* occur, then the value of the atom will not change.
|
|
*/
|
|
cljs.core.atom = (function cljs$core$atom(var_args){
|
|
var G__1712 = arguments.length;
|
|
switch (G__1712) {
|
|
case 1:
|
|
return cljs.core.atom.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1717 = arguments.length;
|
|
var i__4642__auto___1718 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1718 < len__4641__auto___1717)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1718]));
|
|
|
|
var G__1719 = (i__4642__auto___1718 + (1));
|
|
i__4642__auto___1718 = G__1719;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((1)),(0),null));
|
|
return cljs.core.atom.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.atom.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (new cljs.core.Atom(x,null,null,null));
|
|
});
|
|
|
|
cljs.core.atom.cljs$core$IFn$_invoke$arity$variadic = (function (x,p__1713){
|
|
var map__1714 = p__1713;
|
|
var map__1714__$1 = (((((!((map__1714 == null))))?(((((map__1714.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__1714.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__1714):map__1714);
|
|
var meta = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1714__$1,cljs.core.cst$kw$meta);
|
|
var validator = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__1714__$1,cljs.core.cst$kw$validator);
|
|
return (new cljs.core.Atom(x,meta,validator,null));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.atom.cljs$lang$applyTo = (function (seq1710){
|
|
var G__1711 = cljs.core.first(seq1710);
|
|
var seq1710__$1 = cljs.core.next(seq1710);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1711,seq1710__$1);
|
|
});
|
|
|
|
cljs.core.atom.cljs$lang$maxFixedArity = (1);
|
|
|
|
/**
|
|
* Sets the value of atom to newval without regard for the
|
|
* current value. Returns new-value.
|
|
*/
|
|
cljs.core.reset_BANG_ = (function cljs$core$reset_BANG_(a,new_value){
|
|
if((a instanceof cljs.core.Atom)){
|
|
var validate = a.validator;
|
|
if((validate == null)){
|
|
} else {
|
|
if(cljs.core.truth_((validate.cljs$core$IFn$_invoke$arity$1 ? validate.cljs$core$IFn$_invoke$arity$1(new_value) : validate.call(null,new_value)))){
|
|
} else {
|
|
throw (new Error("Validator rejected reference state"));
|
|
}
|
|
}
|
|
|
|
var old_value = a.state;
|
|
a.state = new_value;
|
|
|
|
if((a.watches == null)){
|
|
} else {
|
|
cljs.core._notify_watches(a,old_value,new_value);
|
|
}
|
|
|
|
return new_value;
|
|
} else {
|
|
return cljs.core._reset_BANG_(a,new_value);
|
|
}
|
|
});
|
|
/**
|
|
* Sets the value of atom to newval. Returns [old new], the value of the
|
|
* atom before and after the reset.
|
|
*/
|
|
cljs.core.reset_vals_BANG_ = (function cljs$core$reset_vals_BANG_(a,new_value){
|
|
var validate = a.validator;
|
|
if((validate == null)){
|
|
} else {
|
|
if(cljs.core.truth_((validate.cljs$core$IFn$_invoke$arity$1 ? validate.cljs$core$IFn$_invoke$arity$1(new_value) : validate.call(null,new_value)))){
|
|
} else {
|
|
throw (new Error("Validator rejected reference state"));
|
|
}
|
|
}
|
|
|
|
var old_value = a.state;
|
|
a.state = new_value;
|
|
|
|
if((a.watches == null)){
|
|
} else {
|
|
cljs.core._notify_watches(a,old_value,new_value);
|
|
}
|
|
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [old_value,new_value], null);
|
|
});
|
|
/**
|
|
* Atomically swaps the value of atom to be:
|
|
* (apply f current-value-of-atom args). Note that f may be called
|
|
* multiple times, and thus should be free of side effects. Returns
|
|
* the value that was swapped in.
|
|
*/
|
|
cljs.core.swap_BANG_ = (function cljs$core$swap_BANG_(var_args){
|
|
var G__1726 = arguments.length;
|
|
switch (G__1726) {
|
|
case 2:
|
|
return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1734 = arguments.length;
|
|
var i__4642__auto___1735 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1735 < len__4641__auto___1734)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1735]));
|
|
|
|
var G__1736 = (i__4642__auto___1735 + (1));
|
|
i__4642__auto___1735 = G__1736;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (a,f){
|
|
if((a instanceof cljs.core.Atom)){
|
|
return cljs.core.reset_BANG_(a,(function (){var G__1727 = a.state;
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1727) : f.call(null,G__1727));
|
|
})());
|
|
} else {
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$2(a,f);
|
|
}
|
|
});
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (a,f,x){
|
|
if((a instanceof cljs.core.Atom)){
|
|
return cljs.core.reset_BANG_(a,(function (){var G__1728 = a.state;
|
|
var G__1729 = x;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1728,G__1729) : f.call(null,G__1728,G__1729));
|
|
})());
|
|
} else {
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$3(a,f,x);
|
|
}
|
|
});
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (a,f,x,y){
|
|
if((a instanceof cljs.core.Atom)){
|
|
return cljs.core.reset_BANG_(a,(function (){var G__1730 = a.state;
|
|
var G__1731 = x;
|
|
var G__1732 = y;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1730,G__1731,G__1732) : f.call(null,G__1730,G__1731,G__1732));
|
|
})());
|
|
} else {
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$4(a,f,x,y);
|
|
}
|
|
});
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (a,f,x,y,more){
|
|
if((a instanceof cljs.core.Atom)){
|
|
return cljs.core.reset_BANG_(a,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,a.state,x,y,more));
|
|
} else {
|
|
return cljs.core._swap_BANG_.cljs$core$IFn$_invoke$arity$5(a,f,x,y,more);
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.swap_BANG_.cljs$lang$applyTo = (function (seq1721){
|
|
var G__1722 = cljs.core.first(seq1721);
|
|
var seq1721__$1 = cljs.core.next(seq1721);
|
|
var G__1723 = cljs.core.first(seq1721__$1);
|
|
var seq1721__$2 = cljs.core.next(seq1721__$1);
|
|
var G__1724 = cljs.core.first(seq1721__$2);
|
|
var seq1721__$3 = cljs.core.next(seq1721__$2);
|
|
var G__1725 = cljs.core.first(seq1721__$3);
|
|
var seq1721__$4 = cljs.core.next(seq1721__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1722,G__1723,G__1724,G__1725,seq1721__$4);
|
|
});
|
|
|
|
cljs.core.swap_BANG_.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Atomically swaps the value of atom to be:
|
|
* (apply f current-value-of-atom args). Note that f may be called
|
|
* multiple times, and thus should be free of side effects.
|
|
* Returns [old new], the value of the atom before and after the swap.
|
|
*/
|
|
cljs.core.swap_vals_BANG_ = (function cljs$core$swap_vals_BANG_(var_args){
|
|
var G__1743 = arguments.length;
|
|
switch (G__1743) {
|
|
case 2:
|
|
return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1751 = arguments.length;
|
|
var i__4642__auto___1752 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1752 < len__4641__auto___1751)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1752]));
|
|
|
|
var G__1753 = (i__4642__auto___1752 + (1));
|
|
i__4642__auto___1752 = G__1753;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$2 = (function (a,f){
|
|
return cljs.core.reset_vals_BANG_(a,(function (){var G__1744 = a.state;
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1744) : f.call(null,G__1744));
|
|
})());
|
|
});
|
|
|
|
cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$3 = (function (a,f,x){
|
|
return cljs.core.reset_vals_BANG_(a,(function (){var G__1745 = a.state;
|
|
var G__1746 = x;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1745,G__1746) : f.call(null,G__1745,G__1746));
|
|
})());
|
|
});
|
|
|
|
cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$4 = (function (a,f,x,y){
|
|
return cljs.core.reset_vals_BANG_(a,(function (){var G__1747 = a.state;
|
|
var G__1748 = x;
|
|
var G__1749 = y;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1747,G__1748,G__1749) : f.call(null,G__1747,G__1748,G__1749));
|
|
})());
|
|
});
|
|
|
|
cljs.core.swap_vals_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (a,f,x,y,more){
|
|
return cljs.core.reset_vals_BANG_(a,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,a.state,x,y,more));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.swap_vals_BANG_.cljs$lang$applyTo = (function (seq1738){
|
|
var G__1739 = cljs.core.first(seq1738);
|
|
var seq1738__$1 = cljs.core.next(seq1738);
|
|
var G__1740 = cljs.core.first(seq1738__$1);
|
|
var seq1738__$2 = cljs.core.next(seq1738__$1);
|
|
var G__1741 = cljs.core.first(seq1738__$2);
|
|
var seq1738__$3 = cljs.core.next(seq1738__$2);
|
|
var G__1742 = cljs.core.first(seq1738__$3);
|
|
var seq1738__$4 = cljs.core.next(seq1738__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1739,G__1740,G__1741,G__1742,seq1738__$4);
|
|
});
|
|
|
|
cljs.core.swap_vals_BANG_.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Atomically sets the value of atom to newval if and only if the
|
|
* current value of the atom is equal to oldval. Returns true if
|
|
* set happened, else false.
|
|
*/
|
|
cljs.core.compare_and_set_BANG_ = (function cljs$core$compare_and_set_BANG_(a,oldval,newval){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a.cljs$core$IDeref$_deref$arity$1(null),oldval)){
|
|
cljs.core.reset_BANG_(a,newval);
|
|
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
/**
|
|
* Sets the validator-fn for an atom. validator-fn must be nil or a
|
|
* side-effect-free fn of one argument, which will be passed the intended
|
|
* new state on any state change. If the new state is unacceptable, the
|
|
* validator-fn should return false or throw an Error. If the current state
|
|
* is not acceptable to the new validator, an Error will be thrown and the
|
|
* validator will not be changed.
|
|
*/
|
|
cljs.core.set_validator_BANG_ = (function cljs$core$set_validator_BANG_(iref,val){
|
|
if((((!((val == null)))) && (cljs.core.not((function (){var G__1755 = cljs.core._deref(iref);
|
|
return (val.cljs$core$IFn$_invoke$arity$1 ? val.cljs$core$IFn$_invoke$arity$1(G__1755) : val.call(null,G__1755));
|
|
})())))){
|
|
throw (new Error("Validator rejected reference state"));
|
|
} else {
|
|
}
|
|
|
|
return iref.validator = val;
|
|
});
|
|
/**
|
|
* Gets the validator-fn for a var/ref/agent/atom.
|
|
*/
|
|
cljs.core.get_validator = (function cljs$core$get_validator(iref){
|
|
return iref.validator;
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IVolatile}
|
|
* @implements {cljs.core.IDeref}
|
|
*/
|
|
cljs.core.Volatile = (function (state){
|
|
this.state = state;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32768;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.Volatile.prototype.cljs$core$IVolatile$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Volatile.prototype.cljs$core$IVolatile$_vreset_BANG_$arity$2 = (function (_,new_state){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.state = new_state;
|
|
});
|
|
|
|
cljs.core.Volatile.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return self__.state;
|
|
});
|
|
|
|
cljs.core.Volatile.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$state,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Volatile.cljs$lang$type = true;
|
|
|
|
cljs.core.Volatile.cljs$lang$ctorStr = "cljs.core/Volatile";
|
|
|
|
cljs.core.Volatile.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Volatile");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Volatile.
|
|
*/
|
|
cljs.core.__GT_Volatile = (function cljs$core$__GT_Volatile(state){
|
|
return (new cljs.core.Volatile(state));
|
|
});
|
|
|
|
/**
|
|
* Creates and returns a Volatile with an initial value of val.
|
|
*/
|
|
cljs.core.volatile_BANG_ = (function cljs$core$volatile_BANG_(val){
|
|
return (new cljs.core.Volatile(val));
|
|
});
|
|
/**
|
|
* Returns true if x is a volatile.
|
|
*/
|
|
cljs.core.volatile_QMARK_ = (function cljs$core$volatile_QMARK_(x){
|
|
return (x instanceof cljs.core.Volatile);
|
|
});
|
|
/**
|
|
* Sets the value of volatile to newval without regard for the
|
|
* current value. Returns newval.
|
|
*/
|
|
cljs.core.vreset_BANG_ = (function cljs$core$vreset_BANG_(vol,newval){
|
|
return cljs.core._vreset_BANG_(vol,newval);
|
|
});
|
|
/**
|
|
* Returns a lazy sequence of the non-nil results of (f index item). Note,
|
|
* this means false return values will be included. f must be free of
|
|
* side-effects. Returns a stateful transducer when no collection is
|
|
* provided.
|
|
*/
|
|
cljs.core.keep_indexed = (function cljs$core$keep_indexed(var_args){
|
|
var G__1757 = arguments.length;
|
|
switch (G__1757) {
|
|
case 1:
|
|
return cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function (rf){
|
|
var ia = cljs.core.volatile_BANG_((-1));
|
|
return ((function (ia){
|
|
return (function() {
|
|
var G__1767 = null;
|
|
var G__1767__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1767__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1767__2 = (function (result,input){
|
|
var i = ia.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,(ia.cljs$core$IDeref$_deref$arity$1(null) + (1)));
|
|
var v = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(i,input) : f.call(null,i,input));
|
|
if((v == null)){
|
|
return result;
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
|
|
}
|
|
});
|
|
G__1767 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1767__0.call(this);
|
|
case 1:
|
|
return G__1767__1.call(this,result);
|
|
case 2:
|
|
return G__1767__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1767.cljs$core$IFn$_invoke$arity$0 = G__1767__0;
|
|
G__1767.cljs$core$IFn$_invoke$arity$1 = G__1767__1;
|
|
G__1767.cljs$core$IFn$_invoke$arity$2 = G__1767__2;
|
|
return G__1767;
|
|
})()
|
|
;})(ia))
|
|
});
|
|
});
|
|
|
|
cljs.core.keep_indexed.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
var keepi = (function cljs$core$keepi(idx,coll__$1){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll__$1);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
var c = cljs.core.chunk_first(s);
|
|
var size = cljs.core.count(c);
|
|
var b = cljs.core.chunk_buffer(size);
|
|
var n__4518__auto___1768 = size;
|
|
var i_1769 = (0);
|
|
while(true){
|
|
if((i_1769 < n__4518__auto___1768)){
|
|
var x_1770 = (function (){var G__1762 = (idx + i_1769);
|
|
var G__1763 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1769);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1762,G__1763) : f.call(null,G__1762,G__1763));
|
|
})();
|
|
if((x_1770 == null)){
|
|
} else {
|
|
cljs.core.chunk_append(b,x_1770);
|
|
}
|
|
|
|
var G__1771 = (i_1769 + (1));
|
|
i_1769 = G__1771;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.chunk_cons(cljs.core.chunk(b),cljs$core$keepi((idx + size),cljs.core.chunk_rest(s)));
|
|
} else {
|
|
var x = (function (){var G__1764 = idx;
|
|
var G__1765 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1764,G__1765) : f.call(null,G__1764,G__1765));
|
|
})();
|
|
if((x == null)){
|
|
return cljs$core$keepi((idx + (1)),cljs.core.rest(s));
|
|
} else {
|
|
return cljs.core.cons(x,cljs$core$keepi((idx + (1)),cljs.core.rest(s)));
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
return keepi((0),coll);
|
|
});
|
|
|
|
cljs.core.keep_indexed.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Takes a set of predicates and returns a function f that returns true if all of its
|
|
* composing predicates return a logical true value against all of its arguments, else it returns
|
|
* false. Note that f is short-circuiting in that it will stop execution on the first
|
|
* argument that triggers a logical false result against the original predicates.
|
|
*/
|
|
cljs.core.every_pred = (function cljs$core$every_pred(var_args){
|
|
var G__1783 = arguments.length;
|
|
switch (G__1783) {
|
|
case 1:
|
|
return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1785 = arguments.length;
|
|
var i__4642__auto___1786 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1786 < len__4641__auto___1785)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1786]));
|
|
|
|
var G__1787 = (i__4642__auto___1786 + (1));
|
|
i__4642__auto___1786 = G__1787;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.every_pred.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.every_pred.cljs$core$IFn$_invoke$arity$1 = (function (p){
|
|
return (function() {
|
|
var cljs$core$ep1 = null;
|
|
var cljs$core$ep1__0 = (function (){
|
|
return true;
|
|
});
|
|
var cljs$core$ep1__1 = (function (x){
|
|
return cljs.core.boolean$((p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x)));
|
|
});
|
|
var cljs$core$ep1__2 = (function (x,y){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep1__3 = (function (x,y,z){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(z) : p.call(null,z));
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep1__4 = (function() {
|
|
var G__1788__delegate = function (x,y,z,args){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = cljs$core$ep1.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return cljs.core.every_QMARK_(p,args);
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
};
|
|
var G__1788 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1789__i = 0, G__1789__a = new Array(arguments.length - 3);
|
|
while (G__1789__i < G__1789__a.length) {G__1789__a[G__1789__i] = arguments[G__1789__i + 3]; ++G__1789__i;}
|
|
args = new cljs.core.IndexedSeq(G__1789__a,0,null);
|
|
}
|
|
return G__1788__delegate.call(this,x,y,z,args);};
|
|
G__1788.cljs$lang$maxFixedArity = 3;
|
|
G__1788.cljs$lang$applyTo = (function (arglist__1790){
|
|
var x = cljs.core.first(arglist__1790);
|
|
arglist__1790 = cljs.core.next(arglist__1790);
|
|
var y = cljs.core.first(arglist__1790);
|
|
arglist__1790 = cljs.core.next(arglist__1790);
|
|
var z = cljs.core.first(arglist__1790);
|
|
var args = cljs.core.rest(arglist__1790);
|
|
return G__1788__delegate(x,y,z,args);
|
|
});
|
|
G__1788.cljs$core$IFn$_invoke$arity$variadic = G__1788__delegate;
|
|
return G__1788;
|
|
})()
|
|
;
|
|
cljs$core$ep1 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$ep1__0.call(this);
|
|
case 1:
|
|
return cljs$core$ep1__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$ep1__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$ep1__3.call(this,x,y,z);
|
|
default:
|
|
var G__1791 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1792__i = 0, G__1792__a = new Array(arguments.length - 3);
|
|
while (G__1792__i < G__1792__a.length) {G__1792__a[G__1792__i] = arguments[G__1792__i + 3]; ++G__1792__i;}
|
|
G__1791 = new cljs.core.IndexedSeq(G__1792__a,0,null);
|
|
}
|
|
return cljs$core$ep1__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1791);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$ep1.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$ep1.cljs$lang$applyTo = cljs$core$ep1__4.cljs$lang$applyTo;
|
|
cljs$core$ep1.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep1__0;
|
|
cljs$core$ep1.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep1__1;
|
|
cljs$core$ep1.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep1__2;
|
|
cljs$core$ep1.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep1__3;
|
|
cljs$core$ep1.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep1__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$ep1;
|
|
})()
|
|
});
|
|
|
|
cljs.core.every_pred.cljs$core$IFn$_invoke$arity$2 = (function (p1,p2){
|
|
return (function() {
|
|
var cljs$core$ep2 = null;
|
|
var cljs$core$ep2__0 = (function (){
|
|
return true;
|
|
});
|
|
var cljs$core$ep2__1 = (function (x){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep2__2 = (function (x,y){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
var and__4036__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$2)){
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep2__3 = (function (x,y,z){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
var and__4036__auto____$2 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
|
|
if(cljs.core.truth_(and__4036__auto____$2)){
|
|
var and__4036__auto____$3 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$3)){
|
|
var and__4036__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$4)){
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
|
|
} else {
|
|
return and__4036__auto____$4;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$3;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep2__4 = (function() {
|
|
var G__1793__delegate = function (x,y,z,args){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = cljs$core$ep2.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return cljs.core.every_QMARK_(((function (and__4036__auto__){
|
|
return (function (p1__1772_SHARP_){
|
|
var and__4036__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1772_SHARP_) : p1.call(null,p1__1772_SHARP_));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1772_SHARP_) : p2.call(null,p1__1772_SHARP_));
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
});})(and__4036__auto__))
|
|
,args);
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
};
|
|
var G__1793 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1794__i = 0, G__1794__a = new Array(arguments.length - 3);
|
|
while (G__1794__i < G__1794__a.length) {G__1794__a[G__1794__i] = arguments[G__1794__i + 3]; ++G__1794__i;}
|
|
args = new cljs.core.IndexedSeq(G__1794__a,0,null);
|
|
}
|
|
return G__1793__delegate.call(this,x,y,z,args);};
|
|
G__1793.cljs$lang$maxFixedArity = 3;
|
|
G__1793.cljs$lang$applyTo = (function (arglist__1795){
|
|
var x = cljs.core.first(arglist__1795);
|
|
arglist__1795 = cljs.core.next(arglist__1795);
|
|
var y = cljs.core.first(arglist__1795);
|
|
arglist__1795 = cljs.core.next(arglist__1795);
|
|
var z = cljs.core.first(arglist__1795);
|
|
var args = cljs.core.rest(arglist__1795);
|
|
return G__1793__delegate(x,y,z,args);
|
|
});
|
|
G__1793.cljs$core$IFn$_invoke$arity$variadic = G__1793__delegate;
|
|
return G__1793;
|
|
})()
|
|
;
|
|
cljs$core$ep2 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$ep2__0.call(this);
|
|
case 1:
|
|
return cljs$core$ep2__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$ep2__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$ep2__3.call(this,x,y,z);
|
|
default:
|
|
var G__1796 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1797__i = 0, G__1797__a = new Array(arguments.length - 3);
|
|
while (G__1797__i < G__1797__a.length) {G__1797__a[G__1797__i] = arguments[G__1797__i + 3]; ++G__1797__i;}
|
|
G__1796 = new cljs.core.IndexedSeq(G__1797__a,0,null);
|
|
}
|
|
return cljs$core$ep2__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1796);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$ep2.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$ep2.cljs$lang$applyTo = cljs$core$ep2__4.cljs$lang$applyTo;
|
|
cljs$core$ep2.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep2__0;
|
|
cljs$core$ep2.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep2__1;
|
|
cljs$core$ep2.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep2__2;
|
|
cljs$core$ep2.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep2__3;
|
|
cljs$core$ep2.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep2__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$ep2;
|
|
})()
|
|
});
|
|
|
|
cljs.core.every_pred.cljs$core$IFn$_invoke$arity$3 = (function (p1,p2,p3){
|
|
return (function() {
|
|
var cljs$core$ep3 = null;
|
|
var cljs$core$ep3__0 = (function (){
|
|
return true;
|
|
});
|
|
var cljs$core$ep3__1 = (function (x){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep3__2 = (function (x,y){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
var and__4036__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$2)){
|
|
var and__4036__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$3)){
|
|
var and__4036__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$4)){
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
|
|
} else {
|
|
return and__4036__auto____$4;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$3;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep3__3 = (function (x,y,z){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
var and__4036__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto____$2)){
|
|
var and__4036__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$3)){
|
|
var and__4036__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$4)){
|
|
var and__4036__auto____$5 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$5)){
|
|
var and__4036__auto____$6 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
|
|
if(cljs.core.truth_(and__4036__auto____$6)){
|
|
var and__4036__auto____$7 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
|
|
if(cljs.core.truth_(and__4036__auto____$7)){
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(z) : p3.call(null,z));
|
|
} else {
|
|
return and__4036__auto____$7;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$6;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$5;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$4;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$3;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
});
|
|
var cljs$core$ep3__4 = (function() {
|
|
var G__1798__delegate = function (x,y,z,args){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = cljs$core$ep3.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return cljs.core.every_QMARK_(((function (and__4036__auto__){
|
|
return (function (p1__1773_SHARP_){
|
|
var and__4036__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1773_SHARP_) : p1.call(null,p1__1773_SHARP_));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
var and__4036__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1773_SHARP_) : p2.call(null,p1__1773_SHARP_));
|
|
if(cljs.core.truth_(and__4036__auto____$2)){
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(p1__1773_SHARP_) : p3.call(null,p1__1773_SHARP_));
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
});})(and__4036__auto__))
|
|
,args);
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
};
|
|
var G__1798 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1799__i = 0, G__1799__a = new Array(arguments.length - 3);
|
|
while (G__1799__i < G__1799__a.length) {G__1799__a[G__1799__i] = arguments[G__1799__i + 3]; ++G__1799__i;}
|
|
args = new cljs.core.IndexedSeq(G__1799__a,0,null);
|
|
}
|
|
return G__1798__delegate.call(this,x,y,z,args);};
|
|
G__1798.cljs$lang$maxFixedArity = 3;
|
|
G__1798.cljs$lang$applyTo = (function (arglist__1800){
|
|
var x = cljs.core.first(arglist__1800);
|
|
arglist__1800 = cljs.core.next(arglist__1800);
|
|
var y = cljs.core.first(arglist__1800);
|
|
arglist__1800 = cljs.core.next(arglist__1800);
|
|
var z = cljs.core.first(arglist__1800);
|
|
var args = cljs.core.rest(arglist__1800);
|
|
return G__1798__delegate(x,y,z,args);
|
|
});
|
|
G__1798.cljs$core$IFn$_invoke$arity$variadic = G__1798__delegate;
|
|
return G__1798;
|
|
})()
|
|
;
|
|
cljs$core$ep3 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$ep3__0.call(this);
|
|
case 1:
|
|
return cljs$core$ep3__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$ep3__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$ep3__3.call(this,x,y,z);
|
|
default:
|
|
var G__1801 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1802__i = 0, G__1802__a = new Array(arguments.length - 3);
|
|
while (G__1802__i < G__1802__a.length) {G__1802__a[G__1802__i] = arguments[G__1802__i + 3]; ++G__1802__i;}
|
|
G__1801 = new cljs.core.IndexedSeq(G__1802__a,0,null);
|
|
}
|
|
return cljs$core$ep3__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1801);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$ep3.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$ep3.cljs$lang$applyTo = cljs$core$ep3__4.cljs$lang$applyTo;
|
|
cljs$core$ep3.cljs$core$IFn$_invoke$arity$0 = cljs$core$ep3__0;
|
|
cljs$core$ep3.cljs$core$IFn$_invoke$arity$1 = cljs$core$ep3__1;
|
|
cljs$core$ep3.cljs$core$IFn$_invoke$arity$2 = cljs$core$ep3__2;
|
|
cljs$core$ep3.cljs$core$IFn$_invoke$arity$3 = cljs$core$ep3__3;
|
|
cljs$core$ep3.cljs$core$IFn$_invoke$arity$variadic = cljs$core$ep3__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$ep3;
|
|
})()
|
|
});
|
|
|
|
cljs.core.every_pred.cljs$core$IFn$_invoke$arity$variadic = (function (p1,p2,p3,ps){
|
|
var ps__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(p1,p2,p3,ps);
|
|
return ((function (ps__$1){
|
|
return (function() {
|
|
var cljs$core$epn = null;
|
|
var cljs$core$epn__0 = (function (){
|
|
return true;
|
|
});
|
|
var cljs$core$epn__1 = (function (x){
|
|
return cljs.core.every_QMARK_(((function (ps__$1){
|
|
return (function (p1__1774_SHARP_){
|
|
return (p1__1774_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1774_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1774_SHARP_.call(null,x));
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$epn__2 = (function (x,y){
|
|
return cljs.core.every_QMARK_(((function (ps__$1){
|
|
return (function (p1__1775_SHARP_){
|
|
var and__4036__auto__ = (p1__1775_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1775_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1775_SHARP_.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (p1__1775_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1775_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1775_SHARP_.call(null,y));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$epn__3 = (function (x,y,z){
|
|
return cljs.core.every_QMARK_(((function (ps__$1){
|
|
return (function (p1__1776_SHARP_){
|
|
var and__4036__auto__ = (p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1776_SHARP_.call(null,x));
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
var and__4036__auto____$1 = (p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1776_SHARP_.call(null,y));
|
|
if(cljs.core.truth_(and__4036__auto____$1)){
|
|
return (p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1776_SHARP_.cljs$core$IFn$_invoke$arity$1(z) : p1__1776_SHARP_.call(null,z));
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$epn__4 = (function() {
|
|
var G__1803__delegate = function (x,y,z,args){
|
|
return cljs.core.boolean$((function (){var and__4036__auto__ = cljs$core$epn.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return cljs.core.every_QMARK_(((function (and__4036__auto__,ps__$1){
|
|
return (function (p1__1777_SHARP_){
|
|
return cljs.core.every_QMARK_(p1__1777_SHARP_,args);
|
|
});})(and__4036__auto__,ps__$1))
|
|
,ps__$1);
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})());
|
|
};
|
|
var G__1803 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1804__i = 0, G__1804__a = new Array(arguments.length - 3);
|
|
while (G__1804__i < G__1804__a.length) {G__1804__a[G__1804__i] = arguments[G__1804__i + 3]; ++G__1804__i;}
|
|
args = new cljs.core.IndexedSeq(G__1804__a,0,null);
|
|
}
|
|
return G__1803__delegate.call(this,x,y,z,args);};
|
|
G__1803.cljs$lang$maxFixedArity = 3;
|
|
G__1803.cljs$lang$applyTo = (function (arglist__1805){
|
|
var x = cljs.core.first(arglist__1805);
|
|
arglist__1805 = cljs.core.next(arglist__1805);
|
|
var y = cljs.core.first(arglist__1805);
|
|
arglist__1805 = cljs.core.next(arglist__1805);
|
|
var z = cljs.core.first(arglist__1805);
|
|
var args = cljs.core.rest(arglist__1805);
|
|
return G__1803__delegate(x,y,z,args);
|
|
});
|
|
G__1803.cljs$core$IFn$_invoke$arity$variadic = G__1803__delegate;
|
|
return G__1803;
|
|
})()
|
|
;
|
|
cljs$core$epn = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$epn__0.call(this);
|
|
case 1:
|
|
return cljs$core$epn__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$epn__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$epn__3.call(this,x,y,z);
|
|
default:
|
|
var G__1806 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1807__i = 0, G__1807__a = new Array(arguments.length - 3);
|
|
while (G__1807__i < G__1807__a.length) {G__1807__a[G__1807__i] = arguments[G__1807__i + 3]; ++G__1807__i;}
|
|
G__1806 = new cljs.core.IndexedSeq(G__1807__a,0,null);
|
|
}
|
|
return cljs$core$epn__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1806);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$epn.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$epn.cljs$lang$applyTo = cljs$core$epn__4.cljs$lang$applyTo;
|
|
cljs$core$epn.cljs$core$IFn$_invoke$arity$0 = cljs$core$epn__0;
|
|
cljs$core$epn.cljs$core$IFn$_invoke$arity$1 = cljs$core$epn__1;
|
|
cljs$core$epn.cljs$core$IFn$_invoke$arity$2 = cljs$core$epn__2;
|
|
cljs$core$epn.cljs$core$IFn$_invoke$arity$3 = cljs$core$epn__3;
|
|
cljs$core$epn.cljs$core$IFn$_invoke$arity$variadic = cljs$core$epn__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$epn;
|
|
})()
|
|
;})(ps__$1))
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.every_pred.cljs$lang$applyTo = (function (seq1779){
|
|
var G__1780 = cljs.core.first(seq1779);
|
|
var seq1779__$1 = cljs.core.next(seq1779);
|
|
var G__1781 = cljs.core.first(seq1779__$1);
|
|
var seq1779__$2 = cljs.core.next(seq1779__$1);
|
|
var G__1782 = cljs.core.first(seq1779__$2);
|
|
var seq1779__$3 = cljs.core.next(seq1779__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1780,G__1781,G__1782,seq1779__$3);
|
|
});
|
|
|
|
cljs.core.every_pred.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Takes a set of predicates and returns a function f that returns the first logical true value
|
|
* returned by one of its composing predicates against any of its arguments, else it returns
|
|
* logical false. Note that f is short-circuiting in that it will stop execution on the first
|
|
* argument that triggers a logical true result against the original predicates.
|
|
*/
|
|
cljs.core.some_fn = (function cljs$core$some_fn(var_args){
|
|
var G__1819 = arguments.length;
|
|
switch (G__1819) {
|
|
case 1:
|
|
return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1821 = arguments.length;
|
|
var i__4642__auto___1822 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1822 < len__4641__auto___1821)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1822]));
|
|
|
|
var G__1823 = (i__4642__auto___1822 + (1));
|
|
i__4642__auto___1822 = G__1823;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.some_fn.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.some_fn.cljs$core$IFn$_invoke$arity$1 = (function (p){
|
|
return (function() {
|
|
var cljs$core$sp1 = null;
|
|
var cljs$core$sp1__0 = (function (){
|
|
return null;
|
|
});
|
|
var cljs$core$sp1__1 = (function (x){
|
|
return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
|
|
});
|
|
var cljs$core$sp1__2 = (function (x,y){
|
|
var or__4047__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
|
|
}
|
|
});
|
|
var cljs$core$sp1__3 = (function (x,y,z){
|
|
var or__4047__auto__ = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(x) : p.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(y) : p.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return (p.cljs$core$IFn$_invoke$arity$1 ? p.cljs$core$IFn$_invoke$arity$1(z) : p.call(null,z));
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp1__4 = (function() {
|
|
var G__1824__delegate = function (x,y,z,args){
|
|
var or__4047__auto__ = cljs$core$sp1.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.some(p,args);
|
|
}
|
|
};
|
|
var G__1824 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1825__i = 0, G__1825__a = new Array(arguments.length - 3);
|
|
while (G__1825__i < G__1825__a.length) {G__1825__a[G__1825__i] = arguments[G__1825__i + 3]; ++G__1825__i;}
|
|
args = new cljs.core.IndexedSeq(G__1825__a,0,null);
|
|
}
|
|
return G__1824__delegate.call(this,x,y,z,args);};
|
|
G__1824.cljs$lang$maxFixedArity = 3;
|
|
G__1824.cljs$lang$applyTo = (function (arglist__1826){
|
|
var x = cljs.core.first(arglist__1826);
|
|
arglist__1826 = cljs.core.next(arglist__1826);
|
|
var y = cljs.core.first(arglist__1826);
|
|
arglist__1826 = cljs.core.next(arglist__1826);
|
|
var z = cljs.core.first(arglist__1826);
|
|
var args = cljs.core.rest(arglist__1826);
|
|
return G__1824__delegate(x,y,z,args);
|
|
});
|
|
G__1824.cljs$core$IFn$_invoke$arity$variadic = G__1824__delegate;
|
|
return G__1824;
|
|
})()
|
|
;
|
|
cljs$core$sp1 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$sp1__0.call(this);
|
|
case 1:
|
|
return cljs$core$sp1__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$sp1__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$sp1__3.call(this,x,y,z);
|
|
default:
|
|
var G__1827 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1828__i = 0, G__1828__a = new Array(arguments.length - 3);
|
|
while (G__1828__i < G__1828__a.length) {G__1828__a[G__1828__i] = arguments[G__1828__i + 3]; ++G__1828__i;}
|
|
G__1827 = new cljs.core.IndexedSeq(G__1828__a,0,null);
|
|
}
|
|
return cljs$core$sp1__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1827);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$sp1.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$sp1.cljs$lang$applyTo = cljs$core$sp1__4.cljs$lang$applyTo;
|
|
cljs$core$sp1.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp1__0;
|
|
cljs$core$sp1.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp1__1;
|
|
cljs$core$sp1.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp1__2;
|
|
cljs$core$sp1.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp1__3;
|
|
cljs$core$sp1.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp1__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$sp1;
|
|
})()
|
|
});
|
|
|
|
cljs.core.some_fn.cljs$core$IFn$_invoke$arity$2 = (function (p1,p2){
|
|
return (function() {
|
|
var cljs$core$sp2 = null;
|
|
var cljs$core$sp2__0 = (function (){
|
|
return null;
|
|
});
|
|
var cljs$core$sp2__1 = (function (x){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
}
|
|
});
|
|
var cljs$core$sp2__2 = (function (x,y){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
}
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp2__3 = (function (x,y,z){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
var or__4047__auto____$3 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$3)){
|
|
return or__4047__auto____$3;
|
|
} else {
|
|
var or__4047__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$4)){
|
|
return or__4047__auto____$4;
|
|
} else {
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp2__4 = (function() {
|
|
var G__1829__delegate = function (x,y,z,args){
|
|
var or__4047__auto__ = cljs$core$sp2.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.some(((function (or__4047__auto__){
|
|
return (function (p1__1808_SHARP_){
|
|
var or__4047__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1808_SHARP_) : p1.call(null,p1__1808_SHARP_));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1808_SHARP_) : p2.call(null,p1__1808_SHARP_));
|
|
}
|
|
});})(or__4047__auto__))
|
|
,args);
|
|
}
|
|
};
|
|
var G__1829 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1830__i = 0, G__1830__a = new Array(arguments.length - 3);
|
|
while (G__1830__i < G__1830__a.length) {G__1830__a[G__1830__i] = arguments[G__1830__i + 3]; ++G__1830__i;}
|
|
args = new cljs.core.IndexedSeq(G__1830__a,0,null);
|
|
}
|
|
return G__1829__delegate.call(this,x,y,z,args);};
|
|
G__1829.cljs$lang$maxFixedArity = 3;
|
|
G__1829.cljs$lang$applyTo = (function (arglist__1831){
|
|
var x = cljs.core.first(arglist__1831);
|
|
arglist__1831 = cljs.core.next(arglist__1831);
|
|
var y = cljs.core.first(arglist__1831);
|
|
arglist__1831 = cljs.core.next(arglist__1831);
|
|
var z = cljs.core.first(arglist__1831);
|
|
var args = cljs.core.rest(arglist__1831);
|
|
return G__1829__delegate(x,y,z,args);
|
|
});
|
|
G__1829.cljs$core$IFn$_invoke$arity$variadic = G__1829__delegate;
|
|
return G__1829;
|
|
})()
|
|
;
|
|
cljs$core$sp2 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$sp2__0.call(this);
|
|
case 1:
|
|
return cljs$core$sp2__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$sp2__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$sp2__3.call(this,x,y,z);
|
|
default:
|
|
var G__1832 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1833__i = 0, G__1833__a = new Array(arguments.length - 3);
|
|
while (G__1833__i < G__1833__a.length) {G__1833__a[G__1833__i] = arguments[G__1833__i + 3]; ++G__1833__i;}
|
|
G__1832 = new cljs.core.IndexedSeq(G__1833__a,0,null);
|
|
}
|
|
return cljs$core$sp2__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1832);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$sp2.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$sp2.cljs$lang$applyTo = cljs$core$sp2__4.cljs$lang$applyTo;
|
|
cljs$core$sp2.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp2__0;
|
|
cljs$core$sp2.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp2__1;
|
|
cljs$core$sp2.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp2__2;
|
|
cljs$core$sp2.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp2__3;
|
|
cljs$core$sp2.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp2__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$sp2;
|
|
})()
|
|
});
|
|
|
|
cljs.core.some_fn.cljs$core$IFn$_invoke$arity$3 = (function (p1,p2,p3){
|
|
return (function() {
|
|
var cljs$core$sp3 = null;
|
|
var cljs$core$sp3__0 = (function (){
|
|
return null;
|
|
});
|
|
var cljs$core$sp3__1 = (function (x){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp3__2 = (function (x,y){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
var or__4047__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$3)){
|
|
return or__4047__auto____$3;
|
|
} else {
|
|
var or__4047__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$4)){
|
|
return or__4047__auto____$4;
|
|
} else {
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp3__3 = (function (x,y,z){
|
|
var or__4047__auto__ = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(x) : p1.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(x) : p2.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(x) : p3.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
var or__4047__auto____$3 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(y) : p1.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$3)){
|
|
return or__4047__auto____$3;
|
|
} else {
|
|
var or__4047__auto____$4 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(y) : p2.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$4)){
|
|
return or__4047__auto____$4;
|
|
} else {
|
|
var or__4047__auto____$5 = (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(y) : p3.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$5)){
|
|
return or__4047__auto____$5;
|
|
} else {
|
|
var or__4047__auto____$6 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(z) : p1.call(null,z));
|
|
if(cljs.core.truth_(or__4047__auto____$6)){
|
|
return or__4047__auto____$6;
|
|
} else {
|
|
var or__4047__auto____$7 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(z) : p2.call(null,z));
|
|
if(cljs.core.truth_(or__4047__auto____$7)){
|
|
return or__4047__auto____$7;
|
|
} else {
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(z) : p3.call(null,z));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
var cljs$core$sp3__4 = (function() {
|
|
var G__1834__delegate = function (x,y,z,args){
|
|
var or__4047__auto__ = cljs$core$sp3.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.some(((function (or__4047__auto__){
|
|
return (function (p1__1809_SHARP_){
|
|
var or__4047__auto____$1 = (p1.cljs$core$IFn$_invoke$arity$1 ? p1.cljs$core$IFn$_invoke$arity$1(p1__1809_SHARP_) : p1.call(null,p1__1809_SHARP_));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (p2.cljs$core$IFn$_invoke$arity$1 ? p2.cljs$core$IFn$_invoke$arity$1(p1__1809_SHARP_) : p2.call(null,p1__1809_SHARP_));
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
return (p3.cljs$core$IFn$_invoke$arity$1 ? p3.cljs$core$IFn$_invoke$arity$1(p1__1809_SHARP_) : p3.call(null,p1__1809_SHARP_));
|
|
}
|
|
}
|
|
});})(or__4047__auto__))
|
|
,args);
|
|
}
|
|
};
|
|
var G__1834 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1835__i = 0, G__1835__a = new Array(arguments.length - 3);
|
|
while (G__1835__i < G__1835__a.length) {G__1835__a[G__1835__i] = arguments[G__1835__i + 3]; ++G__1835__i;}
|
|
args = new cljs.core.IndexedSeq(G__1835__a,0,null);
|
|
}
|
|
return G__1834__delegate.call(this,x,y,z,args);};
|
|
G__1834.cljs$lang$maxFixedArity = 3;
|
|
G__1834.cljs$lang$applyTo = (function (arglist__1836){
|
|
var x = cljs.core.first(arglist__1836);
|
|
arglist__1836 = cljs.core.next(arglist__1836);
|
|
var y = cljs.core.first(arglist__1836);
|
|
arglist__1836 = cljs.core.next(arglist__1836);
|
|
var z = cljs.core.first(arglist__1836);
|
|
var args = cljs.core.rest(arglist__1836);
|
|
return G__1834__delegate(x,y,z,args);
|
|
});
|
|
G__1834.cljs$core$IFn$_invoke$arity$variadic = G__1834__delegate;
|
|
return G__1834;
|
|
})()
|
|
;
|
|
cljs$core$sp3 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$sp3__0.call(this);
|
|
case 1:
|
|
return cljs$core$sp3__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$sp3__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$sp3__3.call(this,x,y,z);
|
|
default:
|
|
var G__1837 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1838__i = 0, G__1838__a = new Array(arguments.length - 3);
|
|
while (G__1838__i < G__1838__a.length) {G__1838__a[G__1838__i] = arguments[G__1838__i + 3]; ++G__1838__i;}
|
|
G__1837 = new cljs.core.IndexedSeq(G__1838__a,0,null);
|
|
}
|
|
return cljs$core$sp3__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1837);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$sp3.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$sp3.cljs$lang$applyTo = cljs$core$sp3__4.cljs$lang$applyTo;
|
|
cljs$core$sp3.cljs$core$IFn$_invoke$arity$0 = cljs$core$sp3__0;
|
|
cljs$core$sp3.cljs$core$IFn$_invoke$arity$1 = cljs$core$sp3__1;
|
|
cljs$core$sp3.cljs$core$IFn$_invoke$arity$2 = cljs$core$sp3__2;
|
|
cljs$core$sp3.cljs$core$IFn$_invoke$arity$3 = cljs$core$sp3__3;
|
|
cljs$core$sp3.cljs$core$IFn$_invoke$arity$variadic = cljs$core$sp3__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$sp3;
|
|
})()
|
|
});
|
|
|
|
cljs.core.some_fn.cljs$core$IFn$_invoke$arity$variadic = (function (p1,p2,p3,ps){
|
|
var ps__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(p1,p2,p3,ps);
|
|
return ((function (ps__$1){
|
|
return (function() {
|
|
var cljs$core$spn = null;
|
|
var cljs$core$spn__0 = (function (){
|
|
return null;
|
|
});
|
|
var cljs$core$spn__1 = (function (x){
|
|
return cljs.core.some(((function (ps__$1){
|
|
return (function (p1__1810_SHARP_){
|
|
return (p1__1810_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1810_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1810_SHARP_.call(null,x));
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$spn__2 = (function (x,y){
|
|
return cljs.core.some(((function (ps__$1){
|
|
return (function (p1__1811_SHARP_){
|
|
var or__4047__auto__ = (p1__1811_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1811_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1811_SHARP_.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return (p1__1811_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1811_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1811_SHARP_.call(null,y));
|
|
}
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$spn__3 = (function (x,y,z){
|
|
return cljs.core.some(((function (ps__$1){
|
|
return (function (p1__1812_SHARP_){
|
|
var or__4047__auto__ = (p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p1__1812_SHARP_.call(null,x));
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1(y) : p1__1812_SHARP_.call(null,y));
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return (p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p1__1812_SHARP_.cljs$core$IFn$_invoke$arity$1(z) : p1__1812_SHARP_.call(null,z));
|
|
}
|
|
}
|
|
});})(ps__$1))
|
|
,ps__$1);
|
|
});
|
|
var cljs$core$spn__4 = (function() {
|
|
var G__1839__delegate = function (x,y,z,args){
|
|
var or__4047__auto__ = cljs$core$spn.cljs$core$IFn$_invoke$arity$3(x,y,z);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.some(((function (or__4047__auto__,ps__$1){
|
|
return (function (p1__1813_SHARP_){
|
|
return cljs.core.some(p1__1813_SHARP_,args);
|
|
});})(or__4047__auto__,ps__$1))
|
|
,ps__$1);
|
|
}
|
|
};
|
|
var G__1839 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__1840__i = 0, G__1840__a = new Array(arguments.length - 3);
|
|
while (G__1840__i < G__1840__a.length) {G__1840__a[G__1840__i] = arguments[G__1840__i + 3]; ++G__1840__i;}
|
|
args = new cljs.core.IndexedSeq(G__1840__a,0,null);
|
|
}
|
|
return G__1839__delegate.call(this,x,y,z,args);};
|
|
G__1839.cljs$lang$maxFixedArity = 3;
|
|
G__1839.cljs$lang$applyTo = (function (arglist__1841){
|
|
var x = cljs.core.first(arglist__1841);
|
|
arglist__1841 = cljs.core.next(arglist__1841);
|
|
var y = cljs.core.first(arglist__1841);
|
|
arglist__1841 = cljs.core.next(arglist__1841);
|
|
var z = cljs.core.first(arglist__1841);
|
|
var args = cljs.core.rest(arglist__1841);
|
|
return G__1839__delegate(x,y,z,args);
|
|
});
|
|
G__1839.cljs$core$IFn$_invoke$arity$variadic = G__1839__delegate;
|
|
return G__1839;
|
|
})()
|
|
;
|
|
cljs$core$spn = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return cljs$core$spn__0.call(this);
|
|
case 1:
|
|
return cljs$core$spn__1.call(this,x);
|
|
case 2:
|
|
return cljs$core$spn__2.call(this,x,y);
|
|
case 3:
|
|
return cljs$core$spn__3.call(this,x,y,z);
|
|
default:
|
|
var G__1842 = null;
|
|
if (arguments.length > 3) {
|
|
var G__1843__i = 0, G__1843__a = new Array(arguments.length - 3);
|
|
while (G__1843__i < G__1843__a.length) {G__1843__a[G__1843__i] = arguments[G__1843__i + 3]; ++G__1843__i;}
|
|
G__1842 = new cljs.core.IndexedSeq(G__1843__a,0,null);
|
|
}
|
|
return cljs$core$spn__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__1842);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
cljs$core$spn.cljs$lang$maxFixedArity = 3;
|
|
cljs$core$spn.cljs$lang$applyTo = cljs$core$spn__4.cljs$lang$applyTo;
|
|
cljs$core$spn.cljs$core$IFn$_invoke$arity$0 = cljs$core$spn__0;
|
|
cljs$core$spn.cljs$core$IFn$_invoke$arity$1 = cljs$core$spn__1;
|
|
cljs$core$spn.cljs$core$IFn$_invoke$arity$2 = cljs$core$spn__2;
|
|
cljs$core$spn.cljs$core$IFn$_invoke$arity$3 = cljs$core$spn__3;
|
|
cljs$core$spn.cljs$core$IFn$_invoke$arity$variadic = cljs$core$spn__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return cljs$core$spn;
|
|
})()
|
|
;})(ps__$1))
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.some_fn.cljs$lang$applyTo = (function (seq1815){
|
|
var G__1816 = cljs.core.first(seq1815);
|
|
var seq1815__$1 = cljs.core.next(seq1815);
|
|
var G__1817 = cljs.core.first(seq1815__$1);
|
|
var seq1815__$2 = cljs.core.next(seq1815__$1);
|
|
var G__1818 = cljs.core.first(seq1815__$2);
|
|
var seq1815__$3 = cljs.core.next(seq1815__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1816,G__1817,G__1818,seq1815__$3);
|
|
});
|
|
|
|
cljs.core.some_fn.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Returns a lazy sequence consisting of the result of applying f to
|
|
* the set of first items of each coll, followed by applying f to the
|
|
* set of second items in each coll, until any one of the colls is
|
|
* exhausted. Any remaining items in other colls are ignored. Function
|
|
* f should accept number-of-colls arguments. Returns a transducer when
|
|
* no collection is provided.
|
|
*/
|
|
cljs.core.map = (function cljs$core$map(var_args){
|
|
var G__1851 = arguments.length;
|
|
switch (G__1851) {
|
|
case 1:
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1864 = arguments.length;
|
|
var i__4642__auto___1865 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1865 < len__4641__auto___1864)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1865]));
|
|
|
|
var G__1866 = (i__4642__auto___1865 + (1));
|
|
i__4642__auto___1865 = G__1866;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.map.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function (rf){
|
|
return (function() {
|
|
var G__1867 = null;
|
|
var G__1867__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1867__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1867__2 = (function (result,input){
|
|
var G__1852 = result;
|
|
var G__1853 = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1852,G__1853) : rf.call(null,G__1852,G__1853));
|
|
});
|
|
var G__1867__3 = (function() {
|
|
var G__1868__delegate = function (result,input,inputs){
|
|
var G__1854 = result;
|
|
var G__1855 = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,input,inputs);
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(G__1854,G__1855) : rf.call(null,G__1854,G__1855));
|
|
};
|
|
var G__1868 = function (result,input,var_args){
|
|
var inputs = null;
|
|
if (arguments.length > 2) {
|
|
var G__1869__i = 0, G__1869__a = new Array(arguments.length - 2);
|
|
while (G__1869__i < G__1869__a.length) {G__1869__a[G__1869__i] = arguments[G__1869__i + 2]; ++G__1869__i;}
|
|
inputs = new cljs.core.IndexedSeq(G__1869__a,0,null);
|
|
}
|
|
return G__1868__delegate.call(this,result,input,inputs);};
|
|
G__1868.cljs$lang$maxFixedArity = 2;
|
|
G__1868.cljs$lang$applyTo = (function (arglist__1870){
|
|
var result = cljs.core.first(arglist__1870);
|
|
arglist__1870 = cljs.core.next(arglist__1870);
|
|
var input = cljs.core.first(arglist__1870);
|
|
var inputs = cljs.core.rest(arglist__1870);
|
|
return G__1868__delegate(result,input,inputs);
|
|
});
|
|
G__1868.cljs$core$IFn$_invoke$arity$variadic = G__1868__delegate;
|
|
return G__1868;
|
|
})()
|
|
;
|
|
G__1867 = function(result,input,var_args){
|
|
var inputs = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1867__0.call(this);
|
|
case 1:
|
|
return G__1867__1.call(this,result);
|
|
case 2:
|
|
return G__1867__2.call(this,result,input);
|
|
default:
|
|
var G__1871 = null;
|
|
if (arguments.length > 2) {
|
|
var G__1872__i = 0, G__1872__a = new Array(arguments.length - 2);
|
|
while (G__1872__i < G__1872__a.length) {G__1872__a[G__1872__i] = arguments[G__1872__i + 2]; ++G__1872__i;}
|
|
G__1871 = new cljs.core.IndexedSeq(G__1872__a,0,null);
|
|
}
|
|
return G__1867__3.cljs$core$IFn$_invoke$arity$variadic(result,input, G__1871);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1867.cljs$lang$maxFixedArity = 2;
|
|
G__1867.cljs$lang$applyTo = G__1867__3.cljs$lang$applyTo;
|
|
G__1867.cljs$core$IFn$_invoke$arity$0 = G__1867__0;
|
|
G__1867.cljs$core$IFn$_invoke$arity$1 = G__1867__1;
|
|
G__1867.cljs$core$IFn$_invoke$arity$2 = G__1867__2;
|
|
G__1867.cljs$core$IFn$_invoke$arity$variadic = G__1867__3.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__1867;
|
|
})()
|
|
});
|
|
});
|
|
|
|
cljs.core.map.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
var c = cljs.core.chunk_first(s);
|
|
var size = cljs.core.count(c);
|
|
var b = cljs.core.chunk_buffer(size);
|
|
var n__4518__auto___1873 = size;
|
|
var i_1874 = (0);
|
|
while(true){
|
|
if((i_1874 < n__4518__auto___1873)){
|
|
cljs.core.chunk_append(b,(function (){var G__1856 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1874);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1856) : f.call(null,G__1856));
|
|
})());
|
|
|
|
var G__1875 = (i_1874 + (1));
|
|
i_1874 = G__1875;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,cljs.core.chunk_rest(s)));
|
|
} else {
|
|
return cljs.core.cons((function (){var G__1857 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__1857) : f.call(null,G__1857));
|
|
})(),cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,cljs.core.rest(s)));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.map.cljs$core$IFn$_invoke$arity$3 = (function (f,c1,c2){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var s1 = cljs.core.seq(c1);
|
|
var s2 = cljs.core.seq(c2);
|
|
if(((s1) && (s2))){
|
|
return cljs.core.cons((function (){var G__1858 = cljs.core.first(s1);
|
|
var G__1859 = cljs.core.first(s2);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1858,G__1859) : f.call(null,G__1858,G__1859));
|
|
})(),cljs.core.map.cljs$core$IFn$_invoke$arity$3(f,cljs.core.rest(s1),cljs.core.rest(s2)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.map.cljs$core$IFn$_invoke$arity$4 = (function (f,c1,c2,c3){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var s1 = cljs.core.seq(c1);
|
|
var s2 = cljs.core.seq(c2);
|
|
var s3 = cljs.core.seq(c3);
|
|
if(((s1) && (s2) && (s3))){
|
|
return cljs.core.cons((function (){var G__1860 = cljs.core.first(s1);
|
|
var G__1861 = cljs.core.first(s2);
|
|
var G__1862 = cljs.core.first(s3);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__1860,G__1861,G__1862) : f.call(null,G__1860,G__1861,G__1862));
|
|
})(),cljs.core.map.cljs$core$IFn$_invoke$arity$4(f,cljs.core.rest(s1),cljs.core.rest(s2),cljs.core.rest(s3)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.map.cljs$core$IFn$_invoke$arity$variadic = (function (f,c1,c2,c3,colls){
|
|
var step = (function cljs$core$step(cs){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var ss = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.seq,cs);
|
|
if(cljs.core.every_QMARK_(cljs.core.identity,ss)){
|
|
return cljs.core.cons(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.first,ss),cljs$core$step(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.rest,ss)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (step){
|
|
return (function (p1__1844_SHARP_){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,p1__1844_SHARP_);
|
|
});})(step))
|
|
,step(cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(colls,c3,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([c2,c1], 0))));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.map.cljs$lang$applyTo = (function (seq1846){
|
|
var G__1847 = cljs.core.first(seq1846);
|
|
var seq1846__$1 = cljs.core.next(seq1846);
|
|
var G__1848 = cljs.core.first(seq1846__$1);
|
|
var seq1846__$2 = cljs.core.next(seq1846__$1);
|
|
var G__1849 = cljs.core.first(seq1846__$2);
|
|
var seq1846__$3 = cljs.core.next(seq1846__$2);
|
|
var G__1850 = cljs.core.first(seq1846__$3);
|
|
var seq1846__$4 = cljs.core.next(seq1846__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1847,G__1848,G__1849,G__1850,seq1846__$4);
|
|
});
|
|
|
|
cljs.core.map.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Returns a lazy sequence of the first n items in coll, or all items if
|
|
* there are fewer than n. Returns a stateful transducer when
|
|
* no collection is provided.
|
|
*/
|
|
cljs.core.take = (function cljs$core$take(var_args){
|
|
var G__1877 = arguments.length;
|
|
switch (G__1877) {
|
|
case 1:
|
|
return cljs.core.take.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.take.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.take.cljs$core$IFn$_invoke$arity$1 = (function (n){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
return (function (rf){
|
|
var na = cljs.core.volatile_BANG_(n);
|
|
return ((function (na){
|
|
return (function() {
|
|
var G__1879 = null;
|
|
var G__1879__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1879__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1879__2 = (function (result,input){
|
|
var n__$1 = cljs.core.deref(na);
|
|
var nn = na.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,(na.cljs$core$IDeref$_deref$arity$1(null) - (1)));
|
|
var result__$1 = (((n__$1 > (0)))?(rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input)):result);
|
|
if((!((nn > (0))))){
|
|
return cljs.core.ensure_reduced(result__$1);
|
|
} else {
|
|
return result__$1;
|
|
}
|
|
});
|
|
G__1879 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1879__0.call(this);
|
|
case 1:
|
|
return G__1879__1.call(this,result);
|
|
case 2:
|
|
return G__1879__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1879.cljs$core$IFn$_invoke$arity$0 = G__1879__0;
|
|
G__1879.cljs$core$IFn$_invoke$arity$1 = G__1879__1;
|
|
G__1879.cljs$core$IFn$_invoke$arity$2 = G__1879__2;
|
|
return G__1879;
|
|
})()
|
|
;})(na))
|
|
});
|
|
});
|
|
|
|
cljs.core.take.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
if((n > (0))){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
return cljs.core.cons(cljs.core.first(s),cljs.core.take.cljs$core$IFn$_invoke$arity$2((n - (1)),cljs.core.rest(s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.take.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence of all but the first n items in coll.
|
|
* Returns a stateful transducer when no collection is provided.
|
|
*/
|
|
cljs.core.drop = (function cljs$core$drop(var_args){
|
|
var G__1881 = arguments.length;
|
|
switch (G__1881) {
|
|
case 1:
|
|
return cljs.core.drop.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.drop.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.drop.cljs$core$IFn$_invoke$arity$1 = (function (n){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
return (function (rf){
|
|
var na = cljs.core.volatile_BANG_(n);
|
|
return ((function (na){
|
|
return (function() {
|
|
var G__1883 = null;
|
|
var G__1883__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1883__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1883__2 = (function (result,input){
|
|
var n__$1 = cljs.core.deref(na);
|
|
na.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,(na.cljs$core$IDeref$_deref$arity$1(null) - (1)));
|
|
|
|
if((n__$1 > (0))){
|
|
return result;
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__1883 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1883__0.call(this);
|
|
case 1:
|
|
return G__1883__1.call(this,result);
|
|
case 2:
|
|
return G__1883__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1883.cljs$core$IFn$_invoke$arity$0 = G__1883__0;
|
|
G__1883.cljs$core$IFn$_invoke$arity$1 = G__1883__1;
|
|
G__1883.cljs$core$IFn$_invoke$arity$2 = G__1883__2;
|
|
return G__1883;
|
|
})()
|
|
;})(na))
|
|
});
|
|
});
|
|
|
|
cljs.core.drop.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
var step = (function (n__$1,coll__$1){
|
|
while(true){
|
|
var s = cljs.core.seq(coll__$1);
|
|
if((((n__$1 > (0))) && (s))){
|
|
var G__1884 = (n__$1 - (1));
|
|
var G__1885 = cljs.core.rest(s);
|
|
n__$1 = G__1884;
|
|
coll__$1 = G__1885;
|
|
continue;
|
|
} else {
|
|
return s;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
return (new cljs.core.LazySeq(null,((function (step){
|
|
return (function (){
|
|
return step(n,coll);
|
|
});})(step))
|
|
,null,null));
|
|
});
|
|
|
|
cljs.core.drop.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Return a lazy sequence of all but the last n (default 1) items in coll
|
|
*/
|
|
cljs.core.drop_last = (function cljs$core$drop_last(var_args){
|
|
var G__1887 = arguments.length;
|
|
switch (G__1887) {
|
|
case 1:
|
|
return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.drop_last.cljs$core$IFn$_invoke$arity$1 = (function (s){
|
|
return cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((1),s);
|
|
});
|
|
|
|
cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2 = (function (n,s){
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$3((function (x,_){
|
|
return x;
|
|
}),s,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,s));
|
|
});
|
|
|
|
cljs.core.drop_last.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a seq of the last n items in coll. Depending on the type
|
|
* of coll may be no better than linear time. For vectors, see also subvec.
|
|
*/
|
|
cljs.core.take_last = (function cljs$core$take_last(n,coll){
|
|
var s = cljs.core.seq(coll);
|
|
var lead = cljs.core.seq(cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,coll));
|
|
while(true){
|
|
if(lead){
|
|
var G__1889 = cljs.core.next(s);
|
|
var G__1890 = cljs.core.next(lead);
|
|
s = G__1889;
|
|
lead = G__1890;
|
|
continue;
|
|
} else {
|
|
return s;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns a lazy sequence of the items in coll starting from the
|
|
* first item for which (pred item) returns logical false. Returns a
|
|
* stateful transducer when no collection is provided.
|
|
*/
|
|
cljs.core.drop_while = (function cljs$core$drop_while(var_args){
|
|
var G__1892 = arguments.length;
|
|
switch (G__1892) {
|
|
case 1:
|
|
return cljs.core.drop_while.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.drop_while.cljs$core$IFn$_invoke$arity$1 = (function (pred){
|
|
return (function (rf){
|
|
var da = cljs.core.volatile_BANG_(true);
|
|
return ((function (da){
|
|
return (function() {
|
|
var G__1896 = null;
|
|
var G__1896__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1896__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1896__2 = (function (result,input){
|
|
var drop_QMARK_ = cljs.core.deref(da);
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = drop_QMARK_;
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
return result;
|
|
} else {
|
|
cljs.core.vreset_BANG_(da,null);
|
|
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__1896 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1896__0.call(this);
|
|
case 1:
|
|
return G__1896__1.call(this,result);
|
|
case 2:
|
|
return G__1896__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1896.cljs$core$IFn$_invoke$arity$0 = G__1896__0;
|
|
G__1896.cljs$core$IFn$_invoke$arity$1 = G__1896__1;
|
|
G__1896.cljs$core$IFn$_invoke$arity$2 = G__1896__2;
|
|
return G__1896;
|
|
})()
|
|
;})(da))
|
|
});
|
|
});
|
|
|
|
cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
|
|
var step = (function (pred__$1,coll__$1){
|
|
while(true){
|
|
var s = cljs.core.seq(coll__$1);
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = s;
|
|
if(and__4036__auto__){
|
|
var G__1894 = cljs.core.first(s);
|
|
return (pred__$1.cljs$core$IFn$_invoke$arity$1 ? pred__$1.cljs$core$IFn$_invoke$arity$1(G__1894) : pred__$1.call(null,G__1894));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
var G__1897 = pred__$1;
|
|
var G__1898 = cljs.core.rest(s);
|
|
pred__$1 = G__1897;
|
|
coll__$1 = G__1898;
|
|
continue;
|
|
} else {
|
|
return s;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
return (new cljs.core.LazySeq(null,((function (step){
|
|
return (function (){
|
|
return step(pred,coll);
|
|
});})(step))
|
|
,null,null));
|
|
});
|
|
|
|
cljs.core.drop_while.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IPending}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Cycle = (function (meta,all,prev,current,_next){
|
|
this.meta = meta;
|
|
this.all = all;
|
|
this.prev = prev;
|
|
this.current = current;
|
|
this._next = _next;
|
|
this.cljs$lang$protocol_mask$partition0$ = 26083532;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1;
|
|
});
|
|
cljs.core.Cycle.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.currentval = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
if(self__.current){
|
|
} else {
|
|
var temp__5455__auto___1903 = cljs.core.next(self__.prev);
|
|
if(temp__5455__auto___1903){
|
|
var c_1904 = temp__5455__auto___1903;
|
|
self__.current = c_1904;
|
|
} else {
|
|
self__.current = self__.all;
|
|
}
|
|
}
|
|
|
|
return self__.current;
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (!((self__.current == null)));
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var s = coll__$1.currentval();
|
|
var ret = cljs.core.first(s);
|
|
while(true){
|
|
var s__$1 = (function (){var or__4047__auto__ = cljs.core.next(s);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return self__.all;
|
|
}
|
|
})();
|
|
var ret__$1 = (function (){var G__1899 = ret;
|
|
var G__1900 = cljs.core.first(s__$1);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1899,G__1900) : f.call(null,G__1899,G__1900));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(ret__$1)){
|
|
return cljs.core.deref(ret__$1);
|
|
} else {
|
|
var G__1905 = s__$1;
|
|
var G__1906 = ret__$1;
|
|
s = G__1905;
|
|
ret = G__1906;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var s = coll__$1.currentval();
|
|
var ret = start;
|
|
while(true){
|
|
var ret__$1 = (function (){var G__1901 = ret;
|
|
var G__1902 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__1901,G__1902) : f.call(null,G__1901,G__1902));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(ret__$1)){
|
|
return cljs.core.deref(ret__$1);
|
|
} else {
|
|
var G__1907 = (function (){var or__4047__auto__ = cljs.core.next(s);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return self__.all;
|
|
}
|
|
})();
|
|
var G__1908 = ret__$1;
|
|
s = G__1907;
|
|
ret = G__1908;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.first(coll__$1.currentval());
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__._next == null)){
|
|
self__._next = (new cljs.core.Cycle(null,self__.all,coll__$1.currentval(),null,null));
|
|
} else {
|
|
}
|
|
|
|
return self__._next;
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.Cycle(meta__$1,self__.all,self__.prev,self__.current,self__._next));
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.Cycle.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$all,cljs.core.cst$sym$prev,cljs.core.with_meta(cljs.core.cst$sym$current,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$_next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Cycle.cljs$lang$type = true;
|
|
|
|
cljs.core.Cycle.cljs$lang$ctorStr = "cljs.core/Cycle";
|
|
|
|
cljs.core.Cycle.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Cycle");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Cycle.
|
|
*/
|
|
cljs.core.__GT_Cycle = (function cljs$core$__GT_Cycle(meta,all,prev,current,_next){
|
|
return (new cljs.core.Cycle(meta,all,prev,current,_next));
|
|
});
|
|
|
|
/**
|
|
* Returns a lazy (infinite!) sequence of repetitions of the items in coll.
|
|
*/
|
|
cljs.core.cycle = (function cljs$core$cycle(coll){
|
|
var temp__5455__auto__ = cljs.core.seq(coll);
|
|
if(temp__5455__auto__){
|
|
var vals = temp__5455__auto__;
|
|
return (new cljs.core.Cycle(null,vals,null,vals,null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
/**
|
|
* Returns a vector of [(take n coll) (drop n coll)]
|
|
*/
|
|
cljs.core.split_at = (function cljs$core$split_at(n,coll){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,coll),cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,coll)], null);
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IPending}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Repeat = (function (meta,count,val,next,__hash){
|
|
this.meta = meta;
|
|
this.count = count;
|
|
this.val = val;
|
|
this.next = next;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1;
|
|
});
|
|
cljs.core.Repeat.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.indexOf = (function() {
|
|
var G__1909 = null;
|
|
var G__1909__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__1909__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1909 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1909__1.call(this,x);
|
|
case 2:
|
|
return G__1909__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1909.cljs$core$IFn$_invoke$arity$1 = G__1909__1;
|
|
G__1909.cljs$core$IFn$_invoke$arity$2 = G__1909__2;
|
|
return G__1909;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Repeat.prototype.lastIndexOf = (function() {
|
|
var G__1910 = null;
|
|
var G__1910__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,self__.count);
|
|
});
|
|
var G__1910__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__1910 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__1910__1.call(this,x);
|
|
case 2:
|
|
return G__1910__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1910.cljs$core$IFn$_invoke$arity$1 = G__1910__1;
|
|
G__1910.cljs$core$IFn$_invoke$arity$2 = G__1910__2;
|
|
return G__1910;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.next == null)){
|
|
if((self__.count > (1))){
|
|
self__.next = (new cljs.core.Repeat(null,(self__.count - (1)),self__.val,null,null));
|
|
|
|
return self__.next;
|
|
} else {
|
|
if(((-1) === self__.count)){
|
|
return coll__$1;
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
} else {
|
|
return self__.next;
|
|
}
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return false;
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.count === (-1))){
|
|
var ret = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(self__.val,self__.val) : f.call(null,self__.val,self__.val));
|
|
while(true){
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
return cljs.core.deref(ret);
|
|
} else {
|
|
var G__1911 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
|
|
ret = G__1911;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var i = (1);
|
|
var ret = self__.val;
|
|
while(true){
|
|
if((i < self__.count)){
|
|
var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
|
|
if(cljs.core.reduced_QMARK_(ret__$1)){
|
|
return cljs.core.deref(ret__$1);
|
|
} else {
|
|
var G__1912 = (i + (1));
|
|
var G__1913 = ret__$1;
|
|
i = G__1912;
|
|
ret = G__1913;
|
|
continue;
|
|
}
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.count === (-1))){
|
|
var ret = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(start,self__.val) : f.call(null,start,self__.val));
|
|
while(true){
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
return cljs.core.deref(ret);
|
|
} else {
|
|
var G__1914 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
|
|
ret = G__1914;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var i = (0);
|
|
var ret = start;
|
|
while(true){
|
|
if((i < self__.count)){
|
|
var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,self__.val) : f.call(null,ret,self__.val));
|
|
if(cljs.core.reduced_QMARK_(ret__$1)){
|
|
return cljs.core.deref(ret__$1);
|
|
} else {
|
|
var G__1915 = (i + (1));
|
|
var G__1916 = ret__$1;
|
|
i = G__1915;
|
|
ret = G__1916;
|
|
continue;
|
|
}
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.next == null)){
|
|
if((self__.count > (1))){
|
|
self__.next = (new cljs.core.Repeat(null,(self__.count - (1)),self__.val,null,null));
|
|
|
|
return self__.next;
|
|
} else {
|
|
if(((-1) === self__.count)){
|
|
return coll__$1;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
}
|
|
} else {
|
|
return self__.next;
|
|
}
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.Repeat(meta__$1,self__.count,self__.val,self__.next,null));
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.Repeat.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$count,cljs.core.cst$sym$val,cljs.core.with_meta(cljs.core.cst$sym$next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Repeat.cljs$lang$type = true;
|
|
|
|
cljs.core.Repeat.cljs$lang$ctorStr = "cljs.core/Repeat";
|
|
|
|
cljs.core.Repeat.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Repeat");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Repeat.
|
|
*/
|
|
cljs.core.__GT_Repeat = (function cljs$core$__GT_Repeat(meta,count,val,next,__hash){
|
|
return (new cljs.core.Repeat(meta,count,val,next,__hash));
|
|
});
|
|
|
|
/**
|
|
* Returns a lazy (infinite!, or length n if supplied) sequence of xs.
|
|
*/
|
|
cljs.core.repeat = (function cljs$core$repeat(var_args){
|
|
var G__1918 = arguments.length;
|
|
switch (G__1918) {
|
|
case 1:
|
|
return cljs.core.repeat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.repeat.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.repeat.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return (new cljs.core.Repeat(null,(-1),x,null,null));
|
|
});
|
|
|
|
cljs.core.repeat.cljs$core$IFn$_invoke$arity$2 = (function (n,x){
|
|
if((n > (0))){
|
|
return (new cljs.core.Repeat(null,n,x,null,null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.repeat.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* DEPRECATED: Use 'repeat' instead.
|
|
* Returns a lazy seq of n xs.
|
|
*/
|
|
cljs.core.replicate = (function cljs$core$replicate(n,x){
|
|
return cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.repeat.cljs$core$IFn$_invoke$arity$1(x));
|
|
});
|
|
/**
|
|
* Takes a function of no args, presumably with side effects, and
|
|
* returns an infinite (or length n if supplied) lazy sequence of calls
|
|
* to it
|
|
*/
|
|
cljs.core.repeatedly = (function cljs$core$repeatedly(var_args){
|
|
var G__1921 = arguments.length;
|
|
switch (G__1921) {
|
|
case 1:
|
|
return cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
return cljs.core.cons((f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1(f));
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$2 = (function (n,f){
|
|
return cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.repeatedly.cljs$core$IFn$_invoke$arity$1(f));
|
|
});
|
|
|
|
cljs.core.repeatedly.cljs$lang$maxFixedArity = 2;
|
|
|
|
cljs.core.UNREALIZED_SEED = ({});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IPending}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Iterate = (function (meta,f,prev_seed,seed,next){
|
|
this.meta = meta;
|
|
this.f = f;
|
|
this.prev_seed = prev_seed;
|
|
this.seed = seed;
|
|
this.next = next;
|
|
this.cljs$lang$protocol_mask$partition0$ = 26083532;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1;
|
|
});
|
|
cljs.core.Iterate.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ISeq$_rest$arity$1(null);
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (!((self__.seed === cljs.core.UNREALIZED_SEED)));
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,rf){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var first = coll__$1.cljs$core$ISeq$_first$arity$1(null);
|
|
var v = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(first) : self__.f.call(null,first));
|
|
var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(first,v) : rf.call(null,first,v));
|
|
var v__$1 = v;
|
|
while(true){
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
return cljs.core.deref(ret);
|
|
} else {
|
|
var v__$2 = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(v__$1) : self__.f.call(null,v__$1));
|
|
var G__1923 = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(ret,v__$2) : rf.call(null,ret,v__$2));
|
|
var G__1924 = v__$2;
|
|
ret = G__1923;
|
|
v__$1 = G__1924;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,rf,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var v = coll__$1.cljs$core$ISeq$_first$arity$1(null);
|
|
var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(start,v) : rf.call(null,start,v));
|
|
var v__$1 = v;
|
|
while(true){
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
return cljs.core.deref(ret);
|
|
} else {
|
|
var v__$2 = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(v__$1) : self__.f.call(null,v__$1));
|
|
var G__1925 = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(ret,v__$2) : rf.call(null,ret,v__$2));
|
|
var G__1926 = v__$2;
|
|
ret = G__1925;
|
|
v__$1 = G__1926;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((cljs.core.UNREALIZED_SEED === self__.seed)){
|
|
self__.seed = (self__.f.cljs$core$IFn$_invoke$arity$1 ? self__.f.cljs$core$IFn$_invoke$arity$1(self__.prev_seed) : self__.f.call(null,self__.prev_seed));
|
|
} else {
|
|
}
|
|
|
|
return self__.seed;
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.next == null)){
|
|
self__.next = (new cljs.core.Iterate(null,self__.f,coll__$1.cljs$core$ISeq$_first$arity$1(null),cljs.core.UNREALIZED_SEED,null));
|
|
} else {
|
|
}
|
|
|
|
return self__.next;
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.Iterate(meta__$1,self__.f,self__.prev_seed,self__.seed,self__.next));
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.Iterate.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$f,cljs.core.cst$sym$prev_DASH_seed,cljs.core.with_meta(cljs.core.cst$sym$seed,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Iterate.cljs$lang$type = true;
|
|
|
|
cljs.core.Iterate.cljs$lang$ctorStr = "cljs.core/Iterate";
|
|
|
|
cljs.core.Iterate.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Iterate");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Iterate.
|
|
*/
|
|
cljs.core.__GT_Iterate = (function cljs$core$__GT_Iterate(meta,f,prev_seed,seed,next){
|
|
return (new cljs.core.Iterate(meta,f,prev_seed,seed,next));
|
|
});
|
|
|
|
/**
|
|
* Returns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects
|
|
*/
|
|
cljs.core.iterate = (function cljs$core$iterate(f,x){
|
|
return (new cljs.core.Iterate(null,f,null,x,null));
|
|
});
|
|
/**
|
|
* Returns a lazy seq of the first item in each coll, then the second etc.
|
|
*/
|
|
cljs.core.interleave = (function cljs$core$interleave(var_args){
|
|
var G__1931 = arguments.length;
|
|
switch (G__1931) {
|
|
case 0:
|
|
return cljs.core.interleave.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.interleave.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.interleave.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1933 = arguments.length;
|
|
var i__4642__auto___1934 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1934 < len__4641__auto___1933)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1934]));
|
|
|
|
var G__1935 = (i__4642__auto___1934 + (1));
|
|
i__4642__auto___1934 = G__1935;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((2)),(0),null));
|
|
return cljs.core.interleave.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.interleave.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.List.EMPTY;
|
|
});
|
|
|
|
cljs.core.interleave.cljs$core$IFn$_invoke$arity$1 = (function (c1){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
return c1;
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.interleave.cljs$core$IFn$_invoke$arity$2 = (function (c1,c2){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var s1 = cljs.core.seq(c1);
|
|
var s2 = cljs.core.seq(c2);
|
|
if(((s1) && (s2))){
|
|
return cljs.core.cons(cljs.core.first(s1),cljs.core.cons(cljs.core.first(s2),cljs.core.interleave.cljs$core$IFn$_invoke$arity$2(cljs.core.rest(s1),cljs.core.rest(s2))));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.interleave.cljs$core$IFn$_invoke$arity$variadic = (function (c1,c2,colls){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var ss = cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.seq,cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(colls,c2,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([c1], 0)));
|
|
if(cljs.core.every_QMARK_(cljs.core.identity,ss)){
|
|
return cljs.core.concat.cljs$core$IFn$_invoke$arity$2(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.first,ss),cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.interleave,cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.rest,ss)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.interleave.cljs$lang$applyTo = (function (seq1928){
|
|
var G__1929 = cljs.core.first(seq1928);
|
|
var seq1928__$1 = cljs.core.next(seq1928);
|
|
var G__1930 = cljs.core.first(seq1928__$1);
|
|
var seq1928__$2 = cljs.core.next(seq1928__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1929,G__1930,seq1928__$2);
|
|
});
|
|
|
|
cljs.core.interleave.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns a lazy seq of the elements of coll separated by sep.
|
|
* Returns a stateful transducer when no collection is provided.
|
|
*/
|
|
cljs.core.interpose = (function cljs$core$interpose(var_args){
|
|
var G__1937 = arguments.length;
|
|
switch (G__1937) {
|
|
case 1:
|
|
return cljs.core.interpose.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.interpose.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.interpose.cljs$core$IFn$_invoke$arity$1 = (function (sep){
|
|
return (function (rf){
|
|
var started = cljs.core.volatile_BANG_(false);
|
|
return ((function (started){
|
|
return (function() {
|
|
var G__1939 = null;
|
|
var G__1939__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1939__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1939__2 = (function (result,input){
|
|
if(cljs.core.truth_(cljs.core.deref(started))){
|
|
var sepr = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,sep) : rf.call(null,result,sep));
|
|
if(cljs.core.reduced_QMARK_(sepr)){
|
|
return sepr;
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(sepr,input) : rf.call(null,sepr,input));
|
|
}
|
|
} else {
|
|
cljs.core.vreset_BANG_(started,true);
|
|
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__1939 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1939__0.call(this);
|
|
case 1:
|
|
return G__1939__1.call(this,result);
|
|
case 2:
|
|
return G__1939__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1939.cljs$core$IFn$_invoke$arity$0 = G__1939__0;
|
|
G__1939.cljs$core$IFn$_invoke$arity$1 = G__1939__1;
|
|
G__1939.cljs$core$IFn$_invoke$arity$2 = G__1939__2;
|
|
return G__1939;
|
|
})()
|
|
;})(started))
|
|
});
|
|
});
|
|
|
|
cljs.core.interpose.cljs$core$IFn$_invoke$arity$2 = (function (sep,coll){
|
|
return cljs.core.drop.cljs$core$IFn$_invoke$arity$2((1),cljs.core.interleave.cljs$core$IFn$_invoke$arity$2(cljs.core.repeat.cljs$core$IFn$_invoke$arity$1(sep),coll));
|
|
});
|
|
|
|
cljs.core.interpose.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Take a collection of collections, and return a lazy seq
|
|
* of items from the inner collection
|
|
*/
|
|
cljs.core.flatten1 = (function cljs$core$flatten1(colls){
|
|
var cat = (function cljs$core$flatten1_$_cat(coll,colls__$1){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5455__auto__ = cljs.core.seq(coll);
|
|
if(temp__5455__auto__){
|
|
var coll__$1 = temp__5455__auto__;
|
|
return cljs.core.cons(cljs.core.first(coll__$1),cljs$core$flatten1_$_cat(cljs.core.rest(coll__$1),colls__$1));
|
|
} else {
|
|
if(cljs.core.seq(colls__$1)){
|
|
return cljs$core$flatten1_$_cat(cljs.core.first(colls__$1),cljs.core.rest(colls__$1));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
}),null,null));
|
|
});
|
|
return cat(null,colls);
|
|
});
|
|
/**
|
|
* Returns the result of applying concat to the result of applying map
|
|
* to f and colls. Thus function f should return a collection. Returns
|
|
* a transducer when no collections are provided
|
|
*/
|
|
cljs.core.mapcat = (function cljs$core$mapcat(var_args){
|
|
var G__1943 = arguments.length;
|
|
switch (G__1943) {
|
|
case 1:
|
|
return cljs.core.mapcat.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1945 = arguments.length;
|
|
var i__4642__auto___1946 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1946 < len__4641__auto___1945)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1946]));
|
|
|
|
var G__1947 = (i__4642__auto___1946 + (1));
|
|
i__4642__auto___1946 = G__1947;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((1)),(0),null));
|
|
return cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.mapcat.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return cljs.core.comp.cljs$core$IFn$_invoke$arity$2(cljs.core.map.cljs$core$IFn$_invoke$arity$1(f),cljs.core.cat);
|
|
});
|
|
|
|
cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic = (function (f,colls){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.concat,cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.map,f,colls));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.mapcat.cljs$lang$applyTo = (function (seq1941){
|
|
var G__1942 = cljs.core.first(seq1941);
|
|
var seq1941__$1 = cljs.core.next(seq1941);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1942,seq1941__$1);
|
|
});
|
|
|
|
cljs.core.mapcat.cljs$lang$maxFixedArity = (1);
|
|
|
|
/**
|
|
* Returns a lazy sequence of the items in coll for which
|
|
* (pred item) returns logical true. pred must be free of side-effects.
|
|
* Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.filter = (function cljs$core$filter(var_args){
|
|
var G__1949 = arguments.length;
|
|
switch (G__1949) {
|
|
case 1:
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.filter.cljs$core$IFn$_invoke$arity$1 = (function (pred){
|
|
return (function (rf){
|
|
return (function() {
|
|
var G__1952 = null;
|
|
var G__1952__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__1952__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__1952__2 = (function (result,input){
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
} else {
|
|
return result;
|
|
}
|
|
});
|
|
G__1952 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__1952__0.call(this);
|
|
case 1:
|
|
return G__1952__1.call(this,result);
|
|
case 2:
|
|
return G__1952__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__1952.cljs$core$IFn$_invoke$arity$0 = G__1952__0;
|
|
G__1952.cljs$core$IFn$_invoke$arity$1 = G__1952__1;
|
|
G__1952.cljs$core$IFn$_invoke$arity$2 = G__1952__2;
|
|
return G__1952;
|
|
})()
|
|
});
|
|
});
|
|
|
|
cljs.core.filter.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(s)){
|
|
var c = cljs.core.chunk_first(s);
|
|
var size = cljs.core.count(c);
|
|
var b = cljs.core.chunk_buffer(size);
|
|
var n__4518__auto___1953 = size;
|
|
var i_1954 = (0);
|
|
while(true){
|
|
if((i_1954 < n__4518__auto___1953)){
|
|
if(cljs.core.truth_((function (){var G__1950 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1954);
|
|
return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__1950) : pred.call(null,G__1950));
|
|
})())){
|
|
cljs.core.chunk_append(b,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(c,i_1954));
|
|
} else {
|
|
}
|
|
|
|
var G__1955 = (i_1954 + (1));
|
|
i_1954 = G__1955;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core.chunk_cons(cljs.core.chunk(b),cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,cljs.core.chunk_rest(s)));
|
|
} else {
|
|
var f = cljs.core.first(s);
|
|
var r = cljs.core.rest(s);
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(f) : pred.call(null,f)))){
|
|
return cljs.core.cons(f,cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,r));
|
|
} else {
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$2(pred,r);
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.filter.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence of the items in coll for which
|
|
* (pred item) returns logical false. pred must be free of side-effects.
|
|
* Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.remove = (function cljs$core$remove(var_args){
|
|
var G__1957 = arguments.length;
|
|
switch (G__1957) {
|
|
case 1:
|
|
return cljs.core.remove.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.remove.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.remove.cljs$core$IFn$_invoke$arity$1 = (function (pred){
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$1(cljs.core.complement(pred));
|
|
});
|
|
|
|
cljs.core.remove.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$2(cljs.core.complement(pred),coll);
|
|
});
|
|
|
|
cljs.core.remove.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence of the nodes in a tree, via a depth-first walk.
|
|
* branch? must be a fn of one arg that returns true if passed a node
|
|
* that can have children (but may not). children must be a fn of one
|
|
* arg that returns a sequence of the children. Will only be called on
|
|
* nodes for which branch? returns true. Root is the root node of the
|
|
* tree.
|
|
*/
|
|
cljs.core.tree_seq = (function cljs$core$tree_seq(branch_QMARK_,children,root){
|
|
var walk = (function cljs$core$tree_seq_$_walk(node){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
return cljs.core.cons(node,(cljs.core.truth_((branch_QMARK_.cljs$core$IFn$_invoke$arity$1 ? branch_QMARK_.cljs$core$IFn$_invoke$arity$1(node) : branch_QMARK_.call(null,node)))?cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic(cljs$core$tree_seq_$_walk,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(children.cljs$core$IFn$_invoke$arity$1 ? children.cljs$core$IFn$_invoke$arity$1(node) : children.call(null,node))], 0)):null));
|
|
}),null,null));
|
|
});
|
|
return walk(root);
|
|
});
|
|
/**
|
|
* Takes any nested combination of sequential things (lists, vectors,
|
|
* etc.) and returns their contents as a single, flat sequence.
|
|
* (flatten nil) returns nil.
|
|
*/
|
|
cljs.core.flatten = (function cljs$core$flatten(x){
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((function (p1__1959_SHARP_){
|
|
return (!(cljs.core.sequential_QMARK_(p1__1959_SHARP_)));
|
|
}),cljs.core.rest(cljs.core.tree_seq(cljs.core.sequential_QMARK_,cljs.core.seq,x)));
|
|
});
|
|
/**
|
|
* Returns a new coll consisting of to-coll with all of the items of
|
|
* from-coll conjoined. A transducer may be supplied.
|
|
*/
|
|
cljs.core.into = (function cljs$core$into(var_args){
|
|
var G__1961 = arguments.length;
|
|
switch (G__1961) {
|
|
case 0:
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.into.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.PersistentVector.EMPTY;
|
|
});
|
|
|
|
cljs.core.into.cljs$core$IFn$_invoke$arity$1 = (function (to){
|
|
return to;
|
|
});
|
|
|
|
cljs.core.into.cljs$core$IFn$_invoke$arity$2 = (function (to,from){
|
|
if((!((to == null)))){
|
|
if((((!((to == null))))?(((((to.cljs$lang$protocol_mask$partition1$ & (4))) || ((cljs.core.PROTOCOL_SENTINEL === to.cljs$core$IEditableCollection$))))?true:false):false)){
|
|
return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj_BANG_,cljs.core.transient$(to),from)),cljs.core.meta(to));
|
|
} else {
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,to,from);
|
|
}
|
|
} else {
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.List.EMPTY,from);
|
|
}
|
|
});
|
|
|
|
cljs.core.into.cljs$core$IFn$_invoke$arity$3 = (function (to,xform,from){
|
|
if((((!((to == null))))?(((((to.cljs$lang$protocol_mask$partition1$ & (4))) || ((cljs.core.PROTOCOL_SENTINEL === to.cljs$core$IEditableCollection$))))?true:false):false)){
|
|
return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,cljs.core.conj_BANG_,cljs.core.transient$(to),from)),cljs.core.meta(to));
|
|
} else {
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(xform,cljs.core.conj,to,from);
|
|
}
|
|
});
|
|
|
|
cljs.core.into.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns a vector consisting of the result of applying f to the
|
|
* set of first items of each coll, followed by applying f to the set
|
|
* of second items in each coll, until any one of the colls is
|
|
* exhausted. Any remaining items in other colls are ignored. Function
|
|
* f should accept number-of-colls arguments.
|
|
*/
|
|
cljs.core.mapv = (function cljs$core$mapv(var_args){
|
|
var G__1971 = arguments.length;
|
|
switch (G__1971) {
|
|
case 2:
|
|
return cljs.core.mapv.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.mapv.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.mapv.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___1973 = arguments.length;
|
|
var i__4642__auto___1974 = (0);
|
|
while(true){
|
|
if((i__4642__auto___1974 < len__4641__auto___1973)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___1974]));
|
|
|
|
var G__1975 = (i__4642__auto___1974 + (1));
|
|
i__4642__auto___1974 = G__1975;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((4)),(0),null));
|
|
return cljs.core.mapv.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.mapv.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (v,o){
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(v,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(o) : f.call(null,o)));
|
|
}),cljs.core.transient$(cljs.core.PersistentVector.EMPTY),coll));
|
|
});
|
|
|
|
cljs.core.mapv.cljs$core$IFn$_invoke$arity$3 = (function (f,c1,c2){
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$3(f,c1,c2));
|
|
});
|
|
|
|
cljs.core.mapv.cljs$core$IFn$_invoke$arity$4 = (function (f,c1,c2,c3){
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$4(f,c1,c2,c3));
|
|
});
|
|
|
|
cljs.core.mapv.cljs$core$IFn$_invoke$arity$variadic = (function (f,c1,c2,c3,colls){
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentVector.EMPTY,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(cljs.core.map,f,c1,c2,c3,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([colls], 0)));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.mapv.cljs$lang$applyTo = (function (seq1966){
|
|
var G__1967 = cljs.core.first(seq1966);
|
|
var seq1966__$1 = cljs.core.next(seq1966);
|
|
var G__1968 = cljs.core.first(seq1966__$1);
|
|
var seq1966__$2 = cljs.core.next(seq1966__$1);
|
|
var G__1969 = cljs.core.first(seq1966__$2);
|
|
var seq1966__$3 = cljs.core.next(seq1966__$2);
|
|
var G__1970 = cljs.core.first(seq1966__$3);
|
|
var seq1966__$4 = cljs.core.next(seq1966__$3);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1967,G__1968,G__1969,G__1970,seq1966__$4);
|
|
});
|
|
|
|
cljs.core.mapv.cljs$lang$maxFixedArity = (4);
|
|
|
|
/**
|
|
* Returns a vector of the items in coll for which
|
|
* (pred item) returns logical true. pred must be free of side-effects.
|
|
*/
|
|
cljs.core.filterv = (function cljs$core$filterv(pred,coll){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (v,o){
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(o) : pred.call(null,o)))){
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(v,o);
|
|
} else {
|
|
return v;
|
|
}
|
|
}),cljs.core.transient$(cljs.core.PersistentVector.EMPTY),coll));
|
|
});
|
|
/**
|
|
* Returns a lazy sequence of lists of n items each, at offsets step
|
|
* apart. If step is not supplied, defaults to n, i.e. the partitions
|
|
* do not overlap. If a pad collection is supplied, use its elements as
|
|
* necessary to complete last partition up to n items. In case there are
|
|
* not enough padding elements, return a partition with less than n items.
|
|
*/
|
|
cljs.core.partition = (function cljs$core$partition(var_args){
|
|
var G__1977 = arguments.length;
|
|
switch (G__1977) {
|
|
case 2:
|
|
return cljs.core.partition.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.partition.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.partition.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.partition.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
return cljs.core.partition.cljs$core$IFn$_invoke$arity$3(n,n,coll);
|
|
});
|
|
|
|
cljs.core.partition.cljs$core$IFn$_invoke$arity$3 = (function (n,step,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
var p = cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s);
|
|
if((n === cljs.core.count(p))){
|
|
return cljs.core.cons(p,cljs.core.partition.cljs$core$IFn$_invoke$arity$3(n,step,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.partition.cljs$core$IFn$_invoke$arity$4 = (function (n,step,pad,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
var p = cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s);
|
|
if((n === cljs.core.count(p))){
|
|
return cljs.core.cons(p,cljs.core.partition.cljs$core$IFn$_invoke$arity$4(n,step,pad,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
|
|
} else {
|
|
return (new cljs.core.List(null,cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.concat.cljs$core$IFn$_invoke$arity$2(p,pad)),null,(1),null));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.partition.cljs$lang$maxFixedArity = 4;
|
|
|
|
/**
|
|
* Returns the value in a nested associative structure,
|
|
* where ks is a sequence of keys. Returns nil if the key is not present,
|
|
* or the not-found value if supplied.
|
|
*/
|
|
cljs.core.get_in = (function cljs$core$get_in(var_args){
|
|
var G__1980 = arguments.length;
|
|
switch (G__1980) {
|
|
case 2:
|
|
return cljs.core.get_in.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.get_in.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.get_in.cljs$core$IFn$_invoke$arity$2 = (function (m,ks){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.get,m,ks);
|
|
});
|
|
|
|
cljs.core.get_in.cljs$core$IFn$_invoke$arity$3 = (function (m,ks,not_found){
|
|
var sentinel = cljs.core.lookup_sentinel;
|
|
var m__$1 = m;
|
|
var ks__$1 = cljs.core.seq(ks);
|
|
while(true){
|
|
if((!((ks__$1 == null)))){
|
|
var m__$2 = cljs.core.get.cljs$core$IFn$_invoke$arity$3(m__$1,cljs.core.first(ks__$1),sentinel);
|
|
if((sentinel === m__$2)){
|
|
return not_found;
|
|
} else {
|
|
var G__1982 = sentinel;
|
|
var G__1983 = m__$2;
|
|
var G__1984 = cljs.core.next(ks__$1);
|
|
sentinel = G__1982;
|
|
m__$1 = G__1983;
|
|
ks__$1 = G__1984;
|
|
continue;
|
|
}
|
|
} else {
|
|
return m__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.get_in.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Associates a value in a nested associative structure, where ks is a
|
|
* sequence of keys and v is the new value and returns a new nested structure.
|
|
* If any levels do not exist, hash-maps will be created.
|
|
*/
|
|
cljs.core.assoc_in = (function cljs$core$assoc_in(m,p__1985,v){
|
|
var vec__1986 = p__1985;
|
|
var seq__1987 = cljs.core.seq(vec__1986);
|
|
var first__1988 = cljs.core.first(seq__1987);
|
|
var seq__1987__$1 = cljs.core.next(seq__1987);
|
|
var k = first__1988;
|
|
var ks = seq__1987__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__1989 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__1990 = ks;
|
|
var G__1991 = v;
|
|
return (cljs.core.assoc_in.cljs$core$IFn$_invoke$arity$3 ? cljs.core.assoc_in.cljs$core$IFn$_invoke$arity$3(G__1989,G__1990,G__1991) : cljs.core.assoc_in.call(null,G__1989,G__1990,G__1991));
|
|
})());
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,v);
|
|
}
|
|
});
|
|
/**
|
|
* 'Updates' a value in a nested associative structure, where ks is a
|
|
* sequence of keys and f is a function that will take the old value
|
|
* and any supplied args and return the new value, and returns a new
|
|
* nested structure. If any levels do not exist, hash-maps will be
|
|
* created.
|
|
*/
|
|
cljs.core.update_in = (function cljs$core$update_in(var_args){
|
|
var G__2000 = arguments.length;
|
|
switch (G__2000) {
|
|
case 3:
|
|
return cljs.core.update_in.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.update_in.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.update_in.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core.update_in.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2032 = arguments.length;
|
|
var i__4642__auto___2033 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2033 < len__4641__auto___2032)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2033]));
|
|
|
|
var G__2034 = (i__4642__auto___2033 + (1));
|
|
i__4642__auto___2033 = G__2034;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((6)),(0),null));
|
|
return cljs.core.update_in.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.update_in.cljs$core$IFn$_invoke$arity$3 = (function (m,p__2001,f){
|
|
var vec__2002 = p__2001;
|
|
var seq__2003 = cljs.core.seq(vec__2002);
|
|
var first__2004 = cljs.core.first(seq__2003);
|
|
var seq__2003__$1 = cljs.core.next(seq__2003);
|
|
var k = first__2004;
|
|
var ks = seq__2003__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$3(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f));
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2005 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__2005) : f.call(null,G__2005));
|
|
})());
|
|
}
|
|
});
|
|
|
|
cljs.core.update_in.cljs$core$IFn$_invoke$arity$4 = (function (m,p__2006,f,a){
|
|
var vec__2007 = p__2006;
|
|
var seq__2008 = cljs.core.seq(vec__2007);
|
|
var first__2009 = cljs.core.first(seq__2008);
|
|
var seq__2008__$1 = cljs.core.next(seq__2008);
|
|
var k = first__2009;
|
|
var ks = seq__2008__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$4(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a));
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2010 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2011 = a;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2010,G__2011) : f.call(null,G__2010,G__2011));
|
|
})());
|
|
}
|
|
});
|
|
|
|
cljs.core.update_in.cljs$core$IFn$_invoke$arity$5 = (function (m,p__2012,f,a,b){
|
|
var vec__2013 = p__2012;
|
|
var seq__2014 = cljs.core.seq(vec__2013);
|
|
var first__2015 = cljs.core.first(seq__2014);
|
|
var seq__2014__$1 = cljs.core.next(seq__2014);
|
|
var k = first__2015;
|
|
var ks = seq__2014__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$5(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,b));
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2016 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2017 = a;
|
|
var G__2018 = b;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2016,G__2017,G__2018) : f.call(null,G__2016,G__2017,G__2018));
|
|
})());
|
|
}
|
|
});
|
|
|
|
cljs.core.update_in.cljs$core$IFn$_invoke$arity$6 = (function (m,p__2019,f,a,b,c){
|
|
var vec__2020 = p__2019;
|
|
var seq__2021 = cljs.core.seq(vec__2020);
|
|
var first__2022 = cljs.core.first(seq__2021);
|
|
var seq__2021__$1 = cljs.core.next(seq__2021);
|
|
var k = first__2022;
|
|
var ks = seq__2021__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.update_in.cljs$core$IFn$_invoke$arity$6(cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,b,c));
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2023 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2024 = a;
|
|
var G__2025 = b;
|
|
var G__2026 = c;
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__2023,G__2024,G__2025,G__2026) : f.call(null,G__2023,G__2024,G__2025,G__2026));
|
|
})());
|
|
}
|
|
});
|
|
|
|
cljs.core.update_in.cljs$core$IFn$_invoke$arity$variadic = (function (m,p__2027,f,a,b,c,args){
|
|
var vec__2028 = p__2027;
|
|
var seq__2029 = cljs.core.seq(vec__2028);
|
|
var first__2030 = cljs.core.first(seq__2029);
|
|
var seq__2029__$1 = cljs.core.next(seq__2029);
|
|
var k = first__2030;
|
|
var ks = seq__2029__$1;
|
|
if(ks){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(cljs.core.update_in,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),ks,f,a,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([b,c,args], 0)));
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),a,b,c,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([args], 0)));
|
|
}
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.update_in.cljs$lang$applyTo = (function (seq1993){
|
|
var G__1994 = cljs.core.first(seq1993);
|
|
var seq1993__$1 = cljs.core.next(seq1993);
|
|
var G__1995 = cljs.core.first(seq1993__$1);
|
|
var seq1993__$2 = cljs.core.next(seq1993__$1);
|
|
var G__1996 = cljs.core.first(seq1993__$2);
|
|
var seq1993__$3 = cljs.core.next(seq1993__$2);
|
|
var G__1997 = cljs.core.first(seq1993__$3);
|
|
var seq1993__$4 = cljs.core.next(seq1993__$3);
|
|
var G__1998 = cljs.core.first(seq1993__$4);
|
|
var seq1993__$5 = cljs.core.next(seq1993__$4);
|
|
var G__1999 = cljs.core.first(seq1993__$5);
|
|
var seq1993__$6 = cljs.core.next(seq1993__$5);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__1994,G__1995,G__1996,G__1997,G__1998,G__1999,seq1993__$6);
|
|
});
|
|
|
|
cljs.core.update_in.cljs$lang$maxFixedArity = (6);
|
|
|
|
/**
|
|
* 'Updates' a value in an associative structure, where k is a
|
|
* key and f is a function that will take the old value
|
|
* and any supplied args and return the new value, and returns a new
|
|
* structure. If the key does not exist, nil is passed as the old value.
|
|
*/
|
|
cljs.core.update = (function cljs$core$update(var_args){
|
|
var G__2043 = arguments.length;
|
|
switch (G__2043) {
|
|
case 3:
|
|
return cljs.core.update.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.update.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.update.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core.update.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2055 = arguments.length;
|
|
var i__4642__auto___2056 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2056 < len__4641__auto___2055)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2056]));
|
|
|
|
var G__2057 = (i__4642__auto___2056 + (1));
|
|
i__4642__auto___2056 = G__2057;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((6)),(0),null));
|
|
return cljs.core.update.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.update.cljs$core$IFn$_invoke$arity$3 = (function (m,k,f){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2044 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__2044) : f.call(null,G__2044));
|
|
})());
|
|
});
|
|
|
|
cljs.core.update.cljs$core$IFn$_invoke$arity$4 = (function (m,k,f,x){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2045 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2046 = x;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2045,G__2046) : f.call(null,G__2045,G__2046));
|
|
})());
|
|
});
|
|
|
|
cljs.core.update.cljs$core$IFn$_invoke$arity$5 = (function (m,k,f,x,y){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2047 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2048 = x;
|
|
var G__2049 = y;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2047,G__2048,G__2049) : f.call(null,G__2047,G__2048,G__2049));
|
|
})());
|
|
});
|
|
|
|
cljs.core.update.cljs$core$IFn$_invoke$arity$6 = (function (m,k,f,x,y,z){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2050 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2051 = x;
|
|
var G__2052 = y;
|
|
var G__2053 = z;
|
|
return (f.cljs$core$IFn$_invoke$arity$4 ? f.cljs$core$IFn$_invoke$arity$4(G__2050,G__2051,G__2052,G__2053) : f.call(null,G__2050,G__2051,G__2052,G__2053));
|
|
})());
|
|
});
|
|
|
|
cljs.core.update.cljs$core$IFn$_invoke$arity$variadic = (function (m,k,f,x,y,z,more){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(f,cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k),x,y,z,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([more], 0)));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.update.cljs$lang$applyTo = (function (seq2036){
|
|
var G__2037 = cljs.core.first(seq2036);
|
|
var seq2036__$1 = cljs.core.next(seq2036);
|
|
var G__2038 = cljs.core.first(seq2036__$1);
|
|
var seq2036__$2 = cljs.core.next(seq2036__$1);
|
|
var G__2039 = cljs.core.first(seq2036__$2);
|
|
var seq2036__$3 = cljs.core.next(seq2036__$2);
|
|
var G__2040 = cljs.core.first(seq2036__$3);
|
|
var seq2036__$4 = cljs.core.next(seq2036__$3);
|
|
var G__2041 = cljs.core.first(seq2036__$4);
|
|
var seq2036__$5 = cljs.core.next(seq2036__$4);
|
|
var G__2042 = cljs.core.first(seq2036__$5);
|
|
var seq2036__$6 = cljs.core.next(seq2036__$5);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2037,G__2038,G__2039,G__2040,G__2041,G__2042,seq2036__$6);
|
|
});
|
|
|
|
cljs.core.update.cljs$lang$maxFixedArity = (6);
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.VectorNode = (function (edit,arr){
|
|
this.edit = edit;
|
|
this.arr = arr;
|
|
});
|
|
|
|
cljs.core.VectorNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.cst$sym$arr], null);
|
|
});
|
|
|
|
cljs.core.VectorNode.cljs$lang$type = true;
|
|
|
|
cljs.core.VectorNode.cljs$lang$ctorStr = "cljs.core/VectorNode";
|
|
|
|
cljs.core.VectorNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/VectorNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/VectorNode.
|
|
*/
|
|
cljs.core.__GT_VectorNode = (function cljs$core$__GT_VectorNode(edit,arr){
|
|
return (new cljs.core.VectorNode(edit,arr));
|
|
});
|
|
|
|
cljs.core.pv_fresh_node = (function cljs$core$pv_fresh_node(edit){
|
|
return (new cljs.core.VectorNode(edit,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
|
|
});
|
|
cljs.core.pv_aget = (function cljs$core$pv_aget(node,idx){
|
|
return (node.arr[idx]);
|
|
});
|
|
cljs.core.pv_aset = (function cljs$core$pv_aset(node,idx,val){
|
|
return (node.arr[idx] = val);
|
|
});
|
|
cljs.core.pv_clone_node = (function cljs$core$pv_clone_node(node){
|
|
return (new cljs.core.VectorNode(node.edit,cljs.core.aclone(node.arr)));
|
|
});
|
|
cljs.core.tail_off = (function cljs$core$tail_off(pv){
|
|
var cnt = pv.cnt;
|
|
if((cnt < (32))){
|
|
return (0);
|
|
} else {
|
|
return (((cnt - (1)) >>> (5)) << (5));
|
|
}
|
|
});
|
|
cljs.core.new_path = (function cljs$core$new_path(edit,level,node){
|
|
var ll = level;
|
|
var ret = node;
|
|
while(true){
|
|
if((ll === (0))){
|
|
return ret;
|
|
} else {
|
|
var embed = ret;
|
|
var r = cljs.core.pv_fresh_node(edit);
|
|
var _ = cljs.core.pv_aset(r,(0),embed);
|
|
var G__2058 = (ll - (5));
|
|
var G__2059 = r;
|
|
ll = G__2058;
|
|
ret = G__2059;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.push_tail = (function cljs$core$push_tail(pv,level,parent,tailnode){
|
|
var ret = cljs.core.pv_clone_node(parent);
|
|
var subidx = (((pv.cnt - (1)) >>> level) & (31));
|
|
if(((5) === level)){
|
|
cljs.core.pv_aset(ret,subidx,tailnode);
|
|
|
|
return ret;
|
|
} else {
|
|
var child = cljs.core.pv_aget(parent,subidx);
|
|
if((!((child == null)))){
|
|
var node_to_insert = (function (){var G__2060 = pv;
|
|
var G__2061 = (level - (5));
|
|
var G__2062 = child;
|
|
var G__2063 = tailnode;
|
|
return (cljs.core.push_tail.cljs$core$IFn$_invoke$arity$4 ? cljs.core.push_tail.cljs$core$IFn$_invoke$arity$4(G__2060,G__2061,G__2062,G__2063) : cljs.core.push_tail.call(null,G__2060,G__2061,G__2062,G__2063));
|
|
})();
|
|
cljs.core.pv_aset(ret,subidx,node_to_insert);
|
|
|
|
return ret;
|
|
} else {
|
|
var node_to_insert = cljs.core.new_path(null,(level - (5)),tailnode);
|
|
cljs.core.pv_aset(ret,subidx,node_to_insert);
|
|
|
|
return ret;
|
|
}
|
|
}
|
|
});
|
|
cljs.core.vector_index_out_of_bounds = (function cljs$core$vector_index_out_of_bounds(i,cnt){
|
|
throw (new Error(["No item ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(i)," in vector of length ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cnt)].join('')));
|
|
});
|
|
cljs.core.first_array_for_longvec = (function cljs$core$first_array_for_longvec(pv){
|
|
var node = pv.root;
|
|
var level = pv.shift;
|
|
while(true){
|
|
if((level > (0))){
|
|
var G__2064 = cljs.core.pv_aget(node,(0));
|
|
var G__2065 = (level - (5));
|
|
node = G__2064;
|
|
level = G__2065;
|
|
continue;
|
|
} else {
|
|
return node.arr;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.unchecked_array_for = (function cljs$core$unchecked_array_for(pv,i){
|
|
if((i >= cljs.core.tail_off(pv))){
|
|
return pv.tail;
|
|
} else {
|
|
var node = pv.root;
|
|
var level = pv.shift;
|
|
while(true){
|
|
if((level > (0))){
|
|
var G__2066 = cljs.core.pv_aget(node,((i >>> level) & (31)));
|
|
var G__2067 = (level - (5));
|
|
node = G__2066;
|
|
level = G__2067;
|
|
continue;
|
|
} else {
|
|
return node.arr;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
cljs.core.array_for = (function cljs$core$array_for(pv,i){
|
|
if(((((0) <= i)) && ((i < pv.cnt)))){
|
|
return cljs.core.unchecked_array_for(pv,i);
|
|
} else {
|
|
return cljs.core.vector_index_out_of_bounds(i,pv.cnt);
|
|
}
|
|
});
|
|
cljs.core.do_assoc = (function cljs$core$do_assoc(pv,level,node,i,val){
|
|
var ret = cljs.core.pv_clone_node(node);
|
|
if((level === (0))){
|
|
cljs.core.pv_aset(ret,(i & (31)),val);
|
|
|
|
return ret;
|
|
} else {
|
|
var subidx = ((i >>> level) & (31));
|
|
cljs.core.pv_aset(ret,subidx,(function (){var G__2068 = pv;
|
|
var G__2069 = (level - (5));
|
|
var G__2070 = cljs.core.pv_aget(node,subidx);
|
|
var G__2071 = i;
|
|
var G__2072 = val;
|
|
return (cljs.core.do_assoc.cljs$core$IFn$_invoke$arity$5 ? cljs.core.do_assoc.cljs$core$IFn$_invoke$arity$5(G__2068,G__2069,G__2070,G__2071,G__2072) : cljs.core.do_assoc.call(null,G__2068,G__2069,G__2070,G__2071,G__2072));
|
|
})());
|
|
|
|
return ret;
|
|
}
|
|
});
|
|
cljs.core.pop_tail = (function cljs$core$pop_tail(pv,level,node){
|
|
var subidx = (((pv.cnt - (2)) >>> level) & (31));
|
|
if((level > (5))){
|
|
var new_child = (function (){var G__2073 = pv;
|
|
var G__2074 = (level - (5));
|
|
var G__2075 = cljs.core.pv_aget(node,subidx);
|
|
return (cljs.core.pop_tail.cljs$core$IFn$_invoke$arity$3 ? cljs.core.pop_tail.cljs$core$IFn$_invoke$arity$3(G__2073,G__2074,G__2075) : cljs.core.pop_tail.call(null,G__2073,G__2074,G__2075));
|
|
})();
|
|
if((((new_child == null)) && ((subidx === (0))))){
|
|
return null;
|
|
} else {
|
|
var ret = cljs.core.pv_clone_node(node);
|
|
cljs.core.pv_aset(ret,subidx,new_child);
|
|
|
|
return ret;
|
|
}
|
|
} else {
|
|
if((subidx === (0))){
|
|
return null;
|
|
} else {
|
|
var ret = cljs.core.pv_clone_node(node);
|
|
cljs.core.pv_aset(ret,subidx,null);
|
|
|
|
return ret;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.RangedIterator = (function (i,base,arr,v,start,end){
|
|
this.i = i;
|
|
this.base = base;
|
|
this.arr = arr;
|
|
this.v = v;
|
|
this.start = start;
|
|
this.end = end;
|
|
});
|
|
cljs.core.RangedIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return (self__.i < self__.end);
|
|
});
|
|
|
|
cljs.core.RangedIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if(((self__.i - self__.base) === (32))){
|
|
self__.arr = cljs.core.unchecked_array_for(self__.v,self__.i);
|
|
|
|
self__.base = (self__.base + (32));
|
|
} else {
|
|
}
|
|
|
|
var ret = (self__.arr[(self__.i & (31))]);
|
|
self__.i = (self__.i + (1));
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.RangedIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$base,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$v,cljs.core.cst$sym$start,cljs.core.cst$sym$end], null);
|
|
});
|
|
|
|
cljs.core.RangedIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.RangedIterator.cljs$lang$ctorStr = "cljs.core/RangedIterator";
|
|
|
|
cljs.core.RangedIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/RangedIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/RangedIterator.
|
|
*/
|
|
cljs.core.__GT_RangedIterator = (function cljs$core$__GT_RangedIterator(i,base,arr,v,start,end){
|
|
return (new cljs.core.RangedIterator(i,base,arr,v,start,end));
|
|
});
|
|
|
|
cljs.core.ranged_iterator = (function cljs$core$ranged_iterator(v,start,end){
|
|
var i = start;
|
|
return (new cljs.core.RangedIterator(i,(i - (i % (32))),(((start < cljs.core.count(v)))?cljs.core.unchecked_array_for(v,i):null),v,start,end));
|
|
});
|
|
cljs.core.pv_reduce = (function cljs$core$pv_reduce(var_args){
|
|
var G__2077 = arguments.length;
|
|
switch (G__2077) {
|
|
case 4:
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4 = (function (pv,f,start,end){
|
|
if((start < end)){
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(pv,f,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(pv,start),(start + (1)),end);
|
|
} else {
|
|
return (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
}
|
|
});
|
|
|
|
cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5 = (function (pv,f,init,start,end){
|
|
var acc = init;
|
|
var i = start;
|
|
var arr = cljs.core.unchecked_array_for(pv,start);
|
|
while(true){
|
|
if((i < end)){
|
|
var j = (i & (31));
|
|
var arr__$1 = (((j === (0)))?cljs.core.unchecked_array_for(pv,i):arr);
|
|
var nacc = (function (){var G__2078 = acc;
|
|
var G__2079 = (arr__$1[j]);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2078,G__2079) : f.call(null,G__2078,G__2079));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(nacc)){
|
|
return cljs.core.deref(nacc);
|
|
} else {
|
|
var G__2081 = nacc;
|
|
var G__2082 = (i + (1));
|
|
var G__2083 = arr__$1;
|
|
acc = G__2081;
|
|
i = G__2082;
|
|
arr = G__2083;
|
|
continue;
|
|
}
|
|
} else {
|
|
return acc;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.pv_reduce.cljs$lang$maxFixedArity = 5;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
* Marker protocol
|
|
* @interface
|
|
*/
|
|
cljs.core.APersistentVector = function(){};
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.APersistentVector}
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IVector}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEditableCollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.PersistentVector = (function (meta,cnt,shift,root,tail,__hash){
|
|
this.meta = meta;
|
|
this.cnt = cnt;
|
|
this.shift = shift;
|
|
this.root = root;
|
|
this.tail = tail;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 167666463;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139268;
|
|
});
|
|
cljs.core.PersistentVector.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((((0) <= n)) && ((n < self__.cnt)))){
|
|
return (new cljs.core.MapEntry(n,(cljs.core.unchecked_array_for(coll__$1,n)[(n & (31))]),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.indexOf = (function() {
|
|
var G__2090 = null;
|
|
var G__2090__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2090__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2090 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2090__1.call(this,x);
|
|
case 2:
|
|
return G__2090__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2090.cljs$core$IFn$_invoke$arity$1 = G__2090__1;
|
|
G__2090.cljs$core$IFn$_invoke$arity$2 = G__2090__2;
|
|
return G__2090;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentVector.prototype.lastIndexOf = (function() {
|
|
var G__2091 = null;
|
|
var G__2091__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2091__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2091 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2091__1.call(this,x);
|
|
case 2:
|
|
return G__2091__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2091.cljs$core$IFn$_invoke$arity$1 = G__2091__1;
|
|
G__2091.cljs$core$IFn$_invoke$arity$2 = G__2091__2;
|
|
return G__2091;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(typeof k === 'number'){
|
|
return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (v,f,init){
|
|
var self__ = this;
|
|
var v__$1 = this;
|
|
var i = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < self__.cnt)){
|
|
var arr = cljs.core.unchecked_array_for(v__$1,i);
|
|
var len = arr.length;
|
|
var init__$2 = (function (){var j = (0);
|
|
var init__$2 = init__$1;
|
|
while(true){
|
|
if((j < len)){
|
|
var init__$3 = (function (){var G__2085 = init__$2;
|
|
var G__2086 = (j + i);
|
|
var G__2087 = (arr[j]);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2085,G__2086,G__2087) : f.call(null,G__2085,G__2086,G__2087));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$3)){
|
|
return init__$3;
|
|
} else {
|
|
var G__2092 = (j + (1));
|
|
var G__2093 = init__$3;
|
|
j = G__2092;
|
|
init__$2 = G__2093;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$2;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return cljs.core.deref(init__$2);
|
|
} else {
|
|
var G__2094 = (i + len);
|
|
var G__2095 = init__$2;
|
|
i = G__2094;
|
|
init__$1 = G__2095;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$APersistentVector$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (cljs.core.array_for(coll__$1,n)[(n & (31))]);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((((0) <= n)) && ((n < self__.cnt)))){
|
|
return (cljs.core.unchecked_array_for(coll__$1,n)[(n & (31))]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (coll,n,val){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((((0) <= n)) && ((n < self__.cnt)))){
|
|
if((cljs.core.tail_off(coll__$1) <= n)){
|
|
var new_tail = cljs.core.aclone(self__.tail);
|
|
(new_tail[(n & (31))] = val);
|
|
|
|
return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,self__.root,new_tail,null));
|
|
} else {
|
|
return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,cljs.core.do_assoc(coll__$1,self__.shift,self__.root,n,val),self__.tail,null));
|
|
}
|
|
} else {
|
|
if((n === self__.cnt)){
|
|
return coll__$1.cljs$core$ICollection$_conj$arity$2(null,val);
|
|
} else {
|
|
throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds [0,",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.cnt),"]"].join('')));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return cljs.core.ranged_iterator(this$__$1,(0),self__.cnt);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentVector(self__.meta,self__.cnt,self__.shift,self__.root,self__.tail,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.cnt;
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
return coll__$1.cljs$core$IIndexed$_nth$arity$2(null,(self__.cnt - (1)));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt === (0))){
|
|
throw (new Error("Can't pop empty vector"));
|
|
} else {
|
|
if(((1) === self__.cnt)){
|
|
return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
|
|
} else {
|
|
if(((1) < (self__.cnt - cljs.core.tail_off(coll__$1)))){
|
|
return (new cljs.core.PersistentVector(self__.meta,(self__.cnt - (1)),self__.shift,self__.root,self__.tail.slice((0),(-1)),null));
|
|
} else {
|
|
var new_tail = cljs.core.unchecked_array_for(coll__$1,(self__.cnt - (2)));
|
|
var nr = cljs.core.pop_tail(coll__$1,self__.shift,self__.root);
|
|
var new_root = (((nr == null))?cljs.core.PersistentVector.EMPTY_NODE:nr);
|
|
var cnt_1 = (self__.cnt - (1));
|
|
if(((((5) < self__.shift)) && ((cljs.core.pv_aget(new_root,(1)) == null)))){
|
|
return (new cljs.core.PersistentVector(self__.meta,cnt_1,(self__.shift - (5)),cljs.core.pv_aget(new_root,(0)),new_tail,null));
|
|
} else {
|
|
return (new cljs.core.PersistentVector(self__.meta,cnt_1,self__.shift,new_root,new_tail,null));
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
return (new cljs.core.RSeq(coll__$1,(self__.cnt - (1)),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((other instanceof cljs.core.PersistentVector)){
|
|
if((self__.cnt === cljs.core.count(other))){
|
|
var me_iter = coll__$1.cljs$core$IIterable$_iterator$arity$1(null);
|
|
var you_iter = cljs.core._iterator(other);
|
|
while(true){
|
|
if(me_iter.hasNext()){
|
|
var x = me_iter.next();
|
|
var y = you_iter.next();
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x,y)){
|
|
continue;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.TransientVector(self__.cnt,self__.shift,cljs.core.tv_editable_root(self__.root),cljs.core.tv_editable_tail(self__.tail)));
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (v,f){
|
|
var self__ = this;
|
|
var v__$1 = this;
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(v__$1,f,(0),self__.cnt);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (v,f,init){
|
|
var self__ = this;
|
|
var v__$1 = this;
|
|
var i = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < self__.cnt)){
|
|
var arr = cljs.core.unchecked_array_for(v__$1,i);
|
|
var len = arr.length;
|
|
var init__$2 = (function (){var j = (0);
|
|
var init__$2 = init__$1;
|
|
while(true){
|
|
if((j < len)){
|
|
var init__$3 = (function (){var G__2088 = init__$2;
|
|
var G__2089 = (arr[j]);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2088,G__2089) : f.call(null,G__2088,G__2089));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$3)){
|
|
return init__$3;
|
|
} else {
|
|
var G__2096 = (j + (1));
|
|
var G__2097 = init__$3;
|
|
j = G__2096;
|
|
init__$2 = G__2097;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$2;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return cljs.core.deref(init__$2);
|
|
} else {
|
|
var G__2098 = (i + len);
|
|
var G__2099 = init__$2;
|
|
i = G__2098;
|
|
init__$1 = G__2099;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(typeof k === 'number'){
|
|
return coll__$1.cljs$core$IVector$_assoc_n$arity$3(null,k,v);
|
|
} else {
|
|
throw (new Error("Vector's key for assoc must be a number."));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.integer_QMARK_(k)){
|
|
return ((((0) <= k)) && ((k < self__.cnt)));
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt === (0))){
|
|
return null;
|
|
} else {
|
|
if((self__.cnt <= (32))){
|
|
return (new cljs.core.IndexedSeq(self__.tail,(0),null));
|
|
} else {
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(coll__$1,cljs.core.first_array_for_longvec(coll__$1),(0),(0));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentVector(meta__$1,self__.cnt,self__.shift,self__.root,self__.tail,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((self__.cnt - cljs.core.tail_off(coll__$1)) < (32))){
|
|
var len = self__.tail.length;
|
|
var new_tail = (new Array((len + (1))));
|
|
var n__4518__auto___2100 = len;
|
|
var i_2101 = (0);
|
|
while(true){
|
|
if((i_2101 < n__4518__auto___2100)){
|
|
(new_tail[i_2101] = (self__.tail[i_2101]));
|
|
|
|
var G__2102 = (i_2101 + (1));
|
|
i_2101 = G__2102;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
(new_tail[len] = o);
|
|
|
|
return (new cljs.core.PersistentVector(self__.meta,(self__.cnt + (1)),self__.shift,self__.root,new_tail,null));
|
|
} else {
|
|
var root_overflow_QMARK_ = ((self__.cnt >>> (5)) > ((1) << self__.shift));
|
|
var new_shift = ((root_overflow_QMARK_)?(self__.shift + (5)):self__.shift);
|
|
var new_root = ((root_overflow_QMARK_)?(function (){var n_r = cljs.core.pv_fresh_node(null);
|
|
cljs.core.pv_aset(n_r,(0),self__.root);
|
|
|
|
cljs.core.pv_aset(n_r,(1),cljs.core.new_path(null,self__.shift,(new cljs.core.VectorNode(null,self__.tail))));
|
|
|
|
return n_r;
|
|
})():cljs.core.push_tail(coll__$1,self__.shift,self__.root,(new cljs.core.VectorNode(null,self__.tail))));
|
|
return (new cljs.core.PersistentVector(self__.meta,(self__.cnt + (1)),new_shift,new_root,[o],null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.call = (function() {
|
|
var G__2103 = null;
|
|
var G__2103__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
var G__2103__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
G__2103 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2103__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2103__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2103.cljs$core$IFn$_invoke$arity$2 = G__2103__2;
|
|
G__2103.cljs$core$IFn$_invoke$arity$3 = G__2103__3;
|
|
return G__2103;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentVector.prototype.apply = (function (self__,args2084){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2084)));
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentVector.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$shift,cljs.core.cst$sym$root,cljs.core.cst$sym$tail,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentVector.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentVector.cljs$lang$ctorStr = "cljs.core/PersistentVector";
|
|
|
|
cljs.core.PersistentVector.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentVector");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentVector.
|
|
*/
|
|
cljs.core.__GT_PersistentVector = (function cljs$core$__GT_PersistentVector(meta,cnt,shift,root,tail,__hash){
|
|
return (new cljs.core.PersistentVector(meta,cnt,shift,root,tail,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentVector.EMPTY_NODE = (new cljs.core.VectorNode(null,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
|
|
cljs.core.PersistentVector.EMPTY = (new cljs.core.PersistentVector(null,(0),(5),cljs.core.PersistentVector.EMPTY_NODE,[],cljs.core.empty_ordered_hash));
|
|
cljs.core.PersistentVector.fromArray = (function (xs,no_clone){
|
|
var l = xs.length;
|
|
var xs__$1 = ((no_clone)?xs:cljs.core.aclone(xs));
|
|
if((l < (32))){
|
|
return (new cljs.core.PersistentVector(null,l,(5),cljs.core.PersistentVector.EMPTY_NODE,xs__$1,null));
|
|
} else {
|
|
var node = xs__$1.slice((0),(32));
|
|
var v = (new cljs.core.PersistentVector(null,(32),(5),cljs.core.PersistentVector.EMPTY_NODE,node,null));
|
|
var i = (32);
|
|
var out = v.cljs$core$IEditableCollection$_as_transient$arity$1(null);
|
|
while(true){
|
|
if((i < l)){
|
|
var G__2104 = (i + (1));
|
|
var G__2105 = cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(out,(xs__$1[i]));
|
|
i = G__2104;
|
|
out = G__2105;
|
|
continue;
|
|
} else {
|
|
return cljs.core.persistent_BANG_(out);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
var G__2106_2109 = cljs.core.PersistentVector.prototype;
|
|
var G__2107_2110 = cljs.core.ITER_SYMBOL;
|
|
var G__2108_2111 = ((function (G__2106_2109,G__2107_2110){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2106_2109,G__2107_2110))
|
|
;
|
|
goog.object.set(G__2106_2109,G__2107_2110,G__2108_2111);
|
|
/**
|
|
* Creates a new vector containing the contents of coll. JavaScript arrays
|
|
* will be aliased and should not be modified.
|
|
*/
|
|
cljs.core.vec = (function cljs$core$vec(coll){
|
|
if(cljs.core.map_entry_QMARK_(coll)){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.key(coll),cljs.core.val(coll)], null);
|
|
} else {
|
|
if(cljs.core.vector_QMARK_(coll)){
|
|
return cljs.core.with_meta(coll,null);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(coll)){
|
|
return cljs.core.PersistentVector.fromArray(coll,true);
|
|
} else {
|
|
return cljs.core._persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj_BANG_,cljs.core._as_transient(cljs.core.PersistentVector.EMPTY),coll));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Creates a new vector containing the args.
|
|
*/
|
|
cljs.core.vector = (function cljs$core$vector(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2113 = arguments.length;
|
|
var i__4642__auto___2114 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2114 < len__4641__auto___2113)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2114]));
|
|
|
|
var G__2115 = (i__4642__auto___2114 + (1));
|
|
i__4642__auto___2114 = G__2115;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.vector.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.vector.cljs$core$IFn$_invoke$arity$variadic = (function (args){
|
|
if((((args instanceof cljs.core.IndexedSeq)) && ((args.i === (0))))){
|
|
return cljs.core.PersistentVector.fromArray(args.arr,true);
|
|
} else {
|
|
return cljs.core.vec(args);
|
|
}
|
|
});
|
|
|
|
cljs.core.vector.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.vector.cljs$lang$applyTo = (function (seq2112){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2112));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ASeq}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IChunkedNext}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IChunkedSeq}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.ChunkedSeq = (function (vec,node,i,off,meta,__hash){
|
|
this.vec = vec;
|
|
this.node = node;
|
|
this.i = i;
|
|
this.off = off;
|
|
this.meta = meta;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32375020;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1536;
|
|
});
|
|
cljs.core.ChunkedSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.indexOf = (function() {
|
|
var G__2116 = null;
|
|
var G__2116__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2116__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2116 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2116__1.call(this,x);
|
|
case 2:
|
|
return G__2116__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2116.cljs$core$IFn$_invoke$arity$1 = G__2116__1;
|
|
G__2116.cljs$core$IFn$_invoke$arity$2 = G__2116__2;
|
|
return G__2116;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ChunkedSeq.prototype.lastIndexOf = (function() {
|
|
var G__2117 = null;
|
|
var G__2117__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2117__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2117 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2117__1.call(this,x);
|
|
case 2:
|
|
return G__2117__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2117.cljs$core$IFn$_invoke$arity$1 = G__2117__1;
|
|
G__2117.cljs$core$IFn$_invoke$arity$2 = G__2117__2;
|
|
return G__2117;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((self__.off + (1)) < self__.node.length)){
|
|
var s = cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,self__.node,self__.i,(self__.off + (1)));
|
|
if((s == null)){
|
|
return null;
|
|
} else {
|
|
return s;
|
|
}
|
|
} else {
|
|
return coll__$1.cljs$core$IChunkedNext$_chunked_next$arity$1(null);
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.List.EMPTY;
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(self__.vec,f,(self__.i + self__.off),cljs.core.count(self__.vec));
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(self__.vec,f,start,(self__.i + self__.off),cljs.core.count(self__.vec));
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (self__.node[self__.off]);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((self__.off + (1)) < self__.node.length)){
|
|
var s = cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,self__.node,self__.i,(self__.off + (1)));
|
|
if((s == null)){
|
|
return cljs.core.List.EMPTY;
|
|
} else {
|
|
return s;
|
|
}
|
|
} else {
|
|
return coll__$1.cljs$core$IChunkedSeq$_chunked_rest$arity$1(null);
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedSeq$_chunked_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.array_chunk.cljs$core$IFn$_invoke$arity$2(self__.node,self__.off);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedSeq$_chunked_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var end = (self__.i + self__.node.length);
|
|
if((end < cljs.core._count(self__.vec))){
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,cljs.core.unchecked_array_for(self__.vec,end),end,(0));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,m){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5(self__.vec,self__.node,self__.i,self__.off,m);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IChunkedNext$_chunked_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var end = (self__.i + self__.node.length);
|
|
if((end < cljs.core._count(self__.vec))){
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4(self__.vec,cljs.core.unchecked_array_for(self__.vec,end),end,(0));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$vec,cljs.core.cst$sym$node,cljs.core.cst$sym$i,cljs.core.cst$sym$off,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.ChunkedSeq.cljs$lang$ctorStr = "cljs.core/ChunkedSeq";
|
|
|
|
cljs.core.ChunkedSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ChunkedSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ChunkedSeq.
|
|
*/
|
|
cljs.core.__GT_ChunkedSeq = (function cljs$core$__GT_ChunkedSeq(vec,node,i,off,meta,__hash){
|
|
return (new cljs.core.ChunkedSeq(vec,node,i,off,meta,__hash));
|
|
});
|
|
|
|
var G__2118_2121 = cljs.core.ChunkedSeq.prototype;
|
|
var G__2119_2122 = cljs.core.ITER_SYMBOL;
|
|
var G__2120_2123 = ((function (G__2118_2121,G__2119_2122){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2118_2121,G__2119_2122))
|
|
;
|
|
goog.object.set(G__2118_2121,G__2119_2122,G__2120_2123);
|
|
cljs.core.chunked_seq = (function cljs$core$chunked_seq(var_args){
|
|
var G__2125 = arguments.length;
|
|
switch (G__2125) {
|
|
case 3:
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$3 = (function (vec,i,off){
|
|
return (new cljs.core.ChunkedSeq(vec,cljs.core.array_for(vec,i),i,off,null,null));
|
|
});
|
|
|
|
cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$4 = (function (vec,node,i,off){
|
|
return (new cljs.core.ChunkedSeq(vec,node,i,off,null,null));
|
|
});
|
|
|
|
cljs.core.chunked_seq.cljs$core$IFn$_invoke$arity$5 = (function (vec,node,i,off,meta){
|
|
return (new cljs.core.ChunkedSeq(vec,node,i,off,meta,null));
|
|
});
|
|
|
|
cljs.core.chunked_seq.cljs$lang$maxFixedArity = 5;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IVector}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Subvec = (function (meta,v,start,end,__hash){
|
|
this.meta = meta;
|
|
this.v = v;
|
|
this.start = start;
|
|
this.end = end;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 167666463;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139264;
|
|
});
|
|
cljs.core.Subvec.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((n < (0))){
|
|
return null;
|
|
} else {
|
|
var idx = (self__.start + n);
|
|
if((idx < self__.end)){
|
|
return (new cljs.core.MapEntry(n,cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(self__.v,idx),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.indexOf = (function() {
|
|
var G__2134 = null;
|
|
var G__2134__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2134__2 = (function (x,start__$1){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
|
|
});
|
|
G__2134 = function(x,start__$1){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2134__1.call(this,x);
|
|
case 2:
|
|
return G__2134__2.call(this,x,start__$1);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2134.cljs$core$IFn$_invoke$arity$1 = G__2134__1;
|
|
G__2134.cljs$core$IFn$_invoke$arity$2 = G__2134__2;
|
|
return G__2134;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Subvec.prototype.lastIndexOf = (function() {
|
|
var G__2135 = null;
|
|
var G__2135__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2135__2 = (function (x,start__$1){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
|
|
});
|
|
G__2135 = function(x,start__$1){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2135__1.call(this,x);
|
|
case 2:
|
|
return G__2135__2.call(this,x,start__$1);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2135.cljs$core$IFn$_invoke$arity$1 = G__2135__1;
|
|
G__2135.cljs$core$IFn$_invoke$arity$2 = G__2135__2;
|
|
return G__2135;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(typeof k === 'number'){
|
|
return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var i = self__.start;
|
|
var j = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < self__.end)){
|
|
var init__$2 = (function (){var G__2128 = init__$1;
|
|
var G__2129 = j;
|
|
var G__2130 = cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,i);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2128,G__2129,G__2130) : f.call(null,G__2128,G__2129,G__2130));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return cljs.core.deref(init__$2);
|
|
} else {
|
|
var G__2136 = (i + (1));
|
|
var G__2137 = (j + (1));
|
|
var G__2138 = init__$2;
|
|
i = G__2136;
|
|
j = G__2137;
|
|
init__$1 = G__2138;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((n < (0))) || ((self__.end <= (self__.start + n))))){
|
|
return cljs.core.vector_index_out_of_bounds(n,(self__.end - self__.start));
|
|
} else {
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,(self__.start + n));
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((n < (0))) || ((self__.end <= (self__.start + n))))){
|
|
return not_found;
|
|
} else {
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$3(self__.v,(self__.start + n),not_found);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (coll,n,val){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var v_pos = (self__.start + n);
|
|
if((((n < (0))) || (((self__.end + (1)) <= v_pos)))){
|
|
throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds [0,",cljs.core.str.cljs$core$IFn$_invoke$arity$1(coll__$1.cljs$core$ICounted$_count$arity$1(null)),"]"].join('')));
|
|
} else {
|
|
return cljs.core.build_subvec(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.v,v_pos,val),self__.start,(function (){var x__4135__auto__ = self__.end;
|
|
var y__4136__auto__ = (v_pos + (1));
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
})(),null);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((!((self__.v == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
|
|
return cljs.core.ranged_iterator(self__.v,self__.start,self__.end);
|
|
} else {
|
|
return cljs.core.seq_iter(coll__$1);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.Subvec(self__.meta,self__.v,self__.start,self__.end,self__.__hash));
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (self__.end - self__.start);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,(self__.end - (1)));
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.start === self__.end)){
|
|
throw (new Error("Can't pop empty vector"));
|
|
} else {
|
|
return cljs.core.build_subvec(self__.meta,self__.v,self__.start,(self__.end - (1)),null);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((!((self__.start === self__.end)))){
|
|
return (new cljs.core.RSeq(coll__$1,((self__.end - self__.start) - (1)),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentVector.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((!((self__.v == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$4(self__.v,f,self__.start,self__.end);
|
|
} else {
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(coll__$1,f);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((((!((self__.v == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === self__.v.cljs$core$APersistentVector$))))?true:false):false)){
|
|
return cljs.core.pv_reduce.cljs$core$IFn$_invoke$arity$5(self__.v,f,init,self__.start,self__.end);
|
|
} else {
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(coll__$1,f,init);
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,key,val){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(typeof key === 'number'){
|
|
return coll__$1.cljs$core$IVector$_assoc_n$arity$3(null,key,val);
|
|
} else {
|
|
throw (new Error("Subvec's key for assoc must be a number."));
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var subvec_seq = ((function (coll__$1){
|
|
return (function cljs$core$subvec_seq(i){
|
|
if((i === self__.end)){
|
|
return null;
|
|
} else {
|
|
return cljs.core.cons(cljs.core._nth.cljs$core$IFn$_invoke$arity$2(self__.v,i),(new cljs.core.LazySeq(null,((function (coll__$1){
|
|
return (function (){
|
|
return cljs$core$subvec_seq((i + (1)));
|
|
});})(coll__$1))
|
|
,null,null)));
|
|
}
|
|
});})(coll__$1))
|
|
;
|
|
return subvec_seq(self__.start);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.build_subvec(meta__$1,self__.v,self__.start,self__.end,self__.__hash);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.build_subvec(self__.meta,cljs.core._assoc_n(self__.v,self__.end,o),self__.start,(self__.end + (1)),null);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.call = (function() {
|
|
var G__2139 = null;
|
|
var G__2139__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
var G__2139__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
G__2139 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2139__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2139__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2139.cljs$core$IFn$_invoke$arity$2 = G__2139__2;
|
|
G__2139.cljs$core$IFn$_invoke$arity$3 = G__2139__3;
|
|
return G__2139;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Subvec.prototype.apply = (function (self__,args2127){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2127)));
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.Subvec.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$v,cljs.core.cst$sym$start,cljs.core.cst$sym$end,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Subvec.cljs$lang$type = true;
|
|
|
|
cljs.core.Subvec.cljs$lang$ctorStr = "cljs.core/Subvec";
|
|
|
|
cljs.core.Subvec.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Subvec");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Subvec.
|
|
*/
|
|
cljs.core.__GT_Subvec = (function cljs$core$__GT_Subvec(meta,v,start,end,__hash){
|
|
return (new cljs.core.Subvec(meta,v,start,end,__hash));
|
|
});
|
|
|
|
var G__2140_2143 = cljs.core.Subvec.prototype;
|
|
var G__2141_2144 = cljs.core.ITER_SYMBOL;
|
|
var G__2142_2145 = ((function (G__2140_2143,G__2141_2144){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2140_2143,G__2141_2144))
|
|
;
|
|
goog.object.set(G__2140_2143,G__2141_2144,G__2142_2145);
|
|
cljs.core.build_subvec = (function cljs$core$build_subvec(meta,v,start,end,__hash){
|
|
while(true){
|
|
if((v instanceof cljs.core.Subvec)){
|
|
var G__2146 = meta;
|
|
var G__2147 = v.v;
|
|
var G__2148 = (v.start + start);
|
|
var G__2149 = (v.start + end);
|
|
var G__2150 = __hash;
|
|
meta = G__2146;
|
|
v = G__2147;
|
|
start = G__2148;
|
|
end = G__2149;
|
|
__hash = G__2150;
|
|
continue;
|
|
} else {
|
|
if(cljs.core.vector_QMARK_(v)){
|
|
} else {
|
|
throw (new Error("v must satisfy IVector"));
|
|
}
|
|
|
|
var c_2151 = cljs.core.count(v);
|
|
if((((start < (0))) || ((end < (0))) || ((start > c_2151)) || ((end > c_2151)))){
|
|
throw (new Error("Index out of bounds"));
|
|
} else {
|
|
}
|
|
|
|
return (new cljs.core.Subvec(meta,v,start,end,__hash));
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns a persistent vector of the items in vector from
|
|
* start (inclusive) to end (exclusive). If end is not supplied,
|
|
* defaults to (count vector). This operation is O(1) and very fast, as
|
|
* the resulting vector shares structure with the original and no
|
|
* trimming is done.
|
|
*/
|
|
cljs.core.subvec = (function cljs$core$subvec(var_args){
|
|
var G__2153 = arguments.length;
|
|
switch (G__2153) {
|
|
case 2:
|
|
return cljs.core.subvec.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.subvec.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.subvec.cljs$core$IFn$_invoke$arity$2 = (function (v,start){
|
|
return cljs.core.subvec.cljs$core$IFn$_invoke$arity$3(v,start,cljs.core.count(v));
|
|
});
|
|
|
|
cljs.core.subvec.cljs$core$IFn$_invoke$arity$3 = (function (v,start,end){
|
|
if((((!((start == null)))) && ((!((end == null)))))){
|
|
} else {
|
|
throw (new Error("Assert failed: (and (not (nil? start)) (not (nil? end)))"));
|
|
}
|
|
|
|
return cljs.core.build_subvec(null,v,(start | (0)),(end | (0)),null);
|
|
});
|
|
|
|
cljs.core.subvec.cljs$lang$maxFixedArity = 3;
|
|
|
|
cljs.core.tv_ensure_editable = (function cljs$core$tv_ensure_editable(edit,node){
|
|
if((edit === node.edit)){
|
|
return node;
|
|
} else {
|
|
return (new cljs.core.VectorNode(edit,cljs.core.aclone(node.arr)));
|
|
}
|
|
});
|
|
cljs.core.tv_editable_root = (function cljs$core$tv_editable_root(node){
|
|
return (new cljs.core.VectorNode({},cljs.core.aclone(node.arr)));
|
|
});
|
|
cljs.core.tv_editable_tail = (function cljs$core$tv_editable_tail(tl){
|
|
var ret = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
|
|
cljs.core.array_copy(tl,(0),ret,(0),tl.length);
|
|
|
|
return ret;
|
|
});
|
|
cljs.core.tv_push_tail = (function cljs$core$tv_push_tail(tv,level,parent,tail_node){
|
|
var ret = cljs.core.tv_ensure_editable(tv.root.edit,parent);
|
|
var subidx = (((tv.cnt - (1)) >>> level) & (31));
|
|
cljs.core.pv_aset(ret,subidx,(((level === (5)))?tail_node:(function (){var child = cljs.core.pv_aget(ret,subidx);
|
|
if((!((child == null)))){
|
|
var G__2157 = tv;
|
|
var G__2158 = (level - (5));
|
|
var G__2159 = child;
|
|
var G__2160 = tail_node;
|
|
return (cljs.core.tv_push_tail.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tv_push_tail.cljs$core$IFn$_invoke$arity$4(G__2157,G__2158,G__2159,G__2160) : cljs.core.tv_push_tail.call(null,G__2157,G__2158,G__2159,G__2160));
|
|
} else {
|
|
return cljs.core.new_path(tv.root.edit,(level - (5)),tail_node);
|
|
}
|
|
})()));
|
|
|
|
return ret;
|
|
});
|
|
cljs.core.tv_pop_tail = (function cljs$core$tv_pop_tail(tv,level,node){
|
|
var node__$1 = cljs.core.tv_ensure_editable(tv.root.edit,node);
|
|
var subidx = (((tv.cnt - (2)) >>> level) & (31));
|
|
if((level > (5))){
|
|
var new_child = (function (){var G__2161 = tv;
|
|
var G__2162 = (level - (5));
|
|
var G__2163 = cljs.core.pv_aget(node__$1,subidx);
|
|
return (cljs.core.tv_pop_tail.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tv_pop_tail.cljs$core$IFn$_invoke$arity$3(G__2161,G__2162,G__2163) : cljs.core.tv_pop_tail.call(null,G__2161,G__2162,G__2163));
|
|
})();
|
|
if((((new_child == null)) && ((subidx === (0))))){
|
|
return null;
|
|
} else {
|
|
cljs.core.pv_aset(node__$1,subidx,new_child);
|
|
|
|
return node__$1;
|
|
}
|
|
} else {
|
|
if((subidx === (0))){
|
|
return null;
|
|
} else {
|
|
cljs.core.pv_aset(node__$1,subidx,null);
|
|
|
|
return node__$1;
|
|
|
|
}
|
|
}
|
|
});
|
|
cljs.core.unchecked_editable_array_for = (function cljs$core$unchecked_editable_array_for(tv,i){
|
|
if((i >= cljs.core.tail_off(tv))){
|
|
return tv.tail;
|
|
} else {
|
|
var root = tv.root;
|
|
var node = root;
|
|
var level = tv.shift;
|
|
while(true){
|
|
if((level > (0))){
|
|
var G__2164 = cljs.core.tv_ensure_editable(root.edit,cljs.core.pv_aget(node,((i >>> level) & (31))));
|
|
var G__2165 = (level - (5));
|
|
node = G__2164;
|
|
level = G__2165;
|
|
continue;
|
|
} else {
|
|
return node.arr;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ITransientCollection}
|
|
* @implements {cljs.core.ITransientVector}
|
|
* @implements {cljs.core.ITransientAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.TransientVector = (function (cnt,shift,root,tail){
|
|
this.cnt = cnt;
|
|
this.shift = shift;
|
|
this.root = root;
|
|
this.tail = tail;
|
|
this.cljs$lang$protocol_mask$partition1$ = 88;
|
|
this.cljs$lang$protocol_mask$partition0$ = 275;
|
|
});
|
|
cljs.core.TransientVector.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(self__.root.edit){
|
|
if(((self__.cnt - cljs.core.tail_off(tcoll__$1)) < (32))){
|
|
(self__.tail[(self__.cnt & (31))] = o);
|
|
|
|
self__.cnt = (self__.cnt + (1));
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
var tail_node = (new cljs.core.VectorNode(self__.root.edit,self__.tail));
|
|
var new_tail = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
|
|
(new_tail[(0)] = o);
|
|
|
|
self__.tail = new_tail;
|
|
|
|
if(((self__.cnt >>> (5)) > ((1) << self__.shift))){
|
|
var new_root_array = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
|
|
var new_shift = (self__.shift + (5));
|
|
(new_root_array[(0)] = self__.root);
|
|
|
|
(new_root_array[(1)] = cljs.core.new_path(self__.root.edit,self__.shift,tail_node));
|
|
|
|
self__.root = (new cljs.core.VectorNode(self__.root.edit,new_root_array));
|
|
|
|
self__.shift = new_shift;
|
|
|
|
self__.cnt = (self__.cnt + (1));
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
var new_root = cljs.core.tv_push_tail(tcoll__$1,self__.shift,self__.root,tail_node);
|
|
self__.root = new_root;
|
|
|
|
self__.cnt = (self__.cnt + (1));
|
|
|
|
return tcoll__$1;
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("conj! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(self__.root.edit){
|
|
self__.root.edit = null;
|
|
|
|
var len = (self__.cnt - cljs.core.tail_off(tcoll__$1));
|
|
var trimmed_tail = (new Array(len));
|
|
cljs.core.array_copy(self__.tail,(0),trimmed_tail,(0),len);
|
|
|
|
return (new cljs.core.PersistentVector(null,self__.cnt,self__.shift,self__.root,trimmed_tail,null));
|
|
} else {
|
|
throw (new Error("persistent! called twice"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(typeof key === 'number'){
|
|
return tcoll__$1.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3(null,key,val);
|
|
} else {
|
|
throw (new Error("TransientVector's key for assoc! must be a number."));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ITransientVector$_assoc_n_BANG_$arity$3 = (function (tcoll,n,val){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(self__.root.edit){
|
|
if(((((0) <= n)) && ((n < self__.cnt)))){
|
|
if((cljs.core.tail_off(tcoll__$1) <= n)){
|
|
(self__.tail[(n & (31))] = val);
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
var new_root = (function (){var fexpr__2167 = ((function (tcoll__$1){
|
|
return (function cljs$core$go(level,node){
|
|
var node__$1 = cljs.core.tv_ensure_editable(self__.root.edit,node);
|
|
if((level === (0))){
|
|
cljs.core.pv_aset(node__$1,(n & (31)),val);
|
|
|
|
return node__$1;
|
|
} else {
|
|
var subidx = ((n >>> level) & (31));
|
|
cljs.core.pv_aset(node__$1,subidx,cljs$core$go((level - (5)),cljs.core.pv_aget(node__$1,subidx)));
|
|
|
|
return node__$1;
|
|
}
|
|
});})(tcoll__$1))
|
|
;
|
|
return fexpr__2167(self__.shift,self__.root);
|
|
})();
|
|
self__.root = new_root;
|
|
|
|
return tcoll__$1;
|
|
}
|
|
} else {
|
|
if((n === self__.cnt)){
|
|
return tcoll__$1.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,val);
|
|
} else {
|
|
throw (new Error(["Index ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(n)," out of bounds for TransientVector of length",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.cnt)].join('')));
|
|
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("assoc! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ITransientVector$_pop_BANG_$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(self__.root.edit){
|
|
if((self__.cnt === (0))){
|
|
throw (new Error("Can't pop empty vector"));
|
|
} else {
|
|
if(((1) === self__.cnt)){
|
|
self__.cnt = (0);
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
if((((self__.cnt - (1)) & (31)) > (0))){
|
|
self__.cnt = (self__.cnt - (1));
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
var new_tail = cljs.core.unchecked_editable_array_for(tcoll__$1,(self__.cnt - (2)));
|
|
var new_root = (function (){var nr = cljs.core.tv_pop_tail(tcoll__$1,self__.shift,self__.root);
|
|
if((!((nr == null)))){
|
|
return nr;
|
|
} else {
|
|
return (new cljs.core.VectorNode(self__.root.edit,[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null]));
|
|
}
|
|
})();
|
|
if(((((5) < self__.shift)) && ((cljs.core.pv_aget(new_root,(1)) == null)))){
|
|
var new_root__$1 = cljs.core.tv_ensure_editable(self__.root.edit,cljs.core.pv_aget(new_root,(0)));
|
|
self__.root = new_root__$1;
|
|
|
|
self__.shift = (self__.shift - (5));
|
|
|
|
self__.cnt = (self__.cnt - (1));
|
|
|
|
self__.tail = new_tail;
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
self__.root = new_root;
|
|
|
|
self__.cnt = (self__.cnt - (1));
|
|
|
|
self__.tail = new_tail;
|
|
|
|
return tcoll__$1;
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("pop! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(self__.root.edit){
|
|
return self__.cnt;
|
|
} else {
|
|
throw (new Error("count after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (coll,n){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(self__.root.edit){
|
|
return (cljs.core.array_for(coll__$1,n)[(n & (31))]);
|
|
} else {
|
|
throw (new Error("nth after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (coll,n,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((((0) <= n)) && ((n < self__.cnt)))){
|
|
return coll__$1.cljs$core$IIndexed$_nth$arity$2(null,n);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(typeof k === 'number'){
|
|
return coll__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.call = (function() {
|
|
var G__2168 = null;
|
|
var G__2168__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2168__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2168 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2168__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2168__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2168.cljs$core$IFn$_invoke$arity$2 = G__2168__2;
|
|
G__2168.cljs$core$IFn$_invoke$arity$3 = G__2168__3;
|
|
return G__2168;
|
|
})()
|
|
;
|
|
|
|
cljs.core.TransientVector.prototype.apply = (function (self__,args2166){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2166)));
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.TransientVector.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.TransientVector.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$shift,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$root,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$tail,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.TransientVector.cljs$lang$type = true;
|
|
|
|
cljs.core.TransientVector.cljs$lang$ctorStr = "cljs.core/TransientVector";
|
|
|
|
cljs.core.TransientVector.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TransientVector");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TransientVector.
|
|
*/
|
|
cljs.core.__GT_TransientVector = (function cljs$core$__GT_TransientVector(cnt,shift,root,tail){
|
|
return (new cljs.core.TransientVector(cnt,shift,root,tail));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.PersistentQueueIter = (function (fseq,riter){
|
|
this.fseq = fseq;
|
|
this.riter = riter;
|
|
});
|
|
cljs.core.PersistentQueueIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var or__4047__auto__ = (((!((self__.fseq == null)))) && (cljs.core.seq(self__.fseq)));
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var and__4036__auto__ = (!((self__.riter == null)));
|
|
if(and__4036__auto__){
|
|
return self__.riter.hasNext();
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueueIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((!((self__.fseq == null)))){
|
|
var ret = cljs.core.first(self__.fseq);
|
|
self__.fseq = cljs.core.next(self__.fseq);
|
|
|
|
return ret;
|
|
} else {
|
|
if((((!((self__.riter == null)))) && (self__.riter.hasNext()))){
|
|
return self__.riter.next();
|
|
} else {
|
|
throw (new Error("No such element"));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueueIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.PersistentQueueIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$fseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$riter], null);
|
|
});
|
|
|
|
cljs.core.PersistentQueueIter.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentQueueIter.cljs$lang$ctorStr = "cljs.core/PersistentQueueIter";
|
|
|
|
cljs.core.PersistentQueueIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentQueueIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentQueueIter.
|
|
*/
|
|
cljs.core.__GT_PersistentQueueIter = (function cljs$core$__GT_PersistentQueueIter(fseq,riter){
|
|
return (new cljs.core.PersistentQueueIter(fseq,riter));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.PersistentQueueSeq = (function (meta,front,rear,__hash){
|
|
this.meta = meta;
|
|
this.front = front;
|
|
this.rear = rear;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 31850700;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.PersistentQueueSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.indexOf = (function() {
|
|
var G__2169 = null;
|
|
var G__2169__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2169__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2169 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2169__1.call(this,x);
|
|
case 2:
|
|
return G__2169__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2169.cljs$core$IFn$_invoke$arity$1 = G__2169__1;
|
|
G__2169.cljs$core$IFn$_invoke$arity$2 = G__2169__2;
|
|
return G__2169;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.lastIndexOf = (function() {
|
|
var G__2170 = null;
|
|
var G__2170__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2170__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2170 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2170__1.call(this,x);
|
|
case 2:
|
|
return G__2170__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2170.cljs$core$IFn$_invoke$arity$1 = G__2170__1;
|
|
G__2170.cljs$core$IFn$_invoke$arity$2 = G__2170__2;
|
|
return G__2170;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var temp__5455__auto__ = cljs.core.next(self__.front);
|
|
if(temp__5455__auto__){
|
|
var f1 = temp__5455__auto__;
|
|
return (new cljs.core.PersistentQueueSeq(self__.meta,f1,self__.rear,null));
|
|
} else {
|
|
if((!((self__.rear == null)))){
|
|
return (new cljs.core.PersistentQueueSeq(self__.meta,self__.rear,null,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.first(self__.front);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var temp__5455__auto__ = cljs.core.next(self__.front);
|
|
if(temp__5455__auto__){
|
|
var f1 = temp__5455__auto__;
|
|
return (new cljs.core.PersistentQueueSeq(self__.meta,f1,self__.rear,null));
|
|
} else {
|
|
if((self__.rear == null)){
|
|
return coll__$1.cljs$core$IEmptyableCollection$_empty$arity$1(null);
|
|
} else {
|
|
return (new cljs.core.PersistentQueueSeq(self__.meta,self__.rear,null,null));
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentQueueSeq(meta__$1,self__.front,self__.rear,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$front,cljs.core.cst$sym$rear,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentQueueSeq.cljs$lang$ctorStr = "cljs.core/PersistentQueueSeq";
|
|
|
|
cljs.core.PersistentQueueSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentQueueSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentQueueSeq.
|
|
*/
|
|
cljs.core.__GT_PersistentQueueSeq = (function cljs$core$__GT_PersistentQueueSeq(meta,front,rear,__hash){
|
|
return (new cljs.core.PersistentQueueSeq(meta,front,rear,__hash));
|
|
});
|
|
|
|
var G__2171_2174 = cljs.core.PersistentQueueSeq.prototype;
|
|
var G__2172_2175 = cljs.core.ITER_SYMBOL;
|
|
var G__2173_2176 = ((function (G__2171_2174,G__2172_2175){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2171_2174,G__2172_2175))
|
|
;
|
|
goog.object.set(G__2171_2174,G__2172_2175,G__2173_2176);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
*/
|
|
cljs.core.PersistentQueue = (function (meta,count,front,rear,__hash){
|
|
this.meta = meta;
|
|
this.count = count;
|
|
this.front = front;
|
|
this.rear = rear;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139264;
|
|
this.cljs$lang$protocol_mask$partition0$ = 31858766;
|
|
});
|
|
cljs.core.PersistentQueue.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.indexOf = (function() {
|
|
var G__2177 = null;
|
|
var G__2177__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2177__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2177 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2177__1.call(this,x);
|
|
case 2:
|
|
return G__2177__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2177.cljs$core$IFn$_invoke$arity$1 = G__2177__1;
|
|
G__2177.cljs$core$IFn$_invoke$arity$2 = G__2177__2;
|
|
return G__2177;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentQueue.prototype.lastIndexOf = (function() {
|
|
var G__2178 = null;
|
|
var G__2178__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(self__.count.cljs$core$IFn$_invoke$arity$1 ? self__.count.cljs$core$IFn$_invoke$arity$1(coll) : self__.count.call(null,coll)));
|
|
});
|
|
var G__2178__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2178 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2178__1.call(this,x);
|
|
case 2:
|
|
return G__2178__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2178.cljs$core$IFn$_invoke$arity$1 = G__2178__1;
|
|
G__2178.cljs$core$IFn$_invoke$arity$2 = G__2178__2;
|
|
return G__2178;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentQueueIter(self__.front,cljs.core._iterator(self__.rear)));
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentQueue(self__.meta,self__.count,self__.front,self__.rear,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.count;
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IStack$_peek$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.first(self__.front);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IStack$_pop$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.truth_(self__.front)){
|
|
var temp__5455__auto__ = cljs.core.next(self__.front);
|
|
if(temp__5455__auto__){
|
|
var f1 = temp__5455__auto__;
|
|
return (new cljs.core.PersistentQueue(self__.meta,(self__.count - (1)),f1,self__.rear,null));
|
|
} else {
|
|
return (new cljs.core.PersistentQueue(self__.meta,(self__.count - (1)),cljs.core.seq(self__.rear),cljs.core.PersistentVector.EMPTY,null));
|
|
}
|
|
} else {
|
|
return coll__$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentQueue.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.first(self__.front);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.rest(cljs.core.seq(coll__$1));
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var rear__$1 = cljs.core.seq(self__.rear);
|
|
if(cljs.core.truth_((function (){var or__4047__auto__ = self__.front;
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return rear__$1;
|
|
}
|
|
})())){
|
|
return (new cljs.core.PersistentQueueSeq(null,self__.front,cljs.core.seq(rear__$1),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentQueue(meta__$1,self__.count,self__.front,self__.rear,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.truth_(self__.front)){
|
|
return (new cljs.core.PersistentQueue(self__.meta,(self__.count + (1)),self__.front,cljs.core.conj.cljs$core$IFn$_invoke$arity$2((function (){var or__4047__auto__ = self__.rear;
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.PersistentVector.EMPTY;
|
|
}
|
|
})(),o),null));
|
|
} else {
|
|
return (new cljs.core.PersistentQueue(self__.meta,(self__.count + (1)),cljs.core.conj.cljs$core$IFn$_invoke$arity$2(self__.front,o),cljs.core.PersistentVector.EMPTY,null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentQueue.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$count,cljs.core.cst$sym$front,cljs.core.cst$sym$rear,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentQueue.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentQueue.cljs$lang$ctorStr = "cljs.core/PersistentQueue";
|
|
|
|
cljs.core.PersistentQueue.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentQueue");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentQueue.
|
|
*/
|
|
cljs.core.__GT_PersistentQueue = (function cljs$core$__GT_PersistentQueue(meta,count,front,rear,__hash){
|
|
return (new cljs.core.PersistentQueue(meta,count,front,rear,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentQueue.EMPTY = (new cljs.core.PersistentQueue(null,(0),null,cljs.core.PersistentVector.EMPTY,cljs.core.empty_ordered_hash));
|
|
var G__2179_2182 = cljs.core.PersistentQueue.prototype;
|
|
var G__2180_2183 = cljs.core.ITER_SYMBOL;
|
|
var G__2181_2184 = ((function (G__2179_2182,G__2180_2183){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2179_2182,G__2180_2183))
|
|
;
|
|
goog.object.set(G__2179_2182,G__2180_2183,G__2181_2184);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
*/
|
|
cljs.core.NeverEquiv = (function (){
|
|
this.cljs$lang$protocol_mask$partition0$ = 2097152;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.NeverEquiv.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.NeverEquiv.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (o,other){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
return false;
|
|
});
|
|
|
|
cljs.core.NeverEquiv.getBasis = (function (){
|
|
return cljs.core.PersistentVector.EMPTY;
|
|
});
|
|
|
|
cljs.core.NeverEquiv.cljs$lang$type = true;
|
|
|
|
cljs.core.NeverEquiv.cljs$lang$ctorStr = "cljs.core/NeverEquiv";
|
|
|
|
cljs.core.NeverEquiv.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/NeverEquiv");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/NeverEquiv.
|
|
*/
|
|
cljs.core.__GT_NeverEquiv = (function cljs$core$__GT_NeverEquiv(){
|
|
return (new cljs.core.NeverEquiv());
|
|
});
|
|
|
|
cljs.core.never_equiv = (new cljs.core.NeverEquiv());
|
|
/**
|
|
* Test map equivalence. Returns true if x equals y, otherwise returns false.
|
|
*/
|
|
cljs.core.equiv_map = (function cljs$core$equiv_map(x,y){
|
|
return cljs.core.boolean$(((((cljs.core.map_QMARK_(y)) && ((!(cljs.core.record_QMARK_(y))))))?(((cljs.core.count(x) === cljs.core.count(y)))?(((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition0$ & (1048576))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IKVReduce$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IKVReduce,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IKVReduce,x)))?cljs.core.reduce_kv((function (_,k,v){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(y,k,cljs.core.never_equiv),v)){
|
|
return true;
|
|
} else {
|
|
return cljs.core.reduced(false);
|
|
}
|
|
}),true,x):cljs.core.every_QMARK_((function (xkv){
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(y,cljs.core.first(xkv),cljs.core.never_equiv),cljs.core.second(xkv));
|
|
}),x)):null):null));
|
|
});
|
|
cljs.core.scan_array = (function cljs$core$scan_array(incr,k,array){
|
|
var len = array.length;
|
|
var i = (0);
|
|
while(true){
|
|
if((i < len)){
|
|
if((k === (array[i]))){
|
|
return i;
|
|
} else {
|
|
var G__2186 = (i + incr);
|
|
i = G__2186;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.obj_map_compare_keys = (function cljs$core$obj_map_compare_keys(a,b){
|
|
var a__$1 = cljs.core.hash(a);
|
|
var b__$1 = cljs.core.hash(b);
|
|
if((a__$1 < b__$1)){
|
|
return (-1);
|
|
} else {
|
|
if((a__$1 > b__$1)){
|
|
return (1);
|
|
} else {
|
|
return (0);
|
|
|
|
}
|
|
}
|
|
});
|
|
cljs.core.obj_map__GT_hash_map = (function cljs$core$obj_map__GT_hash_map(m,k,v){
|
|
var ks = m.keys;
|
|
var len = ks.length;
|
|
var so = m.strobj;
|
|
var mm = cljs.core.meta(m);
|
|
var i = (0);
|
|
var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
while(true){
|
|
if((i < len)){
|
|
var k__$1 = (ks[i]);
|
|
var G__2187 = (i + (1));
|
|
var G__2188 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,k__$1,goog.object.get(so,k__$1));
|
|
i = G__2187;
|
|
out = G__2188;
|
|
continue;
|
|
} else {
|
|
return cljs.core._with_meta(cljs.core.persistent_BANG_(cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,k,v)),mm);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.obj_clone = (function cljs$core$obj_clone(obj,ks){
|
|
var new_obj = {};
|
|
var l = ks.length;
|
|
var i_2194 = (0);
|
|
while(true){
|
|
if((i_2194 < l)){
|
|
var k_2195 = (ks[i_2194]);
|
|
var G__2191_2196 = new_obj;
|
|
var G__2192_2197 = k_2195;
|
|
var G__2193_2198 = goog.object.get(obj,k_2195);
|
|
goog.object.set(G__2191_2196,G__2192_2197,G__2193_2198);
|
|
|
|
var G__2199 = (i_2194 + (1));
|
|
i_2194 = G__2199;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return new_obj;
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEditableCollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.IMap}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.ObjMap = (function (meta,keys,strobj,update_count,__hash){
|
|
this.meta = meta;
|
|
this.keys = keys;
|
|
this.strobj = strobj;
|
|
this.update_count = update_count;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 16123663;
|
|
this.cljs$lang$protocol_mask$partition1$ = 4;
|
|
});
|
|
cljs.core.ObjMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((goog.isString(k)) && ((!((cljs.core.scan_array((1),k,self__.keys) == null)))))){
|
|
return (new cljs.core.MapEntry(k,(self__.strobj[k]),null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((goog.isString(k)) && ((!((cljs.core.scan_array((1),k,self__.keys) == null)))))){
|
|
return (self__.strobj[k]);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var len = self__.keys.length;
|
|
var keys__$1 = self__.keys.sort(cljs.core.obj_map_compare_keys);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if(cljs.core.seq(keys__$1)){
|
|
var k = cljs.core.first(keys__$1);
|
|
var init__$2 = (function (){var G__2202 = init__$1;
|
|
var G__2203 = k;
|
|
var G__2204 = (self__.strobj[k]);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2202,G__2203,G__2204) : f.call(null,G__2202,G__2203,G__2204));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return cljs.core.deref(init__$2);
|
|
} else {
|
|
var G__2205 = cljs.core.rest(keys__$1);
|
|
var G__2206 = init__$2;
|
|
keys__$1 = G__2205;
|
|
init__$1 = G__2206;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.keys.length;
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_map(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.transient$(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentHashMap.EMPTY,coll__$1));
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.ObjMap.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((goog.isString(k)) && ((!((cljs.core.scan_array((1),k,self__.keys) == null)))))){
|
|
var new_keys = cljs.core.aclone(self__.keys);
|
|
var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
|
|
new_keys.splice(cljs.core.scan_array((1),k,new_keys),(1));
|
|
|
|
delete new_strobj[k];
|
|
|
|
return (new cljs.core.ObjMap(self__.meta,new_keys,new_strobj,(self__.update_count + (1)),null));
|
|
} else {
|
|
return coll__$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(goog.isString(k)){
|
|
if((((self__.update_count > cljs.core.ObjMap.HASHMAP_THRESHOLD)) || ((self__.keys.length >= cljs.core.ObjMap.HASHMAP_THRESHOLD)))){
|
|
return cljs.core.obj_map__GT_hash_map(coll__$1,k,v);
|
|
} else {
|
|
if((!((cljs.core.scan_array((1),k,self__.keys) == null)))){
|
|
var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
|
|
goog.object.set(new_strobj,k,v);
|
|
|
|
return (new cljs.core.ObjMap(self__.meta,self__.keys,new_strobj,(self__.update_count + (1)),null));
|
|
} else {
|
|
var new_strobj = cljs.core.obj_clone(self__.strobj,self__.keys);
|
|
var new_keys = cljs.core.aclone(self__.keys);
|
|
goog.object.set(new_strobj,k,v);
|
|
|
|
new_keys.push(k);
|
|
|
|
return (new cljs.core.ObjMap(self__.meta,new_keys,new_strobj,(self__.update_count + (1)),null));
|
|
}
|
|
}
|
|
} else {
|
|
return cljs.core.obj_map__GT_hash_map(coll__$1,k,v);
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((goog.isString(k)) && ((!((cljs.core.scan_array((1),k,self__.keys) == null)))))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.keys.length > (0))){
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (coll__$1){
|
|
return (function (p1__2200_SHARP_){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[p1__2200_SHARP_,(self__.strobj[p1__2200_SHARP_])],null));
|
|
});})(coll__$1))
|
|
,self__.keys.sort(cljs.core.obj_map_compare_keys));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.ObjMap(meta__$1,self__.keys,self__.strobj,self__.update_count,self__.__hash));
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.vector_QMARK_(entry)){
|
|
return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
|
|
} else {
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,coll__$1,entry);
|
|
}
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.call = (function() {
|
|
var G__2207 = null;
|
|
var G__2207__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2207__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2207 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2207__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2207__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2207.cljs$core$IFn$_invoke$arity$2 = G__2207__2;
|
|
G__2207.cljs$core$IFn$_invoke$arity$3 = G__2207__3;
|
|
return G__2207;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ObjMap.prototype.apply = (function (self__,args2201){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2201)));
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.ObjMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$keys,cljs.core.cst$sym$strobj,cljs.core.cst$sym$update_DASH_count,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ObjMap.cljs$lang$type = true;
|
|
|
|
cljs.core.ObjMap.cljs$lang$ctorStr = "cljs.core/ObjMap";
|
|
|
|
cljs.core.ObjMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ObjMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ObjMap.
|
|
*/
|
|
cljs.core.__GT_ObjMap = (function cljs$core$__GT_ObjMap(meta,keys,strobj,update_count,__hash){
|
|
return (new cljs.core.ObjMap(meta,keys,strobj,update_count,__hash));
|
|
});
|
|
|
|
cljs.core.ObjMap.EMPTY = (new cljs.core.ObjMap(null,[],{},(0),cljs.core.empty_unordered_hash));
|
|
cljs.core.ObjMap.HASHMAP_THRESHOLD = (8);
|
|
cljs.core.ObjMap.fromObject = (function (ks,obj){
|
|
return (new cljs.core.ObjMap(null,ks,obj,(0),null));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.RecordIter = (function (i,record,base_count,fields,ext_map_iter){
|
|
this.i = i;
|
|
this.record = record;
|
|
this.base_count = base_count;
|
|
this.fields = fields;
|
|
this.ext_map_iter = ext_map_iter;
|
|
});
|
|
cljs.core.RecordIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var or__4047__auto__ = (self__.i < self__.base_count);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return self__.ext_map_iter.hasNext();
|
|
}
|
|
});
|
|
|
|
cljs.core.RecordIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((self__.i < self__.base_count)){
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$2(self__.fields,self__.i);
|
|
self__.i = (self__.i + (1));
|
|
|
|
return (new cljs.core.MapEntry(k,cljs.core._lookup.cljs$core$IFn$_invoke$arity$2(self__.record,k),null));
|
|
} else {
|
|
return self__.ext_map_iter.next();
|
|
}
|
|
});
|
|
|
|
cljs.core.RecordIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.RecordIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$record,cljs.core.cst$sym$base_DASH_count,cljs.core.cst$sym$fields,cljs.core.cst$sym$ext_DASH_map_DASH_iter], null);
|
|
});
|
|
|
|
cljs.core.RecordIter.cljs$lang$type = true;
|
|
|
|
cljs.core.RecordIter.cljs$lang$ctorStr = "cljs.core/RecordIter";
|
|
|
|
cljs.core.RecordIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/RecordIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/RecordIter.
|
|
*/
|
|
cljs.core.__GT_RecordIter = (function cljs$core$__GT_RecordIter(i,record,base_count,fields,ext_map_iter){
|
|
return (new cljs.core.RecordIter(i,record,base_count,fields,ext_map_iter));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ES6EntriesIterator = (function (s){
|
|
this.s = s;
|
|
});
|
|
cljs.core.ES6EntriesIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((!((self__.s == null)))){
|
|
var vec__2210 = cljs.core.first(self__.s);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2210,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2210,(1),null);
|
|
self__.s = cljs.core.next(self__.s);
|
|
|
|
return ({"value": [k,v], "done": false});
|
|
} else {
|
|
return ({"value": null, "done": true});
|
|
}
|
|
});
|
|
|
|
cljs.core.ES6EntriesIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ES6EntriesIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.ES6EntriesIterator.cljs$lang$ctorStr = "cljs.core/ES6EntriesIterator";
|
|
|
|
cljs.core.ES6EntriesIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ES6EntriesIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ES6EntriesIterator.
|
|
*/
|
|
cljs.core.__GT_ES6EntriesIterator = (function cljs$core$__GT_ES6EntriesIterator(s){
|
|
return (new cljs.core.ES6EntriesIterator(s));
|
|
});
|
|
|
|
cljs.core.es6_entries_iterator = (function cljs$core$es6_entries_iterator(coll){
|
|
return (new cljs.core.ES6EntriesIterator(cljs.core.seq(coll)));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ES6SetEntriesIterator = (function (s){
|
|
this.s = s;
|
|
});
|
|
cljs.core.ES6SetEntriesIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((!((self__.s == null)))){
|
|
var x = cljs.core.first(self__.s);
|
|
self__.s = cljs.core.next(self__.s);
|
|
|
|
return ({"value": [x,x], "done": false});
|
|
} else {
|
|
return ({"value": null, "done": true});
|
|
}
|
|
});
|
|
|
|
cljs.core.ES6SetEntriesIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$s,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ES6SetEntriesIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.ES6SetEntriesIterator.cljs$lang$ctorStr = "cljs.core/ES6SetEntriesIterator";
|
|
|
|
cljs.core.ES6SetEntriesIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ES6SetEntriesIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ES6SetEntriesIterator.
|
|
*/
|
|
cljs.core.__GT_ES6SetEntriesIterator = (function cljs$core$__GT_ES6SetEntriesIterator(s){
|
|
return (new cljs.core.ES6SetEntriesIterator(s));
|
|
});
|
|
|
|
cljs.core.es6_set_entries_iterator = (function cljs$core$es6_set_entries_iterator(coll){
|
|
return (new cljs.core.ES6SetEntriesIterator(cljs.core.seq(coll)));
|
|
});
|
|
cljs.core.array_index_of_nil_QMARK_ = (function cljs$core$array_index_of_nil_QMARK_(arr){
|
|
var len = arr.length;
|
|
var i = (0);
|
|
while(true){
|
|
if((len <= i)){
|
|
return (-1);
|
|
} else {
|
|
if(((arr[i]) == null)){
|
|
return i;
|
|
} else {
|
|
var G__2213 = (i + (2));
|
|
i = G__2213;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_index_of_keyword_QMARK_ = (function cljs$core$array_index_of_keyword_QMARK_(arr,k){
|
|
var len = arr.length;
|
|
var kstr = k.fqn;
|
|
var i = (0);
|
|
while(true){
|
|
if((len <= i)){
|
|
return (-1);
|
|
} else {
|
|
if(((((arr[i]) instanceof cljs.core.Keyword)) && ((kstr === (arr[i]).fqn)))){
|
|
return i;
|
|
} else {
|
|
var G__2214 = (i + (2));
|
|
i = G__2214;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_index_of_symbol_QMARK_ = (function cljs$core$array_index_of_symbol_QMARK_(arr,k){
|
|
var len = arr.length;
|
|
var kstr = k.str;
|
|
var i = (0);
|
|
while(true){
|
|
if((len <= i)){
|
|
return (-1);
|
|
} else {
|
|
if(((((arr[i]) instanceof cljs.core.Symbol)) && ((kstr === (arr[i]).str)))){
|
|
return i;
|
|
} else {
|
|
var G__2215 = (i + (2));
|
|
i = G__2215;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_index_of_identical_QMARK_ = (function cljs$core$array_index_of_identical_QMARK_(arr,k){
|
|
var len = arr.length;
|
|
var i = (0);
|
|
while(true){
|
|
if((len <= i)){
|
|
return (-1);
|
|
} else {
|
|
if((k === (arr[i]))){
|
|
return i;
|
|
} else {
|
|
var G__2216 = (i + (2));
|
|
i = G__2216;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_index_of_equiv_QMARK_ = (function cljs$core$array_index_of_equiv_QMARK_(arr,k){
|
|
var len = arr.length;
|
|
var i = (0);
|
|
while(true){
|
|
if((len <= i)){
|
|
return (-1);
|
|
} else {
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(k,(arr[i]))){
|
|
return i;
|
|
} else {
|
|
var G__2217 = (i + (2));
|
|
i = G__2217;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.array_index_of = (function cljs$core$array_index_of(arr,k){
|
|
if((k instanceof cljs.core.Keyword)){
|
|
return cljs.core.array_index_of_keyword_QMARK_(arr,k);
|
|
} else {
|
|
if(((goog.isString(k)) || (typeof k === 'number'))){
|
|
return cljs.core.array_index_of_identical_QMARK_(arr,k);
|
|
} else {
|
|
if((k instanceof cljs.core.Symbol)){
|
|
return cljs.core.array_index_of_symbol_QMARK_(arr,k);
|
|
} else {
|
|
if((k == null)){
|
|
return cljs.core.array_index_of_nil_QMARK_(arr);
|
|
} else {
|
|
return cljs.core.array_index_of_equiv_QMARK_(arr,k);
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.array_map_index_of = (function cljs$core$array_map_index_of(m,k){
|
|
return cljs.core.array_index_of(m.arr,k);
|
|
});
|
|
cljs.core.array_extend_kv = (function cljs$core$array_extend_kv(arr,k,v){
|
|
var l = arr.length;
|
|
var narr = (new Array((l + (2))));
|
|
var i_2218 = (0);
|
|
while(true){
|
|
if((i_2218 < l)){
|
|
(narr[i_2218] = (arr[i_2218]));
|
|
|
|
var G__2219 = (i_2218 + (1));
|
|
i_2218 = G__2219;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
(narr[l] = k);
|
|
|
|
(narr[(l + (1))] = v);
|
|
|
|
return narr;
|
|
});
|
|
cljs.core.array_map_extend_kv = (function cljs$core$array_map_extend_kv(m,k,v){
|
|
return cljs.core.array_extend_kv(m.arr,k,v);
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IVector}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IMapEntry}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.MapEntry = (function (key,val,__hash){
|
|
this.key = key;
|
|
this.val = val;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 166619935;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.MapEntry.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
var G__2221 = k;
|
|
switch (G__2221) {
|
|
case (0):
|
|
return (new cljs.core.MapEntry((0),self__.key,null));
|
|
|
|
break;
|
|
case (1):
|
|
return (new cljs.core.MapEntry((1),self__.val,null));
|
|
|
|
break;
|
|
default:
|
|
return null;
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.indexOf = (function() {
|
|
var G__2223 = null;
|
|
var G__2223__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2223__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2223 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2223__1.call(this,x);
|
|
case 2:
|
|
return G__2223__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2223.cljs$core$IFn$_invoke$arity$1 = G__2223__1;
|
|
G__2223.cljs$core$IFn$_invoke$arity$2 = G__2223__2;
|
|
return G__2223;
|
|
})()
|
|
;
|
|
|
|
cljs.core.MapEntry.prototype.lastIndexOf = (function() {
|
|
var G__2224 = null;
|
|
var G__2224__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2224__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2224 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2224__1.call(this,x);
|
|
case 2:
|
|
return G__2224__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2224.cljs$core$IFn$_invoke$arity$1 = G__2224__1;
|
|
G__2224.cljs$core$IFn$_invoke$arity$2 = G__2224__2;
|
|
return G__2224;
|
|
})()
|
|
;
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (2);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.key;
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (((k === (0))) || ((k === (1))));
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.call = (function() {
|
|
var G__2225 = null;
|
|
var G__2225__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
var G__2225__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
G__2225 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2225__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2225__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2225.cljs$core$IFn$_invoke$arity$2 = G__2225__2;
|
|
G__2225.cljs$core$IFn$_invoke$arity$3 = G__2225__3;
|
|
return G__2225;
|
|
})()
|
|
;
|
|
|
|
cljs.core.MapEntry.prototype.apply = (function (self__,args2220){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2220)));
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.MapEntry.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.MapEntry.cljs$lang$type = true;
|
|
|
|
cljs.core.MapEntry.cljs$lang$ctorStr = "cljs.core/MapEntry";
|
|
|
|
cljs.core.MapEntry.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/MapEntry");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/MapEntry.
|
|
*/
|
|
cljs.core.__GT_MapEntry = (function cljs$core$__GT_MapEntry(key,val,__hash){
|
|
return (new cljs.core.MapEntry(key,val,__hash));
|
|
});
|
|
|
|
/**
|
|
* Returns true if x satisfies IMapEntry
|
|
*/
|
|
cljs.core.map_entry_QMARK_ = (function cljs$core$map_entry_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if((((x.cljs$lang$protocol_mask$partition0$ & (2048))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMapEntry$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.PersistentArrayMapSeq = (function (arr,i,_meta){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
this._meta = _meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374990;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.PersistentArrayMapSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.indexOf = (function() {
|
|
var G__2227 = null;
|
|
var G__2227__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2227__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2227 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2227__1.call(this,x);
|
|
case 2:
|
|
return G__2227__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2227.cljs$core$IFn$_invoke$arity$1 = G__2227__1;
|
|
G__2227.cljs$core$IFn$_invoke$arity$2 = G__2227__2;
|
|
return G__2227;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.lastIndexOf = (function() {
|
|
var G__2228 = null;
|
|
var G__2228__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2228__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2228 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2228__1.call(this,x);
|
|
case 2:
|
|
return G__2228__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2228.cljs$core$IFn$_invoke$arity$1 = G__2228__1;
|
|
G__2228.cljs$core$IFn$_invoke$arity$2 = G__2228__2;
|
|
return G__2228;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__._meta;
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.i < (self__.arr.length - (2)))){
|
|
return (new cljs.core.PersistentArrayMapSeq(self__.arr,(self__.i + (2)),self__._meta));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return ((self__.arr.length - self__.i) / (2));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.hash_ordered_coll(coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.MapEntry((self__.arr[self__.i]),(self__.arr[(self__.i + (1))]),null));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.i < (self__.arr.length - (2)))){
|
|
return (new cljs.core.PersistentArrayMapSeq(self__.arr,(self__.i + (2)),self__._meta));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentArrayMapSeq(self__.arr,self__.i,new_meta));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.cst$sym$i,cljs.core.cst$sym$_meta], null);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentArrayMapSeq.cljs$lang$ctorStr = "cljs.core/PersistentArrayMapSeq";
|
|
|
|
cljs.core.PersistentArrayMapSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentArrayMapSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentArrayMapSeq.
|
|
*/
|
|
cljs.core.__GT_PersistentArrayMapSeq = (function cljs$core$__GT_PersistentArrayMapSeq(arr,i,_meta){
|
|
return (new cljs.core.PersistentArrayMapSeq(arr,i,_meta));
|
|
});
|
|
|
|
var G__2229_2232 = cljs.core.PersistentArrayMapSeq.prototype;
|
|
var G__2230_2233 = cljs.core.ITER_SYMBOL;
|
|
var G__2231_2234 = ((function (G__2229_2232,G__2230_2233){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2229_2232,G__2230_2233))
|
|
;
|
|
goog.object.set(G__2229_2232,G__2230_2233,G__2231_2234);
|
|
cljs.core.persistent_array_map_seq = (function cljs$core$persistent_array_map_seq(arr,i,_meta){
|
|
if((i <= (arr.length - (2)))){
|
|
return (new cljs.core.PersistentArrayMapSeq(arr,i,_meta));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.PersistentArrayMapIterator = (function (arr,i,cnt){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
this.cnt = cnt;
|
|
});
|
|
cljs.core.PersistentArrayMapIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.i < self__.cnt);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = (new cljs.core.MapEntry((self__.arr[self__.i]),(self__.arr[(self__.i + (1))]),null));
|
|
self__.i = (self__.i + (2));
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$cnt], null);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentArrayMapIterator.cljs$lang$ctorStr = "cljs.core/PersistentArrayMapIterator";
|
|
|
|
cljs.core.PersistentArrayMapIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentArrayMapIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentArrayMapIterator.
|
|
*/
|
|
cljs.core.__GT_PersistentArrayMapIterator = (function cljs$core$__GT_PersistentArrayMapIterator(arr,i,cnt){
|
|
return (new cljs.core.PersistentArrayMapIterator(arr,i,cnt));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEditableCollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.IMap}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.PersistentArrayMap = (function (meta,cnt,arr,__hash){
|
|
this.meta = meta;
|
|
this.cnt = cnt;
|
|
this.arr = arr;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 16647951;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139268;
|
|
});
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var idx = cljs.core.array_map_index_of(coll__$1,k);
|
|
if((idx === (-1))){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.MapEntry((self__.arr[idx]),(self__.arr[(idx + (1))]),null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.keys = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.keys(coll));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.entries = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.values = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.vals(coll));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.has = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.contains_QMARK_(coll,k);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.get = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.forEach = (function (f){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var seq__2236 = cljs.core.seq(coll);
|
|
var chunk__2237 = null;
|
|
var count__2238 = (0);
|
|
var i__2239 = (0);
|
|
while(true){
|
|
if((i__2239 < count__2238)){
|
|
var vec__2240 = chunk__2237.cljs$core$IIndexed$_nth$arity$2(null,i__2239);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2240,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2240,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2252 = seq__2236;
|
|
var G__2253 = chunk__2237;
|
|
var G__2254 = count__2238;
|
|
var G__2255 = (i__2239 + (1));
|
|
seq__2236 = G__2252;
|
|
chunk__2237 = G__2253;
|
|
count__2238 = G__2254;
|
|
i__2239 = G__2255;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2236);
|
|
if(temp__5457__auto__){
|
|
var seq__2236__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2236__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2236__$1);
|
|
var G__2256 = cljs.core.chunk_rest(seq__2236__$1);
|
|
var G__2257 = c__4461__auto__;
|
|
var G__2258 = cljs.core.count(c__4461__auto__);
|
|
var G__2259 = (0);
|
|
seq__2236 = G__2256;
|
|
chunk__2237 = G__2257;
|
|
count__2238 = G__2258;
|
|
i__2239 = G__2259;
|
|
continue;
|
|
} else {
|
|
var vec__2243 = cljs.core.first(seq__2236__$1);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2243,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2243,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2260 = cljs.core.next(seq__2236__$1);
|
|
var G__2261 = null;
|
|
var G__2262 = (0);
|
|
var G__2263 = (0);
|
|
seq__2236 = G__2260;
|
|
chunk__2237 = G__2261;
|
|
count__2238 = G__2262;
|
|
i__2239 = G__2263;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var idx = cljs.core.array_map_index_of(coll__$1,k);
|
|
if((idx === (-1))){
|
|
return not_found;
|
|
} else {
|
|
return (self__.arr[(idx + (1))]);
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var len = self__.arr.length;
|
|
var i = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < len)){
|
|
var init__$2 = (function (){var G__2246 = init__$1;
|
|
var G__2247 = (self__.arr[i]);
|
|
var G__2248 = (self__.arr[(i + (1))]);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2246,G__2247,G__2248) : f.call(null,G__2246,G__2247,G__2248));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return cljs.core.deref(init__$2);
|
|
} else {
|
|
var G__2264 = (i + (2));
|
|
var G__2265 = init__$2;
|
|
i = G__2264;
|
|
init__$1 = G__2265;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return (new cljs.core.PersistentArrayMapIterator(self__.arr,(0),(self__.cnt * (2))));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentArrayMap(self__.meta,self__.cnt,self__.arr,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.cnt;
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(((cljs.core.map_QMARK_(other)) && ((!(cljs.core.record_QMARK_(other)))))){
|
|
var alen = self__.arr.length;
|
|
var other__$1 = other;
|
|
if((self__.cnt === other__$1.cljs$core$ICounted$_count$arity$1(null))){
|
|
var i = (0);
|
|
while(true){
|
|
if((i < alen)){
|
|
var v = other__$1.cljs$core$ILookup$_lookup$arity$3(null,(self__.arr[i]),cljs.core.lookup_sentinel);
|
|
if((!((v === cljs.core.lookup_sentinel)))){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((self__.arr[(i + (1))]),v)){
|
|
var G__2266 = (i + (2));
|
|
i = G__2266;
|
|
continue;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.TransientArrayMap({},self__.arr.length,cljs.core.aclone(self__.arr)));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentArrayMap.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$2(coll__$1,f);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.iter_reduce.cljs$core$IFn$_invoke$arity$3(coll__$1,f,start);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var idx = cljs.core.array_map_index_of(coll__$1,k);
|
|
if((idx >= (0))){
|
|
var len = self__.arr.length;
|
|
var new_len = (len - (2));
|
|
if((new_len === (0))){
|
|
return coll__$1.cljs$core$IEmptyableCollection$_empty$arity$1(null);
|
|
} else {
|
|
var new_arr = (new Array(new_len));
|
|
var s = (0);
|
|
var d = (0);
|
|
while(true){
|
|
if((s >= len)){
|
|
return (new cljs.core.PersistentArrayMap(self__.meta,(self__.cnt - (1)),new_arr,null));
|
|
} else {
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(k,(self__.arr[s]))){
|
|
var G__2267 = (s + (2));
|
|
var G__2268 = d;
|
|
s = G__2267;
|
|
d = G__2268;
|
|
continue;
|
|
} else {
|
|
(new_arr[d] = (self__.arr[s]));
|
|
|
|
(new_arr[(d + (1))] = (self__.arr[(s + (1))]));
|
|
|
|
var G__2269 = (s + (2));
|
|
var G__2270 = (d + (2));
|
|
s = G__2269;
|
|
d = G__2270;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
} else {
|
|
return coll__$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var idx = cljs.core.array_map_index_of(coll__$1,k);
|
|
if((idx === (-1))){
|
|
if((self__.cnt < cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD)){
|
|
var arr__$1 = cljs.core.array_map_extend_kv(coll__$1,k,v);
|
|
return (new cljs.core.PersistentArrayMap(self__.meta,(self__.cnt + (1)),arr__$1,null));
|
|
} else {
|
|
return cljs.core._with_meta(cljs.core._assoc(cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentHashMap.EMPTY,coll__$1),k,v),self__.meta);
|
|
}
|
|
} else {
|
|
if((v === (self__.arr[(idx + (1))]))){
|
|
return coll__$1;
|
|
} else {
|
|
var arr__$1 = (function (){var G__2251 = cljs.core.aclone(self__.arr);
|
|
(G__2251[(idx + (1))] = v);
|
|
|
|
return G__2251;
|
|
})();
|
|
return (new cljs.core.PersistentArrayMap(self__.meta,self__.cnt,arr__$1,null));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (!((cljs.core.array_map_index_of(coll__$1,k) === (-1))));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.persistent_array_map_seq(self__.arr,(0),null);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentArrayMap(meta__$1,self__.cnt,self__.arr,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.vector_QMARK_(entry)){
|
|
return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
|
|
} else {
|
|
var ret = coll__$1;
|
|
var es = cljs.core.seq(entry);
|
|
while(true){
|
|
if((es == null)){
|
|
return ret;
|
|
} else {
|
|
var e = cljs.core.first(es);
|
|
if(cljs.core.vector_QMARK_(e)){
|
|
var G__2271 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
|
|
var G__2272 = cljs.core.next(es);
|
|
ret = G__2271;
|
|
es = G__2272;
|
|
continue;
|
|
} else {
|
|
throw (new Error("conj on a map takes map entries or seqables of map entries"));
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.call = (function() {
|
|
var G__2273 = null;
|
|
var G__2273__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2273__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2273 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2273__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2273__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2273.cljs$core$IFn$_invoke$arity$2 = G__2273__2;
|
|
G__2273.cljs$core$IFn$_invoke$arity$3 = G__2273__3;
|
|
return G__2273;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentArrayMap.prototype.apply = (function (self__,args2235){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2235)));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentArrayMap.cljs$lang$ctorStr = "cljs.core/PersistentArrayMap";
|
|
|
|
cljs.core.PersistentArrayMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentArrayMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentArrayMap.
|
|
*/
|
|
cljs.core.__GT_PersistentArrayMap = (function cljs$core$__GT_PersistentArrayMap(meta,cnt,arr,__hash){
|
|
return (new cljs.core.PersistentArrayMap(meta,cnt,arr,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.EMPTY = (new cljs.core.PersistentArrayMap(null,(0),[],cljs.core.empty_unordered_hash));
|
|
cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD = (8);
|
|
cljs.core.PersistentArrayMap.fromArray = (function (arr,no_clone,no_check){
|
|
var arr__$1 = ((no_clone)?arr:cljs.core.aclone(arr));
|
|
var arr__$2 = ((no_check)?arr__$1:(function (){var ret = [];
|
|
var i_2274 = (0);
|
|
while(true){
|
|
if((i_2274 < arr__$1.length)){
|
|
var k_2275 = (arr__$1[i_2274]);
|
|
var v_2276 = (arr__$1[(i_2274 + (1))]);
|
|
var idx_2277 = cljs.core.array_index_of(ret,k_2275);
|
|
if((idx_2277 === (-1))){
|
|
ret.push(k_2275);
|
|
|
|
ret.push(v_2276);
|
|
} else {
|
|
}
|
|
|
|
var G__2278 = (i_2274 + (2));
|
|
i_2274 = G__2278;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return ret;
|
|
})());
|
|
var cnt = (arr__$2.length / (2));
|
|
return (new cljs.core.PersistentArrayMap(null,cnt,arr__$2,null));
|
|
});
|
|
cljs.core.PersistentArrayMap.createWithCheck = (function (arr){
|
|
var ret = [];
|
|
var i_2280 = (0);
|
|
while(true){
|
|
if((i_2280 < arr.length)){
|
|
var k_2281 = (arr[i_2280]);
|
|
var v_2282 = (arr[(i_2280 + (1))]);
|
|
var idx_2283 = cljs.core.array_index_of(ret,k_2281);
|
|
if((idx_2283 === (-1))){
|
|
var G__2279_2284 = ret;
|
|
G__2279_2284.push(k_2281);
|
|
|
|
G__2279_2284.push(v_2282);
|
|
|
|
} else {
|
|
throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(k_2281)].join('')));
|
|
}
|
|
|
|
var G__2285 = (i_2280 + (2));
|
|
i_2280 = G__2285;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var cnt = (arr.length / (2));
|
|
return (new cljs.core.PersistentArrayMap(null,cnt,arr,null));
|
|
});
|
|
cljs.core.PersistentArrayMap.createAsIfByAssoc = (function (arr){
|
|
var ret = [];
|
|
var i_2287 = (0);
|
|
while(true){
|
|
if((i_2287 < arr.length)){
|
|
var k_2288 = (arr[i_2287]);
|
|
var v_2289 = (arr[(i_2287 + (1))]);
|
|
var idx_2290 = cljs.core.array_index_of(ret,k_2288);
|
|
if((idx_2290 === (-1))){
|
|
var G__2286_2291 = ret;
|
|
G__2286_2291.push(k_2288);
|
|
|
|
G__2286_2291.push(v_2289);
|
|
|
|
} else {
|
|
(ret[(idx_2290 + (1))] = v_2289);
|
|
}
|
|
|
|
var G__2292 = (i_2287 + (2));
|
|
i_2287 = G__2292;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return (new cljs.core.PersistentArrayMap(null,(ret.length / (2)),ret,null));
|
|
});
|
|
var G__2293_2296 = cljs.core.PersistentArrayMap.prototype;
|
|
var G__2294_2297 = cljs.core.ITER_SYMBOL;
|
|
var G__2295_2298 = ((function (G__2293_2296,G__2294_2297){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2293_2296,G__2294_2297))
|
|
;
|
|
goog.object.set(G__2293_2296,G__2294_2297,G__2295_2298);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ITransientMap}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ITransientCollection}
|
|
* @implements {cljs.core.ITransientAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.TransientArrayMap = (function (editable_QMARK_,len,arr){
|
|
this.editable_QMARK_ = editable_QMARK_;
|
|
this.len = len;
|
|
this.arr = arr;
|
|
this.cljs$lang$protocol_mask$partition0$ = 259;
|
|
this.cljs$lang$protocol_mask$partition1$ = 56;
|
|
});
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
return cljs.core.quot(self__.len,(2));
|
|
} else {
|
|
throw (new Error("count after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,k){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,k,not_found){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
var idx = cljs.core.array_map_index_of(tcoll__$1,k);
|
|
if((idx === (-1))){
|
|
return not_found;
|
|
} else {
|
|
return (self__.arr[(idx + (1))]);
|
|
}
|
|
} else {
|
|
throw (new Error("lookup after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
if(cljs.core.map_entry_QMARK_(o)){
|
|
return tcoll__$1.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,cljs.core.key(o),cljs.core.val(o));
|
|
} else {
|
|
if(cljs.core.vector_QMARK_(o)){
|
|
return tcoll__$1.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((0)) : o.call(null,(0))),(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((1)) : o.call(null,(1))));
|
|
} else {
|
|
var es = cljs.core.seq(o);
|
|
var tcoll__$2 = tcoll__$1;
|
|
while(true){
|
|
var temp__5455__auto__ = cljs.core.first(es);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var e = temp__5455__auto__;
|
|
var G__2301 = cljs.core.next(es);
|
|
var G__2302 = tcoll__$2.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,cljs.core.key(e),cljs.core.val(e));
|
|
es = G__2301;
|
|
tcoll__$2 = G__2302;
|
|
continue;
|
|
} else {
|
|
return tcoll__$2;
|
|
}
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("conj! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
self__.editable_QMARK_ = false;
|
|
|
|
return (new cljs.core.PersistentArrayMap(null,cljs.core.quot(self__.len,(2)),self__.arr,null));
|
|
} else {
|
|
throw (new Error("persistent! called twice"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
var idx = cljs.core.array_map_index_of(tcoll__$1,key);
|
|
if((idx === (-1))){
|
|
if(((self__.len + (2)) <= ((2) * cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD))){
|
|
self__.len = (self__.len + (2));
|
|
|
|
self__.arr.push(key);
|
|
|
|
self__.arr.push(val);
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.array__GT_transient_hash_map(self__.len,self__.arr),key,val);
|
|
}
|
|
} else {
|
|
if((val === (self__.arr[(idx + (1))]))){
|
|
return tcoll__$1;
|
|
} else {
|
|
(self__.arr[(idx + (1))] = val);
|
|
|
|
return tcoll__$1;
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("assoc! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 = (function (tcoll,key){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if(cljs.core.truth_(self__.editable_QMARK_)){
|
|
var idx = cljs.core.array_map_index_of(tcoll__$1,key);
|
|
if((idx >= (0))){
|
|
(self__.arr[idx] = (self__.arr[(self__.len - (2))]));
|
|
|
|
(self__.arr[(idx + (1))] = (self__.arr[(self__.len - (1))]));
|
|
|
|
var G__2300_2303 = self__.arr;
|
|
G__2300_2303.pop();
|
|
|
|
G__2300_2303.pop();
|
|
|
|
|
|
self__.len = (self__.len - (2));
|
|
} else {
|
|
}
|
|
|
|
return tcoll__$1;
|
|
} else {
|
|
throw (new Error("dissoc! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.call = (function() {
|
|
var G__2304 = null;
|
|
var G__2304__2 = (function (self__,key){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,null);
|
|
});
|
|
var G__2304__3 = (function (self__,key,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
|
|
});
|
|
G__2304 = function(self__,key,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2304__2.call(this,self__,key);
|
|
case 3:
|
|
return G__2304__3.call(this,self__,key,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2304.cljs$core$IFn$_invoke$arity$2 = G__2304__2;
|
|
G__2304.cljs$core$IFn$_invoke$arity$3 = G__2304__3;
|
|
return G__2304;
|
|
})()
|
|
;
|
|
|
|
cljs.core.TransientArrayMap.prototype.apply = (function (self__,args2299){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2299)));
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (key){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,null);
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (key,not_found){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$editable_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$len,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$arr], null);
|
|
});
|
|
|
|
cljs.core.TransientArrayMap.cljs$lang$type = true;
|
|
|
|
cljs.core.TransientArrayMap.cljs$lang$ctorStr = "cljs.core/TransientArrayMap";
|
|
|
|
cljs.core.TransientArrayMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TransientArrayMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TransientArrayMap.
|
|
*/
|
|
cljs.core.__GT_TransientArrayMap = (function cljs$core$__GT_TransientArrayMap(editable_QMARK_,len,arr){
|
|
return (new cljs.core.TransientArrayMap(editable_QMARK_,len,arr));
|
|
});
|
|
|
|
cljs.core.array__GT_transient_hash_map = (function cljs$core$array__GT_transient_hash_map(len,arr){
|
|
var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
var i = (0);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__2305 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,(arr[i]),(arr[(i + (1))]));
|
|
var G__2306 = (i + (2));
|
|
out = G__2305;
|
|
i = G__2306;
|
|
continue;
|
|
} else {
|
|
return out;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.Box = (function (val){
|
|
this.val = val;
|
|
});
|
|
|
|
cljs.core.Box.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Box.cljs$lang$type = true;
|
|
|
|
cljs.core.Box.cljs$lang$ctorStr = "cljs.core/Box";
|
|
|
|
cljs.core.Box.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Box");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Box.
|
|
*/
|
|
cljs.core.__GT_Box = (function cljs$core$__GT_Box(val){
|
|
return (new cljs.core.Box(val));
|
|
});
|
|
|
|
|
|
|
|
|
|
|
|
|
|
cljs.core.key_test = (function cljs$core$key_test(key,other){
|
|
if((key === other)){
|
|
return true;
|
|
} else {
|
|
if(cljs.core.keyword_identical_QMARK_(key,other)){
|
|
return true;
|
|
} else {
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(key,other);
|
|
|
|
}
|
|
}
|
|
});
|
|
cljs.core.mask = (function cljs$core$mask(hash,shift){
|
|
return ((hash >>> shift) & (31));
|
|
});
|
|
cljs.core.clone_and_set = (function cljs$core$clone_and_set(var_args){
|
|
var G__2308 = arguments.length;
|
|
switch (G__2308) {
|
|
case 3:
|
|
return cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3 = (function (arr,i,a){
|
|
var G__2309 = cljs.core.aclone(arr);
|
|
(G__2309[i] = a);
|
|
|
|
return G__2309;
|
|
});
|
|
|
|
cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5 = (function (arr,i,a,j,b){
|
|
var G__2310 = cljs.core.aclone(arr);
|
|
(G__2310[i] = a);
|
|
|
|
(G__2310[j] = b);
|
|
|
|
return G__2310;
|
|
});
|
|
|
|
cljs.core.clone_and_set.cljs$lang$maxFixedArity = 5;
|
|
|
|
cljs.core.remove_pair = (function cljs$core$remove_pair(arr,i){
|
|
var new_arr = (new Array((arr.length - (2))));
|
|
cljs.core.array_copy(arr,(0),new_arr,(0),((2) * i));
|
|
|
|
cljs.core.array_copy(arr,((2) * (i + (1))),new_arr,((2) * i),(new_arr.length - ((2) * i)));
|
|
|
|
return new_arr;
|
|
});
|
|
cljs.core.bitmap_indexed_node_index = (function cljs$core$bitmap_indexed_node_index(bitmap,bit){
|
|
return cljs.core.bit_count((bitmap & (bit - (1))));
|
|
});
|
|
cljs.core.bitpos = (function cljs$core$bitpos(hash,shift){
|
|
return ((1) << ((hash >>> shift) & 0x01f));
|
|
});
|
|
cljs.core.edit_and_set = (function cljs$core$edit_and_set(var_args){
|
|
var G__2313 = arguments.length;
|
|
switch (G__2313) {
|
|
case 4:
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
case 6:
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4 = (function (inode,edit,i,a){
|
|
var editable = inode.ensure_editable(edit);
|
|
(editable.arr[i] = a);
|
|
|
|
return editable;
|
|
});
|
|
|
|
cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6 = (function (inode,edit,i,a,j,b){
|
|
var editable = inode.ensure_editable(edit);
|
|
(editable.arr[i] = a);
|
|
|
|
(editable.arr[j] = b);
|
|
|
|
return editable;
|
|
});
|
|
|
|
cljs.core.edit_and_set.cljs$lang$maxFixedArity = 6;
|
|
|
|
cljs.core.inode_kv_reduce = (function cljs$core$inode_kv_reduce(arr,f,init){
|
|
var len = arr.length;
|
|
var i = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < len)){
|
|
var init__$2 = (function (){var k = (arr[i]);
|
|
if((!((k == null)))){
|
|
var G__2315 = init__$1;
|
|
var G__2316 = k;
|
|
var G__2317 = (arr[(i + (1))]);
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2315,G__2316,G__2317) : f.call(null,G__2315,G__2316,G__2317));
|
|
} else {
|
|
var node = (arr[(i + (1))]);
|
|
if((!((node == null)))){
|
|
return node.kv_reduce(f,init__$1);
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
}
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return init__$2;
|
|
} else {
|
|
var G__2318 = (i + (2));
|
|
var G__2319 = init__$2;
|
|
i = G__2318;
|
|
init__$1 = G__2319;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.NodeIterator = (function (arr,i,next_entry,next_iter){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
this.next_entry = next_entry;
|
|
this.next_iter = next_iter;
|
|
});
|
|
cljs.core.NodeIterator.prototype.advance = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
var len = self__.arr.length;
|
|
while(true){
|
|
if((self__.i < len)){
|
|
var key = (self__.arr[self__.i]);
|
|
var node_or_val = (self__.arr[(self__.i + (1))]);
|
|
var found = (((!((key == null))))?self__.next_entry = (new cljs.core.MapEntry(key,node_or_val,null)):(((!((node_or_val == null))))?(function (){var new_iter = cljs.core._iterator(node_or_val);
|
|
if(new_iter.hasNext()){
|
|
return self__.next_iter = new_iter;
|
|
} else {
|
|
return false;
|
|
}
|
|
})():false
|
|
));
|
|
self__.i = (self__.i + (2));
|
|
|
|
if(found){
|
|
return true;
|
|
} else {
|
|
continue;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
var or__4047__auto__ = (!((self__.next_entry == null)));
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (!((self__.next_iter == null)));
|
|
if(or__4047__auto____$1){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
return this$.advance();
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if((!((self__.next_entry == null)))){
|
|
var ret = self__.next_entry;
|
|
self__.next_entry = null;
|
|
|
|
return ret;
|
|
} else {
|
|
if((!((self__.next_iter == null)))){
|
|
var ret = self__.next_iter.next();
|
|
if(self__.next_iter.hasNext()){
|
|
} else {
|
|
self__.next_iter = null;
|
|
}
|
|
|
|
return ret;
|
|
} else {
|
|
if(this$.advance()){
|
|
return this$.next();
|
|
} else {
|
|
throw (new Error("No such element"));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeIterator.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.NodeIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_entry,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_iter,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.NodeIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.NodeIterator.cljs$lang$ctorStr = "cljs.core/NodeIterator";
|
|
|
|
cljs.core.NodeIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/NodeIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/NodeIterator.
|
|
*/
|
|
cljs.core.__GT_NodeIterator = (function cljs$core$__GT_NodeIterator(arr,i,next_entry,next_iter){
|
|
return (new cljs.core.NodeIterator(arr,i,next_entry,next_iter));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIterable}
|
|
*/
|
|
cljs.core.BitmapIndexedNode = (function (edit,bitmap,arr){
|
|
this.edit = edit;
|
|
this.bitmap = bitmap;
|
|
this.arr = arr;
|
|
this.cljs$lang$protocol_mask$partition1$ = 131072;
|
|
this.cljs$lang$protocol_mask$partition0$ = 0;
|
|
});
|
|
cljs.core.BitmapIndexedNode.prototype.ensure_editable = (function (e){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((e === self__.edit)){
|
|
return inode;
|
|
} else {
|
|
var n = cljs.core.bit_count(self__.bitmap);
|
|
var new_arr = (new Array((((n < (0)))?(4):((2) * (n + (1))))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * n));
|
|
|
|
return (new cljs.core.BitmapIndexedNode(e,self__.bitmap,new_arr));
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
if(((self__.bitmap & bit) === (0))){
|
|
return inode;
|
|
} else {
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
var n = val_or_node.inode_without_BANG_(edit__$1,(shift + (5)),hash,key,removed_leaf_QMARK_);
|
|
if((n === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
if((!((n == null)))){
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),n);
|
|
} else {
|
|
if((self__.bitmap === bit)){
|
|
return null;
|
|
} else {
|
|
return inode.edit_and_remove_pair(edit__$1,bit,idx);
|
|
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
removed_leaf_QMARK_.val = true;
|
|
|
|
return inode.edit_and_remove_pair(edit__$1,bit,idx);
|
|
} else {
|
|
return inode;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.edit_and_remove_pair = (function (e,bit,i){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((self__.bitmap === bit)){
|
|
return null;
|
|
} else {
|
|
var editable = inode.ensure_editable(e);
|
|
var earr = editable.arr;
|
|
var len = earr.length;
|
|
editable.bitmap = (bit ^ editable.bitmap);
|
|
|
|
cljs.core.array_copy(earr,((2) * (i + (1))),earr,((2) * i),(len - ((2) * (i + (1)))));
|
|
|
|
(earr[(len - (2))] = null);
|
|
|
|
(earr[(len - (1))] = null);
|
|
|
|
return editable;
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_seq = (function (){
|
|
var self__ = this;
|
|
var inode = this;
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.kv_reduce = (function (f,init){
|
|
var self__ = this;
|
|
var inode = this;
|
|
return cljs.core.inode_kv_reduce(self__.arr,f,init);
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
if(((self__.bitmap & bit) === (0))){
|
|
return not_found;
|
|
} else {
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
return val_or_node.inode_lookup((shift + (5)),hash,key,not_found);
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
return val_or_node;
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
if(((self__.bitmap & bit) === (0))){
|
|
var n = cljs.core.bit_count(self__.bitmap);
|
|
if((((2) * n) < self__.arr.length)){
|
|
var editable = inode.ensure_editable(edit__$1);
|
|
var earr = editable.arr;
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
cljs.core.array_copy_downward(earr,((2) * idx),earr,((2) * (idx + (1))),((2) * (n - idx)));
|
|
|
|
(earr[((2) * idx)] = key);
|
|
|
|
(earr[(((2) * idx) + (1))] = val);
|
|
|
|
editable.bitmap = (editable.bitmap | bit);
|
|
|
|
return editable;
|
|
} else {
|
|
if((n >= (16))){
|
|
var nodes = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
|
|
var jdx = ((hash >>> shift) & 0x01f);
|
|
(nodes[jdx] = cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_));
|
|
|
|
var i_2320 = (0);
|
|
var j_2321 = (0);
|
|
while(true){
|
|
if((i_2320 < (32))){
|
|
if((((self__.bitmap >>> i_2320) & (1)) === (0))){
|
|
var G__2322 = (i_2320 + (1));
|
|
var G__2323 = j_2321;
|
|
i_2320 = G__2322;
|
|
j_2321 = G__2323;
|
|
continue;
|
|
} else {
|
|
(nodes[i_2320] = (((!(((self__.arr[j_2321]) == null))))?cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),cljs.core.hash((self__.arr[j_2321])),(self__.arr[j_2321]),(self__.arr[(j_2321 + (1))]),added_leaf_QMARK_):(self__.arr[(j_2321 + (1))])));
|
|
|
|
var G__2324 = (i_2320 + (1));
|
|
var G__2325 = (j_2321 + (2));
|
|
i_2320 = G__2324;
|
|
j_2321 = G__2325;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return (new cljs.core.ArrayNode(edit__$1,(n + (1)),nodes));
|
|
} else {
|
|
var new_arr = (new Array(((2) * (n + (4)))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * idx));
|
|
|
|
(new_arr[((2) * idx)] = key);
|
|
|
|
(new_arr[(((2) * idx) + (1))] = val);
|
|
|
|
cljs.core.array_copy(self__.arr,((2) * idx),new_arr,((2) * (idx + (1))),((2) * (n - idx)));
|
|
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
var editable = inode.ensure_editable(edit__$1);
|
|
editable.arr = new_arr;
|
|
|
|
editable.bitmap = (editable.bitmap | bit);
|
|
|
|
return editable;
|
|
|
|
}
|
|
}
|
|
} else {
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
var n = val_or_node.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_);
|
|
if((n === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),n);
|
|
}
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
if((val === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(((2) * idx) + (1)),val);
|
|
}
|
|
} else {
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6(inode,edit__$1,((2) * idx),null,(((2) * idx) + (1)),cljs.core.create_node.cljs$core$IFn$_invoke$arity$7(edit__$1,(shift + (5)),key_or_nil,val_or_node,hash,key,val));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
if(((self__.bitmap & bit) === (0))){
|
|
var n = cljs.core.bit_count(self__.bitmap);
|
|
if((n >= (16))){
|
|
var nodes = [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null];
|
|
var jdx = ((hash >>> shift) & 0x01f);
|
|
(nodes[jdx] = cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_));
|
|
|
|
var i_2326 = (0);
|
|
var j_2327 = (0);
|
|
while(true){
|
|
if((i_2326 < (32))){
|
|
if((((self__.bitmap >>> i_2326) & (1)) === (0))){
|
|
var G__2328 = (i_2326 + (1));
|
|
var G__2329 = j_2327;
|
|
i_2326 = G__2328;
|
|
j_2327 = G__2329;
|
|
continue;
|
|
} else {
|
|
(nodes[i_2326] = (((!(((self__.arr[j_2327]) == null))))?cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),cljs.core.hash((self__.arr[j_2327])),(self__.arr[j_2327]),(self__.arr[(j_2327 + (1))]),added_leaf_QMARK_):(self__.arr[(j_2327 + (1))])));
|
|
|
|
var G__2330 = (i_2326 + (1));
|
|
var G__2331 = (j_2327 + (2));
|
|
i_2326 = G__2330;
|
|
j_2327 = G__2331;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return (new cljs.core.ArrayNode(null,(n + (1)),nodes));
|
|
} else {
|
|
var new_arr = (new Array(((2) * (n + (1)))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * idx));
|
|
|
|
(new_arr[((2) * idx)] = key);
|
|
|
|
(new_arr[(((2) * idx) + (1))] = val);
|
|
|
|
cljs.core.array_copy(self__.arr,((2) * idx),new_arr,((2) * (idx + (1))),((2) * (n - idx)));
|
|
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap | bit),new_arr));
|
|
}
|
|
} else {
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
var n = val_or_node.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_);
|
|
if((n === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),n)));
|
|
}
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
if((val === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),val)));
|
|
}
|
|
} else {
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$5(self__.arr,((2) * idx),null,(((2) * idx) + (1)),cljs.core.create_node.cljs$core$IFn$_invoke$arity$6((shift + (5)),key_or_nil,val_or_node,hash,key,val))));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_find = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
if(((self__.bitmap & bit) === (0))){
|
|
return not_found;
|
|
} else {
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
return val_or_node.inode_find((shift + (5)),hash,key,not_found);
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
return (new cljs.core.MapEntry(key_or_nil,val_or_node,null));
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.inode_without = (function (shift,hash,key){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var bit = (1 << ((hash >>> shift) & 0x01f));
|
|
if(((self__.bitmap & bit) === (0))){
|
|
return inode;
|
|
} else {
|
|
var idx = cljs.core.bitmap_indexed_node_index(self__.bitmap,bit);
|
|
var key_or_nil = (self__.arr[((2) * idx)]);
|
|
var val_or_node = (self__.arr[(((2) * idx) + (1))]);
|
|
if((key_or_nil == null)){
|
|
var n = val_or_node.inode_without((shift + (5)),hash,key);
|
|
if((n === val_or_node)){
|
|
return inode;
|
|
} else {
|
|
if((!((n == null)))){
|
|
return (new cljs.core.BitmapIndexedNode(null,self__.bitmap,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(((2) * idx) + (1)),n)));
|
|
} else {
|
|
if((self__.bitmap === bit)){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap ^ bit),cljs.core.remove_pair(self__.arr,idx)));
|
|
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
if(cljs.core.key_test(key,key_or_nil)){
|
|
return (new cljs.core.BitmapIndexedNode(null,(self__.bitmap ^ bit),cljs.core.remove_pair(self__.arr,idx)));
|
|
} else {
|
|
return inode;
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.NodeIterator(self__.arr,(0),null,null));
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$bitmap,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.cljs$lang$type = true;
|
|
|
|
cljs.core.BitmapIndexedNode.cljs$lang$ctorStr = "cljs.core/BitmapIndexedNode";
|
|
|
|
cljs.core.BitmapIndexedNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/BitmapIndexedNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/BitmapIndexedNode.
|
|
*/
|
|
cljs.core.__GT_BitmapIndexedNode = (function cljs$core$__GT_BitmapIndexedNode(edit,bitmap,arr){
|
|
return (new cljs.core.BitmapIndexedNode(edit,bitmap,arr));
|
|
});
|
|
|
|
cljs.core.BitmapIndexedNode.EMPTY = (new cljs.core.BitmapIndexedNode(null,(0),[]));
|
|
cljs.core.pack_array_node = (function cljs$core$pack_array_node(array_node,edit,idx){
|
|
var arr = array_node.arr;
|
|
var len = arr.length;
|
|
var new_arr = (new Array(((2) * (array_node.cnt - (1)))));
|
|
var i = (0);
|
|
var j = (1);
|
|
var bitmap = (0);
|
|
while(true){
|
|
if((i < len)){
|
|
if((((!((i === idx)))) && ((!(((arr[i]) == null)))))){
|
|
(new_arr[j] = (arr[i]));
|
|
|
|
var G__2332 = (i + (1));
|
|
var G__2333 = (j + (2));
|
|
var G__2334 = (bitmap | ((1) << i));
|
|
i = G__2332;
|
|
j = G__2333;
|
|
bitmap = G__2334;
|
|
continue;
|
|
} else {
|
|
var G__2335 = (i + (1));
|
|
var G__2336 = j;
|
|
var G__2337 = bitmap;
|
|
i = G__2335;
|
|
j = G__2336;
|
|
bitmap = G__2337;
|
|
continue;
|
|
}
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(edit,bitmap,new_arr));
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ArrayNodeIterator = (function (arr,i,next_iter){
|
|
this.arr = arr;
|
|
this.i = i;
|
|
this.next_iter = next_iter;
|
|
});
|
|
cljs.core.ArrayNodeIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
var len = self__.arr.length;
|
|
while(true){
|
|
if((!((((!((self__.next_iter == null)))) && (self__.next_iter.hasNext()))))){
|
|
if((self__.i < len)){
|
|
var node = (self__.arr[self__.i]);
|
|
self__.i = (self__.i + (1));
|
|
|
|
if((!((node == null)))){
|
|
self__.next_iter = cljs.core._iterator(node);
|
|
} else {
|
|
}
|
|
|
|
continue;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNodeIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
if(this$.hasNext()){
|
|
return self__.next_iter.next();
|
|
} else {
|
|
throw (new Error("No such element"));
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNodeIterator.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.ArrayNodeIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$arr,cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$next_DASH_iter,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ArrayNodeIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayNodeIterator.cljs$lang$ctorStr = "cljs.core/ArrayNodeIterator";
|
|
|
|
cljs.core.ArrayNodeIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayNodeIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayNodeIterator.
|
|
*/
|
|
cljs.core.__GT_ArrayNodeIterator = (function cljs$core$__GT_ArrayNodeIterator(arr,i,next_iter){
|
|
return (new cljs.core.ArrayNodeIterator(arr,i,next_iter));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIterable}
|
|
*/
|
|
cljs.core.ArrayNode = (function (edit,cnt,arr){
|
|
this.edit = edit;
|
|
this.cnt = cnt;
|
|
this.arr = arr;
|
|
this.cljs$lang$protocol_mask$partition1$ = 131072;
|
|
this.cljs$lang$protocol_mask$partition0$ = 0;
|
|
});
|
|
cljs.core.ArrayNode.prototype.ensure_editable = (function (e){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((e === self__.edit)){
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.ArrayNode(e,self__.cnt,cljs.core.aclone(self__.arr)));
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((node == null)){
|
|
return inode;
|
|
} else {
|
|
var n = node.inode_without_BANG_(edit__$1,(shift + (5)),hash,key,removed_leaf_QMARK_);
|
|
if((n === node)){
|
|
return inode;
|
|
} else {
|
|
if((n == null)){
|
|
if((self__.cnt <= (8))){
|
|
return cljs.core.pack_array_node(inode,edit__$1,idx);
|
|
} else {
|
|
var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
|
|
editable.cnt = (editable.cnt - (1));
|
|
|
|
return editable;
|
|
}
|
|
} else {
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_seq = (function (){
|
|
var self__ = this;
|
|
var inode = this;
|
|
return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.kv_reduce = (function (f,init){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var len = self__.arr.length;
|
|
var i = (0);
|
|
var init__$1 = init;
|
|
while(true){
|
|
if((i < len)){
|
|
var node = (self__.arr[i]);
|
|
if((!((node == null)))){
|
|
var init__$2 = node.kv_reduce(f,init__$1);
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return init__$2;
|
|
} else {
|
|
var G__2338 = (i + (1));
|
|
var G__2339 = init__$2;
|
|
i = G__2338;
|
|
init__$1 = G__2339;
|
|
continue;
|
|
}
|
|
} else {
|
|
var G__2340 = (i + (1));
|
|
var G__2341 = init__$1;
|
|
i = G__2340;
|
|
init__$1 = G__2341;
|
|
continue;
|
|
}
|
|
} else {
|
|
return init__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((!((node == null)))){
|
|
return node.inode_lookup((shift + (5)),hash,key,not_found);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((node == null)){
|
|
var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_));
|
|
editable.cnt = (editable.cnt + (1));
|
|
|
|
return editable;
|
|
} else {
|
|
var n = node.inode_assoc_BANG_(edit__$1,(shift + (5)),hash,key,val,added_leaf_QMARK_);
|
|
if((n === node)){
|
|
return inode;
|
|
} else {
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,idx,n);
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((node == null)){
|
|
return (new cljs.core.ArrayNode(null,(self__.cnt + (1)),cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,cljs.core.BitmapIndexedNode.EMPTY.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_))));
|
|
} else {
|
|
var n = node.inode_assoc((shift + (5)),hash,key,val,added_leaf_QMARK_);
|
|
if((n === node)){
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.ArrayNode(null,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_find = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((!((node == null)))){
|
|
return node.inode_find((shift + (5)),hash,key,not_found);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.inode_without = (function (shift,hash,key){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = ((hash >>> shift) & 0x01f);
|
|
var node = (self__.arr[idx]);
|
|
if((!((node == null)))){
|
|
var n = node.inode_without((shift + (5)),hash,key);
|
|
if((n === node)){
|
|
return inode;
|
|
} else {
|
|
if((n == null)){
|
|
if((self__.cnt <= (8))){
|
|
return cljs.core.pack_array_node(inode,null,idx);
|
|
} else {
|
|
return (new cljs.core.ArrayNode(null,(self__.cnt - (1)),cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
|
|
}
|
|
} else {
|
|
return (new cljs.core.ArrayNode(null,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,idx,n)));
|
|
|
|
}
|
|
}
|
|
} else {
|
|
return inode;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.ArrayNodeIterator(self__.arr,(0),null));
|
|
});
|
|
|
|
cljs.core.ArrayNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ArrayNode.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayNode.cljs$lang$ctorStr = "cljs.core/ArrayNode";
|
|
|
|
cljs.core.ArrayNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayNode.
|
|
*/
|
|
cljs.core.__GT_ArrayNode = (function cljs$core$__GT_ArrayNode(edit,cnt,arr){
|
|
return (new cljs.core.ArrayNode(edit,cnt,arr));
|
|
});
|
|
|
|
cljs.core.hash_collision_node_find_index = (function cljs$core$hash_collision_node_find_index(arr,cnt,key){
|
|
var lim = ((2) * cnt);
|
|
var i = (0);
|
|
while(true){
|
|
if((i < lim)){
|
|
if(cljs.core.key_test(key,(arr[i]))){
|
|
return i;
|
|
} else {
|
|
var G__2342 = (i + (2));
|
|
i = G__2342;
|
|
continue;
|
|
}
|
|
} else {
|
|
return (-1);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIterable}
|
|
*/
|
|
cljs.core.HashCollisionNode = (function (edit,collision_hash,cnt,arr){
|
|
this.edit = edit;
|
|
this.collision_hash = collision_hash;
|
|
this.cnt = cnt;
|
|
this.arr = arr;
|
|
this.cljs$lang$protocol_mask$partition1$ = 131072;
|
|
this.cljs$lang$protocol_mask$partition0$ = 0;
|
|
});
|
|
cljs.core.HashCollisionNode.prototype.ensure_editable = (function (e){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((e === self__.edit)){
|
|
return inode;
|
|
} else {
|
|
var new_arr = (new Array(((2) * (self__.cnt + (1)))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),((2) * self__.cnt));
|
|
|
|
return (new cljs.core.HashCollisionNode(e,self__.collision_hash,self__.cnt,new_arr));
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_without_BANG_ = (function (edit__$1,shift,hash,key,removed_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx === (-1))){
|
|
return inode;
|
|
} else {
|
|
removed_leaf_QMARK_.val = true;
|
|
|
|
if((self__.cnt === (1))){
|
|
return null;
|
|
} else {
|
|
var editable = inode.ensure_editable(edit__$1);
|
|
var earr = editable.arr;
|
|
(earr[idx] = (earr[(((2) * self__.cnt) - (2))]));
|
|
|
|
(earr[(idx + (1))] = (earr[(((2) * self__.cnt) - (1))]));
|
|
|
|
(earr[(((2) * self__.cnt) - (1))] = null);
|
|
|
|
(earr[(((2) * self__.cnt) - (2))] = null);
|
|
|
|
editable.cnt = (editable.cnt - (1));
|
|
|
|
return editable;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_seq = (function (){
|
|
var self__ = this;
|
|
var inode = this;
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1(self__.arr);
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.kv_reduce = (function (f,init){
|
|
var self__ = this;
|
|
var inode = this;
|
|
return cljs.core.inode_kv_reduce(self__.arr,f,init);
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_lookup = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx < (0))){
|
|
return not_found;
|
|
} else {
|
|
if(cljs.core.key_test(key,(self__.arr[idx]))){
|
|
return (self__.arr[(idx + (1))]);
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_assoc_BANG_ = (function (edit__$1,shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((hash === self__.collision_hash)){
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx === (-1))){
|
|
if((self__.arr.length > ((2) * self__.cnt))){
|
|
var editable = cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$6(inode,edit__$1,((2) * self__.cnt),key,(((2) * self__.cnt) + (1)),val);
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
editable.cnt = (editable.cnt + (1));
|
|
|
|
return editable;
|
|
} else {
|
|
var len = self__.arr.length;
|
|
var new_arr = (new Array((len + (2))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),len);
|
|
|
|
(new_arr[len] = key);
|
|
|
|
(new_arr[(len + (1))] = val);
|
|
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
return inode.ensure_editable_array(edit__$1,(self__.cnt + (1)),new_arr);
|
|
}
|
|
} else {
|
|
if(((self__.arr[(idx + (1))]) === val)){
|
|
return inode;
|
|
} else {
|
|
return cljs.core.edit_and_set.cljs$core$IFn$_invoke$arity$4(inode,edit__$1,(idx + (1)),val);
|
|
}
|
|
}
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(edit__$1,(1 << ((self__.collision_hash >>> shift) & 0x01f)),[null,inode,null,null])).inode_assoc_BANG_(edit__$1,shift,hash,key,val,added_leaf_QMARK_);
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_assoc = (function (shift,hash,key,val,added_leaf_QMARK_){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((hash === self__.collision_hash)){
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx === (-1))){
|
|
var len = ((2) * self__.cnt);
|
|
var new_arr = (new Array((len + (2))));
|
|
cljs.core.array_copy(self__.arr,(0),new_arr,(0),len);
|
|
|
|
(new_arr[len] = key);
|
|
|
|
(new_arr[(len + (1))] = val);
|
|
|
|
added_leaf_QMARK_.val = true;
|
|
|
|
return (new cljs.core.HashCollisionNode(null,self__.collision_hash,(self__.cnt + (1)),new_arr));
|
|
} else {
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((self__.arr[(idx + (1))]),val)){
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.HashCollisionNode(null,self__.collision_hash,self__.cnt,cljs.core.clone_and_set.cljs$core$IFn$_invoke$arity$3(self__.arr,(idx + (1)),val)));
|
|
}
|
|
}
|
|
} else {
|
|
return (new cljs.core.BitmapIndexedNode(null,(1 << ((self__.collision_hash >>> shift) & 0x01f)),[null,inode])).inode_assoc(shift,hash,key,val,added_leaf_QMARK_);
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.ensure_editable_array = (function (e,count,array){
|
|
var self__ = this;
|
|
var inode = this;
|
|
if((e === self__.edit)){
|
|
self__.arr = array;
|
|
|
|
self__.cnt = count;
|
|
|
|
return inode;
|
|
} else {
|
|
return (new cljs.core.HashCollisionNode(self__.edit,self__.collision_hash,count,array));
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_find = (function (shift,hash,key,not_found){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx < (0))){
|
|
return not_found;
|
|
} else {
|
|
if(cljs.core.key_test(key,(self__.arr[idx]))){
|
|
return (new cljs.core.MapEntry((self__.arr[idx]),(self__.arr[(idx + (1))]),null));
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.inode_without = (function (shift,hash,key){
|
|
var self__ = this;
|
|
var inode = this;
|
|
var idx = cljs.core.hash_collision_node_find_index(self__.arr,self__.cnt,key);
|
|
if((idx === (-1))){
|
|
return inode;
|
|
} else {
|
|
if((self__.cnt === (1))){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.HashCollisionNode(null,self__.collision_hash,(self__.cnt - (1)),cljs.core.remove_pair(self__.arr,cljs.core.quot(idx,(2)))));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.NodeIterator(self__.arr,(0),null,null));
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$edit,cljs.core.with_meta(cljs.core.cst$sym$collision_DASH_hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$cnt,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.HashCollisionNode.cljs$lang$type = true;
|
|
|
|
cljs.core.HashCollisionNode.cljs$lang$ctorStr = "cljs.core/HashCollisionNode";
|
|
|
|
cljs.core.HashCollisionNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/HashCollisionNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/HashCollisionNode.
|
|
*/
|
|
cljs.core.__GT_HashCollisionNode = (function cljs$core$__GT_HashCollisionNode(edit,collision_hash,cnt,arr){
|
|
return (new cljs.core.HashCollisionNode(edit,collision_hash,cnt,arr));
|
|
});
|
|
|
|
cljs.core.create_node = (function cljs$core$create_node(var_args){
|
|
var G__2344 = arguments.length;
|
|
switch (G__2344) {
|
|
case 6:
|
|
return cljs.core.create_node.cljs$core$IFn$_invoke$arity$6((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]));
|
|
|
|
break;
|
|
case 7:
|
|
return cljs.core.create_node.cljs$core$IFn$_invoke$arity$7((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]),(arguments[(5)]),(arguments[(6)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.create_node.cljs$core$IFn$_invoke$arity$6 = (function (shift,key1,val1,key2hash,key2,val2){
|
|
var key1hash = cljs.core.hash(key1);
|
|
if((key1hash === key2hash)){
|
|
return (new cljs.core.HashCollisionNode(null,key1hash,(2),[key1,val1,key2,val2]));
|
|
} else {
|
|
var added_leaf_QMARK_ = (new cljs.core.Box(false));
|
|
return cljs.core.BitmapIndexedNode.EMPTY.inode_assoc(shift,key1hash,key1,val1,added_leaf_QMARK_).inode_assoc(shift,key2hash,key2,val2,added_leaf_QMARK_);
|
|
}
|
|
});
|
|
|
|
cljs.core.create_node.cljs$core$IFn$_invoke$arity$7 = (function (edit,shift,key1,val1,key2hash,key2,val2){
|
|
var key1hash = cljs.core.hash(key1);
|
|
if((key1hash === key2hash)){
|
|
return (new cljs.core.HashCollisionNode(null,key1hash,(2),[key1,val1,key2,val2]));
|
|
} else {
|
|
var added_leaf_QMARK_ = (new cljs.core.Box(false));
|
|
return cljs.core.BitmapIndexedNode.EMPTY.inode_assoc_BANG_(edit,shift,key1hash,key1,val1,added_leaf_QMARK_).inode_assoc_BANG_(edit,shift,key2hash,key2,val2,added_leaf_QMARK_);
|
|
}
|
|
});
|
|
|
|
cljs.core.create_node.cljs$lang$maxFixedArity = 7;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.NodeSeq = (function (meta,nodes,i,s,__hash){
|
|
this.meta = meta;
|
|
this.nodes = nodes;
|
|
this.i = i;
|
|
this.s = s;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.NodeSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.indexOf = (function() {
|
|
var G__2346 = null;
|
|
var G__2346__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2346__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2346 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2346__1.call(this,x);
|
|
case 2:
|
|
return G__2346__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2346.cljs$core$IFn$_invoke$arity$1 = G__2346__1;
|
|
G__2346.cljs$core$IFn$_invoke$arity$2 = G__2346__2;
|
|
return G__2346;
|
|
})()
|
|
;
|
|
|
|
cljs.core.NodeSeq.prototype.lastIndexOf = (function() {
|
|
var G__2347 = null;
|
|
var G__2347__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2347__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2347 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2347__1.call(this,x);
|
|
case 2:
|
|
return G__2347__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2347.cljs$core$IFn$_invoke$arity$1 = G__2347__1;
|
|
G__2347.cljs$core$IFn$_invoke$arity$2 = G__2347__2;
|
|
return G__2347;
|
|
})()
|
|
;
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.s == null)){
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,(self__.i + (2)),null);
|
|
} else {
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,self__.i,cljs.core.next(self__.s));
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.s == null)){
|
|
return (new cljs.core.MapEntry((self__.nodes[self__.i]),(self__.nodes[(self__.i + (1))]),null));
|
|
} else {
|
|
return cljs.core.first(self__.s);
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var ret = (((self__.s == null))?cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,(self__.i + (2)),null):cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(self__.nodes,self__.i,cljs.core.next(self__.s)));
|
|
if((!((ret == null)))){
|
|
return ret;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1;
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.NodeSeq(meta__$1,self__.nodes,self__.i,self__.s,self__.__hash));
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.NodeSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$nodes,cljs.core.cst$sym$i,cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.NodeSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.NodeSeq.cljs$lang$ctorStr = "cljs.core/NodeSeq";
|
|
|
|
cljs.core.NodeSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/NodeSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/NodeSeq.
|
|
*/
|
|
cljs.core.__GT_NodeSeq = (function cljs$core$__GT_NodeSeq(meta,nodes,i,s,__hash){
|
|
return (new cljs.core.NodeSeq(meta,nodes,i,s,__hash));
|
|
});
|
|
|
|
var G__2348_2351 = cljs.core.NodeSeq.prototype;
|
|
var G__2349_2352 = cljs.core.ITER_SYMBOL;
|
|
var G__2350_2353 = ((function (G__2348_2351,G__2349_2352){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2348_2351,G__2349_2352))
|
|
;
|
|
goog.object.set(G__2348_2351,G__2349_2352,G__2350_2353);
|
|
cljs.core.create_inode_seq = (function cljs$core$create_inode_seq(var_args){
|
|
var G__2355 = arguments.length;
|
|
switch (G__2355) {
|
|
case 1:
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$1 = (function (nodes){
|
|
return cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3(nodes,(0),null);
|
|
});
|
|
|
|
cljs.core.create_inode_seq.cljs$core$IFn$_invoke$arity$3 = (function (nodes,i,s){
|
|
if((s == null)){
|
|
var len = nodes.length;
|
|
var j = i;
|
|
while(true){
|
|
if((j < len)){
|
|
if((!(((nodes[j]) == null)))){
|
|
return (new cljs.core.NodeSeq(null,nodes,j,null,null));
|
|
} else {
|
|
var temp__5455__auto__ = (nodes[(j + (1))]);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var node = temp__5455__auto__;
|
|
var temp__5455__auto____$1 = node.inode_seq();
|
|
if(cljs.core.truth_(temp__5455__auto____$1)){
|
|
var node_seq = temp__5455__auto____$1;
|
|
return (new cljs.core.NodeSeq(null,nodes,(j + (2)),node_seq,null));
|
|
} else {
|
|
var G__2357 = (j + (2));
|
|
j = G__2357;
|
|
continue;
|
|
}
|
|
} else {
|
|
var G__2358 = (j + (2));
|
|
j = G__2358;
|
|
continue;
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return (new cljs.core.NodeSeq(null,nodes,i,s,null));
|
|
}
|
|
});
|
|
|
|
cljs.core.create_inode_seq.cljs$lang$maxFixedArity = 3;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.ArrayNodeSeq = (function (meta,nodes,i,s,__hash){
|
|
this.meta = meta;
|
|
this.nodes = nodes;
|
|
this.i = i;
|
|
this.s = s;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.ArrayNodeSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.indexOf = (function() {
|
|
var G__2359 = null;
|
|
var G__2359__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2359__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2359 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2359__1.call(this,x);
|
|
case 2:
|
|
return G__2359__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2359.cljs$core$IFn$_invoke$arity$1 = G__2359__1;
|
|
G__2359.cljs$core$IFn$_invoke$arity$2 = G__2359__2;
|
|
return G__2359;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.lastIndexOf = (function() {
|
|
var G__2360 = null;
|
|
var G__2360__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2360__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2360 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2360__1.call(this,x);
|
|
case 2:
|
|
return G__2360__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2360.cljs$core$IFn$_invoke$arity$1 = G__2360__1;
|
|
G__2360.cljs$core$IFn$_invoke$arity$2 = G__2360__2;
|
|
return G__2360;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,self__.nodes,self__.i,cljs.core.next(self__.s));
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.first(self__.s);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var ret = cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,self__.nodes,self__.i,cljs.core.next(self__.s));
|
|
if((!((ret == null)))){
|
|
return ret;
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1;
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.ArrayNodeSeq(meta__$1,self__.nodes,self__.i,self__.s,self__.__hash));
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$nodes,cljs.core.cst$sym$i,cljs.core.cst$sym$s,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayNodeSeq.cljs$lang$ctorStr = "cljs.core/ArrayNodeSeq";
|
|
|
|
cljs.core.ArrayNodeSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayNodeSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayNodeSeq.
|
|
*/
|
|
cljs.core.__GT_ArrayNodeSeq = (function cljs$core$__GT_ArrayNodeSeq(meta,nodes,i,s,__hash){
|
|
return (new cljs.core.ArrayNodeSeq(meta,nodes,i,s,__hash));
|
|
});
|
|
|
|
var G__2361_2364 = cljs.core.ArrayNodeSeq.prototype;
|
|
var G__2362_2365 = cljs.core.ITER_SYMBOL;
|
|
var G__2363_2366 = ((function (G__2361_2364,G__2362_2365){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2361_2364,G__2362_2365))
|
|
;
|
|
goog.object.set(G__2361_2364,G__2362_2365,G__2363_2366);
|
|
cljs.core.create_array_node_seq = (function cljs$core$create_array_node_seq(var_args){
|
|
var G__2368 = arguments.length;
|
|
switch (G__2368) {
|
|
case 1:
|
|
return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 4:
|
|
return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$1 = (function (nodes){
|
|
return cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4(null,nodes,(0),null);
|
|
});
|
|
|
|
cljs.core.create_array_node_seq.cljs$core$IFn$_invoke$arity$4 = (function (meta,nodes,i,s){
|
|
if((s == null)){
|
|
var len = nodes.length;
|
|
var j = i;
|
|
while(true){
|
|
if((j < len)){
|
|
var temp__5455__auto__ = (nodes[j]);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var nj = temp__5455__auto__;
|
|
var temp__5455__auto____$1 = nj.inode_seq();
|
|
if(cljs.core.truth_(temp__5455__auto____$1)){
|
|
var ns = temp__5455__auto____$1;
|
|
return (new cljs.core.ArrayNodeSeq(meta,nodes,(j + (1)),ns,null));
|
|
} else {
|
|
var G__2370 = (j + (1));
|
|
j = G__2370;
|
|
continue;
|
|
}
|
|
} else {
|
|
var G__2371 = (j + (1));
|
|
j = G__2371;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return (new cljs.core.ArrayNodeSeq(meta,nodes,i,s,null));
|
|
}
|
|
});
|
|
|
|
cljs.core.create_array_node_seq.cljs$lang$maxFixedArity = 4;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.HashMapIter = (function (nil_val,root_iter,seen){
|
|
this.nil_val = nil_val;
|
|
this.root_iter = root_iter;
|
|
this.seen = seen;
|
|
});
|
|
cljs.core.HashMapIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (((!(self__.seen))) || (self__.root_iter.hasNext()));
|
|
});
|
|
|
|
cljs.core.HashMapIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((!(self__.seen))){
|
|
self__.seen = true;
|
|
|
|
return (new cljs.core.MapEntry(null,self__.nil_val,null));
|
|
} else {
|
|
return self__.root_iter.next();
|
|
}
|
|
});
|
|
|
|
cljs.core.HashMapIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.HashMapIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$nil_DASH_val,cljs.core.cst$sym$root_DASH_iter,cljs.core.with_meta(cljs.core.cst$sym$seen,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.HashMapIter.cljs$lang$type = true;
|
|
|
|
cljs.core.HashMapIter.cljs$lang$ctorStr = "cljs.core/HashMapIter";
|
|
|
|
cljs.core.HashMapIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/HashMapIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/HashMapIter.
|
|
*/
|
|
cljs.core.__GT_HashMapIter = (function cljs$core$__GT_HashMapIter(nil_val,root_iter,seen){
|
|
return (new cljs.core.HashMapIter(nil_val,root_iter,seen));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEditableCollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.IMap}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.PersistentHashMap = (function (meta,cnt,root,has_nil_QMARK_,nil_val,__hash){
|
|
this.meta = meta;
|
|
this.cnt = cnt;
|
|
this.root = root;
|
|
this.has_nil_QMARK_ = has_nil_QMARK_;
|
|
this.nil_val = nil_val;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 16123663;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139268;
|
|
});
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
return (new cljs.core.MapEntry(null,self__.nil_val,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return null;
|
|
} else {
|
|
return self__.root.inode_find((0),cljs.core.hash(k),k,null);
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.keys = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.keys(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.entries = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.values = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.vals(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.has = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.contains_QMARK_(coll,k);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.get = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.forEach = (function (f){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var seq__2373 = cljs.core.seq(coll);
|
|
var chunk__2374 = null;
|
|
var count__2375 = (0);
|
|
var i__2376 = (0);
|
|
while(true){
|
|
if((i__2376 < count__2375)){
|
|
var vec__2377 = chunk__2374.cljs$core$IIndexed$_nth$arity$2(null,i__2376);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2377,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2377,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2385 = seq__2373;
|
|
var G__2386 = chunk__2374;
|
|
var G__2387 = count__2375;
|
|
var G__2388 = (i__2376 + (1));
|
|
seq__2373 = G__2385;
|
|
chunk__2374 = G__2386;
|
|
count__2375 = G__2387;
|
|
i__2376 = G__2388;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2373);
|
|
if(temp__5457__auto__){
|
|
var seq__2373__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2373__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2373__$1);
|
|
var G__2389 = cljs.core.chunk_rest(seq__2373__$1);
|
|
var G__2390 = c__4461__auto__;
|
|
var G__2391 = cljs.core.count(c__4461__auto__);
|
|
var G__2392 = (0);
|
|
seq__2373 = G__2389;
|
|
chunk__2374 = G__2390;
|
|
count__2375 = G__2391;
|
|
i__2376 = G__2392;
|
|
continue;
|
|
} else {
|
|
var vec__2380 = cljs.core.first(seq__2373__$1);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2380,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2380,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2393 = cljs.core.next(seq__2373__$1);
|
|
var G__2394 = null;
|
|
var G__2395 = (0);
|
|
var G__2396 = (0);
|
|
seq__2373 = G__2393;
|
|
chunk__2374 = G__2394;
|
|
count__2375 = G__2395;
|
|
i__2376 = G__2396;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
return self__.nil_val;
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return not_found;
|
|
} else {
|
|
return self__.root.inode_lookup((0),cljs.core.hash(k),k,not_found);
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var init__$1 = ((self__.has_nil_QMARK_)?(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(init,null,self__.nil_val) : f.call(null,init,null,self__.nil_val)):init);
|
|
if(cljs.core.reduced_QMARK_(init__$1)){
|
|
return cljs.core.deref(init__$1);
|
|
} else {
|
|
if((!((self__.root == null)))){
|
|
return cljs.core.unreduced(self__.root.kv_reduce(f,init__$1));
|
|
} else {
|
|
return init__$1;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var root_iter = ((self__.root)?cljs.core._iterator(self__.root):cljs.core.nil_iter());
|
|
if(self__.has_nil_QMARK_){
|
|
return (new cljs.core.HashMapIter(self__.nil_val,root_iter,false));
|
|
} else {
|
|
return root_iter;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentHashMap(self__.meta,self__.cnt,self__.root,self__.has_nil_QMARK_,self__.nil_val,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.cnt;
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_map(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.TransientHashMap({},self__.root,self__.cnt,self__.has_nil_QMARK_,self__.nil_val));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentHashMap.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
return (new cljs.core.PersistentHashMap(self__.meta,(self__.cnt - (1)),self__.root,false,null,null));
|
|
} else {
|
|
return coll__$1;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return coll__$1;
|
|
} else {
|
|
var new_root = self__.root.inode_without((0),cljs.core.hash(k),k);
|
|
if((new_root === self__.root)){
|
|
return coll__$1;
|
|
} else {
|
|
return (new cljs.core.PersistentHashMap(self__.meta,(self__.cnt - (1)),new_root,self__.has_nil_QMARK_,self__.nil_val,null));
|
|
}
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((k == null)){
|
|
if(((self__.has_nil_QMARK_) && ((v === self__.nil_val)))){
|
|
return coll__$1;
|
|
} else {
|
|
return (new cljs.core.PersistentHashMap(self__.meta,((self__.has_nil_QMARK_)?self__.cnt:(self__.cnt + (1))),self__.root,true,v,null));
|
|
}
|
|
} else {
|
|
var added_leaf_QMARK_ = (new cljs.core.Box(false));
|
|
var new_root = (((self__.root == null))?cljs.core.BitmapIndexedNode.EMPTY:self__.root).inode_assoc((0),cljs.core.hash(k),k,v,added_leaf_QMARK_);
|
|
if((new_root === self__.root)){
|
|
return coll__$1;
|
|
} else {
|
|
return (new cljs.core.PersistentHashMap(self__.meta,((added_leaf_QMARK_.val)?(self__.cnt + (1)):self__.cnt),new_root,self__.has_nil_QMARK_,self__.nil_val,null));
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((k == null)){
|
|
return self__.has_nil_QMARK_;
|
|
} else {
|
|
if((self__.root == null)){
|
|
return false;
|
|
} else {
|
|
return (!((self__.root.inode_lookup((0),cljs.core.hash(k),k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
var s = (((!((self__.root == null))))?self__.root.inode_seq():null);
|
|
if(self__.has_nil_QMARK_){
|
|
return cljs.core.cons((new cljs.core.MapEntry(null,self__.nil_val,null)),s);
|
|
} else {
|
|
return s;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentHashMap(meta__$1,self__.cnt,self__.root,self__.has_nil_QMARK_,self__.nil_val,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.vector_QMARK_(entry)){
|
|
return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
|
|
} else {
|
|
var ret = coll__$1;
|
|
var es = cljs.core.seq(entry);
|
|
while(true){
|
|
if((es == null)){
|
|
return ret;
|
|
} else {
|
|
var e = cljs.core.first(es);
|
|
if(cljs.core.vector_QMARK_(e)){
|
|
var G__2397 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
|
|
var G__2398 = cljs.core.next(es);
|
|
ret = G__2397;
|
|
es = G__2398;
|
|
continue;
|
|
} else {
|
|
throw (new Error("conj on a map takes map entries or seqables of map entries"));
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.call = (function() {
|
|
var G__2399 = null;
|
|
var G__2399__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2399__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2399 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2399__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2399__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2399.cljs$core$IFn$_invoke$arity$2 = G__2399__2;
|
|
G__2399.cljs$core$IFn$_invoke$arity$3 = G__2399__3;
|
|
return G__2399;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentHashMap.prototype.apply = (function (self__,args2372){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2372)));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 6, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$cnt,cljs.core.cst$sym$root,cljs.core.with_meta(cljs.core.cst$sym$has_DASH_nil_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean], null)),cljs.core.cst$sym$nil_DASH_val,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentHashMap.cljs$lang$ctorStr = "cljs.core/PersistentHashMap";
|
|
|
|
cljs.core.PersistentHashMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentHashMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentHashMap.
|
|
*/
|
|
cljs.core.__GT_PersistentHashMap = (function cljs$core$__GT_PersistentHashMap(meta,cnt,root,has_nil_QMARK_,nil_val,__hash){
|
|
return (new cljs.core.PersistentHashMap(meta,cnt,root,has_nil_QMARK_,nil_val,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.EMPTY = (new cljs.core.PersistentHashMap(null,(0),null,false,null,cljs.core.empty_unordered_hash));
|
|
cljs.core.PersistentHashMap.fromArray = (function (arr,no_clone){
|
|
var arr__$1 = ((no_clone)?arr:cljs.core.aclone(arr));
|
|
var len = arr__$1.length;
|
|
var i = (0);
|
|
var ret = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__2400 = (i + (2));
|
|
var G__2401 = cljs.core._assoc_BANG_(ret,(arr__$1[i]),(arr__$1[(i + (1))]));
|
|
i = G__2400;
|
|
ret = G__2401;
|
|
continue;
|
|
} else {
|
|
return cljs.core._persistent_BANG_(ret);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.PersistentHashMap.fromArrays = (function (ks,vs){
|
|
var len = ks.length;
|
|
var i = (0);
|
|
var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__2402 = (i + (1));
|
|
var G__2403 = out.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3(null,(ks[i]),(vs[i]));
|
|
i = G__2402;
|
|
out = G__2403;
|
|
continue;
|
|
} else {
|
|
return cljs.core.persistent_BANG_(out);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.PersistentHashMap.createWithCheck = (function (arr){
|
|
var len = arr.length;
|
|
var ret = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
var i_2404 = (0);
|
|
while(true){
|
|
if((i_2404 < len)){
|
|
cljs.core._assoc_BANG_(ret,(arr[i_2404]),(arr[(i_2404 + (1))]));
|
|
|
|
if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core._count(ret),((i_2404 / (2)) + (1)))){
|
|
throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1((arr[i_2404]))].join('')));
|
|
} else {
|
|
var G__2405 = (i_2404 + (2));
|
|
i_2404 = G__2405;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core._persistent_BANG_(ret);
|
|
});
|
|
var G__2406_2409 = cljs.core.PersistentHashMap.prototype;
|
|
var G__2407_2410 = cljs.core.ITER_SYMBOL;
|
|
var G__2408_2411 = ((function (G__2406_2409,G__2407_2410){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2406_2409,G__2407_2410))
|
|
;
|
|
goog.object.set(G__2406_2409,G__2407_2410,G__2408_2411);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ITransientMap}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ITransientCollection}
|
|
* @implements {cljs.core.ITransientAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.TransientHashMap = (function (edit,root,count,has_nil_QMARK_,nil_val){
|
|
this.edit = edit;
|
|
this.root = root;
|
|
this.count = count;
|
|
this.has_nil_QMARK_ = has_nil_QMARK_;
|
|
this.nil_val = nil_val;
|
|
this.cljs$lang$protocol_mask$partition0$ = 259;
|
|
this.cljs$lang$protocol_mask$partition1$ = 56;
|
|
});
|
|
cljs.core.TransientHashMap.prototype.conj_BANG_ = (function (o){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if(self__.edit){
|
|
if(cljs.core.map_entry_QMARK_(o)){
|
|
return tcoll.assoc_BANG_(cljs.core.key(o),cljs.core.val(o));
|
|
} else {
|
|
if(cljs.core.vector_QMARK_(o)){
|
|
return tcoll.assoc_BANG_((o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((0)) : o.call(null,(0))),(o.cljs$core$IFn$_invoke$arity$1 ? o.cljs$core$IFn$_invoke$arity$1((1)) : o.call(null,(1))));
|
|
} else {
|
|
var es = cljs.core.seq(o);
|
|
var tcoll__$1 = tcoll;
|
|
while(true){
|
|
var temp__5455__auto__ = cljs.core.first(es);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var e = temp__5455__auto__;
|
|
var G__2413 = cljs.core.next(es);
|
|
var G__2414 = tcoll__$1.assoc_BANG_(cljs.core.key(e),cljs.core.val(e));
|
|
es = G__2413;
|
|
tcoll__$1 = G__2414;
|
|
continue;
|
|
} else {
|
|
return tcoll__$1;
|
|
}
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("conj! after persistent"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.assoc_BANG_ = (function (k,v){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if(self__.edit){
|
|
if((k == null)){
|
|
if((self__.nil_val === v)){
|
|
} else {
|
|
self__.nil_val = v;
|
|
}
|
|
|
|
if(self__.has_nil_QMARK_){
|
|
} else {
|
|
self__.count = (self__.count + (1));
|
|
|
|
self__.has_nil_QMARK_ = true;
|
|
}
|
|
|
|
return tcoll;
|
|
} else {
|
|
var added_leaf_QMARK_ = (new cljs.core.Box(false));
|
|
var node = (((self__.root == null))?cljs.core.BitmapIndexedNode.EMPTY:self__.root).inode_assoc_BANG_(self__.edit,(0),cljs.core.hash(k),k,v,added_leaf_QMARK_);
|
|
if((node === self__.root)){
|
|
} else {
|
|
self__.root = node;
|
|
}
|
|
|
|
if(added_leaf_QMARK_.val){
|
|
self__.count = (self__.count + (1));
|
|
} else {
|
|
}
|
|
|
|
return tcoll;
|
|
}
|
|
} else {
|
|
throw (new Error("assoc! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.without_BANG_ = (function (k){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if(self__.edit){
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
self__.has_nil_QMARK_ = false;
|
|
|
|
self__.nil_val = null;
|
|
|
|
self__.count = (self__.count - (1));
|
|
|
|
return tcoll;
|
|
} else {
|
|
return tcoll;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return tcoll;
|
|
} else {
|
|
var removed_leaf_QMARK_ = (new cljs.core.Box(false));
|
|
var node = self__.root.inode_without_BANG_(self__.edit,(0),cljs.core.hash(k),k,removed_leaf_QMARK_);
|
|
if((node === self__.root)){
|
|
} else {
|
|
self__.root = node;
|
|
}
|
|
|
|
if(removed_leaf_QMARK_.val){
|
|
self__.count = (self__.count - (1));
|
|
} else {
|
|
}
|
|
|
|
return tcoll;
|
|
}
|
|
}
|
|
} else {
|
|
throw (new Error("dissoc! after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.persistent_BANG_ = (function (){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if(self__.edit){
|
|
self__.edit = null;
|
|
|
|
return (new cljs.core.PersistentHashMap(null,self__.count,self__.root,self__.has_nil_QMARK_,self__.nil_val,null));
|
|
} else {
|
|
throw (new Error("persistent! called twice"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(self__.edit){
|
|
return self__.count;
|
|
} else {
|
|
throw (new Error("count after persistent!"));
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,k){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
return self__.nil_val;
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return null;
|
|
} else {
|
|
return self__.root.inode_lookup((0),cljs.core.hash(k),k);
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,k,not_found){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if((k == null)){
|
|
if(self__.has_nil_QMARK_){
|
|
return self__.nil_val;
|
|
} else {
|
|
return not_found;
|
|
}
|
|
} else {
|
|
if((self__.root == null)){
|
|
return not_found;
|
|
} else {
|
|
return self__.root.inode_lookup((0),cljs.core.hash(k),k,not_found);
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,val){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.conj_BANG_(val);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.persistent_BANG_();
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ITransientAssociative$_assoc_BANG_$arity$3 = (function (tcoll,key,val){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.assoc_BANG_(key,val);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$ITransientMap$_dissoc_BANG_$arity$2 = (function (tcoll,key){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.without_BANG_(key);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.call = (function() {
|
|
var G__2415 = null;
|
|
var G__2415__2 = (function (self__,key){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$2(null,key);
|
|
});
|
|
var G__2415__3 = (function (self__,key,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
|
|
});
|
|
G__2415 = function(self__,key,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2415__2.call(this,self__,key);
|
|
case 3:
|
|
return G__2415__3.call(this,self__,key,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2415.cljs$core$IFn$_invoke$arity$2 = G__2415__2;
|
|
G__2415.cljs$core$IFn$_invoke$arity$3 = G__2415__3;
|
|
return G__2415;
|
|
})()
|
|
;
|
|
|
|
cljs.core.TransientHashMap.prototype.apply = (function (self__,args2412){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2412)));
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (key){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$2(null,key);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (key,not_found){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
return tcoll.cljs$core$ILookup$_lookup$arity$3(null,key,not_found);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$edit,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$root,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$count,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$has_DASH_nil_QMARK_,new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean,cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$nil_DASH_val,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.TransientHashMap.cljs$lang$type = true;
|
|
|
|
cljs.core.TransientHashMap.cljs$lang$ctorStr = "cljs.core/TransientHashMap";
|
|
|
|
cljs.core.TransientHashMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TransientHashMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TransientHashMap.
|
|
*/
|
|
cljs.core.__GT_TransientHashMap = (function cljs$core$__GT_TransientHashMap(edit,root,count,has_nil_QMARK_,nil_val){
|
|
return (new cljs.core.TransientHashMap(edit,root,count,has_nil_QMARK_,nil_val));
|
|
});
|
|
|
|
cljs.core.tree_map_seq_push = (function cljs$core$tree_map_seq_push(node,stack,ascending_QMARK_){
|
|
var t = node;
|
|
var stack__$1 = stack;
|
|
while(true){
|
|
if((!((t == null)))){
|
|
var G__2416 = ((ascending_QMARK_)?t.left:t.right);
|
|
var G__2417 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack__$1,t);
|
|
t = G__2416;
|
|
stack__$1 = G__2417;
|
|
continue;
|
|
} else {
|
|
return stack__$1;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.PersistentTreeMapSeq = (function (meta,stack,ascending_QMARK_,cnt,__hash){
|
|
this.meta = meta;
|
|
this.stack = stack;
|
|
this.ascending_QMARK_ = ascending_QMARK_;
|
|
this.cnt = cnt;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374990;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.PersistentTreeMapSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.indexOf = (function() {
|
|
var G__2418 = null;
|
|
var G__2418__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2418__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2418 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2418__1.call(this,x);
|
|
case 2:
|
|
return G__2418__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2418.cljs$core$IFn$_invoke$arity$1 = G__2418__1;
|
|
G__2418.cljs$core$IFn$_invoke$arity$2 = G__2418__2;
|
|
return G__2418;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.lastIndexOf = (function() {
|
|
var G__2419 = null;
|
|
var G__2419__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2419__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2419 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2419__1.call(this,x);
|
|
case 2:
|
|
return G__2419__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2419.cljs$core$IFn$_invoke$arity$1 = G__2419__1;
|
|
G__2419.cljs$core$IFn$_invoke$arity$2 = G__2419__2;
|
|
return G__2419;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$INext$_next$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
var t = cljs.core.first(self__.stack);
|
|
var next_stack = cljs.core.tree_map_seq_push(((self__.ascending_QMARK_)?t.right:t.left),cljs.core.next(self__.stack),self__.ascending_QMARK_);
|
|
if((next_stack == null)){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMapSeq(null,next_stack,self__.ascending_QMARK_,(self__.cnt - (1)),null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt < (0))){
|
|
return (cljs.core.count(cljs.core.next(coll__$1)) + (1));
|
|
} else {
|
|
return self__.cnt;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return cljs.core.peek(self__.stack);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
var t = cljs.core.first(self__.stack);
|
|
var next_stack = cljs.core.tree_map_seq_push(((self__.ascending_QMARK_)?t.right:t.left),cljs.core.next(self__.stack),self__.ascending_QMARK_);
|
|
if((!((next_stack == null)))){
|
|
return (new cljs.core.PersistentTreeMapSeq(null,next_stack,self__.ascending_QMARK_,(self__.cnt - (1)),null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1;
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeMapSeq(meta__$1,self__.stack,self__.ascending_QMARK_,self__.cnt,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$stack,cljs.core.with_meta(cljs.core.cst$sym$ascending_QMARK_,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$boolean], null)),cljs.core.cst$sym$cnt,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentTreeMapSeq.cljs$lang$ctorStr = "cljs.core/PersistentTreeMapSeq";
|
|
|
|
cljs.core.PersistentTreeMapSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentTreeMapSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentTreeMapSeq.
|
|
*/
|
|
cljs.core.__GT_PersistentTreeMapSeq = (function cljs$core$__GT_PersistentTreeMapSeq(meta,stack,ascending_QMARK_,cnt,__hash){
|
|
return (new cljs.core.PersistentTreeMapSeq(meta,stack,ascending_QMARK_,cnt,__hash));
|
|
});
|
|
|
|
var G__2420_2423 = cljs.core.PersistentTreeMapSeq.prototype;
|
|
var G__2421_2424 = cljs.core.ITER_SYMBOL;
|
|
var G__2422_2425 = ((function (G__2420_2423,G__2421_2424){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2420_2423,G__2421_2424))
|
|
;
|
|
goog.object.set(G__2420_2423,G__2421_2424,G__2422_2425);
|
|
cljs.core.create_tree_map_seq = (function cljs$core$create_tree_map_seq(tree,ascending_QMARK_,cnt){
|
|
return (new cljs.core.PersistentTreeMapSeq(null,cljs.core.tree_map_seq_push(tree,null,ascending_QMARK_),ascending_QMARK_,cnt,null));
|
|
});
|
|
|
|
cljs.core.balance_left = (function cljs$core$balance_left(key,val,ins,right){
|
|
if((ins instanceof cljs.core.RedNode)){
|
|
if((ins.left instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(ins.key,ins.val,ins.left.blacken(),(new cljs.core.BlackNode(key,val,ins.right,right,null)),null));
|
|
} else {
|
|
if((ins.right instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(ins.right.key,ins.right.val,(new cljs.core.BlackNode(ins.key,ins.val,ins.left,ins.right.left,null)),(new cljs.core.BlackNode(key,val,ins.right.right,right,null)),null));
|
|
} else {
|
|
return (new cljs.core.BlackNode(key,val,ins,right,null));
|
|
|
|
}
|
|
}
|
|
} else {
|
|
return (new cljs.core.BlackNode(key,val,ins,right,null));
|
|
}
|
|
});
|
|
cljs.core.balance_right = (function cljs$core$balance_right(key,val,left,ins){
|
|
if((ins instanceof cljs.core.RedNode)){
|
|
if((ins.right instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(ins.key,ins.val,(new cljs.core.BlackNode(key,val,left,ins.left,null)),ins.right.blacken(),null));
|
|
} else {
|
|
if((ins.left instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(ins.left.key,ins.left.val,(new cljs.core.BlackNode(key,val,left,ins.left.left,null)),(new cljs.core.BlackNode(ins.key,ins.val,ins.left.right,ins.right,null)),null));
|
|
} else {
|
|
return (new cljs.core.BlackNode(key,val,left,ins,null));
|
|
|
|
}
|
|
}
|
|
} else {
|
|
return (new cljs.core.BlackNode(key,val,left,ins,null));
|
|
}
|
|
});
|
|
cljs.core.balance_left_del = (function cljs$core$balance_left_del(key,val,del,right){
|
|
if((del instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(key,val,del.blacken(),right,null));
|
|
} else {
|
|
if((right instanceof cljs.core.BlackNode)){
|
|
return cljs.core.balance_right(key,val,del,right.redden());
|
|
} else {
|
|
if((((right instanceof cljs.core.RedNode)) && ((right.left instanceof cljs.core.BlackNode)))){
|
|
return (new cljs.core.RedNode(right.left.key,right.left.val,(new cljs.core.BlackNode(key,val,del,right.left.left,null)),cljs.core.balance_right(right.key,right.val,right.left.right,right.right.redden()),null));
|
|
} else {
|
|
throw (new Error("red-black tree invariant violation"));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.balance_right_del = (function cljs$core$balance_right_del(key,val,left,del){
|
|
if((del instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(key,val,left,del.blacken(),null));
|
|
} else {
|
|
if((left instanceof cljs.core.BlackNode)){
|
|
return cljs.core.balance_left(key,val,left.redden(),del);
|
|
} else {
|
|
if((((left instanceof cljs.core.RedNode)) && ((left.right instanceof cljs.core.BlackNode)))){
|
|
return (new cljs.core.RedNode(left.right.key,left.right.val,cljs.core.balance_left(left.key,left.val,left.left.redden(),left.right.left),(new cljs.core.BlackNode(key,val,left.right.right,del,null)),null));
|
|
} else {
|
|
throw (new Error("red-black tree invariant violation"));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.tree_map_kv_reduce = (function cljs$core$tree_map_kv_reduce(node,f,init){
|
|
var init__$1 = (((!((node.left == null))))?(function (){var G__2426 = node.left;
|
|
var G__2427 = f;
|
|
var G__2428 = init;
|
|
return (cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3(G__2426,G__2427,G__2428) : cljs.core.tree_map_kv_reduce.call(null,G__2426,G__2427,G__2428));
|
|
})():init);
|
|
if(cljs.core.reduced_QMARK_(init__$1)){
|
|
return init__$1;
|
|
} else {
|
|
var init__$2 = (function (){var G__2429 = init__$1;
|
|
var G__2430 = node.key;
|
|
var G__2431 = node.val;
|
|
return (f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(G__2429,G__2430,G__2431) : f.call(null,G__2429,G__2430,G__2431));
|
|
})();
|
|
if(cljs.core.reduced_QMARK_(init__$2)){
|
|
return init__$2;
|
|
} else {
|
|
if((!((node.right == null)))){
|
|
var G__2432 = node.right;
|
|
var G__2433 = f;
|
|
var G__2434 = init__$2;
|
|
return (cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3 ? cljs.core.tree_map_kv_reduce.cljs$core$IFn$_invoke$arity$3(G__2432,G__2433,G__2434) : cljs.core.tree_map_kv_reduce.call(null,G__2432,G__2433,G__2434));
|
|
} else {
|
|
return init__$2;
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IVector}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IMapEntry}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.BlackNode = (function (key,val,left,right,__hash){
|
|
this.key = key;
|
|
this.val = val;
|
|
this.left = left;
|
|
this.right = right;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 166619935;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.BlackNode.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
var G__2436 = k;
|
|
switch (G__2436) {
|
|
case (0):
|
|
return (new cljs.core.MapEntry((0),self__.key,null));
|
|
|
|
break;
|
|
case (1):
|
|
return (new cljs.core.MapEntry((1),self__.val,null));
|
|
|
|
break;
|
|
default:
|
|
return null;
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.lastIndexOf = (function() {
|
|
var G__2438 = null;
|
|
var G__2438__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2438__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2438 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2438__1.call(this,x);
|
|
case 2:
|
|
return G__2438__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2438.cljs$core$IFn$_invoke$arity$1 = G__2438__1;
|
|
G__2438.cljs$core$IFn$_invoke$arity$2 = G__2438__2;
|
|
return G__2438;
|
|
})()
|
|
;
|
|
|
|
cljs.core.BlackNode.prototype.indexOf = (function() {
|
|
var G__2439 = null;
|
|
var G__2439__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2439__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2439 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2439__1.call(this,x);
|
|
case 2:
|
|
return G__2439__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2439.cljs$core$IFn$_invoke$arity$1 = G__2439__1;
|
|
G__2439.cljs$core$IFn$_invoke$arity$2 = G__2439__2;
|
|
return G__2439;
|
|
})()
|
|
;
|
|
|
|
cljs.core.BlackNode.prototype.add_right = (function (ins){
|
|
var self__ = this;
|
|
var node = this;
|
|
return ins.balance_right(node);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.redden = (function (){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(self__.key,self__.val,self__.left,self__.right,null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.blacken = (function (){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.add_left = (function (ins){
|
|
var self__ = this;
|
|
var node = this;
|
|
return ins.balance_left(node);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.replace = (function (key__$1,val__$1,left__$1,right__$1){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.BlackNode(key__$1,val__$1,left__$1,right__$1,null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.balance_left = (function (parent){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.BlackNode(parent.key,parent.val,node,parent.right,null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.balance_right = (function (parent){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.BlackNode(parent.key,parent.val,parent.left,node,null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.remove_left = (function (del){
|
|
var self__ = this;
|
|
var node = this;
|
|
return cljs.core.balance_left_del(self__.key,self__.val,del,self__.right);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.kv_reduce = (function (f,init){
|
|
var self__ = this;
|
|
var node = this;
|
|
return cljs.core.tree_map_kv_reduce(node,f,init);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.remove_right = (function (del){
|
|
var self__ = this;
|
|
var node = this;
|
|
return cljs.core.balance_right_del(self__.key,self__.val,self__.left,del);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (2);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.key;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (((k === (0))) || ((k === (1))));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core._with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.call = (function() {
|
|
var G__2440 = null;
|
|
var G__2440__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
var G__2440__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
G__2440 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2440__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2440__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2440.cljs$core$IFn$_invoke$arity$2 = G__2440__2;
|
|
G__2440.cljs$core$IFn$_invoke$arity$3 = G__2440__3;
|
|
return G__2440;
|
|
})()
|
|
;
|
|
|
|
cljs.core.BlackNode.prototype.apply = (function (self__,args2435){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2435)));
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.BlackNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.cst$sym$left,cljs.core.cst$sym$right,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.BlackNode.cljs$lang$type = true;
|
|
|
|
cljs.core.BlackNode.cljs$lang$ctorStr = "cljs.core/BlackNode";
|
|
|
|
cljs.core.BlackNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/BlackNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/BlackNode.
|
|
*/
|
|
cljs.core.__GT_BlackNode = (function cljs$core$__GT_BlackNode(key,val,left,right,__hash){
|
|
return (new cljs.core.BlackNode(key,val,left,right,__hash));
|
|
});
|
|
|
|
var G__2441_2444 = cljs.core.BlackNode.prototype;
|
|
var G__2442_2445 = cljs.core.ITER_SYMBOL;
|
|
var G__2443_2446 = ((function (G__2441_2444,G__2442_2445){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2441_2444,G__2442_2445))
|
|
;
|
|
goog.object.set(G__2441_2444,G__2442_2445,G__2443_2446);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IVector}
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.IStack}
|
|
* @implements {cljs.core.IMapEntry}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.ILookup}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.RedNode = (function (key,val,left,right,__hash){
|
|
this.key = key;
|
|
this.val = val;
|
|
this.left = left;
|
|
this.right = right;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 166619935;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.RedNode.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IFind$_find$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
var G__2448 = k;
|
|
switch (G__2448) {
|
|
case (0):
|
|
return (new cljs.core.MapEntry((0),self__.key,null));
|
|
|
|
break;
|
|
case (1):
|
|
return (new cljs.core.MapEntry((1),self__.val,null));
|
|
|
|
break;
|
|
default:
|
|
return null;
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.lastIndexOf = (function() {
|
|
var G__2450 = null;
|
|
var G__2450__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2450__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2450 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2450__1.call(this,x);
|
|
case 2:
|
|
return G__2450__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2450.cljs$core$IFn$_invoke$arity$1 = G__2450__1;
|
|
G__2450.cljs$core$IFn$_invoke$arity$2 = G__2450__2;
|
|
return G__2450;
|
|
})()
|
|
;
|
|
|
|
cljs.core.RedNode.prototype.indexOf = (function() {
|
|
var G__2451 = null;
|
|
var G__2451__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2451__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2451 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2451__1.call(this,x);
|
|
case 2:
|
|
return G__2451__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2451.cljs$core$IFn$_invoke$arity$1 = G__2451__1;
|
|
G__2451.cljs$core$IFn$_invoke$arity$2 = G__2451__2;
|
|
return G__2451;
|
|
})()
|
|
;
|
|
|
|
cljs.core.RedNode.prototype.add_right = (function (ins){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(self__.key,self__.val,self__.left,ins,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.redden = (function (){
|
|
var self__ = this;
|
|
var node = this;
|
|
throw (new Error("red-black tree invariant violation"));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.blacken = (function (){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.BlackNode(self__.key,self__.val,self__.left,self__.right,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.add_left = (function (ins){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(self__.key,self__.val,ins,self__.right,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.replace = (function (key__$1,val__$1,left__$1,right__$1){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(key__$1,val__$1,left__$1,right__$1,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.balance_left = (function (parent){
|
|
var self__ = this;
|
|
var node = this;
|
|
if((self__.left instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(self__.key,self__.val,self__.left.blacken(),(new cljs.core.BlackNode(parent.key,parent.val,self__.right,parent.right,null)),null));
|
|
} else {
|
|
if((self__.right instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(self__.right.key,self__.right.val,(new cljs.core.BlackNode(self__.key,self__.val,self__.left,self__.right.left,null)),(new cljs.core.BlackNode(parent.key,parent.val,self__.right.right,parent.right,null)),null));
|
|
} else {
|
|
return (new cljs.core.BlackNode(parent.key,parent.val,node,parent.right,null));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.balance_right = (function (parent){
|
|
var self__ = this;
|
|
var node = this;
|
|
if((self__.right instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(self__.key,self__.val,(new cljs.core.BlackNode(parent.key,parent.val,parent.left,self__.left,null)),self__.right.blacken(),null));
|
|
} else {
|
|
if((self__.left instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(self__.left.key,self__.left.val,(new cljs.core.BlackNode(parent.key,parent.val,parent.left,self__.left.left,null)),(new cljs.core.BlackNode(self__.key,self__.val,self__.left.right,self__.right,null)),null));
|
|
} else {
|
|
return (new cljs.core.BlackNode(parent.key,parent.val,parent.left,node,null));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.remove_left = (function (del){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(self__.key,self__.val,del,self__.right,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.kv_reduce = (function (f,init){
|
|
var self__ = this;
|
|
var node = this;
|
|
return cljs.core.tree_map_kv_reduce(node,f,init);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.remove_right = (function (del){
|
|
var self__ = this;
|
|
var node = this;
|
|
return (new cljs.core.RedNode(self__.key,self__.val,self__.left,del,null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (node,k,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return node__$1.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (node,n){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (node,n,not_found){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
if((n === (0))){
|
|
return self__.key;
|
|
} else {
|
|
if((n === (1))){
|
|
return self__.val;
|
|
} else {
|
|
return not_found;
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IVector$_assoc_n$arity$3 = (function (node,n,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null).cljs$core$IVector$_assoc_n$arity$3(null,n,v);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IMeta$_meta$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$ICounted$_count$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (2);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IMapEntry$_key$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.key;
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IMapEntry$_val$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IStack$_peek$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return self__.val;
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IStack$_pop$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key], null);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.val,self__.key],(0),null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return null;
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (node,f){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(node__$1,f);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (node,f,start){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$3(node__$1,f,start);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (node,k,v){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),k,v);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (node,k){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (((k === (0))) || ((k === (1))));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (node){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return (new cljs.core.IndexedSeq([self__.key,self__.val],(0),null));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (node,meta){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return cljs.core._with_meta(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val], null),meta);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$ICollection$_conj$arity$2 = (function (node,o){
|
|
var self__ = this;
|
|
var node__$1 = this;
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [self__.key,self__.val,o], null);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.call = (function() {
|
|
var G__2452 = null;
|
|
var G__2452__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
var G__2452__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var node = self____$1;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
G__2452 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2452__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2452__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2452.cljs$core$IFn$_invoke$arity$2 = G__2452__2;
|
|
G__2452.cljs$core$IFn$_invoke$arity$3 = G__2452__3;
|
|
return G__2452;
|
|
})()
|
|
;
|
|
|
|
cljs.core.RedNode.prototype.apply = (function (self__,args2447){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2447)));
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var node = this;
|
|
return node.cljs$core$IIndexed$_nth$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.RedNode.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$key,cljs.core.cst$sym$val,cljs.core.cst$sym$left,cljs.core.cst$sym$right,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.RedNode.cljs$lang$type = true;
|
|
|
|
cljs.core.RedNode.cljs$lang$ctorStr = "cljs.core/RedNode";
|
|
|
|
cljs.core.RedNode.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/RedNode");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/RedNode.
|
|
*/
|
|
cljs.core.__GT_RedNode = (function cljs$core$__GT_RedNode(key,val,left,right,__hash){
|
|
return (new cljs.core.RedNode(key,val,left,right,__hash));
|
|
});
|
|
|
|
var G__2453_2456 = cljs.core.RedNode.prototype;
|
|
var G__2454_2457 = cljs.core.ITER_SYMBOL;
|
|
var G__2455_2458 = ((function (G__2453_2456,G__2454_2457){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2453_2456,G__2454_2457))
|
|
;
|
|
goog.object.set(G__2453_2456,G__2454_2457,G__2455_2458);
|
|
cljs.core.tree_map_add = (function cljs$core$tree_map_add(comp,tree,k,v,found){
|
|
if((tree == null)){
|
|
return (new cljs.core.RedNode(k,v,null,null,null));
|
|
} else {
|
|
var c = (function (){var G__2459 = k;
|
|
var G__2460 = tree.key;
|
|
return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2459,G__2460) : comp.call(null,G__2459,G__2460));
|
|
})();
|
|
if((c === (0))){
|
|
(found[(0)] = tree);
|
|
|
|
return null;
|
|
} else {
|
|
if((c < (0))){
|
|
var ins = (function (){var G__2461 = comp;
|
|
var G__2462 = tree.left;
|
|
var G__2463 = k;
|
|
var G__2464 = v;
|
|
var G__2465 = found;
|
|
return (cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5 ? cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5(G__2461,G__2462,G__2463,G__2464,G__2465) : cljs.core.tree_map_add.call(null,G__2461,G__2462,G__2463,G__2464,G__2465));
|
|
})();
|
|
if((!((ins == null)))){
|
|
return tree.add_left(ins);
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
var ins = (function (){var G__2466 = comp;
|
|
var G__2467 = tree.right;
|
|
var G__2468 = k;
|
|
var G__2469 = v;
|
|
var G__2470 = found;
|
|
return (cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5 ? cljs.core.tree_map_add.cljs$core$IFn$_invoke$arity$5(G__2466,G__2467,G__2468,G__2469,G__2470) : cljs.core.tree_map_add.call(null,G__2466,G__2467,G__2468,G__2469,G__2470));
|
|
})();
|
|
if((!((ins == null)))){
|
|
return tree.add_right(ins);
|
|
} else {
|
|
return null;
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.tree_map_append = (function cljs$core$tree_map_append(left,right){
|
|
if((left == null)){
|
|
return right;
|
|
} else {
|
|
if((right == null)){
|
|
return left;
|
|
} else {
|
|
if((left instanceof cljs.core.RedNode)){
|
|
if((right instanceof cljs.core.RedNode)){
|
|
var app = (function (){var G__2471 = left.right;
|
|
var G__2472 = right.left;
|
|
return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2471,G__2472) : cljs.core.tree_map_append.call(null,G__2471,G__2472));
|
|
})();
|
|
if((app instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(app.key,app.val,(new cljs.core.RedNode(left.key,left.val,left.left,app.left,null)),(new cljs.core.RedNode(right.key,right.val,app.right,right.right,null)),null));
|
|
} else {
|
|
return (new cljs.core.RedNode(left.key,left.val,left.left,(new cljs.core.RedNode(right.key,right.val,app,right.right,null)),null));
|
|
}
|
|
} else {
|
|
return (new cljs.core.RedNode(left.key,left.val,left.left,(function (){var G__2473 = left.right;
|
|
var G__2474 = right;
|
|
return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2473,G__2474) : cljs.core.tree_map_append.call(null,G__2473,G__2474));
|
|
})(),null));
|
|
}
|
|
} else {
|
|
if((right instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(right.key,right.val,(function (){var G__2475 = left;
|
|
var G__2476 = right.left;
|
|
return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2475,G__2476) : cljs.core.tree_map_append.call(null,G__2475,G__2476));
|
|
})(),right.right,null));
|
|
} else {
|
|
var app = (function (){var G__2477 = left.right;
|
|
var G__2478 = right.left;
|
|
return (cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2 ? cljs.core.tree_map_append.cljs$core$IFn$_invoke$arity$2(G__2477,G__2478) : cljs.core.tree_map_append.call(null,G__2477,G__2478));
|
|
})();
|
|
if((app instanceof cljs.core.RedNode)){
|
|
return (new cljs.core.RedNode(app.key,app.val,(new cljs.core.BlackNode(left.key,left.val,left.left,app.left,null)),(new cljs.core.BlackNode(right.key,right.val,app.right,right.right,null)),null));
|
|
} else {
|
|
return cljs.core.balance_left_del(left.key,left.val,left.left,(new cljs.core.BlackNode(right.key,right.val,app,right.right,null)));
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.tree_map_remove = (function cljs$core$tree_map_remove(comp,tree,k,found){
|
|
if((!((tree == null)))){
|
|
var c = (function (){var G__2479 = k;
|
|
var G__2480 = tree.key;
|
|
return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2479,G__2480) : comp.call(null,G__2479,G__2480));
|
|
})();
|
|
if((c === (0))){
|
|
(found[(0)] = tree);
|
|
|
|
return cljs.core.tree_map_append(tree.left,tree.right);
|
|
} else {
|
|
if((c < (0))){
|
|
var del = (function (){var G__2481 = comp;
|
|
var G__2482 = tree.left;
|
|
var G__2483 = k;
|
|
var G__2484 = found;
|
|
return (cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4(G__2481,G__2482,G__2483,G__2484) : cljs.core.tree_map_remove.call(null,G__2481,G__2482,G__2483,G__2484));
|
|
})();
|
|
if((((!((del == null)))) || ((!(((found[(0)]) == null)))))){
|
|
if((tree.left instanceof cljs.core.BlackNode)){
|
|
return cljs.core.balance_left_del(tree.key,tree.val,del,tree.right);
|
|
} else {
|
|
return (new cljs.core.RedNode(tree.key,tree.val,del,tree.right,null));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
var del = (function (){var G__2485 = comp;
|
|
var G__2486 = tree.right;
|
|
var G__2487 = k;
|
|
var G__2488 = found;
|
|
return (cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_remove.cljs$core$IFn$_invoke$arity$4(G__2485,G__2486,G__2487,G__2488) : cljs.core.tree_map_remove.call(null,G__2485,G__2486,G__2487,G__2488));
|
|
})();
|
|
if((((!((del == null)))) || ((!(((found[(0)]) == null)))))){
|
|
if((tree.right instanceof cljs.core.BlackNode)){
|
|
return cljs.core.balance_right_del(tree.key,tree.val,tree.left,del);
|
|
} else {
|
|
return (new cljs.core.RedNode(tree.key,tree.val,tree.left,del,null));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
cljs.core.tree_map_replace = (function cljs$core$tree_map_replace(comp,tree,k,v){
|
|
var tk = tree.key;
|
|
var c = (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(k,tk) : comp.call(null,k,tk));
|
|
if((c === (0))){
|
|
return tree.replace(tk,v,tree.left,tree.right);
|
|
} else {
|
|
if((c < (0))){
|
|
return tree.replace(tk,tree.val,(function (){var G__2489 = comp;
|
|
var G__2490 = tree.left;
|
|
var G__2491 = k;
|
|
var G__2492 = v;
|
|
return (cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4(G__2489,G__2490,G__2491,G__2492) : cljs.core.tree_map_replace.call(null,G__2489,G__2490,G__2491,G__2492));
|
|
})(),tree.right);
|
|
} else {
|
|
return tree.replace(tk,tree.val,tree.left,(function (){var G__2493 = comp;
|
|
var G__2494 = tree.right;
|
|
var G__2495 = k;
|
|
var G__2496 = v;
|
|
return (cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4 ? cljs.core.tree_map_replace.cljs$core$IFn$_invoke$arity$4(G__2493,G__2494,G__2495,G__2496) : cljs.core.tree_map_replace.call(null,G__2493,G__2494,G__2495,G__2496));
|
|
})());
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IKVReduce}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IFind}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISorted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IAssociative}
|
|
* @implements {cljs.core.IMap}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.PersistentTreeMap = (function (comp,tree,cnt,meta,__hash){
|
|
this.comp = comp;
|
|
this.tree = tree;
|
|
this.cnt = cnt;
|
|
this.meta = meta;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 418776847;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IFind$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IFind$_find$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.entry_at(k);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.forEach = (function (f){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var seq__2498 = cljs.core.seq(coll);
|
|
var chunk__2499 = null;
|
|
var count__2500 = (0);
|
|
var i__2501 = (0);
|
|
while(true){
|
|
if((i__2501 < count__2500)){
|
|
var vec__2502 = chunk__2499.cljs$core$IIndexed$_nth$arity$2(null,i__2501);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2502,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2502,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2512 = seq__2498;
|
|
var G__2513 = chunk__2499;
|
|
var G__2514 = count__2500;
|
|
var G__2515 = (i__2501 + (1));
|
|
seq__2498 = G__2512;
|
|
chunk__2499 = G__2513;
|
|
count__2500 = G__2514;
|
|
i__2501 = G__2515;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2498);
|
|
if(temp__5457__auto__){
|
|
var seq__2498__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2498__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2498__$1);
|
|
var G__2516 = cljs.core.chunk_rest(seq__2498__$1);
|
|
var G__2517 = c__4461__auto__;
|
|
var G__2518 = cljs.core.count(c__4461__auto__);
|
|
var G__2519 = (0);
|
|
seq__2498 = G__2516;
|
|
chunk__2499 = G__2517;
|
|
count__2500 = G__2518;
|
|
i__2501 = G__2519;
|
|
continue;
|
|
} else {
|
|
var vec__2505 = cljs.core.first(seq__2498__$1);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2505,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2505,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2520 = cljs.core.next(seq__2498__$1);
|
|
var G__2521 = null;
|
|
var G__2522 = (0);
|
|
var G__2523 = (0);
|
|
seq__2498 = G__2520;
|
|
chunk__2499 = G__2521;
|
|
count__2500 = G__2522;
|
|
i__2501 = G__2523;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.get = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.entries = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_entries_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.keys = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.keys(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.values = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.vals(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.entry_at = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var t = self__.tree;
|
|
while(true){
|
|
if((!((t == null)))){
|
|
var c = (function (){var G__2508 = k;
|
|
var G__2509 = t.key;
|
|
return (self__.comp.cljs$core$IFn$_invoke$arity$2 ? self__.comp.cljs$core$IFn$_invoke$arity$2(G__2508,G__2509) : self__.comp.call(null,G__2508,G__2509));
|
|
})();
|
|
if((c === (0))){
|
|
return t;
|
|
} else {
|
|
if((c < (0))){
|
|
var G__2524 = t.left;
|
|
t = G__2524;
|
|
continue;
|
|
} else {
|
|
var G__2525 = t.right;
|
|
t = G__2525;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.has = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.contains_QMARK_(coll,k);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,k,null);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,k,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var n = coll__$1.entry_at(k);
|
|
if((!((n == null)))){
|
|
return n.val;
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IKVReduce$_kv_reduce$arity$3 = (function (coll,f,init){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((!((self__.tree == null)))){
|
|
return cljs.core.unreduced(cljs.core.tree_map_kv_reduce(self__.tree,f,init));
|
|
} else {
|
|
return init;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,self__.tree,self__.cnt,self__.meta,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.cnt;
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
return cljs.core.create_tree_map_seq(self__.tree,false,self__.cnt);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_map(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,null,(0),self__.meta,(0)));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IMap$_dissoc$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var found = [null];
|
|
var t = cljs.core.tree_map_remove(self__.comp,self__.tree,k,found);
|
|
if((t == null)){
|
|
if((cljs.core.nth.cljs$core$IFn$_invoke$arity$2(found,(0)) == null)){
|
|
return coll__$1;
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,null,(0),self__.meta,null));
|
|
}
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,t.blacken(),(self__.cnt - (1)),self__.meta,null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IAssociative$_assoc$arity$3 = (function (coll,k,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var found = [null];
|
|
var t = cljs.core.tree_map_add(self__.comp,self__.tree,k,v,found);
|
|
if((t == null)){
|
|
var found_node = cljs.core.nth.cljs$core$IFn$_invoke$arity$2(found,(0));
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(v,found_node.val)){
|
|
return coll__$1;
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,cljs.core.tree_map_replace(self__.comp,self__.tree,k,v),self__.cnt,self__.meta,null));
|
|
}
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,t.blacken(),(self__.cnt + (1)),self__.meta,null));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IAssociative$_contains_key_QMARK_$arity$2 = (function (coll,k){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (!((coll__$1.entry_at(k) == null)));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
return cljs.core.create_tree_map_seq(self__.tree,true,self__.cnt);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeMap(self__.comp,self__.tree,self__.cnt,meta__$1,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if(cljs.core.vector_QMARK_(entry)){
|
|
return coll__$1.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(entry,(1)));
|
|
} else {
|
|
var ret = coll__$1;
|
|
var es = cljs.core.seq(entry);
|
|
while(true){
|
|
if((es == null)){
|
|
return ret;
|
|
} else {
|
|
var e = cljs.core.first(es);
|
|
if(cljs.core.vector_QMARK_(e)){
|
|
var G__2526 = ret.cljs$core$IAssociative$_assoc$arity$3(null,cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(0)),cljs.core._nth.cljs$core$IFn$_invoke$arity$2(e,(1)));
|
|
var G__2527 = cljs.core.next(es);
|
|
ret = G__2526;
|
|
es = G__2527;
|
|
continue;
|
|
} else {
|
|
throw (new Error("conj on a map takes map entries or seqables of map entries"));
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.call = (function() {
|
|
var G__2528 = null;
|
|
var G__2528__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2528__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2528 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2528__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2528__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2528.cljs$core$IFn$_invoke$arity$2 = G__2528__2;
|
|
G__2528.cljs$core$IFn$_invoke$arity$3 = G__2528__3;
|
|
return G__2528;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentTreeMap.prototype.apply = (function (self__,args2497){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2497)));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_sorted_seq$arity$2 = (function (coll,ascending_QMARK_){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
return cljs.core.create_tree_map_seq(self__.tree,ascending_QMARK_,self__.cnt);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_sorted_seq_from$arity$3 = (function (coll,k,ascending_QMARK_){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((self__.cnt > (0))){
|
|
var stack = null;
|
|
var t = self__.tree;
|
|
while(true){
|
|
if((!((t == null)))){
|
|
var c = (function (){var G__2510 = k;
|
|
var G__2511 = t.key;
|
|
return (self__.comp.cljs$core$IFn$_invoke$arity$2 ? self__.comp.cljs$core$IFn$_invoke$arity$2(G__2510,G__2511) : self__.comp.call(null,G__2510,G__2511));
|
|
})();
|
|
if((c === (0))){
|
|
return (new cljs.core.PersistentTreeMapSeq(null,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t),ascending_QMARK_,(-1),null));
|
|
} else {
|
|
if(cljs.core.truth_(ascending_QMARK_)){
|
|
if((c < (0))){
|
|
var G__2529 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t);
|
|
var G__2530 = t.left;
|
|
stack = G__2529;
|
|
t = G__2530;
|
|
continue;
|
|
} else {
|
|
var G__2531 = stack;
|
|
var G__2532 = t.right;
|
|
stack = G__2531;
|
|
t = G__2532;
|
|
continue;
|
|
}
|
|
} else {
|
|
if((c > (0))){
|
|
var G__2533 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(stack,t);
|
|
var G__2534 = t.right;
|
|
stack = G__2533;
|
|
t = G__2534;
|
|
continue;
|
|
} else {
|
|
var G__2535 = stack;
|
|
var G__2536 = t.left;
|
|
stack = G__2535;
|
|
t = G__2536;
|
|
continue;
|
|
}
|
|
|
|
}
|
|
}
|
|
} else {
|
|
if((stack == null)){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.PersistentTreeMapSeq(null,stack,ascending_QMARK_,(-1),null));
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_entry_key$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.key(entry);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$ISorted$_comparator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.comp;
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$comp,cljs.core.cst$sym$tree,cljs.core.cst$sym$cnt,cljs.core.cst$sym$meta,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentTreeMap.cljs$lang$ctorStr = "cljs.core/PersistentTreeMap";
|
|
|
|
cljs.core.PersistentTreeMap.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentTreeMap");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentTreeMap.
|
|
*/
|
|
cljs.core.__GT_PersistentTreeMap = (function cljs$core$__GT_PersistentTreeMap(comp,tree,cnt,meta,__hash){
|
|
return (new cljs.core.PersistentTreeMap(comp,tree,cnt,meta,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.EMPTY = (new cljs.core.PersistentTreeMap(cljs.core.compare,null,(0),null,cljs.core.empty_unordered_hash));
|
|
var G__2537_2540 = cljs.core.PersistentTreeMap.prototype;
|
|
var G__2538_2541 = cljs.core.ITER_SYMBOL;
|
|
var G__2539_2542 = ((function (G__2537_2540,G__2538_2541){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2537_2540,G__2538_2541))
|
|
;
|
|
goog.object.set(G__2537_2540,G__2538_2541,G__2539_2542);
|
|
/**
|
|
* keyval => key val
|
|
* Returns a new hash map with supplied mappings.
|
|
*/
|
|
cljs.core.hash_map = (function cljs$core$hash_map(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2544 = arguments.length;
|
|
var i__4642__auto___2545 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2545 < len__4641__auto___2544)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2545]));
|
|
|
|
var G__2546 = (i__4642__auto___2545 + (1));
|
|
i__4642__auto___2545 = G__2546;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.hash_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.hash_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
|
|
var in$ = cljs.core.seq(keyvals);
|
|
var out = cljs.core.transient$(cljs.core.PersistentHashMap.EMPTY);
|
|
while(true){
|
|
if(in$){
|
|
var G__2547 = cljs.core.nnext(in$);
|
|
var G__2548 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
|
|
in$ = G__2547;
|
|
out = G__2548;
|
|
continue;
|
|
} else {
|
|
return cljs.core.persistent_BANG_(out);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.hash_map.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.hash_map.cljs$lang$applyTo = (function (seq2543){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2543));
|
|
});
|
|
|
|
/**
|
|
* keyval => key val
|
|
* Returns a new array map with supplied mappings.
|
|
*/
|
|
cljs.core.array_map = (function cljs$core$array_map(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2550 = arguments.length;
|
|
var i__4642__auto___2551 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2551 < len__4641__auto___2550)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2551]));
|
|
|
|
var G__2552 = (i__4642__auto___2551 + (1));
|
|
i__4642__auto___2551 = G__2552;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.array_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.array_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
|
|
var arr = (((((keyvals instanceof cljs.core.IndexedSeq)) && ((keyvals.i === (0)))))?keyvals.arr:cljs.core.into_array.cljs$core$IFn$_invoke$arity$1(keyvals));
|
|
return cljs.core.PersistentArrayMap.createAsIfByAssoc(arr);
|
|
});
|
|
|
|
cljs.core.array_map.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.array_map.cljs$lang$applyTo = (function (seq2549){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2549));
|
|
});
|
|
|
|
/**
|
|
* keyval => key val
|
|
* Returns a new object map with supplied mappings.
|
|
*/
|
|
cljs.core.obj_map = (function cljs$core$obj_map(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2559 = arguments.length;
|
|
var i__4642__auto___2560 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2560 < len__4641__auto___2559)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2560]));
|
|
|
|
var G__2561 = (i__4642__auto___2560 + (1));
|
|
i__4642__auto___2560 = G__2561;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.obj_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.obj_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
|
|
var ks = [];
|
|
var obj = {};
|
|
var kvs = cljs.core.seq(keyvals);
|
|
while(true){
|
|
if(kvs){
|
|
ks.push(cljs.core.first(kvs));
|
|
|
|
var G__2556_2562 = obj;
|
|
var G__2557_2563 = cljs.core.first(kvs);
|
|
var G__2558_2564 = cljs.core.second(kvs);
|
|
goog.object.set(G__2556_2562,G__2557_2563,G__2558_2564);
|
|
|
|
var G__2565 = cljs.core.nnext(kvs);
|
|
kvs = G__2565;
|
|
continue;
|
|
} else {
|
|
return cljs.core.ObjMap.fromObject(ks,obj);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.obj_map.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.obj_map.cljs$lang$applyTo = (function (seq2553){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2553));
|
|
});
|
|
|
|
/**
|
|
* keyval => key val
|
|
* Returns a new sorted map with supplied mappings.
|
|
*/
|
|
cljs.core.sorted_map = (function cljs$core$sorted_map(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2567 = arguments.length;
|
|
var i__4642__auto___2568 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2568 < len__4641__auto___2567)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2568]));
|
|
|
|
var G__2569 = (i__4642__auto___2568 + (1));
|
|
i__4642__auto___2568 = G__2569;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.sorted_map.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.sorted_map.cljs$core$IFn$_invoke$arity$variadic = (function (keyvals){
|
|
var in$ = cljs.core.seq(keyvals);
|
|
var out = cljs.core.PersistentTreeMap.EMPTY;
|
|
while(true){
|
|
if(in$){
|
|
var G__2570 = cljs.core.nnext(in$);
|
|
var G__2571 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
|
|
in$ = G__2570;
|
|
out = G__2571;
|
|
continue;
|
|
} else {
|
|
return out;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.sorted_map.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.sorted_map.cljs$lang$applyTo = (function (seq2566){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2566));
|
|
});
|
|
|
|
/**
|
|
* keyval => key val
|
|
* Returns a new sorted map with supplied mappings, using the supplied comparator.
|
|
*/
|
|
cljs.core.sorted_map_by = (function cljs$core$sorted_map_by(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2574 = arguments.length;
|
|
var i__4642__auto___2575 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2575 < len__4641__auto___2574)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2575]));
|
|
|
|
var G__2576 = (i__4642__auto___2575 + (1));
|
|
i__4642__auto___2575 = G__2576;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.sorted_map_by.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.sorted_map_by.cljs$core$IFn$_invoke$arity$variadic = (function (comparator,keyvals){
|
|
var in$ = cljs.core.seq(keyvals);
|
|
var out = (new cljs.core.PersistentTreeMap(cljs.core.fn__GT_comparator(comparator),null,(0),null,(0)));
|
|
while(true){
|
|
if(in$){
|
|
var G__2577 = cljs.core.nnext(in$);
|
|
var G__2578 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(out,cljs.core.first(in$),cljs.core.second(in$));
|
|
in$ = G__2577;
|
|
out = G__2578;
|
|
continue;
|
|
} else {
|
|
return out;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.sorted_map_by.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.sorted_map_by.cljs$lang$applyTo = (function (seq2572){
|
|
var G__2573 = cljs.core.first(seq2572);
|
|
var seq2572__$1 = cljs.core.next(seq2572);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2573,seq2572__$1);
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.KeySeq = (function (mseq,_meta){
|
|
this.mseq = mseq;
|
|
this._meta = _meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.KeySeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.indexOf = (function() {
|
|
var G__2581 = null;
|
|
var G__2581__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2581__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2581 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2581__1.call(this,x);
|
|
case 2:
|
|
return G__2581__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2581.cljs$core$IFn$_invoke$arity$1 = G__2581__1;
|
|
G__2581.cljs$core$IFn$_invoke$arity$2 = G__2581__2;
|
|
return G__2581;
|
|
})()
|
|
;
|
|
|
|
cljs.core.KeySeq.prototype.lastIndexOf = (function() {
|
|
var G__2582 = null;
|
|
var G__2582__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2582__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2582 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2582__1.call(this,x);
|
|
case 2:
|
|
return G__2582__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2582.cljs$core$IFn$_invoke$arity$1 = G__2582__1;
|
|
G__2582.cljs$core$IFn$_invoke$arity$2 = G__2582__2;
|
|
return G__2582;
|
|
})()
|
|
;
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__._meta;
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var nseq = (((((!((self__.mseq == null))))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
|
|
if((nseq == null)){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.KeySeq(nseq,self__._meta));
|
|
}
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.hash_ordered_coll(coll__$1);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var me = self__.mseq.cljs$core$ISeq$_first$arity$1(null);
|
|
return me.cljs$core$IMapEntry$_key$arity$1(null);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var nseq = (((((!((self__.mseq == null))))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
|
|
if((!((nseq == null)))){
|
|
return (new cljs.core.KeySeq(nseq,self__._meta));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.KeySeq(self__.mseq,new_meta));
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.KeySeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$mseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.cst$sym$_meta], null);
|
|
});
|
|
|
|
cljs.core.KeySeq.cljs$lang$type = true;
|
|
|
|
cljs.core.KeySeq.cljs$lang$ctorStr = "cljs.core/KeySeq";
|
|
|
|
cljs.core.KeySeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/KeySeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/KeySeq.
|
|
*/
|
|
cljs.core.__GT_KeySeq = (function cljs$core$__GT_KeySeq(mseq,_meta){
|
|
return (new cljs.core.KeySeq(mseq,_meta));
|
|
});
|
|
|
|
var G__2583_2586 = cljs.core.KeySeq.prototype;
|
|
var G__2584_2587 = cljs.core.ITER_SYMBOL;
|
|
var G__2585_2588 = ((function (G__2583_2586,G__2584_2587){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2583_2586,G__2584_2587))
|
|
;
|
|
goog.object.set(G__2583_2586,G__2584_2587,G__2585_2588);
|
|
/**
|
|
* Returns a sequence of the map's keys.
|
|
*/
|
|
cljs.core.keys = (function cljs$core$keys(hash_map){
|
|
var temp__5457__auto__ = cljs.core.seq(hash_map);
|
|
if(temp__5457__auto__){
|
|
var mseq = temp__5457__auto__;
|
|
return (new cljs.core.KeySeq(mseq,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the key of the map entry.
|
|
*/
|
|
cljs.core.key = (function cljs$core$key(map_entry){
|
|
return cljs.core._key(map_entry);
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.ValSeq = (function (mseq,_meta){
|
|
this.mseq = mseq;
|
|
this._meta = _meta;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32374988;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.ValSeq.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.indexOf = (function() {
|
|
var G__2591 = null;
|
|
var G__2591__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2591__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2591 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2591__1.call(this,x);
|
|
case 2:
|
|
return G__2591__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2591.cljs$core$IFn$_invoke$arity$1 = G__2591__1;
|
|
G__2591.cljs$core$IFn$_invoke$arity$2 = G__2591__2;
|
|
return G__2591;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ValSeq.prototype.lastIndexOf = (function() {
|
|
var G__2592 = null;
|
|
var G__2592__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2592__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start);
|
|
});
|
|
G__2592 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2592__1.call(this,x);
|
|
case 2:
|
|
return G__2592__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2592.cljs$core$IFn$_invoke$arity$1 = G__2592__1;
|
|
G__2592.cljs$core$IFn$_invoke$arity$2 = G__2592__2;
|
|
return G__2592;
|
|
})()
|
|
;
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__._meta;
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$INext$_next$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var nseq = (((((!((self__.mseq == null))))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
|
|
if((nseq == null)){
|
|
return null;
|
|
} else {
|
|
return (new cljs.core.ValSeq(nseq,self__._meta));
|
|
}
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.hash_ordered_coll(coll__$1);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.equiv_sequential(coll__$1,other);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__._meta);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (coll,f){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$2(f,coll__$1);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (coll,f,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.seq_reduce.cljs$core$IFn$_invoke$arity$3(f,start,coll__$1);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$ISeq$_first$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var me = self__.mseq.cljs$core$ISeq$_first$arity$1(null);
|
|
return me.cljs$core$IMapEntry$_val$arity$1(null);
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$ISeq$_rest$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var nseq = (((((!((self__.mseq == null))))?(((((self__.mseq.cljs$lang$protocol_mask$partition0$ & (128))) || ((cljs.core.PROTOCOL_SENTINEL === self__.mseq.cljs$core$INext$))))?true:(((!self__.mseq.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq):false)):cljs.core.native_satisfies_QMARK_(cljs.core.INext,self__.mseq)))?self__.mseq.cljs$core$INext$_next$arity$1(null):cljs.core.next(self__.mseq));
|
|
if((!((nseq == null)))){
|
|
return (new cljs.core.ValSeq(nseq,self__._meta));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1;
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,new_meta){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.ValSeq(self__.mseq,new_meta));
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.cons(o,coll__$1);
|
|
});
|
|
|
|
cljs.core.ValSeq.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$mseq,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$tag,cljs.core.cst$sym$not_DASH_native], null)),cljs.core.cst$sym$_meta], null);
|
|
});
|
|
|
|
cljs.core.ValSeq.cljs$lang$type = true;
|
|
|
|
cljs.core.ValSeq.cljs$lang$ctorStr = "cljs.core/ValSeq";
|
|
|
|
cljs.core.ValSeq.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ValSeq");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ValSeq.
|
|
*/
|
|
cljs.core.__GT_ValSeq = (function cljs$core$__GT_ValSeq(mseq,_meta){
|
|
return (new cljs.core.ValSeq(mseq,_meta));
|
|
});
|
|
|
|
var G__2593_2596 = cljs.core.ValSeq.prototype;
|
|
var G__2594_2597 = cljs.core.ITER_SYMBOL;
|
|
var G__2595_2598 = ((function (G__2593_2596,G__2594_2597){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2593_2596,G__2594_2597))
|
|
;
|
|
goog.object.set(G__2593_2596,G__2594_2597,G__2595_2598);
|
|
/**
|
|
* Returns a sequence of the map's values.
|
|
*/
|
|
cljs.core.vals = (function cljs$core$vals(hash_map){
|
|
var temp__5457__auto__ = cljs.core.seq(hash_map);
|
|
if(temp__5457__auto__){
|
|
var mseq = temp__5457__auto__;
|
|
return (new cljs.core.ValSeq(mseq,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the value in the map entry.
|
|
*/
|
|
cljs.core.val = (function cljs$core$val(map_entry){
|
|
return cljs.core._val(map_entry);
|
|
});
|
|
/**
|
|
* Returns a map that consists of the rest of the maps conj-ed onto
|
|
* the first. If a key occurs in more than one map, the mapping from
|
|
* the latter (left-to-right) will be the mapping in the result.
|
|
*/
|
|
cljs.core.merge = (function cljs$core$merge(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2602 = arguments.length;
|
|
var i__4642__auto___2603 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2603 < len__4641__auto___2602)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2603]));
|
|
|
|
var G__2604 = (i__4642__auto___2603 + (1));
|
|
i__4642__auto___2603 = G__2604;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic = (function (maps){
|
|
if(cljs.core.truth_(cljs.core.some(cljs.core.identity,maps))){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2((function (p1__2599_SHARP_,p2__2600_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2((function (){var or__4047__auto__ = p1__2599_SHARP_;
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.PersistentArrayMap.EMPTY;
|
|
}
|
|
})(),p2__2600_SHARP_);
|
|
}),maps);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.merge.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.merge.cljs$lang$applyTo = (function (seq2601){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2601));
|
|
});
|
|
|
|
/**
|
|
* Returns a map that consists of the rest of the maps conj-ed onto
|
|
* the first. If a key occurs in more than one map, the mapping(s)
|
|
* from the latter (left-to-right) will be combined with the mapping in
|
|
* the result by calling (f val-in-result val-in-latter).
|
|
*/
|
|
cljs.core.merge_with = (function cljs$core$merge_with(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2609 = arguments.length;
|
|
var i__4642__auto___2610 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2610 < len__4641__auto___2609)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2610]));
|
|
|
|
var G__2611 = (i__4642__auto___2610 + (1));
|
|
i__4642__auto___2610 = G__2611;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.merge_with.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.merge_with.cljs$core$IFn$_invoke$arity$variadic = (function (f,maps){
|
|
if(cljs.core.truth_(cljs.core.some(cljs.core.identity,maps))){
|
|
var merge_entry = (function (m,e){
|
|
var k = cljs.core.key(e);
|
|
var v = cljs.core.val(e);
|
|
if(cljs.core.contains_QMARK_(m,k)){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,(function (){var G__2607 = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
|
|
var G__2608 = v;
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2607,G__2608) : f.call(null,G__2607,G__2608));
|
|
})());
|
|
} else {
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,v);
|
|
}
|
|
});
|
|
var merge2 = ((function (merge_entry){
|
|
return (function (m1,m2){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(merge_entry,(function (){var or__4047__auto__ = m1;
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.PersistentArrayMap.EMPTY;
|
|
}
|
|
})(),cljs.core.seq(m2));
|
|
});})(merge_entry))
|
|
;
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$2(merge2,maps);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.merge_with.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.merge_with.cljs$lang$applyTo = (function (seq2605){
|
|
var G__2606 = cljs.core.first(seq2605);
|
|
var seq2605__$1 = cljs.core.next(seq2605);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2606,seq2605__$1);
|
|
});
|
|
|
|
/**
|
|
* Returns a map containing only those entries in map whose key is in keys
|
|
*/
|
|
cljs.core.select_keys = (function cljs$core$select_keys(map,keyseq){
|
|
var ret = cljs.core.PersistentArrayMap.EMPTY;
|
|
var keys = cljs.core.seq(keyseq);
|
|
while(true){
|
|
if(keys){
|
|
var key = cljs.core.first(keys);
|
|
var entry = cljs.core.get.cljs$core$IFn$_invoke$arity$3(map,key,cljs.core.cst$kw$cljs$core_SLASH_not_DASH_found);
|
|
var G__2612 = ((cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(entry,cljs.core.cst$kw$cljs$core_SLASH_not_DASH_found))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,key,entry):ret);
|
|
var G__2613 = cljs.core.next(keys);
|
|
ret = G__2612;
|
|
keys = G__2613;
|
|
continue;
|
|
} else {
|
|
return cljs.core._with_meta(ret,cljs.core.meta(map));
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.HashSetIter = (function (iter){
|
|
this.iter = iter;
|
|
});
|
|
cljs.core.HashSetIter.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.iter.hasNext();
|
|
});
|
|
|
|
cljs.core.HashSetIter.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if(self__.iter.hasNext()){
|
|
return self__.iter.next().key;
|
|
} else {
|
|
throw (new Error("No such element"));
|
|
}
|
|
});
|
|
|
|
cljs.core.HashSetIter.prototype.remove = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (new Error("Unsupported operation"));
|
|
});
|
|
|
|
cljs.core.HashSetIter.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$iter], null);
|
|
});
|
|
|
|
cljs.core.HashSetIter.cljs$lang$type = true;
|
|
|
|
cljs.core.HashSetIter.cljs$lang$ctorStr = "cljs.core/HashSetIter";
|
|
|
|
cljs.core.HashSetIter.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/HashSetIter");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/HashSetIter.
|
|
*/
|
|
cljs.core.__GT_HashSetIter = (function cljs$core$__GT_HashSetIter(iter){
|
|
return (new cljs.core.HashSetIter(iter));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEditableCollection}
|
|
* @implements {cljs.core.ISet}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.PersistentHashSet = (function (meta,hash_map,__hash){
|
|
this.meta = meta;
|
|
this.hash_map = hash_map;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 15077647;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139268;
|
|
});
|
|
cljs.core.PersistentHashSet.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.keys = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.entries = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_set_entries_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.values = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.has = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.contains_QMARK_(coll,k);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.forEach = (function (f){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var seq__2617 = cljs.core.seq(coll);
|
|
var chunk__2618 = null;
|
|
var count__2619 = (0);
|
|
var i__2620 = (0);
|
|
while(true){
|
|
if((i__2620 < count__2619)){
|
|
var vec__2621 = chunk__2618.cljs$core$IIndexed$_nth$arity$2(null,i__2620);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2621,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2621,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2630 = seq__2617;
|
|
var G__2631 = chunk__2618;
|
|
var G__2632 = count__2619;
|
|
var G__2633 = (i__2620 + (1));
|
|
seq__2617 = G__2630;
|
|
chunk__2618 = G__2631;
|
|
count__2619 = G__2632;
|
|
i__2620 = G__2633;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2617);
|
|
if(temp__5457__auto__){
|
|
var seq__2617__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2617__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2617__$1);
|
|
var G__2634 = cljs.core.chunk_rest(seq__2617__$1);
|
|
var G__2635 = c__4461__auto__;
|
|
var G__2636 = cljs.core.count(c__4461__auto__);
|
|
var G__2637 = (0);
|
|
seq__2617 = G__2634;
|
|
chunk__2618 = G__2635;
|
|
count__2619 = G__2636;
|
|
i__2620 = G__2637;
|
|
continue;
|
|
} else {
|
|
var vec__2624 = cljs.core.first(seq__2617__$1);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2624,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2624,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2638 = cljs.core.next(seq__2617__$1);
|
|
var G__2639 = null;
|
|
var G__2640 = (0);
|
|
var G__2641 = (0);
|
|
seq__2617 = G__2638;
|
|
chunk__2618 = G__2639;
|
|
count__2619 = G__2640;
|
|
i__2620 = G__2641;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,v,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var temp__5455__auto__ = cljs.core._find(self__.hash_map,v);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var entry = temp__5455__auto__;
|
|
return cljs.core.key(entry);
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.HashSetIter(cljs.core._iterator(self__.hash_map)));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentHashSet(self__.meta,self__.hash_map,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._count(self__.hash_map);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var and__4036__auto__ = cljs.core.set_QMARK_(other);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = (cljs.core.count(coll__$1) === cljs.core.count(other));
|
|
if(and__4036__auto____$1){
|
|
try{return cljs.core.reduce_kv(((function (and__4036__auto____$1,and__4036__auto__,coll__$1){
|
|
return (function (p1__2615_SHARP_,p2__2614_SHARP_){
|
|
var or__4047__auto__ = cljs.core.contains_QMARK_(other,p2__2614_SHARP_);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.reduced(false);
|
|
}
|
|
});})(and__4036__auto____$1,and__4036__auto__,coll__$1))
|
|
,true,self__.hash_map);
|
|
}catch (e2629){if((e2629 instanceof Error)){
|
|
var ex = e2629;
|
|
return false;
|
|
} else {
|
|
throw e2629;
|
|
|
|
}
|
|
}} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IEditableCollection$_as_transient$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.TransientHashSet(cljs.core._as_transient(self__.hash_map)));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.PersistentHashSet.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ISet$_disjoin$arity$2 = (function (coll,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentHashSet(self__.meta,cljs.core._dissoc(self__.hash_map,v),null));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.keys(self__.hash_map);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentHashSet(meta__$1,self__.hash_map,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentHashSet(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.hash_map,o,null),null));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.call = (function() {
|
|
var G__2642 = null;
|
|
var G__2642__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2642__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2642 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2642__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2642__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2642.cljs$core$IFn$_invoke$arity$2 = G__2642__2;
|
|
G__2642.cljs$core$IFn$_invoke$arity$3 = G__2642__3;
|
|
return G__2642;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentHashSet.prototype.apply = (function (self__,args2616){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2616)));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$hash_DASH_map,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentHashSet.cljs$lang$ctorStr = "cljs.core/PersistentHashSet";
|
|
|
|
cljs.core.PersistentHashSet.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentHashSet");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentHashSet.
|
|
*/
|
|
cljs.core.__GT_PersistentHashSet = (function cljs$core$__GT_PersistentHashSet(meta,hash_map,__hash){
|
|
return (new cljs.core.PersistentHashSet(meta,hash_map,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.EMPTY = (new cljs.core.PersistentHashSet(null,cljs.core.PersistentArrayMap.EMPTY,cljs.core.empty_unordered_hash));
|
|
cljs.core.PersistentHashSet.fromArray = (function (items,no_clone){
|
|
var len = items.length;
|
|
if((len <= cljs.core.PersistentArrayMap.HASHMAP_THRESHOLD)){
|
|
var arr = ((no_clone)?items:cljs.core.aclone(items));
|
|
var i = (0);
|
|
var out = cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__2643 = (i + (1));
|
|
var G__2644 = cljs.core._assoc_BANG_(out,(items[i]),null);
|
|
i = G__2643;
|
|
out = G__2644;
|
|
continue;
|
|
} else {
|
|
return (new cljs.core.PersistentHashSet(null,cljs.core._persistent_BANG_(out),null));
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
var i = (0);
|
|
var out = cljs.core.transient$(cljs.core.PersistentHashSet.EMPTY);
|
|
while(true){
|
|
if((i < len)){
|
|
var G__2645 = (i + (1));
|
|
var G__2646 = cljs.core._conj_BANG_(out,(items[i]));
|
|
i = G__2645;
|
|
out = G__2646;
|
|
continue;
|
|
} else {
|
|
return cljs.core._persistent_BANG_(out);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
cljs.core.PersistentHashSet.createWithCheck = (function (items){
|
|
var len = items.length;
|
|
var t = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
|
|
var n__4518__auto___2647 = len;
|
|
var i_2648 = (0);
|
|
while(true){
|
|
if((i_2648 < n__4518__auto___2647)){
|
|
cljs.core._conj_BANG_(t,(items[i_2648]));
|
|
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(t),(i_2648 + (1)))){
|
|
} else {
|
|
throw (new Error(["Duplicate key: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1((items[i_2648]))].join('')));
|
|
}
|
|
|
|
var G__2649 = (i_2648 + (1));
|
|
i_2648 = G__2649;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core._persistent_BANG_(t);
|
|
});
|
|
cljs.core.PersistentHashSet.createAsIfByAssoc = (function (items){
|
|
var len = items.length;
|
|
var t = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
|
|
var n__4518__auto___2650 = len;
|
|
var i_2651 = (0);
|
|
while(true){
|
|
if((i_2651 < n__4518__auto___2650)){
|
|
cljs.core._conj_BANG_(t,(items[i_2651]));
|
|
|
|
var G__2652 = (i_2651 + (1));
|
|
i_2651 = G__2652;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return cljs.core._persistent_BANG_(t);
|
|
});
|
|
var G__2653_2656 = cljs.core.PersistentHashSet.prototype;
|
|
var G__2654_2657 = cljs.core.ITER_SYMBOL;
|
|
var G__2655_2658 = ((function (G__2653_2656,G__2654_2657){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2653_2656,G__2654_2657))
|
|
;
|
|
goog.object.set(G__2653_2656,G__2654_2657,G__2655_2658);
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ITransientSet}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ITransientCollection}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.TransientHashSet = (function (transient_map){
|
|
this.transient_map = transient_map;
|
|
this.cljs$lang$protocol_mask$partition1$ = 136;
|
|
this.cljs$lang$protocol_mask$partition0$ = 259;
|
|
});
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ITransientCollection$_conj_BANG_$arity$2 = (function (tcoll,o){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
self__.transient_map = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(self__.transient_map,o,null);
|
|
|
|
return tcoll__$1;
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ITransientCollection$_persistent_BANG_$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return (new cljs.core.PersistentHashSet(null,cljs.core.persistent_BANG_(self__.transient_map),null));
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ITransientSet$_disjoin_BANG_$arity$2 = (function (tcoll,v){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
self__.transient_map = cljs.core.dissoc_BANG_.cljs$core$IFn$_invoke$arity$2(self__.transient_map,v);
|
|
|
|
return tcoll__$1;
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (tcoll){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return cljs.core.count(self__.transient_map);
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (tcoll,v){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
return tcoll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (tcoll,v,not_found){
|
|
var self__ = this;
|
|
var tcoll__$1 = this;
|
|
if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,v,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return not_found;
|
|
} else {
|
|
return v;
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.call = (function() {
|
|
var G__2660 = null;
|
|
var G__2660__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return null;
|
|
} else {
|
|
return k;
|
|
}
|
|
});
|
|
var G__2660__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var tcoll = self____$1;
|
|
if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return not_found;
|
|
} else {
|
|
return k;
|
|
}
|
|
});
|
|
G__2660 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2660__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2660__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2660.cljs$core$IFn$_invoke$arity$2 = G__2660__2;
|
|
G__2660.cljs$core$IFn$_invoke$arity$3 = G__2660__3;
|
|
return G__2660;
|
|
})()
|
|
;
|
|
|
|
cljs.core.TransientHashSet.prototype.apply = (function (self__,args2659){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2659)));
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return null;
|
|
} else {
|
|
return k;
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var tcoll = this;
|
|
if((cljs.core._lookup.cljs$core$IFn$_invoke$arity$3(self__.transient_map,k,cljs.core.lookup_sentinel) === cljs.core.lookup_sentinel)){
|
|
return not_found;
|
|
} else {
|
|
return k;
|
|
}
|
|
});
|
|
|
|
cljs.core.TransientHashSet.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$transient_DASH_map,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.TransientHashSet.cljs$lang$type = true;
|
|
|
|
cljs.core.TransientHashSet.cljs$lang$ctorStr = "cljs.core/TransientHashSet";
|
|
|
|
cljs.core.TransientHashSet.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TransientHashSet");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TransientHashSet.
|
|
*/
|
|
cljs.core.__GT_TransientHashSet = (function cljs$core$__GT_TransientHashSet(transient_map){
|
|
return (new cljs.core.TransientHashSet(transient_map));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IReversible}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.ISet}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISorted}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.PersistentTreeSet = (function (meta,tree_map,__hash){
|
|
this.meta = meta;
|
|
this.tree_map = tree_map;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 417730831;
|
|
this.cljs$lang$protocol_mask$partition1$ = 8192;
|
|
});
|
|
cljs.core.PersistentTreeSet.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.keys = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.entries = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_set_entries_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.values = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.es6_iterator(cljs.core.seq(coll));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.has = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.contains_QMARK_(coll,k);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.forEach = (function (f){
|
|
var self__ = this;
|
|
var coll = this;
|
|
var seq__2664 = cljs.core.seq(coll);
|
|
var chunk__2665 = null;
|
|
var count__2666 = (0);
|
|
var i__2667 = (0);
|
|
while(true){
|
|
if((i__2667 < count__2666)){
|
|
var vec__2668 = chunk__2665.cljs$core$IIndexed$_nth$arity$2(null,i__2667);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2668,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2668,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2677 = seq__2664;
|
|
var G__2678 = chunk__2665;
|
|
var G__2679 = count__2666;
|
|
var G__2680 = (i__2667 + (1));
|
|
seq__2664 = G__2677;
|
|
chunk__2665 = G__2678;
|
|
count__2666 = G__2679;
|
|
i__2667 = G__2680;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2664);
|
|
if(temp__5457__auto__){
|
|
var seq__2664__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2664__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2664__$1);
|
|
var G__2681 = cljs.core.chunk_rest(seq__2664__$1);
|
|
var G__2682 = c__4461__auto__;
|
|
var G__2683 = cljs.core.count(c__4461__auto__);
|
|
var G__2684 = (0);
|
|
seq__2664 = G__2681;
|
|
chunk__2665 = G__2682;
|
|
count__2666 = G__2683;
|
|
i__2667 = G__2684;
|
|
continue;
|
|
} else {
|
|
var vec__2671 = cljs.core.first(seq__2664__$1);
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2671,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2671,(1),null);
|
|
(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(v,k) : f.call(null,v,k));
|
|
|
|
|
|
var G__2685 = cljs.core.next(seq__2664__$1);
|
|
var G__2686 = null;
|
|
var G__2687 = (0);
|
|
var G__2688 = (0);
|
|
seq__2664 = G__2685;
|
|
chunk__2665 = G__2686;
|
|
count__2666 = G__2687;
|
|
i__2667 = G__2688;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (coll,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return coll__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (coll,v,not_found){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var n = self__.tree_map.entry_at(v);
|
|
if((!((n == null)))){
|
|
return n.key;
|
|
} else {
|
|
return not_found;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IMeta$_meta$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.PersistentTreeSet(self__.meta,self__.tree_map,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ICounted$_count$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.count(self__.tree_map);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IReversible$_rseq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
if((cljs.core.count(self__.tree_map) > (0))){
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core.rseq(self__.tree_map));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IHash$_hash$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_unordered_coll(coll__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (coll,other){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
var and__4036__auto__ = cljs.core.set_QMARK_(other);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = (cljs.core.count(coll__$1) === cljs.core.count(other));
|
|
if(and__4036__auto____$1){
|
|
try{return cljs.core.reduce_kv(((function (and__4036__auto____$1,and__4036__auto__,coll__$1){
|
|
return (function (p1__2662_SHARP_,p2__2661_SHARP_){
|
|
var or__4047__auto__ = cljs.core.contains_QMARK_(other,p2__2661_SHARP_);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.reduced(false);
|
|
}
|
|
});})(and__4036__auto____$1,and__4036__auto__,coll__$1))
|
|
,true,self__.tree_map);
|
|
}catch (e2676){if((e2676 instanceof Error)){
|
|
var ex = e2676;
|
|
return false;
|
|
} else {
|
|
throw e2676;
|
|
|
|
}
|
|
}} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core._empty(self__.tree_map),(0)));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISet$_disjoin$arity$2 = (function (coll,v){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(self__.tree_map,v),null));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.keys(self__.tree_map);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (coll,meta__$1){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeSet(meta__$1,self__.tree_map,self__.__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ICollection$_conj$arity$2 = (function (coll,o){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return (new cljs.core.PersistentTreeSet(self__.meta,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(self__.tree_map,o,null),null));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.call = (function() {
|
|
var G__2689 = null;
|
|
var G__2689__2 = (function (self__,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
var G__2689__3 = (function (self__,k,not_found){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var coll = self____$1;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
G__2689 = function(self__,k,not_found){
|
|
switch(arguments.length){
|
|
case 2:
|
|
return G__2689__2.call(this,self__,k);
|
|
case 3:
|
|
return G__2689__3.call(this,self__,k,not_found);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__2689.cljs$core$IFn$_invoke$arity$2 = G__2689__2;
|
|
G__2689.cljs$core$IFn$_invoke$arity$3 = G__2689__3;
|
|
return G__2689;
|
|
})()
|
|
;
|
|
|
|
cljs.core.PersistentTreeSet.prototype.apply = (function (self__,args2663){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args2663)));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$2(null,k);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IFn$_invoke$arity$2 = (function (k,not_found){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return coll.cljs$core$ILookup$_lookup$arity$3(null,k,not_found);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_sorted_seq$arity$2 = (function (coll,ascending_QMARK_){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core._sorted_seq(self__.tree_map,ascending_QMARK_));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_sorted_seq_from$arity$3 = (function (coll,k,ascending_QMARK_){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.key,cljs.core._sorted_seq_from(self__.tree_map,k,ascending_QMARK_));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_entry_key$arity$2 = (function (coll,entry){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return entry;
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$ISorted$_comparator$arity$1 = (function (coll){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._comparator(self__.tree_map);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$tree_DASH_map,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.cljs$lang$type = true;
|
|
|
|
cljs.core.PersistentTreeSet.cljs$lang$ctorStr = "cljs.core/PersistentTreeSet";
|
|
|
|
cljs.core.PersistentTreeSet.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/PersistentTreeSet");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/PersistentTreeSet.
|
|
*/
|
|
cljs.core.__GT_PersistentTreeSet = (function cljs$core$__GT_PersistentTreeSet(meta,tree_map,__hash){
|
|
return (new cljs.core.PersistentTreeSet(meta,tree_map,__hash));
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.EMPTY = (new cljs.core.PersistentTreeSet(null,cljs.core.PersistentTreeMap.EMPTY,cljs.core.empty_unordered_hash));
|
|
var G__2690_2693 = cljs.core.PersistentTreeSet.prototype;
|
|
var G__2691_2694 = cljs.core.ITER_SYMBOL;
|
|
var G__2692_2695 = ((function (G__2690_2693,G__2691_2694){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2690_2693,G__2691_2694))
|
|
;
|
|
goog.object.set(G__2690_2693,G__2691_2694,G__2692_2695);
|
|
cljs.core.set_from_indexed_seq = (function cljs$core$set_from_indexed_seq(iseq){
|
|
var arr = iseq.arr;
|
|
var ret = (function (){var a__4515__auto__ = arr;
|
|
var l__4516__auto__ = a__4515__auto__.length;
|
|
var i = (0);
|
|
var res = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
|
|
while(true){
|
|
if((i < l__4516__auto__)){
|
|
var G__2696 = (i + (1));
|
|
var G__2697 = res.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,(arr[i]));
|
|
i = G__2696;
|
|
res = G__2697;
|
|
continue;
|
|
} else {
|
|
return res;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
return ret.cljs$core$ITransientCollection$_persistent_BANG_$arity$1(null);
|
|
});
|
|
/**
|
|
* Returns a set of the distinct elements of coll.
|
|
*/
|
|
cljs.core.set = (function cljs$core$set(coll){
|
|
if(cljs.core.set_QMARK_(coll)){
|
|
return cljs.core.with_meta(coll,null);
|
|
} else {
|
|
var in$ = cljs.core.seq(coll);
|
|
if((in$ == null)){
|
|
return cljs.core.PersistentHashSet.EMPTY;
|
|
} else {
|
|
if((((in$ instanceof cljs.core.IndexedSeq)) && ((in$.i === (0))))){
|
|
return cljs.core.PersistentHashSet.createAsIfByAssoc(in$.arr);
|
|
} else {
|
|
var in$__$1 = in$;
|
|
var out = cljs.core._as_transient(cljs.core.PersistentHashSet.EMPTY);
|
|
while(true){
|
|
if((!((in$__$1 == null)))){
|
|
var G__2698 = cljs.core.next(in$__$1);
|
|
var G__2699 = out.cljs$core$ITransientCollection$_conj_BANG_$arity$2(null,in$__$1.cljs$core$ISeq$_first$arity$1(null));
|
|
in$__$1 = G__2698;
|
|
out = G__2699;
|
|
continue;
|
|
} else {
|
|
return cljs.core.persistent_BANG_(out);
|
|
}
|
|
break;
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns a new hash set with supplied keys. Any equal keys are
|
|
* handled as if by repeated uses of conj.
|
|
*/
|
|
cljs.core.hash_set = (function cljs$core$hash_set(var_args){
|
|
var G__2702 = arguments.length;
|
|
switch (G__2702) {
|
|
case 0:
|
|
return cljs.core.hash_set.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2704 = arguments.length;
|
|
var i__4642__auto___2705 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2705 < len__4641__auto___2704)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2705]));
|
|
|
|
var G__2706 = (i__4642__auto___2705 + (1));
|
|
i__4642__auto___2705 = G__2706;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((0)),(0),null));
|
|
return cljs.core.hash_set.cljs$core$IFn$_invoke$arity$variadic(argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.hash_set.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.PersistentHashSet.EMPTY;
|
|
});
|
|
|
|
cljs.core.hash_set.cljs$core$IFn$_invoke$arity$variadic = (function (keys){
|
|
return cljs.core.set(keys);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.hash_set.cljs$lang$applyTo = (function (seq2701){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2701));
|
|
});
|
|
|
|
cljs.core.hash_set.cljs$lang$maxFixedArity = (0);
|
|
|
|
/**
|
|
* Returns a new sorted set with supplied keys.
|
|
*/
|
|
cljs.core.sorted_set = (function cljs$core$sorted_set(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2708 = arguments.length;
|
|
var i__4642__auto___2709 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2709 < len__4641__auto___2708)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2709]));
|
|
|
|
var G__2710 = (i__4642__auto___2709 + (1));
|
|
i__4642__auto___2709 = G__2710;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.sorted_set.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.sorted_set.cljs$core$IFn$_invoke$arity$variadic = (function (keys){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,cljs.core.PersistentTreeSet.EMPTY,keys);
|
|
});
|
|
|
|
cljs.core.sorted_set.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.sorted_set.cljs$lang$applyTo = (function (seq2707){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2707));
|
|
});
|
|
|
|
/**
|
|
* Returns a new sorted set with supplied keys, using the supplied comparator.
|
|
*/
|
|
cljs.core.sorted_set_by = (function cljs$core$sorted_set_by(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2713 = arguments.length;
|
|
var i__4642__auto___2714 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2714 < len__4641__auto___2713)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2714]));
|
|
|
|
var G__2715 = (i__4642__auto___2714 + (1));
|
|
i__4642__auto___2714 = G__2715;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic = (function (comparator,keys){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core._conj,(new cljs.core.PersistentTreeSet(null,cljs.core.sorted_map_by(comparator),(0))),keys);
|
|
});
|
|
|
|
cljs.core.sorted_set_by.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.sorted_set_by.cljs$lang$applyTo = (function (seq2711){
|
|
var G__2712 = cljs.core.first(seq2711);
|
|
var seq2711__$1 = cljs.core.next(seq2711);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2712,seq2711__$1);
|
|
});
|
|
|
|
/**
|
|
* Given a map of replacement pairs and a vector/collection, returns a
|
|
* vector/seq with any elements = a key in smap replaced with the
|
|
* corresponding val in smap. Returns a transducer when no collection
|
|
* is provided.
|
|
*/
|
|
cljs.core.replace = (function cljs$core$replace(var_args){
|
|
var G__2719 = arguments.length;
|
|
switch (G__2719) {
|
|
case 1:
|
|
return cljs.core.replace.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.replace.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.replace.cljs$core$IFn$_invoke$arity$1 = (function (smap){
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$1((function (p1__2716_SHARP_){
|
|
var temp__5455__auto__ = cljs.core.find(smap,p1__2716_SHARP_);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var e = temp__5455__auto__;
|
|
return cljs.core.val(e);
|
|
} else {
|
|
return p1__2716_SHARP_;
|
|
}
|
|
}));
|
|
});
|
|
|
|
cljs.core.replace.cljs$core$IFn$_invoke$arity$2 = (function (smap,coll){
|
|
if(cljs.core.vector_QMARK_(coll)){
|
|
var n = cljs.core.count(coll);
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (n){
|
|
return (function (v,i){
|
|
var temp__5455__auto__ = cljs.core.find(smap,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(v,i));
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var e = temp__5455__auto__;
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(v,i,cljs.core.second(e));
|
|
} else {
|
|
return v;
|
|
}
|
|
});})(n))
|
|
,coll,cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,cljs.core.iterate(cljs.core.inc,(0))));
|
|
} else {
|
|
return cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__2717_SHARP_){
|
|
var temp__5455__auto__ = cljs.core.find(smap,p1__2717_SHARP_);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var e = temp__5455__auto__;
|
|
return cljs.core.second(e);
|
|
} else {
|
|
return p1__2717_SHARP_;
|
|
}
|
|
}),coll);
|
|
}
|
|
});
|
|
|
|
cljs.core.replace.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence of the elements of coll with duplicates removed.
|
|
* Returns a stateful transducer when no collection is provided.
|
|
*/
|
|
cljs.core.distinct = (function cljs$core$distinct(var_args){
|
|
var G__2722 = arguments.length;
|
|
switch (G__2722) {
|
|
case 0:
|
|
return cljs.core.distinct.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.distinct.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.distinct.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (function (rf){
|
|
var seen = cljs.core.volatile_BANG_(cljs.core.PersistentHashSet.EMPTY);
|
|
return ((function (seen){
|
|
return (function() {
|
|
var G__2733 = null;
|
|
var G__2733__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__2733__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__2733__2 = (function (result,input){
|
|
if(cljs.core.contains_QMARK_(cljs.core.deref(seen),input)){
|
|
return result;
|
|
} else {
|
|
seen.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(seen.cljs$core$IDeref$_deref$arity$1(null),input));
|
|
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__2733 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2733__0.call(this);
|
|
case 1:
|
|
return G__2733__1.call(this,result);
|
|
case 2:
|
|
return G__2733__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2733.cljs$core$IFn$_invoke$arity$0 = G__2733__0;
|
|
G__2733.cljs$core$IFn$_invoke$arity$1 = G__2733__1;
|
|
G__2733.cljs$core$IFn$_invoke$arity$2 = G__2733__2;
|
|
return G__2733;
|
|
})()
|
|
;})(seen))
|
|
});
|
|
});
|
|
|
|
cljs.core.distinct.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
var step = (function cljs$core$step(xs,seen){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var fexpr__2727 = (function (p__2728,seen__$1){
|
|
while(true){
|
|
var vec__2729 = p__2728;
|
|
var f = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2729,(0),null);
|
|
var xs__$1 = vec__2729;
|
|
var temp__5457__auto__ = cljs.core.seq(xs__$1);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.contains_QMARK_(seen__$1,f)){
|
|
var G__2734 = cljs.core.rest(s);
|
|
var G__2735 = seen__$1;
|
|
p__2728 = G__2734;
|
|
seen__$1 = G__2735;
|
|
continue;
|
|
} else {
|
|
return cljs.core.cons(f,cljs$core$step(cljs.core.rest(s),cljs.core.conj.cljs$core$IFn$_invoke$arity$2(seen__$1,f)));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
return fexpr__2727(xs,seen);
|
|
}),null,null));
|
|
});
|
|
return step(coll,cljs.core.PersistentHashSet.EMPTY);
|
|
});
|
|
|
|
cljs.core.distinct.cljs$lang$maxFixedArity = 1;
|
|
|
|
/**
|
|
* Return a seq of all but the last item in coll, in linear time
|
|
*/
|
|
cljs.core.butlast = (function cljs$core$butlast(s){
|
|
var ret = cljs.core.PersistentVector.EMPTY;
|
|
var s__$1 = s;
|
|
while(true){
|
|
if(cljs.core.next(s__$1)){
|
|
var G__2736 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(ret,cljs.core.first(s__$1));
|
|
var G__2737 = cljs.core.next(s__$1);
|
|
ret = G__2736;
|
|
s__$1 = G__2737;
|
|
continue;
|
|
} else {
|
|
return cljs.core.seq(ret);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the name String of a string, symbol or keyword.
|
|
*/
|
|
cljs.core.name = (function cljs$core$name(x){
|
|
if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition1$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$INamed$))))?true:false):false)){
|
|
return x.cljs$core$INamed$_name$arity$1(null);
|
|
} else {
|
|
if(typeof x === 'string'){
|
|
return x;
|
|
} else {
|
|
throw (new Error(["Doesn't support name: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x)].join('')));
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns a map with the keys mapped to the corresponding vals.
|
|
*/
|
|
cljs.core.zipmap = (function cljs$core$zipmap(keys,vals){
|
|
var map = cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY);
|
|
var ks = cljs.core.seq(keys);
|
|
var vs = cljs.core.seq(vals);
|
|
while(true){
|
|
if(((ks) && (vs))){
|
|
var G__2739 = cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(map,cljs.core.first(ks),cljs.core.first(vs));
|
|
var G__2740 = cljs.core.next(ks);
|
|
var G__2741 = cljs.core.next(vs);
|
|
map = G__2739;
|
|
ks = G__2740;
|
|
vs = G__2741;
|
|
continue;
|
|
} else {
|
|
return cljs.core.persistent_BANG_(map);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the x for which (k x), a number, is greatest.
|
|
*
|
|
* If there are multiple such xs, the last one is returned.
|
|
*/
|
|
cljs.core.max_key = (function cljs$core$max_key(var_args){
|
|
var G__2749 = arguments.length;
|
|
switch (G__2749) {
|
|
case 2:
|
|
return cljs.core.max_key.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.max_key.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2751 = arguments.length;
|
|
var i__4642__auto___2752 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2752 < len__4641__auto___2751)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2752]));
|
|
|
|
var G__2753 = (i__4642__auto___2752 + (1));
|
|
i__4642__auto___2752 = G__2753;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.max_key.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.max_key.cljs$core$IFn$_invoke$arity$2 = (function (k,x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.max_key.cljs$core$IFn$_invoke$arity$3 = (function (k,x,y){
|
|
if(((k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(x) : k.call(null,x)) > (k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(y) : k.call(null,y)))){
|
|
return x;
|
|
} else {
|
|
return y;
|
|
}
|
|
});
|
|
|
|
cljs.core.max_key.cljs$core$IFn$_invoke$arity$variadic = (function (k,x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__2742_SHARP_,p2__2743_SHARP_){
|
|
return cljs.core.max_key.cljs$core$IFn$_invoke$arity$3(k,p1__2742_SHARP_,p2__2743_SHARP_);
|
|
}),cljs.core.max_key.cljs$core$IFn$_invoke$arity$3(k,x,y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.max_key.cljs$lang$applyTo = (function (seq2745){
|
|
var G__2746 = cljs.core.first(seq2745);
|
|
var seq2745__$1 = cljs.core.next(seq2745);
|
|
var G__2747 = cljs.core.first(seq2745__$1);
|
|
var seq2745__$2 = cljs.core.next(seq2745__$1);
|
|
var G__2748 = cljs.core.first(seq2745__$2);
|
|
var seq2745__$3 = cljs.core.next(seq2745__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2746,G__2747,G__2748,seq2745__$3);
|
|
});
|
|
|
|
cljs.core.max_key.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* Returns the x for which (k x), a number, is least.
|
|
*
|
|
* If there are multiple such xs, the last one is returned.
|
|
*/
|
|
cljs.core.min_key = (function cljs$core$min_key(var_args){
|
|
var G__2761 = arguments.length;
|
|
switch (G__2761) {
|
|
case 2:
|
|
return cljs.core.min_key.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.min_key.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2763 = arguments.length;
|
|
var i__4642__auto___2764 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2764 < len__4641__auto___2763)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2764]));
|
|
|
|
var G__2765 = (i__4642__auto___2764 + (1));
|
|
i__4642__auto___2764 = G__2765;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.min_key.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.min_key.cljs$core$IFn$_invoke$arity$2 = (function (k,x){
|
|
return x;
|
|
});
|
|
|
|
cljs.core.min_key.cljs$core$IFn$_invoke$arity$3 = (function (k,x,y){
|
|
if(((k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(x) : k.call(null,x)) < (k.cljs$core$IFn$_invoke$arity$1 ? k.cljs$core$IFn$_invoke$arity$1(y) : k.call(null,y)))){
|
|
return x;
|
|
} else {
|
|
return y;
|
|
}
|
|
});
|
|
|
|
cljs.core.min_key.cljs$core$IFn$_invoke$arity$variadic = (function (k,x,y,more){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__2754_SHARP_,p2__2755_SHARP_){
|
|
return cljs.core.min_key.cljs$core$IFn$_invoke$arity$3(k,p1__2754_SHARP_,p2__2755_SHARP_);
|
|
}),cljs.core.min_key.cljs$core$IFn$_invoke$arity$3(k,x,y),more);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.min_key.cljs$lang$applyTo = (function (seq2757){
|
|
var G__2758 = cljs.core.first(seq2757);
|
|
var seq2757__$1 = cljs.core.next(seq2757);
|
|
var G__2759 = cljs.core.first(seq2757__$1);
|
|
var seq2757__$2 = cljs.core.next(seq2757__$1);
|
|
var G__2760 = cljs.core.first(seq2757__$2);
|
|
var seq2757__$3 = cljs.core.next(seq2757__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2758,G__2759,G__2760,seq2757__$3);
|
|
});
|
|
|
|
cljs.core.min_key.cljs$lang$maxFixedArity = (3);
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ArrayList = (function (arr){
|
|
this.arr = arr;
|
|
});
|
|
cljs.core.ArrayList.prototype.add = (function (x){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.arr.push(x);
|
|
});
|
|
|
|
cljs.core.ArrayList.prototype.size = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.arr.length;
|
|
});
|
|
|
|
cljs.core.ArrayList.prototype.clear = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.arr = [];
|
|
});
|
|
|
|
cljs.core.ArrayList.prototype.isEmpty = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return (self__.arr.length === (0));
|
|
});
|
|
|
|
cljs.core.ArrayList.prototype.toArray = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.arr;
|
|
});
|
|
|
|
cljs.core.ArrayList.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$arr,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.ArrayList.cljs$lang$type = true;
|
|
|
|
cljs.core.ArrayList.cljs$lang$ctorStr = "cljs.core/ArrayList";
|
|
|
|
cljs.core.ArrayList.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/ArrayList");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/ArrayList.
|
|
*/
|
|
cljs.core.__GT_ArrayList = (function cljs$core$__GT_ArrayList(arr){
|
|
return (new cljs.core.ArrayList(arr));
|
|
});
|
|
|
|
cljs.core.array_list = (function cljs$core$array_list(){
|
|
return (new cljs.core.ArrayList([]));
|
|
});
|
|
/**
|
|
* Returns a lazy sequence of lists like partition, but may include
|
|
* partitions with fewer than n items at the end. Returns a stateful
|
|
* transducer when no collection is provided.
|
|
*/
|
|
cljs.core.partition_all = (function cljs$core$partition_all(var_args){
|
|
var G__2767 = arguments.length;
|
|
switch (G__2767) {
|
|
case 1:
|
|
return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.partition_all.cljs$core$IFn$_invoke$arity$1 = (function (n){
|
|
return (function (rf){
|
|
var a = cljs.core.array_list();
|
|
return ((function (a){
|
|
return (function() {
|
|
var G__2769 = null;
|
|
var G__2769__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__2769__1 = (function (result){
|
|
var result__$1 = (cljs.core.truth_(a.isEmpty())?result:(function (){var v = cljs.core.vec(a.toArray());
|
|
a.clear();
|
|
|
|
return cljs.core.unreduced((rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v)));
|
|
})());
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result__$1) : rf.call(null,result__$1));
|
|
});
|
|
var G__2769__2 = (function (result,input){
|
|
a.add(input);
|
|
|
|
if((n === a.size())){
|
|
var v = cljs.core.vec(a.toArray());
|
|
a.clear();
|
|
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
|
|
} else {
|
|
return result;
|
|
}
|
|
});
|
|
G__2769 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2769__0.call(this);
|
|
case 1:
|
|
return G__2769__1.call(this,result);
|
|
case 2:
|
|
return G__2769__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2769.cljs$core$IFn$_invoke$arity$0 = G__2769__0;
|
|
G__2769.cljs$core$IFn$_invoke$arity$1 = G__2769__1;
|
|
G__2769.cljs$core$IFn$_invoke$arity$2 = G__2769__2;
|
|
return G__2769;
|
|
})()
|
|
;})(a))
|
|
});
|
|
});
|
|
|
|
cljs.core.partition_all.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
return cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3(n,n,coll);
|
|
});
|
|
|
|
cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3 = (function (n,step,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
return cljs.core.cons(cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,s),cljs.core.partition_all.cljs$core$IFn$_invoke$arity$3(n,step,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(step,s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.partition_all.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns a lazy sequence of successive items from coll while
|
|
* (pred item) returns logical true. pred must be free of side-effects.
|
|
* Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.take_while = (function cljs$core$take_while(var_args){
|
|
var G__2771 = arguments.length;
|
|
switch (G__2771) {
|
|
case 1:
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.take_while.cljs$core$IFn$_invoke$arity$1 = (function (pred){
|
|
return (function (rf){
|
|
return (function() {
|
|
var G__2774 = null;
|
|
var G__2774__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__2774__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__2774__2 = (function (result,input){
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
} else {
|
|
return cljs.core.reduced(result);
|
|
}
|
|
});
|
|
G__2774 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2774__0.call(this);
|
|
case 1:
|
|
return G__2774__1.call(this,result);
|
|
case 2:
|
|
return G__2774__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2774.cljs$core$IFn$_invoke$arity$0 = G__2774__0;
|
|
G__2774.cljs$core$IFn$_invoke$arity$1 = G__2774__1;
|
|
G__2774.cljs$core$IFn$_invoke$arity$2 = G__2774__2;
|
|
return G__2774;
|
|
})()
|
|
});
|
|
});
|
|
|
|
cljs.core.take_while.cljs$core$IFn$_invoke$arity$2 = (function (pred,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
if(cljs.core.truth_((function (){var G__2772 = cljs.core.first(s);
|
|
return (pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(G__2772) : pred.call(null,G__2772));
|
|
})())){
|
|
return cljs.core.cons(cljs.core.first(s),cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(pred,cljs.core.rest(s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.take_while.cljs$lang$maxFixedArity = 2;
|
|
|
|
cljs.core.mk_bound_fn = (function cljs$core$mk_bound_fn(sc,test,key){
|
|
return (function (e){
|
|
var comp = cljs.core._comparator(sc);
|
|
var G__2775 = (function (){var G__2777 = cljs.core._entry_key(sc,e);
|
|
var G__2778 = key;
|
|
return (comp.cljs$core$IFn$_invoke$arity$2 ? comp.cljs$core$IFn$_invoke$arity$2(G__2777,G__2778) : comp.call(null,G__2777,G__2778));
|
|
})();
|
|
var G__2776 = (0);
|
|
return (test.cljs$core$IFn$_invoke$arity$2 ? test.cljs$core$IFn$_invoke$arity$2(G__2775,G__2776) : test.call(null,G__2775,G__2776));
|
|
});
|
|
});
|
|
/**
|
|
* sc must be a sorted collection, test(s) one of <, <=, > or
|
|
* >=. Returns a seq of those entries with keys ek for
|
|
* which (test (.. sc comparator (compare ek key)) 0) is true
|
|
*/
|
|
cljs.core.subseq = (function cljs$core$subseq(var_args){
|
|
var G__2780 = arguments.length;
|
|
switch (G__2780) {
|
|
case 3:
|
|
return cljs.core.subseq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.subseq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.subseq.cljs$core$IFn$_invoke$arity$3 = (function (sc,test,key){
|
|
var include = cljs.core.mk_bound_fn(sc,test,key);
|
|
if(cljs.core.truth_((function (){var fexpr__2781 = cljs.core.PersistentHashSet.createAsIfByAssoc([cljs.core._GT_,cljs.core._GT__EQ_]);
|
|
return (fexpr__2781.cljs$core$IFn$_invoke$arity$1 ? fexpr__2781.cljs$core$IFn$_invoke$arity$1(test) : fexpr__2781.call(null,test));
|
|
})())){
|
|
var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,key,true);
|
|
if(cljs.core.truth_(temp__5457__auto__)){
|
|
var vec__2782 = temp__5457__auto__;
|
|
var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2782,(0),null);
|
|
var s = vec__2782;
|
|
if(cljs.core.truth_((include.cljs$core$IFn$_invoke$arity$1 ? include.cljs$core$IFn$_invoke$arity$1(e) : include.call(null,e)))){
|
|
return s;
|
|
} else {
|
|
return cljs.core.next(s);
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(include,cljs.core._sorted_seq(sc,true));
|
|
}
|
|
});
|
|
|
|
cljs.core.subseq.cljs$core$IFn$_invoke$arity$5 = (function (sc,start_test,start_key,end_test,end_key){
|
|
var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,start_key,true);
|
|
if(cljs.core.truth_(temp__5457__auto__)){
|
|
var vec__2785 = temp__5457__auto__;
|
|
var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2785,(0),null);
|
|
var s = vec__2785;
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(cljs.core.mk_bound_fn(sc,end_test,end_key),(cljs.core.truth_((function (){var fexpr__2788 = cljs.core.mk_bound_fn(sc,start_test,start_key);
|
|
return (fexpr__2788.cljs$core$IFn$_invoke$arity$1 ? fexpr__2788.cljs$core$IFn$_invoke$arity$1(e) : fexpr__2788.call(null,e));
|
|
})())?s:cljs.core.next(s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.subseq.cljs$lang$maxFixedArity = 5;
|
|
|
|
/**
|
|
* sc must be a sorted collection, test(s) one of <, <=, > or
|
|
* >=. Returns a reverse seq of those entries with keys ek for
|
|
* which (test (.. sc comparator (compare ek key)) 0) is true
|
|
*/
|
|
cljs.core.rsubseq = (function cljs$core$rsubseq(var_args){
|
|
var G__2791 = arguments.length;
|
|
switch (G__2791) {
|
|
case 3:
|
|
return cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
case 5:
|
|
return cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$5((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]),(arguments[(4)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$3 = (function (sc,test,key){
|
|
var include = cljs.core.mk_bound_fn(sc,test,key);
|
|
if(cljs.core.truth_((function (){var fexpr__2792 = cljs.core.PersistentHashSet.createAsIfByAssoc([cljs.core._LT_,cljs.core._LT__EQ_]);
|
|
return (fexpr__2792.cljs$core$IFn$_invoke$arity$1 ? fexpr__2792.cljs$core$IFn$_invoke$arity$1(test) : fexpr__2792.call(null,test));
|
|
})())){
|
|
var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,key,false);
|
|
if(cljs.core.truth_(temp__5457__auto__)){
|
|
var vec__2793 = temp__5457__auto__;
|
|
var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2793,(0),null);
|
|
var s = vec__2793;
|
|
if(cljs.core.truth_((include.cljs$core$IFn$_invoke$arity$1 ? include.cljs$core$IFn$_invoke$arity$1(e) : include.call(null,e)))){
|
|
return s;
|
|
} else {
|
|
return cljs.core.next(s);
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(include,cljs.core._sorted_seq(sc,false));
|
|
}
|
|
});
|
|
|
|
cljs.core.rsubseq.cljs$core$IFn$_invoke$arity$5 = (function (sc,start_test,start_key,end_test,end_key){
|
|
var temp__5457__auto__ = cljs.core._sorted_seq_from(sc,end_key,false);
|
|
if(cljs.core.truth_(temp__5457__auto__)){
|
|
var vec__2796 = temp__5457__auto__;
|
|
var e = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2796,(0),null);
|
|
var s = vec__2796;
|
|
return cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(cljs.core.mk_bound_fn(sc,start_test,start_key),(cljs.core.truth_((function (){var fexpr__2799 = cljs.core.mk_bound_fn(sc,end_test,end_key);
|
|
return (fexpr__2799.cljs$core$IFn$_invoke$arity$1 ? fexpr__2799.cljs$core$IFn$_invoke$arity$1(e) : fexpr__2799.call(null,e));
|
|
})())?s:cljs.core.next(s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.rsubseq.cljs$lang$maxFixedArity = 5;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.RangeIterator = (function (i,end,step){
|
|
this.i = i;
|
|
this.end = end;
|
|
this.step = step;
|
|
});
|
|
cljs.core.RangeIterator.prototype.hasNext = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
if((self__.step > (0))){
|
|
return (self__.i < self__.end);
|
|
} else {
|
|
return (self__.i > self__.end);
|
|
}
|
|
});
|
|
|
|
cljs.core.RangeIterator.prototype.next = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
var ret = self__.i;
|
|
self__.i = (self__.i + self__.step);
|
|
|
|
return ret;
|
|
});
|
|
|
|
cljs.core.RangeIterator.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$i,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.cst$sym$end,cljs.core.cst$sym$step], null);
|
|
});
|
|
|
|
cljs.core.RangeIterator.cljs$lang$type = true;
|
|
|
|
cljs.core.RangeIterator.cljs$lang$ctorStr = "cljs.core/RangeIterator";
|
|
|
|
cljs.core.RangeIterator.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/RangeIterator");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/RangeIterator.
|
|
*/
|
|
cljs.core.__GT_RangeIterator = (function cljs$core$__GT_RangeIterator(i,end,step){
|
|
return (new cljs.core.RangeIterator(i,end,step));
|
|
});
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IIndexed}
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.ICollection}
|
|
* @implements {cljs.core.IEmptyableCollection}
|
|
* @implements {cljs.core.ICounted}
|
|
* @implements {cljs.core.ISeq}
|
|
* @implements {cljs.core.INext}
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IMeta}
|
|
* @implements {cljs.core.ICloneable}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IWithMeta}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Range = (function (meta,start,end,step,__hash){
|
|
this.meta = meta;
|
|
this.start = start;
|
|
this.end = end;
|
|
this.step = step;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 32375006;
|
|
this.cljs$lang$protocol_mask$partition1$ = 139264;
|
|
});
|
|
cljs.core.Range.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.Range.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.Range.prototype.indexOf = (function() {
|
|
var G__2802 = null;
|
|
var G__2802__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,(0));
|
|
});
|
|
var G__2802__2 = (function (x,start__$1){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
|
|
});
|
|
G__2802 = function(x,start__$1){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2802__1.call(this,x);
|
|
case 2:
|
|
return G__2802__2.call(this,x,start__$1);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2802.cljs$core$IFn$_invoke$arity$1 = G__2802__1;
|
|
G__2802.cljs$core$IFn$_invoke$arity$2 = G__2802__2;
|
|
return G__2802;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Range.prototype.lastIndexOf = (function() {
|
|
var G__2803 = null;
|
|
var G__2803__1 = (function (x){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,cljs.core.count(coll));
|
|
});
|
|
var G__2803__2 = (function (x,start__$1){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll,x,start__$1);
|
|
});
|
|
G__2803 = function(x,start__$1){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__2803__1.call(this,x);
|
|
case 2:
|
|
return G__2803__2.call(this,x,start__$1);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2803.cljs$core$IFn$_invoke$arity$1 = G__2803__1;
|
|
G__2803.cljs$core$IFn$_invoke$arity$2 = G__2803__2;
|
|
return G__2803;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Range.prototype.cljs$core$IIndexed$_nth$arity$2 = (function (rng,n){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if(((((0) <= n)) && ((n < rng__$1.cljs$core$ICounted$_count$arity$1(null))))){
|
|
return (self__.start + (n * self__.step));
|
|
} else {
|
|
if(((((0) <= n)) && ((self__.start > self__.end)) && ((self__.step === (0))))){
|
|
return self__.start;
|
|
} else {
|
|
throw (new Error("Index out of bounds"));
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IIndexed$_nth$arity$3 = (function (rng,n,not_found){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if(((((0) <= n)) && ((n < rng__$1.cljs$core$ICounted$_count$arity$1(null))))){
|
|
return (self__.start + (n * self__.step));
|
|
} else {
|
|
if(((((0) <= n)) && ((self__.start > self__.end)) && ((self__.step === (0))))){
|
|
return self__.start;
|
|
} else {
|
|
return not_found;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.RangeIterator(self__.start,self__.end,self__.step));
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IMeta$_meta$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return self__.meta;
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ICloneable$_clone$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (new cljs.core.Range(self__.meta,self__.start,self__.end,self__.step,self__.__hash));
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$INext$_next$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if((self__.step > (0))){
|
|
if(((self__.start + self__.step) < self__.end)){
|
|
return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if(((self__.start + self__.step) > self__.end)){
|
|
return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ICounted$_count$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if(cljs.core.not(rng__$1.cljs$core$ISeqable$_seq$arity$1(null))){
|
|
return (0);
|
|
} else {
|
|
var G__2801 = ((self__.end - self__.start) / self__.step);
|
|
return Math.ceil(G__2801);
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IHash$_hash$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
var h__4159__auto__ = self__.__hash;
|
|
if((!((h__4159__auto__ == null)))){
|
|
return h__4159__auto__;
|
|
} else {
|
|
var h__4159__auto____$1 = cljs.core.hash_ordered_coll(rng__$1);
|
|
self__.__hash = h__4159__auto____$1;
|
|
|
|
return h__4159__auto____$1;
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (rng,other){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return cljs.core.equiv_sequential(rng__$1,other);
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IEmptyableCollection$_empty$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return cljs.core._with_meta(cljs.core.List.EMPTY,self__.meta);
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (rng,f){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return cljs.core.ci_reduce.cljs$core$IFn$_invoke$arity$2(rng__$1,f);
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (rng,f,init){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
var i = self__.start;
|
|
var ret = init;
|
|
while(true){
|
|
if((((self__.step > (0)))?(i < self__.end):(i > self__.end))){
|
|
var ret__$1 = (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(ret,i) : f.call(null,ret,i));
|
|
if(cljs.core.reduced_QMARK_(ret__$1)){
|
|
return cljs.core.deref(ret__$1);
|
|
} else {
|
|
var G__2804 = (i + self__.step);
|
|
var G__2805 = ret__$1;
|
|
i = G__2804;
|
|
ret = G__2805;
|
|
continue;
|
|
}
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ISeq$_first$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if((rng__$1.cljs$core$ISeqable$_seq$arity$1(null) == null)){
|
|
return null;
|
|
} else {
|
|
return self__.start;
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ISeq$_rest$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if((!((rng__$1.cljs$core$ISeqable$_seq$arity$1(null) == null)))){
|
|
return (new cljs.core.Range(self__.meta,(self__.start + self__.step),self__.end,self__.step,null));
|
|
} else {
|
|
return cljs.core.List.EMPTY;
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (rng){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
if((self__.step > (0))){
|
|
if((self__.start < self__.end)){
|
|
return rng__$1;
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if((self__.step < (0))){
|
|
if((self__.start > self__.end)){
|
|
return rng__$1;
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
if((self__.start === self__.end)){
|
|
return null;
|
|
} else {
|
|
return rng__$1;
|
|
}
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IWithMeta$_with_meta$arity$2 = (function (rng,meta__$1){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return (new cljs.core.Range(meta__$1,self__.start,self__.end,self__.step,self__.__hash));
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$ICollection$_conj$arity$2 = (function (rng,o){
|
|
var self__ = this;
|
|
var rng__$1 = this;
|
|
return cljs.core.cons(o,rng__$1);
|
|
});
|
|
|
|
cljs.core.Range.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 5, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$meta,cljs.core.cst$sym$start,cljs.core.cst$sym$end,cljs.core.cst$sym$step,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Range.cljs$lang$type = true;
|
|
|
|
cljs.core.Range.cljs$lang$ctorStr = "cljs.core/Range";
|
|
|
|
cljs.core.Range.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Range");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Range.
|
|
*/
|
|
cljs.core.__GT_Range = (function cljs$core$__GT_Range(meta,start,end,step,__hash){
|
|
return (new cljs.core.Range(meta,start,end,step,__hash));
|
|
});
|
|
|
|
var G__2806_2809 = cljs.core.Range.prototype;
|
|
var G__2807_2810 = cljs.core.ITER_SYMBOL;
|
|
var G__2808_2811 = ((function (G__2806_2809,G__2807_2810){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__2806_2809,G__2807_2810))
|
|
;
|
|
goog.object.set(G__2806_2809,G__2807_2810,G__2808_2811);
|
|
/**
|
|
* Returns a lazy seq of nums from start (inclusive) to end
|
|
* (exclusive), by step, where start defaults to 0, step to 1,
|
|
* and end to infinity.
|
|
*/
|
|
cljs.core.range = (function cljs$core$range(var_args){
|
|
var G__2813 = arguments.length;
|
|
switch (G__2813) {
|
|
case 0:
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.range.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$3((0),Number.MAX_VALUE,(1));
|
|
});
|
|
|
|
cljs.core.range.cljs$core$IFn$_invoke$arity$1 = (function (end){
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$3((0),end,(1));
|
|
});
|
|
|
|
cljs.core.range.cljs$core$IFn$_invoke$arity$2 = (function (start,end){
|
|
return cljs.core.range.cljs$core$IFn$_invoke$arity$3(start,end,(1));
|
|
});
|
|
|
|
cljs.core.range.cljs$core$IFn$_invoke$arity$3 = (function (start,end,step){
|
|
return (new cljs.core.Range(null,start,end,step,null));
|
|
});
|
|
|
|
cljs.core.range.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns a lazy seq of every nth item in coll. Returns a stateful
|
|
* transducer when no collection is provided.
|
|
*/
|
|
cljs.core.take_nth = (function cljs$core$take_nth(var_args){
|
|
var G__2816 = arguments.length;
|
|
switch (G__2816) {
|
|
case 1:
|
|
return cljs.core.take_nth.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.take_nth.cljs$core$IFn$_invoke$arity$1 = (function (n){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
return (function (rf){
|
|
var ia = cljs.core.volatile_BANG_((-1));
|
|
return ((function (ia){
|
|
return (function() {
|
|
var G__2818 = null;
|
|
var G__2818__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__2818__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__2818__2 = (function (result,input){
|
|
var i = ia.cljs$core$IVolatile$_vreset_BANG_$arity$2(null,(ia.cljs$core$IDeref$_deref$arity$1(null) + (1)));
|
|
if((cljs.core.rem(i,n) === (0))){
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
} else {
|
|
return result;
|
|
}
|
|
});
|
|
G__2818 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2818__0.call(this);
|
|
case 1:
|
|
return G__2818__1.call(this,result);
|
|
case 2:
|
|
return G__2818__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2818.cljs$core$IFn$_invoke$arity$0 = G__2818__0;
|
|
G__2818.cljs$core$IFn$_invoke$arity$1 = G__2818__1;
|
|
G__2818.cljs$core$IFn$_invoke$arity$2 = G__2818__2;
|
|
return G__2818;
|
|
})()
|
|
;})(ia))
|
|
});
|
|
});
|
|
|
|
cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
if(typeof n === 'number'){
|
|
} else {
|
|
throw (new Error("Assert failed: (number? n)"));
|
|
}
|
|
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
return cljs.core.cons(cljs.core.first(s),cljs.core.take_nth.cljs$core$IFn$_invoke$arity$2(n,cljs.core.drop.cljs$core$IFn$_invoke$arity$2(n,s)));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.take_nth.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a vector of [(take-while pred coll) (drop-while pred coll)]
|
|
*/
|
|
cljs.core.split_with = (function cljs$core$split_with(pred,coll){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(pred,coll),cljs.core.drop_while.cljs$core$IFn$_invoke$arity$2(pred,coll)], null);
|
|
});
|
|
/**
|
|
* Applies f to each value in coll, splitting it each time f returns a
|
|
* new value. Returns a lazy seq of partitions. Returns a stateful
|
|
* transducer when no collection is provided.
|
|
*/
|
|
cljs.core.partition_by = (function cljs$core$partition_by(var_args){
|
|
var G__2821 = arguments.length;
|
|
switch (G__2821) {
|
|
case 1:
|
|
return cljs.core.partition_by.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.partition_by.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function (rf){
|
|
var a = cljs.core.array_list();
|
|
var pa = cljs.core.volatile_BANG_(cljs.core.cst$kw$cljs$core_SLASH_none);
|
|
return ((function (a,pa){
|
|
return (function() {
|
|
var G__2823 = null;
|
|
var G__2823__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__2823__1 = (function (result){
|
|
var result__$1 = (cljs.core.truth_(a.isEmpty())?result:(function (){var v = cljs.core.vec(a.toArray());
|
|
a.clear();
|
|
|
|
return cljs.core.unreduced((rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v)));
|
|
})());
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result__$1) : rf.call(null,result__$1));
|
|
});
|
|
var G__2823__2 = (function (result,input){
|
|
var pval = cljs.core.deref(pa);
|
|
var val = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(input) : f.call(null,input));
|
|
cljs.core.vreset_BANG_(pa,val);
|
|
|
|
if(((cljs.core.keyword_identical_QMARK_(pval,cljs.core.cst$kw$cljs$core_SLASH_none)) || (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(val,pval)))){
|
|
a.add(input);
|
|
|
|
return result;
|
|
} else {
|
|
var v = cljs.core.vec(a.toArray());
|
|
a.clear();
|
|
|
|
var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,v) : rf.call(null,result,v));
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
} else {
|
|
a.add(input);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
});
|
|
G__2823 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2823__0.call(this);
|
|
case 1:
|
|
return G__2823__1.call(this,result);
|
|
case 2:
|
|
return G__2823__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2823.cljs$core$IFn$_invoke$arity$0 = G__2823__0;
|
|
G__2823.cljs$core$IFn$_invoke$arity$1 = G__2823__1;
|
|
G__2823.cljs$core$IFn$_invoke$arity$2 = G__2823__2;
|
|
return G__2823;
|
|
})()
|
|
;})(a,pa))
|
|
});
|
|
});
|
|
|
|
cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
var fst = cljs.core.first(s);
|
|
var fv = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(fst) : f.call(null,fst));
|
|
var run = cljs.core.cons(fst,cljs.core.take_while.cljs$core$IFn$_invoke$arity$2(((function (fst,fv,s,temp__5457__auto__){
|
|
return (function (p1__2819_SHARP_){
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(fv,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(p1__2819_SHARP_) : f.call(null,p1__2819_SHARP_)));
|
|
});})(fst,fv,s,temp__5457__auto__))
|
|
,cljs.core.next(s)));
|
|
return cljs.core.cons(run,cljs.core.partition_by.cljs$core$IFn$_invoke$arity$2(f,(new cljs.core.LazySeq(null,((function (fst,fv,run,s,temp__5457__auto__){
|
|
return (function (){
|
|
return cljs.core.drop.cljs$core$IFn$_invoke$arity$2(cljs.core.count(run),s);
|
|
});})(fst,fv,run,s,temp__5457__auto__))
|
|
,null,null))));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.partition_by.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a map from distinct items in coll to the number of times
|
|
* they appear.
|
|
*/
|
|
cljs.core.frequencies = (function cljs$core$frequencies(coll){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (counts,x){
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(counts,x,(cljs.core.get.cljs$core$IFn$_invoke$arity$3(counts,x,(0)) + (1)));
|
|
}),cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY),coll));
|
|
});
|
|
/**
|
|
* Returns a lazy seq of the intermediate values of the reduction (as
|
|
* per reduce) of coll by f, starting with init.
|
|
*/
|
|
cljs.core.reductions = (function cljs$core$reductions(var_args){
|
|
var G__2825 = arguments.length;
|
|
switch (G__2825) {
|
|
case 2:
|
|
return cljs.core.reductions.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.reductions.cljs$core$IFn$_invoke$arity$2 = (function (f,coll){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var temp__5455__auto__ = cljs.core.seq(coll);
|
|
if(temp__5455__auto__){
|
|
var s = temp__5455__auto__;
|
|
return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3(f,cljs.core.first(s),cljs.core.rest(s));
|
|
} else {
|
|
return (new cljs.core.List(null,(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),null,(1),null));
|
|
}
|
|
}),null,null));
|
|
});
|
|
|
|
cljs.core.reductions.cljs$core$IFn$_invoke$arity$3 = (function (f,init,coll){
|
|
if(cljs.core.reduced_QMARK_(init)){
|
|
return (new cljs.core.List(null,cljs.core.deref(init),null,(1),null));
|
|
} else {
|
|
return cljs.core.cons(init,(new cljs.core.LazySeq(null,(function (){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
return cljs.core.reductions.cljs$core$IFn$_invoke$arity$3(f,(function (){var G__2826 = init;
|
|
var G__2827 = cljs.core.first(s);
|
|
return (f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(G__2826,G__2827) : f.call(null,G__2826,G__2827));
|
|
})(),cljs.core.rest(s));
|
|
} else {
|
|
return null;
|
|
}
|
|
}),null,null)));
|
|
}
|
|
});
|
|
|
|
cljs.core.reductions.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Takes a set of functions and returns a fn that is the juxtaposition
|
|
* of those fns. The returned fn takes a variable number of args, and
|
|
* returns a vector containing the result of applying each fn to the
|
|
* args (left-to-right).
|
|
* ((juxt a b c) x) => [(a x) (b x) (c x)]
|
|
*/
|
|
cljs.core.juxt = (function cljs$core$juxt(var_args){
|
|
var G__2844 = arguments.length;
|
|
switch (G__2844) {
|
|
case 1:
|
|
return cljs.core.juxt.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.juxt.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.juxt.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___2846 = arguments.length;
|
|
var i__4642__auto___2847 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2847 < len__4641__auto___2846)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___2847]));
|
|
|
|
var G__2848 = (i__4642__auto___2847 + (1));
|
|
i__4642__auto___2847 = G__2848;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((3)),(0),null));
|
|
return cljs.core.juxt.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.juxt.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
return (function() {
|
|
var G__2849 = null;
|
|
var G__2849__0 = (function (){
|
|
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null))],null));
|
|
});
|
|
var G__2849__1 = (function (x){
|
|
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x))],null));
|
|
});
|
|
var G__2849__2 = (function (x,y){
|
|
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y))],null));
|
|
});
|
|
var G__2849__3 = (function (x,y,z){
|
|
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z))],null));
|
|
});
|
|
var G__2849__4 = (function() {
|
|
var G__2850__delegate = function (x,y,z,args){
|
|
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args)],null));
|
|
};
|
|
var G__2850 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__2851__i = 0, G__2851__a = new Array(arguments.length - 3);
|
|
while (G__2851__i < G__2851__a.length) {G__2851__a[G__2851__i] = arguments[G__2851__i + 3]; ++G__2851__i;}
|
|
args = new cljs.core.IndexedSeq(G__2851__a,0,null);
|
|
}
|
|
return G__2850__delegate.call(this,x,y,z,args);};
|
|
G__2850.cljs$lang$maxFixedArity = 3;
|
|
G__2850.cljs$lang$applyTo = (function (arglist__2852){
|
|
var x = cljs.core.first(arglist__2852);
|
|
arglist__2852 = cljs.core.next(arglist__2852);
|
|
var y = cljs.core.first(arglist__2852);
|
|
arglist__2852 = cljs.core.next(arglist__2852);
|
|
var z = cljs.core.first(arglist__2852);
|
|
var args = cljs.core.rest(arglist__2852);
|
|
return G__2850__delegate(x,y,z,args);
|
|
});
|
|
G__2850.cljs$core$IFn$_invoke$arity$variadic = G__2850__delegate;
|
|
return G__2850;
|
|
})()
|
|
;
|
|
G__2849 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2849__0.call(this);
|
|
case 1:
|
|
return G__2849__1.call(this,x);
|
|
case 2:
|
|
return G__2849__2.call(this,x,y);
|
|
case 3:
|
|
return G__2849__3.call(this,x,y,z);
|
|
default:
|
|
var G__2853 = null;
|
|
if (arguments.length > 3) {
|
|
var G__2854__i = 0, G__2854__a = new Array(arguments.length - 3);
|
|
while (G__2854__i < G__2854__a.length) {G__2854__a[G__2854__i] = arguments[G__2854__i + 3]; ++G__2854__i;}
|
|
G__2853 = new cljs.core.IndexedSeq(G__2854__a,0,null);
|
|
}
|
|
return G__2849__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2853);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2849.cljs$lang$maxFixedArity = 3;
|
|
G__2849.cljs$lang$applyTo = G__2849__4.cljs$lang$applyTo;
|
|
G__2849.cljs$core$IFn$_invoke$arity$0 = G__2849__0;
|
|
G__2849.cljs$core$IFn$_invoke$arity$1 = G__2849__1;
|
|
G__2849.cljs$core$IFn$_invoke$arity$2 = G__2849__2;
|
|
G__2849.cljs$core$IFn$_invoke$arity$3 = G__2849__3;
|
|
G__2849.cljs$core$IFn$_invoke$arity$variadic = G__2849__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__2849;
|
|
})()
|
|
});
|
|
|
|
cljs.core.juxt.cljs$core$IFn$_invoke$arity$2 = (function (f,g){
|
|
return (function() {
|
|
var G__2855 = null;
|
|
var G__2855__0 = (function (){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),(g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null))],null));
|
|
});
|
|
var G__2855__1 = (function (x){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)),(g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x))],null));
|
|
});
|
|
var G__2855__2 = (function (x,y){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)),(g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y))],null));
|
|
});
|
|
var G__2855__3 = (function (x,y,z){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z)),(g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z))],null));
|
|
});
|
|
var G__2855__4 = (function() {
|
|
var G__2856__delegate = function (x,y,z,args){
|
|
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args)],null));
|
|
};
|
|
var G__2856 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__2857__i = 0, G__2857__a = new Array(arguments.length - 3);
|
|
while (G__2857__i < G__2857__a.length) {G__2857__a[G__2857__i] = arguments[G__2857__i + 3]; ++G__2857__i;}
|
|
args = new cljs.core.IndexedSeq(G__2857__a,0,null);
|
|
}
|
|
return G__2856__delegate.call(this,x,y,z,args);};
|
|
G__2856.cljs$lang$maxFixedArity = 3;
|
|
G__2856.cljs$lang$applyTo = (function (arglist__2858){
|
|
var x = cljs.core.first(arglist__2858);
|
|
arglist__2858 = cljs.core.next(arglist__2858);
|
|
var y = cljs.core.first(arglist__2858);
|
|
arglist__2858 = cljs.core.next(arglist__2858);
|
|
var z = cljs.core.first(arglist__2858);
|
|
var args = cljs.core.rest(arglist__2858);
|
|
return G__2856__delegate(x,y,z,args);
|
|
});
|
|
G__2856.cljs$core$IFn$_invoke$arity$variadic = G__2856__delegate;
|
|
return G__2856;
|
|
})()
|
|
;
|
|
G__2855 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2855__0.call(this);
|
|
case 1:
|
|
return G__2855__1.call(this,x);
|
|
case 2:
|
|
return G__2855__2.call(this,x,y);
|
|
case 3:
|
|
return G__2855__3.call(this,x,y,z);
|
|
default:
|
|
var G__2859 = null;
|
|
if (arguments.length > 3) {
|
|
var G__2860__i = 0, G__2860__a = new Array(arguments.length - 3);
|
|
while (G__2860__i < G__2860__a.length) {G__2860__a[G__2860__i] = arguments[G__2860__i + 3]; ++G__2860__i;}
|
|
G__2859 = new cljs.core.IndexedSeq(G__2860__a,0,null);
|
|
}
|
|
return G__2855__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2859);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2855.cljs$lang$maxFixedArity = 3;
|
|
G__2855.cljs$lang$applyTo = G__2855__4.cljs$lang$applyTo;
|
|
G__2855.cljs$core$IFn$_invoke$arity$0 = G__2855__0;
|
|
G__2855.cljs$core$IFn$_invoke$arity$1 = G__2855__1;
|
|
G__2855.cljs$core$IFn$_invoke$arity$2 = G__2855__2;
|
|
G__2855.cljs$core$IFn$_invoke$arity$3 = G__2855__3;
|
|
G__2855.cljs$core$IFn$_invoke$arity$variadic = G__2855__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__2855;
|
|
})()
|
|
});
|
|
|
|
cljs.core.juxt.cljs$core$IFn$_invoke$arity$3 = (function (f,g,h){
|
|
return (function() {
|
|
var G__2861 = null;
|
|
var G__2861__0 = (function (){
|
|
return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null)),(g.cljs$core$IFn$_invoke$arity$0 ? g.cljs$core$IFn$_invoke$arity$0() : g.call(null)),(h.cljs$core$IFn$_invoke$arity$0 ? h.cljs$core$IFn$_invoke$arity$0() : h.call(null))],null));
|
|
});
|
|
var G__2861__1 = (function (x){
|
|
return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x)),(g.cljs$core$IFn$_invoke$arity$1 ? g.cljs$core$IFn$_invoke$arity$1(x) : g.call(null,x)),(h.cljs$core$IFn$_invoke$arity$1 ? h.cljs$core$IFn$_invoke$arity$1(x) : h.call(null,x))],null));
|
|
});
|
|
var G__2861__2 = (function (x,y){
|
|
return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$2 ? f.cljs$core$IFn$_invoke$arity$2(x,y) : f.call(null,x,y)),(g.cljs$core$IFn$_invoke$arity$2 ? g.cljs$core$IFn$_invoke$arity$2(x,y) : g.call(null,x,y)),(h.cljs$core$IFn$_invoke$arity$2 ? h.cljs$core$IFn$_invoke$arity$2(x,y) : h.call(null,x,y))],null));
|
|
});
|
|
var G__2861__3 = (function (x,y,z){
|
|
return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[(f.cljs$core$IFn$_invoke$arity$3 ? f.cljs$core$IFn$_invoke$arity$3(x,y,z) : f.call(null,x,y,z)),(g.cljs$core$IFn$_invoke$arity$3 ? g.cljs$core$IFn$_invoke$arity$3(x,y,z) : g.call(null,x,y,z)),(h.cljs$core$IFn$_invoke$arity$3 ? h.cljs$core$IFn$_invoke$arity$3(x,y,z) : h.call(null,x,y,z))],null));
|
|
});
|
|
var G__2861__4 = (function() {
|
|
var G__2862__delegate = function (x,y,z,args){
|
|
return (new cljs.core.PersistentVector(null,3,(5),cljs.core.PersistentVector.EMPTY_NODE,[cljs.core.apply.cljs$core$IFn$_invoke$arity$5(f,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(g,x,y,z,args),cljs.core.apply.cljs$core$IFn$_invoke$arity$5(h,x,y,z,args)],null));
|
|
};
|
|
var G__2862 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__2863__i = 0, G__2863__a = new Array(arguments.length - 3);
|
|
while (G__2863__i < G__2863__a.length) {G__2863__a[G__2863__i] = arguments[G__2863__i + 3]; ++G__2863__i;}
|
|
args = new cljs.core.IndexedSeq(G__2863__a,0,null);
|
|
}
|
|
return G__2862__delegate.call(this,x,y,z,args);};
|
|
G__2862.cljs$lang$maxFixedArity = 3;
|
|
G__2862.cljs$lang$applyTo = (function (arglist__2864){
|
|
var x = cljs.core.first(arglist__2864);
|
|
arglist__2864 = cljs.core.next(arglist__2864);
|
|
var y = cljs.core.first(arglist__2864);
|
|
arglist__2864 = cljs.core.next(arglist__2864);
|
|
var z = cljs.core.first(arglist__2864);
|
|
var args = cljs.core.rest(arglist__2864);
|
|
return G__2862__delegate(x,y,z,args);
|
|
});
|
|
G__2862.cljs$core$IFn$_invoke$arity$variadic = G__2862__delegate;
|
|
return G__2862;
|
|
})()
|
|
;
|
|
G__2861 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2861__0.call(this);
|
|
case 1:
|
|
return G__2861__1.call(this,x);
|
|
case 2:
|
|
return G__2861__2.call(this,x,y);
|
|
case 3:
|
|
return G__2861__3.call(this,x,y,z);
|
|
default:
|
|
var G__2865 = null;
|
|
if (arguments.length > 3) {
|
|
var G__2866__i = 0, G__2866__a = new Array(arguments.length - 3);
|
|
while (G__2866__i < G__2866__a.length) {G__2866__a[G__2866__i] = arguments[G__2866__i + 3]; ++G__2866__i;}
|
|
G__2865 = new cljs.core.IndexedSeq(G__2866__a,0,null);
|
|
}
|
|
return G__2861__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2865);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2861.cljs$lang$maxFixedArity = 3;
|
|
G__2861.cljs$lang$applyTo = G__2861__4.cljs$lang$applyTo;
|
|
G__2861.cljs$core$IFn$_invoke$arity$0 = G__2861__0;
|
|
G__2861.cljs$core$IFn$_invoke$arity$1 = G__2861__1;
|
|
G__2861.cljs$core$IFn$_invoke$arity$2 = G__2861__2;
|
|
G__2861.cljs$core$IFn$_invoke$arity$3 = G__2861__3;
|
|
G__2861.cljs$core$IFn$_invoke$arity$variadic = G__2861__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__2861;
|
|
})()
|
|
});
|
|
|
|
cljs.core.juxt.cljs$core$IFn$_invoke$arity$variadic = (function (f,g,h,fs){
|
|
var fs__$1 = cljs.core.list_STAR_.cljs$core$IFn$_invoke$arity$4(f,g,h,fs);
|
|
return ((function (fs__$1){
|
|
return (function() {
|
|
var G__2867 = null;
|
|
var G__2867__0 = (function (){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
|
|
return (function (p1__2829_SHARP_,p2__2830_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2829_SHARP_,(p2__2830_SHARP_.cljs$core$IFn$_invoke$arity$0 ? p2__2830_SHARP_.cljs$core$IFn$_invoke$arity$0() : p2__2830_SHARP_.call(null)));
|
|
});})(fs__$1))
|
|
,cljs.core.PersistentVector.EMPTY,fs__$1);
|
|
});
|
|
var G__2867__1 = (function (x){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
|
|
return (function (p1__2831_SHARP_,p2__2832_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2831_SHARP_,(p2__2832_SHARP_.cljs$core$IFn$_invoke$arity$1 ? p2__2832_SHARP_.cljs$core$IFn$_invoke$arity$1(x) : p2__2832_SHARP_.call(null,x)));
|
|
});})(fs__$1))
|
|
,cljs.core.PersistentVector.EMPTY,fs__$1);
|
|
});
|
|
var G__2867__2 = (function (x,y){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
|
|
return (function (p1__2833_SHARP_,p2__2834_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2833_SHARP_,(p2__2834_SHARP_.cljs$core$IFn$_invoke$arity$2 ? p2__2834_SHARP_.cljs$core$IFn$_invoke$arity$2(x,y) : p2__2834_SHARP_.call(null,x,y)));
|
|
});})(fs__$1))
|
|
,cljs.core.PersistentVector.EMPTY,fs__$1);
|
|
});
|
|
var G__2867__3 = (function (x,y,z){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
|
|
return (function (p1__2835_SHARP_,p2__2836_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2835_SHARP_,(p2__2836_SHARP_.cljs$core$IFn$_invoke$arity$3 ? p2__2836_SHARP_.cljs$core$IFn$_invoke$arity$3(x,y,z) : p2__2836_SHARP_.call(null,x,y,z)));
|
|
});})(fs__$1))
|
|
,cljs.core.PersistentVector.EMPTY,fs__$1);
|
|
});
|
|
var G__2867__4 = (function() {
|
|
var G__2868__delegate = function (x,y,z,args){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (fs__$1){
|
|
return (function (p1__2837_SHARP_,p2__2838_SHARP_){
|
|
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__2837_SHARP_,cljs.core.apply.cljs$core$IFn$_invoke$arity$5(p2__2838_SHARP_,x,y,z,args));
|
|
});})(fs__$1))
|
|
,cljs.core.PersistentVector.EMPTY,fs__$1);
|
|
};
|
|
var G__2868 = function (x,y,z,var_args){
|
|
var args = null;
|
|
if (arguments.length > 3) {
|
|
var G__2869__i = 0, G__2869__a = new Array(arguments.length - 3);
|
|
while (G__2869__i < G__2869__a.length) {G__2869__a[G__2869__i] = arguments[G__2869__i + 3]; ++G__2869__i;}
|
|
args = new cljs.core.IndexedSeq(G__2869__a,0,null);
|
|
}
|
|
return G__2868__delegate.call(this,x,y,z,args);};
|
|
G__2868.cljs$lang$maxFixedArity = 3;
|
|
G__2868.cljs$lang$applyTo = (function (arglist__2870){
|
|
var x = cljs.core.first(arglist__2870);
|
|
arglist__2870 = cljs.core.next(arglist__2870);
|
|
var y = cljs.core.first(arglist__2870);
|
|
arglist__2870 = cljs.core.next(arglist__2870);
|
|
var z = cljs.core.first(arglist__2870);
|
|
var args = cljs.core.rest(arglist__2870);
|
|
return G__2868__delegate(x,y,z,args);
|
|
});
|
|
G__2868.cljs$core$IFn$_invoke$arity$variadic = G__2868__delegate;
|
|
return G__2868;
|
|
})()
|
|
;
|
|
G__2867 = function(x,y,z,var_args){
|
|
var args = var_args;
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__2867__0.call(this);
|
|
case 1:
|
|
return G__2867__1.call(this,x);
|
|
case 2:
|
|
return G__2867__2.call(this,x,y);
|
|
case 3:
|
|
return G__2867__3.call(this,x,y,z);
|
|
default:
|
|
var G__2871 = null;
|
|
if (arguments.length > 3) {
|
|
var G__2872__i = 0, G__2872__a = new Array(arguments.length - 3);
|
|
while (G__2872__i < G__2872__a.length) {G__2872__a[G__2872__i] = arguments[G__2872__i + 3]; ++G__2872__i;}
|
|
G__2871 = new cljs.core.IndexedSeq(G__2872__a,0,null);
|
|
}
|
|
return G__2867__4.cljs$core$IFn$_invoke$arity$variadic(x,y,z, G__2871);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__2867.cljs$lang$maxFixedArity = 3;
|
|
G__2867.cljs$lang$applyTo = G__2867__4.cljs$lang$applyTo;
|
|
G__2867.cljs$core$IFn$_invoke$arity$0 = G__2867__0;
|
|
G__2867.cljs$core$IFn$_invoke$arity$1 = G__2867__1;
|
|
G__2867.cljs$core$IFn$_invoke$arity$2 = G__2867__2;
|
|
G__2867.cljs$core$IFn$_invoke$arity$3 = G__2867__3;
|
|
G__2867.cljs$core$IFn$_invoke$arity$variadic = G__2867__4.cljs$core$IFn$_invoke$arity$variadic;
|
|
return G__2867;
|
|
})()
|
|
;})(fs__$1))
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.juxt.cljs$lang$applyTo = (function (seq2840){
|
|
var G__2841 = cljs.core.first(seq2840);
|
|
var seq2840__$1 = cljs.core.next(seq2840);
|
|
var G__2842 = cljs.core.first(seq2840__$1);
|
|
var seq2840__$2 = cljs.core.next(seq2840__$1);
|
|
var G__2843 = cljs.core.first(seq2840__$2);
|
|
var seq2840__$3 = cljs.core.next(seq2840__$2);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2841,G__2842,G__2843,seq2840__$3);
|
|
});
|
|
|
|
cljs.core.juxt.cljs$lang$maxFixedArity = (3);
|
|
|
|
/**
|
|
* When lazy sequences are produced via functions that have side
|
|
* effects, any effects other than those needed to produce the first
|
|
* element in the seq do not occur until the seq is consumed. dorun can
|
|
* be used to force any effects. Walks through the successive nexts of
|
|
* the seq, does not retain the head and returns nil.
|
|
*/
|
|
cljs.core.dorun = (function cljs$core$dorun(var_args){
|
|
var G__2874 = arguments.length;
|
|
switch (G__2874) {
|
|
case 1:
|
|
return cljs.core.dorun.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.dorun.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.dorun.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
while(true){
|
|
var temp__5457__auto__ = cljs.core.seq(coll);
|
|
if(temp__5457__auto__){
|
|
var s = temp__5457__auto__;
|
|
var G__2876 = cljs.core.next(s);
|
|
coll = G__2876;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.dorun.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
while(true){
|
|
if(((cljs.core.seq(coll)) && ((n > (0))))){
|
|
var G__2877 = (n - (1));
|
|
var G__2878 = cljs.core.next(coll);
|
|
n = G__2877;
|
|
coll = G__2878;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.dorun.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* When lazy sequences are produced via functions that have side
|
|
* effects, any effects other than those needed to produce the first
|
|
* element in the seq do not occur until the seq is consumed. doall can
|
|
* be used to force any effects. Walks through the successive nexts of
|
|
* the seq, retains the head and returns it, thus causing the entire
|
|
* seq to reside in memory at one time.
|
|
*/
|
|
cljs.core.doall = (function cljs$core$doall(var_args){
|
|
var G__2880 = arguments.length;
|
|
switch (G__2880) {
|
|
case 1:
|
|
return cljs.core.doall.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.doall.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.doall.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
cljs.core.dorun.cljs$core$IFn$_invoke$arity$1(coll);
|
|
|
|
return coll;
|
|
});
|
|
|
|
cljs.core.doall.cljs$core$IFn$_invoke$arity$2 = (function (n,coll){
|
|
cljs.core.dorun.cljs$core$IFn$_invoke$arity$2(n,coll);
|
|
|
|
return coll;
|
|
});
|
|
|
|
cljs.core.doall.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns true if x is a JavaScript RegExp instance.
|
|
*/
|
|
cljs.core.regexp_QMARK_ = (function cljs$core$regexp_QMARK_(x){
|
|
return (x instanceof RegExp);
|
|
});
|
|
/**
|
|
* Returns the result of (re-find re s) if re fully matches s.
|
|
*/
|
|
cljs.core.re_matches = (function cljs$core$re_matches(re,s){
|
|
if(typeof s === 'string'){
|
|
var matches = re.exec(s);
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.first(matches),s)){
|
|
if((cljs.core.count(matches) === (1))){
|
|
return cljs.core.first(matches);
|
|
} else {
|
|
return cljs.core.vec(matches);
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
throw (new TypeError("re-matches must match against a string."));
|
|
}
|
|
});
|
|
/**
|
|
* Returns the first regex match, if any, of s to re, using
|
|
* re.exec(s). Returns a vector, containing first the matching
|
|
* substring, then any capturing groups if the regular expression contains
|
|
* capturing groups.
|
|
*/
|
|
cljs.core.re_find = (function cljs$core$re_find(re,s){
|
|
if(typeof s === 'string'){
|
|
var matches = re.exec(s);
|
|
if((matches == null)){
|
|
return null;
|
|
} else {
|
|
if((cljs.core.count(matches) === (1))){
|
|
return cljs.core.first(matches);
|
|
} else {
|
|
return cljs.core.vec(matches);
|
|
}
|
|
}
|
|
} else {
|
|
throw (new TypeError("re-find must match against a string."));
|
|
}
|
|
});
|
|
/**
|
|
* Returns a lazy sequence of successive matches of re in s.
|
|
*/
|
|
cljs.core.re_seq = (function cljs$core$re_seq(re,s){
|
|
var match_data = cljs.core.re_find(re,s);
|
|
var match_idx = s.search(re);
|
|
var match_str = ((cljs.core.coll_QMARK_(match_data))?cljs.core.first(match_data):match_data);
|
|
var post_idx = (match_idx + (function (){var x__4135__auto__ = (1);
|
|
var y__4136__auto__ = cljs.core.count(match_str);
|
|
return ((x__4135__auto__ > y__4136__auto__) ? x__4135__auto__ : y__4136__auto__);
|
|
})());
|
|
var post_match = cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,post_idx);
|
|
if(cljs.core.truth_(match_data)){
|
|
return (new cljs.core.LazySeq(null,((function (match_data,match_idx,match_str,post_idx,post_match){
|
|
return (function (){
|
|
return cljs.core.cons(match_data,(((post_idx <= cljs.core.count(s)))?(cljs.core.re_seq.cljs$core$IFn$_invoke$arity$2 ? cljs.core.re_seq.cljs$core$IFn$_invoke$arity$2(re,post_match) : cljs.core.re_seq.call(null,re,post_match)):null));
|
|
});})(match_data,match_idx,match_str,post_idx,post_match))
|
|
,null,null));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns an instance of RegExp which has compiled the provided string.
|
|
*/
|
|
cljs.core.re_pattern = (function cljs$core$re_pattern(s){
|
|
if((s instanceof RegExp)){
|
|
return s;
|
|
} else {
|
|
var vec__2882 = cljs.core.re_find(/^\(\?([idmsux]*)\)/,s);
|
|
var prefix = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2882,(0),null);
|
|
var flags = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2882,(1),null);
|
|
var pattern = cljs.core.subs.cljs$core$IFn$_invoke$arity$2(s,cljs.core.count(prefix));
|
|
return (new RegExp(pattern,(function (){var or__4047__auto__ = flags;
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return "";
|
|
}
|
|
})()));
|
|
}
|
|
});
|
|
cljs.core.pr_sequential_writer = (function cljs$core$pr_sequential_writer(writer,print_one,begin,sep,end,opts,coll){
|
|
var _STAR_print_level_STAR__orig_val__2885 = cljs.core._STAR_print_level_STAR_;
|
|
var _STAR_print_level_STAR__temp_val__2886 = (((cljs.core._STAR_print_level_STAR_ == null))?null:(cljs.core._STAR_print_level_STAR_ - (1)));
|
|
cljs.core._STAR_print_level_STAR_ = _STAR_print_level_STAR__temp_val__2886;
|
|
|
|
try{if((((!((cljs.core._STAR_print_level_STAR_ == null)))) && ((cljs.core._STAR_print_level_STAR_ < (0))))){
|
|
return cljs.core._write(writer,"#");
|
|
} else {
|
|
cljs.core._write(writer,begin);
|
|
|
|
if((cljs.core.cst$kw$print_DASH_length.cljs$core$IFn$_invoke$arity$1(opts) === (0))){
|
|
if(cljs.core.seq(coll)){
|
|
cljs.core._write(writer,(function (){var or__4047__auto__ = cljs.core.cst$kw$more_DASH_marker.cljs$core$IFn$_invoke$arity$1(opts);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return "...";
|
|
}
|
|
})());
|
|
} else {
|
|
}
|
|
} else {
|
|
if(cljs.core.seq(coll)){
|
|
var G__2887_2893 = cljs.core.first(coll);
|
|
var G__2888_2894 = writer;
|
|
var G__2889_2895 = opts;
|
|
(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__2887_2893,G__2888_2894,G__2889_2895) : print_one.call(null,G__2887_2893,G__2888_2894,G__2889_2895));
|
|
} else {
|
|
}
|
|
|
|
var coll_2896__$1 = cljs.core.next(coll);
|
|
var n_2897 = (cljs.core.cst$kw$print_DASH_length.cljs$core$IFn$_invoke$arity$1(opts) - (1));
|
|
while(true){
|
|
if(((coll_2896__$1) && ((((n_2897 == null)) || ((!((n_2897 === (0))))))))){
|
|
cljs.core._write(writer,sep);
|
|
|
|
var G__2890_2898 = cljs.core.first(coll_2896__$1);
|
|
var G__2891_2899 = writer;
|
|
var G__2892_2900 = opts;
|
|
(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__2890_2898,G__2891_2899,G__2892_2900) : print_one.call(null,G__2890_2898,G__2891_2899,G__2892_2900));
|
|
|
|
var G__2901 = cljs.core.next(coll_2896__$1);
|
|
var G__2902 = (n_2897 - (1));
|
|
coll_2896__$1 = G__2901;
|
|
n_2897 = G__2902;
|
|
continue;
|
|
} else {
|
|
if(((cljs.core.seq(coll_2896__$1)) && ((n_2897 === (0))))){
|
|
cljs.core._write(writer,sep);
|
|
|
|
cljs.core._write(writer,(function (){var or__4047__auto__ = cljs.core.cst$kw$more_DASH_marker.cljs$core$IFn$_invoke$arity$1(opts);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return "...";
|
|
}
|
|
})());
|
|
} else {
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
return cljs.core._write(writer,end);
|
|
}
|
|
}finally {cljs.core._STAR_print_level_STAR_ = _STAR_print_level_STAR__orig_val__2885;
|
|
}});
|
|
cljs.core.write_all = (function cljs$core$write_all(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2909 = arguments.length;
|
|
var i__4642__auto___2910 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2910 < len__4641__auto___2909)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2910]));
|
|
|
|
var G__2911 = (i__4642__auto___2910 + (1));
|
|
i__4642__auto___2910 = G__2911;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic = (function (writer,ss){
|
|
var seq__2905 = cljs.core.seq(ss);
|
|
var chunk__2906 = null;
|
|
var count__2907 = (0);
|
|
var i__2908 = (0);
|
|
while(true){
|
|
if((i__2908 < count__2907)){
|
|
var s = chunk__2906.cljs$core$IIndexed$_nth$arity$2(null,i__2908);
|
|
cljs.core._write(writer,s);
|
|
|
|
|
|
var G__2912 = seq__2905;
|
|
var G__2913 = chunk__2906;
|
|
var G__2914 = count__2907;
|
|
var G__2915 = (i__2908 + (1));
|
|
seq__2905 = G__2912;
|
|
chunk__2906 = G__2913;
|
|
count__2907 = G__2914;
|
|
i__2908 = G__2915;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2905);
|
|
if(temp__5457__auto__){
|
|
var seq__2905__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2905__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2905__$1);
|
|
var G__2916 = cljs.core.chunk_rest(seq__2905__$1);
|
|
var G__2917 = c__4461__auto__;
|
|
var G__2918 = cljs.core.count(c__4461__auto__);
|
|
var G__2919 = (0);
|
|
seq__2905 = G__2916;
|
|
chunk__2906 = G__2917;
|
|
count__2907 = G__2918;
|
|
i__2908 = G__2919;
|
|
continue;
|
|
} else {
|
|
var s = cljs.core.first(seq__2905__$1);
|
|
cljs.core._write(writer,s);
|
|
|
|
|
|
var G__2920 = cljs.core.next(seq__2905__$1);
|
|
var G__2921 = null;
|
|
var G__2922 = (0);
|
|
var G__2923 = (0);
|
|
seq__2905 = G__2920;
|
|
chunk__2906 = G__2921;
|
|
count__2907 = G__2922;
|
|
i__2908 = G__2923;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.write_all.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.write_all.cljs$lang$applyTo = (function (seq2903){
|
|
var G__2904 = cljs.core.first(seq2903);
|
|
var seq2903__$1 = cljs.core.next(seq2903);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__2904,seq2903__$1);
|
|
});
|
|
|
|
cljs.core.string_print = (function cljs$core$string_print(x){
|
|
if((cljs.core._STAR_print_fn_STAR_ == null)){
|
|
throw (new Error("No *print-fn* fn set for evaluation environment"));
|
|
} else {
|
|
}
|
|
|
|
(cljs.core._STAR_print_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_print_fn_STAR_.cljs$core$IFn$_invoke$arity$1(x) : cljs.core._STAR_print_fn_STAR_.call(null,x));
|
|
|
|
return null;
|
|
});
|
|
cljs.core.flush = (function cljs$core$flush(){
|
|
return null;
|
|
});
|
|
cljs.core.char_escapes = (function (){var obj2925 = {"\"":"\\\"","\\":"\\\\","\b":"\\b","\f":"\\f","\n":"\\n","\r":"\\r","\t":"\\t"};
|
|
return obj2925;
|
|
})();
|
|
cljs.core.quote_string = (function cljs$core$quote_string(s){
|
|
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1("\""),cljs.core.str.cljs$core$IFn$_invoke$arity$1(s.replace(RegExp("[\\\\\"\b\f\n\r\t]","g"),(function (match){
|
|
return (cljs.core.char_escapes[match]);
|
|
}))),cljs.core.str.cljs$core$IFn$_invoke$arity$1("\"")].join('');
|
|
});
|
|
cljs.core.print_meta_QMARK_ = (function cljs$core$print_meta_QMARK_(opts,obj){
|
|
var and__4036__auto__ = cljs.core.boolean$(cljs.core.get.cljs$core$IFn$_invoke$arity$2(opts,cljs.core.cst$kw$meta));
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = (((!((obj == null))))?(((((obj.cljs$lang$protocol_mask$partition0$ & (131072))) || ((cljs.core.PROTOCOL_SENTINEL === obj.cljs$core$IMeta$))))?true:false):false);
|
|
if(and__4036__auto____$1){
|
|
return (!((cljs.core.meta(obj) == null)));
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
});
|
|
cljs.core.pr_writer_impl = (function cljs$core$pr_writer_impl(obj,writer,opts){
|
|
if((obj == null)){
|
|
return cljs.core._write(writer,"nil");
|
|
} else {
|
|
if(cljs.core.print_meta_QMARK_(opts,obj)){
|
|
cljs.core._write(writer,"^");
|
|
|
|
cljs.core.pr_writer(cljs.core.meta(obj),writer,opts);
|
|
|
|
cljs.core._write(writer," ");
|
|
} else {
|
|
}
|
|
|
|
if(obj.cljs$lang$type){
|
|
return obj.cljs$lang$ctorPrWriter(obj,writer,opts);
|
|
} else {
|
|
if((((!((obj == null))))?(((((obj.cljs$lang$protocol_mask$partition0$ & (2147483648))) || ((cljs.core.PROTOCOL_SENTINEL === obj.cljs$core$IPrintWithWriter$))))?true:(((!obj.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IPrintWithWriter,obj):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IPrintWithWriter,obj))){
|
|
return cljs.core._pr_writer(obj,writer,opts);
|
|
} else {
|
|
if(((obj === true) || (obj === false))){
|
|
return cljs.core._write(writer,cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj));
|
|
} else {
|
|
if(typeof obj === 'number'){
|
|
return cljs.core._write(writer,((isNaN(obj))?"##NaN":(((obj === Number.POSITIVE_INFINITY))?"##Inf":(((obj === Number.NEGATIVE_INFINITY))?"##-Inf":cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)
|
|
))));
|
|
} else {
|
|
if(cljs.core.object_QMARK_(obj)){
|
|
cljs.core._write(writer,"#js ");
|
|
|
|
return cljs.core.print_map(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (k){
|
|
return (new cljs.core.MapEntry((function (){var G__2930 = k;
|
|
if((!((cljs.core.re_matches(/[A-Za-z_\*\+\?!\-'][\w\*\+\?!\-']*/,k) == null)))){
|
|
return cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(G__2930);
|
|
} else {
|
|
return G__2930;
|
|
}
|
|
})(),(obj[k]),null));
|
|
}),cljs.core.js_keys(obj)),cljs.core.pr_writer,writer,opts);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(obj)){
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#js ["," ","]",opts,obj);
|
|
} else {
|
|
if(goog.isString(obj)){
|
|
if(cljs.core.truth_(cljs.core.cst$kw$readably.cljs$core$IFn$_invoke$arity$1(opts))){
|
|
return cljs.core._write(writer,cljs.core.quote_string(obj));
|
|
} else {
|
|
return cljs.core._write(writer,obj);
|
|
}
|
|
} else {
|
|
if(goog.isFunction(obj)){
|
|
var name = obj.name;
|
|
var name__$1 = (cljs.core.truth_((function (){var or__4047__auto__ = (name == null);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.string.isEmpty(name);
|
|
}
|
|
})())?"Function":name);
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1,((cljs.core._STAR_print_fn_bodies_STAR_)?[" \"",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj)),"\""].join(''):""),"]"], 0));
|
|
} else {
|
|
if((obj instanceof Date)){
|
|
var normalize = (function (n,len){
|
|
var ns = cljs.core.str.cljs$core$IFn$_invoke$arity$1(n);
|
|
while(true){
|
|
if((cljs.core.count(ns) < len)){
|
|
var G__2933 = ["0",cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join('');
|
|
ns = G__2933;
|
|
continue;
|
|
} else {
|
|
return ns;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#inst \"",cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj.getUTCFullYear()),"-",normalize((obj.getUTCMonth() + (1)),(2)),"-",normalize(obj.getUTCDate(),(2)),"T",normalize(obj.getUTCHours(),(2)),":",normalize(obj.getUTCMinutes(),(2)),":",normalize(obj.getUTCSeconds(),(2)),".",normalize(obj.getUTCMilliseconds(),(3)),"-","00:00\""], 0));
|
|
} else {
|
|
if(cljs.core.regexp_QMARK_(obj)){
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#\"",obj.source,"\""], 0));
|
|
} else {
|
|
if(cljs.core.truth_((function (){var G__2931 = obj;
|
|
var G__2931__$1 = (((G__2931 == null))?null:G__2931.constructor);
|
|
if((G__2931__$1 == null)){
|
|
return null;
|
|
} else {
|
|
return G__2931__$1.cljs$lang$ctorStr;
|
|
}
|
|
})())){
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",obj.constructor.cljs$lang$ctorStr.replace((new RegExp("/","g")),"."),"]"], 0));
|
|
} else {
|
|
var name = (function (){var G__2932 = obj;
|
|
var G__2932__$1 = (((G__2932 == null))?null:G__2932.constructor);
|
|
if((G__2932__$1 == null)){
|
|
return null;
|
|
} else {
|
|
return G__2932__$1.name;
|
|
}
|
|
})();
|
|
var name__$1 = (cljs.core.truth_((function (){var or__4047__auto__ = (name == null);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return goog.string.isEmpty(name);
|
|
}
|
|
})())?"Object":name);
|
|
if((obj.constructor == null)){
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1,"]"], 0));
|
|
} else {
|
|
return cljs.core.write_all.cljs$core$IFn$_invoke$arity$variadic(writer,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2(["#object[",name__$1," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(obj),"]"], 0));
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
});
|
|
/**
|
|
* Prefer this to pr-seq, because it makes the printing function
|
|
* configurable, allowing efficient implementations such as appending
|
|
* to a StringBuffer.
|
|
*/
|
|
cljs.core.pr_writer = (function cljs$core$pr_writer(obj,writer,opts){
|
|
var temp__5455__auto__ = cljs.core.cst$kw$alt_DASH_impl.cljs$core$IFn$_invoke$arity$1(opts);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var alt_impl = temp__5455__auto__;
|
|
var G__2934 = obj;
|
|
var G__2935 = writer;
|
|
var G__2936 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(opts,cljs.core.cst$kw$fallback_DASH_impl,cljs.core.pr_writer_impl);
|
|
return (alt_impl.cljs$core$IFn$_invoke$arity$3 ? alt_impl.cljs$core$IFn$_invoke$arity$3(G__2934,G__2935,G__2936) : alt_impl.call(null,G__2934,G__2935,G__2936));
|
|
} else {
|
|
return cljs.core.pr_writer_impl(obj,writer,opts);
|
|
}
|
|
});
|
|
cljs.core.pr_seq_writer = (function cljs$core$pr_seq_writer(objs,writer,opts){
|
|
cljs.core.pr_writer(cljs.core.first(objs),writer,opts);
|
|
|
|
var seq__2937 = cljs.core.seq(cljs.core.next(objs));
|
|
var chunk__2938 = null;
|
|
var count__2939 = (0);
|
|
var i__2940 = (0);
|
|
while(true){
|
|
if((i__2940 < count__2939)){
|
|
var obj = chunk__2938.cljs$core$IIndexed$_nth$arity$2(null,i__2940);
|
|
cljs.core._write(writer," ");
|
|
|
|
cljs.core.pr_writer(obj,writer,opts);
|
|
|
|
|
|
var G__2941 = seq__2937;
|
|
var G__2942 = chunk__2938;
|
|
var G__2943 = count__2939;
|
|
var G__2944 = (i__2940 + (1));
|
|
seq__2937 = G__2941;
|
|
chunk__2938 = G__2942;
|
|
count__2939 = G__2943;
|
|
i__2940 = G__2944;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__2937);
|
|
if(temp__5457__auto__){
|
|
var seq__2937__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__2937__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__2937__$1);
|
|
var G__2945 = cljs.core.chunk_rest(seq__2937__$1);
|
|
var G__2946 = c__4461__auto__;
|
|
var G__2947 = cljs.core.count(c__4461__auto__);
|
|
var G__2948 = (0);
|
|
seq__2937 = G__2945;
|
|
chunk__2938 = G__2946;
|
|
count__2939 = G__2947;
|
|
i__2940 = G__2948;
|
|
continue;
|
|
} else {
|
|
var obj = cljs.core.first(seq__2937__$1);
|
|
cljs.core._write(writer," ");
|
|
|
|
cljs.core.pr_writer(obj,writer,opts);
|
|
|
|
|
|
var G__2949 = cljs.core.next(seq__2937__$1);
|
|
var G__2950 = null;
|
|
var G__2951 = (0);
|
|
var G__2952 = (0);
|
|
seq__2937 = G__2949;
|
|
chunk__2938 = G__2950;
|
|
count__2939 = G__2951;
|
|
i__2940 = G__2952;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.pr_sb_with_opts = (function cljs$core$pr_sb_with_opts(objs,opts){
|
|
var sb = (new goog.string.StringBuffer());
|
|
var writer = (new cljs.core.StringBufferWriter(sb));
|
|
cljs.core.pr_seq_writer(objs,writer,opts);
|
|
|
|
writer.cljs$core$IWriter$_flush$arity$1(null);
|
|
|
|
return sb;
|
|
});
|
|
/**
|
|
* Prints a sequence of objects to a string, observing all the
|
|
* options given in opts
|
|
*/
|
|
cljs.core.pr_str_with_opts = (function cljs$core$pr_str_with_opts(objs,opts){
|
|
if(cljs.core.empty_QMARK_(objs)){
|
|
return "";
|
|
} else {
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_sb_with_opts(objs,opts));
|
|
}
|
|
});
|
|
/**
|
|
* Same as pr-str-with-opts followed by (newline)
|
|
*/
|
|
cljs.core.prn_str_with_opts = (function cljs$core$prn_str_with_opts(objs,opts){
|
|
if(cljs.core.empty_QMARK_(objs)){
|
|
return "\n";
|
|
} else {
|
|
var sb = cljs.core.pr_sb_with_opts(objs,opts);
|
|
sb.append("\n");
|
|
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(sb);
|
|
}
|
|
});
|
|
/**
|
|
* Prints a sequence of objects using string-print, observing all
|
|
* the options given in opts
|
|
*/
|
|
cljs.core.pr_with_opts = (function cljs$core$pr_with_opts(objs,opts){
|
|
return cljs.core.string_print(cljs.core.pr_str_with_opts(objs,opts));
|
|
});
|
|
/**
|
|
* Prints a newline using *print-fn*
|
|
*/
|
|
cljs.core.newline = (function cljs$core$newline(var_args){
|
|
var G__2954 = arguments.length;
|
|
switch (G__2954) {
|
|
case 0:
|
|
return cljs.core.newline.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.newline.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.newline.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(null);
|
|
});
|
|
|
|
cljs.core.newline.cljs$core$IFn$_invoke$arity$1 = (function (opts){
|
|
cljs.core.string_print("\n");
|
|
|
|
if(cljs.core.truth_(cljs.core.get.cljs$core$IFn$_invoke$arity$2(opts,cljs.core.cst$kw$flush_DASH_on_DASH_newline))){
|
|
return cljs.core.flush();
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.newline.cljs$lang$maxFixedArity = 1;
|
|
|
|
/**
|
|
* pr to a string, returning it. Fundamental entrypoint to IPrintWithWriter.
|
|
*/
|
|
cljs.core.pr_str = (function cljs$core$pr_str(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2957 = arguments.length;
|
|
var i__4642__auto___2958 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2958 < len__4641__auto___2957)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2958]));
|
|
|
|
var G__2959 = (i__4642__auto___2958 + (1));
|
|
i__4642__auto___2958 = G__2959;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
return cljs.core.pr_str_with_opts(objs,cljs.core.pr_opts());
|
|
});
|
|
|
|
cljs.core.pr_str.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.pr_str.cljs$lang$applyTo = (function (seq2956){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2956));
|
|
});
|
|
|
|
/**
|
|
* Same as pr-str followed by (newline)
|
|
*/
|
|
cljs.core.prn_str = (function cljs$core$prn_str(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2961 = arguments.length;
|
|
var i__4642__auto___2962 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2962 < len__4641__auto___2961)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2962]));
|
|
|
|
var G__2963 = (i__4642__auto___2962 + (1));
|
|
i__4642__auto___2962 = G__2963;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.prn_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.prn_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
return cljs.core.prn_str_with_opts(objs,cljs.core.pr_opts());
|
|
});
|
|
|
|
cljs.core.prn_str.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.prn_str.cljs$lang$applyTo = (function (seq2960){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2960));
|
|
});
|
|
|
|
/**
|
|
* Prints the object(s) using string-print. Prints the
|
|
* object(s), separated by spaces if there is more than one.
|
|
* By default, pr and prn print in a way that objects can be
|
|
* read by the reader
|
|
*/
|
|
cljs.core.pr = (function cljs$core$pr(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2965 = arguments.length;
|
|
var i__4642__auto___2966 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2966 < len__4641__auto___2965)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2966]));
|
|
|
|
var G__2967 = (i__4642__auto___2966 + (1));
|
|
i__4642__auto___2966 = G__2967;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.pr.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.pr.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
return cljs.core.pr_with_opts(objs,cljs.core.pr_opts());
|
|
});
|
|
|
|
cljs.core.pr.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.pr.cljs$lang$applyTo = (function (seq2964){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2964));
|
|
});
|
|
|
|
/**
|
|
* Prints the object(s) using string-print.
|
|
* print and println produce output for human consumption.
|
|
* @param {...*} var_args
|
|
*/
|
|
cljs.core.print = (function() {
|
|
var cljs$core$cljs_core_print__delegate = function (objs){
|
|
return cljs.core.pr_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
|
|
};
|
|
var cljs$core$cljs_core_print = function (var_args){
|
|
var objs = null;
|
|
if (arguments.length > 0) {
|
|
var G__2968__i = 0, G__2968__a = new Array(arguments.length - 0);
|
|
while (G__2968__i < G__2968__a.length) {G__2968__a[G__2968__i] = arguments[G__2968__i + 0]; ++G__2968__i;}
|
|
objs = new cljs.core.IndexedSeq(G__2968__a,0,null);
|
|
}
|
|
return cljs$core$cljs_core_print__delegate.call(this,objs);};
|
|
cljs$core$cljs_core_print.cljs$lang$maxFixedArity = 0;
|
|
cljs$core$cljs_core_print.cljs$lang$applyTo = (function (arglist__2969){
|
|
var objs = cljs.core.seq(arglist__2969);
|
|
return cljs$core$cljs_core_print__delegate(objs);
|
|
});
|
|
cljs$core$cljs_core_print.cljs$core$IFn$_invoke$arity$variadic = cljs$core$cljs_core_print__delegate;
|
|
return cljs$core$cljs_core_print;
|
|
})()
|
|
;
|
|
/**
|
|
* print to a string, returning it
|
|
*/
|
|
cljs.core.print_str = (function cljs$core$print_str(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2971 = arguments.length;
|
|
var i__4642__auto___2972 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2972 < len__4641__auto___2971)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2972]));
|
|
|
|
var G__2973 = (i__4642__auto___2972 + (1));
|
|
i__4642__auto___2972 = G__2973;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.print_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.print_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
return cljs.core.pr_str_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
|
|
});
|
|
|
|
cljs.core.print_str.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.print_str.cljs$lang$applyTo = (function (seq2970){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2970));
|
|
});
|
|
|
|
/**
|
|
* Same as print followed by (newline)
|
|
*/
|
|
cljs.core.println = (function cljs$core$println(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2975 = arguments.length;
|
|
var i__4642__auto___2976 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2976 < len__4641__auto___2975)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2976]));
|
|
|
|
var G__2977 = (i__4642__auto___2976 + (1));
|
|
i__4642__auto___2976 = G__2977;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.println.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.println.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
cljs.core.pr_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
|
|
|
|
if(cljs.core._STAR_print_newline_STAR_){
|
|
return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_opts());
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.println.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.println.cljs$lang$applyTo = (function (seq2974){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2974));
|
|
});
|
|
|
|
/**
|
|
* println to a string, returning it
|
|
*/
|
|
cljs.core.println_str = (function cljs$core$println_str(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2979 = arguments.length;
|
|
var i__4642__auto___2980 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2980 < len__4641__auto___2979)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2980]));
|
|
|
|
var G__2981 = (i__4642__auto___2980 + (1));
|
|
i__4642__auto___2980 = G__2981;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.println_str.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.println_str.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
return cljs.core.prn_str_with_opts(objs,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.pr_opts(),cljs.core.cst$kw$readably,false));
|
|
});
|
|
|
|
cljs.core.println_str.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.println_str.cljs$lang$applyTo = (function (seq2978){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2978));
|
|
});
|
|
|
|
/**
|
|
* Same as pr followed by (newline).
|
|
*/
|
|
cljs.core.prn = (function cljs$core$prn(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___2983 = arguments.length;
|
|
var i__4642__auto___2984 = (0);
|
|
while(true){
|
|
if((i__4642__auto___2984 < len__4641__auto___2983)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___2984]));
|
|
|
|
var G__2985 = (i__4642__auto___2984 + (1));
|
|
i__4642__auto___2984 = G__2985;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.prn.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.prn.cljs$core$IFn$_invoke$arity$variadic = (function (objs){
|
|
cljs.core.pr_with_opts(objs,cljs.core.pr_opts());
|
|
|
|
if(cljs.core._STAR_print_newline_STAR_){
|
|
return cljs.core.newline.cljs$core$IFn$_invoke$arity$1(cljs.core.pr_opts());
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.prn.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.prn.cljs$lang$applyTo = (function (seq2982){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq2982));
|
|
});
|
|
|
|
cljs.core.strip_ns = (function cljs$core$strip_ns(named){
|
|
if((named instanceof cljs.core.Symbol)){
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(null,cljs.core.name(named));
|
|
} else {
|
|
return cljs.core.keyword.cljs$core$IFn$_invoke$arity$2(null,cljs.core.name(named));
|
|
}
|
|
});
|
|
/**
|
|
* Returns [lifted-ns lifted-map] or nil if m can't be lifted.
|
|
*/
|
|
cljs.core.lift_ns = (function cljs$core$lift_ns(m){
|
|
if(cljs.core._STAR_print_namespace_maps_STAR_){
|
|
var ns = null;
|
|
var G__2992 = cljs.core.seq(m);
|
|
var vec__2993 = G__2992;
|
|
var seq__2994 = cljs.core.seq(vec__2993);
|
|
var first__2995 = cljs.core.first(seq__2994);
|
|
var seq__2994__$1 = cljs.core.next(seq__2994);
|
|
var vec__2996 = first__2995;
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2996,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__2996,(1),null);
|
|
var entry = vec__2996;
|
|
var entries = seq__2994__$1;
|
|
var lm = cljs.core.empty(m);
|
|
var ns__$1 = ns;
|
|
var G__2992__$1 = G__2992;
|
|
var lm__$1 = lm;
|
|
while(true){
|
|
var ns__$2 = ns__$1;
|
|
var vec__2999 = G__2992__$1;
|
|
var seq__3000 = cljs.core.seq(vec__2999);
|
|
var first__3001 = cljs.core.first(seq__3000);
|
|
var seq__3000__$1 = cljs.core.next(seq__3000);
|
|
var vec__3002 = first__3001;
|
|
var k__$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3002,(0),null);
|
|
var v__$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3002,(1),null);
|
|
var entry__$1 = vec__3002;
|
|
var entries__$1 = seq__3000__$1;
|
|
var lm__$2 = lm__$1;
|
|
if(cljs.core.truth_(entry__$1)){
|
|
if((((k__$1 instanceof cljs.core.Keyword)) || ((k__$1 instanceof cljs.core.Symbol)))){
|
|
if(cljs.core.truth_(ns__$2)){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(ns__$2,cljs.core.namespace(k__$1))){
|
|
var G__3005 = ns__$2;
|
|
var G__3006 = entries__$1;
|
|
var G__3007 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(lm__$2,cljs.core.strip_ns(k__$1),v__$1);
|
|
ns__$1 = G__3005;
|
|
G__2992__$1 = G__3006;
|
|
lm__$1 = G__3007;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.namespace(k__$1);
|
|
if(cljs.core.truth_(temp__5457__auto__)){
|
|
var new_ns = temp__5457__auto__;
|
|
var G__3008 = new_ns;
|
|
var G__3009 = entries__$1;
|
|
var G__3010 = cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(lm__$2,cljs.core.strip_ns(k__$1),v__$1);
|
|
ns__$1 = G__3008;
|
|
G__2992__$1 = G__3009;
|
|
lm__$1 = G__3010;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
} else {
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [ns__$2,lm__$2], null);
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
cljs.core.print_prefix_map = (function cljs$core$print_prefix_map(prefix,m,print_one,writer,opts){
|
|
return cljs.core.pr_sequential_writer(writer,(function (e,w,opts__$1){
|
|
var G__3011_3017 = cljs.core.key(e);
|
|
var G__3012_3018 = w;
|
|
var G__3013_3019 = opts__$1;
|
|
(print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__3011_3017,G__3012_3018,G__3013_3019) : print_one.call(null,G__3011_3017,G__3012_3018,G__3013_3019));
|
|
|
|
cljs.core._write(w," ");
|
|
|
|
var G__3014 = cljs.core.val(e);
|
|
var G__3015 = w;
|
|
var G__3016 = opts__$1;
|
|
return (print_one.cljs$core$IFn$_invoke$arity$3 ? print_one.cljs$core$IFn$_invoke$arity$3(G__3014,G__3015,G__3016) : print_one.call(null,G__3014,G__3015,G__3016));
|
|
}),[cljs.core.str.cljs$core$IFn$_invoke$arity$1(prefix),"{"].join(''),", ","}",opts,cljs.core.seq(m));
|
|
});
|
|
cljs.core.print_map = (function cljs$core$print_map(m,print_one,writer,opts){
|
|
var vec__3020 = ((cljs.core.map_QMARK_(m))?cljs.core.lift_ns(m):null);
|
|
var ns = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3020,(0),null);
|
|
var lift_map = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3020,(1),null);
|
|
if(cljs.core.truth_(ns)){
|
|
return cljs.core.print_prefix_map(["#:",cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns)].join(''),lift_map,print_one,writer,opts);
|
|
} else {
|
|
return cljs.core.print_prefix_map(null,m,print_one,writer,opts);
|
|
}
|
|
});
|
|
cljs.core.Volatile.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Volatile.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
|
|
var a__$1 = this;
|
|
cljs.core._write(writer,"#object [cljs.core.Volatile ");
|
|
|
|
cljs.core.pr_writer(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$val,a__$1.state], null),writer,opts);
|
|
|
|
return cljs.core._write(writer,"]");
|
|
});
|
|
|
|
cljs.core.Var.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Var.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
|
|
var a__$1 = this;
|
|
cljs.core._write(writer,"#'");
|
|
|
|
return cljs.core.pr_writer(a__$1.sym,writer,opts);
|
|
});
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.IndexedSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.LazySeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentTreeMapSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.NodeSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentArrayMapSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.ES6IteratorSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ES6IteratorSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentTreeSet.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#{"," ","}",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ChunkedSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ObjMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
|
|
});
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Cons.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Iterate.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.RSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentHashMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
|
|
});
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ArrayNodeSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Cycle.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentTreeMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
|
|
});
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentHashSet.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#{"," ","}",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ChunkedCons.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Atom.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (a,writer,opts){
|
|
var a__$1 = this;
|
|
cljs.core._write(writer,"#object [cljs.core.Atom ");
|
|
|
|
cljs.core.pr_writer(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$val,a__$1.state], null),writer,opts);
|
|
|
|
return cljs.core._write(writer,"]");
|
|
});
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ValSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Repeat.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentQueueSeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.EmptyList.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core._write(writer,"()");
|
|
});
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentQueue.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"#queue ["," ","]",opts,cljs.core.seq(coll__$1));
|
|
});
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentArrayMap.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.print_map(coll__$1,cljs.core.pr_writer,writer,opts);
|
|
});
|
|
|
|
cljs.core.Range.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Range.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.TransformerIterator.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.TransformerIterator.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.KeySeq.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
|
|
cljs.core.List.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.List.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
|
|
var coll__$1 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$1);
|
|
});
|
|
cljs.core.Symbol.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Symbol.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if((y instanceof cljs.core.Symbol)){
|
|
return cljs.core.compare_symbols(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Keyword.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if((y instanceof cljs.core.Keyword)){
|
|
return cljs.core.compare_keywords(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.Subvec.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if(cljs.core.vector_QMARK_(y)){
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.PersistentVector.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if(cljs.core.vector_QMARK_(y)){
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.MapEntry.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if(cljs.core.vector_QMARK_(y)){
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.BlackNode.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if(cljs.core.vector_QMARK_(y)){
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IComparable$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.RedNode.prototype.cljs$core$IComparable$_compare$arity$2 = (function (x,y){
|
|
var x__$1 = this;
|
|
if(cljs.core.vector_QMARK_(y)){
|
|
return cljs.core.compare_indexed.cljs$core$IFn$_invoke$arity$2(x__$1,y);
|
|
} else {
|
|
throw (new Error(["Cannot compare ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1)," to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(y)].join('')));
|
|
}
|
|
});
|
|
/**
|
|
* Atomically sets the metadata for a namespace/var/ref/agent/atom to be:
|
|
*
|
|
* (apply f its-current-meta args)
|
|
*
|
|
* f must be free of side-effects
|
|
*/
|
|
cljs.core.alter_meta_BANG_ = (function cljs$core$alter_meta_BANG_(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___3026 = arguments.length;
|
|
var i__4642__auto___3027 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3027 < len__4641__auto___3026)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___3027]));
|
|
|
|
var G__3028 = (i__4642__auto___3027 + (1));
|
|
i__4642__auto___3027 = G__3028;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((2) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((2)),(0),null)):null);
|
|
return cljs.core.alter_meta_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.alter_meta_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (iref,f,args){
|
|
return iref.meta = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(f,iref.meta,args);
|
|
});
|
|
|
|
cljs.core.alter_meta_BANG_.cljs$lang$maxFixedArity = (2);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.alter_meta_BANG_.cljs$lang$applyTo = (function (seq3023){
|
|
var G__3024 = cljs.core.first(seq3023);
|
|
var seq3023__$1 = cljs.core.next(seq3023);
|
|
var G__3025 = cljs.core.first(seq3023__$1);
|
|
var seq3023__$2 = cljs.core.next(seq3023__$1);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3024,G__3025,seq3023__$2);
|
|
});
|
|
|
|
/**
|
|
* Atomically resets the metadata for an atom
|
|
*/
|
|
cljs.core.reset_meta_BANG_ = (function cljs$core$reset_meta_BANG_(iref,m){
|
|
return iref.meta = m;
|
|
});
|
|
/**
|
|
* Adds a watch function to an atom reference. The watch fn must be a
|
|
* fn of 4 args: a key, the reference, its old-state, its
|
|
* new-state. Whenever the reference's state might have been changed,
|
|
* any registered watches will have their functions called. The watch
|
|
* fn will be called synchronously. Note that an atom's state
|
|
* may have changed again prior to the fn call, so use old/new-state
|
|
* rather than derefing the reference. Keys must be unique per
|
|
* reference, and can be used to remove the watch with remove-watch,
|
|
* but are otherwise considered opaque by the watch mechanism. Bear in
|
|
* mind that regardless of the result or action of the watch fns the
|
|
* atom's value will change. Example:
|
|
*
|
|
* (def a (atom 0))
|
|
* (add-watch a :inc (fn [k r o n] (assert (== 0 n))))
|
|
* (swap! a inc)
|
|
* ;; Assertion Error
|
|
* (deref a)
|
|
* ;=> 1
|
|
*/
|
|
cljs.core.add_watch = (function cljs$core$add_watch(iref,key,f){
|
|
cljs.core._add_watch(iref,key,f);
|
|
|
|
return iref;
|
|
});
|
|
/**
|
|
* Removes a watch (set by add-watch) from a reference
|
|
*/
|
|
cljs.core.remove_watch = (function cljs$core$remove_watch(iref,key){
|
|
cljs.core._remove_watch(iref,key);
|
|
|
|
return iref;
|
|
});
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core.gensym_counter = null;
|
|
/**
|
|
* Returns a new symbol with a unique name. If a prefix string is
|
|
* supplied, the name is prefix# where # is some unique number. If
|
|
* prefix is not supplied, the prefix is 'G__'.
|
|
*/
|
|
cljs.core.gensym = (function cljs$core$gensym(var_args){
|
|
var G__3030 = arguments.length;
|
|
switch (G__3030) {
|
|
case 0:
|
|
return cljs.core.gensym.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.gensym.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.gensym.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.gensym.cljs$core$IFn$_invoke$arity$1("G__");
|
|
});
|
|
|
|
cljs.core.gensym.cljs$core$IFn$_invoke$arity$1 = (function (prefix_string){
|
|
if((cljs.core.gensym_counter == null)){
|
|
cljs.core.gensym_counter = cljs.core.atom.cljs$core$IFn$_invoke$arity$1((0));
|
|
} else {
|
|
}
|
|
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(prefix_string),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(cljs.core.gensym_counter,cljs.core.inc))].join(''));
|
|
});
|
|
|
|
cljs.core.gensym.cljs$lang$maxFixedArity = 1;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IPending}
|
|
* @implements {cljs.core.IDeref}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
*/
|
|
cljs.core.Delay = (function (f,value){
|
|
this.f = f;
|
|
this.value = value;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2147516416;
|
|
this.cljs$lang$protocol_mask$partition1$ = 1;
|
|
});
|
|
cljs.core.Delay.prototype.cljs$core$IDeref$_deref$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if(cljs.core.truth_(self__.f)){
|
|
self__.value = (self__.f.cljs$core$IFn$_invoke$arity$0 ? self__.f.cljs$core$IFn$_invoke$arity$0() : self__.f.call(null));
|
|
|
|
self__.f = null;
|
|
} else {
|
|
}
|
|
|
|
return self__.value;
|
|
});
|
|
|
|
cljs.core.Delay.prototype.cljs$core$IPending$_realized_QMARK_$arity$1 = (function (x){
|
|
var self__ = this;
|
|
var x__$1 = this;
|
|
return cljs.core.not(self__.f);
|
|
});
|
|
|
|
cljs.core.Delay.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (x,writer,opts){
|
|
var self__ = this;
|
|
var x__$1 = this;
|
|
cljs.core._write(writer,"#object[cljs.core.Delay ");
|
|
|
|
cljs.core.pr_writer(new cljs.core.PersistentArrayMap(null, 2, [cljs.core.cst$kw$status,(((self__.f == null))?cljs.core.cst$kw$ready:cljs.core.cst$kw$pending),cljs.core.cst$kw$val,self__.value], null),writer,opts);
|
|
|
|
return cljs.core._write(writer,"]");
|
|
});
|
|
|
|
cljs.core.Delay.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.with_meta(cljs.core.cst$sym$f,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null)),cljs.core.with_meta(cljs.core.cst$sym$value,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.Delay.cljs$lang$type = true;
|
|
|
|
cljs.core.Delay.cljs$lang$ctorStr = "cljs.core/Delay";
|
|
|
|
cljs.core.Delay.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Delay");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Delay.
|
|
*/
|
|
cljs.core.__GT_Delay = (function cljs$core$__GT_Delay(f,value){
|
|
return (new cljs.core.Delay(f,value));
|
|
});
|
|
|
|
/**
|
|
* returns true if x is a Delay created with delay
|
|
*/
|
|
cljs.core.delay_QMARK_ = (function cljs$core$delay_QMARK_(x){
|
|
return (x instanceof cljs.core.Delay);
|
|
});
|
|
/**
|
|
* If x is a Delay, returns the (possibly cached) value of its expression, else returns x
|
|
*/
|
|
cljs.core.force = (function cljs$core$force(x){
|
|
if(cljs.core.delay_QMARK_(x)){
|
|
return cljs.core.deref(x);
|
|
} else {
|
|
return x;
|
|
}
|
|
});
|
|
/**
|
|
* Returns true if a value has been produced for a delay or lazy sequence.
|
|
*/
|
|
cljs.core.realized_QMARK_ = (function cljs$core$realized_QMARK_(x){
|
|
return cljs.core._realized_QMARK_(x);
|
|
});
|
|
cljs.core.preserving_reduced = (function cljs$core$preserving_reduced(rf){
|
|
return (function (p1__3032_SHARP_,p2__3033_SHARP_){
|
|
var ret = (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(p1__3032_SHARP_,p2__3033_SHARP_) : rf.call(null,p1__3032_SHARP_,p2__3033_SHARP_));
|
|
if(cljs.core.reduced_QMARK_(ret)){
|
|
return cljs.core.reduced(ret);
|
|
} else {
|
|
return ret;
|
|
}
|
|
});
|
|
});
|
|
/**
|
|
* A transducer which concatenates the contents of each input, which must be a
|
|
* collection, into the reduction.
|
|
*/
|
|
cljs.core.cat = (function cljs$core$cat(rf){
|
|
var rf1 = cljs.core.preserving_reduced(rf);
|
|
return ((function (rf1){
|
|
return (function() {
|
|
var G__3034 = null;
|
|
var G__3034__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__3034__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__3034__2 = (function (result,input){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(rf1,result,input);
|
|
});
|
|
G__3034 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__3034__0.call(this);
|
|
case 1:
|
|
return G__3034__1.call(this,result);
|
|
case 2:
|
|
return G__3034__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__3034.cljs$core$IFn$_invoke$arity$0 = G__3034__0;
|
|
G__3034.cljs$core$IFn$_invoke$arity$1 = G__3034__1;
|
|
G__3034.cljs$core$IFn$_invoke$arity$2 = G__3034__2;
|
|
return G__3034;
|
|
})()
|
|
;})(rf1))
|
|
});
|
|
/**
|
|
* Returns a transducer that ends transduction when pred returns true
|
|
* for an input. When retf is supplied it must be a fn of 2 arguments -
|
|
* it will be passed the (completed) result so far and the input that
|
|
* triggered the predicate, and its return value (if it does not throw
|
|
* an exception) will be the return value of the transducer. If retf
|
|
* is not supplied, the input that triggered the predicate will be
|
|
* returned. If the predicate never returns true the transduction is
|
|
* unaffected.
|
|
*/
|
|
cljs.core.halt_when = (function cljs$core$halt_when(var_args){
|
|
var G__3036 = arguments.length;
|
|
switch (G__3036) {
|
|
case 1:
|
|
return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.halt_when.cljs$core$IFn$_invoke$arity$1 = (function (pred){
|
|
return cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2(pred,null);
|
|
});
|
|
|
|
cljs.core.halt_when.cljs$core$IFn$_invoke$arity$2 = (function (pred,retf){
|
|
return (function (rf){
|
|
return (function() {
|
|
var G__3040 = null;
|
|
var G__3040__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__3040__1 = (function (result){
|
|
if(((cljs.core.map_QMARK_(result)) && (cljs.core.contains_QMARK_(result,cljs.core.cst$kw$cljs$core_SLASH_halt)))){
|
|
return cljs.core.cst$kw$cljs$core_SLASH_halt.cljs$core$IFn$_invoke$arity$1(result);
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
}
|
|
});
|
|
var G__3040__2 = (function (result,input){
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$1 ? pred.cljs$core$IFn$_invoke$arity$1(input) : pred.call(null,input)))){
|
|
return cljs.core.reduced(new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$cljs$core_SLASH_halt,(cljs.core.truth_(retf)?(function (){var G__3037 = (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
var G__3038 = input;
|
|
return (retf.cljs$core$IFn$_invoke$arity$2 ? retf.cljs$core$IFn$_invoke$arity$2(G__3037,G__3038) : retf.call(null,G__3037,G__3038));
|
|
})():input)], null));
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__3040 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__3040__0.call(this);
|
|
case 1:
|
|
return G__3040__1.call(this,result);
|
|
case 2:
|
|
return G__3040__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__3040.cljs$core$IFn$_invoke$arity$0 = G__3040__0;
|
|
G__3040.cljs$core$IFn$_invoke$arity$1 = G__3040__1;
|
|
G__3040.cljs$core$IFn$_invoke$arity$2 = G__3040__2;
|
|
return G__3040;
|
|
})()
|
|
});
|
|
});
|
|
|
|
cljs.core.halt_when.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns a lazy sequence removing consecutive duplicates in coll.
|
|
* Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.dedupe = (function cljs$core$dedupe(var_args){
|
|
var G__3042 = arguments.length;
|
|
switch (G__3042) {
|
|
case 0:
|
|
return cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.dedupe.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return (function (rf){
|
|
var pa = cljs.core.volatile_BANG_(cljs.core.cst$kw$cljs$core_SLASH_none);
|
|
return ((function (pa){
|
|
return (function() {
|
|
var G__3044 = null;
|
|
var G__3044__0 = (function (){
|
|
return (rf.cljs$core$IFn$_invoke$arity$0 ? rf.cljs$core$IFn$_invoke$arity$0() : rf.call(null));
|
|
});
|
|
var G__3044__1 = (function (result){
|
|
return (rf.cljs$core$IFn$_invoke$arity$1 ? rf.cljs$core$IFn$_invoke$arity$1(result) : rf.call(null,result));
|
|
});
|
|
var G__3044__2 = (function (result,input){
|
|
var prior = cljs.core.deref(pa);
|
|
cljs.core.vreset_BANG_(pa,input);
|
|
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(prior,input)){
|
|
return result;
|
|
} else {
|
|
return (rf.cljs$core$IFn$_invoke$arity$2 ? rf.cljs$core$IFn$_invoke$arity$2(result,input) : rf.call(null,result,input));
|
|
}
|
|
});
|
|
G__3044 = function(result,input){
|
|
switch(arguments.length){
|
|
case 0:
|
|
return G__3044__0.call(this);
|
|
case 1:
|
|
return G__3044__1.call(this,result);
|
|
case 2:
|
|
return G__3044__2.call(this,result,input);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__3044.cljs$core$IFn$_invoke$arity$0 = G__3044__0;
|
|
G__3044.cljs$core$IFn$_invoke$arity$1 = G__3044__1;
|
|
G__3044.cljs$core$IFn$_invoke$arity$2 = G__3044__2;
|
|
return G__3044;
|
|
})()
|
|
;})(pa))
|
|
});
|
|
});
|
|
|
|
cljs.core.dedupe.cljs$core$IFn$_invoke$arity$1 = (function (coll){
|
|
return cljs.core.sequence.cljs$core$IFn$_invoke$arity$2(cljs.core.dedupe.cljs$core$IFn$_invoke$arity$0(),coll);
|
|
});
|
|
|
|
cljs.core.dedupe.cljs$lang$maxFixedArity = 1;
|
|
|
|
/**
|
|
* Returns items from coll with random probability of prob (0.0 -
|
|
* 1.0). Returns a transducer when no collection is provided.
|
|
*/
|
|
cljs.core.random_sample = (function cljs$core$random_sample(var_args){
|
|
var G__3046 = arguments.length;
|
|
switch (G__3046) {
|
|
case 1:
|
|
return cljs.core.random_sample.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.random_sample.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.random_sample.cljs$core$IFn$_invoke$arity$1 = (function (prob){
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$1((function (_){
|
|
return (cljs.core.rand.cljs$core$IFn$_invoke$arity$0() < prob);
|
|
}));
|
|
});
|
|
|
|
cljs.core.random_sample.cljs$core$IFn$_invoke$arity$2 = (function (prob,coll){
|
|
return cljs.core.filter.cljs$core$IFn$_invoke$arity$2((function (_){
|
|
return (cljs.core.rand.cljs$core$IFn$_invoke$arity$0() < prob);
|
|
}),coll);
|
|
});
|
|
|
|
cljs.core.random_sample.cljs$lang$maxFixedArity = 2;
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.ISeqable}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
* @implements {cljs.core.IIterable}
|
|
* @implements {cljs.core.ISequential}
|
|
* @implements {cljs.core.IReduce}
|
|
*/
|
|
cljs.core.Eduction = (function (xform,coll){
|
|
this.xform = xform;
|
|
this.coll = coll;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2173173760;
|
|
this.cljs$lang$protocol_mask$partition1$ = 131072;
|
|
});
|
|
cljs.core.Eduction.prototype.indexOf = (function() {
|
|
var G__3048 = null;
|
|
var G__3048__1 = (function (x){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,(0));
|
|
});
|
|
var G__3048__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._indexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,start);
|
|
});
|
|
G__3048 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__3048__1.call(this,x);
|
|
case 2:
|
|
return G__3048__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__3048.cljs$core$IFn$_invoke$arity$1 = G__3048__1;
|
|
G__3048.cljs$core$IFn$_invoke$arity$2 = G__3048__2;
|
|
return G__3048;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Eduction.prototype.lastIndexOf = (function() {
|
|
var G__3049 = null;
|
|
var G__3049__1 = (function (x){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,cljs.core.count(coll__$1));
|
|
});
|
|
var G__3049__2 = (function (x,start){
|
|
var self__ = this;
|
|
var coll__$1 = this;
|
|
return cljs.core._lastIndexOf.cljs$core$IFn$_invoke$arity$3(coll__$1,x,start);
|
|
});
|
|
G__3049 = function(x,start){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__3049__1.call(this,x);
|
|
case 2:
|
|
return G__3049__2.call(this,x,start);
|
|
}
|
|
throw(new Error('Invalid arity: ' + arguments.length));
|
|
};
|
|
G__3049.cljs$core$IFn$_invoke$arity$1 = G__3049__1;
|
|
G__3049.cljs$core$IFn$_invoke$arity$2 = G__3049__2;
|
|
return G__3049;
|
|
})()
|
|
;
|
|
|
|
cljs.core.Eduction.prototype.cljs$core$IIterable$_iterator$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.TransformerIterator.create(self__.xform,cljs.core.iter(self__.coll));
|
|
});
|
|
|
|
cljs.core.Eduction.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.seq(cljs.core.sequence.cljs$core$IFn$_invoke$arity$2(self__.xform,self__.coll));
|
|
});
|
|
|
|
cljs.core.Eduction.prototype.cljs$core$IReduce$_reduce$arity$2 = (function (_,f){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$3(self__.xform,cljs.core.completing.cljs$core$IFn$_invoke$arity$1(f),self__.coll);
|
|
});
|
|
|
|
cljs.core.Eduction.prototype.cljs$core$IReduce$_reduce$arity$3 = (function (_,f,init){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.transduce.cljs$core$IFn$_invoke$arity$4(self__.xform,cljs.core.completing.cljs$core$IFn$_invoke$arity$1(f),init,self__.coll);
|
|
});
|
|
|
|
cljs.core.Eduction.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll__$1,writer,opts){
|
|
var self__ = this;
|
|
var coll__$2 = this;
|
|
return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"("," ",")",opts,coll__$2);
|
|
});
|
|
|
|
cljs.core.Eduction.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$xform,cljs.core.cst$sym$coll], null);
|
|
});
|
|
|
|
cljs.core.Eduction.cljs$lang$type = true;
|
|
|
|
cljs.core.Eduction.cljs$lang$ctorStr = "cljs.core/Eduction";
|
|
|
|
cljs.core.Eduction.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Eduction");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Eduction.
|
|
*/
|
|
cljs.core.__GT_Eduction = (function cljs$core$__GT_Eduction(xform,coll){
|
|
return (new cljs.core.Eduction(xform,coll));
|
|
});
|
|
|
|
var G__3050_3053 = cljs.core.Eduction.prototype;
|
|
var G__3051_3054 = cljs.core.ITER_SYMBOL;
|
|
var G__3052_3055 = ((function (G__3050_3053,G__3051_3054){
|
|
return (function (){
|
|
var this__4580__auto__ = this;
|
|
return cljs.core.es6_iterator(this__4580__auto__);
|
|
});})(G__3050_3053,G__3051_3054))
|
|
;
|
|
goog.object.set(G__3050_3053,G__3051_3054,G__3052_3055);
|
|
/**
|
|
* Returns a reducible/iterable application of the transducers
|
|
* to the items in coll. Transducers are applied in order as if
|
|
* combined with comp. Note that these applications will be
|
|
* performed every time reduce/iterator is called.
|
|
*/
|
|
cljs.core.eduction = (function cljs$core$eduction(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___3057 = arguments.length;
|
|
var i__4642__auto___3058 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3058 < len__4641__auto___3057)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___3058]));
|
|
|
|
var G__3059 = (i__4642__auto___3058 + (1));
|
|
i__4642__auto___3058 = G__3059;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((0) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((0)),(0),null)):null);
|
|
return cljs.core.eduction.cljs$core$IFn$_invoke$arity$variadic(argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.eduction.cljs$core$IFn$_invoke$arity$variadic = (function (xforms){
|
|
return (new cljs.core.Eduction(cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.comp,cljs.core.butlast(xforms)),cljs.core.last(xforms)));
|
|
});
|
|
|
|
cljs.core.eduction.cljs$lang$maxFixedArity = (0);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.eduction.cljs$lang$applyTo = (function (seq3056){
|
|
var self__4629__auto__ = this;
|
|
return self__4629__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq3056));
|
|
});
|
|
|
|
/**
|
|
* Runs the supplied procedure (via reduce), for purposes of side
|
|
* effects, on successive items in the collection. Returns nil
|
|
*/
|
|
cljs.core.run_BANG_ = (function cljs$core$run_BANG_(proc,coll){
|
|
cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__3061_SHARP_,p2__3060_SHARP_){
|
|
return (proc.cljs$core$IFn$_invoke$arity$1 ? proc.cljs$core$IFn$_invoke$arity$1(p2__3060_SHARP_) : proc.call(null,p2__3060_SHARP_));
|
|
}),null,coll);
|
|
|
|
return null;
|
|
});
|
|
|
|
/**
|
|
* @interface
|
|
*/
|
|
cljs.core.IEncodeJS = function(){};
|
|
|
|
/**
|
|
* Recursively transforms clj values to JavaScript
|
|
*/
|
|
cljs.core._clj__GT_js = (function cljs$core$_clj__GT_js(x){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$IEncodeJS$_clj__GT_js$arity$1 == null)))))){
|
|
return x.cljs$core$IEncodeJS$_clj__GT_js$arity$1(x);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._clj__GT_js[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto__.call(null,x));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._clj__GT_js["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto____$1.call(null,x));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEncodeJS.-clj->js",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Transforms map keys to valid JavaScript keys. Arbitrary keys are
|
|
* encoded to their string representation via (pr-str x)
|
|
*/
|
|
cljs.core._key__GT_js = (function cljs$core$_key__GT_js(x){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$IEncodeJS$_key__GT_js$arity$1 == null)))))){
|
|
return x.cljs$core$IEncodeJS$_key__GT_js$arity$1(x);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._key__GT_js[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto__.call(null,x));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._key__GT_js["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(x) : m__4348__auto____$1.call(null,x));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEncodeJS.-key->js",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.key__GT_js = (function cljs$core$key__GT_js(var_args){
|
|
var G__3063 = arguments.length;
|
|
switch (G__3063) {
|
|
case 1:
|
|
return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$1 = (function (k){
|
|
return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2(k,cljs.core.clj__GT_js);
|
|
});
|
|
|
|
cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2 = (function (k,primitive_fn){
|
|
if((((!((k == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === k.cljs$core$IEncodeJS$))))?true:(((!k.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,k):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,k))){
|
|
return cljs.core._clj__GT_js(k);
|
|
} else {
|
|
if(((typeof k === 'string') || (typeof k === 'number') || ((k instanceof cljs.core.Keyword)) || ((k instanceof cljs.core.Symbol)))){
|
|
return (primitive_fn.cljs$core$IFn$_invoke$arity$1 ? primitive_fn.cljs$core$IFn$_invoke$arity$1(k) : primitive_fn.call(null,k));
|
|
} else {
|
|
return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([k], 0));
|
|
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.key__GT_js.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Recursively transforms ClojureScript values to JavaScript.
|
|
* sets/vectors/lists become Arrays, Keywords and Symbol become Strings,
|
|
* Maps become Objects. Arbitrary keys are encoded to by `key->js`.
|
|
* Options is a key-value pair, where the only valid key is
|
|
* :keyword-fn, which should point to a single-argument function to be
|
|
* called on keyword keys. Default to `name`.
|
|
*/
|
|
cljs.core.clj__GT_js = (function cljs$core$clj__GT_js(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___3117 = arguments.length;
|
|
var i__4642__auto___3118 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3118 < len__4641__auto___3117)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___3118]));
|
|
|
|
var G__3119 = (i__4642__auto___3118 + (1));
|
|
i__4642__auto___3118 = G__3119;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.clj__GT_js.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.clj__GT_js.cljs$core$IFn$_invoke$arity$variadic = (function (x,p__3068){
|
|
var map__3069 = p__3068;
|
|
var map__3069__$1 = (((((!((map__3069 == null))))?(((((map__3069.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3069.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3069):map__3069);
|
|
var options = map__3069__$1;
|
|
var keyword_fn = cljs.core.get.cljs$core$IFn$_invoke$arity$3(map__3069__$1,cljs.core.cst$kw$keyword_DASH_fn,cljs.core.name);
|
|
var keyfn = ((function (map__3069,map__3069__$1,options,keyword_fn){
|
|
return (function cljs$core$keyfn(k){
|
|
return cljs.core.key__GT_js.cljs$core$IFn$_invoke$arity$2(k,thisfn);
|
|
});})(map__3069,map__3069__$1,options,keyword_fn))
|
|
;
|
|
var thisfn = ((function (map__3069,map__3069__$1,options,keyword_fn){
|
|
return (function cljs$core$thisfn(x__$1){
|
|
if((x__$1 == null)){
|
|
return null;
|
|
} else {
|
|
if((((!((x__$1 == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === x__$1.cljs$core$IEncodeJS$))))?true:(((!x__$1.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,x__$1):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeJS,x__$1))){
|
|
return cljs.core._clj__GT_js(x__$1);
|
|
} else {
|
|
if((x__$1 instanceof cljs.core.Keyword)){
|
|
return (keyword_fn.cljs$core$IFn$_invoke$arity$1 ? keyword_fn.cljs$core$IFn$_invoke$arity$1(x__$1) : keyword_fn.call(null,x__$1));
|
|
} else {
|
|
if((x__$1 instanceof cljs.core.Symbol)){
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(x__$1);
|
|
} else {
|
|
if(cljs.core.map_QMARK_(x__$1)){
|
|
var m = {};
|
|
var seq__3097_3120 = cljs.core.seq(x__$1);
|
|
var chunk__3098_3121 = null;
|
|
var count__3099_3122 = (0);
|
|
var i__3100_3123 = (0);
|
|
while(true){
|
|
if((i__3100_3123 < count__3099_3122)){
|
|
var vec__3101_3124 = chunk__3098_3121.cljs$core$IIndexed$_nth$arity$2(null,i__3100_3123);
|
|
var k_3125 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3101_3124,(0),null);
|
|
var v_3126 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3101_3124,(1),null);
|
|
var G__3104_3127 = m;
|
|
var G__3105_3128 = keyfn(k_3125);
|
|
var G__3106_3129 = cljs$core$thisfn(v_3126);
|
|
goog.object.set(G__3104_3127,G__3105_3128,G__3106_3129);
|
|
|
|
|
|
var G__3130 = seq__3097_3120;
|
|
var G__3131 = chunk__3098_3121;
|
|
var G__3132 = count__3099_3122;
|
|
var G__3133 = (i__3100_3123 + (1));
|
|
seq__3097_3120 = G__3130;
|
|
chunk__3098_3121 = G__3131;
|
|
count__3099_3122 = G__3132;
|
|
i__3100_3123 = G__3133;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto___3134 = cljs.core.seq(seq__3097_3120);
|
|
if(temp__5457__auto___3134){
|
|
var seq__3097_3135__$1 = temp__5457__auto___3134;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__3097_3135__$1)){
|
|
var c__4461__auto___3136 = cljs.core.chunk_first(seq__3097_3135__$1);
|
|
var G__3137 = cljs.core.chunk_rest(seq__3097_3135__$1);
|
|
var G__3138 = c__4461__auto___3136;
|
|
var G__3139 = cljs.core.count(c__4461__auto___3136);
|
|
var G__3140 = (0);
|
|
seq__3097_3120 = G__3137;
|
|
chunk__3098_3121 = G__3138;
|
|
count__3099_3122 = G__3139;
|
|
i__3100_3123 = G__3140;
|
|
continue;
|
|
} else {
|
|
var vec__3107_3141 = cljs.core.first(seq__3097_3135__$1);
|
|
var k_3142 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3107_3141,(0),null);
|
|
var v_3143 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3107_3141,(1),null);
|
|
var G__3110_3144 = m;
|
|
var G__3111_3145 = keyfn(k_3142);
|
|
var G__3112_3146 = cljs$core$thisfn(v_3143);
|
|
goog.object.set(G__3110_3144,G__3111_3145,G__3112_3146);
|
|
|
|
|
|
var G__3147 = cljs.core.next(seq__3097_3135__$1);
|
|
var G__3148 = null;
|
|
var G__3149 = (0);
|
|
var G__3150 = (0);
|
|
seq__3097_3120 = G__3147;
|
|
chunk__3098_3121 = G__3148;
|
|
count__3099_3122 = G__3149;
|
|
i__3100_3123 = G__3150;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
|
|
return m;
|
|
} else {
|
|
if(cljs.core.coll_QMARK_(x__$1)){
|
|
var arr = [];
|
|
var seq__3113_3151 = cljs.core.seq(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
|
|
var chunk__3114_3152 = null;
|
|
var count__3115_3153 = (0);
|
|
var i__3116_3154 = (0);
|
|
while(true){
|
|
if((i__3116_3154 < count__3115_3153)){
|
|
var x_3155__$2 = chunk__3114_3152.cljs$core$IIndexed$_nth$arity$2(null,i__3116_3154);
|
|
arr.push(x_3155__$2);
|
|
|
|
|
|
var G__3156 = seq__3113_3151;
|
|
var G__3157 = chunk__3114_3152;
|
|
var G__3158 = count__3115_3153;
|
|
var G__3159 = (i__3116_3154 + (1));
|
|
seq__3113_3151 = G__3156;
|
|
chunk__3114_3152 = G__3157;
|
|
count__3115_3153 = G__3158;
|
|
i__3116_3154 = G__3159;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto___3160 = cljs.core.seq(seq__3113_3151);
|
|
if(temp__5457__auto___3160){
|
|
var seq__3113_3161__$1 = temp__5457__auto___3160;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__3113_3161__$1)){
|
|
var c__4461__auto___3162 = cljs.core.chunk_first(seq__3113_3161__$1);
|
|
var G__3163 = cljs.core.chunk_rest(seq__3113_3161__$1);
|
|
var G__3164 = c__4461__auto___3162;
|
|
var G__3165 = cljs.core.count(c__4461__auto___3162);
|
|
var G__3166 = (0);
|
|
seq__3113_3151 = G__3163;
|
|
chunk__3114_3152 = G__3164;
|
|
count__3115_3153 = G__3165;
|
|
i__3116_3154 = G__3166;
|
|
continue;
|
|
} else {
|
|
var x_3167__$2 = cljs.core.first(seq__3113_3161__$1);
|
|
arr.push(x_3167__$2);
|
|
|
|
|
|
var G__3168 = cljs.core.next(seq__3113_3161__$1);
|
|
var G__3169 = null;
|
|
var G__3170 = (0);
|
|
var G__3171 = (0);
|
|
seq__3113_3151 = G__3168;
|
|
chunk__3114_3152 = G__3169;
|
|
count__3115_3153 = G__3170;
|
|
i__3116_3154 = G__3171;
|
|
continue;
|
|
}
|
|
} else {
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
|
|
return arr;
|
|
} else {
|
|
return x__$1;
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});})(map__3069,map__3069__$1,options,keyword_fn))
|
|
;
|
|
return thisfn(x);
|
|
});
|
|
|
|
cljs.core.clj__GT_js.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.clj__GT_js.cljs$lang$applyTo = (function (seq3066){
|
|
var G__3067 = cljs.core.first(seq3066);
|
|
var seq3066__$1 = cljs.core.next(seq3066);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3067,seq3066__$1);
|
|
});
|
|
|
|
|
|
/**
|
|
* @interface
|
|
*/
|
|
cljs.core.IEncodeClojure = function(){};
|
|
|
|
/**
|
|
* Transforms JavaScript values to Clojure
|
|
*/
|
|
cljs.core._js__GT_clj = (function cljs$core$_js__GT_clj(x,options){
|
|
if((((!((x == null)))) && ((!((x.cljs$core$IEncodeClojure$_js__GT_clj$arity$2 == null)))))){
|
|
return x.cljs$core$IEncodeClojure$_js__GT_clj$arity$2(x,options);
|
|
} else {
|
|
var x__4347__auto__ = (((x == null))?null:x);
|
|
var m__4348__auto__ = (cljs.core._js__GT_clj[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(x,options) : m__4348__auto__.call(null,x,options));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._js__GT_clj["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(x,options) : m__4348__auto____$1.call(null,x,options));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IEncodeClojure.-js->clj",x);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Recursively transforms JavaScript arrays into ClojureScript
|
|
* vectors, and JavaScript objects into ClojureScript maps. With
|
|
* option ':keywordize-keys true' will convert object fields from
|
|
* strings to keywords.
|
|
*/
|
|
cljs.core.js__GT_clj = (function cljs$core$js__GT_clj(var_args){
|
|
var G__3177 = arguments.length;
|
|
switch (G__3177) {
|
|
case 1:
|
|
return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___3182 = arguments.length;
|
|
var i__4642__auto___3183 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3183 < len__4641__auto___3182)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___3183]));
|
|
|
|
var G__3184 = (i__4642__auto___3183 + (1));
|
|
i__4642__auto___3183 = G__3184;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((1)),(0),null));
|
|
return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$1 = (function (x){
|
|
return cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic(x,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([cljs.core.cst$kw$keywordize_DASH_keys,false], 0));
|
|
});
|
|
|
|
cljs.core.js__GT_clj.cljs$core$IFn$_invoke$arity$variadic = (function (x,opts){
|
|
var map__3178 = opts;
|
|
var map__3178__$1 = (((((!((map__3178 == null))))?(((((map__3178.cljs$lang$protocol_mask$partition0$ & (64))) || ((cljs.core.PROTOCOL_SENTINEL === map__3178.cljs$core$ISeq$))))?true:false):false))?cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.hash_map,map__3178):map__3178);
|
|
var keywordize_keys = cljs.core.get.cljs$core$IFn$_invoke$arity$2(map__3178__$1,cljs.core.cst$kw$keywordize_DASH_keys);
|
|
var keyfn = (cljs.core.truth_(keywordize_keys)?cljs.core.keyword:cljs.core.str);
|
|
var f = ((function (map__3178,map__3178__$1,keywordize_keys,keyfn){
|
|
return (function cljs$core$thisfn(x__$1){
|
|
if((((!((x__$1 == null))))?((((false) || ((cljs.core.PROTOCOL_SENTINEL === x__$1.cljs$core$IEncodeClojure$))))?true:(((!x__$1.cljs$lang$protocol_mask$partition$))?cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeClojure,x__$1):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IEncodeClojure,x__$1))){
|
|
return cljs.core._js__GT_clj(x__$1,cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.array_map,opts));
|
|
} else {
|
|
if(cljs.core.seq_QMARK_(x__$1)){
|
|
return cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs$core$thisfn,x__$1));
|
|
} else {
|
|
if(cljs.core.map_entry_QMARK_(x__$1)){
|
|
return (new cljs.core.MapEntry(cljs$core$thisfn(cljs.core.key(x__$1)),cljs$core$thisfn(cljs.core.val(x__$1)),null));
|
|
} else {
|
|
if(cljs.core.coll_QMARK_(x__$1)){
|
|
return cljs.core.into.cljs$core$IFn$_invoke$arity$3(cljs.core.empty(x__$1),cljs.core.map.cljs$core$IFn$_invoke$arity$1(cljs$core$thisfn),x__$1);
|
|
} else {
|
|
if(cljs.core.array_QMARK_(x__$1)){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (map__3178,map__3178__$1,keywordize_keys,keyfn){
|
|
return (function (p1__3172_SHARP_,p2__3173_SHARP_){
|
|
return cljs.core.conj_BANG_.cljs$core$IFn$_invoke$arity$2(p1__3172_SHARP_,cljs$core$thisfn(p2__3173_SHARP_));
|
|
});})(map__3178,map__3178__$1,keywordize_keys,keyfn))
|
|
,cljs.core.transient$(cljs.core.PersistentVector.EMPTY),x__$1));
|
|
} else {
|
|
if((cljs.core.type(x__$1) === Object)){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (map__3178,map__3178__$1,keywordize_keys,keyfn){
|
|
return (function (r,k){
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(r,(keyfn.cljs$core$IFn$_invoke$arity$1 ? keyfn.cljs$core$IFn$_invoke$arity$1(k) : keyfn.call(null,k)),cljs$core$thisfn(goog.object.get(x__$1,k)));
|
|
});})(map__3178,map__3178__$1,keywordize_keys,keyfn))
|
|
,cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY),cljs.core.js_keys(x__$1)));
|
|
} else {
|
|
return x__$1;
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});})(map__3178,map__3178__$1,keywordize_keys,keyfn))
|
|
;
|
|
return f(x);
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.js__GT_clj.cljs$lang$applyTo = (function (seq3175){
|
|
var G__3176 = cljs.core.first(seq3175);
|
|
var seq3175__$1 = cljs.core.next(seq3175);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3176,seq3175__$1);
|
|
});
|
|
|
|
cljs.core.js__GT_clj.cljs$lang$maxFixedArity = (1);
|
|
|
|
/**
|
|
* Returns a memoized version of a referentially transparent function. The
|
|
* memoized version of the function keeps a cache of the mapping from arguments
|
|
* to results and, when calls with the same arguments are repeated often, has
|
|
* higher performance at the expense of higher memory use.
|
|
*/
|
|
cljs.core.memoize = (function cljs$core$memoize(f){
|
|
var mem = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
|
|
return ((function (mem){
|
|
return (function() {
|
|
var G__3185__delegate = function (args){
|
|
var v = cljs.core.get.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(mem),args,cljs.core.lookup_sentinel);
|
|
if((v === cljs.core.lookup_sentinel)){
|
|
var ret = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,args);
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(mem,cljs.core.assoc,args,ret);
|
|
|
|
return ret;
|
|
} else {
|
|
return v;
|
|
}
|
|
};
|
|
var G__3185 = function (var_args){
|
|
var args = null;
|
|
if (arguments.length > 0) {
|
|
var G__3186__i = 0, G__3186__a = new Array(arguments.length - 0);
|
|
while (G__3186__i < G__3186__a.length) {G__3186__a[G__3186__i] = arguments[G__3186__i + 0]; ++G__3186__i;}
|
|
args = new cljs.core.IndexedSeq(G__3186__a,0,null);
|
|
}
|
|
return G__3185__delegate.call(this,args);};
|
|
G__3185.cljs$lang$maxFixedArity = 0;
|
|
G__3185.cljs$lang$applyTo = (function (arglist__3187){
|
|
var args = cljs.core.seq(arglist__3187);
|
|
return G__3185__delegate(args);
|
|
});
|
|
G__3185.cljs$core$IFn$_invoke$arity$variadic = G__3185__delegate;
|
|
return G__3185;
|
|
})()
|
|
;
|
|
;})(mem))
|
|
});
|
|
/**
|
|
* trampoline can be used to convert algorithms requiring mutual
|
|
* recursion without stack consumption. Calls f with supplied args, if
|
|
* any. If f returns a fn, calls that fn with no arguments, and
|
|
* continues to repeat, until the return value is not a fn, then
|
|
* returns that non-fn value. Note that if you want to return a fn as a
|
|
* final value, you must wrap it in some data structure and unpack it
|
|
* after trampoline returns.
|
|
*/
|
|
cljs.core.trampoline = (function cljs$core$trampoline(var_args){
|
|
var G__3191 = arguments.length;
|
|
switch (G__3191) {
|
|
case 1:
|
|
return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4662__auto__ = [];
|
|
var len__4641__auto___3193 = arguments.length;
|
|
var i__4642__auto___3194 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3194 < len__4641__auto___3193)){
|
|
args_arr__4662__auto__.push((arguments[i__4642__auto___3194]));
|
|
|
|
var G__3195 = (i__4642__auto___3194 + (1));
|
|
i__4642__auto___3194 = G__3195;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4663__auto__ = (new cljs.core.IndexedSeq(args_arr__4662__auto__.slice((1)),(0),null));
|
|
return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4663__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1 = (function (f){
|
|
while(true){
|
|
var ret = (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
if(cljs.core.fn_QMARK_(ret)){
|
|
var G__3196 = ret;
|
|
f = G__3196;
|
|
continue;
|
|
} else {
|
|
return ret;
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
cljs.core.trampoline.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
|
|
return cljs.core.trampoline.cljs$core$IFn$_invoke$arity$1((function (){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$2(f,args);
|
|
}));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
cljs.core.trampoline.cljs$lang$applyTo = (function (seq3189){
|
|
var G__3190 = cljs.core.first(seq3189);
|
|
var seq3189__$1 = cljs.core.next(seq3189);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3190,seq3189__$1);
|
|
});
|
|
|
|
cljs.core.trampoline.cljs$lang$maxFixedArity = (1);
|
|
|
|
/**
|
|
* Returns a random floating point number between 0 (inclusive) and
|
|
* n (default 1) (exclusive).
|
|
*/
|
|
cljs.core.rand = (function cljs$core$rand(var_args){
|
|
var G__3198 = arguments.length;
|
|
switch (G__3198) {
|
|
case 0:
|
|
return cljs.core.rand.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return cljs.core.rand.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.rand.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.rand.cljs$core$IFn$_invoke$arity$1((1));
|
|
});
|
|
|
|
cljs.core.rand.cljs$core$IFn$_invoke$arity$1 = (function (n){
|
|
return (Math.random() * n);
|
|
});
|
|
|
|
cljs.core.rand.cljs$lang$maxFixedArity = 1;
|
|
|
|
/**
|
|
* Returns a random integer between 0 (inclusive) and n (exclusive).
|
|
*/
|
|
cljs.core.rand_int = (function cljs$core$rand_int(n){
|
|
var G__3200 = (Math.random() * n);
|
|
return Math.floor(G__3200);
|
|
});
|
|
/**
|
|
* Return a random element of the (sequential) collection. Will have
|
|
* the same performance characteristics as nth for the given
|
|
* collection.
|
|
*/
|
|
cljs.core.rand_nth = (function cljs$core$rand_nth(coll){
|
|
return cljs.core.nth.cljs$core$IFn$_invoke$arity$2(coll,cljs.core.rand_int(cljs.core.count(coll)));
|
|
});
|
|
/**
|
|
* Returns a map of the elements of coll keyed by the result of
|
|
* f on each element. The value at each key will be a vector of the
|
|
* corresponding elements, in the order they appeared in coll.
|
|
*/
|
|
cljs.core.group_by = (function cljs$core$group_by(f,coll){
|
|
return cljs.core.persistent_BANG_(cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (ret,x){
|
|
var k = (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(x) : f.call(null,x));
|
|
return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.PersistentVector.EMPTY),x));
|
|
}),cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY),coll));
|
|
});
|
|
/**
|
|
* Creates a hierarchy object for use with derive, isa? etc.
|
|
*/
|
|
cljs.core.make_hierarchy = (function cljs$core$make_hierarchy(){
|
|
return new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$parents,cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$descendants,cljs.core.PersistentArrayMap.EMPTY,cljs.core.cst$kw$ancestors,cljs.core.PersistentArrayMap.EMPTY], null);
|
|
});
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core._global_hierarchy = null;
|
|
cljs.core.get_global_hierarchy = (function cljs$core$get_global_hierarchy(){
|
|
if((cljs.core._global_hierarchy == null)){
|
|
cljs.core._global_hierarchy = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.make_hierarchy());
|
|
} else {
|
|
}
|
|
|
|
return cljs.core._global_hierarchy;
|
|
});
|
|
cljs.core.swap_global_hierarchy_BANG_ = (function cljs$core$swap_global_hierarchy_BANG_(var_args){
|
|
var args__4647__auto__ = [];
|
|
var len__4641__auto___3203 = arguments.length;
|
|
var i__4642__auto___3204 = (0);
|
|
while(true){
|
|
if((i__4642__auto___3204 < len__4641__auto___3203)){
|
|
args__4647__auto__.push((arguments[i__4642__auto___3204]));
|
|
|
|
var G__3205 = (i__4642__auto___3204 + (1));
|
|
i__4642__auto___3204 = G__3205;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4648__auto__ = ((((1) < args__4647__auto__.length))?(new cljs.core.IndexedSeq(args__4647__auto__.slice((1)),(0),null)):null);
|
|
return cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__4648__auto__);
|
|
});
|
|
|
|
cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic = (function (f,args){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$4(cljs.core.swap_BANG_,cljs.core.get_global_hierarchy(),f,args);
|
|
});
|
|
|
|
cljs.core.swap_global_hierarchy_BANG_.cljs$lang$maxFixedArity = (1);
|
|
|
|
/** @this {Function} */
|
|
cljs.core.swap_global_hierarchy_BANG_.cljs$lang$applyTo = (function (seq3201){
|
|
var G__3202 = cljs.core.first(seq3201);
|
|
var seq3201__$1 = cljs.core.next(seq3201);
|
|
var self__4628__auto__ = this;
|
|
return self__4628__auto__.cljs$core$IFn$_invoke$arity$variadic(G__3202,seq3201__$1);
|
|
});
|
|
|
|
/**
|
|
* Returns true if (= child parent), or child is directly or indirectly derived from
|
|
* parent, either via a JavaScript type inheritance relationship or a
|
|
* relationship established via derive. h must be a hierarchy obtained
|
|
* from make-hierarchy, if not supplied defaults to the global
|
|
* hierarchy
|
|
*/
|
|
cljs.core.isa_QMARK_ = (function cljs$core$isa_QMARK_(var_args){
|
|
var G__3207 = arguments.length;
|
|
switch (G__3207) {
|
|
case 2:
|
|
return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (child,parent){
|
|
return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(cljs.core.get_global_hierarchy()),child,parent);
|
|
});
|
|
|
|
cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3 = (function (h,child,parent){
|
|
var or__4047__auto__ = cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(child,parent);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = cljs.core.contains_QMARK_((function (){var fexpr__3210 = cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h);
|
|
return (fexpr__3210.cljs$core$IFn$_invoke$arity$1 ? fexpr__3210.cljs$core$IFn$_invoke$arity$1(child) : fexpr__3210.call(null,child));
|
|
})(),parent);
|
|
if(or__4047__auto____$1){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var and__4036__auto__ = cljs.core.vector_QMARK_(parent);
|
|
if(and__4036__auto__){
|
|
var and__4036__auto____$1 = cljs.core.vector_QMARK_(child);
|
|
if(and__4036__auto____$1){
|
|
var and__4036__auto____$2 = (cljs.core.count(parent) === cljs.core.count(child));
|
|
if(and__4036__auto____$2){
|
|
var ret = true;
|
|
var i = (0);
|
|
while(true){
|
|
if((((!(ret))) || ((i === cljs.core.count(parent))))){
|
|
return ret;
|
|
} else {
|
|
var G__3212 = cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(h,(child.cljs$core$IFn$_invoke$arity$1 ? child.cljs$core$IFn$_invoke$arity$1(i) : child.call(null,i)),(parent.cljs$core$IFn$_invoke$arity$1 ? parent.cljs$core$IFn$_invoke$arity$1(i) : parent.call(null,i)));
|
|
var G__3213 = (i + (1));
|
|
ret = G__3212;
|
|
i = G__3213;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$2;
|
|
}
|
|
} else {
|
|
return and__4036__auto____$1;
|
|
}
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.isa_QMARK_.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns the immediate parents of tag, either via a JavaScript type
|
|
* inheritance relationship or a relationship established via derive. h
|
|
* must be a hierarchy obtained from make-hierarchy, if not supplied
|
|
* defaults to the global hierarchy
|
|
*/
|
|
cljs.core.parents = (function cljs$core$parents(var_args){
|
|
var G__3215 = arguments.length;
|
|
switch (G__3215) {
|
|
case 1:
|
|
return cljs.core.parents.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.parents.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.parents.cljs$core$IFn$_invoke$arity$1 = (function (tag){
|
|
return cljs.core.parents.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
|
|
});
|
|
|
|
cljs.core.parents.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
|
|
return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h),tag));
|
|
});
|
|
|
|
cljs.core.parents.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns the immediate and indirect parents of tag, either via a JavaScript type
|
|
* inheritance relationship or a relationship established via derive. h
|
|
* must be a hierarchy obtained from make-hierarchy, if not supplied
|
|
* defaults to the global hierarchy
|
|
*/
|
|
cljs.core.ancestors = (function cljs$core$ancestors(var_args){
|
|
var G__3218 = arguments.length;
|
|
switch (G__3218) {
|
|
case 1:
|
|
return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.ancestors.cljs$core$IFn$_invoke$arity$1 = (function (tag){
|
|
return cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
|
|
});
|
|
|
|
cljs.core.ancestors.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
|
|
return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h),tag));
|
|
});
|
|
|
|
cljs.core.ancestors.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns the immediate and indirect children of tag, through a
|
|
* relationship established via derive. h must be a hierarchy obtained
|
|
* from make-hierarchy, if not supplied defaults to the global
|
|
* hierarchy. Note: does not work on JavaScript type inheritance
|
|
* relationships.
|
|
*/
|
|
cljs.core.descendants = (function cljs$core$descendants(var_args){
|
|
var G__3221 = arguments.length;
|
|
switch (G__3221) {
|
|
case 1:
|
|
return cljs.core.descendants.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.descendants.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.descendants.cljs$core$IFn$_invoke$arity$1 = (function (tag){
|
|
return cljs.core.descendants.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.get_global_hierarchy()),tag);
|
|
});
|
|
|
|
cljs.core.descendants.cljs$core$IFn$_invoke$arity$2 = (function (h,tag){
|
|
return cljs.core.not_empty(cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h),tag));
|
|
});
|
|
|
|
cljs.core.descendants.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Establishes a parent/child relationship between parent and
|
|
* tag. Parent must be a namespace-qualified symbol or keyword and
|
|
* child can be either a namespace-qualified symbol or keyword or a
|
|
* class. h must be a hierarchy obtained from make-hierarchy, if not
|
|
* supplied defaults to, and modifies, the global hierarchy.
|
|
*/
|
|
cljs.core.derive = (function cljs$core$derive(var_args){
|
|
var G__3224 = arguments.length;
|
|
switch (G__3224) {
|
|
case 2:
|
|
return cljs.core.derive.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.derive.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.derive.cljs$core$IFn$_invoke$arity$2 = (function (tag,parent){
|
|
if(cljs.core.truth_(cljs.core.namespace(parent))){
|
|
} else {
|
|
throw (new Error("Assert failed: (namespace parent)"));
|
|
}
|
|
|
|
cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic(cljs.core.derive,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([tag,parent], 0));
|
|
|
|
return null;
|
|
});
|
|
|
|
cljs.core.derive.cljs$core$IFn$_invoke$arity$3 = (function (h,tag,parent){
|
|
if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(tag,parent)){
|
|
} else {
|
|
throw (new Error("Assert failed: (not= tag parent)"));
|
|
}
|
|
|
|
var tp = cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h);
|
|
var td = cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h);
|
|
var ta = cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h);
|
|
var tf = ((function (tp,td,ta){
|
|
return (function (m,source,sources,target,targets){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (tp,td,ta){
|
|
return (function (ret,k){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,k,cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.conj,cljs.core.get.cljs$core$IFn$_invoke$arity$3(targets,k,cljs.core.PersistentHashSet.EMPTY),cljs.core.cons(target,(targets.cljs$core$IFn$_invoke$arity$1 ? targets.cljs$core$IFn$_invoke$arity$1(target) : targets.call(null,target)))));
|
|
});})(tp,td,ta))
|
|
,m,cljs.core.cons(source,(sources.cljs$core$IFn$_invoke$arity$1 ? sources.cljs$core$IFn$_invoke$arity$1(source) : sources.call(null,source))));
|
|
});})(tp,td,ta))
|
|
;
|
|
var or__4047__auto__ = ((cljs.core.contains_QMARK_((tp.cljs$core$IFn$_invoke$arity$1 ? tp.cljs$core$IFn$_invoke$arity$1(tag) : tp.call(null,tag)),parent))?null:(function (){
|
|
if(cljs.core.contains_QMARK_((ta.cljs$core$IFn$_invoke$arity$1 ? ta.cljs$core$IFn$_invoke$arity$1(tag) : ta.call(null,tag)),parent)){
|
|
throw (new Error([cljs.core.str.cljs$core$IFn$_invoke$arity$1(tag),"already has",cljs.core.str.cljs$core$IFn$_invoke$arity$1(parent),"as ancestor"].join('')));
|
|
} else {
|
|
}
|
|
|
|
if(cljs.core.contains_QMARK_((ta.cljs$core$IFn$_invoke$arity$1 ? ta.cljs$core$IFn$_invoke$arity$1(parent) : ta.call(null,parent)),tag)){
|
|
throw (new Error(["Cyclic derivation:",cljs.core.str.cljs$core$IFn$_invoke$arity$1(parent),"has",cljs.core.str.cljs$core$IFn$_invoke$arity$1(tag),"as ancestor"].join('')));
|
|
} else {
|
|
}
|
|
|
|
return new cljs.core.PersistentArrayMap(null, 3, [cljs.core.cst$kw$parents,cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h),tag,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(tp,tag,cljs.core.PersistentHashSet.EMPTY),parent)),cljs.core.cst$kw$ancestors,tf(cljs.core.cst$kw$ancestors.cljs$core$IFn$_invoke$arity$1(h),tag,td,parent,ta),cljs.core.cst$kw$descendants,tf(cljs.core.cst$kw$descendants.cljs$core$IFn$_invoke$arity$1(h),parent,ta,tag,td)], null);
|
|
})()
|
|
);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return h;
|
|
}
|
|
});
|
|
|
|
cljs.core.derive.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Removes a parent/child relationship between parent and
|
|
* tag. h must be a hierarchy obtained from make-hierarchy, if not
|
|
* supplied defaults to, and modifies, the global hierarchy.
|
|
*/
|
|
cljs.core.underive = (function cljs$core$underive(var_args){
|
|
var G__3230 = arguments.length;
|
|
switch (G__3230) {
|
|
case 2:
|
|
return cljs.core.underive.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.underive.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.underive.cljs$core$IFn$_invoke$arity$2 = (function (tag,parent){
|
|
cljs.core.swap_global_hierarchy_BANG_.cljs$core$IFn$_invoke$arity$variadic(cljs.core.underive,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([tag,parent], 0));
|
|
|
|
return null;
|
|
});
|
|
|
|
cljs.core.underive.cljs$core$IFn$_invoke$arity$3 = (function (h,tag,parent){
|
|
var parentMap = cljs.core.cst$kw$parents.cljs$core$IFn$_invoke$arity$1(h);
|
|
var childsParents = (cljs.core.truth_((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)))?cljs.core.disj.cljs$core$IFn$_invoke$arity$2((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)),parent):cljs.core.PersistentHashSet.EMPTY);
|
|
var newParents = (cljs.core.truth_(cljs.core.not_empty(childsParents))?cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(parentMap,tag,childsParents):cljs.core.dissoc.cljs$core$IFn$_invoke$arity$2(parentMap,tag));
|
|
var deriv_seq = cljs.core.flatten(cljs.core.map.cljs$core$IFn$_invoke$arity$2(((function (parentMap,childsParents,newParents){
|
|
return (function (p1__3226_SHARP_){
|
|
return cljs.core.cons(cljs.core.first(p1__3226_SHARP_),cljs.core.interpose.cljs$core$IFn$_invoke$arity$2(cljs.core.first(p1__3226_SHARP_),cljs.core.second(p1__3226_SHARP_)));
|
|
});})(parentMap,childsParents,newParents))
|
|
,cljs.core.seq(newParents)));
|
|
if(cljs.core.contains_QMARK_((parentMap.cljs$core$IFn$_invoke$arity$1 ? parentMap.cljs$core$IFn$_invoke$arity$1(tag) : parentMap.call(null,tag)),parent)){
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (parentMap,childsParents,newParents,deriv_seq){
|
|
return (function (p1__3227_SHARP_,p2__3228_SHARP_){
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.derive,p1__3227_SHARP_,p2__3228_SHARP_);
|
|
});})(parentMap,childsParents,newParents,deriv_seq))
|
|
,cljs.core.make_hierarchy(),cljs.core.partition.cljs$core$IFn$_invoke$arity$2((2),deriv_seq));
|
|
} else {
|
|
return h;
|
|
}
|
|
});
|
|
|
|
cljs.core.underive.cljs$lang$maxFixedArity = 3;
|
|
|
|
cljs.core.reset_cache = (function cljs$core$reset_cache(method_cache,method_table,cached_hierarchy,hierarchy){
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(method_cache,(function (_){
|
|
return cljs.core.deref(method_table);
|
|
}));
|
|
|
|
return cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(cached_hierarchy,(function (_){
|
|
return cljs.core.deref(hierarchy);
|
|
}));
|
|
});
|
|
cljs.core.prefers_STAR_ = (function cljs$core$prefers_STAR_(x,y,prefer_table){
|
|
var xprefs = (function (){var fexpr__3232 = cljs.core.deref(prefer_table);
|
|
return (fexpr__3232.cljs$core$IFn$_invoke$arity$1 ? fexpr__3232.cljs$core$IFn$_invoke$arity$1(x) : fexpr__3232.call(null,x));
|
|
})();
|
|
var or__4047__auto__ = (cljs.core.truth_((function (){var and__4036__auto__ = xprefs;
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return (xprefs.cljs$core$IFn$_invoke$arity$1 ? xprefs.cljs$core$IFn$_invoke$arity$1(y) : xprefs.call(null,y));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())?true:null);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
var or__4047__auto____$1 = (function (){var ps = cljs.core.parents.cljs$core$IFn$_invoke$arity$1(y);
|
|
while(true){
|
|
if((cljs.core.count(ps) > (0))){
|
|
if(cljs.core.truth_((function (){var G__3236 = x;
|
|
var G__3237 = cljs.core.first(ps);
|
|
var G__3238 = prefer_table;
|
|
return (cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3 ? cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3(G__3236,G__3237,G__3238) : cljs.core.prefers_STAR_.call(null,G__3236,G__3237,G__3238));
|
|
})())){
|
|
} else {
|
|
}
|
|
|
|
var G__3245 = cljs.core.rest(ps);
|
|
ps = G__3245;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
if(cljs.core.truth_(or__4047__auto____$1)){
|
|
return or__4047__auto____$1;
|
|
} else {
|
|
var or__4047__auto____$2 = (function (){var ps = cljs.core.parents.cljs$core$IFn$_invoke$arity$1(x);
|
|
while(true){
|
|
if((cljs.core.count(ps) > (0))){
|
|
if(cljs.core.truth_((function (){var G__3242 = cljs.core.first(ps);
|
|
var G__3243 = y;
|
|
var G__3244 = prefer_table;
|
|
return (cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3 ? cljs.core.prefers_STAR_.cljs$core$IFn$_invoke$arity$3(G__3242,G__3243,G__3244) : cljs.core.prefers_STAR_.call(null,G__3242,G__3243,G__3244));
|
|
})())){
|
|
} else {
|
|
}
|
|
|
|
var G__3246 = cljs.core.rest(ps);
|
|
ps = G__3246;
|
|
continue;
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
if(cljs.core.truth_(or__4047__auto____$2)){
|
|
return or__4047__auto____$2;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
});
|
|
cljs.core.dominates = (function cljs$core$dominates(x,y,prefer_table,hierarchy){
|
|
var or__4047__auto__ = cljs.core.prefers_STAR_(x,y,prefer_table);
|
|
if(cljs.core.truth_(or__4047__auto__)){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(hierarchy,x,y);
|
|
}
|
|
});
|
|
cljs.core.find_and_cache_best_method = (function cljs$core$find_and_cache_best_method(name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val){
|
|
var best_entry = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (be,p__3247){
|
|
var vec__3248 = p__3247;
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3248,(0),null);
|
|
var _ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3248,(1),null);
|
|
var e = vec__3248;
|
|
if(cljs.core.isa_QMARK_.cljs$core$IFn$_invoke$arity$3(cljs.core.deref(hierarchy),dispatch_val,k)){
|
|
var be2 = (cljs.core.truth_((function (){var or__4047__auto__ = (be == null);
|
|
if(or__4047__auto__){
|
|
return or__4047__auto__;
|
|
} else {
|
|
return cljs.core.dominates(k,cljs.core.first(be),prefer_table,cljs.core.deref(hierarchy));
|
|
}
|
|
})())?e:be);
|
|
if(cljs.core.truth_(cljs.core.dominates(cljs.core.first(be2),k,prefer_table,cljs.core.deref(hierarchy)))){
|
|
} else {
|
|
throw (new Error(["Multiple methods in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name),"' match dispatch value: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val)," -> ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(k)," and ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(be2)),", and neither is preferred"].join('')));
|
|
}
|
|
|
|
return be2;
|
|
} else {
|
|
return be;
|
|
}
|
|
}),null,cljs.core.deref(method_table));
|
|
var best_entry__$1 = (function (){var temp__5455__auto__ = (function (){var and__4036__auto__ = (best_entry == null);
|
|
if(and__4036__auto__){
|
|
var fexpr__3252 = cljs.core.deref(method_table);
|
|
return (fexpr__3252.cljs$core$IFn$_invoke$arity$1 ? fexpr__3252.cljs$core$IFn$_invoke$arity$1(default_dispatch_val) : fexpr__3252.call(null,default_dispatch_val));
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})();
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var entry = temp__5455__auto__;
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [default_dispatch_val,entry], null);
|
|
} else {
|
|
return best_entry;
|
|
}
|
|
})();
|
|
if(cljs.core.truth_(best_entry__$1)){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cached_hierarchy),cljs.core.deref(hierarchy))){
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(method_cache,cljs.core.assoc,dispatch_val,cljs.core.second(best_entry__$1));
|
|
|
|
return cljs.core.second(best_entry__$1);
|
|
} else {
|
|
cljs.core.reset_cache(method_cache,method_table,cached_hierarchy,hierarchy);
|
|
|
|
return (cljs.core.find_and_cache_best_method.cljs$core$IFn$_invoke$arity$8 ? cljs.core.find_and_cache_best_method.cljs$core$IFn$_invoke$arity$8(name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val) : cljs.core.find_and_cache_best_method.call(null,name,dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy,default_dispatch_val));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @interface
|
|
*/
|
|
cljs.core.IMultiFn = function(){};
|
|
|
|
cljs.core._reset = (function cljs$core$_reset(mf){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_reset$arity$1 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_reset$arity$1(mf);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._reset[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto__.call(null,mf));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._reset["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto____$1.call(null,mf));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-reset",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._add_method = (function cljs$core$_add_method(mf,dispatch_val,method){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_add_method$arity$3 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_add_method$arity$3(mf,dispatch_val,method);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._add_method[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,method) : m__4348__auto__.call(null,mf,dispatch_val,method));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._add_method["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,method) : m__4348__auto____$1.call(null,mf,dispatch_val,method));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-add-method",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._remove_method = (function cljs$core$_remove_method(mf,dispatch_val){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_remove_method$arity$2 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_remove_method$arity$2(mf,dispatch_val);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._remove_method[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4348__auto__.call(null,mf,dispatch_val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._remove_method["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4348__auto____$1.call(null,mf,dispatch_val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-remove-method",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._prefer_method = (function cljs$core$_prefer_method(mf,dispatch_val,dispatch_val_y){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_prefer_method$arity$3 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_prefer_method$arity$3(mf,dispatch_val,dispatch_val_y);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._prefer_method[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,dispatch_val_y) : m__4348__auto__.call(null,mf,dispatch_val,dispatch_val_y));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._prefer_method["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$3(mf,dispatch_val,dispatch_val_y) : m__4348__auto____$1.call(null,mf,dispatch_val,dispatch_val_y));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-prefer-method",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._get_method = (function cljs$core$_get_method(mf,dispatch_val){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_get_method$arity$2 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_get_method$arity$2(mf,dispatch_val);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._get_method[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4348__auto__.call(null,mf,dispatch_val));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._get_method["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$2(mf,dispatch_val) : m__4348__auto____$1.call(null,mf,dispatch_val));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-get-method",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._methods = (function cljs$core$_methods(mf){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_methods$arity$1 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_methods$arity$1(mf);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._methods[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto__.call(null,mf));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._methods["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto____$1.call(null,mf));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-methods",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._prefers = (function cljs$core$_prefers(mf){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_prefers$arity$1 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_prefers$arity$1(mf);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._prefers[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto__.call(null,mf));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._prefers["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto____$1.call(null,mf));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-prefers",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._default_dispatch_val = (function cljs$core$_default_dispatch_val(mf){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_default_dispatch_val$arity$1 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_default_dispatch_val$arity$1(mf);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._default_dispatch_val[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto__.call(null,mf));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._default_dispatch_val["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto____$1.call(null,mf));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-default-dispatch-val",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core._dispatch_fn = (function cljs$core$_dispatch_fn(mf){
|
|
if((((!((mf == null)))) && ((!((mf.cljs$core$IMultiFn$_dispatch_fn$arity$1 == null)))))){
|
|
return mf.cljs$core$IMultiFn$_dispatch_fn$arity$1(mf);
|
|
} else {
|
|
var x__4347__auto__ = (((mf == null))?null:mf);
|
|
var m__4348__auto__ = (cljs.core._dispatch_fn[goog.typeOf(x__4347__auto__)]);
|
|
if((!((m__4348__auto__ == null)))){
|
|
return (m__4348__auto__.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto__.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto__.call(null,mf));
|
|
} else {
|
|
var m__4348__auto____$1 = (cljs.core._dispatch_fn["_"]);
|
|
if((!((m__4348__auto____$1 == null)))){
|
|
return (m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1 ? m__4348__auto____$1.cljs$core$IFn$_invoke$arity$1(mf) : m__4348__auto____$1.call(null,mf));
|
|
} else {
|
|
throw cljs.core.missing_protocol("IMultiFn.-dispatch-fn",mf);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
|
|
cljs.core.throw_no_method_error = (function cljs$core$throw_no_method_error(name,dispatch_val){
|
|
throw (new Error(["No method in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(name),"' for dispatch value: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val)].join('')));
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IFn}
|
|
* @implements {cljs.core.IMultiFn}
|
|
* @implements {cljs.core.INamed}
|
|
*/
|
|
cljs.core.MultiFn = (function (name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy){
|
|
this.name = name;
|
|
this.dispatch_fn = dispatch_fn;
|
|
this.default_dispatch_val = default_dispatch_val;
|
|
this.hierarchy = hierarchy;
|
|
this.method_table = method_table;
|
|
this.prefer_table = prefer_table;
|
|
this.method_cache = method_cache;
|
|
this.cached_hierarchy = cached_hierarchy;
|
|
this.cljs$lang$protocol_mask$partition0$ = 4194305;
|
|
this.cljs$lang$protocol_mask$partition1$ = 4352;
|
|
});
|
|
cljs.core.MultiFn.prototype.call = (function() {
|
|
var G__3255 = null;
|
|
var G__3255__1 = (function (self__){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0() : self__.dispatch_fn.call(null));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$0 ? target_fn.cljs$core$IFn$_invoke$arity$0() : target_fn.call(null));
|
|
});
|
|
var G__3255__2 = (function (self__,a){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1(a) : self__.dispatch_fn.call(null,a));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$1 ? target_fn.cljs$core$IFn$_invoke$arity$1(a) : target_fn.call(null,a));
|
|
});
|
|
var G__3255__3 = (function (self__,a,b){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.dispatch_fn.call(null,a,b));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$2 ? target_fn.cljs$core$IFn$_invoke$arity$2(a,b) : target_fn.call(null,a,b));
|
|
});
|
|
var G__3255__4 = (function (self__,a,b,c){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.dispatch_fn.call(null,a,b,c));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$3 ? target_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : target_fn.call(null,a,b,c));
|
|
});
|
|
var G__3255__5 = (function (self__,a,b,c,d){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.dispatch_fn.call(null,a,b,c,d));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$4 ? target_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : target_fn.call(null,a,b,c,d));
|
|
});
|
|
var G__3255__6 = (function (self__,a,b,c,d,e){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.dispatch_fn.call(null,a,b,c,d,e));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$5 ? target_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : target_fn.call(null,a,b,c,d,e));
|
|
});
|
|
var G__3255__7 = (function (self__,a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.dispatch_fn.call(null,a,b,c,d,e,f));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$6 ? target_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : target_fn.call(null,a,b,c,d,e,f));
|
|
});
|
|
var G__3255__8 = (function (self__,a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$7 ? target_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : target_fn.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
var G__3255__9 = (function (self__,a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$8 ? target_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : target_fn.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
var G__3255__10 = (function (self__,a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$9 ? target_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : target_fn.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
var G__3255__11 = (function (self__,a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$10 ? target_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
var G__3255__12 = (function (self__,a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$11 ? target_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
var G__3255__13 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$12 ? target_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
var G__3255__14 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$13 ? target_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
var G__3255__15 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$14 ? target_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
var G__3255__16 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$15 ? target_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
var G__3255__17 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$16 ? target_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
var G__3255__18 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$17 ? target_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
var G__3255__19 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$18 ? target_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
var G__3255__20 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$19 ? target_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
var G__3255__21 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$20 ? target_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
var G__3255__22 = (function (self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
var mf = self____$1;
|
|
var dispatch_val = cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.dispatch_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(target_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
G__3255 = function(self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
switch(arguments.length){
|
|
case 1:
|
|
return G__3255__1.call(this,self__);
|
|
case 2:
|
|
return G__3255__2.call(this,self__,a);
|
|
case 3:
|
|
return G__3255__3.call(this,self__,a,b);
|
|
case 4:
|
|
return G__3255__4.call(this,self__,a,b,c);
|
|
case 5:
|
|
return G__3255__5.call(this,self__,a,b,c,d);
|
|
case 6:
|
|
return G__3255__6.call(this,self__,a,b,c,d,e);
|
|
case 7:
|
|
return G__3255__7.call(this,self__,a,b,c,d,e,f);
|
|
case 8:
|
|
return G__3255__8.call(this,self__,a,b,c,d,e,f,g);
|
|
case 9:
|
|
return G__3255__9.call(this,self__,a,b,c,d,e,f,g,h);
|
|
case 10:
|
|
return G__3255__10.call(this,self__,a,b,c,d,e,f,g,h,i);
|
|
case 11:
|
|
return G__3255__11.call(this,self__,a,b,c,d,e,f,g,h,i,j);
|
|
case 12:
|
|
return G__3255__12.call(this,self__,a,b,c,d,e,f,g,h,i,j,k);
|
|
case 13:
|
|
return G__3255__13.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l);
|
|
case 14:
|
|
return G__3255__14.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m);
|
|
case 15:
|
|
return G__3255__15.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n);
|
|
case 16:
|
|
return G__3255__16.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o);
|
|
case 17:
|
|
return G__3255__17.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p);
|
|
case 18:
|
|
return G__3255__18.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q);
|
|
case 19:
|
|
return G__3255__19.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r);
|
|
case 20:
|
|
return G__3255__20.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s);
|
|
case 21:
|
|
return G__3255__21.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t);
|
|
case 22:
|
|
return G__3255__22.call(this,self__,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest);
|
|
}
|
|
throw(new Error('Invalid arity: ' + (arguments.length - 1)));
|
|
};
|
|
G__3255.cljs$core$IFn$_invoke$arity$1 = G__3255__1;
|
|
G__3255.cljs$core$IFn$_invoke$arity$2 = G__3255__2;
|
|
G__3255.cljs$core$IFn$_invoke$arity$3 = G__3255__3;
|
|
G__3255.cljs$core$IFn$_invoke$arity$4 = G__3255__4;
|
|
G__3255.cljs$core$IFn$_invoke$arity$5 = G__3255__5;
|
|
G__3255.cljs$core$IFn$_invoke$arity$6 = G__3255__6;
|
|
G__3255.cljs$core$IFn$_invoke$arity$7 = G__3255__7;
|
|
G__3255.cljs$core$IFn$_invoke$arity$8 = G__3255__8;
|
|
G__3255.cljs$core$IFn$_invoke$arity$9 = G__3255__9;
|
|
G__3255.cljs$core$IFn$_invoke$arity$10 = G__3255__10;
|
|
G__3255.cljs$core$IFn$_invoke$arity$11 = G__3255__11;
|
|
G__3255.cljs$core$IFn$_invoke$arity$12 = G__3255__12;
|
|
G__3255.cljs$core$IFn$_invoke$arity$13 = G__3255__13;
|
|
G__3255.cljs$core$IFn$_invoke$arity$14 = G__3255__14;
|
|
G__3255.cljs$core$IFn$_invoke$arity$15 = G__3255__15;
|
|
G__3255.cljs$core$IFn$_invoke$arity$16 = G__3255__16;
|
|
G__3255.cljs$core$IFn$_invoke$arity$17 = G__3255__17;
|
|
G__3255.cljs$core$IFn$_invoke$arity$18 = G__3255__18;
|
|
G__3255.cljs$core$IFn$_invoke$arity$19 = G__3255__19;
|
|
G__3255.cljs$core$IFn$_invoke$arity$20 = G__3255__20;
|
|
G__3255.cljs$core$IFn$_invoke$arity$21 = G__3255__21;
|
|
G__3255.cljs$core$IFn$_invoke$arity$22 = G__3255__22;
|
|
return G__3255;
|
|
})()
|
|
;
|
|
|
|
cljs.core.MultiFn.prototype.apply = (function (self__,args3253){
|
|
var self__ = this;
|
|
var self____$1 = this;
|
|
return self____$1.call.apply(self____$1,[self____$1].concat(cljs.core.aclone(args3253)));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$0() : self__.dispatch_fn.call(null));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$0 ? target_fn.cljs$core$IFn$_invoke$arity$0() : target_fn.call(null));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$1 = (function (a){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$1(a) : self__.dispatch_fn.call(null,a));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$1 ? target_fn.cljs$core$IFn$_invoke$arity$1(a) : target_fn.call(null,a));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$2(a,b) : self__.dispatch_fn.call(null,a,b));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$2 ? target_fn.cljs$core$IFn$_invoke$arity$2(a,b) : target_fn.call(null,a,b));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$3 = (function (a,b,c){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : self__.dispatch_fn.call(null,a,b,c));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$3 ? target_fn.cljs$core$IFn$_invoke$arity$3(a,b,c) : target_fn.call(null,a,b,c));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$4 = (function (a,b,c,d){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : self__.dispatch_fn.call(null,a,b,c,d));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$4 ? target_fn.cljs$core$IFn$_invoke$arity$4(a,b,c,d) : target_fn.call(null,a,b,c,d));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$5 = (function (a,b,c,d,e){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : self__.dispatch_fn.call(null,a,b,c,d,e));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$5 ? target_fn.cljs$core$IFn$_invoke$arity$5(a,b,c,d,e) : target_fn.call(null,a,b,c,d,e));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$6 = (function (a,b,c,d,e,f){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : self__.dispatch_fn.call(null,a,b,c,d,e,f));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$6 ? target_fn.cljs$core$IFn$_invoke$arity$6(a,b,c,d,e,f) : target_fn.call(null,a,b,c,d,e,f));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$7 = (function (a,b,c,d,e,f,g){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$7 ? target_fn.cljs$core$IFn$_invoke$arity$7(a,b,c,d,e,f,g) : target_fn.call(null,a,b,c,d,e,f,g));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$8 = (function (a,b,c,d,e,f,g,h){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$8 ? target_fn.cljs$core$IFn$_invoke$arity$8(a,b,c,d,e,f,g,h) : target_fn.call(null,a,b,c,d,e,f,g,h));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$9 = (function (a,b,c,d,e,f,g,h,i){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$9 ? target_fn.cljs$core$IFn$_invoke$arity$9(a,b,c,d,e,f,g,h,i) : target_fn.call(null,a,b,c,d,e,f,g,h,i));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$10 = (function (a,b,c,d,e,f,g,h,i,j){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$10 ? target_fn.cljs$core$IFn$_invoke$arity$10(a,b,c,d,e,f,g,h,i,j) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$11 = (function (a,b,c,d,e,f,g,h,i,j,k){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$11 ? target_fn.cljs$core$IFn$_invoke$arity$11(a,b,c,d,e,f,g,h,i,j,k) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$12 = (function (a,b,c,d,e,f,g,h,i,j,k,l){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$12 ? target_fn.cljs$core$IFn$_invoke$arity$12(a,b,c,d,e,f,g,h,i,j,k,l) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$13 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$13 ? target_fn.cljs$core$IFn$_invoke$arity$13(a,b,c,d,e,f,g,h,i,j,k,l,m) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$14 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$14 ? target_fn.cljs$core$IFn$_invoke$arity$14(a,b,c,d,e,f,g,h,i,j,k,l,m,n) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$15 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$15 ? target_fn.cljs$core$IFn$_invoke$arity$15(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$16 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$16 ? target_fn.cljs$core$IFn$_invoke$arity$16(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$17 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$17 ? target_fn.cljs$core$IFn$_invoke$arity$17(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$18 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$18 ? target_fn.cljs$core$IFn$_invoke$arity$18(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$19 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$19 ? target_fn.cljs$core$IFn$_invoke$arity$19(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$20 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = (self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20 ? self__.dispatch_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : self__.dispatch_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return (target_fn.cljs$core$IFn$_invoke$arity$20 ? target_fn.cljs$core$IFn$_invoke$arity$20(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t) : target_fn.call(null,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IFn$_invoke$arity$21 = (function (a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest){
|
|
var self__ = this;
|
|
var mf = this;
|
|
var dispatch_val = cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(self__.dispatch_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
var target_fn = mf.cljs$core$IMultiFn$_get_method$arity$2(null,dispatch_val);
|
|
if(cljs.core.truth_(target_fn)){
|
|
} else {
|
|
cljs.core.throw_no_method_error(self__.name,dispatch_val);
|
|
}
|
|
|
|
return cljs.core.apply.cljs$core$IFn$_invoke$arity$variadic(target_fn,a,b,c,d,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,rest], 0));
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_prefer_method$arity$3 = (function (mf,dispatch_val_x,dispatch_val_y){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
if(cljs.core.truth_(cljs.core.prefers_STAR_(dispatch_val_x,dispatch_val_y,self__.prefer_table))){
|
|
throw (new Error(["Preference conflict in multimethod '",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name),"': ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val_y)," is already preferred to ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(dispatch_val_x)].join('')));
|
|
} else {
|
|
}
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.prefer_table,((function (mf__$1){
|
|
return (function (old){
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(old,dispatch_val_x,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(old,dispatch_val_x,cljs.core.PersistentHashSet.EMPTY),dispatch_val_y));
|
|
});})(mf__$1))
|
|
);
|
|
|
|
return cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_default_dispatch_val$arity$1 = (function (mf){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
return self__.default_dispatch_val;
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_remove_method$arity$2 = (function (mf,dispatch_val){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(self__.method_table,cljs.core.dissoc,dispatch_val);
|
|
|
|
cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
|
|
|
|
return mf__$1;
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_methods$arity$1 = (function (mf){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
return cljs.core.deref(self__.method_table);
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_prefers$arity$1 = (function (mf){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
return cljs.core.deref(self__.prefer_table);
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_dispatch_fn$arity$1 = (function (mf){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
return self__.dispatch_fn;
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_add_method$arity$3 = (function (mf,dispatch_val,method){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(self__.method_table,cljs.core.assoc,dispatch_val,method);
|
|
|
|
cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
|
|
|
|
return mf__$1;
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_reset$arity$1 = (function (mf){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.method_table,((function (mf__$1){
|
|
return (function (mf__$2){
|
|
return cljs.core.PersistentArrayMap.EMPTY;
|
|
});})(mf__$1))
|
|
);
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.method_cache,((function (mf__$1){
|
|
return (function (mf__$2){
|
|
return cljs.core.PersistentArrayMap.EMPTY;
|
|
});})(mf__$1))
|
|
);
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.prefer_table,((function (mf__$1){
|
|
return (function (mf__$2){
|
|
return cljs.core.PersistentArrayMap.EMPTY;
|
|
});})(mf__$1))
|
|
);
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$2(self__.cached_hierarchy,((function (mf__$1){
|
|
return (function (mf__$2){
|
|
return null;
|
|
});})(mf__$1))
|
|
);
|
|
|
|
return mf__$1;
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IMultiFn$_get_method$arity$2 = (function (mf,dispatch_val){
|
|
var self__ = this;
|
|
var mf__$1 = this;
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(self__.cached_hierarchy),cljs.core.deref(self__.hierarchy))){
|
|
} else {
|
|
cljs.core.reset_cache(self__.method_cache,self__.method_table,self__.cached_hierarchy,self__.hierarchy);
|
|
}
|
|
|
|
var temp__5455__auto__ = (function (){var fexpr__3254 = cljs.core.deref(self__.method_cache);
|
|
return (fexpr__3254.cljs$core$IFn$_invoke$arity$1 ? fexpr__3254.cljs$core$IFn$_invoke$arity$1(dispatch_val) : fexpr__3254.call(null,dispatch_val));
|
|
})();
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var target_fn = temp__5455__auto__;
|
|
return target_fn;
|
|
} else {
|
|
return cljs.core.find_and_cache_best_method(self__.name,dispatch_val,self__.hierarchy,self__.method_table,self__.prefer_table,self__.method_cache,self__.cached_hierarchy,self__.default_dispatch_val);
|
|
}
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$INamed$_name$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return cljs.core._name(self__.name);
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$INamed$_namespace$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return cljs.core._namespace(self__.name);
|
|
});
|
|
|
|
cljs.core.MultiFn.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return goog.getUid(this$__$1);
|
|
});
|
|
|
|
cljs.core.MultiFn.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 8, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$name,cljs.core.cst$sym$dispatch_DASH_fn,cljs.core.cst$sym$default_DASH_dispatch_DASH_val,cljs.core.cst$sym$hierarchy,cljs.core.cst$sym$method_DASH_table,cljs.core.cst$sym$prefer_DASH_table,cljs.core.cst$sym$method_DASH_cache,cljs.core.cst$sym$cached_DASH_hierarchy], null);
|
|
});
|
|
|
|
cljs.core.MultiFn.cljs$lang$type = true;
|
|
|
|
cljs.core.MultiFn.cljs$lang$ctorStr = "cljs.core/MultiFn";
|
|
|
|
cljs.core.MultiFn.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/MultiFn");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/MultiFn.
|
|
*/
|
|
cljs.core.__GT_MultiFn = (function cljs$core$__GT_MultiFn(name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy){
|
|
return (new cljs.core.MultiFn(name,dispatch_fn,default_dispatch_val,hierarchy,method_table,prefer_table,method_cache,cached_hierarchy));
|
|
});
|
|
|
|
/**
|
|
* Removes all of the methods of multimethod.
|
|
*/
|
|
cljs.core.remove_all_methods = (function cljs$core$remove_all_methods(multifn){
|
|
return cljs.core._reset(multifn);
|
|
});
|
|
/**
|
|
* Removes the method of multimethod associated with dispatch-value.
|
|
*/
|
|
cljs.core.remove_method = (function cljs$core$remove_method(multifn,dispatch_val){
|
|
return cljs.core._remove_method(multifn,dispatch_val);
|
|
});
|
|
/**
|
|
* Causes the multimethod to prefer matches of dispatch-val-x over dispatch-val-y
|
|
* when there is a conflict
|
|
*/
|
|
cljs.core.prefer_method = (function cljs$core$prefer_method(multifn,dispatch_val_x,dispatch_val_y){
|
|
return cljs.core._prefer_method(multifn,dispatch_val_x,dispatch_val_y);
|
|
});
|
|
/**
|
|
* Given a multimethod, returns a map of dispatch values -> dispatch fns
|
|
*/
|
|
cljs.core.methods$ = (function cljs$core$methods(multifn){
|
|
return cljs.core._methods(multifn);
|
|
});
|
|
/**
|
|
* Given a multimethod and a dispatch value, returns the dispatch fn
|
|
* that would apply to that value, or nil if none apply and no default
|
|
*/
|
|
cljs.core.get_method = (function cljs$core$get_method(multifn,dispatch_val){
|
|
return cljs.core._get_method(multifn,dispatch_val);
|
|
});
|
|
/**
|
|
* Given a multimethod, returns a map of preferred value -> set of other values
|
|
*/
|
|
cljs.core.prefers = (function cljs$core$prefers(multifn){
|
|
return cljs.core._prefers(multifn);
|
|
});
|
|
/**
|
|
* Given a multimethod, return it's default-dispatch-val.
|
|
*/
|
|
cljs.core.default_dispatch_val = (function cljs$core$default_dispatch_val(multifn){
|
|
return cljs.core._default_dispatch_val(multifn);
|
|
});
|
|
/**
|
|
* Given a multimethod, return it's dispatch-fn.
|
|
*/
|
|
cljs.core.dispatch_fn = (function cljs$core$dispatch_fn(multifn){
|
|
return cljs.core._dispatch_fn(multifn);
|
|
});
|
|
|
|
/**
|
|
* A marker protocol for UUIDs
|
|
* @interface
|
|
*/
|
|
cljs.core.IUUID = function(){};
|
|
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
* @implements {cljs.core.IComparable}
|
|
* @implements {cljs.core.IUUID}
|
|
*/
|
|
cljs.core.UUID = (function (uuid,__hash){
|
|
this.uuid = uuid;
|
|
this.__hash = __hash;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2153775104;
|
|
this.cljs$lang$protocol_mask$partition1$ = 2048;
|
|
});
|
|
cljs.core.UUID.prototype.cljs$core$IUUID$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.UUID.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.uuid;
|
|
});
|
|
|
|
cljs.core.UUID.prototype.equiv = (function (other){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
return this$.cljs$core$IEquiv$_equiv$arity$2(null,other);
|
|
});
|
|
|
|
cljs.core.UUID.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return (((other instanceof cljs.core.UUID)) && ((self__.uuid === other.uuid)));
|
|
});
|
|
|
|
cljs.core.UUID.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (_,writer,___$1){
|
|
var self__ = this;
|
|
var ___$2 = this;
|
|
return cljs.core._write(writer,["#uuid \"",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.uuid),"\""].join(''));
|
|
});
|
|
|
|
cljs.core.UUID.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
if((self__.__hash == null)){
|
|
self__.__hash = cljs.core.hash(self__.uuid);
|
|
} else {
|
|
}
|
|
|
|
return self__.__hash;
|
|
});
|
|
|
|
cljs.core.UUID.prototype.cljs$core$IComparable$_compare$arity$2 = (function (_,other){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
var G__3256 = self__.uuid;
|
|
var G__3257 = other.uuid;
|
|
return goog.array.defaultCompare(G__3256,G__3257);
|
|
});
|
|
|
|
cljs.core.UUID.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$uuid,cljs.core.with_meta(cljs.core.cst$sym$__hash,new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$mutable,true], null))], null);
|
|
});
|
|
|
|
cljs.core.UUID.cljs$lang$type = true;
|
|
|
|
cljs.core.UUID.cljs$lang$ctorStr = "cljs.core/UUID";
|
|
|
|
cljs.core.UUID.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/UUID");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/UUID.
|
|
*/
|
|
cljs.core.__GT_UUID = (function cljs$core$__GT_UUID(uuid,__hash){
|
|
return (new cljs.core.UUID(uuid,__hash));
|
|
});
|
|
|
|
cljs.core.uuid = (function cljs$core$uuid(s){
|
|
if(typeof s === 'string'){
|
|
} else {
|
|
throw (new Error("Assert failed: (string? s)"));
|
|
}
|
|
|
|
return (new cljs.core.UUID(s.toLowerCase(),null));
|
|
});
|
|
cljs.core.random_uuid = (function cljs$core$random_uuid(){
|
|
var hex = (function cljs$core$random_uuid_$_hex(){
|
|
return cljs.core.rand_int((16)).toString((16));
|
|
});
|
|
var rhex = ((8) | ((3) & cljs.core.rand_int((16)))).toString((16));
|
|
return cljs.core.uuid([cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-","4",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(rhex),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),"-",cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(hex())].join(''));
|
|
});
|
|
cljs.core.uuid_QMARK_ = (function cljs$core$uuid_QMARK_(x){
|
|
if((!((x == null)))){
|
|
if(((false) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IUUID$)))){
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
cljs.core.pr_writer_ex_info = (function cljs$core$pr_writer_ex_info(obj,writer,opts){
|
|
cljs.core._write(writer,"#error {:message ");
|
|
|
|
cljs.core.pr_writer(obj.message,writer,opts);
|
|
|
|
if(cljs.core.truth_(obj.data)){
|
|
cljs.core._write(writer,", :data ");
|
|
|
|
cljs.core.pr_writer(obj.data,writer,opts);
|
|
} else {
|
|
}
|
|
|
|
if(cljs.core.truth_(obj.cause)){
|
|
cljs.core._write(writer,", :cause ");
|
|
|
|
cljs.core.pr_writer(obj.cause,writer,opts);
|
|
} else {
|
|
}
|
|
|
|
return cljs.core._write(writer,"}");
|
|
});
|
|
/**
|
|
* @constructor
|
|
*/
|
|
cljs.core.ExceptionInfo = (function cljs$core$ExceptionInfo(message,data,cause){
|
|
var e = (new Error(message));
|
|
var this$ = this;
|
|
this$.message = message;
|
|
|
|
this$.data = data;
|
|
|
|
this$.cause = cause;
|
|
|
|
this$.name = e.name;
|
|
|
|
this$.description = e.description;
|
|
|
|
this$.number = e.number;
|
|
|
|
this$.fileName = e.fileName;
|
|
|
|
this$.lineNumber = e.lineNumber;
|
|
|
|
this$.columnNumber = e.columnNumber;
|
|
|
|
this$.stack = e.stack;
|
|
|
|
return this$;
|
|
});
|
|
cljs.core.ExceptionInfo.prototype.__proto__ = Error.prototype;
|
|
cljs.core.ExceptionInfo.prototype.cljs$core$IPrintWithWriter$ = cljs.core.PROTOCOL_SENTINEL;
|
|
|
|
cljs.core.ExceptionInfo.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (obj,writer,opts){
|
|
var obj__$1 = this;
|
|
return cljs.core.pr_writer_ex_info(obj__$1,writer,opts);
|
|
});
|
|
cljs.core.ExceptionInfo.prototype.toString = (function (){
|
|
var this$ = this;
|
|
return cljs.core.pr_str_STAR_(this$);
|
|
});
|
|
/**
|
|
* Create an instance of ExceptionInfo, an Error type that carries a
|
|
* map of additional data.
|
|
*/
|
|
cljs.core.ex_info = (function cljs$core$ex_info(var_args){
|
|
var G__3260 = arguments.length;
|
|
switch (G__3260) {
|
|
case 2:
|
|
return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2 = (function (msg,data){
|
|
return cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3(msg,data,null);
|
|
});
|
|
|
|
cljs.core.ex_info.cljs$core$IFn$_invoke$arity$3 = (function (msg,data,cause){
|
|
return (new cljs.core.ExceptionInfo(msg,data,cause));
|
|
});
|
|
|
|
cljs.core.ex_info.cljs$lang$maxFixedArity = 3;
|
|
|
|
/**
|
|
* Returns exception data (a map) if ex is an ExceptionInfo.
|
|
* Otherwise returns nil.
|
|
*/
|
|
cljs.core.ex_data = (function cljs$core$ex_data(ex){
|
|
if((ex instanceof cljs.core.ExceptionInfo)){
|
|
return ex.data;
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns the message attached to the given Error / ExceptionInfo object.
|
|
* For non-Errors returns nil.
|
|
*/
|
|
cljs.core.ex_message = (function cljs$core$ex_message(ex){
|
|
if((ex instanceof Error)){
|
|
return ex.message;
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns exception cause (an Error / ExceptionInfo) if ex is an
|
|
* ExceptionInfo.
|
|
* Otherwise returns nil.
|
|
*/
|
|
cljs.core.ex_cause = (function cljs$core$ex_cause(ex){
|
|
if((ex instanceof cljs.core.ExceptionInfo)){
|
|
return ex.cause;
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Returns an JavaScript compatible comparator based upon pred.
|
|
*/
|
|
cljs.core.comparator = (function cljs$core$comparator(pred){
|
|
return (function (x,y){
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$2 ? pred.cljs$core$IFn$_invoke$arity$2(x,y) : pred.call(null,x,y)))){
|
|
return (-1);
|
|
} else {
|
|
if(cljs.core.truth_((pred.cljs$core$IFn$_invoke$arity$2 ? pred.cljs$core$IFn$_invoke$arity$2(y,x) : pred.call(null,y,x)))){
|
|
return (1);
|
|
} else {
|
|
return (0);
|
|
|
|
}
|
|
}
|
|
});
|
|
});
|
|
/**
|
|
* Returns true if x names a special form
|
|
*/
|
|
cljs.core.special_symbol_QMARK_ = (function cljs$core$special_symbol_QMARK_(x){
|
|
return cljs.core.contains_QMARK_(new cljs.core.PersistentHashSet(null, new cljs.core.PersistentArrayMap(null, 24, [cljs.core.cst$sym$_AMPERSAND_,"null",cljs.core.cst$sym$case_STAR_,"null",cljs.core.cst$sym$defrecord_STAR_,"null",cljs.core.cst$sym$try,"null",cljs.core.cst$sym$ns_STAR_,"null",cljs.core.cst$sym$finally,"null",cljs.core.cst$sym$loop_STAR_,"null",cljs.core.cst$sym$do,"null",cljs.core.cst$sym$letfn_STAR_,"null",cljs.core.cst$sym$if,"null",cljs.core.cst$sym$new,"null",cljs.core.cst$sym$ns,"null",cljs.core.cst$sym$deftype_STAR_,"null",cljs.core.cst$sym$let_STAR_,"null",cljs.core.cst$sym$js_STAR_,"null",cljs.core.cst$sym$fn_STAR_,"null",cljs.core.cst$sym$recur,"null",cljs.core.cst$sym$set_BANG_,"null",cljs.core.cst$sym$_DOT_,"null",cljs.core.cst$sym$var,"null",cljs.core.cst$sym$quote,"null",cljs.core.cst$sym$catch,"null",cljs.core.cst$sym$throw,"null",cljs.core.cst$sym$def,"null"], null), null),x);
|
|
});
|
|
/**
|
|
* test [v] finds fn at key :test in var metadata and calls it,
|
|
* presuming failure will throw exception
|
|
*/
|
|
cljs.core.test = (function cljs$core$test(v){
|
|
var f = v.cljs$lang$test;
|
|
if(cljs.core.truth_(f)){
|
|
(f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null));
|
|
|
|
return cljs.core.cst$kw$ok;
|
|
} else {
|
|
return cljs.core.cst$kw$no_DASH_test;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
* @implements {cljs.core.IPrintWithWriter}
|
|
* @implements {cljs.core.ILookup}
|
|
*/
|
|
cljs.core.TaggedLiteral = (function (tag,form){
|
|
this.tag = tag;
|
|
this.form = form;
|
|
this.cljs$lang$protocol_mask$partition0$ = 2153775360;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.TaggedLiteral.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var coll = this;
|
|
return cljs.core.pr_str_STAR_(coll);
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (this$,other){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return (((other instanceof cljs.core.TaggedLiteral)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.tag,other.tag)) && (cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.form,other.form)));
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.prototype.cljs$core$IHash$_hash$arity$1 = (function (this$){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return (((31) * cljs.core.hash(self__.tag)) + cljs.core.hash(self__.form));
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.prototype.cljs$core$ILookup$_lookup$arity$2 = (function (this$,v){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
return this$__$1.cljs$core$ILookup$_lookup$arity$3(null,v,null);
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.prototype.cljs$core$ILookup$_lookup$arity$3 = (function (this$,v,not_found){
|
|
var self__ = this;
|
|
var this$__$1 = this;
|
|
var G__3262 = v;
|
|
var G__3262__$1 = (((G__3262 instanceof cljs.core.Keyword))?G__3262.fqn:null);
|
|
switch (G__3262__$1) {
|
|
case "tag":
|
|
return self__.tag;
|
|
|
|
break;
|
|
case "form":
|
|
return self__.form;
|
|
|
|
break;
|
|
default:
|
|
return not_found;
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (o,writer,opts){
|
|
var self__ = this;
|
|
var o__$1 = this;
|
|
cljs.core._write(writer,["#",cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.tag)," "].join(''));
|
|
|
|
return cljs.core.pr_writer(self__.form,writer,opts);
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$tag,cljs.core.cst$sym$form], null);
|
|
});
|
|
|
|
cljs.core.TaggedLiteral.cljs$lang$type = true;
|
|
|
|
cljs.core.TaggedLiteral.cljs$lang$ctorStr = "cljs.core/TaggedLiteral";
|
|
|
|
cljs.core.TaggedLiteral.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/TaggedLiteral");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/TaggedLiteral.
|
|
*/
|
|
cljs.core.__GT_TaggedLiteral = (function cljs$core$__GT_TaggedLiteral(tag,form){
|
|
return (new cljs.core.TaggedLiteral(tag,form));
|
|
});
|
|
|
|
/**
|
|
* Return true if the value is the data representation of a tagged literal
|
|
*/
|
|
cljs.core.tagged_literal_QMARK_ = (function cljs$core$tagged_literal_QMARK_(value){
|
|
return (value instanceof cljs.core.TaggedLiteral);
|
|
});
|
|
/**
|
|
* Construct a data representation of a tagged literal from a
|
|
* tag symbol and a form.
|
|
*/
|
|
cljs.core.tagged_literal = (function cljs$core$tagged_literal(tag,form){
|
|
if((tag instanceof cljs.core.Symbol)){
|
|
} else {
|
|
throw (new Error("Assert failed: (symbol? tag)"));
|
|
}
|
|
|
|
return (new cljs.core.TaggedLiteral(tag,form));
|
|
});
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core.js_reserved_arr = ["arguments","abstract","await","boolean","break","byte","case","catch","char","class","const","continue","debugger","default","delete","do","double","else","enum","export","extends","final","finally","float","for","function","goto","if","implements","import","in","instanceof","int","interface","let","long","native","new","package","private","protected","public","return","short","static","super","switch","synchronized","this","throw","throws","transient","try","typeof","var","void","volatile","while","with","yield","methods","null","constructor"];
|
|
/**
|
|
* @type {null|Object}
|
|
*/
|
|
cljs.core.js_reserved = null;
|
|
cljs.core.js_reserved_QMARK_ = (function cljs$core$js_reserved_QMARK_(x){
|
|
if((cljs.core.js_reserved == null)){
|
|
cljs.core.js_reserved = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__3264_SHARP_,p2__3265_SHARP_){
|
|
goog.object.set(p1__3264_SHARP_,p2__3265_SHARP_,true);
|
|
|
|
return p1__3264_SHARP_;
|
|
}),({}),cljs.core.js_reserved_arr);
|
|
} else {
|
|
}
|
|
|
|
return cljs.core.js_reserved.hasOwnProperty(x);
|
|
});
|
|
cljs.core.demunge_pattern = (function cljs$core$demunge_pattern(){
|
|
if(cljs.core.truth_(cljs.core.DEMUNGE_PATTERN)){
|
|
} else {
|
|
cljs.core.DEMUNGE_PATTERN = (function (){var ks = cljs.core.sort.cljs$core$IFn$_invoke$arity$2((function (a,b){
|
|
return (b.length - a.length);
|
|
}),cljs.core.js_keys(cljs.core.DEMUNGE_MAP));
|
|
var ks__$1 = ks;
|
|
var ret = "";
|
|
while(true){
|
|
if(cljs.core.seq(ks__$1)){
|
|
var G__3267 = cljs.core.next(ks__$1);
|
|
var G__3268 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1((function (){var G__3266 = ret;
|
|
if((!((ret === "")))){
|
|
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__3266),"|"].join('');
|
|
} else {
|
|
return G__3266;
|
|
}
|
|
})()),cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(ks__$1))].join('');
|
|
ks__$1 = G__3267;
|
|
ret = G__3268;
|
|
continue;
|
|
} else {
|
|
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),"|\\$"].join('');
|
|
}
|
|
break;
|
|
}
|
|
})();
|
|
}
|
|
|
|
return cljs.core.DEMUNGE_PATTERN;
|
|
});
|
|
cljs.core.munge_str = (function cljs$core$munge_str(name){
|
|
var sb = (new goog.string.StringBuffer());
|
|
var i_3269 = (0);
|
|
while(true){
|
|
if((i_3269 < name.length)){
|
|
var c_3270 = name.charAt(i_3269);
|
|
var sub_3271 = goog.object.get(cljs.core.CHAR_MAP,c_3270);
|
|
if((!((sub_3271 == null)))){
|
|
sb.append(sub_3271);
|
|
} else {
|
|
sb.append(c_3270);
|
|
}
|
|
|
|
var G__3272 = (i_3269 + (1));
|
|
i_3269 = G__3272;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
return sb.toString();
|
|
});
|
|
cljs.core.munge = (function cljs$core$munge(name){
|
|
var name_SINGLEQUOTE_ = cljs.core.munge_str(cljs.core.str.cljs$core$IFn$_invoke$arity$1(name));
|
|
var name_SINGLEQUOTE___$1 = (((name_SINGLEQUOTE_ === ".."))?"_DOT__DOT_":(cljs.core.truth_(cljs.core.js_reserved_QMARK_(name_SINGLEQUOTE_))?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(name_SINGLEQUOTE_),"$"].join(''):name_SINGLEQUOTE_
|
|
));
|
|
if((name instanceof cljs.core.Symbol)){
|
|
return cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(name_SINGLEQUOTE___$1);
|
|
} else {
|
|
return name_SINGLEQUOTE___$1;
|
|
}
|
|
});
|
|
cljs.core.demunge_str = (function cljs$core$demunge_str(munged_name){
|
|
var r = (new RegExp(cljs.core.demunge_pattern(),"g"));
|
|
var munged_name__$1 = (cljs.core.truth_(goog.string.endsWith(munged_name,"$"))?munged_name.substring((0),(munged_name.length - (1))):munged_name);
|
|
var ret = "";
|
|
var last_match_end = (0);
|
|
while(true){
|
|
var temp__5455__auto__ = r.exec(munged_name__$1);
|
|
if(cljs.core.truth_(temp__5455__auto__)){
|
|
var match = temp__5455__auto__;
|
|
var vec__3273 = match;
|
|
var x = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__3273,(0),null);
|
|
var G__3276 = [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),cljs.core.str.cljs$core$IFn$_invoke$arity$1(munged_name__$1.substring(last_match_end,(r.lastIndex - x.length))),cljs.core.str.cljs$core$IFn$_invoke$arity$1((((x === "$"))?"/":goog.object.get(cljs.core.DEMUNGE_MAP,x)))].join('');
|
|
var G__3277 = r.lastIndex;
|
|
ret = G__3276;
|
|
last_match_end = G__3277;
|
|
continue;
|
|
} else {
|
|
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(ret),cljs.core.str.cljs$core$IFn$_invoke$arity$1(munged_name__$1.substring(last_match_end,munged_name__$1.length))].join('');
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
cljs.core.demunge = (function cljs$core$demunge(name){
|
|
var G__3279 = (function (){var name_SINGLEQUOTE_ = cljs.core.str.cljs$core$IFn$_invoke$arity$1(name);
|
|
if((name_SINGLEQUOTE_ === "_DOT__DOT_")){
|
|
return "..";
|
|
} else {
|
|
return cljs.core.demunge_str(name_SINGLEQUOTE_);
|
|
}
|
|
})();
|
|
var fexpr__3278 = (((name instanceof cljs.core.Symbol))?cljs.core.symbol:cljs.core.str);
|
|
return (fexpr__3278.cljs$core$IFn$_invoke$arity$1 ? fexpr__3278.cljs$core$IFn$_invoke$arity$1(G__3279) : fexpr__3278.call(null,G__3279));
|
|
});
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core.tapset !== 'undefined')){
|
|
} else {
|
|
/**
|
|
* @type {*}
|
|
*/
|
|
cljs.core.tapset = null;
|
|
}
|
|
cljs.core.maybe_init_tapset = (function cljs$core$maybe_init_tapset(){
|
|
if((cljs.core.tapset == null)){
|
|
return cljs.core.tapset = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentHashSet.EMPTY);
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
/**
|
|
* Adds f, a fn of one argument, to the tap set. This function will be called with
|
|
* anything sent via tap>. Remember f in order to remove-tap
|
|
*/
|
|
cljs.core.add_tap = (function cljs$core$add_tap(f){
|
|
cljs.core.maybe_init_tapset();
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.tapset,cljs.core.conj,f);
|
|
|
|
return null;
|
|
});
|
|
/**
|
|
* Remove f from the tap set.
|
|
*/
|
|
cljs.core.remove_tap = (function cljs$core$remove_tap(f){
|
|
cljs.core.maybe_init_tapset();
|
|
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$3(cljs.core.tapset,cljs.core.disj,f);
|
|
|
|
return null;
|
|
});
|
|
/**
|
|
* Sends x to any taps. Returns the result of *exec-tap-fn*, a Boolean value.
|
|
*/
|
|
cljs.core.tap_GT_ = (function cljs$core$tap_GT_(x){
|
|
cljs.core.maybe_init_tapset();
|
|
|
|
return (cljs.core._STAR_exec_tap_fn_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_exec_tap_fn_STAR_.cljs$core$IFn$_invoke$arity$1((function (){
|
|
var seq__3280 = cljs.core.seq(cljs.core.deref(cljs.core.tapset));
|
|
var chunk__3281 = null;
|
|
var count__3282 = (0);
|
|
var i__3283 = (0);
|
|
while(true){
|
|
if((i__3283 < count__3282)){
|
|
var tap = chunk__3281.cljs$core$IIndexed$_nth$arity$2(null,i__3283);
|
|
try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
|
|
}catch (e3284){if((e3284 instanceof Error)){
|
|
var ex_3286 = e3284;
|
|
} else {
|
|
throw e3284;
|
|
|
|
}
|
|
}
|
|
|
|
var G__3287 = seq__3280;
|
|
var G__3288 = chunk__3281;
|
|
var G__3289 = count__3282;
|
|
var G__3290 = (i__3283 + (1));
|
|
seq__3280 = G__3287;
|
|
chunk__3281 = G__3288;
|
|
count__3282 = G__3289;
|
|
i__3283 = G__3290;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__3280);
|
|
if(temp__5457__auto__){
|
|
var seq__3280__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__3280__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__3280__$1);
|
|
var G__3291 = cljs.core.chunk_rest(seq__3280__$1);
|
|
var G__3292 = c__4461__auto__;
|
|
var G__3293 = cljs.core.count(c__4461__auto__);
|
|
var G__3294 = (0);
|
|
seq__3280 = G__3291;
|
|
chunk__3281 = G__3292;
|
|
count__3282 = G__3293;
|
|
i__3283 = G__3294;
|
|
continue;
|
|
} else {
|
|
var tap = cljs.core.first(seq__3280__$1);
|
|
try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
|
|
}catch (e3285){if((e3285 instanceof Error)){
|
|
var ex_3295 = e3285;
|
|
} else {
|
|
throw e3285;
|
|
|
|
}
|
|
}
|
|
|
|
var G__3296 = cljs.core.next(seq__3280__$1);
|
|
var G__3297 = null;
|
|
var G__3298 = (0);
|
|
var G__3299 = (0);
|
|
seq__3280 = G__3296;
|
|
chunk__3281 = G__3297;
|
|
count__3282 = G__3298;
|
|
i__3283 = G__3299;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
})) : cljs.core._STAR_exec_tap_fn_STAR_.call(null,(function (){
|
|
var seq__3280 = cljs.core.seq(cljs.core.deref(cljs.core.tapset));
|
|
var chunk__3281 = null;
|
|
var count__3282 = (0);
|
|
var i__3283 = (0);
|
|
while(true){
|
|
if((i__3283 < count__3282)){
|
|
var tap = chunk__3281.cljs$core$IIndexed$_nth$arity$2(null,i__3283);
|
|
try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
|
|
}catch (e3284){if((e3284 instanceof Error)){
|
|
var ex_3300 = e3284;
|
|
} else {
|
|
throw e3284;
|
|
|
|
}
|
|
}
|
|
|
|
var G__3301 = seq__3280;
|
|
var G__3302 = chunk__3281;
|
|
var G__3303 = count__3282;
|
|
var G__3304 = (i__3283 + (1));
|
|
seq__3280 = G__3301;
|
|
chunk__3281 = G__3302;
|
|
count__3282 = G__3303;
|
|
i__3283 = G__3304;
|
|
continue;
|
|
} else {
|
|
var temp__5457__auto__ = cljs.core.seq(seq__3280);
|
|
if(temp__5457__auto__){
|
|
var seq__3280__$1 = temp__5457__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_(seq__3280__$1)){
|
|
var c__4461__auto__ = cljs.core.chunk_first(seq__3280__$1);
|
|
var G__3305 = cljs.core.chunk_rest(seq__3280__$1);
|
|
var G__3306 = c__4461__auto__;
|
|
var G__3307 = cljs.core.count(c__4461__auto__);
|
|
var G__3308 = (0);
|
|
seq__3280 = G__3305;
|
|
chunk__3281 = G__3306;
|
|
count__3282 = G__3307;
|
|
i__3283 = G__3308;
|
|
continue;
|
|
} else {
|
|
var tap = cljs.core.first(seq__3280__$1);
|
|
try{(tap.cljs$core$IFn$_invoke$arity$1 ? tap.cljs$core$IFn$_invoke$arity$1(x) : tap.call(null,x));
|
|
}catch (e3285){if((e3285 instanceof Error)){
|
|
var ex_3309 = e3285;
|
|
} else {
|
|
throw e3285;
|
|
|
|
}
|
|
}
|
|
|
|
var G__3310 = cljs.core.next(seq__3280__$1);
|
|
var G__3311 = null;
|
|
var G__3312 = (0);
|
|
var G__3313 = (0);
|
|
seq__3280 = G__3310;
|
|
chunk__3281 = G__3311;
|
|
count__3282 = G__3312;
|
|
i__3283 = G__3313;
|
|
continue;
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
})));
|
|
});
|
|
/**
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.ns_lookup = (function cljs$core$ns_lookup(ns_obj,k){
|
|
return (function (){
|
|
return goog.object.get(ns_obj,k);
|
|
});
|
|
});
|
|
|
|
/**
|
|
* @constructor
|
|
* @implements {cljs.core.IEquiv}
|
|
* @implements {cljs.core.IHash}
|
|
*/
|
|
cljs.core.Namespace = (function (obj,name){
|
|
this.obj = obj;
|
|
this.name = name;
|
|
this.cljs$lang$protocol_mask$partition0$ = 6291456;
|
|
this.cljs$lang$protocol_mask$partition1$ = 0;
|
|
});
|
|
cljs.core.Namespace.prototype.findInternedVar = (function (sym){
|
|
var self__ = this;
|
|
var this$ = this;
|
|
var k = cljs.core.munge(cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym));
|
|
if(goog.object.containsKey(self__.obj,k)){
|
|
var var_sym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name),cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym));
|
|
var var_meta = new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$ns,this$], null);
|
|
return (new cljs.core.Var(cljs.core.ns_lookup(self__.obj,k),var_sym,var_meta));
|
|
} else {
|
|
return null;
|
|
}
|
|
});
|
|
|
|
cljs.core.Namespace.prototype.getName = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return self__.name;
|
|
});
|
|
|
|
cljs.core.Namespace.prototype.toString = (function (){
|
|
var self__ = this;
|
|
var _ = this;
|
|
return cljs.core.str.cljs$core$IFn$_invoke$arity$1(self__.name);
|
|
});
|
|
|
|
cljs.core.Namespace.prototype.cljs$core$IEquiv$_equiv$arity$2 = (function (_,other){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
if((other instanceof cljs.core.Namespace)){
|
|
return cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(self__.name,other.name);
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
|
|
cljs.core.Namespace.prototype.cljs$core$IHash$_hash$arity$1 = (function (_){
|
|
var self__ = this;
|
|
var ___$1 = this;
|
|
return cljs.core.hash(self__.name);
|
|
});
|
|
|
|
cljs.core.Namespace.getBasis = (function (){
|
|
return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.cst$sym$obj,cljs.core.cst$sym$name], null);
|
|
});
|
|
|
|
cljs.core.Namespace.cljs$lang$type = true;
|
|
|
|
cljs.core.Namespace.cljs$lang$ctorStr = "cljs.core/Namespace";
|
|
|
|
cljs.core.Namespace.cljs$lang$ctorPrWriter = (function (this__4290__auto__,writer__4291__auto__,opt__4292__auto__){
|
|
return cljs.core._write(writer__4291__auto__,"cljs.core/Namespace");
|
|
});
|
|
|
|
/**
|
|
* Positional factory function for cljs.core/Namespace.
|
|
*/
|
|
cljs.core.__GT_Namespace = (function cljs$core$__GT_Namespace(obj,name){
|
|
return (new cljs.core.Namespace(obj,name));
|
|
});
|
|
|
|
/**
|
|
* Bootstrap only.
|
|
* @type {*}
|
|
*/
|
|
cljs.core.NS_CACHE = null;
|
|
/**
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.find_ns_obj_STAR_ = (function cljs$core$find_ns_obj_STAR_(ctxt,xs){
|
|
while(true){
|
|
if((ctxt == null)){
|
|
return null;
|
|
} else {
|
|
if((xs == null)){
|
|
return ctxt;
|
|
} else {
|
|
var G__3316 = (function (){var G__3314 = ctxt;
|
|
var G__3315 = cljs.core.first(xs);
|
|
return goog.object.get(G__3314,G__3315);
|
|
})();
|
|
var G__3317 = cljs.core.next(xs);
|
|
ctxt = G__3316;
|
|
xs = G__3317;
|
|
continue;
|
|
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.find_ns_obj = (function cljs$core$find_ns_obj(ns){
|
|
var munged_ns = cljs.core.munge(cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns));
|
|
var segs = munged_ns.split(".");
|
|
var G__3318 = cljs.core._STAR_target_STAR_;
|
|
switch (G__3318) {
|
|
case "nodejs":
|
|
if(COMPILED){
|
|
return cljs.core.find_ns_obj_STAR_((function (){try{var ctxt = eval(cljs.core.first(segs));
|
|
if(cljs.core.truth_((function (){var and__4036__auto__ = ctxt;
|
|
if(cljs.core.truth_(and__4036__auto__)){
|
|
return cljs.core.object_QMARK_(ctxt);
|
|
} else {
|
|
return and__4036__auto__;
|
|
}
|
|
})())){
|
|
return ctxt;
|
|
} else {
|
|
return null;
|
|
}
|
|
}catch (e3319){if((e3319 instanceof ReferenceError)){
|
|
var e = e3319;
|
|
return null;
|
|
} else {
|
|
throw e3319;
|
|
|
|
}
|
|
}})(),cljs.core.next(segs));
|
|
} else {
|
|
return cljs.core.find_ns_obj_STAR_(goog.global,segs);
|
|
}
|
|
|
|
break;
|
|
case "default":
|
|
case "webworker":
|
|
return cljs.core.find_ns_obj_STAR_(goog.global,segs);
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["find-ns-obj not supported for target ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core._STAR_target_STAR_)].join('')));
|
|
|
|
}
|
|
});
|
|
/**
|
|
* Returns a map of the intern mappings for the namespace.
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.ns_interns_STAR_ = (function cljs$core$ns_interns_STAR_(sym){
|
|
var ns_obj = cljs.core.find_ns_obj(sym);
|
|
var ns = (new cljs.core.Namespace(ns_obj,sym));
|
|
var step = ((function (ns_obj,ns){
|
|
return (function cljs$core$ns_interns_STAR__$_step(ret,k){
|
|
var var_sym = cljs.core.symbol.cljs$core$IFn$_invoke$arity$1(cljs.core.demunge(k));
|
|
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(ret,var_sym,(new cljs.core.Var(((function (var_sym,ns_obj,ns){
|
|
return (function (){
|
|
return goog.object.get(ns_obj,k);
|
|
});})(var_sym,ns_obj,ns))
|
|
,cljs.core.symbol.cljs$core$IFn$_invoke$arity$2(cljs.core.str.cljs$core$IFn$_invoke$arity$1(sym),cljs.core.str.cljs$core$IFn$_invoke$arity$1(var_sym)),new cljs.core.PersistentArrayMap(null, 1, [cljs.core.cst$kw$ns,ns], null))));
|
|
});})(ns_obj,ns))
|
|
;
|
|
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(step,cljs.core.PersistentArrayMap.EMPTY,cljs.core.js_keys(ns_obj));
|
|
});
|
|
/**
|
|
* Create a new namespace named by the symbol. Bootstrap only.
|
|
*/
|
|
cljs.core.create_ns = (function cljs$core$create_ns(var_args){
|
|
var G__3322 = arguments.length;
|
|
switch (G__3322) {
|
|
case 1:
|
|
return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
cljs.core.create_ns.cljs$core$IFn$_invoke$arity$1 = (function (sym){
|
|
return cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(sym,cljs.core.find_ns_obj(sym));
|
|
});
|
|
|
|
cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2 = (function (sym,ns_obj){
|
|
return (new cljs.core.Namespace(ns_obj,sym));
|
|
});
|
|
|
|
cljs.core.create_ns.cljs$lang$maxFixedArity = 2;
|
|
|
|
/**
|
|
* Returns the namespace named by the symbol or nil if it doesn't exist.
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.find_ns = (function cljs$core$find_ns(ns){
|
|
if((cljs.core.NS_CACHE == null)){
|
|
cljs.core.NS_CACHE = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
|
|
} else {
|
|
}
|
|
|
|
var the_ns = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.NS_CACHE),ns);
|
|
if((!((the_ns == null)))){
|
|
return the_ns;
|
|
} else {
|
|
var ns_obj = cljs.core.find_ns_obj(ns);
|
|
if((ns_obj == null)){
|
|
return null;
|
|
} else {
|
|
var new_ns = cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(ns,ns_obj);
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(cljs.core.NS_CACHE,cljs.core.assoc,ns,new_ns);
|
|
|
|
return new_ns;
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the macros namespace named by the symbol or nil if it doesn't exist.
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.find_macros_ns = (function cljs$core$find_macros_ns(ns){
|
|
if((cljs.core.NS_CACHE == null)){
|
|
cljs.core.NS_CACHE = cljs.core.atom.cljs$core$IFn$_invoke$arity$1(cljs.core.PersistentArrayMap.EMPTY);
|
|
} else {
|
|
}
|
|
|
|
var ns_str = cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns);
|
|
var ns__$1 = (((!(goog.string.contains(ns_str,"$macros"))))?cljs.core.symbol.cljs$core$IFn$_invoke$arity$1([cljs.core.str.cljs$core$IFn$_invoke$arity$1(ns_str),"$macros"].join('')):ns);
|
|
var the_ns = cljs.core.get.cljs$core$IFn$_invoke$arity$2(cljs.core.deref(cljs.core.NS_CACHE),ns__$1);
|
|
if((!((the_ns == null)))){
|
|
return the_ns;
|
|
} else {
|
|
var ns_obj = cljs.core.find_ns_obj(ns__$1);
|
|
if((ns_obj == null)){
|
|
return null;
|
|
} else {
|
|
var new_ns = cljs.core.create_ns.cljs$core$IFn$_invoke$arity$2(ns__$1,ns_obj);
|
|
cljs.core.swap_BANG_.cljs$core$IFn$_invoke$arity$4(cljs.core.NS_CACHE,cljs.core.assoc,ns__$1,new_ns);
|
|
|
|
return new_ns;
|
|
}
|
|
}
|
|
});
|
|
/**
|
|
* Returns the name of the namespace, a Namespace object.
|
|
* Bootstrap only.
|
|
*/
|
|
cljs.core.ns_name = (function cljs$core$ns_name(ns_obj){
|
|
return ns_obj.name;
|
|
});
|
|
/**
|
|
* Returns true x is a goog.Uri instance.
|
|
*/
|
|
cljs.core.uri_QMARK_ = (function cljs$core$uri_QMARK_(x){
|
|
return (x instanceof goog.Uri);
|
|
});
|
|
cljs.core.maybe_enable_print_BANG_ = (function cljs$core$maybe_enable_print_BANG_(){
|
|
if((typeof console !== 'undefined')){
|
|
return cljs.core.enable_console_print_BANG_();
|
|
} else {
|
|
if((((cljs.core._STAR_target_STAR_ === "nashorn")) || ((cljs.core._STAR_target_STAR_ === "graaljs")))){
|
|
var system = Java.type("java.lang.System");
|
|
cljs.core._STAR_print_newline_STAR_ = false;
|
|
|
|
cljs.core.set_print_fn_BANG_(((function (system){
|
|
return (function (){
|
|
var xs = arguments;
|
|
var s = goog.array.clone(xs).join("");
|
|
return system.out.println(s);
|
|
});})(system))
|
|
);
|
|
|
|
return cljs.core.set_print_err_fn_BANG_(((function (system){
|
|
return (function (){
|
|
var xs = arguments;
|
|
var s = goog.array.clone(xs).join("");
|
|
return system.error.println(s);
|
|
});})(system))
|
|
);
|
|
} else {
|
|
return null;
|
|
}
|
|
}
|
|
});
|
|
cljs.core.maybe_enable_print_BANG_();
|
|
if((typeof cljs !== 'undefined') && (typeof cljs.core !== 'undefined') && (typeof cljs.core._STAR_eval_STAR_ !== 'undefined')){
|
|
} else {
|
|
/**
|
|
* Runtime environments may provide a way to evaluate ClojureScript
|
|
* forms. Whatever function *eval* is bound to will be passed any forms which
|
|
* should be evaluated.
|
|
*/
|
|
cljs.core._STAR_eval_STAR_ = (function cljs$core$_STAR_eval_STAR_(_){
|
|
throw (new Error("cljs.core/*eval* not bound"));
|
|
});
|
|
}
|
|
/**
|
|
* Evaluates the form data structure (not text!) and returns the result.
|
|
* Delegates to cljs.core/*eval*. Intended for use in self-hosted ClojureScript,
|
|
* which sets up an implementation of cljs.core/*eval* for that environment.
|
|
*/
|
|
cljs.core.eval = (function cljs$core$eval(form){
|
|
return (cljs.core._STAR_eval_STAR_.cljs$core$IFn$_invoke$arity$1 ? cljs.core._STAR_eval_STAR_.cljs$core$IFn$_invoke$arity$1(form) : cljs.core._STAR_eval_STAR_.call(null,form));
|
|
});
|