@kanzo-tech/graph 0.24.0 → 0.26.0

package/dist/core/categories.d.ts

@@ -1,5 +1,5 @@
 import { Binding } from './channels';
-import { VertexTable } from '@fossil-lang/corpus';
+import { VertexTable } from './source';
 /**
  * **The categorical domain, fixed before the graph loads.** Colour by vertex type ranks the drawn
  * tables in the manifest's order; a column ranks by the keys of the host's `categories`. Only a value

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

@@ -1 +1 @@
-{"version":3,"file":"categories.d.ts","sourceRoot":"","sources":["../../src/core/categories.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEvD;;;;GAIG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,OAAO,EAAE,OAAO,EAChB,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,GACvD,SAAS,OAAO,EAAE,CAIpB;AAED,oEAAoE;AACpE,eAAO,MAAM,MAAM,GAAI,OAAO,OAAO,EAAE,YAAY,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,KAAG,MAC7C,CAAC;AAEtD;;;;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,2EAA2E;IAC3E,KAAK,IAAI,WAAW;CAUrB"}
+{"version":3,"file":"categories.d.ts","sourceRoot":"","sources":["../../src/core/categories.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAE5C;;;;GAIG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,OAAO,EAAE,OAAO,EAChB,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,GACvD,SAAS,OAAO,EAAE,CAIpB;AAED,oEAAoE;AACpE,eAAO,MAAM,MAAM,GAAI,OAAO,OAAO,EAAE,YAAY,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,KAAG,MAC7C,CAAC;AAEtD;;;;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,2EAA2E;IAC3E,KAAK,IAAI,WAAW;CAUrB"}

package/dist/core/categories.js.map

@@ -1 +1 @@
-{"version":3,"file":"categories.js","sources":["../../src/core/categories.ts"],"sourcesContent":["import type { Binding } from \"./channels\";\nimport type { VertexTable } from \"@fossil-lang/corpus\";\n\n/**\n * **The categorical domain, fixed before the graph loads.** Colour by vertex type ranks the drawn\n * tables in the manifest's order; a column ranks by the keys of the host's `categories`. Only a value\n * neither names is ranked as it is seen, after them.\n */\nexport function domainOf(\n  tables: readonly VertexTable[],\n  binding: Binding,\n  categories: Readonly<Record<string, string>> | undefined,\n): readonly unknown[] {\n  if (binding.byTable) return tables.map((table) => table.name);\n  if (binding.category === undefined) return [];\n  return categories ? Object.keys(categories) : [];\n}\n\n/** What a legend, a card or an inspector calls a category value. */\nexport const nameOf = (value: unknown, categories: Readonly<Record<string, string>> | undefined): string =>\n  categories?.[String(value)] ?? String(value ?? \"—\");\n\n/**\n * Values to codes, in the order first seen. **The seed ranks first, in its own order**, so a colour\n * is decided before a row arrives; a value outside it is ranked after the seed, numbers before\n * strings. Values meet by their text, so a column's `0` is the host's key `\"0\"`.\n */\nexport class Dictionary {\n  readonly values: unknown[] = [];\n  readonly #codes = new Map<string | null, 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 = value === null || value === undefined ? null : String(value);\n    let code = this.#codes.get(key);\n    if (code === undefined) {\n      code = this.values.length;\n      this.values.push(typeof value === \"bigint\" ? Number(value) : (value ?? null));\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. */\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"],"names":["domainOf","tables","binding","categories","table","nameOf","value","_codes","_seeded","Dictionary","seed","__publicField","__privateAdd","__privateSet","key","code","__privateGet","ranks","rest","a","b","compare"],"mappings":";;;;;;;AAQO,SAASA,EACdC,GACAC,GACAC,GACoB;AACpB,SAAID,EAAQ,UAAgBD,EAAO,IAAI,CAACG,MAAUA,EAAM,IAAI,IACxDF,EAAQ,aAAa,SAAkB,CAAA,IACpCC,IAAa,OAAO,KAAKA,CAAU,IAAI,CAAA;AAChD;AAGO,MAAME,IAAS,CAACC,GAAgBH,OACrCA,KAAA,gBAAAA,EAAa,OAAOG,CAAK,OAAM,OAAOA,KAAS,GAAG;AAZ7C,IAAAC,GAAAC;AAmBA,MAAMC,EAAW;AAAA,EAKtB,YAAYC,IAA2B,IAAI;AAJlC,IAAAC,EAAA,gBAAoB,CAAA;AACpB,IAAAC,EAAA,MAAAL,uBAAa,IAAA;AACb,IAAAK,EAAA,MAAAJ;AAGP,eAAWF,KAASI,EAAM,MAAK,KAAKJ,CAAK;AACzC,IAAAO,EAAA,MAAKL,GAAU,KAAK,OAAO;AAAA,EAC7B;AAAA,EAEA,KAAKF,GAAwB;AAC3B,UAAMQ,IAAMR,KAAU,OAA8B,OAAO,OAAOA,CAAK;AACvE,QAAIS,IAAOC,EAAA,MAAKT,GAAO,IAAIO,CAAG;AAC9B,WAAIC,MAAS,WACXA,IAAO,KAAK,OAAO,QACnB,KAAK,OAAO,KAAK,OAAOT,KAAU,WAAW,OAAOA,CAAK,IAAKA,KAAS,IAAK,GAC5EU,EAAA,MAAKT,GAAO,IAAIO,GAAKC,CAAI,IAEpBA;AAAA,EACT;AAAA;AAAA,EAGA,QAAqB;AACnB,UAAME,IAAQ,IAAI,YAAY,KAAK,OAAO,MAAM;AAChD,aAASF,IAAO,GAAGA,IAAOC,EAAA,MAAKR,IAASO,IAAQ,CAAAE,EAAMF,CAAI,IAAIA;AAC9D,UAAMG,IAAO,KAAK,OAAO,MAAMF,EAAA,MAAKR,EAAO,EAAE,IAAI,CAACF,GAAO,OAAO,EAAE,OAAAA,GAAO,MAAMU,EAAA,MAAKR,KAAU,IAAI;AAClG,WAAAU,EAAK,KAAK,CAACC,GAAGC,MAAMC,EAAQF,EAAE,OAAOC,EAAE,KAAK,CAAC,GAC7CF,EAAK,QAAQ,CAAC,EAAE,MAAAH,EAAA,GAAQ,MAAM;AAC5B,MAAAE,EAAMF,CAAI,IAAIC,EAAA,MAAKR,KAAU;AAAA,IAC/B,CAAC,GACMS;AAAA,EACT;AACF;AA9BWV,IAAA,eACAC,IAAA;AA+BX,SAASa,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;"}
+{"version":3,"file":"categories.js","sources":["../../src/core/categories.ts"],"sourcesContent":["import type { Binding } from \"./channels\";\nimport type { VertexTable } from \"./source\";\n\n/**\n * **The categorical domain, fixed before the graph loads.** Colour by vertex type ranks the drawn\n * tables in the manifest's order; a column ranks by the keys of the host's `categories`. Only a value\n * neither names is ranked as it is seen, after them.\n */\nexport function domainOf(\n  tables: readonly VertexTable[],\n  binding: Binding,\n  categories: Readonly<Record<string, string>> | undefined,\n): readonly unknown[] {\n  if (binding.byTable) return tables.map((table) => table.name);\n  if (binding.category === undefined) return [];\n  return categories ? Object.keys(categories) : [];\n}\n\n/** What a legend, a card or an inspector calls a category value. */\nexport const nameOf = (value: unknown, categories: Readonly<Record<string, string>> | undefined): string =>\n  categories?.[String(value)] ?? String(value ?? \"—\");\n\n/**\n * Values to codes, in the order first seen. **The seed ranks first, in its own order**, so a colour\n * is decided before a row arrives; a value outside it is ranked after the seed, numbers before\n * strings. Values meet by their text, so a column's `0` is the host's key `\"0\"`.\n */\nexport class Dictionary {\n  readonly values: unknown[] = [];\n  readonly #codes = new Map<string | null, 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 = value === null || value === undefined ? null : String(value);\n    let code = this.#codes.get(key);\n    if (code === undefined) {\n      code = this.values.length;\n      this.values.push(typeof value === \"bigint\" ? Number(value) : (value ?? null));\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. */\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"],"names":["domainOf","tables","binding","categories","table","nameOf","value","_codes","_seeded","Dictionary","seed","__publicField","__privateAdd","__privateSet","key","code","__privateGet","ranks","rest","a","b","compare"],"mappings":";;;;;;;AAQO,SAASA,EACdC,GACAC,GACAC,GACoB;AACpB,SAAID,EAAQ,UAAgBD,EAAO,IAAI,CAACG,MAAUA,EAAM,IAAI,IACxDF,EAAQ,aAAa,SAAkB,CAAA,IACpCC,IAAa,OAAO,KAAKA,CAAU,IAAI,CAAA;AAChD;AAGO,MAAME,IAAS,CAACC,GAAgBH,OACrCA,KAAA,gBAAAA,EAAa,OAAOG,CAAK,OAAM,OAAOA,KAAS,GAAG;AAZ7C,IAAAC,GAAAC;AAmBA,MAAMC,EAAW;AAAA,EAKtB,YAAYC,IAA2B,IAAI;AAJlC,IAAAC,EAAA,gBAAoB,CAAA;AACpB,IAAAC,EAAA,MAAAL,uBAAa,IAAA;AACb,IAAAK,EAAA,MAAAJ;AAGP,eAAWF,KAASI,EAAM,MAAK,KAAKJ,CAAK;AACzC,IAAAO,EAAA,MAAKL,GAAU,KAAK,OAAO;AAAA,EAC7B;AAAA,EAEA,KAAKF,GAAwB;AAC3B,UAAMQ,IAAMR,KAAU,OAA8B,OAAO,OAAOA,CAAK;AACvE,QAAIS,IAAOC,EAAA,MAAKT,GAAO,IAAIO,CAAG;AAC9B,WAAIC,MAAS,WACXA,IAAO,KAAK,OAAO,QACnB,KAAK,OAAO,KAAK,OAAOT,KAAU,WAAW,OAAOA,CAAK,IAAKA,KAAS,IAAK,GAC5EU,EAAA,MAAKT,GAAO,IAAIO,GAAKC,CAAI,IAEpBA;AAAA,EACT;AAAA;AAAA,EAGA,QAAqB;AACnB,UAAME,IAAQ,IAAI,YAAY,KAAK,OAAO,MAAM;AAChD,aAASF,IAAO,GAAGA,IAAOC,EAAA,MAAKR,IAASO,IAAQ,CAAAE,EAAMF,CAAI,IAAIA;AAC9D,UAAMG,IAAO,KAAK,OAAO,MAAMF,EAAA,MAAKR,EAAO,EAAE,IAAI,CAACF,GAAO,OAAO,EAAE,OAAAA,GAAO,MAAMU,EAAA,MAAKR,KAAU,IAAI;AAClG,WAAAU,EAAK,KAAK,CAACC,GAAGC,MAAMC,EAAQF,EAAE,OAAOC,EAAE,KAAK,CAAC,GAC7CF,EAAK,QAAQ,CAAC,EAAE,MAAAH,EAAA,GAAQ,MAAM;AAC5B,MAAAE,EAAMF,CAAI,IAAIC,EAAA,MAAKR,KAAU;AAAA,IAC/B,CAAC,GACMS;AAAA,EACT;AACF;AA9BWV,IAAA,eACAC,IAAA;AA+BX,SAASa,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;"}

