datahike 0.7.1630

package/me.tonsky.persistent_sorted_set.js

@@ -0,0 +1,890 @@
+var $CLJS = require("./cljs_env");
+var $jscomp = $CLJS.$jscomp;
+var COMPILED = false;
+require("./cljs.core.js");
+require("./me.tonsky.persistent_sorted_set.arrays.js");
+require("./me.tonsky.persistent_sorted_set.btset.js");
+var environ=$CLJS.environ || ($CLJS.environ = {});
+var fress=$CLJS.fress || ($CLJS.fress = {});
+var datahike=$CLJS.datahike || ($CLJS.datahike = {});
+var clojure=$CLJS.clojure || ($CLJS.clojure = {});
+var hasch=$CLJS.hasch || ($CLJS.hasch = {});
+var tailrecursion=$CLJS.tailrecursion || ($CLJS.tailrecursion = {});
+var superv=$CLJS.superv || ($CLJS.superv = {});
+var geheimnis=$CLJS.geheimnis || ($CLJS.geheimnis = {});
+var is=$CLJS.is || ($CLJS.is = {});
+var cljs=$CLJS.cljs || ($CLJS.cljs = {});
+var cljs_node_io=$CLJS.cljs_node_io || ($CLJS.cljs_node_io = {});
+var goog=$CLJS.goog || ($CLJS.goog = {});
+var konserve=$CLJS.konserve || ($CLJS.konserve = {});
+var datalog=$CLJS.datalog || ($CLJS.datalog = {});
+var spec_tools=$CLJS.spec_tools || ($CLJS.spec_tools = {});
+var taoensso=$CLJS.taoensso || ($CLJS.taoensso = {});
+var incognito=$CLJS.incognito || ($CLJS.incognito = {});
+var medley=$CLJS.medley || ($CLJS.medley = {});
+var me=$CLJS.me || ($CLJS.me = {});
+
+$CLJS.SHADOW_ENV.setLoaded("me.tonsky.persistent_sorted_set.js");
+
+goog.provide('me.tonsky.persistent_sorted_set');
+me.tonsky.persistent_sorted_set.default_opts = new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"branching-factor","branching-factor",1903198601),(512)], null);
+me.tonsky.persistent_sorted_set.with_defaults = (function me$tonsky$persistent_sorted_set$with_defaults(opts){
+return cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([me.tonsky.persistent_sorted_set.default_opts,opts], 0));
+});
+/**
+ * Fast path to create a set if you already have a sorted array of elements on your hands.
+ */
+me.tonsky.persistent_sorted_set.from_sorted_array = (function me$tonsky$persistent_sorted_set$from_sorted_array(var_args){
+var G__101917 = arguments.length;
+switch (G__101917) {
+case 2:
+return me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.from_sorted_array.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$2 = (function (cmp,arr){
+return me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$3(cmp,arr,arr.length);
+}));
+
+(me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$3 = (function (cmp,arr,_len){
+return me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$4(cmp,arr,_len,cljs.core.PersistentArrayMap.EMPTY);
+}));
+
+(me.tonsky.persistent_sorted_set.from_sorted_array.cljs$core$IFn$_invoke$arity$4 = (function (cmp,arr,_len,opts){
+return me.tonsky.persistent_sorted_set.btset.from_sorted_array(cmp,arr,_len,me.tonsky.persistent_sorted_set.with_defaults(opts));
+}));
+
+(me.tonsky.persistent_sorted_set.from_sorted_array.cljs$lang$maxFixedArity = 4);
+
+/**
+ * Create a set with custom comparator and a collection of keys. Useful when you't want to call [[clojure.core/apply]] on [[sorted-set-by]].
+ */
+me.tonsky.persistent_sorted_set.from_sequential = (function me$tonsky$persistent_sorted_set$from_sequential(var_args){
+var G__101928 = arguments.length;
+switch (G__101928) {
+case 2:
+return me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.from_sequential.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$2 = (function (cmp,seq){
+return me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$3(cmp,seq,cljs.core.PersistentArrayMap.EMPTY);
+}));
+
+(me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$3 = (function (cmp,seq,opts){
+return me.tonsky.persistent_sorted_set.btset.from_sequential(cmp,seq,me.tonsky.persistent_sorted_set.with_defaults(opts));
+}));
+
+(me.tonsky.persistent_sorted_set.from_sequential.cljs$lang$maxFixedArity = 3);
+
+me.tonsky.persistent_sorted_set.sorted_set_by = (function me$tonsky$persistent_sorted_set$sorted_set_by(var_args){
+var G__101960 = arguments.length;
+switch (G__101960) {
+case 1:
+return me.tonsky.persistent_sorted_set.sorted_set_by.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+var args_arr__5751__auto__ = [];
+var len__5726__auto___102682 = arguments.length;
+var i__5727__auto___102684 = (0);
+while(true){
+if((i__5727__auto___102684 < len__5726__auto___102682)){
+args_arr__5751__auto__.push((arguments[i__5727__auto___102684]));
+
+var G__102685 = (i__5727__auto___102684 + (1));
+i__5727__auto___102684 = G__102685;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__5752__auto__ = ((((1) < args_arr__5751__auto__.length))?(new cljs.core.IndexedSeq(args_arr__5751__auto__.slice((1)),(0),null)):null);
+return me.tonsky.persistent_sorted_set.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__5752__auto__);
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.sorted_set_by.cljs$core$IFn$_invoke$arity$1 = (function (cmp){
+return me.tonsky.persistent_sorted_set.btset.from_opts(me.tonsky.persistent_sorted_set.with_defaults(new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"comparator","comparator",2144896662),cmp], null)));
+}));
+
+(me.tonsky.persistent_sorted_set.sorted_set_by.cljs$core$IFn$_invoke$arity$variadic = (function (cmp,keys){
+return me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$2(cmp,keys);
+}));
+
+/** @this {Function} */
+(me.tonsky.persistent_sorted_set.sorted_set_by.cljs$lang$applyTo = (function (seq101955){
+var G__101957 = cljs.core.first(seq101955);
+var seq101955__$1 = cljs.core.next(seq101955);
+var self__5711__auto__ = this;
+return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__101957,seq101955__$1);
+}));
+
+(me.tonsky.persistent_sorted_set.sorted_set_by.cljs$lang$maxFixedArity = (1));
+
+me.tonsky.persistent_sorted_set.sorted_set = (function me$tonsky$persistent_sorted_set$sorted_set(var_args){
+var G__102026 = arguments.length;
+switch (G__102026) {
+case 0:
+return me.tonsky.persistent_sorted_set.sorted_set.cljs$core$IFn$_invoke$arity$0();
+
+break;
+default:
+var args_arr__5751__auto__ = [];
+var len__5726__auto___102687 = arguments.length;
+var i__5727__auto___102688 = (0);
+while(true){
+if((i__5727__auto___102688 < len__5726__auto___102687)){
+args_arr__5751__auto__.push((arguments[i__5727__auto___102688]));
+
+var G__102689 = (i__5727__auto___102688 + (1));
+i__5727__auto___102688 = G__102689;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__5752__auto__ = ((((0) < args_arr__5751__auto__.length))?(new cljs.core.IndexedSeq(args_arr__5751__auto__.slice((0)),(0),null)):null);
+return me.tonsky.persistent_sorted_set.sorted_set.cljs$core$IFn$_invoke$arity$variadic(argseq__5752__auto__);
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.sorted_set.cljs$core$IFn$_invoke$arity$0 = (function (){
+return me.tonsky.persistent_sorted_set.sorted_set_by.cljs$core$IFn$_invoke$arity$1(cljs.core.compare);
+}));
+
+(me.tonsky.persistent_sorted_set.sorted_set.cljs$core$IFn$_invoke$arity$variadic = (function (keys){
+return me.tonsky.persistent_sorted_set.from_sequential.cljs$core$IFn$_invoke$arity$2(cljs.core.compare,keys);
+}));
+
+/** @this {Function} */
+(me.tonsky.persistent_sorted_set.sorted_set.cljs$lang$applyTo = (function (seq102022){
+var self__5712__auto__ = this;
+return self__5712__auto__.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq(seq102022));
+}));
+
+(me.tonsky.persistent_sorted_set.sorted_set.cljs$lang$maxFixedArity = (0));
+
+/**
+ * Create a set with options map containing:
+ * - :storage  Storage implementation
+ * - :comparator  Custom comparator (defaults to compare)
+ * - :meta     Metadata
+ */
+me.tonsky.persistent_sorted_set.sorted_set_STAR_ = (function me$tonsky$persistent_sorted_set$sorted_set_STAR_(opts){
+return me.tonsky.persistent_sorted_set.btset.from_opts(me.tonsky.persistent_sorted_set.with_defaults(opts));
+});
+/**
+ * O(n) when restoring root address, otherwise O(1)
+ * returns number by default
+ * returns continuation yeilding number when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.count = (function me$tonsky$persistent_sorted_set$count(var_args){
+var G__102053 = arguments.length;
+switch (G__102053) {
+case 1:
+return me.tonsky.persistent_sorted_set.count.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return me.tonsky.persistent_sorted_set.count.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.count.cljs$core$IFn$_invoke$arity$1 = (function (set){
+return me.tonsky.persistent_sorted_set.btset.$count(set,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.count.cljs$core$IFn$_invoke$arity$2 = (function (set,opts){
+return me.tonsky.persistent_sorted_set.btset.$count(set,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.count.cljs$lang$maxFixedArity = 2);
+
+/**
+ * returns boolean by default
+ * returns continuation yeilding boolean when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.contains_QMARK_ = (function me$tonsky$persistent_sorted_set$contains_QMARK_(var_args){
+var G__102058 = arguments.length;
+switch (G__102058) {
+case 2:
+return me.tonsky.persistent_sorted_set.contains_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.contains_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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.contains_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (set,key){
+return me.tonsky.persistent_sorted_set.btset.$contains_QMARK_(set,key,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.contains_QMARK_.cljs$core$IFn$_invoke$arity$3 = (function (set,key,opts){
+return me.tonsky.persistent_sorted_set.btset.$contains_QMARK_(set,key,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.contains_QMARK_.cljs$lang$maxFixedArity = 3);
+
+/**
+ * key if present, else (or not-found nil)
+ */
+me.tonsky.persistent_sorted_set.lookup = (function me$tonsky$persistent_sorted_set$lookup(var_args){
+var G__102086 = arguments.length;
+switch (G__102086) {
+case 2:
+return me.tonsky.persistent_sorted_set.lookup.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.lookup.cljs$core$IFn$_invoke$arity$2 = (function (set,key){
+return me.tonsky.persistent_sorted_set.btset.$lookup(set,key,null,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.lookup.cljs$core$IFn$_invoke$arity$3 = (function (set,key,not_found){
+return me.tonsky.persistent_sorted_set.btset.$lookup(set,key,not_found,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.lookup.cljs$lang$maxFixedArity = 3);
+
+/**
+ * Is _other_ a set with the same items?
+ * returns boolean by default
+ * returns continuation yeilding boolean when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.equiv_QMARK_ = (function me$tonsky$persistent_sorted_set$equiv_QMARK_(var_args){
+var G__102146 = arguments.length;
+switch (G__102146) {
+case 2:
+return me.tonsky.persistent_sorted_set.equiv_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.equiv_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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.equiv_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (set,other){
+return me.tonsky.persistent_sorted_set.btset.$equivalent_QMARK_(set,other,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.equiv_QMARK_.cljs$core$IFn$_invoke$arity$3 = (function (set,other,opts){
+return me.tonsky.persistent_sorted_set.btset.$equivalent_QMARK_(set,other,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.equiv_QMARK_.cljs$lang$maxFixedArity = 3);
+
+/**
+ * returns btset/Iter by default
+ * returns continuation yielding btset/AsyncSeq when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.seq = (function me$tonsky$persistent_sorted_set$seq(var_args){
+var G__102165 = arguments.length;
+switch (G__102165) {
+case 1:
+return me.tonsky.persistent_sorted_set.seq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return me.tonsky.persistent_sorted_set.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.seq.cljs$core$IFn$_invoke$arity$1 = (function (set){
+return me.tonsky.persistent_sorted_set.btset.$seq.cljs$core$IFn$_invoke$arity$1(set);
+}));
+
+(me.tonsky.persistent_sorted_set.seq.cljs$core$IFn$_invoke$arity$2 = (function (set,opts){
+return me.tonsky.persistent_sorted_set.btset.$seq.cljs$core$IFn$_invoke$arity$2(set,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.seq.cljs$lang$maxFixedArity = 2);
+
+/**
+ * returns btset/ReverseIter by default
+ * returns continuation yielding btset/AsyncRSeq when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.rseq = (function me$tonsky$persistent_sorted_set$rseq(var_args){
+var G__102181 = arguments.length;
+switch (G__102181) {
+case 1:
+return me.tonsky.persistent_sorted_set.rseq.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return me.tonsky.persistent_sorted_set.rseq.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.rseq.cljs$core$IFn$_invoke$arity$1 = (function (set){
+return me.tonsky.persistent_sorted_set.btset.$rseq.cljs$core$IFn$_invoke$arity$1(set);
+}));
+
+(me.tonsky.persistent_sorted_set.rseq.cljs$core$IFn$_invoke$arity$2 = (function (set,opts){
+return me.tonsky.persistent_sorted_set.btset.$rseq.cljs$core$IFn$_invoke$arity$2(set,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.rseq.cljs$lang$maxFixedArity = 2);
+
+/**
+ * Test items in sequential order.
+ * returns boolean by default
+ * returns continuation yeilding boolean when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.equiv_sequential_QMARK_ = (function me$tonsky$persistent_sorted_set$equiv_sequential_QMARK_(var_args){
+var G__102185 = arguments.length;
+switch (G__102185) {
+case 2:
+return me.tonsky.persistent_sorted_set.equiv_sequential_QMARK_.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.equiv_sequential_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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.equiv_sequential_QMARK_.cljs$core$IFn$_invoke$arity$2 = (function (set,other){
+return me.tonsky.persistent_sorted_set.btset.$equivalent_sequential_QMARK_(set,other,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.equiv_sequential_QMARK_.cljs$core$IFn$_invoke$arity$3 = (function (set,other,opts){
+return me.tonsky.persistent_sorted_set.btset.$equivalent_sequential_QMARK_(set,other,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.equiv_sequential_QMARK_.cljs$lang$maxFixedArity = 3);
+
+/**
+ * Analogue to [[clojure.core/conj]] but with comparator that overrides the one stored in set.
+ * returns BTSet by default
+ * returns continuation yeilding BTSet when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.conj = (function me$tonsky$persistent_sorted_set$conj(var_args){
+var G__102228 = arguments.length;
+switch (G__102228) {
+case 2:
+return me.tonsky.persistent_sorted_set.conj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.conj.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.conj.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.conj.cljs$core$IFn$_invoke$arity$2 = (function (set,key){
+return me.tonsky.persistent_sorted_set.btset.$conjoin.cljs$core$IFn$_invoke$arity$2(set,key);
+}));
+
+(me.tonsky.persistent_sorted_set.conj.cljs$core$IFn$_invoke$arity$3 = (function (set,key,arg){
+return me.tonsky.persistent_sorted_set.btset.$conjoin.cljs$core$IFn$_invoke$arity$3(set,key,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.conj.cljs$core$IFn$_invoke$arity$4 = (function (set,key,cmp,opts){
+return me.tonsky.persistent_sorted_set.btset.$conjoin.cljs$core$IFn$_invoke$arity$4(set,key,cmp,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.conj.cljs$lang$maxFixedArity = 4);
+
+/**
+ * Analogue to [[clojure.core/disj]] with comparator that overrides the one stored in set.
+ * returns BTSet by default
+ * returns continuation yeilding BTSet when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.disj = (function me$tonsky$persistent_sorted_set$disj(var_args){
+var G__102298 = arguments.length;
+switch (G__102298) {
+case 2:
+return me.tonsky.persistent_sorted_set.disj.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.disj.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.disj.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.disj.cljs$core$IFn$_invoke$arity$2 = (function (set,key){
+return me.tonsky.persistent_sorted_set.btset.$disjoin.cljs$core$IFn$_invoke$arity$2(set,key);
+}));
+
+(me.tonsky.persistent_sorted_set.disj.cljs$core$IFn$_invoke$arity$3 = (function (set,key,arg){
+return me.tonsky.persistent_sorted_set.btset.$disjoin.cljs$core$IFn$_invoke$arity$3(set,key,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.disj.cljs$core$IFn$_invoke$arity$4 = (function (set,key,cmp,opts){
+return me.tonsky.persistent_sorted_set.btset.$disjoin.cljs$core$IFn$_invoke$arity$4(set,key,cmp,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.disj.cljs$lang$maxFixedArity = 4);
+
+/**
+ * Replace an existing key with a new key at the same logical position.
+ * The comparator must return 0 for both old-key and new-key.
+ * This is a single-traversal update - faster than disj + conj.
+ * returns BTSet by default
+ * returns continuation yielding BTSet when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.replace = (function me$tonsky$persistent_sorted_set$replace(var_args){
+var G__102339 = arguments.length;
+switch (G__102339) {
+case 3:
+return me.tonsky.persistent_sorted_set.replace.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.replace.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return me.tonsky.persistent_sorted_set.replace.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.replace.cljs$core$IFn$_invoke$arity$3 = (function (set,old_key,new_key){
+return me.tonsky.persistent_sorted_set.btset.$replace.cljs$core$IFn$_invoke$arity$3(set,old_key,new_key);
+}));
+
+(me.tonsky.persistent_sorted_set.replace.cljs$core$IFn$_invoke$arity$4 = (function (set,old_key,new_key,arg){
+return me.tonsky.persistent_sorted_set.btset.$replace.cljs$core$IFn$_invoke$arity$4(set,old_key,new_key,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.replace.cljs$core$IFn$_invoke$arity$5 = (function (set,old_key,new_key,cmp,opts){
+return me.tonsky.persistent_sorted_set.btset.$replace.cljs$core$IFn$_invoke$arity$5(set,old_key,new_key,cmp,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.replace.cljs$lang$maxFixedArity = 5);
+
+/**
+ * An iterator for part of the set with provided boundaries.
+ * `(slice set from to)` returns iterator for all Xs where from <= X <= to.
+ * Optionally pass in comparator that will override the one that set uses. Supports efficient [[clojure.core/rseq]].
+ */
+me.tonsky.persistent_sorted_set.slice = (function me$tonsky$persistent_sorted_set$slice(var_args){
+var G__102351 = arguments.length;
+switch (G__102351) {
+case 3:
+return me.tonsky.persistent_sorted_set.slice.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.slice.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return me.tonsky.persistent_sorted_set.slice.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.slice.cljs$core$IFn$_invoke$arity$3 = (function (set,key_from,key_to){
+return me.tonsky.persistent_sorted_set.btset.$slice.cljs$core$IFn$_invoke$arity$3(set,key_from,key_to);
+}));
+
+(me.tonsky.persistent_sorted_set.slice.cljs$core$IFn$_invoke$arity$4 = (function (set,key_from,key_to,arg){
+return me.tonsky.persistent_sorted_set.btset.$slice.cljs$core$IFn$_invoke$arity$4(set,key_from,key_to,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.slice.cljs$core$IFn$_invoke$arity$5 = (function (set,key_from,key_to,comparator,opts){
+return me.tonsky.persistent_sorted_set.btset.$slice.cljs$core$IFn$_invoke$arity$5(set,key_from,key_to,comparator,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.slice.cljs$lang$maxFixedArity = 5);
+
+/**
+ * A reverse iterator for part of the set with provided boundaries.
+ * `(rslice set from to)` returns backwards iterator for all Xs where from <= X <= to.
+ * Optionally pass in comparator that will override the one that set uses. Supports efficient [[clojure.core/rseq]].
+ */
+me.tonsky.persistent_sorted_set.rslice = (function me$tonsky$persistent_sorted_set$rslice(var_args){
+var G__102422 = arguments.length;
+switch (G__102422) {
+case 2:
+return me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return me.tonsky.persistent_sorted_set.rslice.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$2 = (function (set,key){
+return me.tonsky.persistent_sorted_set.btset.$rslice.cljs$core$IFn$_invoke$arity$5(set,key,key,set.comparator,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$3 = (function (set,key_from,key_to){
+return me.tonsky.persistent_sorted_set.btset.$rslice.cljs$core$IFn$_invoke$arity$5(set,key_from,key_to,set.comparator,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$4 = (function (set,key_from,key_to,arg){
+return me.tonsky.persistent_sorted_set.btset.$rslice.cljs$core$IFn$_invoke$arity$4(set,key_from,key_to,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.rslice.cljs$core$IFn$_invoke$arity$5 = (function (set,key_from,key_to,cmp,opts){
+return me.tonsky.persistent_sorted_set.btset.$rslice.cljs$core$IFn$_invoke$arity$5(set,key_from,key_to,cmp,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.rslice.cljs$lang$maxFixedArity = 5);
+
+/**
+ * An efficient way to seek to a specific key in a seq (either returned by [[clojure.core.seq]] or a slice.)
+ * `(seek (seq set) to)` returns iterator for all Xs where to <= X.
+ * Optionally pass in comparator that will override the one that set uses.
+ */
+me.tonsky.persistent_sorted_set.seek = (function me$tonsky$persistent_sorted_set$seek(var_args){
+var G__102446 = arguments.length;
+switch (G__102446) {
+case 2:
+return me.tonsky.persistent_sorted_set.seek.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.seek.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.seek.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.seek.cljs$core$IFn$_invoke$arity$2 = (function (seq,to){
+return me.tonsky.persistent_sorted_set.btset.$seek.cljs$core$IFn$_invoke$arity$2(seq,to);
+}));
+
+(me.tonsky.persistent_sorted_set.seek.cljs$core$IFn$_invoke$arity$3 = (function (seq,to,arg){
+return me.tonsky.persistent_sorted_set.btset.$seek.cljs$core$IFn$_invoke$arity$3(seq,to,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.seek.cljs$core$IFn$_invoke$arity$4 = (function (seq,to,cmp,opts){
+return me.tonsky.persistent_sorted_set.btset.$seek.cljs$core$IFn$_invoke$arity$4(seq,to,cmp,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.seek.cljs$lang$maxFixedArity = 4);
+
+/**
+ * Visit each address used by this set. Usable for cleaning up
+ * garbage left in storage from previous versions of the set.
+ * 
+ * returns nil when the walk completes
+ * returns a continuation yielding nil when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.walk_addresses = (function me$tonsky$persistent_sorted_set$walk_addresses(var_args){
+var G__102452 = arguments.length;
+switch (G__102452) {
+case 2:
+return me.tonsky.persistent_sorted_set.walk_addresses.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.walk_addresses.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.walk_addresses.cljs$core$IFn$_invoke$arity$2 = (function (set,consume_fn){
+return me.tonsky.persistent_sorted_set.btset.$walk_addresses(set,consume_fn,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.walk_addresses.cljs$core$IFn$_invoke$arity$3 = (function (set,consume_fn,opts){
+return me.tonsky.persistent_sorted_set.btset.$walk_addresses(set,consume_fn,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.walk_addresses.cljs$lang$maxFixedArity = 3);
+
+/**
+ * Flush set to storage. sync calls must be used with sync storage
+ * and async calls must be used with async storage.
+ * 
+ * returns address by default
+ * returns continuation yeilding address when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.store = (function me$tonsky$persistent_sorted_set$store(var_args){
+var G__102498 = arguments.length;
+switch (G__102498) {
+case 1:
+return me.tonsky.persistent_sorted_set.store.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return me.tonsky.persistent_sorted_set.store.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.store.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.store.cljs$core$IFn$_invoke$arity$1 = (function (set){
+return me.tonsky.persistent_sorted_set.btset.$store.cljs$core$IFn$_invoke$arity$2(set,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.store.cljs$core$IFn$_invoke$arity$2 = (function (set,arg){
+return me.tonsky.persistent_sorted_set.btset.$store.cljs$core$IFn$_invoke$arity$2(set,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.store.cljs$core$IFn$_invoke$arity$3 = (function (set,storage,opts){
+return me.tonsky.persistent_sorted_set.btset.$store.cljs$core$IFn$_invoke$arity$3(set,storage,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.store.cljs$lang$maxFixedArity = 3);
+
+/**
+ * Restore a set from storage given root-address-or-info and storage.
+ * This operation is always synchronous and does not initiate io.
+ * + First arg can be either:
+ *   - A root address (UUID) - requires opts with :shift and :count
+ *   - A map from store-set with :root-address :comparator
+ * 
+ * returns BTSet, **always synchronously**
+ */
+me.tonsky.persistent_sorted_set.restore = (function me$tonsky$persistent_sorted_set$restore(var_args){
+var G__102522 = arguments.length;
+switch (G__102522) {
+case 2:
+return me.tonsky.persistent_sorted_set.restore.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.restore.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.restore.cljs$core$IFn$_invoke$arity$2 = (function (root_address_or_info,storage){
+return me.tonsky.persistent_sorted_set.restore.cljs$core$IFn$_invoke$arity$3(root_address_or_info,storage,cljs.core.PersistentArrayMap.EMPTY);
+}));
+
+(me.tonsky.persistent_sorted_set.restore.cljs$core$IFn$_invoke$arity$3 = (function (root_address_or_info,storage,opts){
+return me.tonsky.persistent_sorted_set.btset.restore(root_address_or_info,storage,me.tonsky.persistent_sorted_set.with_defaults(opts));
+}));
+
+(me.tonsky.persistent_sorted_set.restore.cljs$lang$maxFixedArity = 3);
+
+/**
+ * reducing function is fn<acc,item> and _must_ return a continuation
+ * returns result by default
+ * returns continuation yielding result when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.reduce = (function me$tonsky$persistent_sorted_set$reduce(var_args){
+var G__102541 = arguments.length;
+switch (G__102541) {
+case 3:
+return me.tonsky.persistent_sorted_set.reduce.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.reduce.cljs$core$IFn$_invoke$arity$3 = (function (arf,set,from){
+return me.tonsky.persistent_sorted_set.btset.$reduce.cljs$core$IFn$_invoke$arity$4(arf,set,from,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.reduce.cljs$core$IFn$_invoke$arity$4 = (function (arf,set,from,opts){
+return me.tonsky.persistent_sorted_set.btset.$reduce.cljs$core$IFn$_invoke$arity$4(arf,set,from,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.reduce.cljs$lang$maxFixedArity = 4);
+
+/**
+ * xforms must be synchronous
+ * reducing function is fn<acc,item> and _must_ return a continuation
+ * returns result by default
+ * returns continuation yielding result when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.transduce = (function me$tonsky$persistent_sorted_set$transduce(var_args){
+var G__102574 = arguments.length;
+switch (G__102574) {
+case 4:
+return me.tonsky.persistent_sorted_set.transduce.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+case 5:
+return me.tonsky.persistent_sorted_set.transduce.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.transduce.cljs$core$IFn$_invoke$arity$4 = (function (xform,arf,set,from){
+return me.tonsky.persistent_sorted_set.btset.$transduce.cljs$core$IFn$_invoke$arity$5(xform,arf,set,from,new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"sync?","sync?",630471618),true], null));
+}));
+
+(me.tonsky.persistent_sorted_set.transduce.cljs$core$IFn$_invoke$arity$5 = (function (xform,arf,set,from,opts){
+return me.tonsky.persistent_sorted_set.btset.$transduce.cljs$core$IFn$_invoke$arity$5(xform,arf,set,from,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.transduce.cljs$lang$maxFixedArity = 5);
+
+/**
+ * xforms must be synchronous
+ * returns collection by default
+ * returns continuation yielding collection when {:sync? false}
+ */
+me.tonsky.persistent_sorted_set.into = (function me$tonsky$persistent_sorted_set$into(var_args){
+var G__102595 = arguments.length;
+switch (G__102595) {
+case 2:
+return me.tonsky.persistent_sorted_set.into.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+case 3:
+return me.tonsky.persistent_sorted_set.into.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return me.tonsky.persistent_sorted_set.into.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('')));
+
+}
+});
+
+(me.tonsky.persistent_sorted_set.into.cljs$core$IFn$_invoke$arity$2 = (function (set,arg){
+return me.tonsky.persistent_sorted_set.btset.$into.cljs$core$IFn$_invoke$arity$2(set,arg);
+}));
+
+(me.tonsky.persistent_sorted_set.into.cljs$core$IFn$_invoke$arity$3 = (function (set,arg0,arg1){
+return me.tonsky.persistent_sorted_set.btset.$into.cljs$core$IFn$_invoke$arity$3(set,arg0,arg1);
+}));
+
+(me.tonsky.persistent_sorted_set.into.cljs$core$IFn$_invoke$arity$4 = (function (set,xform,from,opts){
+return me.tonsky.persistent_sorted_set.btset.$into.cljs$core$IFn$_invoke$arity$4(set,xform,from,opts);
+}));
+
+(me.tonsky.persistent_sorted_set.into.cljs$lang$maxFixedArity = 4);
+
+
+//# sourceMappingURL=me.tonsky.persistent_sorted_set.js.map