cognitive-core 0.0.1 → 0.1.0

package/dist/search/refinement-loop.js

@@ -0,0 +1,245 @@
+/**
+ * Refinement Loop
+ *
+ * Implements ReMem-style iterative refinement that improves solutions
+ * using memory-augmented feedback. The loop:
+ * 1. Evaluates solution quality
+ * 2. If not acceptable, injects failure context and retries
+ * 3. Continues until acceptable or max iterations reached
+ */
+import { SolutionEvaluator } from './evaluator.js';
+/**
+ * Default refinement configuration
+ */
+const DEFAULT_CONFIG = {
+    maxIterations: 3,
+    minAcceptableScore: 0.7,
+    injectFailureContext: true,
+    queryFailureMemory: true,
+    evaluatorConfig: {},
+    triggerOnStrategies: ['explore', 'fallback'],
+    confidenceThreshold: 0.85,
+};
+/**
+ * RefinementLoop - Iteratively improves solutions using feedback
+ */
+export class RefinementLoop {
+    agentManager;
+    memory;
+    evaluator;
+    config;
+    constructor(agentManager, memory, config = {}) {
+        this.agentManager = agentManager;
+        this.memory = memory;
+        this.config = { ...DEFAULT_CONFIG, ...config };
+        this.evaluator = new SolutionEvaluator(agentManager, this.config.evaluatorConfig);
+    }
+    /**
+     * Get the evaluator for registering domain verifiers
+     */
+    getEvaluator() {
+        return this.evaluator;
+    }
+    /**
+     * Check if refinement should be triggered based on strategy and confidence
+     */
+    shouldTriggerRefinement(strategy, confidence) {
+        // Check if strategy is in trigger list
+        if (!this.config.triggerOnStrategies.includes(strategy)) {
+            return false;
+        }
+        // If confidence is high enough, skip refinement
+        if (confidence !== undefined &&
+            confidence >= this.config.confidenceThreshold) {
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Run the refinement loop on an initial trajectory
+     */
+    async refine(initialTrajectory, spawnConfig) {
+        const evaluations = [];
+        let currentTrajectory = initialTrajectory;
+        let bestTrajectory = initialTrajectory;
+        let bestScore = 0;
+        let improved = false;
+        // Evaluate initial trajectory
+        const initialEval = await this.evaluator.evaluate(currentTrajectory, spawnConfig.task);
+        evaluations.push(initialEval);
+        bestScore = initialEval.score;
+        // If initial is acceptable, return early
+        if (initialEval.acceptable && initialEval.score >= this.config.minAcceptableScore) {
+            return {
+                trajectory: currentTrajectory,
+                success: true,
+                iterations: 0,
+                evaluations,
+                improved: false,
+                bestScore: initialEval.score,
+            };
+        }
+        // Refinement loop
+        for (let iteration = 0; iteration < this.config.maxIterations; iteration++) {
+            // Build failure context
+            const failureContext = {
+                attemptedSolution: currentTrajectory.outcome.solution,
+                evaluation: evaluations[evaluations.length - 1],
+                stepsAttempted: currentTrajectory.steps.length,
+                previousAttempts: iteration + 1,
+            };
+            // Query memory for similar failures if enabled
+            let failureMemory;
+            if (this.config.queryFailureMemory) {
+                failureMemory = await this.queryFailurePatterns(spawnConfig.task, failureContext);
+            }
+            // Build refinement prompt
+            const refinementAdditions = this.buildRefinementPrompt(failureContext, failureMemory);
+            // Spawn refined agent
+            const refinedConfig = {
+                ...spawnConfig,
+                systemPromptAdditions: [
+                    spawnConfig.systemPromptAdditions,
+                    refinementAdditions,
+                ]
+                    .filter(Boolean)
+                    .join('\n\n'),
+            };
+            const result = await this.agentManager.spawn(refinedConfig);
+            currentTrajectory = result.trajectory;
+            // Evaluate refined trajectory
+            const evaluation = await this.evaluator.evaluate(currentTrajectory, spawnConfig.task);
+            evaluations.push(evaluation);
+            // Track best
+            if (evaluation.score > bestScore) {
+                bestScore = evaluation.score;
+                bestTrajectory = currentTrajectory;
+                improved = true;
+            }
+            // Check if acceptable
+            if (evaluation.acceptable && evaluation.score >= this.config.minAcceptableScore) {
+                return {
+                    trajectory: currentTrajectory,
+                    success: true,
+                    iterations: iteration + 1,
+                    evaluations,
+                    improved,
+                    bestScore,
+                };
+            }
+        }
+        // Return best trajectory after all iterations
+        return {
+            trajectory: bestTrajectory,
+            success: bestScore >= this.config.minAcceptableScore,
+            iterations: this.config.maxIterations,
+            evaluations,
+            improved,
+            bestScore,
+        };
+    }
+    /**
+     * Query memory for similar failure patterns
+     */
+    async queryFailurePatterns(task, failureContext) {
+        // Build query from task and failure
+        const failureDescription = failureContext.evaluation.issues
+            .map((issue) => issue.description)
+            .join('; ');
+        const query = `${task.description} - failed with: ${failureDescription}`;
+        // Query memory for similar experiences and playbooks
+        const results = await this.memory.queryV2(query, {
+            domains: task.domain ? [task.domain] : undefined,
+            includeExperiences: true,
+            includePlaybooks: true,
+        });
+        // Filter to experiences that eventually succeeded after similar failures
+        // This gives us recovery strategies
+        const recoveryExperiences = results.experiences.filter((exp) => exp.experience.success &&
+            this.hasSimilarInitialFailure(exp.experience, failureContext));
+        return {
+            ...results,
+            experiences: recoveryExperiences.length > 0 ? recoveryExperiences : results.experiences,
+        };
+    }
+    /**
+     * Check if an experience had a similar initial failure pattern
+     */
+    hasSimilarInitialFailure(experience, failureContext) {
+        // Look for similar error patterns in the experience's early steps
+        const failureKeywords = failureContext.evaluation.issues
+            .map((issue) => issue.description.toLowerCase().split(' '))
+            .flat()
+            .filter((word) => word.length > 4);
+        const experienceText = ((experience.steps ?? [])
+            .map((s) => s.observation ?? '')
+            .join(' ') +
+            ' ' +
+            experience.solutionOutput).toLowerCase();
+        const matchCount = failureKeywords.filter((kw) => experienceText.includes(kw)).length;
+        return matchCount >= Math.min(2, failureKeywords.length / 2);
+    }
+    /**
+     * Build refinement prompt with failure context and memory
+     */
+    buildRefinementPrompt(failureContext, failureMemory) {
+        const parts = [];
+        if (this.config.injectFailureContext) {
+            parts.push('## Previous Attempt Feedback');
+            parts.push('');
+            parts.push(`Your previous attempt (iteration ${failureContext.previousAttempts}) had issues:`);
+            parts.push('');
+            for (const issue of failureContext.evaluation.issues) {
+                const severity = issue.severity.toUpperCase();
+                parts.push(`- **[${severity}]** ${issue.type}: ${issue.description}`);
+                if (issue.suggestion) {
+                    parts.push(`  *Suggestion:* ${issue.suggestion}`);
+                }
+            }
+            parts.push('');
+            parts.push(`Quality score: ${(failureContext.evaluation.score * 100).toFixed(0)}%`);
+            parts.push(`Assessment: ${failureContext.evaluation.quality}`);
+            parts.push('');
+        }
+        if (failureMemory && this.config.queryFailureMemory) {
+            // Add recovery playbooks from memory
+            if (failureMemory.playbooks.length > 0) {
+                parts.push('## Recovery Playbooks from Memory');
+                parts.push('');
+                for (const { playbook, score } of failureMemory.playbooks.slice(0, 3)) {
+                    parts.push(`- **${playbook.name}** (${(score * 100).toFixed(0)}% relevant)`);
+                    parts.push(`  Strategy: ${playbook.guidance.strategy}`);
+                    if (playbook.guidance.steps && playbook.guidance.steps.length > 0) {
+                        parts.push(`  Steps: ${playbook.guidance.steps.slice(0, 3).join(' → ')}`);
+                    }
+                }
+                parts.push('');
+            }
+            // Add successful recovery experiences
+            if (failureMemory.experiences.length > 0) {
+                parts.push('## Similar Problems Successfully Solved');
+                parts.push('');
+                for (const { experience } of failureMemory.experiences.slice(0, 2)) {
+                    parts.push(`- Task: ${experience.taskInput.slice(0, 150)}...`);
+                    parts.push(`  Solution approach: ${experience.solutionOutput.slice(0, 200)}...`);
+                }
+                parts.push('');
+            }
+        }
+        parts.push('## Instructions for This Attempt');
+        parts.push('');
+        parts.push('Please address the issues identified above and try a different approach.');
+        parts.push('Focus on:');
+        parts.push('1. Avoiding the specific errors from the previous attempt');
+        parts.push('2. Using the recovery playbooks if applicable');
+        parts.push('3. Taking a more thorough or alternative approach');
+        return parts.join('\n');
+    }
+}
+/**
+ * Create a refinement loop
+ */
+export function createRefinementLoop(agentManager, memory, config) {
+    return new RefinementLoop(agentManager, memory, config);
+}
+//# sourceMappingURL=refinement-loop.js.map

package/dist/search/refinement-loop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refinement-loop.js","sourceRoot":"","sources":["../../src/search/refinement-loop.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAYH,OAAO,EAAE,iBAAiB,EAAwB,MAAM,gBAAgB,CAAC;AAsBzE;;GAEG;AACH,MAAM,cAAc,GAAmC;IACrD,aAAa,EAAE,CAAC;IAChB,kBAAkB,EAAE,GAAG;IACvB,oBAAoB,EAAE,IAAI;IAC1B,kBAAkB,EAAE,IAAI;IACxB,eAAe,EAAE,EAAE;IACnB,mBAAmB,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;IAC5C,mBAAmB,EAAE,IAAI;CAC1B,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,cAAc;IACjB,YAAY,CAAe;IAC3B,MAAM,CAAe;IACrB,SAAS,CAAoB;IAC7B,MAAM,CAAiC;IAE/C,YACE,YAA0B,EAC1B,MAAoB,EACpB,SAA+B,EAAE;QAEjC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;QAC/C,IAAI,CAAC,SAAS,GAAG,IAAI,iBAAiB,CACpC,YAAY,EACZ,IAAI,CAAC,MAAM,CAAC,eAAe,CAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,uBAAuB,CACrB,QAAqD,EACrD,UAAmB;QAEnB,uCAAuC;QACvC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,gDAAgD;QAChD,IACE,UAAU,KAAK,SAAS;YACxB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAC7C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,iBAA6B,EAC7B,WAA6B;QAE7B,MAAM,WAAW,GAAuB,EAAE,CAAC;QAC3C,IAAI,iBAAiB,GAAG,iBAAiB,CAAC;QAC1C,IAAI,cAAc,GAAG,iBAAiB,CAAC;QACvC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,8BAA8B;QAC9B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAC/C,iBAAiB,EACjB,WAAW,CAAC,IAAI,CACjB,CAAC;QACF,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9B,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC;QAE9B,yCAAyC;QACzC,IAAI,WAAW,CAAC,UAAU,IAAI,WAAW,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;YAClF,OAAO;gBACL,UAAU,EAAE,iBAAiB;gBAC7B,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,CAAC;gBACb,WAAW;gBACX,QAAQ,EAAE,KAAK;gBACf,SAAS,EAAE,WAAW,CAAC,KAAK;aAC7B,CAAC;QACJ,CAAC;QAED,kBAAkB;QAClB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;YAC3E,wBAAwB;YACxB,MAAM,cAAc,GAAmB;gBACrC,iBAAiB,EAAE,iBAAiB,CAAC,OAAO,CAAC,QAAQ;gBACrD,UAAU,EAAE,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC/C,cAAc,EAAE,iBAAiB,CAAC,KAAK,CAAC,MAAM;gBAC9C,gBAAgB,EAAE,SAAS,GAAG,CAAC;aAChC,CAAC;YAEF,+CAA+C;YAC/C,IAAI,aAA8C,CAAC;YACnD,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBACnC,aAAa,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAC7C,WAAW,CAAC,IAAI,EAChB,cAAc,CACf,CAAC;YACJ,CAAC;YAED,0BAA0B;YAC1B,MAAM,mBAAmB,GAAG,IAAI,CAAC,qBAAqB,CACpD,cAAc,EACd,aAAa,CACd,CAAC;YAEF,sBAAsB;YACtB,MAAM,aAAa,GAAqB;gBACtC,GAAG,WAAW;gBACd,qBAAqB,EAAE;oBACrB,WAAW,CAAC,qBAAqB;oBACjC,mBAAmB;iBACpB;qBACE,MAAM,CAAC,OAAO,CAAC;qBACf,IAAI,CAAC,MAAM,CAAC;aAChB,CAAC;YAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC5D,iBAAiB,GAAG,MAAM,CAAC,UAAU,CAAC;YAEtC,8BAA8B;YAC9B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAC9C,iBAAiB,EACjB,WAAW,CAAC,IAAI,CACjB,CAAC;YACF,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAE7B,aAAa;YACb,IAAI,UAAU,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC;gBACjC,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC;gBAC7B,cAAc,GAAG,iBAAiB,CAAC;gBACnC,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YAED,sBAAsB;YACtB,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAChF,OAAO;oBACL,UAAU,EAAE,iBAAiB;oBAC7B,OAAO,EAAE,IAAI;oBACb,UAAU,EAAE,SAAS,GAAG,CAAC;oBACzB,WAAW;oBACX,QAAQ;oBACR,SAAS;iBACV,CAAC;YACJ,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,OAAO;YACL,UAAU,EAAE,cAAc;YAC1B,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB;YACpD,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACrC,WAAW;YACX,QAAQ;YACR,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAChC,IAAU,EACV,cAA8B;QAE9B,oCAAoC;QACpC,MAAM,kBAAkB,GAAG,cAAc,CAAC,UAAU,CAAC,MAAM;aACxD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC;aACjC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,WAAW,mBAAmB,kBAAkB,EAAE,CAAC;QAEzE,qDAAqD;QACrD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE;YAC/C,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;YAChD,kBAAkB,EAAE,IAAI;YACxB,gBAAgB,EAAE,IAAI;SACvB,CAAC,CAAC;QAEH,yEAAyE;QACzE,oCAAoC;QACpC,MAAM,mBAAmB,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CACpD,CAAC,GAAG,EAAE,EAAE,CACN,GAAG,CAAC,UAAU,CAAC,OAAO;YACtB,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAChE,CAAC;QAEF,OAAO;YACL,GAAG,OAAO;YACV,WAAW,EAAE,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW;SACxF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,UAA+E,EAC/E,cAA8B;QAE9B,kEAAkE;QAClE,MAAM,eAAe,GAAG,cAAc,CAAC,UAAU,CAAC,MAAM;aACrD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aAC1D,IAAI,EAAE;aACN,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAErC,MAAM,cAAc,GAAG,CACrB,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;aACrB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,EAAE,CAAC;aAC/B,IAAI,CAAC,GAAG,CAAC;YACZ,GAAG;YACH,UAAU,CAAC,cAAc,CAC1B,CAAC,WAAW,EAAE,CAAC;QAEhB,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAC/C,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC5B,CAAC,MAAM,CAAC;QAET,OAAO,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,cAA8B,EAC9B,aAAmC;QAEnC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CACR,oCAAoC,cAAc,CAAC,gBAAgB,eAAe,CACnF,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEf,KAAK,MAAM,KAAK,IAAI,cAAc,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACrD,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,QAAQ,OAAO,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBACtE,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC,mBAAmB,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,cAAc,CAAC,UAAU,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACpF,KAAK,CAAC,IAAI,CAAC,eAAe,cAAc,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;YAC/D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,IAAI,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;YACpD,qCAAqC;YACrC,IAAI,aAAa,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvC,KAAK,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;gBAChD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,KAAK,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACtE,KAAK,CAAC,IAAI,CACR,OAAO,QAAQ,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CACjE,CAAC;oBACF,KAAK,CAAC,IAAI,CAAC,eAAe,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACxD,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAClE,KAAK,CAAC,IAAI,CAAC,YAAY,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAC5E,CAAC;gBACH,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;YAED,sCAAsC;YACtC,IAAI,aAAa,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzC,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;gBACtD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACnE,KAAK,CAAC,IAAI,CAAC,WAAW,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC/D,KAAK,CAAC,IAAI,CAAC,wBAAwB,UAAU,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnF,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;QACvF,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;QACxE,KAAK,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;QAEhE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,YAA0B,EAC1B,MAAoB,EACpB,MAA6B;IAE7B,OAAO,IAAI,cAAc,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAC1D,CAAC"}

package/dist/search/refinement-types.d.ts

@@ -0,0 +1,154 @@
+/**
+ * Refinement Types
+ *
+ * Types for the ReMem-style refinement loop that iteratively
+ * improves solutions using memory-augmented feedback.
+ */
+import { z } from 'zod';
+/**
+ * Issue type found during evaluation
+ */
+export declare const IssueTypeSchema: z.ZodEnum<["incomplete", "incorrect", "inefficient", "off_topic", "error"]>;
+export type IssueType = z.infer<typeof IssueTypeSchema>;
+/**
+ * Severity of an issue
+ */
+export declare const IssueSeveritySchema: z.ZodEnum<["critical", "major", "minor"]>;
+export type IssueSeverity = z.infer<typeof IssueSeveritySchema>;
+/**
+ * An issue found during solution evaluation
+ */
+export declare const EvaluationIssueSchema: z.ZodObject<{
+    type: z.ZodEnum<["incomplete", "incorrect", "inefficient", "off_topic", "error"]>;
+    description: z.ZodString;
+    severity: z.ZodEnum<["critical", "major", "minor"]>;
+    suggestion: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+    description: string;
+    severity: "major" | "minor" | "critical";
+    suggestion?: string | undefined;
+}, {
+    type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+    description: string;
+    severity: "major" | "minor" | "critical";
+    suggestion?: string | undefined;
+}>;
+export type EvaluationIssue = z.infer<typeof EvaluationIssueSchema>;
+/**
+ * Quality assessment level
+ */
+export declare const QualityLevelSchema: z.ZodEnum<["excellent", "good", "needs_work", "poor"]>;
+export type QualityLevel = z.infer<typeof QualityLevelSchema>;
+/**
+ * How the evaluation was performed
+ */
+export declare const EvaluationMethodSchema: z.ZodEnum<["verification", "agent", "heuristic"]>;
+export type EvaluationMethod = z.infer<typeof EvaluationMethodSchema>;
+/**
+ * Result of evaluating a solution's quality
+ */
+export declare const EvaluationResultSchema: z.ZodObject<{
+    /** Overall quality assessment */
+    quality: z.ZodEnum<["excellent", "good", "needs_work", "poor"]>;
+    /** Numeric score (0-1) */
+    score: z.ZodNumber;
+    /** Whether this solution is acceptable */
+    acceptable: z.ZodBoolean;
+    /** Specific issues found */
+    issues: z.ZodArray<z.ZodObject<{
+        type: z.ZodEnum<["incomplete", "incorrect", "inefficient", "off_topic", "error"]>;
+        description: z.ZodString;
+        severity: z.ZodEnum<["critical", "major", "minor"]>;
+        suggestion: z.ZodOptional<z.ZodString>;
+    }, "strip", z.ZodTypeAny, {
+        type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+        description: string;
+        severity: "major" | "minor" | "critical";
+        suggestion?: string | undefined;
+    }, {
+        type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+        description: string;
+        severity: "major" | "minor" | "critical";
+        suggestion?: string | undefined;
+    }>, "many">;
+    /** How the evaluation was performed */
+    method: z.ZodEnum<["verification", "agent", "heuristic"]>;
+    /** Raw response from evaluator (for debugging) */
+    rawResponse: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    issues: {
+        type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+        description: string;
+        severity: "major" | "minor" | "critical";
+        suggestion?: string | undefined;
+    }[];
+    acceptable: boolean;
+    score: number;
+    quality: "excellent" | "good" | "poor" | "needs_work";
+    method: "verification" | "agent" | "heuristic";
+    rawResponse?: string | undefined;
+}, {
+    issues: {
+        type: "error" | "incomplete" | "incorrect" | "inefficient" | "off_topic";
+        description: string;
+        severity: "major" | "minor" | "critical";
+        suggestion?: string | undefined;
+    }[];
+    acceptable: boolean;
+    score: number;
+    quality: "excellent" | "good" | "poor" | "needs_work";
+    method: "verification" | "agent" | "heuristic";
+    rawResponse?: string | undefined;
+}>;
+export type EvaluationResult = z.infer<typeof EvaluationResultSchema>;
+/**
+ * Context about why a solution failed
+ */
+export interface FailureContext {
+    /** The solution that was attempted */
+    attemptedSolution: unknown;
+    /** Evaluation result */
+    evaluation: EvaluationResult;
+    /** Number of steps taken in the attempt */
+    stepsAttempted: number;
+    /** Number of previous refinement attempts */
+    previousAttempts: number;
+}
+/**
+ * Result of the refinement loop
+ */
+export interface RefinementResult {
+    /** Final trajectory after refinement */
+    trajectory: import('../types/trajectory.js').Trajectory;
+    /** Whether the final solution is acceptable */
+    success: boolean;
+    /** Number of refinement iterations performed */
+    iterations: number;
+    /** Evaluation results from each iteration */
+    evaluations: EvaluationResult[];
+    /** Whether refinement improved the solution */
+    improved: boolean;
+    /** Best score achieved during refinement */
+    bestScore: number;
+}
+/**
+ * Create an evaluation result
+ */
+export declare function createEvaluationResult(params: {
+    quality: QualityLevel;
+    score: number;
+    acceptable: boolean;
+    issues?: EvaluationIssue[];
+    method: EvaluationMethod;
+    rawResponse?: string;
+}): EvaluationResult;
+/**
+ * Determine quality level from a numeric score
+ */
+export declare function scoreToQuality(score: number): QualityLevel;
+/**
+ * Check if a quality level is acceptable
+ */
+export declare function isQualityAcceptable(quality: QualityLevel, minAcceptable?: QualityLevel): boolean;
+//# sourceMappingURL=refinement-types.d.ts.map

package/dist/search/refinement-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refinement-types.d.ts","sourceRoot":"","sources":["../../src/search/refinement-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;GAEG;AACH,eAAO,MAAM,eAAe,6EAM1B,CAAC;AAEH,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,eAAe,CAAC,CAAC;AAExD;;GAEG;AACH,eAAO,MAAM,mBAAmB,2CAAyC,CAAC;AAE1E,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAEhE;;GAEG;AACH,eAAO,MAAM,qBAAqB;;;;;;;;;;;;;;;EAKhC,CAAC;AAEH,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAEpE;;GAEG;AACH,eAAO,MAAM,kBAAkB,wDAK7B,CAAC;AAEH,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,sBAAsB,mDAIjC,CAAC;AAEH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAEtE;;GAEG;AACH,eAAO,MAAM,sBAAsB;IACjC,iCAAiC;;IAEjC,0BAA0B;;IAE1B,0CAA0C;;IAE1C,4BAA4B;;;;;;;;;;;;;;;;;IAE5B,uCAAuC;;IAEvC,kDAAkD;;;;;;;;;;;;;;;;;;;;;;;;;;EAElD,CAAC;AAEH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,sBAAsB,CAAC,CAAC;AAEtE;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,sCAAsC;IACtC,iBAAiB,EAAE,OAAO,CAAC;IAC3B,wBAAwB;IACxB,UAAU,EAAE,gBAAgB,CAAC;IAC7B,2CAA2C;IAC3C,cAAc,EAAE,MAAM,CAAC;IACvB,6CAA6C;IAC7C,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,wCAAwC;IACxC,UAAU,EAAE,OAAO,wBAAwB,EAAE,UAAU,CAAC;IACxD,+CAA+C;IAC/C,OAAO,EAAE,OAAO,CAAC;IACjB,gDAAgD;IAChD,UAAU,EAAE,MAAM,CAAC;IACnB,6CAA6C;IAC7C,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAChC,+CAA+C;IAC/C,QAAQ,EAAE,OAAO,CAAC;IAClB,4CAA4C;IAC5C,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE;IAC7C,OAAO,EAAE,YAAY,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,CAAC;IACpB,MAAM,CAAC,EAAE,eAAe,EAAE,CAAC;IAC3B,MAAM,EAAE,gBAAgB,CAAC;IACzB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB,GAAG,gBAAgB,CASnB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAK1D;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,YAAY,EACrB,aAAa,GAAE,YAAqB,GACnC,OAAO,CAKT"}

package/dist/search/refinement-types.js

@@ -0,0 +1,99 @@
+/**
+ * Refinement Types
+ *
+ * Types for the ReMem-style refinement loop that iteratively
+ * improves solutions using memory-augmented feedback.
+ */
+import { z } from 'zod';
+/**
+ * Issue type found during evaluation
+ */
+export const IssueTypeSchema = z.enum([
+    'incomplete',
+    'incorrect',
+    'inefficient',
+    'off_topic',
+    'error',
+]);
+/**
+ * Severity of an issue
+ */
+export const IssueSeveritySchema = z.enum(['critical', 'major', 'minor']);
+/**
+ * An issue found during solution evaluation
+ */
+export const EvaluationIssueSchema = z.object({
+    type: IssueTypeSchema,
+    description: z.string(),
+    severity: IssueSeveritySchema,
+    suggestion: z.string().optional(),
+});
+/**
+ * Quality assessment level
+ */
+export const QualityLevelSchema = z.enum([
+    'excellent',
+    'good',
+    'needs_work',
+    'poor',
+]);
+/**
+ * How the evaluation was performed
+ */
+export const EvaluationMethodSchema = z.enum([
+    'verification',
+    'agent',
+    'heuristic',
+]);
+/**
+ * Result of evaluating a solution's quality
+ */
+export const EvaluationResultSchema = z.object({
+    /** Overall quality assessment */
+    quality: QualityLevelSchema,
+    /** Numeric score (0-1) */
+    score: z.number().min(0).max(1),
+    /** Whether this solution is acceptable */
+    acceptable: z.boolean(),
+    /** Specific issues found */
+    issues: z.array(EvaluationIssueSchema),
+    /** How the evaluation was performed */
+    method: EvaluationMethodSchema,
+    /** Raw response from evaluator (for debugging) */
+    rawResponse: z.string().optional(),
+});
+/**
+ * Create an evaluation result
+ */
+export function createEvaluationResult(params) {
+    return EvaluationResultSchema.parse({
+        quality: params.quality,
+        score: params.score,
+        acceptable: params.acceptable,
+        issues: params.issues ?? [],
+        method: params.method,
+        rawResponse: params.rawResponse,
+    });
+}
+/**
+ * Determine quality level from a numeric score
+ */
+export function scoreToQuality(score) {
+    if (score >= 0.85)
+        return 'excellent';
+    if (score >= 0.7)
+        return 'good';
+    if (score >= 0.4)
+        return 'needs_work';
+    return 'poor';
+}
+/**
+ * Check if a quality level is acceptable
+ */
+export function isQualityAcceptable(quality, minAcceptable = 'good') {
+    const levels = ['poor', 'needs_work', 'good', 'excellent'];
+    const qualityIndex = levels.indexOf(quality);
+    const minIndex = levels.indexOf(minAcceptable);
+    return qualityIndex >= minIndex;
+}
+//# sourceMappingURL=refinement-types.js.map

package/dist/search/refinement-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refinement-types.js","sourceRoot":"","sources":["../../src/search/refinement-types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,IAAI,CAAC;IACpC,YAAY;IACZ,WAAW;IACX,aAAa;IACb,WAAW;IACX,OAAO;CACR,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;AAI1E;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,IAAI,EAAE,eAAe;IACrB,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,QAAQ,EAAE,mBAAmB;IAC7B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CAClC,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,IAAI,CAAC;IACvC,WAAW;IACX,MAAM;IACN,YAAY;IACZ,MAAM;CACP,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,IAAI,CAAC;IAC3C,cAAc;IACd,OAAO;IACP,WAAW;CACZ,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,iCAAiC;IACjC,OAAO,EAAE,kBAAkB;IAC3B,0BAA0B;IAC1B,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,0CAA0C;IAC1C,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE;IACvB,4BAA4B;IAC5B,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC;IACtC,uCAAuC;IACvC,MAAM,EAAE,sBAAsB;IAC9B,kDAAkD;IAClD,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CACnC,CAAC,CAAC;AAoCH;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAOtC;IACC,OAAO,sBAAsB,CAAC,KAAK,CAAC;QAClC,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE;QAC3B,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,WAAW,EAAE,MAAM,CAAC,WAAW;KAChC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,IAAI,KAAK,IAAI,IAAI;QAAE,OAAO,WAAW,CAAC;IACtC,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO,MAAM,CAAC;IAChC,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO,YAAY,CAAC;IACtC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAqB,EACrB,gBAA8B,MAAM;IAEpC,MAAM,MAAM,GAAmB,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC3E,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAC/C,OAAO,YAAY,IAAI,QAAQ,CAAC;AAClC,CAAC"}

package/dist/search/router.d.ts

@@ -0,0 +1,61 @@
+import type { Task, RouterConfig } from '../types/index.js';
+import type { MemorySystem, MemoryQueryResultV2 } from '../memory/system.js';
+import type { MetaLearner } from '../learning/meta-learner.js';
+/**
+ * Routing decision with context
+ */
+export interface RoutingDecision {
+    /** Selected strategy for solving */
+    strategy: 'direct' | 'adapt' | 'explore' | 'fallback';
+    /** Confidence in this routing (0-1) */
+    confidence: number;
+    /** Memory query results (playbook format) */
+    memoryContext: MemoryQueryResultV2;
+    /** Estimated compute budget (LLM calls) */
+    estimatedBudget: number;
+    /** Reasoning for the decision */
+    reasoning: string;
+    /** Meta-strategies that were applied */
+    appliedMetaStrategies?: string[];
+}
+/**
+ * Task Router
+ * Determines the best approach for solving a task based on memory
+ * Now with meta-learning integration for adaptive routing
+ */
+export declare class TaskRouter {
+    private memory;
+    private config;
+    private metaLearner?;
+    constructor(memory: MemorySystem, config?: Partial<RouterConfig>, metaLearner?: MetaLearner);
+    /**
+     * Set the meta learner (can be set after construction)
+     */
+    setMetaLearner(metaLearner: MetaLearner): void;
+    /**
+     * Route a task to determine solving strategy
+     * Uses playbook-based memory with meta-learning adjustments
+     */
+    route(task: Task): Promise<RoutingDecision>;
+    /**
+     * Compute base routing decision from memory results
+     */
+    private computeBaseRouting;
+    /**
+     * Extract task characteristics for meta-learning
+     */
+    private extractTaskCharacteristics;
+    /**
+     * Summarize memory state for meta-learning
+     */
+    private summarizeMemoryState;
+    /**
+     * Update configuration
+     */
+    updateConfig(config: Partial<RouterConfig>): void;
+}
+/**
+ * Create a task router
+ */
+export declare function createRouter(memory: MemorySystem, config?: Partial<RouterConfig>, metaLearner?: MetaLearner): TaskRouter;
+//# sourceMappingURL=router.d.ts.map

package/dist/search/router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../../src/search/router.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC7E,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE/D;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,oCAAoC;IACpC,QAAQ,EAAE,QAAQ,GAAG,OAAO,GAAG,SAAS,GAAG,UAAU,CAAC;IACtD,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,6CAA6C;IAC7C,aAAa,EAAE,mBAAmB,CAAC;IACnC,2CAA2C;IAC3C,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,wCAAwC;IACxC,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC;CAClC;AAED;;;;GAIG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,WAAW,CAAC,CAAc;gBAGhC,MAAM,EAAE,YAAY,EACpB,MAAM,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,EAC9B,WAAW,CAAC,EAAE,WAAW;IAW3B;;OAEG;IACH,cAAc,CAAC,WAAW,EAAE,WAAW,GAAG,IAAI;IAI9C;;;OAGG;IACG,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,eAAe,CAAC;IA6CjD;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAyD1B;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAsClC;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAqC5B;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI;CAGlD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,YAAY,EACpB,MAAM,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,EAC9B,WAAW,CAAC,EAAE,WAAW,GACxB,UAAU,CAEZ"}