vastgrid 0.1.1 → 0.2.0

package/dist/core/cache.js

@@ -0,0 +1,222 @@
+/** Rows in a block of the cache: reads cover whole blocks. */
+export const BLOCK_ROWS = 256;
+
+/** A read of rows `[start, end)` of a view, for some of its columns. */
+
+/** Rows of a view that the engine gave, by column. */
+
+/** Bytes that a value takes in the cache, roughly. */
+function sizeOf(value) {
+  if (typeof value === "string") return 16 + value.length * 2;
+  return 8;
+}
+
+/**
+ * The rows of one view that the store has read, in blocks of `BLOCK_ROWS` rows, with a budget of bytes beyond
+ * which the blocks used least recently leave (§4.1 of react.md: rows are not in snapshots).
+ */
+export class ViewCache {
+  blocks = new Map();
+  clock = 0;
+  /** Bytes the blocks take, roughly. */
+  bytes = 0;
+  /** Changes whenever rows arrive or leave. */
+  version = 0;
+  block(row) {
+    return this.blocks.get(Math.floor(row / BLOCK_ROWS));
+  }
+  ensure(index) {
+    let block = this.blocks.get(index);
+    if (!block) {
+      block = {
+        index,
+        length: 0,
+        rowIds: undefined,
+        values: new Map(),
+        cut: new Map(),
+        reading: new Set(),
+        used: 0,
+        bytes: 0
+      };
+      this.blocks.set(index, block);
+    }
+    return block;
+  }
+
+  /** The value of a cell; undefined while it is not read. */
+  value(row, column) {
+    const block = this.block(row);
+    const offset = row - (block?.index ?? 0) * BLOCK_ROWS;
+    if (!block || offset >= block.length) return undefined;
+    return block.values.get(column)?.[offset];
+  }
+
+  /** Whether the engine cut the value of a cell to the text limit, so that the grid shows that it goes on. */
+  isCut(row, column) {
+    const block = this.block(row);
+    return block?.cut.get(column)?.has(row - block.index * BLOCK_ROWS) ?? false;
+  }
+
+  /** The row ID of a row; undefined while it is not read or in a view without row IDs. */
+  rowId(row) {
+    const block = this.block(row);
+    if (!block?.rowIds) return undefined;
+    return block.rowIds[row - block.index * BLOCK_ROWS];
+  }
+
+  /** A row as commands read it (§6.1): its key and its values, or undefined while it is not read. */
+  loaded(row, rowKey) {
+    const block = this.block(row);
+    const offset = row - (block?.index ?? 0) * BLOCK_ROWS;
+    if (!block || block.rowIds === undefined || offset >= block.length) return undefined;
+    let key;
+    const id = block.rowIds?.[offset];
+    if (id !== undefined) {
+      if (rowKey === undefined) key = {
+        rowId: id
+      };else {
+        // A row whose key column is null is keyed by its row ID (§5.3).
+        const value = block.values.get(rowKey)?.[offset];
+        if (value !== undefined) key = value === null ? {
+          rowId: id
+        } : {
+          value
+        };
+      }
+    }
+    const values = block.values;
+    return {
+      ...(key === undefined ? {} : {
+        key
+      }),
+      has: column => values.has(column),
+      get: column => values.get(column)?.[offset] ?? null
+    };
+  }
+
+  /**
+   * What to read so that rows `[start, end)` have `columns`: reads of runs of blocks that lack the same columns,
+   * each of at most `maxCells` cells, leaving out what is read or being read.
+   */
+  reads(start, end, columns, rowCount, maxCells = 262_144) {
+    const reads = [];
+    if (end <= start || columns.length === 0) return reads;
+    const last = Math.floor((Math.min(end, rowCount) - 1) / BLOCK_ROWS);
+    let run = null;
+    const flush = () => {
+      if (!run) return;
+      reads.push({
+        start: run.first * BLOCK_ROWS,
+        end: Math.min((run.last + 1) * BLOCK_ROWS, rowCount),
+        columns: run.columns
+      });
+      run = null;
+    };
+    for (let index = Math.floor(start / BLOCK_ROWS); index <= last; index++) {
+      const block = this.blocks.get(index);
+      // A block read while the view was shorter (a table or view still being made, §9) is read again whole.
+      const short = block !== undefined && block.rowIds !== undefined && block.length < Math.min(BLOCK_ROWS, rowCount - index * BLOCK_ROWS);
+      const missing = block && !short ? columns.filter(column => !block.values.has(column) && !block.reading.has(column)) : columns.filter(column => !block?.reading.has(column));
+      if (missing.length === 0) {
+        flush();
+        continue;
+      }
+      const key = missing.join("\u0000");
+      const blocks = Math.max(1, Math.floor(maxCells / (missing.length * BLOCK_ROWS)));
+      if (run && run.key === key && index === run.last + 1 && run.last - run.first + 1 < blocks) {
+        run.last = index;
+      } else {
+        flush();
+        run = {
+          first: index,
+          last: index,
+          columns: missing,
+          key
+        };
+      }
+    }
+    flush();
+    return reads;
+  }
+
+  /** Marks the columns of a read as being read, or no longer. */
+  reading(read, on) {
+    for (let index = Math.floor(read.start / BLOCK_ROWS); index * BLOCK_ROWS < read.end; index++) {
+      const block = this.ensure(index);
+      for (const column of read.columns) {
+        if (on) block.reading.add(column);else block.reading.delete(column);
+      }
+    }
+  }
+
+  /**
+   * Takes the rows of a read, which starts at a block: `rows` holds the values of `columns` for rows `start` to
+   * `start + rows.length`.
+   */
+  receive(start, rowIds, columns, rows, cut) {
+    const end = start + rows.length;
+    for (let index = Math.floor(start / BLOCK_ROWS); index * BLOCK_ROWS < end; index++) {
+      const block = this.ensure(index);
+      const before = block.bytes;
+      const first = Math.max(start, index * BLOCK_ROWS);
+      const stop = Math.min(end, (index + 1) * BLOCK_ROWS);
+      block.length = Math.max(block.length, stop - index * BLOCK_ROWS);
+      // A view that is still being made may have more rows in its last block at a later read (§9).
+      const ids = rowIds === null ? null : rowIds.slice(first - start, stop - start);
+      if (block.rowIds === undefined || ids !== null && block.rowIds !== null && ids.length > block.rowIds.length) {
+        block.rowIds = ids;
+      }
+      columns.forEach((column, position) => {
+        let values = block.values.get(column);
+        if (!values) {
+          values = new Array(BLOCK_ROWS);
+          block.values.set(column, values);
+        }
+        for (let row = first; row < stop; row++) {
+          const value = rows[row - start][position] ?? null;
+          const offset = row - index * BLOCK_ROWS;
+          const old = values[offset];
+          if (old !== undefined) block.bytes -= sizeOf(old);
+          values[offset] = value;
+          block.bytes += sizeOf(value);
+        }
+        block.reading.delete(column);
+        const offsets = cut?.[column];
+        if (offsets) {
+          const set = block.cut.get(column) ?? new Set();
+          for (const offset of offsets) {
+            const row = start + offset;
+            if (row >= first && row < stop) set.add(row - index * BLOCK_ROWS);
+          }
+          block.cut.set(column, set);
+        }
+      });
+      this.bytes += block.bytes - before;
+    }
+    this.version++;
+  }
+
+  /** Marks the blocks of rows `[start, end)` as used now, so that they leave last. */
+  touch(start, end) {
+    const time = ++this.clock;
+    for (let index = Math.floor(start / BLOCK_ROWS); index * BLOCK_ROWS < end; index++) {
+      const block = this.blocks.get(index);
+      if (block) block.used = time;
+    }
+  }
+
+  /** Removes the blocks used least recently until the cache fits `budget` bytes, keeping rows `[start, end)`. */
+  evict(budget, start, end) {
+    if (this.bytes <= budget) return;
+    const first = Math.floor(start / BLOCK_ROWS);
+    const last = Math.floor(Math.max(start, end - 1) / BLOCK_ROWS);
+    const candidates = [...this.blocks.values()].filter(block => (block.index < first || block.index > last) && block.reading.size === 0).sort((a, b) => a.used - b.used);
+    for (const block of candidates) {
+      if (this.bytes <= budget) break;
+      this.blocks.delete(block.index);
+      this.bytes -= block.bytes;
+    }
+    this.version++;
+  }
+}
+//# sourceMappingURL=cache.js.map

