@kanzo-tech/graph 0.13.1 → 0.15.0

package/dist/core/tile.js

@@ -1,76 +0,0 @@
-var v = Object.defineProperty;
-var m = (e) => {
-  throw TypeError(e);
-};
-var w = (e, t, s) => t in e ? v(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s;
-var h = (e, t, s) => w(e, typeof t != "symbol" ? t + "" : t, s), L = (e, t, s) => t.has(e) || m("Cannot " + s);
-var i = (e, t, s) => (L(e, t, "read from private field"), s ? s.call(e) : t.get(e)), n = (e, t, s) => t.has(e) ? m("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, s), l = (e, t, s, f) => (L(e, t, "write to private field"), f ? f.call(e, s) : t.set(e, s), s), y = (e, t, s) => (L(e, t, "access private method"), s);
-import { tileId as z } from "./tile-matrix.js";
-var c, a, u, d, r, o, b, I;
-class E {
-  constructor(t) {
-    n(this, b);
-    h(this, "address");
-    h(this, "id");
-    h(this, "content", null);
-    h(this, "isSelected", !1);
-    h(this, "isVisible", !1);
-    h(this, "parent", null);
-    h(this, "children", []);
-    n(this, c, null);
-    n(this, a, null);
-    n(this, u, 0);
-    n(this, d, !1);
-    n(this, r, !1);
-    n(this, o, !1);
-    this.address = t, this.id = z(t);
-  }
-  get z() {
-    return this.address.z;
-  }
-  /** Read at least once for the current question. */
-  get isLoaded() {
-    return i(this, d) && !i(this, o);
-  }
-  /** Queued or running, and not cancelled. */
-  get isLoading() {
-    return i(this, a) !== null && !i(this, r);
-  }
-  get needsReload() {
-    return i(this, o) || i(this, r);
-  }
-  get byteLength() {
-    var t;
-    return ((t = this.content) == null ? void 0 : t.byteLength) ?? 0;
-  }
-  loadData(t) {
-    l(this, c, t.scheduler), l(this, d, !1), l(this, r, !1), l(this, o, !1), l(this, u, i(this, u) + 1);
-    const s = y(this, b, I).call(this, t);
-    return l(this, a, s), s;
-  }
-  /**
-   * A finished tile has nothing to abort; a queued or running one is cancelled, and its batch is
-   * aborted once no tile in it is wanted.
-   */
-  abort() {
-    var t;
-    i(this, d) || i(this, a) === null || (l(this, r, !0), (t = i(this, c)) == null || t.cancel(this));
-  }
-  setNeedsReload() {
-    this.isLoading && (this.abort(), l(this, a, null)), l(this, o, !0);
-  }
-}
-c = new WeakMap(), a = new WeakMap(), u = new WeakMap(), d = new WeakMap(), r = new WeakMap(), o = new WeakMap(), b = new WeakSet(), I = async function({ onError: t, onLoad: s, priority: f, scheduler: R }) {
-  const p = i(this, u), g = await R.schedule(this, f);
-  if (p === i(this, u)) {
-    if (l(this, a, null), g === null || i(this, r)) {
-      l(this, r, !0);
-      return;
-    }
-    l(this, d, !0), "value" in g ? (this.content = g.value, s(this)) : t(g.error ?? new Error("the tile failed to load"), this);
-  }
-};
-export {
-  E as Tile
-};
-//# sourceMappingURL=tile.js.map

package/dist/core/tile.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tile.js","sources":["../../src/core/tile.ts"],"sourcesContent":["import type { Batch, EdgeBatch, Gap, TileAddress } from \"@fossil-lang/corpus\";\nimport type { RequestScheduler } from \"./scheduler\";\nimport { tileId } from \"./tile-matrix\";\n\n/** What one tile holds once read: its rows, the relations incident to it, and what was declined. */\nexport interface TileContent {\n  readonly rows: Batch;\n  readonly edges: readonly EdgeBatch[];\n  readonly declined: readonly Gap[];\n  readonly byteLength: number;\n}\n\n/**\n * deck.gl's `getTileData`, over a batch: fossil's addresses where deck.gl has `{ x, y, z }`, and one\n * content per address, in order, because the corpus reads a run of consecutive tiles in one statement.\n */\nexport type TileLoader = (addresses: readonly TileAddress[], signal: AbortSignal) => Promise<readonly TileContent[]>;\n\nexport interface TileLoad {\n  scheduler: RequestScheduler<Tile, TileContent>;\n  priority: (tile: Tile) => number;\n  onLoad: (tile: Tile) => void;\n  onError: (error: unknown, tile: Tile) => void;\n}\n\n/**\n * deck.gl's `Tile2DHeader`: one tile's load, abort and content, and its place in the tree.\n *\n * **Content outlives a reload.** A tile marked for reload keeps what it last read until the new\n * answer arrives, and an aborted or failed reload keeps it too, so a change of question never\n * shows a hole. deck.gl drops it on a cancelled reload; the one departure, and it is what\n * `/docs/design/graph` asks of a change of data.\n */\nexport class Tile {\n  readonly address: TileAddress;\n  readonly id: string;\n  content: TileContent | null = null;\n  isSelected = false;\n  isVisible = false;\n  parent: Tile | null = null;\n  children: Tile[] = [];\n\n  #scheduler: RequestScheduler<Tile, TileContent> | null = null;\n  #loader: Promise<void> | null = null;\n  #loaderId = 0;\n  #loaded = false;\n  #cancelled = false;\n  #needsReload = false;\n\n  constructor(address: TileAddress) {\n    this.address = address;\n    this.id = tileId(address);\n  }\n\n  get z(): number {\n    return this.address.z;\n  }\n\n  /** Read at least once for the current question. */\n  get isLoaded(): boolean {\n    return this.#loaded && !this.#needsReload;\n  }\n\n  /** Queued or running, and not cancelled. */\n  get isLoading(): boolean {\n    return this.#loader !== null && !this.#cancelled;\n  }\n\n  get needsReload(): boolean {\n    return this.#needsReload || this.#cancelled;\n  }\n\n  get byteLength(): number {\n    return this.content?.byteLength ?? 0;\n  }\n\n  loadData(options: TileLoad): Promise<void> {\n    this.#scheduler = options.scheduler;\n    this.#loaded = false;\n    this.#cancelled = false;\n    this.#needsReload = false;\n    this.#loaderId += 1;\n    const loader = this.#load(options);\n    this.#loader = loader;\n    return loader;\n  }\n\n  /**\n   * A finished tile has nothing to abort; a queued or running one is cancelled, and its batch is\n   * aborted once no tile in it is wanted.\n   */\n  abort(): void {\n    if (this.#loaded || this.#loader === null) return;\n    this.#cancelled = true;\n    this.#scheduler?.cancel(this);\n  }\n\n  setNeedsReload(): void {\n    if (this.isLoading) {\n      this.abort();\n      this.#loader = null;\n    }\n    this.#needsReload = true;\n  }\n\n  async #load({ onError, onLoad, priority, scheduler }: TileLoad): Promise<void> {\n    const loaderId = this.#loaderId;\n    const outcome = await scheduler.schedule(this, priority);\n    if (loaderId !== this.#loaderId) return;\n    this.#loader = null;\n    if (outcome === null || this.#cancelled) {\n      this.#cancelled = true;\n      return;\n    }\n    this.#loaded = true;\n    if (\"value\" in outcome) {\n      this.content = outcome.value;\n      onLoad(this);\n    } else {\n      onError(outcome.error ?? new Error(\"the tile failed to load\"), this);\n    }\n  }\n}\n"],"names":["Tile","address","__privateAdd","_Tile_instances","__publicField","_scheduler","_loader","_loaderId","_loaded","_cancelled","_needsReload","tileId","__privateGet","_a","options","__privateSet","loader","__privateMethod","load_fn","onError","onLoad","priority","scheduler","loaderId","outcome"],"mappings":";;;;;;;;;AAiCO,MAAMA,EAAK;AAAA,EAgBhB,YAAYC,GAAsB;AAhB7B,IAAAC,EAAA,MAAAC;AACI,IAAAC,EAAA;AACA,IAAAA,EAAA;AACT,IAAAA,EAAA,iBAA8B;AAC9B,IAAAA,EAAA,oBAAa;AACb,IAAAA,EAAA,mBAAY;AACZ,IAAAA,EAAA,gBAAsB;AACtB,IAAAA,EAAA,kBAAmB,CAAA;AAEnB,IAAAF,EAAA,MAAAG,GAAyD;AACzD,IAAAH,EAAA,MAAAI,GAAgC;AAChC,IAAAJ,EAAA,MAAAK,GAAY;AACZ,IAAAL,EAAA,MAAAM,GAAU;AACV,IAAAN,EAAA,MAAAO,GAAa;AACb,IAAAP,EAAA,MAAAQ,GAAe;AAGb,SAAK,UAAUT,GACf,KAAK,KAAKU,EAAOV,CAAO;AAAA,EAC1B;AAAA,EAEA,IAAI,IAAY;AACd,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAOW,EAAA,MAAKJ,MAAW,CAACI,EAAA,MAAKF;AAAA,EAC/B;AAAA;AAAA,EAGA,IAAI,YAAqB;AACvB,WAAOE,EAAA,MAAKN,OAAY,QAAQ,CAACM,EAAA,MAAKH;AAAA,EACxC;AAAA,EAEA,IAAI,cAAuB;AACzB,WAAOG,EAAA,MAAKF,MAAgBE,EAAA,MAAKH;AAAA,EACnC;AAAA,EAEA,IAAI,aAAqB;;AACvB,aAAOI,IAAA,KAAK,YAAL,gBAAAA,EAAc,eAAc;AAAA,EACrC;AAAA,EAEA,SAASC,GAAkC;AACzC,IAAAC,EAAA,MAAKV,GAAaS,EAAQ,YAC1BC,EAAA,MAAKP,GAAU,KACfO,EAAA,MAAKN,GAAa,KAClBM,EAAA,MAAKL,GAAe,KACpBK,EAAA,MAAKR,GAALK,EAAA,MAAKL,KAAa;AAClB,UAAMS,IAASC,EAAA,MAAKd,GAAAe,GAAL,WAAWJ;AAC1B,WAAAC,EAAA,MAAKT,GAAUU,IACRA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAc;;AACZ,IAAIJ,EAAA,MAAKJ,MAAWI,EAAA,MAAKN,OAAY,SACrCS,EAAA,MAAKN,GAAa,MAClBI,IAAAD,EAAA,MAAKP,OAAL,QAAAQ,EAAiB,OAAO;AAAA,EAC1B;AAAA,EAEA,iBAAuB;AACrB,IAAI,KAAK,cACP,KAAK,MAAA,GACLE,EAAA,MAAKT,GAAU,QAEjBS,EAAA,MAAKL,GAAe;AAAA,EACtB;AAmBF;AAhFEL,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eAdKP,IAAA,eAwECe,IAAA,eAAM,EAAE,SAAAC,GAAS,QAAAC,GAAQ,UAAAC,GAAU,WAAAC,KAAsC;AAC7E,QAAMC,IAAWX,EAAA,MAAKL,IAChBiB,IAAU,MAAMF,EAAU,SAAS,MAAMD,CAAQ;AACvD,MAAIE,MAAaX,EAAA,MAAKL,IAEtB;AAAA,QADAQ,EAAA,MAAKT,GAAU,OACXkB,MAAY,QAAQZ,EAAA,MAAKH,IAAY;AACvC,MAAAM,EAAA,MAAKN,GAAa;AAClB;AAAA,IACF;AACA,IAAAM,EAAA,MAAKP,GAAU,KACX,WAAWgB,KACb,KAAK,UAAUA,EAAQ,OACvBJ,EAAO,IAAI,KAEXD,EAAQK,EAAQ,SAAS,IAAI,MAAM,yBAAyB,GAAG,IAAI;AAAA;AAEvE;"}

