@substrate-ai/factory 0.19.54

package/dist/graph/condition-parser.js

@@ -0,0 +1,213 @@
+/**
+ * Condition expression parser and evaluator for the factory graph engine.
+ *
+ * Grammar (Attractor Spec §10, extended in story 44-5):
+ *   condition      ::= clause ('&&' clause)*
+ *   clause         ::= key op value
+ *   key            ::= [a-zA-Z_][a-zA-Z0-9_]*
+ *   op             ::= '=' | '!=' | '>=' | '<=' | '>' | '<'
+ *   value          ::= quoted_string | unquoted_token
+ *   quoted_string  ::= '"' [^"]* '"' | "'" [^']* "'"
+ *   unquoted_token ::= [^\s&&]+
+ *
+ * Numeric operators (>=, <=, >, <) coerce context values to Number and compare.
+ * String operators (=, !=) retain existing case-sensitive string-equality semantics.
+ * Missing context keys resolve to "" for = / != and NaN for numeric operators.
+ * Only && conjunction is supported; || is out of scope.
+ *
+ * Story 42-6, extended in story 44-5.
+ */
+// ---------------------------------------------------------------------------
+// ConditionParseError
+// ---------------------------------------------------------------------------
+/**
+ * Thrown by `parseCondition` when a condition string does not conform
+ * to the supported grammar.
+ */
+export class ConditionParseError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'ConditionParseError';
+    }
+}
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+/**
+ * Strip surrounding single or double quotes from a value string.
+ * Returns the original string unchanged if it is not a quoted string.
+ */
+function stripQuotes(value) {
+    if (value.length >= 2) {
+        if ((value.startsWith('"') && value.endsWith('"')) ||
+            (value.startsWith("'") && value.endsWith("'"))) {
+            return value.slice(1, -1);
+        }
+    }
+    return value;
+}
+/**
+ * Parse a single clause string into a `ConditionClause`.
+ * Throws `ConditionParseError` for invalid syntax.
+ *
+ * Operator matching order (two-character before one-character to avoid mis-parsing):
+ *   >=  <=  !=  >  <  =
+ */
+function parseClause(clauseStr) {
+    const trimmed = clauseStr.trim();
+    if (trimmed === '') {
+        throw new ConditionParseError(`Empty clause in condition; each clause must be in the form 'key=value' or 'key!=value'`);
+    }
+    // Detect double-equals (invalid operator) — check before any single-= matching
+    if (trimmed.includes('==')) {
+        throw new ConditionParseError(`Invalid operator '==' in clause '${trimmed}'; use '=' for equality comparison`);
+    }
+    // --- Two-character operators (must be checked BEFORE single-character) ---
+    // Try >= operator
+    const gteMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*>=\s*(.*)$/.exec(trimmed);
+    if (gteMatch) {
+        const key = gteMatch[1];
+        const rawValue = gteMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key>=value'`);
+        }
+        return { key, op: '>=', value: stripQuotes(rawValue) };
+    }
+    // Try <= operator
+    const lteMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*<=\s*(.*)$/.exec(trimmed);
+    if (lteMatch) {
+        const key = lteMatch[1];
+        const rawValue = lteMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key<=value'`);
+        }
+        return { key, op: '<=', value: stripQuotes(rawValue) };
+    }
+    // Try != operator (must precede = check to avoid false match on the '=' within '!=')
+    const neqMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*!=\s*(.*)$/.exec(trimmed);
+    if (neqMatch) {
+        const key = neqMatch[1];
+        const rawValue = neqMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key!=value'`);
+        }
+        return { key, op: '!=', value: stripQuotes(rawValue) };
+    }
+    // --- Single-character operators ---
+    // Try > operator (single, after >= has been excluded)
+    const gtMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*>\s*(.*)$/.exec(trimmed);
+    if (gtMatch) {
+        const key = gtMatch[1];
+        const rawValue = gtMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key>value'`);
+        }
+        return { key, op: '>', value: stripQuotes(rawValue) };
+    }
+    // Try < operator (single, after <= has been excluded)
+    const ltMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*<\s*(.*)$/.exec(trimmed);
+    if (ltMatch) {
+        const key = ltMatch[1];
+        const rawValue = ltMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key<value'`);
+        }
+        return { key, op: '<', value: stripQuotes(rawValue) };
+    }
+    // Try = operator (single equality, after all compound operators)
+    const eqMatch = /^([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*(.*)$/.exec(trimmed);
+    if (eqMatch) {
+        const key = eqMatch[1];
+        const rawValue = eqMatch[2].trim();
+        if (rawValue === '') {
+            throw new ConditionParseError(`Missing value in clause '${trimmed}'; expected 'key=value'`);
+        }
+        return { key, op: '=', value: stripQuotes(rawValue) };
+    }
+    throw new ConditionParseError(`Invalid clause syntax: '${trimmed}'; expected 'key=value', 'key!=value', or a numeric comparison`);
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Parse a condition expression string into a `ParsedCondition` (array of clauses).
+ *
+ * @param conditionStr - The condition string to parse (e.g. `"outcome=success && iteration!=0"`).
+ * @returns An array of `ConditionClause` objects representing the conjunction.
+ * @throws `ConditionParseError` if the string is empty, contains an empty clause,
+ *   uses an invalid operator (`==`), or otherwise does not conform to the grammar.
+ */
+export function parseCondition(conditionStr) {
+    if (!conditionStr || conditionStr.trim() === '') {
+        throw new ConditionParseError('Condition string must not be empty');
+    }
+    const clauseStrings = conditionStr.split('&&');
+    const clauses = [];
+    for (const clauseStr of clauseStrings) {
+        clauses.push(parseClause(clauseStr));
+    }
+    return clauses;
+}
+/**
+ * Evaluate a condition expression against a runtime context.
+ *
+ * String operators (=, !=): context values are coerced to strings via String().
+ *   Context keys absent from context resolve to "" (empty string).
+ *
+ * Numeric operators (>=, <=, >, <): context values are coerced to numbers via Number().
+ *   Absent keys or non-numeric values produce NaN, which causes the comparison to return false.
+ *   The clause value is parsed via parseFloat().
+ *
+ * Returns `true` only if every clause in the conjunction passes.
+ *
+ * @param conditionStr - The condition string to evaluate.
+ * @param context      - Key/value map of the current runtime context.
+ * @returns `true` if all clauses evaluate to true, `false` otherwise.
+ * @throws `ConditionParseError` if `conditionStr` has invalid syntax.
+ */
+export function evaluateCondition(conditionStr, context) {
+    const clauses = parseCondition(conditionStr);
+    for (const clause of clauses) {
+        const rawValue = context[clause.key];
+        if (clause.op === '=' || clause.op === '!=') {
+            // String equality — coerce context value to string; absent keys → ""
+            const contextStr = rawValue !== undefined ? String(rawValue) : '';
+            if (clause.op === '=') {
+                if (contextStr !== clause.value)
+                    return false;
+            }
+            else {
+                // '!='
+                if (contextStr === clause.value)
+                    return false;
+            }
+        }
+        else {
+            // Numeric comparison — coerce context value to number; absent/non-numeric → NaN → false
+            const numContextValue = rawValue !== undefined ? Number(rawValue) : NaN;
+            const numClauseValue = parseFloat(clause.value);
+            if (Number.isNaN(numContextValue) || Number.isNaN(numClauseValue))
+                return false;
+            switch (clause.op) {
+                case '>=':
+                    if (!(numContextValue >= numClauseValue))
+                        return false;
+                    break;
+                case '<=':
+                    if (!(numContextValue <= numClauseValue))
+                        return false;
+                    break;
+                case '>':
+                    if (!(numContextValue > numClauseValue))
+                        return false;
+                    break;
+                case '<':
+                    if (!(numContextValue < numClauseValue))
+                        return false;
+                    break;
+            }
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=condition-parser.js.map

package/dist/graph/condition-parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition-parser.js","sourceRoot":"","sources":["../../src/graph/condition-parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IAC5C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAA;IACnC,CAAC;CACF;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAa;IAChC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,IACE,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC9C,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAC9C,CAAC;YACD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,SAAiB;IACpC,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,CAAA;IAEhC,IAAI,OAAO,KAAK,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,mBAAmB,CAC3B,wFAAwF,CACzF,CAAA;IACH,CAAC;IAED,+EAA+E;IAC/E,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,mBAAmB,CAC3B,oCAAoC,OAAO,oCAAoC,CAChF,CAAA;IACH,CAAC;IAED,4EAA4E;IAE5E,kBAAkB;IAClB,MAAM,QAAQ,GAAG,wCAAwC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACvE,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACpC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,0BAA0B,CAC9D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACxD,CAAC;IAED,kBAAkB;IAClB,MAAM,QAAQ,GAAG,wCAAwC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACvE,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACpC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,0BAA0B,CAC9D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACxD,CAAC;IAED,qFAAqF;IACrF,MAAM,QAAQ,GAAG,wCAAwC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACvE,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACpC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,0BAA0B,CAC9D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACxD,CAAC;IAED,qCAAqC;IAErC,sDAAsD;IACtD,MAAM,OAAO,GAAG,uCAAuC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACrE,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;QACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACnC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,yBAAyB,CAC7D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACvD,CAAC;IAED,sDAAsD;IACtD,MAAM,OAAO,GAAG,uCAAuC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACrE,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;QACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACnC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,yBAAyB,CAC7D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACvD,CAAC;IAED,iEAAiE;IACjE,MAAM,OAAO,GAAG,uCAAuC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACrE,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;QACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAA;QACnC,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,mBAAmB,CAC3B,4BAA4B,OAAO,yBAAyB,CAC7D,CAAA;QACH,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAA;IACvD,CAAC;IAED,MAAM,IAAI,mBAAmB,CAC3B,2BAA2B,OAAO,gEAAgE,CACnG,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,YAAoB;IACjD,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,mBAAmB,CAAC,oCAAoC,CAAC,CAAA;IACrE,CAAC;IAED,MAAM,aAAa,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9C,MAAM,OAAO,GAAsB,EAAE,CAAA;IAErC,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;QACtC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAA;IACtC,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAAoB,EACpB,OAAgC;IAEhC,MAAM,OAAO,GAAG,cAAc,CAAC,YAAY,CAAC,CAAA;IAE5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAEpC,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;YAC5C,qEAAqE;YACrE,MAAM,UAAU,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACjE,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;gBACtB,IAAI,UAAU,KAAK,MAAM,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAA;YAC/C,CAAC;iBAAM,CAAC;gBACN,OAAO;gBACP,IAAI,UAAU,KAAK,MAAM,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAA;YAC/C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wFAAwF;YACxF,MAAM,eAAe,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;YACvE,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAC/C,IAAI,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC;gBAAE,OAAO,KAAK,CAAA;YAC/E,QAAQ,MAAM,CAAC,EAAE,EAAE,CAAC;gBAClB,KAAK,IAAI;oBACP,IAAI,CAAC,CAAC,eAAe,IAAI,cAAc,CAAC;wBAAE,OAAO,KAAK,CAAA;oBACtD,MAAK;gBACP,KAAK,IAAI;oBACP,IAAI,CAAC,CAAC,eAAe,IAAI,cAAc,CAAC;wBAAE,OAAO,KAAK,CAAA;oBACtD,MAAK;gBACP,KAAK,GAAG;oBACN,IAAI,CAAC,CAAC,eAAe,GAAG,cAAc,CAAC;wBAAE,OAAO,KAAK,CAAA;oBACrD,MAAK;gBACP,KAAK,GAAG;oBACN,IAAI,CAAC,CAAC,eAAe,GAAG,cAAc,CAAC;wBAAE,OAAO,KAAK,CAAA;oBACrD,MAAK;YACT,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/graph/context.d.ts

@@ -0,0 +1,53 @@
+/**
+ * GraphContext — concrete key-value store for graph node execution state.
+ *
+ * Implements `IGraphContext` using a private `Map<string, unknown>` as the
+ * backing store. Each `clone()` call produces a fully independent instance
+ * so mutations never propagate between parent and child contexts.
+ *
+ * Story 42-8.
+ */
+import type { IGraphContext } from './types.js';
+export declare class GraphContext implements IGraphContext {
+    /** Internal backing store. Never exposed directly to callers. */
+    private readonly _store;
+    /**
+     * @param initial Optional seed values loaded into the store on construction.
+     */
+    constructor(initial?: Record<string, unknown>);
+    /** Return stored value, or `undefined` if the key is absent. */
+    get(key: string): unknown;
+    /** Store value; overwrites if the key already exists. */
+    set(key: string, value: unknown): void;
+    /**
+     * Return String-coerced value, or `defaultValue` (defaults to `""`) if the
+     * key is absent.
+     */
+    getString(key: string, defaultValue?: string): string;
+    /**
+     * Return Number-coerced value, or `defaultValue` (defaults to `0`) if the
+     * key is absent or the coerced result is NaN.
+     */
+    getNumber(key: string, defaultValue?: number): number;
+    /**
+     * Return Boolean-coerced value, or `defaultValue` (defaults to `false`) if
+     * the key is absent.
+     */
+    getBoolean(key: string, defaultValue?: boolean): boolean;
+    /**
+     * Merge all entries from `updates` into the store.
+     * Pre-existing keys not in `updates` are left unchanged.
+     */
+    applyUpdates(updates: Record<string, unknown>): void;
+    /**
+     * Return a shallow-copied plain object of all current key-value pairs.
+     * Modifying the returned object does not affect the internal store.
+     */
+    snapshot(): Record<string, unknown>;
+    /**
+     * Return a completely independent copy backed by its own `Map`.
+     * Mutations on the clone do not affect this instance, and vice-versa.
+     */
+    clone(): IGraphContext;
+}
+//# sourceMappingURL=context.d.ts.map

package/dist/graph/context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../../src/graph/context.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAE/C,qBAAa,YAAa,YAAW,aAAa;IAChD,iEAAiE;IACjE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAsB;IAE7C;;OAEG;gBACS,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAS7C,gEAAgE;IAChE,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,yDAAyD;IACzD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAItC;;;OAGG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM;IAOrD;;;OAGG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM;IAWrD;;;OAGG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,OAAO,GAAG,OAAO;IAOxD;;;OAGG;IACH,YAAY,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAMpD;;;OAGG;IACH,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAInC;;;OAGG;IACH,KAAK,IAAI,aAAa;CAGvB"}

package/dist/graph/context.js

@@ -0,0 +1,90 @@
+/**
+ * GraphContext — concrete key-value store for graph node execution state.
+ *
+ * Implements `IGraphContext` using a private `Map<string, unknown>` as the
+ * backing store. Each `clone()` call produces a fully independent instance
+ * so mutations never propagate between parent and child contexts.
+ *
+ * Story 42-8.
+ */
+export class GraphContext {
+    /** Internal backing store. Never exposed directly to callers. */
+    _store;
+    /**
+     * @param initial Optional seed values loaded into the store on construction.
+     */
+    constructor(initial) {
+        this._store = new Map();
+        if (initial) {
+            for (const [key, value] of Object.entries(initial)) {
+                this._store.set(key, value);
+            }
+        }
+    }
+    /** Return stored value, or `undefined` if the key is absent. */
+    get(key) {
+        return this._store.get(key);
+    }
+    /** Store value; overwrites if the key already exists. */
+    set(key, value) {
+        this._store.set(key, value);
+    }
+    /**
+     * Return String-coerced value, or `defaultValue` (defaults to `""`) if the
+     * key is absent.
+     */
+    getString(key, defaultValue) {
+        if (!this._store.has(key)) {
+            return defaultValue ?? '';
+        }
+        return String(this._store.get(key));
+    }
+    /**
+     * Return Number-coerced value, or `defaultValue` (defaults to `0`) if the
+     * key is absent or the coerced result is NaN.
+     */
+    getNumber(key, defaultValue) {
+        if (!this._store.has(key)) {
+            return defaultValue ?? 0;
+        }
+        const n = Number(this._store.get(key));
+        if (Number.isNaN(n)) {
+            return defaultValue ?? 0;
+        }
+        return n;
+    }
+    /**
+     * Return Boolean-coerced value, or `defaultValue` (defaults to `false`) if
+     * the key is absent.
+     */
+    getBoolean(key, defaultValue) {
+        if (!this._store.has(key)) {
+            return defaultValue ?? false;
+        }
+        return Boolean(this._store.get(key));
+    }
+    /**
+     * Merge all entries from `updates` into the store.
+     * Pre-existing keys not in `updates` are left unchanged.
+     */
+    applyUpdates(updates) {
+        for (const [key, value] of Object.entries(updates)) {
+            this._store.set(key, value);
+        }
+    }
+    /**
+     * Return a shallow-copied plain object of all current key-value pairs.
+     * Modifying the returned object does not affect the internal store.
+     */
+    snapshot() {
+        return Object.fromEntries(this._store);
+    }
+    /**
+     * Return a completely independent copy backed by its own `Map`.
+     * Mutations on the clone do not affect this instance, and vice-versa.
+     */
+    clone() {
+        return new GraphContext(this.snapshot());
+    }
+}
+//# sourceMappingURL=context.js.map

package/dist/graph/context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.js","sourceRoot":"","sources":["../../src/graph/context.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,MAAM,OAAO,YAAY;IACvB,iEAAiE;IAChD,MAAM,CAAsB;IAE7C;;OAEG;IACH,YAAY,OAAiC;QAC3C,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAA;QACxC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC7B,CAAC;IAED,yDAAyD;IACzD,GAAG,CAAC,GAAW,EAAE,KAAc;QAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAC7B,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,GAAW,EAAE,YAAqB;QAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,YAAY,IAAI,EAAE,CAAA;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACrC,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,GAAW,EAAE,YAAqB;QAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,YAAY,IAAI,CAAC,CAAA;QAC1B,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACtC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,OAAO,YAAY,IAAI,CAAC,CAAA;QAC1B,CAAC;QACD,OAAO,CAAC,CAAA;IACV,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,GAAW,EAAE,YAAsB;QAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,YAAY,IAAI,KAAK,CAAA;QAC9B,CAAC;QACD,OAAO,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACtC,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,OAAgC;QAC3C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACxC,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IAC1C,CAAC;CACF"}

package/dist/graph/edge-selector.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Edge selection algorithm for the factory graph engine.
+ *
+ * Implements the 5-step Attractor spec priority order (Section 3.3):
+ *   1. Condition-matched edges (highest priority)
+ *   2. Preferred label match on unconditional edges
+ *   3. Suggested next IDs on unconditional edges
+ *   4. Highest weight among unconditional edges
+ *   5. Lexically-first target ID as tiebreak for Step 4
+ *
+ * Story 42-12.
+ */
+import type { GraphNode, GraphEdge, Graph, IGraphContext, Outcome } from './types.js';
+import type { TypedEventBus } from '@substrate-ai/core';
+import type { FactoryEvents } from '../events.js';
+/**
+ * Normalize an edge label for preferred-label matching.
+ *
+ * Lowercases and trims the input, then strips an accelerator prefix if present:
+ *   - `[K] ` — bracket-enclosed single character followed by whitespace
+ *   - `K) `  — single character followed by `)` and whitespace
+ *   - `K - ` — single character followed by optional whitespace, `-`, optional whitespace
+ *
+ * Patterns are matched after lowercasing, so the regex uses only `[a-z]`.
+ *
+ * @param label - Raw edge label string.
+ * @returns Normalized label string.
+ */
+export declare function normalizeLabel(label: string): string;
+/**
+ * Return the "best" edge from a non-empty array:
+ *   - highest `weight` (treating missing weight as 0)
+ *   - lexically-first `toNode` as a tiebreak (ascending alphabetical)
+ *
+ * Does not mutate the input array.
+ *
+ * @param edges - Non-empty array of candidate edges (caller guarantees length ≥ 1).
+ * @returns The winning `GraphEdge`.
+ */
+export declare function bestByWeightThenLexical(edges: GraphEdge[]): GraphEdge;
+/**
+ * Optional configuration for `selectEdge`.
+ */
+export interface SelectEdgeOptions {
+    /**
+     * Injectable LLM call function for testability.
+     * In production, defaults to calling `callLLM` from `@substrate-ai/core`
+     * using the node's `llmModel` / `llmProvider` attributes.
+     */
+    llmCall?: (prompt: string) => Promise<string>;
+    /** Optional event bus for emitting graph:llm-edge-evaluated events (story 50-9). */
+    eventBus?: TypedEventBus<FactoryEvents>;
+    /** Optional run identifier included in emitted event payloads (story 50-9). */
+    runId?: string;
+}
+/**
+ * Select the best outgoing edge from `node` according to the 5-step Attractor spec.
+ *
+ * Step 1: Condition-matched edges — highest weight, lexical tiebreak.
+ *         Edges with `llm:` prefix conditions are evaluated via LLM call.
+ * Step 2: Preferred label match on unconditional edges — first match wins.
+ * Step 3: Suggested next IDs on unconditional edges — first suggestedNextId wins.
+ * Step 4: Highest weight among all unconditional edges.
+ * Step 5: Lexically-first target node ID as tiebreak for Step 4.
+ *
+ * @param node    - The current graph node.
+ * @param outcome - The outcome returned by the node's handler.
+ * @param context - The current execution context (used for condition evaluation).
+ * @param graph   - The full graph (source of edges).
+ * @param options - Optional injectable overrides (e.g. llmCall for testing).
+ * @returns The selected `GraphEdge`, or `null` if no outgoing edges exist.
+ */
+export declare function selectEdge(node: GraphNode, outcome: Outcome, context: IGraphContext, graph: Graph, options?: SelectEdgeOptions): Promise<GraphEdge | null>;
+//# sourceMappingURL=edge-selector.d.ts.map

package/dist/graph/edge-selector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-selector.d.ts","sourceRoot":"","sources":["../../src/graph/edge-selector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,YAAY,CAAA;AAIrF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AACvD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAMjD;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAQpD;AAMD;;;;;;;;;GASG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,SAAS,CASrE;AAMD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7C,oFAAoF;IACpF,QAAQ,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,CAAA;IACvC,+EAA+E;IAC/E,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAMD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,UAAU,CAC9B,IAAI,EAAE,SAAS,EACf,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,aAAa,EACtB,KAAK,EAAE,KAAK,EACZ,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAsG3B"}

package/dist/graph/edge-selector.js

@@ -0,0 +1,178 @@
+/**
+ * Edge selection algorithm for the factory graph engine.
+ *
+ * Implements the 5-step Attractor spec priority order (Section 3.3):
+ *   1. Condition-matched edges (highest priority)
+ *   2. Preferred label match on unconditional edges
+ *   3. Suggested next IDs on unconditional edges
+ *   4. Highest weight among unconditional edges
+ *   5. Lexically-first target ID as tiebreak for Step 4
+ *
+ * Story 42-12.
+ */
+import { evaluateCondition } from './condition-parser.js';
+import { isLlmCondition, extractLlmQuestion, evaluateLlmCondition } from './llm-evaluator.js';
+import { callLLM } from '@substrate-ai/core';
+// ---------------------------------------------------------------------------
+// normalizeLabel
+// ---------------------------------------------------------------------------
+/**
+ * Normalize an edge label for preferred-label matching.
+ *
+ * Lowercases and trims the input, then strips an accelerator prefix if present:
+ *   - `[K] ` — bracket-enclosed single character followed by whitespace
+ *   - `K) `  — single character followed by `)` and whitespace
+ *   - `K - ` — single character followed by optional whitespace, `-`, optional whitespace
+ *
+ * Patterns are matched after lowercasing, so the regex uses only `[a-z]`.
+ *
+ * @param label - Raw edge label string.
+ * @returns Normalized label string.
+ */
+export function normalizeLabel(label) {
+    const s = label.toLowerCase().trim();
+    // Apply accelerator prefix strips in order; only one will match per label.
+    return s
+        .replace(/^[a-z]\)\s+/, '')
+        .replace(/^\[[a-z]\]\s+/, '')
+        .replace(/^[a-z]\s*-\s*/, '')
+        .trim();
+}
+// ---------------------------------------------------------------------------
+// bestByWeightThenLexical
+// ---------------------------------------------------------------------------
+/**
+ * Return the "best" edge from a non-empty array:
+ *   - highest `weight` (treating missing weight as 0)
+ *   - lexically-first `toNode` as a tiebreak (ascending alphabetical)
+ *
+ * Does not mutate the input array.
+ *
+ * @param edges - Non-empty array of candidate edges (caller guarantees length ≥ 1).
+ * @returns The winning `GraphEdge`.
+ */
+export function bestByWeightThenLexical(edges) {
+    const sorted = [...edges].sort((a, b) => {
+        // Descending by weight
+        const weightDiff = (b.weight ?? 0) - (a.weight ?? 0);
+        if (weightDiff !== 0)
+            return weightDiff;
+        // Ascending by target node ID (lexical)
+        return a.toNode.localeCompare(b.toNode);
+    });
+    return sorted[0];
+}
+// ---------------------------------------------------------------------------
+// selectEdge
+// ---------------------------------------------------------------------------
+/**
+ * Select the best outgoing edge from `node` according to the 5-step Attractor spec.
+ *
+ * Step 1: Condition-matched edges — highest weight, lexical tiebreak.
+ *         Edges with `llm:` prefix conditions are evaluated via LLM call.
+ * Step 2: Preferred label match on unconditional edges — first match wins.
+ * Step 3: Suggested next IDs on unconditional edges — first suggestedNextId wins.
+ * Step 4: Highest weight among all unconditional edges.
+ * Step 5: Lexically-first target node ID as tiebreak for Step 4.
+ *
+ * @param node    - The current graph node.
+ * @param outcome - The outcome returned by the node's handler.
+ * @param context - The current execution context (used for condition evaluation).
+ * @param graph   - The full graph (source of edges).
+ * @param options - Optional injectable overrides (e.g. llmCall for testing).
+ * @returns The selected `GraphEdge`, or `null` if no outgoing edges exist.
+ */
+export async function selectEdge(node, outcome, context, graph, options) {
+    // Collect all edges originating from this node.
+    const outgoing = graph.edges.filter((e) => e.fromNode === node.id);
+    // AC5: No outgoing edges → return null immediately.
+    if (outgoing.length === 0)
+        return null;
+    // Build default llmCall binding using node attributes.
+    const defaultLlmCall = (prompt) => callLLM({
+        model: node.llmModel || 'claude-haiku-4-5',
+        provider: node.llmProvider || 'anthropic',
+        reasoningEffort: 'low',
+        prompt,
+    }).then((r) => r.text);
+    const llmCall = options?.llmCall ?? defaultLlmCall;
+    // Step 1: Condition-matched edges (AC1, AC7).
+    const conditionMatches = [];
+    const snapshot = context.snapshot();
+    for (const edge of outgoing) {
+        if (edge.condition && edge.condition.trim() !== '') {
+            if (isLlmCondition(edge.condition)) {
+                // LLM-evaluated condition — wrap llmCall to capture error messages for context
+                const question = extractLlmQuestion(edge.condition);
+                let evalError = null;
+                const trackingLlmCall = async (prompt) => {
+                    try {
+                        return await llmCall(prompt);
+                    }
+                    catch (err) {
+                        evalError = err instanceof Error ? err.message : String(err);
+                        throw err; // re-throw so evaluateLlmCondition catches it and returns false
+                    }
+                };
+                const matched = await evaluateLlmCondition(question, snapshot, trackingLlmCall);
+                // Emit graph:llm-edge-evaluated for every LLM call attempt (story 50-9 AC3)
+                // matched will be false on error-fallback path, so this single emission covers all cases
+                options?.eventBus?.emit('graph:llm-edge-evaluated', {
+                    runId: options.runId ?? 'unknown',
+                    nodeId: node.id,
+                    question,
+                    result: matched,
+                });
+                // Increment LLM evaluation count regardless of success/failure (AC6)
+                context.set('llm.edge_eval_count', context.getNumber('llm.edge_eval_count', 0) + 1);
+                // On error, append message to llm.edge_eval_errors array (AC5)
+                if (evalError !== null) {
+                    const existing = context.get('llm.edge_eval_errors');
+                    const errors = Array.isArray(existing) ? existing : [];
+                    errors.push(evalError);
+                    context.set('llm.edge_eval_errors', errors);
+                }
+                if (matched) {
+                    conditionMatches.push(edge);
+                }
+            }
+            else {
+                try {
+                    if (evaluateCondition(edge.condition, snapshot)) {
+                        conditionMatches.push(edge);
+                    }
+                }
+                catch {
+                    // Parse errors or evaluation errors → treat as non-matching.
+                }
+            }
+        }
+    }
+    if (conditionMatches.length > 0) {
+        return bestByWeightThenLexical(conditionMatches);
+    }
+    // Step 2: Preferred label match on unconditional edges (AC2).
+    if (outcome.preferredLabel && outcome.preferredLabel.trim() !== '') {
+        const normalizedPreferred = normalizeLabel(outcome.preferredLabel);
+        for (const edge of outgoing) {
+            if (!edge.condition && normalizeLabel(edge.label) === normalizedPreferred) {
+                return edge;
+            }
+        }
+    }
+    // Step 3: Suggested next IDs on unconditional edges (AC3).
+    if (outcome.suggestedNextIds && outcome.suggestedNextIds.length > 0) {
+        for (const id of outcome.suggestedNextIds) {
+            const match = outgoing.find((e) => !e.condition && e.toNode === id);
+            if (match !== undefined)
+                return match;
+        }
+    }
+    // Steps 4 & 5: Highest weight with lexical tiebreak among unconditional edges (AC4).
+    const unconditional = outgoing.filter((e) => !e.condition);
+    if (unconditional.length > 0) {
+        return bestByWeightThenLexical(unconditional);
+    }
+    return null;
+}
+//# sourceMappingURL=edge-selector.js.map

package/dist/graph/edge-selector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-selector.js","sourceRoot":"","sources":["../../src/graph/edge-selector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAA;AACzD,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAA;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAI5C,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAA;IACpC,2EAA2E;IAC3E,OAAO,CAAC;SACL,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;SAC1B,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC;SAC5B,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC;SAC5B,IAAI,EAAE,CAAA;AACX,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAkB;IACxD,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtC,uBAAuB;QACvB,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAA;QACpD,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO,UAAU,CAAA;QACvC,wCAAwC;QACxC,OAAO,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IACF,OAAO,MAAM,CAAC,CAAC,CAAE,CAAA;AACnB,CAAC;AAsBD,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,IAAe,EACf,OAAgB,EAChB,OAAsB,EACtB,KAAY,EACZ,OAA2B;IAE3B,gDAAgD;IAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC,CAAA;IAElE,oDAAoD;IACpD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAEtC,uDAAuD;IACvD,MAAM,cAAc,GAAG,CAAC,MAAc,EAAmB,EAAE,CACzD,OAAO,CAAC;QACN,KAAK,EAAE,IAAI,CAAC,QAAQ,IAAI,kBAAkB;QAC1C,QAAQ,EAAE,IAAI,CAAC,WAAW,IAAI,WAAW;QACzC,eAAe,EAAE,KAAK;QACtB,MAAM;KACP,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAExB,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,cAAc,CAAA;IAElD,8CAA8C;IAC9C,MAAM,gBAAgB,GAAgB,EAAE,CAAA;IACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAA;IACnC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACnD,IAAI,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnC,+EAA+E;gBAC/E,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBACnD,IAAI,SAAS,GAAkB,IAAI,CAAA;gBAEnC,MAAM,eAAe,GAAG,KAAK,EAAE,MAAc,EAAmB,EAAE;oBAChE,IAAI,CAAC;wBACH,OAAO,MAAM,OAAO,CAAC,MAAM,CAAC,CAAA;oBAC9B,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,SAAS,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;wBAC5D,MAAM,GAAG,CAAA,CAAC,gEAAgE;oBAC5E,CAAC;gBACH,CAAC,CAAA;gBAED,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAA;gBAE/E,4EAA4E;gBAC5E,yFAAyF;gBACzF,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,0BAA0B,EAAE;oBAClD,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,SAAS;oBACjC,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,QAAQ;oBACR,MAAM,EAAE,OAAO;iBAChB,CAAC,CAAA;gBAEF,qEAAqE;gBACrE,OAAO,CAAC,GAAG,CAAC,qBAAqB,EAAE,OAAO,CAAC,SAAS,CAAC,qBAAqB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAEnF,+DAA+D;gBAC/D,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAA;oBACpD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAA;oBACtD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;oBACtB,OAAO,CAAC,GAAG,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAA;gBAC7C,CAAC;gBAED,IAAI,OAAO,EAAE,CAAC;oBACZ,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC7B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC;oBACH,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAChD,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBAC7B,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,6DAA6D;gBAC/D,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,uBAAuB,CAAC,gBAAgB,CAAC,CAAA;IAClD,CAAC;IAED,8DAA8D;IAC9D,IAAI,OAAO,CAAC,cAAc,IAAI,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACnE,MAAM,mBAAmB,GAAG,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAA;QAClE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,mBAAmB,EAAE,CAAC;gBAC1E,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,IAAI,OAAO,CAAC,gBAAgB,IAAI,OAAO,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,CAAA;YACnE,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAA;QACvC,CAAC;IACH,CAAC;IAED,qFAAqF;IACrF,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;IAC1D,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,uBAAuB,CAAC,aAAa,CAAC,CAAA;IAC/C,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC"}