@aglyn/plugins-ai 1.0.0-beta.230 → 1.0.0-beta.232

package/src/lib/layout-language/ai-layout-store.d.ts

@@ -0,0 +1,41 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import type { NodesMap } from '@aglyn/aglyn/types/nodes';
+import { type AiNodeTreeContext } from '../runtime/ai-node-tree';
+import type { AiSurface } from '../runtime/ai-palette';
+import type { AiLayoutRawTree } from './ai-layout-tree';
+/**
+ * A compiled tree as a document stores it (AGL-3660): read by the same
+ * palette validator every generated tree passes, as a code-built tree, so
+ * what is stored is exactly what any other generated document would store.
+ * The validator mints fresh ids; the ids a caller names (a page's section
+ * roots, which its plan minted) keep their own, and the interactions code
+ * wrote — which the validator strips from anything it stores — are carried
+ * over onto the stored nodes.
+ */
+export type AiLayoutStored = {
+    ok: true;
+    nodes: NodesMap;
+    rootId: string;
+    repairs: string[];
+    /** Each compiled id → the id its node is stored under, for a node the validator kept. */
+    storedIds: Record<string, string>;
+} | {
+    ok: false;
+    error: string;
+};
+export declare function aiLayoutStoredTree(compiled: AiLayoutRawTree, surface: AiSurface, context: AiNodeTreeContext, keepIds?: readonly string[]): AiLayoutStored;

package/src/lib/layout-language/ai-layout-store.js

@@ -0,0 +1,75 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ import { _ as _extends } from "@swc/helpers/_/_extends";
+import { _ as _object_without_properties_loose } from "@swc/helpers/_/_object_without_properties_loose";
+import { validateAiNodeTree } from "../runtime/ai-node-tree.js";
+export function aiLayoutStoredTree(compiled, surface, context, keepIds = []) {
+    // The interactions are code's, carried over below; the validator is shown the rest.
+    const bare = {
+        rootId: compiled.rootId,
+        nodes: Object.fromEntries(Object.entries(compiled.nodes).map((_0)=>{
+            let [id, _ref] = _0, { interactions: _interactions } = _ref, node = _object_without_properties_loose(_ref, [
+                "interactions"
+            ]);
+            return [
+                id,
+                node
+            ];
+        }))
+    };
+    const validated = validateAiNodeTree(bare, surface, _extends({}, context, {
+        codeBuilt: true
+    }));
+    if (validated.ok === false) return {
+        ok: false,
+        error: validated.error
+    };
+    const keep = new Set(keepIds);
+    // Minted → the id it is stored under: its own, or the one the caller keeps.
+    const storedId = (minted)=>{
+        const source = validated.sourceIds[minted];
+        return source && keep.has(source) ? source : minted;
+    };
+    const nodes = {};
+    for (const [minted, raw] of Object.entries(validated.nodes)){
+        var _validated_sourceIds_minted;
+        var _source_interactions;
+        const id = storedId(minted);
+        const source = compiled.nodes[(_validated_sourceIds_minted = validated.sourceIds[minted]) != null ? _validated_sourceIds_minted : ''];
+        nodes[id] = _extends({}, raw, {
+            $id: id,
+            parentId: raw.parentId === null ? null : storedId(raw.parentId)
+        }, Array.isArray(raw.nodes) ? {
+            nodes: raw.nodes.map(storedId)
+        } : {}, (source == null ? void 0 : (_source_interactions = source.interactions) == null ? void 0 : _source_interactions.length) ? {
+            interactions: source.interactions
+        } : {});
+    }
+    const storedIds = {};
+    for (const minted of Object.keys(validated.nodes)){
+        const source = validated.sourceIds[minted];
+        if (source) storedIds[source] = storedId(minted);
+    }
+    return {
+        ok: true,
+        nodes: nodes,
+        rootId: storedId(validated.rootId),
+        repairs: validated.repairs,
+        storedIds
+    };
+}
+
+//# sourceMappingURL=ai-layout-store.js.map