package/dist/core/tileset.d.ts

@@ -1,59 +0,0 @@
-import { TileAddress, TileMatrixSet } from '@fossil-lang/corpus';
-import { Tile, TileLoader } from './tile';
-import { Viewport } from './tile-matrix';
-export interface TilesetOptions {
-    load: TileLoader;
-    onTileLoad?: (tile: Tile) => void;
-    onTileError?: (error: unknown, tile: Tile) => void;
-    onTileUnload?: (tile: Tile) => void;
-    /** Tiles kept; five times the selected count when absent. */
-    maxCacheSize?: number;
-    /** Bytes kept; unbounded when absent. */
-    maxCacheByteSize?: number;
-    /** Batches in flight — one: see `RequestScheduler`. */
-    maxRequests?: number;
-    debounceTime?: number;
-}
-/**
- * **deck.gl's `Tileset2D` with the loader swapped for the corpus** — `modules/geo-layers/src/
- * tileset-2d/tileset-2d.ts`, its names kept so either can be read from the other.
- *
- * `update(viewport)` selects, then sets tile states, then prunes requests, then resizes the cache,
- * in deck.gl's order. Where it departs is `/docs/design/graph`'s table: a tile is fossil's
- * `{ type, z, tile }`, the level is chosen by published row counts, a tile is in view by its
- * published box, and the tiles wanted in one tick are read as one batch, whose read is aborted once
- * no tile in it is wanted.
- */
-export declare class Tileset2D {
-    #private;
-    constructor(options: TilesetOptions);
-    get tiles(): Tile[];
-    get selectedTiles(): readonly Tile[];
-    /** Moves whenever the selected or visible set, or what a tile holds, may have changed. */
-    get frame(): number;
-    /** The zoom the last selection chose, or `null` before one. */
-    get z(): number | null;
-    get isLoaded(): boolean;
-    get maxCacheSize(): number;
-    get maxCacheByteSize(): number;
-    /** The matrices, from `corpus.tileMatrix(type)`. A new set empties the cache. */
-    setMatrix(matrix: TileMatrixSet): void;
-    /** The tiles `scan.plan()` kept, by zoom — asked once per question, never per camera move. */
-    setPlan(planned: readonly TileAddress[]): void;
-    /**
-     * The question changed: every tile is marked for reload and keeps its content until the new
-     * answer arrives — `TileLayer`'s `reloadAll` when its `data` moves. A cached tile that is not
-     * selected is dropped, since nothing will ask it again under the old question.
-     */
-    reloadAll(): void;
-    /**
-     * Select what the viewport needs and refine; returns a frame number that moves whenever the
-     * visible set may have changed.
-     */
-    update(viewport: Viewport, limit: number): number;
-    /** Re-run refinement after a load, with no change of viewport. */
-    refresh(): number;
-    /** Abort everything and forget the cache. */
-    finalize(): void;
-}
-//# sourceMappingURL=tileset.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"tileset.d.ts","sourceRoot":"","sources":["../../src/core/tileset.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAGtE,OAAO,EAAE,IAAI,EAAoB,KAAK,UAAU,EAAE,MAAM,QAAQ,CAAC;AACjE,OAAO,EAA2C,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAKvF,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,UAAU,CAAC;IACjB,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;IAClC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;IACnD,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;IACpC,6DAA6D;IAC7D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,yCAAyC;IACzC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,uDAAuD;IACvD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;GASG;AACH,qBAAa,SAAS;;gBAcR,OAAO,EAAE,cAAc;IASnC,IAAI,KAAK,IAAI,IAAI,EAAE,CAElB;IAED,IAAI,aAAa,IAAI,SAAS,IAAI,EAAE,CAEnC;IAED,0FAA0F;IAC1F,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,+DAA+D;IAC/D,IAAI,CAAC,IAAI,MAAM,GAAG,IAAI,CAErB;IAED,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,IAAI,YAAY,IAAI,MAAM,CAEzB;IAED,IAAI,gBAAgB,IAAI,MAAM,CAE7B;IAED,iFAAiF;IACjF,SAAS,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI;IAOtC,8FAA8F;IAC9F,OAAO,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,IAAI;IAW9C;;;;OAIG;IACH,SAAS,IAAI,IAAI;IAcjB;;;OAGG;IACH,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IA2BjD,kEAAkE;IAClE,OAAO,IAAI,MAAM;IAIjB,6CAA6C;IAC7C,QAAQ,IAAI,IAAI;CAoGjB"}

package/dist/core/tileset.js

