datahike 0.8.1899 → 0.8.1900

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 (81) hide show
  1. package/browser/datahike.js +2604 -2602
  2. package/cljs.cache.js +2 -2
  3. package/cljs.core.async.impl.channels.js +2 -2
  4. package/cljs.core.js +74 -73
  5. package/cljs.reader.js +5 -5
  6. package/cljs.spec.alpha.js +49 -49
  7. package/cljs.tools.reader.edn.js +23 -23
  8. package/cljs.tools.reader.impl.commons.js +4 -4
  9. package/cljs.tools.reader.impl.errors.js +8 -8
  10. package/cljs.tools.reader.impl.inspect.js +2 -2
  11. package/cljs.tools.reader.impl.utils.js +2 -2
  12. package/cljs.tools.reader.js +2 -2
  13. package/cljs_node_io.core.js +9 -9
  14. package/cljs_node_io.file.js +17 -17
  15. package/cljs_node_io.fs.js +1 -1
  16. package/clojure.data.js +8 -8
  17. package/clojure.set.js +2 -2
  18. package/clojure.string.js +8 -8
  19. package/clojure.walk.js +3 -3
  20. package/datahike.api.impl.js +15 -15
  21. package/datahike.api.js +5 -5
  22. package/datahike.attr_preds.js +1 -1
  23. package/datahike.bitemporal.predicate.js +1 -1
  24. package/datahike.config.js +10 -10
  25. package/datahike.connections.js +4 -4
  26. package/datahike.connector.js +72 -72
  27. package/datahike.core.js +1 -1
  28. package/datahike.db.js +12 -12
  29. package/datahike.db.search.js +2 -2
  30. package/datahike.db.transaction.js +12 -12
  31. package/datahike.gc.js +12 -12
  32. package/datahike.impl.entity.js +15 -15
  33. package/datahike.index.persistent_set.js +16 -16
  34. package/datahike.js.api.js +191 -191
  35. package/datahike.js.convert.js +1 -1
  36. package/datahike.metrics.js +10 -10
  37. package/datahike.migrate.ids.js +1 -1
  38. package/datahike.online_gc.js +2 -2
  39. package/datahike.optimistic.js +12 -12
  40. package/datahike.pull_api.js +7 -7
  41. package/datahike.query.analyze.js +4 -4
  42. package/datahike.query.estimate.js +2 -2
  43. package/datahike.query.execute.js +8 -7
  44. package/datahike.query.ir.js +5 -5
  45. package/datahike.query.js +1161 -1161
  46. package/datahike.query.logical.js +2 -2
  47. package/datahike.query.lower.js +2 -2
  48. package/datahike.query.plan.js +12 -12
  49. package/datahike.query.relation.js +1 -1
  50. package/datahike.query.resolve.js +2 -1
  51. package/datahike.query_stats.js +1 -1
  52. package/datahike.readers.js +10 -10
  53. package/datahike.schema.js +13 -13
  54. package/datahike.schema_cache.js +3 -3
  55. package/datahike.store.js +1 -1
  56. package/datahike.tx_preds.js +1 -1
  57. package/datahike.versioning.js +4 -4
  58. package/datahike.writer.js +677 -677
  59. package/datahike.writing.js +42 -42
  60. package/datalog.parser.impl.js +4 -4
  61. package/datalog.parser.impl.proto.js +1 -1
  62. package/datalog.parser.impl.util.js +1 -1
  63. package/datalog.parser.js +1 -1
  64. package/datalog.parser.pull.js +3 -3
  65. package/datalog.parser.type.js +23 -23
  66. package/hasch.platform.js +6 -6
  67. package/index.d.ts +1 -1
  68. package/kabel/datahike.js +3867 -3866
  69. package/konserve.core.js +6 -6
  70. package/konserve.gc.js +1 -1
  71. package/konserve.node_filestore.js +401 -401
  72. package/konserve.store.js +1 -1
  73. package/org.replikativ.persistent_sorted_set.btset.js +143 -143
  74. package/org.replikativ.persistent_sorted_set.fressian.js +1 -1
  75. package/package.json +1 -1
  76. package/remote/api.generated.d.ts +16 -0
  77. package/replikativ.metrics.js +1 -1
  78. package/s3/datahike.js +3897 -3896
  79. package/tailrecursion.priority_map.js +4 -4
  80. package/taoensso.trove.console.js +3 -3
  81. package/taoensso.trove.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
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.Bf(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};
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
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
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
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))}]);
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.1899",
20
+ "version" : "0.8.1900",
21
21
  "publishConfig" : {
22
22
  "access" : "public",
23
23
  "registry" : "https://registry.npmjs.org/"
@@ -109,6 +109,22 @@ export declare function pullMany<T extends Record<string, any> = Record<string,
109
109
  export declare function pullMany<T extends Record<string, any> = Record<string, any>>(db: Database, patternOrOptions: Array<any>, eids: Array<number | [string, any] | string>): Promise<T[]>;
110
110
  /**
111
111
  * Executes a datalog query.
112
+ *
113
+ * The MAP form takes `:order-by`, `:limit` and `:offset` alongside
114
+ * `:find`/`:where`, so a "top k by x" question is one query rather than
115
+ * a query plus `(->> … (sort-by …) (take k))` in Clojure.
116
+ *
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
119
+ * index, and the index is how to order by an AGGREGATE, which has no
120
+ * variable to name:
121
+ *
122
+ * :order-by ?c ascending, the default
123
+ * :order-by [?c :desc]
124
+ * :order-by [?a :asc ?b :desc] two keys
125
+ * :order-by [1 :desc] the second :find element
126
+ *
127
+ * `:limit` and `:offset` apply after the ordering.
112
128
  */
113
129
  export declare function q<T = unknown>(query: QueryArgs): Promise<T>;
114
130
  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");
2
- 'use strict';$CLJS.dP=new $CLJS.H(null,"counter","counter",804008177);$CLJS.eP=new $CLJS.H(null,"help","help",-439233446);$CLJS.fP=new $CLJS.H(null,"gauge","gauge",63470758);$CLJS.gP=new $CLJS.H(null,"series","series",600710694);$CLJS.Bsa=new $CLJS.H(null,"sum","sum",136986814);$CLJS.hP=new $CLJS.H(null,"histogram","histogram",44258148);$CLJS.iP=new $CLJS.H(null,"buckets","buckets",-1916554731);$CLJS.Csa=new $CLJS.P(null,13,5,$CLJS.S,[.001,.0025,.005,.01,.025,.05,.1,.25,.5,1,2.5,5,10],null);$CLJS.jP=$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.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);