@oobe-protocol-labs/synapse-client-sdk 1.2.2 → 2.0.0

package/dist/cjs/ai/intents/parser.js

@@ -0,0 +1,189 @@
+"use strict";
+/**
+ * @module ai/intents/parser
+ * @description Cross-Protocol Intent Parser — validates and normalizes intents.
+ *
+ * Validates intent structure, auto-detects dependencies from `$stepId.field`
+ * references, checks for duplicate IDs, and verifies all referenced steps exist.
+ *
+ * @example
+ * ```ts
+ * import { IntentParser } from '@oobe-protocol-labs/synapse-client-sdk/ai';
+ *
+ * const parser = new IntentParser({ maxSteps: 20 });
+ *
+ * const result = parser.parse({
+ *   steps: [
+ *     { id: 'quote', protocol: 'jupiter', method: 'getQuote', params: { inputMint: 'So11...', outputMint: 'EPjF...' } },
+ *     { id: 'swap', protocol: 'jupiter', method: 'smartSwap', params: { amount: '$quote.outAmount' }, dependsOn: ['quote'] },
+ *   ],
+ * });
+ *
+ * if (result.valid) {
+ *   console.log(result.intent); // Normalized intent with auto-generated ID
+ * }
+ * ```
+ *
+ * @since 1.3.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntentParser = void 0;
+const crypto_1 = require("crypto");
+/**
+ * @description Validates, normalizes, and enriches intent definitions.
+ *
+ * Performs:
+ * 1. Structural validation (required fields, types)
+ * 2. Dependency detection from `$stepId.field` references
+ * 3. Duplicate ID detection
+ * 4. Forward-reference detection (step references future step)
+ * 5. Missing reference detection
+ *
+ * @since 1.3.0
+ */
+class IntentParser {
+    config;
+    /**
+     * @param {ParserConfig} [config] - Parser configuration
+     */
+    constructor(config) {
+        this.config = {
+            maxSteps: config?.maxSteps ?? 20,
+            allowedProtocols: config?.allowedProtocols ?? [],
+            autoInferDeps: config?.autoInferDeps ?? true,
+        };
+    }
+    /**
+     * @description Parse and validate an intent definition.
+     *
+     * @param {Intent} intent - Raw intent to parse
+     * @returns {ValidationResult} Validation result with normalized intent
+     *
+     * @example
+     * ```ts
+     * const result = parser.parse(myIntent);
+     * if (!result.valid) {
+     *   console.error('Errors:', result.errors);
+     * }
+     * ```
+     *
+     * @since 1.3.0
+     */
+    parse(intent) {
+        const errors = [];
+        const warnings = [];
+        // ── Basic structure ──
+        if (!intent.steps || !Array.isArray(intent.steps)) {
+            return { valid: false, errors: ['Intent must have a "steps" array'], warnings };
+        }
+        if (intent.steps.length === 0) {
+            return { valid: false, errors: ['Intent must have at least one step'], warnings };
+        }
+        if (intent.steps.length > this.config.maxSteps) {
+            errors.push(`Too many steps: ${intent.steps.length} (max: ${this.config.maxSteps})`);
+        }
+        // ── Step validation ──
+        const stepIds = new Set();
+        const stepOrder = new Map(); // stepId → index
+        for (let i = 0; i < intent.steps.length; i++) {
+            const step = intent.steps[i];
+            // Required fields
+            if (!step.id) {
+                errors.push(`Step at index ${i} is missing "id"`);
+                continue;
+            }
+            if (!step.protocol) {
+                errors.push(`Step '${step.id}' is missing "protocol"`);
+            }
+            if (!step.method) {
+                errors.push(`Step '${step.id}' is missing "method"`);
+            }
+            // Duplicate ID
+            if (stepIds.has(step.id)) {
+                errors.push(`Duplicate step ID: '${step.id}'`);
+            }
+            stepIds.add(step.id);
+            stepOrder.set(step.id, i);
+            // Allowed protocols
+            if (this.config.allowedProtocols.length > 0 &&
+                step.protocol &&
+                !this.config.allowedProtocols.includes(step.protocol)) {
+                errors.push(`Step '${step.id}' uses unknown protocol '${step.protocol}'. Allowed: ${this.config.allowedProtocols.join(', ')}`);
+            }
+        }
+        // ── Reference validation & dependency inference ──
+        const normalizedSteps = [];
+        for (const step of intent.steps) {
+            if (!step.id)
+                continue;
+            const inferredDeps = new Set(step.dependsOn ?? []);
+            // Scan params for $references
+            if (step.params && this.config.autoInferDeps) {
+                for (const [key, value] of Object.entries(step.params)) {
+                    if (typeof value === 'string' && value.startsWith('$')) {
+                        const refStepId = value.slice(1).split('.')[0];
+                        // Check reference exists
+                        if (!stepIds.has(refStepId)) {
+                            errors.push(`Step '${step.id}' references unknown step '${refStepId}' in param '${key}'`);
+                        }
+                        // Check for forward references
+                        const refIndex = stepOrder.get(refStepId);
+                        const stepIndex = stepOrder.get(step.id);
+                        if (refIndex !== undefined && stepIndex !== undefined && refIndex >= stepIndex) {
+                            warnings.push(`Step '${step.id}' references step '${refStepId}' which appears later — ensure dependency order is correct`);
+                        }
+                        inferredDeps.add(refStepId);
+                    }
+                }
+            }
+            // Check explicit deps exist
+            for (const dep of step.dependsOn ?? []) {
+                if (!stepIds.has(dep)) {
+                    errors.push(`Step '${step.id}' depends on unknown step '${dep}'`);
+                }
+            }
+            normalizedSteps.push({
+                ...step,
+                dependsOn: [...inferredDeps],
+                params: step.params ?? {},
+            });
+        }
+        if (errors.length > 0) {
+            return { valid: false, errors, warnings };
+        }
+        // ── Return normalized intent ──
+        const normalized = {
+            id: intent.id ?? (0, crypto_1.randomUUID)(),
+            description: intent.description,
+            steps: normalizedSteps,
+            options: intent.options ?? {},
+        };
+        return { valid: true, errors: [], warnings, intent: normalized };
+    }
+    /**
+     * @description Extract all step references from an intent step's params.
+     *
+     * @param {IntentStep} step - Step to analyze
+     * @returns {Array<{ param: string; ref: string; stepId: string; fieldPath: string[] }>}
+     *   Array of reference details
+     *
+     * @since 1.3.0
+     */
+    extractReferences(step) {
+        const refs = [];
+        for (const [key, value] of Object.entries(step.params ?? {})) {
+            if (typeof value === 'string' && value.startsWith('$')) {
+                const parts = value.slice(1).split('.');
+                refs.push({
+                    param: key,
+                    ref: value,
+                    stepId: parts[0],
+                    fieldPath: parts.slice(1),
+                });
+            }
+        }
+        return refs;
+    }
+}
+exports.IntentParser = IntentParser;
+//# sourceMappingURL=parser.js.map

