@kanzo-tech/graph 0.19.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

@@ -21,4 +21,6 @@ export declare function readVertex(corpus: Corpus, geometry: Geometry, vertex: V
  * 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>>;
+/** **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,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;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,EAAE,WAAW,GAClB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAqBhC"}
+{"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,42 +1,63 @@
-import { together as k } from "./load.js";
-const w = (o, a) => a < o.size ? o.tables[o.table[a]] : void 0;
-async function v(o, a, i, r) {
-  var p, u;
-  const e = w(a, i);
-  if (!e) return null;
-  const l = /* @__PURE__ */ new Set([e.key, (p = e.position) == null ? void 0 : p.x, (u = e.position) == null ? void 0 : u.y]), c = e.properties.map((t) => t.name).filter((t) => !l.has(t)), s = o.scan({ table: e.name, filter: { column: e.key, op: "=", value: i }, select: [e.key, ...c], limit: 1 }), n = (await s.read(s.plan(), { signal: r })).find((t) => t.numRows > 0);
+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: i,
-    table: e.name,
-    fields: c.map((t) => {
-      var f;
-      return { name: t, value: ((f = n.getChild(t)) == null ? void 0 : f.toArray()[0]) ?? null };
+    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 A(o, a, i, r, e) {
-  const l = /* @__PURE__ */ new Map();
-  for (const s of i) {
-    const n = w(a, s);
-    n && l.set(n, [...l.get(n) ?? [], s]);
+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 c = /* @__PURE__ */ new Map();
-  return await k(
-    e,
-    (s) => Promise.all(
-      [...l].map(async ([n, p]) => {
-        var f, y;
-        const u = r !== void 0 && n.properties.some((m) => m.name === r) ? r : n.identity, t = o.scan({ table: n.name, filter: { column: n.key, op: "in", values: p }, select: [n.key, u] });
-        for (const m of await t.read(t.plan(), { signal: s })) {
-          const b = ((f = m.getChild(n.key)) == null ? void 0 : f.toArray()) ?? [], h = ((y = m.getChild(u)) == null ? void 0 : y.toArray()) ?? [];
-          for (let d = 0; d < m.numRows; d++) c.set(Number(b[d]), String(h[d] ?? ""));
+  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] ?? ""));
         }
       })
     )
-  ), c;
+  ), 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 {
-  A as readTitles,
-  v 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 { 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/**\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 = 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  );\n  return found;\n}\n"],"names":["tableOf","geometry","vertex","readVertex","corpus","signal","table","hidden","_a","_b","names","p","name","scan","rows","batch","readTitles","vertices","title","byTable","found","together","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;;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;AAMA,eAAsBQ,EACpBZ,GACAH,GACAgB,GACAC,GACAb,GACgC;AAChC,QAAMc,wBAAc,IAAA;AACpB,aAAWjB,KAAUe,GAAU;AAC7B,UAAMX,IAAQN,EAAQC,GAAUC,CAAM;AACtC,IAAII,KAAOa,EAAQ,IAAIb,GAAO,CAAC,GAAIa,EAAQ,IAAIb,CAAK,KAAK,CAAA,GAAKJ,CAAM,CAAC;AAAA,EACvE;AACA,QAAMkB,wBAAY,IAAA;AAClB,eAAMC;AAAA,IAAShB;AAAA,IAAQ,CAACA,MACtB,QAAQ;AAAA,MACN,CAAC,GAAGc,CAAO,EAAE,IAAI,OAAO,CAACb,GAAOgB,CAAG,MAAM;;AACvC,cAAMC,IAASL,MAAU,UAAaZ,EAAM,WAAW,KAAK,CAACK,MAAMA,EAAE,SAASO,CAAK,IAAIA,IAAQZ,EAAM,UAC/FO,IAAOT,EAAO,KAAK,EAAE,OAAOE,EAAM,MAAM,QAAQ,EAAE,QAAQA,EAAM,KAAK,IAAI,MAAM,QAAQgB,EAAA,GAAO,QAAQ,CAAChB,EAAM,KAAKiB,CAAM,GAAG;AACjI,mBAAWR,KAAS,MAAMF,EAAK,KAAKA,EAAK,KAAA,GAAQ,EAAE,QAAAR,EAAAA,CAAQ,GAAG;AAC5D,gBAAMmB,MAAOhB,IAAAO,EAAM,SAAST,EAAM,GAAG,MAAxB,gBAAAE,EAA2B,cAAa,CAAA,GAC/CiB,MAAQhB,IAAAM,EAAM,SAASQ,CAAM,MAArB,gBAAAd,EAAwB,cAAa,CAAA;AACnD,mBAASiB,IAAI,GAAGA,IAAIX,EAAM,SAASW,OAAW,IAAI,OAAOF,EAAKE,CAAC,CAAC,GAAG,OAAOD,EAAMC,CAAC,KAAK,EAAE,CAAC;AAAA,QAC3F;AAAA,MACF,CAAC;AAAA,IAAA;AAAA,EACH,GAEKN;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/state.d.ts

@@ -47,12 +47,19 @@ export interface GraphOptions extends Channels {
  * open; `loading` is the graph, a binding or a filter not yet read or not yet drawn; `idle` is all of
  * it drawn; `failed` is a corpus that would not open or read, or a canvas with no GPU device to draw
  * with — none came up, or the one it had was lost.
+ *
+ * **It is the data's life, not the layout's.** A layout running over a drawn graph is `idle` here and
+ * `running` in `motion`: two axes, because each can move without the other — a filter loads under a
+ * paused layout, and a layout runs over a graph with nothing left to read. A host that shows one word
+ * reads both, `motion === "running"` as "laying out" and `progress` for how far.
  */
 export type GraphStatus = "none" | "opening" | "loading" | "idle" | "failed";
 /** What the loaded graph holds, under the page's filter. */
 export interface Drawn {
     /** Vertices drawn: every one with a position that survives the filter. */
     readonly vertices: number;
+    /** Links drawn: every loaded relation whose two ends are drawn. */
+    readonly edges: number;
     /** What each category rank is: the seed first, then any other value seen, in rank order. */
     readonly domain: readonly unknown[];
     /** Per rank, the vertices drawn. */

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

@@ -1 +1 @@
-{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/core/state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACjD,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAElF,MAAM,WAAW,YAAa,SAAQ,QAAQ;IAC5C;;;;;;OAMG;IACH,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC5C,2DAA2D;IAC3D,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,sGAAsG;IACtG,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9C,4GAA4G;IAC5G,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,8FAA8F;IAC9F,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,kEAAkE;IAClE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IACpC,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,KAAK,IAAI,CAAC;IACjD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;CAC7C;AAED;;;;;GAKG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC;AAE7E,4DAA4D;AAC5D,MAAM,WAAW,KAAK;IACpB,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,4FAA4F;IAC5F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,+DAA+D;AAC/D,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC7B,+FAA+F;IAC/F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;CAClC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IAC5C,WAAW,IAAI,aAAa,CAAC;IAC7B,UAAU,IAAI,YAAY,CAAC;IAC3B,UAAU,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;IACxC,OAAO,IAAI,IAAI,CAAC;IAChB,MAAM,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7F,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,GAAG,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,CAAC;IACzC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,uCAAuC;IACvC,UAAU,IAAI,IAAI,CAAC;IACnB,sFAAsF;IACtF,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IACnC,yEAAyE;IACzE,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;CAC5C"}
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/core/state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACjD,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAElF,MAAM,WAAW,YAAa,SAAQ,QAAQ;IAC5C;;;;;;OAMG;IACH,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC5C,2DAA2D;IAC3D,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,sGAAsG;IACtG,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9C,4GAA4G;IAC5G,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,8FAA8F;IAC9F,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,kEAAkE;IAClE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IACpC,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,KAAK,IAAI,CAAC;IACjD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;CAC7C;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC;AAE7E,4DAA4D;AAC5D,MAAM,WAAW,KAAK;IACpB,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,mEAAmE;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,4FAA4F;IAC5F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,+DAA+D;AAC/D,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC7B,+FAA+F;IAC/F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;CAClC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IAC5C,WAAW,IAAI,aAAa,CAAC;IAC7B,UAAU,IAAI,YAAY,CAAC;IAC3B,UAAU,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;IACxC,OAAO,IAAI,IAAI,CAAC;IAChB,MAAM,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7F,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,GAAG,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,CAAC;IACzC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,uCAAuC;IACvC,UAAU,IAAI,IAAI,CAAC;IACnB,sFAAsF;IACtF,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IACnC,yEAAyE;IACzE,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;CAC5C"}

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

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAS,YAAY,EAA8B,UAAU,EAAE,MAAM,SAAS,CAAC;AAE3F,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAqBvG,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CAiW7D"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAS,YAAY,EAA8B,UAAU,EAAE,MAAM,SAAS,CAAC;AAE3F,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AA4BvG,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CAiW7D"}

package/dist/core/store.js

@@ -1,28 +1,32 @@
 import { GraphError as Y } from "./error.js";
 import { domainOf as Z } from "./categories.js";
-import { bindingOf as R } from "./channels.js";
+import { bindingOf as Q } from "./channels.js";
 import { graphClient as x, publish as ee, filterFor as ne } from "./filter.js";
-import { drawnTables as te, loadEncoding as re, loadGraph as oe, maskOf as U, readKept as le } from "./load.js";
-const ie = (a, r) => JSON.stringify(a, (m, i) => typeof i == "bigint" ? `${i}n` : i) === JSON.stringify(r, (m, i) => typeof i == "bigint" ? `${i}n` : i), ue = (a) => typeof (a == null ? void 0 : a.then) == "function";
-function se(a, r, m) {
-  const i = r.domain.map(() => 0);
-  let u = 0;
-  for (let s = 0; s < a.size; s++) {
-    if (m && !m[s] || Number.isNaN(a.positions[s * 2])) continue;
-    u++;
-    const b = r.ranks[s];
-    i[b] = (i[b] ?? 0) + 1;
+import { drawnTables as te, loadEncoding as re, loadGraph as oe, maskOf as R, readKept as le } from "./load.js";
+const ie = (u, r) => JSON.stringify(u, (m, f) => typeof f == "bigint" ? `${f}n` : f) === JSON.stringify(r, (m, f) => typeof f == "bigint" ? `${f}n` : f), se = (u) => typeof (u == null ? void 0 : u.then) == "function";
+function ue(u, r, m) {
+  const f = r.domain.map(() => 0), s = new Uint8Array(u.size);
+  let y = 0;
+  for (let l = 0; l < u.size; l++) {
+    if (m && !m[l] || Number.isNaN(u.positions[l * 2])) continue;
+    s[l] = 1, y++;
+    const c = r.ranks[l];
+    f[c] = (f[c] ?? 0) + 1;
   }
-  return { vertices: u, domain: r.domain, tally: i };
+  let h = 0;
+  const { links: k } = u;
+  for (let l = 0; l < k.length; l += 2)
+    s[k[l]] && s[k[l + 1]] && h++;
+  return { vertices: y, edges: h, domain: r.domain, tally: f };
 }
-function ye(a) {
-  let r = a;
-  const m = /* @__PURE__ */ new Set(), i = x();
-  let u = null, s = null, b = !1, E = !1, g = [], p = R(a), N, c = null, l = null, f = null, h = null, B = null, w = null, G = [], v = null, F = !1, j = !0, L = null;
+function ye(u) {
+  let r = u;
+  const m = /* @__PURE__ */ new Set(), f = x();
+  let s = null, y = null, h = !1, k = !1, l = [], c = Q(u), F, d = null, i = null, a = null, b = null, N = null, v = null, G = [], w = null, z = !1, U = !0, L = null;
   const T = (e) => {
-    j ? L = { error: e } : r.onFailure(e);
+    U ? L = { error: e } : r.onFailure(e);
   };
-  let d = {
+  let p = {
     status: "none",
     total: void 0,
     drawn: null,
@@ -36,193 +40,193 @@ function ye(a) {
     progress: 1,
     options: r,
     corpus: null,
-    binding: p,
+    binding: c,
     geometry: null,
     encoding: null,
     mask: null
   }, _ = { key: [], value: [] };
-  function q() {
-    const e = [g, p.byTable, p.category, r.categories];
-    return e.some((n, t) => n !== _.key[t]) && (_ = { key: e, value: Z(g, p, r.categories) }), _.value;
+  function j() {
+    const e = [l, c.byTable, c.category, r.categories];
+    return e.some((n, t) => n !== _.key[t]) && (_ = { key: e, value: Z(l, c, r.categories) }), _.value;
   }
-  let C = { key: [], value: null };
+  let A = { key: [], value: null };
   function V() {
-    const e = [f, h, w];
-    return e.some((n, t) => n !== C.key[t]) && (C = { key: e, value: f && h ? se(f, h, w) : null }), C.value;
+    const e = [a, b, v];
+    return e.some((n, t) => n !== A.key[t]) && (A = { key: e, value: a && b ? ue(a, b, v) : null }), A.value;
   }
   function W() {
-    if (b || E) return "failed";
-    if (s) return "opening";
-    if (!u) return "none";
-    const n = f !== null && [f, h, w].every((t, o) => t === G[o]);
-    return c || l || !n ? "loading" : "idle";
+    if (h || k) return "failed";
+    if (y) return "opening";
+    if (!s) return "none";
+    const n = a !== null && [a, b, v].every((t, o) => t === G[o]);
+    return d || i || !n ? "loading" : "idle";
   }
-  function y(e = {}) {
-    d = {
-      ...d,
-      total: u ? g.reduce((n, t) => n + t.record_count, 0) : void 0,
+  function g(e = {}) {
+    p = {
+      ...p,
+      total: s ? l.reduce((n, t) => n + t.record_count, 0) : void 0,
       drawn: V(),
-      domain: q(),
+      domain: j(),
       options: r,
-      corpus: u,
-      binding: p,
-      geometry: f,
-      encoding: h,
-      mask: w,
+      corpus: s,
+      binding: c,
+      geometry: a,
+      encoding: b,
+      mask: v,
       ...e
-    }, d = { ...d, status: W() }, H();
+    }, p = { ...p, status: W() }, q();
   }
-  function O(e) {
-    d = { ...d, ...e }, H();
+  function B(e) {
+    p = { ...p, ...e }, q();
   }
-  function H() {
+  function q() {
     for (const e of m) e();
   }
-  function J(e, n, t, o, S) {
-    var z;
-    (z = e()) == null || z.abort();
-    const k = new AbortController();
-    n(k), o(k.signal).then(
+  function C(e, n, t, o, S) {
+    var E;
+    (E = e()) == null || E.abort();
+    const O = new AbortController();
+    n(O), o(O.signal).then(
       (K) => {
-        e() === k && (n(null), S(K), y());
+        e() === O && (n(null), S(K), g());
       },
       (K) => {
-        e() !== k || k.signal.aborted || (n(null), b || (b = t), T(K), y());
+        e() !== O || O.signal.aborted || (n(null), h || (h = t), T(K), g());
       }
     );
   }
-  const I = [() => c, (e) => c = e, !0], X = [() => l, (e) => l = e, !1];
-  function P() {
-    const e = u;
+  const H = [() => d, (e) => d = e, !0], X = [() => i, (e) => i = e, !1];
+  function J() {
+    const e = s;
     if (!e) return;
-    const n = q(), t = f;
+    const n = j(), t = a;
     if (t)
-      return J(...I, (o) => re(e, t, p, n, o), (o) => {
-        h = o;
+      return C(...H, (o) => re(e, t, c, n, o), (o) => {
+        b = o;
       });
-    J(...I, (o) => oe(e, p, n, o), (o) => {
-      f = o.geometry, h = o.encoding, w = f && B ? U(f, B) : null;
+    C(...H, (o) => oe(e, c, n, o), (o) => {
+      a = o.geometry, b = o.encoding, v = a && N ? R(a, N) : null;
     });
   }
-  function $() {
-    l == null || l.abort(), l = null;
-    const e = u;
-    if (!e || g.length === 0) return;
-    if (N === void 0) {
-      B = null, w = null;
+  function P() {
+    i == null || i.abort(), i = null;
+    const e = s;
+    if (!e || l.length === 0) return;
+    if (F === void 0) {
+      N = null, v = null;
       return;
     }
-    const n = N;
-    J(...X, (t) => le(e, g, n, t), (t) => {
-      B = t, w = f ? U(f, t) : null;
+    const n = F;
+    C(...X, (t) => le(e, l, n, t), (t) => {
+      N = t, v = a ? R(a, t) : null;
     });
   }
-  function A() {
-    c == null || c.abort(), l == null || l.abort(), c = l = null, b = !1, f = h = w = B = null, G = [], g = [];
+  function $() {
+    d == null || d.abort(), i == null || i.abort(), d = i = null, h = !1, a = b = v = N = null, G = [], l = [];
     const e = { selection: null, focus: null, hovered: null, pinned: [] };
-    if (!u) return y(e);
+    if (!s) return g(e);
     try {
-      if (g = te(u), g.length === 0) throw new Y("graph/nothing-to-draw", "the corpus has no vertex type with a position to draw");
+      if (l = te(s), l.length === 0) throw new Y("graph/nothing-to-draw", "the corpus has no vertex type with a position to draw");
     } catch (n) {
-      return b = !0, T(n), y(e);
+      return h = !0, T(n), g(e);
     }
-    P(), $(), y(e);
+    J(), P(), g(e);
   }
-  function M(e) {
-    if (u = null, s = ue(e) ? e : null, !s)
-      return u = e, A();
-    const n = s;
-    A(), n.then(
+  function I(e) {
+    if (s = null, y = se(e) ? e : null, !y)
+      return s = e, $();
+    const n = y;
+    $(), n.then(
       (t) => {
-        s === n && (s = null, u = t, A());
+        y === n && (y = null, s = t, $());
       },
       (t) => {
-        s === n && (s = null, b = !0, T(t), y());
+        y === n && (y = null, h = !0, T(t), g());
       }
     );
   }
   function D() {
-    v == null || v(), v = null;
+    w == null || w(), w = null;
     const e = r.filterBy, n = () => {
       let t;
       try {
-        t = e ? ne(e, i) : void 0;
+        t = e ? ne(e, f) : void 0;
       } catch (o) {
         T(o);
         return;
       }
-      ie(t, N) || (N = t, $(), y());
+      ie(t, F) || (F = t, P(), g());
     };
-    e && (e.addEventListener("value", n), v = () => e.removeEventListener("value", n)), n();
+    e && (e.addEventListener("value", n), w = () => e.removeEventListener("value", n)), n();
   }
-  const Q = {
+  const M = {
     /**
      * The first subscriber starts listening to the crossfilter and the last one stops it and lets the
      * graph go — `QueryObserver`'s `onSubscribe`/`onUnsubscribe`, which is what survives StrictMode
      * mounting everything twice.
      */
     subscribe(e) {
-      if (m.add(e), !F && (F = !0, D(), u && !b && g.length > 0 && (!c && (!f || !h) && P(), !l && N !== void 0 && !B && $()), L !== null)) {
+      if (m.add(e), !z && (z = !0, D(), s && !h && l.length > 0 && (!d && (!a || !b) && J(), !i && F !== void 0 && !N && P()), L !== null)) {
         const { error: n } = L;
         L = null, r.onFailure(n);
       }
       return () => {
-        m.delete(e), m.size === 0 && Q.destroy();
+        m.delete(e), m.size === 0 && M.destroy();
       };
     },
-    getSnapshot: () => d,
+    getSnapshot: () => p,
     getOptions: () => r,
     setOptions(e) {
       const n = r;
       r = e;
-      const t = R(e), o = t.category !== p.category || t.byTable !== p.byTable || t.size !== p.size || e.categories !== n.categories;
-      if (p = t, e.corpus !== n.corpus) {
-        M(e.corpus), F && e.filterBy !== n.filterBy && D();
+      const t = Q(e), o = t.category !== c.category || t.byTable !== c.byTable || t.size !== c.size || e.categories !== n.categories;
+      if (c = t, e.corpus !== n.corpus) {
+        I(e.corpus), z && e.filterBy !== n.filterBy && D();
         return;
       }
-      F && e.filterBy !== n.filterBy && D(), o && P(), y();
+      z && e.filterBy !== n.filterBy && D(), o && J(), g();
     },
     destroy() {
-      F = !1, v == null || v(), v = null, c == null || c.abort(), l == null || l.abort(), c = l = null, m.clear();
+      z = !1, w == null || w(), w = null, d == null || d.abort(), i == null || i.abort(), d = i = null, m.clear();
     },
     select(e, n = "node", t = "") {
-      var k, z;
+      var O, E;
       const o = e && e.length > 0 ? { vertices: [...e], source: n, label: t } : null;
-      O({ selection: o }), (k = r.onSelect) == null || k.call(r, o);
-      const S = (z = g[0]) == null ? void 0 : z.key;
-      r.filterBy && S && ee(r.filterBy, i, S, o ? o.vertices : null);
+      B({ selection: o }), (O = r.onSelect) == null || O.call(r, o);
+      const S = (E = l[0]) == null ? void 0 : E.key;
+      r.filterBy && S && ee(r.filterBy, f, S, o ? o.vertices : null);
     },
     focus(e) {
       var n;
-      e !== d.focus && (O({ focus: e }), (n = r.onFocus) == null || n.call(r, e));
+      e !== p.focus && (B({ focus: e }), (n = r.onFocus) == null || n.call(r, e));
     },
     hover(e) {
-      e !== d.hovered && O({ hovered: e });
+      e !== p.hovered && B({ hovered: e });
     },
     pin(e) {
-      O({ pinned: [...e] });
+      B({ pinned: [...e] });
     },
     setTool(e) {
-      e !== d.tool && O({ tool: e });
+      e !== p.tool && B({ tool: e });
     },
     report(e) {
-      e !== d.motion && O({ motion: e });
+      e !== p.motion && B({ motion: e });
     },
     reportProgress(e) {
-      e !== d.progress && O({ progress: e });
+      e !== p.progress && B({ progress: e });
     },
     renderable() {
-      E && (E = !1, y());
+      k && (k = !1, g());
     },
     unrenderable(e) {
-      E = !0, T(e), y();
+      k = !0, T(e), g();
     },
     reportDrawn(e) {
       const n = [e.geometry, e.encoding, e.mask];
-      n.every((t, o) => t === G[o]) || (G = n, y());
+      n.every((t, o) => t === G[o]) || (G = n, g());
     }
   };
-  return M(a.corpus), j = !1, Q;
+  return I(u.corpus), U = !1, M;
 }
 export {
   ye as createGraph