@elaraai/east-ui 1.0.72 → 1.0.73

package/dist/src/collections/value-tree/flatten.js

@@ -0,0 +1,520 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * The ValueTree ROW MODEL — renderer-agnostic row math over the materialized
+ * node tree (#719).
+ *
+ * A `ValueTreeNodeValue` is a tree; every renderer shows it as a flat list of
+ * one-line rows: the expanded nodes depth-first, each with an end-user label
+ * (`humanize`d struct fields, content-derived array item titles, dict keys
+ * verbatim), a muted summary for branches (`Press · 2.5 · Running`,
+ * `3 items`, `Not set`), the typed path an edit reports, and the option /
+ * variant controls collapsed into the row. `flattenRows` produces that list
+ * for an inline value; `flattenPaged` produces it page by page for a
+ * collection root whose rows arrive in windows, with one placeholder row per
+ * unloaded root so the extent always spans the whole collection.
+ *
+ * This module has no DOM and no React: the browser renderer
+ * (`east-ui-components`) and the terminal (`e3-ui-cli`) both consume it, so a
+ * value reads identically in each — same labels, same summaries, same
+ * `pathKey` identities, same expand semantics.
+ *
+ * @packageDocumentation
+ */
+import { some, variant } from "@elaraai/east";
+/** Rows at depth < this start expanded when the host sets no `openDepth`
+ *  (per-row toggles and the toolbar override it). */
+export const DEFAULT_OPEN_DEPTH = 1;
+/** Leaf preview parts a struct row's summary surfaces. */
+export const PREVIEW_PARTS = 3;
+/**
+ * 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 function pathKey(steps) {
+    let out = "";
+    for (const s of steps) {
+        if (s.type === "field")
+            out += `.${s.value}`;
+        else if (s.type === "index")
+            out += `[${s.value}]`;
+        else if (s.type === "key")
+            out += `{${s.value}}`;
+        else if (s.type === "some")
+            out += "?";
+        else
+            out += "!";
+    }
+    return out === "" ? "$" : out;
+}
+/**
+ * "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 function humanize(name) {
+    const spaced = name
+        .replace(/[_-]+/g, " ")
+        .replace(/([a-z0-9])([A-Z])/g, "$1 $2")
+        .trim();
+    if (spaced === "")
+        return name;
+    return spaced.charAt(0).toUpperCase() + spaced.slice(1).toLowerCase();
+}
+/** The payload of an option node's value, or undefined for `none`. */
+function optionInner(node) {
+    const v = node.value.value;
+    return v.type === "some" ? v.value : undefined;
+}
+/**
+ * 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 function resolveNode(raw, rawPath) {
+    let node = raw;
+    let path = rawPath;
+    let variantCtl;
+    let optionCtl;
+    for (;;) {
+        if (node.type === "option") {
+            const inner = optionInner(node);
+            if (optionCtl === undefined)
+                optionCtl = { path, isSome: inner !== undefined };
+            if (inner === undefined) {
+                return { kind: "emptyOption", leaf: undefined, opaque: undefined, node, path, variantCtl, optionCtl };
+            }
+            path = [...path, some(null)];
+            node = inner;
+            continue;
+        }
+        if (node.type === "variant") {
+            if (variantCtl === undefined) {
+                variantCtl = { path, tag: node.value.tag, tags: [...node.value.tags] };
+            }
+            path = [...path, variant("tag", null)];
+            node = node.value.value;
+            continue;
+        }
+        break;
+    }
+    const kind = node.type === "leaf" ? "leaf"
+        : node.type === "opaque" ? "opaque"
+            : node.type === "struct" ? "struct"
+                : node.type === "array" ? "array"
+                    : "dict";
+    return {
+        kind,
+        leaf: node.type === "leaf" ? node.value : undefined,
+        opaque: node.type === "opaque" ? node.value : undefined,
+        node, path, variantCtl, optionCtl,
+    };
+}
+/**
+ * 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 function contentOf(node) {
+    for (;;) {
+        if (node.type === "option") {
+            const inner = optionInner(node);
+            if (inner === undefined)
+                return node;
+            node = inner;
+            continue;
+        }
+        if (node.type === "variant") {
+            node = node.value.value;
+            continue;
+        }
+        return node;
+    }
+}
+/**
+ * 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 function fmtLeaf(leaf) {
+    switch (leaf.type) {
+        case "string": return leaf.value;
+        case "integer": return String(leaf.value);
+        case "float": return String(leaf.value);
+        case "boolean": return leaf.value ? "true" : "false";
+        case "datetime": return leaf.value.toISOString().replace("T", " ").slice(0, 19);
+        default: return "—";
+    }
+}
+/**
+ * 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 function previewPart(node) {
+    for (;;) {
+        if (node.type === "option") {
+            const inner = optionInner(node);
+            if (inner === undefined)
+                return undefined;
+            node = inner;
+            continue;
+        }
+        break;
+    }
+    if (node.type === "variant")
+        return humanize(node.value.tag);
+    if (node.type === "leaf") {
+        if (node.value.type === "null")
+            return undefined;
+        const text = fmtLeaf(node.value);
+        return text === "" ? undefined : text;
+    }
+    return 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 function summaryOf(node) {
+    if (node.type === "struct") {
+        const parts = [];
+        for (const f of node.value.fields) {
+            const part = previewPart(f.node);
+            if (part !== undefined)
+                parts.push(part);
+            if (parts.length >= PREVIEW_PARTS)
+                break;
+        }
+        if (parts.length > 0)
+            return parts.join(" · ");
+        const n = node.value.fields.length;
+        return n === 0 ? "Empty" : n === 1 ? "1 field" : `${n} fields`;
+    }
+    if (node.type === "array") {
+        const n = node.value.items.length;
+        return n === 0 ? "Empty" : n === 1 ? "1 item" : `${n} items`;
+    }
+    if (node.type === "dict") {
+        const n = node.value.entries.length;
+        return n === 0 ? "Empty" : n === 1 ? "1 entry" : `${n} entries`;
+    }
+    return "";
+}
+/**
+ * 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 function itemTitle(node, index) {
+    const content = contentOf(node);
+    if (content.type === "struct") {
+        for (const f of content.value.fields) {
+            const c = contentOf(f.node);
+            if (c.type === "leaf" && c.value.type === "string" && c.value.value !== "") {
+                return c.value.value;
+            }
+        }
+    }
+    return `Item ${index + 1}`;
+}
+/**
+ * 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 function childrenOf(node) {
+    if (node.type === "struct") {
+        return node.value.fields.map(f => ({ label: humanize(f.name), node: f.node, step: variant("field", f.name) }));
+    }
+    if (node.type === "array") {
+        return node.value.items.map((n, i) => ({ label: itemTitle(n, i), node: n, step: variant("index", BigInt(i)) }));
+    }
+    if (node.type === "dict") {
+        // `label` is display, `key` the round-trippable step text; the
+        // fallback covers host-constructed node shapes that predate `label`.
+        return node.value.entries.map(e => ({
+            label: e.label ?? e.key,
+            node: e.node,
+            step: variant("key", e.key),
+        }));
+    }
+    return [];
+}
+/**
+ * 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 function appendRowModel(parentId, containerPath, kind, depth, posinset, setsize) {
+    return {
+        id: `${parentId ?? "$"}/$append`,
+        parentId, depth,
+        label: kind === "appendArray" ? "Add item" : "Add entry",
+        kind,
+        leaf: undefined, opaque: undefined, summary: undefined,
+        path: containerPath, ownPath: containerPath,
+        variantCtl: undefined, optionCtl: undefined,
+        removable: false, expandable: false, expanded: false,
+        posinset, setsize,
+    };
+}
+/**
+ * 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 function visitNode(ctx, label, raw, rawPath, parentId, depth, removable, posinset, setsize) {
+    const r = resolveNode(raw, rawPath);
+    const id = pathKey(rawPath);
+    const kids = childrenOf(r.node);
+    const insertable = ctx.canInsert && (r.kind === "array" ||
+        (r.kind === "dict" && r.node.type === "dict" && r.node.value.editable));
+    const expandable = kids.length > 0 || insertable;
+    const expanded = expandable && (ctx.open[id] ?? depth < ctx.openDepth);
+    let summary = r.kind === "emptyOption" ? "Not set"
+        : (r.kind === "struct" || r.kind === "array" || r.kind === "dict") ? summaryOf(r.node)
+            : undefined;
+    // A content-derived item title already IS the first preview part —
+    // don't repeat it beside itself.
+    if (summary !== undefined && summary !== label && summary.startsWith(`${label} · `)) {
+        summary = summary.slice(label.length + 3);
+    }
+    else if (summary === label) {
+        summary = undefined;
+    }
+    ctx.rows.push({
+        id, parentId, depth, label,
+        kind: r.kind, leaf: r.leaf, opaque: r.opaque, summary,
+        path: r.path, ownPath: rawPath,
+        variantCtl: r.variantCtl, optionCtl: r.optionCtl,
+        removable, expandable, expanded,
+        posinset, setsize,
+    });
+    if (expanded) {
+        const kidsRemovable = ctx.canRemove && (r.kind === "array" ||
+            (r.kind === "dict" && r.node.type === "dict" && r.node.value.editable));
+        const total = kids.length + (insertable ? 1 : 0);
+        kids.forEach((k, i) => {
+            visitNode(ctx, k.label, k.node, [...r.path, k.step], id, depth + 1, kidsRemovable, i + 1, total);
+        });
+        if (insertable) {
+            ctx.rows.push(appendRowModel(id, r.path, r.kind === "array" ? "appendArray" : "appendDict", depth + 1, total, total));
+        }
+    }
+}
+/**
+ * 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 function flattenRows(root, open, openDepth, canRemove, canInsert) {
+    const ctx = { open, openDepth, canRemove, canInsert, rows: [] };
+    const rows = ctx.rows;
+    if (root.type === "struct" || root.type === "array" || root.type === "dict") {
+        const rootInsertable = canInsert && (root.type === "array" || (root.type === "dict" && root.value.editable));
+        const kidsRemovable = canRemove && (root.type === "array" || (root.type === "dict" && root.value.editable));
+        const kids = childrenOf(root);
+        const total = kids.length + (rootInsertable ? 1 : 0);
+        kids.forEach((k, i) => {
+            visitNode(ctx, k.label, k.node, [k.step], undefined, 0, kidsRemovable, i + 1, total);
+        });
+        if (rootInsertable) {
+            rows.push(appendRowModel(undefined, [], root.type === "array" ? "appendArray" : "appendDict", 0, total, total));
+        }
+    }
+    else {
+        visitNode(ctx, "Value", root, [], undefined, 0, false, 1, 1);
+    }
+    return rows;
+}
+/**
+ * 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 function flattenPaged(paging, open, openDepth) {
+    const { totalRows, pageSize, pages } = paging;
+    const pageCount = Math.max(0, Math.ceil(totalRows / pageSize));
+    const rootRowsInPage = (p) => Math.max(0, Math.min(pageSize, totalRows - p * pageSize));
+    const pageModels = new Map();
+    const loadedRows = [];
+    const prefix = new Array(pageCount + 1);
+    prefix[0] = 0;
+    for (let p = 0; p < pageCount; p++) {
+        const loaded = pages.get(p);
+        if (loaded === undefined) {
+            prefix[p + 1] = prefix[p] + rootRowsInPage(p);
+            continue;
+        }
+        const ctx = { open, openDepth, canRemove: false, canInsert: false, rows: [] };
+        loaded.forEach((r, i) => {
+            const globalRow = p * pageSize + i;
+            const label = r.label ?? itemTitle(r.node, globalRow);
+            visitNode(ctx, label, r.node, [r.step], undefined, 0, false, globalRow + 1, totalRows);
+        });
+        pageModels.set(p, ctx.rows);
+        loadedRows.push(...ctx.rows);
+        prefix[p + 1] = prefix[p] + ctx.rows.length;
+    }
+    return { totalFlat: prefix[pageCount] ?? 0, prefix, pageModels, loadedRows, pageCount, rootRowsInPage };
+}
+/**
+ * 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 function pageOfFlat(prefix, flatIdx) {
+    let lo = 0, hi = prefix.length - 2;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (prefix[mid + 1] <= flatIdx)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/**
+ * 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 function pagedFlatIndexOfRoot(flat, paging, globalRow) {
+    if (paging.totalRows === 0)
+        return undefined;
+    const clamped = Math.max(0, Math.min(paging.totalRows - 1, globalRow));
+    const p = Math.floor(clamped / paging.pageSize);
+    const base = flat.prefix[p];
+    if (base === undefined)
+        return undefined;
+    const offsetInPage = clamped - p * paging.pageSize;
+    const models = flat.pageModels.get(p);
+    if (models === undefined)
+        return base + offsetInPage;
+    let roots = 0;
+    for (let i = 0; i < models.length; i++) {
+        if (models[i].depth === 0) {
+            if (roots === offsetInPage)
+                return base + i;
+            roots++;
+        }
+    }
+    return 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 function flatIndexOfRoot(rows, rootRow) {
+    let roots = 0;
+    for (let i = 0; i < rows.length; i++) {
+        if (rows[i].depth === 0) {
+            if (roots === rootRow)
+                return i;
+            roots++;
+        }
+    }
+    return 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 function pagedRowAt(flat, paging, flatIdx) {
+    const p = pageOfFlat(flat.prefix, flatIdx);
+    const offsetInPage = flatIdx - flat.prefix[p];
+    const models = flat.pageModels.get(p);
+    if (models !== undefined) {
+        return { kind: "model", row: models[offsetInPage] };
+    }
+    return { kind: "placeholder", globalRow: p * paging.pageSize + offsetInPage };
+}
+/**
+ * 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 function pruneRetainedPages(pages, firstPage, lastPage, max) {
+    if (pages.size <= max)
+        return pages;
+    const distance = (p) => (p < firstPage ? firstPage - p : p > lastPage ? p - lastPage : 0);
+    const keep = [...pages.keys()].sort((a, b) => distance(a) - distance(b) || a - b).slice(0, max);
+    const kept = new Map();
+    for (const p of keep.sort((a, b) => a - b)) {
+        kept.set(p, pages.get(p));
+    }
+    return kept;
+}
+//# sourceMappingURL=flatten.js.map

package/dist/src/collections/value-tree/flatten.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.js","sourceRoot":"","sources":["../../../../src/collections/value-tree/flatten.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAG9C;qDACqD;AACrD,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC,0DAA0D;AAC1D,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAkJ/B;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,KAA2B;IAC/C,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;aACxC,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;aAC9C,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;aAC5C,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,GAAG,IAAI,GAAG,CAAC;;YAClC,GAAG,IAAI,GAAG,CAAC;IACpB,CAAC;IACD,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACjC,MAAM,MAAM,GAAG,IAAI;SACd,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;SACtB,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,IAAI,EAAE,CAAC;IACZ,IAAI,MAAM,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;AAC1E,CAAC;AAED,sEAAsE;AACtE,SAAS,WAAW,CAAC,IAA6C;IAC9D,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC3B,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAuBD;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,GAAuB,EAAE,OAA6B;IAC9E,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,OAAO,CAAC;IACnB,IAAI,UAAkC,CAAC;IACvC,IAAI,SAAgC,CAAC;IACrC,SAAS,CAAC;QACN,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,SAAS,KAAK,SAAS;gBAAE,SAAS,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,KAAK,SAAS,EAAE,CAAC;YAC/E,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACtB,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;YAC1G,CAAC;YACD,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,KAAK,CAAC;YACb,SAAS;QACb,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC3B,UAAU,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3E,CAAC;YACD,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACvC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACxB,SAAS;QACb,CAAC;QACD,MAAM;IACV,CAAC;IACD,MAAM,IAAI,GACN,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM;QAC7B,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ;YACnC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ;gBACnC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO;oBACjC,CAAC,CAAC,MAAM,CAAC;IACb,OAAO;QACH,IAAI;QACJ,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;QACnD,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;QACvD,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS;KACpC,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAwB;IAC9C,SAAS,CAAC;QACN,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,IAAI,CAAC;YACrC,IAAI,GAAG,KAAK,CAAC;YACb,SAAS;QACb,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACxB,SAAS;QACb,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,IAAwB;IAC5C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC;QACjC,KAAK,SAAS,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,KAAK,OAAO,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,KAAK,SAAS,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;QACrD,KAAK,UAAU,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChF,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC;IACxB,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAAwB;IAChD,SAAS,CAAC;QACN,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAC1C,IAAI,GAAG,KAAK,CAAC;YACb,SAAS;QACb,CAAC;QACD,MAAM;IACV,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,SAAS,CAAC;QACjD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,IAAwB;IAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,IAAI,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,KAAK,CAAC,MAAM,IAAI,aAAa;gBAAE,MAAM;QAC7C,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;QACnC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;IACnE,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAClC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;IACjE,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC;IACpE,CAAC;IACD,OAAO,EAAE,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,IAAwB,EAAE,KAAa;IAC7D,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,EAAE,CAAC;gBACzE,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YACzB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,KAAK,GAAG,CAAC,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAwB;IAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnH,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACvB,+DAA+D;QAC/D,qEAAqE;QACrE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,KAAK,EAAG,CAAwB,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG;YAC/C,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC;SAC9B,CAAC,CAAC,CAAC;IACR,CAAC;IACD,OAAO,EAAE,CAAC;AACd,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC1B,QAA4B,EAC5B,aAAmC,EACnC,IAAkC,EAClC,KAAa,EACb,QAAgB,EAChB,OAAe;IAEf,OAAO;QACH,EAAE,EAAE,GAAG,QAAQ,IAAI,GAAG,UAAU;QAChC,QAAQ,EAAE,KAAK;QACf,KAAK,EAAE,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW;QACxD,IAAI;QACJ,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS;QACtD,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa;QAC3C,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;QAC3C,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK;QACpD,QAAQ,EAAE,OAAO;KACpB,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CACrB,GAAe,EACf,KAAa,EACb,GAAuB,EACvB,OAA6B,EAC7B,QAA4B,EAC5B,KAAa,EACb,SAAkB,EAClB,QAAgB,EAChB,OAAe;IAEf,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,IAAI,CAChC,CAAC,CAAC,IAAI,KAAK,OAAO;QAClB,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CACzE,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC;IACjD,MAAM,QAAQ,GAAG,UAAU,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;IACvE,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,SAAS;QAC9C,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;YACtF,CAAC,CAAC,SAAS,CAAC;IAChB,mEAAmE;IACnE,iCAAiC;IACjC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;QAClF,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;SAAM,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;QAC3B,OAAO,GAAG,SAAS,CAAC;IACxB,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QACV,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK;QAC1B,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO;QACrD,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO;QAC9B,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS;QAChD,SAAS,EAAE,UAAU,EAAE,QAAQ;QAC/B,QAAQ,EAAE,OAAO;KACpB,CAAC,CAAC;IACH,IAAI,QAAQ,EAAE,CAAC;QACX,MAAM,aAAa,GAAG,GAAG,CAAC,SAAS,IAAI,CACnC,CAAC,CAAC,IAAI,KAAK,OAAO;YAClB,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CACzE,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClB,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACrG,CAAC,CAAC,CAAC;QACH,IAAI,UAAU,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CACxB,EAAE,EAAE,CAAC,CAAC,IAAI,EACV,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,EACjD,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAC1B,CAAC,CAAC;QACP,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CACvB,IAAwB,EACxB,IAA6B,EAC7B,SAAiB,EACjB,SAAkB,EAClB,SAAkB;IAElB,MAAM,GAAG,GAAe,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;IACtB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1E,MAAM,cAAc,GAAG,SAAS,IAAI,CAChC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CACzE,CAAC;QACF,MAAM,aAAa,GAAG,SAAS,IAAI,CAC/B,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CACzE,CAAC;QACF,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClB,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACzF,CAAC,CAAC,CAAC;QACH,IAAI,cAAc,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,cAAc,CACpB,SAAS,EAAE,EAAE,EACb,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,EACpD,CAAC,EAAE,KAAK,EAAE,KAAK,CAClB,CAAC,CAAC;QACP,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CACxB,MAAuB,EACvB,IAA6B,EAC7B,SAAiB;IAEjB,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC/D,MAAM,cAAc,GAAG,CAAC,CAAS,EAAU,EAAE,CACzC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IACjD,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,MAAM,GAAa,IAAI,KAAK,CAAS,SAAS,GAAG,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC/C,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAe,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QAC1F,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACtD,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3F,CAAC,CAAC,CAAC;QACH,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;IACjD,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,cAAc,EAAE,CAAC;AAC5G,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,MAAgB,EAAE,OAAe;IACxD,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACnC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,CAAE,IAAI,OAAO;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YACzC,EAAE,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAe,EAAE,MAAuB,EAAE,SAAiB;IAC5F,IAAI,MAAM,CAAC,SAAS,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IACvE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,MAAM,YAAY,GAAG,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC;IACnD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,IAAI,GAAG,YAAY,CAAC;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,KAAK,KAAK,YAAY;gBAAE,OAAO,IAAI,GAAG,CAAC,CAAC;YAC5C,KAAK,EAAE,CAAC;QACZ,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,IAAgB,EAAE,OAAe;IAC7D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,CAAC,CAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,KAAK,KAAK,OAAO;gBAAE,OAAO,CAAC,CAAC;YAChC,KAAK,EAAE,CAAC;QACZ,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,IAAe,EAAE,MAAuB,EAAE,OAAe;IAGhF,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,YAAY,CAAE,EAAE,CAAC;IACzD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,GAAG,YAAY,EAAE,CAAC;AAClF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAA6B,EAC7B,SAAiB,EACjB,QAAgB,EAChB,GAAW;IAEX,IAAI,KAAK,CAAC,IAAI,IAAI,GAAG;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

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

@@ -36,6 +36,8 @@ import { ValueTreePathType, ValueTreeLeafType } from "./types.js";
 export { ValueTreeStepType, ValueTreePathType, ValueTreeLeafType, ValueTreeNodeType, ValueTreeStyleType, ValueTreeRootType, } from "./types.js";
 import { materialize, applyEdit, dictKeyLabel } from "./materialize.js";
 export { materialize, applyEdit, dictKeyLabel, type ValueTreeNodeValue, type ValueTreeLeafValue, type ValueTreeStepValue, type ValueTreeEditOp, } from "./materialize.js";
+import { flattenRows, flattenPaged, pageOfFlat, pagedRowAt, pagedFlatIndexOfRoot, flatIndexOfRoot, pruneRetainedPages, humanize, pathKey, itemTitle, summaryOf, childrenOf, fmtLeaf, type RowModel as FlattenRowModel, type RowKind as FlattenRowKind, type ChildEntry as FlattenChildEntry, type FlattenCtx as FlattenContext, type ValueTreePagedRow as FlattenPagedRow, type ValueTreePaging as FlattenPaging, type PagedFlat as FlattenPagedFlat, type ResolvedNode as FlattenResolvedNode } from "./flatten.js";
+import { keyRangePredicates, parseKeyInput, findKeyInline, type DatasetKeyQuery as KeySearchQuery, type DatasetKeyMatchRange as KeySearchMatchRange, type ParsedKeyInput as KeySearchParsedInput } from "./key-search.js";
 /** One recorded step of a scope path (host-side; mirrors the editable
  *  subset of {@link ValueTreeStepType}). */
 export type ValueTreeScopeStep = {
@@ -236,6 +238,57 @@ export declare const ValueTree: {
      * round-trippable text).
      */
     readonly keyLabel: typeof dictKeyLabel;
+    /**
+     * The ROW MODEL of an inline tree — the visible (expanded) rows of a
+     * materialized node, depth-first, with end-user labels, branch
+     * summaries and typed edit paths. Every renderer (browser, terminal)
+     * lists a value through this so it reads identically everywhere.
+     */
+    readonly flatten: typeof flattenRows;
+    /**
+     * The row model of a PAGED collection root — per-page flattened rows
+     * plus the prefix sums that place placeholder rows for unloaded pages,
+     * so the extent always spans the whole collection.
+     */
+    readonly flattenPaged: typeof flattenPaged;
+    /** Binary-searches the page whose flat range contains a flat row index. */
+    readonly pageOfFlat: typeof pageOfFlat;
+    /** Resolves a paged flat row to a loaded model or a placeholder's global root row. */
+    readonly pagedRowAt: typeof pagedRowAt;
+    /** Flat index of a global root row of a paged tree (through loaded pages when present). */
+    readonly pagedFlatIndexOfRoot: typeof pagedFlatIndexOfRoot;
+    /** Flat index of the N-th depth-0 row of an inline tree. */
+    readonly flatIndexOfRoot: typeof flatIndexOfRoot;
+    /**
+     * Drops loaded pages far from the visible window, keeping the window
+     * and then the nearest pages up to a retention cap (the same map back
+     * while under the cap).
+     */
+    readonly pruneRetainedPages: typeof pruneRetainedPages;
+    /** "flowRate" / "flow_rate" → "Flow rate" — the end-user field label. */
+    readonly humanize: typeof humanize;
+    /** The stable text identity of a node path — the row id. */
+    readonly pathKey: typeof pathKey;
+    /** A content-derived title for an array element, else "Item N". */
+    readonly itemTitle: typeof itemTitle;
+    /** The muted value-cell text of a branch node (preview / counts). */
+    readonly summaryOf: typeof summaryOf;
+    /** The children of a compound node with their labels and binding steps. */
+    readonly childrenOf: typeof childrenOf;
+    /** Formats a primitive leaf for display. */
+    readonly fmtLeaf: typeof fmtLeaf;
+    /** Rows at depth < this start expanded when the host sets no `openDepth`. */
+    readonly DEFAULT_OPEN_DEPTH: 1;
+    /**
+     * The monotone lower / upper row predicates of a RANGE key query over
+     * decoded keys in canonical order — the client-side mirror of the
+     * server's fence search, for inline values.
+     */
+    readonly keyRangePredicates: typeof keyRangePredicates;
+    /** Turns typed key-search text into a wire query, or a hint when it cannot parse. */
+    readonly parseKeyInput: typeof parseKeyInput;
+    /** Locates a key query over decoded keys — the inline `datasetFindKey`. */
+    readonly findKeyInline: typeof findKeyInline;
     readonly Types: {
         /** The full ValueTree payload. */
         readonly Root: StructType<{
@@ -394,4 +447,35 @@ export declare const ValueTree: {
         }>;
     };
 };
+/**
+ * Row-model types under the `ValueTree` namespace (declaration-merged onto
+ * the factory object; types only — nothing is emitted).
+ */
+export declare namespace ValueTree {
+    /** The types of the row model ({@link ValueTree.flatten} / {@link ValueTree.flattenPaged}). */
+    namespace Rows {
+        /** One flattened row. */
+        type RowModel = FlattenRowModel;
+        /** The kind of a flattened row. */
+        type RowKind = FlattenRowKind;
+        /** One child of a compound node with its label and binding step. */
+        type ChildEntry = FlattenChildEntry;
+        /** The shared flatten context. */
+        type FlattenCtx = FlattenContext;
+        /** A node with its option / variant wrappers collapsed into controls. */
+        type ResolvedNode = FlattenResolvedNode;
+        /** One pageable root row supplied by a paging host. */
+        type PagedRow = FlattenPagedRow;
+        /** The remote-paging contract for a collection-rooted tree. */
+        type Paging = FlattenPaging;
+        /** The paged-mode flat structure. */
+        type PagedFlat = FlattenPagedFlat;
+        /** A key query in wire form. */
+        type KeyQuery = KeySearchQuery;
+        /** Where a key query landed in the canonical key order. */
+        type KeyMatchRange = KeySearchMatchRange;
+        /** A parsed key-search input: a query, or the hint to show instead. */
+        type ParsedKeyInput = KeySearchParsedInput;
+    }
+}
 //# sourceMappingURL=index.d.ts.map