@kanzo-tech/graph 0.25.0 → 0.27.0

package/dist/core/load.js.map

@@ -1 +1 @@
-{"version":3,"file":"load.js","sources":["../../src/core/load.ts"],"sourcesContent":["import { GraphError } from \"./error\";\nimport { 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\n/**\n * Reads in parallel that end together: the first to fail aborts the rest, so no read outlives the\n * answer and no second failure goes unheard behind the first.\n */\nexport function together<T>(signal: AbortSignal, reads: (signal: AbortSignal) => Promise<T>): Promise<T> {\n  const local = new AbortController();\n  return reads(AbortSignal.any([signal, local.signal])).catch((error: unknown) => {\n    local.abort();\n    throw error;\n  });\n}\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 together(signal, (signal) =>\n    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  );\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 together(signal, (signal) =>\n    Promise.all(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 GraphError(\"graph/untranslatable-filter\", `no drawn vertex type has every column this filter names: ${columns.join(\", \")}`);\n  }\n  const answers = await together(signal, (signal) =>\n    Promise.all(\n      filtered.map((t) => readAll(corpus, { table: (tables[t] as VertexTable).name, filter, select: [(tables[t] as VertexTable).key] }, signal)),\n    ),\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","together","signal","reads","local","error","readAll","params","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","GraphError","maskOf","kept","mask"],"mappings":";;;;AAsCO,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;AAM/F,SAASE,EAAYC,GAAqBC,GAAwD;AACvG,QAAMC,IAAQ,IAAI,gBAAA;AAClB,SAAOD,EAAM,YAAY,IAAI,CAACD,GAAQE,EAAM,MAAM,CAAC,CAAC,EAAE,MAAM,CAACC,MAAmB;AAC9E,UAAAD,EAAM,MAAA,GACAC;AAAA,EACR,CAAC;AACH;AAEA,eAAeC,EAAQV,GAAgBW,GAAuCL,GAAgD;AAC5H,QAAMM,IAAOZ,EAAO,KAAKW,CAAM;AAC/B,SAAOC,EAAK,KAAKA,EAAK,QAAQ,EAAE,QAAAN,GAAQ;AAC1C;AAEA,SAASO,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,YAAMtB,IAAQa,EAAOQ,CAAC,GAChBE,MAAMC,IAAAF,EAAM,SAAStB,EAAM,GAAG,MAAxB,gBAAAwB,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,KAAKjB,EAAM,IAAI,IAAI;AAC5D,eAAS8B,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,EAAU9C,GAAgBc,GAAgCC,GAAcT,GAA4C;AACjI,QAAMyC,IAAQ,IAAI,IAAIjC,EAAO,IAAI,CAACb,MAAUA,EAAM,IAAI,CAAC,GACjD+C,IAAYhD,EAAO,SAAS,YAAY;AAAA,IAC5C,CAACiD,MAAoBF,EAAM,IAAIE,EAAK,OAAO,UAAU,KAAKF,EAAM,IAAIE,EAAK,YAAY,UAAU;AAAA,EAAA,GAE3FC,IAAU,MAAM,QAAQ;AAAA,IAC5BF,EAAU,IAAI,CAACC,MAASvC,EAAQV,GAAQ,EAAE,OAAOiD,EAAK,MAAM,QAAQ,CAACA,EAAK,OAAO,KAAKA,EAAK,YAAY,GAAG,EAAA,GAAK3C,CAAM,CAAC;AAAA,EAAA,GAElH6C,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,EACpB7D,GACAgB,GACAC,GACAX,GACqD;AACrD,QAAMQ,IAASf,EAAYC,CAAM,GAC3Be,IAAOD,EAAO,OAAO,CAACsC,GAAKnD,MAAUmD,IAAMnD,EAAM,cAAc,CAAC,GAChEsC,IAAY,IAAI,aAAa,IAAIxB,CAAI,EAAE,KAAK,OAAO,GAAG,GACtDd,IAAQ,IAAI,YAAYc,CAAI,GAC5B+C,IAASjD,EAAQC,GAAQC,GAAMC,GAASC,CAAI,GAC5C,CAAC8C,GAAUZ,CAAK,IAAI,MAAM9C;AAAA,IAASC;AAAA,IAAQ,CAACA,MAChD,QAAQ,IAAI;AAAA,MACV,QAAQ;AAAA,QACNQ,EAAO,IAAI,CAACQ,MAAM;AAChB,gBAAM,EAAE,GAAAsB,GAAG,GAAAC,EAAA,IAAMvB,EAAE;AACnB,iBAAOZ,EAAQV,GAAQ,EAAE,OAAOsB,EAAE,MAAM,QAAQ0C,EAAahD,GAAS,CAACM,EAAE,KAAKsB,GAAGC,CAAC,GAAG3C,EAAIoB,CAAC,CAAC,EAAA,GAAKhB,CAAM;AAAA,QACxG,CAAC;AAAA,MAAA;AAAA,MAEHwC,EAAU9C,GAAQc,GAAQC,GAAMT,CAAM;AAAA,IAAA,CACvC;AAAA,EAAA;AAEH,SAAAyD,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,GAClD9B,EAAM+B,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,OAAAtC,GAAO,OAAAkD,GAAO,QAAQb,EAASC,CAAS,EAAA,GAAK,UAAUuB,EAAO,SAAO;AACrH;AAGA,eAAsBO,EACpBrE,GACAsE,GACAtD,GACAC,GACAX,GACmB;AACnB,QAAM,EAAE,QAAAQ,GAAQ,MAAAC,EAAA,IAASuD,GACnBR,IAASjD,EAAQC,GAAQC,GAAMC,GAASC,CAAI;AAIlD,UAHgB,MAAMZ;AAAA,IAASC;AAAA,IAAQ,CAACA,MACtC,QAAQ,IAAIQ,EAAO,IAAI,CAACQ,MAAMZ,EAAQV,GAAQ,EAAE,OAAOsB,EAAE,MAAM,QAAQ0C,EAAahD,GAAS,CAACM,EAAE,GAAG,GAAGpB,EAAIoB,CAAC,CAAC,EAAA,GAAKhB,CAAM,CAAC,CAAC;AAAA,EAAA,GAEnH,QAAQ,CAACgD,GAAShC,MAAM;AAC9B,eAAWC,KAAS+B,EAAS,CAAAQ,EAAO,IAAIxC,GAAGC,CAAK;AAAA,EAClD,CAAC,GACMuC,EAAO,OAAA;AAChB;AAaA,eAAsBS,EAASvE,GAAgBc,GAAgC0D,GAAgBlE,GAAoC;AACjI,QAAMmE,IAAUC,EAAUF,CAAM,GAC1BG,IAAW7D,EAAO,QAAQ,CAACb,GAAOqB,MAAOmD,EAAQ,MAAMvE,EAAID,CAAK,CAAC,IAAI,CAACqB,CAAC,IAAI,CAAA,CAAG;AACpF,MAAIqD,EAAS,WAAW;AACtB,UAAM,IAAIC,EAAW,+BAA+B,4DAA4DH,EAAQ,KAAK,IAAI,CAAC,EAAE;AAEtI,QAAMvB,IAAU,MAAM7C;AAAA,IAASC;AAAA,IAAQ,CAACA,MACtC,QAAQ;AAAA,MACNqE,EAAS,IAAI,CAACrD,MAAMZ,EAAQV,GAAQ,EAAE,OAAQc,EAAOQ,CAAC,EAAkB,MAAM,QAAAkD,GAAQ,QAAQ,CAAE1D,EAAOQ,CAAC,EAAkB,GAAG,EAAA,GAAKhB,CAAM,CAAC;AAAA,IAAA;AAAA,EAC3I,GAEIkB,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,YAAMnD,MAASsB,IAAAF,EAAM,SAAS0C,CAAG,MAAlB,gBAAAxC,EAAqB,cAAa,CAAA;AACjD,eAAS8B,IAAI,GAAGA,IAAIhC,EAAM,SAASgC,IAAK,CAAA/B,EAAI,KAAK,OAAOrB,EAAOoD,CAAC,CAAC,CAAC;AAAA,IACpE;AAAA,EACF,CAAC,GACM,EAAE,UAAU,IAAI,IAAIoB,CAAQ,GAAG,KAAAnD,EAAA;AACxC;AAGO,SAASqD,EAAOP,GAAoBQ,GAAwB;AACjE,QAAMC,IAAO,IAAI,WAAWT,EAAS,IAAI;AACzC,WAAStC,IAAK,GAAGA,IAAKsC,EAAS,MAAMtC,IAAM,CAAA+C,EAAK/C,CAAE,IAAI8C,EAAK,SAAS,IAAIR,EAAS,MAAMtC,CAAE,CAAW,IAAI,IAAI;AAC5G,aAAWA,KAAM8C,EAAK,IAAK,CAAI9C,IAAKsC,EAAS,SAAMS,EAAK/C,CAAE,IAAI;AAC9D,SAAO+C;AACT;"}
+{"version":3,"file":"load.js","sources":["../../src/core/load.ts"],"sourcesContent":["import type { Coordinator } from \"@kanzo-tech/mosaic\";\nimport { Dictionary } from \"./categories\";\nimport type { Binding } from \"./channels\";\nimport { readColumns, readLinks, type Structure } from \"./source\";\n\n/**\n * **The whole graph, read once and laid out as cosmos.gl's buffers.** A vertex's `dense_id` is its\n * index, and a vertex table is one contiguous range of them, so each table's answer is written into\n * its own slice and nothing is resolved row by row.\n */\n\n/** Where the vertices start and how they connect — read once per corpus and per position binding. */\nexport interface Geometry {\n  readonly structure: Structure;\n  /** Every vertex: ids `0 … size − 1`. */\n  readonly size: number;\n  /**\n   * `[x, y, …]` by id. With `x` and `y` bound, the columns' values — `NaN` where a table lacks them,\n   * which cosmos.gl does not draw. Unbound, a seeded start for the layout, inside `space`.\n   */\n  readonly positions: Float32Array;\n  /** Whether the positions are the data's (`x`/`y` bound) or a start for the layout to move. */\n  readonly bound: boolean;\n  /** `[src, dst, …]` by id, every relation. */\n  readonly links: Float32Array;\n  /** Bound positions' extent; `null` for a layout's start, whose square is `space`. */\n  readonly extent: { readonly x: number; readonly y: number; readonly w: number; readonly h: number } | null;\n  /** The side of the square the layout runs in. */\n  readonly space: number;\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 size ramp's raw value: the bound `r` column, or the vertex's degree. */\n  readonly sizes: Float32Array;\n  /** By id, the cluster a layout pulls the vertex toward, or `null` when `cluster` is unbound. */\n  readonly clusters: (number | undefined)[] | null;\n  /** What each rank is: the seed, then the other values seen, in rank order. */\n  readonly domain: readonly unknown[];\n}\n\n/**\n * The layout's square: cosmos.gl's own 4,096 up to 200,000 vertices, and twice that past them —\n * measured on the gate in `/docs/graph/layout`: at 500,000 the default square presses the layout\n * against its border and the communities mix.\n */\nexport const spaceFor = (size: number): number => (size > 200_000 ? 8192 : 4096);\n\n/** A seeded `[0, 1)`: the same start for the same corpus, so a layout is reproducible. */\nfunction random(seed: number): () => number {\n  let a = seed >>> 0;\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0;\n    let t = a;\n    t = Math.imul(t ^ (t >>> 15), t | 1);\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n  };\n}\n\n/**\n * **Cosmograph's start**: a Gaussian around the square's centre, its spread growing with the graph up\n * to an eighth of the side — tight enough that the forces gather it in a few hundred ticks, wide\n * enough that a million points are not one pixel.\n */\nfunction seeded(size: number, space: number): Float32Array {\n  const next = random(size);\n  const sigma = (space / 8) * Math.sqrt(Math.min(1, size / 1.5e6));\n  const positions = new Float32Array(2 * size);\n  for (let i = 0; i < size; i++) {\n    const r = Math.sqrt(-2 * Math.log(1 - next())) * sigma;\n    const theta = 2 * Math.PI * next();\n    positions[2 * i] = space / 2 + r * Math.cos(theta);\n    positions[2 * i + 1] = space / 2 + r * Math.sin(theta);\n  }\n  return positions;\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\n/** The links, and the positions: two bound columns, or a seeded start for the layout. */\nexport async function loadGeometry(coordinator: Coordinator, structure: Structure, binding: Binding): Promise<Geometry> {\n  const { size } = structure;\n  const space = spaceFor(size);\n  const bound = binding.x !== undefined && binding.y !== undefined;\n  const [links, columns] = await Promise.all([\n    readLinks(coordinator, structure),\n    bound ? readColumns(coordinator, structure, [binding.x as string, binding.y as string]) : Promise.resolve([]),\n  ]);\n  if (!bound) return { structure, size, positions: seeded(size, space), bound, links, extent: null, space };\n  const positions = new Float32Array(2 * size).fill(Number.NaN);\n  for (const { table, answer } of columns) {\n    const xs = answer.getChild(binding.x as string)?.toArray() ?? [];\n    const ys = answer.getChild(binding.y as string)?.toArray() ?? [];\n    for (let i = 0; i < answer.numRows; i++) {\n      const at = 2 * (table.first + i);\n      positions[at] = xs[i] === null ? Number.NaN : Number(xs[i]);\n      positions[at + 1] = ys[i] === null ? Number.NaN : Number(ys[i]);\n    }\n  }\n  return { structure, size, positions, bound, links, extent: extentOf(positions), space };\n}\n\n/** Each vertex's degree over every relation — the size a point takes when `r` is unbound. */\nfunction degrees(size: number, links: Float32Array): Float32Array {\n  const degree = new Float32Array(size);\n  for (let i = 0; i < links.length; i++) {\n    const id = links[i] as number;\n    degree[id] = (degree[id] as number) + 1;\n  }\n  return degree;\n}\n\n/** The bound channels — category, size and cluster — over every vertex. */\nexport async function loadEncoding(\n  coordinator: Coordinator,\n  geometry: Geometry,\n  binding: Binding,\n  seed: readonly unknown[],\n): Promise<Encoding> {\n  const { structure, size } = geometry;\n  const select = [binding.category, binding.size, binding.cluster].filter((c): c is string => c !== undefined);\n  const answers = select.length > 0 ? await readColumns(coordinator, structure, [...new Set(select)]) : [];\n  const dictionary = new Dictionary(seed);\n  const codes = new Uint32Array(size);\n  const sizes = binding.size === undefined ? degrees(size, geometry.links) : new Float32Array(size).fill(Number.NaN);\n  const groups = binding.cluster === undefined ? null : new Dictionary();\n  const clusters: (number | undefined)[] | null = groups ? new Array<number | undefined>(size) : null;\n  if (binding.byTable) {\n    for (const table of structure.vertices) codes.fill(dictionary.code(table.name), table.first, table.first + table.rows);\n  } else if (binding.category === undefined) {\n    codes.fill(dictionary.code(null));\n  }\n  for (const { table, answer } of answers) {\n    const values = binding.category === undefined || binding.byTable ? undefined : answer.getChild(binding.category)?.toArray();\n    const ramp = binding.size === undefined ? undefined : answer.getChild(binding.size)?.toArray();\n    const cluster = binding.cluster === undefined ? undefined : answer.getChild(binding.cluster)?.toArray();\n    for (let i = 0; i < answer.numRows; i++) {\n      const id = table.first + i;\n      if (values) codes[id] = dictionary.code(values[i] ?? null);\n      if (ramp) sizes[id] = ramp[i] === null ? Number.NaN : Number(ramp[i]);\n      if (cluster && clusters && groups) clusters[id] = cluster[i] === null ? undefined : groups.code(cluster[i]);\n    }\n  }\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, clusters, domain };\n}\n"],"names":["spaceFor","size","random","seed","a","seeded","space","next","sigma","positions","i","r","theta","extentOf","x0","y0","x1","y1","x","y","loadGeometry","coordinator","structure","binding","bound","links","columns","readLinks","readColumns","table","answer","xs","_a","ys","_b","at","degrees","degree","id","loadEncoding","geometry","select","answers","dictionary","Dictionary","codes","sizes","groups","clusters","values","ramp","cluster","_c","order","ranks","code","domain","rank"],"mappings":";;AAgDO,MAAMA,IAAW,CAACC,MAA0BA,IAAO,MAAU,OAAO;AAG3E,SAASC,EAAOC,GAA4B;AAC1C,MAAIC,IAAID,MAAS;AACjB,SAAO,MAAM;AACX,IAAAC,IAAKA,IAAI,eAAgB;AACzB,QAAI,IAAIA;AACR,eAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC,GACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE,KAC/B,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAOA,SAASC,EAAOJ,GAAcK,GAA6B;AACzD,QAAMC,IAAOL,EAAOD,CAAI,GAClBO,IAASF,IAAQ,IAAK,KAAK,KAAK,KAAK,IAAI,GAAGL,IAAO,IAAK,CAAC,GACzDQ,IAAY,IAAI,aAAa,IAAIR,CAAI;AAC3C,WAASS,IAAI,GAAGA,IAAIT,GAAMS,KAAK;AAC7B,UAAMC,IAAI,KAAK,KAAK,KAAK,KAAK,IAAI,IAAIJ,GAAM,CAAC,IAAIC,GAC3CI,IAAQ,IAAI,KAAK,KAAKL,EAAA;AAC5B,IAAAE,EAAU,IAAIC,CAAC,IAAIJ,IAAQ,IAAIK,IAAI,KAAK,IAAIC,CAAK,GACjDH,EAAU,IAAIC,IAAI,CAAC,IAAIJ,IAAQ,IAAIK,IAAI,KAAK,IAAIC,CAAK;AAAA,EACvD;AACA,SAAOH;AACT;AAEA,SAASI,EAASJ,GAA6C;AAC7D,MAAI,CAACK,GAAIC,GAAIC,GAAIC,CAAE,IAAI,CAAC,OAAU,OAAU,QAAW,MAAS;AAChE,WAASP,IAAI,GAAGA,IAAID,EAAU,QAAQC,KAAK,GAAG;AAC5C,UAAMQ,IAAIT,EAAUC,CAAC,GACfS,IAAIV,EAAUC,IAAI,CAAC;AACzB,IAAI,OAAO,MAAMQ,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;AAGA,eAAsBK,EAAaC,GAA0BC,GAAsBC,GAAqC;;AACtH,QAAM,EAAE,MAAAtB,MAASqB,GACXhB,IAAQN,EAASC,CAAI,GACrBuB,IAAQD,EAAQ,MAAM,UAAaA,EAAQ,MAAM,QACjD,CAACE,GAAOC,CAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,IACzCC,EAAUN,GAAaC,CAAS;AAAA,IAChCE,IAAQI,EAAYP,GAAaC,GAAW,CAACC,EAAQ,GAAaA,EAAQ,CAAW,CAAC,IAAI,QAAQ,QAAQ,CAAA,CAAE;AAAA,EAAA,CAC7G;AACD,MAAI,CAACC,EAAO,QAAO,EAAE,WAAAF,GAAW,MAAArB,GAAM,WAAWI,EAAOJ,GAAMK,CAAK,GAAG,OAAAkB,GAAO,OAAAC,GAAO,QAAQ,MAAM,OAAAnB,EAAA;AAClG,QAAMG,IAAY,IAAI,aAAa,IAAIR,CAAI,EAAE,KAAK,OAAO,GAAG;AAC5D,aAAW,EAAE,OAAA4B,GAAO,QAAAC,EAAA,KAAYJ,GAAS;AACvC,UAAMK,MAAKC,IAAAF,EAAO,SAASP,EAAQ,CAAW,MAAnC,gBAAAS,EAAsC,cAAa,CAAA,GACxDC,MAAKC,IAAAJ,EAAO,SAASP,EAAQ,CAAW,MAAnC,gBAAAW,EAAsC,cAAa,CAAA;AAC9D,aAASxB,IAAI,GAAGA,IAAIoB,EAAO,SAASpB,KAAK;AACvC,YAAMyB,IAAK,KAAKN,EAAM,QAAQnB;AAC9B,MAAAD,EAAU0B,CAAE,IAAIJ,EAAGrB,CAAC,MAAM,OAAO,OAAO,MAAM,OAAOqB,EAAGrB,CAAC,CAAC,GAC1DD,EAAU0B,IAAK,CAAC,IAAIF,EAAGvB,CAAC,MAAM,OAAO,OAAO,MAAM,OAAOuB,EAAGvB,CAAC,CAAC;AAAA,IAChE;AAAA,EACF;AACA,SAAO,EAAE,WAAAY,GAAW,MAAArB,GAAM,WAAAQ,GAAW,OAAAe,GAAO,OAAAC,GAAO,QAAQZ,EAASJ,CAAS,GAAG,OAAAH,EAAA;AAClF;AAGA,SAAS8B,EAAQnC,GAAcwB,GAAmC;AAChE,QAAMY,IAAS,IAAI,aAAapC,CAAI;AACpC,WAASS,IAAI,GAAGA,IAAIe,EAAM,QAAQf,KAAK;AACrC,UAAM4B,IAAKb,EAAMf,CAAC;AAClB,IAAA2B,EAAOC,CAAE,IAAKD,EAAOC,CAAE,IAAe;AAAA,EACxC;AACA,SAAOD;AACT;AAGA,eAAsBE,EACpBlB,GACAmB,GACAjB,GACApB,GACmB;;AACnB,QAAM,EAAE,WAAAmB,GAAW,MAAArB,EAAA,IAASuC,GACtBC,IAAS,CAAClB,EAAQ,UAAUA,EAAQ,MAAMA,EAAQ,OAAO,EAAE,OAAO,CAAC,MAAmB,MAAM,MAAS,GACrGmB,IAAUD,EAAO,SAAS,IAAI,MAAMb,EAAYP,GAAaC,GAAW,CAAC,GAAG,IAAI,IAAImB,CAAM,CAAC,CAAC,IAAI,CAAA,GAChGE,IAAa,IAAIC,EAAWzC,CAAI,GAChC0C,IAAQ,IAAI,YAAY5C,CAAI,GAC5B6C,IAAQvB,EAAQ,SAAS,SAAYa,EAAQnC,GAAMuC,EAAS,KAAK,IAAI,IAAI,aAAavC,CAAI,EAAE,KAAK,OAAO,GAAG,GAC3G8C,IAASxB,EAAQ,YAAY,SAAY,OAAO,IAAIqB,EAAA,GACpDI,IAA0CD,IAAS,IAAI,MAA0B9C,CAAI,IAAI;AAC/F,MAAIsB,EAAQ;AACV,eAAWM,KAASP,EAAU,SAAU,CAAAuB,EAAM,KAAKF,EAAW,KAAKd,EAAM,IAAI,GAAGA,EAAM,OAAOA,EAAM,QAAQA,EAAM,IAAI;AAAA,MACvH,CAAWN,EAAQ,aAAa,UAC9BsB,EAAM,KAAKF,EAAW,KAAK,IAAI,CAAC;AAElC,aAAW,EAAE,OAAAd,GAAO,QAAAC,EAAA,KAAYY,GAAS;AACvC,UAAMO,IAAS1B,EAAQ,aAAa,UAAaA,EAAQ,YAAsBS,IAAAF,EAAO,SAASP,EAAQ,QAAQ,MAAhC,OAAZ,SAAYS,EAAmC,WAC5GkB,IAAO3B,EAAQ,SAAS,WAAwBW,IAAAJ,EAAO,SAASP,EAAQ,IAAI,MAA5B,OAAZ,SAAYW,EAA+B,WAC/EiB,IAAU5B,EAAQ,YAAY,WAAwB6B,IAAAtB,EAAO,SAASP,EAAQ,OAAO,MAA/B,OAAZ,SAAY6B,EAAkC;AAC9F,aAAS1C,IAAI,GAAGA,IAAIoB,EAAO,SAASpB,KAAK;AACvC,YAAM4B,IAAKT,EAAM,QAAQnB;AACzB,MAAIuC,QAAcX,CAAE,IAAIK,EAAW,KAAKM,EAAOvC,CAAC,KAAK,IAAI,IACrDwC,MAAMJ,EAAMR,CAAE,IAAIY,EAAKxC,CAAC,MAAM,OAAO,OAAO,MAAM,OAAOwC,EAAKxC,CAAC,CAAC,IAChEyC,KAAWH,KAAYD,MAAQC,EAASV,CAAE,IAAIa,EAAQzC,CAAC,MAAM,OAAO,SAAYqC,EAAO,KAAKI,EAAQzC,CAAC,CAAC;AAAA,IAC5G;AAAA,EACF;AACA,QAAM2C,IAAQV,EAAW,MAAA,GACnBW,IAAQT,EAAM,IAAI,CAACU,MAASF,EAAME,CAAI,KAAK,CAAC,GAC5CC,IAAoB,CAAA;AAC1B,SAAAH,EAAM,QAAQ,CAACI,GAAMF,MAAS;AAC5B,IAAAC,EAAOC,CAAI,IAAId,EAAW,OAAOY,CAAI;AAAA,EACvC,CAAC,GACM,EAAE,OAAAD,GAAO,OAAAR,GAAO,UAAAE,GAAU,QAAAQ,EAAA;AACnC;"}