package/dist/cjs/ai/intents/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../../../src/ai/intents/parser.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;;;AAEH,mCAAoC;AAwCpC;;;;;;;;;;;GAWG;AACH,MAAa,YAAY;IACN,MAAM,CAAyB;IAEhD;;OAEG;IACH,YAAY,MAAqB;QAC/B,IAAI,CAAC,MAAM,GAAG;YACZ,QAAQ,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE;YAChC,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,IAAI,EAAE;YAChD,aAAa,EAAE,MAAM,EAAE,aAAa,IAAI,IAAI;SAC7C,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,MAAc;QAClB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,wBAAwB;QACxB,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,kCAAkC,CAAC,EAAE,QAAQ,EAAE,CAAC;QAClF,CAAC;QAED,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,oCAAoC,CAAC,EAAE,QAAQ,EAAE,CAAC;QACpF,CAAC;QAED,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,mBAAmB,MAAM,CAAC,KAAK,CAAC,MAAM,UAAU,IAAI,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC;QACvF,CAAC;QAED,wBAAwB;QACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,iBAAiB;QAE9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE7B,kBAAkB;YAClB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;gBAClD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,yBAAyB,CAAC,CAAC;YACzD,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,uBAAuB,CAAC,CAAC;YACvD,CAAC;YAED,eAAe;YACf,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,uBAAuB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAE1B,oBAAoB;YACpB,IACE,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;gBACvC,IAAI,CAAC,QAAQ;gBACb,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EACrD,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,4BAA4B,IAAI,CAAC,QAAQ,eAAe,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjI,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,MAAM,eAAe,GAAiB,EAAE,CAAC;QAEzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,SAAS;YAEvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;YAE3D,8BAA8B;YAC9B,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;gBAC7C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACvD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;wBACvD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBAE/C,yBAAyB;wBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC5B,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,8BAA8B,SAAS,eAAe,GAAG,GAAG,CAAC,CAAC;wBAC5F,CAAC;wBAED,+BAA+B;wBAC/B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;wBAC1C,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACzC,IAAI,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;4BAC/E,QAAQ,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,sBAAsB,SAAS,4DAA4D,CAAC,CAAC;wBAC7H,CAAC;wBAED,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,4BAA4B;YAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,8BAA8B,GAAG,GAAG,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;YAED,eAAe,CAAC,IAAI,CAAC;gBACnB,GAAG,IAAI;gBACP,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC;gBAC5B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,EAAE;aAC1B,CAAC,CAAC;QACL,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QAC5C,CAAC;QAED,iCAAiC;QACjC,MAAM,UAAU,GAAW;YACzB,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,IAAA,mBAAU,GAAE;YAC7B,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,KAAK,EAAE,eAAe;YACtB,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,EAAE;SAC9B,CAAC;QAEF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IACnE,CAAC;IAED;;;;;;;;OAQG;IACH,iBAAiB,CAAC,IAAgB;QAMhC,MAAM,IAAI,GAA+E,EAAE,CAAC;QAE5F,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;YAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC;oBACR,KAAK,EAAE,GAAG;oBACV,GAAG,EAAE,KAAK;oBACV,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;oBAChB,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;iBAC1B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA9KD,oCA8KC"}