package/dist/core/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["BLOCK_ROWS","sizeOf","value","length","ViewCache","blocks","Map","clock","bytes","version","block","row","get","Math","floor","ensure","index","rowIds","undefined","values","cut","reading","Set","used","set","column","offset","isCut","has","rowId","loaded","rowKey","key","id","reads","start","end","columns","rowCount","maxCells","last","min","run","flush","push","first","short","missing","filter","join","max","read","on","add","delete","receive","rows","before","stop","ids","slice","forEach","position","Array","old","offsets","touch","time","evict","budget","candidates","size","sort","a","b"],"sources":["cache.ts"],"sourcesContent":["import type { JsonValue, LoadedRow, RowKey } from \"vastgrid-spec\";\n\n/** Rows in a block of the cache: reads cover whole blocks. */\nexport const BLOCK_ROWS = 256;\n\n/** A read of rows `[start, end)` of a view, for some of its columns. */\nexport interface Read {\n  start: number;\n  end: number;\n  columns: string[];\n}\n\n/** Rows of a view that the engine gave, by column. */\ninterface Block {\n  readonly index: number;\n  /** Rows held: `BLOCK_ROWS`, fewer at the end of the view; 0 until a read answers. */\n  length: number;\n  /** Row IDs of the rows; null for views without them, undefined until a read answers. */\n  rowIds: number[] | null | undefined;\n  readonly values: Map<string, JsonValue[]>;\n  /** Offsets of the values that the engine cut to the text limit (§8.4), by column. */\n  readonly cut: Map<string, Set<number>>;\n  /** Columns being read. */\n  readonly reading: Set<string>;\n  used: number;\n  bytes: number;\n}\n\n/** Bytes that a value takes in the cache, roughly. */\nfunction sizeOf(value: JsonValue): number {\n  if (typeof value === \"string\") return 16 + value.length * 2;\n  return 8;\n}\n\n/**\n * The rows of one view that the store has read, in blocks of `BLOCK_ROWS` rows, with a budget of bytes beyond\n * which the blocks used least recently leave (§4.1 of react.md: rows are not in snapshots).\n */\nexport class ViewCache {\n  private readonly blocks = new Map<number, Block>();\n  private clock = 0;\n  /** Bytes the blocks take, roughly. */\n  bytes = 0;\n  /** Changes whenever rows arrive or leave. */\n  version = 0;\n\n  private block(row: number): Block | undefined {\n    return this.blocks.get(Math.floor(row / BLOCK_ROWS));\n  }\n\n  private ensure(index: number): Block {\n    let block = this.blocks.get(index);\n    if (!block) {\n      block = {\n        index,\n        length: 0,\n        rowIds: undefined,\n        values: new Map(),\n        cut: new Map(),\n        reading: new Set(),\n        used: 0,\n        bytes: 0,\n      };\n      this.blocks.set(index, block);\n    }\n    return block;\n  }\n\n  /** The value of a cell; undefined while it is not read. */\n  value(row: number, column: string): JsonValue | undefined {\n    const block = this.block(row);\n    const offset = row - (block?.index ?? 0) * BLOCK_ROWS;\n    if (!block || offset >= block.length) return undefined;\n    return block.values.get(column)?.[offset];\n  }\n\n  /** Whether the engine cut the value of a cell to the text limit, so that the grid shows that it goes on. */\n  isCut(row: number, column: string): boolean {\n    const block = this.block(row);\n    return block?.cut.get(column)?.has(row - block.index * BLOCK_ROWS) ?? false;\n  }\n\n  /** The row ID of a row; undefined while it is not read or in a view without row IDs. */\n  rowId(row: number): number | undefined {\n    const block = this.block(row);\n    if (!block?.rowIds) return undefined;\n    return block.rowIds[row - block.index * BLOCK_ROWS];\n  }\n\n  /** A row as commands read it (§6.1): its key and its values, or undefined while it is not read. */\n  loaded(row: number, rowKey: string | undefined): LoadedRow | undefined {\n    const block = this.block(row);\n    const offset = row - (block?.index ?? 0) * BLOCK_ROWS;\n    if (!block || block.rowIds === undefined || offset >= block.length) return undefined;\n    let key: RowKey | undefined;\n    const id = block.rowIds?.[offset];\n    if (id !== undefined) {\n      if (rowKey === undefined) key = { rowId: id };\n      else {\n        // A row whose key column is null is keyed by its row ID (§5.3).\n        const value = block.values.get(rowKey)?.[offset];\n        if (value !== undefined) key = value === null ? { rowId: id } : { value };\n      }\n    }\n    const values = block.values;\n    return {\n      ...(key === undefined ? {} : { key }),\n      has: (column) => values.has(column),\n      get: (column) => values.get(column)?.[offset] ?? null,\n    };\n  }\n\n  /**\n   * What to read so that rows `[start, end)` have `columns`: reads of runs of blocks that lack the same columns,\n   * each of at most `maxCells` cells, leaving out what is read or being read.\n   */\n  reads(start: number, end: number, columns: readonly string[], rowCount: number, maxCells = 262_144): Read[] {\n    const reads: Read[] = [];\n    if (end <= start || columns.length === 0) return reads;\n    const last = Math.floor((Math.min(end, rowCount) - 1) / BLOCK_ROWS);\n    let run: { first: number; last: number; columns: string[]; key: string } | null = null;\n    const flush = () => {\n      if (!run) return;\n      reads.push({\n        start: run.first * BLOCK_ROWS,\n        end: Math.min((run.last + 1) * BLOCK_ROWS, rowCount),\n        columns: run.columns,\n      });\n      run = null;\n    };\n    for (let index = Math.floor(start / BLOCK_ROWS); index <= last; index++) {\n      const block = this.blocks.get(index);\n      // A block read while the view was shorter (a table or view still being made, §9) is read again whole.\n      const short =\n        block !== undefined &&\n        block.rowIds !== undefined &&\n        block.length < Math.min(BLOCK_ROWS, rowCount - index * BLOCK_ROWS);\n      const missing =\n        block && !short\n          ? columns.filter((column) => !block.values.has(column) && !block.reading.has(column))\n          : columns.filter((column) => !block?.reading.has(column));\n      if (missing.length === 0) {\n        flush();\n        continue;\n      }\n      const key = missing.join(\"\\u0000\");\n      const blocks = Math.max(1, Math.floor(maxCells / (missing.length * BLOCK_ROWS)));\n      if (run && run.key === key && index === run.last + 1 && run.last - run.first + 1 < blocks) {\n        run.last = index;\n      } else {\n        flush();\n        run = { first: index, last: index, columns: missing, key };\n      }\n    }\n    flush();\n    return reads;\n  }\n\n  /** Marks the columns of a read as being read, or no longer. */\n  reading(read: Read, on: boolean) {\n    for (let index = Math.floor(read.start / BLOCK_ROWS); index * BLOCK_ROWS < read.end; index++) {\n      const block = this.ensure(index);\n      for (const column of read.columns) {\n        if (on) block.reading.add(column);\n        else block.reading.delete(column);\n      }\n    }\n  }\n\n  /**\n   * Takes the rows of a read, which starts at a block: `rows` holds the values of `columns` for rows `start` to\n   * `start + rows.length`.\n   */\n  receive(\n    start: number,\n    rowIds: number[] | null,\n    columns: readonly string[],\n    rows: readonly (readonly JsonValue[])[],\n    cut: Record<string, number[]> | undefined,\n  ) {\n    const end = start + rows.length;\n    for (let index = Math.floor(start / BLOCK_ROWS); index * BLOCK_ROWS < end; index++) {\n      const block = this.ensure(index);\n      const before = block.bytes;\n      const first = Math.max(start, index * BLOCK_ROWS);\n      const stop = Math.min(end, (index + 1) * BLOCK_ROWS);\n      block.length = Math.max(block.length, stop - index * BLOCK_ROWS);\n      // A view that is still being made may have more rows in its last block at a later read (§9).\n      const ids = rowIds === null ? null : rowIds.slice(first - start, stop - start);\n      if (block.rowIds === undefined || (ids !== null && block.rowIds !== null && ids.length > block.rowIds.length)) {\n        block.rowIds = ids;\n      }\n      columns.forEach((column, position) => {\n        let values = block.values.get(column);\n        if (!values) {\n          values = new Array<JsonValue>(BLOCK_ROWS);\n          block.values.set(column, values);\n        }\n        for (let row = first; row < stop; row++) {\n          const value = rows[row - start][position] ?? null;\n          const offset = row - index * BLOCK_ROWS;\n          const old = values[offset];\n          if (old !== undefined) block.bytes -= sizeOf(old);\n          values[offset] = value;\n          block.bytes += sizeOf(value);\n        }\n        block.reading.delete(column);\n        const offsets = cut?.[column];\n        if (offsets) {\n          const set = block.cut.get(column) ?? new Set<number>();\n          for (const offset of offsets) {\n            const row = start + offset;\n            if (row >= first && row < stop) set.add(row - index * BLOCK_ROWS);\n          }\n          block.cut.set(column, set);\n        }\n      });\n      this.bytes += block.bytes - before;\n    }\n    this.version++;\n  }\n\n  /** Marks the blocks of rows `[start, end)` as used now, so that they leave last. */\n  touch(start: number, end: number) {\n    const time = ++this.clock;\n    for (let index = Math.floor(start / BLOCK_ROWS); index * BLOCK_ROWS < end; index++) {\n      const block = this.blocks.get(index);\n      if (block) block.used = time;\n    }\n  }\n\n  /** Removes the blocks used least recently until the cache fits `budget` bytes, keeping rows `[start, end)`. */\n  evict(budget: number, start: number, end: number) {\n    if (this.bytes <= budget) return;\n    const first = Math.floor(start / BLOCK_ROWS);\n    const last = Math.floor(Math.max(start, end - 1) / BLOCK_ROWS);\n    const candidates = [...this.blocks.values()]\n      .filter((block) => (block.index < first || block.index > last) && block.reading.size === 0)\n      .sort((a, b) => a.used - b.used);\n    for (const block of candidates) {\n      if (this.bytes <= budget) break;\n      this.blocks.delete(block.index);\n      this.bytes -= block.bytes;\n    }\n    this.version++;\n  }\n}\n"],"mappings":"AAEA;AACA,OAAO,MAAMA,UAAU,GAAG,GAAG;;AAE7B;;AAOA;;AAgBA;AACA,SAASC,MAAMA,CAACC,KAAgB,EAAU;EACxC,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE,OAAO,EAAE,GAAGA,KAAK,CAACC,MAAM,GAAG,CAAC;EAC3D,OAAO,CAAC;AACV;;AAEA;AACA;AACA;AACA;AACA,OAAO,MAAMC,SAAS,CAAC;EACJC,MAAM,GAAG,IAAIC,GAAG,CAAgB,CAAC;EAC1CC,KAAK,GAAG,CAAC;EACjB;EACAC,KAAK,GAAG,CAAC;EACT;EACAC,OAAO,GAAG,CAAC;EAEHC,KAAKA,CAACC,GAAW,EAAqB;IAC5C,OAAO,IAAI,CAACN,MAAM,CAACO,GAAG,CAACC,IAAI,CAACC,KAAK,CAACH,GAAG,GAAGX,UAAU,CAAC,CAAC;EACtD;EAEQe,MAAMA,CAACC,KAAa,EAAS;IACnC,IAAIN,KAAK,GAAG,IAAI,CAACL,MAAM,CAACO,GAAG,CAACI,KAAK,CAAC;IAClC,IAAI,CAACN,KAAK,EAAE;MACVA,KAAK,GAAG;QACNM,KAAK;QACLb,MAAM,EAAE,CAAC;QACTc,MAAM,EAAEC,SAAS;QACjBC,MAAM,EAAE,IAAIb,GAAG,CAAC,CAAC;QACjBc,GAAG,EAAE,IAAId,GAAG,CAAC,CAAC;QACde,OAAO,EAAE,IAAIC,GAAG,CAAC,CAAC;QAClBC,IAAI,EAAE,CAAC;QACPf,KAAK,EAAE;MACT,CAAC;MACD,IAAI,CAACH,MAAM,CAACmB,GAAG,CAACR,KAAK,EAAEN,KAAK,CAAC;IAC/B;IACA,OAAOA,KAAK;EACd;;EAEA;EACAR,KAAKA,CAACS,GAAW,EAAEc,MAAc,EAAyB;IACxD,MAAMf,KAAK,GAAG,IAAI,CAACA,KAAK,CAACC,GAAG,CAAC;IAC7B,MAAMe,MAAM,GAAGf,GAAG,GAAG,CAACD,KAAK,EAAEM,KAAK,IAAI,CAAC,IAAIhB,UAAU;IACrD,IAAI,CAACU,KAAK,IAAIgB,MAAM,IAAIhB,KAAK,CAACP,MAAM,EAAE,OAAOe,SAAS;IACtD,OAAOR,KAAK,CAACS,MAAM,CAACP,GAAG,CAACa,MAAM,CAAC,GAAGC,MAAM,CAAC;EAC3C;;EAEA;EACAC,KAAKA,CAAChB,GAAW,EAAEc,MAAc,EAAW;IAC1C,MAAMf,KAAK,GAAG,IAAI,CAACA,KAAK,CAACC,GAAG,CAAC;IAC7B,OAAOD,KAAK,EAAEU,GAAG,CAACR,GAAG,CAACa,MAAM,CAAC,EAAEG,GAAG,CAACjB,GAAG,GAAGD,KAAK,CAACM,KAAK,GAAGhB,UAAU,CAAC,IAAI,KAAK;EAC7E;;EAEA;EACA6B,KAAKA,CAAClB,GAAW,EAAsB;IACrC,MAAMD,KAAK,GAAG,IAAI,CAACA,KAAK,CAACC,GAAG,CAAC;IAC7B,IAAI,CAACD,KAAK,EAAEO,MAAM,EAAE,OAAOC,SAAS;IACpC,OAAOR,KAAK,CAACO,MAAM,CAACN,GAAG,GAAGD,KAAK,CAACM,KAAK,GAAGhB,UAAU,CAAC;EACrD;;EAEA;EACA8B,MAAMA,CAACnB,GAAW,EAAEoB,MAA0B,EAAyB;IACrE,MAAMrB,KAAK,GAAG,IAAI,CAACA,KAAK,CAACC,GAAG,CAAC;IAC7B,MAAMe,MAAM,GAAGf,GAAG,GAAG,CAACD,KAAK,EAAEM,KAAK,IAAI,CAAC,IAAIhB,UAAU;IACrD,IAAI,CAACU,KAAK,IAAIA,KAAK,CAACO,MAAM,KAAKC,SAAS,IAAIQ,MAAM,IAAIhB,KAAK,CAACP,MAAM,EAAE,OAAOe,SAAS;IACpF,IAAIc,GAAuB;IAC3B,MAAMC,EAAE,GAAGvB,KAAK,CAACO,MAAM,GAAGS,MAAM,CAAC;IACjC,IAAIO,EAAE,KAAKf,SAAS,EAAE;MACpB,IAAIa,MAAM,KAAKb,SAAS,EAAEc,GAAG,GAAG;QAAEH,KAAK,EAAEI;MAAG,CAAC,CAAC,KACzC;QACH;QACA,MAAM/B,KAAK,GAAGQ,KAAK,CAACS,MAAM,CAACP,GAAG,CAACmB,MAAM,CAAC,GAAGL,MAAM,CAAC;QAChD,IAAIxB,KAAK,KAAKgB,SAAS,EAAEc,GAAG,GAAG9B,KAAK,KAAK,IAAI,GAAG;UAAE2B,KAAK,EAAEI;QAAG,CAAC,GAAG;UAAE/B;QAAM,CAAC;MAC3E;IACF;IACA,MAAMiB,MAAM,GAAGT,KAAK,CAACS,MAAM;IAC3B,OAAO;MACL,IAAIa,GAAG,KAAKd,SAAS,GAAG,CAAC,CAAC,GAAG;QAAEc;MAAI,CAAC,CAAC;MACrCJ,GAAG,EAAGH,MAAM,IAAKN,MAAM,CAACS,GAAG,CAACH,MAAM,CAAC;MACnCb,GAAG,EAAGa,MAAM,IAAKN,MAAM,CAACP,GAAG,CAACa,MAAM,CAAC,GAAGC,MAAM,CAAC,IAAI;IACnD,CAAC;EACH;;EAEA;AACF;AACA;AACA;EACEQ,KAAKA,CAACC,KAAa,EAAEC,GAAW,EAAEC,OAA0B,EAAEC,QAAgB,EAAEC,QAAQ,GAAG,OAAO,EAAU;IAC1G,MAAML,KAAa,GAAG,EAAE;IACxB,IAAIE,GAAG,IAAID,KAAK,IAAIE,OAAO,CAAClC,MAAM,KAAK,CAAC,EAAE,OAAO+B,KAAK;IACtD,MAAMM,IAAI,GAAG3B,IAAI,CAACC,KAAK,CAAC,CAACD,IAAI,CAAC4B,GAAG,CAACL,GAAG,EAAEE,QAAQ,CAAC,GAAG,CAAC,IAAItC,UAAU,CAAC;IACnE,IAAI0C,GAA2E,GAAG,IAAI;IACtF,MAAMC,KAAK,GAAGA,CAAA,KAAM;MAClB,IAAI,CAACD,GAAG,EAAE;MACVR,KAAK,CAACU,IAAI,CAAC;QACTT,KAAK,EAAEO,GAAG,CAACG,KAAK,GAAG7C,UAAU;QAC7BoC,GAAG,EAAEvB,IAAI,CAAC4B,GAAG,CAAC,CAACC,GAAG,CAACF,IAAI,GAAG,CAAC,IAAIxC,UAAU,EAAEsC,QAAQ,CAAC;QACpDD,OAAO,EAAEK,GAAG,CAACL;MACf,CAAC,CAAC;MACFK,GAAG,GAAG,IAAI;IACZ,CAAC;IACD,KAAK,IAAI1B,KAAK,GAAGH,IAAI,CAACC,KAAK,CAACqB,KAAK,GAAGnC,UAAU,CAAC,EAAEgB,KAAK,IAAIwB,IAAI,EAAExB,KAAK,EAAE,EAAE;MACvE,MAAMN,KAAK,GAAG,IAAI,CAACL,MAAM,CAACO,GAAG,CAACI,KAAK,CAAC;MACpC;MACA,MAAM8B,KAAK,GACTpC,KAAK,KAAKQ,SAAS,IACnBR,KAAK,CAACO,MAAM,KAAKC,SAAS,IAC1BR,KAAK,CAACP,MAAM,GAAGU,IAAI,CAAC4B,GAAG,CAACzC,UAAU,EAAEsC,QAAQ,GAAGtB,KAAK,GAAGhB,UAAU,CAAC;MACpE,MAAM+C,OAAO,GACXrC,KAAK,IAAI,CAACoC,KAAK,GACXT,OAAO,CAACW,MAAM,CAAEvB,MAAM,IAAK,CAACf,KAAK,CAACS,MAAM,CAACS,GAAG,CAACH,MAAM,CAAC,IAAI,CAACf,KAAK,CAACW,OAAO,CAACO,GAAG,CAACH,MAAM,CAAC,CAAC,GACnFY,OAAO,CAACW,MAAM,CAAEvB,MAAM,IAAK,CAACf,KAAK,EAAEW,OAAO,CAACO,GAAG,CAACH,MAAM,CAAC,CAAC;MAC7D,IAAIsB,OAAO,CAAC5C,MAAM,KAAK,CAAC,EAAE;QACxBwC,KAAK,CAAC,CAAC;QACP;MACF;MACA,MAAMX,GAAG,GAAGe,OAAO,CAACE,IAAI,CAAC,QAAQ,CAAC;MAClC,MAAM5C,MAAM,GAAGQ,IAAI,CAACqC,GAAG,CAAC,CAAC,EAAErC,IAAI,CAACC,KAAK,CAACyB,QAAQ,IAAIQ,OAAO,CAAC5C,MAAM,GAAGH,UAAU,CAAC,CAAC,CAAC;MAChF,IAAI0C,GAAG,IAAIA,GAAG,CAACV,GAAG,KAAKA,GAAG,IAAIhB,KAAK,KAAK0B,GAAG,CAACF,IAAI,GAAG,CAAC,IAAIE,GAAG,CAACF,IAAI,GAAGE,GAAG,CAACG,KAAK,GAAG,CAAC,GAAGxC,MAAM,EAAE;QACzFqC,GAAG,CAACF,IAAI,GAAGxB,KAAK;MAClB,CAAC,MAAM;QACL2B,KAAK,CAAC,CAAC;QACPD,GAAG,GAAG;UAAEG,KAAK,EAAE7B,KAAK;UAAEwB,IAAI,EAAExB,KAAK;UAAEqB,OAAO,EAAEU,OAAO;UAAEf;QAAI,CAAC;MAC5D;IACF;IACAW,KAAK,CAAC,CAAC;IACP,OAAOT,KAAK;EACd;;EAEA;EACAb,OAAOA,CAAC8B,IAAU,EAAEC,EAAW,EAAE;IAC/B,KAAK,IAAIpC,KAAK,GAAGH,IAAI,CAACC,KAAK,CAACqC,IAAI,CAAChB,KAAK,GAAGnC,UAAU,CAAC,EAAEgB,KAAK,GAAGhB,UAAU,GAAGmD,IAAI,CAACf,GAAG,EAAEpB,KAAK,EAAE,EAAE;MAC5F,MAAMN,KAAK,GAAG,IAAI,CAACK,MAAM,CAACC,KAAK,CAAC;MAChC,KAAK,MAAMS,MAAM,IAAI0B,IAAI,CAACd,OAAO,EAAE;QACjC,IAAIe,EAAE,EAAE1C,KAAK,CAACW,OAAO,CAACgC,GAAG,CAAC5B,MAAM,CAAC,CAAC,KAC7Bf,KAAK,CAACW,OAAO,CAACiC,MAAM,CAAC7B,MAAM,CAAC;MACnC;IACF;EACF;;EAEA;AACF;AACA;AACA;EACE8B,OAAOA,CACLpB,KAAa,EACblB,MAAuB,EACvBoB,OAA0B,EAC1BmB,IAAuC,EACvCpC,GAAyC,EACzC;IACA,MAAMgB,GAAG,GAAGD,KAAK,GAAGqB,IAAI,CAACrD,MAAM;IAC/B,KAAK,IAAIa,KAAK,GAAGH,IAAI,CAACC,KAAK,CAACqB,KAAK,GAAGnC,UAAU,CAAC,EAAEgB,KAAK,GAAGhB,UAAU,GAAGoC,GAAG,EAAEpB,KAAK,EAAE,EAAE;MAClF,MAAMN,KAAK,GAAG,IAAI,CAACK,MAAM,CAACC,KAAK,CAAC;MAChC,MAAMyC,MAAM,GAAG/C,KAAK,CAACF,KAAK;MAC1B,MAAMqC,KAAK,GAAGhC,IAAI,CAACqC,GAAG,CAACf,KAAK,EAAEnB,KAAK,GAAGhB,UAAU,CAAC;MACjD,MAAM0D,IAAI,GAAG7C,IAAI,CAAC4B,GAAG,CAACL,GAAG,EAAE,CAACpB,KAAK,GAAG,CAAC,IAAIhB,UAAU,CAAC;MACpDU,KAAK,CAACP,MAAM,GAAGU,IAAI,CAACqC,GAAG,CAACxC,KAAK,CAACP,MAAM,EAAEuD,IAAI,GAAG1C,KAAK,GAAGhB,UAAU,CAAC;MAChE;MACA,MAAM2D,GAAG,GAAG1C,MAAM,KAAK,IAAI,GAAG,IAAI,GAAGA,MAAM,CAAC2C,KAAK,CAACf,KAAK,GAAGV,KAAK,EAAEuB,IAAI,GAAGvB,KAAK,CAAC;MAC9E,IAAIzB,KAAK,CAACO,MAAM,KAAKC,SAAS,IAAKyC,GAAG,KAAK,IAAI,IAAIjD,KAAK,CAACO,MAAM,KAAK,IAAI,IAAI0C,GAAG,CAACxD,MAAM,GAAGO,KAAK,CAACO,MAAM,CAACd,MAAO,EAAE;QAC7GO,KAAK,CAACO,MAAM,GAAG0C,GAAG;MACpB;MACAtB,OAAO,CAACwB,OAAO,CAAC,CAACpC,MAAM,EAAEqC,QAAQ,KAAK;QACpC,IAAI3C,MAAM,GAAGT,KAAK,CAACS,MAAM,CAACP,GAAG,CAACa,MAAM,CAAC;QACrC,IAAI,CAACN,MAAM,EAAE;UACXA,MAAM,GAAG,IAAI4C,KAAK,CAAY/D,UAAU,CAAC;UACzCU,KAAK,CAACS,MAAM,CAACK,GAAG,CAACC,MAAM,EAAEN,MAAM,CAAC;QAClC;QACA,KAAK,IAAIR,GAAG,GAAGkC,KAAK,EAAElC,GAAG,GAAG+C,IAAI,EAAE/C,GAAG,EAAE,EAAE;UACvC,MAAMT,KAAK,GAAGsD,IAAI,CAAC7C,GAAG,GAAGwB,KAAK,CAAC,CAAC2B,QAAQ,CAAC,IAAI,IAAI;UACjD,MAAMpC,MAAM,GAAGf,GAAG,GAAGK,KAAK,GAAGhB,UAAU;UACvC,MAAMgE,GAAG,GAAG7C,MAAM,CAACO,MAAM,CAAC;UAC1B,IAAIsC,GAAG,KAAK9C,SAAS,EAAER,KAAK,CAACF,KAAK,IAAIP,MAAM,CAAC+D,GAAG,CAAC;UACjD7C,MAAM,CAACO,MAAM,CAAC,GAAGxB,KAAK;UACtBQ,KAAK,CAACF,KAAK,IAAIP,MAAM,CAACC,KAAK,CAAC;QAC9B;QACAQ,KAAK,CAACW,OAAO,CAACiC,MAAM,CAAC7B,MAAM,CAAC;QAC5B,MAAMwC,OAAO,GAAG7C,GAAG,GAAGK,MAAM,CAAC;QAC7B,IAAIwC,OAAO,EAAE;UACX,MAAMzC,GAAG,GAAGd,KAAK,CAACU,GAAG,CAACR,GAAG,CAACa,MAAM,CAAC,IAAI,IAAIH,GAAG,CAAS,CAAC;UACtD,KAAK,MAAMI,MAAM,IAAIuC,OAAO,EAAE;YAC5B,MAAMtD,GAAG,GAAGwB,KAAK,GAAGT,MAAM;YAC1B,IAAIf,GAAG,IAAIkC,KAAK,IAAIlC,GAAG,GAAG+C,IAAI,EAAElC,GAAG,CAAC6B,GAAG,CAAC1C,GAAG,GAAGK,KAAK,GAAGhB,UAAU,CAAC;UACnE;UACAU,KAAK,CAACU,GAAG,CAACI,GAAG,CAACC,MAAM,EAAED,GAAG,CAAC;QAC5B;MACF,CAAC,CAAC;MACF,IAAI,CAAChB,KAAK,IAAIE,KAAK,CAACF,KAAK,GAAGiD,MAAM;IACpC;IACA,IAAI,CAAChD,OAAO,EAAE;EAChB;;EAEA;EACAyD,KAAKA,CAAC/B,KAAa,EAAEC,GAAW,EAAE;IAChC,MAAM+B,IAAI,GAAG,EAAE,IAAI,CAAC5D,KAAK;IACzB,KAAK,IAAIS,KAAK,GAAGH,IAAI,CAACC,KAAK,CAACqB,KAAK,GAAGnC,UAAU,CAAC,EAAEgB,KAAK,GAAGhB,UAAU,GAAGoC,GAAG,EAAEpB,KAAK,EAAE,EAAE;MAClF,MAAMN,KAAK,GAAG,IAAI,CAACL,MAAM,CAACO,GAAG,CAACI,KAAK,CAAC;MACpC,IAAIN,KAAK,EAAEA,KAAK,CAACa,IAAI,GAAG4C,IAAI;IAC9B;EACF;;EAEA;EACAC,KAAKA,CAACC,MAAc,EAAElC,KAAa,EAAEC,GAAW,EAAE;IAChD,IAAI,IAAI,CAAC5B,KAAK,IAAI6D,MAAM,EAAE;IAC1B,MAAMxB,KAAK,GAAGhC,IAAI,CAACC,KAAK,CAACqB,KAAK,GAAGnC,UAAU,CAAC;IAC5C,MAAMwC,IAAI,GAAG3B,IAAI,CAACC,KAAK,CAACD,IAAI,CAACqC,GAAG,CAACf,KAAK,EAAEC,GAAG,GAAG,CAAC,CAAC,GAAGpC,UAAU,CAAC;IAC9D,MAAMsE,UAAU,GAAG,CAAC,GAAG,IAAI,CAACjE,MAAM,CAACc,MAAM,CAAC,CAAC,CAAC,CACzC6B,MAAM,CAAEtC,KAAK,IAAK,CAACA,KAAK,CAACM,KAAK,GAAG6B,KAAK,IAAInC,KAAK,CAACM,KAAK,GAAGwB,IAAI,KAAK9B,KAAK,CAACW,OAAO,CAACkD,IAAI,KAAK,CAAC,CAAC,CAC1FC,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAClD,IAAI,GAAGmD,CAAC,CAACnD,IAAI,CAAC;IAClC,KAAK,MAAMb,KAAK,IAAI4D,UAAU,EAAE;MAC9B,IAAI,IAAI,CAAC9D,KAAK,IAAI6D,MAAM,EAAE;MAC1B,IAAI,CAAChE,MAAM,CAACiD,MAAM,CAAC5C,KAAK,CAACM,KAAK,CAAC;MAC/B,IAAI,CAACR,KAAK,IAAIE,KAAK,CAACF,KAAK;IAC3B;IACA,IAAI,CAACC,OAAO,EAAE;EAChB;AACF","ignoreList":[]}

