@kanzo-tech/graph 0.18.0 → 0.20.0

package/README.md

@@ -19,7 +19,7 @@ DuckDB-WASM engine and its crossfilter, cosmos.gl draws, and the parts are built
 ```tsx
 import { open } from "@fossil-lang/corpus";
 import { engine } from "@kanzo-tech/mosaic";
-import { GraphCanvas, GraphInspector, GraphLegend, GraphRoot, GraphToolbar } from "@kanzo-tech/graph";
+import { GraphCanvas, GraphCounts, GraphInspector, GraphLegend, GraphRoot, GraphToolbar } from "@kanzo-tech/graph";
 
 const corpus = engine().then((e) => open(url, { engine: e }));
 
@@ -28,6 +28,7 @@ const corpus = engine().then((e) => open(url, { engine: e }));
     <GraphToolbar />
     <GraphLegend />
   </GraphCanvas>
+  <GraphCounts />
   <GraphInspector />
 </GraphRoot>;
 ```
@@ -49,8 +50,11 @@ does not survive is hidden; a clause that cannot be translated reaches `onFailur
 dropped. A lasso or a click publishes the reader's pick back into it, exempting the graph itself.
 
 **The layout is off at load.** The corpus's positions are drawn as they are; `GraphToolbar` runs and
-stops a force layout from where the points are, and dragging a node pins it either way. At 200,000
-vertices the viewer's p95 frame interval is 9.0 ms against 9.3 ms for cosmos.gl alone.
+stops a force layout from where the points are. Dragging a node pins it only while a layout runs,
+and releasing the pins reheats it. While a layout runs the camera follows the points until the reader
+zooms or pans. `status` is the data's life and `motion` the layout's — two axes, because each moves
+without the other. At 200,000 vertices the viewer's p95 frame interval is 9.0 ms against 9.3 ms for
+cosmos.gl alone.
 
 The reference composition is the docs' workspace showcase: one `GraphRoot` around a shell with the
 graph, a second main view and a dock of panels.
@@ -62,13 +66,27 @@ graph, a second main view and a dock of panels.
   never changes; `useGraphState(selector)` reads a slice of the state.
 - `GraphCanvas` — the element, the grid, the vignette, the labels, the hover card and the marquee
   and lasso gesture. Children are chrome positioned over it.
-- `GraphLegend`, `GraphToolbar`, `GraphInspector` — the categorical scale with its tally, the
-  commands drawn, and the focused vertex's row with a render prop for a product's own fields. No
-  part takes a callback: what a click means is `onSelect`, `onFocus` and `onFailure` on the root.
+- `GraphToolbar` — the selection tools, the selection, zoom and fit, and the layout's transport.
+- `GraphLegend` — one row per category: glyph, name and how many are drawn.
+- `GraphCounts` — what is drawn of the whole: "1.2K of 5K nodes drawn · 8K edges".
+- `GraphSearch` — every drawn vertex's text, read once and filtered in the browser; picking reveals.
+- `GraphInspector` — the focused vertex's row, with a render prop for a product's own fields.
+- `GraphLooks` — Nebula, Atlas and Ink as presets over `GRAPH_SECTION`'s axes, with the axes under
+  Customize. Needs `GRAPH_SECTION` on the theme provider, and no root.
+- `ShapeGlyph` — the glyph the canvas draws for a category, in the DOM.
+
+No part takes a callback: what a click means is `onSelect`, `onFocus` and `onFailure` on the root.
+`onFailure` is required and receives every failure as thrown — fossil's coded errors, and the graph's
+own `GraphError` (`graph/no-webgl`, `graph/context-lost`, `graph/nothing-to-draw`,
+`graph/untranslatable-filter`).
+
 - `lookFrom`, `simFrom`, `useGraphPrefs` — the form and the forces from a preferences panel's
-  answers; `scaleOf` — what colour and shape a category wears.
+  answers, and the look `preset` they are; `scaleOf` — what colour and shape a category wears.
 - `VertexId` — a vertex is its `dense_id`, a `number`.
 
+The full guide — the parts, layout and camera, and the workspace recipe — is at
+[kanzo-tech.github.io/ui/docs/graph](https://kanzo-tech.github.io/ui/docs/graph).
+
 ## Why a package, and not part of `@kanzo-tech/ui`
 
 The [first admission rule](https://kanzo-tech.github.io/ui/docs/philosophy#admission) is

package/dist/core/detail.d.ts

@@ -20,5 +20,7 @@ export declare function readVertex(corpus: Corpus, geometry: Geometry, vertex: V
  * **A label's text, for the few vertices that carry one** — `title` where the vertex's table has the
  * column, and the table's declared `identity` where it does not. One scan per table they fall in.
  */
-export declare function readTitles(corpus: Corpus, geometry: Geometry, vertices: readonly VertexId[], title: string | undefined, signal?: AbortSignal): Promise<Map<VertexId, string>>;
+export declare function readTitles(corpus: Corpus, geometry: Geometry, vertices: readonly VertexId[], title: string | undefined, signal: AbortSignal): Promise<Map<VertexId, string>>;
+/** **Every drawn vertex's text, by id** — what a search filters. One scan per drawn table, two columns. */
+export declare function readEveryTitle(corpus: Corpus, geometry: Geometry, title: string | undefined, signal: AbortSignal): Promise<string[]>;
 //# sourceMappingURL=detail.d.ts.map

package/dist/core/detail.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"detail.d.ts","sourceRoot":"","sources":["../../src/core/detail.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAe,MAAM,qBAAqB,CAAC;AAC/D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC,wGAAwG;AACxG,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,sCAAsC;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;CAChF;AAKD;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,QAAQ,EAChB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAa9B;AAED;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,QAAQ,EAAE,SAAS,QAAQ,EAAE,EAC7B,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAmBhC"}
+{"version":3,"file":"detail.d.ts","sourceRoot":"","sources":["../../src/core/detail.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAe,MAAM,qBAAqB,CAAC;AAC/D,OAAO,EAAY,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC,wGAAwG;AACxG,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,sCAAsC;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;CAChF;AAKD;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,QAAQ,EAChB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAa9B;AAMD;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,QAAQ,EAAE,SAAS,QAAQ,EAAE,EAC7B,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAqBhC;AAED,2GAA2G;AAC3G,wBAAsB,cAAc,CAClC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,MAAM,EAAE,CAAC,CAmBnB"}

package/dist/core/detail.js

@@ -1,38 +1,63 @@
-const y = (o, a) => a < o.size ? o.tables[o.table[a]] : void 0;
-async function k(o, a, i, c) {
-  var u, f;
-  const e = y(a, i);
-  if (!e) return null;
-  const l = /* @__PURE__ */ new Set([e.key, (u = e.position) == null ? void 0 : u.x, (f = e.position) == null ? void 0 : f.y]), r = e.properties.map((t) => t.name).filter((t) => !l.has(t)), n = o.scan({ table: e.name, filter: { column: e.key, op: "=", value: i }, select: [e.key, ...r], limit: 1 }), s = (await n.read(n.plan(), { signal: c })).find((t) => t.numRows > 0);
-  return s ? {
-    vertex: i,
-    table: e.name,
-    fields: r.map((t) => {
-      var p;
-      return { name: t, value: ((p = s.getChild(t)) == null ? void 0 : p.toArray()[0]) ?? null };
+import { together as h } from "./load.js";
+const k = (o, e) => e < o.size ? o.tables[o.table[e]] : void 0;
+async function C(o, e, r, y) {
+  var f, c;
+  const s = k(e, r);
+  if (!s) return null;
+  const u = /* @__PURE__ */ new Set([s.key, (f = s.position) == null ? void 0 : f.x, (c = s.position) == null ? void 0 : c.y]), a = s.properties.map((t) => t.name).filter((t) => !u.has(t)), i = o.scan({ table: s.name, filter: { column: s.key, op: "=", value: r }, select: [s.key, ...a], limit: 1 }), n = (await i.read(i.plan(), { signal: y })).find((t) => t.numRows > 0);
+  return n ? {
+    vertex: r,
+    table: s.name,
+    fields: a.map((t) => {
+      var m;
+      return { name: t, value: ((m = n.getChild(t)) == null ? void 0 : m.toArray()[0]) ?? null };
     })
   } : null;
 }
-async function h(o, a, i, c, e) {
-  const l = /* @__PURE__ */ new Map();
-  for (const n of i) {
-    const s = y(a, n);
-    s && l.set(s, [...l.get(s) ?? [], n]);
+const b = (o, e) => e !== void 0 && o.properties.some((r) => r.name === e) ? e : o.identity;
+async function v(o, e, r, y, s) {
+  const u = /* @__PURE__ */ new Map();
+  for (const i of r) {
+    const n = k(e, i);
+    n && u.set(n, [...u.get(n) ?? [], i]);
   }
-  const r = /* @__PURE__ */ new Map();
-  return await Promise.all(
-    [...l].map(async ([n, s]) => {
-      var t, p;
-      const u = c !== void 0 && n.properties.some((d) => d.name === c) ? c : n.identity, f = o.scan({ table: n.name, filter: { column: n.key, op: "in", values: s }, select: [n.key, u] });
-      for (const d of await f.read(f.plan(), { signal: e })) {
-        const w = ((t = d.getChild(n.key)) == null ? void 0 : t.toArray()) ?? [], b = ((p = d.getChild(u)) == null ? void 0 : p.toArray()) ?? [];
-        for (let m = 0; m < d.numRows; m++) r.set(Number(w[m]), String(b[m] ?? ""));
-      }
-    })
-  ), r;
+  const a = /* @__PURE__ */ new Map();
+  return await h(
+    s,
+    (i) => Promise.all(
+      [...u].map(async ([n, f]) => {
+        var m, d;
+        const c = b(n, y), t = o.scan({ table: n.name, filter: { column: n.key, op: "in", values: f }, select: [n.key, c] });
+        for (const l of await t.read(t.plan(), { signal: i })) {
+          const p = ((m = l.getChild(n.key)) == null ? void 0 : m.toArray()) ?? [], g = ((d = l.getChild(c)) == null ? void 0 : d.toArray()) ?? [];
+          for (let w = 0; w < l.numRows; w++) a.set(Number(p[w]), String(g[w] ?? ""));
+        }
+      })
+    )
+  ), a;
+}
+async function x(o, e, r, y) {
+  const s = new Array(e.size).fill("");
+  return await h(
+    y,
+    (u) => Promise.all(
+      e.tables.map(async (a) => {
+        var f, c;
+        const i = b(a, r), n = o.scan({ table: a.name, select: [a.key, i] });
+        for (const t of await n.read(n.plan(), { signal: u })) {
+          const m = ((f = t.getChild(a.key)) == null ? void 0 : f.toArray()) ?? [], d = ((c = t.getChild(i)) == null ? void 0 : c.toArray()) ?? [];
+          for (let l = 0; l < t.numRows; l++) {
+            const p = Number(m[l]);
+            p < e.size && (s[p] = String(d[l] ?? ""));
+          }
+        }
+      })
+    )
+  ), s;
 }
 export {
-  h as readTitles,
-  k as readVertex
+  x as readEveryTitle,
+  v as readTitles,
+  C as readVertex
 };
 //# sourceMappingURL=detail.js.map

package/dist/core/detail.js.map

@@ -1 +1 @@
-{"version":3,"file":"detail.js","sources":["../../src/core/detail.ts"],"sourcesContent":["import type { Corpus, VertexTable } from \"@fossil-lang/corpus\";\nimport type { Geometry } from \"./load\";\nimport type { VertexId } from \"./types\";\n\n/** One vertex's row, as its table's properties order it — every column but the key and the position. */\nexport interface VertexDetail {\n  readonly vertex: VertexId;\n  /** The vertex table it belongs to. */\n  readonly table: string;\n  readonly fields: readonly { readonly name: string; readonly value: unknown }[];\n}\n\nconst tableOf = (geometry: Geometry, vertex: VertexId): VertexTable | undefined =>\n  vertex < geometry.size ? geometry.tables[geometry.table[vertex] as number] : undefined;\n\n/**\n * **Detail is fetched, not carried.** The loaded graph holds positions and channels; the rest of a\n * row is asked for when a reader focuses the vertex — a scan of its table, filtered to its key.\n */\nexport async function readVertex(\n  corpus: Corpus,\n  geometry: Geometry,\n  vertex: VertexId,\n  signal?: AbortSignal,\n): Promise<VertexDetail | null> {\n  const table = tableOf(geometry, vertex);\n  if (!table) return null;\n  const hidden = new Set([table.key, table.position?.x, table.position?.y]);\n  const names = table.properties.map((p) => p.name).filter((name) => !hidden.has(name));\n  const scan = corpus.scan({ table: table.name, filter: { column: table.key, op: \"=\", value: vertex }, select: [table.key, ...names], limit: 1 });\n  const rows = (await scan.read(scan.plan(), { signal })).find((batch) => batch.numRows > 0);\n  if (!rows) return null;\n  return {\n    vertex,\n    table: table.name,\n    fields: names.map((name) => ({ name, value: rows.getChild(name)?.toArray()[0] ?? null })),\n  };\n}\n\n/**\n * **A label's text, for the few vertices that carry one** — `title` where the vertex's table has the\n * column, and the table's declared `identity` where it does not. One scan per table they fall in.\n */\nexport async function readTitles(\n  corpus: Corpus,\n  geometry: Geometry,\n  vertices: readonly VertexId[],\n  title: string | undefined,\n  signal?: AbortSignal,\n): Promise<Map<VertexId, string>> {\n  const byTable = new Map<VertexTable, VertexId[]>();\n  for (const vertex of vertices) {\n    const table = tableOf(geometry, vertex);\n    if (table) byTable.set(table, [...(byTable.get(table) ?? []), vertex]);\n  }\n  const found = new Map<VertexId, string>();\n  await Promise.all(\n    [...byTable].map(async ([table, ids]) => {\n      const column = title !== undefined && table.properties.some((p) => p.name === title) ? title : table.identity;\n      const scan = corpus.scan({ table: table.name, filter: { column: table.key, op: \"in\", values: ids }, select: [table.key, column] });\n      for (const batch of await scan.read(scan.plan(), { signal })) {\n        const keys = batch.getChild(table.key)?.toArray() ?? [];\n        const texts = batch.getChild(column)?.toArray() ?? [];\n        for (let i = 0; i < batch.numRows; i++) found.set(Number(keys[i]), String(texts[i] ?? \"\"));\n      }\n    }),\n  );\n  return found;\n}\n"],"names":["tableOf","geometry","vertex","readVertex","corpus","signal","_a","_b","table","hidden","names","p","name","scan","rows","batch","readTitles","vertices","title","byTable","found","ids","column","keys","texts","i"],"mappings":"AAYA,MAAMA,IAAU,CAACC,GAAoBC,MACnCA,IAASD,EAAS,OAAOA,EAAS,OAAOA,EAAS,MAAMC,CAAM,CAAW,IAAI;AAM/E,eAAsBC,EACpBC,GACAH,GACAC,GACAG,GAC8B;AAZhC,MAAAC,GAAAC;AAaE,QAAMC,IAAQR,EAAQC,GAAUC,CAAM;AACtC,MAAI,CAACM,EAAO,QAAO;AACnB,QAAMC,IAAS,oBAAI,IAAI,CAACD,EAAM,MAAKF,IAAAE,EAAM,aAAN,gBAAAF,EAAgB,IAAGC,IAAAC,EAAM,aAAN,gBAAAD,EAAgB,CAAC,CAAC,GAClEG,IAAQF,EAAM,WAAW,IAAI,CAACG,MAAMA,EAAE,IAAI,EAAE,OAAO,CAACC,MAAS,CAACH,EAAO,IAAIG,CAAI,CAAC,GAC9EC,IAAOT,EAAO,KAAK,EAAE,OAAOI,EAAM,MAAM,QAAQ,EAAE,QAAQA,EAAM,KAAK,IAAI,KAAK,OAAON,EAAA,GAAU,QAAQ,CAACM,EAAM,KAAK,GAAGE,CAAK,GAAG,OAAO,EAAA,CAAG,GACxII,KAAQ,MAAMD,EAAK,KAAKA,EAAK,QAAQ,EAAE,QAAAR,EAAA,CAAQ,GAAG,KAAK,CAACU,MAAUA,EAAM,UAAU,CAAC;AACzF,SAAKD,IACE;AAAA,IACL,QAAAZ;AAAA,IACA,OAAOM,EAAM;AAAA,IACb,QAAQE,EAAM,IAAI,CAACE,MAAA;AAvBvB,UAAAN;AAuBiC,eAAE,MAAAM,GAAM,SAAON,IAAAQ,EAAK,SAASF,CAAI,MAAlB,gBAAAN,EAAqB,UAAU,OAAM;KAAO;AAAA,EAAA,IAJxE;AAMpB;AAMA,eAAsBU,EACpBZ,GACAH,GACAgB,GACAC,GACAb,GACgC;AAChC,QAAMc,wBAAc,IAAA;AACpB,aAAWjB,KAAUe,GAAU;AAC7B,UAAMT,IAAQR,EAAQC,GAAUC,CAAM;AACtC,IAAIM,KAAOW,EAAQ,IAAIX,GAAO,CAAC,GAAIW,EAAQ,IAAIX,CAAK,KAAK,CAAA,GAAKN,CAAM,CAAC;AAAA,EACvE;AACA,QAAMkB,wBAAY,IAAA;AAClB,eAAM,QAAQ;AAAA,IACZ,CAAC,GAAGD,CAAO,EAAE,IAAI,OAAO,CAACX,GAAOa,CAAG,MAAM;AA7C7C,UAAAf,GAAAC;AA8CM,YAAMe,IAASJ,MAAU,UAAaV,EAAM,WAAW,KAAK,CAACG,MAAMA,EAAE,SAASO,CAAK,IAAIA,IAAQV,EAAM,UAC/FK,IAAOT,EAAO,KAAK,EAAE,OAAOI,EAAM,MAAM,QAAQ,EAAE,QAAQA,EAAM,KAAK,IAAI,MAAM,QAAQa,EAAA,GAAO,QAAQ,CAACb,EAAM,KAAKc,CAAM,GAAG;AACjI,iBAAWP,KAAS,MAAMF,EAAK,KAAKA,EAAK,QAAQ,EAAE,QAAAR,EAAA,CAAQ,GAAG;AAC5D,cAAMkB,MAAOjB,IAAAS,EAAM,SAASP,EAAM,GAAG,MAAxB,gBAAAF,EAA2B,cAAa,CAAA,GAC/CkB,MAAQjB,IAAAQ,EAAM,SAASO,CAAM,MAArB,gBAAAf,EAAwB,cAAa,CAAA;AACnD,iBAASkB,IAAI,GAAGA,IAAIV,EAAM,SAASU,OAAW,IAAI,OAAOF,EAAKE,CAAC,CAAC,GAAG,OAAOD,EAAMC,CAAC,KAAK,EAAE,CAAC;AAAA,MAC3F;AAAA,IACF,CAAC;AAAA,EAAA,GAEIL;AACT;"}
+{"version":3,"file":"detail.js","sources":["../../src/core/detail.ts"],"sourcesContent":["import type { Corpus, VertexTable } from \"@fossil-lang/corpus\";\nimport { together, type Geometry } from \"./load\";\nimport type { VertexId } from \"./types\";\n\n/** One vertex's row, as its table's properties order it — every column but the key and the position. */\nexport interface VertexDetail {\n  readonly vertex: VertexId;\n  /** The vertex table it belongs to. */\n  readonly table: string;\n  readonly fields: readonly { readonly name: string; readonly value: unknown }[];\n}\n\nconst tableOf = (geometry: Geometry, vertex: VertexId): VertexTable | undefined =>\n  vertex < geometry.size ? geometry.tables[geometry.table[vertex] as number] : undefined;\n\n/**\n * **Detail is fetched, not carried.** The loaded graph holds positions and channels; the rest of a\n * row is asked for when a reader focuses the vertex — a scan of its table, filtered to its key.\n */\nexport async function readVertex(\n  corpus: Corpus,\n  geometry: Geometry,\n  vertex: VertexId,\n  signal?: AbortSignal,\n): Promise<VertexDetail | null> {\n  const table = tableOf(geometry, vertex);\n  if (!table) return null;\n  const hidden = new Set([table.key, table.position?.x, table.position?.y]);\n  const names = table.properties.map((p) => p.name).filter((name) => !hidden.has(name));\n  const scan = corpus.scan({ table: table.name, filter: { column: table.key, op: \"=\", value: vertex }, select: [table.key, ...names], limit: 1 });\n  const rows = (await scan.read(scan.plan(), { signal })).find((batch) => batch.numRows > 0);\n  if (!rows) return null;\n  return {\n    vertex,\n    table: table.name,\n    fields: names.map((name) => ({ name, value: rows.getChild(name)?.toArray()[0] ?? null })),\n  };\n}\n\n/** The column a vertex's text is read from: `title` where its table has it, else the table's `identity`. */\nconst titleColumn = (table: VertexTable, title: string | undefined): string =>\n  title !== undefined && table.properties.some((p) => p.name === title) ? title : table.identity;\n\n/**\n * **A label's text, for the few vertices that carry one** — `title` where the vertex's table has the\n * column, and the table's declared `identity` where it does not. One scan per table they fall in.\n */\nexport async function readTitles(\n  corpus: Corpus,\n  geometry: Geometry,\n  vertices: readonly VertexId[],\n  title: string | undefined,\n  signal: AbortSignal,\n): Promise<Map<VertexId, string>> {\n  const byTable = new Map<VertexTable, VertexId[]>();\n  for (const vertex of vertices) {\n    const table = tableOf(geometry, vertex);\n    if (table) byTable.set(table, [...(byTable.get(table) ?? []), vertex]);\n  }\n  const found = new Map<VertexId, string>();\n  await together(signal, (signal) =>\n    Promise.all(\n      [...byTable].map(async ([table, ids]) => {\n        const column = titleColumn(table, title);\n        const scan = corpus.scan({ table: table.name, filter: { column: table.key, op: \"in\", values: ids }, select: [table.key, column] });\n        for (const batch of await scan.read(scan.plan(), { signal })) {\n          const keys = batch.getChild(table.key)?.toArray() ?? [];\n          const texts = batch.getChild(column)?.toArray() ?? [];\n          for (let i = 0; i < batch.numRows; i++) found.set(Number(keys[i]), String(texts[i] ?? \"\"));\n        }\n      }),\n    ),\n  );\n  return found;\n}\n\n/** **Every drawn vertex's text, by id** — what a search filters. One scan per drawn table, two columns. */\nexport async function readEveryTitle(\n  corpus: Corpus,\n  geometry: Geometry,\n  title: string | undefined,\n  signal: AbortSignal,\n): Promise<string[]> {\n  const titles = new Array<string>(geometry.size).fill(\"\");\n  await together(signal, (signal) =>\n    Promise.all(\n      geometry.tables.map(async (table) => {\n        const column = titleColumn(table, title);\n        const scan = corpus.scan({ table: table.name, select: [table.key, column] });\n        for (const batch of await scan.read(scan.plan(), { signal })) {\n          const keys = batch.getChild(table.key)?.toArray() ?? [];\n          const texts = batch.getChild(column)?.toArray() ?? [];\n          for (let i = 0; i < batch.numRows; i++) {\n            const id = Number(keys[i]);\n            if (id < geometry.size) titles[id] = String(texts[i] ?? \"\");\n          }\n        }\n      }),\n    ),\n  );\n  return titles;\n}\n"],"names":["tableOf","geometry","vertex","readVertex","corpus","signal","table","hidden","_a","_b","names","p","name","scan","rows","batch","titleColumn","title","readTitles","vertices","byTable","found","together","ids","column","keys","texts","i","readEveryTitle","titles","id"],"mappings":";AAYA,MAAMA,IAAU,CAACC,GAAoBC,MACnCA,IAASD,EAAS,OAAOA,EAAS,OAAOA,EAAS,MAAMC,CAAM,CAAW,IAAI;AAM/E,eAAsBC,EACpBC,GACAH,GACAC,GACAG,GAC8B;;AAC9B,QAAMC,IAAQN,EAAQC,GAAUC,CAAM;AACtC,MAAI,CAACI,EAAO,QAAO;AACnB,QAAMC,IAAS,oBAAI,IAAI,CAACD,EAAM,MAAKE,IAAAF,EAAM,aAAN,gBAAAE,EAAgB,IAAGC,IAAAH,EAAM,aAAN,gBAAAG,EAAgB,CAAC,CAAC,GAClEC,IAAQJ,EAAM,WAAW,IAAI,CAACK,MAAMA,EAAE,IAAI,EAAE,OAAO,CAACC,MAAS,CAACL,EAAO,IAAIK,CAAI,CAAC,GAC9EC,IAAOT,EAAO,KAAK,EAAE,OAAOE,EAAM,MAAM,QAAQ,EAAE,QAAQA,EAAM,KAAK,IAAI,KAAK,OAAOJ,EAAA,GAAU,QAAQ,CAACI,EAAM,KAAK,GAAGI,CAAK,GAAG,OAAO,EAAA,CAAG,GACxII,KAAQ,MAAMD,EAAK,KAAKA,EAAK,QAAQ,EAAE,QAAAR,EAAA,CAAQ,GAAG,KAAK,CAACU,MAAUA,EAAM,UAAU,CAAC;AACzF,SAAKD,IACE;AAAA,IACL,QAAAZ;AAAA,IACA,OAAOI,EAAM;AAAA,IACb,QAAQI,EAAM,IAAI,CAACE,MAAA;;AAAU,eAAE,MAAAA,GAAM,SAAOJ,IAAAM,EAAK,SAASF,CAAI,MAAlB,gBAAAJ,EAAqB,UAAU,OAAM;KAAO;AAAA,EAAA,IAJxE;AAMpB;AAGA,MAAMQ,IAAc,CAACV,GAAoBW,MACvCA,MAAU,UAAaX,EAAM,WAAW,KAAK,CAACK,MAAMA,EAAE,SAASM,CAAK,IAAIA,IAAQX,EAAM;AAMxF,eAAsBY,EACpBd,GACAH,GACAkB,GACAF,GACAZ,GACgC;AAChC,QAAMe,wBAAc,IAAA;AACpB,aAAWlB,KAAUiB,GAAU;AAC7B,UAAMb,IAAQN,EAAQC,GAAUC,CAAM;AACtC,IAAII,KAAOc,EAAQ,IAAId,GAAO,CAAC,GAAIc,EAAQ,IAAId,CAAK,KAAK,CAAA,GAAKJ,CAAM,CAAC;AAAA,EACvE;AACA,QAAMmB,wBAAY,IAAA;AAClB,eAAMC;AAAA,IAASjB;AAAA,IAAQ,CAACA,MACtB,QAAQ;AAAA,MACN,CAAC,GAAGe,CAAO,EAAE,IAAI,OAAO,CAACd,GAAOiB,CAAG,MAAM;;AACvC,cAAMC,IAASR,EAAYV,GAAOW,CAAK,GACjCJ,IAAOT,EAAO,KAAK,EAAE,OAAOE,EAAM,MAAM,QAAQ,EAAE,QAAQA,EAAM,KAAK,IAAI,MAAM,QAAQiB,EAAA,GAAO,QAAQ,CAACjB,EAAM,KAAKkB,CAAM,GAAG;AACjI,mBAAWT,KAAS,MAAMF,EAAK,KAAKA,EAAK,KAAA,GAAQ,EAAE,QAAAR,EAAAA,CAAQ,GAAG;AAC5D,gBAAMoB,MAAOjB,IAAAO,EAAM,SAAST,EAAM,GAAG,MAAxB,gBAAAE,EAA2B,cAAa,CAAA,GAC/CkB,MAAQjB,IAAAM,EAAM,SAASS,CAAM,MAArB,gBAAAf,EAAwB,cAAa,CAAA;AACnD,mBAASkB,IAAI,GAAGA,IAAIZ,EAAM,SAASY,OAAW,IAAI,OAAOF,EAAKE,CAAC,CAAC,GAAG,OAAOD,EAAMC,CAAC,KAAK,EAAE,CAAC;AAAA,QAC3F;AAAA,MACF,CAAC;AAAA,IAAA;AAAA,EACH,GAEKN;AACT;AAGA,eAAsBO,EACpBxB,GACAH,GACAgB,GACAZ,GACmB;AACnB,QAAMwB,IAAS,IAAI,MAAc5B,EAAS,IAAI,EAAE,KAAK,EAAE;AACvD,eAAMqB;AAAA,IAASjB;AAAA,IAAQ,CAACA,MACtB,QAAQ;AAAA,MACNJ,EAAS,OAAO,IAAI,OAAOK,MAAU;;AACnC,cAAMkB,IAASR,EAAYV,GAAOW,CAAK,GACjCJ,IAAOT,EAAO,KAAK,EAAE,OAAOE,EAAM,MAAM,QAAQ,CAACA,EAAM,KAAKkB,CAAM,GAAG;AAC3E,mBAAWT,KAAS,MAAMF,EAAK,KAAKA,EAAK,KAAA,GAAQ,EAAE,QAAAR,EAAAA,CAAQ,GAAG;AAC5D,gBAAMoB,MAAOjB,IAAAO,EAAM,SAAST,EAAM,GAAG,MAAxB,gBAAAE,EAA2B,cAAa,CAAA,GAC/CkB,MAAQjB,IAAAM,EAAM,SAASS,CAAM,MAArB,gBAAAf,EAAwB,cAAa,CAAA;AACnD,mBAASkB,IAAI,GAAGA,IAAIZ,EAAM,SAASY,KAAK;AACtC,kBAAMG,IAAK,OAAOL,EAAKE,CAAC,CAAC;AACzB,YAAIG,IAAK7B,EAAS,SAAM4B,EAAOC,CAAE,IAAI,OAAOJ,EAAMC,CAAC,KAAK,EAAE;AAAA,UAC5D;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IAAA;AAAA,EACH,GAEKE;AACT;"}

package/dist/core/error.d.ts

@@ -0,0 +1,16 @@
+/**
+ * The failures the graph names itself: no GPU device to draw with, or the one it had was taken back;
+ * a corpus with no positioned vertex type to draw; a crossfilter clause it cannot ask the corpus. A
+ * corpus fossil will not read never gets here: `open` refuses it, coded. `data.after` is set when a deadline fired. Everything else reaches `onFailure` as thrown.
+ */
+export declare class GraphError extends Error {
+    readonly code: "graph/no-webgl" | "graph/context-lost" | "graph/nothing-to-draw" | "graph/untranslatable-filter";
+    readonly data: {
+        readonly after?: number;
+    };
+    readonly name = "GraphError";
+    constructor(code: "graph/no-webgl" | "graph/context-lost" | "graph/nothing-to-draw" | "graph/untranslatable-filter", message: string, data?: {
+        readonly after?: number;
+    }, options?: ErrorOptions);
+}
+//# sourceMappingURL=error.d.ts.map

package/dist/core/error.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/core/error.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,qBAAa,UAAW,SAAQ,KAAK;IAGjC,QAAQ,CAAC,IAAI,EAAE,gBAAgB,GAAG,oBAAoB,GAAG,uBAAuB,GAAG,6BAA6B;IAEhH,QAAQ,CAAC,IAAI,EAAE;QAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE;IAJ5C,SAAkB,IAAI,gBAAgB;gBAE3B,IAAI,EAAE,gBAAgB,GAAG,oBAAoB,GAAG,uBAAuB,GAAG,6BAA6B,EAChH,OAAO,EAAE,MAAM,EACN,IAAI,GAAE;QAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAO,EAC/C,OAAO,CAAC,EAAE,YAAY;CAIzB"}

package/dist/core/error.js

@@ -0,0 +1,14 @@
+var h = Object.defineProperty;
+var p = (o, r, s) => r in o ? h(o, r, { enumerable: !0, configurable: !0, writable: !0, value: s }) : o[r] = s;
+var t = (o, r, s) => p(o, typeof r != "symbol" ? r + "" : r, s);
+class n extends Error {
+  constructor(s, a, e = {}, c) {
+    super(a, c);
+    t(this, "name", "GraphError");
+    this.code = s, this.data = e;
+  }
+}
+export {
+  n as GraphError
+};
+//# sourceMappingURL=error.js.map

package/dist/core/error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.js","sources":["../../src/core/error.ts"],"sourcesContent":["/**\n * The failures the graph names itself: no GPU device to draw with, or the one it had was taken back;\n * a corpus with no positioned vertex type to draw; a crossfilter clause it cannot ask the corpus. A\n * corpus fossil will not read never gets here: `open` refuses it, coded. `data.after` is set when a deadline fired. Everything else reaches `onFailure` as thrown.\n */\nexport class GraphError extends Error {\n  override readonly name = \"GraphError\";\n  constructor(\n    readonly code: \"graph/no-webgl\" | \"graph/context-lost\" | \"graph/nothing-to-draw\" | \"graph/untranslatable-filter\",\n    message: string,\n    readonly data: { readonly after?: number } = {},\n    options?: ErrorOptions,\n  ) {\n    super(message, options);\n  }\n}\n"],"names":["GraphError","code","message","data","options","__publicField"],"mappings":";;;AAKO,MAAMA,UAAmB,MAAM;AAAA,EAEpC,YACWC,GACTC,GACSC,IAAoC,CAAA,GAC7CC,GACA;AACA,UAAMF,GAASE,CAAO;AAPN,IAAAC,EAAA,cAAO;AAEd,SAAA,OAAAJ,GAEA,KAAA,OAAAE;AAAA,EAIX;AACF;"}

package/dist/core/filter.d.ts

@@ -1,18 +1,5 @@
 import { Filter } from '@fossil-lang/corpus';
 import { MosaicClient, Selection } from '@kanzo-tech/mosaic';
-/**
- * **The page's crossfilter, as scan's typed filter.** The graph listens to the `Selection` rather
- * than being a client of the coordinator: a client hands the coordinator SQL to run, and the graph
- * has none — it hands fossil a `Filter` and fossil binds it. So this takes the half of Mosaic's
- * protocol that is about filtering: the `value` event, and `selection.predicate(client)`.
- *
- * The nodes are read by their `type`, never by importing mosaic-sql's classes: what arrives is
- * whatever the page's copy of mosaic-sql built.
- */
-/** A predicate this cannot express as a `Filter` — reported, never dropped. */
-export declare class UntranslatableFilter extends Error {
-    readonly name = "UntranslatableFilter";
-}
 /** One mosaic-sql expression node → one `Filter`. */
 export declare function translate(node: unknown): Filter;
 /** Every column a filter names, once each. */

package/dist/core/filter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../src/core/filter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAW,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,YAAY,EAAgB,KAAK,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEhF;;;;;;;;GAQG;AAEH,+EAA+E;AAC/E,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,SAAkB,IAAI,0BAA0B;CACjD;AAoDD,qDAAqD;AACrD,wBAAgB,SAAS,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAyC/C;AAID,8CAA8C;AAC9C,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAMlD;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAItF;AAED;;;GAGG;AACH,wBAAgB,WAAW,IAAI,YAAY,CAE1C;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,SAAS,EAAE,SAAS,EACpB,IAAI,EAAE,YAAY,EAClB,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,GAC5B,IAAI,CAON"}
+{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../src/core/filter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAW,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,YAAY,EAAgB,KAAK,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAiEhF,qDAAqD;AACrD,wBAAgB,SAAS,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAyC/C;AAID,8CAA8C;AAC9C,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAMlD;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAItF;AAED;;;GAGG;AACH,wBAAgB,WAAW,IAAI,YAAY,CAE1C;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CACrB,SAAS,EAAE,SAAS,EACpB,IAAI,EAAE,YAAY,EAClB,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,GAC5B,IAAI,CAON"}

package/dist/core/filter.js

@@ -1,14 +1,6 @@
-var m = Object.defineProperty;
-var O = (n, t, r) => t in n ? m(n, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : n[t] = r;
-var f = (n, t, r) => O(n, typeof t != "symbol" ? t + "" : t, r);
-import { MosaicClient as h, clausePoints as y } from "@kanzo-tech/mosaic";
-class A extends Error {
-  constructor() {
-    super(...arguments);
-    f(this, "name", "UntranslatableFilter");
-  }
-}
-const N = {
+import { MosaicClient as f, clausePoints as m } from "@kanzo-tech/mosaic";
+import { GraphError as h } from "./error.js";
+const O = {
   "=": "=",
   "==": "=",
   "IS NOT DISTINCT FROM": "=",
@@ -18,86 +10,86 @@ const N = {
   "<=": "<=",
   ">": ">",
   ">=": ">="
-}, g = { "=": "=", "!=": "!=", "<": ">", "<=": ">=", ">": "<", ">=": "<=" }, o = (n) => {
-  throw new A(
-    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(n)}`
+}, y = { "=": "=", "!=": "!=", "<": ">", "<=": ">=", ">": "<", ">=": "<=" }, o = (r) => {
+  throw new h(
+    "graph/untranslatable-filter",
+    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(r)}`
   );
 };
-function s(n) {
-  const t = n;
+function a(r) {
+  const t = r;
   return (t == null ? void 0 : t.type) === "COLUMN_REF" && typeof t.name == "string" ? t.name : null;
 }
-function u(n) {
-  const t = n, r = (t == null ? void 0 : t.type) === "LITERAL" || (t == null ? void 0 : t.type) === "PARAM" ? t.value : o(n);
-  if (typeof r == "number" || typeof r == "bigint" || typeof r == "string" || typeof r == "boolean")
-    return r;
-  if (r instanceof Date) {
-    const e = r.toISOString();
+function s(r) {
+  const t = r, n = (t == null ? void 0 : t.type) === "LITERAL" || (t == null ? void 0 : t.type) === "PARAM" ? t.value : o(r);
+  if (typeof n == "number" || typeof n == "bigint" || typeof n == "string" || typeof n == "boolean")
+    return n;
+  if (n instanceof Date) {
+    const e = n.toISOString();
     return e.endsWith("T00:00:00.000Z") ? e.slice(0, 10) : e.replace("T", " ").replace("Z", "");
   }
-  return o(n);
+  return o(r);
 }
-function v(n) {
-  const t = n;
-  return (Array.isArray(n) ? n : Array.isArray(t == null ? void 0 : t.values) ? t.values : o(n)).map(u);
+function A(r) {
+  const t = r;
+  return (Array.isArray(r) ? r : Array.isArray(t == null ? void 0 : t.values) ? t.values : o(r)).map(s);
 }
-function c(n) {
-  const t = n;
-  if (Array.isArray(n)) return i(n.map(c));
+function c(r) {
+  const t = r;
+  if (Array.isArray(r)) return i(r.map(c));
   switch (t == null ? void 0 : t.type) {
     case "LOGICAL_OPERATOR": {
-      const r = (t.clauses ?? []).map(c);
-      return t.op === "OR" ? { or: r } : i(r);
+      const n = (t.clauses ?? []).map(c);
+      return t.op === "OR" ? { or: n } : i(n);
     }
     case "UNARY":
-      return t.op === "NOT" ? { not: c(t.expr) } : o(n);
+      return t.op === "NOT" ? { not: c(t.expr) } : o(r);
     case "UNARY_POSTFIX": {
-      const r = s(t.expr) ?? o(n);
-      return t.op === "IS NULL" ? { column: r, op: "is null" } : t.op === "IS NOT NULL" ? { column: r, op: "not null" } : o(n);
+      const n = a(t.expr) ?? o(r);
+      return t.op === "IS NULL" ? { column: n, op: "is null" } : t.op === "IS NOT NULL" ? { column: n, op: "not null" } : o(r);
     }
     case "BINARY": {
-      const r = N[String(t.op).toUpperCase()] ?? o(n), e = s(t.left);
-      return e !== null ? { column: e, op: r, value: u(t.right) } : { column: s(t.right) ?? o(n), op: g[r], value: u(t.left) };
+      const n = O[String(t.op).toUpperCase()] ?? o(r), e = a(t.left);
+      return e !== null ? { column: e, op: n, value: s(t.right) } : { column: a(t.right) ?? o(r), op: y[n], value: s(t.left) };
     }
     case "BETWEEN":
     case "NOT_BETWEEN": {
-      const r = s(t.expr) ?? o(n), [e, a] = t.extent ?? o(n), p = i([
-        { column: r, op: ">=", value: u(e) },
-        { column: r, op: "<=", value: u(a) }
+      const n = a(t.expr) ?? o(r), [e, u] = t.extent ?? o(r), p = i([
+        { column: n, op: ">=", value: s(e) },
+        { column: n, op: "<=", value: s(u) }
       ]);
       return t.type === "BETWEEN" ? p : { not: p };
     }
     case "IN":
-      return { column: s(t.expr) ?? o(n), op: "in", values: v(t.values) };
+      return { column: a(t.expr) ?? o(r), op: "in", values: A(t.values) };
     default:
-      return o(n);
+      return o(r);
   }
 }
-const i = (n) => n.length === 1 ? n[0] : { and: n };
-function l(n) {
-  return "column" in n ? [n.column] : "and" in n ? [...new Set(n.and.flatMap(l))] : "or" in n ? [...new Set(n.or.flatMap(l))] : "not" in n ? l(n.not) : [];
+const i = (r) => r.length === 1 ? r[0] : { and: r };
+function l(r) {
+  return "column" in r ? [r.column] : "and" in r ? [...new Set(r.and.flatMap(l))] : "or" in r ? [...new Set(r.or.flatMap(l))] : "not" in r ? l(r.not) : [];
 }
-function S(n, t) {
-  const r = n.predicate(t), e = (Array.isArray(r) ? r : [r]).filter((a) => a != null);
+function v(r, t) {
+  const n = r.predicate(t), e = (Array.isArray(n) ? n : [n]).filter((u) => u != null);
   return e.length === 0 ? void 0 : c(e);
 }
-function T() {
-  return new h();
+function E() {
+  return new f();
 }
-function I(n, t, r, e) {
-  n.update(
-    y([r], e && e.length > 0 ? e.map((a) => [a]) : void 0, {
+function R(r, t, n, e) {
+  r.update(
+    m([n], e && e.length > 0 ? e.map((u) => [u]) : void 0, {
       source: t,
       clients: /* @__PURE__ */ new Set([t])
     })
   );
 }
 export {
-  A as UntranslatableFilter,
   l as columnsOf,
-  S as filterFor,
-  T as graphClient,
-  I as publish,
+  v as filterFor,
+  E as graphClient,
+  R as publish,
   c as translate
 };
 //# sourceMappingURL=filter.js.map

package/dist/core/filter.js.map

@@ -1 +1 @@
-{"version":3,"file":"filter.js","sources":["../../src/core/filter.ts"],"sourcesContent":["import type { Filter, Literal } from \"@fossil-lang/corpus\";\nimport { MosaicClient, clausePoints, type Selection } from \"@kanzo-tech/mosaic\";\n\n/**\n * **The page's crossfilter, as scan's typed filter.** The graph listens to the `Selection` rather\n * than being a client of the coordinator: a client hands the coordinator SQL to run, and the graph\n * has none — it hands fossil a `Filter` and fossil binds it. So this takes the half of Mosaic's\n * protocol that is about filtering: the `value` event, and `selection.predicate(client)`.\n *\n * The nodes are read by their `type`, never by importing mosaic-sql's classes: what arrives is\n * whatever the page's copy of mosaic-sql built.\n */\n\n/** A predicate this cannot express as a `Filter` — reported, never dropped. */\nexport class UntranslatableFilter extends Error {\n  override readonly name = \"UntranslatableFilter\";\n}\n\ninterface Node {\n  readonly type?: string;\n  readonly op?: string;\n  readonly [field: string]: unknown;\n}\n\nconst COMPARISONS: Record<string, \"=\" | \"!=\" | \"<\" | \"<=\" | \">\" | \">=\"> = {\n  \"=\": \"=\",\n  \"==\": \"=\",\n  \"IS NOT DISTINCT FROM\": \"=\",\n  \"<>\": \"!=\",\n  \"!=\": \"!=\",\n  \"<\": \"<\",\n  \"<=\": \"<=\",\n  \">\": \">\",\n  \">=\": \">=\",\n};\nconst MIRRORED = { \"=\": \"=\", \"!=\": \"!=\", \"<\": \">\", \"<=\": \">=\", \">\": \"<\", \">=\": \"<=\" } as const;\n\nconst fail = (what: unknown): never => {\n  throw new UntranslatableFilter(\n    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(what)}`,\n  );\n};\n\nfunction columnOf(node: unknown): string | null {\n  const n = node as Node | null;\n  if (n?.type === \"COLUMN_REF\" && typeof n.name === \"string\") return n.name;\n  return null;\n}\n\nfunction literalOf(node: unknown): Literal {\n  const n = node as Node | null;\n  const value = n?.type === \"LITERAL\" || n?.type === \"PARAM\" ? n.value : fail(node);\n  if (typeof value === \"number\" || typeof value === \"bigint\" || typeof value === \"string\" || typeof value === \"boolean\") {\n    return value;\n  }\n  if (value instanceof Date) {\n    const iso = value.toISOString();\n    return iso.endsWith(\"T00:00:00.000Z\") ? iso.slice(0, 10) : iso.replace(\"T\", \" \").replace(\"Z\", \"\");\n  }\n  return fail(node);\n}\n\nfunction valuesOf(node: unknown): Literal[] {\n  const n = node as Node | null;\n  const list = Array.isArray(node) ? node : Array.isArray(n?.values) ? n.values : fail(node);\n  return (list as unknown[]).map(literalOf);\n}\n\n/** One mosaic-sql expression node → one `Filter`. */\nexport function translate(node: unknown): Filter {\n  const n = node as Node | null;\n  if (Array.isArray(node)) return and(node.map(translate));\n  switch (n?.type) {\n    case \"LOGICAL_OPERATOR\": {\n      const clauses = ((n.clauses as unknown[] | undefined) ?? []).map(translate);\n      return n.op === \"OR\" ? { or: clauses } : and(clauses);\n    }\n    case \"UNARY\":\n      if (n.op === \"NOT\") return { not: translate(n.expr) };\n      return fail(node);\n    case \"UNARY_POSTFIX\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      if (n.op === \"IS NULL\") return { column, op: \"is null\" };\n      if (n.op === \"IS NOT NULL\") return { column, op: \"not null\" };\n      return fail(node);\n    }\n    case \"BINARY\": {\n      const op = COMPARISONS[String(n.op).toUpperCase()] ?? fail(node);\n      const left = columnOf(n.left);\n      if (left !== null) return { column: left, op, value: literalOf(n.right) };\n      const right = columnOf(n.right) ?? fail(node);\n      return { column: right, op: MIRRORED[op], value: literalOf(n.left) };\n    }\n    case \"BETWEEN\":\n    case \"NOT_BETWEEN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      const [lo, hi] = (n.extent as unknown[] | undefined) ?? fail(node);\n      const within: Filter = and([\n        { column, op: \">=\", value: literalOf(lo) },\n        { column, op: \"<=\", value: literalOf(hi) },\n      ]);\n      return n.type === \"BETWEEN\" ? within : { not: within };\n    }\n    case \"IN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      return { column, op: \"in\", values: valuesOf(n.values) };\n    }\n    default:\n      return fail(node);\n  }\n}\n\nconst and = (clauses: Filter[]): Filter => (clauses.length === 1 ? (clauses[0] as Filter) : { and: clauses });\n\n/** Every column a filter names, once each. */\nexport function columnsOf(filter: Filter): string[] {\n  if (\"column\" in filter) return [filter.column];\n  if (\"and\" in filter) return [...new Set(filter.and.flatMap(columnsOf))];\n  if (\"or\" in filter) return [...new Set(filter.or.flatMap(columnsOf))];\n  if (\"not\" in filter) return columnsOf(filter.not);\n  return [];\n}\n\n/**\n * The page's filter for the graph, or `undefined` for none. `selection.predicate` skips the clause\n * the graph published itself, which is the exemption the next function takes back.\n */\nexport function filterFor(selection: Selection, self: MosaicClient): Filter | undefined {\n  const predicate = selection.predicate(self) as unknown;\n  const clauses = (Array.isArray(predicate) ? predicate : [predicate]).filter((p) => p !== undefined && p !== null);\n  return clauses.length === 0 ? undefined : translate(clauses);\n}\n\n/**\n * An identity for `clients`, and nothing more: it is never connected, so the coordinator never\n * queries on its behalf.\n */\nexport function graphClient(): MosaicClient {\n  return new MosaicClient();\n}\n\n/**\n * **The reader's pick, published** — naming the graph in `clients`, so the crossfilter skips it for\n * the graph and applies it to every chart. A canvas that draws only what survives would otherwise\n * answer a lasso of thirteen by removing the other 1,530.\n */\nexport function publish(\n  selection: Selection,\n  self: MosaicClient,\n  column: string,\n  ids: readonly number[] | null,\n): void {\n  selection.update(\n    clausePoints([column], ids && ids.length > 0 ? ids.map((d) => [d]) : undefined, {\n      source: self,\n      clients: new Set([self]),\n    }),\n  );\n}\n"],"names":["UntranslatableFilter","__publicField","COMPARISONS","MIRRORED","fail","what","columnOf","node","n","literalOf","value","iso","valuesOf","translate","and","clauses","column","op","left","lo","hi","within","columnsOf","filter","filterFor","selection","self","predicate","p","graphClient","MosaicClient","publish","ids","clausePoints","d"],"mappings":";;;;AAcO,MAAMA,UAA6B,MAAM;AAAA,EAAzC;AAAA;AACa,IAAAC,EAAA,cAAO;AAAA;AAC3B;AAQA,MAAMC,IAAoE;AAAA,EACxE,KAAK;AAAA,EACL,MAAM;AAAA,EACN,wBAAwB;AAAA,EACxB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AACR,GACMC,IAAW,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAA,GAEzEC,IAAO,CAACC,MAAyB;AACrC,QAAM,IAAIL;AAAA,IACR,+EAA+E,OAAOK,CAAI,CAAC;AAAA,EAAA;AAE/F;AAEA,SAASC,EAASC,GAA8B;AAC9C,QAAMC,IAAID;AACV,UAAIC,KAAA,gBAAAA,EAAG,UAAS,gBAAgB,OAAOA,EAAE,QAAS,WAAiBA,EAAE,OAC9D;AACT;AAEA,SAASC,EAAUF,GAAwB;AACzC,QAAMC,IAAID,GACJG,KAAQF,KAAA,gBAAAA,EAAG,UAAS,cAAaA,KAAA,gBAAAA,EAAG,UAAS,UAAUA,EAAE,QAAQJ,EAAKG,CAAI;AAChF,MAAI,OAAOG,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU;AAC1G,WAAOA;AAET,MAAIA,aAAiB,MAAM;AACzB,UAAMC,IAAMD,EAAM,YAAA;AAClB,WAAOC,EAAI,SAAS,gBAAgB,IAAIA,EAAI,MAAM,GAAG,EAAE,IAAIA,EAAI,QAAQ,KAAK,GAAG,EAAE,QAAQ,KAAK,EAAE;AAAA,EAClG;AACA,SAAOP,EAAKG,CAAI;AAClB;AAEA,SAASK,EAASL,GAA0B;AAC1C,QAAMC,IAAID;AAEV,UADa,MAAM,QAAQA,CAAI,IAAIA,IAAO,MAAM,QAAQC,KAAA,gBAAAA,EAAG,MAAM,IAAIA,EAAE,SAASJ,EAAKG,CAAI,GAC9D,IAAIE,CAAS;AAC1C;AAGO,SAASI,EAAUN,GAAuB;AAC/C,QAAMC,IAAID;AACV,MAAI,MAAM,QAAQA,CAAI,UAAUO,EAAIP,EAAK,IAAIM,CAAS,CAAC;AACvD,UAAQL,KAAA,gBAAAA,EAAG,MAAA;AAAA,IACT,KAAK,oBAAoB;AACvB,YAAMO,KAAYP,EAAE,WAAqC,CAAA,GAAI,IAAIK,CAAS;AAC1E,aAAOL,EAAE,OAAO,OAAO,EAAE,IAAIO,EAAA,IAAYD,EAAIC,CAAO;AAAA,IACtD;AAAA,IACA,KAAK;AACH,aAAIP,EAAE,OAAO,QAAc,EAAE,KAAKK,EAAUL,EAAE,IAAI,EAAA,IAC3CJ,EAAKG,CAAI;AAAA,IAClB,KAAK,iBAAiB;AACpB,YAAMS,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI;AAC5C,aAAIC,EAAE,OAAO,YAAkB,EAAE,QAAAQ,GAAQ,IAAI,UAAA,IACzCR,EAAE,OAAO,gBAAsB,EAAE,QAAAQ,GAAQ,IAAI,WAAA,IAC1CZ,EAAKG,CAAI;AAAA,IAClB;AAAA,IACA,KAAK,UAAU;AACb,YAAMU,IAAKf,EAAY,OAAOM,EAAE,EAAE,EAAE,YAAA,CAAa,KAAKJ,EAAKG,CAAI,GACzDW,IAAOZ,EAASE,EAAE,IAAI;AAC5B,aAAIU,MAAS,OAAa,EAAE,QAAQA,GAAM,IAAAD,GAAI,OAAOR,EAAUD,EAAE,KAAK,EAAA,IAE/D,EAAE,QADKF,EAASE,EAAE,KAAK,KAAKJ,EAAKG,CAAI,GACpB,IAAIJ,EAASc,CAAE,GAAG,OAAOR,EAAUD,EAAE,IAAI,EAAA;AAAA,IACnE;AAAA,IACA,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,YAAMQ,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GACtC,CAACY,GAAIC,CAAE,IAAKZ,EAAE,UAAoCJ,EAAKG,CAAI,GAC3Dc,IAAiBP,EAAI;AAAA,QACzB,EAAE,QAAAE,GAAQ,IAAI,MAAM,OAAOP,EAAUU,CAAE,EAAA;AAAA,QACvC,EAAE,QAAAH,GAAQ,IAAI,MAAM,OAAOP,EAAUW,CAAE,EAAA;AAAA,MAAE,CAC1C;AACD,aAAOZ,EAAE,SAAS,YAAYa,IAAS,EAAE,KAAKA,EAAA;AAAA,IAChD;AAAA,IACA,KAAK;AAEH,aAAO,EAAE,QADMf,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GAC3B,IAAI,MAAM,QAAQK,EAASJ,EAAE,MAAM,EAAA;AAAA,IAEtD;AACE,aAAOJ,EAAKG,CAAI;AAAA,EAAA;AAEtB;AAEA,MAAMO,IAAM,CAACC,MAA+BA,EAAQ,WAAW,IAAKA,EAAQ,CAAC,IAAe,EAAE,KAAKA,EAAA;AAG5F,SAASO,EAAUC,GAA0B;AAClD,SAAI,YAAYA,IAAe,CAACA,EAAO,MAAM,IACzC,SAASA,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,IAAI,QAAQD,CAAS,CAAC,CAAC,IAClE,QAAQC,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,GAAG,QAAQD,CAAS,CAAC,CAAC,IAChE,SAASC,IAAeD,EAAUC,EAAO,GAAG,IACzC,CAAA;AACT;AAMO,SAASC,EAAUC,GAAsBC,GAAwC;AACtF,QAAMC,IAAYF,EAAU,UAAUC,CAAI,GACpCX,KAAW,MAAM,QAAQY,CAAS,IAAIA,IAAY,CAACA,CAAS,GAAG,OAAO,CAACC,MAAyBA,KAAM,IAAI;AAChH,SAAOb,EAAQ,WAAW,IAAI,SAAYF,EAAUE,CAAO;AAC7D;AAMO,SAASc,IAA4B;AAC1C,SAAO,IAAIC,EAAA;AACb;AAOO,SAASC,EACdN,GACAC,GACAV,GACAgB,GACM;AACN,EAAAP,EAAU;AAAA,IACRQ,EAAa,CAACjB,CAAM,GAAGgB,KAAOA,EAAI,SAAS,IAAIA,EAAI,IAAI,CAACE,MAAM,CAACA,CAAC,CAAC,IAAI,QAAW;AAAA,MAC9E,QAAQR;AAAA,MACR,SAAS,oBAAI,IAAI,CAACA,CAAI,CAAC;AAAA,IAAA,CACxB;AAAA,EAAA;AAEL;"}
+{"version":3,"file":"filter.js","sources":["../../src/core/filter.ts"],"sourcesContent":["import type { Filter, Literal } from \"@fossil-lang/corpus\";\nimport { MosaicClient, clausePoints, type Selection } from \"@kanzo-tech/mosaic\";\nimport { GraphError } from \"./error\";\n\n/**\n * **The page's crossfilter, as scan's typed filter.** The graph listens to the `Selection` rather\n * than being a client of the coordinator: a client hands the coordinator SQL to run, and the graph\n * has none — it hands fossil a `Filter` and fossil binds it. So this takes the half of Mosaic's\n * protocol that is about filtering: the `value` event, and `selection.predicate(client)`.\n *\n * The nodes are read by their `type`, never by importing mosaic-sql's classes: what arrives is\n * whatever the page's copy of mosaic-sql built.\n */\n\ninterface Node {\n  readonly type?: string;\n  readonly op?: string;\n  readonly [field: string]: unknown;\n}\n\nconst COMPARISONS: Record<string, \"=\" | \"!=\" | \"<\" | \"<=\" | \">\" | \">=\"> = {\n  \"=\": \"=\",\n  \"==\": \"=\",\n  \"IS NOT DISTINCT FROM\": \"=\",\n  \"<>\": \"!=\",\n  \"!=\": \"!=\",\n  \"<\": \"<\",\n  \"<=\": \"<=\",\n  \">\": \">\",\n  \">=\": \">=\",\n};\nconst MIRRORED = { \"=\": \"=\", \"!=\": \"!=\", \"<\": \">\", \"<=\": \">=\", \">\": \"<\", \">=\": \"<=\" } as const;\n\n/** A predicate this cannot express as a `Filter` — reported, never dropped. */\nconst fail = (what: unknown): never => {\n  throw new GraphError(\n    \"graph/untranslatable-filter\",\n    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(what)}`,\n  );\n};\n\nfunction columnOf(node: unknown): string | null {\n  const n = node as Node | null;\n  if (n?.type === \"COLUMN_REF\" && typeof n.name === \"string\") return n.name;\n  return null;\n}\n\nfunction literalOf(node: unknown): Literal {\n  const n = node as Node | null;\n  const value = n?.type === \"LITERAL\" || n?.type === \"PARAM\" ? n.value : fail(node);\n  if (typeof value === \"number\" || typeof value === \"bigint\" || typeof value === \"string\" || typeof value === \"boolean\") {\n    return value;\n  }\n  if (value instanceof Date) {\n    const iso = value.toISOString();\n    return iso.endsWith(\"T00:00:00.000Z\") ? iso.slice(0, 10) : iso.replace(\"T\", \" \").replace(\"Z\", \"\");\n  }\n  return fail(node);\n}\n\nfunction valuesOf(node: unknown): Literal[] {\n  const n = node as Node | null;\n  const list = Array.isArray(node) ? node : Array.isArray(n?.values) ? n.values : fail(node);\n  return (list as unknown[]).map(literalOf);\n}\n\n/** One mosaic-sql expression node → one `Filter`. */\nexport function translate(node: unknown): Filter {\n  const n = node as Node | null;\n  if (Array.isArray(node)) return and(node.map(translate));\n  switch (n?.type) {\n    case \"LOGICAL_OPERATOR\": {\n      const clauses = ((n.clauses as unknown[] | undefined) ?? []).map(translate);\n      return n.op === \"OR\" ? { or: clauses } : and(clauses);\n    }\n    case \"UNARY\":\n      if (n.op === \"NOT\") return { not: translate(n.expr) };\n      return fail(node);\n    case \"UNARY_POSTFIX\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      if (n.op === \"IS NULL\") return { column, op: \"is null\" };\n      if (n.op === \"IS NOT NULL\") return { column, op: \"not null\" };\n      return fail(node);\n    }\n    case \"BINARY\": {\n      const op = COMPARISONS[String(n.op).toUpperCase()] ?? fail(node);\n      const left = columnOf(n.left);\n      if (left !== null) return { column: left, op, value: literalOf(n.right) };\n      const right = columnOf(n.right) ?? fail(node);\n      return { column: right, op: MIRRORED[op], value: literalOf(n.left) };\n    }\n    case \"BETWEEN\":\n    case \"NOT_BETWEEN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      const [lo, hi] = (n.extent as unknown[] | undefined) ?? fail(node);\n      const within: Filter = and([\n        { column, op: \">=\", value: literalOf(lo) },\n        { column, op: \"<=\", value: literalOf(hi) },\n      ]);\n      return n.type === \"BETWEEN\" ? within : { not: within };\n    }\n    case \"IN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      return { column, op: \"in\", values: valuesOf(n.values) };\n    }\n    default:\n      return fail(node);\n  }\n}\n\nconst and = (clauses: Filter[]): Filter => (clauses.length === 1 ? (clauses[0] as Filter) : { and: clauses });\n\n/** Every column a filter names, once each. */\nexport function columnsOf(filter: Filter): string[] {\n  if (\"column\" in filter) return [filter.column];\n  if (\"and\" in filter) return [...new Set(filter.and.flatMap(columnsOf))];\n  if (\"or\" in filter) return [...new Set(filter.or.flatMap(columnsOf))];\n  if (\"not\" in filter) return columnsOf(filter.not);\n  return [];\n}\n\n/**\n * The page's filter for the graph, or `undefined` for none. `selection.predicate` skips the clause\n * the graph published itself, which is the exemption the next function takes back.\n */\nexport function filterFor(selection: Selection, self: MosaicClient): Filter | undefined {\n  const predicate = selection.predicate(self) as unknown;\n  const clauses = (Array.isArray(predicate) ? predicate : [predicate]).filter((p) => p !== undefined && p !== null);\n  return clauses.length === 0 ? undefined : translate(clauses);\n}\n\n/**\n * An identity for `clients`, and nothing more: it is never connected, so the coordinator never\n * queries on its behalf.\n */\nexport function graphClient(): MosaicClient {\n  return new MosaicClient();\n}\n\n/**\n * **The reader's pick, published** — naming the graph in `clients`, so the crossfilter skips it for\n * the graph and applies it to every chart. A canvas that draws only what survives would otherwise\n * answer a lasso of thirteen by removing the other 1,530.\n */\nexport function publish(\n  selection: Selection,\n  self: MosaicClient,\n  column: string,\n  ids: readonly number[] | null,\n): void {\n  selection.update(\n    clausePoints([column], ids && ids.length > 0 ? ids.map((d) => [d]) : undefined, {\n      source: self,\n      clients: new Set([self]),\n    }),\n  );\n}\n"],"names":["COMPARISONS","MIRRORED","fail","what","GraphError","columnOf","node","n","literalOf","value","iso","valuesOf","translate","and","clauses","column","op","left","lo","hi","within","columnsOf","filter","filterFor","selection","self","predicate","p","graphClient","MosaicClient","publish","ids","clausePoints","d"],"mappings":";;AAoBA,MAAMA,IAAoE;AAAA,EACxE,KAAK;AAAA,EACL,MAAM;AAAA,EACN,wBAAwB;AAAA,EACxB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AACR,GACMC,IAAW,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAA,GAGzEC,IAAO,CAACC,MAAyB;AACrC,QAAM,IAAIC;AAAA,IACR;AAAA,IACA,+EAA+E,OAAOD,CAAI,CAAC;AAAA,EAAA;AAE/F;AAEA,SAASE,EAASC,GAA8B;AAC9C,QAAMC,IAAID;AACV,UAAIC,KAAA,gBAAAA,EAAG,UAAS,gBAAgB,OAAOA,EAAE,QAAS,WAAiBA,EAAE,OAC9D;AACT;AAEA,SAASC,EAAUF,GAAwB;AACzC,QAAMC,IAAID,GACJG,KAAQF,KAAA,gBAAAA,EAAG,UAAS,cAAaA,KAAA,gBAAAA,EAAG,UAAS,UAAUA,EAAE,QAAQL,EAAKI,CAAI;AAChF,MAAI,OAAOG,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU;AAC1G,WAAOA;AAET,MAAIA,aAAiB,MAAM;AACzB,UAAMC,IAAMD,EAAM,YAAA;AAClB,WAAOC,EAAI,SAAS,gBAAgB,IAAIA,EAAI,MAAM,GAAG,EAAE,IAAIA,EAAI,QAAQ,KAAK,GAAG,EAAE,QAAQ,KAAK,EAAE;AAAA,EAClG;AACA,SAAOR,EAAKI,CAAI;AAClB;AAEA,SAASK,EAASL,GAA0B;AAC1C,QAAMC,IAAID;AAEV,UADa,MAAM,QAAQA,CAAI,IAAIA,IAAO,MAAM,QAAQC,KAAA,gBAAAA,EAAG,MAAM,IAAIA,EAAE,SAASL,EAAKI,CAAI,GAC9D,IAAIE,CAAS;AAC1C;AAGO,SAASI,EAAUN,GAAuB;AAC/C,QAAMC,IAAID;AACV,MAAI,MAAM,QAAQA,CAAI,UAAUO,EAAIP,EAAK,IAAIM,CAAS,CAAC;AACvD,UAAQL,KAAA,gBAAAA,EAAG,MAAA;AAAA,IACT,KAAK,oBAAoB;AACvB,YAAMO,KAAYP,EAAE,WAAqC,CAAA,GAAI,IAAIK,CAAS;AAC1E,aAAOL,EAAE,OAAO,OAAO,EAAE,IAAIO,EAAA,IAAYD,EAAIC,CAAO;AAAA,IACtD;AAAA,IACA,KAAK;AACH,aAAIP,EAAE,OAAO,QAAc,EAAE,KAAKK,EAAUL,EAAE,IAAI,EAAA,IAC3CL,EAAKI,CAAI;AAAA,IAClB,KAAK,iBAAiB;AACpB,YAAMS,IAASV,EAASE,EAAE,IAAI,KAAKL,EAAKI,CAAI;AAC5C,aAAIC,EAAE,OAAO,YAAkB,EAAE,QAAAQ,GAAQ,IAAI,UAAA,IACzCR,EAAE,OAAO,gBAAsB,EAAE,QAAAQ,GAAQ,IAAI,WAAA,IAC1Cb,EAAKI,CAAI;AAAA,IAClB;AAAA,IACA,KAAK,UAAU;AACb,YAAMU,IAAKhB,EAAY,OAAOO,EAAE,EAAE,EAAE,YAAA,CAAa,KAAKL,EAAKI,CAAI,GACzDW,IAAOZ,EAASE,EAAE,IAAI;AAC5B,aAAIU,MAAS,OAAa,EAAE,QAAQA,GAAM,IAAAD,GAAI,OAAOR,EAAUD,EAAE,KAAK,EAAA,IAE/D,EAAE,QADKF,EAASE,EAAE,KAAK,KAAKL,EAAKI,CAAI,GACpB,IAAIL,EAASe,CAAE,GAAG,OAAOR,EAAUD,EAAE,IAAI,EAAA;AAAA,IACnE;AAAA,IACA,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,YAAMQ,IAASV,EAASE,EAAE,IAAI,KAAKL,EAAKI,CAAI,GACtC,CAACY,GAAIC,CAAE,IAAKZ,EAAE,UAAoCL,EAAKI,CAAI,GAC3Dc,IAAiBP,EAAI;AAAA,QACzB,EAAE,QAAAE,GAAQ,IAAI,MAAM,OAAOP,EAAUU,CAAE,EAAA;AAAA,QACvC,EAAE,QAAAH,GAAQ,IAAI,MAAM,OAAOP,EAAUW,CAAE,EAAA;AAAA,MAAE,CAC1C;AACD,aAAOZ,EAAE,SAAS,YAAYa,IAAS,EAAE,KAAKA,EAAA;AAAA,IAChD;AAAA,IACA,KAAK;AAEH,aAAO,EAAE,QADMf,EAASE,EAAE,IAAI,KAAKL,EAAKI,CAAI,GAC3B,IAAI,MAAM,QAAQK,EAASJ,EAAE,MAAM,EAAA;AAAA,IAEtD;AACE,aAAOL,EAAKI,CAAI;AAAA,EAAA;AAEtB;AAEA,MAAMO,IAAM,CAACC,MAA+BA,EAAQ,WAAW,IAAKA,EAAQ,CAAC,IAAe,EAAE,KAAKA,EAAA;AAG5F,SAASO,EAAUC,GAA0B;AAClD,SAAI,YAAYA,IAAe,CAACA,EAAO,MAAM,IACzC,SAASA,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,IAAI,QAAQD,CAAS,CAAC,CAAC,IAClE,QAAQC,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,GAAG,QAAQD,CAAS,CAAC,CAAC,IAChE,SAASC,IAAeD,EAAUC,EAAO,GAAG,IACzC,CAAA;AACT;AAMO,SAASC,EAAUC,GAAsBC,GAAwC;AACtF,QAAMC,IAAYF,EAAU,UAAUC,CAAI,GACpCX,KAAW,MAAM,QAAQY,CAAS,IAAIA,IAAY,CAACA,CAAS,GAAG,OAAO,CAACC,MAAyBA,KAAM,IAAI;AAChH,SAAOb,EAAQ,WAAW,IAAI,SAAYF,EAAUE,CAAO;AAC7D;AAMO,SAASc,IAA4B;AAC1C,SAAO,IAAIC,EAAA;AACb;AAOO,SAASC,EACdN,GACAC,GACAV,GACAgB,GACM;AACN,EAAAP,EAAU;AAAA,IACRQ,EAAa,CAACjB,CAAM,GAAGgB,KAAOA,EAAI,SAAS,IAAIA,EAAI,IAAI,CAACE,MAAM,CAACA,CAAC,CAAC,IAAI,QAAW;AAAA,MAC9E,QAAQR;AAAA,MACR,SAAS,oBAAI,IAAI,CAACA,CAAI,CAAC;AAAA,IAAA,CACxB;AAAA,EAAA;AAEL;"}