package/dist/cjs/ai/intents/planner.d.ts

@@ -0,0 +1,96 @@
+/**
+ * @module ai/intents/planner
+ * @description Cross-Protocol Intent Planner — DAG-based execution planning.
+ *
+ * Converts a validated {@link Intent} into an {@link IntentPlan} by:
+ * 1. Building a directed acyclic graph (DAG) from step dependencies
+ * 2. Detecting cycles
+ * 3. Computing topological sort (execution order)
+ * 4. Identifying parallelizable steps
+ * 5. Estimating costs and latencies
+ *
+ * @example
+ * ```ts
+ * import { IntentPlanner } from '@oobe-protocol-labs/synapse-client-sdk/ai';
+ *
+ * const planner = new IntentPlanner();
+ * const plan = planner.plan(parsedIntent);
+ *
+ * console.log(`${plan.totalLevels} execution levels`);
+ * console.log(`Estimated cost: ${plan.estimatedTotalCost}`);
+ *
+ * // View execution order
+ * for (const step of plan.steps) {
+ *   console.log(`[Level ${step.executionOrder}] ${step.id}: ${step.protocol}.${step.method}`);
+ * }
+ * ```
+ *
+ * @since 1.3.0
+ */
+import type { Intent, IntentPlan } from './types';
+/**
+ * @description Configuration for the intent planner.
+ * @since 1.3.0
+ */
+export interface PlannerConfig {
+    /** Custom cost estimates per protocol. */
+    costEstimates?: Record<string, bigint>;
+    /** Custom latency estimates per protocol (ms). */
+    latencyEstimates?: Record<string, number>;
+    /** Maximum DAG depth before rejecting. @default 10 */
+    maxDepth?: number;
+}
+/**
+ * @description Converts validated intents into optimized execution plans.
+ *
+ * The planner performs:
+ * 1. **DAG construction** — edges from each dependency to the dependent step
+ * 2. **Cycle detection** — DFS-based, throws {@link CyclicDependencyError}
+ * 3. **Topological sort** — Kahn's algorithm for deterministic ordering
+ * 4. **Level assignment** — steps at the same level can run in parallel
+ * 5. **Cost estimation** — per-step and total cost/latency estimates
+ *
+ * @since 1.3.0
+ */
+export declare class IntentPlanner {
+    private readonly costEstimates;
+    private readonly latencyEstimates;
+    private readonly maxDepth;
+    /**
+     * @param {PlannerConfig} [config] - Planner configuration
+     */
+    constructor(config?: PlannerConfig);
+    /**
+     * @description Create an execution plan from a validated intent.
+     *
+     * @param {Intent} intent - Validated intent (from {@link IntentParser.parse})
+     * @returns {IntentPlan} Execution plan with topologically sorted steps
+     * @throws {CyclicDependencyError} If the dependency graph contains a cycle
+     * @throws {IntentError} If the DAG exceeds maximum depth
+     *
+     * @example
+     * ```ts
+     * const plan = planner.plan(intent);
+     * if (plan.isValid) {
+     *   for (const step of plan.steps) {
+     *     console.log(`[${step.executionOrder}] ${step.id} (${step.protocol})`);
+     *   }
+     * }
+     * ```
+     *
+     * @since 1.3.0
+     */
+    plan(intent: Intent): IntentPlan;
+    /**
+     * @description Optimize a plan by reordering parallelizable steps
+     * to minimize total latency.
+     *
+     * @param {IntentPlan} plan - Plan to optimize
+     * @returns {IntentPlan} Optimized plan (new object, original unchanged)
+     *
+     * @since 1.3.0
+     */
+    optimize(plan: IntentPlan): IntentPlan;
+    private detectCycles;
+}
+//# sourceMappingURL=planner.d.ts.map