package/dist/core/checked.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Checked rows (§5.2.1 of the specification) as the grid shows them: whether a row of the view is checked, not
+ * checked or unknown, and how many rows of the view are checked.
+ */
+import { type Checked, type Plan, type RowKey } from "vastgrid-spec";
+export type CheckState = "checked" | "unchecked" | "unknown";
+/** Whether a row of the view, by its key, is checked. */
+export declare function checkState(checked: Checked | undefined, plan: Plan | undefined, key: RowKey): CheckState;
+/**
+ * How many rows of the view are checked, or null when it is not known: rows of `exclude` that the view does not
+ * cover, and keys of `include` and `exclude` that are not rows of the view (filtered out) are counted as if they
+ * were, so the count is exact when every key is a row of the view.
+ */
+export declare function checkedCount(checked: Checked | undefined, plan: Plan | undefined, rowCount: number): number | null;
+/**
+ * The state of the header's check box: every row of the view checked (`exclude` without keys, covering the view),
+ * none, some, or unknown. Keys of `include` may be rows of other views, so they make "some", never "all".
+ */
+export declare function allState(checked: Checked | undefined, plan: Plan | undefined, rowCount: number): "all" | "none" | "some" | "unknown";
+//# sourceMappingURL=checked.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"checked.d.ts","sourceRoot":"","sources":["../../src/core/checked.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,KAAK,OAAO,EAA0B,KAAK,IAAI,EAAW,KAAK,MAAM,EAAE,MAAM,eAAe,CAAC;AAEtG,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,GAAG,SAAS,CAAC;AA2B7D,yDAAyD;AACzD,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAMxG;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAKlH;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,uCAK9F"}