package/dist/core/channels.d.ts

@@ -13,10 +13,18 @@ export interface Channels {
     symbol?: string;
     /** What tints a link. Absent, a link takes the colour of the vertex it leaves. */
     stroke?: string;
+    /**
+     * Two numeric columns a point is drawn at — `lon` and `lat` draw a map. Both bound, the data
+     * places the points and nothing simulates; unbound, the layout does, on the GPU.
+     */
+    x?: string;
+    y?: string;
+    /** Which column a running layout pulls points together by — cosmos.gl's cluster force. */
+    cluster?: string;
 }
 /** Narrow on purpose — `var(…)`, a hex, a colour function — so a bare word is always a column. */
 export declare function isColour(value: string | undefined): value is string;
-/** The columns a binding reads, which is what a scan projects. */
+/** The columns a binding reads. */
 export interface Binding {
     /** The one categorical column: `fill` when it names one, `symbol` when `fill` is a constant or absent. */
     readonly category: string | undefined;
@@ -26,14 +34,12 @@ export interface Binding {
     readonly size: string | undefined;
     /** The text a label and the hover card show — Plot's `title`. */
     readonly title: string | undefined;
+    readonly x: string | undefined;
+    readonly y: string | undefined;
+    readonly cluster: string | undefined;
 }
 export declare function bindingOf(options: Channels & {
     r?: string;
     title?: string;
 }): Binding;
-/**
- * A binding is a projection: `fill` and `r` as columns become the scan's `select`, where the table
- * has them. `title` is not: a label's text is read for the few vertices that carry one.
- */
-export declare function projectionOf(binding: Binding, fixed: readonly string[], has: (column: string) => boolean): string[];
 //# sourceMappingURL=channels.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"channels.d.ts","sourceRoot":"","sources":["../../src/core/channels.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,0GAA0G;IAC1G,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,kFAAkF;IAClF,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,kGAAkG;AAClG,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,IAAI,MAAM,CAEnE;AAED,kEAAkE;AAClE,MAAM,WAAW,OAAO;IACtB,0GAA0G;IAC1G,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IACtC,kEAAkE;IAClE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,iEAAiE;IACjE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;CACpC;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,QAAQ,GAAG;IAAE,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAIrF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,GAAG,MAAM,EAAE,CAGnH"}
+{"version":3,"file":"channels.d.ts","sourceRoot":"","sources":["../../src/core/channels.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,WAAW,QAAQ;IACvB,0GAA0G;IAC1G,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,kFAAkF;IAClF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;OAGG;IACH,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,0FAA0F;IAC1F,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,kGAAkG;AAClG,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,IAAI,MAAM,CAEnE;AAED,mCAAmC;AACnC,MAAM,WAAW,OAAO;IACtB,0GAA0G;IAC1G,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IACtC,kEAAkE;IAClE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,iEAAiE;IACjE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CACtC;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,QAAQ,GAAG;IAAE,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAYrF"}

package/dist/core/channels.js

@@ -1,17 +1,20 @@
-function c(t) {
-  return t !== void 0 && /^(var\(|#|rgb|hsl|oklch|oklab|lab|lch|color\()/i.test(t);
+function e(l) {
+  return l !== void 0 && /^(var\(|#|rgb|hsl|oklch|oklab|lab|lch|color\()/i.test(l);
 }
-function n(t) {
-  const l = c(t.fill), r = l ? t.symbol : t.fill ?? t.symbol;
-  return { category: r, byTable: !l && r === void 0, size: t.r, title: t.title };
-}
-function i(t, l, r) {
-  const o = [t.category, t.size].filter((e) => e !== void 0 && r(e));
-  return [.../* @__PURE__ */ new Set([...l, ...o])];
+function t(l) {
+  const r = e(l.fill), c = r ? l.symbol : l.fill ?? l.symbol;
+  return {
+    category: c,
+    byTable: !r && c === void 0,
+    size: l.r,
+    title: l.title,
+    x: l.x,
+    y: l.y,
+    cluster: l.cluster
+  };
 }
 export {
-  n as bindingOf,
-  c as isColour,
-  i as projectionOf
+  t as bindingOf,
+  e as isColour
 };
 //# sourceMappingURL=channels.js.map

package/dist/core/channels.js.map

@@ -1 +1 @@
-{"version":3,"file":"channels.js","sources":["../../src/core/channels.ts"],"sourcesContent":["/**\n * What each channel is bound to — Plot's names, and Plot's rule that **a CSS colour is a constant\n * and anything else is a column.** `fill=\"kind\"` spends colour on a category; `fill=\"var(--foreground)\"`\n * paints every point one ink and leaves colour free to mean the selection.\n */\nexport interface Channels {\n  /** Which column colours a point, or a CSS colour every point wears. Absent, colour is the vertex type. */\n  fill?: string;\n  /**\n   * Which column a point's shape carries. The graph holds one categorical column, so bound beside a\n   * `fill` column this reads the same one; a second would need a second array everywhere.\n   */\n  symbol?: string;\n  /** What tints a link. Absent, a link takes the colour of the vertex it leaves. */\n  stroke?: string;\n}\n\n/** Narrow on purpose — `var(…)`, a hex, a colour function — so a bare word is always a column. */\nexport function isColour(value: string | undefined): value is string {\n  return value !== undefined && /^(var\\(|#|rgb|hsl|oklch|oklab|lab|lch|color\\()/i.test(value);\n}\n\n/** The columns a binding reads, which is what a scan projects. */\nexport interface Binding {\n  /** The one categorical column: `fill` when it names one, `symbol` when `fill` is a constant or absent. */\n  readonly category: string | undefined;\n  /** No column and no constant: the category is the vertex type. */\n  readonly byTable: boolean;\n  /** What the size ramp is spent on — Plot's `r`. */\n  readonly size: string | undefined;\n  /** The text a label and the hover card show — Plot's `title`. */\n  readonly title: string | undefined;\n}\n\nexport function bindingOf(options: Channels & { r?: string; title?: string }): Binding {\n  const constant = isColour(options.fill);\n  const category = constant ? options.symbol : (options.fill ?? options.symbol);\n  return { category, byTable: !constant && category === undefined, size: options.r, title: options.title };\n}\n\n/**\n * A binding is a projection: `fill` and `r` as columns become the scan's `select`, where the table\n * has them. `title` is not: a label's text is read for the few vertices that carry one.\n */\nexport function projectionOf(binding: Binding, fixed: readonly string[], has: (column: string) => boolean): string[] {\n  const bound = [binding.category, binding.size].filter((c): c is string => c !== undefined && has(c));\n  return [...new Set([...fixed, ...bound])];\n}\n"],"names":["isColour","value","bindingOf","options","constant","category","projectionOf","binding","fixed","has","bound","c"],"mappings":"AAkBO,SAASA,EAASC,GAA4C;AACnE,SAAOA,MAAU,UAAa,kDAAkD,KAAKA,CAAK;AAC5F;AAcO,SAASC,EAAUC,GAA6D;AACrF,QAAMC,IAAWJ,EAASG,EAAQ,IAAI,GAChCE,IAAWD,IAAWD,EAAQ,SAAUA,EAAQ,QAAQA,EAAQ;AACtE,SAAO,EAAE,UAAAE,GAAU,SAAS,CAACD,KAAYC,MAAa,QAAW,MAAMF,EAAQ,GAAG,OAAOA,EAAQ,MAAA;AACnG;AAMO,SAASG,EAAaC,GAAkBC,GAA0BC,GAA4C;AACnH,QAAMC,IAAQ,CAACH,EAAQ,UAAUA,EAAQ,IAAI,EAAE,OAAO,CAACI,MAAmBA,MAAM,UAAaF,EAAIE,CAAC,CAAC;AACnG,SAAO,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAGH,GAAO,GAAGE,CAAK,CAAC,CAAC;AAC1C;"}
+{"version":3,"file":"channels.js","sources":["../../src/core/channels.ts"],"sourcesContent":["/**\n * What each channel is bound to — Plot's names, and Plot's rule that **a CSS colour is a constant\n * and anything else is a column.** `fill=\"kind\"` spends colour on a category; `fill=\"var(--foreground)\"`\n * paints every point one ink and leaves colour free to mean the selection.\n */\nexport interface Channels {\n  /** Which column colours a point, or a CSS colour every point wears. Absent, colour is the vertex type. */\n  fill?: string;\n  /**\n   * Which column a point's shape carries. The graph holds one categorical column, so bound beside a\n   * `fill` column this reads the same one; a second would need a second array everywhere.\n   */\n  symbol?: string;\n  /** What tints a link. Absent, a link takes the colour of the vertex it leaves. */\n  stroke?: string;\n  /**\n   * Two numeric columns a point is drawn at — `lon` and `lat` draw a map. Both bound, the data\n   * places the points and nothing simulates; unbound, the layout does, on the GPU.\n   */\n  x?: string;\n  y?: string;\n  /** Which column a running layout pulls points together by — cosmos.gl's cluster force. */\n  cluster?: string;\n}\n\n/** Narrow on purpose — `var(…)`, a hex, a colour function — so a bare word is always a column. */\nexport function isColour(value: string | undefined): value is string {\n  return value !== undefined && /^(var\\(|#|rgb|hsl|oklch|oklab|lab|lch|color\\()/i.test(value);\n}\n\n/** The columns a binding reads. */\nexport interface Binding {\n  /** The one categorical column: `fill` when it names one, `symbol` when `fill` is a constant or absent. */\n  readonly category: string | undefined;\n  /** No column and no constant: the category is the vertex type. */\n  readonly byTable: boolean;\n  /** What the size ramp is spent on — Plot's `r`. */\n  readonly size: string | undefined;\n  /** The text a label and the hover card show — Plot's `title`. */\n  readonly title: string | undefined;\n  readonly x: string | undefined;\n  readonly y: string | undefined;\n  readonly cluster: string | undefined;\n}\n\nexport function bindingOf(options: Channels & { r?: string; title?: string }): Binding {\n  const constant = isColour(options.fill);\n  const category = constant ? options.symbol : (options.fill ?? options.symbol);\n  return {\n    category,\n    byTable: !constant && category === undefined,\n    size: options.r,\n    title: options.title,\n    x: options.x,\n    y: options.y,\n    cluster: options.cluster,\n  };\n}\n"],"names":["isColour","value","bindingOf","options","constant","category"],"mappings":"AA0BO,SAASA,EAASC,GAA4C;AACnE,SAAOA,MAAU,UAAa,kDAAkD,KAAKA,CAAK;AAC5F;AAiBO,SAASC,EAAUC,GAA6D;AACrF,QAAMC,IAAWJ,EAASG,EAAQ,IAAI,GAChCE,IAAWD,IAAWD,EAAQ,SAAUA,EAAQ,QAAQA,EAAQ;AACtE,SAAO;AAAA,IACL,UAAAE;AAAA,IACA,SAAS,CAACD,KAAYC,MAAa;AAAA,IACnC,MAAMF,EAAQ;AAAA,IACd,OAAOA,EAAQ;AAAA,IACf,GAAGA,EAAQ;AAAA,IACX,GAAGA,EAAQ;AAAA,IACX,SAASA,EAAQ;AAAA,EAAA;AAErB;"}

package/dist/core/client.d.ts

@@ -0,0 +1,26 @@
+import { MosaicClient, FilterExpr, Selection } from '@kanzo-tech/mosaic';
+import { Structure } from './source';
+export declare class GraphClient extends MosaicClient {
+    #private;
+    constructor(filterBy: Selection | undefined, structure: () => Structure | null, kept: (ids: Float64Array | null) => void, fail: (error: unknown) => void);
+    /**
+     * Not stable: the answer is a set of ids, not a group-by a pre-aggregate could stand in for. And
+     * Mosaic's pre-aggregator calls `query()` with no filter to analyse a client — false keeps it away.
+     */
+    get filterStable(): boolean;
+    /**
+     * The surviving ids — or, with nothing to filter by, {@link UNFILTERED}: one row whose id is
+     * `NULL`, which no `dense_id` is. The answer says which it is, so two statements in flight can
+     * never be read as each other's.
+     */
+    query(filter?: FilterExpr | null): string;
+    queryResult(data: unknown): this;
+    queryError(error: Error): this;
+}
+/**
+ * **The reader's pick, published** — from the graph, so the crossfilter applies it to every chart and
+ * skips it for the graph. A canvas that greyed out everything but a lasso of thirteen would hide the
+ * neighbourhood the reader was looking at.
+ */
+export declare function publish(selection: Selection, self: MosaicClient, ids: readonly number[] | null): void;
+//# sourceMappingURL=client.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../src/core/client.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAgC,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEjH,OAAO,EAAgC,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AAYxE,qBAAa,WAAY,SAAQ,YAAY;;gBAMzC,QAAQ,EAAE,SAAS,GAAG,SAAS,EAC/B,SAAS,EAAE,MAAM,SAAS,GAAG,IAAI,EACjC,IAAI,EAAE,CAAC,GAAG,EAAE,YAAY,GAAG,IAAI,KAAK,IAAI,EACxC,IAAI,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI;IAQhC;;;OAGG;IACH,IAAa,YAAY,IAAI,OAAO,CAEnC;IAED;;;;OAIG;IACM,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,GAAG,IAAI,GAAG,MAAM;IAwBzC,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI;IAMhC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;CAIxC;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,GAAG,IAAI,CAOrG"}

package/dist/core/client.js

@@ -0,0 +1,62 @@
+var f = (t) => {
+  throw TypeError(t);
+};
+var L = (t, r, e) => r.has(t) || f("Cannot " + e);
+var u = (t, r, e) => (L(t, r, "read from private field"), e ? e.call(t) : r.get(t)), h = (t, r, e) => r.has(t) ? f("Cannot add the same private member more than once") : r instanceof WeakSet ? r.add(t) : r.set(t, e), m = (t, r, e, n) => (L(t, r, "write to private field"), n ? n.call(t, e) : r.set(t, e), e);
+import { MosaicClient as g, collectColumns as A, clausePoints as v } from "@kanzo-tech/mosaic";
+import { GraphError as C } from "./error.js";
+import { relation as $, ident as y } from "./source.js";
+const S = "SELECT NULL::DOUBLE AS id";
+var a, c, l;
+class N extends g {
+  constructor(e, n, i, d) {
+    super(e);
+    h(this, a);
+    h(this, c);
+    h(this, l);
+    m(this, a, n), m(this, c, i), m(this, l, d);
+  }
+  /**
+   * Not stable: the answer is a set of ids, not a group-by a pre-aggregate could stand in for. And
+   * Mosaic's pre-aggregator calls `query()` with no filter to analyse a client — false keeps it away.
+   */
+  get filterStable() {
+    return !1;
+  }
+  /**
+   * The surviving ids — or, with nothing to filter by, {@link UNFILTERED}: one row whose id is
+   * `NULL`, which no `dense_id` is. The answer says which it is, so two statements in flight can
+   * never be read as each other's.
+   */
+  query(e) {
+    const n = (Array.isArray(e) ? e : [e]).filter((s) => s != null), i = u(this, a).call(this);
+    if (!i || n.length === 0) return S;
+    const d = n.map((s) => `(${String(s)})`).join(" AND "), p = [...new Set(n.flatMap((s) => A(s).map((o) => o.column)))], E = i.vertices.filter((s) => p.every((o) => s.columns.has(o)));
+    return E.length === 0 ? (u(this, l).call(this, new C("graph/unfilterable", `no vertex type has every column this clause names: ${p.join(", ")}`)), S) : i.vertices.map((s) => {
+      const o = $(i.from, s.name);
+      return E.includes(s) ? `SELECT ${y("dense_id")}::DOUBLE AS id FROM ${o} WHERE ${d}` : `SELECT ${y("dense_id")}::DOUBLE AS id FROM ${o}`;
+    }).join(" UNION ALL ");
+  }
+  queryResult(e) {
+    var i;
+    const n = ((i = e.getChild("id")) == null ? void 0 : i.toArray()) ?? [];
+    return u(this, c).call(this, n.length === 1 && n[0] === null ? null : Float64Array.from(n)), this;
+  }
+  queryError(e) {
+    return u(this, l).call(this, e), this;
+  }
+}
+a = new WeakMap(), c = new WeakMap(), l = new WeakMap();
+function R(t, r, e) {
+  t.update(
+    v(["dense_id"], e && e.length > 0 ? e.map((n) => [n]) : void 0, {
+      source: r,
+      clients: /* @__PURE__ */ new Set([r])
+    })
+  );
+}
+export {
+  N as GraphClient,
+  R as publish
+};
+//# sourceMappingURL=client.js.map

package/dist/core/client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.js","sources":["../../src/core/client.ts"],"sourcesContent":["import { MosaicClient, clausePoints, collectColumns, type FilterExpr, type Selection } from \"@kanzo-tech/mosaic\";\nimport { GraphError } from \"./error\";\nimport { ident, relation, type Answer, type Structure } from \"./source\";\n\n/**\n * **The graph as a client of the page's coordinator** — one Mosaic client, like every chart beside\n * it. The coordinator hands it the crossfilter's predicate, minus the clause the graph published\n * itself; it answers with the `dense_id`s that survive, and the canvas greys out the rest on the GPU.\n * No predicate is translated, no position is uploaded again, and the query runs on the coordinator's\n * one connection, through its cache — Cosmograph's crossfilter, on our stack.\n */\n/** The answer that clears the filter. */\nconst UNFILTERED = \"SELECT NULL::DOUBLE AS id\";\n\nexport class GraphClient extends MosaicClient {\n  #structure: () => Structure | null;\n  #kept: (ids: Float64Array | null) => void;\n  #fail: (error: unknown) => void;\n\n  constructor(\n    filterBy: Selection | undefined,\n    structure: () => Structure | null,\n    kept: (ids: Float64Array | null) => void,\n    fail: (error: unknown) => void,\n  ) {\n    super(filterBy);\n    this.#structure = structure;\n    this.#kept = kept;\n    this.#fail = fail;\n  }\n\n  /**\n   * Not stable: the answer is a set of ids, not a group-by a pre-aggregate could stand in for. And\n   * Mosaic's pre-aggregator calls `query()` with no filter to analyse a client — false keeps it away.\n   */\n  override get filterStable(): boolean {\n    return false;\n  }\n\n  /**\n   * The surviving ids — or, with nothing to filter by, {@link UNFILTERED}: one row whose id is\n   * `NULL`, which no `dense_id` is. The answer says which it is, so two statements in flight can\n   * never be read as each other's.\n   */\n  override query(filter?: FilterExpr | null): string {\n    const clauses = (Array.isArray(filter) ? filter : [filter]).filter((c) => c !== undefined && c !== null);\n    const structure = this.#structure();\n    if (!structure || clauses.length === 0) return UNFILTERED;\n    const where = clauses.map((c) => `(${String(c)})`).join(\" AND \");\n    const named = [...new Set(clauses.flatMap((c) => collectColumns(c as never).map((ref: { column: string }) => ref.column)))];\n    // A table that lacks a column the predicate names is not filtered by it — what a `WHERE` over a\n    // union of the tables would do. A predicate no table can answer is refused rather than ignored,\n    // so the unfiltered picture is never drawn as the filtered one.\n    const answering = structure.vertices.filter((t) => named.every((c) => t.columns.has(c)));\n    if (answering.length === 0) {\n      this.#fail(new GraphError(\"graph/unfilterable\", `no vertex type has every column this clause names: ${named.join(\", \")}`));\n      return UNFILTERED;\n    }\n    return structure.vertices\n      .map((t) => {\n        const from = relation(structure.from, t.name);\n        return answering.includes(t)\n          ? `SELECT ${ident(\"dense_id\")}::DOUBLE AS id FROM ${from} WHERE ${where}`\n          : `SELECT ${ident(\"dense_id\")}::DOUBLE AS id FROM ${from}`;\n      })\n      .join(\" UNION ALL \");\n  }\n\n  override queryResult(data: unknown): this {\n    const ids = ((data as Answer).getChild(\"id\")?.toArray() ?? []) as ArrayLike<number | null>;\n    this.#kept(ids.length === 1 && ids[0] === null ? null : Float64Array.from(ids as ArrayLike<number>));\n    return this;\n  }\n\n  override queryError(error: Error): this {\n    this.#fail(error);\n    return this;\n  }\n}\n\n/**\n * **The reader's pick, published** — from the graph, so the crossfilter applies it to every chart and\n * skips it for the graph. A canvas that greyed out everything but a lasso of thirteen would hide the\n * neighbourhood the reader was looking at.\n */\nexport function publish(selection: Selection, self: MosaicClient, ids: readonly number[] | null): void {\n  selection.update(\n    clausePoints([\"dense_id\"], ids && ids.length > 0 ? ids.map((d) => [d]) : undefined, {\n      source: self,\n      clients: new Set([self]),\n    }),\n  );\n}\n"],"names":["UNFILTERED","GraphClient","MosaicClient","filterBy","structure","kept","fail","__privateAdd","_structure","_kept","_fail","__privateSet","filter","clauses","c","__privateGet","where","named","collectColumns","ref","answering","t","GraphError","from","relation","ident","data","ids","_a","error","publish","selection","self","clausePoints","d"],"mappings":";;;;;;;;AAYA,MAAMA,IAAa;;AAEZ,MAAMC,UAAoBC,EAAa;AAAA,EAK5C,YACEC,GACAC,GACAC,GACAC,GACA;AACA,UAAMH,CAAQ;AAVhB,IAAAI,EAAA,MAAAC;AACA,IAAAD,EAAA,MAAAE;AACA,IAAAF,EAAA,MAAAG;AASE,IAAAC,EAAA,MAAKH,GAAaJ,IAClBO,EAAA,MAAKF,GAAQJ,IACbM,EAAA,MAAKD,GAAQJ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAa,eAAwB;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOS,MAAMM,GAAoC;AACjD,UAAMC,KAAW,MAAM,QAAQD,CAAM,IAAIA,IAAS,CAACA,CAAM,GAAG,OAAO,CAACE,MAAyBA,KAAM,IAAI,GACjGV,IAAYW,EAAA,MAAKP,GAAL;AAClB,QAAI,CAACJ,KAAaS,EAAQ,WAAW,EAAG,QAAOb;AAC/C,UAAMgB,IAAQH,EAAQ,IAAI,CAACC,MAAM,IAAI,OAAOA,CAAC,CAAC,GAAG,EAAE,KAAK,OAAO,GACzDG,IAAQ,CAAC,GAAG,IAAI,IAAIJ,EAAQ,QAAQ,CAACC,MAAMI,EAAeJ,CAAU,EAAE,IAAI,CAACK,MAA4BA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIpHC,IAAYhB,EAAU,SAAS,OAAO,CAACiB,MAAMJ,EAAM,MAAM,CAACH,MAAMO,EAAE,QAAQ,IAAIP,CAAC,CAAC,CAAC;AACvF,WAAIM,EAAU,WAAW,KACvBL,EAAA,MAAKL,GAAL,WAAW,IAAIY,EAAW,sBAAsB,sDAAsDL,EAAM,KAAK,IAAI,CAAC,EAAE,IACjHjB,KAEFI,EAAU,SACd,IAAI,CAACiB,MAAM;AACV,YAAME,IAAOC,EAASpB,EAAU,MAAMiB,EAAE,IAAI;AAC5C,aAAOD,EAAU,SAASC,CAAC,IACvB,UAAUI,EAAM,UAAU,CAAC,uBAAuBF,CAAI,UAAUP,CAAK,KACrE,UAAUS,EAAM,UAAU,CAAC,uBAAuBF,CAAI;AAAA,IAC5D,CAAC,EACA,KAAK,aAAa;AAAA,EACvB;AAAA,EAES,YAAYG,GAAqB;;AACxC,UAAMC,MAAQC,IAAAF,EAAgB,SAAS,IAAI,MAA7B,gBAAAE,EAAgC,cAAa,CAAA;AAC3D,WAAAb,EAAA,MAAKN,GAAL,WAAWkB,EAAI,WAAW,KAAKA,EAAI,CAAC,MAAM,OAAO,OAAO,aAAa,KAAKA,CAAwB,IAC3F;AAAA,EACT;AAAA,EAES,WAAWE,GAAoB;AACtC,WAAAd,EAAA,MAAKL,GAAL,WAAWmB,IACJ;AAAA,EACT;AACF;AA/DErB,IAAA,eACAC,IAAA,eACAC,IAAA;AAoEK,SAASoB,EAAQC,GAAsBC,GAAoBL,GAAqC;AACrG,EAAAI,EAAU;AAAA,IACRE,EAAa,CAAC,UAAU,GAAGN,KAAOA,EAAI,SAAS,IAAIA,EAAI,IAAI,CAACO,MAAM,CAACA,CAAC,CAAC,IAAI,QAAW;AAAA,MAClF,QAAQF;AAAA,MACR,SAAS,oBAAI,IAAI,CAACA,CAAI,CAAC;AAAA,IAAA,CACxB;AAAA,EAAA;AAEL;"}

package/dist/core/error.d.ts

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

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

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

package/dist/core/error.js.map

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

package/dist/core/load.d.ts

@@ -1,63 +1,54 @@
+import { Coordinator } from '@kanzo-tech/mosaic';
 import { Binding } from './channels';
-import { Corpus, Filter, VertexTable } from '@fossil-lang/corpus';
+import { Structure } from './source';
 /**
- * **The whole graph, read once and laid out as cosmos.gl's buffers.** A drawn vertex's `dense_id` is
- * its index, so every array is sized from the manifest's `record_count`s before a row arrives, and a
- * row is written where its id says. The camera never reaches here: nothing is read because it moved.
+ * **The whole graph, read once and laid out as cosmos.gl's buffers.** A vertex's `dense_id` is its
+ * index, and a vertex table is one contiguous range of them, so each table's answer is written into
+ * its own slice and nothing is resolved row by row.
  */
-/** Where the drawn vertices are and how they connect — read once per corpus. */
+/** Where the vertices start and how they connect — read once per corpus and per position binding. */
 export interface Geometry {
-    /** The vertex tables with a position, in the manifest's order. */
-    readonly tables: readonly VertexTable[];
-    /** Drawn vertices: ids `0 … size − 1`. */
+    readonly structure: Structure;
+    /** Every vertex: ids `0 … size − 1`. */
     readonly size: number;
-    /** `[x, y, …]` by id; `NaN` where no row has a position. */
+    /**
+     * `[x, y, …]` by id. With `x` and `y` bound, the columns' values — `NaN` where a table lacks them,
+     * which cosmos.gl does not draw. Unbound, a seeded start for the layout, inside `space`.
+     */
     readonly positions: Float32Array;
-    /** By id, the vertex's index in `tables`. */
-    readonly table: Uint16Array;
-    /** `[src, dst, …]` by id, every relation whose two ends are drawn. */
+    /** Whether the positions are the data's (`x`/`y` bound) or a start for the layout to move. */
+    readonly bound: boolean;
+    /** `[src, dst, …]` by id, every relation. */
     readonly links: Float32Array;
+    /** Bound positions' extent; `null` for a layout's start, whose square is `space`. */
     readonly extent: {
         readonly x: number;
         readonly y: number;
         readonly w: number;
         readonly h: number;
     } | null;
+    /** The side of the square the layout runs in. */
+    readonly space: number;
 }
 /** What the bound channels say about each vertex — read again when a binding changes. */
 export interface Encoding {
     /** By id, the category's rank. */
     readonly ranks: Uint32Array;
-    /** By id, the ramp's raw value, or `null` when `r` is unbound. */
-    readonly sizes: Float32Array | null;
+    /** By id, the size ramp's raw value: the bound `r` column, or the vertex's degree. */
+    readonly sizes: Float32Array;
+    /** By id, the cluster a layout pulls the vertex toward, or `null` when `cluster` is unbound. */
+    readonly clusters: (number | undefined)[] | null;
     /** What each rank is: the seed, then the other values seen, in rank order. */
     readonly domain: readonly unknown[];
 }
-/** The vertex tables fossil lays out or the program places; a table without a position is not drawn. */
-export declare const drawnTables: (corpus: Corpus) => VertexTable[];
 /**
- * Reads in parallel that end together: the first to fail aborts the rest, so no read outlives the
- * answer and no second failure goes unheard behind the first.
+ * The layout's square: cosmos.gl's own 4,096 up to 200,000 vertices, and twice that past them —
+ * measured on the gate in `/docs/graph/layout`: at 500,000 the default square presses the layout
+ * against its border and the communities mix.
  */
-export declare function together<T>(signal: AbortSignal, reads: (signal: AbortSignal) => Promise<T>): Promise<T>;
-/** One scan per drawn table and one per relation between them, read whole, in parallel. */
-export declare function loadGraph(corpus: Corpus, binding: Binding, seed: readonly unknown[], signal: AbortSignal): Promise<{
-    geometry: Geometry;
-    encoding: Encoding;
-}>;
-/** A new binding re-reads the channels and nothing else: the positions and the links stay uploaded. */
-export declare function loadEncoding(corpus: Corpus, geometry: Geometry, binding: Binding, seed: readonly unknown[], signal: AbortSignal): Promise<Encoding>;
-/** What a filter kept: per table that holds every column it names, the surviving ids. */
-export interface Kept {
-    readonly filtered: ReadonlySet<number>;
-    readonly ids: readonly number[];
-}
-/**
- * **A predicate, applied as a mask.** A table that lacks a column the filter names is not filtered,
- * which is what a `WHERE` over a union of the tables would do; a filter no drawn table can answer at
- * all is refused, so the unfiltered picture is never drawn as the filtered one.
- */
-export declare function readKept(corpus: Corpus, tables: readonly VertexTable[], filter: Filter, signal: AbortSignal): Promise<Kept>;
-/** `1` where a vertex survives the page's filter. */
-export declare function maskOf(geometry: Geometry, kept: Kept): Uint8Array;
+export declare const spaceFor: (size: number) => number;
+/** The links, and the positions: two bound columns, or a seeded start for the layout. */
+export declare function loadGeometry(coordinator: Coordinator, structure: Structure, binding: Binding): Promise<Geometry>;
+/** The bound channels — category, size and cluster — over every vertex. */
+export declare function loadEncoding(coordinator: Coordinator, geometry: Geometry, binding: Binding, seed: readonly unknown[]): Promise<Encoding>;
 //# sourceMappingURL=load.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/core/load.ts"],"names":[],"mappings":"AAEA,OAAO,EAAgB,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,KAAK,EAAS,MAAM,EAAa,MAAM,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAGzF;;;;GAIG;AAEH,gFAAgF;AAChF,MAAM,WAAW,QAAQ;IACvB,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,0CAA0C;IAC1C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CAC5G;AAED,yFAAyF;AACzF,MAAM,WAAW,QAAQ;IACvB,kCAAkC;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAC;IACpC,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;CACrC;AAED,wGAAwG;AACxG,eAAO,MAAM,WAAW,GAAI,QAAQ,MAAM,KAAG,WAAW,EAAqE,CAAC;AAI9H;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAMvG;AA8ED,2FAA2F;AAC3F,wBAAsB,SAAS,CAC7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC;IAAE,QAAQ,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,CAAC,CAkCrD;AAED,uGAAuG;AACvG,wBAAsB,YAAY,CAChC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,EACxB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,QAAQ,CAAC,CAUnB;AAED,yFAAyF;AACzF,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;CACjC;AAED;;;;GAIG;AACH,wBAAsB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAoBjI;AAED,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,UAAU,CAKjE"}
+{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/core/load.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEtD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAC1C,OAAO,EAA0B,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AAElE;;;;GAIG;AAEH,qGAAqG;AACrG,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAC9B,wCAAwC;IACxC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;OAGG;IACH,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,8FAA8F;IAC9F,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,qFAAqF;IACrF,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC3G,iDAAiD;IACjD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,yFAAyF;AACzF,MAAM,WAAW,QAAQ;IACvB,kCAAkC;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,sFAAsF;IACtF,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,gGAAgG;IAChG,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC;IACjD,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;CACrC;AAED;;;;GAIG;AACH,eAAO,MAAM,QAAQ,GAAI,MAAM,MAAM,KAAG,MAAwC,CAAC;AA8CjF,yFAAyF;AACzF,wBAAsB,YAAY,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAoBtH;AAYD,2EAA2E;AAC3E,wBAAsB,YAAY,CAChC,WAAW,EAAE,WAAW,EACxB,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,SAAS,OAAO,EAAE,GACvB,OAAO,CAAC,QAAQ,CAAC,CAgCnB"}

package/dist/core/load.js

@@ -1,130 +1,76 @@
-import { GraphError as I } from "./error.js";
-import { Dictionary as O } from "./categories.js";
-import { projectionOf as g } from "./channels.js";
-import { columnsOf as R } from "./filter.js";
-const _ = (o) => o.manifest.vertex_tables.filter((t) => t.position), v = (o) => (t) => o.properties.some((e) => e.name === t);
-function C(o, t) {
-  const e = new AbortController();
-  return t(AbortSignal.any([o, e.signal])).catch((r) => {
-    throw e.abort(), r;
-  });
-}
-async function x(o, t, e) {
-  const r = o.scan(t);
-  return r.read(r.plan(), { signal: e });
-}
-function E(o, t, e, r) {
-  const c = new O(r), s = new Uint32Array(t), l = e.size === void 0 ? null : new Float32Array(t).fill(Number.NaN);
-  return {
-    add(a, i) {
-      var d, N, b;
-      const n = o[a], m = ((d = i.getChild(n.key)) == null ? void 0 : d.toArray()) ?? [], f = e.category === void 0 || (N = i.getChild(e.category)) == null ? void 0 : N.toArray(), u = e.size === void 0 || (b = i.getChild(e.size)) == null ? void 0 : b.toArray(), w = e.byTable ? c.code(n.name) : 0;
-      for (let y = 0; y < i.numRows; y++) {
-        const h = Number(m[y]);
-        h < t && (s[h] = e.byTable || e.category === void 0 ? w : c.code((f == null ? void 0 : f[y]) ?? null), l && (l[h] = Number((u == null ? void 0 : u[y]) ?? Number.NaN)));
-      }
-    },
-    finish() {
-      const a = c.ranks(), i = s.map((m) => a[m] ?? 0), n = [];
-      return a.forEach((m, f) => {
-        n[m] = c.values[f];
-      }), { ranks: i, sizes: l, domain: n };
-    }
+import { Dictionary as k } from "./categories.js";
+import { readLinks as P, readColumns as z } from "./source.js";
+const q = (e) => e > 2e5 ? 8192 : 4096;
+function E(e) {
+  let o = e >>> 0;
+  return () => {
+    o = o + 1831565813 >>> 0;
+    let t = o;
+    return t = Math.imul(t ^ t >>> 15, t | 1), t ^= t + Math.imul(t ^ t >>> 7, t | 61), ((t ^ t >>> 14) >>> 0) / 4294967296;
   };
 }
-function F(o) {
-  let [t, e, r, c] = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-  for (let s = 0; s < o.length; s += 2) {
-    const l = o[s], a = o[s + 1];
-    Number.isNaN(l) || Number.isNaN(a) || (l < t && (t = l), l > r && (r = l), a < e && (e = a), a > c && (c = a));
+function R(e, o) {
+  const t = E(e), s = o / 8 * Math.sqrt(Math.min(1, e / 15e5)), n = new Float32Array(2 * e);
+  for (let r = 0; r < e; r++) {
+    const l = Math.sqrt(-2 * Math.log(1 - t())) * s, a = 2 * Math.PI * t();
+    n[2 * r] = o / 2 + l * Math.cos(a), n[2 * r + 1] = o / 2 + l * Math.sin(a);
   }
-  return t > r ? null : { x: t, y: e, w: r - t, h: c - e };
+  return n;
 }
-async function S(o, t, e, r) {
-  const c = new Set(t.map((n) => n.name)), s = o.manifest.edge_tables.filter(
-    (n) => c.has(n.source.references) && c.has(n.destination.references)
-  ), l = await Promise.all(
-    s.map((n) => x(o, { table: n.name, select: [n.source.key, n.destination.key] }, r))
-  ), a = new Float32Array(2 * s.reduce((n, m) => n + m.record_count, 0));
-  let i = 0;
-  return l.forEach((n, m) => {
-    var u, w;
-    const f = s[m];
-    for (const d of n) {
-      const N = ((u = d.getChild(f.source.key)) == null ? void 0 : u.toArray()) ?? [], b = ((w = d.getChild(f.destination.key)) == null ? void 0 : w.toArray()) ?? [];
-      for (let y = 0; y < d.numRows && i < a.length; y++) {
-        const h = Number(N[y]), k = Number(b[y]);
-        h < e && k < e && (a[i++] = h, a[i++] = k);
-      }
-    }
-  }), i === a.length ? a : a.slice(0, i);
+function T(e) {
+  let [o, t, s, n] = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
+  for (let r = 0; r < e.length; r += 2) {
+    const l = e[r], a = e[r + 1];
+    Number.isNaN(l) || Number.isNaN(a) || (l < o && (o = l), l > s && (s = l), a < t && (t = a), a > n && (n = a));
+  }
+  return o > s ? null : { x: o, y: t, w: s - o, h: n - t };
 }
-async function D(o, t, e, r) {
-  const c = _(o), s = c.reduce((f, u) => f + u.record_count, 0), l = new Float32Array(2 * s).fill(Number.NaN), a = new Uint16Array(s), i = E(c, s, t, e), [n, m] = await C(
-    r,
-    (f) => Promise.all([
-      Promise.all(
-        c.map((u) => {
-          const { x: w, y: d } = u.position;
-          return x(o, { table: u.name, select: g(t, [u.key, w, d], v(u)) }, f);
-        })
-      ),
-      S(o, c, s, f)
-    ])
-  );
-  return n.forEach((f, u) => {
-    var N, b, y;
-    const { key: w, position: d } = c[u];
-    for (const h of f) {
-      const k = ((N = h.getChild(w)) == null ? void 0 : N.toArray()) ?? [], z = ((b = h.getChild((d == null ? void 0 : d.x) ?? "")) == null ? void 0 : b.toArray()) ?? [], P = ((y = h.getChild((d == null ? void 0 : d.y) ?? "")) == null ? void 0 : y.toArray()) ?? [];
-      for (let A = 0; A < h.numRows; A++) {
-        const p = Number(k[A]);
-        p < s && (l[p * 2] = Number(z[A] ?? Number.NaN), l[p * 2 + 1] = Number(P[A] ?? Number.NaN), a[p] = u);
-      }
-      i.add(u, h);
+async function O(e, o, t) {
+  var y, d;
+  const { size: s } = o, n = q(s), r = t.x !== void 0 && t.y !== void 0, [l, a] = await Promise.all([
+    P(e, o),
+    r ? z(e, o, [t.x, t.y]) : Promise.resolve([])
+  ]);
+  if (!r) return { structure: o, size: s, positions: R(s, n), bound: r, links: l, extent: null, space: n };
+  const i = new Float32Array(2 * s).fill(Number.NaN);
+  for (const { table: h, answer: m } of a) {
+    const w = ((y = m.getChild(t.x)) == null ? void 0 : y.toArray()) ?? [], x = ((d = m.getChild(t.y)) == null ? void 0 : d.toArray()) ?? [];
+    for (let f = 0; f < m.numRows; f++) {
+      const v = 2 * (h.first + f);
+      i[v] = w[f] === null ? Number.NaN : Number(w[f]), i[v + 1] = x[f] === null ? Number.NaN : Number(x[f]);
     }
-  }), { geometry: { tables: c, size: s, positions: l, table: a, links: m, extent: F(l) }, encoding: i.finish() };
+  }
+  return { structure: o, size: s, positions: i, bound: r, links: l, extent: T(i), space: n };
 }
-async function K(o, t, e, r, c) {
-  const { tables: s, size: l } = t, a = E(s, l, e, r);
-  return (await C(
-    c,
-    (n) => Promise.all(s.map((m) => x(o, { table: m.name, select: g(e, [m.key], v(m)) }, n)))
-  )).forEach((n, m) => {
-    for (const f of n) a.add(m, f);
-  }), a.finish();
+function D(e, o) {
+  const t = new Float32Array(e);
+  for (let s = 0; s < o.length; s++) {
+    const n = o[s];
+    t[n] = t[n] + 1;
+  }
+  return t;
 }
-async function L(o, t, e, r) {
-  const c = R(e), s = t.flatMap((i, n) => c.every(v(i)) ? [n] : []);
-  if (s.length === 0)
-    throw new I("graph/untranslatable-filter", `no drawn vertex type has every column this filter names: ${c.join(", ")}`);
-  const l = await C(
-    r,
-    (i) => Promise.all(
-      s.map((n) => x(o, { table: t[n].name, filter: e, select: [t[n].key] }, i))
-    )
-  ), a = [];
-  return l.forEach((i, n) => {
-    var f;
-    const { key: m } = t[s[n]];
-    for (const u of i) {
-      const w = ((f = u.getChild(m)) == null ? void 0 : f.toArray()) ?? [];
-      for (let d = 0; d < u.numRows; d++) a.push(Number(w[d]));
+async function S(e, o, t, s) {
+  var v, C, F;
+  const { structure: n, size: r } = o, l = [t.category, t.size, t.cluster].filter((c) => c !== void 0), a = l.length > 0 ? await z(e, n, [...new Set(l)]) : [], i = new k(s), y = new Uint32Array(r), d = t.size === void 0 ? D(r, o.links) : new Float32Array(r).fill(Number.NaN), h = t.cluster === void 0 ? null : new k(), m = h ? new Array(r) : null;
+  if (t.byTable)
+    for (const c of n.vertices) y.fill(i.code(c.name), c.first, c.first + c.rows);
+  else t.category === void 0 && y.fill(i.code(null));
+  for (const { table: c, answer: N } of a) {
+    const I = t.category === void 0 || t.byTable || (v = N.getChild(t.category)) == null ? void 0 : v.toArray(), A = t.size === void 0 || (C = N.getChild(t.size)) == null ? void 0 : C.toArray(), M = t.cluster === void 0 || (F = N.getChild(t.cluster)) == null ? void 0 : F.toArray();
+    for (let u = 0; u < N.numRows; u++) {
+      const p = c.first + u;
+      I && (y[p] = i.code(I[u] ?? null)), A && (d[p] = A[u] === null ? Number.NaN : Number(A[u])), M && m && h && (m[p] = M[u] === null ? void 0 : h.code(M[u]));
     }
-  }), { filtered: new Set(s), ids: a };
-}
-function M(o, t) {
-  const e = new Uint8Array(o.size);
-  for (let r = 0; r < o.size; r++) e[r] = t.filtered.has(o.table[r]) ? 0 : 1;
-  for (const r of t.ids) r < o.size && (e[r] = 1);
-  return e;
+  }
+  const w = i.ranks(), x = y.map((c) => w[c] ?? 0), f = [];
+  return w.forEach((c, N) => {
+    f[c] = i.values[N];
+  }), { ranks: x, sizes: d, clusters: m, domain: f };
 }
 export {
-  _ as drawnTables,
-  K as loadEncoding,
-  D as loadGraph,
-  M as maskOf,
-  L as readKept,
-  C as together
+  S as loadEncoding,
+  O as loadGeometry,
+  q as spaceFor
 };
 //# sourceMappingURL=load.js.map