@elaraai/east-ui 1.0.80 → 1.0.82

package/dist/src/runtime/collections/sheet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sheet.d.ts","sourceRoot":"","sources":["../../../../src/runtime/collections/sheet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACrG,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EACH,KAAK,IAAI,YAAY,EACrB,KAAK,eAAe,EACpB,KAAK,YAAY,EACjB,KAAK,eAAe,EACvB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAEpE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,kBAAkB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACjE,KAAK,EAAE;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAC5F,SAAS,CAAC;AACb,8FAA8F;AAC9F,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAClC,KAAK,EAAE;IAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,CAAC,CAAC,GACnF,SAAS,CAAC;AACb;+DAC+D;AAC/D,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAClC,KAAK,EAAE;IAAE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,CAAC,CAAC,GACjI,SAAS,CAAC;AAYb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AACH,eAAO,MAAM,KAAK,EAAE,OAAO,QAAQ,GAAG;IAClC,MAAM,EAAE,OAAO,YAAY,CAAC,MAAM,CAAC;IACnC,QAAQ,EAAE,OAAO,YAAY,CAAC,QAAQ,CAAC;IACvC,MAAM,EAAE,OAAO,YAAY,CAAC,MAAM,CAAC;IACnC,IAAI,EAAE,OAAO,YAAY,CAAC,IAAI,CAAC;IAC/B,KAAK,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC;IACjC,KAAK,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC;CAQnC,CAAC"}
+{"version":3,"file":"sheet.d.ts","sourceRoot":"","sources":["../../../../src/runtime/collections/sheet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACrG,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAEH,KAAK,eAAe,EACpB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,mBAAmB,EACxB,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,eAAe,EACpB,KAAK,WAAW,EAChB,KAAK,cAAc,EACtB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAEpE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAAE,CAAC,SAAS,eAAe,CAAC,CAAC,CAAC,EAChE,KAAK,EAAE;IACH,IAAI,EAAE,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5M,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAC/C,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC9B,SAAS,CAAC;AACb;;;;GAIG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,kBAAkB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,SAAS,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAC5G,KAAK,EAAE;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACtH,SAAS,CAAC;AACb,6DAA6D;AAC7D,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAAE,CAAC,SAAS,eAAe,CAAC,CAAC,CAAC,EAChE,KAAK,EAAE;IAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7G,SAAS,CAAC;AACb,kDAAkD;AAClD,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAAE,CAAC,SAAS,eAAe,CAAC,CAAC,CAAC,EAChE,KAAK,EAAE;IAAE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC3J,SAAS,CAAC;AACb;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,kBAAkB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACjE,KAAK,EAAE;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAC5F,SAAS,CAAC;AACb,8FAA8F;AAC9F,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAClC,KAAK,EAAE;IAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,CAAC,CAAC,GACnF,SAAS,CAAC;AACb;+DAC+D;AAC/D,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAClC,KAAK,EAAE;IAAE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,CAAC,CAAC,GACjI,SAAS,CAAC;AAiBb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AACH,eAAO,MAAM,KAAK,EAAE,OAAO,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,MAAM,CAAsC,CAAC"}

package/dist/src/runtime/collections/sheet.js

@@ -8,6 +8,10 @@ function SheetTag(props) {
     const { data, columns, ...options } = props;
     return SheetFactory.Root(data, columns, hasKeys(options) ? options : undefined);
 }
+// The tag IS the root, so `Root` is the one factory member it does not carry.
+// Derived, never hand-listed: a member added to `SheetNamespace` rides the tag
+// with no edit here (#862, as #814 did for the Plan).
+const { Root: _root, ...authoring } = SheetFactory;
 /**
  * The planning spreadsheet — rows are the host's records, columns are TYPED
  * (`Sheet.column.date` / `quantity` / `lookup` / `reference` / `enum` /
@@ -22,24 +26,30 @@ function SheetTag(props) {
  * @example
  * ```tsx
  * // .tsx file with the `@jsxImportSource @elaraai/east-ui` pragma
- * import { East, ArrayType, DateTimeType, FloatType, OptionType, StringType, StructType, none } from "@elaraai/east";
+ * import { ArrayType, DateTimeType, East, FloatType, OptionType, StringType, StructType, none } from "@elaraai/east";
  * import { Reactive, Sheet, State, UIComponentType } from "@elaraai/east-ui";
  *
- * const JobType = StructType({ id: StringType, start: OptionType(DateTimeType), task: StringType, qty: OptionType(FloatType) });
- *
- * const jobs = East.function([], UIComponentType, (_$) => (
+ * const sheet = East.function([], UIComponentType, (_$) => (
  *     <Reactive>{$ => {
- *         const rows = $.let(State.bind([ArrayType(JobType)], "jobs", [{ id: "j1", start: none, task: "Machining", qty: none }]));
+ *         const JobType = StructType({
+ *             id:    StringType,
+ *             start: OptionType(DateTimeType),   // none = blank cell
+ *             task:  StringType,                 // "" = blank cell
+ *             qty:   OptionType(FloatType),
+ *         });
+ *         const jobs = $.let(State.bind([ArrayType(JobType)], "sheet_basic_jobs", [
+ *             { id: "j1", start: none, task: "Machining", qty: none },
+ *         ]));
  *         return (
  *             <Sheet
- *                 data={rows.read()}
+ *                 data={jobs}
  *                 id="id"
  *                 columns={{
- *                     start: Sheet.column.date(JobType, { header: "Start", sub: "d/m · fri · +3d" }),
+ *                     start: Sheet.column.date(JobType, { header: "Start", sub: "dd / mm / yyyy" }),
  *                     task:  Sheet.column.text(JobType, { header: "Task" }),
- *                     qty:   Sheet.column.quantity(JobType, { header: "Qty" }),
+ *                     qty:   Sheet.column.quantity(JobType, { header: "Qty" }),   // no driver on this sheet — the two-argument form
  *                 }}
- *                 onUpdate={rows.write}
+ *                 onUpdate={jobs.write}
  *             />
  *         );
  *     }}</Reactive>
@@ -47,19 +57,17 @@ function SheetTag(props) {
  * ```
  *
  * @remarks
- * Carries the whole authoring namespace — `Sheet.column.*` (the builders),
- * `Sheet.register.members` / `.concat`, `Sheet.driver`, `Sheet.link.arity` /
- * `.check` / `.parse` / `.print`, `Sheet.patch`, and `Sheet.Types.*` (the
- * closed wire types plus the typed constructors `Context(R, D)` / `Fill(T)` /
- * `Patch(R)` / `Proposal(R)` / `Edit(R)` / `CheckContext(R)`). Desugars to
+ * Carries the factory namespace except `Root` (the tag is the root):
+ * `Sheet.column.*` (the builders), `Sheet.register.members` / `.concat`,
+ * `Sheet.driver`, `Sheet.link.arity` / `.check` / `.parse` / `.print`,
+ * `Sheet.patch`, `Sheet.apply` (a checked batch applied to a collection),
+ * `Sheet.group` / `Sheet.group.cell.*` (grouped rows, #740 — with loose rows
+ * between the groups over `Sheet.Types.Entry` entries, #846), `Sheet.subRows`
+ * / `Sheet.subRow` (sub rows, #844), and `Sheet.Types.*` (the closed wire
+ * types plus the typed constructors, among them `DraftContext(R, D)` /
+ * `Fill(T)` / `Patch(R)` / `Proposal(R)` / `CheckContext(R)` / `Draft(R)` /
+ * `PatchEvent(E)` / `ChangeSet(E)` / `Entry(G, "rows")`). Desugars to
  * `Sheet.Root(data, columns, options)`.
  */
-export const Sheet = Object.assign(SheetTag, {
-    column: SheetFactory.column,
-    register: SheetFactory.register,
-    driver: SheetFactory.driver,
-    link: SheetFactory.link,
-    patch: SheetFactory.patch,
-    Types: SheetFactory.Types,
-});
+export const Sheet = Object.assign(SheetTag, authoring);
 //# sourceMappingURL=sheet.js.map

package/dist/src/runtime/collections/sheet.js.map

@@ -1 +1 @@
-{"version":3,"file":"sheet.js","sourceRoot":"","sources":["../../../../src/runtime/collections/sheet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EACH,KAAK,IAAI,YAAY,GAIxB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAqB5C,SAAS,QAAQ,CACb,KAA0C;IAE1C,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,KAAsE,CAAC;IAC7G,OAAQ,YAAY,CAAC,IAA2D,CAC5E,IAAI,EACJ,OAAO,EACP,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CACzC,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AACH,MAAM,CAAC,MAAM,KAAK,GAOd,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;IACxB,MAAM,EAAE,YAAY,CAAC,MAAM;IAC3B,QAAQ,EAAE,YAAY,CAAC,QAAQ;IAC/B,MAAM,EAAE,YAAY,CAAC,MAAM;IAC3B,IAAI,EAAE,YAAY,CAAC,IAAI;IACvB,KAAK,EAAE,YAAY,CAAC,KAAK;IACzB,KAAK,EAAE,YAAY,CAAC,KAAK;CAC5B,CAAC,CAAC"}
+{"version":3,"file":"sheet.js","sourceRoot":"","sources":["../../../../src/runtime/collections/sheet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EACH,KAAK,IAAI,YAAY,GAUxB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAiD5C,SAAS,QAAQ,CACb,KAA0C;IAE1C,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,KAAsE,CAAC;IAC7G,OAAQ,YAAY,CAAC,IAA2D,CAC5E,IAAI,EACJ,OAAO,EACP,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CACzC,CAAC;AACN,CAAC;AAED,8EAA8E;AAC9E,+EAA+E;AAC/E,sDAAsD;AACtD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,SAAS,EAAE,GAAG,YAAY,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AACH,MAAM,CAAC,MAAM,KAAK,GAAmD,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC"}

package/dist/src/runtime/collections/table.d.ts

@@ -5,35 +5,42 @@
 /**
  * `<Table>` tag — see the export's JSDoc.
  */
-import type { SubtypeExprOrValue, ArrayType, ExprType, StructType } from "@elaraai/east";
+import type { ArrayType, ExprType, RecursiveType, StructType } from "@elaraai/east";
 import type { PagedSource } from "../../contracts/source.js";
-import { Table as TableFactory, type ColumnSpec, type DataFieldKeys, type DataRowType, type TableOptions } from "../../collections/table/index.js";
+import { Table as TableFactory, type ColumnSpec, type DataFieldKeys, type DataRowType, type TableData, type TableOptions, type TableRowNode } from "../../collections/table/index.js";
 import type { UIElement } from "../runtime.js";
+/** A paged source's row as its accessors receive it — the struct, or a recursive row's node (#954). */
+type PagedRowType<R> = TableRowNode<R> extends StructType ? TableRowNode<R> : StructType;
 /**
  * `<Table data={rows} columns={["name", "age"]} striped />` — schema-typed
  * table. Maps to `Table.Root`. `columns` is typed directly as `ColumnSpec<T>`
  * (not an inferred generic) so an object-form column map gets excess-property
- * checked — a key that is not a data field is a type error.
+ * checked — a key that is not a data field is a type error. Recursive rows
+ * nest with `tree` (#954), their accessors reading each row's node.
  */
-declare function TableTag<T extends SubtypeExprOrValue<ArrayType<StructType>>>(props: {
+declare function TableTag<T extends TableData>(props: {
     data: T;
     columns: ColumnSpec<T>;
 } & TableOptions<DataFieldKeys<T>, DataRowType<T>>): UIElement;
 /** The PAGED arm (#576) — `data` is a windowed source of the same rows; the
  *  row type rides structurally in its `page` signature, so `columns` is checked
- *  against it exactly as for an inline array. */
-declare function TableTag<R extends StructType>(props: {
+ *  against it exactly as for an inline array. A source of recursive rows pages
+ *  its top-level rows, each with its subtree (#954). */
+declare function TableTag<R extends StructType | RecursiveType<StructType>>(props: {
     data: PagedSource<ArrayType<R>>;
     columns: ColumnSpec<ExprType<ArrayType<R>>>;
-} & TableOptions<Extract<keyof R["fields"], string>, R>): UIElement;
+} & TableOptions<Extract<keyof PagedRowType<R>["fields"], string>, PagedRowType<R>>): UIElement;
 /**
  * Schema-typed data table — renders an array of struct rows as columns. The
  * row type drives everything: `columns` is a key list or a per-key config map
  * ({@link ColumnSpec}, with `header` / `width` / `value` sort-key / `render`
- * cell renderer), and the remaining display props (striped, density, frozen
- * columns, row status, selection, pagination, expandable rows, footer rows,
- * column groups, interaction callbacks) are flat ({@link TableOptions}). Reach
- * for it whenever tabular records need sorting, selection, or rich cells.
+ * cell renderer / `aggregate` subtotal), and the remaining display props
+ * (striped, density, frozen columns, row status, selection, pagination,
+ * expandable rows, footer rows, column groups, interaction callbacks) are flat
+ * ({@link TableOptions}). Rows nest to any depth with `tree={{ children }}`
+ * (#954): a parent draws its own cells and, in an `aggregate` column, its
+ * children's subtotal. Reach for it whenever tabular records need sorting,
+ * selection, or rich cells.
  *
  * @example
  * ```tsx

package/dist/src/runtime/collections/table.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"table.d.ts","sourceRoot":"","sources":["../../../../src/runtime/collections/table.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACzF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EACH,KAAK,IAAI,YAAY,EACrB,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,YAAY,EACpB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,kBAAkB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACjE,KAAK,EAAE;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,GAC5F,SAAS,CAAC;AACb;;iDAEiD;AACjD,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,EAClC,KAAK,EAAE;IAAE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;CAAE,GACjF,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,GAC1D,SAAS,CAAC;AAYb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,eAAO,MAAM,KAAK,EAAE,OAAO,QAAQ,GAAG;IAAE,KAAK,EAAE,OAAO,YAAY,CAAC,KAAK,CAAA;CACd,CAAC"}
+{"version":3,"file":"table.d.ts","sourceRoot":"","sources":["../../../../src/runtime/collections/table.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACpF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EACH,KAAK,IAAI,YAAY,EACrB,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,SAAS,EACd,KAAK,YAAY,EACjB,KAAK,YAAY,EACpB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE/C,uGAAuG;AACvG,KAAK,YAAY,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;AAEzF;;;;;;GAMG;AACH,iBAAS,QAAQ,CAAC,CAAC,SAAS,SAAS,EACjC,KAAK,EAAE;IAAE,IAAI,EAAE,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CAAE,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,GAC5F,SAAS,CAAC;AACb;;;wDAGwD;AACxD,iBAAS,QAAQ,CAAC,CAAC,SAAS,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,EAC9D,KAAK,EAAE;IAAE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;CAAE,GACjF,YAAY,CAAC,OAAO,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,GACtF,SAAS,CAAC;AAYb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AACH,eAAO,MAAM,KAAK,EAAE,OAAO,QAAQ,GAAG;IAAE,KAAK,EAAE,OAAO,YAAY,CAAC,KAAK,CAAA;CACd,CAAC"}

package/dist/src/runtime/collections/table.js

@@ -12,10 +12,13 @@ function TableTag(props) {
  * Schema-typed data table — renders an array of struct rows as columns. The
  * row type drives everything: `columns` is a key list or a per-key config map
  * ({@link ColumnSpec}, with `header` / `width` / `value` sort-key / `render`
- * cell renderer), and the remaining display props (striped, density, frozen
- * columns, row status, selection, pagination, expandable rows, footer rows,
- * column groups, interaction callbacks) are flat ({@link TableOptions}). Reach
- * for it whenever tabular records need sorting, selection, or rich cells.
+ * cell renderer / `aggregate` subtotal), and the remaining display props
+ * (striped, density, frozen columns, row status, selection, pagination,
+ * expandable rows, footer rows, column groups, interaction callbacks) are flat
+ * ({@link TableOptions}). Rows nest to any depth with `tree={{ children }}`
+ * (#954): a parent draws its own cells and, in an `aggregate` column, its
+ * children's subtotal. Reach for it whenever tabular records need sorting,
+ * selection, or rich cells.
  *
  * @example
  * ```tsx

package/dist/src/runtime/collections/table.js.map

@@ -1 +1 @@
-{"version":3,"file":"table.js","sourceRoot":"","sources":["../../../../src/runtime/collections/table.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EACH,KAAK,IAAI,YAAY,GAKxB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAmB5C,SAAS,QAAQ,CACb,KAA0C;IAE1C,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,KAAsE,CAAC;IAC7G,OAAQ,YAAY,CAAC,IAA2D,CAC5E,IAAI,EACJ,OAAO,EACP,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CACzC,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,MAAM,CAAC,MAAM,KAAK,GACd,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC"}
+{"version":3,"file":"table.js","sourceRoot":"","sources":["../../../../src/runtime/collections/table.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EACH,KAAK,IAAI,YAAY,GAOxB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAwB5C,SAAS,QAAQ,CACb,KAA0C;IAE1C,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,KAAsE,CAAC;IAC7G,OAAQ,YAAY,CAAC,IAA2D,CAC5E,IAAI,EACJ,OAAO,EACP,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CACzC,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AACH,MAAM,CAAC,MAAM,KAAK,GACd,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC"}

package/dist/src/shared/reify.d.ts

@@ -21,7 +21,7 @@
  *
  * @packageDocumentation
  */
-import { ArrayType, type BlockBuilder, type DictType, type EastType, type ExprType, type FunctionType, StringType, type StructType, type SubtypeExprOrValue, type TypeOf } from "@elaraai/east";
+import { type ArrayType, type BlockBuilder, type EastType, type ExprType, type FunctionType, type StructType, type SubtypeExprOrValue, type TypeOf } from "@elaraai/east";
 /**
  * Reifies an accessor lambda into an East function, inferring the output
  * type from the lambda's expanded result (single expansion via
@@ -61,8 +61,9 @@ export declare function reifyAccessor<const I extends EastType[], R>(inputs: [..
 export declare function mapRows<T extends EastType>(rows: ExprType<ArrayType<StructType>>, outType: T, body: (row: ExprType<StructType>) => SubtypeExprOrValue<T>): ExprType<ArrayType<T>>;
 /**
  * `mapRows` for row mappers whose body needs a block builder — per-row
- * normalizations that declare `$.let` bindings or emit statements (Matrix,
- * Library row construction).
+ * normalizations that declare `$.let` bindings or emit statements (Library
+ * row construction; the Table and the Matrix build theirs in the tree walk,
+ * `shared/tree.ts`).
  *
  * @typeParam T - The fixed East element type the mapper produces
  * @param rows - The caller's rows array expression
@@ -73,47 +74,4 @@ export declare function mapRows<T extends EastType>(rows: ExprType<ArrayType<Str
  * @internal
  */
 export declare function mapRowsBlock<T extends EastType>(rows: ExprType<ArrayType<StructType>>, outType: T, body: ($: BlockBuilder<T>, row: ExprType<StructType>) => SubtypeExprOrValue<T>): ExprType<ArrayType<T>>;
-/**
- * `mapRowsBlock` for per-row constructors that produce a **subtree** — an
- * array of output elements per row — rather than exactly one element: the
- * reified body's results are concat-flattened eagerly in a single pass, so
- * no intermediate array-of-arrays is materialized (Plan row construction,
- * where one data row expands to a parent plus its re-parented children).
- *
- * @typeParam T - The fixed East element type of the flattened result
- * @param rows - The caller's rows array expression
- * @param outType - The fixed East output ELEMENT type (the helper flattens `ArrayType(outType)` subtrees)
- * @param body - Per-row subtree constructor; expanded exactly once against a typed placeholder row
- * @returns The eagerly-flattened array expression
- *
- * @internal
- */
-export declare function flatMapRowsBlock<T extends EastType>(rows: ExprType<ArrayType<StructType>>, outType: T, body: ($: BlockBuilder<ArrayType<NoInfer<T>>>, row: ExprType<StructType>) => SubtypeExprOrValue<ArrayType<NoInfer<T>>>): ExprType<ArrayType<T>>;
-/**
- * `flatMapRowsBlock` for per-ENTRY constructors that produce a KEYED subtree —
- * a `Dict` of output elements per source entry — folded into one dictionary
- * (Plan row construction, where the source is a keyed collection and the
- * canvas rows inherit its keys, so duplicates are unconstructable).
- *
- * @remarks
- * The body receives the entry's `(value, key)`, because a keyed dataset does
- * not repeat its key inside the value — the key is where a row's identity
- * comes from, not a field to re-derive.
- *
- * The accumulator is folded with `unionInPlace`, never with the pure `union`:
- * `union` copies the whole B-tree per step, so a 200-entry window would rebuild
- * the dictionary 200 times. `reduce` threads ONE accumulator and each entry's
- * subtree is merged into it — the same shape `groupToArrays` uses for arrays.
- *
- * @typeParam K - The output dictionary's key type
- * @typeParam V - The output dictionary's value type
- * @param entries - The caller's keyed source expression
- * @param dictType - The fixed East output dictionary type
- * @param merge - Conflict policy when two entries produce the same key, as `(existing, incoming, key) => kept`
- * @param body - Per-entry subtree constructor; expanded exactly once against typed placeholders
- * @returns The folded dictionary expression
- *
- * @internal
- */
-export declare function foldEntriesToDict<K extends EastType, V extends EastType>(entries: ExprType<DictType<StringType, StructType>>, dictType: DictType<K, V>, merge: SubtypeExprOrValue<FunctionType<[NoInfer<V>, NoInfer<V>, NoInfer<K>], NoInfer<V>>>, body: ($: BlockBuilder<DictType<NoInfer<K>, NoInfer<V>>>, value: ExprType<StructType>, key: ExprType<StringType>) => SubtypeExprOrValue<DictType<NoInfer<K>, NoInfer<V>>>): ExprType<DictType<K, V>>;
 //# sourceMappingURL=reify.d.ts.map

package/dist/src/shared/reify.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reify.d.ts","sourceRoot":"","sources":["../../../src/shared/reify.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EACH,SAAS,EACT,KAAK,YAAY,EACjB,KAAK,QAAQ,EAEb,KAAK,QAAQ,EAEb,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,UAAU,EACV,KAAK,UAAU,EACf,KAAK,kBAAkB,EACvB,KAAK,MAAM,EACd,MAAM,eAAe,CAAC;AAEvB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,EAAE,CAAC,EACvD,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EACd,QAAQ,EAAE,CAAC,GAAG,IAAI,EAAE;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,KAAK,CAAC,GAC7D,QAAQ,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAOtC;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,QAAQ,EACtC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACrC,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,GAC3D,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAIxB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAC3C,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACrC,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,GAC/E,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAIxB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,QAAQ,EAC/C,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACrC,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GACvH,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAOxB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACpE,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,EACnD,QAAQ,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAIxB,KAAK,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EACzF,IAAI,EAAE,CACF,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EACjD,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,EAC3B,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KACxB,kBAAkB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAC1D,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAW1B"}
+{"version":3,"file":"reify.d.ts","sourceRoot":"","sources":["../../../src/shared/reify.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EACH,KAAK,SAAS,EACd,KAAK,YAAY,EAEjB,KAAK,QAAQ,EAEb,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,KAAK,UAAU,EACf,KAAK,kBAAkB,EACvB,KAAK,MAAM,EACd,MAAM,eAAe,CAAC;AAEvB;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,aAAa,CAAC,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,EAAE,CAAC,EACvD,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EACd,QAAQ,EAAE,CAAC,GAAG,IAAI,EAAE;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,KAAK,CAAC,GAC7D,QAAQ,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAOtC;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,QAAQ,EACtC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACrC,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,GAC3D,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAIxB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAC3C,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACrC,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,GAC/E,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAIxB"}

package/dist/src/shared/reify.js

@@ -21,7 +21,7 @@
  *
  * @packageDocumentation
  */
-import { ArrayType, East, Expr, StringType, } from "@elaraai/east";
+import { East, Expr, } from "@elaraai/east";
 /**
  * Reifies an accessor lambda into an East function, inferring the output
  * type from the lambda's expanded result (single expansion via
@@ -66,8 +66,9 @@ export function mapRows(rows, outType, body) {
 }
 /**
  * `mapRows` for row mappers whose body needs a block builder — per-row
- * normalizations that declare `$.let` bindings or emit statements (Matrix,
- * Library row construction).
+ * normalizations that declare `$.let` bindings or emit statements (Library
+ * row construction; the Table and the Matrix build theirs in the tree walk,
+ * `shared/tree.ts`).
  *
  * @typeParam T - The fixed East element type the mapper produces
  * @param rows - The caller's rows array expression
@@ -82,62 +83,4 @@ export function mapRowsBlock(rows, outType, body) {
     const fn = East.function([rowType], outType, ($, row) => body($, row));
     return rows.map((_$, row) => fn(row));
 }
-/**
- * `mapRowsBlock` for per-row constructors that produce a **subtree** — an
- * array of output elements per row — rather than exactly one element: the
- * reified body's results are concat-flattened eagerly in a single pass, so
- * no intermediate array-of-arrays is materialized (Plan row construction,
- * where one data row expands to a parent plus its re-parented children).
- *
- * @typeParam T - The fixed East element type of the flattened result
- * @param rows - The caller's rows array expression
- * @param outType - The fixed East output ELEMENT type (the helper flattens `ArrayType(outType)` subtrees)
- * @param body - Per-row subtree constructor; expanded exactly once against a typed placeholder row
- * @returns The eagerly-flattened array expression
- *
- * @internal
- */
-export function flatMapRowsBlock(rows, outType, body) {
-    const rowType = Expr.type(rows).value;
-    const fn = East.function([rowType], ArrayType(outType), ($, row) => body($, row));
-    return rows.reduce((_$, acc, row) => acc.concat(fn(row)), East.value([], ArrayType(outType)));
-}
-/**
- * `flatMapRowsBlock` for per-ENTRY constructors that produce a KEYED subtree —
- * a `Dict` of output elements per source entry — folded into one dictionary
- * (Plan row construction, where the source is a keyed collection and the
- * canvas rows inherit its keys, so duplicates are unconstructable).
- *
- * @remarks
- * The body receives the entry's `(value, key)`, because a keyed dataset does
- * not repeat its key inside the value — the key is where a row's identity
- * comes from, not a field to re-derive.
- *
- * The accumulator is folded with `unionInPlace`, never with the pure `union`:
- * `union` copies the whole B-tree per step, so a 200-entry window would rebuild
- * the dictionary 200 times. `reduce` threads ONE accumulator and each entry's
- * subtree is merged into it — the same shape `groupToArrays` uses for arrays.
- *
- * @typeParam K - The output dictionary's key type
- * @typeParam V - The output dictionary's value type
- * @param entries - The caller's keyed source expression
- * @param dictType - The fixed East output dictionary type
- * @param merge - Conflict policy when two entries produce the same key, as `(existing, incoming, key) => kept`
- * @param body - Per-entry subtree constructor; expanded exactly once against typed placeholders
- * @returns The folded dictionary expression
- *
- * @internal
- */
-export function foldEntriesToDict(entries, dictType, 
-// `dictType` is the ONLY inference site: the loose `SubtypeExprOrValue`
-// faces below would otherwise widen `V` to the subtype form and the result
-// would stop being assignable to the exact collection type.
-merge, body) {
-    const valueType = Expr.type(entries).value;
-    const fn = East.function([valueType, StringType], dictType, ($, value, key) => body($, value, key));
-    return entries.reduce(($, acc, value, key) => {
-        $(acc.unionInPlace(fn(value, key), merge));
-        return acc;
-    }, East.value(new Map(), dictType));
-}
 //# sourceMappingURL=reify.js.map

package/dist/src/shared/reify.js.map

@@ -1 +1 @@
-{"version":3,"file":"reify.js","sourceRoot":"","sources":["../../../src/shared/reify.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EACH,SAAS,EAGT,IAAI,EAEJ,IAAI,EAGJ,UAAU,GAIb,MAAM,eAAe,CAAC;AAEvB;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CACzB,MAAc,EACd,QAA4D;IAE5D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CACpB,MAAM,EACN,SAAS,EACT,CAAC,EAAW,EAAE,GAAG,IAAwC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,CAClF,CAAC;IACF,OAAO,EAAqD,CAAC;AACjE,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,OAAO,CACnB,IAAqC,EACrC,OAAU,EACV,IAA0D;IAE1D,MAAM,OAAO,GAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAA2B,CAAC,KAAK,CAAC;IACjE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAsC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CACxB,IAAqC,EACrC,OAAU,EACV,IAA8E;IAE9E,MAAM,OAAO,GAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAA2B,CAAC,KAAK,CAAC;IACjE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAoB,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAsC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,gBAAgB,CAC5B,IAAqC,EACrC,OAAU,EACV,IAAsH;IAEtH,MAAM,OAAO,GAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAA2B,CAAC,KAAK,CAAC;IACjE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAA+B,EAAE,GAAG,CAAC,CAAC,CAAC;IAChH,OAAO,IAAI,CAAC,MAAM,CACd,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EACrC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CACA,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,iBAAiB,CAC7B,OAAmD,EACnD,QAAwB;AACxB,wEAAwE;AACxE,2EAA2E;AAC3E,4DAA4D;AAC5D,KAAyF,EACzF,IAIyD;IAEzD,MAAM,SAAS,GAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC,CAAC,KAAK,CAAC;IACjF,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,QAAQ,EACtD,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAiC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5E,OAAO,OAAO,CAAC,MAAM,CACjB,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;QACnB,CAAC,CAAE,GAAgC,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QACzE,OAAO,GAAG,CAAC;IACf,CAAC,EACD,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CACK,CAAC;AAC7C,CAAC"}
+{"version":3,"file":"reify.js","sourceRoot":"","sources":["../../../src/shared/reify.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAGH,IAAI,EAEJ,IAAI,GAMP,MAAM,eAAe,CAAC;AAEvB;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,aAAa,CACzB,MAAc,EACd,QAA4D;IAE5D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CACpB,MAAM,EACN,SAAS,EACT,CAAC,EAAW,EAAE,GAAG,IAAwC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,CAClF,CAAC;IACF,OAAO,EAAqD,CAAC;AACjE,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,OAAO,CACnB,IAAqC,EACrC,OAAU,EACV,IAA0D;IAE1D,MAAM,OAAO,GAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAA2B,CAAC,KAAK,CAAC;IACjE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAsC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,YAAY,CACxB,IAAqC,EACrC,OAAU,EACV,IAA8E;IAE9E,MAAM,OAAO,GAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAA2B,CAAC,KAAK,CAAC;IACjE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAoB,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAsC,CAAC;AAC/E,CAAC"}

package/dist/src/shared/tree.d.ts

@@ -0,0 +1,88 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Nested rows (#954, #955) — a collection's own tree, walked in pre-order.
+ *
+ * A Table's and a Matrix's rows nest the way the Plan's do (#822): a row
+ * carries its children, to any depth, through `tree={{ children, collapsed }}`.
+ * The walk is ONE reified East function over the data — an explicit stack,
+ * since depth is data (the Plan's walk, `collections/plan/series.ts`) — that
+ * turns the author's elements into the component's own rows, each parent
+ * followed by its subtree, each with its depth.
+ *
+ * Not exported from the package barrel — factory-internal; the components
+ * re-export the input types under their own names.
+ *
+ * @packageDocumentation
+ */
+import { type BlockBuilder, type EastType, type ExpandOnce, type ExprType, type FunctionType, type RecursiveType, type SubtypeExprOrValue, ArrayType, BooleanType, Expr, IntegerType, StructType } from "@elaraai/east";
+/**
+ * A data element as a tree's accessors receive it — a recursive element as
+ * its NODE, so an accessor reads its fields directly at every depth
+ * (`(r) => r.lines`), as the Plan's series do.
+ *
+ * @typeParam S - The data's element type
+ */
+export type TreeNode<S> = S extends RecursiveType<infer U> ? ExpandOnce<U, S> : S;
+/**
+ * How a collection's rows nest — the data's own tree, to any depth.
+ *
+ * @remarks
+ * `children` returns a row's child rows: more of the SAME row type (an `Array`
+ * of the data's element type), so every row fills the same columns — a
+ * `RecursiveType` row's own field (`r => r.lines`), or a lookup over flat data
+ * (`r => all.filter((_$, c) => c.parent.equal(r.id))`), the data holding only
+ * the top-level rows. `collapsed` says which parents start closed.
+ *
+ * @typeParam RowType - The row an accessor receives — a struct, or a recursive row's node
+ */
+export interface TreeInput<RowType extends StructType = StructType> {
+    /** A row's child rows — an `Array` of the data's element type (a recursive row's own field, say). */
+    children: (row: ExprType<RowType>) => Expr;
+    /** Whether a parent starts collapsed — `true` for every parent, or per row. Default open. */
+    collapsed?: boolean | ((row: ExprType<RowType>) => SubtypeExprOrValue<BooleanType>);
+}
+/** A collection's element type, resolved for its accessors. */
+export interface TreeElement {
+    /** The data's element type — a struct, or a recursive type whose node is one. */
+    elementType: EastType;
+    /** The struct every accessor receives — the element, or its node. */
+    rowType: StructType;
+    /** An element as the accessors receive it — its node, when recursive. */
+    nodeOf: (element: ExprType<EastType>) => ExprType<StructType>;
+}
+/**
+ * Resolves a collection's element type for its accessors: a struct as it is,
+ * a recursive element through its node.
+ *
+ * @param component - The component, for the message (`"Table"`)
+ * @param elementType - The data's element type
+ * @returns The element, its row struct and the node accessor
+ * @throws {Error} When the element is neither a struct nor a recursive type whose node is one
+ */
+export declare function treeElement(component: string, elementType: EastType): TreeElement;
+/**
+ * The collection's rows IN PRE-ORDER, as one East function over the data: a
+ * parent, then its subtree, each row built by `rowOf` with its depth and
+ * whether it starts collapsed (only a row with children ever does). Without a
+ * `tree`, every element is a row at depth 0, in data order.
+ *
+ * @remarks
+ * The tree's depth is data, so the walk is an explicit stack: a level's rows
+ * go on REVERSED, so the stack pops the first of them first. Every function
+ * the walk calls is reified once and bound once — a captured function
+ * referenced in a loop would be re-inlined per use.
+ *
+ * @typeParam Row - The component's row type
+ * @param component - The component, for the build-time messages (`"Table"`)
+ * @param element - The collection's element ({@link treeElement})
+ * @param rowType - The component's row type
+ * @param rowOf - One element's row, given its depth and whether it starts collapsed
+ * @param tree - How the rows nest; absent, the collection is flat
+ * @returns A function from the collection to its rows
+ * @throws {Error} When `tree.children` returns anything but more of the collection's rows
+ */
+export declare function preOrderRows<Row extends EastType>(component: string, element: TreeElement, rowType: Row, rowOf: ($: BlockBuilder<Row>, element: ExprType<EastType>, depth: ExprType<IntegerType>, collapsed: ExprType<BooleanType>) => SubtypeExprOrValue<Row>, tree: TreeInput | undefined): ExprType<FunctionType<[ArrayType<EastType>], ArrayType<Row>>>;
+//# sourceMappingURL=tree.d.ts.map

package/dist/src/shared/tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../../../src/shared/tree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EACH,KAAK,YAAY,EACjB,KAAK,QAAQ,EACb,KAAK,UAAU,EACf,KAAK,QAAQ,EACb,KAAK,YAAY,EAEjB,KAAK,aAAa,EAClB,KAAK,kBAAkB,EACvB,SAAS,EACT,WAAW,EAGX,IAAI,EACJ,WAAW,EACX,UAAU,EAIb,MAAM,eAAe,CAAC;AAGvB;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAElF;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS,CAAC,OAAO,SAAS,UAAU,GAAG,UAAU;IAC9D,qGAAqG;IACrG,QAAQ,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;IAC3C,6FAA6F;IAC7F,SAAS,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,GAAG,EAAE,QAAQ,CAAC,OAAO,CAAC,KAAK,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC;CACvF;AAED,+DAA+D;AAC/D,MAAM,WAAW,WAAW;IACxB,iFAAiF;IACjF,WAAW,EAAE,QAAQ,CAAC;IACtB,qEAAqE;IACrE,OAAO,EAAE,UAAU,CAAC;IACpB,yEAAyE;IACzE,MAAM,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,KAAK,QAAQ,CAAC,UAAU,CAAC,CAAC;CACjE;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,GAAG,WAAW,CAajF;AAiCD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,YAAY,CAAC,GAAG,SAAS,QAAQ,EAC7C,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,WAAW,EACpB,OAAO,EAAE,GAAG,EACZ,KAAK,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,WAAW,CAAC,KAAK,kBAAkB,CAAC,GAAG,CAAC,EACrJ,IAAI,EAAE,SAAS,GAAG,SAAS,GAC5B,QAAQ,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAiD/D"}

package/dist/src/shared/tree.js

@@ -0,0 +1,134 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Nested rows (#954, #955) — a collection's own tree, walked in pre-order.
+ *
+ * A Table's and a Matrix's rows nest the way the Plan's do (#822): a row
+ * carries its children, to any depth, through `tree={{ children, collapsed }}`.
+ * The walk is ONE reified East function over the data — an explicit stack,
+ * since depth is data (the Plan's walk, `collections/plan/series.ts`) — that
+ * turns the author's elements into the component's own rows, each parent
+ * followed by its subtree, each with its depth.
+ *
+ * Not exported from the package barrel — factory-internal; the components
+ * re-export the input types under their own names.
+ *
+ * @packageDocumentation
+ */
+import { ArrayType, BooleanType, East, EastTypeType, Expr, IntegerType, StructType, isTypeEqual, printFor, toEastTypeValue, } from "@elaraai/east";
+import { reifyAccessor } from "./reify.js";
+/**
+ * Resolves a collection's element type for its accessors: a struct as it is,
+ * a recursive element through its node.
+ *
+ * @param component - The component, for the message (`"Table"`)
+ * @param elementType - The data's element type
+ * @returns The element, its row struct and the node accessor
+ * @throws {Error} When the element is neither a struct nor a recursive type whose node is one
+ */
+export function treeElement(component, elementType) {
+    const recursive = elementType.type === "Recursive";
+    const rowType = (recursive ? elementType.node : elementType);
+    if (rowType.type !== "Struct") {
+        throw new Error(`${component}: rows must be structs, or recursive rows whose node is a struct — got ` +
+            `${rowType.type}. Map the collection to a struct per row before passing it.`);
+    }
+    const nodeOf = (element) => (recursive
+        ? element.unwrap()
+        : element);
+    return { elementType, rowType, nodeOf };
+}
+/** East's own printer over a type value — the types a build-time message names. */
+const printType = printFor(EastTypeType);
+/**
+ * A `tree.children` accessor as a real East function: from a row to its child
+ * rows, which must be more of the collection's own rows — an `Array` of its
+ * element type — because every row fills the same columns.
+ *
+ * @param component - The component, for the message (`"Table"`)
+ * @param element - The collection's element
+ * @param children - The author's accessor
+ * @returns The accessor, reified once
+ * @throws {Error} When the accessor returns anything but an Array of the element type
+ */
+function childRowsOf(component, element, children) {
+    const fn = reifyAccessor([element.elementType], (e) => children(element.nodeOf(e)));
+    const output = Expr.type(fn).output;
+    const want = ArrayType(element.elementType);
+    if (!isTypeEqual(output, want)) {
+        throw new Error(`${component}: \`tree.children\` returns a row's child rows — more of the ${component.toLowerCase()}'s own rows, ` +
+            `${printType(toEastTypeValue(want))} — but it returned ${printType(toEastTypeValue(output))}. ` +
+            "Every row fills the same columns: return a recursive row's own children, or look them up among the rows.");
+    }
+    return fn;
+}
+/**
+ * The collection's rows IN PRE-ORDER, as one East function over the data: a
+ * parent, then its subtree, each row built by `rowOf` with its depth and
+ * whether it starts collapsed (only a row with children ever does). Without a
+ * `tree`, every element is a row at depth 0, in data order.
+ *
+ * @remarks
+ * The tree's depth is data, so the walk is an explicit stack: a level's rows
+ * go on REVERSED, so the stack pops the first of them first. Every function
+ * the walk calls is reified once and bound once — a captured function
+ * referenced in a loop would be re-inlined per use.
+ *
+ * @typeParam Row - The component's row type
+ * @param component - The component, for the build-time messages (`"Table"`)
+ * @param element - The collection's element ({@link treeElement})
+ * @param rowType - The component's row type
+ * @param rowOf - One element's row, given its depth and whether it starts collapsed
+ * @param tree - How the rows nest; absent, the collection is flat
+ * @returns A function from the collection to its rows
+ * @throws {Error} When `tree.children` returns anything but more of the collection's rows
+ */
+export function preOrderRows(component, element, rowType, rowOf, tree) {
+    const { elementType, nodeOf } = element;
+    const rowFn = East.function([elementType, IntegerType, BooleanType], rowType, ($, e, depth, collapsed) => rowOf($, e, depth, collapsed));
+    const collapsedInput = tree?.collapsed;
+    const nesting = tree === undefined ? undefined : {
+        children: childRowsOf(component, element, tree.children),
+        collapsed: East.function([elementType], BooleanType, (_$, e) => (typeof collapsedInput === "function"
+            ? East.value(collapsedInput(nodeOf(e)), BooleanType)
+            : East.value(collapsedInput ?? false, BooleanType))),
+    };
+    const rowsType = ArrayType(rowType);
+    const Frame = StructType({ value: elementType, depth: IntegerType });
+    const Frames = ArrayType(Frame);
+    const walk = East.function([ArrayType(elementType)], rowsType, ($, collection) => {
+        const row = $.const(rowFn);
+        const out = $.let([], rowsType);
+        if (nesting === undefined) {
+            $.for(collection, ($2, e) => {
+                $2(out.pushLast(row(e, 0n, false)));
+            });
+            return out;
+        }
+        const kids = $.const(nesting.children);
+        const fold = $.const(nesting.collapsed);
+        const stack = $.let([], Frames);
+        $.for(collection, ($2, e) => {
+            $2(stack.pushLast(East.value({ value: e, depth: 0n }, Frame)));
+        });
+        $(stack.reverseInPlace());
+        $.while(stack.size().greater(0n), ($2) => {
+            const frame = $2.let(stack.popLast(), Frame);
+            const below = $2.let(kids(frame.value), ArrayType(elementType));
+            // Only a row with children folds.
+            const closed = $2.let(below.size().greater(0n).and(() => fold(frame.value)), BooleanType);
+            $2(out.pushLast(row(frame.value, frame.depth, closed)));
+            const next = $2.let([], Frames);
+            $2.for(below, ($3, e) => {
+                $3(next.pushLast(East.value({ value: e, depth: frame.depth.add(1n) }, Frame)));
+            });
+            $2(next.reverseInPlace());
+            $2(stack.append(next));
+        });
+        return out;
+    });
+    return walk;
+}
+//# sourceMappingURL=tree.js.map

package/dist/src/shared/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../src/shared/tree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EASH,SAAS,EACT,WAAW,EACX,IAAI,EACJ,YAAY,EACZ,IAAI,EACJ,WAAW,EACX,UAAU,EACV,WAAW,EACX,QAAQ,EACR,eAAe,GAClB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAwC3C;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,WAAqB;IAChE,MAAM,SAAS,GAAI,WAAgC,CAAC,IAAI,KAAK,WAAW,CAAC;IACzE,MAAM,OAAO,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,WAAyC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAe,CAAC;IAC1G,IAAK,OAA4B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CACX,GAAG,SAAS,yEAAyE;YACrF,GAAI,OAA4B,CAAC,IAAI,6DAA6D,CACrG,CAAC;IACN,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,OAA2B,EAAwB,EAAE,CAAC,CAAC,SAAS;QAC5E,CAAC,CAAE,OAAgD,CAAC,MAAM,EAAE;QAC5D,CAAC,CAAC,OAAO,CAAyB,CAAC;IACvC,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC5C,CAAC;AAED,mFAAmF;AACnF,MAAM,SAAS,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;AAEzC;;;;;;;;;;GAUG;AACH,SAAS,WAAW,CAChB,SAAiB,EACjB,OAAoB,EACpB,QAA6C;IAE7C,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAuB,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAI,IAAI,CAAC,IAAI,CAAC,EAAqB,CAAqC,CAAC,MAAM,CAAC;IAC5F,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC5C,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CACX,GAAG,SAAS,gEAAgE,SAAS,CAAC,WAAW,EAAE,eAAe;YAClH,GAAG,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,sBAAsB,SAAS,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,IAAI;YAC/F,0GAA0G,CAAC,CAAC;IACpH,CAAC;IACD,OAAO,EAAwE,CAAC;AACpF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,YAAY,CACxB,SAAiB,EACjB,OAAoB,EACpB,OAAY,EACZ,KAAqJ,EACrJ,IAA2B;IAE3B,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CACvB,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,EACvC,OAAmB,EACnB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,CAAiC,EAAE,CAAuB,EAAE,KAAK,EAAE,SAAS,CAAU,CAC3H,CAAC;IACF,MAAM,cAAc,GAAG,IAAI,EAAE,SAAS,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC7C,QAAQ,EAAE,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC;QACxD,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,cAAc,KAAK,UAAU;YACjG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAuB,CAAC,CAAC,EAAE,WAAW,CAAC;YAC1E,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,IAAI,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;KAC3D,CAAC;IACF,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAmB,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,UAAU,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE;QAC7E,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAChC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACxB,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;gBACxB,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YACH,OAAO,GAAG,CAAC;QACf,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YACxB,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC;QAC1B,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;YACrC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;YAChE,kCAAkC;YAClC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YAC1F,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAChC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;gBACpB,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YACnF,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;YAC1B,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC,CAAC,CAAC;IACH,OAAO,IAAgF,CAAC;AAC5F,CAAC"}