@kanzo-tech/graph 0.13.1 → 0.15.0

package/dist/core/filter.js.map

@@ -1 +1 @@
-{"version":3,"file":"filter.js","sources":["../../src/core/filter.ts"],"sourcesContent":["import type { Filter, Literal } from \"@fossil-lang/corpus\";\nimport { MosaicClient, clausePoints, type Selection } from \"@kanzo-tech/mosaic\";\n\n/**\n * **The page's crossfilter, as scan's typed filter.** The graph listens to the `Selection` rather\n * than being a client of the coordinator: a client hands the coordinator SQL to run, and the graph\n * has none — it hands fossil a `Filter` and fossil binds it. So this takes the half of Mosaic's\n * protocol that is about filtering: the `value` event, and `selection.predicate(client)`.\n *\n * The nodes are read by their `type`, never by importing mosaic-sql's classes: what arrives is\n * whatever the page's copy of mosaic-sql built.\n */\n\n/** A predicate this cannot express as a `Filter` — reported, never dropped. */\nexport class UntranslatableFilter extends Error {\n  override readonly name = \"UntranslatableFilter\";\n}\n\ninterface Node {\n  readonly type?: string;\n  readonly op?: string;\n  readonly [field: string]: unknown;\n}\n\nconst COMPARISONS: Record<string, \"=\" | \"!=\" | \"<\" | \"<=\" | \">\" | \">=\"> = {\n  \"=\": \"=\",\n  \"==\": \"=\",\n  \"IS NOT DISTINCT FROM\": \"=\",\n  \"<>\": \"!=\",\n  \"!=\": \"!=\",\n  \"<\": \"<\",\n  \"<=\": \"<=\",\n  \">\": \">\",\n  \">=\": \">=\",\n};\nconst MIRRORED = { \"=\": \"=\", \"!=\": \"!=\", \"<\": \">\", \"<=\": \">=\", \">\": \"<\", \">=\": \"<=\" } as const;\n\nconst fail = (what: unknown): never => {\n  throw new UntranslatableFilter(\n    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(what)}`,\n  );\n};\n\nfunction columnOf(node: unknown): string | null {\n  const n = node as Node | null;\n  if (n?.type === \"COLUMN_REF\" && typeof n.name === \"string\") return n.name;\n  return null;\n}\n\nfunction literalOf(node: unknown): Literal {\n  const n = node as Node | null;\n  const value = n?.type === \"LITERAL\" || n?.type === \"PARAM\" ? n.value : fail(node);\n  if (typeof value === \"number\" || typeof value === \"bigint\" || typeof value === \"string\" || typeof value === \"boolean\") {\n    return value;\n  }\n  if (value instanceof Date) {\n    const iso = value.toISOString();\n    return iso.endsWith(\"T00:00:00.000Z\") ? iso.slice(0, 10) : iso.replace(\"T\", \" \").replace(\"Z\", \"\");\n  }\n  return fail(node);\n}\n\nfunction valuesOf(node: unknown): Literal[] {\n  const n = node as Node | null;\n  const list = Array.isArray(node) ? node : Array.isArray(n?.values) ? n.values : fail(node);\n  return (list as unknown[]).map(literalOf);\n}\n\n/** One mosaic-sql expression node → one `Filter`. */\nexport function translate(node: unknown): Filter {\n  const n = node as Node | null;\n  if (Array.isArray(node)) return and(node.map(translate));\n  switch (n?.type) {\n    case \"LOGICAL_OPERATOR\": {\n      const clauses = ((n.clauses as unknown[] | undefined) ?? []).map(translate);\n      return n.op === \"OR\" ? { or: clauses } : and(clauses);\n    }\n    case \"UNARY\":\n      if (n.op === \"NOT\") return { not: translate(n.expr) };\n      return fail(node);\n    case \"UNARY_POSTFIX\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      if (n.op === \"IS NULL\") return { column, op: \"is null\" };\n      if (n.op === \"IS NOT NULL\") return { column, op: \"not null\" };\n      return fail(node);\n    }\n    case \"BINARY\": {\n      const op = COMPARISONS[String(n.op).toUpperCase()] ?? fail(node);\n      const left = columnOf(n.left);\n      if (left !== null) return { column: left, op, value: literalOf(n.right) };\n      const right = columnOf(n.right) ?? fail(node);\n      return { column: right, op: MIRRORED[op], value: literalOf(n.left) };\n    }\n    case \"BETWEEN\":\n    case \"NOT_BETWEEN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      const [lo, hi] = (n.extent as unknown[] | undefined) ?? fail(node);\n      const within: Filter = and([\n        { column, op: \">=\", value: literalOf(lo) },\n        { column, op: \"<=\", value: literalOf(hi) },\n      ]);\n      return n.type === \"BETWEEN\" ? within : { not: within };\n    }\n    case \"IN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      return { column, op: \"in\", values: valuesOf(n.values) };\n    }\n    default:\n      return fail(node);\n  }\n}\n\nconst and = (clauses: Filter[]): Filter => (clauses.length === 1 ? (clauses[0] as Filter) : { and: clauses });\n\n/**\n * The page's filter for the graph, or `undefined` for none. `selection.predicate` skips the clause\n * the graph published itself, which is the exemption the next function takes back.\n */\nexport function filterFor(selection: Selection, self: MosaicClient): Filter | undefined {\n  const predicate = selection.predicate(self) as unknown;\n  const clauses = (Array.isArray(predicate) ? predicate : [predicate]).filter((p) => p !== undefined && p !== null);\n  return clauses.length === 0 ? undefined : translate(clauses);\n}\n\n/**\n * An identity for `clients`, and nothing more: it is never connected, so the coordinator never\n * queries on its behalf.\n */\nexport function graphClient(): MosaicClient {\n  return new MosaicClient();\n}\n\n/**\n * **The reader's pick, published** — naming the graph in `clients`, so the crossfilter skips it for\n * the graph and applies it to every chart. A canvas that draws only what survives would otherwise\n * answer a lasso of thirteen by removing the other 1,530.\n */\nexport function publish(\n  selection: Selection,\n  self: MosaicClient,\n  column: string,\n  dense: readonly number[] | null,\n): void {\n  selection.update(\n    clausePoints([column], dense && dense.length > 0 ? dense.map((d) => [d]) : undefined, {\n      source: self,\n      clients: new Set([self]),\n    }),\n  );\n}\n"],"names":["UntranslatableFilter","__publicField","COMPARISONS","MIRRORED","fail","what","columnOf","node","n","literalOf","value","iso","valuesOf","translate","and","clauses","column","op","left","lo","hi","within","filterFor","selection","self","predicate","p","graphClient","MosaicClient","publish","dense","clausePoints","d"],"mappings":";;;;AAcO,MAAMA,UAA6B,MAAM;AAAA,EAAzC;AAAA;AACa,IAAAC,EAAA,cAAO;AAAA;AAC3B;AAQA,MAAMC,IAAoE;AAAA,EACxE,KAAK;AAAA,EACL,MAAM;AAAA,EACN,wBAAwB;AAAA,EACxB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AACR,GACMC,IAAW,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAA,GAEzEC,IAAO,CAACC,MAAyB;AACrC,QAAM,IAAIL;AAAA,IACR,+EAA+E,OAAOK,CAAI,CAAC;AAAA,EAAA;AAE/F;AAEA,SAASC,EAASC,GAA8B;AAC9C,QAAMC,IAAID;AACV,UAAIC,KAAA,gBAAAA,EAAG,UAAS,gBAAgB,OAAOA,EAAE,QAAS,WAAiBA,EAAE,OAC9D;AACT;AAEA,SAASC,EAAUF,GAAwB;AACzC,QAAMC,IAAID,GACJG,KAAQF,KAAA,gBAAAA,EAAG,UAAS,cAAaA,KAAA,gBAAAA,EAAG,UAAS,UAAUA,EAAE,QAAQJ,EAAKG,CAAI;AAChF,MAAI,OAAOG,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU;AAC1G,WAAOA;AAET,MAAIA,aAAiB,MAAM;AACzB,UAAMC,IAAMD,EAAM,YAAA;AAClB,WAAOC,EAAI,SAAS,gBAAgB,IAAIA,EAAI,MAAM,GAAG,EAAE,IAAIA,EAAI,QAAQ,KAAK,GAAG,EAAE,QAAQ,KAAK,EAAE;AAAA,EAClG;AACA,SAAOP,EAAKG,CAAI;AAClB;AAEA,SAASK,EAASL,GAA0B;AAC1C,QAAMC,IAAID;AAEV,UADa,MAAM,QAAQA,CAAI,IAAIA,IAAO,MAAM,QAAQC,KAAA,gBAAAA,EAAG,MAAM,IAAIA,EAAE,SAASJ,EAAKG,CAAI,GAC9D,IAAIE,CAAS;AAC1C;AAGO,SAASI,EAAUN,GAAuB;AAC/C,QAAMC,IAAID;AACV,MAAI,MAAM,QAAQA,CAAI,UAAUO,EAAIP,EAAK,IAAIM,CAAS,CAAC;AACvD,UAAQL,KAAA,gBAAAA,EAAG,MAAA;AAAA,IACT,KAAK,oBAAoB;AACvB,YAAMO,KAAYP,EAAE,WAAqC,CAAA,GAAI,IAAIK,CAAS;AAC1E,aAAOL,EAAE,OAAO,OAAO,EAAE,IAAIO,EAAA,IAAYD,EAAIC,CAAO;AAAA,IACtD;AAAA,IACA,KAAK;AACH,aAAIP,EAAE,OAAO,QAAc,EAAE,KAAKK,EAAUL,EAAE,IAAI,EAAA,IAC3CJ,EAAKG,CAAI;AAAA,IAClB,KAAK,iBAAiB;AACpB,YAAMS,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI;AAC5C,aAAIC,EAAE,OAAO,YAAkB,EAAE,QAAAQ,GAAQ,IAAI,UAAA,IACzCR,EAAE,OAAO,gBAAsB,EAAE,QAAAQ,GAAQ,IAAI,WAAA,IAC1CZ,EAAKG,CAAI;AAAA,IAClB;AAAA,IACA,KAAK,UAAU;AACb,YAAMU,IAAKf,EAAY,OAAOM,EAAE,EAAE,EAAE,YAAA,CAAa,KAAKJ,EAAKG,CAAI,GACzDW,IAAOZ,EAASE,EAAE,IAAI;AAC5B,aAAIU,MAAS,OAAa,EAAE,QAAQA,GAAM,IAAAD,GAAI,OAAOR,EAAUD,EAAE,KAAK,EAAA,IAE/D,EAAE,QADKF,EAASE,EAAE,KAAK,KAAKJ,EAAKG,CAAI,GACpB,IAAIJ,EAASc,CAAE,GAAG,OAAOR,EAAUD,EAAE,IAAI,EAAA;AAAA,IACnE;AAAA,IACA,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,YAAMQ,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GACtC,CAACY,GAAIC,CAAE,IAAKZ,EAAE,UAAoCJ,EAAKG,CAAI,GAC3Dc,IAAiBP,EAAI;AAAA,QACzB,EAAE,QAAAE,GAAQ,IAAI,MAAM,OAAOP,EAAUU,CAAE,EAAA;AAAA,QACvC,EAAE,QAAAH,GAAQ,IAAI,MAAM,OAAOP,EAAUW,CAAE,EAAA;AAAA,MAAE,CAC1C;AACD,aAAOZ,EAAE,SAAS,YAAYa,IAAS,EAAE,KAAKA,EAAA;AAAA,IAChD;AAAA,IACA,KAAK;AAEH,aAAO,EAAE,QADMf,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GAC3B,IAAI,MAAM,QAAQK,EAASJ,EAAE,MAAM,EAAA;AAAA,IAEtD;AACE,aAAOJ,EAAKG,CAAI;AAAA,EAAA;AAEtB;AAEA,MAAMO,IAAM,CAACC,MAA+BA,EAAQ,WAAW,IAAKA,EAAQ,CAAC,IAAe,EAAE,KAAKA,EAAA;AAM5F,SAASO,EAAUC,GAAsBC,GAAwC;AACtF,QAAMC,IAAYF,EAAU,UAAUC,CAAI,GACpCT,KAAW,MAAM,QAAQU,CAAS,IAAIA,IAAY,CAACA,CAAS,GAAG,OAAO,CAACC,MAAyBA,KAAM,IAAI;AAChH,SAAOX,EAAQ,WAAW,IAAI,SAAYF,EAAUE,CAAO;AAC7D;AAMO,SAASY,IAA4B;AAC1C,SAAO,IAAIC,EAAA;AACb;AAOO,SAASC,EACdN,GACAC,GACAR,GACAc,GACM;AACN,EAAAP,EAAU;AAAA,IACRQ,EAAa,CAACf,CAAM,GAAGc,KAASA,EAAM,SAAS,IAAIA,EAAM,IAAI,CAACE,MAAM,CAACA,CAAC,CAAC,IAAI,QAAW;AAAA,MACpF,QAAQR;AAAA,MACR,SAAS,oBAAI,IAAI,CAACA,CAAI,CAAC;AAAA,IAAA,CACxB;AAAA,EAAA;AAEL;"}
+{"version":3,"file":"filter.js","sources":["../../src/core/filter.ts"],"sourcesContent":["import type { Filter, Literal } from \"@fossil-lang/corpus\";\nimport { MosaicClient, clausePoints, type Selection } from \"@kanzo-tech/mosaic\";\n\n/**\n * **The page's crossfilter, as scan's typed filter.** The graph listens to the `Selection` rather\n * than being a client of the coordinator: a client hands the coordinator SQL to run, and the graph\n * has none — it hands fossil a `Filter` and fossil binds it. So this takes the half of Mosaic's\n * protocol that is about filtering: the `value` event, and `selection.predicate(client)`.\n *\n * The nodes are read by their `type`, never by importing mosaic-sql's classes: what arrives is\n * whatever the page's copy of mosaic-sql built.\n */\n\n/** A predicate this cannot express as a `Filter` — reported, never dropped. */\nexport class UntranslatableFilter extends Error {\n  override readonly name = \"UntranslatableFilter\";\n}\n\ninterface Node {\n  readonly type?: string;\n  readonly op?: string;\n  readonly [field: string]: unknown;\n}\n\nconst COMPARISONS: Record<string, \"=\" | \"!=\" | \"<\" | \"<=\" | \">\" | \">=\"> = {\n  \"=\": \"=\",\n  \"==\": \"=\",\n  \"IS NOT DISTINCT FROM\": \"=\",\n  \"<>\": \"!=\",\n  \"!=\": \"!=\",\n  \"<\": \"<\",\n  \"<=\": \"<=\",\n  \">\": \">\",\n  \">=\": \">=\",\n};\nconst MIRRORED = { \"=\": \"=\", \"!=\": \"!=\", \"<\": \">\", \"<=\": \">=\", \">\": \"<\", \">=\": \"<=\" } as const;\n\nconst fail = (what: unknown): never => {\n  throw new UntranslatableFilter(\n    `the graph cannot express this crossfilter clause as a filter on the corpus: ${String(what)}`,\n  );\n};\n\nfunction columnOf(node: unknown): string | null {\n  const n = node as Node | null;\n  if (n?.type === \"COLUMN_REF\" && typeof n.name === \"string\") return n.name;\n  return null;\n}\n\nfunction literalOf(node: unknown): Literal {\n  const n = node as Node | null;\n  const value = n?.type === \"LITERAL\" || n?.type === \"PARAM\" ? n.value : fail(node);\n  if (typeof value === \"number\" || typeof value === \"bigint\" || typeof value === \"string\" || typeof value === \"boolean\") {\n    return value;\n  }\n  if (value instanceof Date) {\n    const iso = value.toISOString();\n    return iso.endsWith(\"T00:00:00.000Z\") ? iso.slice(0, 10) : iso.replace(\"T\", \" \").replace(\"Z\", \"\");\n  }\n  return fail(node);\n}\n\nfunction valuesOf(node: unknown): Literal[] {\n  const n = node as Node | null;\n  const list = Array.isArray(node) ? node : Array.isArray(n?.values) ? n.values : fail(node);\n  return (list as unknown[]).map(literalOf);\n}\n\n/** One mosaic-sql expression node → one `Filter`. */\nexport function translate(node: unknown): Filter {\n  const n = node as Node | null;\n  if (Array.isArray(node)) return and(node.map(translate));\n  switch (n?.type) {\n    case \"LOGICAL_OPERATOR\": {\n      const clauses = ((n.clauses as unknown[] | undefined) ?? []).map(translate);\n      return n.op === \"OR\" ? { or: clauses } : and(clauses);\n    }\n    case \"UNARY\":\n      if (n.op === \"NOT\") return { not: translate(n.expr) };\n      return fail(node);\n    case \"UNARY_POSTFIX\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      if (n.op === \"IS NULL\") return { column, op: \"is null\" };\n      if (n.op === \"IS NOT NULL\") return { column, op: \"not null\" };\n      return fail(node);\n    }\n    case \"BINARY\": {\n      const op = COMPARISONS[String(n.op).toUpperCase()] ?? fail(node);\n      const left = columnOf(n.left);\n      if (left !== null) return { column: left, op, value: literalOf(n.right) };\n      const right = columnOf(n.right) ?? fail(node);\n      return { column: right, op: MIRRORED[op], value: literalOf(n.left) };\n    }\n    case \"BETWEEN\":\n    case \"NOT_BETWEEN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      const [lo, hi] = (n.extent as unknown[] | undefined) ?? fail(node);\n      const within: Filter = and([\n        { column, op: \">=\", value: literalOf(lo) },\n        { column, op: \"<=\", value: literalOf(hi) },\n      ]);\n      return n.type === \"BETWEEN\" ? within : { not: within };\n    }\n    case \"IN\": {\n      const column = columnOf(n.expr) ?? fail(node);\n      return { column, op: \"in\", values: valuesOf(n.values) };\n    }\n    default:\n      return fail(node);\n  }\n}\n\nconst and = (clauses: Filter[]): Filter => (clauses.length === 1 ? (clauses[0] as Filter) : { and: clauses });\n\n/** Every column a filter names, once each. */\nexport function columnsOf(filter: Filter): string[] {\n  if (\"column\" in filter) return [filter.column];\n  if (\"and\" in filter) return [...new Set(filter.and.flatMap(columnsOf))];\n  if (\"or\" in filter) return [...new Set(filter.or.flatMap(columnsOf))];\n  if (\"not\" in filter) return columnsOf(filter.not);\n  return [];\n}\n\n/**\n * The page's filter for the graph, or `undefined` for none. `selection.predicate` skips the clause\n * the graph published itself, which is the exemption the next function takes back.\n */\nexport function filterFor(selection: Selection, self: MosaicClient): Filter | undefined {\n  const predicate = selection.predicate(self) as unknown;\n  const clauses = (Array.isArray(predicate) ? predicate : [predicate]).filter((p) => p !== undefined && p !== null);\n  return clauses.length === 0 ? undefined : translate(clauses);\n}\n\n/**\n * An identity for `clients`, and nothing more: it is never connected, so the coordinator never\n * queries on its behalf.\n */\nexport function graphClient(): MosaicClient {\n  return new MosaicClient();\n}\n\n/**\n * **The reader's pick, published** — naming the graph in `clients`, so the crossfilter skips it for\n * the graph and applies it to every chart. A canvas that draws only what survives would otherwise\n * answer a lasso of thirteen by removing the other 1,530.\n */\nexport function publish(\n  selection: Selection,\n  self: MosaicClient,\n  column: string,\n  ids: readonly number[] | null,\n): void {\n  selection.update(\n    clausePoints([column], ids && ids.length > 0 ? ids.map((d) => [d]) : undefined, {\n      source: self,\n      clients: new Set([self]),\n    }),\n  );\n}\n"],"names":["UntranslatableFilter","__publicField","COMPARISONS","MIRRORED","fail","what","columnOf","node","n","literalOf","value","iso","valuesOf","translate","and","clauses","column","op","left","lo","hi","within","columnsOf","filter","filterFor","selection","self","predicate","p","graphClient","MosaicClient","publish","ids","clausePoints","d"],"mappings":";;;;AAcO,MAAMA,UAA6B,MAAM;AAAA,EAAzC;AAAA;AACa,IAAAC,EAAA,cAAO;AAAA;AAC3B;AAQA,MAAMC,IAAoE;AAAA,EACxE,KAAK;AAAA,EACL,MAAM;AAAA,EACN,wBAAwB;AAAA,EACxB,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AACR,GACMC,IAAW,EAAE,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAA,GAEzEC,IAAO,CAACC,MAAyB;AACrC,QAAM,IAAIL;AAAA,IACR,+EAA+E,OAAOK,CAAI,CAAC;AAAA,EAAA;AAE/F;AAEA,SAASC,EAASC,GAA8B;AAC9C,QAAMC,IAAID;AACV,UAAIC,KAAA,gBAAAA,EAAG,UAAS,gBAAgB,OAAOA,EAAE,QAAS,WAAiBA,EAAE,OAC9D;AACT;AAEA,SAASC,EAAUF,GAAwB;AACzC,QAAMC,IAAID,GACJG,KAAQF,KAAA,gBAAAA,EAAG,UAAS,cAAaA,KAAA,gBAAAA,EAAG,UAAS,UAAUA,EAAE,QAAQJ,EAAKG,CAAI;AAChF,MAAI,OAAOG,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU,YAAY,OAAOA,KAAU;AAC1G,WAAOA;AAET,MAAIA,aAAiB,MAAM;AACzB,UAAMC,IAAMD,EAAM,YAAA;AAClB,WAAOC,EAAI,SAAS,gBAAgB,IAAIA,EAAI,MAAM,GAAG,EAAE,IAAIA,EAAI,QAAQ,KAAK,GAAG,EAAE,QAAQ,KAAK,EAAE;AAAA,EAClG;AACA,SAAOP,EAAKG,CAAI;AAClB;AAEA,SAASK,EAASL,GAA0B;AAC1C,QAAMC,IAAID;AAEV,UADa,MAAM,QAAQA,CAAI,IAAIA,IAAO,MAAM,QAAQC,KAAA,gBAAAA,EAAG,MAAM,IAAIA,EAAE,SAASJ,EAAKG,CAAI,GAC9D,IAAIE,CAAS;AAC1C;AAGO,SAASI,EAAUN,GAAuB;AAC/C,QAAMC,IAAID;AACV,MAAI,MAAM,QAAQA,CAAI,UAAUO,EAAIP,EAAK,IAAIM,CAAS,CAAC;AACvD,UAAQL,KAAA,gBAAAA,EAAG,MAAA;AAAA,IACT,KAAK,oBAAoB;AACvB,YAAMO,KAAYP,EAAE,WAAqC,CAAA,GAAI,IAAIK,CAAS;AAC1E,aAAOL,EAAE,OAAO,OAAO,EAAE,IAAIO,EAAA,IAAYD,EAAIC,CAAO;AAAA,IACtD;AAAA,IACA,KAAK;AACH,aAAIP,EAAE,OAAO,QAAc,EAAE,KAAKK,EAAUL,EAAE,IAAI,EAAA,IAC3CJ,EAAKG,CAAI;AAAA,IAClB,KAAK,iBAAiB;AACpB,YAAMS,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI;AAC5C,aAAIC,EAAE,OAAO,YAAkB,EAAE,QAAAQ,GAAQ,IAAI,UAAA,IACzCR,EAAE,OAAO,gBAAsB,EAAE,QAAAQ,GAAQ,IAAI,WAAA,IAC1CZ,EAAKG,CAAI;AAAA,IAClB;AAAA,IACA,KAAK,UAAU;AACb,YAAMU,IAAKf,EAAY,OAAOM,EAAE,EAAE,EAAE,YAAA,CAAa,KAAKJ,EAAKG,CAAI,GACzDW,IAAOZ,EAASE,EAAE,IAAI;AAC5B,aAAIU,MAAS,OAAa,EAAE,QAAQA,GAAM,IAAAD,GAAI,OAAOR,EAAUD,EAAE,KAAK,EAAA,IAE/D,EAAE,QADKF,EAASE,EAAE,KAAK,KAAKJ,EAAKG,CAAI,GACpB,IAAIJ,EAASc,CAAE,GAAG,OAAOR,EAAUD,EAAE,IAAI,EAAA;AAAA,IACnE;AAAA,IACA,KAAK;AAAA,IACL,KAAK,eAAe;AAClB,YAAMQ,IAASV,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GACtC,CAACY,GAAIC,CAAE,IAAKZ,EAAE,UAAoCJ,EAAKG,CAAI,GAC3Dc,IAAiBP,EAAI;AAAA,QACzB,EAAE,QAAAE,GAAQ,IAAI,MAAM,OAAOP,EAAUU,CAAE,EAAA;AAAA,QACvC,EAAE,QAAAH,GAAQ,IAAI,MAAM,OAAOP,EAAUW,CAAE,EAAA;AAAA,MAAE,CAC1C;AACD,aAAOZ,EAAE,SAAS,YAAYa,IAAS,EAAE,KAAKA,EAAA;AAAA,IAChD;AAAA,IACA,KAAK;AAEH,aAAO,EAAE,QADMf,EAASE,EAAE,IAAI,KAAKJ,EAAKG,CAAI,GAC3B,IAAI,MAAM,QAAQK,EAASJ,EAAE,MAAM,EAAA;AAAA,IAEtD;AACE,aAAOJ,EAAKG,CAAI;AAAA,EAAA;AAEtB;AAEA,MAAMO,IAAM,CAACC,MAA+BA,EAAQ,WAAW,IAAKA,EAAQ,CAAC,IAAe,EAAE,KAAKA,EAAA;AAG5F,SAASO,EAAUC,GAA0B;AAClD,SAAI,YAAYA,IAAe,CAACA,EAAO,MAAM,IACzC,SAASA,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,IAAI,QAAQD,CAAS,CAAC,CAAC,IAClE,QAAQC,IAAe,CAAC,GAAG,IAAI,IAAIA,EAAO,GAAG,QAAQD,CAAS,CAAC,CAAC,IAChE,SAASC,IAAeD,EAAUC,EAAO,GAAG,IACzC,CAAA;AACT;AAMO,SAASC,EAAUC,GAAsBC,GAAwC;AACtF,QAAMC,IAAYF,EAAU,UAAUC,CAAI,GACpCX,KAAW,MAAM,QAAQY,CAAS,IAAIA,IAAY,CAACA,CAAS,GAAG,OAAO,CAACC,MAAyBA,KAAM,IAAI;AAChH,SAAOb,EAAQ,WAAW,IAAI,SAAYF,EAAUE,CAAO;AAC7D;AAMO,SAASc,IAA4B;AAC1C,SAAO,IAAIC,EAAA;AACb;AAOO,SAASC,EACdN,GACAC,GACAV,GACAgB,GACM;AACN,EAAAP,EAAU;AAAA,IACRQ,EAAa,CAACjB,CAAM,GAAGgB,KAAOA,EAAI,SAAS,IAAIA,EAAI,IAAI,CAACE,MAAM,CAACA,CAAC,CAAC,IAAI,QAAW;AAAA,MAC9E,QAAQR;AAAA,MACR,SAAS,oBAAI,IAAI,CAACA,CAAI,CAAC;AAAA,IAAA,CACxB;AAAA,EAAA;AAEL;"}

