@kanzo-tech/graph 0.14.0 → 0.15.0

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;"}

package/dist/render/encode.d.ts

@@ -1,42 +0,0 @@
-import { Binding } from '../core/channels';
-import { TileView } from '../core/store';
-/**
- * Values to codes, in the order first seen — stable for the life of a binding. **The seed ranks
- * first, in its own order**: the manifest's ordinals or the host's named values, so a colour is
- * decided before a tile arrives. Only a value outside it is ranked by value, after the seed.
- */
-export declare class Dictionary {
-    #private;
-    readonly values: unknown[];
-    constructor(seed?: readonly unknown[]);
-    code(value: unknown): number;
-    /** Each code's rank: the seed's own order, then every other value seen, numbers before strings. */
-    ranks(): Uint32Array;
-}
-/** One tile's rows and edges as the arrays a composition concatenates. */
-export interface Encoded {
-    readonly n: number;
-    readonly cells: boolean;
-    /** `[x0, y0, x1, y1, …]`. */
-    readonly positions: Float32Array;
-    /** `dense_id` at the payload, `cell_id` on a rung — what an edge's ends name. */
-    readonly keys: Float64Array;
-    /** Dictionary codes of the categorical column, or `null` when nothing is bound. */
-    readonly codes: Uint32Array | null;
-    /** The ramp: `r`'s column at the payload, a cell's `count` on a rung. */
-    readonly sizes: Float32Array | null;
-    /** Vertices each row stands for: one at the payload, a cell's `count` on a rung. */
-    readonly counts: Float64Array;
-    readonly titles: readonly string[] | null;
-    /** `[src, dst, …]` in `keys`' space, every relation read from this tile, both directions. */
-    readonly links: Float64Array;
-    /** How many edges each link stands for: one at the payload, the quotient's `weight` on a rung. */
-    readonly weights: Float32Array | null;
-}
-/**
- * **A tile is encoded once per binding**: the arrays are made when it arrives, and a composition is a
- * concatenation of arrays already made. A cell summarises one channel, so its colour is `mode` when
- * `fill` binds the column the tree's mode is of, its size can only be `count`, and it has no title.
- */
-export declare function encode(view: TileView, binding: Binding, dictionary: Dictionary, modeColumn: string | null): Encoded;
-//# sourceMappingURL=encode.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"encode.d.ts","sourceRoot":"","sources":["../../src/render/encode.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAY9C;;;;GAIG;AACH,qBAAa,UAAU;;IACrB,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,CAAM;gBAIpB,IAAI,GAAE,SAAS,OAAO,EAAO;IAKzC,IAAI,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAW5B,mGAAmG;IACnG,KAAK,IAAI,WAAW;CAUrB;AASD,0EAA0E;AAC1E,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,6BAA6B;IAC7B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,iFAAiF;IACjF,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,mFAAmF;IACnF,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,CAAC;IACnC,yEAAyE;IACzE,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IACpC,oFAAoF;IACpF,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAC1C,6FAA6F;IAC7F,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,kGAAkG;IAClG,QAAQ,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;CACvC;AAQD;;;;GAIG;AACH,wBAAgB,MAAM,CACpB,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,OAAO,EAChB,UAAU,EAAE,UAAU,EACtB,UAAU,EAAE,MAAM,GAAG,IAAI,GACxB,OAAO,CA2CT"}

package/dist/render/encode.js