package/dist/core/source.d.ts

@@ -0,0 +1,90 @@
+import { Coordinator } from '@kanzo-tech/mosaic';
+/**
+ * **What the graph reads, through the page's coordinator.** A corpus fossil's `open` attached under
+ * a name is a catalog: a view per table, and the manifest as two relations — `fossil_tables` and
+ * `fossil_columns`. The graph reads the structure from those and the rows from the views, with the
+ * same coordinator — and the same cache — every chart on the page uses. Nothing here parses a
+ * manifest and nothing here owns a connection.
+ */
+/** One vertex table: the `dense_id` range it holds, and what it can be asked for. */
+export interface VertexTable {
+    readonly name: string;
+    /** Its first `dense_id`; its vertices are `first … first + rows − 1`. */
+    readonly first: number;
+    readonly rows: number;
+    /** Every column, by name. */
+    readonly columns: ReadonlySet<string>;
+    /** The `identity` column — what a label falls back to. */
+    readonly identity: string;
+}
+/** One relation: its table, and the vertex tables its `src` and `dst` point into. */
+export interface EdgeTable {
+    readonly name: string;
+    readonly source: string;
+    readonly destination: string;
+    readonly rows: number;
+}
+/** The attached corpus, as its two relations describe it. */
+export interface Structure {
+    /** The catalog `open` attached the corpus under. */
+    readonly from: string;
+    readonly vertices: readonly VertexTable[];
+    readonly edges: readonly EdgeTable[];
+    /** Every vertex, every table: `dense_id` runs `0 … size − 1`. */
+    readonly size: number;
+}
+/** A quoted SQL identifier. */
+export declare const ident: (name: string) => string;
+/** A single-quoted SQL string. */
+export declare const lit: (value: string) => string;
+/** A table of the attached corpus, as SQL names it. */
+export declare const relation: (from: string, table: string) => string;
+/** One column of an answer, by name, as its own array. */
+export interface Answer {
+    readonly numRows: number;
+    getChild(name: string): {
+        toArray(): ArrayLike<unknown>;
+        get(index: number): unknown;
+    } | null;
+}
+/** Run `sql` on the coordinator, in Arrow. */
+export declare const ask: (coordinator: Coordinator, sql: string) => Promise<Answer>;
+/** `fossil_tables` and `fossil_columns`, read once per corpus. */
+export declare function readStructure(coordinator: Coordinator, from: string): Promise<Structure>;
+/** The vertex table a `dense_id` falls in. */
+export declare function tableOf(structure: Structure, vertex: number): VertexTable | undefined;
+/**
+ * Each table's rows of `select`, in `dense_id` order — the table's slice of every buffer. A table
+ * that lacks a selected column answers `null` for it, so one statement shape serves every table.
+ */
+export declare function readColumns(coordinator: Coordinator, structure: Structure, select: readonly string[]): Promise<{
+    table: VertexTable;
+    answer: Answer;
+}[]>;
+/** `[src, dst, …]` over every relation, as cosmos.gl takes links. */
+export declare function readLinks(coordinator: Coordinator, structure: Structure): Promise<Float32Array>;
+/** The column a vertex's text is read from: `title` where its table has it, else its `identity`. */
+export declare const titleColumn: (table: VertexTable, title: string | undefined) => string;
+/** One vertex's row, as its table orders it — every column but the address. */
+export interface VertexDetail {
+    readonly vertex: number;
+    /** The vertex table it belongs to. */
+    readonly table: string;
+    readonly fields: readonly {
+        readonly name: string;
+        readonly value: unknown;
+    }[];
+}
+/** One vertex's row: every column but the address. */
+export declare function readVertex(coordinator: Coordinator, structure: Structure, vertex: number): Promise<VertexDetail | null>;
+/** The text of a few vertices, by id — a label's, a hover card's. One statement per table they fall in. */
+export declare function readTitles(coordinator: Coordinator, structure: Structure, vertices: readonly number[], title: string | undefined): Promise<Map<number, string>>;
+/**
+ * **Vertices whose text contains `query`**, case-insensitively, `limit` at most — Cosmograph's search,
+ * a `LIKE` per table in one statement. Nothing is read until the reader types.
+ */
+export declare function searchTitles(coordinator: Coordinator, structure: Structure, query: string, title: string | undefined, limit: number): Promise<{
+    id: number;
+    text: string;
+}[]>;
+//# sourceMappingURL=source.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"source.d.ts","sourceRoot":"","sources":["../../src/core/source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEtD;;;;;;GAMG;AAEH,qFAAqF;AACrF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,qFAAqF;AACrF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,6DAA6D;AAC7D,MAAM,WAAW,SAAS;IACxB,oDAAoD;IACpD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAC;IAC1C,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IACrC,iEAAiE;IACjE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,+BAA+B;AAC/B,eAAO,MAAM,KAAK,GAAI,MAAM,MAAM,KAAG,MAAyC,CAAC;AAC/E,kCAAkC;AAClC,eAAO,MAAM,GAAG,GAAI,OAAO,MAAM,KAAG,MAA0C,CAAC;AAC/E,uDAAuD;AACvD,eAAO,MAAM,QAAQ,GAAI,MAAM,MAAM,EAAE,OAAO,MAAM,KAAG,MAA0C,CAAC;AAElG,0DAA0D;AAC1D,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG;QAAE,OAAO,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC;QAAC,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;CAC/F;AAED,8CAA8C;AAC9C,eAAO,MAAM,GAAG,GAAI,aAAa,WAAW,EAAE,KAAK,MAAM,KAAG,OAAO,CAAC,MAAM,CACZ,CAAC;AAI/D,kEAAkE;AAClE,wBAAsB,aAAa,CAAC,WAAW,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAqC9F;AAED,8CAA8C;AAC9C,wBAAgB,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAErF;AAED;;;GAGG;AACH,wBAAsB,WAAW,CAC/B,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,SAAS,MAAM,EAAE,GACxB,OAAO,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,CAQnD;AAED,qEAAqE;AACrE,wBAAsB,SAAS,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC,CAcrG;AAED,oGAAoG;AACpG,eAAO,MAAM,WAAW,GAAI,OAAO,WAAW,EAAE,OAAO,MAAM,GAAG,SAAS,KAAG,MACF,CAAC;AAE3E,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,sCAAsC;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;CAChF;AAED,sDAAsD;AACtD,wBAAsB,UAAU,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAO7H;AAED,2GAA2G;AAC3G,wBAAsB,UAAU,CAC9B,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,SAAS,EACpB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,KAAK,EAAE,MAAM,GAAG,SAAS,GACxB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAmB9B;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAChC,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,CAYzC"}