@@ -1,177 +0,0 @@
-var w = (o) => {
-  throw TypeError(o);
-};
-var L = (o, e, i) => e.has(o) || w("Cannot " + i);
-var t = (o, e, i) => (L(o, e, "read from private field"), i ? i.call(o) : e.get(o)), c = (o, e, i) => e.has(o) ? w("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(o) : e.set(o, i), l = (o, e, i, s) => (L(o, e, "write to private field"), s ? s.call(o, i) : e.set(o, i), i), d = (o, e, i) => (L(o, e, "access private method"), i);
-import { refine as $ } from "./refine.js";
-import { RequestScheduler as D } from "./scheduler.js";
-import { Tile as O } from "./tile.js";
-import { selectLevel as U, tileId as E, centreOf as _, parentOf as I } from "./tile-matrix.js";
-const k = 5;
-var f, y, h, z, g, u, m, b, S, x, M, T, a, v, R, q, A, B, N, C;
-class Z {
-  constructor(e) {
-    c(this, a);
-    c(this, f);
-    c(this, y);
-    c(this, h, /* @__PURE__ */ new Map());
-    c(this, z, null);
-    c(this, g, /* @__PURE__ */ new Map());
-    c(this, u, []);
-    c(this, m, null);
-    c(this, b, 0);
-    c(this, S, null);
-    c(this, x, !0);
-    c(this, M, 0);
-    c(this, T, "");
-    l(this, f, e), l(this, y, new D({
-      run: (i, s) => e.load(i.map((r) => r.address), s),
-      debounceTime: e.debounceTime,
-      maxRequests: e.maxRequests ?? 1
-    }));
-  }
-  get tiles() {
-    return [...t(this, h).values()].sort((e, i) => e.z - i.z);
-  }
-  get selectedTiles() {
-    return t(this, u);
-  }
-  /** Moves whenever the selected or visible set, or what a tile holds, may have changed. */
-  get frame() {
-    return t(this, M);
-  }
-  /** The zoom the last selection chose, or `null` before one. */
-  get z() {
-    return t(this, S);
-  }
-  get isLoaded() {
-    return t(this, u).every((e) => e.isLoaded);
-  }
-  get maxCacheSize() {
-    return t(this, f).maxCacheSize ?? k * Math.max(1, t(this, u).length);
-  }
-  get maxCacheByteSize() {
-    return t(this, f).maxCacheByteSize ?? Number.POSITIVE_INFINITY;
-  }
-  /** The matrices, from `corpus.tileMatrix(type)`. A new set empties the cache. */
-  setMatrix(e) {
-    e !== t(this, z) && (l(this, z, e), this.finalize(), l(this, x, !0));
-  }
-  /** The tiles `scan.plan()` kept, by zoom — asked once per question, never per camera move. */
-  setPlan(e) {
-    const i = /* @__PURE__ */ new Map();
-    for (const { tile: s, z: r } of e) {
-      let n = i.get(r);
-      n || i.set(r, n = /* @__PURE__ */ new Set()), n.add(s);
-    }
-    l(this, g, i), l(this, x, !0);
-  }
-  /**
-   * The question changed: every tile is marked for reload and keeps its content until the new
-   * answer arrives — `TileLayer`'s `reloadAll` when its `data` moves. A cached tile that is not
-   * selected is dropped, since nothing will ask it again under the old question.
-   */
-  reloadAll() {
-    var e, i;
-    for (const [s, r] of t(this, h))
-      t(this, u).includes(r) ? r.setNeedsReload() : (r.abort(), t(this, h).delete(s), (i = (e = t(this, f)).onTileUnload) == null || i.call(e, r));
-    d(this, a, C).call(this), l(this, x, !0);
-  }
-  /**
-   * Select what the viewport needs and refine; returns a frame number that moves whenever the
-   * visible set may have changed.
-   */
-  update(e, i) {
-    const s = t(this, z);
-    if (!s) return t(this, M);
-    if (t(this, x) || i !== t(this, b) || !t(this, m) || e.xMin !== t(this, m).xMin || e.yMin !== t(this, m).yMin || e.xMax !== t(this, m).xMax || e.yMax !== t(this, m).yMax) {
-      l(this, x, !1), l(this, m, e), l(this, b, i);
-      const n = U(s, e, i, t(this, g));
-      l(this, S, (n == null ? void 0 : n.z) ?? null);
-      const V = n ? n.tiles.map((p) => ({ type: s.type, z: n.z, tile: p })) : [];
-      for (const p of t(this, u)) p.isSelected = !1;
-      l(this, u, V.map((p) => d(this, a, R).call(this, p)));
-      for (const p of t(this, u)) p.isSelected = !0;
-      d(this, a, C).call(this), d(this, a, q).call(this);
-    }
-    return d(this, a, v).call(this);
-  }
-  /** Re-run refinement after a load, with no change of viewport. */
-  refresh() {
-    return d(this, a, v).call(this);
-  }
-  /** Abort everything and forget the cache. */
-  finalize() {
-    for (const e of t(this, h).values()) e.abort();
-    t(this, y).clear(), t(this, h).clear(), l(this, u, []), l(this, S, null), l(this, x, !0);
-  }
-}
-f = new WeakMap(), y = new WeakMap(), h = new WeakMap(), z = new WeakMap(), g = new WeakMap(), u = new WeakMap(), m = new WeakMap(), b = new WeakMap(), S = new WeakMap(), x = new WeakMap(), M = new WeakMap(), T = new WeakMap(), a = new WeakSet(), v = function() {
-  $(t(this, h).values()), d(this, a, B).call(this), d(this, a, N).call(this);
-  const e = (s) => `${s.id}${s.isVisible ? "+" : ""}${s.isSelected ? "*" : ""}:${s.content ? 1 : 0}`, i = [...t(this, h).values()].map(e).join(",");
-  return i !== t(this, T) && (l(this, T, i), l(this, M, t(this, M) + 1)), t(this, M);
-}, R = function(e) {
-  const i = E(e);
-  let s = t(this, h).get(i);
-  return s || (s = new O(e), t(this, h).set(i, s)), s;
-}, q = function() {
-  for (const e of t(this, u))
-    e.isLoaded || e.isLoading || e.loadData({
-      scheduler: t(this, y),
-      priority: (i) => d(this, a, A).call(this, i),
-      onLoad: (i) => {
-        var s, r;
-        return (r = (s = t(this, f)).onTileLoad) == null ? void 0 : r.call(s, i);
-      },
-      onError: (i, s) => {
-        var r, n;
-        return (n = (r = t(this, f)).onTileError) == null ? void 0 : n.call(r, i, s);
-      }
-    });
-}, /** `_getRequestPriority`: `-1` drops a tile nobody wants; the rest go nearest the centre first. */
-A = function(e) {
-  if (!e.isSelected && !e.isVisible) return -1;
-  const i = t(this, z), s = t(this, m);
-  if (!i || !s) return 0;
-  const r = _(i, e.address);
-  return r ? Math.hypot(r[0] - (s.xMin + s.xMax) / 2, r[1] - (s.yMin + s.yMax) / 2) : 0;
-}, /**
- * Always, where deck.gl waits for `maxRequests` to be exceeded: the one slot is the only one. A
- * batch is the unit aborted, so a tile nobody wants rides out a batch somebody else still does.
- */
-B = function() {
-  t(this, y).prune();
-}, /** Evicts tiles neither visible nor selected, in insertion order — deck.gl's, and not LRU. */
-N = function() {
-  var i, s;
-  let e = 0;
-  for (const r of t(this, h).values()) e += r.byteLength;
-  if (!(t(this, h).size <= this.maxCacheSize && e <= this.maxCacheByteSize)) {
-    for (const [r, n] of t(this, h)) {
-      if (t(this, h).size <= this.maxCacheSize && e <= this.maxCacheByteSize) break;
-      n.isVisible || n.isSelected || (e -= n.byteLength, n.abort(), t(this, h).delete(r), (s = (i = t(this, f)).onTileUnload) == null || s.call(i, n));
-    }
-    d(this, a, C).call(this);
-  }
-}, /** Each tile's parent is its nearest ancestor in the cache — `_rebuildTree`. */
-C = function() {
-  const e = t(this, z);
-  for (const i of t(this, h).values())
-    i.parent = null, i.children = [];
-  if (e)
-    for (const i of t(this, h).values()) {
-      let s = I(e, i.address);
-      for (; s; ) {
-        const r = t(this, h).get(E(s));
-        if (r) {
-          i.parent = r, r.children.push(i);
-          break;
-        }
-        s = I(e, s);
-      }
-    }
-};
-export {
-  Z as Tileset2D
-};
-//# sourceMappingURL=tileset.js.map

package/dist/core/tileset.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tileset.js","sources":["../../src/core/tileset.ts"],"sourcesContent":["import type { TileAddress, TileMatrixSet } from \"@fossil-lang/corpus\";\nimport { refine } from \"./refine\";\nimport { RequestScheduler } from \"./scheduler\";\nimport { Tile, type TileContent, type TileLoader } from \"./tile\";\nimport { centreOf, parentOf, selectLevel, tileId, type Viewport } from \"./tile-matrix\";\n\n/** deck.gl's `DEFAULT_CACHE_SCALE`: the cache holds five times what is selected. */\nconst DEFAULT_CACHE_SCALE = 5;\n\nexport interface TilesetOptions {\n  load: TileLoader;\n  onTileLoad?: (tile: Tile) => void;\n  onTileError?: (error: unknown, tile: Tile) => void;\n  onTileUnload?: (tile: Tile) => void;\n  /** Tiles kept; five times the selected count when absent. */\n  maxCacheSize?: number;\n  /** Bytes kept; unbounded when absent. */\n  maxCacheByteSize?: number;\n  /** Batches in flight — one: see `RequestScheduler`. */\n  maxRequests?: number;\n  debounceTime?: number;\n}\n\n/**\n * **deck.gl's `Tileset2D` with the loader swapped for the corpus** — `modules/geo-layers/src/\n * tileset-2d/tileset-2d.ts`, its names kept so either can be read from the other.\n *\n * `update(viewport)` selects, then sets tile states, then prunes requests, then resizes the cache,\n * in deck.gl's order. Where it departs is `/docs/design/graph`'s table: a tile is fossil's\n * `{ type, z, tile }`, the level is chosen by published row counts, a tile is in view by its\n * published box, and the tiles wanted in one tick are read as one batch, whose read is aborted once\n * no tile in it is wanted.\n */\nexport class Tileset2D {\n  readonly #options: TilesetOptions;\n  readonly #scheduler: RequestScheduler<Tile, TileContent>;\n  readonly #cache = new Map<string, Tile>();\n  #matrix: TileMatrixSet | null = null;\n  #planned: ReadonlyMap<number, ReadonlySet<number>> = new Map();\n  #selected: Tile[] = [];\n  #viewport: Viewport | null = null;\n  #limit = 0;\n  #z: number | null = null;\n  #stale = true;\n  #frame = 0;\n  #signature = \"\";\n\n  constructor(options: TilesetOptions) {\n    this.#options = options;\n    this.#scheduler = new RequestScheduler({\n      run: (tiles, signal) => options.load(tiles.map((tile) => tile.address), signal),\n      debounceTime: options.debounceTime,\n      maxRequests: options.maxRequests ?? 1,\n    });\n  }\n\n  get tiles(): Tile[] {\n    return [...this.#cache.values()].sort((a, b) => a.z - b.z);\n  }\n\n  get selectedTiles(): readonly Tile[] {\n    return this.#selected;\n  }\n\n  /** Moves whenever the selected or visible set, or what a tile holds, may have changed. */\n  get frame(): number {\n    return this.#frame;\n  }\n\n  /** The zoom the last selection chose, or `null` before one. */\n  get z(): number | null {\n    return this.#z;\n  }\n\n  get isLoaded(): boolean {\n    return this.#selected.every((tile) => tile.isLoaded);\n  }\n\n  get maxCacheSize(): number {\n    return this.#options.maxCacheSize ?? DEFAULT_CACHE_SCALE * Math.max(1, this.#selected.length);\n  }\n\n  get maxCacheByteSize(): number {\n    return this.#options.maxCacheByteSize ?? Number.POSITIVE_INFINITY;\n  }\n\n  /** The matrices, from `corpus.tileMatrix(type)`. A new set empties the cache. */\n  setMatrix(matrix: TileMatrixSet): void {\n    if (matrix === this.#matrix) return;\n    this.#matrix = matrix;\n    this.finalize();\n    this.#stale = true;\n  }\n\n  /** The tiles `scan.plan()` kept, by zoom — asked once per question, never per camera move. */\n  setPlan(planned: readonly TileAddress[]): void {\n    const byZoom = new Map<number, Set<number>>();\n    for (const { tile, z } of planned) {\n      let tiles = byZoom.get(z);\n      if (!tiles) byZoom.set(z, (tiles = new Set()));\n      tiles.add(tile);\n    }\n    this.#planned = byZoom;\n    this.#stale = true;\n  }\n\n  /**\n   * The question changed: every tile is marked for reload and keeps its content until the new\n   * answer arrives — `TileLayer`'s `reloadAll` when its `data` moves. A cached tile that is not\n   * selected is dropped, since nothing will ask it again under the old question.\n   */\n  reloadAll(): void {\n    for (const [id, tile] of this.#cache) {\n      if (!this.#selected.includes(tile)) {\n        tile.abort();\n        this.#cache.delete(id);\n        this.#options.onTileUnload?.(tile);\n      } else {\n        tile.setNeedsReload();\n      }\n    }\n    this.#rebuildTree();\n    this.#stale = true;\n  }\n\n  /**\n   * Select what the viewport needs and refine; returns a frame number that moves whenever the\n   * visible set may have changed.\n   */\n  update(viewport: Viewport, limit: number): number {\n    const matrix = this.#matrix;\n    if (!matrix) return this.#frame;\n    const moved =\n      this.#stale ||\n      limit !== this.#limit ||\n      !this.#viewport ||\n      viewport.xMin !== this.#viewport.xMin ||\n      viewport.yMin !== this.#viewport.yMin ||\n      viewport.xMax !== this.#viewport.xMax ||\n      viewport.yMax !== this.#viewport.yMax;\n    if (moved) {\n      this.#stale = false;\n      this.#viewport = viewport;\n      this.#limit = limit;\n      const level = selectLevel(matrix, viewport, limit, this.#planned);\n      this.#z = level?.z ?? null;\n      const wanted = level ? level.tiles.map((tile) => ({ type: matrix.type, z: level.z, tile })) : [];\n      for (const tile of this.#selected) tile.isSelected = false;\n      this.#selected = wanted.map((address) => this.#getTile(address));\n      for (const tile of this.#selected) tile.isSelected = true;\n      this.#rebuildTree();\n      this.#loadSelected();\n    }\n    return this.#refresh();\n  }\n\n  /** Re-run refinement after a load, with no change of viewport. */\n  refresh(): number {\n    return this.#refresh();\n  }\n\n  /** Abort everything and forget the cache. */\n  finalize(): void {\n    for (const tile of this.#cache.values()) tile.abort();\n    this.#scheduler.clear();\n    this.#cache.clear();\n    this.#selected = [];\n    this.#z = null;\n    this.#stale = true;\n  }\n\n  #refresh(): number {\n    refine(this.#cache.values());\n    this.#pruneRequests();\n    this.#resizeCache();\n    const shown = (tile: Tile) => `${tile.id}${tile.isVisible ? \"+\" : \"\"}${tile.isSelected ? \"*\" : \"\"}:${tile.content ? 1 : 0}`;\n    const signature = [...this.#cache.values()].map(shown).join(\",\");\n    if (signature !== this.#signature) {\n      this.#signature = signature;\n      this.#frame += 1;\n    }\n    return this.#frame;\n  }\n\n  #getTile(address: TileAddress): Tile {\n    const id = tileId(address);\n    let tile = this.#cache.get(id);\n    if (!tile) {\n      tile = new Tile(address);\n      this.#cache.set(id, tile);\n    }\n    return tile;\n  }\n\n  #loadSelected(): void {\n    for (const tile of this.#selected) {\n      if (tile.isLoaded || tile.isLoading) continue;\n      void tile.loadData({\n        scheduler: this.#scheduler,\n        priority: (t) => this.#priority(t),\n        onLoad: (t) => this.#options.onTileLoad?.(t),\n        onError: (error, t) => this.#options.onTileError?.(error, t),\n      });\n    }\n  }\n\n  /** `_getRequestPriority`: `-1` drops a tile nobody wants; the rest go nearest the centre first. */\n  #priority(tile: Tile): number {\n    if (!tile.isSelected && !tile.isVisible) return -1;\n    const matrix = this.#matrix;\n    const view = this.#viewport;\n    if (!matrix || !view) return 0;\n    const centre = centreOf(matrix, tile.address);\n    if (!centre) return 0;\n    return Math.hypot(centre[0] - (view.xMin + view.xMax) / 2, centre[1] - (view.yMin + view.yMax) / 2);\n  }\n\n  /**\n   * Always, where deck.gl waits for `maxRequests` to be exceeded: the one slot is the only one. A\n   * batch is the unit aborted, so a tile nobody wants rides out a batch somebody else still does.\n   */\n  #pruneRequests(): void {\n    this.#scheduler.prune();\n  }\n\n  /** Evicts tiles neither visible nor selected, in insertion order — deck.gl's, and not LRU. */\n  #resizeCache(): void {\n    let bytes = 0;\n    for (const tile of this.#cache.values()) bytes += tile.byteLength;\n    if (this.#cache.size <= this.maxCacheSize && bytes <= this.maxCacheByteSize) return;\n    for (const [id, tile] of this.#cache) {\n      if (this.#cache.size <= this.maxCacheSize && bytes <= this.maxCacheByteSize) break;\n      if (tile.isVisible || tile.isSelected) continue;\n      bytes -= tile.byteLength;\n      tile.abort();\n      this.#cache.delete(id);\n      this.#options.onTileUnload?.(tile);\n    }\n    this.#rebuildTree();\n  }\n\n  /** Each tile's parent is its nearest ancestor in the cache — `_rebuildTree`. */\n  #rebuildTree(): void {\n    const matrix = this.#matrix;\n    for (const tile of this.#cache.values()) {\n      tile.parent = null;\n      tile.children = [];\n    }\n    if (!matrix) return;\n    for (const tile of this.#cache.values()) {\n      let up = parentOf(matrix, tile.address);\n      while (up) {\n        const found = this.#cache.get(tileId(up));\n        if (found) {\n          tile.parent = found;\n          found.children.push(tile);\n          break;\n        }\n        up = parentOf(matrix, up);\n      }\n    }\n  }\n}\n"],"names":["DEFAULT_CACHE_SCALE","Tileset2D","options","__privateAdd","_Tileset2D_instances","_options","_scheduler","_cache","_matrix","_planned","_selected","_viewport","_limit","_z","_stale","_frame","_signature","__privateSet","RequestScheduler","tiles","signal","tile","__privateGet","a","b","matrix","planned","byZoom","z","id","_b","_a","__privateMethod","rebuildTree_fn","viewport","limit","level","selectLevel","wanted","address","getTile_fn","loadSelected_fn","refresh_fn","refine","pruneRequests_fn","resizeCache_fn","shown","signature","tileId","Tile","t","priority_fn","error","view","centre","centreOf","bytes","up","parentOf","found"],"mappings":";;;;;;;;;AAOA,MAAMA,IAAsB;;AA0BrB,MAAMC,EAAU;AAAA,EAcrB,YAAYC,GAAyB;AAdhC,IAAAC,EAAA,MAAAC;AACI,IAAAD,EAAA,MAAAE;AACA,IAAAF,EAAA,MAAAG;AACA,IAAAH,EAAA,MAAAI,uBAAa,IAAA;AACtB,IAAAJ,EAAA,MAAAK,GAAgC;AAChC,IAAAL,EAAA,MAAAM,uBAAyD,IAAA;AACzD,IAAAN,EAAA,MAAAO,GAAoB,CAAA;AACpB,IAAAP,EAAA,MAAAQ,GAA6B;AAC7B,IAAAR,EAAA,MAAAS,GAAS;AACT,IAAAT,EAAA,MAAAU,GAAoB;AACpB,IAAAV,EAAA,MAAAW,GAAS;AACT,IAAAX,EAAA,MAAAY,GAAS;AACT,IAAAZ,EAAA,MAAAa,GAAa;AAGX,IAAAC,EAAA,MAAKZ,GAAWH,IAChBe,EAAA,MAAKX,GAAa,IAAIY,EAAiB;AAAA,MACrC,KAAK,CAACC,GAAOC,MAAWlB,EAAQ,KAAKiB,EAAM,IAAI,CAACE,MAASA,EAAK,OAAO,GAAGD,CAAM;AAAA,MAC9E,cAAclB,EAAQ;AAAA,MACtB,aAAaA,EAAQ,eAAe;AAAA,IAAA,CACrC;AAAA,EACH;AAAA,EAEA,IAAI,QAAgB;AAClB,WAAO,CAAC,GAAGoB,EAAA,MAAKf,GAAO,QAAQ,EAAE,KAAK,CAACgB,GAAGC,MAAMD,EAAE,IAAIC,EAAE,CAAC;AAAA,EAC3D;AAAA,EAEA,IAAI,gBAAiC;AACnC,WAAOF,EAAA,MAAKZ;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAgB;AAClB,WAAOY,EAAA,MAAKP;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,IAAmB;AACrB,WAAOO,EAAA,MAAKT;AAAA,EACd;AAAA,EAEA,IAAI,WAAoB;AACtB,WAAOS,EAAA,MAAKZ,GAAU,MAAM,CAACW,MAASA,EAAK,QAAQ;AAAA,EACrD;AAAA,EAEA,IAAI,eAAuB;AACzB,WAAOC,EAAA,MAAKjB,GAAS,gBAAgBL,IAAsB,KAAK,IAAI,GAAGsB,EAAA,MAAKZ,GAAU,MAAM;AAAA,EAC9F;AAAA,EAEA,IAAI,mBAA2B;AAC7B,WAAOY,EAAA,MAAKjB,GAAS,oBAAoB,OAAO;AAAA,EAClD;AAAA;AAAA,EAGA,UAAUoB,GAA6B;AACrC,IAAIA,MAAWH,EAAA,MAAKd,OACpBS,EAAA,MAAKT,GAAUiB,IACf,KAAK,SAAA,GACLR,EAAA,MAAKH,GAAS;AAAA,EAChB;AAAA;AAAA,EAGA,QAAQY,GAAuC;AAC7C,UAAMC,wBAAa,IAAA;AACnB,eAAW,EAAE,MAAAN,GAAM,GAAAO,EAAA,KAAOF,GAAS;AACjC,UAAIP,IAAQQ,EAAO,IAAIC,CAAC;AACxB,MAAKT,KAAOQ,EAAO,IAAIC,GAAIT,IAAQ,oBAAI,KAAM,GAC7CA,EAAM,IAAIE,CAAI;AAAA,IAChB;AACA,IAAAJ,EAAA,MAAKR,GAAWkB,IAChBV,EAAA,MAAKH,GAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAkB;;AAChB,eAAW,CAACe,GAAIR,CAAI,KAAKC,EAAA,MAAKf;AAC5B,MAAKe,EAAA,MAAKZ,GAAU,SAASW,CAAI,IAK/BA,EAAK,eAAA,KAJLA,EAAK,MAAA,GACLC,EAAA,MAAKf,GAAO,OAAOsB,CAAE,IACrBC,KAAAC,IAAAT,EAAA,MAAKjB,IAAS,iBAAd,QAAAyB,EAAA,KAAAC,GAA6BV;AAKjC,IAAAW,EAAA,MAAK5B,GAAA6B,GAAL,YACAhB,EAAA,MAAKH,GAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAOoB,GAAoBC,GAAuB;AAChD,UAAMV,IAASH,EAAA,MAAKd;AACpB,QAAI,CAACiB,EAAQ,QAAOH,EAAA,MAAKP;AASzB,QAPEO,EAAA,MAAKR,MACLqB,MAAUb,EAAA,MAAKV,MACf,CAACU,EAAA,MAAKX,MACNuB,EAAS,SAASZ,EAAA,MAAKX,GAAU,QACjCuB,EAAS,SAASZ,EAAA,MAAKX,GAAU,QACjCuB,EAAS,SAASZ,EAAA,MAAKX,GAAU,QACjCuB,EAAS,SAASZ,EAAA,MAAKX,GAAU,MACxB;AACT,MAAAM,EAAA,MAAKH,GAAS,KACdG,EAAA,MAAKN,GAAYuB,IACjBjB,EAAA,MAAKL,GAASuB;AACd,YAAMC,IAAQC,EAAYZ,GAAQS,GAAUC,GAAOb,EAAA,MAAKb,EAAQ;AAChE,MAAAQ,EAAA,MAAKJ,IAAKuB,KAAA,gBAAAA,EAAO,MAAK;AACtB,YAAME,IAASF,IAAQA,EAAM,MAAM,IAAI,CAACf,OAAU,EAAE,MAAMI,EAAO,MAAM,GAAGW,EAAM,GAAG,MAAAf,EAAA,EAAO,IAAI,CAAA;AAC9F,iBAAWA,KAAQC,EAAA,MAAKZ,GAAW,CAAAW,EAAK,aAAa;AACrD,MAAAJ,EAAA,MAAKP,GAAY4B,EAAO,IAAI,CAACC,MAAYP,EAAA,MAAK5B,GAAAoC,GAAL,WAAcD,EAAQ;AAC/D,iBAAWlB,KAAQC,EAAA,MAAKZ,GAAW,CAAAW,EAAK,aAAa;AACrD,MAAAW,EAAA,MAAK5B,GAAA6B,GAAL,YACAD,EAAA,MAAK5B,GAAAqC,GAAL;AAAA,IACF;AACA,WAAOT,EAAA,MAAK5B,GAAAsC,GAAL;AAAA,EACT;AAAA;AAAA,EAGA,UAAkB;AAChB,WAAOV,EAAA,MAAK5B,GAAAsC,GAAL;AAAA,EACT;AAAA;AAAA,EAGA,WAAiB;AACf,eAAWrB,KAAQC,EAAA,MAAKf,GAAO,OAAA,KAAe,MAAA;AAC9C,IAAAe,EAAA,MAAKhB,GAAW,MAAA,GAChBgB,EAAA,MAAKf,GAAO,MAAA,GACZU,EAAA,MAAKP,GAAY,CAAA,IACjBO,EAAA,MAAKJ,GAAK,OACVI,EAAA,MAAKH,GAAS;AAAA,EAChB;AA6FF;AApOWT,IAAA,eACAC,IAAA,eACAC,IAAA,eACTC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eACAC,IAAA,eAZKZ,IAAA,eA0ILsC,IAAA,WAAmB;AACjB,EAAAC,EAAOrB,EAAA,MAAKf,GAAO,QAAQ,GAC3ByB,EAAA,MAAK5B,GAAAwC,GAAL,YACAZ,EAAA,MAAK5B,GAAAyC,GAAL;AACA,QAAMC,IAAQ,CAACzB,MAAe,GAAGA,EAAK,EAAE,GAAGA,EAAK,YAAY,MAAM,EAAE,GAAGA,EAAK,aAAa,MAAM,EAAE,IAAIA,EAAK,UAAU,IAAI,CAAC,IACnH0B,IAAY,CAAC,GAAGzB,EAAA,MAAKf,GAAO,QAAQ,EAAE,IAAIuC,CAAK,EAAE,KAAK,GAAG;AAC/D,SAAIC,MAAczB,EAAA,MAAKN,OACrBC,EAAA,MAAKD,GAAa+B,IAClB9B,EAAA,MAAKF,GAALO,EAAA,MAAKP,KAAU,KAEVO,EAAA,MAAKP;AACd,GAEAyB,aAASD,GAA4B;AACnC,QAAMV,IAAKmB,EAAOT,CAAO;AACzB,MAAIlB,IAAOC,EAAA,MAAKf,GAAO,IAAIsB,CAAE;AAC7B,SAAKR,MACHA,IAAO,IAAI4B,EAAKV,CAAO,GACvBjB,EAAA,MAAKf,GAAO,IAAIsB,GAAIR,CAAI,IAEnBA;AACT,GAEAoB,IAAA,WAAsB;AACpB,aAAWpB,KAAQC,EAAA,MAAKZ;AACtB,IAAIW,EAAK,YAAYA,EAAK,aACrBA,EAAK,SAAS;AAAA,MACjB,WAAWC,EAAA,MAAKhB;AAAA,MAChB,UAAU,CAAC4C,MAAMlB,EAAA,MAAK5B,GAAA+C,GAAL,WAAeD;AAAA,MAChC,QAAQ,CAACA,MAAA;;AAAM,gBAAApB,KAAAC,IAAAT,EAAA,MAAKjB,IAAS,eAAd,gBAAAyB,EAAA,KAAAC,GAA2BmB;AAAA;AAAA,MAC1C,SAAS,CAACE,GAAOF,MAAA;;AAAM,gBAAApB,KAAAC,IAAAT,EAAA,MAAKjB,IAAS,gBAAd,gBAAAyB,EAAA,KAAAC,GAA4BqB,GAAOF;AAAA;AAAA,IAAC,CAC5D;AAEL;AAGAC,aAAU9B,GAAoB;AAC5B,MAAI,CAACA,EAAK,cAAc,CAACA,EAAK,UAAW,QAAO;AAChD,QAAMI,IAASH,EAAA,MAAKd,IACd6C,IAAO/B,EAAA,MAAKX;AAClB,MAAI,CAACc,KAAU,CAAC4B,EAAM,QAAO;AAC7B,QAAMC,IAASC,EAAS9B,GAAQJ,EAAK,OAAO;AAC5C,SAAKiC,IACE,KAAK,MAAMA,EAAO,CAAC,KAAKD,EAAK,OAAOA,EAAK,QAAQ,GAAGC,EAAO,CAAC,KAAKD,EAAK,OAAOA,EAAK,QAAQ,CAAC,IAD9E;AAEtB;AAAA;AAAA;AAAA;AAMAT,IAAA,WAAuB;AACrB,EAAAtB,EAAA,MAAKhB,GAAW,MAAA;AAClB;AAGAuC,IAAA,WAAqB;;AACnB,MAAIW,IAAQ;AACZ,aAAWnC,KAAQC,EAAA,MAAKf,GAAO,eAAmBc,EAAK;AACvD,MAAI,EAAAC,EAAA,MAAKf,GAAO,QAAQ,KAAK,gBAAgBiD,KAAS,KAAK,mBAC3D;AAAA,eAAW,CAAC3B,GAAIR,CAAI,KAAKC,EAAA,MAAKf,IAAQ;AACpC,UAAIe,EAAA,MAAKf,GAAO,QAAQ,KAAK,gBAAgBiD,KAAS,KAAK,iBAAkB;AAC7E,MAAInC,EAAK,aAAaA,EAAK,eAC3BmC,KAASnC,EAAK,YACdA,EAAK,MAAA,GACLC,EAAA,MAAKf,GAAO,OAAOsB,CAAE,IACrBC,KAAAC,IAAAT,EAAA,MAAKjB,IAAS,iBAAd,QAAAyB,EAAA,KAAAC,GAA6BV;AAAA,IAC/B;AACA,IAAAW,EAAA,MAAK5B,GAAA6B,GAAL;AAAA;AACF;AAGAA,IAAA,WAAqB;AACnB,QAAMR,IAASH,EAAA,MAAKd;AACpB,aAAWa,KAAQC,EAAA,MAAKf,GAAO,OAAA;AAC7B,IAAAc,EAAK,SAAS,MACdA,EAAK,WAAW,CAAA;AAElB,MAAKI;AACL,eAAWJ,KAAQC,EAAA,MAAKf,GAAO,OAAA,GAAU;AACvC,UAAIkD,IAAKC,EAASjC,GAAQJ,EAAK,OAAO;AACtC,aAAOoC,KAAI;AACT,cAAME,IAAQrC,EAAA,MAAKf,GAAO,IAAIyC,EAAOS,CAAE,CAAC;AACxC,YAAIE,GAAO;AACT,UAAAtC,EAAK,SAASsC,GACdA,EAAM,SAAS,KAAKtC,CAAI;AACxB;AAAA,QACF;AACA,QAAAoC,IAAKC,EAASjC,GAAQgC,CAAE;AAAA,MAC1B;AAAA,IACF;AACF;"}

