datahike 0.8.1900 → 0.8.1902

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (134) hide show
  1. package/boring.core.js +2 -2
  2. package/boring.data.js +6 -6
  3. package/boring.options.js +16 -16
  4. package/boring.reader.js +4 -4
  5. package/boring.writer.js +2 -2
  6. package/browser/datahike.js +3785 -3779
  7. package/cljs.cache.js +9 -9
  8. package/cljs.cache.wrapped.js +7 -7
  9. package/cljs.core.async.impl.channels.js +8 -8
  10. package/cljs.core.async.impl.dispatch.js +3 -3
  11. package/cljs.core.async.impl.ioc_helpers.js +2 -2
  12. package/cljs.core.async.impl.timers.js +3 -3
  13. package/cljs.core.async.js +16 -16
  14. package/cljs.core.js +321 -321
  15. package/cljs.reader.js +10 -10
  16. package/cljs.spec.alpha.js +74 -74
  17. package/cljs.tools.reader.edn.js +26 -26
  18. package/cljs.tools.reader.impl.commons.js +7 -7
  19. package/cljs.tools.reader.impl.errors.js +9 -9
  20. package/cljs.tools.reader.impl.inspect.js +4 -4
  21. package/cljs.tools.reader.impl.utils.js +2 -2
  22. package/cljs.tools.reader.js +2 -2
  23. package/cljs.tools.reader.reader_types.js +1 -1
  24. package/cljs_node_io.core.js +9 -9
  25. package/cljs_node_io.file.js +19 -19
  26. package/cljs_node_io.fs.js +1 -1
  27. package/clojure.data.js +14 -14
  28. package/clojure.set.js +1 -1
  29. package/clojure.string.js +11 -11
  30. package/clojure.walk.js +3 -3
  31. package/datahike.api.impl.js +31 -31
  32. package/datahike.api.js +5 -5
  33. package/datahike.array.js +8 -8
  34. package/datahike.attr_preds.js +1 -1
  35. package/datahike.backfill.effects.js +3 -3
  36. package/datahike.bitemporal.predicate.js +1 -1
  37. package/datahike.config.js +49 -49
  38. package/datahike.connections.js +3 -3
  39. package/datahike.connector.js +75 -75
  40. package/datahike.constants.js +21 -21
  41. package/datahike.core.js +1 -1
  42. package/datahike.datom.js +22 -22
  43. package/datahike.db.interface.js +11 -11
  44. package/datahike.db.js +93 -93
  45. package/datahike.db.search.js +49 -49
  46. package/datahike.db.transaction.js +11 -11
  47. package/datahike.db.utils.js +48 -48
  48. package/datahike.dependency_tracking.js +2 -2
  49. package/datahike.env.js +4 -4
  50. package/datahike.gc.js +12 -12
  51. package/datahike.gc_roots.js +2 -2
  52. package/datahike.impl.entity.js +12 -12
  53. package/datahike.index.interface.js +13 -13
  54. package/datahike.index.js +1 -1
  55. package/datahike.index.persistent_set.js +153 -153
  56. package/datahike.index.secondary.js +5 -5
  57. package/datahike.js.api.js +258 -258
  58. package/datahike.js.convert.js +1 -1
  59. package/datahike.lru.js +7 -7
  60. package/datahike.metrics.js +10 -10
  61. package/datahike.online_gc.js +2 -2
  62. package/datahike.optimistic.js +12 -12
  63. package/datahike.pull_api.js +6 -6
  64. package/datahike.query.analyze.js +4 -4
  65. package/datahike.query.cancel.js +2 -0
  66. package/datahike.query.estimate.js +1 -1
  67. package/datahike.query.execute.js +7 -8
  68. package/datahike.query.ir.js +5 -5
  69. package/datahike.query.js +1395 -1388
  70. package/datahike.query.logical.js +2 -2
  71. package/datahike.query.lower.js +2 -2
  72. package/datahike.query.plan.js +12 -12
  73. package/datahike.query.relation.js +2 -2
  74. package/datahike.query.resolve.js +2 -2
  75. package/datahike.query_stats.js +1 -1
  76. package/datahike.readers.js +10 -10
  77. package/datahike.schema.js +48 -48
  78. package/datahike.schema_cache.js +3 -3
  79. package/datahike.store.js +56 -56
  80. package/datahike.tools.js +5 -5
  81. package/datahike.tx_preds.js +1 -1
  82. package/datahike.versioning.js +4 -4
  83. package/datahike.writer.js +836 -836
  84. package/datahike.writing.js +52 -52
  85. package/datalog.parser.impl.js +4 -4
  86. package/datalog.parser.impl.proto.js +1 -1
  87. package/datalog.parser.js +1 -1
  88. package/datalog.parser.pull.js +3 -3
  89. package/datalog.parser.type.js +27 -27
  90. package/fress.impl.adler32.js +3 -3
  91. package/fress.impl.bigdec.js +2 -2
  92. package/fress.impl.buffer.js +4 -4
  93. package/fress.impl.raw_input.js +1 -1
  94. package/fress.impl.raw_output.js +3 -3
  95. package/fress.impl.table.js +1 -1
  96. package/fress.reader.js +14 -14
  97. package/fress.util.js +10 -10
  98. package/fress.writer.js +23 -23
  99. package/geheimnis.aes.js +1 -1
  100. package/hasch.benc.js +3 -3
  101. package/hasch.core.js +6 -6
  102. package/hasch.platform.js +17 -17
  103. package/is.simm.partial_cps.sequence.js +5 -5
  104. package/kabel/datahike.js +5059 -5054
  105. package/konserve.compressor.js +16 -16
  106. package/konserve.core.js +47 -47
  107. package/konserve.encryptor.js +17 -17
  108. package/konserve.gc.js +1 -1
  109. package/konserve.gc_guard.js +1 -1
  110. package/konserve.impl.defaults.js +14 -14
  111. package/konserve.impl.storage_layout.js +2 -2
  112. package/konserve.memory.js +1 -1
  113. package/konserve.metrics.js +6 -6
  114. package/konserve.node_filestore.js +604 -604
  115. package/konserve.protocols.js +7 -7
  116. package/konserve.serializers.js +17 -17
  117. package/konserve.store.js +90 -90
  118. package/konserve.tiered.js +10 -10
  119. package/konserve.utils.js +6 -6
  120. package/org.replikativ.persistent_sorted_set.branch.js +3 -3
  121. package/org.replikativ.persistent_sorted_set.btset.js +364 -364
  122. package/org.replikativ.persistent_sorted_set.fressian.js +5 -5
  123. package/org.replikativ.persistent_sorted_set.impl.boundary.js +1 -1
  124. package/org.replikativ.persistent_sorted_set.js +1 -1
  125. package/org.replikativ.persistent_sorted_set.leaf.js +1 -1
  126. package/org.replikativ.persistent_sorted_set.util.js +1 -1
  127. package/package.json +1 -1
  128. package/remote/api.generated.d.ts +7 -1
  129. package/replikativ.logging.js +1 -1
  130. package/replikativ.metrics.js +1 -1
  131. package/s3/datahike.js +4548 -4543
  132. package/superv.async.js +24 -24
  133. package/tailrecursion.priority_map.js +14 -14
  134. package/taoensso.trove.console.js +1 -1