package/dist/core/load.d.ts

@@ -35,6 +35,11 @@ export interface Encoding {
 }
 /** The vertex tables fossil lays out or the program places; a table without a position is not drawn. */
 export declare const drawnTables: (corpus: Corpus) => VertexTable[];
+/**
+ * Reads in parallel that end together: the first to fail aborts the rest, so no read outlives the
+ * answer and no second failure goes unheard behind the first.
+ */
+export declare function together<T>(signal: AbortSignal, reads: (signal: AbortSignal) => Promise<T>): Promise<T>;
 /** One scan per drawn table and one per relation between them, read whole, in parallel. */
 export declare function loadGraph(corpus: Corpus, binding: Binding, seed: readonly unknown[], signal: AbortSignal): Promise<{
     geometry: Geometry;

package/dist/core/load.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/core/load.ts"],"names":[],"mappings":"AACA,OAAO,EAAgB,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,KAAK,EAAS,MAAM,EAAa,MAAM,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAGzF;;;;GAIG;AAEH,gFAAgF;AAChF,MAAM,WAAW,QAAQ;IACvB,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,0CAA0C;IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAC5G;AAED,yFAAyF;AACzF,MAAM,WAAW,QAAQ;IACvB,kCAAkC;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IACpC,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;CACrC;AAED,wGAAwG;AACxG,eAAO,MAAM,WAAW,GAAI,QAAQ,MAAM,KAAG,WAAW,EAAqE,CAAC;AAgF9H,2FAA2F;AAC3F,wBAAsB,SAAS,CAC7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC;IAAE,QAAQ,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,CAAC,CAgCrD;AAED,uGAAuG;AACvG,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,QAAQ,CAAC,CAUnB;AAED,yFAAyF;AACzF,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;CACjC;AAED;;;;GAIG;AACH,wBAAsB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAkBjI;AAED,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,UAAU,CAKjE"}
+{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/core/load.ts"],"names":[],"mappings":"AAEA,OAAO,EAAgB,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,KAAK,EAAS,MAAM,EAAa,MAAM,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAGzF;;;;GAIG;AAEH,gFAAgF;AAChF,MAAM,WAAW,QAAQ;IACvB,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,0CAA0C;IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAC5G;AAED,yFAAyF;AACzF,MAAM,WAAW,QAAQ;IACvB,kCAAkC;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IACpC,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;CACrC;AAED,wGAAwG;AACxG,eAAO,MAAM,WAAW,GAAI,QAAQ,MAAM,KAAG,WAAW,EAAqE,CAAC;AAI9H;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAMvG;AA8ED,2FAA2F;AAC3F,wBAAsB,SAAS,CAC7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC;IAAE,QAAQ,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,CAAC,CAkCrD;AAED,uGAAuG;AACvG,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,QAAQ,CAAC,CAUnB;AAED,yFAAyF;AACzF,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;CACjC;AAED;;;;GAIG;AACH,wBAAsB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAoBjI;AAED,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,UAAU,CAKjE"}