@@ -1,68 +0,0 @@
-var q = Object.defineProperty;
-var M = (e) => {
-  throw TypeError(e);
-};
-var x = (e, t, o) => t in e ? q(e, t, { enumerable: !0, configurable: !0, writable: !0, value: o }) : e[t] = o;
-var P = (e, t, o) => x(e, typeof t != "symbol" ? t + "" : t, o), T = (e, t, o) => t.has(e) || M("Cannot " + o);
-var u = (e, t, o) => (T(e, t, "read from private field"), o ? o.call(e) : t.get(e)), C = (e, t, o) => t.has(e) ? M("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, o), U = (e, t, o, r) => (T(e, t, "write to private field"), r ? r.call(e, o) : t.set(e, o), o);
-import { PAYLOAD_COORDINATES as B, PAYLOAD_ADDRESS as G } from "@fossil-lang/corpus";
-const H = "cell_id", J = "count", Q = "mode", V = G[0], [W, Z] = B;
-var f, l;
-class ot {
-  constructor(t = []) {
-    P(this, "values", []);
-    C(this, f, /* @__PURE__ */ new Map());
-    C(this, l);
-    for (const o of t) this.code(o);
-    U(this, l, this.values.length);
-  }
-  code(t) {
-    const o = typeof t == "bigint" ? Number(t) : t;
-    let r = u(this, f).get(o);
-    return r === void 0 && (r = this.values.length, this.values.push(o), u(this, f).set(o, r)), r;
-  }
-  /** Each code's rank: the seed's own order, then every other value seen, numbers before strings. */
-  ranks() {
-    const t = new Uint32Array(this.values.length);
-    for (let r = 0; r < u(this, l); r++) t[r] = r;
-    const o = this.values.slice(u(this, l)).map((r, n) => ({ value: r, code: u(this, l) + n }));
-    return o.sort((r, n) => $(r.value, n.value)), o.forEach(({ code: r }, n) => {
-      t[r] = u(this, l) + n;
-    }), t;
-  }
-}
-f = new WeakMap(), l = new WeakMap();
-function $(e, t) {
-  return typeof e == "number" && typeof t == "number" ? e - t : typeof e == "number" ? -1 : typeof t == "number" ? 1 : String(e ?? "").localeCompare(String(t ?? ""));
-}
-const w = (e, t) => {
-  const o = new Float64Array(t);
-  if (e) for (let r = 0; r < t; r++) o[r] = Number(e[r] ?? Number.NaN);
-  return o;
-};
-function rt(e, t, o, r) {
-  var k, F, S, Y, O, z, R, K;
-  const { rows: n, edges: L } = e.content, i = e.kind === "cells", c = n.numRows, y = (k = n.getChild(W)) == null ? void 0 : k.toArray(), m = (F = n.getChild(Z)) == null ? void 0 : F.toArray(), g = new Float32Array(c * 2);
-  for (let s = 0; s < c; s++)
-    g[s * 2] = Number((y == null ? void 0 : y[s]) ?? Number.NaN), g[s * 2 + 1] = Number((m == null ? void 0 : m[s]) ?? Number.NaN);
-  const I = w((S = n.getChild(i ? H : V)) == null ? void 0 : S.toArray(), c), E = i ? t.category === r ? Q : void 0 : t.category, b = E === void 0 || (Y = n.getChild(E)) == null ? void 0 : Y.toArray();
-  let A = null;
-  if (b) {
-    A = new Uint32Array(c);
-    for (let s = 0; s < c; s++) A[s] = o.code(b[s] ?? null);
-  }
-  const D = i ? w((O = n.getChild(J)) == null ? void 0 : O.toArray(), c) : new Float64Array(c).fill(1), d = i ? t.size !== void 0 ? D : void 0 : t.size, X = d === void 0 ? null : Float32Array.from(typeof d == "string" ? w((z = n.getChild(d)) == null ? void 0 : z.toArray(), c) : d), _ = !i && t.title !== void 0 ? (R = n.getChild(t.title)) == null ? void 0 : R.toArray() : void 0, j = _ ? Array.from({ length: c }, (s, a) => String(_[a] ?? "")) : null;
-  let N = 0;
-  for (const s of L) N += s.src.length;
-  const p = new Float64Array(N * 2), v = i ? new Float32Array(N) : null;
-  let h = 0;
-  for (const s of L)
-    for (let a = 0; a < s.src.length; a++, h++)
-      p[h * 2] = Number(s.src[a]), p[h * 2 + 1] = Number(s.dst[a]), v && (v[h] = Number(((K = s.weight) == null ? void 0 : K[a]) ?? 1));
-  return { n: c, cells: i, positions: g, keys: I, codes: A, sizes: X, counts: D, titles: j, links: p, weights: v };
-}
-export {
-  ot as Dictionary,
-  rt as encode
-};
-//# sourceMappingURL=encode.js.map

package/dist/render/encode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"encode.js","sources":["../../src/render/encode.ts"],"sourcesContent":["import { PAYLOAD_ADDRESS, PAYLOAD_COORDINATES } from \"@fossil-lang/corpus\";\nimport type { Binding } from \"../core/channels\";\nimport type { TileView } from \"../core/store\";\n\n/**\n * The cell columns a view reads. fossil's barrel publishes the payload's role table and not the\n * cells', so these two are spelled here; `/docs/design/graph` lists it as open on fossil's side.\n */\nconst CELL_KEY = \"cell_id\";\nconst CELL_TALLY = \"count\";\nconst CELL_MODE = \"mode\";\nconst KEY = PAYLOAD_ADDRESS[0] as string;\nconst [X, Y] = PAYLOAD_COORDINATES as [string, string];\n\n/**\n * Values to codes, in the order first seen — stable for the life of a binding. **The seed ranks\n * first, in its own order**: the manifest's ordinals or the host's named values, so a colour is\n * decided before a tile arrives. Only a value outside it is ranked by value, after the seed.\n */\nexport class Dictionary {\n  readonly values: unknown[] = [];\n  readonly #codes = new Map<unknown, number>();\n  readonly #seeded: number;\n\n  constructor(seed: readonly unknown[] = []) {\n    for (const value of seed) this.code(value);\n    this.#seeded = this.values.length;\n  }\n\n  code(value: unknown): number {\n    const key = typeof value === \"bigint\" ? Number(value) : value;\n    let code = this.#codes.get(key);\n    if (code === undefined) {\n      code = this.values.length;\n      this.values.push(key);\n      this.#codes.set(key, code);\n    }\n    return code;\n  }\n\n  /** Each code's rank: the seed's own order, then every other value seen, numbers before strings. */\n  ranks(): Uint32Array {\n    const ranks = new Uint32Array(this.values.length);\n    for (let code = 0; code < this.#seeded; code++) ranks[code] = code;\n    const rest = this.values.slice(this.#seeded).map((value, i) => ({ value, code: this.#seeded + i }));\n    rest.sort((a, b) => compare(a.value, b.value));\n    rest.forEach(({ code }, i) => {\n      ranks[code] = this.#seeded + i;\n    });\n    return ranks;\n  }\n}\n\nfunction compare(a: unknown, b: unknown): number {\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b;\n  if (typeof a === \"number\") return -1;\n  if (typeof b === \"number\") return 1;\n  return String(a ?? \"\").localeCompare(String(b ?? \"\"));\n}\n\n/** One tile's rows and edges as the arrays a composition concatenates. */\nexport interface Encoded {\n  readonly n: number;\n  readonly cells: boolean;\n  /** `[x0, y0, x1, y1, …]`. */\n  readonly positions: Float32Array;\n  /** `dense_id` at the payload, `cell_id` on a rung — what an edge's ends name. */\n  readonly keys: Float64Array;\n  /** Dictionary codes of the categorical column, or `null` when nothing is bound. */\n  readonly codes: Uint32Array | null;\n  /** The ramp: `r`'s column at the payload, a cell's `count` on a rung. */\n  readonly sizes: Float32Array | null;\n  /** Vertices each row stands for: one at the payload, a cell's `count` on a rung. */\n  readonly counts: Float64Array;\n  readonly titles: readonly string[] | null;\n  /** `[src, dst, …]` in `keys`' space, every relation read from this tile, both directions. */\n  readonly links: Float64Array;\n  /** How many edges each link stands for: one at the payload, the quotient's `weight` on a rung. */\n  readonly weights: Float32Array | null;\n}\n\nconst numbers = (values: ArrayLike<unknown> | undefined, n: number): Float64Array => {\n  const out = new Float64Array(n);\n  if (values) for (let i = 0; i < n; i++) out[i] = Number(values[i] ?? Number.NaN);\n  return out;\n};\n\n/**\n * **A tile is encoded once per binding**: the arrays are made when it arrives, and a composition is a\n * concatenation of arrays already made. A cell summarises one channel, so its colour is `mode` when\n * `fill` binds the column the tree's mode is of, its size can only be `count`, and it has no title.\n */\nexport function encode(\n  view: TileView,\n  binding: Binding,\n  dictionary: Dictionary,\n  modeColumn: string | null,\n): Encoded {\n  const { rows, edges } = view.content;\n  const cells = view.kind === \"cells\";\n  const n = rows.numRows;\n  const xs = rows.getChild(X)?.toArray();\n  const ys = rows.getChild(Y)?.toArray();\n  const positions = new Float32Array(n * 2);\n  for (let i = 0; i < n; i++) {\n    positions[i * 2] = Number(xs?.[i] ?? Number.NaN);\n    positions[i * 2 + 1] = Number(ys?.[i] ?? Number.NaN);\n  }\n  const keys = numbers(rows.getChild(cells ? CELL_KEY : KEY)?.toArray(), n);\n\n  const categorical = cells ? (binding.category === modeColumn ? CELL_MODE : undefined) : binding.category;\n  const category = categorical === undefined ? undefined : rows.getChild(categorical)?.toArray();\n  let codes: Uint32Array | null = null;\n  if (category) {\n    codes = new Uint32Array(n);\n    for (let i = 0; i < n; i++) codes[i] = dictionary.code(category[i] ?? null);\n  }\n\n  const counts = cells ? numbers(rows.getChild(CELL_TALLY)?.toArray(), n) : new Float64Array(n).fill(1);\n  const ramp = cells ? (binding.size !== undefined ? counts : undefined) : binding.size;\n  const sizes =\n    ramp === undefined ? null : Float32Array.from(typeof ramp === \"string\" ? numbers(rows.getChild(ramp)?.toArray(), n) : ramp);\n\n  const named = !cells && binding.title !== undefined ? rows.getChild(binding.title)?.toArray() : undefined;\n  const titles = named ? Array.from({ length: n }, (_, i) => String(named[i] ?? \"\")) : null;\n\n  let total = 0;\n  for (const edge of edges) total += edge.src.length;\n  const links = new Float64Array(total * 2);\n  const weights = cells ? new Float32Array(total) : null;\n  let at = 0;\n  for (const edge of edges) {\n    for (let e = 0; e < edge.src.length; e++, at++) {\n      links[at * 2] = Number(edge.src[e]);\n      links[at * 2 + 1] = Number(edge.dst[e]);\n      if (weights) weights[at] = Number(edge.weight?.[e] ?? 1);\n    }\n  }\n\n  return { n, cells, positions, keys, codes, sizes, counts, titles, links, weights };\n}\n"],"names":["CELL_KEY","CELL_TALLY","CELL_MODE","KEY","PAYLOAD_ADDRESS","X","Y","PAYLOAD_COORDINATES","Dictionary","seed","__publicField","__privateAdd","_codes","_seeded","value","__privateSet","key","code","__privateGet","ranks","rest","i","a","b","compare","numbers","values","n","out","encode","view","binding","dictionary","modeColumn","rows","edges","cells","xs","_a","ys","_b","positions","keys","_c","categorical","category","_d","codes","counts","_e","ramp","sizes","_f","named","_g","titles","_","total","edge","links","weights","at","e","_h"],"mappings":";;;;;;;;AAQA,MAAMA,IAAW,WACXC,IAAa,SACbC,IAAY,QACZC,IAAMC,EAAgB,CAAC,GACvB,CAACC,GAAGC,CAAC,IAAIC;;AAOR,MAAMC,GAAW;AAAA,EAKtB,YAAYC,IAA2B,IAAI;AAJlC,IAAAC,EAAA,gBAAoB,CAAA;AACpB,IAAAC,EAAA,MAAAC,uBAAa,IAAA;AACb,IAAAD,EAAA,MAAAE;AAGP,eAAWC,KAASL,EAAM,MAAK,KAAKK,CAAK;AACzC,IAAAC,EAAA,MAAKF,GAAU,KAAK,OAAO;AAAA,EAC7B;AAAA,EAEA,KAAKC,GAAwB;AAC3B,UAAME,IAAM,OAAOF,KAAU,WAAW,OAAOA,CAAK,IAAIA;AACxD,QAAIG,IAAOC,EAAA,MAAKN,GAAO,IAAII,CAAG;AAC9B,WAAIC,MAAS,WACXA,IAAO,KAAK,OAAO,QACnB,KAAK,OAAO,KAAKD,CAAG,GACpBE,EAAA,MAAKN,GAAO,IAAII,GAAKC,CAAI,IAEpBA;AAAA,EACT;AAAA;AAAA,EAGA,QAAqB;AACnB,UAAME,IAAQ,IAAI,YAAY,KAAK,OAAO,MAAM;AAChD,aAASF,IAAO,GAAGA,IAAOC,EAAA,MAAKL,IAASI,IAAQ,CAAAE,EAAMF,CAAI,IAAIA;AAC9D,UAAMG,IAAO,KAAK,OAAO,MAAMF,EAAA,MAAKL,EAAO,EAAE,IAAI,CAACC,GAAOO,OAAO,EAAE,OAAAP,GAAO,MAAMI,EAAA,MAAKL,KAAUQ,IAAI;AAClG,WAAAD,EAAK,KAAK,CAACE,GAAGC,MAAMC,EAAQF,EAAE,OAAOC,EAAE,KAAK,CAAC,GAC7CH,EAAK,QAAQ,CAAC,EAAE,MAAAH,EAAA,GAAQI,MAAM;AAC5B,MAAAF,EAAMF,CAAI,IAAIC,EAAA,MAAKL,KAAUQ;AAAA,IAC/B,CAAC,GACMF;AAAA,EACT;AACF;AA9BWP,IAAA,eACAC,IAAA;AA+BX,SAASW,EAAQF,GAAYC,GAAoB;AAC/C,SAAI,OAAOD,KAAM,YAAY,OAAOC,KAAM,WAAiBD,IAAIC,IAC3D,OAAOD,KAAM,WAAiB,KAC9B,OAAOC,KAAM,WAAiB,IAC3B,OAAOD,KAAK,EAAE,EAAE,cAAc,OAAOC,KAAK,EAAE,CAAC;AACtD;AAuBA,MAAME,IAAU,CAACC,GAAwCC,MAA4B;AACnF,QAAMC,IAAM,IAAI,aAAaD,CAAC;AAC9B,MAAID,EAAQ,UAASL,IAAI,GAAGA,IAAIM,GAAGN,IAAK,CAAAO,EAAIP,CAAC,IAAI,OAAOK,EAAOL,CAAC,KAAK,OAAO,GAAG;AAC/E,SAAOO;AACT;AAOO,SAASC,GACdC,GACAC,GACAC,GACAC,GACS;;AACT,QAAM,EAAE,MAAAC,GAAM,OAAAC,EAAA,IAAUL,EAAK,SACvBM,IAAQN,EAAK,SAAS,SACtBH,IAAIO,EAAK,SACTG,KAAKC,IAAAJ,EAAK,SAAS7B,CAAC,MAAf,gBAAAiC,EAAkB,WACvBC,KAAKC,IAAAN,EAAK,SAAS5B,CAAC,MAAf,gBAAAkC,EAAkB,WACvBC,IAAY,IAAI,aAAad,IAAI,CAAC;AACxC,WAASN,IAAI,GAAGA,IAAIM,GAAGN;AACrB,IAAAoB,EAAUpB,IAAI,CAAC,IAAI,QAAOgB,KAAA,gBAAAA,EAAKhB,OAAM,OAAO,GAAG,GAC/CoB,EAAUpB,IAAI,IAAI,CAAC,IAAI,QAAOkB,KAAA,gBAAAA,EAAKlB,OAAM,OAAO,GAAG;AAErD,QAAMqB,IAAOjB,GAAQkB,IAAAT,EAAK,SAASE,IAAQpC,IAAWG,CAAG,MAApC,gBAAAwC,EAAuC,WAAWhB,CAAC,GAElEiB,IAAcR,IAASL,EAAQ,aAAaE,IAAa/B,IAAY,SAAa6B,EAAQ,UAC1Fc,IAAWD,MAAgB,WAAwBE,IAAAZ,EAAK,SAASU,CAAW,MAAzB,OAAZ,SAAYE,EAA4B;AACrF,MAAIC,IAA4B;AAChC,MAAIF,GAAU;AACZ,IAAAE,IAAQ,IAAI,YAAYpB,CAAC;AACzB,aAASN,IAAI,GAAGA,IAAIM,GAAGN,IAAK,CAAA0B,EAAM1B,CAAC,IAAIW,EAAW,KAAKa,EAASxB,CAAC,KAAK,IAAI;AAAA,EAC5E;AAEA,QAAM2B,IAASZ,IAAQX,GAAQwB,IAAAf,EAAK,SAASjC,CAAU,MAAxB,gBAAAgD,EAA2B,WAAWtB,CAAC,IAAI,IAAI,aAAaA,CAAC,EAAE,KAAK,CAAC,GAC9FuB,IAAOd,IAASL,EAAQ,SAAS,SAAYiB,IAAS,SAAajB,EAAQ,MAC3EoB,IACJD,MAAS,SAAY,OAAO,aAAa,KAAK,OAAOA,KAAS,WAAWzB,GAAQ2B,IAAAlB,EAAK,SAASgB,CAAI,MAAlB,gBAAAE,EAAqB,WAAWzB,CAAC,IAAIuB,CAAI,GAEtHG,IAAQ,CAACjB,KAASL,EAAQ,UAAU,UAAYuB,IAAApB,EAAK,SAASH,EAAQ,KAAK,MAA3B,gBAAAuB,EAA8B,YAAY,QAC1FC,IAASF,IAAQ,MAAM,KAAK,EAAE,QAAQ1B,EAAA,GAAK,CAAC6B,GAAGnC,MAAM,OAAOgC,EAAMhC,CAAC,KAAK,EAAE,CAAC,IAAI;AAErF,MAAIoC,IAAQ;AACZ,aAAWC,KAAQvB,EAAO,CAAAsB,KAASC,EAAK,IAAI;AAC5C,QAAMC,IAAQ,IAAI,aAAaF,IAAQ,CAAC,GAClCG,IAAUxB,IAAQ,IAAI,aAAaqB,CAAK,IAAI;AAClD,MAAII,IAAK;AACT,aAAWH,KAAQvB;AACjB,aAAS2B,IAAI,GAAGA,IAAIJ,EAAK,IAAI,QAAQI,KAAKD;AACxC,MAAAF,EAAME,IAAK,CAAC,IAAI,OAAOH,EAAK,IAAII,CAAC,CAAC,GAClCH,EAAME,IAAK,IAAI,CAAC,IAAI,OAAOH,EAAK,IAAII,CAAC,CAAC,GAClCF,QAAiBC,CAAE,IAAI,SAAOE,IAAAL,EAAK,WAAL,gBAAAK,EAAcD,OAAM,CAAC;AAI3D,SAAO,EAAE,GAAAnC,GAAG,OAAAS,GAAO,WAAAK,GAAW,MAAAC,GAAM,OAAAK,GAAO,OAAAI,GAAO,QAAAH,GAAQ,QAAAO,GAAQ,OAAAI,GAAO,SAAAC,EAAA;AAC3E;"}