package/dist/render/adaptive.d.ts

@@ -1,27 +0,0 @@
-import { Sim } from './graph-sim';
-/**
- * The coefficients and the drawing options a graph this size wants.
- *
- * Returned together because they are one judgement asked of one number, and splitting them into two
- * exports that must be called with the same argument is how they drift apart. The caller still keeps
- * them apart downstream — a `Sim` rebuilds nothing and `links` is a uniform — which is the split
- * that actually costs something.
- *
- * **The mark scale left with `Display`.** This used to answer a `pointScale` too, interpolated from
- * 1.5 to 0.5 with the corpus, and nothing ever called it: the field it fed was a reader's multiplier
- * over the radius ramp `lookFrom` computes from `marks`, and two ways to size a mark is one too
- * many. What a host with a large corpus wants is the tenant policy — *start your users here* — over
- * the declared axes, which is where a computed fit belongs.
- *
- * **`spaceSize` is deliberately not here.** The original scaled the simulation box from 2,048 to
- * 8,192 with the corpus, which is coherent when a layout is computed on the fly and incoherent once
- * positions are authority: the box is the coordinate space a source's positions are expressed in and
- * a spatial query is asked against, so resizing it by node count would move the index under the
- * camera. It is not a constant of ours either, for the same reason turned around — it is the
- * tile matrix's extent, and the renderer sets it from there.
- */
-export declare function adaptive(nodes: number): {
-    sim: Sim;
-    links: boolean;
-};
-//# sourceMappingURL=adaptive.d.ts.map