package/dist/core/checked.js

@@ -0,0 +1,61 @@
+/**
+ * Checked rows (§5.2.1 of the specification) as the grid shows them: whether a row of the view is checked, not
+ * checked or unknown, and how many rows of the view are checked.
+ */
+import { canonicalJson, keyText, partsOf } from "vastgrid-spec";
+/** Whether the view's `where` implies the `where` of checked rows, so that every row of it is known (§5.2.1). */
+function coversView(checked, plan) {
+  if (!checked || checked.mode === "include" || checked.where === undefined) return true;
+  const view = partsOf(plan?.where).map(part => ({
+    part,
+    json: canonicalJson(part)
+  }));
+  return partsOf(checked.where).every(part => {
+    const json = canonicalJson(part);
+    return view.some(item => item.json === json || "search" in part && "search" in item.part && item.part.search.includes(part.search));
+  });
+}
+const keySets = new WeakMap();
+
+/** The keys of checked rows by their text (`keyText`, which is the same for the same keys, §5.3), made once. */
+function keysOf(checked) {
+  let set = keySets.get(checked);
+  if (!set) {
+    set = new Set(checked.keys.map(keyText));
+    keySets.set(checked, set);
+  }
+  return set;
+}
+
+/** Whether a row of the view, by its key, is checked. */
+export function checkState(checked, plan, key) {
+  if (!checked) return "unchecked";
+  const listed = keysOf(checked).has(keyText(key));
+  if (checked.mode === "include") return listed ? "checked" : "unchecked";
+  if (!coversView(checked, plan)) return "unknown";
+  return listed ? "unchecked" : "checked";
+}
+
+/**
+ * How many rows of the view are checked, or null when it is not known: rows of `exclude` that the view does not
+ * cover, and keys of `include` and `exclude` that are not rows of the view (filtered out) are counted as if they
+ * were, so the count is exact when every key is a row of the view.
+ */
+export function checkedCount(checked, plan, rowCount) {
+  if (!checked) return 0;
+  if (checked.mode === "include") return checked.keys.length;
+  if (!coversView(checked, plan)) return null;
+  return Math.max(0, rowCount - checked.keys.length);
+}
+
+/**
+ * The state of the header's check box: every row of the view checked (`exclude` without keys, covering the view),
+ * none, some, or unknown. Keys of `include` may be rows of other views, so they make "some", never "all".
+ */
+export function allState(checked, plan, rowCount) {
+  if (!checked || checked.mode === "include" && checked.keys.length === 0) return "none";
+  if (checked.mode === "include") return "some";
+  if (!coversView(checked, plan)) return "unknown";
+  return checked.keys.length === 0 ? "all" : checked.keys.length >= rowCount ? "none" : "some";
+}
+//# sourceMappingURL=checked.js.map