package/src/lib/layout-language/ai-layout-store.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/layout-language/ai-layout-store.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { NodesMap } from '@aglyn/aglyn/types/nodes'\nimport {\n  validateAiNodeTree,\n  type AiNodeTreeContext,\n} from '../runtime/ai-node-tree'\nimport type { AiSurface } from '../runtime/ai-palette'\nimport type { AiLayoutRawTree } from './ai-layout-tree'\n\n/**\n * A compiled tree as a document stores it (AGL-3660): read by the same\n * palette validator every generated tree passes, as a code-built tree, so\n * what is stored is exactly what any other generated document would store.\n * The validator mints fresh ids; the ids a caller names (a page's section\n * roots, which its plan minted) keep their own, and the interactions code\n * wrote — which the validator strips from anything it stores — are carried\n * over onto the stored nodes.\n */\n\nexport type AiLayoutStored =\n  | {\n      ok: true\n      nodes: NodesMap\n      rootId: string\n      repairs: string[]\n      /** Each compiled id → the id its node is stored under, for a node the validator kept. */\n      storedIds: Record<string, string>\n    }\n  | { ok: false; error: string }\n\ntype StoredNode = Record<string, unknown> & {\n  $id: string\n  parentId: string | null\n  nodes?: string[]\n}\n\nexport function aiLayoutStoredTree(\n  compiled: AiLayoutRawTree,\n  surface: AiSurface,\n  context: AiNodeTreeContext,\n  keepIds: readonly string[] = [],\n): AiLayoutStored {\n  // The interactions are code's, carried over below; the validator is shown the rest.\n  const bare = {\n    rootId: compiled.rootId,\n    nodes: Object.fromEntries(\n      Object.entries(compiled.nodes).map(\n        ([id, { interactions: _interactions, ...node }]) => [id, node],\n      ),\n    ),\n  }\n  const validated = validateAiNodeTree(bare, surface, {\n    ...context,\n    codeBuilt: true,\n  })\n  if (validated.ok === false) return { ok: false, error: validated.error }\n  const keep = new Set(keepIds)\n  // Minted → the id it is stored under: its own, or the one the caller keeps.\n  const storedId = (minted: string): string => {\n    const source = validated.sourceIds[minted]\n    return source && keep.has(source) ? source : minted\n  }\n  const nodes: Record<string, StoredNode> = {}\n  for (const [minted, raw] of Object.entries(\n    validated.nodes as unknown as Record<string, StoredNode>,\n  )) {\n    const id = storedId(minted)\n    const source = compiled.nodes[validated.sourceIds[minted] ?? '']\n    nodes[id] = {\n      ...raw,\n      $id: id,\n      parentId: raw.parentId === null ? null : storedId(raw.parentId),\n      ...(Array.isArray(raw.nodes) ? { nodes: raw.nodes.map(storedId) } : {}),\n      ...(source?.interactions?.length\n        ? { interactions: source.interactions }\n        : {}),\n    }\n  }\n  const storedIds: Record<string, string> = {}\n  for (const minted of Object.keys(validated.nodes)) {\n    const source = validated.sourceIds[minted]\n    if (source) storedIds[source] = storedId(minted)\n  }\n  return {\n    ok: true,\n    nodes: nodes as unknown as NodesMap,\n    rootId: storedId(validated.rootId),\n    repairs: validated.repairs,\n    storedIds,\n  }\n}\n"],"names":["validateAiNodeTree","aiLayoutStoredTree","compiled","surface","context","keepIds","bare","rootId","nodes","Object","fromEntries","entries","map","id","interactions","_interactions","node","validated","codeBuilt","ok","error","keep","Set","storedId","minted","source","sourceIds","has","raw","$id","parentId","Array","isArray","length","storedIds","keys","repairs"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC;;AAGD,SACEA,kBAAkB,QAEb,6BAAyB;AA+BhC,OAAO,SAASC,mBACdC,QAAyB,EACzBC,OAAkB,EAClBC,OAA0B,EAC1BC,UAA6B,EAAE;IAE/B,oFAAoF;IACpF,MAAMC,OAAO;QACXC,QAAQL,SAASK,MAAM;QACvBC,OAAOC,OAAOC,WAAW,CACvBD,OAAOE,OAAO,CAACT,SAASM,KAAK,EAAEI,GAAG,CAChC;gBAAC,CAACC,SAA6C,OAAzC,EAAEC,cAAcC,aAAa,EAAW,SAANC;;;mBAAY;gBAACH;gBAAIG;aAAK;;IAGpE;IACA,MAAMC,YAAYjB,mBAAmBM,MAAMH,SAAS,aAC/CC;QACHc,WAAW;;IAEb,IAAID,UAAUE,EAAE,KAAK,OAAO,OAAO;QAAEA,IAAI;QAAOC,OAAOH,UAAUG,KAAK;IAAC;IACvE,MAAMC,OAAO,IAAIC,IAAIjB;IACrB,4EAA4E;IAC5E,MAAMkB,WAAW,CAACC;QAChB,MAAMC,SAASR,UAAUS,SAAS,CAACF,OAAO;QAC1C,OAAOC,UAAUJ,KAAKM,GAAG,CAACF,UAAUA,SAASD;IAC/C;IACA,MAAMhB,QAAoC,CAAC;IAC3C,KAAK,MAAM,CAACgB,QAAQI,IAAI,IAAInB,OAAOE,OAAO,CACxCM,UAAUT,KAAK,EACd;YAE6BS;YAMxBQ;QAPN,MAAMZ,KAAKU,SAASC;QACpB,MAAMC,SAASvB,SAASM,KAAK,EAACS,8BAAAA,UAAUS,SAAS,CAACF,OAAO,YAA3BP,8BAA+B,GAAG;QAChET,KAAK,CAACK,GAAG,GAAG,aACPe;YACHC,KAAKhB;YACLiB,UAAUF,IAAIE,QAAQ,KAAK,OAAO,OAAOP,SAASK,IAAIE,QAAQ;WAC1DC,MAAMC,OAAO,CAACJ,IAAIpB,KAAK,IAAI;YAAEA,OAAOoB,IAAIpB,KAAK,CAACI,GAAG,CAACW;QAAU,IAAI,CAAC,GACjEE,CAAAA,2BAAAA,uBAAAA,OAAQX,YAAY,qBAApBW,qBAAsBQ,MAAM,IAC5B;YAAEnB,cAAcW,OAAOX,YAAY;QAAC,IACpC,CAAC;IAET;IACA,MAAMoB,YAAoC,CAAC;IAC3C,KAAK,MAAMV,UAAUf,OAAO0B,IAAI,CAAClB,UAAUT,KAAK,EAAG;QACjD,MAAMiB,SAASR,UAAUS,SAAS,CAACF,OAAO;QAC1C,IAAIC,QAAQS,SAAS,CAACT,OAAO,GAAGF,SAASC;IAC3C;IACA,OAAO;QACLL,IAAI;QACJX,OAAOA;QACPD,QAAQgB,SAASN,UAAUV,MAAM;QACjC6B,SAASnB,UAAUmB,OAAO;QAC1BF;IACF;AACF"}

package/src/lib/layout-language/ai-layout-tree.d.ts

@@ -0,0 +1,59 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * The node map the layout language compiler writes (AGL-3660), in the shape a
+ * model's answer arrives in — `{ rootId, nodes: { id: { componentId, props,
+ * sx, nodes } } }` — so the palette validator and the doctrine read it exactly
+ * as they read any other tree, and nothing downstream knows code wrote it.
+ */
+export interface AiLayoutRawNode {
+    componentId: string;
+    props?: Record<string, unknown>;
+    sx?: Record<string, unknown>;
+    nodes?: string[];
+    /**
+     * The platform's interactions, written by code: a link to a section of its
+     * page scrolls there (AGL-3097). The palette validator strips every
+     * interaction from what it stores, so the page step carries these over
+     * onto the stored nodes after it.
+     */
+    interactions?: unknown[];
+}
+export interface AiLayoutRawTree {
+    rootId: string;
+    nodes: Record<string, AiLayoutRawNode>;
+}
+/** Elements that only frame what they hold, and so mean nothing empty. */
+export declare const AI_LAYOUT_FRAMES: ReadonlySet<string>;
+/** A node map built in document order, with ids that read in a review: `ll3-heading`. */
+export declare class AiLayoutTreeBuilder {
+    private readonly prefix;
+    readonly nodes: Record<string, AiLayoutRawNode>;
+    private count;
+    constructor(prefix?: string);
+    /** A node, with only the props, styles and children it was given; returns its id. */
+    add(componentId: string, props?: Record<string, unknown> | null, sx?: Record<string, unknown> | null, children?: readonly (string | null | undefined)[] | null, role?: string, fixedId?: string): string;
+    /**
+     * Takes out every frame left holding nothing — a card whose words were all
+     * filler, the cell that held it — from the leaves up, so no element meant
+     * to hold content is stored empty (rule 16). `keep` names the ones that
+     * stay whatever they hold.
+     */
+    prune(rootId: string, keep?: ReadonlySet<string>): void;
+    /** The tree rooted at `rootId`. */
+    tree(rootId: string): AiLayoutRawTree;
+}

package/src/lib/layout-language/ai-layout-tree.js

@@ -0,0 +1,84 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /**
+ * The node map the layout language compiler writes (AGL-3660), in the shape a
+ * model's answer arrives in — `{ rootId, nodes: { id: { componentId, props,
+ * sx, nodes } } }` — so the palette validator and the doctrine read it exactly
+ * as they read any other tree, and nothing downstream knows code wrote it.
+ */ import { _ as _extends } from "@swc/helpers/_/_extends";
+/** Elements that only frame what they hold, and so mean nothing empty. */ export const AI_LAYOUT_FRAMES = new Set([
+    'muiStack',
+    'muiBox',
+    'muiGrid',
+    'muiCard',
+    'muiCardContent',
+    'muiContainer',
+    'muiList',
+    'muiListItem',
+    'muiAccordion',
+    'muiAccordionDetails',
+    'muiDrawer',
+    'section'
+]);
+/** A node map built in document order, with ids that read in a review: `ll3-heading`. */ export class AiLayoutTreeBuilder {
+    /** A node, with only the props, styles and children it was given; returns its id. */ add(componentId, props, sx, children, role = componentId, fixedId) {
+        this.count += 1;
+        const id = fixedId != null ? fixedId : `${this.prefix}${this.count}-${role.replace(/[^A-Za-z0-9]/g, '').slice(0, 16)}`;
+        const node = {
+            componentId
+        };
+        const kept = props ? Object.fromEntries(Object.entries(props).filter(([, value])=>value !== undefined)) : {};
+        if (Object.keys(kept).length) node.props = kept;
+        if (sx && Object.keys(sx).length) node.sx = _extends({}, sx);
+        const list = (children != null ? children : []).filter((child)=>typeof child === 'string');
+        if (list.length) node.nodes = list;
+        this.nodes[id] = node;
+        return id;
+    }
+    /**
+   * Takes out every frame left holding nothing — a card whose words were all
+   * filler, the cell that held it — from the leaves up, so no element meant
+   * to hold content is stored empty (rule 16). `keep` names the ones that
+   * stay whatever they hold.
+   */ prune(rootId, keep = new Set()) {
+        const visit = (id)=>{
+            var _node_nodes;
+            const node = this.nodes[id];
+            if (!node) return false;
+            if (node.nodes) {
+                node.nodes = node.nodes.filter(visit);
+                if (!node.nodes.length) delete node.nodes;
+            }
+            if (id === rootId || keep.has(id) || ((_node_nodes = node.nodes) == null ? void 0 : _node_nodes.length) || !AI_LAYOUT_FRAMES.has(node.componentId)) return true;
+            delete this.nodes[id];
+            return false;
+        };
+        visit(rootId);
+    }
+    /** The tree rooted at `rootId`. */ tree(rootId) {
+        return {
+            rootId,
+            nodes: this.nodes
+        };
+    }
+    constructor(prefix = 'll'){
+        this.prefix = prefix;
+        this.nodes = {};
+        this.count = 0;
+    }
+}
+
+//# sourceMappingURL=ai-layout-tree.js.map

package/src/lib/layout-language/ai-layout-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/layout-language/ai-layout-tree.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * The node map the layout language compiler writes (AGL-3660), in the shape a\n * model's answer arrives in — `{ rootId, nodes: { id: { componentId, props,\n * sx, nodes } } }` — so the palette validator and the doctrine read it exactly\n * as they read any other tree, and nothing downstream knows code wrote it.\n */\n\nexport interface AiLayoutRawNode {\n  componentId: string\n  props?: Record<string, unknown>\n  sx?: Record<string, unknown>\n  nodes?: string[]\n  /**\n   * The platform's interactions, written by code: a link to a section of its\n   * page scrolls there (AGL-3097). The palette validator strips every\n   * interaction from what it stores, so the page step carries these over\n   * onto the stored nodes after it.\n   */\n  interactions?: unknown[]\n}\n\nexport interface AiLayoutRawTree {\n  rootId: string\n  nodes: Record<string, AiLayoutRawNode>\n}\n\n/** Elements that only frame what they hold, and so mean nothing empty. */\nexport const AI_LAYOUT_FRAMES: ReadonlySet<string> = new Set([\n  'muiStack',\n  'muiBox',\n  'muiGrid',\n  'muiCard',\n  'muiCardContent',\n  'muiContainer',\n  'muiList',\n  'muiListItem',\n  'muiAccordion',\n  'muiAccordionDetails',\n  'muiDrawer',\n  'section',\n])\n\n/** A node map built in document order, with ids that read in a review: `ll3-heading`. */\nexport class AiLayoutTreeBuilder {\n  readonly nodes: Record<string, AiLayoutRawNode> = {}\n  private count = 0\n\n  constructor(private readonly prefix = 'll') {}\n\n  /** A node, with only the props, styles and children it was given; returns its id. */\n  add(\n    componentId: string,\n    props?: Record<string, unknown> | null,\n    sx?: Record<string, unknown> | null,\n    children?: readonly (string | null | undefined)[] | null,\n    role = componentId,\n    fixedId?: string,\n  ): string {\n    this.count += 1\n    const id =\n      fixedId ??\n      `${this.prefix}${this.count}-${role.replace(/[^A-Za-z0-9]/g, '').slice(0, 16)}`\n    const node: AiLayoutRawNode = { componentId }\n    const kept = props\n      ? Object.fromEntries(\n          Object.entries(props).filter(([, value]) => value !== undefined),\n        )\n      : {}\n    if (Object.keys(kept).length) node.props = kept\n    if (sx && Object.keys(sx).length) node.sx = { ...sx }\n    const list = (children ?? []).filter(\n      (child): child is string => typeof child === 'string',\n    )\n    if (list.length) node.nodes = list\n    this.nodes[id] = node\n    return id\n  }\n\n  /**\n   * Takes out every frame left holding nothing — a card whose words were all\n   * filler, the cell that held it — from the leaves up, so no element meant\n   * to hold content is stored empty (rule 16). `keep` names the ones that\n   * stay whatever they hold.\n   */\n  prune(rootId: string, keep: ReadonlySet<string> = new Set()): void {\n    const visit = (id: string): boolean => {\n      const node = this.nodes[id]\n      if (!node) return false\n      if (node.nodes) {\n        node.nodes = node.nodes.filter(visit)\n        if (!node.nodes.length) delete node.nodes\n      }\n      if (\n        id === rootId ||\n        keep.has(id) ||\n        node.nodes?.length ||\n        !AI_LAYOUT_FRAMES.has(node.componentId)\n      )\n        return true\n      delete this.nodes[id]\n      return false\n    }\n    visit(rootId)\n  }\n\n  /** The tree rooted at `rootId`. */\n  tree(rootId: string): AiLayoutRawTree {\n    return { rootId, nodes: this.nodes }\n  }\n}\n"],"names":["AI_LAYOUT_FRAMES","Set","AiLayoutTreeBuilder","add","componentId","props","sx","children","role","fixedId","count","id","prefix","replace","slice","node","kept","Object","fromEntries","entries","filter","value","undefined","keys","length","list","child","nodes","prune","rootId","keep","visit","has","tree"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;CAKC;AAqBD,wEAAwE,GACxE,OAAO,MAAMA,mBAAwC,IAAIC,IAAI;IAC3D;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;CACD,EAAC;AAEF,uFAAuF,GACvF,OAAO,MAAMC;IAMX,mFAAmF,GACnFC,IACEC,WAAmB,EACnBC,KAAsC,EACtCC,EAAmC,EACnCC,QAAwD,EACxDC,OAAOJ,WAAW,EAClBK,OAAgB,EACR;QACR,IAAI,CAACC,KAAK,IAAI;QACd,MAAMC,KACJF,kBAAAA,UACA,GAAG,IAAI,CAACG,MAAM,GAAG,IAAI,CAACF,KAAK,CAAC,CAAC,EAAEF,KAAKK,OAAO,CAAC,iBAAiB,IAAIC,KAAK,CAAC,GAAG,KAAK;QACjF,MAAMC,OAAwB;YAAEX;QAAY;QAC5C,MAAMY,OAAOX,QACTY,OAAOC,WAAW,CAChBD,OAAOE,OAAO,CAACd,OAAOe,MAAM,CAAC,CAAC,GAAGC,MAAM,GAAKA,UAAUC,cAExD,CAAC;QACL,IAAIL,OAAOM,IAAI,CAACP,MAAMQ,MAAM,EAAET,KAAKV,KAAK,GAAGW;QAC3C,IAAIV,MAAMW,OAAOM,IAAI,CAACjB,IAAIkB,MAAM,EAAET,KAAKT,EAAE,GAAG,aAAKA;QACjD,MAAMmB,OAAO,CAAClB,mBAAAA,WAAY,EAAE,EAAEa,MAAM,CAClC,CAACM,QAA2B,OAAOA,UAAU;QAE/C,IAAID,KAAKD,MAAM,EAAET,KAAKY,KAAK,GAAGF;QAC9B,IAAI,CAACE,KAAK,CAAChB,GAAG,GAAGI;QACjB,OAAOJ;IACT;IAEA;;;;;GAKC,GACDiB,MAAMC,MAAc,EAAEC,OAA4B,IAAI7B,KAAK,EAAQ;QACjE,MAAM8B,QAAQ,CAACpB;gBAUXI;YATF,MAAMA,OAAO,IAAI,CAACY,KAAK,CAAChB,GAAG;YAC3B,IAAI,CAACI,MAAM,OAAO;YAClB,IAAIA,KAAKY,KAAK,EAAE;gBACdZ,KAAKY,KAAK,GAAGZ,KAAKY,KAAK,CAACP,MAAM,CAACW;gBAC/B,IAAI,CAAChB,KAAKY,KAAK,CAACH,MAAM,EAAE,OAAOT,KAAKY,KAAK;YAC3C;YACA,IACEhB,OAAOkB,UACPC,KAAKE,GAAG,CAACrB,SACTI,cAAAA,KAAKY,KAAK,qBAAVZ,YAAYS,MAAM,KAClB,CAACxB,iBAAiBgC,GAAG,CAACjB,KAAKX,WAAW,GAEtC,OAAO;YACT,OAAO,IAAI,CAACuB,KAAK,CAAChB,GAAG;YACrB,OAAO;QACT;QACAoB,MAAMF;IACR;IAEA,iCAAiC,GACjCI,KAAKJ,MAAc,EAAmB;QACpC,OAAO;YAAEA;YAAQF,OAAO,IAAI,CAACA,KAAK;QAAC;IACrC;IA7DA,YAAY,AAAiBf,SAAS,IAAI,CAAE;aAAfA,SAAAA;aAHpBe,QAAyC,CAAC;aAC3CjB,QAAQ;IAE6B;AA8D/C"}

package/src/lib/lazy-widget.d.ts

@@ -0,0 +1,45 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { type ComponentType, type ReactNode } from 'react';
+/**
+ * A component registered by name whose code loads the first time it is
+ * drawn. `load` resolves to the component itself — the module's export —
+ * so a spec can hold a registration to the component it stands for.
+ */
+export type LazyWidget<P = any> = ComponentType<P> & {
+    load: () => Promise<ComponentType<P>>;
+};
+/**
+ * Registers a component without loading it (AGL-3649).
+ *
+ * The console loads this plugin on every screen, because it fills the dock
+ * and the top bar, so anything `plugin.ts` imports statically is downloaded
+ * by every reader of every page, whichever card it is. A registration needs
+ * only a name and a component to call; this hands the registry a small
+ * stand-in that imports the real one when the shell first draws it.
+ *
+ * The stand-in carries its own `Suspense`. The shell's zones draw widgets
+ * with no boundary of their own, and the dock and the top bar sit above every
+ * route's boundary, so a bare `React.lazy` there would suspend the shell
+ * itself while one card's code arrived. Here the wait is the card's alone:
+ * it draws `fallback` (nothing, unless the caller says otherwise) in its own
+ * place, which is what a widget held by a gate already draws.
+ *
+ * Every gate stays on the registration — feature flag, permission, release
+ * flag — so a widget the shell withholds is never drawn and never loaded.
+ */
+export declare function lazyWidget<P extends object>(name: string, load: () => Promise<ComponentType<P>>, fallback?: ReactNode): LazyWidget<P>;

package/src/lib/lazy-widget.js

@@ -0,0 +1,53 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ 'use client';
+import { _ as _extends } from "@swc/helpers/_/_extends";
+import { jsx as _jsx } from "react/jsx-runtime";
+import { Suspense, lazy } from "react";
+/**
+ * Registers a component without loading it (AGL-3649).
+ *
+ * The console loads this plugin on every screen, because it fills the dock
+ * and the top bar, so anything `plugin.ts` imports statically is downloaded
+ * by every reader of every page, whichever card it is. A registration needs
+ * only a name and a component to call; this hands the registry a small
+ * stand-in that imports the real one when the shell first draws it.
+ *
+ * The stand-in carries its own `Suspense`. The shell's zones draw widgets
+ * with no boundary of their own, and the dock and the top bar sit above every
+ * route's boundary, so a bare `React.lazy` there would suspend the shell
+ * itself while one card's code arrived. Here the wait is the card's alone:
+ * it draws `fallback` (nothing, unless the caller says otherwise) in its own
+ * place, which is what a widget held by a gate already draws.
+ *
+ * Every gate stays on the registration — feature flag, permission, release
+ * flag — so a widget the shell withholds is never drawn and never loaded.
+ */ export function lazyWidget(name, load, fallback = null) {
+    let loading;
+    const loadOnce = ()=>loading != null ? loading : loading = load();
+    const Loaded = /*#__PURE__*/ lazy(()=>loadOnce().then((Component)=>({
+                default: Component
+            })));
+    const Widget = (props)=>/*#__PURE__*/ _jsx(Suspense, {
+            fallback: fallback,
+            children: /*#__PURE__*/ _jsx(Loaded, _extends({}, props))
+        });
+    Widget.displayName = name;
+    Widget.load = loadOnce;
+    return Widget;
+}
+
+//# sourceMappingURL=lazy-widget.js.map

package/src/lib/lazy-widget.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/plugins/ai/src/lib/lazy-widget.tsx"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n'use client'\n\nimport { Suspense, lazy, type ComponentType, type ReactNode } from 'react'\n\n/**\n * A component registered by name whose code loads the first time it is\n * drawn. `load` resolves to the component itself — the module's export —\n * so a spec can hold a registration to the component it stands for.\n */\nexport type LazyWidget<P = any> = ComponentType<P> & {\n  load: () => Promise<ComponentType<P>>\n}\n\n/**\n * Registers a component without loading it (AGL-3649).\n *\n * The console loads this plugin on every screen, because it fills the dock\n * and the top bar, so anything `plugin.ts` imports statically is downloaded\n * by every reader of every page, whichever card it is. A registration needs\n * only a name and a component to call; this hands the registry a small\n * stand-in that imports the real one when the shell first draws it.\n *\n * The stand-in carries its own `Suspense`. The shell's zones draw widgets\n * with no boundary of their own, and the dock and the top bar sit above every\n * route's boundary, so a bare `React.lazy` there would suspend the shell\n * itself while one card's code arrived. Here the wait is the card's alone:\n * it draws `fallback` (nothing, unless the caller says otherwise) in its own\n * place, which is what a widget held by a gate already draws.\n *\n * Every gate stays on the registration — feature flag, permission, release\n * flag — so a widget the shell withholds is never drawn and never loaded.\n */\nexport function lazyWidget<P extends object>(\n  name: string,\n  load: () => Promise<ComponentType<P>>,\n  fallback: ReactNode = null,\n): LazyWidget<P> {\n  let loading: Promise<ComponentType<P>> | undefined\n  const loadOnce = () => (loading ??= load())\n  const Loaded = lazy(() =>\n    loadOnce().then((Component) => ({ default: Component })),\n  )\n  const Widget = (props: P) => (\n    <Suspense fallback={fallback}>\n      <Loaded {...(props as any)} />\n    </Suspense>\n  )\n  Widget.displayName = name\n  Widget.load = loadOnce\n  return Widget\n}\n"],"names":["Suspense","lazy","lazyWidget","name","load","fallback","loading","loadOnce","Loaded","then","Component","default","Widget","props","displayName"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;AAEA,SAASA,QAAQ,EAAEC,IAAI,QAA4C,QAAO;AAW1E;;;;;;;;;;;;;;;;;;CAkBC,GACD,OAAO,SAASC,WACdC,IAAY,EACZC,IAAqC,EACrCC,WAAsB,IAAI;IAE1B,IAAIC;IACJ,MAAMC,WAAW,IAAOD,kBAAAA,UAAAA,UAAYF;IACpC,MAAMI,uBAASP,KAAK,IAClBM,WAAWE,IAAI,CAAC,CAACC,YAAe,CAAA;gBAAEC,SAASD;YAAU,CAAA;IAEvD,MAAME,SAAS,CAACC,sBACd,KAACb;YAASK,UAAUA;sBAClB,cAAA,KAACG,qBAAYK;;IAGjBD,OAAOE,WAAW,GAAGX;IACrBS,OAAOR,IAAI,GAAGG;IACd,OAAOK;AACT"}

package/src/lib/model/ai-build-job.js

@@ -439,7 +439,8 @@ const OPEN = [
                 attemptCredits: 0,
                 failure: null,
                 note: null,
-                degradedBy: []
+                degradedBy: [],
+                settledAt: null
             });
         }
         if (row.status === 'degraded' && downstream.has(row.slot) && row.outputs.length) {

package/src/lib/model/ai-build-job.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/model/ai-build-job.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  pluginAiCapabilityArgsProblems,\n  type PluginAiCapability,\n} from '@aglyn/aglyn/plugin-manager/plugin-ai-capabilities'\nimport {\n  AI_PLAN_NEW_REF_PREFIX,\n  isAiPlanNewRef,\n  type AiBuildItem,\n  type AiBuildPlan,\n  type AiBuildPlanCreate,\n  type AiBuildPlanCreateKind,\n  type AiBuildPlanScreen,\n} from './ai-build-plan'\nimport type { AiJobItemLedger, AiJobItemStatus } from './ai-jobs.types'\nimport { AI_SITE_MAX_SECTIONS, AI_SITE_PASS_CREDITS, aiJobPlanCreditEstimate } from './ai-site-job'\n\n/**\n * What a `build` job is (AGL-3616): one request — \"a few pages, a contact\n * form and a way to book me\" — planned as creations, pages and items, built\n * one UNIT a pass in dependency order, and settled ITEM BY ITEM.\n *\n * A build is a generalized site scaffold. Every unit is handed to what\n * already builds that kind of thing — a page to the page step, a form to the\n * form step, another plugin's resource to that plugin's draft writer — so a\n * build cannot drift from what it builds. What is new is the settlement: one\n * failed unit does not end the job. It gives back its own spend, the units\n * that depended on it are built without it (or skipped, when they cannot\n * stand without it), and the job is `done` when anything was delivered.\n *\n * This module is the build's MODEL — its units, their order, how a failure\n * travels to what depends on it, what it is estimated to cost, and the\n * ledger arithmetic — and does no I/O, so the step, the machine, the doors\n * and the console read one vocabulary.\n */\n\n/** How much one build holds: what one proposal can describe and one person can read. */\nexport const AI_BUILD_LIMITS = {\n  /** Creations, pages and items together. */\n  units: 16,\n  pages: 8,\n  /** A Free workspace's pages. */\n  freePages: 2,\n} as const\n\n/** What a build creates through its `create` list; everything else beyond pages is an item. */\nexport const AI_BUILD_CREATE_KINDS: readonly AiBuildPlanCreateKind[] = ['layout', 'form', 'component', 'email']\n\n/**\n * The operations a build plans through `create` and `screens` rather than\n * `items`: an item naming one is a plan that put it in the wrong list.\n */\nexport const AI_BUILD_STRUCTURAL_OPS: readonly string[] = ['page', ...AI_BUILD_CREATE_KINDS]\n\n/** The job input a build's Assist proposal sets when the brief asked to publish. */\nexport const AI_BUILD_PUBLISH_INPUT = 'publish'\n\n/** A unit of a build: a creation, a page, or an item. */\nexport interface AiBuildUnit {\n  slot: string\n  /** The capability operation that builds it. */\n  op: string\n  label: string\n  creation?: AiBuildPlanCreate\n  screen?: AiBuildPlanScreen\n  item?: AiBuildItem\n  /** The slots it is built after, in plan order. */\n  deps: string[]\n}\n\n/** The operation a creation is built as. */\nfunction creationOp(creation: AiBuildPlanCreate): string {\n  return creation.kind\n}\n\n/** A plan's `new:<name>` names, each to the slot that builds it. */\nfunction namedSlots(plan: AiBuildPlan): Map<string, string> {\n  const slots = new Map<string, string>()\n  plan.create.forEach((creation, index) => {\n    if (AI_BUILD_CREATE_KINDS.includes(creation.kind)) slots.set(creation.name.toLowerCase(), `c${index}`)\n  })\n  for (const item of plan.items ?? []) slots.set(item.name.toLowerCase(), item.slot)\n  return slots\n}\n\n/** The name a `new:<name>` reference gives, lowercased. */\nexport function aiBuildRefName(ref: string): string {\n  return ref.slice(AI_PLAN_NEW_REF_PREFIX.length).trim().toLowerCase()\n}\n\n/** Every reference a page makes: its layout, template, starting page and what its sections place. */\nexport function aiBuildScreenRefs(screen: AiBuildPlanScreen): string[] {\n  return [\n    screen.layout,\n    screen.template,\n    screen.duplicateOf,\n    ...screen.sections.flatMap((section) => section.uses),\n  ].filter((ref): ref is string => typeof ref === 'string' && ref.length > 0)\n}\n\n/**\n * The units a plan implies, in plan order: creations, then items, then\n * pages — the order a member reads them in, and the one a page that places\n * a creation or an item is built after anyway. `aiBuildOrder` sorts them on\n * their dependencies.\n */\nexport function aiBuildUnits(plan: AiBuildPlan): AiBuildUnit[] {\n  const slots = namedSlots(plan)\n  const depsOf = (refs: readonly (string | null)[], self: string): string[] => {\n    const deps: string[] = []\n    for (const ref of refs) {\n      if (!isAiPlanNewRef(ref)) continue\n      const slot = slots.get(aiBuildRefName(ref))\n      if (slot && slot !== self && !deps.includes(slot)) deps.push(slot)\n    }\n    return deps\n  }\n  const units: AiBuildUnit[] = []\n  plan.create.forEach((creation, index) => {\n    if (!AI_BUILD_CREATE_KINDS.includes(creation.kind)) return\n    const slot = `c${index}`\n    units.push({ slot, op: creationOp(creation), label: creation.name, creation, deps: depsOf([creation.duplicateOf], slot) })\n  })\n  for (const item of plan.items ?? []) {\n    units.push({ slot: item.slot, op: item.op, label: item.name, item, deps: depsOf(item.dependsOn, item.slot) })\n  }\n  plan.screens.forEach((screen, index) => {\n    const slot = `p${index}`\n    units.push({ slot, op: 'page', label: screen.title, screen, deps: depsOf(aiBuildScreenRefs(screen), slot) })\n  })\n  return units\n}\n\n/**\n * The units in an order that builds every dependency before what depends on\n * it, plan order otherwise; `null` when the dependencies hold a cycle.\n */\nexport function aiBuildOrder(units: readonly AiBuildUnit[]): AiBuildUnit[] | null {\n  const ordered: AiBuildUnit[] = []\n  const placed = new Set<string>()\n  const known = new Set(units.map((unit) => unit.slot))\n  while (ordered.length < units.length) {\n    const next = units.find(\n      (unit) => !placed.has(unit.slot) && unit.deps.every((dep) => placed.has(dep) || !known.has(dep)),\n    )\n    if (!next) return null\n    ordered.push(next)\n    placed.add(next.slot)\n  }\n  return ordered\n}\n\n/**\n * What is wrong with a plan's references as a build reads them: a\n * `new:<name>` an item depends on that nothing in the plan makes, and a\n * cycle. Each is a sentence the plan's one re-ask carries.\n */\nexport function aiBuildGraphProblems(plan: AiBuildPlan): string[] {\n  const problems: string[] = []\n  const slots = namedSlots(plan)\n  for (const item of plan.items ?? []) {\n    for (const ref of item.dependsOn) {\n      if (!isAiPlanNewRef(ref)) continue\n      if (!slots.has(aiBuildRefName(ref))) {\n        problems.push(`The item \"${item.name}\" depends on ${ref}, which the plan never makes. Declare it, or take it out of dependsOn.`)\n      } else if (aiBuildRefName(ref) === item.name.toLowerCase()) {\n        problems.push(`The item \"${item.name}\" depends on itself. Take it out of its own dependsOn.`)\n      }\n    }\n  }\n  if (!aiBuildOrder(aiBuildUnits(plan))) {\n    problems.push('The plan’s dependencies go round in a circle, so nothing in the circle can be built first. Make one of them depend on nothing.')\n  }\n  return problems\n}\n\n/** The operations a build may plan, as the registry and the gates left them, by op. */\nexport type AiBuildOps = ReadonlyMap<string, PluginAiCapability>\n\n/** How many pages a build may hold on this workspace. */\nexport function aiBuildPageLimit(freeTaste: boolean | null | undefined): number {\n  return freeTaste ? AI_BUILD_LIMITS.freePages : AI_BUILD_LIMITS.pages\n}\n\n/**\n * Why a build cannot build a plan of this shape, in a sentence a member\n * reads; `null` when it can. Held to the plan with the one re-ask (the plan\n * step's scope), and again by the doors before a confirmed plan runs.\n * `ops` is what may be planned on this site; absent, items are not judged\n * against the registry (a console reading a kept plan).\n */\nexport function aiBuildPlanShapeRefusal(\n  plan: AiBuildPlan,\n  options: { freeTaste?: boolean; ops?: AiBuildOps } = {},\n): string | null {\n  const units = aiBuildUnits(plan)\n  if (!units.length) return 'This plan builds nothing. Describe what to build again.'\n  if (units.length > AI_BUILD_LIMITS.units) {\n    return `This plan builds ${units.length} things, and one build holds ${AI_BUILD_LIMITS.units}. Ask for the rest in a second request.`\n  }\n  const pages = aiBuildPageLimit(options.freeTaste)\n  if (plan.screens.length > pages) {\n    return options.freeTaste\n      ? `This plan builds ${plan.screens.length} pages, and a Free workspace's build makes at most ${pages}. Paid plans can build more.`\n      : `This plan builds ${plan.screens.length} pages, and one build makes at most ${pages}.`\n  }\n  const slugs = new Set<string>()\n  for (const screen of plan.screens) {\n    if (!screen.sections.length) return `The page “${screen.title}” has no sections to build.`\n    if (screen.sections.length > AI_SITE_MAX_SECTIONS) {\n      return `The page “${screen.title}” has ${screen.sections.length} sections, and a built page holds ${AI_SITE_MAX_SECTIONS}.`\n    }\n    const slug = screen.slug.trim().toLowerCase()\n    if (slugs.has(slug)) return `Two pages in this plan share the address ${screen.slug}.`\n    slugs.add(slug)\n  }\n  for (const creation of plan.create) {\n    if (!AI_BUILD_CREATE_KINDS.includes(creation.kind)) {\n      return `A build does not create ${creation.kind === 'theme-change' ? 'theme changes' : `${creation.kind}s`} (“${creation.name}”). Take it out of create.`\n    }\n  }\n  const graph = aiBuildGraphProblems(plan)\n  if (graph.length) return graph[0]\n  const ops = options.ops\n  const counts = new Map<string, number>()\n  for (const unit of units) counts.set(unit.op, (counts.get(unit.op) ?? 0) + 1)\n  for (const item of plan.items ?? []) {\n    if (AI_BUILD_STRUCTURAL_OPS.includes(item.op)) {\n      return item.op === 'page'\n        ? `“${item.name}” is a page: plan it in screens, not items.`\n        : `“${item.name}” is ${item.op === 'email' ? 'an' : 'a'} ${item.op}: plan it in create, not items.`\n    }\n    if (!ops) continue\n    const capability = ops.get(item.op)\n    if (!capability) return `Nothing on this site can make “${item.name}” (${item.op}). Take it out of items.`\n    if (options.freeTaste && !capability.freeAllowed) {\n      return `A Free workspace cannot have ${aiArticle(capability.noun)} made (“${item.name}”). Take it out of items.`\n    }\n    const problems = pluginAiCapabilityArgsProblems(capability.argsSchema, item.args)\n    if (problems.length) return `The arguments of “${item.name}” do not read: ${problems.join('; ')}.`\n  }\n  if (ops) {\n    for (const [op, count] of counts) {\n      const capability = ops.get(op)\n      if (capability && count > capability.maxPerPlan) {\n        return `This plan makes ${count} of “${capability.noun}”, and one build makes at most ${capability.maxPerPlan}.`\n      }\n    }\n  }\n  return null\n}\n\n/** \"a booking service\", \"an email design\". */\nexport function aiArticle(noun: string): string {\n  return `${/^[aeiou]/i.test(noun) ? 'an' : 'a'} ${noun}`\n}\n\n/** The passes one unit is estimated at: a page's sections and its listing, one for a creation. */\nfunction unitPasses(unit: AiBuildUnit): number {\n  if (unit.screen) return unit.screen.sections.length + 1\n  return 1\n}\n\n/**\n * About what one unit costs, in credits: a page or a creation by the passes\n * it implies at the nominal credits a pass is held against, as a site's are;\n * an item by its capability's own estimate, recorded on the plan when it was\n * kept.\n */\nexport function aiBuildUnitCreditEstimate(unit: AiBuildUnit, ops?: AiBuildOps): number {\n  if (unit.item) {\n    if (typeof unit.item.credits === 'number') return unit.item.credits\n    const capability = ops?.get(unit.item.op)\n    if (capability) return Math.max(0, Math.floor(capability.estimateCredits(unit.item.args)))\n    return AI_SITE_PASS_CREDITS\n  }\n  return unitPasses(unit) * AI_SITE_PASS_CREDITS\n}\n\n/**\n * About what a build costs, in credits: every unit's estimate, or only the\n * units named in `slots` — what Try again shows. The ceiling a member\n * confirms; the meter charges what actually runs.\n */\nexport function aiBuildCreditEstimate(\n  plan: AiBuildPlan,\n  options: { ops?: AiBuildOps; slots?: ReadonlySet<string> } = {},\n): number {\n  return aiBuildUnits(plan)\n    .filter((unit) => !options.slots || options.slots.has(unit.slot))\n    .reduce((total, unit) => total + aiBuildUnitCreditEstimate(unit, options.ops), 0)\n}\n\n/**\n * About what a job of this kind costs to build from its plan: a build's\n * units, every other planned kind as `aiJobPlanCreditEstimate` counts it.\n */\nexport function aiJobCreditEstimate(kind: string, plan: AiBuildPlan): number {\n  return kind === 'build' ? aiBuildCreditEstimate(plan) : aiJobPlanCreditEstimate(kind, plan)\n}\n\n/** A fresh ledger: one pending row per unit, first attempt. */\nexport function aiBuildInitialLedger(units: readonly AiBuildUnit[]): AiJobItemLedger[] {\n  return units.map((unit) => ({\n    slot: unit.slot,\n    op: unit.op,\n    label: unit.label,\n    status: 'pending',\n    attempt: 1,\n    creditsSpent: 0,\n    attemptCredits: 0,\n    creditsRefunded: 0,\n    failure: null,\n    outputs: [],\n  }))\n}\n\nconst OPEN: readonly AiJobItemStatus[] = ['pending', 'running']\n\n/** Whether an item is still to be built. */\nexport function aiBuildItemOpen(row: Pick<AiJobItemLedger, 'status'>): boolean {\n  return OPEN.includes(row.status)\n}\n\n/** Whether an item delivered: built as planned, or built without something that failed. */\nexport function aiBuildItemDelivered(row: Pick<AiJobItemLedger, 'status'>): boolean {\n  return row.status === 'succeeded' || row.status === 'degraded'\n}\n\n/**\n * The next unit to build: the first in build order whose row is still open.\n * Its dependencies come before it, so by then each is settled one way or the\n * other. `null` when nothing is left.\n */\nexport function aiBuildNextUnit(\n  ordered: readonly AiBuildUnit[],\n  ledger: readonly AiJobItemLedger[],\n): AiBuildUnit | null {\n  const rows = new Map(ledger.map((row) => [row.slot, row]))\n  return ordered.find((unit) => {\n    const row = rows.get(unit.slot)\n    return !row || aiBuildItemOpen(row)\n  }) ?? null\n}\n\n/** How a unit is built given what its dependencies came to. */\nexport interface AiBuildDegradation {\n  /** The unit is not built at all, with the sentence why; nothing is spent. */\n  skip: string | null\n  /** The failed dependencies that change how it is built. */\n  degradedBy: string[]\n  /** What the person reads about the change; one per failed dependency. */\n  notes: string[]\n  /** `new:<name>` references (lowercased names) to leave out. */\n  dropped: Set<string>\n  /** Brief lines for the unit's own job: what to leave out, and what to place. */\n  briefLines: string[]\n}\n\n/**\n * How a unit is built when some of what it depends on failed (AGL-3616).\n *\n * A PAGE is always built: a failed layout falls back to the site's own, a\n * failed form or component is left out of its section, and a failed item a\n * section places (a booking service) takes its block out of the page — each\n * with a note. Any OTHER unit whose dependency failed is skipped when that\n * dependency's capability says `omit` (a campaign whose email design failed\n * has nothing to send), and built without it when it says `fallback`.\n */\nexport function aiBuildDegradation(\n  unit: AiBuildUnit,\n  context: {\n    units: readonly AiBuildUnit[]\n    ledger: readonly AiJobItemLedger[]\n    ops?: AiBuildOps\n  },\n): AiBuildDegradation {\n  const rows = new Map(context.ledger.map((row) => [row.slot, row]))\n  const bySlot = new Map(context.units.map((one) => [one.slot, one]))\n  const result: AiBuildDegradation = { skip: null, degradedBy: [], notes: [], dropped: new Set(), briefLines: [] }\n  for (const slot of unit.deps) {\n    const dep = bySlot.get(slot)\n    const row = rows.get(slot)\n    if (!dep || !row || aiBuildItemDelivered(row)) continue\n    const noun = dep.creation\n      ? aiBuildCreationNoun(dep.creation.kind)\n      : (context.ops?.get(dep.op)?.noun ?? dep.op)\n    const capability = dep.item ? context.ops?.get(dep.op) : undefined\n    const degrade = dep.item?.degrade ?? capability?.degrade ?? (dep.creation?.kind === 'layout' ? 'fallback' : 'omit')\n    if (!unit.screen && degrade === 'omit') {\n      result.skip = `Not built: the ${noun} “${dep.label}” it needs could not be created.`\n      result.degradedBy.push(slot)\n      return result\n    }\n    result.degradedBy.push(slot)\n    result.dropped.add(dep.label.toLowerCase())\n    if (dep.creation?.kind === 'layout') {\n      result.notes.push(`Built inside the site’s own layout: the layout “${dep.label}” could not be created.`)\n      continue\n    }\n    if (unit.screen) {\n      const section = unit.screen.sections.find((one) =>\n        one.uses.some((ref) => isAiPlanNewRef(ref) && aiBuildRefName(ref) === dep.label.toLowerCase()),\n      )\n      const blocks = capability?.pageBlocks?.length ? ` the ${capability.pageBlocks.join(' or ')} block` : ''\n      result.notes.push(\n        `Built without${blocks || ` the ${noun}`}: the ${noun} “${dep.label}” could not be created.`,\n      )\n      result.briefLines.push(\n        `${section ? `Build the “${section.name}” section` : 'Build the page'} without the ${noun} “${dep.label}”${blocks ? ` and without${blocks}` : ''}: it could not be created.`,\n      )\n    } else {\n      result.notes.push(`Built without the ${noun} “${dep.label}”: it could not be created.`)\n    }\n  }\n  return result\n}\n\n/** What each creation is called in a note. */\nexport function aiBuildCreationNoun(kind: AiBuildPlanCreateKind): string {\n  return kind === 'email' ? 'email design' : kind === 'theme-change' ? 'theme change' : kind\n}\n\n/**\n * The brief lines a page is told about the items its sections place and\n * that were built: the block to put there, in the owner's words.\n */\nexport function aiBuildPlacedItemLines(\n  unit: AiBuildUnit,\n  context: { units: readonly AiBuildUnit[]; ledger: readonly AiJobItemLedger[]; ops?: AiBuildOps },\n): string[] {\n  if (!unit.screen) return []\n  const rows = new Map(context.ledger.map((row) => [row.slot, row]))\n  const lines: string[] = []\n  for (const section of unit.screen.sections) {\n    for (const ref of section.uses) {\n      if (!isAiPlanNewRef(ref)) continue\n      const dep = context.units.find((one) => one.item && one.item.name.toLowerCase() === aiBuildRefName(ref))\n      if (!dep?.item) continue\n      const row = rows.get(dep.slot)\n      if (!row || !aiBuildItemDelivered(row)) continue\n      const capability = context.ops?.get(dep.op)\n      const blocks = capability?.pageBlocks ?? []\n      if (!blocks.length) continue\n      lines.push(\n        `In the “${section.name}” section, place the ${blocks.join(' or ')} block for the ${capability?.noun ?? dep.op} “${dep.label}”.`,\n      )\n    }\n  }\n  return lines\n}\n\n/** What a build came to: whether anything was delivered, and whether anything is left. */\nexport function aiBuildSettlement(ledger: readonly AiJobItemLedger[]): {\n  delivered: boolean\n  open: boolean\n  failed: number\n} {\n  return {\n    delivered: ledger.some(aiBuildItemDelivered),\n    open: ledger.some(aiBuildItemOpen),\n    failed: ledger.filter((row) => row.status === 'failed').length,\n  }\n}\n\n/**\n * The ledger Try again runs (AGL-3616): every failed item back to `pending`\n * on its next attempt, with the items left unbuilt because of it — skipped,\n * or degraded with no draft — and every item the build never reached. An\n * item that succeeded is never run again, and a degraded page that has its\n * draft keeps it, with a note that the page needs an edit. `retried` names\n * the slots that will run, which is what the estimate is shown for.\n */\nexport function aiBuildRetryLedger(\n  ledger: readonly AiJobItemLedger[],\n  units: readonly AiBuildUnit[],\n): { ledger: AiJobItemLedger[]; retried: string[] } {\n  const failed = new Set(ledger.filter((row) => row.status === 'failed').map((row) => row.slot))\n  const dependents = new Map<string, string[]>()\n  for (const unit of units) {\n    for (const dep of unit.deps) dependents.set(dep, [...(dependents.get(dep) ?? []), unit.slot])\n  }\n  // Everything downstream of a failed item, transitively.\n  const downstream = new Set<string>()\n  const queue = [...failed]\n  while (queue.length) {\n    const slot = queue.shift() as string\n    for (const next of dependents.get(slot) ?? []) {\n      if (downstream.has(next)) continue\n      downstream.add(next)\n      queue.push(next)\n    }\n  }\n  const retried: string[] = []\n  const next = ledger.map((row): AiJobItemLedger => {\n    const again =\n      row.status === 'failed' ||\n      (row.status === 'skipped' && (downstream.has(row.slot) || !(row.degradedBy ?? []).length)) ||\n      (row.status === 'degraded' && downstream.has(row.slot) && !row.outputs.length)\n    if (again) {\n      retried.push(row.slot)\n      return {\n        ...row,\n        status: 'pending',\n        attempt: row.attempt + 1,\n        attemptCredits: 0,\n        failure: null,\n        note: null,\n        degradedBy: [],\n      }\n    }\n    if (row.status === 'degraded' && downstream.has(row.slot) && row.outputs.length) {\n      return {\n        ...row,\n        note: `${row.note ? `${row.note} ` : ''}It keeps its draft: once the rest is built, edit this page to add what it is missing.`,\n      }\n    }\n    return row\n  })\n  return { ledger: next, retried }\n}\n\n/**\n * Units read back off a ledger alone (AGL-3616), for a job whose units are\n * not a build plan's — a site scaffold's: each row as its unit, and every\n * page built after the layouts and forms the ledger holds.\n */\nexport function aiLedgerUnits(ledger: readonly AiJobItemLedger[]): AiBuildUnit[] {\n  const creations = ledger.filter((row) => row.op === 'layout' || row.op === 'form').map((row) => row.slot)\n  return ledger.map((row) => ({\n    slot: row.slot,\n    op: row.op,\n    label: row.label,\n    deps: row.op === 'page' ? creations : [],\n  }))\n}\n"],"names":["pluginAiCapabilityArgsProblems","AI_PLAN_NEW_REF_PREFIX","isAiPlanNewRef","AI_SITE_MAX_SECTIONS","AI_SITE_PASS_CREDITS","aiJobPlanCreditEstimate","AI_BUILD_LIMITS","units","pages","freePages","AI_BUILD_CREATE_KINDS","AI_BUILD_STRUCTURAL_OPS","AI_BUILD_PUBLISH_INPUT","creationOp","creation","kind","namedSlots","plan","slots","Map","create","forEach","index","includes","set","name","toLowerCase","item","items","slot","aiBuildRefName","ref","slice","length","trim","aiBuildScreenRefs","screen","layout","template","duplicateOf","sections","flatMap","section","uses","filter","aiBuildUnits","depsOf","refs","self","deps","get","push","op","label","dependsOn","screens","title","aiBuildOrder","ordered","placed","Set","known","map","unit","next","find","has","every","dep","add","aiBuildGraphProblems","problems","aiBuildPageLimit","freeTaste","aiBuildPlanShapeRefusal","options","counts","slugs","slug","graph","ops","capability","freeAllowed","aiArticle","noun","argsSchema","args","join","count","maxPerPlan","test","unitPasses","aiBuildUnitCreditEstimate","credits","Math","max","floor","estimateCredits","aiBuildCreditEstimate","reduce","total","aiJobCreditEstimate","aiBuildInitialLedger","status","attempt","creditsSpent","attemptCredits","creditsRefunded","failure","outputs","OPEN","aiBuildItemOpen","row","aiBuildItemDelivered","aiBuildNextUnit","ledger","rows","aiBuildDegradation","context","bySlot","one","result","skip","degradedBy","notes","dropped","briefLines","aiBuildCreationNoun","undefined","degrade","some","blocks","pageBlocks","aiBuildPlacedItemLines","lines","aiBuildSettlement","delivered","open","failed","aiBuildRetryLedger","dependents","downstream","queue","shift","retried","again","note","aiLedgerUnits","creations"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED,SACEA,8BAA8B,QAEzB,qDAAoD;AAC3D,SACEC,sBAAsB,EACtBC,cAAc,QAMT,qBAAiB;AAExB,SAASC,oBAAoB,EAAEC,oBAAoB,EAAEC,uBAAuB,QAAQ,mBAAe;AAEnG;;;;;;;;;;;;;;;;;CAiBC,GAED,sFAAsF,GACtF,OAAO,MAAMC,kBAAkB;IAC7B,yCAAyC,GACzCC,OAAO;IACPC,OAAO;IACP,8BAA8B,GAC9BC,WAAW;AACb,EAAU;AAEV,6FAA6F,GAC7F,OAAO,MAAMC,wBAA0D;IAAC;IAAU;IAAQ;IAAa;CAAQ,CAAA;AAE/G;;;CAGC,GACD,OAAO,MAAMC,0BAA6C;IAAC;OAAWD;CAAsB,CAAA;AAE5F,kFAAkF,GAClF,OAAO,MAAME,yBAAyB,UAAS;AAe/C,0CAA0C,GAC1C,SAASC,WAAWC,QAA2B;IAC7C,OAAOA,SAASC,IAAI;AACtB;AAEA,kEAAkE,GAClE,SAASC,WAAWC,IAAiB;QAKhBA;IAJnB,MAAMC,QAAQ,IAAIC;IAClBF,KAAKG,MAAM,CAACC,OAAO,CAAC,CAACP,UAAUQ;QAC7B,IAAIZ,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAGG,MAAMM,GAAG,CAACV,SAASW,IAAI,CAACC,WAAW,IAAI,CAAC,CAAC,EAAEJ,OAAO;IACvG;IACA,KAAK,MAAMK,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAEC,MAAMM,GAAG,CAACG,KAAKF,IAAI,CAACC,WAAW,IAAIC,KAAKE,IAAI;IACjF,OAAOX;AACT;AAEA,yDAAyD,GACzD,OAAO,SAASY,eAAeC,GAAW;IACxC,OAAOA,IAAIC,KAAK,CAAC/B,uBAAuBgC,MAAM,EAAEC,IAAI,GAAGR,WAAW;AACpE;AAEA,mGAAmG,GACnG,OAAO,SAASS,kBAAkBC,MAAyB;IACzD,OAAO;QACLA,OAAOC,MAAM;QACbD,OAAOE,QAAQ;QACfF,OAAOG,WAAW;WACfH,OAAOI,QAAQ,CAACC,OAAO,CAAC,CAACC,UAAYA,QAAQC,IAAI;KACrD,CAACC,MAAM,CAAC,CAACb,MAAuB,OAAOA,QAAQ,YAAYA,IAAIE,MAAM,GAAG;AAC3E;AAEA;;;;;CAKC,GACD,OAAO,SAASY,aAAa5B,IAAiB;QAiBzBA;IAhBnB,MAAMC,QAAQF,WAAWC;IACzB,MAAM6B,SAAS,CAACC,MAAkCC;QAChD,MAAMC,OAAiB,EAAE;QACzB,KAAK,MAAMlB,OAAOgB,KAAM;YACtB,IAAI,CAAC7C,eAAe6B,MAAM;YAC1B,MAAMF,OAAOX,MAAMgC,GAAG,CAACpB,eAAeC;YACtC,IAAIF,QAAQA,SAASmB,QAAQ,CAACC,KAAK1B,QAAQ,CAACM,OAAOoB,KAAKE,IAAI,CAACtB;QAC/D;QACA,OAAOoB;IACT;IACA,MAAM1C,QAAuB,EAAE;IAC/BU,KAAKG,MAAM,CAACC,OAAO,CAAC,CAACP,UAAUQ;QAC7B,IAAI,CAACZ,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAG;QACpD,MAAMc,OAAO,CAAC,CAAC,EAAEP,OAAO;QACxBf,MAAM4C,IAAI,CAAC;YAAEtB;YAAMuB,IAAIvC,WAAWC;YAAWuC,OAAOvC,SAASW,IAAI;YAAEX;YAAUmC,MAAMH,OAAO;gBAAChC,SAASyB,WAAW;aAAC,EAAEV;QAAM;IAC1H;IACA,KAAK,MAAMF,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnCV,MAAM4C,IAAI,CAAC;YAAEtB,MAAMF,KAAKE,IAAI;YAAEuB,IAAIzB,KAAKyB,EAAE;YAAEC,OAAO1B,KAAKF,IAAI;YAAEE;YAAMsB,MAAMH,OAAOnB,KAAK2B,SAAS,EAAE3B,KAAKE,IAAI;QAAE;IAC7G;IACAZ,KAAKsC,OAAO,CAAClC,OAAO,CAAC,CAACe,QAAQd;QAC5B,MAAMO,OAAO,CAAC,CAAC,EAAEP,OAAO;QACxBf,MAAM4C,IAAI,CAAC;YAAEtB;YAAMuB,IAAI;YAAQC,OAAOjB,OAAOoB,KAAK;YAAEpB;YAAQa,MAAMH,OAAOX,kBAAkBC,SAASP;QAAM;IAC5G;IACA,OAAOtB;AACT;AAEA;;;CAGC,GACD,OAAO,SAASkD,aAAalD,KAA6B;IACxD,MAAMmD,UAAyB,EAAE;IACjC,MAAMC,SAAS,IAAIC;IACnB,MAAMC,QAAQ,IAAID,IAAIrD,MAAMuD,GAAG,CAAC,CAACC,OAASA,KAAKlC,IAAI;IACnD,MAAO6B,QAAQzB,MAAM,GAAG1B,MAAM0B,MAAM,CAAE;QACpC,MAAM+B,OAAOzD,MAAM0D,IAAI,CACrB,CAACF,OAAS,CAACJ,OAAOO,GAAG,CAACH,KAAKlC,IAAI,KAAKkC,KAAKd,IAAI,CAACkB,KAAK,CAAC,CAACC,MAAQT,OAAOO,GAAG,CAACE,QAAQ,CAACP,MAAMK,GAAG,CAACE;QAE7F,IAAI,CAACJ,MAAM,OAAO;QAClBN,QAAQP,IAAI,CAACa;QACbL,OAAOU,GAAG,CAACL,KAAKnC,IAAI;IACtB;IACA,OAAO6B;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASY,qBAAqBrD,IAAiB;QAGjCA;IAFnB,MAAMsD,WAAqB,EAAE;IAC7B,MAAMrD,QAAQF,WAAWC;IACzB,KAAK,MAAMU,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnC,KAAK,MAAMc,OAAOJ,KAAK2B,SAAS,CAAE;YAChC,IAAI,CAACpD,eAAe6B,MAAM;YAC1B,IAAI,CAACb,MAAMgD,GAAG,CAACpC,eAAeC,OAAO;gBACnCwC,SAASpB,IAAI,CAAC,CAAC,UAAU,EAAExB,KAAKF,IAAI,CAAC,aAAa,EAAEM,IAAI,sEAAsE,CAAC;YACjI,OAAO,IAAID,eAAeC,SAASJ,KAAKF,IAAI,CAACC,WAAW,IAAI;gBAC1D6C,SAASpB,IAAI,CAAC,CAAC,UAAU,EAAExB,KAAKF,IAAI,CAAC,sDAAsD,CAAC;YAC9F;QACF;IACF;IACA,IAAI,CAACgC,aAAaZ,aAAa5B,QAAQ;QACrCsD,SAASpB,IAAI,CAAC;IAChB;IACA,OAAOoB;AACT;AAKA,uDAAuD,GACvD,OAAO,SAASC,iBAAiBC,SAAqC;IACpE,OAAOA,YAAYnE,gBAAgBG,SAAS,GAAGH,gBAAgBE,KAAK;AACtE;AAEA;;;;;;CAMC,GACD,OAAO,SAASkE,wBACdzD,IAAiB,EACjB0D,UAAqD,CAAC,CAAC;QAgCRC,aAC5B3D;IA/BnB,MAAMV,QAAQsC,aAAa5B;IAC3B,IAAI,CAACV,MAAM0B,MAAM,EAAE,OAAO;IAC1B,IAAI1B,MAAM0B,MAAM,GAAG3B,gBAAgBC,KAAK,EAAE;QACxC,OAAO,CAAC,iBAAiB,EAAEA,MAAM0B,MAAM,CAAC,6BAA6B,EAAE3B,gBAAgBC,KAAK,CAAC,uCAAuC,CAAC;IACvI;IACA,MAAMC,QAAQgE,iBAAiBG,QAAQF,SAAS;IAChD,IAAIxD,KAAKsC,OAAO,CAACtB,MAAM,GAAGzB,OAAO;QAC/B,OAAOmE,QAAQF,SAAS,GACpB,CAAC,iBAAiB,EAAExD,KAAKsC,OAAO,CAACtB,MAAM,CAAC,mDAAmD,EAAEzB,MAAM,4BAA4B,CAAC,GAChI,CAAC,iBAAiB,EAAES,KAAKsC,OAAO,CAACtB,MAAM,CAAC,oCAAoC,EAAEzB,MAAM,CAAC,CAAC;IAC5F;IACA,MAAMqE,QAAQ,IAAIjB;IAClB,KAAK,MAAMxB,UAAUnB,KAAKsC,OAAO,CAAE;QACjC,IAAI,CAACnB,OAAOI,QAAQ,CAACP,MAAM,EAAE,OAAO,CAAC,UAAU,EAAEG,OAAOoB,KAAK,CAAC,2BAA2B,CAAC;QAC1F,IAAIpB,OAAOI,QAAQ,CAACP,MAAM,GAAG9B,sBAAsB;YACjD,OAAO,CAAC,UAAU,EAAEiC,OAAOoB,KAAK,CAAC,MAAM,EAAEpB,OAAOI,QAAQ,CAACP,MAAM,CAAC,kCAAkC,EAAE9B,qBAAqB,CAAC,CAAC;QAC7H;QACA,MAAM2E,OAAO1C,OAAO0C,IAAI,CAAC5C,IAAI,GAAGR,WAAW;QAC3C,IAAImD,MAAMX,GAAG,CAACY,OAAO,OAAO,CAAC,yCAAyC,EAAE1C,OAAO0C,IAAI,CAAC,CAAC,CAAC;QACtFD,MAAMR,GAAG,CAACS;IACZ;IACA,KAAK,MAAMhE,YAAYG,KAAKG,MAAM,CAAE;QAClC,IAAI,CAACV,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAG;YAClD,OAAO,CAAC,wBAAwB,EAAED,SAASC,IAAI,KAAK,iBAAiB,kBAAkB,GAAGD,SAASC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAED,SAASW,IAAI,CAAC,0BAA0B,CAAC;QAC3J;IACF;IACA,MAAMsD,QAAQT,qBAAqBrD;IACnC,IAAI8D,MAAM9C,MAAM,EAAE,OAAO8C,KAAK,CAAC,EAAE;IACjC,MAAMC,MAAML,QAAQK,GAAG;IACvB,MAAMJ,SAAS,IAAIzD;IACnB,KAAK,MAAM4C,QAAQxD,MAAOqE,OAAOpD,GAAG,CAACuC,KAAKX,EAAE,EAAE,EAACwB,cAAAA,OAAO1B,GAAG,CAACa,KAAKX,EAAE,aAAlBwB,cAAuB,KAAK;IAC3E,KAAK,MAAMjD,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnC,IAAIN,wBAAwBY,QAAQ,CAACI,KAAKyB,EAAE,GAAG;YAC7C,OAAOzB,KAAKyB,EAAE,KAAK,SACf,CAAC,CAAC,EAAEzB,KAAKF,IAAI,CAAC,2CAA2C,CAAC,GAC1D,CAAC,CAAC,EAAEE,KAAKF,IAAI,CAAC,KAAK,EAAEE,KAAKyB,EAAE,KAAK,UAAU,OAAO,IAAI,CAAC,EAAEzB,KAAKyB,EAAE,CAAC,+BAA+B,CAAC;QACvG;QACA,IAAI,CAAC4B,KAAK;QACV,MAAMC,aAAaD,IAAI9B,GAAG,CAACvB,KAAKyB,EAAE;QAClC,IAAI,CAAC6B,YAAY,OAAO,CAAC,+BAA+B,EAAEtD,KAAKF,IAAI,CAAC,GAAG,EAAEE,KAAKyB,EAAE,CAAC,wBAAwB,CAAC;QAC1G,IAAIuB,QAAQF,SAAS,IAAI,CAACQ,WAAWC,WAAW,EAAE;YAChD,OAAO,CAAC,6BAA6B,EAAEC,UAAUF,WAAWG,IAAI,EAAE,QAAQ,EAAEzD,KAAKF,IAAI,CAAC,yBAAyB,CAAC;QAClH;QACA,MAAM8C,WAAWvE,+BAA+BiF,WAAWI,UAAU,EAAE1D,KAAK2D,IAAI;QAChF,IAAIf,SAAStC,MAAM,EAAE,OAAO,CAAC,kBAAkB,EAAEN,KAAKF,IAAI,CAAC,eAAe,EAAE8C,SAASgB,IAAI,CAAC,MAAM,CAAC,CAAC;IACpG;IACA,IAAIP,KAAK;QACP,KAAK,MAAM,CAAC5B,IAAIoC,MAAM,IAAIZ,OAAQ;YAChC,MAAMK,aAAaD,IAAI9B,GAAG,CAACE;YAC3B,IAAI6B,cAAcO,QAAQP,WAAWQ,UAAU,EAAE;gBAC/C,OAAO,CAAC,gBAAgB,EAAED,MAAM,KAAK,EAAEP,WAAWG,IAAI,CAAC,+BAA+B,EAAEH,WAAWQ,UAAU,CAAC,CAAC,CAAC;YAClH;QACF;IACF;IACA,OAAO;AACT;AAEA,4CAA4C,GAC5C,OAAO,SAASN,UAAUC,IAAY;IACpC,OAAO,GAAG,YAAYM,IAAI,CAACN,QAAQ,OAAO,IAAI,CAAC,EAAEA,MAAM;AACzD;AAEA,gGAAgG,GAChG,SAASO,WAAW5B,IAAiB;IACnC,IAAIA,KAAK3B,MAAM,EAAE,OAAO2B,KAAK3B,MAAM,CAACI,QAAQ,CAACP,MAAM,GAAG;IACtD,OAAO;AACT;AAEA;;;;;CAKC,GACD,OAAO,SAAS2D,0BAA0B7B,IAAiB,EAAEiB,GAAgB;IAC3E,IAAIjB,KAAKpC,IAAI,EAAE;QACb,IAAI,OAAOoC,KAAKpC,IAAI,CAACkE,OAAO,KAAK,UAAU,OAAO9B,KAAKpC,IAAI,CAACkE,OAAO;QACnE,MAAMZ,aAAaD,uBAAAA,IAAK9B,GAAG,CAACa,KAAKpC,IAAI,CAACyB,EAAE;QACxC,IAAI6B,YAAY,OAAOa,KAAKC,GAAG,CAAC,GAAGD,KAAKE,KAAK,CAACf,WAAWgB,eAAe,CAAClC,KAAKpC,IAAI,CAAC2D,IAAI;QACvF,OAAOlF;IACT;IACA,OAAOuF,WAAW5B,QAAQ3D;AAC5B;AAEA;;;;CAIC,GACD,OAAO,SAAS8F,sBACdjF,IAAiB,EACjB0D,UAA6D,CAAC,CAAC;IAE/D,OAAO9B,aAAa5B,MACjB2B,MAAM,CAAC,CAACmB,OAAS,CAACY,QAAQzD,KAAK,IAAIyD,QAAQzD,KAAK,CAACgD,GAAG,CAACH,KAAKlC,IAAI,GAC9DsE,MAAM,CAAC,CAACC,OAAOrC,OAASqC,QAAQR,0BAA0B7B,MAAMY,QAAQK,GAAG,GAAG;AACnF;AAEA;;;CAGC,GACD,OAAO,SAASqB,oBAAoBtF,IAAY,EAAEE,IAAiB;IACjE,OAAOF,SAAS,UAAUmF,sBAAsBjF,QAAQZ,wBAAwBU,MAAME;AACxF;AAEA,6DAA6D,GAC7D,OAAO,SAASqF,qBAAqB/F,KAA6B;IAChE,OAAOA,MAAMuD,GAAG,CAAC,CAACC,OAAU,CAAA;YAC1BlC,MAAMkC,KAAKlC,IAAI;YACfuB,IAAIW,KAAKX,EAAE;YACXC,OAAOU,KAAKV,KAAK;YACjBkD,QAAQ;YACRC,SAAS;YACTC,cAAc;YACdC,gBAAgB;YAChBC,iBAAiB;YACjBC,SAAS;YACTC,SAAS,EAAE;QACb,CAAA;AACF;AAEA,MAAMC,OAAmC;IAAC;IAAW;CAAU;AAE/D,0CAA0C,GAC1C,OAAO,SAASC,gBAAgBC,GAAoC;IAClE,OAAOF,KAAKvF,QAAQ,CAACyF,IAAIT,MAAM;AACjC;AAEA,yFAAyF,GACzF,OAAO,SAASU,qBAAqBD,GAAoC;IACvE,OAAOA,IAAIT,MAAM,KAAK,eAAeS,IAAIT,MAAM,KAAK;AACtD;AAEA;;;;CAIC,GACD,OAAO,SAASW,gBACdxD,OAA+B,EAC/ByD,MAAkC;QAG3BzD;IADP,MAAM0D,OAAO,IAAIjG,IAAIgG,OAAOrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IACxD,QAAOtD,gBAAAA,QAAQO,IAAI,CAAC,CAACF;QACnB,MAAMiD,MAAMI,KAAKlE,GAAG,CAACa,KAAKlC,IAAI;QAC9B,OAAO,CAACmF,OAAOD,gBAAgBC;IACjC,cAHOtD,gBAGD;AACR;AAgBA;;;;;;;;;CASC,GACD,OAAO,SAAS2D,mBACdtD,IAAiB,EACjBuD,OAIC;IAED,MAAMF,OAAO,IAAIjG,IAAImG,QAAQH,MAAM,CAACrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IAChE,MAAMO,SAAS,IAAIpG,IAAImG,QAAQ/G,KAAK,CAACuD,GAAG,CAAC,CAAC0D,MAAQ;YAACA,IAAI3F,IAAI;YAAE2F;SAAI;IACjE,MAAMC,SAA6B;QAAEC,MAAM;QAAMC,YAAY,EAAE;QAAEC,OAAO,EAAE;QAAEC,SAAS,IAAIjE;QAAOkE,YAAY,EAAE;IAAC;IAC/G,KAAK,MAAMjG,QAAQkC,KAAKd,IAAI,CAAE;kBAQZmB;YAFXkD,kBAAAA,cACyBA,eACdlD,WAA6CA,eAQzDA;QAfJ,MAAMA,MAAMmD,OAAOrE,GAAG,CAACrB;QACvB,MAAMmF,MAAMI,KAAKlE,GAAG,CAACrB;QACrB,IAAI,CAACuC,OAAO,CAAC4C,OAAOC,qBAAqBD,MAAM;QAC/C,MAAM5B,OAAOhB,IAAItD,QAAQ,GACrBiH,oBAAoB3D,IAAItD,QAAQ,CAACC,IAAI,aACpCuG,eAAAA,QAAQtC,GAAG,sBAAXsC,mBAAAA,aAAapE,GAAG,CAACkB,IAAIhB,EAAE,sBAAvBkE,iBAA0BlC,IAAI,mBAAIhB,IAAIhB,EAAE;QAC7C,MAAM6B,aAAab,IAAIzC,IAAI,IAAG2F,gBAAAA,QAAQtC,GAAG,qBAAXsC,cAAapE,GAAG,CAACkB,IAAIhB,EAAE,IAAI4E;QACzD,MAAMC,WAAU7D,kBAAAA,YAAAA,IAAIzC,IAAI,qBAARyC,UAAU6D,OAAO,oBAAIhD,8BAAAA,WAAYgD,OAAO,YAAxC7D,QAA6CA,EAAAA,gBAAAA,IAAItD,QAAQ,qBAAZsD,cAAcrD,IAAI,MAAK,WAAW,aAAa;QAC5G,IAAI,CAACgD,KAAK3B,MAAM,IAAI6F,YAAY,QAAQ;YACtCR,OAAOC,IAAI,GAAG,CAAC,eAAe,EAAEtC,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,gCAAgC,CAAC;YACpFoE,OAAOE,UAAU,CAACxE,IAAI,CAACtB;YACvB,OAAO4F;QACT;QACAA,OAAOE,UAAU,CAACxE,IAAI,CAACtB;QACvB4F,OAAOI,OAAO,CAACxD,GAAG,CAACD,IAAIf,KAAK,CAAC3B,WAAW;QACxC,IAAI0C,EAAAA,iBAAAA,IAAItD,QAAQ,qBAAZsD,eAAcrD,IAAI,MAAK,UAAU;YACnC0G,OAAOG,KAAK,CAACzE,IAAI,CAAC,CAAC,gDAAgD,EAAEiB,IAAIf,KAAK,CAAC,uBAAuB,CAAC;YACvG;QACF;QACA,IAAIU,KAAK3B,MAAM,EAAE;gBAIA6C;YAHf,MAAMvC,UAAUqB,KAAK3B,MAAM,CAACI,QAAQ,CAACyB,IAAI,CAAC,CAACuD,MACzCA,IAAI7E,IAAI,CAACuF,IAAI,CAAC,CAACnG,MAAQ7B,eAAe6B,QAAQD,eAAeC,SAASqC,IAAIf,KAAK,CAAC3B,WAAW;YAE7F,MAAMyG,SAASlD,CAAAA,+BAAAA,yBAAAA,WAAYmD,UAAU,qBAAtBnD,uBAAwBhD,MAAM,IAAG,CAAC,KAAK,EAAEgD,WAAWmD,UAAU,CAAC7C,IAAI,CAAC,QAAQ,MAAM,CAAC,GAAG;YACrGkC,OAAOG,KAAK,CAACzE,IAAI,CACf,CAAC,aAAa,EAAEgF,UAAU,CAAC,KAAK,EAAE/C,MAAM,CAAC,MAAM,EAAEA,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,uBAAuB,CAAC;YAE9FoE,OAAOK,UAAU,CAAC3E,IAAI,CACpB,GAAGT,UAAU,CAAC,WAAW,EAAEA,QAAQjB,IAAI,CAAC,SAAS,CAAC,GAAG,iBAAiB,aAAa,EAAE2D,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,CAAC,EAAE8E,SAAS,CAAC,YAAY,EAAEA,QAAQ,GAAG,GAAG,0BAA0B,CAAC;QAEhL,OAAO;YACLV,OAAOG,KAAK,CAACzE,IAAI,CAAC,CAAC,kBAAkB,EAAEiC,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,2BAA2B,CAAC;QACxF;IACF;IACA,OAAOoE;AACT;AAEA,4CAA4C,GAC5C,OAAO,SAASM,oBAAoBhH,IAA2B;IAC7D,OAAOA,SAAS,UAAU,iBAAiBA,SAAS,iBAAiB,iBAAiBA;AACxF;AAEA;;;CAGC,GACD,OAAO,SAASsH,uBACdtE,IAAiB,EACjBuD,OAAgG;IAEhG,IAAI,CAACvD,KAAK3B,MAAM,EAAE,OAAO,EAAE;IAC3B,MAAMgF,OAAO,IAAIjG,IAAImG,QAAQH,MAAM,CAACrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IAChE,MAAMsB,QAAkB,EAAE;IAC1B,KAAK,MAAM5F,WAAWqB,KAAK3B,MAAM,CAACI,QAAQ,CAAE;QAC1C,KAAK,MAAMT,OAAOW,QAAQC,IAAI,CAAE;;gBAMX2E;YALnB,IAAI,CAACpH,eAAe6B,MAAM;YAC1B,MAAMqC,MAAMkD,QAAQ/G,KAAK,CAAC0D,IAAI,CAAC,CAACuD,MAAQA,IAAI7F,IAAI,IAAI6F,IAAI7F,IAAI,CAACF,IAAI,CAACC,WAAW,OAAOI,eAAeC;YACnG,IAAI,EAACqC,uBAAAA,IAAKzC,IAAI,GAAE;YAChB,MAAMqF,MAAMI,KAAKlE,GAAG,CAACkB,IAAIvC,IAAI;YAC7B,IAAI,CAACmF,OAAO,CAACC,qBAAqBD,MAAM;YACxC,MAAM/B,cAAaqC,eAAAA,QAAQtC,GAAG,qBAAXsC,aAAapE,GAAG,CAACkB,IAAIhB,EAAE;YAC1C,MAAM+E,iBAASlD,8BAAAA,WAAYmD,UAAU,mBAAI,EAAE;YAC3C,IAAI,CAACD,OAAOlG,MAAM,EAAE;YACpBqG,MAAMnF,IAAI,CACR,CAAC,QAAQ,EAAET,QAAQjB,IAAI,CAAC,qBAAqB,EAAE0G,OAAO5C,IAAI,CAAC,QAAQ,eAAe,WAAEN,8BAAAA,WAAYG,IAAI,oBAAIhB,IAAIhB,EAAE,CAAC,EAAE,EAAEgB,IAAIf,KAAK,CAAC,EAAE,CAAC;QAEpI;IACF;IACA,OAAOiF;AACT;AAEA,wFAAwF,GACxF,OAAO,SAASC,kBAAkBpB,MAAkC;IAKlE,OAAO;QACLqB,WAAWrB,OAAOe,IAAI,CAACjB;QACvBwB,MAAMtB,OAAOe,IAAI,CAACnB;QAClB2B,QAAQvB,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAIT,MAAM,KAAK,UAAUtE,MAAM;IAChE;AACF;AAEA;;;;;;;CAOC,GACD,OAAO,SAAS0G,mBACdxB,MAAkC,EAClC5G,KAA6B;IAE7B,MAAMmI,SAAS,IAAI9E,IAAIuD,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAIT,MAAM,KAAK,UAAUzC,GAAG,CAAC,CAACkD,MAAQA,IAAInF,IAAI;IAC5F,MAAM+G,aAAa,IAAIzH;IACvB,KAAK,MAAM4C,QAAQxD,MAAO;YAC8BqI;QAAtD,KAAK,MAAMxE,OAAOL,KAAKd,IAAI,CAAE2F,WAAWpH,GAAG,CAAC4C,KAAK;gBAAKwE,kBAAAA,WAAW1F,GAAG,CAACkB,gBAAfwE,kBAAuB,EAAE;YAAG7E,KAAKlC,IAAI;SAAC;IAC9F;IACA,wDAAwD;IACxD,MAAMgH,aAAa,IAAIjF;IACvB,MAAMkF,QAAQ;WAAIJ;KAAO;IACzB,MAAOI,MAAM7G,MAAM,CAAE;YAEA2G;QADnB,MAAM/G,OAAOiH,MAAMC,KAAK;QACxB,KAAK,MAAM/E,SAAQ4E,mBAAAA,WAAW1F,GAAG,CAACrB,iBAAf+G,mBAAwB,EAAE,CAAE;YAC7C,IAAIC,WAAW3E,GAAG,CAACF,OAAO;YAC1B6E,WAAWxE,GAAG,CAACL;YACf8E,MAAM3F,IAAI,CAACa;QACb;IACF;IACA,MAAMgF,UAAoB,EAAE;IAC5B,MAAMhF,OAAOmD,OAAOrD,GAAG,CAAC,CAACkD;YAGuCA;QAF9D,MAAMiC,QACJjC,IAAIT,MAAM,KAAK,YACdS,IAAIT,MAAM,KAAK,aAAcsC,CAAAA,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAK,CAAC,EAACmF,kBAAAA,IAAIW,UAAU,YAAdX,kBAAkB,EAAE,EAAE/E,MAAM,AAAD,KACtF+E,IAAIT,MAAM,KAAK,cAAcsC,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAK,CAACmF,IAAIH,OAAO,CAAC5E,MAAM;QAC/E,IAAIgH,OAAO;YACTD,QAAQ7F,IAAI,CAAC6D,IAAInF,IAAI;YACrB,OAAO,aACFmF;gBACHT,QAAQ;gBACRC,SAASQ,IAAIR,OAAO,GAAG;gBACvBE,gBAAgB;gBAChBE,SAAS;gBACTsC,MAAM;gBACNvB,YAAY,EAAE;;QAElB;QACA,IAAIX,IAAIT,MAAM,KAAK,cAAcsC,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAKmF,IAAIH,OAAO,CAAC5E,MAAM,EAAE;YAC/E,OAAO,aACF+E;gBACHkC,MAAM,GAAGlC,IAAIkC,IAAI,GAAG,GAAGlC,IAAIkC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,qFAAqF,CAAC;;QAElI;QACA,OAAOlC;IACT;IACA,OAAO;QAAEG,QAAQnD;QAAMgF;IAAQ;AACjC;AAEA;;;;CAIC,GACD,OAAO,SAASG,cAAchC,MAAkC;IAC9D,MAAMiC,YAAYjC,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAI5D,EAAE,KAAK,YAAY4D,IAAI5D,EAAE,KAAK,QAAQU,GAAG,CAAC,CAACkD,MAAQA,IAAInF,IAAI;IACxG,OAAOsF,OAAOrD,GAAG,CAAC,CAACkD,MAAS,CAAA;YAC1BnF,MAAMmF,IAAInF,IAAI;YACduB,IAAI4D,IAAI5D,EAAE;YACVC,OAAO2D,IAAI3D,KAAK;YAChBJ,MAAM+D,IAAI5D,EAAE,KAAK,SAASgG,YAAY,EAAE;QAC1C,CAAA;AACF"}
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/model/ai-build-job.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  pluginAiCapabilityArgsProblems,\n  type PluginAiCapability,\n} from '@aglyn/aglyn/plugin-manager/plugin-ai-capabilities'\nimport {\n  AI_PLAN_NEW_REF_PREFIX,\n  isAiPlanNewRef,\n  type AiBuildItem,\n  type AiBuildPlan,\n  type AiBuildPlanCreate,\n  type AiBuildPlanCreateKind,\n  type AiBuildPlanScreen,\n} from './ai-build-plan'\nimport type { AiJobItemLedger, AiJobItemStatus } from './ai-jobs.types'\nimport { AI_SITE_MAX_SECTIONS, AI_SITE_PASS_CREDITS, aiJobPlanCreditEstimate } from './ai-site-job'\n\n/**\n * What a `build` job is (AGL-3616): one request — \"a few pages, a contact\n * form and a way to book me\" — planned as creations, pages and items, built\n * one UNIT a pass in dependency order, and settled ITEM BY ITEM.\n *\n * A build is a generalized site scaffold. Every unit is handed to what\n * already builds that kind of thing — a page to the page step, a form to the\n * form step, another plugin's resource to that plugin's draft writer — so a\n * build cannot drift from what it builds. What is new is the settlement: one\n * failed unit does not end the job. It gives back its own spend, the units\n * that depended on it are built without it (or skipped, when they cannot\n * stand without it), and the job is `done` when anything was delivered.\n *\n * This module is the build's MODEL — its units, their order, how a failure\n * travels to what depends on it, what it is estimated to cost, and the\n * ledger arithmetic — and does no I/O, so the step, the machine, the doors\n * and the console read one vocabulary.\n */\n\n/** How much one build holds: what one proposal can describe and one person can read. */\nexport const AI_BUILD_LIMITS = {\n  /** Creations, pages and items together. */\n  units: 16,\n  pages: 8,\n  /** A Free workspace's pages. */\n  freePages: 2,\n} as const\n\n/** What a build creates through its `create` list; everything else beyond pages is an item. */\nexport const AI_BUILD_CREATE_KINDS: readonly AiBuildPlanCreateKind[] = ['layout', 'form', 'component', 'email']\n\n/**\n * The operations a build plans through `create` and `screens` rather than\n * `items`: an item naming one is a plan that put it in the wrong list.\n */\nexport const AI_BUILD_STRUCTURAL_OPS: readonly string[] = ['page', ...AI_BUILD_CREATE_KINDS]\n\n/** The job input a build's Assist proposal sets when the brief asked to publish. */\nexport const AI_BUILD_PUBLISH_INPUT = 'publish'\n\n/** A unit of a build: a creation, a page, or an item. */\nexport interface AiBuildUnit {\n  slot: string\n  /** The capability operation that builds it. */\n  op: string\n  label: string\n  creation?: AiBuildPlanCreate\n  screen?: AiBuildPlanScreen\n  item?: AiBuildItem\n  /** The slots it is built after, in plan order. */\n  deps: string[]\n}\n\n/** The operation a creation is built as. */\nfunction creationOp(creation: AiBuildPlanCreate): string {\n  return creation.kind\n}\n\n/** A plan's `new:<name>` names, each to the slot that builds it. */\nfunction namedSlots(plan: AiBuildPlan): Map<string, string> {\n  const slots = new Map<string, string>()\n  plan.create.forEach((creation, index) => {\n    if (AI_BUILD_CREATE_KINDS.includes(creation.kind)) slots.set(creation.name.toLowerCase(), `c${index}`)\n  })\n  for (const item of plan.items ?? []) slots.set(item.name.toLowerCase(), item.slot)\n  return slots\n}\n\n/** The name a `new:<name>` reference gives, lowercased. */\nexport function aiBuildRefName(ref: string): string {\n  return ref.slice(AI_PLAN_NEW_REF_PREFIX.length).trim().toLowerCase()\n}\n\n/** Every reference a page makes: its layout, template, starting page and what its sections place. */\nexport function aiBuildScreenRefs(screen: AiBuildPlanScreen): string[] {\n  return [\n    screen.layout,\n    screen.template,\n    screen.duplicateOf,\n    ...screen.sections.flatMap((section) => section.uses),\n  ].filter((ref): ref is string => typeof ref === 'string' && ref.length > 0)\n}\n\n/**\n * The units a plan implies, in plan order: creations, then items, then\n * pages — the order a member reads them in, and the one a page that places\n * a creation or an item is built after anyway. `aiBuildOrder` sorts them on\n * their dependencies.\n */\nexport function aiBuildUnits(plan: AiBuildPlan): AiBuildUnit[] {\n  const slots = namedSlots(plan)\n  const depsOf = (refs: readonly (string | null)[], self: string): string[] => {\n    const deps: string[] = []\n    for (const ref of refs) {\n      if (!isAiPlanNewRef(ref)) continue\n      const slot = slots.get(aiBuildRefName(ref))\n      if (slot && slot !== self && !deps.includes(slot)) deps.push(slot)\n    }\n    return deps\n  }\n  const units: AiBuildUnit[] = []\n  plan.create.forEach((creation, index) => {\n    if (!AI_BUILD_CREATE_KINDS.includes(creation.kind)) return\n    const slot = `c${index}`\n    units.push({ slot, op: creationOp(creation), label: creation.name, creation, deps: depsOf([creation.duplicateOf], slot) })\n  })\n  for (const item of plan.items ?? []) {\n    units.push({ slot: item.slot, op: item.op, label: item.name, item, deps: depsOf(item.dependsOn, item.slot) })\n  }\n  plan.screens.forEach((screen, index) => {\n    const slot = `p${index}`\n    units.push({ slot, op: 'page', label: screen.title, screen, deps: depsOf(aiBuildScreenRefs(screen), slot) })\n  })\n  return units\n}\n\n/**\n * The units in an order that builds every dependency before what depends on\n * it, plan order otherwise; `null` when the dependencies hold a cycle.\n */\nexport function aiBuildOrder(units: readonly AiBuildUnit[]): AiBuildUnit[] | null {\n  const ordered: AiBuildUnit[] = []\n  const placed = new Set<string>()\n  const known = new Set(units.map((unit) => unit.slot))\n  while (ordered.length < units.length) {\n    const next = units.find(\n      (unit) => !placed.has(unit.slot) && unit.deps.every((dep) => placed.has(dep) || !known.has(dep)),\n    )\n    if (!next) return null\n    ordered.push(next)\n    placed.add(next.slot)\n  }\n  return ordered\n}\n\n/**\n * What is wrong with a plan's references as a build reads them: a\n * `new:<name>` an item depends on that nothing in the plan makes, and a\n * cycle. Each is a sentence the plan's one re-ask carries.\n */\nexport function aiBuildGraphProblems(plan: AiBuildPlan): string[] {\n  const problems: string[] = []\n  const slots = namedSlots(plan)\n  for (const item of plan.items ?? []) {\n    for (const ref of item.dependsOn) {\n      if (!isAiPlanNewRef(ref)) continue\n      if (!slots.has(aiBuildRefName(ref))) {\n        problems.push(`The item \"${item.name}\" depends on ${ref}, which the plan never makes. Declare it, or take it out of dependsOn.`)\n      } else if (aiBuildRefName(ref) === item.name.toLowerCase()) {\n        problems.push(`The item \"${item.name}\" depends on itself. Take it out of its own dependsOn.`)\n      }\n    }\n  }\n  if (!aiBuildOrder(aiBuildUnits(plan))) {\n    problems.push('The plan’s dependencies go round in a circle, so nothing in the circle can be built first. Make one of them depend on nothing.')\n  }\n  return problems\n}\n\n/** The operations a build may plan, as the registry and the gates left them, by op. */\nexport type AiBuildOps = ReadonlyMap<string, PluginAiCapability>\n\n/** How many pages a build may hold on this workspace. */\nexport function aiBuildPageLimit(freeTaste: boolean | null | undefined): number {\n  return freeTaste ? AI_BUILD_LIMITS.freePages : AI_BUILD_LIMITS.pages\n}\n\n/**\n * Why a build cannot build a plan of this shape, in a sentence a member\n * reads; `null` when it can. Held to the plan with the one re-ask (the plan\n * step's scope), and again by the doors before a confirmed plan runs.\n * `ops` is what may be planned on this site; absent, items are not judged\n * against the registry (a console reading a kept plan).\n */\nexport function aiBuildPlanShapeRefusal(\n  plan: AiBuildPlan,\n  options: { freeTaste?: boolean; ops?: AiBuildOps } = {},\n): string | null {\n  const units = aiBuildUnits(plan)\n  if (!units.length) return 'This plan builds nothing. Describe what to build again.'\n  if (units.length > AI_BUILD_LIMITS.units) {\n    return `This plan builds ${units.length} things, and one build holds ${AI_BUILD_LIMITS.units}. Ask for the rest in a second request.`\n  }\n  const pages = aiBuildPageLimit(options.freeTaste)\n  if (plan.screens.length > pages) {\n    return options.freeTaste\n      ? `This plan builds ${plan.screens.length} pages, and a Free workspace's build makes at most ${pages}. Paid plans can build more.`\n      : `This plan builds ${plan.screens.length} pages, and one build makes at most ${pages}.`\n  }\n  const slugs = new Set<string>()\n  for (const screen of plan.screens) {\n    if (!screen.sections.length) return `The page “${screen.title}” has no sections to build.`\n    if (screen.sections.length > AI_SITE_MAX_SECTIONS) {\n      return `The page “${screen.title}” has ${screen.sections.length} sections, and a built page holds ${AI_SITE_MAX_SECTIONS}.`\n    }\n    const slug = screen.slug.trim().toLowerCase()\n    if (slugs.has(slug)) return `Two pages in this plan share the address ${screen.slug}.`\n    slugs.add(slug)\n  }\n  for (const creation of plan.create) {\n    if (!AI_BUILD_CREATE_KINDS.includes(creation.kind)) {\n      return `A build does not create ${creation.kind === 'theme-change' ? 'theme changes' : `${creation.kind}s`} (“${creation.name}”). Take it out of create.`\n    }\n  }\n  const graph = aiBuildGraphProblems(plan)\n  if (graph.length) return graph[0]\n  const ops = options.ops\n  const counts = new Map<string, number>()\n  for (const unit of units) counts.set(unit.op, (counts.get(unit.op) ?? 0) + 1)\n  for (const item of plan.items ?? []) {\n    if (AI_BUILD_STRUCTURAL_OPS.includes(item.op)) {\n      return item.op === 'page'\n        ? `“${item.name}” is a page: plan it in screens, not items.`\n        : `“${item.name}” is ${item.op === 'email' ? 'an' : 'a'} ${item.op}: plan it in create, not items.`\n    }\n    if (!ops) continue\n    const capability = ops.get(item.op)\n    if (!capability) return `Nothing on this site can make “${item.name}” (${item.op}). Take it out of items.`\n    if (options.freeTaste && !capability.freeAllowed) {\n      return `A Free workspace cannot have ${aiArticle(capability.noun)} made (“${item.name}”). Take it out of items.`\n    }\n    const problems = pluginAiCapabilityArgsProblems(capability.argsSchema, item.args)\n    if (problems.length) return `The arguments of “${item.name}” do not read: ${problems.join('; ')}.`\n  }\n  if (ops) {\n    for (const [op, count] of counts) {\n      const capability = ops.get(op)\n      if (capability && count > capability.maxPerPlan) {\n        return `This plan makes ${count} of “${capability.noun}”, and one build makes at most ${capability.maxPerPlan}.`\n      }\n    }\n  }\n  return null\n}\n\n/** \"a booking service\", \"an email design\". */\nexport function aiArticle(noun: string): string {\n  return `${/^[aeiou]/i.test(noun) ? 'an' : 'a'} ${noun}`\n}\n\n/** The passes one unit is estimated at: a page's sections and its listing, one for a creation. */\nfunction unitPasses(unit: AiBuildUnit): number {\n  if (unit.screen) return unit.screen.sections.length + 1\n  return 1\n}\n\n/**\n * About what one unit costs, in credits: a page or a creation by the passes\n * it implies at the nominal credits a pass is held against, as a site's are;\n * an item by its capability's own estimate, recorded on the plan when it was\n * kept.\n */\nexport function aiBuildUnitCreditEstimate(unit: AiBuildUnit, ops?: AiBuildOps): number {\n  if (unit.item) {\n    if (typeof unit.item.credits === 'number') return unit.item.credits\n    const capability = ops?.get(unit.item.op)\n    if (capability) return Math.max(0, Math.floor(capability.estimateCredits(unit.item.args)))\n    return AI_SITE_PASS_CREDITS\n  }\n  return unitPasses(unit) * AI_SITE_PASS_CREDITS\n}\n\n/**\n * About what a build costs, in credits: every unit's estimate, or only the\n * units named in `slots` — what Try again shows. The ceiling a member\n * confirms; the meter charges what actually runs.\n */\nexport function aiBuildCreditEstimate(\n  plan: AiBuildPlan,\n  options: { ops?: AiBuildOps; slots?: ReadonlySet<string> } = {},\n): number {\n  return aiBuildUnits(plan)\n    .filter((unit) => !options.slots || options.slots.has(unit.slot))\n    .reduce((total, unit) => total + aiBuildUnitCreditEstimate(unit, options.ops), 0)\n}\n\n/**\n * About what a job of this kind costs to build from its plan: a build's\n * units, every other planned kind as `aiJobPlanCreditEstimate` counts it.\n */\nexport function aiJobCreditEstimate(kind: string, plan: AiBuildPlan): number {\n  return kind === 'build' ? aiBuildCreditEstimate(plan) : aiJobPlanCreditEstimate(kind, plan)\n}\n\n/** A fresh ledger: one pending row per unit, first attempt. */\nexport function aiBuildInitialLedger(units: readonly AiBuildUnit[]): AiJobItemLedger[] {\n  return units.map((unit) => ({\n    slot: unit.slot,\n    op: unit.op,\n    label: unit.label,\n    status: 'pending',\n    attempt: 1,\n    creditsSpent: 0,\n    attemptCredits: 0,\n    creditsRefunded: 0,\n    failure: null,\n    outputs: [],\n  }))\n}\n\nconst OPEN: readonly AiJobItemStatus[] = ['pending', 'running']\n\n/** Whether an item is still to be built. */\nexport function aiBuildItemOpen(row: Pick<AiJobItemLedger, 'status'>): boolean {\n  return OPEN.includes(row.status)\n}\n\n/** Whether an item delivered: built as planned, or built without something that failed. */\nexport function aiBuildItemDelivered(row: Pick<AiJobItemLedger, 'status'>): boolean {\n  return row.status === 'succeeded' || row.status === 'degraded'\n}\n\n/**\n * The next unit to build: the first in build order whose row is still open.\n * Its dependencies come before it, so by then each is settled one way or the\n * other. `null` when nothing is left.\n */\nexport function aiBuildNextUnit(\n  ordered: readonly AiBuildUnit[],\n  ledger: readonly AiJobItemLedger[],\n): AiBuildUnit | null {\n  const rows = new Map(ledger.map((row) => [row.slot, row]))\n  return ordered.find((unit) => {\n    const row = rows.get(unit.slot)\n    return !row || aiBuildItemOpen(row)\n  }) ?? null\n}\n\n/** How a unit is built given what its dependencies came to. */\nexport interface AiBuildDegradation {\n  /** The unit is not built at all, with the sentence why; nothing is spent. */\n  skip: string | null\n  /** The failed dependencies that change how it is built. */\n  degradedBy: string[]\n  /** What the person reads about the change; one per failed dependency. */\n  notes: string[]\n  /** `new:<name>` references (lowercased names) to leave out. */\n  dropped: Set<string>\n  /** Brief lines for the unit's own job: what to leave out, and what to place. */\n  briefLines: string[]\n}\n\n/**\n * How a unit is built when some of what it depends on failed (AGL-3616).\n *\n * A PAGE is always built: a failed layout falls back to the site's own, a\n * failed form or component is left out of its section, and a failed item a\n * section places (a booking service) takes its block out of the page — each\n * with a note. Any OTHER unit whose dependency failed is skipped when that\n * dependency's capability says `omit` (a campaign whose email design failed\n * has nothing to send), and built without it when it says `fallback`.\n */\nexport function aiBuildDegradation(\n  unit: AiBuildUnit,\n  context: {\n    units: readonly AiBuildUnit[]\n    ledger: readonly AiJobItemLedger[]\n    ops?: AiBuildOps\n  },\n): AiBuildDegradation {\n  const rows = new Map(context.ledger.map((row) => [row.slot, row]))\n  const bySlot = new Map(context.units.map((one) => [one.slot, one]))\n  const result: AiBuildDegradation = { skip: null, degradedBy: [], notes: [], dropped: new Set(), briefLines: [] }\n  for (const slot of unit.deps) {\n    const dep = bySlot.get(slot)\n    const row = rows.get(slot)\n    if (!dep || !row || aiBuildItemDelivered(row)) continue\n    const noun = dep.creation\n      ? aiBuildCreationNoun(dep.creation.kind)\n      : (context.ops?.get(dep.op)?.noun ?? dep.op)\n    const capability = dep.item ? context.ops?.get(dep.op) : undefined\n    const degrade = dep.item?.degrade ?? capability?.degrade ?? (dep.creation?.kind === 'layout' ? 'fallback' : 'omit')\n    if (!unit.screen && degrade === 'omit') {\n      result.skip = `Not built: the ${noun} “${dep.label}” it needs could not be created.`\n      result.degradedBy.push(slot)\n      return result\n    }\n    result.degradedBy.push(slot)\n    result.dropped.add(dep.label.toLowerCase())\n    if (dep.creation?.kind === 'layout') {\n      result.notes.push(`Built inside the site’s own layout: the layout “${dep.label}” could not be created.`)\n      continue\n    }\n    if (unit.screen) {\n      const section = unit.screen.sections.find((one) =>\n        one.uses.some((ref) => isAiPlanNewRef(ref) && aiBuildRefName(ref) === dep.label.toLowerCase()),\n      )\n      const blocks = capability?.pageBlocks?.length ? ` the ${capability.pageBlocks.join(' or ')} block` : ''\n      result.notes.push(\n        `Built without${blocks || ` the ${noun}`}: the ${noun} “${dep.label}” could not be created.`,\n      )\n      result.briefLines.push(\n        `${section ? `Build the “${section.name}” section` : 'Build the page'} without the ${noun} “${dep.label}”${blocks ? ` and without${blocks}` : ''}: it could not be created.`,\n      )\n    } else {\n      result.notes.push(`Built without the ${noun} “${dep.label}”: it could not be created.`)\n    }\n  }\n  return result\n}\n\n/** What each creation is called in a note. */\nexport function aiBuildCreationNoun(kind: AiBuildPlanCreateKind): string {\n  return kind === 'email' ? 'email design' : kind === 'theme-change' ? 'theme change' : kind\n}\n\n/**\n * The brief lines a page is told about the items its sections place and\n * that were built: the block to put there, in the owner's words.\n */\nexport function aiBuildPlacedItemLines(\n  unit: AiBuildUnit,\n  context: { units: readonly AiBuildUnit[]; ledger: readonly AiJobItemLedger[]; ops?: AiBuildOps },\n): string[] {\n  if (!unit.screen) return []\n  const rows = new Map(context.ledger.map((row) => [row.slot, row]))\n  const lines: string[] = []\n  for (const section of unit.screen.sections) {\n    for (const ref of section.uses) {\n      if (!isAiPlanNewRef(ref)) continue\n      const dep = context.units.find((one) => one.item && one.item.name.toLowerCase() === aiBuildRefName(ref))\n      if (!dep?.item) continue\n      const row = rows.get(dep.slot)\n      if (!row || !aiBuildItemDelivered(row)) continue\n      const capability = context.ops?.get(dep.op)\n      const blocks = capability?.pageBlocks ?? []\n      if (!blocks.length) continue\n      lines.push(\n        `In the “${section.name}” section, place the ${blocks.join(' or ')} block for the ${capability?.noun ?? dep.op} “${dep.label}”.`,\n      )\n    }\n  }\n  return lines\n}\n\n/** What a build came to: whether anything was delivered, and whether anything is left. */\nexport function aiBuildSettlement(ledger: readonly AiJobItemLedger[]): {\n  delivered: boolean\n  open: boolean\n  failed: number\n} {\n  return {\n    delivered: ledger.some(aiBuildItemDelivered),\n    open: ledger.some(aiBuildItemOpen),\n    failed: ledger.filter((row) => row.status === 'failed').length,\n  }\n}\n\n/**\n * The ledger Try again runs (AGL-3616): every failed item back to `pending`\n * on its next attempt, with the items left unbuilt because of it — skipped,\n * or degraded with no draft — and every item the build never reached. An\n * item that succeeded is never run again, and a degraded page that has its\n * draft keeps it, with a note that the page needs an edit. `retried` names\n * the slots that will run, which is what the estimate is shown for.\n */\nexport function aiBuildRetryLedger(\n  ledger: readonly AiJobItemLedger[],\n  units: readonly AiBuildUnit[],\n): { ledger: AiJobItemLedger[]; retried: string[] } {\n  const failed = new Set(ledger.filter((row) => row.status === 'failed').map((row) => row.slot))\n  const dependents = new Map<string, string[]>()\n  for (const unit of units) {\n    for (const dep of unit.deps) dependents.set(dep, [...(dependents.get(dep) ?? []), unit.slot])\n  }\n  // Everything downstream of a failed item, transitively.\n  const downstream = new Set<string>()\n  const queue = [...failed]\n  while (queue.length) {\n    const slot = queue.shift() as string\n    for (const next of dependents.get(slot) ?? []) {\n      if (downstream.has(next)) continue\n      downstream.add(next)\n      queue.push(next)\n    }\n  }\n  const retried: string[] = []\n  const next = ledger.map((row): AiJobItemLedger => {\n    const again =\n      row.status === 'failed' ||\n      (row.status === 'skipped' && (downstream.has(row.slot) || !(row.degradedBy ?? []).length)) ||\n      (row.status === 'degraded' && downstream.has(row.slot) && !row.outputs.length)\n    if (again) {\n      retried.push(row.slot)\n      return {\n        ...row,\n        status: 'pending',\n        attempt: row.attempt + 1,\n        attemptCredits: 0,\n        failure: null,\n        note: null,\n        degradedBy: [],\n        settledAt: null,\n      }\n    }\n    if (row.status === 'degraded' && downstream.has(row.slot) && row.outputs.length) {\n      return {\n        ...row,\n        note: `${row.note ? `${row.note} ` : ''}It keeps its draft: once the rest is built, edit this page to add what it is missing.`,\n      }\n    }\n    return row\n  })\n  return { ledger: next, retried }\n}\n\n/**\n * Units read back off a ledger alone (AGL-3616), for a job whose units are\n * not a build plan's — a site scaffold's: each row as its unit, and every\n * page built after the layouts and forms the ledger holds.\n */\nexport function aiLedgerUnits(ledger: readonly AiJobItemLedger[]): AiBuildUnit[] {\n  const creations = ledger.filter((row) => row.op === 'layout' || row.op === 'form').map((row) => row.slot)\n  return ledger.map((row) => ({\n    slot: row.slot,\n    op: row.op,\n    label: row.label,\n    deps: row.op === 'page' ? creations : [],\n  }))\n}\n"],"names":["pluginAiCapabilityArgsProblems","AI_PLAN_NEW_REF_PREFIX","isAiPlanNewRef","AI_SITE_MAX_SECTIONS","AI_SITE_PASS_CREDITS","aiJobPlanCreditEstimate","AI_BUILD_LIMITS","units","pages","freePages","AI_BUILD_CREATE_KINDS","AI_BUILD_STRUCTURAL_OPS","AI_BUILD_PUBLISH_INPUT","creationOp","creation","kind","namedSlots","plan","slots","Map","create","forEach","index","includes","set","name","toLowerCase","item","items","slot","aiBuildRefName","ref","slice","length","trim","aiBuildScreenRefs","screen","layout","template","duplicateOf","sections","flatMap","section","uses","filter","aiBuildUnits","depsOf","refs","self","deps","get","push","op","label","dependsOn","screens","title","aiBuildOrder","ordered","placed","Set","known","map","unit","next","find","has","every","dep","add","aiBuildGraphProblems","problems","aiBuildPageLimit","freeTaste","aiBuildPlanShapeRefusal","options","counts","slugs","slug","graph","ops","capability","freeAllowed","aiArticle","noun","argsSchema","args","join","count","maxPerPlan","test","unitPasses","aiBuildUnitCreditEstimate","credits","Math","max","floor","estimateCredits","aiBuildCreditEstimate","reduce","total","aiJobCreditEstimate","aiBuildInitialLedger","status","attempt","creditsSpent","attemptCredits","creditsRefunded","failure","outputs","OPEN","aiBuildItemOpen","row","aiBuildItemDelivered","aiBuildNextUnit","ledger","rows","aiBuildDegradation","context","bySlot","one","result","skip","degradedBy","notes","dropped","briefLines","aiBuildCreationNoun","undefined","degrade","some","blocks","pageBlocks","aiBuildPlacedItemLines","lines","aiBuildSettlement","delivered","open","failed","aiBuildRetryLedger","dependents","downstream","queue","shift","retried","again","note","settledAt","aiLedgerUnits","creations"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED,SACEA,8BAA8B,QAEzB,qDAAoD;AAC3D,SACEC,sBAAsB,EACtBC,cAAc,QAMT,qBAAiB;AAExB,SAASC,oBAAoB,EAAEC,oBAAoB,EAAEC,uBAAuB,QAAQ,mBAAe;AAEnG;;;;;;;;;;;;;;;;;CAiBC,GAED,sFAAsF,GACtF,OAAO,MAAMC,kBAAkB;IAC7B,yCAAyC,GACzCC,OAAO;IACPC,OAAO;IACP,8BAA8B,GAC9BC,WAAW;AACb,EAAU;AAEV,6FAA6F,GAC7F,OAAO,MAAMC,wBAA0D;IAAC;IAAU;IAAQ;IAAa;CAAQ,CAAA;AAE/G;;;CAGC,GACD,OAAO,MAAMC,0BAA6C;IAAC;OAAWD;CAAsB,CAAA;AAE5F,kFAAkF,GAClF,OAAO,MAAME,yBAAyB,UAAS;AAe/C,0CAA0C,GAC1C,SAASC,WAAWC,QAA2B;IAC7C,OAAOA,SAASC,IAAI;AACtB;AAEA,kEAAkE,GAClE,SAASC,WAAWC,IAAiB;QAKhBA;IAJnB,MAAMC,QAAQ,IAAIC;IAClBF,KAAKG,MAAM,CAACC,OAAO,CAAC,CAACP,UAAUQ;QAC7B,IAAIZ,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAGG,MAAMM,GAAG,CAACV,SAASW,IAAI,CAACC,WAAW,IAAI,CAAC,CAAC,EAAEJ,OAAO;IACvG;IACA,KAAK,MAAMK,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAEC,MAAMM,GAAG,CAACG,KAAKF,IAAI,CAACC,WAAW,IAAIC,KAAKE,IAAI;IACjF,OAAOX;AACT;AAEA,yDAAyD,GACzD,OAAO,SAASY,eAAeC,GAAW;IACxC,OAAOA,IAAIC,KAAK,CAAC/B,uBAAuBgC,MAAM,EAAEC,IAAI,GAAGR,WAAW;AACpE;AAEA,mGAAmG,GACnG,OAAO,SAASS,kBAAkBC,MAAyB;IACzD,OAAO;QACLA,OAAOC,MAAM;QACbD,OAAOE,QAAQ;QACfF,OAAOG,WAAW;WACfH,OAAOI,QAAQ,CAACC,OAAO,CAAC,CAACC,UAAYA,QAAQC,IAAI;KACrD,CAACC,MAAM,CAAC,CAACb,MAAuB,OAAOA,QAAQ,YAAYA,IAAIE,MAAM,GAAG;AAC3E;AAEA;;;;;CAKC,GACD,OAAO,SAASY,aAAa5B,IAAiB;QAiBzBA;IAhBnB,MAAMC,QAAQF,WAAWC;IACzB,MAAM6B,SAAS,CAACC,MAAkCC;QAChD,MAAMC,OAAiB,EAAE;QACzB,KAAK,MAAMlB,OAAOgB,KAAM;YACtB,IAAI,CAAC7C,eAAe6B,MAAM;YAC1B,MAAMF,OAAOX,MAAMgC,GAAG,CAACpB,eAAeC;YACtC,IAAIF,QAAQA,SAASmB,QAAQ,CAACC,KAAK1B,QAAQ,CAACM,OAAOoB,KAAKE,IAAI,CAACtB;QAC/D;QACA,OAAOoB;IACT;IACA,MAAM1C,QAAuB,EAAE;IAC/BU,KAAKG,MAAM,CAACC,OAAO,CAAC,CAACP,UAAUQ;QAC7B,IAAI,CAACZ,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAG;QACpD,MAAMc,OAAO,CAAC,CAAC,EAAEP,OAAO;QACxBf,MAAM4C,IAAI,CAAC;YAAEtB;YAAMuB,IAAIvC,WAAWC;YAAWuC,OAAOvC,SAASW,IAAI;YAAEX;YAAUmC,MAAMH,OAAO;gBAAChC,SAASyB,WAAW;aAAC,EAAEV;QAAM;IAC1H;IACA,KAAK,MAAMF,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnCV,MAAM4C,IAAI,CAAC;YAAEtB,MAAMF,KAAKE,IAAI;YAAEuB,IAAIzB,KAAKyB,EAAE;YAAEC,OAAO1B,KAAKF,IAAI;YAAEE;YAAMsB,MAAMH,OAAOnB,KAAK2B,SAAS,EAAE3B,KAAKE,IAAI;QAAE;IAC7G;IACAZ,KAAKsC,OAAO,CAAClC,OAAO,CAAC,CAACe,QAAQd;QAC5B,MAAMO,OAAO,CAAC,CAAC,EAAEP,OAAO;QACxBf,MAAM4C,IAAI,CAAC;YAAEtB;YAAMuB,IAAI;YAAQC,OAAOjB,OAAOoB,KAAK;YAAEpB;YAAQa,MAAMH,OAAOX,kBAAkBC,SAASP;QAAM;IAC5G;IACA,OAAOtB;AACT;AAEA;;;CAGC,GACD,OAAO,SAASkD,aAAalD,KAA6B;IACxD,MAAMmD,UAAyB,EAAE;IACjC,MAAMC,SAAS,IAAIC;IACnB,MAAMC,QAAQ,IAAID,IAAIrD,MAAMuD,GAAG,CAAC,CAACC,OAASA,KAAKlC,IAAI;IACnD,MAAO6B,QAAQzB,MAAM,GAAG1B,MAAM0B,MAAM,CAAE;QACpC,MAAM+B,OAAOzD,MAAM0D,IAAI,CACrB,CAACF,OAAS,CAACJ,OAAOO,GAAG,CAACH,KAAKlC,IAAI,KAAKkC,KAAKd,IAAI,CAACkB,KAAK,CAAC,CAACC,MAAQT,OAAOO,GAAG,CAACE,QAAQ,CAACP,MAAMK,GAAG,CAACE;QAE7F,IAAI,CAACJ,MAAM,OAAO;QAClBN,QAAQP,IAAI,CAACa;QACbL,OAAOU,GAAG,CAACL,KAAKnC,IAAI;IACtB;IACA,OAAO6B;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASY,qBAAqBrD,IAAiB;QAGjCA;IAFnB,MAAMsD,WAAqB,EAAE;IAC7B,MAAMrD,QAAQF,WAAWC;IACzB,KAAK,MAAMU,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnC,KAAK,MAAMc,OAAOJ,KAAK2B,SAAS,CAAE;YAChC,IAAI,CAACpD,eAAe6B,MAAM;YAC1B,IAAI,CAACb,MAAMgD,GAAG,CAACpC,eAAeC,OAAO;gBACnCwC,SAASpB,IAAI,CAAC,CAAC,UAAU,EAAExB,KAAKF,IAAI,CAAC,aAAa,EAAEM,IAAI,sEAAsE,CAAC;YACjI,OAAO,IAAID,eAAeC,SAASJ,KAAKF,IAAI,CAACC,WAAW,IAAI;gBAC1D6C,SAASpB,IAAI,CAAC,CAAC,UAAU,EAAExB,KAAKF,IAAI,CAAC,sDAAsD,CAAC;YAC9F;QACF;IACF;IACA,IAAI,CAACgC,aAAaZ,aAAa5B,QAAQ;QACrCsD,SAASpB,IAAI,CAAC;IAChB;IACA,OAAOoB;AACT;AAKA,uDAAuD,GACvD,OAAO,SAASC,iBAAiBC,SAAqC;IACpE,OAAOA,YAAYnE,gBAAgBG,SAAS,GAAGH,gBAAgBE,KAAK;AACtE;AAEA;;;;;;CAMC,GACD,OAAO,SAASkE,wBACdzD,IAAiB,EACjB0D,UAAqD,CAAC,CAAC;QAgCRC,aAC5B3D;IA/BnB,MAAMV,QAAQsC,aAAa5B;IAC3B,IAAI,CAACV,MAAM0B,MAAM,EAAE,OAAO;IAC1B,IAAI1B,MAAM0B,MAAM,GAAG3B,gBAAgBC,KAAK,EAAE;QACxC,OAAO,CAAC,iBAAiB,EAAEA,MAAM0B,MAAM,CAAC,6BAA6B,EAAE3B,gBAAgBC,KAAK,CAAC,uCAAuC,CAAC;IACvI;IACA,MAAMC,QAAQgE,iBAAiBG,QAAQF,SAAS;IAChD,IAAIxD,KAAKsC,OAAO,CAACtB,MAAM,GAAGzB,OAAO;QAC/B,OAAOmE,QAAQF,SAAS,GACpB,CAAC,iBAAiB,EAAExD,KAAKsC,OAAO,CAACtB,MAAM,CAAC,mDAAmD,EAAEzB,MAAM,4BAA4B,CAAC,GAChI,CAAC,iBAAiB,EAAES,KAAKsC,OAAO,CAACtB,MAAM,CAAC,oCAAoC,EAAEzB,MAAM,CAAC,CAAC;IAC5F;IACA,MAAMqE,QAAQ,IAAIjB;IAClB,KAAK,MAAMxB,UAAUnB,KAAKsC,OAAO,CAAE;QACjC,IAAI,CAACnB,OAAOI,QAAQ,CAACP,MAAM,EAAE,OAAO,CAAC,UAAU,EAAEG,OAAOoB,KAAK,CAAC,2BAA2B,CAAC;QAC1F,IAAIpB,OAAOI,QAAQ,CAACP,MAAM,GAAG9B,sBAAsB;YACjD,OAAO,CAAC,UAAU,EAAEiC,OAAOoB,KAAK,CAAC,MAAM,EAAEpB,OAAOI,QAAQ,CAACP,MAAM,CAAC,kCAAkC,EAAE9B,qBAAqB,CAAC,CAAC;QAC7H;QACA,MAAM2E,OAAO1C,OAAO0C,IAAI,CAAC5C,IAAI,GAAGR,WAAW;QAC3C,IAAImD,MAAMX,GAAG,CAACY,OAAO,OAAO,CAAC,yCAAyC,EAAE1C,OAAO0C,IAAI,CAAC,CAAC,CAAC;QACtFD,MAAMR,GAAG,CAACS;IACZ;IACA,KAAK,MAAMhE,YAAYG,KAAKG,MAAM,CAAE;QAClC,IAAI,CAACV,sBAAsBa,QAAQ,CAACT,SAASC,IAAI,GAAG;YAClD,OAAO,CAAC,wBAAwB,EAAED,SAASC,IAAI,KAAK,iBAAiB,kBAAkB,GAAGD,SAASC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAED,SAASW,IAAI,CAAC,0BAA0B,CAAC;QAC3J;IACF;IACA,MAAMsD,QAAQT,qBAAqBrD;IACnC,IAAI8D,MAAM9C,MAAM,EAAE,OAAO8C,KAAK,CAAC,EAAE;IACjC,MAAMC,MAAML,QAAQK,GAAG;IACvB,MAAMJ,SAAS,IAAIzD;IACnB,KAAK,MAAM4C,QAAQxD,MAAOqE,OAAOpD,GAAG,CAACuC,KAAKX,EAAE,EAAE,EAACwB,cAAAA,OAAO1B,GAAG,CAACa,KAAKX,EAAE,aAAlBwB,cAAuB,KAAK;IAC3E,KAAK,MAAMjD,SAAQV,cAAAA,KAAKW,KAAK,YAAVX,cAAc,EAAE,CAAE;QACnC,IAAIN,wBAAwBY,QAAQ,CAACI,KAAKyB,EAAE,GAAG;YAC7C,OAAOzB,KAAKyB,EAAE,KAAK,SACf,CAAC,CAAC,EAAEzB,KAAKF,IAAI,CAAC,2CAA2C,CAAC,GAC1D,CAAC,CAAC,EAAEE,KAAKF,IAAI,CAAC,KAAK,EAAEE,KAAKyB,EAAE,KAAK,UAAU,OAAO,IAAI,CAAC,EAAEzB,KAAKyB,EAAE,CAAC,+BAA+B,CAAC;QACvG;QACA,IAAI,CAAC4B,KAAK;QACV,MAAMC,aAAaD,IAAI9B,GAAG,CAACvB,KAAKyB,EAAE;QAClC,IAAI,CAAC6B,YAAY,OAAO,CAAC,+BAA+B,EAAEtD,KAAKF,IAAI,CAAC,GAAG,EAAEE,KAAKyB,EAAE,CAAC,wBAAwB,CAAC;QAC1G,IAAIuB,QAAQF,SAAS,IAAI,CAACQ,WAAWC,WAAW,EAAE;YAChD,OAAO,CAAC,6BAA6B,EAAEC,UAAUF,WAAWG,IAAI,EAAE,QAAQ,EAAEzD,KAAKF,IAAI,CAAC,yBAAyB,CAAC;QAClH;QACA,MAAM8C,WAAWvE,+BAA+BiF,WAAWI,UAAU,EAAE1D,KAAK2D,IAAI;QAChF,IAAIf,SAAStC,MAAM,EAAE,OAAO,CAAC,kBAAkB,EAAEN,KAAKF,IAAI,CAAC,eAAe,EAAE8C,SAASgB,IAAI,CAAC,MAAM,CAAC,CAAC;IACpG;IACA,IAAIP,KAAK;QACP,KAAK,MAAM,CAAC5B,IAAIoC,MAAM,IAAIZ,OAAQ;YAChC,MAAMK,aAAaD,IAAI9B,GAAG,CAACE;YAC3B,IAAI6B,cAAcO,QAAQP,WAAWQ,UAAU,EAAE;gBAC/C,OAAO,CAAC,gBAAgB,EAAED,MAAM,KAAK,EAAEP,WAAWG,IAAI,CAAC,+BAA+B,EAAEH,WAAWQ,UAAU,CAAC,CAAC,CAAC;YAClH;QACF;IACF;IACA,OAAO;AACT;AAEA,4CAA4C,GAC5C,OAAO,SAASN,UAAUC,IAAY;IACpC,OAAO,GAAG,YAAYM,IAAI,CAACN,QAAQ,OAAO,IAAI,CAAC,EAAEA,MAAM;AACzD;AAEA,gGAAgG,GAChG,SAASO,WAAW5B,IAAiB;IACnC,IAAIA,KAAK3B,MAAM,EAAE,OAAO2B,KAAK3B,MAAM,CAACI,QAAQ,CAACP,MAAM,GAAG;IACtD,OAAO;AACT;AAEA;;;;;CAKC,GACD,OAAO,SAAS2D,0BAA0B7B,IAAiB,EAAEiB,GAAgB;IAC3E,IAAIjB,KAAKpC,IAAI,EAAE;QACb,IAAI,OAAOoC,KAAKpC,IAAI,CAACkE,OAAO,KAAK,UAAU,OAAO9B,KAAKpC,IAAI,CAACkE,OAAO;QACnE,MAAMZ,aAAaD,uBAAAA,IAAK9B,GAAG,CAACa,KAAKpC,IAAI,CAACyB,EAAE;QACxC,IAAI6B,YAAY,OAAOa,KAAKC,GAAG,CAAC,GAAGD,KAAKE,KAAK,CAACf,WAAWgB,eAAe,CAAClC,KAAKpC,IAAI,CAAC2D,IAAI;QACvF,OAAOlF;IACT;IACA,OAAOuF,WAAW5B,QAAQ3D;AAC5B;AAEA;;;;CAIC,GACD,OAAO,SAAS8F,sBACdjF,IAAiB,EACjB0D,UAA6D,CAAC,CAAC;IAE/D,OAAO9B,aAAa5B,MACjB2B,MAAM,CAAC,CAACmB,OAAS,CAACY,QAAQzD,KAAK,IAAIyD,QAAQzD,KAAK,CAACgD,GAAG,CAACH,KAAKlC,IAAI,GAC9DsE,MAAM,CAAC,CAACC,OAAOrC,OAASqC,QAAQR,0BAA0B7B,MAAMY,QAAQK,GAAG,GAAG;AACnF;AAEA;;;CAGC,GACD,OAAO,SAASqB,oBAAoBtF,IAAY,EAAEE,IAAiB;IACjE,OAAOF,SAAS,UAAUmF,sBAAsBjF,QAAQZ,wBAAwBU,MAAME;AACxF;AAEA,6DAA6D,GAC7D,OAAO,SAASqF,qBAAqB/F,KAA6B;IAChE,OAAOA,MAAMuD,GAAG,CAAC,CAACC,OAAU,CAAA;YAC1BlC,MAAMkC,KAAKlC,IAAI;YACfuB,IAAIW,KAAKX,EAAE;YACXC,OAAOU,KAAKV,KAAK;YACjBkD,QAAQ;YACRC,SAAS;YACTC,cAAc;YACdC,gBAAgB;YAChBC,iBAAiB;YACjBC,SAAS;YACTC,SAAS,EAAE;QACb,CAAA;AACF;AAEA,MAAMC,OAAmC;IAAC;IAAW;CAAU;AAE/D,0CAA0C,GAC1C,OAAO,SAASC,gBAAgBC,GAAoC;IAClE,OAAOF,KAAKvF,QAAQ,CAACyF,IAAIT,MAAM;AACjC;AAEA,yFAAyF,GACzF,OAAO,SAASU,qBAAqBD,GAAoC;IACvE,OAAOA,IAAIT,MAAM,KAAK,eAAeS,IAAIT,MAAM,KAAK;AACtD;AAEA;;;;CAIC,GACD,OAAO,SAASW,gBACdxD,OAA+B,EAC/ByD,MAAkC;QAG3BzD;IADP,MAAM0D,OAAO,IAAIjG,IAAIgG,OAAOrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IACxD,QAAOtD,gBAAAA,QAAQO,IAAI,CAAC,CAACF;QACnB,MAAMiD,MAAMI,KAAKlE,GAAG,CAACa,KAAKlC,IAAI;QAC9B,OAAO,CAACmF,OAAOD,gBAAgBC;IACjC,cAHOtD,gBAGD;AACR;AAgBA;;;;;;;;;CASC,GACD,OAAO,SAAS2D,mBACdtD,IAAiB,EACjBuD,OAIC;IAED,MAAMF,OAAO,IAAIjG,IAAImG,QAAQH,MAAM,CAACrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IAChE,MAAMO,SAAS,IAAIpG,IAAImG,QAAQ/G,KAAK,CAACuD,GAAG,CAAC,CAAC0D,MAAQ;YAACA,IAAI3F,IAAI;YAAE2F;SAAI;IACjE,MAAMC,SAA6B;QAAEC,MAAM;QAAMC,YAAY,EAAE;QAAEC,OAAO,EAAE;QAAEC,SAAS,IAAIjE;QAAOkE,YAAY,EAAE;IAAC;IAC/G,KAAK,MAAMjG,QAAQkC,KAAKd,IAAI,CAAE;kBAQZmB;YAFXkD,kBAAAA,cACyBA,eACdlD,WAA6CA,eAQzDA;QAfJ,MAAMA,MAAMmD,OAAOrE,GAAG,CAACrB;QACvB,MAAMmF,MAAMI,KAAKlE,GAAG,CAACrB;QACrB,IAAI,CAACuC,OAAO,CAAC4C,OAAOC,qBAAqBD,MAAM;QAC/C,MAAM5B,OAAOhB,IAAItD,QAAQ,GACrBiH,oBAAoB3D,IAAItD,QAAQ,CAACC,IAAI,aACpCuG,eAAAA,QAAQtC,GAAG,sBAAXsC,mBAAAA,aAAapE,GAAG,CAACkB,IAAIhB,EAAE,sBAAvBkE,iBAA0BlC,IAAI,mBAAIhB,IAAIhB,EAAE;QAC7C,MAAM6B,aAAab,IAAIzC,IAAI,IAAG2F,gBAAAA,QAAQtC,GAAG,qBAAXsC,cAAapE,GAAG,CAACkB,IAAIhB,EAAE,IAAI4E;QACzD,MAAMC,WAAU7D,kBAAAA,YAAAA,IAAIzC,IAAI,qBAARyC,UAAU6D,OAAO,oBAAIhD,8BAAAA,WAAYgD,OAAO,YAAxC7D,QAA6CA,EAAAA,gBAAAA,IAAItD,QAAQ,qBAAZsD,cAAcrD,IAAI,MAAK,WAAW,aAAa;QAC5G,IAAI,CAACgD,KAAK3B,MAAM,IAAI6F,YAAY,QAAQ;YACtCR,OAAOC,IAAI,GAAG,CAAC,eAAe,EAAEtC,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,gCAAgC,CAAC;YACpFoE,OAAOE,UAAU,CAACxE,IAAI,CAACtB;YACvB,OAAO4F;QACT;QACAA,OAAOE,UAAU,CAACxE,IAAI,CAACtB;QACvB4F,OAAOI,OAAO,CAACxD,GAAG,CAACD,IAAIf,KAAK,CAAC3B,WAAW;QACxC,IAAI0C,EAAAA,iBAAAA,IAAItD,QAAQ,qBAAZsD,eAAcrD,IAAI,MAAK,UAAU;YACnC0G,OAAOG,KAAK,CAACzE,IAAI,CAAC,CAAC,gDAAgD,EAAEiB,IAAIf,KAAK,CAAC,uBAAuB,CAAC;YACvG;QACF;QACA,IAAIU,KAAK3B,MAAM,EAAE;gBAIA6C;YAHf,MAAMvC,UAAUqB,KAAK3B,MAAM,CAACI,QAAQ,CAACyB,IAAI,CAAC,CAACuD,MACzCA,IAAI7E,IAAI,CAACuF,IAAI,CAAC,CAACnG,MAAQ7B,eAAe6B,QAAQD,eAAeC,SAASqC,IAAIf,KAAK,CAAC3B,WAAW;YAE7F,MAAMyG,SAASlD,CAAAA,+BAAAA,yBAAAA,WAAYmD,UAAU,qBAAtBnD,uBAAwBhD,MAAM,IAAG,CAAC,KAAK,EAAEgD,WAAWmD,UAAU,CAAC7C,IAAI,CAAC,QAAQ,MAAM,CAAC,GAAG;YACrGkC,OAAOG,KAAK,CAACzE,IAAI,CACf,CAAC,aAAa,EAAEgF,UAAU,CAAC,KAAK,EAAE/C,MAAM,CAAC,MAAM,EAAEA,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,uBAAuB,CAAC;YAE9FoE,OAAOK,UAAU,CAAC3E,IAAI,CACpB,GAAGT,UAAU,CAAC,WAAW,EAAEA,QAAQjB,IAAI,CAAC,SAAS,CAAC,GAAG,iBAAiB,aAAa,EAAE2D,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,CAAC,EAAE8E,SAAS,CAAC,YAAY,EAAEA,QAAQ,GAAG,GAAG,0BAA0B,CAAC;QAEhL,OAAO;YACLV,OAAOG,KAAK,CAACzE,IAAI,CAAC,CAAC,kBAAkB,EAAEiC,KAAK,EAAE,EAAEhB,IAAIf,KAAK,CAAC,2BAA2B,CAAC;QACxF;IACF;IACA,OAAOoE;AACT;AAEA,4CAA4C,GAC5C,OAAO,SAASM,oBAAoBhH,IAA2B;IAC7D,OAAOA,SAAS,UAAU,iBAAiBA,SAAS,iBAAiB,iBAAiBA;AACxF;AAEA;;;CAGC,GACD,OAAO,SAASsH,uBACdtE,IAAiB,EACjBuD,OAAgG;IAEhG,IAAI,CAACvD,KAAK3B,MAAM,EAAE,OAAO,EAAE;IAC3B,MAAMgF,OAAO,IAAIjG,IAAImG,QAAQH,MAAM,CAACrD,GAAG,CAAC,CAACkD,MAAQ;YAACA,IAAInF,IAAI;YAAEmF;SAAI;IAChE,MAAMsB,QAAkB,EAAE;IAC1B,KAAK,MAAM5F,WAAWqB,KAAK3B,MAAM,CAACI,QAAQ,CAAE;QAC1C,KAAK,MAAMT,OAAOW,QAAQC,IAAI,CAAE;;gBAMX2E;YALnB,IAAI,CAACpH,eAAe6B,MAAM;YAC1B,MAAMqC,MAAMkD,QAAQ/G,KAAK,CAAC0D,IAAI,CAAC,CAACuD,MAAQA,IAAI7F,IAAI,IAAI6F,IAAI7F,IAAI,CAACF,IAAI,CAACC,WAAW,OAAOI,eAAeC;YACnG,IAAI,EAACqC,uBAAAA,IAAKzC,IAAI,GAAE;YAChB,MAAMqF,MAAMI,KAAKlE,GAAG,CAACkB,IAAIvC,IAAI;YAC7B,IAAI,CAACmF,OAAO,CAACC,qBAAqBD,MAAM;YACxC,MAAM/B,cAAaqC,eAAAA,QAAQtC,GAAG,qBAAXsC,aAAapE,GAAG,CAACkB,IAAIhB,EAAE;YAC1C,MAAM+E,iBAASlD,8BAAAA,WAAYmD,UAAU,mBAAI,EAAE;YAC3C,IAAI,CAACD,OAAOlG,MAAM,EAAE;YACpBqG,MAAMnF,IAAI,CACR,CAAC,QAAQ,EAAET,QAAQjB,IAAI,CAAC,qBAAqB,EAAE0G,OAAO5C,IAAI,CAAC,QAAQ,eAAe,WAAEN,8BAAAA,WAAYG,IAAI,oBAAIhB,IAAIhB,EAAE,CAAC,EAAE,EAAEgB,IAAIf,KAAK,CAAC,EAAE,CAAC;QAEpI;IACF;IACA,OAAOiF;AACT;AAEA,wFAAwF,GACxF,OAAO,SAASC,kBAAkBpB,MAAkC;IAKlE,OAAO;QACLqB,WAAWrB,OAAOe,IAAI,CAACjB;QACvBwB,MAAMtB,OAAOe,IAAI,CAACnB;QAClB2B,QAAQvB,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAIT,MAAM,KAAK,UAAUtE,MAAM;IAChE;AACF;AAEA;;;;;;;CAOC,GACD,OAAO,SAAS0G,mBACdxB,MAAkC,EAClC5G,KAA6B;IAE7B,MAAMmI,SAAS,IAAI9E,IAAIuD,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAIT,MAAM,KAAK,UAAUzC,GAAG,CAAC,CAACkD,MAAQA,IAAInF,IAAI;IAC5F,MAAM+G,aAAa,IAAIzH;IACvB,KAAK,MAAM4C,QAAQxD,MAAO;YAC8BqI;QAAtD,KAAK,MAAMxE,OAAOL,KAAKd,IAAI,CAAE2F,WAAWpH,GAAG,CAAC4C,KAAK;gBAAKwE,kBAAAA,WAAW1F,GAAG,CAACkB,gBAAfwE,kBAAuB,EAAE;YAAG7E,KAAKlC,IAAI;SAAC;IAC9F;IACA,wDAAwD;IACxD,MAAMgH,aAAa,IAAIjF;IACvB,MAAMkF,QAAQ;WAAIJ;KAAO;IACzB,MAAOI,MAAM7G,MAAM,CAAE;YAEA2G;QADnB,MAAM/G,OAAOiH,MAAMC,KAAK;QACxB,KAAK,MAAM/E,SAAQ4E,mBAAAA,WAAW1F,GAAG,CAACrB,iBAAf+G,mBAAwB,EAAE,CAAE;YAC7C,IAAIC,WAAW3E,GAAG,CAACF,OAAO;YAC1B6E,WAAWxE,GAAG,CAACL;YACf8E,MAAM3F,IAAI,CAACa;QACb;IACF;IACA,MAAMgF,UAAoB,EAAE;IAC5B,MAAMhF,OAAOmD,OAAOrD,GAAG,CAAC,CAACkD;YAGuCA;QAF9D,MAAMiC,QACJjC,IAAIT,MAAM,KAAK,YACdS,IAAIT,MAAM,KAAK,aAAcsC,CAAAA,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAK,CAAC,EAACmF,kBAAAA,IAAIW,UAAU,YAAdX,kBAAkB,EAAE,EAAE/E,MAAM,AAAD,KACtF+E,IAAIT,MAAM,KAAK,cAAcsC,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAK,CAACmF,IAAIH,OAAO,CAAC5E,MAAM;QAC/E,IAAIgH,OAAO;YACTD,QAAQ7F,IAAI,CAAC6D,IAAInF,IAAI;YACrB,OAAO,aACFmF;gBACHT,QAAQ;gBACRC,SAASQ,IAAIR,OAAO,GAAG;gBACvBE,gBAAgB;gBAChBE,SAAS;gBACTsC,MAAM;gBACNvB,YAAY,EAAE;gBACdwB,WAAW;;QAEf;QACA,IAAInC,IAAIT,MAAM,KAAK,cAAcsC,WAAW3E,GAAG,CAAC8C,IAAInF,IAAI,KAAKmF,IAAIH,OAAO,CAAC5E,MAAM,EAAE;YAC/E,OAAO,aACF+E;gBACHkC,MAAM,GAAGlC,IAAIkC,IAAI,GAAG,GAAGlC,IAAIkC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,qFAAqF,CAAC;;QAElI;QACA,OAAOlC;IACT;IACA,OAAO;QAAEG,QAAQnD;QAAMgF;IAAQ;AACjC;AAEA;;;;CAIC,GACD,OAAO,SAASI,cAAcjC,MAAkC;IAC9D,MAAMkC,YAAYlC,OAAOvE,MAAM,CAAC,CAACoE,MAAQA,IAAI5D,EAAE,KAAK,YAAY4D,IAAI5D,EAAE,KAAK,QAAQU,GAAG,CAAC,CAACkD,MAAQA,IAAInF,IAAI;IACxG,OAAOsF,OAAOrD,GAAG,CAAC,CAACkD,MAAS,CAAA;YAC1BnF,MAAMmF,IAAInF,IAAI;YACduB,IAAI4D,IAAI5D,EAAE;YACVC,OAAO2D,IAAI3D,KAAK;YAChBJ,MAAM+D,IAAI5D,EAAE,KAAK,SAASiG,YAAY,EAAE;QAC1C,CAAA;AACF"}