@kanzo-tech/graph 0.11.0 → 0.13.0

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

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,YAAY,EAA8B,UAAU,EAAY,MAAM,SAAS,CAAC;AAK9F,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEjH,0FAA0F;AAC1F,eAAO,MAAM,aAAa,QAAS,CAAC;AAwBpC,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CA6T7D"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,YAAY,EAA8B,UAAU,EAAY,MAAM,SAAS,CAAC;AAK9F,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEjH,0FAA0F;AAC1F,eAAO,MAAM,aAAa,QAAS,CAAC;AAwBpC,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CA2U7D"}

package/dist/core/store.js

@@ -1,46 +1,47 @@
-import { PAYLOAD_ADDRESS as te, PAYLOAD_COORDINATES as ne } from "@fossil-lang/corpus";
+import { PAYLOAD_ADDRESS as le, PAYLOAD_COORDINATES as oe } from "@fossil-lang/corpus";
 import { domainOf as re } from "./categories.js";
-import { bindingOf as Y, projectionOf as oe } from "./channels.js";
-import { graphClient as le, publish as ie, filterFor as se } from "./filter.js";
-import { denseOf as ce } from "./resident.js";
-import { Tileset2D as fe } from "./tileset.js";
-const R = 2e4, q = Y({}), H = te[0];
-function de(i) {
+import { bindingOf as G, projectionOf as ie } from "./channels.js";
+import { graphClient as se, publish as ce, filterFor as fe } from "./filter.js";
+import { denseOf as ue } from "./resident.js";
+import { Tileset2D as de } from "./tileset.js";
+const Y = 2e4, Q = G({}), W = le[0];
+function ae(i) {
   var m;
   let n = 0;
   for (const s of i.edges) n += s.src.byteLength + s.dst.byteLength + (((m = s.weight) == null ? void 0 : m.byteLength) ?? 0);
   return n + i.rows.numRows * 8 * 4;
 }
-const ue = (i, n) => JSON.stringify(i, (m, s) => typeof s == "bigint" ? `${s}n` : s) === JSON.stringify(n, (m, s) => typeof s == "bigint" ? `${s}n` : s), ae = (i) => typeof (i == null ? void 0 : i.then) == "function";
-function Q(i, n) {
+const pe = (i, n) => JSON.stringify(i, (m, s) => typeof s == "bigint" ? `${s}n` : s) === JSON.stringify(n, (m, s) => typeof s == "bigint" ? `${s}n` : s), me = (i) => typeof (i == null ? void 0 : i.then) == "function";
+function X(i, n) {
   return i.length !== n.length ? n : n.every((m, s) => {
     var o;
     return m.content === ((o = i[s]) == null ? void 0 : o.content);
   }) ? i : n;
 }
-function be(i) {
+function ve(i) {
   let n = i;
-  const m = /* @__PURE__ */ new Set(), s = le();
-  let o = null, b = null, M = !1, C = !1, u = null, T = 0, G = null, O = null, g = q, F, z = null, E = [], S = null, h = null, B = !1, J = -1;
+  const m = /* @__PURE__ */ new Set(), s = se();
+  let o = null, b = null, M = !1, C = !1, d = null, T = 0, J = null, O = null, g = Q, P, z = null, E = [], S = null, h = null, B = !1, V = -1, $ = !0, A = null;
   const D = (e) => {
-    n.onFailure(e instanceof Error ? e.message : String(e));
-  }, a = new fe({
+    const t = e instanceof Error ? e.message : String(e);
+    $ ? A = t : n.onFailure(t);
+  }, a = new de({
     debounceTime: 60,
     load: async (e, t) => {
       if (!o || !O) throw new Error("the graph has no scan to read with");
-      const r = (d) => {
+      const l = (u) => {
         var w;
-        return ((w = u == null ? void 0 : u.tileMatrices[d.z]) == null ? void 0 : w.kind) === "cells";
-      }, l = await O.read(e, { signal: t }), y = await o.edges({ from: e, direction: "src", signal: t }), p = e.filter((d) => !r(d)), I = p.length > 0 ? await o.edges({ from: p, direction: "dst", signal: t }) : [], N = new Map(p.map((d, w) => [d, I[w]]));
-      return e.map((d, w) => {
-        const v = y[w], L = N.get(d), Z = [...(v == null ? void 0 : v.batches) ?? [], ...(L == null ? void 0 : L.batches) ?? []], K = [...(v == null ? void 0 : v.declined) ?? [], ...(L == null ? void 0 : L.declined) ?? []], x = r(d) ? K.filter((ee) => ee.direction !== "dst") : K, U = { rows: l[w], edges: Z, declined: x };
-        return { ...U, byteLength: de(U) };
+        return ((w = d == null ? void 0 : d.tileMatrices[u.z]) == null ? void 0 : w.kind) === "cells";
+      }, r = await O.read(e, { signal: t }), y = await o.edges({ from: e, direction: "src", signal: t }), p = e.filter((u) => !l(u)), N = p.length > 0 ? await o.edges({ from: p, direction: "dst", signal: t }) : [], F = new Map(p.map((u, w) => [u, N[w]]));
+      return e.map((u, w) => {
+        const v = y[w], L = F.get(u), ee = [...(v == null ? void 0 : v.batches) ?? [], ...(L == null ? void 0 : L.batches) ?? []], q = [...(v == null ? void 0 : v.declined) ?? [], ...(L == null ? void 0 : L.declined) ?? []], te = l(u) ? q.filter((ne) => ne.direction !== "dst") : q, H = { rows: r[w], edges: ee, declined: te };
+        return { ...H, byteLength: ae(H) };
       });
     },
     onTileLoad: (e) => {
       var t;
-      for (const r of ((t = e.content) == null ? void 0 : t.declined) ?? [])
-        E.some((l) => l.edgeType === r.edgeType && l.direction === r.direction) || (E = [...E, r]);
+      for (const l of ((t = e.content) == null ? void 0 : t.declined) ?? [])
+        E.some((r) => r.edgeType === l.edgeType && r.direction === l.direction) || (E = [...E, l]);
       a.refresh(), f();
     },
     onTileError: (e) => {
@@ -52,7 +53,7 @@ function be(i) {
     matrix: null,
     typeIndex: 0,
     modeColumn: null,
-    binding: q,
+    binding: Q,
     domain: [],
     z: null,
     visible: [],
@@ -71,109 +72,113 @@ function be(i) {
     options: n,
     corpus: null
   };
-  const V = (e) => {
+  const j = (e) => {
     var t;
     return {
       address: e.address,
-      kind: ((t = u == null ? void 0 : u.tileMatrices[e.address.z]) == null ? void 0 : t.kind) ?? "rows",
+      kind: ((t = d == null ? void 0 : d.tileMatrices[e.address.z]) == null ? void 0 : t.kind) ?? "rows",
       content: e.content
     };
   };
-  let P = { key: [], value: [] };
-  function W() {
+  let _ = { key: [], value: [] };
+  function Z() {
     const e = [o, T, g.category, n.categories];
-    return e.some((t, r) => t !== P.key[r]) && (P = { key: e, value: re(o, T, g, n.categories) }), P.value;
+    return e.some((t, l) => t !== _.key[l]) && (_ = { key: e, value: re(o, T, g, n.categories) }), _.value;
   }
-  function X(e, t) {
+  function x(e, t) {
     return M || C ? "failed" : b ? "opening" : o ? e || S !== t || c.drawn === null ? "reading" : "idle" : "none";
   }
   function f(e = {}) {
     var y;
-    J = a.frame;
-    const t = a.tiles.filter((p) => p.content !== null), r = Q(c.visible, t.filter((p) => p.isVisible).map(V)), l = a.selectedTiles.some((p) => p.isLoading);
+    V = a.frame;
+    const t = a.tiles.filter((p) => p.content !== null), l = X(c.visible, t.filter((p) => p.isVisible).map(j)), r = a.selectedTiles.some((p) => p.isLoading);
     c = {
       ...c,
-      matrix: u,
+      matrix: d,
       typeIndex: T,
-      modeColumn: G,
+      modeColumn: J,
       binding: g,
-      domain: W(),
+      domain: Z(),
       z: a.z,
-      visible: r,
-      cached: Q(c.cached, t.map(V)),
-      pending: l,
-      total: u ? Number(((y = u.tileMatrices[u.tileMatrices.length - 1]) == null ? void 0 : y.count) ?? 0) : void 0,
+      visible: l,
+      cached: X(c.cached, t.map(j)),
+      pending: r,
+      total: d ? Number(((y = d.tileMatrices[d.tileMatrices.length - 1]) == null ? void 0 : y.count) ?? 0) : void 0,
       declined: E,
       options: n,
       corpus: o,
       ...e
-    }, c = { ...c, status: X(l, c.visible) };
+    }, c = { ...c, status: x(r, c.visible) };
     for (const p of m) p();
   }
-  function _() {
-    if (!(!o || !u)) {
+  function k() {
+    if (!(!o || !d)) {
       try {
-        const e = [H, ...ne];
-        O = o.scan({ type: u.type, filter: F, select: oe(g, e) }), a.setPlan(O.plan());
+        const e = [W, ...oe];
+        O = o.scan({ type: d.type, filter: P, select: ie(g, e) }), a.setPlan(O.plan());
       } catch (e) {
         O = null, a.setPlan([]), D(e);
       }
-      a.reloadAll(), z && a.update(z, n.limit ?? R), f();
+      a.reloadAll(), z && a.update(z, n.limit ?? Y), f();
     }
   }
-  function A() {
-    var l, y, p, I, N;
-    M = !1, u = null, O = null, E = [], S = null, a.finalize();
+  function I() {
+    var r, y, p, N, F;
+    M = !1, d = null, O = null, E = [], S = null, a.finalize();
     const e = { selection: null, focus: null, hovered: null, pinned: [], drawn: null };
     if (!o) return f(e);
-    const t = o.types.vertices, r = n.type ?? ((l = t.find((d) => d.geometry)) == null ? void 0 : l.type) ?? ((y = t[0]) == null ? void 0 : y.type);
-    T = Math.max(0, t.findIndex((d) => d.type === r));
+    const t = o.types.vertices, l = n.type ?? ((r = t.find((u) => u.geometry)) == null ? void 0 : r.type) ?? ((y = t[0]) == null ? void 0 : y.type);
+    T = Math.max(0, t.findIndex((u) => u.type === l));
     try {
-      if (r === void 0) throw new Error("the corpus has no vertex type to draw");
-      u = o.tileMatrix(r);
-      const d = ((p = o.addressing.vertexType(r).cells) == null ? void 0 : p.modeChannel) ?? null;
-      G = ((N = (I = t[T]) == null ? void 0 : I.channels.find((w) => w.name === d)) == null ? void 0 : N.column) ?? null, a.setMatrix(u);
-    } catch (d) {
-      M = !0, D(d);
+      if (l === void 0) throw new Error("the corpus has no vertex type to draw");
+      d = o.tileMatrix(l);
+      const u = ((p = o.addressing.vertexType(l).cells) == null ? void 0 : p.modeChannel) ?? null;
+      J = ((F = (N = t[T]) == null ? void 0 : N.channels.find((w) => w.name === u)) == null ? void 0 : F.column) ?? null, a.setMatrix(d);
+    } catch (u) {
+      M = !0, D(u);
     }
-    c = { ...c, ...e }, _();
+    c = { ...c, ...e }, k();
   }
-  function $(e) {
-    if (o = null, b = ae(e) ? e : null, !b)
-      return o = e, A();
+  function K(e) {
+    if (o = null, b = me(e) ? e : null, !b)
+      return o = e, I();
     const t = b;
-    A(), t.then(
-      (r) => {
-        b === t && (b = null, o = r, A());
+    I(), t.then(
+      (l) => {
+        b === t && (b = null, o = l, I());
       },
-      (r) => {
-        b === t && (b = null, M = !0, D(r), f());
+      (l) => {
+        b === t && (b = null, M = !0, D(l), f());
       }
     );
   }
-  function k() {
+  function R() {
     h == null || h(), h = null;
     const e = n.filterBy, t = () => {
-      let r;
+      let l;
       try {
-        r = e ? se(e, s) : void 0;
-      } catch (l) {
-        D(l);
+        l = e ? fe(e, s) : void 0;
+      } catch (r) {
+        D(r);
         return;
       }
-      ue(r, F) || (F = r, _());
+      pe(l, P) || (P = l, k());
     };
     e && (e.addEventListener("value", t), h = () => e.removeEventListener("value", t)), t();
   }
-  const j = {
+  const U = {
     /**
      * The first subscriber starts listening to the crossfilter and the last one stops it and lets the
      * tiles go — `QueryObserver`'s `onSubscribe`/`onUnsubscribe`, which is what survives StrictMode
      * mounting everything twice.
      */
     subscribe(e) {
-      return m.add(e), B || (B = !0, k()), () => {
-        m.delete(e), m.size === 0 && j.destroy();
+      if (m.add(e), !B && (B = !0, R(), A !== null)) {
+        const t = A;
+        A = null, n.onFailure(t);
+      }
+      return () => {
+        m.delete(e), m.size === 0 && U.destroy();
       };
     },
     getSnapshot: () => c,
@@ -181,24 +186,24 @@ function be(i) {
     setOptions(e) {
       const t = n;
       n = e;
-      const r = Y(e), l = r.category !== g.category || r.size !== g.size || r.title !== g.title;
-      if (g = r, e.corpus !== t.corpus || e.type !== t.type) {
-        e.corpus !== t.corpus ? $(e.corpus) : A(), B && e.filterBy !== t.filterBy && k();
+      const l = G(e), r = l.category !== g.category || l.size !== g.size || l.title !== g.title;
+      if (g = l, e.corpus !== t.corpus || e.type !== t.type) {
+        e.corpus !== t.corpus ? K(e.corpus) : I(), B && e.filterBy !== t.filterBy && R();
         return;
       }
-      if (B && e.filterBy !== t.filterBy && k(), l) return _();
-      e.limit !== t.limit && z && a.update(z, e.limit ?? R), f();
+      if (B && e.filterBy !== t.filterBy && R(), r) return k();
+      e.limit !== t.limit && z && a.update(z, e.limit ?? Y), f();
     },
     destroy() {
       B = !1, h == null || h(), h = null, a.finalize(), m.clear();
     },
     setViewport(e) {
-      z = e, a.update(e, n.limit ?? R) !== J && f();
+      z = e, a.update(e, n.limit ?? Y) !== V && f();
     },
-    select(e, t = "node", r = "") {
+    select(e, t = "node", l = "") {
       var y;
-      const l = e && e.length > 0 ? { vertices: [...e], source: t, label: r } : null;
-      f({ selection: l }), (y = n.onSelect) == null || y.call(n, l), n.filterBy && ie(n.filterBy, s, H, l ? l.vertices.map(ce) : null);
+      const r = e && e.length > 0 ? { vertices: [...e], source: t, label: l } : null;
+      f({ selection: r }), (y = n.onSelect) == null || y.call(n, r), n.filterBy && ce(n.filterBy, s, W, r ? r.vertices.map(ue) : null);
     },
     focus(e) {
       var t;
@@ -226,10 +231,10 @@ function be(i) {
       S === e && t === null || (S = e, f(t ? { drawn: t } : {}));
     }
   };
-  return g = Y(i), $(i.corpus), j;
+  return g = G(i), K(i.corpus), $ = !1, U;
 }
 export {
-  R as DEFAULT_LIMIT,
-  be as createGraph
+  Y as DEFAULT_LIMIT,
+  ve as createGraph
 };
 //# sourceMappingURL=store.js.map

package/dist/core/store.js.map

@@ -1 +1 @@
-{"version":3,"file":"store.js","sources":["../../src/core/store.ts"],"sourcesContent":["import {\n  PAYLOAD_ADDRESS,\n  PAYLOAD_COORDINATES,\n  type Batch,\n  type Corpus,\n  type Filter,\n  type Gap,\n  type Scan,\n  type TileAddress,\n  type TileMatrixSet,\n} from \"@fossil-lang/corpus\";\nimport type { MosaicClient } from \"@kanzo-tech/mosaic\";\nimport { domainOf } from \"./categories\";\nimport { bindingOf, projectionOf, type Binding } from \"./channels\";\nimport { filterFor, graphClient, publish } from \"./filter\";\nimport { denseOf } from \"./resident\";\nimport type { GraphOptions, GraphSnapshot, GraphStatus, GraphStore, TileView } from \"./state\";\nimport type { TileContent } from \"./tile\";\nimport type { Viewport } from \"./tile-matrix\";\nimport { Tileset2D } from \"./tileset\";\n\nexport type { Drawn, GraphOptions, GraphSnapshot, GraphState, GraphStatus, GraphStore, TileView } from \"./state\";\n\n/** Twenty thousand marks: what a canvas draws at once before a coarser zoom is chosen. */\nexport const DEFAULT_LIMIT = 20_000;\n\nconst NO_BINDING: Binding = bindingOf({});\nconst KEY = PAYLOAD_ADDRESS[0] as string;\n\nfunction bytesOf(content: Omit<TileContent, \"byteLength\">): number {\n  let bytes = 0;\n  for (const edge of content.edges) bytes += edge.src.byteLength + edge.dst.byteLength + (edge.weight?.byteLength ?? 0);\n  return bytes + content.rows.numRows * 8 * 4;\n}\n\nconst sameFilter = (a: Filter | undefined, b: Filter | undefined) =>\n  JSON.stringify(a, (_, v: unknown) => (typeof v === \"bigint\" ? `${v}n` : v)) ===\n  JSON.stringify(b, (_, v: unknown) => (typeof v === \"bigint\" ? `${v}n` : v));\n\nconst isPromise = (value: unknown): value is PromiseLike<Corpus> =>\n  typeof (value as PromiseLike<Corpus> | null)?.then === \"function\";\n\n/** The same array while the set of tiles in it is the same, so a reader can compare by identity. */\nfunction keep(previous: readonly TileView[], next: TileView[]): readonly TileView[] {\n  if (previous.length !== next.length) return next;\n  return next.every((view, i) => view.content === previous[i]?.content) ? previous : next;\n}\n\nexport function createGraph(initial: GraphOptions): GraphStore {\n  let options = initial;\n  const listeners = new Set<() => void>();\n  const self: MosaicClient = graphClient();\n\n  let corpus: Corpus | null = null;\n  let opening: PromiseLike<Corpus> | null = null;\n  let failed = false;\n  let unrenderable = false;\n  let matrix: TileMatrixSet | null = null;\n  let typeIndex = 0;\n  let modeColumn: string | null = null;\n  let scan: Scan | null = null;\n  let binding = NO_BINDING;\n  let filter: Filter | undefined;\n  let viewport: Viewport | null = null;\n  let declined: Gap[] = [];\n  let composed: readonly TileView[] | null = null;\n  let unlisten: (() => void) | null = null;\n  let active = false;\n  let lastFrame = -1;\n\n  const fail = (error: unknown) => {\n    options.onFailure(error instanceof Error ? error.message : String(error));\n  };\n\n  const tileset = new Tileset2D({\n    debounceTime: 60,\n    load: async (addresses, signal) => {\n      if (!corpus || !scan) throw new Error(\"the graph has no scan to read with\");\n      const isCells = (address: TileAddress) => matrix?.tileMatrices[address.z]?.kind === \"cells\";\n      const rows = await scan.read(addresses, { signal });\n      const src = await corpus.edges({ from: addresses, direction: \"src\", signal });\n      const payload = addresses.filter((address) => !isCells(address));\n      const dst = payload.length > 0 ? await corpus.edges({ from: payload, direction: \"dst\", signal }) : [];\n      const dstOf = new Map(payload.map((address, i) => [address, dst[i]]));\n      return addresses.map((address, i) => {\n        const out = src[i];\n        const back = dstOf.get(address);\n        const edges = [...(out?.batches ?? []), ...(back?.batches ?? [])];\n        const gaps = [...(out?.declined ?? []), ...(back?.declined ?? [])];\n        const declined = isCells(address) ? gaps.filter((gap) => gap.direction !== \"dst\") : gaps;\n        const content = { rows: rows[i] as Batch, edges, declined };\n        return { ...content, byteLength: bytesOf(content) };\n      });\n    },\n    onTileLoad: (tile) => {\n      for (const gap of tile.content?.declined ?? []) {\n        if (!declined.some((d) => d.edgeType === gap.edgeType && d.direction === gap.direction)) {\n          declined = [...declined, gap];\n        }\n      }\n      tileset.refresh();\n      notify();\n    },\n    onTileError: (error) => {\n      tileset.refresh();\n      fail(error);\n      notify();\n    },\n  });\n\n  let snapshot: GraphSnapshot = {\n    status: \"none\",\n    matrix: null,\n    typeIndex: 0,\n    modeColumn: null,\n    binding: NO_BINDING,\n    domain: [],\n    z: null,\n    visible: [],\n    cached: [],\n    pending: false,\n    total: undefined,\n    declined: [],\n    selection: null,\n    focus: null,\n    hovered: null,\n    pinned: [],\n    tool: null,\n    motion: \"settled\",\n    progress: 1,\n    drawn: null,\n    options,\n    corpus: null,\n  };\n\n  const viewOf = (tile: { address: TileAddress; content: TileContent | null }): TileView => ({\n    address: tile.address,\n    kind: matrix?.tileMatrices[tile.address.z]?.kind ?? \"rows\",\n    content: tile.content as TileContent,\n  });\n\n  let domain: { key: unknown[]; value: readonly unknown[] } = { key: [], value: [] };\n  function domainNow(): readonly unknown[] {\n    const key = [corpus, typeIndex, binding.category, options.categories];\n    if (key.some((part, i) => part !== domain.key[i])) domain = { key, value: domainOf(corpus, typeIndex, binding, options.categories) };\n    return domain.value;\n  }\n\n  function statusOf(pending: boolean, visible: readonly TileView[]): GraphStatus {\n    if (failed || unrenderable) return \"failed\";\n    if (opening) return \"opening\";\n    if (!corpus) return \"none\";\n    return pending || composed !== visible || snapshot.drawn === null ? \"reading\" : \"idle\";\n  }\n\n  function notify(patch: Partial<GraphSnapshot> = {}): void {\n    lastFrame = tileset.frame;\n    const tiles = tileset.tiles.filter((tile) => tile.content !== null);\n    const visible = keep(snapshot.visible, tiles.filter((tile) => tile.isVisible).map(viewOf));\n    const pending = tileset.selectedTiles.some((tile) => tile.isLoading);\n    snapshot = {\n      ...snapshot,\n      matrix,\n      typeIndex,\n      modeColumn,\n      binding,\n      domain: domainNow(),\n      z: tileset.z,\n      visible,\n      cached: keep(snapshot.cached, tiles.map(viewOf)),\n      pending,\n      total: matrix ? Number(matrix.tileMatrices[matrix.tileMatrices.length - 1]?.count ?? 0) : undefined,\n      declined,\n      options,\n      corpus,\n      ...patch,\n    };\n    snapshot = { ...snapshot, status: statusOf(pending, snapshot.visible) };\n    for (const listener of listeners) listener();\n  }\n\n  /** A binding or a filter is a new scan, planned once and never per camera move. */\n  function rescan(): void {\n    if (!corpus || !matrix) return;\n    try {\n      const fixed = [KEY, ...PAYLOAD_COORDINATES];\n      scan = corpus.scan({ type: matrix.type, filter, select: projectionOf(binding, fixed) });\n      tileset.setPlan(scan.plan());\n    } catch (error) {\n      scan = null;\n      tileset.setPlan([]);\n      fail(error);\n    }\n    tileset.reloadAll();\n    if (viewport) tileset.update(viewport, options.limit ?? DEFAULT_LIMIT);\n    notify();\n  }\n\n  function reopen(): void {\n    failed = false;\n    matrix = null;\n    scan = null;\n    declined = [];\n    composed = null;\n    tileset.finalize();\n    const cleared = { selection: null, focus: null, hovered: null, pinned: [], drawn: null };\n    if (!corpus) return notify(cleared);\n    const types = corpus.types.vertices;\n    const type = options.type ?? types.find((t) => t.geometry)?.type ?? types[0]?.type;\n    typeIndex = Math.max(0, types.findIndex((t) => t.type === type));\n    try {\n      if (type === undefined) throw new Error(\"the corpus has no vertex type to draw\");\n      matrix = corpus.tileMatrix(type);\n      const mode = corpus.addressing.vertexType(type).cells?.modeChannel ?? null;\n      modeColumn = types[typeIndex]?.channels.find((channel) => channel.name === mode)?.column ?? null;\n      tileset.setMatrix(matrix);\n    } catch (error) {\n      failed = true;\n      fail(error);\n    }\n    snapshot = { ...snapshot, ...cleared };\n    rescan();\n  }\n\n  /** A promise is adopted when it settles, and only if it is still the corpus the host means. */\n  function adopt(given: GraphOptions[\"corpus\"]): void {\n    corpus = null;\n    opening = isPromise(given) ? given : null;\n    if (!opening) {\n      corpus = given as Corpus | null;\n      return reopen();\n    }\n    const promised = opening;\n    reopen();\n    promised.then(\n      (opened) => {\n        if (opening !== promised) return;\n        opening = null;\n        corpus = opened;\n        reopen();\n      },\n      (error: unknown) => {\n        if (opening !== promised) return;\n        opening = null;\n        failed = true;\n        fail(error);\n        notify();\n      },\n    );\n  }\n\n  function listen(): void {\n    unlisten?.();\n    unlisten = null;\n    const crossfilter = options.filterBy;\n    const refilter = () => {\n      let next: Filter | undefined;\n      try {\n        next = crossfilter ? filterFor(crossfilter, self) : undefined;\n      } catch (error) {\n        fail(error);\n        return;\n      }\n      if (sameFilter(next, filter)) return;\n      filter = next;\n      rescan();\n    };\n    if (crossfilter) {\n      crossfilter.addEventListener(\"value\", refilter);\n      unlisten = () => crossfilter.removeEventListener(\"value\", refilter);\n    }\n    refilter();\n  }\n\n  const store: GraphStore = {\n    /**\n     * The first subscriber starts listening to the crossfilter and the last one stops it and lets the\n     * tiles go — `QueryObserver`'s `onSubscribe`/`onUnsubscribe`, which is what survives StrictMode\n     * mounting everything twice.\n     */\n    subscribe(listener) {\n      listeners.add(listener);\n      if (!active) {\n        active = true;\n        listen();\n      }\n      return () => {\n        listeners.delete(listener);\n        if (listeners.size === 0) store.destroy();\n      };\n    },\n    getSnapshot: () => snapshot,\n    getOptions: () => options,\n    setOptions(next) {\n      const previous = options;\n      options = next;\n      const nextBinding = bindingOf(next);\n      const rebound =\n        nextBinding.category !== binding.category ||\n        nextBinding.size !== binding.size ||\n        nextBinding.title !== binding.title;\n      binding = nextBinding;\n      if (next.corpus !== previous.corpus || next.type !== previous.type) {\n        if (next.corpus !== previous.corpus) adopt(next.corpus);\n        else reopen();\n        if (active && next.filterBy !== previous.filterBy) listen();\n        return;\n      }\n      if (active && next.filterBy !== previous.filterBy) listen();\n      if (rebound) return rescan();\n      if (next.limit !== previous.limit && viewport) tileset.update(viewport, next.limit ?? DEFAULT_LIMIT);\n      notify();\n    },\n    destroy() {\n      active = false;\n      unlisten?.();\n      unlisten = null;\n      tileset.finalize();\n      listeners.clear();\n    },\n    setViewport(next) {\n      viewport = next;\n      if (tileset.update(next, options.limit ?? DEFAULT_LIMIT) !== lastFrame) notify();\n    },\n    select(vertices, source = \"node\", label = \"\") {\n      const selection = vertices && vertices.length > 0 ? { vertices: [...vertices], source, label } : null;\n      notify({ selection });\n      options.onSelect?.(selection);\n      if (options.filterBy) publish(options.filterBy, self, KEY, selection ? selection.vertices.map(denseOf) : null);\n    },\n    focus(vertex) {\n      if (vertex === snapshot.focus) return;\n      notify({ focus: vertex });\n      options.onFocus?.(vertex);\n    },\n    hover(vertex) {\n      if (vertex !== snapshot.hovered) notify({ hovered: vertex });\n    },\n    pin(vertices) {\n      notify({ pinned: [...vertices] });\n    },\n    setTool(tool) {\n      if (tool !== snapshot.tool) notify({ tool });\n    },\n    report(motion) {\n      if (motion !== snapshot.motion) notify({ motion });\n    },\n    reportProgress(value) {\n      if (value !== snapshot.progress) notify({ progress: value });\n    },\n    setRenderable(renderable) {\n      if (unrenderable === !renderable) return;\n      unrenderable = !renderable;\n      notify();\n    },\n    reportDrawn(visible, drawn) {\n      if (composed === visible && drawn === null) return;\n      composed = visible;\n      notify(drawn ? { drawn } : {});\n    },\n  };\n\n  binding = bindingOf(initial);\n  adopt(initial.corpus);\n  return store;\n}\n"],"names":["DEFAULT_LIMIT","NO_BINDING","bindingOf","KEY","PAYLOAD_ADDRESS","bytesOf","content","bytes","edge","_a","sameFilter","a","b","_","v","isPromise","value","keep","previous","next","view","i","createGraph","initial","options","listeners","self","graphClient","corpus","opening","failed","unrenderable","matrix","typeIndex","modeColumn","scan","binding","filter","viewport","declined","composed","unlisten","active","lastFrame","fail","error","tileset","Tileset2D","addresses","signal","isCells","address","rows","src","payload","dst","dstOf","out","back","edges","gaps","gap","tile","d","notify","snapshot","viewOf","domain","domainNow","key","part","domainOf","statusOf","pending","visible","patch","tiles","listener","rescan","fixed","PAYLOAD_COORDINATES","projectionOf","reopen","cleared","types","type","t","_b","mode","_c","_e","_d","channel","adopt","given","promised","opened","listen","crossfilter","refilter","filterFor","store","nextBinding","rebound","vertices","source","label","selection","publish","denseOf","vertex","tool","motion","renderable","drawn"],"mappings":";;;;;;AAwBO,MAAMA,IAAgB,KAEvBC,IAAsBC,EAAU,EAAE,GAClCC,IAAMC,GAAgB,CAAC;AAE7B,SAASC,GAAQC,GAAkD;;AACjE,MAAIC,IAAQ;AACZ,aAAWC,KAAQF,EAAQ,MAAO,CAAAC,KAASC,EAAK,IAAI,aAAaA,EAAK,IAAI,gBAAcC,IAAAD,EAAK,WAAL,gBAAAC,EAAa,eAAc;AACnH,SAAOF,IAAQD,EAAQ,KAAK,UAAU,IAAI;AAC5C;AAEA,MAAMI,KAAa,CAACC,GAAuBC,MACzC,KAAK,UAAUD,GAAG,CAACE,GAAGC,MAAgB,OAAOA,KAAM,WAAW,GAAGA,CAAC,MAAMA,CAAE,MAC1E,KAAK,UAAUF,GAAG,CAACC,GAAGC,MAAgB,OAAOA,KAAM,WAAW,GAAGA,CAAC,MAAMA,CAAE,GAEtEC,KAAY,CAACC,MACjB,QAAQA,KAAA,gBAAAA,EAAsC,SAAS;AAGzD,SAASC,EAAKC,GAA+BC,GAAuC;AAClF,SAAID,EAAS,WAAWC,EAAK,SAAeA,IACrCA,EAAK,MAAM,CAACC,GAAMC,MAAA;;AAAM,WAAAD,EAAK,cAAYX,IAAAS,EAASG,CAAC,MAAV,gBAAAZ,EAAa;AAAA,GAAO,IAAIS,IAAWC;AACrF;AAEO,SAASG,GAAYC,GAAmC;AAC7D,MAAIC,IAAUD;AACd,QAAME,wBAAgB,IAAA,GAChBC,IAAqBC,GAAA;AAE3B,MAAIC,IAAwB,MACxBC,IAAsC,MACtCC,IAAS,IACTC,IAAe,IACfC,IAA+B,MAC/BC,IAAY,GACZC,IAA4B,MAC5BC,IAAoB,MACpBC,IAAUnC,GACVoC,GACAC,IAA4B,MAC5BC,IAAkB,CAAA,GAClBC,IAAuC,MACvCC,IAAgC,MAChCC,IAAS,IACTC,IAAY;AAEhB,QAAMC,IAAO,CAACC,MAAmB;AAC/B,IAAArB,EAAQ,UAAUqB,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK,CAAC;AAAA,EAC1E,GAEMC,IAAU,IAAIC,GAAU;AAAA,IAC5B,cAAc;AAAA,IACd,MAAM,OAAOC,GAAWC,MAAW;AACjC,UAAI,CAACrB,KAAU,CAACO,EAAM,OAAM,IAAI,MAAM,oCAAoC;AAC1E,YAAMe,IAAU,CAACC;;AAAyB,iBAAA1C,IAAAuB,KAAA,gBAAAA,EAAQ,aAAamB,EAAQ,OAA7B,gBAAA1C,EAAiC,UAAS;AAAA,SAC9E2C,IAAO,MAAMjB,EAAK,KAAKa,GAAW,EAAE,QAAAC,GAAQ,GAC5CI,IAAM,MAAMzB,EAAO,MAAM,EAAE,MAAMoB,GAAW,WAAW,OAAO,QAAAC,GAAQ,GACtEK,IAAUN,EAAU,OAAO,CAACG,MAAY,CAACD,EAAQC,CAAO,CAAC,GACzDI,IAAMD,EAAQ,SAAS,IAAI,MAAM1B,EAAO,MAAM,EAAE,MAAM0B,GAAS,WAAW,OAAO,QAAAL,EAAA,CAAQ,IAAI,CAAA,GAC7FO,IAAQ,IAAI,IAAIF,EAAQ,IAAI,CAACH,GAAS9B,MAAM,CAAC8B,GAASI,EAAIlC,CAAC,CAAC,CAAC,CAAC;AACpE,aAAO2B,EAAU,IAAI,CAACG,GAAS9B,MAAM;AACnC,cAAMoC,IAAMJ,EAAIhC,CAAC,GACXqC,IAAOF,EAAM,IAAIL,CAAO,GACxBQ,IAAQ,CAAC,IAAIF,KAAA,gBAAAA,EAAK,YAAW,CAAA,GAAK,IAAIC,KAAA,gBAAAA,EAAM,YAAW,EAAG,GAC1DE,IAAO,CAAC,IAAIH,KAAA,gBAAAA,EAAK,aAAY,CAAA,GAAK,IAAIC,KAAA,gBAAAA,EAAM,aAAY,EAAG,GAC3DnB,IAAWW,EAAQC,CAAO,IAAIS,EAAK,OAAO,CAACC,OAAQA,GAAI,cAAc,KAAK,IAAID,GAC9EtD,IAAU,EAAE,MAAM8C,EAAK/B,CAAC,GAAY,OAAAsC,GAAO,UAAApB,EAAAA;AACjD,eAAO,EAAE,GAAGjC,GAAS,YAAYD,GAAQC,CAAO,EAAA;AAAA,MAClD,CAAC;AAAA,IACH;AAAA,IACA,YAAY,CAACwD,MAAS;;AACpB,iBAAWD,OAAOpD,IAAAqD,EAAK,YAAL,gBAAArD,EAAc,aAAY,CAAA;AAC1C,QAAK8B,EAAS,KAAK,CAACwB,MAAMA,EAAE,aAAaF,EAAI,YAAYE,EAAE,cAAcF,EAAI,SAAS,MACpFtB,IAAW,CAAC,GAAGA,GAAUsB,CAAG;AAGhC,MAAAf,EAAQ,QAAA,GACRkB,EAAA;AAAA,IACF;AAAA,IACA,aAAa,CAACnB,MAAU;AACtB,MAAAC,EAAQ,QAAA,GACRF,EAAKC,CAAK,GACVmB,EAAA;AAAA,IACF;AAAA,EAAA,CACD;AAED,MAAIC,IAA0B;AAAA,IAC5B,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,SAAShE;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,GAAG;AAAA,IACH,SAAS,CAAA;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,SAAS;AAAA,IACT,OAAO;AAAA,IACP,UAAU,CAAA;AAAA,IACV,WAAW;AAAA,IACX,OAAO;AAAA,IACP,SAAS;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,UAAU;AAAA,IACV,OAAO;AAAA,IACP,SAAAuB;AAAA,IACA,QAAQ;AAAA,EAAA;AAGV,QAAM0C,IAAS,CAACJ,MAAA;;AAA2E;AAAA,MACzF,SAASA,EAAK;AAAA,MACd,QAAMrD,IAAAuB,KAAA,gBAAAA,EAAQ,aAAa8B,EAAK,QAAQ,OAAlC,gBAAArD,EAAsC,SAAQ;AAAA,MACpD,SAASqD,EAAK;AAAA,IAAA;AAAA;AAGhB,MAAIK,IAAwD,EAAE,KAAK,CAAA,GAAI,OAAO,CAAA,EAAC;AAC/E,WAASC,IAAgC;AACvC,UAAMC,IAAM,CAACzC,GAAQK,GAAWG,EAAQ,UAAUZ,EAAQ,UAAU;AACpE,WAAI6C,EAAI,KAAK,CAACC,GAAMjD,MAAMiD,MAASH,EAAO,IAAI9C,CAAC,CAAC,MAAG8C,IAAS,EAAE,KAAAE,GAAK,OAAOE,GAAS3C,GAAQK,GAAWG,GAASZ,EAAQ,UAAU,EAAA,IAC1H2C,EAAO;AAAA,EAChB;AAEA,WAASK,EAASC,GAAkBC,GAA2C;AAC7E,WAAI5C,KAAUC,IAAqB,WAC/BF,IAAgB,YACfD,IACE6C,KAAWjC,MAAakC,KAAWT,EAAS,UAAU,OAAO,YAAY,SAD5D;AAAA,EAEtB;AAEA,WAASD,EAAOW,IAAgC,IAAU;;AACxD,IAAAhC,IAAYG,EAAQ;AACpB,UAAM8B,IAAQ9B,EAAQ,MAAM,OAAO,CAACgB,MAASA,EAAK,YAAY,IAAI,GAC5DY,IAAUzD,EAAKgD,EAAS,SAASW,EAAM,OAAO,CAACd,MAASA,EAAK,SAAS,EAAE,IAAII,CAAM,CAAC,GACnFO,IAAU3B,EAAQ,cAAc,KAAK,CAACgB,MAASA,EAAK,SAAS;AACnE,IAAAG,IAAW;AAAA,MACT,GAAGA;AAAA,MACH,QAAAjC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,SAAAE;AAAA,MACA,QAAQgC,EAAA;AAAA,MACR,GAAGtB,EAAQ;AAAA,MACX,SAAA4B;AAAA,MACA,QAAQzD,EAAKgD,EAAS,QAAQW,EAAM,IAAIV,CAAM,CAAC;AAAA,MAC/C,SAAAO;AAAA,MACA,OAAOzC,IAAS,SAAOvB,IAAAuB,EAAO,aAAaA,EAAO,aAAa,SAAS,CAAC,MAAlD,gBAAAvB,EAAqD,UAAS,CAAC,IAAI;AAAA,MAC1F,UAAA8B;AAAA,MACA,SAAAf;AAAA,MACA,QAAAI;AAAA,MACA,GAAG+C;AAAA,IAAA,GAELV,IAAW,EAAE,GAAGA,GAAU,QAAQO,EAASC,GAASR,EAAS,OAAO,EAAA;AACpE,eAAWY,KAAYpD,EAAW,CAAAoD,EAAA;AAAA,EACpC;AAGA,WAASC,IAAe;AACtB,QAAI,GAAClD,KAAU,CAACI,IAChB;AAAA,UAAI;AACF,cAAM+C,IAAQ,CAAC5E,GAAK,GAAG6E,EAAmB;AAC1C,QAAA7C,IAAOP,EAAO,KAAK,EAAE,MAAMI,EAAO,MAAM,QAAAK,GAAQ,QAAQ4C,GAAa7C,GAAS2C,CAAK,EAAA,CAAG,GACtFjC,EAAQ,QAAQX,EAAK,MAAM;AAAA,MAC7B,SAASU,GAAO;AACd,QAAAV,IAAO,MACPW,EAAQ,QAAQ,EAAE,GAClBF,EAAKC,CAAK;AAAA,MACZ;AACA,MAAAC,EAAQ,UAAA,GACJR,KAAUQ,EAAQ,OAAOR,GAAUd,EAAQ,SAASxB,CAAa,GACrEgE,EAAA;AAAA;AAAA,EACF;AAEA,WAASkB,IAAe;;AACtB,IAAApD,IAAS,IACTE,IAAS,MACTG,IAAO,MACPI,IAAW,CAAA,GACXC,IAAW,MACXM,EAAQ,SAAA;AACR,UAAMqC,IAAU,EAAE,WAAW,MAAM,OAAO,MAAM,SAAS,MAAM,QAAQ,IAAI,OAAO,KAAA;AAClF,QAAI,CAACvD,EAAQ,QAAOoC,EAAOmB,CAAO;AAClC,UAAMC,IAAQxD,EAAO,MAAM,UACrByD,IAAO7D,EAAQ,UAAQf,IAAA2E,EAAM,KAAK,CAACE,MAAMA,EAAE,QAAQ,MAA5B,gBAAA7E,EAA+B,WAAQ8E,IAAAH,EAAM,CAAC,MAAP,gBAAAG,EAAU;AAC9E,IAAAtD,IAAY,KAAK,IAAI,GAAGmD,EAAM,UAAU,CAACE,MAAMA,EAAE,SAASD,CAAI,CAAC;AAC/D,QAAI;AACF,UAAIA,MAAS,OAAW,OAAM,IAAI,MAAM,uCAAuC;AAC/E,MAAArD,IAASJ,EAAO,WAAWyD,CAAI;AAC/B,YAAMG,MAAOC,IAAA7D,EAAO,WAAW,WAAWyD,CAAI,EAAE,UAAnC,gBAAAI,EAA0C,gBAAe;AACtE,MAAAvD,MAAawD,KAAAC,IAAAP,EAAMnD,CAAS,MAAf,gBAAA0D,EAAkB,SAAS,KAAK,CAACC,MAAYA,EAAQ,SAASJ,OAA9D,gBAAAE,EAAqE,WAAU,MAC5F5C,EAAQ,UAAUd,CAAM;AAAA,IAC1B,SAASa,GAAO;AACd,MAAAf,IAAS,IACTc,EAAKC,CAAK;AAAA,IACZ;AACA,IAAAoB,IAAW,EAAE,GAAGA,GAAU,GAAGkB,EAAA,GAC7BL,EAAA;AAAA,EACF;AAGA,WAASe,EAAMC,GAAqC;AAGlD,QAFAlE,IAAS,MACTC,IAAUd,GAAU+E,CAAK,IAAIA,IAAQ,MACjC,CAACjE;AACH,aAAAD,IAASkE,GACFZ,EAAA;AAET,UAAMa,IAAWlE;AACjB,IAAAqD,EAAA,GACAa,EAAS;AAAA,MACP,CAACC,MAAW;AACV,QAAInE,MAAYkE,MAChBlE,IAAU,MACVD,IAASoE,GACTd,EAAA;AAAA,MACF;AAAA,MACA,CAACrC,MAAmB;AAClB,QAAIhB,MAAYkE,MAChBlE,IAAU,MACVC,IAAS,IACTc,EAAKC,CAAK,GACVmB,EAAA;AAAA,MACF;AAAA,IAAA;AAAA,EAEJ;AAEA,WAASiC,IAAe;AACtB,IAAAxD,KAAA,QAAAA,KACAA,IAAW;AACX,UAAMyD,IAAc1E,EAAQ,UACtB2E,IAAW,MAAM;AACrB,UAAIhF;AACJ,UAAI;AACF,QAAAA,IAAO+E,IAAcE,GAAUF,GAAaxE,CAAI,IAAI;AAAA,MACtD,SAASmB,GAAO;AACd,QAAAD,EAAKC,CAAK;AACV;AAAA,MACF;AACA,MAAInC,GAAWS,GAAMkB,CAAM,MAC3BA,IAASlB,GACT2D,EAAA;AAAA,IACF;AACA,IAAIoB,MACFA,EAAY,iBAAiB,SAASC,CAAQ,GAC9C1D,IAAW,MAAMyD,EAAY,oBAAoB,SAASC,CAAQ,IAEpEA,EAAA;AAAA,EACF;AAEA,QAAME,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMxB,UAAUxB,GAAU;AAClB,aAAApD,EAAU,IAAIoD,CAAQ,GACjBnC,MACHA,IAAS,IACTuD,EAAA,IAEK,MAAM;AACX,QAAAxE,EAAU,OAAOoD,CAAQ,GACrBpD,EAAU,SAAS,KAAG4E,EAAM,QAAA;AAAA,MAClC;AAAA,IACF;AAAA,IACA,aAAa,MAAMpC;AAAA,IACnB,YAAY,MAAMzC;AAAA,IAClB,WAAWL,GAAM;AACf,YAAMD,IAAWM;AACjB,MAAAA,IAAUL;AACV,YAAMmF,IAAcpG,EAAUiB,CAAI,GAC5BoF,IACJD,EAAY,aAAalE,EAAQ,YACjCkE,EAAY,SAASlE,EAAQ,QAC7BkE,EAAY,UAAUlE,EAAQ;AAEhC,UADAA,IAAUkE,GACNnF,EAAK,WAAWD,EAAS,UAAUC,EAAK,SAASD,EAAS,MAAM;AAClE,QAAIC,EAAK,WAAWD,EAAS,SAAQ2E,EAAM1E,EAAK,MAAM,IACjD+D,EAAA,GACDxC,KAAUvB,EAAK,aAAaD,EAAS,YAAU+E,EAAA;AACnD;AAAA,MACF;AAEA,UADIvD,KAAUvB,EAAK,aAAaD,EAAS,YAAU+E,EAAA,GAC/CM,UAAgBzB,EAAA;AACpB,MAAI3D,EAAK,UAAUD,EAAS,SAASoB,OAAkB,OAAOA,GAAUnB,EAAK,SAASnB,CAAa,GACnGgE,EAAA;AAAA,IACF;AAAA,IACA,UAAU;AACR,MAAAtB,IAAS,IACTD,KAAA,QAAAA,KACAA,IAAW,MACXK,EAAQ,SAAA,GACRrB,EAAU,MAAA;AAAA,IACZ;AAAA,IACA,YAAYN,GAAM;AAChB,MAAAmB,IAAWnB,GACP2B,EAAQ,OAAO3B,GAAMK,EAAQ,SAASxB,CAAa,MAAM2C,KAAWqB,EAAA;AAAA,IAC1E;AAAA,IACA,OAAOwC,GAAUC,IAAS,QAAQC,IAAQ,IAAI;;AAC5C,YAAMC,IAAYH,KAAYA,EAAS,SAAS,IAAI,EAAE,UAAU,CAAC,GAAGA,CAAQ,GAAG,QAAAC,GAAQ,OAAAC,MAAU;AACjG,MAAA1C,EAAO,EAAE,WAAA2C,GAAW,IACpBlG,IAAAe,EAAQ,aAAR,QAAAf,EAAA,KAAAe,GAAmBmF,IACfnF,EAAQ,YAAUoF,GAAQpF,EAAQ,UAAUE,GAAMvB,GAAKwG,IAAYA,EAAU,SAAS,IAAIE,EAAO,IAAI,IAAI;AAAA,IAC/G;AAAA,IACA,MAAMC,GAAQ;;AACZ,MAAIA,MAAW7C,EAAS,UACxBD,EAAO,EAAE,OAAO8C,GAAQ,IACxBrG,IAAAe,EAAQ,YAAR,QAAAf,EAAA,KAAAe,GAAkBsF;AAAA,IACpB;AAAA,IACA,MAAMA,GAAQ;AACZ,MAAIA,MAAW7C,EAAS,aAAgB,EAAE,SAAS6C,GAAQ;AAAA,IAC7D;AAAA,IACA,IAAIN,GAAU;AACZ,MAAAxC,EAAO,EAAE,QAAQ,CAAC,GAAGwC,CAAQ,GAAG;AAAA,IAClC;AAAA,IACA,QAAQO,GAAM;AACZ,MAAIA,MAAS9C,EAAS,QAAMD,EAAO,EAAE,MAAA+C,GAAM;AAAA,IAC7C;AAAA,IACA,OAAOC,GAAQ;AACb,MAAIA,MAAW/C,EAAS,UAAQD,EAAO,EAAE,QAAAgD,GAAQ;AAAA,IACnD;AAAA,IACA,eAAehG,GAAO;AACpB,MAAIA,MAAUiD,EAAS,cAAiB,EAAE,UAAUjD,GAAO;AAAA,IAC7D;AAAA,IACA,cAAciG,GAAY;AACxB,MAAIlF,MAAiB,CAACkF,MACtBlF,IAAe,CAACkF,GAChBjD,EAAA;AAAA,IACF;AAAA,IACA,YAAYU,GAASwC,GAAO;AAC1B,MAAI1E,MAAakC,KAAWwC,MAAU,SACtC1E,IAAWkC,GACXV,EAAOkD,IAAQ,EAAE,OAAAA,EAAA,IAAU,CAAA,CAAE;AAAA,IAC/B;AAAA,EAAA;AAGF,SAAA9E,IAAUlC,EAAUqB,CAAO,GAC3BsE,EAAMtE,EAAQ,MAAM,GACb8E;AACT;"}
+{"version":3,"file":"store.js","sources":["../../src/core/store.ts"],"sourcesContent":["import {\n  PAYLOAD_ADDRESS,\n  PAYLOAD_COORDINATES,\n  type Batch,\n  type Corpus,\n  type Filter,\n  type Gap,\n  type Scan,\n  type TileAddress,\n  type TileMatrixSet,\n} from \"@fossil-lang/corpus\";\nimport type { MosaicClient } from \"@kanzo-tech/mosaic\";\nimport { domainOf } from \"./categories\";\nimport { bindingOf, projectionOf, type Binding } from \"./channels\";\nimport { filterFor, graphClient, publish } from \"./filter\";\nimport { denseOf } from \"./resident\";\nimport type { GraphOptions, GraphSnapshot, GraphStatus, GraphStore, TileView } from \"./state\";\nimport type { TileContent } from \"./tile\";\nimport type { Viewport } from \"./tile-matrix\";\nimport { Tileset2D } from \"./tileset\";\n\nexport type { Drawn, GraphOptions, GraphSnapshot, GraphState, GraphStatus, GraphStore, TileView } from \"./state\";\n\n/** Twenty thousand marks: what a canvas draws at once before a coarser zoom is chosen. */\nexport const DEFAULT_LIMIT = 20_000;\n\nconst NO_BINDING: Binding = bindingOf({});\nconst KEY = PAYLOAD_ADDRESS[0] as string;\n\nfunction bytesOf(content: Omit<TileContent, \"byteLength\">): number {\n  let bytes = 0;\n  for (const edge of content.edges) bytes += edge.src.byteLength + edge.dst.byteLength + (edge.weight?.byteLength ?? 0);\n  return bytes + content.rows.numRows * 8 * 4;\n}\n\nconst sameFilter = (a: Filter | undefined, b: Filter | undefined) =>\n  JSON.stringify(a, (_, v: unknown) => (typeof v === \"bigint\" ? `${v}n` : v)) ===\n  JSON.stringify(b, (_, v: unknown) => (typeof v === \"bigint\" ? `${v}n` : v));\n\nconst isPromise = (value: unknown): value is PromiseLike<Corpus> =>\n  typeof (value as PromiseLike<Corpus> | null)?.then === \"function\";\n\n/** The same array while the set of tiles in it is the same, so a reader can compare by identity. */\nfunction keep(previous: readonly TileView[], next: TileView[]): readonly TileView[] {\n  if (previous.length !== next.length) return next;\n  return next.every((view, i) => view.content === previous[i]?.content) ? previous : next;\n}\n\nexport function createGraph(initial: GraphOptions): GraphStore {\n  let options = initial;\n  const listeners = new Set<() => void>();\n  const self: MosaicClient = graphClient();\n\n  let corpus: Corpus | null = null;\n  let opening: PromiseLike<Corpus> | null = null;\n  let failed = false;\n  let unrenderable = false;\n  let matrix: TileMatrixSet | null = null;\n  let typeIndex = 0;\n  let modeColumn: string | null = null;\n  let scan: Scan | null = null;\n  let binding = NO_BINDING;\n  let filter: Filter | undefined;\n  let viewport: Viewport | null = null;\n  let declined: Gap[] = [];\n  let composed: readonly TileView[] | null = null;\n  let unlisten: (() => void) | null = null;\n  let active = false;\n  let lastFrame = -1;\n\n  // A failure found while the store is being built is found while React is still rendering —\n  // `useGraph` builds it in `useState` — and a host's `onFailure` is usually a `setState`. It is held\n  // and reported to the first subscriber, which arrives in the commit phase. Anything later is\n  // asynchronous or effect-driven and is reported as it happens.\n  let building = true;\n  let held: string | null = null;\n  const fail = (error: unknown) => {\n    const message = error instanceof Error ? error.message : String(error);\n    if (building) held = message;\n    else options.onFailure(message);\n  };\n\n  const tileset = new Tileset2D({\n    debounceTime: 60,\n    load: async (addresses, signal) => {\n      if (!corpus || !scan) throw new Error(\"the graph has no scan to read with\");\n      const isCells = (address: TileAddress) => matrix?.tileMatrices[address.z]?.kind === \"cells\";\n      const rows = await scan.read(addresses, { signal });\n      const src = await corpus.edges({ from: addresses, direction: \"src\", signal });\n      const payload = addresses.filter((address) => !isCells(address));\n      const dst = payload.length > 0 ? await corpus.edges({ from: payload, direction: \"dst\", signal }) : [];\n      const dstOf = new Map(payload.map((address, i) => [address, dst[i]]));\n      return addresses.map((address, i) => {\n        const out = src[i];\n        const back = dstOf.get(address);\n        const edges = [...(out?.batches ?? []), ...(back?.batches ?? [])];\n        const gaps = [...(out?.declined ?? []), ...(back?.declined ?? [])];\n        const declined = isCells(address) ? gaps.filter((gap) => gap.direction !== \"dst\") : gaps;\n        const content = { rows: rows[i] as Batch, edges, declined };\n        return { ...content, byteLength: bytesOf(content) };\n      });\n    },\n    onTileLoad: (tile) => {\n      for (const gap of tile.content?.declined ?? []) {\n        if (!declined.some((d) => d.edgeType === gap.edgeType && d.direction === gap.direction)) {\n          declined = [...declined, gap];\n        }\n      }\n      tileset.refresh();\n      notify();\n    },\n    onTileError: (error) => {\n      tileset.refresh();\n      fail(error);\n      notify();\n    },\n  });\n\n  let snapshot: GraphSnapshot = {\n    status: \"none\",\n    matrix: null,\n    typeIndex: 0,\n    modeColumn: null,\n    binding: NO_BINDING,\n    domain: [],\n    z: null,\n    visible: [],\n    cached: [],\n    pending: false,\n    total: undefined,\n    declined: [],\n    selection: null,\n    focus: null,\n    hovered: null,\n    pinned: [],\n    tool: null,\n    motion: \"settled\",\n    progress: 1,\n    drawn: null,\n    options,\n    corpus: null,\n  };\n\n  const viewOf = (tile: { address: TileAddress; content: TileContent | null }): TileView => ({\n    address: tile.address,\n    kind: matrix?.tileMatrices[tile.address.z]?.kind ?? \"rows\",\n    content: tile.content as TileContent,\n  });\n\n  let domain: { key: unknown[]; value: readonly unknown[] } = { key: [], value: [] };\n  function domainNow(): readonly unknown[] {\n    const key = [corpus, typeIndex, binding.category, options.categories];\n    if (key.some((part, i) => part !== domain.key[i])) domain = { key, value: domainOf(corpus, typeIndex, binding, options.categories) };\n    return domain.value;\n  }\n\n  function statusOf(pending: boolean, visible: readonly TileView[]): GraphStatus {\n    if (failed || unrenderable) return \"failed\";\n    if (opening) return \"opening\";\n    if (!corpus) return \"none\";\n    return pending || composed !== visible || snapshot.drawn === null ? \"reading\" : \"idle\";\n  }\n\n  function notify(patch: Partial<GraphSnapshot> = {}): void {\n    lastFrame = tileset.frame;\n    const tiles = tileset.tiles.filter((tile) => tile.content !== null);\n    const visible = keep(snapshot.visible, tiles.filter((tile) => tile.isVisible).map(viewOf));\n    const pending = tileset.selectedTiles.some((tile) => tile.isLoading);\n    snapshot = {\n      ...snapshot,\n      matrix,\n      typeIndex,\n      modeColumn,\n      binding,\n      domain: domainNow(),\n      z: tileset.z,\n      visible,\n      cached: keep(snapshot.cached, tiles.map(viewOf)),\n      pending,\n      total: matrix ? Number(matrix.tileMatrices[matrix.tileMatrices.length - 1]?.count ?? 0) : undefined,\n      declined,\n      options,\n      corpus,\n      ...patch,\n    };\n    snapshot = { ...snapshot, status: statusOf(pending, snapshot.visible) };\n    for (const listener of listeners) listener();\n  }\n\n  /** A binding or a filter is a new scan, planned once and never per camera move. */\n  function rescan(): void {\n    if (!corpus || !matrix) return;\n    try {\n      const fixed = [KEY, ...PAYLOAD_COORDINATES];\n      scan = corpus.scan({ type: matrix.type, filter, select: projectionOf(binding, fixed) });\n      tileset.setPlan(scan.plan());\n    } catch (error) {\n      scan = null;\n      tileset.setPlan([]);\n      fail(error);\n    }\n    tileset.reloadAll();\n    if (viewport) tileset.update(viewport, options.limit ?? DEFAULT_LIMIT);\n    notify();\n  }\n\n  function reopen(): void {\n    failed = false;\n    matrix = null;\n    scan = null;\n    declined = [];\n    composed = null;\n    tileset.finalize();\n    const cleared = { selection: null, focus: null, hovered: null, pinned: [], drawn: null };\n    if (!corpus) return notify(cleared);\n    const types = corpus.types.vertices;\n    const type = options.type ?? types.find((t) => t.geometry)?.type ?? types[0]?.type;\n    typeIndex = Math.max(0, types.findIndex((t) => t.type === type));\n    try {\n      if (type === undefined) throw new Error(\"the corpus has no vertex type to draw\");\n      matrix = corpus.tileMatrix(type);\n      const mode = corpus.addressing.vertexType(type).cells?.modeChannel ?? null;\n      modeColumn = types[typeIndex]?.channels.find((channel) => channel.name === mode)?.column ?? null;\n      tileset.setMatrix(matrix);\n    } catch (error) {\n      failed = true;\n      fail(error);\n    }\n    snapshot = { ...snapshot, ...cleared };\n    rescan();\n  }\n\n  /** A promise is adopted when it settles, and only if it is still the corpus the host means. */\n  function adopt(given: GraphOptions[\"corpus\"]): void {\n    corpus = null;\n    opening = isPromise(given) ? given : null;\n    if (!opening) {\n      corpus = given as Corpus | null;\n      return reopen();\n    }\n    const promised = opening;\n    reopen();\n    promised.then(\n      (opened) => {\n        if (opening !== promised) return;\n        opening = null;\n        corpus = opened;\n        reopen();\n      },\n      (error: unknown) => {\n        if (opening !== promised) return;\n        opening = null;\n        failed = true;\n        fail(error);\n        notify();\n      },\n    );\n  }\n\n  function listen(): void {\n    unlisten?.();\n    unlisten = null;\n    const crossfilter = options.filterBy;\n    const refilter = () => {\n      let next: Filter | undefined;\n      try {\n        next = crossfilter ? filterFor(crossfilter, self) : undefined;\n      } catch (error) {\n        fail(error);\n        return;\n      }\n      if (sameFilter(next, filter)) return;\n      filter = next;\n      rescan();\n    };\n    if (crossfilter) {\n      crossfilter.addEventListener(\"value\", refilter);\n      unlisten = () => crossfilter.removeEventListener(\"value\", refilter);\n    }\n    refilter();\n  }\n\n  const store: GraphStore = {\n    /**\n     * The first subscriber starts listening to the crossfilter and the last one stops it and lets the\n     * tiles go — `QueryObserver`'s `onSubscribe`/`onUnsubscribe`, which is what survives StrictMode\n     * mounting everything twice.\n     */\n    subscribe(listener) {\n      listeners.add(listener);\n      if (!active) {\n        active = true;\n        listen();\n        if (held !== null) {\n          const message = held;\n          held = null;\n          options.onFailure(message);\n        }\n      }\n      return () => {\n        listeners.delete(listener);\n        if (listeners.size === 0) store.destroy();\n      };\n    },\n    getSnapshot: () => snapshot,\n    getOptions: () => options,\n    setOptions(next) {\n      const previous = options;\n      options = next;\n      const nextBinding = bindingOf(next);\n      const rebound =\n        nextBinding.category !== binding.category ||\n        nextBinding.size !== binding.size ||\n        nextBinding.title !== binding.title;\n      binding = nextBinding;\n      if (next.corpus !== previous.corpus || next.type !== previous.type) {\n        if (next.corpus !== previous.corpus) adopt(next.corpus);\n        else reopen();\n        if (active && next.filterBy !== previous.filterBy) listen();\n        return;\n      }\n      if (active && next.filterBy !== previous.filterBy) listen();\n      if (rebound) return rescan();\n      if (next.limit !== previous.limit && viewport) tileset.update(viewport, next.limit ?? DEFAULT_LIMIT);\n      notify();\n    },\n    destroy() {\n      active = false;\n      unlisten?.();\n      unlisten = null;\n      tileset.finalize();\n      listeners.clear();\n    },\n    setViewport(next) {\n      viewport = next;\n      if (tileset.update(next, options.limit ?? DEFAULT_LIMIT) !== lastFrame) notify();\n    },\n    select(vertices, source = \"node\", label = \"\") {\n      const selection = vertices && vertices.length > 0 ? { vertices: [...vertices], source, label } : null;\n      notify({ selection });\n      options.onSelect?.(selection);\n      if (options.filterBy) publish(options.filterBy, self, KEY, selection ? selection.vertices.map(denseOf) : null);\n    },\n    focus(vertex) {\n      if (vertex === snapshot.focus) return;\n      notify({ focus: vertex });\n      options.onFocus?.(vertex);\n    },\n    hover(vertex) {\n      if (vertex !== snapshot.hovered) notify({ hovered: vertex });\n    },\n    pin(vertices) {\n      notify({ pinned: [...vertices] });\n    },\n    setTool(tool) {\n      if (tool !== snapshot.tool) notify({ tool });\n    },\n    report(motion) {\n      if (motion !== snapshot.motion) notify({ motion });\n    },\n    reportProgress(value) {\n      if (value !== snapshot.progress) notify({ progress: value });\n    },\n    setRenderable(renderable) {\n      if (unrenderable === !renderable) return;\n      unrenderable = !renderable;\n      notify();\n    },\n    reportDrawn(visible, drawn) {\n      if (composed === visible && drawn === null) return;\n      composed = visible;\n      notify(drawn ? { drawn } : {});\n    },\n  };\n\n  binding = bindingOf(initial);\n  adopt(initial.corpus);\n  building = false;\n  return store;\n}\n"],"names":["DEFAULT_LIMIT","NO_BINDING","bindingOf","KEY","PAYLOAD_ADDRESS","bytesOf","content","bytes","edge","_a","sameFilter","a","b","_","v","isPromise","value","keep","previous","next","view","i","createGraph","initial","options","listeners","self","graphClient","corpus","opening","failed","unrenderable","matrix","typeIndex","modeColumn","scan","binding","filter","viewport","declined","composed","unlisten","active","lastFrame","building","held","fail","error","message","tileset","Tileset2D","addresses","signal","isCells","address","rows","src","payload","dst","dstOf","out","back","edges","gaps","gap","tile","d","notify","snapshot","viewOf","domain","domainNow","key","part","domainOf","statusOf","pending","visible","patch","tiles","listener","rescan","fixed","PAYLOAD_COORDINATES","projectionOf","reopen","cleared","types","type","t","_b","mode","_c","_e","_d","channel","adopt","given","promised","opened","listen","crossfilter","refilter","filterFor","store","nextBinding","rebound","vertices","source","label","selection","publish","denseOf","vertex","tool","motion","renderable","drawn"],"mappings":";;;;;;AAwBO,MAAMA,IAAgB,KAEvBC,IAAsBC,EAAU,EAAE,GAClCC,IAAMC,GAAgB,CAAC;AAE7B,SAASC,GAAQC,GAAkD;;AACjE,MAAIC,IAAQ;AACZ,aAAWC,KAAQF,EAAQ,MAAO,CAAAC,KAASC,EAAK,IAAI,aAAaA,EAAK,IAAI,gBAAcC,IAAAD,EAAK,WAAL,gBAAAC,EAAa,eAAc;AACnH,SAAOF,IAAQD,EAAQ,KAAK,UAAU,IAAI;AAC5C;AAEA,MAAMI,KAAa,CAACC,GAAuBC,MACzC,KAAK,UAAUD,GAAG,CAACE,GAAGC,MAAgB,OAAOA,KAAM,WAAW,GAAGA,CAAC,MAAMA,CAAE,MAC1E,KAAK,UAAUF,GAAG,CAACC,GAAGC,MAAgB,OAAOA,KAAM,WAAW,GAAGA,CAAC,MAAMA,CAAE,GAEtEC,KAAY,CAACC,MACjB,QAAQA,KAAA,gBAAAA,EAAsC,SAAS;AAGzD,SAASC,EAAKC,GAA+BC,GAAuC;AAClF,SAAID,EAAS,WAAWC,EAAK,SAAeA,IACrCA,EAAK,MAAM,CAACC,GAAMC,MAAA;;AAAM,WAAAD,EAAK,cAAYX,IAAAS,EAASG,CAAC,MAAV,gBAAAZ,EAAa;AAAA,GAAO,IAAIS,IAAWC;AACrF;AAEO,SAASG,GAAYC,GAAmC;AAC7D,MAAIC,IAAUD;AACd,QAAME,wBAAgB,IAAA,GAChBC,IAAqBC,GAAA;AAE3B,MAAIC,IAAwB,MACxBC,IAAsC,MACtCC,IAAS,IACTC,IAAe,IACfC,IAA+B,MAC/BC,IAAY,GACZC,IAA4B,MAC5BC,IAAoB,MACpBC,IAAUnC,GACVoC,GACAC,IAA4B,MAC5BC,IAAkB,CAAA,GAClBC,IAAuC,MACvCC,IAAgC,MAChCC,IAAS,IACTC,IAAY,IAMZC,IAAW,IACXC,IAAsB;AAC1B,QAAMC,IAAO,CAACC,MAAmB;AAC/B,UAAMC,IAAUD,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK;AACrE,IAAIH,IAAUC,IAAOG,IAChBxB,EAAQ,UAAUwB,CAAO;AAAA,EAChC,GAEMC,IAAU,IAAIC,GAAU;AAAA,IAC5B,cAAc;AAAA,IACd,MAAM,OAAOC,GAAWC,MAAW;AACjC,UAAI,CAACxB,KAAU,CAACO,EAAM,OAAM,IAAI,MAAM,oCAAoC;AAC1E,YAAMkB,IAAU,CAACC;;AAAyB,iBAAA7C,IAAAuB,KAAA,gBAAAA,EAAQ,aAAasB,EAAQ,OAA7B,gBAAA7C,EAAiC,UAAS;AAAA,SAC9E8C,IAAO,MAAMpB,EAAK,KAAKgB,GAAW,EAAE,QAAAC,GAAQ,GAC5CI,IAAM,MAAM5B,EAAO,MAAM,EAAE,MAAMuB,GAAW,WAAW,OAAO,QAAAC,GAAQ,GACtEK,IAAUN,EAAU,OAAO,CAACG,MAAY,CAACD,EAAQC,CAAO,CAAC,GACzDI,IAAMD,EAAQ,SAAS,IAAI,MAAM7B,EAAO,MAAM,EAAE,MAAM6B,GAAS,WAAW,OAAO,QAAAL,EAAA,CAAQ,IAAI,CAAA,GAC7FO,IAAQ,IAAI,IAAIF,EAAQ,IAAI,CAACH,GAASjC,MAAM,CAACiC,GAASI,EAAIrC,CAAC,CAAC,CAAC,CAAC;AACpE,aAAO8B,EAAU,IAAI,CAACG,GAASjC,MAAM;AACnC,cAAMuC,IAAMJ,EAAInC,CAAC,GACXwC,IAAOF,EAAM,IAAIL,CAAO,GACxBQ,KAAQ,CAAC,IAAIF,KAAA,gBAAAA,EAAK,YAAW,CAAA,GAAK,IAAIC,KAAA,gBAAAA,EAAM,YAAW,EAAG,GAC1DE,IAAO,CAAC,IAAIH,KAAA,gBAAAA,EAAK,aAAY,CAAA,GAAK,IAAIC,KAAA,gBAAAA,EAAM,aAAY,EAAG,GAC3DtB,KAAWc,EAAQC,CAAO,IAAIS,EAAK,OAAO,CAACC,OAAQA,GAAI,cAAc,KAAK,IAAID,GAC9EzD,IAAU,EAAE,MAAMiD,EAAKlC,CAAC,GAAY,OAAAyC,IAAO,UAAAvB,GAAAA;AACjD,eAAO,EAAE,GAAGjC,GAAS,YAAYD,GAAQC,CAAO,EAAA;AAAA,MAClD,CAAC;AAAA,IACH;AAAA,IACA,YAAY,CAAC2D,MAAS;;AACpB,iBAAWD,OAAOvD,IAAAwD,EAAK,YAAL,gBAAAxD,EAAc,aAAY,CAAA;AAC1C,QAAK8B,EAAS,KAAK,CAAC2B,MAAMA,EAAE,aAAaF,EAAI,YAAYE,EAAE,cAAcF,EAAI,SAAS,MACpFzB,IAAW,CAAC,GAAGA,GAAUyB,CAAG;AAGhC,MAAAf,EAAQ,QAAA,GACRkB,EAAA;AAAA,IACF;AAAA,IACA,aAAa,CAACpB,MAAU;AACtB,MAAAE,EAAQ,QAAA,GACRH,EAAKC,CAAK,GACVoB,EAAA;AAAA,IACF;AAAA,EAAA,CACD;AAED,MAAIC,IAA0B;AAAA,IAC5B,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,SAASnE;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,GAAG;AAAA,IACH,SAAS,CAAA;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,SAAS;AAAA,IACT,OAAO;AAAA,IACP,UAAU,CAAA;AAAA,IACV,WAAW;AAAA,IACX,OAAO;AAAA,IACP,SAAS;AAAA,IACT,QAAQ,CAAA;AAAA,IACR,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,UAAU;AAAA,IACV,OAAO;AAAA,IACP,SAAAuB;AAAA,IACA,QAAQ;AAAA,EAAA;AAGV,QAAM6C,IAAS,CAACJ,MAAA;;AAA2E;AAAA,MACzF,SAASA,EAAK;AAAA,MACd,QAAMxD,IAAAuB,KAAA,gBAAAA,EAAQ,aAAaiC,EAAK,QAAQ,OAAlC,gBAAAxD,EAAsC,SAAQ;AAAA,MACpD,SAASwD,EAAK;AAAA,IAAA;AAAA;AAGhB,MAAIK,IAAwD,EAAE,KAAK,CAAA,GAAI,OAAO,CAAA,EAAC;AAC/E,WAASC,IAAgC;AACvC,UAAMC,IAAM,CAAC5C,GAAQK,GAAWG,EAAQ,UAAUZ,EAAQ,UAAU;AACpE,WAAIgD,EAAI,KAAK,CAACC,GAAMpD,MAAMoD,MAASH,EAAO,IAAIjD,CAAC,CAAC,MAAGiD,IAAS,EAAE,KAAAE,GAAK,OAAOE,GAAS9C,GAAQK,GAAWG,GAASZ,EAAQ,UAAU,EAAA,IAC1H8C,EAAO;AAAA,EAChB;AAEA,WAASK,EAASC,GAAkBC,GAA2C;AAC7E,WAAI/C,KAAUC,IAAqB,WAC/BF,IAAgB,YACfD,IACEgD,KAAWpC,MAAaqC,KAAWT,EAAS,UAAU,OAAO,YAAY,SAD5D;AAAA,EAEtB;AAEA,WAASD,EAAOW,IAAgC,IAAU;;AACxD,IAAAnC,IAAYM,EAAQ;AACpB,UAAM8B,IAAQ9B,EAAQ,MAAM,OAAO,CAACgB,MAASA,EAAK,YAAY,IAAI,GAC5DY,IAAU5D,EAAKmD,EAAS,SAASW,EAAM,OAAO,CAACd,MAASA,EAAK,SAAS,EAAE,IAAII,CAAM,CAAC,GACnFO,IAAU3B,EAAQ,cAAc,KAAK,CAACgB,MAASA,EAAK,SAAS;AACnE,IAAAG,IAAW;AAAA,MACT,GAAGA;AAAA,MACH,QAAApC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,SAAAE;AAAA,MACA,QAAQmC,EAAA;AAAA,MACR,GAAGtB,EAAQ;AAAA,MACX,SAAA4B;AAAA,MACA,QAAQ5D,EAAKmD,EAAS,QAAQW,EAAM,IAAIV,CAAM,CAAC;AAAA,MAC/C,SAAAO;AAAA,MACA,OAAO5C,IAAS,SAAOvB,IAAAuB,EAAO,aAAaA,EAAO,aAAa,SAAS,CAAC,MAAlD,gBAAAvB,EAAqD,UAAS,CAAC,IAAI;AAAA,MAC1F,UAAA8B;AAAA,MACA,SAAAf;AAAA,MACA,QAAAI;AAAA,MACA,GAAGkD;AAAA,IAAA,GAELV,IAAW,EAAE,GAAGA,GAAU,QAAQO,EAASC,GAASR,EAAS,OAAO,EAAA;AACpE,eAAWY,KAAYvD,EAAW,CAAAuD,EAAA;AAAA,EACpC;AAGA,WAASC,IAAe;AACtB,QAAI,GAACrD,KAAU,CAACI,IAChB;AAAA,UAAI;AACF,cAAMkD,IAAQ,CAAC/E,GAAK,GAAGgF,EAAmB;AAC1C,QAAAhD,IAAOP,EAAO,KAAK,EAAE,MAAMI,EAAO,MAAM,QAAAK,GAAQ,QAAQ+C,GAAahD,GAAS8C,CAAK,EAAA,CAAG,GACtFjC,EAAQ,QAAQd,EAAK,MAAM;AAAA,MAC7B,SAASY,GAAO;AACd,QAAAZ,IAAO,MACPc,EAAQ,QAAQ,EAAE,GAClBH,EAAKC,CAAK;AAAA,MACZ;AACA,MAAAE,EAAQ,UAAA,GACJX,KAAUW,EAAQ,OAAOX,GAAUd,EAAQ,SAASxB,CAAa,GACrEmE,EAAA;AAAA;AAAA,EACF;AAEA,WAASkB,IAAe;;AACtB,IAAAvD,IAAS,IACTE,IAAS,MACTG,IAAO,MACPI,IAAW,CAAA,GACXC,IAAW,MACXS,EAAQ,SAAA;AACR,UAAMqC,IAAU,EAAE,WAAW,MAAM,OAAO,MAAM,SAAS,MAAM,QAAQ,IAAI,OAAO,KAAA;AAClF,QAAI,CAAC1D,EAAQ,QAAOuC,EAAOmB,CAAO;AAClC,UAAMC,IAAQ3D,EAAO,MAAM,UACrB4D,IAAOhE,EAAQ,UAAQf,IAAA8E,EAAM,KAAK,CAACE,MAAMA,EAAE,QAAQ,MAA5B,gBAAAhF,EAA+B,WAAQiF,IAAAH,EAAM,CAAC,MAAP,gBAAAG,EAAU;AAC9E,IAAAzD,IAAY,KAAK,IAAI,GAAGsD,EAAM,UAAU,CAACE,MAAMA,EAAE,SAASD,CAAI,CAAC;AAC/D,QAAI;AACF,UAAIA,MAAS,OAAW,OAAM,IAAI,MAAM,uCAAuC;AAC/E,MAAAxD,IAASJ,EAAO,WAAW4D,CAAI;AAC/B,YAAMG,MAAOC,IAAAhE,EAAO,WAAW,WAAW4D,CAAI,EAAE,UAAnC,gBAAAI,EAA0C,gBAAe;AACtE,MAAA1D,MAAa2D,KAAAC,IAAAP,EAAMtD,CAAS,MAAf,gBAAA6D,EAAkB,SAAS,KAAK,CAACC,MAAYA,EAAQ,SAASJ,OAA9D,gBAAAE,EAAqE,WAAU,MAC5F5C,EAAQ,UAAUjB,CAAM;AAAA,IAC1B,SAASe,GAAO;AACd,MAAAjB,IAAS,IACTgB,EAAKC,CAAK;AAAA,IACZ;AACA,IAAAqB,IAAW,EAAE,GAAGA,GAAU,GAAGkB,EAAA,GAC7BL,EAAA;AAAA,EACF;AAGA,WAASe,EAAMC,GAAqC;AAGlD,QAFArE,IAAS,MACTC,IAAUd,GAAUkF,CAAK,IAAIA,IAAQ,MACjC,CAACpE;AACH,aAAAD,IAASqE,GACFZ,EAAA;AAET,UAAMa,IAAWrE;AACjB,IAAAwD,EAAA,GACAa,EAAS;AAAA,MACP,CAACC,MAAW;AACV,QAAItE,MAAYqE,MAChBrE,IAAU,MACVD,IAASuE,GACTd,EAAA;AAAA,MACF;AAAA,MACA,CAACtC,MAAmB;AAClB,QAAIlB,MAAYqE,MAChBrE,IAAU,MACVC,IAAS,IACTgB,EAAKC,CAAK,GACVoB,EAAA;AAAA,MACF;AAAA,IAAA;AAAA,EAEJ;AAEA,WAASiC,IAAe;AACtB,IAAA3D,KAAA,QAAAA,KACAA,IAAW;AACX,UAAM4D,IAAc7E,EAAQ,UACtB8E,IAAW,MAAM;AACrB,UAAInF;AACJ,UAAI;AACF,QAAAA,IAAOkF,IAAcE,GAAUF,GAAa3E,CAAI,IAAI;AAAA,MACtD,SAASqB,GAAO;AACd,QAAAD,EAAKC,CAAK;AACV;AAAA,MACF;AACA,MAAIrC,GAAWS,GAAMkB,CAAM,MAC3BA,IAASlB,GACT8D,EAAA;AAAA,IACF;AACA,IAAIoB,MACFA,EAAY,iBAAiB,SAASC,CAAQ,GAC9C7D,IAAW,MAAM4D,EAAY,oBAAoB,SAASC,CAAQ,IAEpEA,EAAA;AAAA,EACF;AAEA,QAAME,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMxB,UAAUxB,GAAU;AAElB,UADAvD,EAAU,IAAIuD,CAAQ,GAClB,CAACtC,MACHA,IAAS,IACT0D,EAAA,GACIvD,MAAS,OAAM;AACjB,cAAMG,IAAUH;AAChB,QAAAA,IAAO,MACPrB,EAAQ,UAAUwB,CAAO;AAAA,MAC3B;AAEF,aAAO,MAAM;AACX,QAAAvB,EAAU,OAAOuD,CAAQ,GACrBvD,EAAU,SAAS,KAAG+E,EAAM,QAAA;AAAA,MAClC;AAAA,IACF;AAAA,IACA,aAAa,MAAMpC;AAAA,IACnB,YAAY,MAAM5C;AAAA,IAClB,WAAWL,GAAM;AACf,YAAMD,IAAWM;AACjB,MAAAA,IAAUL;AACV,YAAMsF,IAAcvG,EAAUiB,CAAI,GAC5BuF,IACJD,EAAY,aAAarE,EAAQ,YACjCqE,EAAY,SAASrE,EAAQ,QAC7BqE,EAAY,UAAUrE,EAAQ;AAEhC,UADAA,IAAUqE,GACNtF,EAAK,WAAWD,EAAS,UAAUC,EAAK,SAASD,EAAS,MAAM;AAClE,QAAIC,EAAK,WAAWD,EAAS,SAAQ8E,EAAM7E,EAAK,MAAM,IACjDkE,EAAA,GACD3C,KAAUvB,EAAK,aAAaD,EAAS,YAAUkF,EAAA;AACnD;AAAA,MACF;AAEA,UADI1D,KAAUvB,EAAK,aAAaD,EAAS,YAAUkF,EAAA,GAC/CM,UAAgBzB,EAAA;AACpB,MAAI9D,EAAK,UAAUD,EAAS,SAASoB,OAAkB,OAAOA,GAAUnB,EAAK,SAASnB,CAAa,GACnGmE,EAAA;AAAA,IACF;AAAA,IACA,UAAU;AACR,MAAAzB,IAAS,IACTD,KAAA,QAAAA,KACAA,IAAW,MACXQ,EAAQ,SAAA,GACRxB,EAAU,MAAA;AAAA,IACZ;AAAA,IACA,YAAYN,GAAM;AAChB,MAAAmB,IAAWnB,GACP8B,EAAQ,OAAO9B,GAAMK,EAAQ,SAASxB,CAAa,MAAM2C,KAAWwB,EAAA;AAAA,IAC1E;AAAA,IACA,OAAOwC,GAAUC,IAAS,QAAQC,IAAQ,IAAI;;AAC5C,YAAMC,IAAYH,KAAYA,EAAS,SAAS,IAAI,EAAE,UAAU,CAAC,GAAGA,CAAQ,GAAG,QAAAC,GAAQ,OAAAC,MAAU;AACjG,MAAA1C,EAAO,EAAE,WAAA2C,GAAW,IACpBrG,IAAAe,EAAQ,aAAR,QAAAf,EAAA,KAAAe,GAAmBsF,IACftF,EAAQ,YAAUuF,GAAQvF,EAAQ,UAAUE,GAAMvB,GAAK2G,IAAYA,EAAU,SAAS,IAAIE,EAAO,IAAI,IAAI;AAAA,IAC/G;AAAA,IACA,MAAMC,GAAQ;;AACZ,MAAIA,MAAW7C,EAAS,UACxBD,EAAO,EAAE,OAAO8C,GAAQ,IACxBxG,IAAAe,EAAQ,YAAR,QAAAf,EAAA,KAAAe,GAAkByF;AAAA,IACpB;AAAA,IACA,MAAMA,GAAQ;AACZ,MAAIA,MAAW7C,EAAS,aAAgB,EAAE,SAAS6C,GAAQ;AAAA,IAC7D;AAAA,IACA,IAAIN,GAAU;AACZ,MAAAxC,EAAO,EAAE,QAAQ,CAAC,GAAGwC,CAAQ,GAAG;AAAA,IAClC;AAAA,IACA,QAAQO,GAAM;AACZ,MAAIA,MAAS9C,EAAS,QAAMD,EAAO,EAAE,MAAA+C,GAAM;AAAA,IAC7C;AAAA,IACA,OAAOC,GAAQ;AACb,MAAIA,MAAW/C,EAAS,UAAQD,EAAO,EAAE,QAAAgD,GAAQ;AAAA,IACnD;AAAA,IACA,eAAenG,GAAO;AACpB,MAAIA,MAAUoD,EAAS,cAAiB,EAAE,UAAUpD,GAAO;AAAA,IAC7D;AAAA,IACA,cAAcoG,GAAY;AACxB,MAAIrF,MAAiB,CAACqF,MACtBrF,IAAe,CAACqF,GAChBjD,EAAA;AAAA,IACF;AAAA,IACA,YAAYU,GAASwC,GAAO;AAC1B,MAAI7E,MAAaqC,KAAWwC,MAAU,SACtC7E,IAAWqC,GACXV,EAAOkD,IAAQ,EAAE,OAAAA,EAAA,IAAU,CAAA,CAAE;AAAA,IAC/B;AAAA,EAAA;AAGF,SAAAjF,IAAUlC,EAAUqB,CAAO,GAC3ByE,EAAMzE,EAAQ,MAAM,GACpBqB,IAAW,IACJ4D;AACT;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kanzo-tech/graph",
-  "version": "0.11.0",
+  "version": "0.13.0",
   "description": "Kanzo graph view — a tileset over a fossil corpus's scan, drawn with cosmos.gl, inside the page's Mosaic crossfilter. Sibling of @kanzo-tech/ui, not part of it: the admission rules exclude graphs from the generic vocabulary by name.",
   "type": "module",
   "license": "MIT",
@@ -29,8 +29,8 @@
     "@fossil-lang/corpus": "^0.3.0-alpha.13",
     "lucide-react": ">=1",
     "react": "^19.0.0",
-    "@kanzo-tech/ui": "0.11.0",
-    "@kanzo-tech/mosaic": "0.11.0"
+    "@kanzo-tech/mosaic": "0.13.0",
+    "@kanzo-tech/ui": "0.13.0"
   },
   "devDependencies": {
     "@cosmos.gl/graph": "^3.4.0",
@@ -46,7 +46,7 @@
     "react": "^19.0.0",
     "react-dom": "^19.0.0",
     "rollup-plugin-preserve-directives": "^0.4.0",
-    "@kanzo-tech/mosaic": "0.11.0"
+    "@kanzo-tech/mosaic": "0.13.0"
   },
   "repository": {
     "type": "git",