package/dist/core/checked.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["canonicalJson","keyText","partsOf","coversView","checked","plan","mode","where","undefined","view","map","part","json","every","some","item","search","includes","keySets","WeakMap","keysOf","set","get","Set","keys","checkState","key","listed","has","checkedCount","rowCount","length","Math","max","allState"],"sources":["checked.ts"],"sourcesContent":["/**\n * Checked rows (§5.2.1 of the specification) as the grid shows them: whether a row of the view is checked, not\n * checked or unknown, and how many rows of the view are checked.\n */\nimport { type Checked, canonicalJson, keyText, type Plan, partsOf, type RowKey } from \"vastgrid-spec\";\n\nexport type CheckState = \"checked\" | \"unchecked\" | \"unknown\";\n\n/** Whether the view's `where` implies the `where` of checked rows, so that every row of it is known (§5.2.1). */\nfunction coversView(checked: Checked | undefined, plan: Plan | undefined): boolean {\n  if (!checked || checked.mode === \"include\" || checked.where === undefined) return true;\n  const view = partsOf(plan?.where).map((part) => ({ part, json: canonicalJson(part) }));\n  return partsOf(checked.where).every((part) => {\n    const json = canonicalJson(part);\n    return view.some(\n      (item) =>\n        item.json === json || (\"search\" in part && \"search\" in item.part && item.part.search.includes(part.search)),\n    );\n  });\n}\n\nconst keySets = new WeakMap<Checked, Set<string>>();\n\n/** The keys of checked rows by their text (`keyText`, which is the same for the same keys, §5.3), made once. */\nfunction keysOf(checked: Checked): Set<string> {\n  let set = keySets.get(checked);\n  if (!set) {\n    set = new Set(checked.keys.map(keyText));\n    keySets.set(checked, set);\n  }\n  return set;\n}\n\n/** Whether a row of the view, by its key, is checked. */\nexport function checkState(checked: Checked | undefined, plan: Plan | undefined, key: RowKey): CheckState {\n  if (!checked) return \"unchecked\";\n  const listed = keysOf(checked).has(keyText(key));\n  if (checked.mode === \"include\") return listed ? \"checked\" : \"unchecked\";\n  if (!coversView(checked, plan)) return \"unknown\";\n  return listed ? \"unchecked\" : \"checked\";\n}\n\n/**\n * How many rows of the view are checked, or null when it is not known: rows of `exclude` that the view does not\n * cover, and keys of `include` and `exclude` that are not rows of the view (filtered out) are counted as if they\n * were, so the count is exact when every key is a row of the view.\n */\nexport function checkedCount(checked: Checked | undefined, plan: Plan | undefined, rowCount: number): number | null {\n  if (!checked) return 0;\n  if (checked.mode === \"include\") return checked.keys.length;\n  if (!coversView(checked, plan)) return null;\n  return Math.max(0, rowCount - checked.keys.length);\n}\n\n/**\n * The state of the header's check box: every row of the view checked (`exclude` without keys, covering the view),\n * none, some, or unknown. Keys of `include` may be rows of other views, so they make \"some\", never \"all\".\n */\nexport function allState(checked: Checked | undefined, plan: Plan | undefined, rowCount: number) {\n  if (!checked || (checked.mode === \"include\" && checked.keys.length === 0)) return \"none\";\n  if (checked.mode === \"include\") return \"some\";\n  if (!coversView(checked, plan)) return \"unknown\";\n  return checked.keys.length === 0 ? \"all\" : checked.keys.length >= rowCount ? \"none\" : \"some\";\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA,SAAuBA,aAAa,EAAEC,OAAO,EAAaC,OAAO,QAAqB,eAAe;AAIrG;AACA,SAASC,UAAUA,CAACC,OAA4B,EAAEC,IAAsB,EAAW;EACjF,IAAI,CAACD,OAAO,IAAIA,OAAO,CAACE,IAAI,KAAK,SAAS,IAAIF,OAAO,CAACG,KAAK,KAAKC,SAAS,EAAE,OAAO,IAAI;EACtF,MAAMC,IAAI,GAAGP,OAAO,CAACG,IAAI,EAAEE,KAAK,CAAC,CAACG,GAAG,CAAEC,IAAI,KAAM;IAAEA,IAAI;IAAEC,IAAI,EAAEZ,aAAa,CAACW,IAAI;EAAE,CAAC,CAAC,CAAC;EACtF,OAAOT,OAAO,CAACE,OAAO,CAACG,KAAK,CAAC,CAACM,KAAK,CAAEF,IAAI,IAAK;IAC5C,MAAMC,IAAI,GAAGZ,aAAa,CAACW,IAAI,CAAC;IAChC,OAAOF,IAAI,CAACK,IAAI,CACbC,IAAI,IACHA,IAAI,CAACH,IAAI,KAAKA,IAAI,IAAK,QAAQ,IAAID,IAAI,IAAI,QAAQ,IAAII,IAAI,CAACJ,IAAI,IAAII,IAAI,CAACJ,IAAI,CAACK,MAAM,CAACC,QAAQ,CAACN,IAAI,CAACK,MAAM,CAC7G,CAAC;EACH,CAAC,CAAC;AACJ;AAEA,MAAME,OAAO,GAAG,IAAIC,OAAO,CAAuB,CAAC;;AAEnD;AACA,SAASC,MAAMA,CAAChB,OAAgB,EAAe;EAC7C,IAAIiB,GAAG,GAAGH,OAAO,CAACI,GAAG,CAAClB,OAAO,CAAC;EAC9B,IAAI,CAACiB,GAAG,EAAE;IACRA,GAAG,GAAG,IAAIE,GAAG,CAACnB,OAAO,CAACoB,IAAI,CAACd,GAAG,CAACT,OAAO,CAAC,CAAC;IACxCiB,OAAO,CAACG,GAAG,CAACjB,OAAO,EAAEiB,GAAG,CAAC;EAC3B;EACA,OAAOA,GAAG;AACZ;;AAEA;AACA,OAAO,SAASI,UAAUA,CAACrB,OAA4B,EAAEC,IAAsB,EAAEqB,GAAW,EAAc;EACxG,IAAI,CAACtB,OAAO,EAAE,OAAO,WAAW;EAChC,MAAMuB,MAAM,GAAGP,MAAM,CAAChB,OAAO,CAAC,CAACwB,GAAG,CAAC3B,OAAO,CAACyB,GAAG,CAAC,CAAC;EAChD,IAAItB,OAAO,CAACE,IAAI,KAAK,SAAS,EAAE,OAAOqB,MAAM,GAAG,SAAS,GAAG,WAAW;EACvE,IAAI,CAACxB,UAAU,CAACC,OAAO,EAAEC,IAAI,CAAC,EAAE,OAAO,SAAS;EAChD,OAAOsB,MAAM,GAAG,WAAW,GAAG,SAAS;AACzC;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASE,YAAYA,CAACzB,OAA4B,EAAEC,IAAsB,EAAEyB,QAAgB,EAAiB;EAClH,IAAI,CAAC1B,OAAO,EAAE,OAAO,CAAC;EACtB,IAAIA,OAAO,CAACE,IAAI,KAAK,SAAS,EAAE,OAAOF,OAAO,CAACoB,IAAI,CAACO,MAAM;EAC1D,IAAI,CAAC5B,UAAU,CAACC,OAAO,EAAEC,IAAI,CAAC,EAAE,OAAO,IAAI;EAC3C,OAAO2B,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEH,QAAQ,GAAG1B,OAAO,CAACoB,IAAI,CAACO,MAAM,CAAC;AACpD;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAASG,QAAQA,CAAC9B,OAA4B,EAAEC,IAAsB,EAAEyB,QAAgB,EAAE;EAC/F,IAAI,CAAC1B,OAAO,IAAKA,OAAO,CAACE,IAAI,KAAK,SAAS,IAAIF,OAAO,CAACoB,IAAI,CAACO,MAAM,KAAK,CAAE,EAAE,OAAO,MAAM;EACxF,IAAI3B,OAAO,CAACE,IAAI,KAAK,SAAS,EAAE,OAAO,MAAM;EAC7C,IAAI,CAACH,UAAU,CAACC,OAAO,EAAEC,IAAI,CAAC,EAAE,OAAO,SAAS;EAChD,OAAOD,OAAO,CAACoB,IAAI,CAACO,MAAM,KAAK,CAAC,GAAG,KAAK,GAAG3B,OAAO,CAACoB,IAAI,CAACO,MAAM,IAAID,QAAQ,GAAG,MAAM,GAAG,MAAM;AAC9F","ignoreList":[]}

