datahike 0.7.1630

package/datahike.tools.js

@@ -0,0 +1,436 @@
+var $CLJS = require("./cljs_env");
+var $jscomp = $CLJS.$jscomp;
+var COMPILED = false;
+require("./cljs.core.js");
+require("./superv.async.js");
+require("./cljs.core.async.impl.protocols.js");
+require("./hasch.core.js");
+require("./cljs.core.async.js");
+require("./taoensso.timbre.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("datahike.tools.js");
+
+goog.provide('datahike.tools');
+datahike.tools.combine_hashes = (function datahike$tools$combine_hashes(x,y){
+return cljs.core.hash_combine(x,y);
+});
+datahike.tools._match_vector_class = (function datahike$tools$_match_vector_class(x){
+var G__43094 = x;
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.Symbol(null,"_","_",-1201019570,null),G__43094)){
+return new cljs.core.Keyword(null,"negative","negative",-1562068438);
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.Symbol(null,"*","*",345799209,null),G__43094)){
+return new cljs.core.Keyword(null,"any","any",1705907423);
+} else {
+return new cljs.core.Keyword(null,"positive","positive",1112941866);
+
+}
+}
+});
+datahike.tools._match_vector = (function datahike$tools$_match_vector(path,pattern_pos,pattern_size,pattern_symbols,pairs){
+if((pattern_pos < pattern_size)){
+var groups = cljs.core.group_by(cljs.core.comp.cljs$core$IFn$_invoke$arity$3(datahike.tools._match_vector_class,(function (p1__43098_SHARP_){
+return cljs.core.nth.cljs$core$IFn$_invoke$arity$2(p1__43098_SHARP_,pattern_pos);
+}),cljs.core.first),pairs);
+var sub = (function (p,pairs__$1){
+var G__43100 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(path,p);
+var G__43101 = (pattern_pos + (1));
+var G__43102 = pattern_size;
+var G__43103 = pattern_symbols;
+var G__43104 = pairs__$1;
+return (datahike.tools._match_vector.cljs$core$IFn$_invoke$arity$5 ? datahike.tools._match_vector.cljs$core$IFn$_invoke$arity$5(G__43100,G__43101,G__43102,G__43103,G__43104) : datahike.tools._match_vector.call(null, G__43100,G__43101,G__43102,G__43103,G__43104));
+});
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(new cljs.core.PersistentVector(null, 1, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.Keyword(null,"any","any",1705907423)], null),cljs.core.keys(groups))){
+return sub(new cljs.core.Symbol(null,"*","*",345799209,null),new cljs.core.Keyword(null,"any","any",1705907423).cljs$core$IFn$_invoke$arity$1(groups));
+} else {
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol(null,"if","if",1181717262,null),null,(1),null)),(new cljs.core.List(null,cljs.core.nth.cljs$core$IFn$_invoke$arity$2(pattern_symbols,pattern_pos),null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,sub((1),cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic(groups,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.Keyword(null,"positive","positive",1112941866),new cljs.core.Keyword(null,"any","any",1705907423)], null)], 0))),null,(1),null)),(new cljs.core.List(null,sub(new cljs.core.Symbol(null,"_","_",-1201019570,null),cljs.core.mapcat.cljs$core$IFn$_invoke$arity$variadic(groups,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.Keyword(null,"negative","negative",-1562068438),new cljs.core.Keyword(null,"any","any",1705907423)], null)], 0))),null,(1),null))], 0))));
+}
+} else {
+if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2((1),cljs.core.count(pairs))){
+throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("There should be exactly one expression at leaf",new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"path","path",-188191168),path], null));
+} else {
+return cljs.core.second(cljs.core.first(pairs));
+
+}
+}
+});
+datahike.tools.get_date = (function datahike$tools$get_date(){
+return (new Date());
+});
+datahike.tools.get_time_ms = (function datahike$tools$get_time_ms(){
+return (new Date()).getTime();
+});
+datahike.tools.throwable_promise = cljs.core.async.promise_chan;
+/**
+ * Recursively merges maps together. If all the maps supplied have nested maps
+ *   under the same keys, these nested maps are merged. Otherwise the value is
+ *   overwritten, as in `clojure.core/merge`.
+ * 
+ *   Copied from weavejester/medley 1.3.0
+ */
+datahike.tools.deep_merge = (function datahike$tools$deep_merge(var_args){
+var G__43127 = arguments.length;
+switch (G__43127) {
+case 0:
+return datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 2:
+return datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
+
+break;
+default:
+var args_arr__5751__auto__ = [];
+var len__5726__auto___43395 = arguments.length;
+var i__5727__auto___43397 = (0);
+while(true){
+if((i__5727__auto___43397 < len__5726__auto___43395)){
+args_arr__5751__auto__.push((arguments[i__5727__auto___43397]));
+
+var G__43398 = (i__5727__auto___43397 + (1));
+i__5727__auto___43397 = G__43398;
+continue;
+} else {
+}
+break;
+}
+
+var argseq__5752__auto__ = ((((2) < args_arr__5751__auto__.length))?(new cljs.core.IndexedSeq(args_arr__5751__auto__.slice((2)),(0),null)):null);
+return datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__5752__auto__);
+
+}
+});
+
+(datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$0 = (function (){
+return null;
+}));
+
+(datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$1 = (function (a){
+return a;
+}));
+
+(datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
+if(cljs.core.truth_((function (){var or__5002__auto__ = a;
+if(cljs.core.truth_(or__5002__auto__)){
+return or__5002__auto__;
+} else {
+return b;
+}
+})())){
+var merge_entry = (function datahike$tools$merge_entry(m,e){
+var k = cljs.core.key(e);
+var v_SINGLEQUOTE_ = 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 v = cljs.core.get.cljs$core$IFn$_invoke$arity$2(m,k);
+if(((cljs.core.map_QMARK_(v)) && (cljs.core.map_QMARK_(v_SINGLEQUOTE_)))){
+return datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$2(v,v_SINGLEQUOTE_);
+} else {
+return v_SINGLEQUOTE_;
+}
+})());
+} else {
+return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,k,v_SINGLEQUOTE_);
+}
+});
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(merge_entry,(function (){var or__5002__auto__ = a;
+if(cljs.core.truth_(or__5002__auto__)){
+return or__5002__auto__;
+} else {
+return cljs.core.PersistentArrayMap.EMPTY;
+}
+})(),cljs.core.seq(b));
+} else {
+return null;
+}
+}));
+
+(datahike.tools.deep_merge.cljs$core$IFn$_invoke$arity$variadic = (function (a,b,more){
+return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(datahike.tools.deep_merge,(function (){var or__5002__auto__ = a;
+if(cljs.core.truth_(or__5002__auto__)){
+return or__5002__auto__;
+} else {
+return cljs.core.PersistentArrayMap.EMPTY;
+}
+})(),cljs.core.cons(b,more));
+}));
+
+/** @this {Function} */
+(datahike.tools.deep_merge.cljs$lang$applyTo = (function (seq43121){
+var G__43122 = cljs.core.first(seq43121);
+var seq43121__$1 = cljs.core.next(seq43121);
+var G__43123 = cljs.core.first(seq43121__$1);
+var seq43121__$2 = cljs.core.next(seq43121__$1);
+var self__5711__auto__ = this;
+return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__43122,G__43123,seq43121__$2);
+}));
+
+(datahike.tools.deep_merge.cljs$lang$maxFixedArity = (2));
+
+datahike.tools.timed = (function datahike$tools$timed(f){
+var now = (function (){
+return ((1000) * (new Date()).getTime());
+});
+var start = now();
+var result = (f.cljs$core$IFn$_invoke$arity$0 ? f.cljs$core$IFn$_invoke$arity$0() : f.call(null, ));
+var end = now();
+var t = ((end - start) / 1000000.0);
+return new cljs.core.PersistentArrayMap(null, 2, [new cljs.core.Keyword(null,"res","res",-1395007879),result,new cljs.core.Keyword(null,"t","t",-1397832519),t], null);
+});
+datahike.tools.get_hostname = (function datahike$tools$get_hostname(){
+return "";
+});
+datahike.tools.reduce_clauses = (function datahike$tools$reduce_clauses(resolver,context,clauses){
+var context__$1 = context;
+var clauses__$1 = clauses;
+var failed_clauses = cljs.core.PersistentVector.EMPTY;
+while(true){
+if(cljs.core.empty_QMARK_(clauses__$1)){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [context__$1,failed_clauses], null);
+} else {
+var vec__43254 = clauses__$1;
+var seq__43255 = cljs.core.seq(vec__43254);
+var first__43256 = cljs.core.first(seq__43255);
+var seq__43255__$1 = cljs.core.next(seq__43255);
+var clause = first__43256;
+var clauses__$2 = seq__43255__$1;
+var temp__5802__auto__ = (resolver.cljs$core$IFn$_invoke$arity$2 ? resolver.cljs$core$IFn$_invoke$arity$2(context__$1,clause) : resolver.call(null, context__$1,clause));
+if(cljs.core.truth_(temp__5802__auto__)){
+var next_context = temp__5802__auto__;
+var G__43409 = next_context;
+var G__43410 = clauses__$2;
+var G__43411 = failed_clauses;
+context__$1 = G__43409;
+clauses__$1 = G__43410;
+failed_clauses = G__43411;
+continue;
+} else {
+var G__43412 = context__$1;
+var G__43413 = clauses__$2;
+var G__43414 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(failed_clauses,clause);
+context__$1 = G__43412;
+clauses__$1 = G__43413;
+failed_clauses = G__43414;
+continue;
+}
+}
+break;
+}
+});
+datahike.tools.resolve_clauses = (function datahike$tools$resolve_clauses(resolver,context,clauses){
+while(true){
+if(cljs.core.empty_QMARK_(clauses)){
+return context;
+} else {
+var vec__43261 = datahike.tools.reduce_clauses(resolver,context,clauses);
+var context__$1 = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43261,(0),null);
+var failed_clauses = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43261,(1),null);
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(failed_clauses),cljs.core.count(clauses))){
+var G__43268 = (function(){throw cljs.core.ex_info.cljs$core$IFn$_invoke$arity$2("Cannot resolve any more clauses",new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"clauses","clauses",1454841241),clauses], null))})();
+var fexpr__43267 = taoensso.timbre._log_BANG_.cljs$core$IFn$_invoke$arity$14(taoensso.timbre._STAR_config_STAR_,new cljs.core.Keyword(null,"error","error",-978969032),"datahike.tools",null,227,null,new cljs.core.Keyword(null,"p","p",151049309),new cljs.core.Keyword(null,"auto","auto",-566279492),(new cljs.core.Delay(((function (resolver,context,clauses,G__43268,vec__43261,context__$1,failed_clauses){
+return (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, ["Cannot resolve any more clauses",new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"clauses","clauses",1454841241),clauses], null)], null);
+});})(resolver,context,clauses,G__43268,vec__43261,context__$1,failed_clauses))
+,null)),null,(6),null,null,null);
+return (fexpr__43267.cljs$core$IFn$_invoke$arity$1 ? fexpr__43267.cljs$core$IFn$_invoke$arity$1(G__43268) : fexpr__43267.call(null, G__43268));
+} else {
+var G__43420 = resolver;
+var G__43421 = context__$1;
+var G__43422 = failed_clauses;
+resolver = G__43420;
+context = G__43421;
+clauses = G__43422;
+continue;
+}
+}
+break;
+}
+});
+/**
+ * Create a step function to use with `transduce` for grouping values
+ */
+datahike.tools.group_by_step = (function datahike$tools$group_by_step(f){
+return (function() {
+var G__43424 = null;
+var G__43424__0 = (function (){
+return cljs.core.transient$(cljs.core.PersistentArrayMap.EMPTY);
+});
+var G__43424__1 = (function (dst){
+return cljs.core.persistent_BANG_(dst);
+});
+var G__43424__2 = (function (dst,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(dst,k,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.get.cljs$core$IFn$_invoke$arity$3(dst,k,cljs.core.PersistentVector.EMPTY),x));
+});
+G__43424 = function(dst,x){
+switch(arguments.length){
+case 0:
+return G__43424__0.call(this);
+case 1:
+return G__43424__1.call(this,dst);
+case 2:
+return G__43424__2.call(this,dst,x);
+}
+throw(new Error('Invalid arity: ' + arguments.length));
+};
+G__43424.cljs$core$IFn$_invoke$arity$0 = G__43424__0;
+G__43424.cljs$core$IFn$_invoke$arity$1 = G__43424__1;
+G__43424.cljs$core$IFn$_invoke$arity$2 = G__43424__2;
+return G__43424;
+})()
+});
+/**
+ * This function generates code for a decision tree that for an input expression `input` that has to represent a sequence of growing integers that is a subset of the integers in the sequence `(range length-length)`. Every leaf in the decision tree corresponds to one of the 2^range-length possible subsequences and the `branch-visitor-fn` is called at every leaf with the first argument being the subsequence and the second argument being a mask.
+ */
+datahike.tools.range_subset_tree = (function datahike$tools$range_subset_tree(var_args){
+var G__43292 = arguments.length;
+switch (G__43292) {
+case 3:
+return datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 6:
+return datahike.tools.range_subset_tree.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('')));
+
+}
+});
+
+(datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$3 = (function (range_length,input,branch_visitor_fn){
+if((input instanceof cljs.core.Symbol)){
+return datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$6(range_length,input,branch_visitor_fn,(0),cljs.core.PersistentVector.EMPTY,cljs.core.vec(cljs.core.repeat.cljs$core$IFn$_invoke$arity$2(range_length,null)));
+} else {
+var sym = cljs.core.gensym.cljs$core$IFn$_invoke$arity$0();
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","let","cljs.core/let",-308701135,null),null,(1),null)),(new cljs.core.List(null,cljs.core.vec(cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2((new cljs.core.List(null,sym,null,(1),null)),(new cljs.core.List(null,input,null,(1),null)))))),null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$3(range_length,sym,branch_visitor_fn),null,(1),null))], 0))));
+}
+}));
+
+(datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$6 = (function (range_length,input_symbol,branch_visitor_fn,at,acc_inds,mask){
+if(typeof range_length === 'number'){
+} else {
+throw (new Error("Assert failed: (number? range-length)"));
+}
+
+if((input_symbol instanceof cljs.core.Symbol)){
+} else {
+throw (new Error("Assert failed: (symbol? input-symbol)"));
+}
+
+if(cljs.core.ifn_QMARK_(branch_visitor_fn)){
+} else {
+throw (new Error("Assert failed: (ifn? branch-visitor-fn)"));
+}
+
+if(typeof at === 'number'){
+} else {
+throw (new Error("Assert failed: (number? at)"));
+}
+
+if(cljs.core.vector_QMARK_(acc_inds)){
+} else {
+throw (new Error("Assert failed: (vector? acc-inds)"));
+}
+
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(range_length,at)){
+return (branch_visitor_fn.cljs$core$IFn$_invoke$arity$2 ? branch_visitor_fn.cljs$core$IFn$_invoke$arity$2(acc_inds,mask) : branch_visitor_fn.call(null, acc_inds,mask));
+} else {
+return cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol(null,"if","if",1181717262,null),null,(1),null)),(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","empty?","cljs.core/empty?",1866613644,null),null,(1),null)),(new cljs.core.List(null,input_symbol,null,(1),null))))),null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,(branch_visitor_fn.cljs$core$IFn$_invoke$arity$2 ? branch_visitor_fn.cljs$core$IFn$_invoke$arity$2(acc_inds,mask) : branch_visitor_fn.call(null, acc_inds,mask)),null,(1),null)),(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol(null,"if","if",1181717262,null),null,(1),null)),(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","=","cljs.core/=",-1891498332,null),null,(1),null)),(new cljs.core.List(null,at,null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","first","cljs.core/first",-752535972,null),null,(1),null)),(new cljs.core.List(null,input_symbol,null,(1),null))))),null,(1),null))], 0)))),null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$variadic((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","let","cljs.core/let",-308701135,null),null,(1),null)),(new cljs.core.List(null,cljs.core.vec(cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2((new cljs.core.List(null,input_symbol,null,(1),null)),(new cljs.core.List(null,cljs.core.sequence.cljs$core$IFn$_invoke$arity$1(cljs.core.seq(cljs.core.concat.cljs$core$IFn$_invoke$arity$2((new cljs.core.List(null,new cljs.core.Symbol("cljs.core","rest","cljs.core/rest",-285075455,null),null,(1),null)),(new cljs.core.List(null,input_symbol,null,(1),null))))),null,(1),null)))))),null,(1),null)),cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([(new cljs.core.List(null,datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$6(range_length,input_symbol,branch_visitor_fn,(at + (1)),cljs.core.conj.cljs$core$IFn$_invoke$arity$2(acc_inds,at),cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(mask,at,cljs.core.count(acc_inds))),null,(1),null))], 0)))),null,(1),null)),(new cljs.core.List(null,datahike.tools.range_subset_tree.cljs$core$IFn$_invoke$arity$6(range_length,input_symbol,branch_visitor_fn,(at + (1)),acc_inds,mask),null,(1),null))], 0)))),null,(1),null))], 0))));
+}
+}));
+
+(datahike.tools.range_subset_tree.cljs$lang$maxFixedArity = 6);
+
+datahike.tools.distinct_sorted_seq_QMARK_ = (function datahike$tools$distinct_sorted_seq_QMARK_(cmp,s){
+if(cljs.core.empty_QMARK_(s)){
+return true;
+} else {
+var previous = cljs.core.first(s);
+var s__$1 = cljs.core.rest(s);
+while(true){
+if(cljs.core.empty_QMARK_(s__$1)){
+return true;
+} else {
+var x = cljs.core.first(s__$1);
+if(((cmp.cljs$core$IFn$_invoke$arity$2 ? cmp.cljs$core$IFn$_invoke$arity$2(previous,x) : cmp.call(null, previous,x)) < (0))){
+var G__43447 = x;
+var G__43448 = cljs.core.rest(s__$1);
+previous = G__43447;
+s__$1 = G__43448;
+continue;
+} else {
+return false;
+}
+}
+break;
+}
+}
+});
+/**
+ * Takes a comparator function `cmp` and two sequences `seq-a` and `seq-b` that are both distinct and sorted by `cmp`. Then combines the elements from both sequences to form a new sorted sequence that is distinct. The function distinct-sorted-seq? must return true for all input sequences and the result will also be a sequence for which this function returns true.
+ */
+datahike.tools.merge_distinct_sorted_seqs = (function datahike$tools$merge_distinct_sorted_seqs(cmp,seq_a,seq_b){
+if(cljs.core.empty_QMARK_(seq_a)){
+return seq_b;
+} else {
+if(cljs.core.empty_QMARK_(seq_b)){
+return seq_a;
+} else {
+var a = cljs.core.first(seq_a);
+var b = cljs.core.first(seq_b);
+var i = (cmp.cljs$core$IFn$_invoke$arity$2 ? cmp.cljs$core$IFn$_invoke$arity$2(a,b) : cmp.call(null, a,b));
+if((i < (0))){
+return cljs.core.cons(a,(new cljs.core.LazySeq(null,(function (){
+var G__43354 = cmp;
+var G__43355 = cljs.core.rest(seq_a);
+var G__43356 = seq_b;
+return (datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3 ? datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3(G__43354,G__43355,G__43356) : datahike.tools.merge_distinct_sorted_seqs.call(null, G__43354,G__43355,G__43356));
+}),null,null)));
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(i,(0))){
+return cljs.core.cons(a,(new cljs.core.LazySeq(null,(function (){
+var G__43359 = cmp;
+var G__43360 = cljs.core.rest(seq_a);
+var G__43361 = cljs.core.rest(seq_b);
+return (datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3 ? datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3(G__43359,G__43360,G__43361) : datahike.tools.merge_distinct_sorted_seqs.call(null, G__43359,G__43360,G__43361));
+}),null,null)));
+} else {
+return cljs.core.cons(b,(new cljs.core.LazySeq(null,(function (){
+var G__43367 = cmp;
+var G__43368 = seq_a;
+var G__43369 = cljs.core.rest(seq_b);
+return (datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3 ? datahike.tools.merge_distinct_sorted_seqs.cljs$core$IFn$_invoke$arity$3(G__43367,G__43368,G__43369) : datahike.tools.merge_distinct_sorted_seqs.call(null, G__43367,G__43368,G__43369));
+}),null,null)));
+
+}
+}
+
+}
+}
+});
+
+//# sourceMappingURL=datahike.tools.js.map