package/dist/cjs/ai/intents/planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner.d.ts","sourceRoot":"","sources":["../../../../src/ai/intents/planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAA2B,MAAM,SAAS,CAAC;AAsC3E;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,0CAA0C;IAC1C,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvC,kDAAkD;IAClD,gBAAgB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,sDAAsD;IACtD,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAMD;;;;;;;;;;;GAWG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAyB;IACvD,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAyB;IAC1D,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAElC;;OAEG;gBACS,MAAM,CAAC,EAAE,aAAa;IAMlC;;;;;;;;;;;;;;;;;;;OAmBG;IACH,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU;IAgHhC;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU;IAwBtC,OAAO,CAAC,YAAY;CAuCrB"}

package/dist/cjs/ai/intents/planner.js

@@ -0,0 +1,270 @@
+"use strict";
+/**
+ * @module ai/intents/planner
+ * @description Cross-Protocol Intent Planner — DAG-based execution planning.
+ *
+ * Converts a validated {@link Intent} into an {@link IntentPlan} by:
+ * 1. Building a directed acyclic graph (DAG) from step dependencies
+ * 2. Detecting cycles
+ * 3. Computing topological sort (execution order)
+ * 4. Identifying parallelizable steps
+ * 5. Estimating costs and latencies
+ *
+ * @example
+ * ```ts
+ * import { IntentPlanner } from '@oobe-protocol-labs/synapse-client-sdk/ai';
+ *
+ * const planner = new IntentPlanner();
+ * const plan = planner.plan(parsedIntent);
+ *
+ * console.log(`${plan.totalLevels} execution levels`);
+ * console.log(`Estimated cost: ${plan.estimatedTotalCost}`);
+ *
+ * // View execution order
+ * for (const step of plan.steps) {
+ *   console.log(`[Level ${step.executionOrder}] ${step.id}: ${step.protocol}.${step.method}`);
+ * }
+ * ```
+ *
+ * @since 1.3.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntentPlanner = void 0;
+const types_1 = require("./types");
+/* ═══════════════════════════════════════════════════════════════
+ *  Cost estimation defaults
+ * ═══════════════════════════════════════════════════════════════ */
+/**
+ * @description Default estimated costs per protocol (in lamports/micro-units).
+ * Used when no custom cost estimator is provided.
+ * @since 1.3.0
+ */
+const DEFAULT_COST_ESTIMATES = {
+    jupiter: 1000n,
+    raydium: 1000n,
+    metaplex: 2000n,
+    native: 500n,
+    marinade: 1500n,
+    jito: 3000n,
+};
+/**
+ * @description Default estimated latencies per protocol (ms).
+ * @since 1.3.0
+ */
+const DEFAULT_LATENCY_ESTIMATES = {
+    jupiter: 2000,
+    raydium: 1500,
+    metaplex: 3000,
+    native: 500,
+    marinade: 2000,
+    jito: 1000,
+};
+/* ═══════════════════════════════════════════════════════════════
+ *  IntentPlanner
+ * ═══════════════════════════════════════════════════════════════ */
+/**
+ * @description Converts validated intents into optimized execution plans.
+ *
+ * The planner performs:
+ * 1. **DAG construction** — edges from each dependency to the dependent step
+ * 2. **Cycle detection** — DFS-based, throws {@link CyclicDependencyError}
+ * 3. **Topological sort** — Kahn's algorithm for deterministic ordering
+ * 4. **Level assignment** — steps at the same level can run in parallel
+ * 5. **Cost estimation** — per-step and total cost/latency estimates
+ *
+ * @since 1.3.0
+ */
+class IntentPlanner {
+    costEstimates;
+    latencyEstimates;
+    maxDepth;
+    /**
+     * @param {PlannerConfig} [config] - Planner configuration
+     */
+    constructor(config) {
+        this.costEstimates = { ...DEFAULT_COST_ESTIMATES, ...config?.costEstimates };
+        this.latencyEstimates = { ...DEFAULT_LATENCY_ESTIMATES, ...config?.latencyEstimates };
+        this.maxDepth = config?.maxDepth ?? 10;
+    }
+    /**
+     * @description Create an execution plan from a validated intent.
+     *
+     * @param {Intent} intent - Validated intent (from {@link IntentParser.parse})
+     * @returns {IntentPlan} Execution plan with topologically sorted steps
+     * @throws {CyclicDependencyError} If the dependency graph contains a cycle
+     * @throws {IntentError} If the DAG exceeds maximum depth
+     *
+     * @example
+     * ```ts
+     * const plan = planner.plan(intent);
+     * if (plan.isValid) {
+     *   for (const step of plan.steps) {
+     *     console.log(`[${step.executionOrder}] ${step.id} (${step.protocol})`);
+     *   }
+     * }
+     * ```
+     *
+     * @since 1.3.0
+     */
+    plan(intent) {
+        const errors = [];
+        const stepMap = new Map();
+        for (const step of intent.steps) {
+            stepMap.set(step.id, step);
+        }
+        // Build adjacency list (deps → step)
+        const adjList = new Map();
+        const inDegree = new Map();
+        for (const step of intent.steps) {
+            if (!adjList.has(step.id))
+                adjList.set(step.id, new Set());
+            if (!inDegree.has(step.id))
+                inDegree.set(step.id, 0);
+            for (const dep of step.dependsOn ?? []) {
+                if (!adjList.has(dep))
+                    adjList.set(dep, new Set());
+                adjList.get(dep).add(step.id);
+                inDegree.set(step.id, (inDegree.get(step.id) ?? 0) + 1);
+            }
+        }
+        // Cycle detection (DFS)
+        this.detectCycles(intent.steps, adjList);
+        // Topological sort (Kahn's algorithm) with level assignment
+        const queue = [];
+        const levels = new Map();
+        for (const [id, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(id);
+                levels.set(id, 0);
+            }
+        }
+        const sorted = [];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            sorted.push(current);
+            const currentLevel = levels.get(current) ?? 0;
+            for (const neighbor of adjList.get(current) ?? []) {
+                const newDegree = (inDegree.get(neighbor) ?? 1) - 1;
+                inDegree.set(neighbor, newDegree);
+                // Level = max dependency level + 1
+                const neighborLevel = Math.max(levels.get(neighbor) ?? 0, currentLevel + 1);
+                levels.set(neighbor, neighborLevel);
+                if (newDegree === 0) {
+                    queue.push(neighbor);
+                }
+            }
+        }
+        // Check for unprocessed nodes (cycle should have been caught already)
+        if (sorted.length !== intent.steps.length) {
+            errors.push('Not all steps were processed — possible unresolved dependency');
+        }
+        // Check depth
+        const maxLevel = Math.max(...levels.values(), 0);
+        if (maxLevel > this.maxDepth) {
+            errors.push(`DAG depth ${maxLevel} exceeds maximum ${this.maxDepth}`);
+        }
+        // Build planned steps
+        const plannedSteps = [];
+        let totalCost = 0n;
+        let totalLatency = 0;
+        // Group by level for parallel latency estimation
+        const levelLatencies = {};
+        for (const stepId of sorted) {
+            const step = stepMap.get(stepId);
+            const level = levels.get(stepId) ?? 0;
+            const estimatedCost = this.costEstimates[step.protocol] ?? 1000n;
+            const estimatedLatency = this.latencyEstimates[step.protocol] ?? 2000;
+            // Count steps at same level
+            const sameLevel = sorted.filter(id => levels.get(id) === level);
+            plannedSteps.push({
+                ...step,
+                executionOrder: level,
+                resolvedDeps: step.dependsOn ?? [],
+                parallelizable: sameLevel.length > 1,
+                estimatedCost,
+                estimatedLatencyMs: estimatedLatency,
+            });
+            totalCost += estimatedCost;
+            // For latency, take the max per level (parallel steps)
+            levelLatencies[level] = Math.max(levelLatencies[level] ?? 0, estimatedLatency);
+        }
+        totalLatency = Object.values(levelLatencies).reduce((sum, v) => sum + v, 0);
+        return {
+            intentId: intent.id ?? 'unknown',
+            steps: plannedSteps,
+            totalLevels: maxLevel + 1,
+            estimatedTotalCost: totalCost,
+            estimatedTotalLatencyMs: totalLatency,
+            isValid: errors.length === 0,
+            errors,
+            createdAt: Date.now(),
+        };
+    }
+    /**
+     * @description Optimize a plan by reordering parallelizable steps
+     * to minimize total latency.
+     *
+     * @param {IntentPlan} plan - Plan to optimize
+     * @returns {IntentPlan} Optimized plan (new object, original unchanged)
+     *
+     * @since 1.3.0
+     */
+    optimize(plan) {
+        // Group steps by execution level
+        const levels = new Map();
+        for (const step of plan.steps) {
+            if (!levels.has(step.executionOrder))
+                levels.set(step.executionOrder, []);
+            levels.get(step.executionOrder).push(step);
+        }
+        // Within each level, sort by estimated latency descending
+        // (start slowest first for better parallelization)
+        const optimizedSteps = [];
+        for (const [, stepsAtLevel] of [...levels.entries()].sort((a, b) => a[0] - b[0])) {
+            stepsAtLevel.sort((a, b) => (b.estimatedLatencyMs ?? 0) - (a.estimatedLatencyMs ?? 0));
+            optimizedSteps.push(...stepsAtLevel);
+        }
+        return {
+            ...plan,
+            steps: optimizedSteps,
+        };
+    }
+    /* ── Cycle detection ── */
+    detectCycles(steps, adjList) {
+        const WHITE = 0, GRAY = 1, BLACK = 2;
+        const colors = new Map();
+        const parent = new Map();
+        for (const step of steps) {
+            colors.set(step.id, WHITE);
+            parent.set(step.id, null);
+        }
+        const dfs = (node) => {
+            colors.set(node, GRAY);
+            for (const neighbor of adjList.get(node) ?? []) {
+                if (colors.get(neighbor) === GRAY) {
+                    // Back edge — cycle found
+                    const cycle = [neighbor, node];
+                    let curr = node;
+                    while (curr && curr !== neighbor) {
+                        curr = parent.get(curr);
+                        if (curr)
+                            cycle.push(curr);
+                    }
+                    throw new types_1.CyclicDependencyError(cycle.reverse());
+                }
+                if (colors.get(neighbor) === WHITE) {
+                    parent.set(neighbor, node);
+                    dfs(neighbor);
+                }
+            }
+            colors.set(node, BLACK);
+        };
+        for (const step of steps) {
+            if (colors.get(step.id) === WHITE) {
+                dfs(step.id);
+            }
+        }
+    }
+}
+exports.IntentPlanner = IntentPlanner;
+//# sourceMappingURL=planner.js.map