package/dist/core/source.js

@@ -0,0 +1,105 @@
+const w = (t) => `"${t.replace(/"/g, '""')}"`, p = (t) => `'${t.replace(/'/g, "''")}'`, S = (t, n) => `${w(t)}.${w(n)}`, R = (t, n) => t.query(n, { type: "arrow" }), l = (t, n) => {
+  var e;
+  return ((e = t.getChild(n)) == null ? void 0 : e.toArray()) ?? [];
+};
+async function C(t, n) {
+  const [e, o] = await Promise.all([
+    R(t, `SELECT table_name, kind, rows::DOUBLE AS rows, first_id::DOUBLE AS first_id, source, destination FROM ${S(n, "fossil_tables")} ORDER BY first_id NULLS LAST, table_name`),
+    R(t, `SELECT table_name, column_name, role FROM ${S(n, "fossil_columns")} ORDER BY table_name, ordinal`)
+  ]), a = /* @__PURE__ */ new Map(), [i, s, c] = [l(o, "table_name"), l(o, "column_name"), l(o, "role")];
+  for (let r = 0; r < o.numRows; r++) {
+    const f = a.get(String(i[r])) ?? { names: /* @__PURE__ */ new Set(), identity: "subject" };
+    f.names.add(String(s[r])), c[r] === "identity" && (f.identity = String(s[r])), a.set(String(i[r]), f);
+  }
+  const d = l(e, "table_name"), E = l(e, "kind"), m = l(e, "rows"), u = l(e, "first_id"), $ = l(e, "source"), O = l(e, "destination"), g = [], _ = [];
+  for (let r = 0; r < e.numRows; r++) {
+    const f = String(d[r]);
+    if (E[r] === "vertex") {
+      const L = a.get(f);
+      g.push({
+        name: f,
+        first: Number(u[r]),
+        rows: Number(m[r]),
+        columns: (L == null ? void 0 : L.names) ?? /* @__PURE__ */ new Set(),
+        identity: (L == null ? void 0 : L.identity) ?? "subject"
+      });
+    } else
+      _.push({ name: f, source: String($[r]), destination: String(O[r]), rows: Number(m[r]) });
+  }
+  return { from: n, vertices: g, edges: _, size: g.reduce((r, f) => r + f.rows, 0) };
+}
+function y(t, n) {
+  return t.vertices.find((e) => n >= e.first && n < e.first + e.rows);
+}
+async function b(t, n, e) {
+  return Promise.all(
+    n.vertices.map(async (o) => {
+      const a = e.map((s) => o.columns.has(s) ? `${w(s)} AS ${w(s)}` : `NULL AS ${w(s)}`).join(", "), i = await R(t, `SELECT ${a} FROM ${S(n.from, o.name)} ORDER BY dense_id`);
+      return { table: o, answer: i };
+    })
+  );
+}
+async function T(t, n) {
+  const e = await Promise.all(
+    n.edges.map((i) => R(t, `SELECT src::DOUBLE AS src, dst::DOUBLE AS dst FROM ${S(n.from, i.name)}`))
+  ), o = new Float32Array(2 * e.reduce((i, s) => i + s.numRows, 0));
+  let a = 0;
+  for (const i of e) {
+    const [s, c] = [l(i, "src"), l(i, "dst")];
+    for (let d = 0; d < i.numRows; d++)
+      o[a++] = s[d], o[a++] = c[d];
+  }
+  return o;
+}
+const A = (t, n) => n !== void 0 && t.columns.has(n) ? n : t.identity;
+async function x(t, n, e) {
+  const o = y(n, e);
+  if (!o) return null;
+  const a = await R(t, `SELECT * EXCLUDE (dense_id) FROM ${S(n.from, o.name)} WHERE dense_id = ${e}`);
+  if (a.numRows === 0) return null;
+  const i = [...o.columns].filter((s) => s !== "dense_id");
+  return { vertex: e, table: o.name, fields: i.map((s) => {
+    var c;
+    return { name: s, value: ((c = a.getChild(s)) == null ? void 0 : c.get(0)) ?? null };
+  }) };
+}
+async function M(t, n, e, o) {
+  const a = /* @__PURE__ */ new Map();
+  for (const s of e) {
+    const c = y(n, s);
+    c && a.set(c, [...a.get(c) ?? [], s]);
+  }
+  const i = /* @__PURE__ */ new Map();
+  return await Promise.all(
+    [...a].map(async ([s, c]) => {
+      const d = A(s, o), E = await R(
+        t,
+        `SELECT dense_id::DOUBLE AS id, ${w(d)}::VARCHAR AS text FROM ${S(n.from, s.name)} WHERE dense_id IN (${c.join(", ")})`
+      ), [m, u] = [l(E, "id"), l(E, "text")];
+      for (let $ = 0; $ < E.numRows; $++) i.set(m[$], String(u[$] ?? ""));
+    })
+  ), i;
+}
+async function D(t, n, e, o, a) {
+  if (n.vertices.length === 0) return [];
+  const i = p(`%${e.replace(/[\\%_]/g, (m) => `\\${m}`)}%`), s = n.vertices.map((m) => {
+    const u = `${w(A(m, o))}::VARCHAR`;
+    return `SELECT dense_id::DOUBLE AS id, ${u} AS text FROM ${S(n.from, m.name)} WHERE ${u} ILIKE ${i} ESCAPE '\\'`;
+  }).join(" UNION ALL "), c = await R(t, `SELECT * FROM (${s}) ORDER BY length(text), text LIMIT ${a}`), [d, E] = [l(c, "id"), l(c, "text")];
+  return Array.from({ length: c.numRows }, (m, u) => ({ id: d[u], text: String(E[u] ?? "") }));
+}
+export {
+  R as ask,
+  w as ident,
+  p as lit,
+  b as readColumns,
+  T as readLinks,
+  C as readStructure,
+  M as readTitles,
+  x as readVertex,
+  S as relation,
+  D as searchTitles,
+  y as tableOf,
+  A as titleColumn
+};
+//# sourceMappingURL=source.js.map