package/dist/core/client.d.ts

@@ -0,0 +1,33 @@
+import { type Operation } from "vastgrid-spec";
+import { type RequestMessage } from "./types.js";
+/**
+ * Carries messages (§8 of the specification) to an engine and gives back its answers: a function call, a Web
+ * Worker, HTTP, a Server Function, an MCP tool call (§4.4 of react.md).
+ */
+export interface Transport {
+    /** Sends a request and gives its response; `cancel` has none. */
+    send(request: RequestMessage, options: {
+        signal?: AbortSignal;
+    }): Promise<unknown>;
+    /** Follows the engine's events (§8.5), when the transport carries them. */
+    subscribe?(listener: (event: unknown) => void): () => void;
+    /**
+     * How a request in flight is cancelled (§8.6): by a `cancel` request (the default), or by the transport itself
+     * when the signal given to `send` aborts (an HTTP request is aborted).
+     */
+    cancels?: "message" | "signal";
+    /**
+     * Where the file of an `export` without a target can be downloaded, by the `target` of its answer (§8.2): the
+     * HTTP transport's `<url>/exports/<target>`. Absent when the transport has no such place.
+     */
+    exportUrl?(target: string): string;
+}
+/** Sends requests through a transport: gives them ids, checks the answers and cancels what is no longer needed. */
+export declare class GridClient {
+    readonly transport: Transport;
+    constructor(transport: Transport);
+    request<T>(op: Operation, members: Record<string, unknown>, signal?: AbortSignal): Promise<T>;
+    /** Follows the engine's events, checked (§8.5); events that do not follow §8 are left out. */
+    subscribe(listener: (event: Record<string, unknown>) => void): () => void;
+}
+//# sourceMappingURL=client.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../src/core/client.ts"],"names":[],"mappings":"AAAA,OAAO,EAA6B,KAAK,SAAS,EAAuC,MAAM,eAAe,CAAC;AAE/G,OAAO,EAAa,KAAK,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5D;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,iEAAiE;IACjE,IAAI,CAAC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACnF,2EAA2E;IAC3E,SAAS,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;IAC3D;;;OAGG;IACH,OAAO,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAC;IAC/B;;;OAGG;IACH,SAAS,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;CACpC;AAwCD,mHAAmH;AACnH,qBAAa,UAAU;IACT,QAAQ,CAAC,SAAS,EAAE,SAAS;IAAzC,YAAqB,SAAS,EAAE,SAAS,EAAI;IAE7C,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAsB5F;IAED,8FAA8F;IAC9F,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,GAAG,MAAM,IAAI,CASxE;CACF"}