package/datahike.tools.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["datahike/tools.cljc"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaA,gCAAA,hCAAMA,wEAAgBC,EAAEC;AAAxB,AAEW,OAACC,uBAAaF,EAAEC;;AAE3B,qCAAA,rCAAME,kFAAqBH;AAA3B,AACE,IAAAI,WAAMJ;AAAN,AAAA,GAAA,AAAAK,6CAAA,AAAA,oDAAAD;AAAA;;AAAA,GAAA,AAAAC,6CAAA,AAAA,kDAAAD;AAAA;;AAAA,AAAA;;;;;AAKF,+BAAA,/BAAME,sEAAeC,KAAKC,YAAYC,aAAaC,gBAAgBC;AAAnE,AACE,GACE,CAAGH,cAAYC;AACf,IAAMG,SAAO,AAACC,mBAAS,gFAAA,WAAAC,3FAACC,6CAAKZ;AAAN,AAA2B,mDAAAW,5CAACE,6DAAMR;GAAaS,iBAAON;IACvEO,MAAI,WAAKC,EAAER;AAAP,AAAc,IAAAS,WAAe,AAACK,6CAAKlB,KAAKY;IAA1BE,WACe,eAAA,dAAKb;IADpBc,WAEeb;IAFfc,WAGeb;IAHfc,WAIeb;AAJf,AAAA,gIAAAS,SAAAC,SAAAC,SAAAC,SAAAC,oDAAAJ,SAAAC,SAAAC,SAAAC,SAAAC,pPAAClB,6DAAAA,2GAAAA;;AADzB,AAME,GAAI,6CAAA,mFAAA,hIAACD,2LAAS,AAACyB,eAAKlB;AAClB,WAAA,AAAA,JAACM,sDAAO,AAAA,iFAAMN;;AADhB,OAAAc,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,qDAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,8EAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,8UAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,+XAAA,KAAA,IAAA,z5BAEQ,AAACb,4CAAIN,gBAAgBF,wGACvB,IAAA,JAACU,QAAM,+GAAA,mFAAA,6DAAA,/PAACa,sDAAOnB,oTACf,IAAA,AAAA,JAACM,wDAAO,+GAAA,mFAAA,8DAAA,hQAACa,sDAAOnB;;;AAZ1B,GAcE,gDAAA,hDAACoB,oDAAO,AAACC,gBAAMtB;AAAQ,MAAO,gDAAA,iDAAA,2CAAA,5IAACuB,iMACe3B;;AAfhD,AAgBQ,wBAAA,gBAAII,hBAAMM,jBAAMkB;;;;;AAe1B,0BAAA,1BAAgBC;AAAhB,AAEW,YAAAC;;AAEX,6BAAA,7BAAgBC;AAAhB,AAEW,OAAU,KAAAD;;AA+CZ,AAAKE,mCAAkBC;AAiChC,AAAA;;;;;;;4BAAA,oCAAAC,hEAAME;AAAN,AAAA,IAAAD,WAAA,AAAA;AAAA,AAAA,QAAAA;KAAA;AAAA,OAAAC;;;KAAA;AAAA,OAAAA,wDAAA,CAAA,UAAA;;;KAAA;AAAA,OAAAA,wDAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;;AAAA,IAAAC,yBAAA;AAAA,AAAA,IAAAC,0BAAA,AAAA;AAAA,AAAA,IAAAC,wBAAA;;AAAA,AAAA,GAAA,CAAAA,wBAAAD;AAAA,AAAA,AAAAD,4BAAA,CAAA,UAAAE;;AAAA,eAAA,CAAAA,wBAAA;;;;AAAA;;;;AAAA,IAAAC,uBAAA,EAAA,CAAA,MAAA,AAAAH,gCAAA,AAAA,KAAAI,qBAAA,AAAAJ,6BAAA,KAAA,IAAA,OAAA;AAAA,AAAA,OAAAD,+DAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAAI;;;;;AAAA,CAAA,0DAAA,1DAAMJ;AAAN,AAAA;;;AAAA,CAAA,0DAAA,1DAAMA,qEASFW;AATJ,AASOA;;;AATP,CAAA,0DAAA,1DAAMX,qEAUFW,EAAEC;AAVN,AAWG,oBAAM,iBAAAC,mBAAIF;AAAJ,AAAA,oBAAAE;AAAAA;;AAAMD;;;AAAZ,AACE,kBAAA,qCAAsBE,EAAEC;AAAxB,AACU,IAAMC,IAAG,AAACC,cAAIF;IACRG,iBAAG,AAACC,cAAIJ;AADd,AAEE,GAAI,AAACK,0BAAUN,EAAEE;AACf,OAACK,8CAAMP,EAAEE,EAAE,iBAAMM,IAAE,AAACC,4CAAIT,EAAEE;AAAf,AACE,GAAI,EAAK,AAACQ,qBAAKF,QAAG,AAACE,qBAAKN;AACtB,OAACO,wDAAWH,EAAEJ;;AACdA;;;;AACf,OAACG,8CAAMP,EAAEE,EAAEE;;;AARzB,AASE,OAACQ,+CAAOC,YAAY,iBAAAd,mBAAIF;AAAJ,AAAA,oBAAAE;AAAAA;;AAAA;;KAAU,AAAC7B,cAAI4B;;AAVvC;;;;AAXH,AAAA,CAAA,iEAAA,jEAAMZ,4EAsBFW,EAAEC,EAAIgB;AAtBV,AAuBG,OAACF,+CAAO1B,0BAAW,iBAAAa,mBAAIF;AAAJ,AAAA,oBAAAE;AAAAA;;AAAA;;KAAU,AAACgB,eAAKjB,EAAEgB;;;AAvBxC;AAAA,CAAA,8CAAA,WAAAtB,zDAAMN;AAAN,AAAA,IAAAO,WAAA,AAAAjC,gBAAAgC;IAAAA,eAAA,AAAAE,eAAAF;IAAAG,WAAA,AAAAnC,gBAAAgC;IAAAA,eAAA,AAAAE,eAAAF;AAAA,AAAA,IAAAI,qBAAA;AAAA,AAAA,OAAAA,wDAAAH,SAAAE,SAAAH;;;AAAA,CAAA,oDAAA,pDAAMN;;AAAN,AAyBA,uBAAA,vBAAM8B,sDAAOC;AAAb,AACE,UAAA,NAAMC;AAAN,AACoB,QAAA,SAAQ,AAAG,KAAAtC;;IACzBuC,QAAM,AAACD;IACPE,SAAO,CAACH,kCAAAA,oCAAAA;IACRI,MAAI,AAACH;IACLI,IAAE,iBAAA,hBAAW,CAAGD,MAAIF;AAL1B,AAAA,kDAAA,2DAAA,PAOQC,uDACFE;;AAER,8BAAA,9BAAMC;AAAN,AAAA;;AA6BA,gCAAA,hCAAOC,wEACJC,SAASC,QAAQC;AADpB,AAEE,IAAOD,cAAQA;IACRC,cAAQA;qBADf,jBAEOC;;AAFP,AAGE,GAAI,AAACC,uBAAOF;AAAZ,0FACGD,YAAQE;;AACT,IAAAE,aAAyBH;IAAzBI,aAAA,AAAA7D,cAAA4D;IAAAE,eAAA,AAAAxE,gBAAAuE;IAAAA,iBAAA,AAAArC,eAAAqC;aAAAC,TAAOC;kBAAPF,dAAgBJ;AAAhB,AACE,IAAAO,qBAAsB,CAACT,yCAAAA,6DAAAA,tBAASC,0CAAAA,9BAAQO,0CAAAA;AAAxC,AAAA,oBAAAC;AAAA,mBAAAA,fAASC;AAAT,AACE,eAAOA;eAAaR;eAAQC;;;;;;AAC5B,eAAOF;eAAQC;eAAQ,AAAC3D,6CAAK4D,eAAeK;;;;;;;;;;AAEtD,iCAAA,jCAAMG,0EAAiBX,SAASC,QAAQC;;AAAxC,AACE,GAAI,AAACE,uBAAOF;AACVD;;AACA,IAAAW,aAA+B,AAACb,8BAAeC,SACAC,QACAC;kBAF/C,AAAApE,4CAAA8E,WAAA,IAAA,zEAAOX;qBAAP,AAAAnE,4CAAA8E,WAAA,IAAA,5EAAeT;AAAf,AAGE,GAAI,AAAChF,6CAAE,AAAC4B,gBAAMoD,gBACP,AAACpD,gBAAMmD;AACZ,IAAAW,WAAA,kBAAA,AAAA7D,gDAAA,kCAAA,2CAAA,2DACiBkD;IADjBY,eAAA,AAAAC,0DAAAC,mCAAA,uDAAA,iBAAA,KAAA,IAAA,KAAA,8CAAA,qDAAA,KAAAC,gBAAA;;AAAA,AAAA,0FAAA,kCAAA,2CAAA,2DACiBf;;CADjB,OAAA,KAAA,IAAA,KAAA,KAAA;AAAA,AAAA,QAAAY,6CAAAA,2CAAAD,YAAAC,wBAAAD;;AAEA,eAAOb;eAASC;eAAQE;;;;;;;;;;AAEhC;;;+BAAA,/BAAMe,sEAEH1B;AAFH,AAGE;;;AAAA,AACM,4BAAA,rBAAC2B;;6BACHC;AAFJ,AAES,OAACC,2BAAYD;;6BAClBA,IAAItG;AAHR,AAIG,IAAM2D,IAAE,CAACe,kCAAAA,qCAAAA,LAAE1E,kBAAAA;AAAX,AACE,OAACwG,oDAAOF,IAAI3C,EAAE,AAAClC,6CAAK,kDAAA,lDAACyC,4CAAIoC,IAAI3C,oCAAM3D;;oBAFpCsG,IAAItG;;;;;6BAAJsG;;6BAAAA,IAAItG;;;;;;;;;;AAIV,AAAA;;;mCAAA,2CAAAyC,9EAAMiE;AAAN,AAAA,IAAAD,WAAA,AAAA;AAAA,AAAA,QAAAA;KAAA;AAAA,OAAAC,+DAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;KAAA;AAAA,OAAAA,+DAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;;AAAA,MAAA,KAAAC,MAAA,CAAA,8DAAA,AAAA;;;;;AAAA,CAAA,iEAAA,jEAAMD,4EAEFE,aAAaC,MAAMC;AAFvB,AAGG,GAAI,kBAAAC,jBAASF;AACX,2GAAA,IAAA,xGAACG,+DAAkBJ,aACAC,MACAC,uDAGA,AAACG,cAAI,4DAAA,5DAACC,+CAAON;;AAChC,IAAMO,MAAI,AAACC;AAAX,AAAA,OAAA1F,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,wEAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAoF,cAAA,AAAAvF,iDAAA,AAAAC,cAAA,AAAAC,+CAAA,KAAAC,eAAA,SAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,WAAA,KAAA,IAAA,WAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,wGAAA,KAAA,IAAA,9QACUsF,6CAAKN,qHACT,AAACG,+DAAkBJ,aAAaO,IAAIL;;;;AAZ/C,CAAA,iEAAA,jEAAMJ,4EAaFE,aAAaS,aAAaP,kBAAkBQ,GAAGC,SAASC;AAb5D,AAAA,GAcU,OAASZ;AAdnB;AAAA,AAAA,MAAA,KAAAD,MAAA;;;AAAA,GAeU,yBAAAI,xBAASM;AAfnB;AAAA,AAAA,MAAA,KAAAV,MAAA;;;AAAA,GAgBU,AAACc,qBAAKX;AAhBhB;AAAA,AAAA,MAAA,KAAAH,MAAA;;;AAAA,GAiBU,OAASW;AAjBnB;AAAA,AAAA,MAAA,KAAAX,MAAA;;;AAAA,GAkBU,AAACe,wBAAQH;AAlBnB;AAAA,AAAA,MAAA,KAAAZ,MAAA;;;AAmBG,GAAI,AAACtG,6CAAEuG,aAAaU;AAClB,QAACR,kDAAAA,iEAAAA,jBAAkBS,8CAAAA,rCAASC,8CAAAA;;AAD9B,OAAA9F,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,qDAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,+CAAA,KAAAC,eAAA,KAAA,AAAA,8EAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,kBAAA,KAAA,IAAA,UAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,sKAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,qDAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,qEAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,QAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,+CAAA,KAAAC,eAAA,KAAA,AAAA,4EAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,kBAAA,KAAA,IAAA,UAAA,KAAA,IAAA,eAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,sDAAA,KAAAC,eAAA,KAAA,AAAA,wEAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAoF,cAAA,AAAAvF,iDAAA,AAAAC,cAAA,AAAAC,+CAAA,KAAAC,eAAA,kBAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,KAAA,AAAAH,iDAAA,AAAAC,cAAA,AAAAC,+CAAA,KAAAC,eAAA,KAAA,AAAA,0EAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,kBAAA,KAAA,IAAA,UAAA,KAAA,IAAA,WAAA,KAAA,IAAA,yDAAA,KAAAA,eAAA,uQAAA,KAAA,IAAA,eAAA,KAAA,IAAA,OAAA,KAAAA,eAAA,0IAAA,KAAA,IAAA,eAAA,KAAA,IAAA,tlFAEgBwF,2HACV,CAACP,kDAAAA,iEAAAA,jBAAkBS,8CAAAA,rCAASC,8CAAAA,whBACrBF,0VAAWD,uiBACVA,gTAAoBA,+IACxB,AAACL,+DAAkBJ,aACAS,aACAP,kBACA,MAAA,LAAKQ,UACL,AAAC7F,6CAAK8F,SAASD,IACf,AAACtD,8CAAMwD,KAAKF,GAAG,AAACrF,gBAAMsF,6EAC3C,AAACP,+DAAkBJ,aACAS,aACAP,kBACA,MAAA,LAAKQ,UACLC,SACAC;;;;AApC9B,CAAA,2DAAA,3DAAMd;;AAAN,AAsCA,4CAAA,5CAAMiB,gGAAsBC,IAAIC;AAAhC,AACE,GAAI,AAACvC,uBAAOuC;AAAZ;;AAEE,IAAOC,WAAS,AAAC7G,gBAAM4G;IAChBA,QAAE,AAACE,eAAKF;;AADf,AAEE,GAAI,AAACvC,uBAAOuC;AAAZ;;AAEE,IAAM7H,IAAE,AAACiB,gBAAM4G;AAAf,AACE,GAAI,oHAAA,nHAAM,CAACD,oCAAAA,gDAAAA,dAAIE,6BAAAA,pBAAS9H,6BAAAA;AACtB,eAAOA;eAAE,AAAC+H,eAAKF;;;;;AADjB;;;;;;;AAIV;;;4CAAA,5CAAMG,gGAEHJ,IAAIK,MAAMC;AAFb,AAGE,GACE,AAAC5C,uBAAO2C;AAAOC;;AADjB,GAEE,AAAC5C,uBAAO4C;AAAOD;;AAFjB,AAIE,IAAM3E,IAAE,AAACrC,gBAAMgH;IACT1E,IAAE,AAACtC,gBAAMiH;IACTC,IAAE,CAACP,oCAAAA,yCAAAA,PAAItE,sBAAAA,pBAAEC,sBAAAA;AAFf,AAGE,GACE,KAAA,JAAG4E;AAAK,OAAC3D,eACAlB,EAAE,KAAA8E,kBAAA,KAAA;AAAA,AACC,IAAAC,WAA4BT;IAA5BU,WAAgC,AAACP,eAAKE;IAAtCM,WAA6CL;AAA7C,AAAA,0JAAAG,SAAAC,SAAAC,iEAAAF,SAAAC,SAAAC,vPAACP,0EAAAA,sGAAAA;GADF,KAAA;;AAFb,GAIE,+CAAA,/CAAC3H,6CAAE8H;AAAK,OAAC3D,eACAlB,EAAE,KAAA8E,kBAAA,KAAA;AAAA,AACC,IAAAI,WAA4BZ;IAA5Ba,WAAgC,AAACV,eAAKE;IAAtCS,WAA6C,AAACX,eAAKG;AAAnD,AAAA,0JAAAM,SAAAC,SAAAC,iEAAAF,SAAAC,SAAAC,vPAACV,0EAAAA,sGAAAA;GADF,KAAA;;AALb,AAOQ,OAACxD,eACAjB,EAAE,KAAA6E,kBAAA,KAAA;AAAA,AACC,IAAAO,WAA4Bf;IAA5BgB,WAAgCX;IAAhCY,WAAsC,AAACd,eAAKG;AAA5C,AAAA,0JAAAS,SAAAC,SAAAC,iEAAAF,SAAAC,SAAAC,vPAACb,0EAAAA,sGAAAA;GADF,KAAA","names":["datahike.tools/combine-hashes","x","y","cljs.core/hash-combine","datahike.tools/-match-vector-class","G__43094","cljs.core._EQ_","datahike.tools/-match-vector","path","pattern-pos","pattern-size","pattern-symbols","pairs","groups","cljs.core/group-by","p1__43098#","cljs.core.comp","cljs.core.nth","cljs.core/first","sub","p","G__43100","G__43101","G__43102","G__43103","G__43104","cljs.core.conj","cljs.core.sequence","cljs.core/seq","cljs.core.concat","cljs.core/List","cljs.core/keys","cljs.core.mapcat","cljs.core.not_EQ_","cljs.core/count","cljs.core.ex_info","cljs.core/second","datahike.tools/get-date","js/Date","datahike.tools/get-time-ms","datahike.tools/throwable-promise","cljs.core.async/promise-chan","var_args","G__43127","datahike.tools/deep-merge","args-arr__5751__auto__","len__5726__auto__","i__5727__auto__","argseq__5752__auto__","cljs.core/IndexedSeq","seq43121","G__43122","cljs.core/next","G__43123","self__5711__auto__","a","b","or__5002__auto__","m","e","k","cljs.core/key","v'","cljs.core/val","cljs.core/contains?","cljs.core.assoc","v","cljs.core.get","cljs.core/map?","datahike.tools.deep_merge","cljs.core.reduce","merge-entry","more","cljs.core/cons","datahike.tools/timed","f","now","start","result","end","t","datahike.tools/get-hostname","datahike.tools/reduce-clauses","resolver","context","clauses","failed-clauses","cljs.core/empty?","vec__43254","seq__43255","first__43256","clause","temp__5802__auto__","next-context","datahike.tools/resolve-clauses","vec__43261","G__43268","fexpr__43267","taoensso.timbre._log_BANG_","taoensso.timbre/*config*","cljs.core/Delay","datahike.tools/group-by-step","cljs.core/transient","dst","cljs.core/persistent!","cljs.core.assoc_BANG_","G__43292","datahike.tools/range-subset-tree","js/Error","range-length","input","branch-visitor-fn","cljs.core/Symbol","datahike.tools.range_subset_tree","cljs.core/vec","cljs.core.repeat","sym","cljs.core.gensym","input-symbol","at","acc-inds","mask","cljs.core/ifn?","cljs.core/vector?","datahike.tools/distinct-sorted-seq?","cmp","s","previous","cljs.core/rest","datahike.tools/merge-distinct-sorted-seqs","seq-a","seq-b","i","cljs.core/LazySeq","G__43354","G__43355","G__43356","G__43359","G__43360","G__43361","G__43367","G__43368","G__43369"],"sourcesContent":["(ns ^:no-doc datahike.tools\n  (:require\n   [superv.async :refer [throw-if-exception-]]\n   [clojure.core.async.impl.protocols :as async-impl]\n   [hasch.core :refer [uuid]]\n   [clojure.core.async :as async]\n   #?(:clj [clojure.java.io :as io])\n   [taoensso.timbre :as log])\n  #?(:cljs (:require-macros [datahike.tools :refer [raise]]))\n  #?(:clj (:import [java.util Properties UUID Date]\n                   [java.util.concurrent CompletableFuture]\n                   [java.net InetAddress])))\n\n(defn combine-hashes [x y]\n  #?(:clj  (clojure.lang.Util/hashCombine x y)\n     :cljs (hash-combine x y)))\n\n(defn -match-vector-class [x]\n  (case x\n    _ :negative\n    * :any\n    :positive))\n\n(defn -match-vector [path pattern-pos pattern-size pattern-symbols pairs]\n  (cond\n    (< pattern-pos pattern-size)\n    (let [groups (group-by (comp -match-vector-class #(nth % pattern-pos) first) pairs)\n          sub (fn [p pairs] (-match-vector (conj path p)\n                                           (inc pattern-pos)\n                                           pattern-size\n                                           pattern-symbols\n                                           pairs))]\n      (if (= [:any] (keys groups))\n        (sub '* (:any groups))\n        `(if ~(nth pattern-symbols pattern-pos)\n           ~(sub 1 (mapcat groups [:positive :any]))\n           ~(sub '_ (mapcat groups [:negative :any])))))\n\n    (not= 1 (count pairs)) (throw (ex-info \"There should be exactly one expression at leaf\"\n                                           {:path path}))\n    :else (-> pairs first second)))\n\n(defmacro match-vector [input-vector & pattern-expr-pairs]\n  {:pre [(sequential? pattern-expr-pairs)\n         (even? (count pattern-expr-pairs))]}\n  (let [pairs (partition 2 pattern-expr-pairs)\n        patterns (map first pairs)\n        _ (assert (every? sequential? patterns))\n        pattern-sizes (into #{} (map count) patterns)\n        _ (assert (= 1 (count pattern-sizes)))\n        pattern-size (first pattern-sizes)\n        symbols (repeatedly pattern-size gensym)]\n    `(let [[~@symbols] ~input-vector]\n       ~(-match-vector [] 0 pattern-size symbols pairs))))\n\n(defn ^:dynamic get-date []\n  #?(:clj (Date.)\n     :cljs (js/Date.)))\n\n(defn ^:dynamic get-time-ms []\n  #?(:clj (.getTime (Date.))\n     :cljs (.getTime (js/Date.))))\n\n(defmacro raise\n  \"Logging an error and throwing an exception with message and structured data.\n   Arguments:\n   - Any number of strings that describe the error\n   - Last argument is a map of data that helps understanding the source of the error\"\n  [& fragments]\n  (let [msgs (butlast fragments)\n        data (last fragments)]\n    (list `(log/log! :error :p ~fragments ~{:?line (:line (meta &form))})\n          `(throw (ex-info (str ~@(map (fn [m#] (if (string? m#) m# (list 'pr-str m#))) msgs)) ~data)))))\n\n;; adapted from https://clojure.atlassian.net/browse/CLJ-2766\n#?(:clj\n   (defn throwable-promise\n     \"Returns a promise object that can be read with deref/@, and set, once only, with deliver. Calls to deref/@ prior to delivery will block, unless the variant of deref with timeout is used. All subsequent derefs will return the same delivered value without blocking. Exceptions delivered to the promise will throw on deref. \n   \n      Also supports core.async take! to optionally consume values without blocking the reader thread.\"\n     []\n     (let [cf (CompletableFuture.)\n           p (async/promise-chan)]\n       (reify\n         clojure.lang.IDeref\n         (deref [_] (throw-if-exception- (try (.get cf) (catch Throwable t t))))\n         clojure.lang.IBlockingDeref\n         (deref [_ timeout-ms timeout-val]\n           (if-let [v (try (.get cf timeout-ms java.util.concurrent.TimeUnit/MILLISECONDS) (catch Throwable t t))]\n             (throw-if-exception- v)\n             timeout-val))\n         clojure.lang.IPending\n         (isRealized [_] (.isDone cf))\n         clojure.lang.IFn\n         (invoke [this x]\n           (if (instance? Throwable x)\n             (.completeExceptionally cf x)\n             (.complete cf x))\n           (if-not (nil? x) (async/put! p x) (async/close! p))\n           this)\n         async-impl/ReadPort\n         (take! [_this handler] (async-impl/take! p handler))\n         async-impl/WritePort\n         (put! [_ val handler]\n           (if (instance? Throwable val)\n             (.completeExceptionally cf val)\n             (.complete cf val))\n           (async-impl/put! p val handler)))))\n   :cljs (def throwable-promise async/promise-chan))\n\n#?(:clj\n   (defn get-version\n     \"Retrieves the current version of a dependency. Thanks to https://stackoverflow.com/a/33070806/10978897\"\n     [dep]\n     (let [path (str \"META-INF/maven/\" (or (namespace dep) (name dep))\n                     \"/\" (name dep) \"/pom.properties\")\n           props (io/resource path)]\n       (when props\n         (with-open [stream (io/input-stream props)]\n           (let [props (doto (Properties.) (.load stream))]\n             (.getProperty props \"version\")))))))\n\n#?(:clj (def datahike-version (or (get-version 'io.replikativ/datahike) \"DEVELOPMENT\")))\n\n#?(:clj (def hitchhiker-tree-version\n          (try (get-version 'io.replikativ/hitchhiker-tree)\n               (catch Exception _ nil))))\n\n#?(:clj (def persistent-set-version (get-version 'io.replikativ/persistent-sorted-set)))\n\n#?(:clj (def konserve-version (get-version 'io.replikativ/konserve)))\n\n#?(:clj\n   (defmacro meta-data []\n     `{:datahike/version ~datahike-version\n       :konserve/version ~konserve-version\n       :hitchhiker.tree/version ~hitchhiker-tree-version\n       :persistent.set/version ~persistent-set-version\n       :datahike/id (uuid)\n       :datahike/created-at (get-date)}))\n\n(defn deep-merge\n  \"Recursively merges maps together. If all the maps supplied have nested maps\n  under the same keys, these nested maps are merged. Otherwise the value is\n  overwritten, as in `clojure.core/merge`.\n\n  Copied from weavejester/medley 1.3.0\"\n  {:arglists '([& maps])\n   :added    \"1.1.0\"}\n  ([])\n  ([a] a)\n  ([a b]\n   (when (or a b)\n     (letfn [(merge-entry [m e]\n               (let [k  (key e)\n                     v' (val e)]\n                 (if (contains? m k)\n                   (assoc m k (let [v (get m k)]\n                                (if (and (map? v) (map? v'))\n                                  (deep-merge v v')\n                                  v')))\n                   (assoc m k v'))))]\n       (reduce merge-entry (or a {}) (seq b)))))\n  ([a b & more]\n   (reduce deep-merge (or a {}) (cons b more))))\n\n(defn timed [f]\n  (let [now #?(:clj #(. System (nanoTime))\n               :cljs #(* 1000 (. (js/Date.) (getTime))))\n        start (now)\n        result (f)\n        end (now)\n        t (/ (double (- end start))\n             1000000.0)]\n    {:res result\n     :t t}))\n\n(defn get-hostname []\n  #?(:clj (.getHostAddress (InetAddress/getLocalHost))\n     :cljs \"\" #_(raise \"Not supported.\" {:type :hostname-not-supported})))\n\n#?(:clj (def datahike-logo (slurp (io/resource \"datahike-logo.txt\"))))\n\n(defmacro with-destructured-vector [v & var-expr-pairs]\n  {:pre [(even? (count var-expr-pairs))]}\n  (let [pairs (partition 2 var-expr-pairs)\n        vars (mapv first pairs)\n        vsym (gensym)\n        nsym (gensym)\n        generate (fn generate [acc pairs]\n                   (let [i (count acc)]\n                     `(if (<= ~nsym ~i)\n                        ~acc\n                        ~(if (empty? pairs)\n                           `(throw (ex-info \"Pattern mismatch\"\n                                            {:input ~vsym\n                                             :pattern (quote ~var-expr-pairs)}))\n                           (let [[[_ expr] & pairs] pairs\n                                 g (gensym)]\n                             `(let [~g ~expr]\n                                ~(generate (conj acc g) pairs)))))))]\n    `(let [~vsym ~v\n           ~nsym (count ~vsym)\n           ~vars ~vsym]\n       ~(generate [] pairs))))\n\n(defn- reduce-clauses\n  [resolver context clauses]\n  (loop [context context\n         clauses clauses\n         failed-clauses []]\n    (if (empty? clauses)\n      [context failed-clauses]\n      (let [[clause & clauses] clauses]\n        (if-let [next-context (resolver context clause)]\n          (recur next-context clauses failed-clauses)\n          (recur context clauses (conj failed-clauses clause)))))))\n\n(defn resolve-clauses [resolver context clauses]\n  (if (empty? clauses)\n    context\n    (let [[context failed-clauses] (reduce-clauses resolver\n                                                   context\n                                                   clauses)]\n      (if (= (count failed-clauses)\n             (count clauses))\n        (raise \"Cannot resolve any more clauses\"\n               {:clauses clauses})\n        (recur resolver context failed-clauses)))))\n\n(defn group-by-step\n  \"Create a step function to use with `transduce` for grouping values\"\n  [f]\n  (fn\n    ([] (transient {}))\n    ([dst] (persistent! dst))\n    ([dst x]\n     (let [k (f x)]\n       (assoc! dst k (conj (get dst k []) x))))))\n\n(defn range-subset-tree\n  \"This function generates code for a decision tree that for an input expression `input` that has to represent a sequence of growing integers that is a subset of the integers in the sequence `(range length-length)`. Every leaf in the decision tree corresponds to one of the 2^range-length possible subsequences and the `branch-visitor-fn` is called at every leaf with the first argument being the subsequence and the second argument being a mask.\"\n  ([range-length input branch-visitor-fn]\n   (if (symbol? input)\n     (range-subset-tree range-length\n                        input\n                        branch-visitor-fn\n                        0\n                        []\n                        (vec (repeat range-length nil)))\n     (let [sym (gensym)]\n       `(let [~sym ~input]\n          ~(range-subset-tree range-length sym branch-visitor-fn)))))\n  ([range-length input-symbol branch-visitor-fn at acc-inds mask]\n   {:pre [(number? range-length)\n          (symbol? input-symbol)\n          (ifn? branch-visitor-fn)\n          (number? at)\n          (vector? acc-inds)]}\n   (if (= range-length at)\n     (branch-visitor-fn acc-inds mask)\n     `(if (empty? ~input-symbol)\n        ~(branch-visitor-fn acc-inds mask)\n        (if (= ~at (first ~input-symbol))\n          (let [~input-symbol (rest ~input-symbol)]\n            ~(range-subset-tree range-length\n                                input-symbol\n                                branch-visitor-fn\n                                (inc at)\n                                (conj acc-inds at)\n                                (assoc mask at (count acc-inds))))\n          ~(range-subset-tree range-length\n                              input-symbol\n                              branch-visitor-fn\n                              (inc at)\n                              acc-inds\n                              mask))))))\n\n(defn distinct-sorted-seq? [cmp s]\n  (if (empty? s)\n    true\n    (loop [previous (first s)\n           s (rest s)]\n      (if (empty? s)\n        true\n        (let [x (first s)]\n          (if (neg? (cmp previous x))\n            (recur x (rest s))\n            false))))))\n\n(defn merge-distinct-sorted-seqs\n  \"Takes a comparator function `cmp` and two sequences `seq-a` and `seq-b` that are both distinct and sorted by `cmp`. Then combines the elements from both sequences to form a new sorted sequence that is distinct. The function distinct-sorted-seq? must return true for all input sequences and the result will also be a sequence for which this function returns true.\"\n  [cmp seq-a seq-b]\n  (cond\n    (empty? seq-a) seq-b\n    (empty? seq-b) seq-a\n    :else\n    (let [a (first seq-a)\n          b (first seq-b)\n          i (cmp a b)]\n      (cond\n        (< i 0) (cons\n                 a (lazy-seq\n                    (merge-distinct-sorted-seqs cmp (rest seq-a) seq-b)))\n        (= i 0) (cons\n                 a (lazy-seq\n                    (merge-distinct-sorted-seqs cmp (rest seq-a) (rest seq-b))))\n        :else (cons\n               b (lazy-seq\n                  (merge-distinct-sorted-seqs cmp seq-a (rest seq-b))))))))\n"]}