package/dist/render/adaptive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"adaptive.d.ts","sourceRoot":"","sources":["../../src/render/adaptive.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAgCvC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;IAAE,GAAG,EAAE,GAAG,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAgBpE"}

package/dist/render/adaptive.js

@@ -1,25 +0,0 @@
-const r = (t, n, a) => Math.min(a, Math.max(n, t)), i = (t, n, a) => t + (n - t) * r(a, 0, 1);
-function c(t) {
-  return r((Math.log10(Math.max(t, 1)) - 1) / 4, 0, 1);
-}
-function e(t) {
-  const n = c(t);
-  return {
-    sim: {
-      // Bigger graphs need less push and more damping, or they never settle.
-      repulsion: i(1.2, 0.4, n),
-      friction: i(0.7, 0.92, n),
-      linkSpring: i(0.5, 0.25, n),
-      linkDistance: i(30, 12, n),
-      gravity: i(0.35, 0.08, n),
-      cluster: 0.15
-    },
-    // Past a quarter of a million links the edge layer is fog, and fog costs a draw call per frame
-    // to render. Below it, links are most of what a reader is actually looking at.
-    links: t < 25e4
-  };
-}
-export {
-  e as adaptive
-};
-//# sourceMappingURL=adaptive.js.map

package/dist/render/adaptive.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"adaptive.js","sources":["../../src/render/adaptive.ts"],"sourcesContent":["import type { Sim } from \"./graph-sim\";\n\n/**\n * How a graph of *this size* should be drawn — force coefficients and two render\n * switches, interpolated continuously against node count.\n *\n * Absorbed from `@fossil-lang/viewer`'s `getAdaptiveConfig` when fossil stopped shipping a viewer, which filed it under\n * \"level-of-detail policy\". Reading it, that is not quite what it is, and the difference matters:\n * almost all of it is **simulation tuning** — repulsion, friction, spring, gravity — plus two\n * genuinely render-side switches. Level of detail in the bounded sense is the zoom of fossil's cell\n * pyramid the tileset draws at, and is a different mechanism entirely.\n *\n * That means most of this only applies under `simulate: true`, which ADR-0001 made the opt-in case.\n * It is still worth having: the host with arrays in hand and no precomputed layout is exactly the\n * host that runs a live simulation, and one set of production-tuned numbers beats each call site\n * inventing its own.\n *\n * **The continuous interpolation is the design**, not an implementation detail. Breakpoints snap —\n * a graph crossing 10,000 nodes would visibly jump — and Cosmograph 1.x is the cautionary example.\n * The constants are tuned across 10 to 100,000 nodes and divergence from them is a defect.\n */\n\nconst clamp = (value: number, lo: number, hi: number): number =>\n  Math.min(hi, Math.max(lo, value));\n\nconst lerp = (a: number, b: number, t: number): number => a + (b - a) * clamp(t, 0, 1);\n\n/** `0` at about ten nodes, `1` at about a hundred thousand — log₁₀, because node counts are. */\nfunction scaleOfCount(nodes: number): number {\n  return clamp((Math.log10(Math.max(nodes, 1)) - 1) / 4, 0, 1);\n}\n\n/**\n * The coefficients and the drawing options a graph this size wants.\n *\n * Returned together because they are one judgement asked of one number, and splitting them into two\n * exports that must be called with the same argument is how they drift apart. The caller still keeps\n * them apart downstream — a `Sim` rebuilds nothing and `links` is a uniform — which is the split\n * that actually costs something.\n *\n * **The mark scale left with `Display`.** This used to answer a `pointScale` too, interpolated from\n * 1.5 to 0.5 with the corpus, and nothing ever called it: the field it fed was a reader's multiplier\n * over the radius ramp `lookFrom` computes from `marks`, and two ways to size a mark is one too\n * many. What a host with a large corpus wants is the tenant policy — *start your users here* — over\n * the declared axes, which is where a computed fit belongs.\n *\n * **`spaceSize` is deliberately not here.** The original scaled the simulation box from 2,048 to\n * 8,192 with the corpus, which is coherent when a layout is computed on the fly and incoherent once\n * positions are authority: the box is the coordinate space a source's positions are expressed in and\n * a spatial query is asked against, so resizing it by node count would move the index under the\n * camera. It is not a constant of ours either, for the same reason turned around — it is the\n * tile matrix's extent, and the renderer sets it from there.\n */\nexport function adaptive(nodes: number): { sim: Sim; links: boolean } {\n  const t = scaleOfCount(nodes);\n  return {\n    sim: {\n      // Bigger graphs need less push and more damping, or they never settle.\n      repulsion: lerp(1.2, 0.4, t),\n      friction: lerp(0.7, 0.92, t),\n      linkSpring: lerp(0.5, 0.25, t),\n      linkDistance: lerp(30, 12, t),\n      gravity: lerp(0.35, 0.08, t),\n      cluster: 0.15,\n    },\n    // Past a quarter of a million links the edge layer is fog, and fog costs a draw call per frame\n    // to render. Below it, links are most of what a reader is actually looking at.\n    links: nodes < 250_000,\n  };\n}\n"],"names":["clamp","value","lo","hi","lerp","a","b","t","scaleOfCount","nodes","adaptive"],"mappings":"AAsBA,MAAMA,IAAQ,CAACC,GAAeC,GAAYC,MACxC,KAAK,IAAIA,GAAI,KAAK,IAAID,GAAID,CAAK,CAAC,GAE5BG,IAAO,CAACC,GAAWC,GAAWC,MAAsBF,KAAKC,IAAID,KAAKL,EAAMO,GAAG,GAAG,CAAC;AAGrF,SAASC,EAAaC,GAAuB;AAC3C,SAAOT,GAAO,KAAK,MAAM,KAAK,IAAIS,GAAO,CAAC,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC;AAC7D;AAuBO,SAASC,EAASD,GAA6C;AACpE,QAAMF,IAAIC,EAAaC,CAAK;AAC5B,SAAO;AAAA,IACL,KAAK;AAAA;AAAA,MAEH,WAAWL,EAAK,KAAK,KAAKG,CAAC;AAAA,MAC3B,UAAUH,EAAK,KAAK,MAAMG,CAAC;AAAA,MAC3B,YAAYH,EAAK,KAAK,MAAMG,CAAC;AAAA,MAC7B,cAAcH,EAAK,IAAI,IAAIG,CAAC;AAAA,MAC5B,SAASH,EAAK,MAAM,MAAMG,CAAC;AAAA,MAC3B,SAAS;AAAA,IAAA;AAAA;AAAA;AAAA,IAIX,OAAOE,IAAQ;AAAA,EAAA;AAEnB;"}