package/dist/core/source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source.js","sources":["../../src/core/source.ts"],"sourcesContent":["import type { Coordinator } from \"@kanzo-tech/mosaic\";\n\n/**\n * **What the graph reads, through the page's coordinator.** A corpus fossil's `open` attached under\n * a name is a catalog: a view per table, and the manifest as two relations — `fossil_tables` and\n * `fossil_columns`. The graph reads the structure from those and the rows from the views, with the\n * same coordinator — and the same cache — every chart on the page uses. Nothing here parses a\n * manifest and nothing here owns a connection.\n */\n\n/** One vertex table: the `dense_id` range it holds, and what it can be asked for. */\nexport interface VertexTable {\n  readonly name: string;\n  /** Its first `dense_id`; its vertices are `first … first + rows − 1`. */\n  readonly first: number;\n  readonly rows: number;\n  /** Every column, by name. */\n  readonly columns: ReadonlySet<string>;\n  /** The `identity` column — what a label falls back to. */\n  readonly identity: string;\n}\n\n/** One relation: its table, and the vertex tables its `src` and `dst` point into. */\nexport interface EdgeTable {\n  readonly name: string;\n  readonly source: string;\n  readonly destination: string;\n  readonly rows: number;\n}\n\n/** The attached corpus, as its two relations describe it. */\nexport interface Structure {\n  /** The catalog `open` attached the corpus under. */\n  readonly from: string;\n  readonly vertices: readonly VertexTable[];\n  readonly edges: readonly EdgeTable[];\n  /** Every vertex, every table: `dense_id` runs `0 … size − 1`. */\n  readonly size: number;\n}\n\n/** A quoted SQL identifier. */\nexport const ident = (name: string): string => `\"${name.replace(/\"/g, '\"\"')}\"`;\n/** A single-quoted SQL string. */\nexport const lit = (value: string): string => `'${value.replace(/'/g, \"''\")}'`;\n/** A table of the attached corpus, as SQL names it. */\nexport const relation = (from: string, table: string): string => `${ident(from)}.${ident(table)}`;\n\n/** One column of an answer, by name, as its own array. */\nexport interface Answer {\n  readonly numRows: number;\n  getChild(name: string): { toArray(): ArrayLike<unknown>; get(index: number): unknown } | null;\n}\n\n/** Run `sql` on the coordinator, in Arrow. */\nexport const ask = (coordinator: Coordinator, sql: string): Promise<Answer> =>\n  coordinator.query(sql, { type: \"arrow\" }) as Promise<Answer>;\n\nconst column = (answer: Answer, name: string): ArrayLike<unknown> => answer.getChild(name)?.toArray() ?? [];\n\n/** `fossil_tables` and `fossil_columns`, read once per corpus. */\nexport async function readStructure(coordinator: Coordinator, from: string): Promise<Structure> {\n  const [tables, columns] = await Promise.all([\n    ask(coordinator, `SELECT table_name, kind, rows::DOUBLE AS rows, first_id::DOUBLE AS first_id, source, destination FROM ${relation(from, \"fossil_tables\")} ORDER BY first_id NULLS LAST, table_name`),\n    ask(coordinator, `SELECT table_name, column_name, role FROM ${relation(from, \"fossil_columns\")} ORDER BY table_name, ordinal`),\n  ]);\n  const byTable = new Map<string, { names: Set<string>; identity: string }>();\n  const [tn, cn, role] = [column(columns, \"table_name\"), column(columns, \"column_name\"), column(columns, \"role\")];\n  for (let i = 0; i < columns.numRows; i++) {\n    const entry = byTable.get(String(tn[i])) ?? { names: new Set<string>(), identity: \"subject\" };\n    entry.names.add(String(cn[i]));\n    if (role[i] === \"identity\") entry.identity = String(cn[i]);\n    byTable.set(String(tn[i]), entry);\n  }\n  const name = column(tables, \"table_name\");\n  const kind = column(tables, \"kind\");\n  const rows = column(tables, \"rows\");\n  const first = column(tables, \"first_id\");\n  const source = column(tables, \"source\");\n  const destination = column(tables, \"destination\");\n  const vertices: VertexTable[] = [];\n  const edges: EdgeTable[] = [];\n  for (let i = 0; i < tables.numRows; i++) {\n    const table = String(name[i]);\n    if (kind[i] === \"vertex\") {\n      const described = byTable.get(table);\n      vertices.push({\n        name: table,\n        first: Number(first[i]),\n        rows: Number(rows[i]),\n        columns: described?.names ?? new Set(),\n        identity: described?.identity ?? \"subject\",\n      });\n    } else {\n      edges.push({ name: table, source: String(source[i]), destination: String(destination[i]), rows: Number(rows[i]) });\n    }\n  }\n  return { from, vertices, edges, size: vertices.reduce((sum, v) => sum + v.rows, 0) };\n}\n\n/** The vertex table a `dense_id` falls in. */\nexport function tableOf(structure: Structure, vertex: number): VertexTable | undefined {\n  return structure.vertices.find((t) => vertex >= t.first && vertex < t.first + t.rows);\n}\n\n/**\n * Each table's rows of `select`, in `dense_id` order — the table's slice of every buffer. A table\n * that lacks a selected column answers `null` for it, so one statement shape serves every table.\n */\nexport async function readColumns(\n  coordinator: Coordinator,\n  structure: Structure,\n  select: readonly string[],\n): Promise<{ table: VertexTable; answer: Answer }[]> {\n  return Promise.all(\n    structure.vertices.map(async (table) => {\n      const projection = select.map((c) => (table.columns.has(c) ? `${ident(c)} AS ${ident(c)}` : `NULL AS ${ident(c)}`)).join(\", \");\n      const answer = await ask(coordinator, `SELECT ${projection} FROM ${relation(structure.from, table.name)} ORDER BY dense_id`);\n      return { table, answer };\n    }),\n  );\n}\n\n/** `[src, dst, …]` over every relation, as cosmos.gl takes links. */\nexport async function readLinks(coordinator: Coordinator, structure: Structure): Promise<Float32Array> {\n  const answers = await Promise.all(\n    structure.edges.map((edge) => ask(coordinator, `SELECT src::DOUBLE AS src, dst::DOUBLE AS dst FROM ${relation(structure.from, edge.name)}`)),\n  );\n  const links = new Float32Array(2 * answers.reduce((sum, a) => sum + a.numRows, 0));\n  let at = 0;\n  for (const answer of answers) {\n    const [src, dst] = [column(answer, \"src\"), column(answer, \"dst\")];\n    for (let e = 0; e < answer.numRows; e++) {\n      links[at++] = src[e] as number;\n      links[at++] = dst[e] as number;\n    }\n  }\n  return links;\n}\n\n/** The column a vertex's text is read from: `title` where its table has it, else its `identity`. */\nexport const titleColumn = (table: VertexTable, title: string | undefined): string =>\n  title !== undefined && table.columns.has(title) ? title : table.identity;\n\n/** One vertex's row, as its table orders it — every column but the address. */\nexport interface VertexDetail {\n  readonly vertex: number;\n  /** The vertex table it belongs to. */\n  readonly table: string;\n  readonly fields: readonly { readonly name: string; readonly value: unknown }[];\n}\n\n/** One vertex's row: every column but the address. */\nexport async function readVertex(coordinator: Coordinator, structure: Structure, vertex: number): Promise<VertexDetail | null> {\n  const table = tableOf(structure, vertex);\n  if (!table) return null;\n  const answer = await ask(coordinator, `SELECT * EXCLUDE (dense_id) FROM ${relation(structure.from, table.name)} WHERE dense_id = ${vertex}`);\n  if (answer.numRows === 0) return null;\n  const names = [...table.columns].filter((name) => name !== \"dense_id\");\n  return { vertex, table: table.name, fields: names.map((name) => ({ name, value: answer.getChild(name)?.get(0) ?? null })) };\n}\n\n/** The text of a few vertices, by id — a label's, a hover card's. One statement per table they fall in. */\nexport async function readTitles(\n  coordinator: Coordinator,\n  structure: Structure,\n  vertices: readonly number[],\n  title: string | undefined,\n): Promise<Map<number, string>> {\n  const byTable = new Map<VertexTable, number[]>();\n  for (const vertex of vertices) {\n    const table = tableOf(structure, vertex);\n    if (table) byTable.set(table, [...(byTable.get(table) ?? []), vertex]);\n  }\n  const found = new Map<number, string>();\n  await Promise.all(\n    [...byTable].map(async ([table, ids]) => {\n      const text = titleColumn(table, title);\n      const answer = await ask(\n        coordinator,\n        `SELECT dense_id::DOUBLE AS id, ${ident(text)}::VARCHAR AS text FROM ${relation(structure.from, table.name)} WHERE dense_id IN (${ids.join(\", \")})`,\n      );\n      const [id, texts] = [column(answer, \"id\"), column(answer, \"text\")];\n      for (let i = 0; i < answer.numRows; i++) found.set(id[i] as number, String(texts[i] ?? \"\"));\n    }),\n  );\n  return found;\n}\n\n/**\n * **Vertices whose text contains `query`**, case-insensitively, `limit` at most — Cosmograph's search,\n * a `LIKE` per table in one statement. Nothing is read until the reader types.\n */\nexport async function searchTitles(\n  coordinator: Coordinator,\n  structure: Structure,\n  query: string,\n  title: string | undefined,\n  limit: number,\n): Promise<{ id: number; text: string }[]> {\n  if (structure.vertices.length === 0) return [];\n  const needle = lit(`%${query.replace(/[\\\\%_]/g, (c) => `\\\\${c}`)}%`);\n  const union = structure.vertices\n    .map((table) => {\n      const text = `${ident(titleColumn(table, title))}::VARCHAR`;\n      return `SELECT dense_id::DOUBLE AS id, ${text} AS text FROM ${relation(structure.from, table.name)} WHERE ${text} ILIKE ${needle} ESCAPE '\\\\'`;\n    })\n    .join(\" UNION ALL \");\n  const answer = await ask(coordinator, `SELECT * FROM (${union}) ORDER BY length(text), text LIMIT ${limit}`);\n  const [id, text] = [column(answer, \"id\"), column(answer, \"text\")];\n  return Array.from({ length: answer.numRows }, (_, i) => ({ id: id[i] as number, text: String(text[i] ?? \"\") }));\n}\n"],"names":["ident","name","lit","value","relation","from","table","ask","coordinator","sql","column","answer","_a","readStructure","tables","columns","byTable","tn","cn","role","i","entry","kind","rows","first","source","destination","vertices","edges","described","sum","v","tableOf","structure","vertex","t","readColumns","select","projection","c","readLinks","answers","edge","links","a","at","src","dst","e","titleColumn","title","readVertex","names","readTitles","found","ids","text","id","texts","searchTitles","query","limit","needle","union","_"],"mappings":"AAyCO,MAAMA,IAAQ,CAACC,MAAyB,IAAIA,EAAK,QAAQ,MAAM,IAAI,CAAC,KAE9DC,IAAM,CAACC,MAA0B,IAAIA,EAAM,QAAQ,MAAM,IAAI,CAAC,KAE9DC,IAAW,CAACC,GAAcC,MAA0B,GAAGN,EAAMK,CAAI,CAAC,IAAIL,EAAMM,CAAK,CAAC,IASlFC,IAAM,CAACC,GAA0BC,MAC5CD,EAAY,MAAMC,GAAK,EAAE,MAAM,QAAA,CAAS,GAEpCC,IAAS,CAACC,GAAgBV,MAAA;AAhBzB,MAAAW;AAgB8D,WAAAA,IAAAD,EAAO,SAASV,CAAI,MAApB,gBAAAW,EAAuB,cAAa,CAAA;AAAA;AAGzG,eAAsBC,EAAcL,GAA0BH,GAAkC;AAC9F,QAAM,CAACS,GAAQC,CAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC1CR,EAAIC,GAAa,yGAAyGJ,EAASC,GAAM,eAAe,CAAC,2CAA2C;AAAA,IACpME,EAAIC,GAAa,6CAA6CJ,EAASC,GAAM,gBAAgB,CAAC,+BAA+B;AAAA,EAAA,CAC9H,GACKW,wBAAc,IAAA,GACd,CAACC,GAAIC,GAAIC,CAAI,IAAI,CAACT,EAAOK,GAAS,YAAY,GAAGL,EAAOK,GAAS,aAAa,GAAGL,EAAOK,GAAS,MAAM,CAAC;AAC9G,WAASK,IAAI,GAAGA,IAAIL,EAAQ,SAASK,KAAK;AACxC,UAAMC,IAAQL,EAAQ,IAAI,OAAOC,EAAGG,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,oBAAI,IAAA,GAAe,UAAU,UAAA;AAClF,IAAAC,EAAM,MAAM,IAAI,OAAOH,EAAGE,CAAC,CAAC,CAAC,GACzBD,EAAKC,CAAC,MAAM,iBAAkB,WAAW,OAAOF,EAAGE,CAAC,CAAC,IACzDJ,EAAQ,IAAI,OAAOC,EAAGG,CAAC,CAAC,GAAGC,CAAK;AAAA,EAClC;AACA,QAAMpB,IAAOS,EAAOI,GAAQ,YAAY,GAClCQ,IAAOZ,EAAOI,GAAQ,MAAM,GAC5BS,IAAOb,EAAOI,GAAQ,MAAM,GAC5BU,IAAQd,EAAOI,GAAQ,UAAU,GACjCW,IAASf,EAAOI,GAAQ,QAAQ,GAChCY,IAAchB,EAAOI,GAAQ,aAAa,GAC1Ca,IAA0B,CAAA,GAC1BC,IAAqB,CAAA;AAC3B,WAASR,IAAI,GAAGA,IAAIN,EAAO,SAASM,KAAK;AACvC,UAAMd,IAAQ,OAAOL,EAAKmB,CAAC,CAAC;AAC5B,QAAIE,EAAKF,CAAC,MAAM,UAAU;AACxB,YAAMS,IAAYb,EAAQ,IAAIV,CAAK;AACnC,MAAAqB,EAAS,KAAK;AAAA,QACZ,MAAMrB;AAAA,QACN,OAAO,OAAOkB,EAAMJ,CAAC,CAAC;AAAA,QACtB,MAAM,OAAOG,EAAKH,CAAC,CAAC;AAAA,QACpB,UAASS,KAAA,gBAAAA,EAAW,UAAS,oBAAI,IAAA;AAAA,QACjC,WAAUA,KAAA,gBAAAA,EAAW,aAAY;AAAA,MAAA,CAClC;AAAA,IACH;AACE,MAAAD,EAAM,KAAK,EAAE,MAAMtB,GAAO,QAAQ,OAAOmB,EAAOL,CAAC,CAAC,GAAG,aAAa,OAAOM,EAAYN,CAAC,CAAC,GAAG,MAAM,OAAOG,EAAKH,CAAC,CAAC,GAAG;AAAA,EAErH;AACA,SAAO,EAAE,MAAAf,GAAM,UAAAsB,GAAU,OAAAC,GAAO,MAAMD,EAAS,OAAO,CAACG,GAAKC,MAAMD,IAAMC,EAAE,MAAM,CAAC,EAAA;AACnF;AAGO,SAASC,EAAQC,GAAsBC,GAAyC;AACrF,SAAOD,EAAU,SAAS,KAAK,CAACE,MAAMD,KAAUC,EAAE,SAASD,IAASC,EAAE,QAAQA,EAAE,IAAI;AACtF;AAMA,eAAsBC,EACpB5B,GACAyB,GACAI,GACmD;AACnD,SAAO,QAAQ;AAAA,IACbJ,EAAU,SAAS,IAAI,OAAO3B,MAAU;AACtC,YAAMgC,IAAaD,EAAO,IAAI,CAACE,MAAOjC,EAAM,QAAQ,IAAIiC,CAAC,IAAI,GAAGvC,EAAMuC,CAAC,CAAC,OAAOvC,EAAMuC,CAAC,CAAC,KAAK,WAAWvC,EAAMuC,CAAC,CAAC,EAAG,EAAE,KAAK,IAAI,GACvH5B,IAAS,MAAMJ,EAAIC,GAAa,UAAU8B,CAAU,SAASlC,EAAS6B,EAAU,MAAM3B,EAAM,IAAI,CAAC,oBAAoB;AAC3H,aAAO,EAAE,OAAAA,GAAO,QAAAK,EAAA;AAAA,IAClB,CAAC;AAAA,EAAA;AAEL;AAGA,eAAsB6B,EAAUhC,GAA0ByB,GAA6C;AACrG,QAAMQ,IAAU,MAAM,QAAQ;AAAA,IAC5BR,EAAU,MAAM,IAAI,CAACS,MAASnC,EAAIC,GAAa,sDAAsDJ,EAAS6B,EAAU,MAAMS,EAAK,IAAI,CAAC,EAAE,CAAC;AAAA,EAAA,GAEvIC,IAAQ,IAAI,aAAa,IAAIF,EAAQ,OAAO,CAACX,GAAKc,MAAMd,IAAMc,EAAE,SAAS,CAAC,CAAC;AACjF,MAAIC,IAAK;AACT,aAAWlC,KAAU8B,GAAS;AAC5B,UAAM,CAACK,GAAKC,CAAG,IAAI,CAACrC,EAAOC,GAAQ,KAAK,GAAGD,EAAOC,GAAQ,KAAK,CAAC;AAChE,aAASqC,IAAI,GAAGA,IAAIrC,EAAO,SAASqC;AAClC,MAAAL,EAAME,GAAI,IAAIC,EAAIE,CAAC,GACnBL,EAAME,GAAI,IAAIE,EAAIC,CAAC;AAAA,EAEvB;AACA,SAAOL;AACT;AAGO,MAAMM,IAAc,CAAC3C,GAAoB4C,MAC9CA,MAAU,UAAa5C,EAAM,QAAQ,IAAI4C,CAAK,IAAIA,IAAQ5C,EAAM;AAWlE,eAAsB6C,EAAW3C,GAA0ByB,GAAsBC,GAA8C;AAC7H,QAAM5B,IAAQ0B,EAAQC,GAAWC,CAAM;AACvC,MAAI,CAAC5B,EAAO,QAAO;AACnB,QAAMK,IAAS,MAAMJ,EAAIC,GAAa,oCAAoCJ,EAAS6B,EAAU,MAAM3B,EAAM,IAAI,CAAC,qBAAqB4B,CAAM,EAAE;AAC3I,MAAIvB,EAAO,YAAY,EAAG,QAAO;AACjC,QAAMyC,IAAQ,CAAC,GAAG9C,EAAM,OAAO,EAAE,OAAO,CAACL,MAASA,MAAS,UAAU;AACrE,SAAO,EAAE,QAAAiC,GAAQ,OAAO5B,EAAM,MAAM,QAAQ8C,EAAM,IAAI,CAACnD,MAAA;AArHlD,QAAAW;AAqH4D,aAAE,MAAAX,GAAM,SAAOW,IAAAD,EAAO,SAASV,CAAI,MAApB,gBAAAW,EAAuB,IAAI,OAAM,KAAA;AAAA,GAAO,EAAA;AAC1H;AAGA,eAAsByC,EACpB7C,GACAyB,GACAN,GACAuB,GAC8B;AAC9B,QAAMlC,wBAAc,IAAA;AACpB,aAAWkB,KAAUP,GAAU;AAC7B,UAAMrB,IAAQ0B,EAAQC,GAAWC,CAAM;AACvC,IAAI5B,KAAOU,EAAQ,IAAIV,GAAO,CAAC,GAAIU,EAAQ,IAAIV,CAAK,KAAK,CAAA,GAAK4B,CAAM,CAAC;AAAA,EACvE;AACA,QAAMoB,wBAAY,IAAA;AAClB,eAAM,QAAQ;AAAA,IACZ,CAAC,GAAGtC,CAAO,EAAE,IAAI,OAAO,CAACV,GAAOiD,CAAG,MAAM;AACvC,YAAMC,IAAOP,EAAY3C,GAAO4C,CAAK,GAC/BvC,IAAS,MAAMJ;AAAA,QACnBC;AAAA,QACA,kCAAkCR,EAAMwD,CAAI,CAAC,0BAA0BpD,EAAS6B,EAAU,MAAM3B,EAAM,IAAI,CAAC,uBAAuBiD,EAAI,KAAK,IAAI,CAAC;AAAA,MAAA,GAE5I,CAACE,GAAIC,CAAK,IAAI,CAAChD,EAAOC,GAAQ,IAAI,GAAGD,EAAOC,GAAQ,MAAM,CAAC;AACjE,eAASS,IAAI,GAAGA,IAAIT,EAAO,SAASS,IAAK,CAAAkC,EAAM,IAAIG,EAAGrC,CAAC,GAAa,OAAOsC,EAAMtC,CAAC,KAAK,EAAE,CAAC;AAAA,IAC5F,CAAC;AAAA,EAAA,GAEIkC;AACT;AAMA,eAAsBK,EACpBnD,GACAyB,GACA2B,GACAV,GACAW,GACyC;AACzC,MAAI5B,EAAU,SAAS,WAAW,UAAU,CAAA;AAC5C,QAAM6B,IAAS5D,EAAI,IAAI0D,EAAM,QAAQ,WAAW,CAACrB,MAAM,KAAKA,CAAC,EAAE,CAAC,GAAG,GAC7DwB,IAAQ9B,EAAU,SACrB,IAAI,CAAC3B,MAAU;AACd,UAAMkD,IAAO,GAAGxD,EAAMiD,EAAY3C,GAAO4C,CAAK,CAAC,CAAC;AAChD,WAAO,kCAAkCM,CAAI,iBAAiBpD,EAAS6B,EAAU,MAAM3B,EAAM,IAAI,CAAC,UAAUkD,CAAI,UAAUM,CAAM;AAAA,EAClI,CAAC,EACA,KAAK,aAAa,GACfnD,IAAS,MAAMJ,EAAIC,GAAa,kBAAkBuD,CAAK,uCAAuCF,CAAK,EAAE,GACrG,CAACJ,GAAID,CAAI,IAAI,CAAC9C,EAAOC,GAAQ,IAAI,GAAGD,EAAOC,GAAQ,MAAM,CAAC;AAChE,SAAO,MAAM,KAAK,EAAE,QAAQA,EAAO,QAAA,GAAW,CAACqD,GAAG5C,OAAO,EAAE,IAAIqC,EAAGrC,CAAC,GAAa,MAAM,OAAOoC,EAAKpC,CAAC,KAAK,EAAE,EAAA,EAAI;AAChH;"}