@@ -1,6 +1,6 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");require("./org.replikativ.persistent_sorted_set.impl.nodes.js");require("./fress.api.js");require("./org.replikativ.persistent_sorted_set.leaf.js");require("./org.replikativ.persistent_sorted_set.branch.js");require("./org.replikativ.persistent_sorted_set.btset.js");
2
- 'use strict';var rG,pma,qma,sma;$CLJS.qG=function(a,b){return $CLJS.Iy(a,b)};rG=function(a){if(a!=null&&a.So!=null)a=a.So(a);else{var b=rG[$CLJS.ab(a==null?null:a)];if(b!=null)a=b.g?b.g(a):b.call(null,a);else if(b=rG._,b!=null)a=b.g?b.g(a):b.call(null,a);else throw $CLJS.Wb("PBoundary.-descriptor",a);}return a};
3
- pma=function(a){if(a.address==null)throw $CLJS.yl("PSS root must be flushed before serialization",new $CLJS.T(null,1,[$CLJS.bn,$CLJS.oma],null));var b=a.K,c=function(){var d=$CLJS.PB.g(b);return $CLJS.u(d)?rG(d):null}();a=new $CLJS.T(null,5,[$CLJS.Kk,$CLJS.Af(a),$CLJS.nG,a.address,$CLJS.en,a.U,$CLJS.QB,$CLJS.QB.g(b),$CLJS.fC,function(){var d=$CLJS.fC.g(b);return $CLJS.u(d)?d:0}()],null);a=$CLJS.u($CLJS.pG.g(b))?$CLJS.ck.i(a,$CLJS.pG,$CLJS.pG.g(b)):a;return $CLJS.u(c)?$CLJS.ck.i(a,$CLJS.PB,c):a};
4
- qma=function(a){var b=a.K;a=function(){var d=$CLJS.PB.g(b);return $CLJS.u(d)?rG(d):null}();var c=new $CLJS.T(null,2,[$CLJS.QB,$CLJS.QB.g(b),$CLJS.fC,function(){var d=$CLJS.fC.g(b);return $CLJS.u(d)?d:0}()],null);c=$CLJS.u($CLJS.pG.g(b))?$CLJS.ck.i(c,$CLJS.pG,$CLJS.pG.g(b)):c;return $CLJS.u(a)?$CLJS.ck.i(c,$CLJS.PB,a):c};
5
- $CLJS.rma=function(a){var b=a.ya;if(b==null)return null;for(var c=a.keys.length,d=a.level===1,e=0,f=$CLJS.nh;;){if(e>=c)return $CLJS.af(f)>0?f:null;var g=b[e];if(g==null){var h=f;e+=1;f=h}else h=e+1,f=$CLJS.ck.i(f,e,new $CLJS.T(null,4,[$CLJS.en,$CLJS.en.g(g),$CLJS.SB,$CLJS.SB.g(g),$CLJS.WB,d?$CLJS.lD($CLJS.WB.g(g)):$CLJS.WB.g(g),$CLJS.cC,a.keys[e]],null)),e=h}};
6
- sma=function(a){var b=$CLJS.Mo.l;if(a instanceof $CLJS.mD){var c=$CLJS.rma(a);var d=new $CLJS.T(null,4,[$CLJS.Hp,a.ij(null),$CLJS.xp,$CLJS.Hi(a.keys),$CLJS.$B,$CLJS.Hi(a.ua),$CLJS.XB,a.tc],null);d=a.pa!=null?$CLJS.ck.i(d,$CLJS.SB,a.pa):d;c=$CLJS.u(c)?$CLJS.ck.i(d,$CLJS.sm,c):d}else c=new $CLJS.T(null,1,[$CLJS.xp,$CLJS.Hi(a.keys)],null),c=a.pa!=null?$CLJS.ck.i(c,$CLJS.SB,a.pa):c;return b.call($CLJS.Mo,$CLJS.hf([c,qma(a)]))};$CLJS.tma=$CLJS.mh([$CLJS.gD,function(a,b){$CLJS.Fy(a,"pss/leaf",1);return $CLJS.qG(a,sma(b))},$CLJS.mD,function(a,b){$CLJS.Fy(a,"pss/branch",1);return $CLJS.qG(a,sma(b))}]);$CLJS.uma=$CLJS.mh([$CLJS.HD,function(a,b){$CLJS.Fy(a,"pss/set",1);return $CLJS.qG(a,pma(b))}]);
2
+ 'use strict';var rG,pma,qma,sma;$CLJS.qG=function(a,b){return $CLJS.Jy(a,b)};rG=function(a){if(a!=null&&a.So!=null)a=a.So(a);else{var b=rG[$CLJS.ab(a==null?null:a)];if(b!=null)a=b.g?b.g(a):b.call(null,a);else if(b=rG._,b!=null)a=b.g?b.g(a):b.call(null,a);else throw $CLJS.Wb("PBoundary.-descriptor",a);}return a};
3
+ pma=function(a){if(a.address==null)throw $CLJS.yl("PSS root must be flushed before serialization",new $CLJS.T(null,1,[$CLJS.cn,$CLJS.oma],null));var b=a.K,c=function(){var d=$CLJS.QB.g(b);return $CLJS.u(d)?rG(d):null}();a=new $CLJS.T(null,5,[$CLJS.Kk,$CLJS.Af(a),$CLJS.nG,a.address,$CLJS.fn,a.U,$CLJS.RB,$CLJS.RB.g(b),$CLJS.gC,function(){var d=$CLJS.gC.g(b);return $CLJS.u(d)?d:0}()],null);a=$CLJS.u($CLJS.pG.g(b))?$CLJS.ck.i(a,$CLJS.pG,$CLJS.pG.g(b)):a;return $CLJS.u(c)?$CLJS.ck.i(a,$CLJS.QB,c):a};
4
+ qma=function(a){var b=a.K;a=function(){var d=$CLJS.QB.g(b);return $CLJS.u(d)?rG(d):null}();var c=new $CLJS.T(null,2,[$CLJS.RB,$CLJS.RB.g(b),$CLJS.gC,function(){var d=$CLJS.gC.g(b);return $CLJS.u(d)?d:0}()],null);c=$CLJS.u($CLJS.pG.g(b))?$CLJS.ck.i(c,$CLJS.pG,$CLJS.pG.g(b)):c;return $CLJS.u(a)?$CLJS.ck.i(c,$CLJS.QB,a):c};
5
+ $CLJS.rma=function(a){var b=a.ya;if(b==null)return null;for(var c=a.keys.length,d=a.level===1,e=0,f=$CLJS.nh;;){if(e>=c)return $CLJS.af(f)>0?f:null;var g=b[e];if(g==null){var h=f;e+=1;f=h}else h=e+1,f=$CLJS.ck.i(f,e,new $CLJS.T(null,4,[$CLJS.fn,$CLJS.fn.g(g),$CLJS.TB,$CLJS.TB.g(g),$CLJS.XB,d?$CLJS.mD($CLJS.XB.g(g)):$CLJS.XB.g(g),$CLJS.dC,a.keys[e]],null)),e=h}};
6
+ sma=function(a){var b=$CLJS.No.l;if(a instanceof $CLJS.nD){var c=$CLJS.rma(a);var d=new $CLJS.T(null,4,[$CLJS.Ip,a.ij(null),$CLJS.yp,$CLJS.Hi(a.keys),$CLJS.aC,$CLJS.Hi(a.ua),$CLJS.YB,a.tc],null);d=a.pa!=null?$CLJS.ck.i(d,$CLJS.TB,a.pa):d;c=$CLJS.u(c)?$CLJS.ck.i(d,$CLJS.sm,c):d}else c=new $CLJS.T(null,1,[$CLJS.yp,$CLJS.Hi(a.keys)],null),c=a.pa!=null?$CLJS.ck.i(c,$CLJS.TB,a.pa):c;return b.call($CLJS.No,$CLJS.hf([c,qma(a)]))};$CLJS.tma=$CLJS.lh([$CLJS.hD,function(a,b){$CLJS.Gy(a,"pss/leaf",1);return $CLJS.qG(a,sma(b))},$CLJS.nD,function(a,b){$CLJS.Gy(a,"pss/branch",1);return $CLJS.qG(a,sma(b))}]);$CLJS.uma=$CLJS.lh([$CLJS.ID,function(a,b){$CLJS.Gy(a,"pss/set",1);return $CLJS.qG(a,pma(b))}]);
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");
2
- 'use strict';$CLJS.PB=new $CLJS.H(null,"boundary","boundary",-2000996754);$CLJS.jla=$CLJS.Hh(null);
2
+ 'use strict';$CLJS.QB=new $CLJS.H(null,"boundary","boundary",-2000996754);$CLJS.jla=$CLJS.Hh(null);
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");require("./clojure.string.js");require("./org.replikativ.persistent_sorted_set.btset.js");
2
- 'use strict';$CLJS.lE=function(a,b,c){return $CLJS.GD(a,b,c)};$CLJS.Lla=new $CLJS.T(null,2,[$CLJS.QB,512,$CLJS.fC,0],null);
2
+ 'use strict';$CLJS.mE=function(a,b,c){return $CLJS.HD(a,b,c)};$CLJS.Lla=new $CLJS.T(null,2,[$CLJS.RB,512,$CLJS.gC,0],null);
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");require("./clojure.string.js");require("./org.replikativ.persistent_sorted_set.impl.boundary.js");require("./org.replikativ.persistent_sorted_set.util.js");
2
- 'use strict';$CLJS.RB=new $CLJS.H(null,"removed-out","removed-out",780264512);$CLJS.SB=new $CLJS.H(null,"measure","measure",-1857519826);
2
+ 'use strict';$CLJS.SB=new $CLJS.H(null,"removed-out","removed-out",780264512);$CLJS.TB=new $CLJS.H(null,"measure","measure",-1857519826);
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");require("./clojure.string.js");
2
- 'use strict';$CLJS.QB=new $CLJS.H(null,"branching-factor","branching-factor",1903198601);
2
+ 'use strict';$CLJS.RB=new $CLJS.H(null,"branching-factor","branching-factor",1903198601);
package/package.json CHANGED
@@ -17,7 +17,7 @@
17
17
  "types" : "index.d.ts",