package/dist/render/compose.d.ts

@@ -1,51 +0,0 @@
-import { TileMatrixSet } from '@fossil-lang/corpus';
-import { Binding } from '../core/channels';
-import { Resident } from '../core/resident';
-import { TileView } from '../core/store';
-/** An edge shorter than this many screen pixels is a dot on its own ends, and is not composed. */
-export declare const MIN_LINK_PIXELS = 3;
-/** One buffer set for one cosmos.gl instance. */
-export interface Composition {
-    /** `[x, y, …]`: vertices first, then cells, then far ends drawn only so an edge has one. */
-    readonly positions: Float32Array;
-    /** `[src, dst, …]` as indices into `positions`. */
-    readonly links: Float32Array;
-    /** How many edges each link stands for; `null` when every link is one edge. */
-    readonly weights: Float32Array | null;
-    /** Slots that are drawn — vertices and cells. Past it, far ends. */
-    readonly marks: number;
-    /** How many of the marks are vertices; cells follow them. */
-    readonly vertices: number;
-    readonly resident: Resident;
-    /** Per slot: the category's rank, or `0` when nothing is bound. */
-    readonly categories: Uint32Array;
-    /** Per slot: the ramp's raw value, or `null` when nothing is bound. */
-    readonly sizes: Float32Array | null;
-    /** Per vertex slot: its title, when `title` is bound. */
-    readonly titles: readonly string[] | null;
-    /** What each rank is, for a legend: the seed, then the other values seen, in rank order. */
-    readonly domain: readonly unknown[];
-    /** Per rank, the vertices the marks of that rank stand for. */
-    readonly tally: readonly number[];
-    /** Vertices the marks stand for — a cell counts its members. */
-    readonly represented: number;
-}
-export interface ComposeInput {
-    readonly matrix: TileMatrixSet;
-    readonly typeIndex: number;
-    readonly binding: Binding;
-    readonly modeColumn: string | null;
-    /** The categorical domain fixed before any tile: it ranks first, in its own order. */
-    readonly domain: readonly unknown[];
-    readonly visible: readonly TileView[];
-    readonly cached: readonly TileView[];
-    /** Graph units per screen pixel when composed, for the stub discard. */
-    readonly perPixel: number;
-}
-/**
- * **Visible tiles → one buffer set.** cosmos.gl replaces a whole buffer per setter, so what changed
- * is decided at the granularity it offers: the set of tiles. The same visible set under the same
- * binding composes to `null` — nothing new, and nothing to upload.
- */
-export declare function createComposer(): (input: ComposeInput) => Composition | null;
-//# sourceMappingURL=compose.d.ts.map

package/dist/render/compose.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"compose.d.ts","sourceRoot":"","sources":["../../src/render/compose.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAwB,KAAK,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAEvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAG9C,kGAAkG;AAClG,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC,iDAAiD;AACjD,MAAM,WAAW,WAAW;IAC1B,4FAA4F;IAC5F,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,mDAAmD;IACnD,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;IACtC,oEAAoE;IACpE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6DAA6D;IAC7D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,mEAAmE;IACnE,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IACjC,uEAAuE;IACvE,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IACpC,yDAAyD;IACzD,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAC1C,4FAA4F;IAC5F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,gEAAgE;IAChE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,wBAAgB,cAAc,IAAI,CAAC,KAAK,EAAE,YAAY,KAAK,WAAW,GAAG,IAAI,CA+B5E"}

package/dist/render/compose.js

@@ -1,107 +0,0 @@
-import { vertexId as X, residentOf as Z } from "../core/resident.js";
-import { Dictionary as S, encode as q } from "./encode.js";
-const G = 3;
-function ee() {
-  let i = "", a = new S(), h = [], y = /* @__PURE__ */ new WeakMap(), m = "";
-  const w = (n, s) => {
-    let l = y.get(n.content);
-    return l || (l = q(n, s.binding, a, s.modeColumn), y.set(n.content, l)), l;
-  };
-  return (n) => {
-    const s = `${n.binding.category}|${n.binding.size}|${n.binding.title}|${n.modeColumn}`;
-    (s !== i || n.domain !== h) && (i = s, h = n.domain, a = new S(h), y = /* @__PURE__ */ new WeakMap(), m = "");
-    const l = n.visible.map((u) => J(u.content)).join(",");
-    if (l === m) return null;
-    m = l;
-    const p = n.visible.map((u) => ({ view: u, encoded: w(u, n) }));
-    return Q(n, p, a, w);
-  };
-}
-const U = /* @__PURE__ */ new WeakMap();
-let H = 1;
-function J(i) {
-  let a = U.get(i);
-  return a === void 0 && U.set(i, a = H++), a;
-}
-function Q(i, a, h, y) {
-  var B, P;
-  const m = [...a].sort((e, t) => Number(e.encoded.cells) - Number(t.encoded.cells));
-  let w = 0, n = 0;
-  for (const { encoded: e } of m)
-    w += e.n, e.cells || (n += e.n);
-  const s = [], l = [], p = [], u = [], x = [], A = new BigUint64Array(n), $ = /* @__PURE__ */ new Map(), I = (e) => {
-    let t = $.get(e);
-    return t || $.set(e, t = /* @__PURE__ */ new Map()), t;
-  }, z = (e, t, o) => {
-    var c, d;
-    const r = s.length / 2;
-    return s.push(t.positions[o * 2], t.positions[o * 2 + 1]), l.push(((c = t.codes) == null ? void 0 : c[o]) ?? 0), p.push(((d = t.sizes) == null ? void 0 : d[o]) ?? 0), I(e).set(t.keys[o], r), r;
-  };
-  let F = 0;
-  for (const { encoded: e, view: t } of m)
-    for (let o = 0; o < e.n; o++) {
-      const r = z(t.address.z, e, o), c = e.counts[o] ?? 0;
-      x[r] = c, F += c, e.cells || (A[r] = X(i.typeIndex, e.keys[o]), u.push(((B = e.titles) == null ? void 0 : B[o]) ?? ""));
-    }
-  const v = /* @__PURE__ */ new Map();
-  for (const e of i.cached) {
-    let t = v.get(e.address.z);
-    t || v.set(e.address.z, t = /* @__PURE__ */ new Map()), t.set(e.address.tile, e);
-  }
-  const N = (e, t) => {
-    var k, g;
-    const o = I(e).get(t);
-    if (o !== void 0) return o;
-    const r = ((k = i.matrix.tileMatrices[e]) == null ? void 0 : k.tileRows) ?? 1, c = (g = v.get(e)) == null ? void 0 : g.get(Math.floor(t / r));
-    if (!c) return;
-    const d = y(c, i);
-    for (let f = 0; f < d.n; f++) if (d.keys[f] === t) return z(e, d, f);
-  }, _ = G * i.perPixel, C = [], E = [], K = /* @__PURE__ */ new Set();
-  let L = !1;
-  for (const { encoded: e, view: t } of m) {
-    const { z: o } = t.address;
-    for (let r = 0; r < e.links.length / 2; r++) {
-      const c = e.links[r * 2], d = e.links[r * 2 + 1];
-      if (c === d) continue;
-      const k = `${o}:${c}:${d}`;
-      if (K.has(k)) continue;
-      const g = N(o, c), f = N(o, d);
-      if (g === void 0 || f === void 0) continue;
-      K.add(k);
-      const D = s[g * 2] - s[f * 2], R = s[g * 2 + 1] - s[f * 2 + 1];
-      if (Math.hypot(D, R) < _) continue;
-      C.push(g, f);
-      const T = ((P = e.weights) == null ? void 0 : P[r]) ?? 1;
-      e.weights && (L = !0), E.push(T);
-    }
-  }
-  const O = h.ranks(), W = Uint32Array.from(l, (e) => O[e] ?? 0), b = [];
-  O.forEach((e, t) => {
-    b[e] = h.values[t];
-  });
-  const M = b.map(() => 0);
-  for (let e = 0; e < w; e++) {
-    const t = W[e] ?? 0;
-    M[t] = (M[t] ?? 0) + (x[e] ?? 0);
-  }
-  const j = m.some(({ encoded: e }) => e.sizes !== null);
-  return {
-    positions: Float32Array.from(s),
-    links: Float32Array.from(C),
-    weights: L ? Float32Array.from(E) : null,
-    marks: w,
-    vertices: n,
-    resident: Z(A, n),
-    categories: W,
-    sizes: j ? Float32Array.from(p) : null,
-    titles: i.binding.title === void 0 ? null : u,
-    domain: b,
-    tally: M,
-    represented: F
-  };
-}
-export {
-  G as MIN_LINK_PIXELS,
-  ee as createComposer
-};
-//# sourceMappingURL=compose.js.map