package/dist/core/client.js

@@ -0,0 +1,103 @@
+import { checkEvent, checkResponse, ProtocolError, toStructuredEncoding } from "vastgrid-spec";
+import { now, track } from "./trace.js";
+import { GridError } from "./types.js";
+
+/**
+ * Carries messages (§8 of the specification) to an engine and gives back its answers: a function call, a Web
+ * Worker, HTTP, a Server Function, an MCP tool call (§4.4 of react.md).
+ */
+
+function cancelled(op) {
+  return new GridError("cancelled", "The request was cancelled.", {
+    op
+  });
+}
+
+/** Reads a response: its result, or the error it carries as a `GridError`. */
+function read(message, op) {
+  let response;
+  try {
+    response = checkResponse(message, op);
+  } catch (error) {
+    // A response that does not follow §8 is an internal error for the client (§8.1).
+    if (error instanceof ProtocolError) {
+      throw new GridError("internal", `The engine's response does not follow the protocol: ${error.message}`, {
+        op,
+        reason: error.reason,
+        path: error.path
+      });
+    }
+    throw error;
+  }
+  const error = response.error;
+  if (error) {
+    throw new GridError(error.code, error.message, {
+      op,
+      reason: error.reason,
+      path: error.path,
+      details: error.details
+    });
+  }
+  return toStructuredEncoding(response).result;
+}
+
+// Clients can share a transport or reach the same engine through different transports. Their requests and
+// cancellations must use distinct ids, including after a store is disconnected and another is created.
+let nextId = 1;
+
+/** Sends requests through a transport: gives them ids, checks the answers and cancels what is no longer needed. */
+export class GridClient {
+  constructor(transport) {
+    this.transport = transport;
+  }
+  request(op, members, signal) {
+    if (signal?.aborted) return Promise.reject(cancelled(op));
+    const id = nextId++;
+    const started = now();
+    const bySignal = this.transport.cancels === "signal";
+    const sent = this.transport.send({
+      v: 2,
+      id,
+      op,
+      ...members
+    }, bySignal && signal ? {
+      signal
+    } : {});
+    if (!signal) return sent.then(response => read(response, op)).finally(() => track(op, started, "requests"));
+    let stop = () => {};
+    const aborted = new Promise((_, reject) => {
+      const abort = () => {
+        if (!bySignal) {
+          this.transport.send({
+            v: 2,
+            id: nextId++,
+            op: "cancel",
+            request: id
+          }, {}).catch(() => {});
+        }
+        reject(cancelled(op));
+      };
+      signal.addEventListener("abort", abort, {
+        once: true
+      });
+      stop = () => signal.removeEventListener("abort", abort);
+    });
+    return Promise.race([sent.then(response => read(response, op)), aborted]).finally(() => {
+      stop();
+      track(op, started, "requests");
+    });
+  }
+
+  /** Follows the engine's events, checked (§8.5); events that do not follow §8 are left out. */
+  subscribe(listener) {
+    if (!this.transport.subscribe) return () => {};
+    return this.transport.subscribe(event => {
+      try {
+        listener(checkEvent(event));
+      } catch (error) {
+        if (!(error instanceof ProtocolError)) throw error;
+      }
+    });
+  }
+}
+//# sourceMappingURL=client.js.map