package/dist/core/load.d.ts

@@ -0,0 +1,58 @@
+import { Binding } from './channels';
+import { Corpus, Filter, VertexTable } from '@fossil-lang/corpus';
+/**
+ * **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.
+ */
+/** Where the drawn vertices are and how they connect — read once per corpus. */
+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 size: number;
+    /** `[x, y, …]` by id; `NaN` where no row has a position. */
+    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. */
+    readonly links: Float32Array;
+    readonly extent: {
+        readonly x: number;
+        readonly y: number;
+        readonly w: number;
+        readonly h: number;
+    } | null;
+}
+/** 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;
+    /** 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[];
+/** 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;
+//# sourceMappingURL=load.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../../src/core/load.ts"],"names":[],"mappings":"AACA,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;AAgF9H,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,CAgCrD;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,CAkBjI;AAED,qDAAqD;AACrD,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,UAAU,CAKjE"}

package/dist/core/load.js

@@ -0,0 +1,115 @@
+import { Dictionary as P } from "./categories.js";
+import { projectionOf as C } from "./channels.js";
+import { columnsOf as I } from "./filter.js";
+const O = (o) => o.manifest.vertex_tables.filter((n) => n.position), v = (o) => (n) => o.properties.some((e) => e.name === n);
+async function x(o, n, e) {
+  const r = o.scan(n);
+  return r.read(r.plan(), { signal: e });
+}
+function E(o, n, e, r) {
+  const c = new P(r), s = new Uint32Array(n), f = e.size === void 0 ? null : new Float32Array(n).fill(Number.NaN);
+  return {
+    add(a, i) {
+      var m, w, b;
+      const t = o[a], d = ((m = i.getChild(t.key)) == null ? void 0 : m.toArray()) ?? [], l = e.category === void 0 || (w = i.getChild(e.category)) == null ? void 0 : w.toArray(), u = e.size === void 0 || (b = i.getChild(e.size)) == null ? void 0 : b.toArray(), N = e.byTable ? c.code(t.name) : 0;
+      for (let y = 0; y < i.numRows; y++) {
+        const h = Number(d[y]);
+        h < n && (s[h] = e.byTable || e.category === void 0 ? N : c.code((l == null ? void 0 : l[y]) ?? null), f && (f[h] = Number((u == null ? void 0 : u[y]) ?? Number.NaN)));
+      }
+    },
+    finish() {
+      const a = c.ranks(), i = s.map((d) => a[d] ?? 0), t = [];
+      return a.forEach((d, l) => {
+        t[d] = c.values[l];
+      }), { ranks: i, sizes: f, domain: t };
+    }
+  };
+}
+function R(o) {
+  let [n, e, r, c] = [1 / 0, 1 / 0, -1 / 0, -1 / 0];
+  for (let s = 0; s < o.length; s += 2) {
+    const f = o[s], a = o[s + 1];
+    Number.isNaN(f) || Number.isNaN(a) || (f < n && (n = f), f > r && (r = f), a < e && (e = a), a > c && (c = a));
+  }
+  return n > r ? null : { x: n, y: e, w: r - n, h: c - e };
+}
+async function _(o, n, e, r) {
+  const c = new Set(n.map((t) => t.name)), s = o.manifest.edge_tables.filter(
+    (t) => c.has(t.source.references) && c.has(t.destination.references)
+  ), f = await Promise.all(
+    s.map((t) => x(o, { table: t.name, select: [t.source.key, t.destination.key] }, r))
+  ), a = new Float32Array(2 * s.reduce((t, d) => t + d.record_count, 0));
+  let i = 0;
+  return f.forEach((t, d) => {
+    var u, N;
+    const l = s[d];
+    for (const m of t) {
+      const w = ((u = m.getChild(l.source.key)) == null ? void 0 : u.toArray()) ?? [], b = ((N = m.getChild(l.destination.key)) == null ? void 0 : N.toArray()) ?? [];
+      for (let y = 0; y < m.numRows && i < a.length; y++) {
+        const h = Number(w[y]), A = Number(b[y]);
+        h < e && A < e && (a[i++] = h, a[i++] = A);
+      }
+    }
+  }), i === a.length ? a : a.slice(0, i);
+}
+async function j(o, n, e, r) {
+  const c = O(o), s = c.reduce((l, u) => l + u.record_count, 0), f = new Float32Array(2 * s).fill(Number.NaN), a = new Uint16Array(s), i = E(c, s, n, e), [t, d] = await Promise.all([
+    Promise.all(
+      c.map((l) => {
+        const { x: u, y: N } = l.position;
+        return x(o, { table: l.name, select: C(n, [l.key, u, N], v(l)) }, r);
+      })
+    ),
+    _(o, c, s, r)
+  ]);
+  return t.forEach((l, u) => {
+    var w, b, y;
+    const { key: N, position: m } = c[u];
+    for (const h of l) {
+      const A = ((w = h.getChild(N)) == null ? void 0 : w.toArray()) ?? [], z = ((b = h.getChild((m == null ? void 0 : m.x) ?? "")) == null ? void 0 : b.toArray()) ?? [], g = ((y = h.getChild((m == null ? void 0 : m.y) ?? "")) == null ? void 0 : y.toArray()) ?? [];
+      for (let k = 0; k < h.numRows; k++) {
+        const p = Number(A[k]);
+        p < s && (f[p * 2] = Number(z[k] ?? Number.NaN), f[p * 2 + 1] = Number(g[k] ?? Number.NaN), a[p] = u);
+      }
+      i.add(u, h);
+    }
+  }), { geometry: { tables: c, size: s, positions: f, table: a, links: d, extent: R(f) }, encoding: i.finish() };
+}
+async function S(o, n, e, r, c) {
+  const { tables: s, size: f } = n, a = E(s, f, e, r);
+  return (await Promise.all(
+    s.map((t) => x(o, { table: t.name, select: C(e, [t.key], v(t)) }, c))
+  )).forEach((t, d) => {
+    for (const l of t) a.add(d, l);
+  }), a.finish();
+}
+async function D(o, n, e, r) {
+  const c = I(e), s = n.flatMap((i, t) => c.every(v(i)) ? [t] : []);
+  if (s.length === 0)
+    throw new Error(`no drawn vertex type has every column this filter names: ${c.join(", ")}`);
+  const f = await Promise.all(
+    s.map((i) => x(o, { table: n[i].name, filter: e, select: [n[i].key] }, r))
+  ), a = [];
+  return f.forEach((i, t) => {
+    var l;
+    const { key: d } = n[s[t]];
+    for (const u of i) {
+      const N = ((l = u.getChild(d)) == null ? void 0 : l.toArray()) ?? [];
+      for (let m = 0; m < u.numRows; m++) a.push(Number(N[m]));
+    }
+  }), { filtered: new Set(s), ids: a };
+}
+function G(o, n) {
+  const e = new Uint8Array(o.size);
+  for (let r = 0; r < o.size; r++) e[r] = n.filtered.has(o.table[r]) ? 0 : 1;
+  for (const r of n.ids) r < o.size && (e[r] = 1);
+  return e;
+}
+export {
+  O as drawnTables,
+  S as loadEncoding,
+  j as loadGraph,
+  G as maskOf,
+  D as readKept
+};
+//# sourceMappingURL=load.js.map

package/dist/core/load.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"load.js","sources":["../../src/core/load.ts"],"sourcesContent":["import { Dictionary } from \"./categories\";\nimport { projectionOf, type Binding } from \"./channels\";\nimport type { Batch, Corpus, EdgeTable, Filter, VertexTable } from \"@fossil-lang/corpus\";\nimport { columnsOf } from \"./filter\";\n\n/**\n * **The whole graph, read once and laid out as cosmos.gl's buffers.** A drawn vertex's `dense_id` is\n * its index, so every array is sized from the manifest's `record_count`s before a row arrives, and a\n * row is written where its id says. The camera never reaches here: nothing is read because it moved.\n */\n\n/** Where the drawn vertices are and how they connect — read once per corpus. */\nexport interface Geometry {\n  /** The vertex tables with a position, in the manifest's order. */\n  readonly tables: readonly VertexTable[];\n  /** Drawn vertices: ids `0 … size − 1`. */\n  readonly size: number;\n  /** `[x, y, …]` by id; `NaN` where no row has a position. */\n  readonly positions: Float32Array;\n  /** By id, the vertex's index in `tables`. */\n  readonly table: Uint16Array;\n  /** `[src, dst, …]` by id, every relation whose two ends are drawn. */\n  readonly links: Float32Array;\n  readonly extent: { readonly x: number; readonly y: number; readonly w: number; readonly h: number } | null;\n}\n\n/** What the bound channels say about each vertex — read again when a binding changes. */\nexport interface Encoding {\n  /** By id, the category's rank. */\n  readonly ranks: Uint32Array;\n  /** By id, the ramp's raw value, or `null` when `r` is unbound. */\n  readonly sizes: Float32Array | null;\n  /** What each rank is: the seed, then the other values seen, in rank order. */\n  readonly domain: readonly unknown[];\n}\n\n/** The vertex tables fossil lays out or the program places; a table without a position is not drawn. */\nexport const drawnTables = (corpus: Corpus): VertexTable[] => corpus.manifest.vertex_tables.filter((table) => table.position);\n\nconst has = (table: VertexTable) => (column: string) => table.properties.some((p) => p.name === column);\n\nasync function readAll(corpus: Corpus, params: Parameters<Corpus[\"scan\"]>[0], signal: AbortSignal): Promise<readonly Batch[]> {\n  const scan = corpus.scan(params);\n  return scan.read(scan.plan(), { signal });\n}\n\nfunction encoder(tables: readonly VertexTable[], size: number, binding: Binding, seed: readonly unknown[]) {\n  const dictionary = new Dictionary(seed);\n  const codes = new Uint32Array(size);\n  const sizes = binding.size === undefined ? null : new Float32Array(size).fill(Number.NaN);\n  return {\n    add(t: number, batch: Batch) {\n      const table = tables[t] as VertexTable;\n      const ids = batch.getChild(table.key)?.toArray() ?? [];\n      const values = binding.category === undefined ? undefined : batch.getChild(binding.category)?.toArray();\n      const ramp = binding.size === undefined ? undefined : batch.getChild(binding.size)?.toArray();\n      const own = binding.byTable ? dictionary.code(table.name) : 0;\n      for (let i = 0; i < batch.numRows; i++) {\n        const id = Number(ids[i]);\n        if (!(id < size)) continue;\n        codes[id] = binding.byTable || binding.category === undefined ? own : dictionary.code(values?.[i] ?? null);\n        if (sizes) sizes[id] = Number(ramp?.[i] ?? Number.NaN);\n      }\n    },\n    finish(): Encoding {\n      const order = dictionary.ranks();\n      const ranks = codes.map((code) => order[code] ?? 0);\n      const domain: unknown[] = [];\n      order.forEach((rank, code) => {\n        domain[rank] = dictionary.values[code];\n      });\n      return { ranks, sizes, domain };\n    },\n  };\n}\n\nfunction extentOf(positions: Float32Array): Geometry[\"extent\"] {\n  let [x0, y0, x1, y1] = [Infinity, Infinity, -Infinity, -Infinity];\n  for (let i = 0; i < positions.length; i += 2) {\n    const x = positions[i] as number;\n    const y = positions[i + 1] as number;\n    if (Number.isNaN(x) || Number.isNaN(y)) continue;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n  return x0 > x1 ? null : { x: x0, y: y0, w: x1 - x0, h: y1 - y0 };\n}\n\nasync function readLinks(corpus: Corpus, tables: readonly VertexTable[], size: number, signal: AbortSignal): Promise<Float32Array> {\n  const drawn = new Set(tables.map((table) => table.name));\n  const relations = corpus.manifest.edge_tables.filter(\n    (edge: EdgeTable) => drawn.has(edge.source.references) && drawn.has(edge.destination.references),\n  );\n  const answers = await Promise.all(\n    relations.map((edge) => readAll(corpus, { table: edge.name, select: [edge.source.key, edge.destination.key] }, signal)),\n  );\n  const links = new Float32Array(2 * relations.reduce((sum, edge) => sum + edge.record_count, 0));\n  let at = 0;\n  answers.forEach((batches, r) => {\n    const edge = relations[r] as EdgeTable;\n    for (const batch of batches) {\n      const src = batch.getChild(edge.source.key)?.toArray() ?? [];\n      const dst = batch.getChild(edge.destination.key)?.toArray() ?? [];\n      for (let e = 0; e < batch.numRows && at < links.length; e++) {\n        const a = Number(src[e]);\n        const b = Number(dst[e]);\n        if (!(a < size && b < size)) continue;\n        links[at++] = a;\n        links[at++] = b;\n      }\n    }\n  });\n  return at === links.length ? links : links.slice(0, at);\n}\n\n/** One scan per drawn table and one per relation between them, read whole, in parallel. */\nexport async function loadGraph(\n  corpus: Corpus,\n  binding: Binding,\n  seed: readonly unknown[],\n  signal: AbortSignal,\n): Promise<{ geometry: Geometry; encoding: Encoding }> {\n  const tables = drawnTables(corpus);\n  const size = tables.reduce((sum, table) => sum + table.record_count, 0);\n  const positions = new Float32Array(2 * size).fill(Number.NaN);\n  const table = new Uint16Array(size);\n  const encode = encoder(tables, size, binding, seed);\n  const [vertices, links] = await Promise.all([\n    Promise.all(\n      tables.map((t) => {\n        const { x, y } = t.position as NonNullable<VertexTable[\"position\"]>;\n        return readAll(corpus, { table: t.name, select: projectionOf(binding, [t.key, x, y], has(t)) }, signal);\n      }),\n    ),\n    readLinks(corpus, tables, size, signal),\n  ]);\n  vertices.forEach((batches, t) => {\n    const { key, position } = tables[t] as VertexTable;\n    for (const batch of batches) {\n      const ids = batch.getChild(key)?.toArray() ?? [];\n      const xs = batch.getChild(position?.x ?? \"\")?.toArray() ?? [];\n      const ys = batch.getChild(position?.y ?? \"\")?.toArray() ?? [];\n      for (let i = 0; i < batch.numRows; i++) {\n        const id = Number(ids[i]);\n        if (!(id < size)) continue;\n        positions[id * 2] = Number(xs[i] ?? Number.NaN);\n        positions[id * 2 + 1] = Number(ys[i] ?? Number.NaN);\n        table[id] = t;\n      }\n      encode.add(t, batch);\n    }\n  });\n  return { geometry: { tables, size, positions, table, links, extent: extentOf(positions) }, encoding: encode.finish() };\n}\n\n/** A new binding re-reads the channels and nothing else: the positions and the links stay uploaded. */\nexport async function loadEncoding(\n  corpus: Corpus,\n  geometry: Geometry,\n  binding: Binding,\n  seed: readonly unknown[],\n  signal: AbortSignal,\n): Promise<Encoding> {\n  const { tables, size } = geometry;\n  const encode = encoder(tables, size, binding, seed);\n  const answers = await Promise.all(\n    tables.map((t) => readAll(corpus, { table: t.name, select: projectionOf(binding, [t.key], has(t)) }, signal)),\n  );\n  answers.forEach((batches, t) => {\n    for (const batch of batches) encode.add(t, batch);\n  });\n  return encode.finish();\n}\n\n/** What a filter kept: per table that holds every column it names, the surviving ids. */\nexport interface Kept {\n  readonly filtered: ReadonlySet<number>;\n  readonly ids: readonly number[];\n}\n\n/**\n * **A predicate, applied as a mask.** A table that lacks a column the filter names is not filtered,\n * which is what a `WHERE` over a union of the tables would do; a filter no drawn table can answer at\n * all is refused, so the unfiltered picture is never drawn as the filtered one.\n */\nexport async function readKept(corpus: Corpus, tables: readonly VertexTable[], filter: Filter, signal: AbortSignal): Promise<Kept> {\n  const columns = columnsOf(filter);\n  const filtered = tables.flatMap((table, t) => (columns.every(has(table)) ? [t] : []));\n  if (filtered.length === 0) {\n    throw new Error(`no drawn vertex type has every column this filter names: ${columns.join(\", \")}`);\n  }\n  const answers = await Promise.all(\n    filtered.map((t) => readAll(corpus, { table: (tables[t] as VertexTable).name, filter, select: [(tables[t] as VertexTable).key] }, signal)),\n  );\n  const ids: number[] = [];\n  answers.forEach((batches, i) => {\n    const { key } = tables[filtered[i] as number] as VertexTable;\n    for (const batch of batches) {\n      const column = batch.getChild(key)?.toArray() ?? [];\n      for (let r = 0; r < batch.numRows; r++) ids.push(Number(column[r]));\n    }\n  });\n  return { filtered: new Set(filtered), ids };\n}\n\n/** `1` where a vertex survives the page's filter. */\nexport function maskOf(geometry: Geometry, kept: Kept): Uint8Array {\n  const mask = new Uint8Array(geometry.size);\n  for (let id = 0; id < geometry.size; id++) mask[id] = kept.filtered.has(geometry.table[id] as number) ? 0 : 1;\n  for (const id of kept.ids) if (id < geometry.size) mask[id] = 1;\n  return mask;\n}\n"],"names":["drawnTables","corpus","table","has","column","p","readAll","params","signal","scan","encoder","tables","size","binding","seed","dictionary","Dictionary","codes","sizes","t","batch","ids","_a","values","_b","ramp","_c","own","i","id","order","ranks","code","domain","rank","extentOf","positions","x0","y0","x1","y1","x","y","readLinks","drawn","relations","edge","answers","links","sum","at","batches","r","src","dst","e","a","b","loadGraph","encode","vertices","projectionOf","key","position","xs","ys","loadEncoding","geometry","readKept","filter","columns","columnsOf","filtered","maskOf","kept","mask"],"mappings":";;;AAqCO,MAAMA,IAAc,CAACC,MAAkCA,EAAO,SAAS,cAAc,OAAO,CAACC,MAAUA,EAAM,QAAQ,GAEtHC,IAAM,CAACD,MAAuB,CAACE,MAAmBF,EAAM,WAAW,KAAK,CAACG,MAAMA,EAAE,SAASD,CAAM;AAEtG,eAAeE,EAAQL,GAAgBM,GAAuCC,GAAgD;AAC5H,QAAMC,IAAOR,EAAO,KAAKM,CAAM;AAC/B,SAAOE,EAAK,KAAKA,EAAK,QAAQ,EAAE,QAAAD,GAAQ;AAC1C;AAEA,SAASE,EAAQC,GAAgCC,GAAcC,GAAkBC,GAA0B;AACzG,QAAMC,IAAa,IAAIC,EAAWF,CAAI,GAChCG,IAAQ,IAAI,YAAYL,CAAI,GAC5BM,IAAQL,EAAQ,SAAS,SAAY,OAAO,IAAI,aAAaD,CAAI,EAAE,KAAK,OAAO,GAAG;AACxF,SAAO;AAAA,IACL,IAAIO,GAAWC,GAAc;;AAC3B,YAAMlB,IAAQS,EAAOQ,CAAC,GAChBE,MAAMC,IAAAF,EAAM,SAASlB,EAAM,GAAG,MAAxB,gBAAAoB,EAA2B,cAAa,CAAA,GAC9CC,IAASV,EAAQ,aAAa,WAAwBW,IAAAJ,EAAM,SAASP,EAAQ,QAAQ,MAA/B,OAAZ,SAAYW,EAAkC,WACxFC,IAAOZ,EAAQ,SAAS,WAAwBa,IAAAN,EAAM,SAASP,EAAQ,IAAI,MAA3B,OAAZ,SAAYa,EAA8B,WAC9EC,IAAMd,EAAQ,UAAUE,EAAW,KAAKb,EAAM,IAAI,IAAI;AAC5D,eAAS0B,IAAI,GAAGA,IAAIR,EAAM,SAASQ,KAAK;AACtC,cAAMC,IAAK,OAAOR,EAAIO,CAAC,CAAC;AACxB,QAAMC,IAAKjB,MACXK,EAAMY,CAAE,IAAIhB,EAAQ,WAAWA,EAAQ,aAAa,SAAYc,IAAMZ,EAAW,MAAKQ,KAAA,gBAAAA,EAASK,OAAM,IAAI,GACrGV,QAAaW,CAAE,IAAI,QAAOJ,KAAA,gBAAAA,EAAOG,OAAM,OAAO,GAAG;AAAA,MACvD;AAAA,IACF;AAAA,IACA,SAAmB;AACjB,YAAME,IAAQf,EAAW,MAAA,GACnBgB,IAAQd,EAAM,IAAI,CAACe,MAASF,EAAME,CAAI,KAAK,CAAC,GAC5CC,IAAoB,CAAA;AAC1B,aAAAH,EAAM,QAAQ,CAACI,GAAMF,MAAS;AAC5B,QAAAC,EAAOC,CAAI,IAAInB,EAAW,OAAOiB,CAAI;AAAA,MACvC,CAAC,GACM,EAAE,OAAAD,GAAO,OAAAb,GAAO,QAAAe,EAAA;AAAA,IACzB;AAAA,EAAA;AAEJ;AAEA,SAASE,EAASC,GAA6C;AAC7D,MAAI,CAACC,GAAIC,GAAIC,GAAIC,CAAE,IAAI,CAAC,OAAU,OAAU,QAAW,MAAS;AAChE,WAASZ,IAAI,GAAGA,IAAIQ,EAAU,QAAQR,KAAK,GAAG;AAC5C,UAAMa,IAAIL,EAAUR,CAAC,GACfc,IAAIN,EAAUR,IAAI,CAAC;AACzB,IAAI,OAAO,MAAMa,CAAC,KAAK,OAAO,MAAMC,CAAC,MACjCD,IAAIJ,MAAIA,IAAKI,IACbA,IAAIF,MAAIA,IAAKE,IACbC,IAAIJ,MAAIA,IAAKI,IACbA,IAAIF,MAAIA,IAAKE;AAAA,EACnB;AACA,SAAOL,IAAKE,IAAK,OAAO,EAAE,GAAGF,GAAI,GAAGC,GAAI,GAAGC,IAAKF,GAAI,GAAGG,IAAKF,EAAA;AAC9D;AAEA,eAAeK,EAAU1C,GAAgBU,GAAgCC,GAAcJ,GAA4C;AACjI,QAAMoC,IAAQ,IAAI,IAAIjC,EAAO,IAAI,CAACT,MAAUA,EAAM,IAAI,CAAC,GACjD2C,IAAY5C,EAAO,SAAS,YAAY;AAAA,IAC5C,CAAC6C,MAAoBF,EAAM,IAAIE,EAAK,OAAO,UAAU,KAAKF,EAAM,IAAIE,EAAK,YAAY,UAAU;AAAA,EAAA,GAE3FC,IAAU,MAAM,QAAQ;AAAA,IAC5BF,EAAU,IAAI,CAACC,MAASxC,EAAQL,GAAQ,EAAE,OAAO6C,EAAK,MAAM,QAAQ,CAACA,EAAK,OAAO,KAAKA,EAAK,YAAY,GAAG,EAAA,GAAKtC,CAAM,CAAC;AAAA,EAAA,GAElHwC,IAAQ,IAAI,aAAa,IAAIH,EAAU,OAAO,CAACI,GAAKH,MAASG,IAAMH,EAAK,cAAc,CAAC,CAAC;AAC9F,MAAII,IAAK;AACT,SAAAH,EAAQ,QAAQ,CAACI,GAASC,MAAM;;AAC9B,UAAMN,IAAOD,EAAUO,CAAC;AACxB,eAAWhC,KAAS+B,GAAS;AAC3B,YAAME,MAAM/B,IAAAF,EAAM,SAAS0B,EAAK,OAAO,GAAG,MAA9B,gBAAAxB,EAAiC,cAAa,CAAA,GACpDgC,MAAM9B,IAAAJ,EAAM,SAAS0B,EAAK,YAAY,GAAG,MAAnC,gBAAAtB,EAAsC,cAAa,CAAA;AAC/D,eAAS+B,IAAI,GAAGA,IAAInC,EAAM,WAAW8B,IAAKF,EAAM,QAAQO,KAAK;AAC3D,cAAMC,IAAI,OAAOH,EAAIE,CAAC,CAAC,GACjBE,IAAI,OAAOH,EAAIC,CAAC,CAAC;AACvB,QAAMC,IAAI5C,KAAQ6C,IAAI7C,MACtBoC,EAAME,GAAI,IAAIM,GACdR,EAAME,GAAI,IAAIO;AAAA,MAChB;AAAA,IACF;AAAA,EACF,CAAC,GACMP,MAAOF,EAAM,SAASA,IAAQA,EAAM,MAAM,GAAGE,CAAE;AACxD;AAGA,eAAsBQ,EACpBzD,GACAY,GACAC,GACAN,GACqD;AACrD,QAAMG,IAASX,EAAYC,CAAM,GAC3BW,IAAOD,EAAO,OAAO,CAACsC,GAAK/C,MAAU+C,IAAM/C,EAAM,cAAc,CAAC,GAChEkC,IAAY,IAAI,aAAa,IAAIxB,CAAI,EAAE,KAAK,OAAO,GAAG,GACtDV,IAAQ,IAAI,YAAYU,CAAI,GAC5B+C,IAASjD,EAAQC,GAAQC,GAAMC,GAASC,CAAI,GAC5C,CAAC8C,GAAUZ,CAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC1C,QAAQ;AAAA,MACNrC,EAAO,IAAI,CAACQ,MAAM;AAChB,cAAM,EAAE,GAAAsB,GAAG,GAAAC,EAAA,IAAMvB,EAAE;AACnB,eAAOb,EAAQL,GAAQ,EAAE,OAAOkB,EAAE,MAAM,QAAQ0C,EAAahD,GAAS,CAACM,EAAE,KAAKsB,GAAGC,CAAC,GAAGvC,EAAIgB,CAAC,CAAC,EAAA,GAAKX,CAAM;AAAA,MACxG,CAAC;AAAA,IAAA;AAAA,IAEHmC,EAAU1C,GAAQU,GAAQC,GAAMJ,CAAM;AAAA,EAAA,CACvC;AACD,SAAAoD,EAAS,QAAQ,CAACT,GAAShC,MAAM;;AAC/B,UAAM,EAAE,KAAA2C,GAAK,UAAAC,MAAapD,EAAOQ,CAAC;AAClC,eAAWC,KAAS+B,GAAS;AAC3B,YAAM9B,MAAMC,IAAAF,EAAM,SAAS0C,CAAG,MAAlB,gBAAAxC,EAAqB,cAAa,CAAA,GACxC0C,MAAKxC,IAAAJ,EAAM,UAAS2C,KAAA,gBAAAA,EAAU,MAAK,EAAE,MAAhC,gBAAAvC,EAAmC,cAAa,CAAA,GACrDyC,MAAKvC,IAAAN,EAAM,UAAS2C,KAAA,gBAAAA,EAAU,MAAK,EAAE,MAAhC,gBAAArC,EAAmC,cAAa,CAAA;AAC3D,eAASE,IAAI,GAAGA,IAAIR,EAAM,SAASQ,KAAK;AACtC,cAAMC,IAAK,OAAOR,EAAIO,CAAC,CAAC;AACxB,QAAMC,IAAKjB,MACXwB,EAAUP,IAAK,CAAC,IAAI,OAAOmC,EAAGpC,CAAC,KAAK,OAAO,GAAG,GAC9CQ,EAAUP,IAAK,IAAI,CAAC,IAAI,OAAOoC,EAAGrC,CAAC,KAAK,OAAO,GAAG,GAClD1B,EAAM2B,CAAE,IAAIV;AAAA,MACd;AACA,MAAAwC,EAAO,IAAIxC,GAAGC,CAAK;AAAA,IACrB;AAAA,EACF,CAAC,GACM,EAAE,UAAU,EAAE,QAAAT,GAAQ,MAAAC,GAAM,WAAAwB,GAAW,OAAAlC,GAAO,OAAA8C,GAAO,QAAQb,EAASC,CAAS,EAAA,GAAK,UAAUuB,EAAO,SAAO;AACrH;AAGA,eAAsBO,EACpBjE,GACAkE,GACAtD,GACAC,GACAN,GACmB;AACnB,QAAM,EAAE,QAAAG,GAAQ,MAAAC,EAAA,IAASuD,GACnBR,IAASjD,EAAQC,GAAQC,GAAMC,GAASC,CAAI;AAIlD,UAHgB,MAAM,QAAQ;AAAA,IAC5BH,EAAO,IAAI,CAAC,MAAML,EAAQL,GAAQ,EAAE,OAAO,EAAE,MAAM,QAAQ4D,EAAahD,GAAS,CAAC,EAAE,GAAG,GAAGV,EAAI,CAAC,CAAC,EAAA,GAAKK,CAAM,CAAC;AAAA,EAAA,GAEtG,QAAQ,CAAC2C,GAAShC,MAAM;AAC9B,eAAWC,KAAS+B,EAAS,CAAAQ,EAAO,IAAIxC,GAAGC,CAAK;AAAA,EAClD,CAAC,GACMuC,EAAO,OAAA;AAChB;AAaA,eAAsBS,EAASnE,GAAgBU,GAAgC0D,GAAgB7D,GAAoC;AACjI,QAAM8D,IAAUC,EAAUF,CAAM,GAC1BG,IAAW7D,EAAO,QAAQ,CAACT,GAAO,MAAOoE,EAAQ,MAAMnE,EAAID,CAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAA,CAAG;AACpF,MAAIsE,EAAS,WAAW;AACtB,UAAM,IAAI,MAAM,4DAA4DF,EAAQ,KAAK,IAAI,CAAC,EAAE;AAElG,QAAMvB,IAAU,MAAM,QAAQ;AAAA,IAC5ByB,EAAS,IAAI,CAACrD,MAAMb,EAAQL,GAAQ,EAAE,OAAQU,EAAOQ,CAAC,EAAkB,MAAM,QAAAkD,GAAQ,QAAQ,CAAE1D,EAAOQ,CAAC,EAAkB,GAAG,EAAA,GAAKX,CAAM,CAAC;AAAA,EAAA,GAErIa,IAAgB,CAAA;AACtB,SAAA0B,EAAQ,QAAQ,CAACI,GAASvB,MAAM;;AAC9B,UAAM,EAAE,KAAAkC,EAAA,IAAQnD,EAAO6D,EAAS5C,CAAC,CAAW;AAC5C,eAAWR,KAAS+B,GAAS;AAC3B,YAAM/C,MAASkB,IAAAF,EAAM,SAAS0C,CAAG,MAAlB,gBAAAxC,EAAqB,cAAa,CAAA;AACjD,eAAS8B,IAAI,GAAGA,IAAIhC,EAAM,SAASgC,IAAK,CAAA/B,EAAI,KAAK,OAAOjB,EAAOgD,CAAC,CAAC,CAAC;AAAA,IACpE;AAAA,EACF,CAAC,GACM,EAAE,UAAU,IAAI,IAAIoB,CAAQ,GAAG,KAAAnD,EAAA;AACxC;AAGO,SAASoD,EAAON,GAAoBO,GAAwB;AACjE,QAAMC,IAAO,IAAI,WAAWR,EAAS,IAAI;AACzC,WAAStC,IAAK,GAAGA,IAAKsC,EAAS,MAAMtC,IAAM,CAAA8C,EAAK9C,CAAE,IAAI6C,EAAK,SAAS,IAAIP,EAAS,MAAMtC,CAAE,CAAW,IAAI,IAAI;AAC5G,aAAWA,KAAM6C,EAAK,IAAK,CAAI7C,IAAKsC,EAAS,SAAMQ,EAAK9C,CAAE,IAAI;AAC9D,SAAO8C;AACT;"}