package/dist/core/state.d.ts

@@ -1,19 +1,18 @@
-import { Selection as Crossfilter } from '@kanzo-tech/mosaic';
+import { Coordinator, 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 { Corpus } from '@fossil-lang/corpus';
 import { Encoding, Geometry } from './load';
+import { Structure } from './source';
 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.
-     *
-     * The promise must settle. The graph shows *opening* until it does and sets no deadline of its
-     * own: the waits inside an open are fossil's to bound, and a rejection reaches `onFailure`.
+     * The catalog fossil's `open` attached the corpus under — its tables, `fossil_tables` and
+     * `fossil_columns` — or `null` for none yet. The graph reads it through `coordinator`.
      */
-    corpus: Corpus | PromiseLike<Corpus> | null;
+    from: string | null;
+    /** The page's Mosaic coordinator: the one connection every chart and the graph read through. */
+    coordinator: Coordinator | null;
     /** 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`. Absent, each table's `identity`. */
@@ -30,8 +29,9 @@ export interface GraphOptions extends Channels {
     /** The force coefficients, as a patch over this package's own. */
     sim?: Partial<Sim>;
     /**
-     * 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.
+     * Whether the layout runs. By default it does exactly when `x` and `y` are unbound — Cosmograph's
+     * rule: bound columns place the points and nothing else does. `GraphToolbar` starts and stops the
+     * layout whatever this says.
      */
     simulate?: boolean;
     /**
@@ -43,20 +43,19 @@ export interface GraphOptions extends Channels {
     onFocus?: (vertex: VertexId | null) => void;
 }
 /**
- * Where the graph is in its life. `none` is no corpus; `opening` is a corpus promised and not yet
- * 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 with no GPU device to draw
- * with — none came up, or the one it had was lost.
+ * Where the graph is in its life. `none` is no corpus; `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 read,
+ * or a canvas with no GPU device to draw with — none came up, or the one it had was lost.
  *
  * **It is the data's life, not the layout's.** A layout running over a drawn graph is `idle` here and
  * `running` in `motion`: two axes, because each can move without the other — a filter loads under a
  * paused layout, and a layout runs over a graph with nothing left to read. A host that shows one word
  * reads both, `motion === "running"` as "laying out" and `progress` for how far.
  */
-export type GraphStatus = "none" | "opening" | "loading" | "idle" | "failed";
+export type GraphStatus = "none" | "loading" | "idle" | "failed";
 /** What the loaded graph holds, under the page's filter. */
 export interface Drawn {
-    /** Vertices drawn: every one with a position that survives the filter. */
+    /** Vertices in full colour: every one with a position that survives the filter. */
     readonly vertices: number;
     /** Links drawn: every loaded relation whose two ends are drawn. */
     readonly edges: number;
@@ -68,7 +67,7 @@ export interface Drawn {
 /** What a host and the parts read, through `useGraphState`. */
 export interface GraphState {
     readonly status: GraphStatus;
-    /** Vertices of the drawn types, from the manifest — it does not shrink with a filter. */
+    /** Every vertex of the corpus — it does not shrink with a filter. */
     readonly total: number | undefined;
     /** What is loaded, or `null` before the graph has loaded. */
     readonly drawn: Drawn | null;
@@ -82,16 +81,16 @@ export interface GraphState {
     readonly motion: Motion;
     /** How far through settling a live layout is, `0`–`1`. */
     readonly progress: number;
-    /** The options as given, with the corpus once it is open. */
     readonly options: GraphOptions;
-    readonly corpus: Corpus | null;
+    /** The corpus's tables, once read. */
+    readonly structure: Structure | null;
 }
 /** The state, plus what only the renderer and the parts read. */
 export interface GraphSnapshot extends GraphState {
     readonly binding: Binding;
     readonly geometry: Geometry | null;
     readonly encoding: Encoding | null;
-    /** `1` where a vertex survives the page's filter; `null` when nothing is filtered. */
+    /** `1` where a vertex survives the page's filter; `null` when nothing is filtered. A vertex that does not is greyed out, never hidden. */
     readonly mask: Uint8Array | null;
 }
 /**

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,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;;;;;;OAMG;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;;;OAGG;IACH,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IACpC,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;;;;;;;;;;GAUG;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,mEAAmE;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,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,uCAAuC;IACvC,UAAU,IAAI,IAAI,CAAC;IACnB,sFAAsF;IACtF,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IACnC,yEAAyE;IACzE,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;CAC5C"}
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/core/state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAChF,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,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACjD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAC1C,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,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,gGAAgG;IAChG,WAAW,EAAE,WAAW,GAAG,IAAI,CAAC;IAChC,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;;;;OAIG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;IACpC,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;;;;;;;;;GASG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,CAAC;AAEjE,4DAA4D;AAC5D,MAAM,WAAW,KAAK;IACpB,mFAAmF;IACnF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,mEAAmE;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,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,qEAAqE;IACrE,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,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,sCAAsC;IACtC,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;CACtC;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,0IAA0I;IAC1I,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,uCAAuC;IACvC,UAAU,IAAI,IAAI,CAAC;IACnB,sFAAsF;IACtF,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IACnC,yEAAyE;IACzE,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,IAAI,CAAC;CAC5C"}

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

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAOA,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;AA4BvG,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CAiW7D"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAOA,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;AA4BvG,wBAAgB,WAAW,CAAC,OAAO,EAAE,YAAY,GAAG,UAAU,CA4S7D"}