package/dist/render/compose.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compose.js","sources":["../../src/render/compose.ts"],"sourcesContent":["import type { TileMatrixSet } from \"@fossil-lang/corpus\";\nimport type { Binding } from \"../core/channels\";\nimport { residentOf, vertexId, type Resident } from \"../core/resident\";\nimport type { TileContent } from \"../core/tile\";\nimport type { TileView } from \"../core/store\";\nimport { Dictionary, encode, type Encoded } from \"./encode\";\n\n/** An edge shorter than this many screen pixels is a dot on its own ends, and is not composed. */\nexport const MIN_LINK_PIXELS = 3;\n\n/** One buffer set for one cosmos.gl instance. */\nexport interface Composition {\n  /** `[x, y, …]`: vertices first, then cells, then far ends drawn only so an edge has one. */\n  readonly positions: Float32Array;\n  /** `[src, dst, …]` as indices into `positions`. */\n  readonly links: Float32Array;\n  /** How many edges each link stands for; `null` when every link is one edge. */\n  readonly weights: Float32Array | null;\n  /** Slots that are drawn — vertices and cells. Past it, far ends. */\n  readonly marks: number;\n  /** How many of the marks are vertices; cells follow them. */\n  readonly vertices: number;\n  readonly resident: Resident;\n  /** Per slot: the category's rank, or `0` when nothing is bound. */\n  readonly categories: Uint32Array;\n  /** Per slot: the ramp's raw value, or `null` when nothing is bound. */\n  readonly sizes: Float32Array | null;\n  /** Per vertex slot: its title, when `title` is bound. */\n  readonly titles: readonly string[] | null;\n  /** What each rank is, for a legend: the seed, then the other values seen, in rank order. */\n  readonly domain: readonly unknown[];\n  /** Per rank, the vertices the marks of that rank stand for. */\n  readonly tally: readonly number[];\n  /** Vertices the marks stand for — a cell counts its members. */\n  readonly represented: number;\n}\n\nexport interface ComposeInput {\n  readonly matrix: TileMatrixSet;\n  readonly typeIndex: number;\n  readonly binding: Binding;\n  readonly modeColumn: string | null;\n  /** The categorical domain fixed before any tile: it ranks first, in its own order. */\n  readonly domain: readonly unknown[];\n  readonly visible: readonly TileView[];\n  readonly cached: readonly TileView[];\n  /** Graph units per screen pixel when composed, for the stub discard. */\n  readonly perPixel: number;\n}\n\n/**\n * **Visible tiles → one buffer set.** cosmos.gl replaces a whole buffer per setter, so what changed\n * is decided at the granularity it offers: the set of tiles. The same visible set under the same\n * binding composes to `null` — nothing new, and nothing to upload.\n */\nexport function createComposer(): (input: ComposeInput) => Composition | null {\n  let bindingKey = \"\";\n  let dictionary = new Dictionary();\n  let seed: readonly unknown[] = [];\n  let encoded = new WeakMap<TileContent, Encoded>();\n  let setKey = \"\";\n\n  const encodedOf = (view: TileView, input: ComposeInput): Encoded => {\n    let found = encoded.get(view.content);\n    if (!found) {\n      found = encode(view, input.binding, dictionary, input.modeColumn);\n      encoded.set(view.content, found);\n    }\n    return found;\n  };\n\n  return (input) => {\n    const key = `${input.binding.category}|${input.binding.size}|${input.binding.title}|${input.modeColumn}`;\n    if (key !== bindingKey || input.domain !== seed) {\n      bindingKey = key;\n      seed = input.domain;\n      dictionary = new Dictionary(seed);\n      encoded = new WeakMap();\n      setKey = \"\";\n    }\n    const next = input.visible.map((view) => idOf(view.content)).join(\",\");\n    if (next === setKey) return null;\n    setKey = next;\n    const tiles = input.visible.map((view) => ({ view, encoded: encodedOf(view, input) }));\n    return assemble(input, tiles, dictionary, encodedOf);\n  };\n}\n\nconst ids = new WeakMap<object, number>();\nlet nextId = 1;\nfunction idOf(content: object): number {\n  let id = ids.get(content);\n  if (id === undefined) ids.set(content, (id = nextId++));\n  return id;\n}\n\nfunction assemble(\n  input: ComposeInput,\n  tiles: readonly { view: TileView; encoded: Encoded }[],\n  dictionary: Dictionary,\n  encodedOf: (view: TileView, input: ComposeInput) => Encoded,\n): Composition {\n  const ordered = [...tiles].sort((a, b) => Number(a.encoded.cells) - Number(b.encoded.cells));\n  let marks = 0;\n  let vertexMarks = 0;\n  for (const { encoded } of ordered) {\n    marks += encoded.n;\n    if (!encoded.cells) vertexMarks += encoded.n;\n  }\n\n  const xy: number[] = [];\n  const codes: number[] = [];\n  const ramp: number[] = [];\n  const titles: string[] = [];\n  const counts: number[] = [];\n  const vertices = new BigUint64Array(vertexMarks);\n  const slot = new Map<number, Map<number, number>>();\n  const slotsAt = (z: number) => {\n    let found = slot.get(z);\n    if (!found) slot.set(z, (found = new Map()));\n    return found;\n  };\n  const place = (z: number, encoded: Encoded, i: number) => {\n    const at = xy.length / 2;\n    xy.push(encoded.positions[i * 2] as number, encoded.positions[i * 2 + 1] as number);\n    codes.push(encoded.codes?.[i] ?? 0);\n    ramp.push(encoded.sizes?.[i] ?? 0);\n    slotsAt(z).set(encoded.keys[i] as number, at);\n    return at;\n  };\n\n  let represented = 0;\n  for (const { encoded, view } of ordered) {\n    for (let i = 0; i < encoded.n; i++) {\n      const at = place(view.address.z, encoded, i);\n      const count = encoded.counts[i] ?? 0;\n      counts[at] = count;\n      represented += count;\n      if (!encoded.cells) {\n        vertices[at] = vertexId(input.typeIndex, encoded.keys[i] as number);\n        titles.push(encoded.titles?.[i] ?? \"\");\n      }\n    }\n  }\n\n  const cachedByZ = new Map<number, Map<number, TileView>>();\n  for (const view of input.cached) {\n    let byTile = cachedByZ.get(view.address.z);\n    if (!byTile) cachedByZ.set(view.address.z, (byTile = new Map()));\n    byTile.set(view.address.tile, view);\n  }\n  /** A far end: in the cache or not at all — never a read of its tile. */\n  const farEnd = (z: number, key: number): number | undefined => {\n    const known = slotsAt(z).get(key);\n    if (known !== undefined) return known;\n    const rows = input.matrix.tileMatrices[z]?.tileRows ?? 1;\n    const view = cachedByZ.get(z)?.get(Math.floor(key / rows));\n    if (!view) return undefined;\n    const encoded = encodedOf(view, input);\n    for (let i = 0; i < encoded.n; i++) if (encoded.keys[i] === key) return place(z, encoded, i);\n    return undefined;\n  };\n\n  const minLength = MIN_LINK_PIXELS * input.perPixel;\n  const links: number[] = [];\n  const weights: number[] = [];\n  const seen = new Set<string>();\n  let weighted = false;\n  for (const { encoded, view } of ordered) {\n    const { z } = view.address;\n    for (let e = 0; e < encoded.links.length / 2; e++) {\n      const from = encoded.links[e * 2] as number;\n      const to = encoded.links[e * 2 + 1] as number;\n      if (from === to) continue;\n      const pair = `${z}:${from}:${to}`;\n      if (seen.has(pair)) continue;\n      const a = farEnd(z, from);\n      const b = farEnd(z, to);\n      if (a === undefined || b === undefined) continue;\n      seen.add(pair);\n      const dx = (xy[a * 2] as number) - (xy[b * 2] as number);\n      const dy = (xy[a * 2 + 1] as number) - (xy[b * 2 + 1] as number);\n      if (Math.hypot(dx, dy) < minLength) continue;\n      links.push(a, b);\n      const weight = encoded.weights?.[e] ?? 1;\n      if (encoded.weights) weighted = true;\n      weights.push(weight);\n    }\n  }\n\n  const ranks = dictionary.ranks();\n  const categories = Uint32Array.from(codes, (code) => ranks[code] ?? 0);\n  const domain: unknown[] = [];\n  ranks.forEach((rank, code) => {\n    domain[rank] = dictionary.values[code];\n  });\n  const tally = domain.map(() => 0);\n  for (let i = 0; i < marks; i++) {\n    const rank = categories[i] ?? 0;\n    tally[rank] = (tally[rank] ?? 0) + (counts[i] ?? 0);\n  }\n  const bound = ordered.some(({ encoded }) => encoded.sizes !== null);\n\n  return {\n    positions: Float32Array.from(xy),\n    links: Float32Array.from(links),\n    weights: weighted ? Float32Array.from(weights) : null,\n    marks,\n    vertices: vertexMarks,\n    resident: residentOf(vertices, vertexMarks),\n    categories,\n    sizes: bound ? Float32Array.from(ramp) : null,\n    titles: input.binding.title === undefined ? null : titles,\n    domain,\n    tally,\n    represented,\n  };\n}\n"],"names":["MIN_LINK_PIXELS","createComposer","bindingKey","dictionary","Dictionary","seed","encoded","setKey","encodedOf","view","input","found","encode","key","next","idOf","tiles","assemble","ids","nextId","content","id","ordered","a","b","marks","vertexMarks","xy","codes","ramp","titles","counts","vertices","slot","slotsAt","z","place","i","at","_a","_b","represented","count","vertexId","cachedByZ","byTile","farEnd","known","rows","minLength","links","weights","seen","weighted","e","from","to","pair","dx","dy","weight","ranks","categories","code","domain","rank","tally","bound","residentOf"],"mappings":";;AAQO,MAAMA,IAAkB;AA+CxB,SAASC,KAA8D;AAC5E,MAAIC,IAAa,IACbC,IAAa,IAAIC,EAAA,GACjBC,IAA2B,CAAA,GAC3BC,wBAAc,QAAA,GACdC,IAAS;AAEb,QAAMC,IAAY,CAACC,GAAgBC,MAAiC;AAClE,QAAIC,IAAQL,EAAQ,IAAIG,EAAK,OAAO;AACpC,WAAKE,MACHA,IAAQC,EAAOH,GAAMC,EAAM,SAASP,GAAYO,EAAM,UAAU,GAChEJ,EAAQ,IAAIG,EAAK,SAASE,CAAK,IAE1BA;AAAA,EACT;AAEA,SAAO,CAACD,MAAU;AAChB,UAAMG,IAAM,GAAGH,EAAM,QAAQ,QAAQ,IAAIA,EAAM,QAAQ,IAAI,IAAIA,EAAM,QAAQ,KAAK,IAAIA,EAAM,UAAU;AACtG,KAAIG,MAAQX,KAAcQ,EAAM,WAAWL,OACzCH,IAAaW,GACbR,IAAOK,EAAM,QACbP,IAAa,IAAIC,EAAWC,CAAI,GAChCC,wBAAc,QAAA,GACdC,IAAS;AAEX,UAAMO,IAAOJ,EAAM,QAAQ,IAAI,CAACD,MAASM,EAAKN,EAAK,OAAO,CAAC,EAAE,KAAK,GAAG;AACrE,QAAIK,MAASP,EAAQ,QAAO;AAC5B,IAAAA,IAASO;AACT,UAAME,IAAQN,EAAM,QAAQ,IAAI,CAACD,OAAU,EAAE,MAAAA,GAAM,SAASD,EAAUC,GAAMC,CAAK,IAAI;AACrF,WAAOO,EAASP,GAAOM,GAAOb,GAAYK,CAAS;AAAA,EACrD;AACF;AAEA,MAAMU,wBAAU,QAAA;AAChB,IAAIC,IAAS;AACb,SAASJ,EAAKK,GAAyB;AACrC,MAAIC,IAAKH,EAAI,IAAIE,CAAO;AACxB,SAAIC,MAAO,UAAWH,EAAI,IAAIE,GAAUC,IAAKF,GAAS,GAC/CE;AACT;AAEA,SAASJ,EACPP,GACAM,GACAb,GACAK,GACa;;AACb,QAAMc,IAAU,CAAC,GAAGN,CAAK,EAAE,KAAK,CAACO,GAAGC,MAAM,OAAOD,EAAE,QAAQ,KAAK,IAAI,OAAOC,EAAE,QAAQ,KAAK,CAAC;AAC3F,MAAIC,IAAQ,GACRC,IAAc;AAClB,aAAW,EAAE,SAAApB,EAAA,KAAagB;AACxB,IAAAG,KAASnB,EAAQ,GACZA,EAAQ,UAAOoB,KAAepB,EAAQ;AAG7C,QAAMqB,IAAe,CAAA,GACfC,IAAkB,CAAA,GAClBC,IAAiB,CAAA,GACjBC,IAAmB,CAAA,GACnBC,IAAmB,CAAA,GACnBC,IAAW,IAAI,eAAeN,CAAW,GACzCO,wBAAW,IAAA,GACXC,IAAU,CAACC,MAAc;AAC7B,QAAIxB,IAAQsB,EAAK,IAAIE,CAAC;AACtB,WAAKxB,KAAOsB,EAAK,IAAIE,GAAIxB,IAAQ,oBAAI,KAAM,GACpCA;AAAA,EACT,GACMyB,IAAQ,CAACD,GAAW7B,GAAkB+B,MAAc;;AACxD,UAAMC,IAAKX,EAAG,SAAS;AACvB,WAAAA,EAAG,KAAKrB,EAAQ,UAAU+B,IAAI,CAAC,GAAa/B,EAAQ,UAAU+B,IAAI,IAAI,CAAC,CAAW,GAClFT,EAAM,OAAKW,IAAAjC,EAAQ,UAAR,gBAAAiC,EAAgBF,OAAM,CAAC,GAClCR,EAAK,OAAKW,IAAAlC,EAAQ,UAAR,gBAAAkC,EAAgBH,OAAM,CAAC,GACjCH,EAAQC,CAAC,EAAE,IAAI7B,EAAQ,KAAK+B,CAAC,GAAaC,CAAE,GACrCA;AAAA,EACT;AAEA,MAAIG,IAAc;AAClB,aAAW,EAAE,SAAAnC,GAAS,MAAAG,EAAA,KAAUa;AAC9B,aAASe,IAAI,GAAGA,IAAI/B,EAAQ,GAAG+B,KAAK;AAClC,YAAMC,IAAKF,EAAM3B,EAAK,QAAQ,GAAGH,GAAS+B,CAAC,GACrCK,IAAQpC,EAAQ,OAAO+B,CAAC,KAAK;AACnC,MAAAN,EAAOO,CAAE,IAAII,GACbD,KAAeC,GACVpC,EAAQ,UACX0B,EAASM,CAAE,IAAIK,EAASjC,EAAM,WAAWJ,EAAQ,KAAK+B,CAAC,CAAW,GAClEP,EAAO,OAAKS,IAAAjC,EAAQ,WAAR,gBAAAiC,EAAiBF,OAAM,EAAE;AAAA,IAEzC;AAGF,QAAMO,wBAAgB,IAAA;AACtB,aAAWnC,KAAQC,EAAM,QAAQ;AAC/B,QAAImC,IAASD,EAAU,IAAInC,EAAK,QAAQ,CAAC;AACzC,IAAKoC,KAAQD,EAAU,IAAInC,EAAK,QAAQ,GAAIoC,IAAS,oBAAI,KAAM,GAC/DA,EAAO,IAAIpC,EAAK,QAAQ,MAAMA,CAAI;AAAA,EACpC;AAEA,QAAMqC,IAAS,CAACX,GAAWtB,MAAoC;;AAC7D,UAAMkC,IAAQb,EAAQC,CAAC,EAAE,IAAItB,CAAG;AAChC,QAAIkC,MAAU,OAAW,QAAOA;AAChC,UAAMC,MAAOT,IAAA7B,EAAM,OAAO,aAAayB,CAAC,MAA3B,gBAAAI,EAA8B,aAAY,GACjD9B,KAAO+B,IAAAI,EAAU,IAAIT,CAAC,MAAf,gBAAAK,EAAkB,IAAI,KAAK,MAAM3B,IAAMmC,CAAI;AACxD,QAAI,CAACvC,EAAM;AACX,UAAMH,IAAUE,EAAUC,GAAMC,CAAK;AACrC,aAAS2B,IAAI,GAAGA,IAAI/B,EAAQ,GAAG+B,IAAK,KAAI/B,EAAQ,KAAK+B,CAAC,MAAMxB,EAAK,QAAOuB,EAAMD,GAAG7B,GAAS+B,CAAC;AAAA,EAE7F,GAEMY,IAAYjD,IAAkBU,EAAM,UACpCwC,IAAkB,CAAA,GAClBC,IAAoB,CAAA,GACpBC,wBAAW,IAAA;AACjB,MAAIC,IAAW;AACf,aAAW,EAAE,SAAA/C,GAAS,MAAAG,EAAA,KAAUa,GAAS;AACvC,UAAM,EAAE,GAAAa,MAAM1B,EAAK;AACnB,aAAS6C,IAAI,GAAGA,IAAIhD,EAAQ,MAAM,SAAS,GAAGgD,KAAK;AACjD,YAAMC,IAAOjD,EAAQ,MAAMgD,IAAI,CAAC,GAC1BE,IAAKlD,EAAQ,MAAMgD,IAAI,IAAI,CAAC;AAClC,UAAIC,MAASC,EAAI;AACjB,YAAMC,IAAO,GAAGtB,CAAC,IAAIoB,CAAI,IAAIC,CAAE;AAC/B,UAAIJ,EAAK,IAAIK,CAAI,EAAG;AACpB,YAAMlC,IAAIuB,EAAOX,GAAGoB,CAAI,GAClB/B,IAAIsB,EAAOX,GAAGqB,CAAE;AACtB,UAAIjC,MAAM,UAAaC,MAAM,OAAW;AACxC,MAAA4B,EAAK,IAAIK,CAAI;AACb,YAAMC,IAAM/B,EAAGJ,IAAI,CAAC,IAAgBI,EAAGH,IAAI,CAAC,GACtCmC,IAAMhC,EAAGJ,IAAI,IAAI,CAAC,IAAgBI,EAAGH,IAAI,IAAI,CAAC;AACpD,UAAI,KAAK,MAAMkC,GAAIC,CAAE,IAAIV,EAAW;AACpC,MAAAC,EAAM,KAAK3B,GAAGC,CAAC;AACf,YAAMoC,MAASpB,IAAAlC,EAAQ,YAAR,gBAAAkC,EAAkBc,OAAM;AACvC,MAAIhD,EAAQ,YAAS+C,IAAW,KAChCF,EAAQ,KAAKS,CAAM;AAAA,IACrB;AAAA,EACF;AAEA,QAAMC,IAAQ1D,EAAW,MAAA,GACnB2D,IAAa,YAAY,KAAKlC,GAAO,CAACmC,MAASF,EAAME,CAAI,KAAK,CAAC,GAC/DC,IAAoB,CAAA;AAC1B,EAAAH,EAAM,QAAQ,CAACI,GAAMF,MAAS;AAC5B,IAAAC,EAAOC,CAAI,IAAI9D,EAAW,OAAO4D,CAAI;AAAA,EACvC,CAAC;AACD,QAAMG,IAAQF,EAAO,IAAI,MAAM,CAAC;AAChC,WAAS3B,IAAI,GAAGA,IAAIZ,GAAOY,KAAK;AAC9B,UAAM4B,IAAOH,EAAWzB,CAAC,KAAK;AAC9B,IAAA6B,EAAMD,CAAI,KAAKC,EAAMD,CAAI,KAAK,MAAMlC,EAAOM,CAAC,KAAK;AAAA,EACnD;AACA,QAAM8B,IAAQ7C,EAAQ,KAAK,CAAC,EAAE,SAAAhB,QAAcA,EAAQ,UAAU,IAAI;AAElE,SAAO;AAAA,IACL,WAAW,aAAa,KAAKqB,CAAE;AAAA,IAC/B,OAAO,aAAa,KAAKuB,CAAK;AAAA,IAC9B,SAASG,IAAW,aAAa,KAAKF,CAAO,IAAI;AAAA,IACjD,OAAA1B;AAAA,IACA,UAAUC;AAAA,IACV,UAAU0C,EAAWpC,GAAUN,CAAW;AAAA,IAC1C,YAAAoC;AAAA,IACA,OAAOK,IAAQ,aAAa,KAAKtC,CAAI,IAAI;AAAA,IACzC,QAAQnB,EAAM,QAAQ,UAAU,SAAY,OAAOoB;AAAA,IACnD,QAAAkC;AAAA,IACA,OAAAE;AAAA,IACA,aAAAzB;AAAA,EAAA;AAEJ;"}