package/dist/core/state.d.ts

@@ -1,39 +1,35 @@
-import { Corpus, Gap, TileAddress, TileMatrixSet } from '@fossil-lang/corpus';
 import { Selection as Crossfilter } from '@kanzo-tech/mosaic';
 import { LookPatch } from '../render/graph-looks';
 import { Sim } from '../render/graph-sim';
 import { Binding, Channels } from './channels';
-import { VertexId } from './resident';
-import { TileContent } from './tile';
-import { Viewport } from './tile-matrix';
-import { Motion, Selection, SelectionSource, Tool } from './types';
+import { Corpus } from '@fossil-lang/corpus';
+import { Encoding, Geometry } from './load';
+import { Motion, Selection, SelectionSource, Tool, VertexId } from './types';
 export interface GraphOptions extends Channels {
     /**
      * The corpus the host opened with fossil's `open`, or the promise of it. A promise is what makes
      * *opening* a state the graph can report; `null` is no corpus at all.
      */
     corpus: Corpus | PromiseLike<Corpus> | null;
-    /** The vertex type drawn. The first type with a position when absent. */
-    type?: string;
     /** Which column the size ramp is spent on — Plot's `r`. */
     r?: string;
-    /** Which column a label and the hover card show — Plot's `title`. */
+    /** Which column a label and the hover card show — Plot's `title`. Absent, each table's `identity`. */
     title?: string;
     /**
-     * What the categorical channel's values are called, keyed by value. For a column the manifest's
-     * `channels:` declares, the ordinals rank themselves and this only names them; for one it does not,
-     * the keys' order is also the rank, so a colour never moves because a tile arrived.
+     * What the categorical channel's values are called, keyed by value; the keys' order is also the
+     * rank, so a colour never moves because a row arrived. With colour by type, the keys are table names.
      */
     categories?: Readonly<Record<string, string>>;
-    /** The page's crossfilter: its clauses filter what is read, and the reader's pick is published into it. */
+    /** The page's crossfilter: its clauses filter what is drawn, and the reader's pick is published into it. */
     filterBy?: Crossfilter;
-    /** The most marks drawn at once; a coarser zoom is chosen above it. */
-    limit?: number;
     /** Form: a patch over this package's own look. Memoise it — its identity is what repaints. */
     look?: LookPatch;
     /** The force coefficients, as a patch over this package's own. */
     sim?: Partial<Sim>;
-    /** A live layout. Off: a corpus's positions are the index every read is asked against. */
+    /**
+     * Runs the live layout while true, from the points' current positions. Off by default: the corpus's
+     * positions are drawn as they are. `GraphToolbar` starts and stops the layout whatever this says.
+     */
     simulate?: boolean;
     /** Required: unhandled, a browser with no WebGL context shows an empty box. */
     onFailure: (message: string) => void;
@@ -42,34 +38,28 @@ export interface GraphOptions extends Channels {
 }
 /**
  * Where the graph is in its life. `none` is no corpus; `opening` is a corpus promised and not yet
- * open; `reading` is a tile in view not yet read or not yet drawn; `idle` is everything in view
- * drawn; `failed` is a corpus that would not open, a type it cannot draw, or a canvas that could not
- * start a renderer.
+ * open; `loading` is the graph, a binding or a filter not yet read or not yet drawn; `idle` is all of
+ * it drawn; `failed` is a corpus that would not open or read, or a canvas that could not start a
+ * renderer.
  */
-export type GraphStatus = "none" | "opening" | "reading" | "idle" | "failed";
-/** What is on the canvas, as the renderer composed it. */
+export type GraphStatus = "none" | "opening" | "loading" | "idle" | "failed";
+/** What the loaded graph holds, under the page's filter. */
 export interface Drawn {
-    /** Points drawn — vertices and cells. */
-    readonly marks: number;
-    /** Vertices those marks stand for: a cell counts its members. */
-    readonly represented: number;
-    /** What each category rank is: the declared or named values first, then any other seen, in rank order. */
+    /** Vertices drawn: every one with a position that survives the filter. */
+    readonly vertices: number;
+    /** What each category rank is: the seed first, then any other value seen, in rank order. */
     readonly domain: readonly unknown[];
-    /** Per rank, the vertices drawn marks stand for. */
+    /** Per rank, the vertices drawn. */
     readonly tally: readonly number[];
 }
 /** What a host and the parts read, through `useGraphState`. */
 export interface GraphState {
     readonly status: GraphStatus;
-    /** Vertices of the drawn type, from the manifest — it does not shrink with a filter. */
+    /** Vertices of the drawn types, from the manifest — it does not shrink with a filter. */
     readonly total: number | undefined;
-    /** The zoom drawn, coarsest `0`; the payload is the last. */
-    readonly z: number | null;
-    /** Whether a tile in view is still being read. */
-    readonly pending: boolean;
-    /** What is on the canvas, or `null` before the first composition. */
+    /** What is loaded, or `null` before the graph has loaded. */
     readonly drawn: Drawn | null;
-    /** The categorical domain before anything is drawn: the manifest's ordinals, or the host's names. */
+    /** The categorical domain before anything is loaded: the drawn tables, or the host's names. */
     readonly domain: readonly unknown[];
     readonly selection: Selection | null;
     readonly focus: VertexId | null;
@@ -79,30 +69,17 @@ export interface GraphState {
     readonly motion: Motion;
     /** How far through settling a live layout is, `0`–`1`. */
     readonly progress: number;
-    /** Relations the corpus declined to answer, with fossil's reason. */
-    readonly declined: readonly Gap[];
     /** The options as given, with the corpus once it is open. */
     readonly options: GraphOptions;
     readonly corpus: Corpus | null;
 }
-/** One tile the picture is made of: where it is, and what it holds. */
-export interface TileView {
-    readonly address: TileAddress;
-    readonly kind: "rows" | "cells";
-    readonly content: TileContent;
-}
-/** The state, plus what only the renderer reads. */
+/** The state, plus what only the renderer and the parts read. */
 export interface GraphSnapshot extends GraphState {
-    readonly matrix: TileMatrixSet | null;
-    /** The drawn type's position in `corpus.types.vertices` — the type half of a `VertexId`. */
-    readonly typeIndex: number;
     readonly binding: Binding;
-    /** The payload column a cell's `mode` is the majority of, or `null` where the tree names none. */
-    readonly modeColumn: string | null;
-    /** Tiles drawn now; the same array until the set changes. */
-    readonly visible: readonly TileView[];
-    /** Every tile holding content — where a far end is looked up. */
-    readonly cached: readonly TileView[];
+    readonly geometry: Geometry | null;
+    readonly encoding: Encoding | null;
+    /** `1` where a vertex survives the page's filter; `null` when nothing is filtered. */
+    readonly mask: Uint8Array | null;
 }
 /**
  * **The graph's state, outside React** — TanStack Query's `QueryObserver` shape: `subscribe`,
@@ -115,8 +92,6 @@ export interface GraphStore {
     getOptions(): GraphOptions;
     setOptions(options: GraphOptions): void;
     destroy(): void;
-    /** The camera, from the renderer: the rectangle in view. */
-    setViewport(viewport: Viewport): void;
     select(vertices: readonly VertexId[] | null, source?: SelectionSource, label?: string): void;
     focus(vertex: VertexId | null): void;
     hover(vertex: VertexId | null): void;
@@ -124,9 +99,9 @@ export interface GraphStore {
     setTool(tool: Tool): void;
     report(motion: Motion): void;
     reportProgress(value: number): void;
-    /** Whether the canvas has a renderer: without one nothing in view will ever be drawn. */
+    /** Whether the canvas has a renderer: without one nothing will ever be drawn. */
     setRenderable(renderable: boolean): void;
-    /** The renderer drew `visible`; `drawn` is what it composed, or `null` when the set was unchanged. */
-    reportDrawn(visible: readonly TileView[], drawn: Drawn | null): void;
+    /** The renderer uploaded this snapshot's geometry, encoding and mask. */
+    reportDrawn(snapshot: GraphSnapshot): void;
 }
 //# sourceMappingURL=state.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/core/state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACnF,OAAO,KAAK,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAExE,MAAM,WAAW,YAAa,SAAQ,QAAQ;IAC5C;;;OAGG;IACH,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC5C,yEAAyE;IACzE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,qEAAqE;IACrE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9C,2GAA2G;IAC3G,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,uEAAuE;IACvE,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8FAA8F;IAC9F,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,kEAAkE;IAClE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACnB,0FAA0F;IAC1F,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,+EAA+E;IAC/E,SAAS,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;IACrC,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,KAAK,IAAI,CAAC;IACjD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;CAC7C;AAED;;;;;GAKG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC;AAE7E,0DAA0D;AAC1D,MAAM,WAAW,KAAK;IACpB,yCAAyC;IACzC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,0GAA0G;IAC1G,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,+DAA+D;AAC/D,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,wFAAwF;IACxF,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,kDAAkD;IAClD,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,qEAAqE;IACrE,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC7B,qGAAqG;IACrG,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,EAAE,SAAS,GAAG,EAAE,CAAC;IAClC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,uEAAuE;AACvE,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC;CAC/B;AAED,oDAAoD;AACpD,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,CAAC;IACtC,4FAA4F;IAC5F,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,kGAAkG;IAClG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;IACtC,iEAAiE;IACjE,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;CACtC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IAC5C,WAAW,IAAI,aAAa,CAAC;IAC7B,UAAU,IAAI,YAAY,CAAC;IAC3B,UAAU,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;IACxC,OAAO,IAAI,IAAI,CAAC;IAChB,4DAA4D;IAC5D,WAAW,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACtC,MAAM,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7F,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,GAAG,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,CAAC;IACzC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,yFAAyF;IACzF,aAAa,CAAC,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;IACzC,sGAAsG;IACtG,WAAW,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;CACtE"}
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/core/state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACjD,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAElF,MAAM,WAAW,YAAa,SAAQ,QAAQ;IAC5C;;;OAGG;IACH,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC5C,2DAA2D;IAC3D,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,sGAAsG;IACtG,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9C,4GAA4G;IAC5G,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,8FAA8F;IAC9F,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,kEAAkE;IAClE,GAAG,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,+EAA+E;IAC/E,SAAS,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;IACrC,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,KAAK,IAAI,CAAC;IACjD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC;CAC7C;AAED;;;;;GAKG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC;AAE7E,4DAA4D;AAC5D,MAAM,WAAW,KAAK;IACpB,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,4FAA4F;IAC5F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,+DAA+D;AAC/D,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC7B,+FAA+F;IAC/F,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,sFAAsF;IACtF,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;CAClC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IAC5C,WAAW,IAAI,aAAa,CAAC;IAC7B,UAAU,IAAI,YAAY,CAAC;IAC3B,UAAU,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAAC;IACxC,OAAO,IAAI,IAAI,CAAC;IAChB,MAAM,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7F,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;IACrC,GAAG,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,GAAG,IAAI,CAAC;IACzC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,iFAAiF;IACjF,aAAa,CAAC,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;IACzC,yEAAyE;IACzE,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;CAC5C"}

package/dist/core/store.d.ts

@@ -1,6 +1,4 @@
 import { GraphOptions, GraphStore } from './state';
-export type { Drawn, GraphOptions, GraphSnapshot, GraphState, GraphStatus, GraphStore, TileView } from './state';
-/** Twenty thousand marks: what a canvas draws at once before a coarser zoom is chosen. */
-export declare const DEFAULT_LIMIT = 20000;
+export type { Drawn, GraphOptions, GraphSnapshot, GraphState, GraphStatus, GraphStore } from './state';
 export declare function createGraph(initial: GraphOptions): GraphStore;
 //# sourceMappingURL=store.d.ts.map

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

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