@elaraai/east-ui 1.0.72 → 1.0.74

package/README.md

@@ -140,7 +140,7 @@ Dual-licensed:
   - [@elaraai/east-ui-components](https://www.npmjs.com/package/@elaraai/east-ui-components): React renderer with Chakra UI v3 styling
   - [@elaraai/e3-ui](https://www.npmjs.com/package/@elaraai/e3-ui): e3 + UI bridge — Data bindings, `e3.ui()` task, manifest
   - [@elaraai/e3-ui-components](https://www.npmjs.com/package/@elaraai/e3-ui-components): React Query hooks and preview components for the e3 API
-  - [@elaraai/e3-ui-cli](https://www.npmjs.com/package/@elaraai/e3-ui-cli): Render east-ui / e3-ui components to PNG from the command line (`e3-ui shot`)
+  - [@elaraai/e3-ui-cli](https://www.npmjs.com/package/@elaraai/e3-ui-cli): Browse an e3 repository in the terminal (`e3-ui [repo]`), and render east-ui / e3-ui components to PNG (`e3-ui shot`)
   - [east-ui-preview](https://marketplace.visualstudio.com/items?itemName=ElaraAI.east-ui-preview): VS Code extension for live East UI component preview
 
 - **[e3 — East Execution Engine](https://github.com/elaraai/east-workspace/tree/main/libs/e3)**: Durable execution engine for running East pipelines at scale. Git-like content-addressable storage, automatic memoization, reactive dataflow, real-time monitoring.

package/dist/src/collections/value-tree/flatten.d.ts

@@ -0,0 +1,354 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+import type { ValueTreeLeafValue, ValueTreeNodeValue, ValueTreeStepValue } from "./materialize.js";
+/** Rows at depth < this start expanded when the host sets no `openDepth`
+ *  (per-row toggles and the toolbar override it). */
+export declare const DEFAULT_OPEN_DEPTH = 1;
+/** Leaf preview parts a struct row's summary surfaces. */
+export declare const PREVIEW_PARTS = 3;
+/**
+ * The kind of a flattened row.
+ *
+ * @remarks
+ * `leaf` / `opaque` / `struct` / `array` / `dict` mirror the resolved node
+ * kind (option and variant wrappers are collapsed into the row's controls);
+ * `emptyOption` is a `none` option; `appendArray` / `appendDict` are the
+ * "Add item" / "Add entry" ghost rows an expanded editable collection ends
+ * in.
+ */
+export type RowKind = "leaf" | "opaque" | "struct" | "array" | "dict" | "emptyOption" | "appendArray" | "appendDict";
+/**
+ * One flattened row of a ValueTree.
+ *
+ * @property id - Stable row identity: the {@link pathKey} of the row's own
+ *   (raw) path; append rows use `<parent>/$append`
+ * @property parentId - The id of the row this row is nested under
+ * @property depth - Nesting depth (0 = a root row)
+ * @property label - End-user label (humanized field, item title, dict key)
+ * @property kind - The row kind ({@link RowKind})
+ * @property leaf - The primitive leaf value for `leaf` rows
+ * @property opaque - The printed summary for `opaque` rows
+ * @property summary - Muted value-cell text for branches (preview / counts / "Not set")
+ * @property path - Path to the RESOLVED node — the edit / insert target
+ * @property ownPath - Path of the row's own binding step — the remove target
+ * @property variantCtl - Variant tag control (path, active tag, all tags), if the row wraps a variant
+ * @property optionCtl - Option control (path, whether set), if the row wraps an option
+ * @property removable - Whether the row may be removed from its container
+ * @property expandable - Whether the row has children (or an append ghost)
+ * @property expanded - Whether the row's children are currently listed
+ * @property posinset - 1-based position among rendered siblings (aria-posinset)
+ * @property setsize - Rendered sibling count (aria-setsize)
+ */
+export interface RowModel {
+    id: string;
+    parentId: string | undefined;
+    depth: number;
+    label: string;
+    kind: RowKind;
+    leaf: ValueTreeLeafValue | undefined;
+    opaque: string | undefined;
+    summary: string | undefined;
+    path: ValueTreeStepValue[];
+    ownPath: ValueTreeStepValue[];
+    variantCtl: {
+        path: ValueTreeStepValue[];
+        tag: string;
+        tags: string[];
+    } | undefined;
+    optionCtl: {
+        path: ValueTreeStepValue[];
+        isSome: boolean;
+    } | undefined;
+    removable: boolean;
+    expandable: boolean;
+    expanded: boolean;
+    posinset: number;
+    setsize: number;
+}
+/**
+ * One child of a compound node: its display label, its node and the path
+ * step that binds it.
+ *
+ * @property label - Display label
+ * @property node - The child node
+ * @property step - The path step from the parent to this child
+ */
+export interface ChildEntry {
+    label: string;
+    node: ValueTreeNodeValue;
+    step: ValueTreeStepValue;
+}
+/**
+ * Shared flatten context: expansion state, edit capabilities, output.
+ *
+ * @property open - Per-row expansion overrides keyed by row id
+ * @property openDepth - Rows at depth < this start expanded (per-row `open` overrides)
+ * @property canRemove - Whether the host can remove elements / entries
+ * @property canInsert - Whether the host can append elements / entries
+ * @property rows - The output rows, appended in order
+ */
+export interface FlattenCtx {
+    open: Record<string, boolean>;
+    openDepth: number;
+    canRemove: boolean;
+    canInsert: boolean;
+    rows: RowModel[];
+}
+/** One pageable root row supplied by a paging host: its materialized node,
+ *  the row's own path step (global index / dict key), and optionally a
+ *  display label (derived from content when omitted). */
+export interface ValueTreePagedRow {
+    node: ValueTreeNodeValue;
+    step: ValueTreeStepValue;
+    label?: string | undefined;
+}
+/**
+ * Remote-paging contract for a collection-rooted tree.
+ *
+ * When set, the tree's root rows come from `pages` instead of the payload's
+ * root node: the extent spans all `totalRows` (a scrollbar covers the whole
+ * collection), unloaded rows render as placeholders, and scrolling requests
+ * the windows that come into view via `onNeedRows`. Loaded rows expand and
+ * edit exactly like ordinary rows — their path steps are global, so edit
+ * callbacks stay correct. The host owns fetching and deduping; replace the
+ * `pages` map (new identity) as pages arrive.
+ */
+export interface ValueTreePaging {
+    /** Total root rows in the full collection. */
+    totalRows: number;
+    /** Rows per page — keys of `pages` are `floor(row / pageSize)`. */
+    pageSize: number;
+    /** Loaded pages by page index (the final page may be shorter). */
+    pages: ReadonlyMap<number, readonly ValueTreePagedRow[]>;
+    /** Requests loading of the pages covering rows `[startRow, endRow)`. */
+    onNeedRows: (startRow: number, endRow: number) => void;
+    /** Controlled jump (browser renderer): on each change to a defined value
+     *  the tree scrolls this global root row into view, highlights it, and
+     *  requests the destination window through {@link onNeedRows}. The
+     *  highlight holds until this clears back to `undefined` (#520). Kept
+     *  optional so hosts without a controlled jump omit it. */
+    scrollToRow?: number | undefined;
+}
+/**
+ * Paged-mode flat structure: per-page flattened row models, prefix sums
+ * mapping flat indexes to pages, and the loaded rows in order for keyboard
+ * traversal. Unloaded root rows contribute one placeholder row each, so
+ * the extent always spans the whole collection.
+ *
+ * @property totalFlat - Total flat rows (loaded models + placeholders)
+ * @property prefix - `prefix[p]` = flat rows before page `p` (length `pageCount + 1`)
+ * @property pageModels - Flattened rows of each loaded page
+ * @property loadedRows - Every loaded row in flat order
+ * @property pageCount - Number of pages in the collection
+ * @property rootRowsInPage - Root rows page `p` covers (the final page may be shorter)
+ */
+export interface PagedFlat {
+    totalFlat: number;
+    prefix: number[];
+    pageModels: Map<number, RowModel[]>;
+    loadedRows: RowModel[];
+    pageCount: number;
+    rootRowsInPage: (p: number) => number;
+}
+/**
+ * The stable text identity of a node path — the row id.
+ *
+ * @param steps - The path steps
+ * @returns `.field`, `[index]`, `{key}`, `?` (some) and `!` (tag) joined; `$` for the root
+ */
+export declare function pathKey(steps: ValueTreeStepValue[]): string;
+/**
+ * "flowRate" / "flow_rate" → "Flow rate" — end-user field labels. Dict keys
+ * are user data and stay verbatim.
+ *
+ * @param name - A struct field name
+ * @returns The humanized label
+ */
+export declare function humanize(name: string): string;
+/**
+ * A node with its option / variant wrappers collapsed into row controls.
+ *
+ * @property kind - The row kind of the content node
+ * @property leaf - The leaf value, for leaves
+ * @property opaque - The printed summary, for opaque nodes
+ * @property node - The content node the row displays
+ * @property path - The path to the content node
+ * @property variantCtl - The outermost variant wrapper's control
+ * @property optionCtl - The outermost option wrapper's control
+ */
+export interface ResolvedNode {
+    kind: RowKind;
+    leaf: ValueTreeLeafValue | undefined;
+    opaque: string | undefined;
+    node: ValueTreeNodeValue;
+    path: ValueTreeStepValue[];
+    variantCtl: RowModel["variantCtl"];
+    optionCtl: RowModel["optionCtl"];
+}
+/**
+ * Collapses option / variant wrappers into row controls, leaving the content
+ * node the row displays (or `emptyOption` for a none).
+ *
+ * @param raw - The node as materialized
+ * @param rawPath - The path to `raw`
+ * @returns The resolved node
+ */
+export declare function resolveNode(raw: ValueTreeNodeValue, rawPath: ValueTreeStepValue[]): ResolvedNode;
+/**
+ * Unwraps option / variant wrappers to the content node (display only).
+ *
+ * @param node - A node
+ * @returns The innermost non-wrapper node (a `none` option stays as is)
+ */
+export declare function contentOf(node: ValueTreeNodeValue): ValueTreeNodeValue;
+/**
+ * Formats a leaf for display.
+ *
+ * @param leaf - The leaf value
+ * @returns Strings verbatim, numbers as printed, booleans as `true` / `false`,
+ *   datetimes as `YYYY-MM-DD HH:MM:SS`, null as `—`
+ */
+export declare function fmtLeaf(leaf: ValueTreeLeafValue): string;
+/**
+ * One short preview token for a struct field's value, or undefined.
+ *
+ * @param node - The field's node
+ * @returns The token (a variant's humanized tag, a non-empty leaf's text), or undefined
+ */
+export declare function previewPart(node: ValueTreeNodeValue): string | undefined;
+/**
+ * The muted value-cell text for a resolved branch node.
+ *
+ * @param node - A resolved struct / array / dict node
+ * @returns A ` · `-joined preview of the first leaf parts for structs (else
+ *   `N fields`), `N items` for arrays, `N entries` for dicts, `Empty` when empty
+ */
+export declare function summaryOf(node: ValueTreeNodeValue): string;
+/**
+ * A content-derived title for an array element — its first non-empty string
+ * leaf (fields searched in order), else "Item N".
+ *
+ * @param node - The element node
+ * @param index - The element's 0-based index
+ * @returns The title
+ */
+export declare function itemTitle(node: ValueTreeNodeValue, index: number): string;
+/**
+ * The children of a compound node with their labels and binding steps.
+ *
+ * @param node - A struct / array / dict node (anything else has no children)
+ * @returns The child entries in display order
+ */
+export declare function childrenOf(node: ValueTreeNodeValue): ChildEntry[];
+/**
+ * The "Add item" / "Add entry" ghost row an expanded editable collection
+ * ends in.
+ *
+ * @param parentId - The collection row's id (undefined for a root collection)
+ * @param containerPath - The collection's path — the insert target
+ * @param kind - Array or dict append
+ * @param depth - The ghost row's depth
+ * @param posinset - Its 1-based sibling position
+ * @param setsize - The sibling count
+ * @returns The ghost row
+ */
+export declare function appendRowModel(parentId: string | undefined, containerPath: ValueTreeStepValue[], kind: "appendArray" | "appendDict", depth: number, posinset: number, setsize: number): RowModel;
+/**
+ * Flattens one node's visible subtree, depth-first, into `ctx.rows`.
+ *
+ * @param ctx - The flatten context (expansion state, capabilities, output)
+ * @param label - The row's label
+ * @param raw - The node as materialized
+ * @param rawPath - The path to `raw` (the row's own path)
+ * @param parentId - The parent row's id
+ * @param depth - The row's depth
+ * @param removable - Whether the row may be removed from its container
+ * @param posinset - Its 1-based sibling position
+ * @param setsize - The sibling count
+ */
+export declare function visitNode(ctx: FlattenCtx, label: string, raw: ValueTreeNodeValue, rawPath: ValueTreeStepValue[], parentId: string | undefined, depth: number, removable: boolean, posinset: number, setsize: number): void;
+/**
+ * Flattens the visible (expanded) rows of an inline tree, depth-first. A
+ * compound root lists its children directly (no synthetic top row); anything
+ * else is a single `Value` row. Expanded editable collections end in an
+ * append ghost row.
+ *
+ * @param root - The materialized root node
+ * @param open - Per-row expansion overrides keyed by row id
+ * @param openDepth - Rows at depth < this start expanded
+ * @param canRemove - Whether the host can remove elements / entries
+ * @param canInsert - Whether the host can append elements / entries
+ * @returns The visible rows in order
+ */
+export declare function flattenRows(root: ValueTreeNodeValue, open: Record<string, boolean>, openDepth: number, canRemove: boolean, canInsert: boolean): RowModel[];
+/**
+ * Flattens the loaded pages of a paged collection root. Paged roots are
+ * read-only at the row level (no append ghost, no row removal) — leaf edits
+ * inside a loaded row still work through the ordinary callbacks, with global
+ * path steps.
+ *
+ * @param paging - The paging contract (totals, page size, loaded pages)
+ * @param open - Per-row expansion overrides keyed by row id
+ * @param openDepth - Rows at depth < this start expanded
+ * @returns The paged flat structure
+ */
+export declare function flattenPaged(paging: ValueTreePaging, open: Record<string, boolean>, openDepth: number): PagedFlat;
+/**
+ * Binary-searches the page whose flat range contains `flatIdx`.
+ *
+ * @param prefix - The prefix sums from {@link flattenPaged}
+ * @param flatIdx - A flat row index
+ * @returns The page index
+ */
+export declare function pageOfFlat(prefix: number[], flatIdx: number): number;
+/**
+ * Flat index of global root row `globalRow`: through the loaded page's
+ * flattened models when present (expanded children shift later rows), else
+ * the one-placeholder-per-root arithmetic.
+ *
+ * @param flat - The paged flat structure
+ * @param paging - The paging contract
+ * @param globalRow - A global root row (clamped to the collection)
+ * @returns The flat index, or undefined for an empty collection
+ */
+export declare function pagedFlatIndexOfRoot(flat: PagedFlat, paging: ValueTreePaging, globalRow: number): number | undefined;
+/**
+ * Flat index of the `rootRow`-th depth-0 row of an inline tree.
+ *
+ * @param rows - The flattened rows
+ * @param rootRow - A 0-based root row ordinal
+ * @returns The flat index, or undefined when there are fewer roots
+ */
+export declare function flatIndexOfRoot(rows: RowModel[], rootRow: number): number | undefined;
+/**
+ * Resolves a paged flat row: a loaded model, or the global root index of a
+ * placeholder.
+ *
+ * @param flat - The paged flat structure
+ * @param paging - The paging contract
+ * @param flatIdx - A flat row index
+ * @returns The row model, or the placeholder's global root row
+ */
+export declare function pagedRowAt(flat: PagedFlat, paging: ValueTreePaging, flatIdx: number): {
+    kind: "model";
+    row: RowModel;
+} | {
+    kind: "placeholder";
+    globalRow: number;
+};
+/**
+ * Drops loaded pages far from the window `[firstPage, lastPage]`, keeping
+ * the window itself and then the nearest pages up to the retention cap.
+ * Returns the SAME map (no re-render) while under the cap.
+ *
+ * @typeParam T - The page payload
+ * @param pages - The loaded pages by index
+ * @param firstPage - First page of the visible window
+ * @param lastPage - Last page of the visible window
+ * @param max - Retention cap
+ * @returns The retained pages (the input map when nothing was dropped)
+ */
+export declare function pruneRetainedPages<T>(pages: ReadonlyMap<number, T>, firstPage: number, lastPage: number, max: number): ReadonlyMap<number, T>;
+//# sourceMappingURL=flatten.d.ts.map

package/dist/src/collections/value-tree/flatten.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.d.ts","sourceRoot":"","sources":["../../../../src/collections/value-tree/flatten.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAyBH,OAAO,KAAK,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAEnG;qDACqD;AACrD,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAEpC,0DAA0D;AAC1D,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B;;;;;;;;;GASG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,aAAa,GAAG,aAAa,GAAG,YAAY,CAAC;AAErH;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,WAAW,QAAQ;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,kBAAkB,GAAG,SAAS,CAAC;IACrC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5B,IAAI,EAAE,kBAAkB,EAAE,CAAC;IAC3B,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,UAAU,EAAE;QAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,SAAS,CAAC;IACpF,SAAS,EAAE;QAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC;QAAC,MAAM,EAAE,OAAO,CAAA;KAAE,GAAG,SAAS,CAAC;IACvE,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,OAAO,CAAC;IACpB,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,UAAU;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,kBAAkB,CAAC;IACzB,IAAI,EAAE,kBAAkB,CAAC;CAC5B;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,QAAQ,EAAE,CAAC;CACpB;AAED;;yDAEyD;AACzD,MAAM,WAAW,iBAAiB;IAC9B,IAAI,EAAE,kBAAkB,CAAC;IACzB,IAAI,EAAE,kBAAkB,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC9B;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,eAAe;IAC5B,8CAA8C;IAC9C,SAAS,EAAE,MAAM,CAAC;IAClB,mEAAmE;IACnE,QAAQ,EAAE,MAAM,CAAC;IACjB,kEAAkE;IAClE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,iBAAiB,EAAE,CAAC,CAAC;IACzD,wEAAwE;IACxE,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IACvD;;;;+DAI2D;IAC3D,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACpC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,SAAS;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;IACpC,UAAU,EAAE,QAAQ,EAAE,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;CACzC;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAU3D;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAO7C;AAQD;;;;;;;;;;GAUG;AACH,MAAM,WAAW,YAAY;IACzB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,kBAAkB,GAAG,SAAS,CAAC;IACrC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,IAAI,EAAE,kBAAkB,CAAC;IACzB,IAAI,EAAE,kBAAkB,EAAE,CAAC;IAC3B,UAAU,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACnC,SAAS,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;CACpC;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,kBAAkB,EAAE,OAAO,EAAE,kBAAkB,EAAE,GAAG,YAAY,CAsChG;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,kBAAkB,GAAG,kBAAkB,CActE;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,kBAAkB,GAAG,MAAM,CASxD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,kBAAkB,GAAG,MAAM,GAAG,SAAS,CAiBxE;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,kBAAkB,GAAG,MAAM,CAqB1D;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,kBAAkB,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAWzE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,kBAAkB,GAAG,UAAU,EAAE,CAiBjE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAC1B,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,aAAa,EAAE,kBAAkB,EAAE,EACnC,IAAI,EAAE,aAAa,GAAG,YAAY,EAClC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,GAChB,QAAQ,CAYV;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CACrB,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,kBAAkB,EACvB,OAAO,EAAE,kBAAkB,EAAE,EAC7B,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,EAClB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,GAChB,IAAI,CA6CN;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CACvB,IAAI,EAAE,kBAAkB,EACxB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,OAAO,EAClB,SAAS,EAAE,OAAO,GACnB,QAAQ,EAAE,CA0BZ;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CACxB,MAAM,EAAE,eAAe,EACvB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,SAAS,EAAE,MAAM,GAClB,SAAS,CA0BX;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAQpE;AAED;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAiBpH;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CASrF;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,GAC9E;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAQ/C;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAChC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAC7B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,GACZ,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CASxB"}