package/dist/cjs/ai/intents/planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner.js","sourceRoot":"","sources":["../../../../src/ai/intents/planner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;;;AAGH,mCAA6D;AAE7D;;qEAEqE;AAErE;;;;GAIG;AACH,MAAM,sBAAsB,GAA2B;IACrD,OAAO,EAAG,KAAK;IACf,OAAO,EAAG,KAAK;IACf,QAAQ,EAAE,KAAK;IACf,MAAM,EAAI,IAAI;IACd,QAAQ,EAAE,KAAK;IACf,IAAI,EAAM,KAAK;CAChB,CAAC;AAEF;;;GAGG;AACH,MAAM,yBAAyB,GAA2B;IACxD,OAAO,EAAG,IAAI;IACd,OAAO,EAAG,IAAI;IACd,QAAQ,EAAE,IAAI;IACd,MAAM,EAAI,GAAG;IACb,QAAQ,EAAE,IAAI;IACd,IAAI,EAAM,IAAI;CACf,CAAC;AAmBF;;qEAEqE;AAErE;;;;;;;;;;;GAWG;AACH,MAAa,aAAa;IACP,aAAa,CAAyB;IACtC,gBAAgB,CAAyB;IACzC,QAAQ,CAAS;IAElC;;OAEG;IACH,YAAY,MAAsB;QAChC,IAAI,CAAC,aAAa,GAAG,EAAE,GAAG,sBAAsB,EAAE,GAAG,MAAM,EAAE,aAAa,EAAE,CAAC;QAC7E,IAAI,CAAC,gBAAgB,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,MAAM,EAAE,gBAAgB,EAAE,CAAC;QACtF,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;IACzC,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,IAAI,CAAC,MAAc;QACjB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC3D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAErD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACnD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAEzC,4DAA4D;QAC5D,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAE9C,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAClC,mCAAmC;gBACnC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;gBAEpC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QAC/E,CAAC;QAED,cAAc;QACd,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,aAAa,QAAQ,oBAAoB,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACxE,CAAC;QAED,sBAAsB;QACtB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,iDAAiD;QACjD,MAAM,cAAc,GAA2B,EAAE,CAAC;QAElD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAClC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YACjE,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;YAEtE,4BAA4B;YAC5B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;YAEhE,YAAY,CAAC,IAAI,CAAC;gBAChB,GAAG,IAAI;gBACP,cAAc,EAAE,KAAK;gBACrB,YAAY,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;gBAClC,cAAc,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC;gBACpC,aAAa;gBACb,kBAAkB,EAAE,gBAAgB;aACrC,CAAC,CAAC;YAEH,SAAS,IAAI,aAAa,CAAC;YAC3B,uDAAuD;YACvD,cAAc,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACjF,CAAC;QAED,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAE5E,OAAO;YACL,QAAQ,EAAE,MAAM,CAAC,EAAE,IAAI,SAAS;YAChC,KAAK,EAAE,YAAY;YACnB,WAAW,EAAE,QAAQ,GAAG,CAAC;YACzB,kBAAkB,EAAE,SAAS;YAC7B,uBAAuB,EAAE,YAAY;YACrC,OAAO,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;YAC5B,MAAM;YACN,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAgB;QACvB,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;QAED,0DAA0D;QAC1D,mDAAmD;QACnD,MAAM,cAAc,GAAkB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjF,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,CAAC,CAAC;YACvF,cAAc,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QACvC,CAAC;QAED,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,cAAc;SACtB,CAAC;IACJ,CAAC;IAED,2BAA2B;IAEnB,YAAY,CAAC,KAAmB,EAAE,OAAiC;QACzE,MAAM,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAEvB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;oBAClC,0BAA0B;oBAC1B,MAAM,KAAK,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBAC/B,IAAI,IAAI,GAA8B,IAAI,CAAC;oBAC3C,OAAO,IAAI,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;wBACjC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACxB,IAAI,IAAI;4BAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7B,CAAC;oBACD,MAAM,IAAI,6BAAqB,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;gBACnD,CAAC;gBACD,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;gBAClC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA1ND,sCA0NC"}