18
18
  "author" : "Christian Weilbach",
19
19
  "files" : [ "*.js", "!test*.js", "*.js.map", "browser/datahike.js", "browser/index.mjs", "browser/index.js", "s3/datahike.js", "s3/index.mjs", "s3/index.js", "kabel/datahike.js", "kabel/index.mjs", "kabel/index.js", "remote/index.mjs", "remote/index.js", "remote/*.d.ts", "index.d.ts", "kabel.d.ts", "README.md", "LICENSE", "THIRD_PARTY_LICENSES.md" ],
20
- "version" : "0.8.1900",
20
+ "version" : "0.8.1902",
21
21
  "publishConfig" : {
22
22
  "access" : "public",
23
23
  "registry" : "https://registry.npmjs.org/"
@@ -115,7 +115,7 @@ export declare function pullMany<T extends Record<string, any> = Record<string,
115
115
  * a query plus `(->> … (sort-by …) (take k))` in Clojure.
116
116
  *
117
117
  * `:order-by` is FLAT, alternating keys and directions -- `[?c :desc]`,
118
- * not `[[?c :desc]]`. A key is a `:find` variable or a zero-based column
118
+ * not `[[?c :desc]]`. A key is a `:find` variable or a 0-based column
119
119
  * index, and the index is how to order by an AGGREGATE, which has no
120
120
  * variable to name:
121
121
  *
@@ -125,6 +125,12 @@ export declare function pullMany<T extends Record<string, any> = Record<string,
125
125
  * :order-by [1 :desc] the second :find element
126
126
  *
127
127
  * `:limit` and `:offset` apply after the ordering.
128
+ *
129
+ * Function arguments are flat: bind a sub-expression in its own clause.
130
+ * A scalar constant output constrains the result, e.g. `[(subs ?id 6 7) "4"]`.
131
+ * `[(if ?condition ?then ?else) ?value]` selects between already evaluated
132
+ * values using Clojure truthiness; it does not short-circuit other clauses.
133
+ * A nil function result discards the row; a thrown exception fails the query.
128
134
  */
129
135
  export declare function q<T = unknown>(query: QueryArgs): Promise<T>;
130
136
  export declare function q<T = unknown>(query: Array<any> | Record<string, any> | string, ...inputs: Array<any>): Promise<T>;
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");require("./taoensso.trove.js");
2
- 'use strict';$CLJS.Qp=new $CLJS.H(null,"ref","ref",1289896967);$CLJS.Rp=new $CLJS.H(null,"conn","conn",278309663);$CLJS.Sp=new $CLJS.H(null,"eavt","eavt",-666437073);
2
+ 'use strict';$CLJS.Qp=new $CLJS.H(null,"ref","ref",1289896967);$CLJS.Rp=new $CLJS.H(null,"conn","conn",278309663);$CLJS.Sp=new $CLJS.H(null,"warn","warn",-436710552);$CLJS.Tp=new $CLJS.H(null,"eavt","eavt",-666437073);
@@ -1,2 +1,2 @@
1
1
  var window=global;var $CLJS=require("./cljs_env.js");require("./cljs.core.js");
2
- 'use strict';$CLJS.gP=new $CLJS.H(null,"counter","counter",804008177);$CLJS.hP=new $CLJS.H(null,"help","help",-439233446);$CLJS.iP=new $CLJS.H(null,"gauge","gauge",63470758);$CLJS.jP=new $CLJS.H(null,"series","series",600710694);$CLJS.Jsa=new $CLJS.H(null,"sum","sum",136986814);$CLJS.kP=new $CLJS.H(null,"histogram","histogram",44258148);$CLJS.lP=new $CLJS.H(null,"buckets","buckets",-1916554731);$CLJS.Ksa=new $CLJS.P(null,13,5,$CLJS.S,[.001,.0025,.005,.01,.025,.05,.1,.25,.5,1,2.5,5,10],null);$CLJS.mP=$CLJS.Hh($CLJS.nh);
2
+ 'use strict';$CLJS.gP=new $CLJS.H(null,"counter","counter",804008177);$CLJS.hP=new $CLJS.H(null,"help","help",-439233446);$CLJS.iP=new $CLJS.H(null,"gauge","gauge",63470758);$CLJS.jP=new $CLJS.H(null,"series","series",600710694);$CLJS.Ksa=new $CLJS.H(null,"sum","sum",136986814);$CLJS.kP=new $CLJS.H(null,"histogram","histogram",44258148);$CLJS.lP=new $CLJS.H(null,"buckets","buckets",-1916554731);$CLJS.Lsa=new $CLJS.P(null,13,5,$CLJS.R,[.001,.0025,.005,.01,.025,.05,.1,.25,.5,1,2.5,5,10],null);$CLJS.mP=$CLJS.Hh($CLJS.nh);