package/dist/core/client.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["checkEvent","checkResponse","ProtocolError","toStructuredEncoding","now","track","GridError","cancelled","op","read","message","response","error","reason","path","code","details","result","nextId","GridClient","constructor","transport","request","members","signal","aborted","Promise","reject","id","started","bySignal","cancels","sent","send","v","then","finally","stop","_","abort","catch","addEventListener","once","removeEventListener","race","subscribe","listener","event"],"sources":["client.ts"],"sourcesContent":["import { checkEvent, checkResponse, type Operation, ProtocolError, toStructuredEncoding } from \"vastgrid-spec\";\nimport { now, track } from \"./trace.js\";\nimport { GridError, type RequestMessage } from \"./types.js\";\n\n/**\n * Carries messages (§8 of the specification) to an engine and gives back its answers: a function call, a Web\n * Worker, HTTP, a Server Function, an MCP tool call (§4.4 of react.md).\n */\nexport interface Transport {\n  /** Sends a request and gives its response; `cancel` has none. */\n  send(request: RequestMessage, options: { signal?: AbortSignal }): Promise<unknown>;\n  /** Follows the engine's events (§8.5), when the transport carries them. */\n  subscribe?(listener: (event: unknown) => void): () => void;\n  /**\n   * How a request in flight is cancelled (§8.6): by a `cancel` request (the default), or by the transport itself\n   * when the signal given to `send` aborts (an HTTP request is aborted).\n   */\n  cancels?: \"message\" | \"signal\";\n  /**\n   * Where the file of an `export` without a target can be downloaded, by the `target` of its answer (§8.2): the\n   * HTTP transport's `<url>/exports/<target>`. Absent when the transport has no such place.\n   */\n  exportUrl?(target: string): string;\n}\n\nfunction cancelled(op: Operation) {\n  return new GridError(\"cancelled\", \"The request was cancelled.\", { op });\n}\n\n/** Reads a response: its result, or the error it carries as a `GridError`. */\nfunction read<T>(message: unknown, op: Operation): T {\n  let response: Record<string, unknown>;\n  try {\n    response = checkResponse(message, op);\n  } catch (error) {\n    // A response that does not follow §8 is an internal error for the client (§8.1).\n    if (error instanceof ProtocolError) {\n      throw new GridError(\"internal\", `The engine's response does not follow the protocol: ${error.message}`, {\n        op,\n        reason: error.reason,\n        path: error.path,\n      });\n    }\n    throw error;\n  }\n  const error = response.error as\n    | { code: GridError[\"code\"]; message: string; reason?: string; path?: string; details?: Record<string, unknown> }\n    | undefined;\n  if (error) {\n    throw new GridError(error.code, error.message, {\n      op,\n      reason: error.reason,\n      path: error.path,\n      details: error.details,\n    });\n  }\n  return toStructuredEncoding(response).result as T;\n}\n\n// Clients can share a transport or reach the same engine through different transports. Their requests and\n// cancellations must use distinct ids, including after a store is disconnected and another is created.\nlet nextId = 1;\n\n/** Sends requests through a transport: gives them ids, checks the answers and cancels what is no longer needed. */\nexport class GridClient {\n  constructor(readonly transport: Transport) {}\n\n  request<T>(op: Operation, members: Record<string, unknown>, signal?: AbortSignal): Promise<T> {\n    if (signal?.aborted) return Promise.reject(cancelled(op));\n    const id = nextId++;\n    const started = now();\n    const bySignal = this.transport.cancels === \"signal\";\n    const sent = this.transport.send({ v: 2, id, op, ...members }, bySignal && signal ? { signal } : {});\n    if (!signal) return sent.then((response) => read<T>(response, op)).finally(() => track(op, started, \"requests\"));\n    let stop = () => {};\n    const aborted = new Promise<never>((_, reject) => {\n      const abort = () => {\n        if (!bySignal) {\n          this.transport.send({ v: 2, id: nextId++, op: \"cancel\", request: id }, {}).catch(() => {});\n        }\n        reject(cancelled(op));\n      };\n      signal.addEventListener(\"abort\", abort, { once: true });\n      stop = () => signal.removeEventListener(\"abort\", abort);\n    });\n    return Promise.race([sent.then((response) => read<T>(response, op)), aborted]).finally(() => {\n      stop();\n      track(op, started, \"requests\");\n    });\n  }\n\n  /** Follows the engine's events, checked (§8.5); events that do not follow §8 are left out. */\n  subscribe(listener: (event: Record<string, unknown>) => void): () => void {\n    if (!this.transport.subscribe) return () => {};\n    return this.transport.subscribe((event) => {\n      try {\n        listener(checkEvent(event));\n      } catch (error) {\n        if (!(error instanceof ProtocolError)) throw error;\n      }\n    });\n  }\n}\n"],"mappings":"AAAA,SAASA,UAAU,EAAEC,aAAa,EAAkBC,aAAa,EAAEC,oBAAoB,QAAQ,eAAe;AAC9G,SAASC,GAAG,EAAEC,KAAK,QAAQ,YAAY;AACvC,SAASC,SAAS,QAA6B,YAAY;;AAE3D;AACA;AACA;AACA;;AAkBA,SAASC,SAASA,CAACC,EAAa,EAAE;EAChC,OAAO,IAAIF,SAAS,CAAC,WAAW,EAAE,4BAA4B,EAAE;IAAEE;EAAG,CAAC,CAAC;AACzE;;AAEA;AACA,SAASC,IAAIA,CAAIC,OAAgB,EAAEF,EAAa,EAAK;EACnD,IAAIG,QAAiC;EACrC,IAAI;IACFA,QAAQ,GAAGV,aAAa,CAACS,OAAO,EAAEF,EAAE,CAAC;EACvC,CAAC,CAAC,OAAOI,KAAK,EAAE;IACd;IACA,IAAIA,KAAK,YAAYV,aAAa,EAAE;MAClC,MAAM,IAAII,SAAS,CAAC,UAAU,EAAE,uDAAuDM,KAAK,CAACF,OAAO,EAAE,EAAE;QACtGF,EAAE;QACFK,MAAM,EAAED,KAAK,CAACC,MAAM;QACpBC,IAAI,EAAEF,KAAK,CAACE;MACd,CAAC,CAAC;IACJ;IACA,MAAMF,KAAK;EACb;EACA,MAAMA,KAAK,GAAGD,QAAQ,CAACC,KAEV;EACb,IAAIA,KAAK,EAAE;IACT,MAAM,IAAIN,SAAS,CAACM,KAAK,CAACG,IAAI,EAAEH,KAAK,CAACF,OAAO,EAAE;MAC7CF,EAAE;MACFK,MAAM,EAAED,KAAK,CAACC,MAAM;MACpBC,IAAI,EAAEF,KAAK,CAACE,IAAI;MAChBE,OAAO,EAAEJ,KAAK,CAACI;IACjB,CAAC,CAAC;EACJ;EACA,OAAOb,oBAAoB,CAACQ,QAAQ,CAAC,CAACM,MAAM;AAC9C;;AAEA;AACA;AACA,IAAIC,MAAM,GAAG,CAAC;;AAEd;AACA,OAAO,MAAMC,UAAU,CAAC;EACtBC,WAAWA,CAAUC,SAAoB,EAAE;IAAA,KAAtBA,SAAoB,GAApBA,SAAoB;EAAG;EAE5CC,OAAOA,CAAId,EAAa,EAAEe,OAAgC,EAAEC,MAAoB,EAAc;IAC5F,IAAIA,MAAM,EAAEC,OAAO,EAAE,OAAOC,OAAO,CAACC,MAAM,CAACpB,SAAS,CAACC,EAAE,CAAC,CAAC;IACzD,MAAMoB,EAAE,GAAGV,MAAM,EAAE;IACnB,MAAMW,OAAO,GAAGzB,GAAG,CAAC,CAAC;IACrB,MAAM0B,QAAQ,GAAG,IAAI,CAACT,SAAS,CAACU,OAAO,KAAK,QAAQ;IACpD,MAAMC,IAAI,GAAG,IAAI,CAACX,SAAS,CAACY,IAAI,CAAC;MAAEC,CAAC,EAAE,CAAC;MAAEN,EAAE;MAAEpB,EAAE;MAAE,GAAGe;IAAQ,CAAC,EAAEO,QAAQ,IAAIN,MAAM,GAAG;MAAEA;IAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IACpG,IAAI,CAACA,MAAM,EAAE,OAAOQ,IAAI,CAACG,IAAI,CAAExB,QAAQ,IAAKF,IAAI,CAAIE,QAAQ,EAAEH,EAAE,CAAC,CAAC,CAAC4B,OAAO,CAAC,MAAM/B,KAAK,CAACG,EAAE,EAAEqB,OAAO,EAAE,UAAU,CAAC,CAAC;IAChH,IAAIQ,IAAI,GAAGA,CAAA,KAAM,CAAC,CAAC;IACnB,MAAMZ,OAAO,GAAG,IAAIC,OAAO,CAAQ,CAACY,CAAC,EAAEX,MAAM,KAAK;MAChD,MAAMY,KAAK,GAAGA,CAAA,KAAM;QAClB,IAAI,CAACT,QAAQ,EAAE;UACb,IAAI,CAACT,SAAS,CAACY,IAAI,CAAC;YAAEC,CAAC,EAAE,CAAC;YAAEN,EAAE,EAAEV,MAAM,EAAE;YAAEV,EAAE,EAAE,QAAQ;YAAEc,OAAO,EAAEM;UAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAACY,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5F;QACAb,MAAM,CAACpB,SAAS,CAACC,EAAE,CAAC,CAAC;MACvB,CAAC;MACDgB,MAAM,CAACiB,gBAAgB,CAAC,OAAO,EAAEF,KAAK,EAAE;QAAEG,IAAI,EAAE;MAAK,CAAC,CAAC;MACvDL,IAAI,GAAGA,CAAA,KAAMb,MAAM,CAACmB,mBAAmB,CAAC,OAAO,EAAEJ,KAAK,CAAC;IACzD,CAAC,CAAC;IACF,OAAOb,OAAO,CAACkB,IAAI,CAAC,CAACZ,IAAI,CAACG,IAAI,CAAExB,QAAQ,IAAKF,IAAI,CAAIE,QAAQ,EAAEH,EAAE,CAAC,CAAC,EAAEiB,OAAO,CAAC,CAAC,CAACW,OAAO,CAAC,MAAM;MAC3FC,IAAI,CAAC,CAAC;MACNhC,KAAK,CAACG,EAAE,EAAEqB,OAAO,EAAE,UAAU,CAAC;IAChC,CAAC,CAAC;EACJ;;EAEA;EACAgB,SAASA,CAACC,QAAkD,EAAc;IACxE,IAAI,CAAC,IAAI,CAACzB,SAAS,CAACwB,SAAS,EAAE,OAAO,MAAM,CAAC,CAAC;IAC9C,OAAO,IAAI,CAACxB,SAAS,CAACwB,SAAS,CAAEE,KAAK,IAAK;MACzC,IAAI;QACFD,QAAQ,CAAC9C,UAAU,CAAC+C,KAAK,CAAC,CAAC;MAC7B,CAAC,CAAC,OAAOnC,KAAK,EAAE;QACd,IAAI,EAAEA,KAAK,YAAYV,aAAa,CAAC,EAAE,MAAMU,KAAK;MACpD;IACF,CAAC,CAAC;EACJ;AACF","ignoreList":[]}

package/dist/core/conditions.d.ts

@@ -0,0 +1,48 @@
+/**
+ * The conditions of a plan's `where` (§6.2.1 of the specification) as a tree that the conditions menu edits: groups
+ * whose items all hold (`and`) or one of which holds (`or`), conditions on one column in the column menu's terms
+ * (`ColumnFilter`), and expressions that it does not take apart, kept as they are.
+ */
+import { type Column, type Expr } from "vastgrid-spec";
+import { type ColumnFilter } from "./filters.js";
+export type ConditionNode = {
+    kind: "group";
+    id: number;
+    op: "and" | "or";
+    items: ConditionNode[];
+} | {
+    kind: "condition";
+    id: number;
+    column: string;
+    filter: ColumnFilter & {
+        kind: "condition";
+    };
+} | {
+    kind: "expression";
+    id: number;
+    expr: Expr;
+};
+/** A new id for a node, for React's keys. */
+export declare function nodeId(): number;
+/**
+ * The conditions of `where` as a group of its parts that are not the search (`and`); a `where` that is one `or`
+ * is that group.
+ */
+export declare function readConditions(where: Expr | undefined): ConditionNode & {
+    kind: "group";
+};
+/** A condition that does not compile: the node, and which of its texts. */
+export declare class ConditionError extends Error {
+    readonly node: number;
+    readonly side: "first" | "second";
+    constructor(node: number, side: "first" | "second");
+}
+/**
+ * The `where` of `filter.set` for a tree (the search is kept by the command): an `and` group gives its items as
+ * parts; conditions without text keep every row and are left out. Text that is not a value of its column throws a
+ * `ConditionError`.
+ */
+export declare function writeConditions(group: ConditionNode & {
+    kind: "group";
+}, columns: readonly Column[]): Expr | null;
+//# sourceMappingURL=conditions.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"conditions.d.ts","sourceRoot":"","sources":["../../src/core/conditions.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,KAAK,MAAM,EAAa,KAAK,IAAI,EAAyC,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,KAAK,YAAY,EAA4C,MAAM,cAAc,CAAC;AAE3F,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,KAAK,GAAG,IAAI,CAAC;IAAC,KAAK,EAAE,aAAa,EAAE,CAAA;CAAE,GACvE;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,YAAY,GAAG;QAAE,IAAI,EAAE,WAAW,CAAA;KAAE,CAAA;CAAE,GAC/F;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAC;AAInD,6CAA6C;AAC7C,wBAAgB,MAAM,WAErB;AAiBD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,IAAI,GAAG,SAAS,GAAG,aAAa,GAAG;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,CAOzF;AAED,2EAA2E;AAC3E,qBAAa,cAAe,SAAQ,KAAK;IAErC,QAAQ,CAAC,IAAI,EAAE,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,QAAQ;IAFnC,YACW,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,OAAO,GAAG,QAAQ,EAGlC;CACF;AAwBD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,GAAG;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,GAAG,IAAI,CAGjH"}