conatus 0.1.0

package/dist/knowledge-manager.js

@@ -0,0 +1,544 @@
+import { randomUUID } from "node:crypto";
+import { z } from "zod";
+import { TaskSchema } from "./types/task.js";
+import { KnowledgeEntrySchema, DomainKnowledgeSchema, KnowledgeGapSignalSchema, ContradictionResultSchema, SharedKnowledgeEntrySchema, DomainStabilitySchema, REVALIDATION_SCHEDULE, } from "./types/knowledge.js";
+// ─── LLM response schemas ───
+const DomainStabilityResponseSchema = z.object({
+    stability: DomainStabilitySchema,
+    rationale: z.string().optional(),
+});
+const GapDetectionResponseSchema = z.object({
+    has_gap: z.boolean(),
+    signal_type: z
+        .enum([
+        "interpretation_difficulty",
+        "strategy_deadlock",
+        "stall_information_deficit",
+        "new_domain",
+        "prerequisite_missing",
+    ])
+        .optional(),
+    missing_knowledge: z.string().optional(),
+    source_step: z.string().optional(),
+    related_dimension: z.string().nullable().optional(),
+});
+const AcquisitionTaskFieldsSchema = z.object({
+    knowledge_target: z.string(),
+    // Allow up to 6 from LLM; we clamp to 5 in generateAcquisitionTask
+    knowledge_questions: z.array(z.string()).min(3),
+    in_scope: z.array(z.string()),
+    out_of_scope: z.array(z.string()),
+});
+const ContradictionCheckResponseSchema = z.object({
+    has_contradiction: z.boolean(),
+    conflicting_entry_id: z.string().nullable().default(null),
+    resolution: z.string().nullable().default(null),
+});
+// ─── KnowledgeManager ───
+/** Key used to store all SharedKnowledgeEntries as a flat array. */
+const SHARED_KB_PATH = "memory/shared-knowledge/entries.json";
+/**
+ * KnowledgeManager detects knowledge gaps, generates research tasks,
+ * and persists/retrieves domain knowledge entries.
+ *
+ * File layout:
+ *   <base>/goals/<goal_id>/domain_knowledge.json
+ *   <base>/memory/shared-knowledge/entries.json  (Phase 2 shared KB)
+ */
+export class KnowledgeManager {
+    stateManager;
+    llmClient;
+    vectorIndex;
+    embeddingClient;
+    constructor(stateManager, llmClient, vectorIndex, embeddingClient) {
+        this.stateManager = stateManager;
+        this.llmClient = llmClient;
+        this.vectorIndex = vectorIndex;
+        this.embeddingClient = embeddingClient;
+    }
+    // ─── detectKnowledgeGap ───
+    /**
+     * Detect whether the given context reveals a knowledge gap.
+     *
+     * Fast-path heuristics:
+     *   - confidence < 0.3 → interpretation_difficulty
+     *   - strategies empty  → strategy_deadlock
+     *
+     * Otherwise, delegate to LLM for deeper analysis.
+     */
+    async detectKnowledgeGap(context) {
+        // Fast-path: low confidence → interpretation difficulty
+        if (context.confidence < 0.3) {
+            return KnowledgeGapSignalSchema.parse({
+                signal_type: "interpretation_difficulty",
+                missing_knowledge: "Observation confidence is too low to interpret results reliably",
+                source_step: "gap_recognition",
+                related_dimension: null,
+            });
+        }
+        // Fast-path: strategies is an explicit empty array (tried and found none) → strategy deadlock.
+        // null/undefined means "not yet available" and must NOT trigger this fast-path.
+        if (Array.isArray(context.strategies) && context.strategies.length === 0) {
+            return KnowledgeGapSignalSchema.parse({
+                signal_type: "strategy_deadlock",
+                missing_knowledge: "No strategies available — domain knowledge needed to generate hypotheses",
+                source_step: "strategy_selection",
+                related_dimension: null,
+            });
+        }
+        // LLM-based detection for borderline cases
+        const prompt = `Analyze the following context and determine whether there is a knowledge gap that would prevent effective progress.
+
+Observations (${context.observations.length} items): ${JSON.stringify(context.observations).slice(0, 500)}
+Strategies (${(context.strategies ?? []).length} items): ${JSON.stringify(context.strategies ?? []).slice(0, 500)}
+Confidence: ${context.confidence}
+
+Determine if there is a knowledge gap. Respond with JSON:
+{
+  "has_gap": boolean,
+  "signal_type": "interpretation_difficulty" | "strategy_deadlock" | "stall_information_deficit" | "new_domain" | "prerequisite_missing" | null,
+  "missing_knowledge": "description of what is missing" | null,
+  "source_step": "gap_recognition" | "strategy_selection" | "task_generation" | null,
+  "related_dimension": "dimension name" | null
+}`;
+        const response = await this.llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You are a knowledge gap detector. Analyze contexts to identify missing domain knowledge. Respond with JSON only.",
+            max_tokens: 512,
+        });
+        try {
+            const parsed = this.llmClient.parseJSON(response.content, GapDetectionResponseSchema);
+            if (!parsed.has_gap) {
+                return null;
+            }
+            return KnowledgeGapSignalSchema.parse({
+                signal_type: parsed.signal_type ?? "interpretation_difficulty",
+                missing_knowledge: parsed.missing_knowledge ?? "Unspecified knowledge gap detected",
+                source_step: parsed.source_step ?? "gap_recognition",
+                related_dimension: parsed.related_dimension ?? null,
+            });
+        }
+        catch {
+            return null;
+        }
+    }
+    // ─── generateAcquisitionTask ───
+    /**
+     * Generate a knowledge acquisition Task for the given signal and goal.
+     * The task will have task_category: "knowledge_acquisition", 3-5 research
+     * questions, and explicit scope limits.
+     */
+    async generateAcquisitionTask(signal, goalId) {
+        const prompt = `You are generating a knowledge acquisition task for an AI orchestrator.
+
+Goal ID: ${goalId}
+Knowledge Gap Signal:
+  Type: ${signal.signal_type}
+  Missing Knowledge: ${signal.missing_knowledge}
+  Source Step: ${signal.source_step}
+  Related Dimension: ${signal.related_dimension ?? "none"}
+
+Generate a research task with 3-5 specific questions that, when answered, will resolve this knowledge gap.
+The task must be scoped to information collection only — no system changes.
+
+Respond with JSON:
+{
+  "knowledge_target": "concise description of what knowledge is needed",
+  "knowledge_questions": ["question 1", "question 2", "question 3"],
+  "in_scope": ["item 1", "item 2"],
+  "out_of_scope": ["item 1", "item 2"]
+}`;
+        const response = await this.llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You generate knowledge acquisition tasks. Produce 3-5 specific research questions. Respond with JSON only.",
+            max_tokens: 1024,
+        });
+        const fields = this.llmClient.parseJSON(response.content, AcquisitionTaskFieldsSchema);
+        // Clamp questions to 3-5
+        const questions = fields.knowledge_questions.slice(0, 5);
+        const taskId = randomUUID();
+        const now = new Date().toISOString();
+        const criteriaDescription = `All ${questions.length} research questions are answered with cited sources: ${questions.join("; ")}`;
+        const task = TaskSchema.parse({
+            id: taskId,
+            goal_id: goalId,
+            strategy_id: null,
+            target_dimensions: signal.related_dimension
+                ? [signal.related_dimension]
+                : [],
+            primary_dimension: signal.related_dimension ?? "knowledge",
+            work_description: `Research task: ${fields.knowledge_target}`,
+            rationale: `Knowledge gap detected (${signal.signal_type}): ${signal.missing_knowledge}`,
+            approach: `Research the following questions using web search and document analysis:\n${questions.map((q, i) => `${i + 1}. ${q}`).join("\n")}`,
+            success_criteria: [
+                {
+                    description: criteriaDescription,
+                    verification_method: "Verify each question has a cited answer in the task output",
+                    is_blocking: true,
+                },
+            ],
+            scope_boundary: {
+                in_scope: ["Information collection", "Web search", "Document reading", ...fields.in_scope],
+                out_of_scope: [
+                    "System modifications",
+                    "Code changes",
+                    "Data mutations",
+                    ...fields.out_of_scope,
+                ],
+                blast_radius: "None — read-only research task",
+            },
+            constraints: [
+                `In scope: ${fields.in_scope.join(", ")}. Out of scope: ${fields.out_of_scope.join(", ")}`,
+                "No system modifications allowed",
+                "Maximum 3-5 research questions per task",
+            ],
+            reversibility: "reversible",
+            estimated_duration: { value: 4, unit: "hours" },
+            task_category: "knowledge_acquisition",
+            status: "pending",
+            created_at: now,
+        });
+        // Persist
+        this.stateManager.writeRaw(`tasks/${goalId}/${taskId}.json`, task);
+        return task;
+    }
+    // ─── saveKnowledge ───
+    /**
+     * Persist a KnowledgeEntry to ~/.motiva/goals/<goal_id>/domain_knowledge.json
+     */
+    async saveKnowledge(goalId, entry) {
+        const parsed = KnowledgeEntrySchema.parse(entry);
+        const domainKnowledge = await this.loadDomainKnowledge(goalId);
+        domainKnowledge.entries.push(parsed);
+        domainKnowledge.last_updated = new Date().toISOString();
+        const validated = DomainKnowledgeSchema.parse(domainKnowledge);
+        this.stateManager.writeRaw(`goals/${goalId}/domain_knowledge.json`, validated);
+        // Phase 2: also index in VectorIndex when available
+        if (this.vectorIndex) {
+            await this.vectorIndex.add(parsed.entry_id, `${parsed.question} ${parsed.answer}`, { goal_id: goalId, tags: parsed.tags });
+        }
+    }
+    // ─── loadKnowledge ───
+    /**
+     * Load knowledge entries for a goal, optionally filtered by tags (exact match).
+     *
+     * An entry matches if ALL provided tags appear in the entry's tags array.
+     */
+    async loadKnowledge(goalId, tags) {
+        const domainKnowledge = await this.loadDomainKnowledge(goalId);
+        const entries = domainKnowledge.entries;
+        if (!tags || tags.length === 0) {
+            return entries;
+        }
+        return entries.filter((entry) => tags.every((tag) => entry.tags.includes(tag)));
+    }
+    // ─── checkContradiction ───
+    /**
+     * Check whether a new entry contradicts existing same-tag entries.
+     * Uses LLM to compare answers for entries sharing tags with the new entry.
+     */
+    async checkContradiction(goalId, newEntry) {
+        // Load entries that share at least one tag with the new entry
+        const domainKnowledge = await this.loadDomainKnowledge(goalId);
+        const candidateEntries = domainKnowledge.entries.filter((existing) => existing.entry_id !== newEntry.entry_id &&
+            existing.tags.some((tag) => newEntry.tags.includes(tag)) &&
+            existing.superseded_by === null);
+        if (candidateEntries.length === 0) {
+            return ContradictionResultSchema.parse({
+                has_contradiction: false,
+                conflicting_entry_id: null,
+                resolution: null,
+            });
+        }
+        const existingSummary = candidateEntries
+            .map((e) => `Entry ${e.entry_id}:\n  Question: ${e.question}\n  Answer: ${e.answer}\n  Tags: ${e.tags.join(", ")}`)
+            .join("\n\n");
+        const prompt = `Check whether the new knowledge entry contradicts any existing entries.
+
+New Entry:
+  Question: ${newEntry.question}
+  Answer: ${newEntry.answer}
+  Tags: ${newEntry.tags.join(", ")}
+
+Existing Entries (same tags):
+${existingSummary}
+
+Determine if there is a factual contradiction. Respond with JSON:
+{
+  "has_contradiction": boolean,
+  "conflicting_entry_id": "entry_id of the conflicting entry" | null,
+  "resolution": "explanation of the contradiction and suggested resolution" | null
+}`;
+        const response = await this.llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You are a knowledge consistency checker. Detect factual contradictions between knowledge entries. Respond with JSON only.",
+            max_tokens: 512,
+        });
+        try {
+            const parsed = this.llmClient.parseJSON(response.content, ContradictionCheckResponseSchema);
+            return ContradictionResultSchema.parse(parsed);
+        }
+        catch {
+            return ContradictionResultSchema.parse({
+                has_contradiction: false,
+                conflicting_entry_id: null,
+                resolution: null,
+            });
+        }
+    }
+    // ─── getRelevantKnowledge ───
+    /**
+     * Returns knowledge entries whose tags include the given dimension name.
+     */
+    async getRelevantKnowledge(goalId, dimensionName) {
+        return this.loadKnowledge(goalId, [dimensionName]);
+    }
+    // ─── searchKnowledge (Phase 2) ───
+    /**
+     * Semantic search within a single goal's knowledge entries via VectorIndex.
+     * Falls back to an empty array when no VectorIndex is configured.
+     */
+    async searchKnowledge(query, topK = 5) {
+        if (!this.vectorIndex) {
+            return [];
+        }
+        const results = await this.vectorIndex.search(query, topK);
+        const entries = [];
+        for (const result of results) {
+            // Load the full entry from the goal stored in metadata
+            const goalId = result.metadata["goal_id"];
+            if (!goalId)
+                continue;
+            const domainKnowledge = await this.loadDomainKnowledge(goalId);
+            const entry = domainKnowledge.entries.find((e) => e.entry_id === result.id);
+            if (entry) {
+                entries.push(entry);
+            }
+        }
+        return entries;
+    }
+    // ─── searchAcrossGoals (Phase 2) ───
+    /**
+     * Cross-goal semantic search. Leverages the VectorIndex which is global
+     * across all goals. Returns entries from any goal ordered by similarity.
+     * Falls back to an empty array when no VectorIndex is configured.
+     */
+    async searchAcrossGoals(query, topK = 5) {
+        // The VectorIndex is goal-agnostic — entries from all goals are indexed
+        // together, so this is semantically equivalent to searchKnowledge but
+        // explicitly documents cross-goal intent.
+        return this.searchKnowledge(query, topK);
+    }
+    // ─── 5.1a: Shared Knowledge Base ───
+    /**
+     * Save a KnowledgeEntry into the shared knowledge base, associating it with
+     * the given goalId. If VectorIndex is available the entry is also embedded
+     * and the embedding_id is stored on the returned SharedKnowledgeEntry.
+     */
+    async saveToSharedKnowledgeBase(entry, goalId) {
+        const now = new Date();
+        // Build shared entry (default stability: moderate)
+        const shared = SharedKnowledgeEntrySchema.parse({
+            ...entry,
+            source_goal_ids: [goalId],
+            domain_stability: "moderate",
+            revalidation_due_at: this._computeRevalidationDue(now, "moderate"),
+            embedding_id: null,
+        });
+        // Load existing entries and merge / append
+        const all = this._loadSharedEntries();
+        const existingIdx = all.findIndex((e) => e.entry_id === entry.entry_id);
+        let merged;
+        if (existingIdx >= 0) {
+            const existing = all[existingIdx];
+            const mergedGoalIds = Array.from(new Set([...existing.source_goal_ids, goalId]));
+            merged = SharedKnowledgeEntrySchema.parse({
+                ...existing,
+                source_goal_ids: mergedGoalIds,
+            });
+            all[existingIdx] = merged;
+        }
+        else {
+            merged = shared;
+            all.push(merged);
+        }
+        // Auto-register in VectorIndex if available
+        if (this.vectorIndex) {
+            const text = `${entry.question} ${entry.answer} ${entry.tags.join(" ")}`;
+            const vectorEntry = await this.vectorIndex.add(entry.entry_id, text, {
+                goal_id: goalId,
+                tags: entry.tags,
+                shared: true,
+            });
+            // Attach the embedding id (same as entry_id in our VectorIndex)
+            merged = SharedKnowledgeEntrySchema.parse({
+                ...merged,
+                embedding_id: vectorEntry.id,
+            });
+            // Update stored copy with embedding_id (use already-known index to avoid double scan)
+            const targetIdx = existingIdx >= 0 ? existingIdx : all.length - 1;
+            all[targetIdx] = merged;
+        }
+        this.stateManager.writeRaw(SHARED_KB_PATH, all);
+        return merged;
+    }
+    /**
+     * Query the shared knowledge base by tags (AND logic).
+     * Optionally filter to entries contributed by a specific goal.
+     */
+    querySharedKnowledge(tags, goalId) {
+        const all = this._loadSharedEntries();
+        return all.filter((entry) => {
+            const tagsMatch = tags.length === 0 || tags.every((t) => entry.tags.includes(t));
+            const goalMatch = goalId === undefined || entry.source_goal_ids.includes(goalId);
+            return tagsMatch && goalMatch;
+        });
+    }
+    // ─── 5.1b: Vector Search for Knowledge Sharing ───
+    /**
+     * Semantic search across the shared knowledge base using VectorIndex.
+     * Falls back to an empty array when no VectorIndex is configured.
+     */
+    async searchByEmbedding(query, topK = 5) {
+        if (!this.vectorIndex) {
+            return [];
+        }
+        const results = await this.vectorIndex.search(query, topK);
+        const all = this._loadSharedEntries();
+        const output = [];
+        for (const result of results) {
+            const entry = all.find((e) => e.entry_id === result.id);
+            if (entry) {
+                output.push({ entry, similarity: result.similarity });
+            }
+        }
+        return output;
+    }
+    // ─── 5.1c: Domain Stability Auto-Revalidation ───
+    /**
+     * Classify the domain stability of a set of knowledge entries via LLM.
+     * Returns "stable", "moderate", or "volatile".
+     */
+    async classifyDomainStability(domain, entries) {
+        const sampleAnswers = entries
+            .slice(0, 5)
+            .map((e) => `Q: ${e.question}\nA: ${e.answer}`)
+            .join("\n\n");
+        const prompt = `You are classifying how quickly knowledge in a domain becomes outdated.
+
+Domain: ${domain}
+Sample knowledge entries:
+${sampleAnswers || "(no entries yet)"}
+
+Classify the domain stability:
+- "stable"   — knowledge rarely changes (math, history, established science)
+- "moderate" — knowledge changes every few months to a year (best practices, frameworks)
+- "volatile" — knowledge changes frequently (current events, fast-moving tech, prices)
+
+Respond with JSON:
+{ "stability": "stable" | "moderate" | "volatile", "rationale": "brief explanation" }`;
+        const response = await this.llmClient.sendMessage([{ role: "user", content: prompt }], {
+            system: "You classify knowledge domain stability. Respond with JSON only.",
+            max_tokens: 256,
+        });
+        try {
+            const parsed = this.llmClient.parseJSON(response.content, DomainStabilityResponseSchema);
+            return parsed.stability;
+        }
+        catch {
+            return "moderate";
+        }
+    }
+    /**
+     * Return shared knowledge entries whose revalidation_due_at is in the past.
+     */
+    getStaleEntries() {
+        const all = this._loadSharedEntries();
+        const now = new Date();
+        return all.filter((entry) => {
+            if (!entry.revalidation_due_at) {
+                // No due date — consider stale based on stability interval from acquired_at
+                const acquiredAt = new Date(entry.acquired_at);
+                const intervalDays = REVALIDATION_SCHEDULE[entry.domain_stability];
+                const dueAt = new Date(acquiredAt.getTime() + intervalDays * 24 * 60 * 60 * 1000);
+                return now > dueAt;
+            }
+            return now > new Date(entry.revalidation_due_at);
+        });
+    }
+    /**
+     * Generate KnowledgeAcquisitionTask-style Task objects for each stale entry,
+     * re-asking the original question.
+     */
+    async generateRevalidationTasks(staleEntries) {
+        const tasks = [];
+        for (const entry of staleEntries) {
+            const goalId = entry.source_goal_ids[0] ?? "shared";
+            const taskId = randomUUID();
+            const now = new Date().toISOString();
+            const task = TaskSchema.parse({
+                id: taskId,
+                goal_id: goalId,
+                strategy_id: null,
+                target_dimensions: entry.tags,
+                primary_dimension: entry.tags[0] ?? "knowledge",
+                work_description: `Revalidate knowledge: ${entry.question}`,
+                rationale: `Entry ${entry.entry_id} is stale (domain_stability: ${entry.domain_stability}, due: ${entry.revalidation_due_at ?? "overdue"})`,
+                approach: `Re-research the following question and verify whether the answer has changed:\n${entry.question}\n\nPrevious answer: ${entry.answer}`,
+                success_criteria: [
+                    {
+                        description: `Confirm or update answer to: "${entry.question}"`,
+                        verification_method: "Compare new answer to existing answer with cited sources",
+                        is_blocking: true,
+                    },
+                ],
+                scope_boundary: {
+                    in_scope: ["Information collection", "Web search", "Document reading"],
+                    out_of_scope: ["System modifications", "Code changes", "Data mutations"],
+                    blast_radius: "None — read-only revalidation task",
+                },
+                constraints: [
+                    "No system modifications allowed",
+                    `Original entry_id: ${entry.entry_id}`,
+                ],
+                reversibility: "reversible",
+                estimated_duration: { value: 2, unit: "hours" },
+                task_category: "knowledge_acquisition",
+                status: "pending",
+                created_at: now,
+            });
+            tasks.push(task);
+        }
+        return tasks;
+    }
+    // ─── Private Helpers ───
+    /** Load all SharedKnowledgeEntries from the shared KB file. */
+    _loadSharedEntries() {
+        const raw = this.stateManager.readRaw(SHARED_KB_PATH);
+        if (!raw || !Array.isArray(raw)) {
+            return [];
+        }
+        try {
+            return raw.map((item) => SharedKnowledgeEntrySchema.parse(item));
+        }
+        catch {
+            return [];
+        }
+    }
+    /** Compute revalidation due date based on stability and a base date. */
+    _computeRevalidationDue(base, stability) {
+        const days = REVALIDATION_SCHEDULE[stability];
+        const due = new Date(base.getTime() + days * 24 * 60 * 60 * 1000);
+        return due.toISOString();
+    }
+    async loadDomainKnowledge(goalId) {
+        const raw = this.stateManager.readRaw(`goals/${goalId}/domain_knowledge.json`);
+        if (raw === null) {
+            return DomainKnowledgeSchema.parse({
+                goal_id: goalId,
+                domain: goalId,
+                entries: [],
+                last_updated: new Date().toISOString(),
+            });
+        }
+        return DomainKnowledgeSchema.parse(raw);
+    }
+}
+//# sourceMappingURL=knowledge-manager.js.map

package/dist/knowledge-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-manager.js","sourceRoot":"","sources":["../src/knowledge-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,wBAAwB,EACxB,yBAAyB,EACzB,0BAA0B,EAC1B,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,sBAAsB,CAAC;AAY9B,+BAA+B;AAE/B,MAAM,6BAA6B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,SAAS,EAAE,qBAAqB;IAChC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CACjC,CAAC,CAAC;AAEH,MAAM,0BAA0B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE;IACpB,WAAW,EAAE,CAAC;SACX,IAAI,CAAC;QACJ,2BAA2B;QAC3B,mBAAmB;QACnB,2BAA2B;QAC3B,YAAY;QACZ,sBAAsB;KACvB,CAAC;SACD,QAAQ,EAAE;IACb,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACxC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAClC,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;CACpD,CAAC,CAAC;AAEH,MAAM,2BAA2B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE;IAC5B,mEAAmE;IACnE,mBAAmB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;CAClC,CAAC,CAAC;AAEH,MAAM,gCAAgC,GAAG,CAAC,CAAC,MAAM,CAAC;IAChD,iBAAiB,EAAE,CAAC,CAAC,OAAO,EAAE;IAC9B,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IACzD,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;CAChD,CAAC,CAAC;AAEH,2BAA2B;AAE3B,oEAAoE;AACpE,MAAM,cAAc,GAAG,sCAAsC,CAAC;AAE9D;;;;;;;GAOG;AACH,MAAM,OAAO,gBAAgB;IACV,YAAY,CAAe;IAC3B,SAAS,CAAa;IACtB,WAAW,CAAe;IAC1B,eAAe,CAAoB;IAEpD,YACE,YAA0B,EAC1B,SAAqB,EACrB,WAAyB,EACzB,eAAkC;QAElC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED,6BAA6B;IAE7B;;;;;;;;OAQG;IACH,KAAK,CAAC,kBAAkB,CAAC,OAIxB;QACC,wDAAwD;QACxD,IAAI,OAAO,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;YAC7B,OAAO,wBAAwB,CAAC,KAAK,CAAC;gBACpC,WAAW,EAAE,2BAA2B;gBACxC,iBAAiB,EACf,iEAAiE;gBACnE,WAAW,EAAE,iBAAiB;gBAC9B,iBAAiB,EAAE,IAAI;aACxB,CAAC,CAAC;QACL,CAAC;QAED,+FAA+F;QAC/F,gFAAgF;QAChF,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzE,OAAO,wBAAwB,CAAC,KAAK,CAAC;gBACpC,WAAW,EAAE,mBAAmB;gBAChC,iBAAiB,EACf,0EAA0E;gBAC5E,WAAW,EAAE,oBAAoB;gBACjC,iBAAiB,EAAE,IAAI;aACxB,CAAC,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,MAAM,MAAM,GAAG;;gBAEH,OAAO,CAAC,YAAY,CAAC,MAAM,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;cAC3F,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;cACnG,OAAO,CAAC,UAAU;;;;;;;;;EAS9B,CAAC;QAEC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,kHAAkH;YACpH,UAAU,EAAE,GAAG;SAChB,CACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CACrC,QAAQ,CAAC,OAAO,EAChB,0BAA0B,CAC3B,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,wBAAwB,CAAC,KAAK,CAAC;gBACpC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,2BAA2B;gBAC9D,iBAAiB,EACf,MAAM,CAAC,iBAAiB,IAAI,oCAAoC;gBAClE,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,iBAAiB;gBACpD,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,IAAI;aACpD,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,kCAAkC;IAElC;;;;OAIG;IACH,KAAK,CAAC,uBAAuB,CAC3B,MAA0B,EAC1B,MAAc;QAEd,MAAM,MAAM,GAAG;;WAER,MAAM;;UAEP,MAAM,CAAC,WAAW;uBACL,MAAM,CAAC,iBAAiB;iBAC9B,MAAM,CAAC,WAAW;uBACZ,MAAM,CAAC,iBAAiB,IAAI,MAAM;;;;;;;;;;;EAWvD,CAAC;QAEC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,4GAA4G;YAC9G,UAAU,EAAE,IAAI;SACjB,CACF,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CACrC,QAAQ,CAAC,OAAO,EAChB,2BAA2B,CAC5B,CAAC;QAEF,yBAAyB;QACzB,MAAM,SAAS,GAAG,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,mBAAmB,GAAG,OAAO,SAAS,CAAC,MAAM,wDAAwD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAElI,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;YAC5B,EAAE,EAAE,MAAM;YACV,OAAO,EAAE,MAAM;YACf,WAAW,EAAE,IAAI;YACjB,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;gBACzC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;gBAC5B,CAAC,CAAC,EAAE;YACN,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,WAAW;YAC1D,gBAAgB,EAAE,kBAAkB,MAAM,CAAC,gBAAgB,EAAE;YAC7D,SAAS,EAAE,2BAA2B,MAAM,CAAC,WAAW,MAAM,MAAM,CAAC,iBAAiB,EAAE;YACxF,QAAQ,EAAE,6EAA6E,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC7I,gBAAgB,EAAE;gBAChB;oBACE,WAAW,EAAE,mBAAmB;oBAChC,mBAAmB,EACjB,4DAA4D;oBAC9D,WAAW,EAAE,IAAI;iBAClB;aACF;YACD,cAAc,EAAE;gBACd,QAAQ,EAAE,CAAC,wBAAwB,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC;gBAC1F,YAAY,EAAE;oBACZ,sBAAsB;oBACtB,cAAc;oBACd,gBAAgB;oBAChB,GAAG,MAAM,CAAC,YAAY;iBACvB;gBACD,YAAY,EAAE,gCAAgC;aAC/C;YACD,WAAW,EAAE;gBACX,aAAa,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC1F,iCAAiC;gBACjC,yCAAyC;aAC1C;YACD,aAAa,EAAE,YAAY;YAC3B,kBAAkB,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE;YAC/C,aAAa,EAAE,uBAAuB;YACtC,MAAM,EAAE,SAAS;YACjB,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;QAEH,UAAU;QACV,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,MAAM,IAAI,MAAM,OAAO,EAAE,IAAI,CAAC,CAAC;QAEnE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wBAAwB;IAExB;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,MAAc,EAAE,KAAqB;QACvD,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjD,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAE/D,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,eAAe,CAAC,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAExD,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAC/D,IAAI,CAAC,YAAY,CAAC,QAAQ,CACxB,SAAS,MAAM,wBAAwB,EACvC,SAAS,CACV,CAAC;QAEF,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CACxB,MAAM,CAAC,QAAQ,EACf,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,EACrC,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CACvC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,wBAAwB;IAExB;;;;OAIG;IACH,KAAK,CAAC,aAAa,CACjB,MAAc,EACd,IAAe;QAEf,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC;QAExC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAC9C,CAAC;IACJ,CAAC;IAED,6BAA6B;IAE7B;;;OAGG;IACH,KAAK,CAAC,kBAAkB,CACtB,MAAc,EACd,QAAwB;QAExB,8DAA8D;QAC9D,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,gBAAgB,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CACrD,CAAC,QAAQ,EAAE,EAAE,CACX,QAAQ,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;YACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxD,QAAQ,CAAC,aAAa,KAAK,IAAI,CAClC,CAAC;QAEF,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,yBAAyB,CAAC,KAAK,CAAC;gBACrC,iBAAiB,EAAE,KAAK;gBACxB,oBAAoB,EAAE,IAAI;gBAC1B,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,MAAM,eAAe,GAAG,gBAAgB;aACrC,GAAG,CACF,CAAC,CAAC,EAAE,EAAE,CACJ,SAAS,CAAC,CAAC,QAAQ,kBAAkB,CAAC,CAAC,QAAQ,eAAe,CAAC,CAAC,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACzG;aACA,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,MAAM,GAAG;;;cAGL,QAAQ,CAAC,QAAQ;YACnB,QAAQ,CAAC,MAAM;UACjB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;;;EAGhC,eAAe;;;;;;;EAOf,CAAC;QAEC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,2HAA2H;YAC7H,UAAU,EAAE,GAAG;SAChB,CACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CACrC,QAAQ,CAAC,OAAO,EAChB,gCAAgC,CACjC,CAAC;YACF,OAAO,yBAAyB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACjD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,yBAAyB,CAAC,KAAK,CAAC;gBACrC,iBAAiB,EAAE,KAAK;gBACxB,oBAAoB,EAAE,IAAI;gBAC1B,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,+BAA+B;IAE/B;;OAEG;IACH,KAAK,CAAC,oBAAoB,CACxB,MAAc,EACd,aAAqB;QAErB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,oCAAoC;IAEpC;;;OAGG;IACH,KAAK,CAAC,eAAe,CACnB,KAAa,EACb,OAAe,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAqB,EAAE,CAAC;QAErC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,uDAAuD;YACvD,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAuB,CAAC;YAChE,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YAC/D,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,EAAE,CAChC,CAAC;YACF,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,sCAAsC;IAEtC;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAa,EACb,OAAe,CAAC;QAEhB,wEAAwE;QACxE,sEAAsE;QACtE,0CAA0C;QAC1C,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,sCAAsC;IAEtC;;;;OAIG;IACH,KAAK,CAAC,yBAAyB,CAC7B,KAAqB,EACrB,MAAc;QAEd,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,mDAAmD;QACnD,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC;YAC9C,GAAG,KAAK;YACR,eAAe,EAAE,CAAC,MAAM,CAAC;YACzB,gBAAgB,EAAE,UAA6B;YAC/C,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,UAAU,CAAC;YAClE,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QAEH,2CAA2C;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACtC,MAAM,WAAW,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC;QAExE,IAAI,MAA4B,CAAC;QACjC,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,GAAG,CAAC,WAAW,CAAE,CAAC;YACnC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAC9B,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC,CAC/C,CAAC;YACF,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC;gBACxC,GAAG,QAAQ;gBACX,eAAe,EAAE,aAAa;aAC/B,CAAC,CAAC;YACH,GAAG,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,CAAC;YAChB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACzE,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE;gBACnE,OAAO,EAAE,MAAM;gBACf,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,IAAI;aACb,CAAC,CAAC;YACH,gEAAgE;YAChE,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC;gBACxC,GAAG,MAAM;gBACT,YAAY,EAAE,WAAW,CAAC,EAAE;aAC7B,CAAC,CAAC;YACH,sFAAsF;YACtF,MAAM,SAAS,GAAG,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;YAClE,GAAG,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAChD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAClB,IAAc,EACd,MAAe;QAEf,MAAM,GAAG,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAEtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,MAAM,SAAS,GACb,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,MAAM,SAAS,GACb,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACjE,OAAO,SAAS,IAAI,SAAS,CAAC;QAChC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,oDAAoD;IAEpD;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAa,EACb,OAAe,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACtC,MAAM,MAAM,GAA0D,EAAE,CAAC;QAEzE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;YACxD,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,mDAAmD;IAEnD;;;OAGG;IACH,KAAK,CAAC,uBAAuB,CAC3B,MAAc,EACd,OAAyB;QAEzB,MAAM,aAAa,GAAG,OAAO;aAC1B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC;aAC9C,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,MAAM,GAAG;;UAET,MAAM;;EAEd,aAAa,IAAI,kBAAkB;;;;;;;;sFAQiD,CAAC;QAEnF,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;YACE,MAAM,EACJ,kEAAkE;YACpE,UAAU,EAAE,GAAG;SAChB,CACF,CAAC;QAEF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CACrC,QAAQ,CAAC,OAAO,EAChB,6BAA6B,CAC9B,CAAC;YACF,OAAO,MAAM,CAAC,SAAS,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YAC1B,IAAI,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;gBAC/B,4EAA4E;gBAC5E,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC/C,MAAM,YAAY,GAChB,qBAAqB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBAChD,MAAM,KAAK,GAAG,IAAI,IAAI,CACpB,UAAU,CAAC,OAAO,EAAE,GAAG,YAAY,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAC1D,CAAC;gBACF,OAAO,GAAG,GAAG,KAAK,CAAC;YACrB,CAAC;YACD,OAAO,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,yBAAyB,CAAC,YAAoC;QAClE,MAAM,KAAK,GAAW,EAAE,CAAC;QAEzB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC;YACpD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YAErC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;gBAC5B,EAAE,EAAE,MAAM;gBACV,OAAO,EAAE,MAAM;gBACf,WAAW,EAAE,IAAI;gBACjB,iBAAiB,EAAE,KAAK,CAAC,IAAI;gBAC7B,iBAAiB,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,WAAW;gBAC/C,gBAAgB,EAAE,yBAAyB,KAAK,CAAC,QAAQ,EAAE;gBAC3D,SAAS,EAAE,SAAS,KAAK,CAAC,QAAQ,gCAAgC,KAAK,CAAC,gBAAgB,UAAU,KAAK,CAAC,mBAAmB,IAAI,SAAS,GAAG;gBAC3I,QAAQ,EAAE,kFAAkF,KAAK,CAAC,QAAQ,wBAAwB,KAAK,CAAC,MAAM,EAAE;gBAChJ,gBAAgB,EAAE;oBAChB;wBACE,WAAW,EAAE,iCAAiC,KAAK,CAAC,QAAQ,GAAG;wBAC/D,mBAAmB,EAAE,0DAA0D;wBAC/E,WAAW,EAAE,IAAI;qBAClB;iBACF;gBACD,cAAc,EAAE;oBACd,QAAQ,EAAE,CAAC,wBAAwB,EAAE,YAAY,EAAE,kBAAkB,CAAC;oBACtE,YAAY,EAAE,CAAC,sBAAsB,EAAE,cAAc,EAAE,gBAAgB,CAAC;oBACxE,YAAY,EAAE,oCAAoC;iBACnD;gBACD,WAAW,EAAE;oBACX,iCAAiC;oBACjC,sBAAsB,KAAK,CAAC,QAAQ,EAAE;iBACvC;gBACD,aAAa,EAAE,YAAY;gBAC3B,kBAAkB,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE;gBAC/C,aAAa,EAAE,uBAAuB;gBACtC,MAAM,EAAE,SAAS;gBACjB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;YAEH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0BAA0B;IAE1B,+DAA+D;IACvD,kBAAkB;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC;YACH,OAAQ,GAAiB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACrC,0BAA0B,CAAC,KAAK,CAAC,IAAI,CAAC,CACvC,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,wEAAwE;IAChE,uBAAuB,CAAC,IAAU,EAAE,SAA0B;QACpE,MAAM,IAAI,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;QAClE,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;IAC3B,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,MAAc;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CACnC,SAAS,MAAM,wBAAwB,CACxC,CAAC;QAEF,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,OAAO,qBAAqB,CAAC,KAAK,CAAC;gBACjC,OAAO,EAAE,MAAM;gBACf,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE,EAAE;gBACX,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACvC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,qBAAqB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;CACF"}

package/dist/knowledge-transfer.d.ts

@@ -0,0 +1,101 @@
+import type { ILLMClient } from "./llm/llm-client.js";
+import type { KnowledgeManager } from "./knowledge-manager.js";
+import type { VectorIndex } from "./vector-index.js";
+import type { LearningPipeline } from "./learning-pipeline.js";
+import type { EthicsGate } from "./traits/ethics-gate.js";
+import type { StateManager } from "./state-manager.js";
+import type { TransferCandidate, TransferResult, TransferEffectivenessRecord } from "./types/cross-portfolio.js";
+import type { CrossGoalPattern, StructuralFeedbackType } from "./types/learning.js";
+/**
+ * KnowledgeTransfer implements cross-goal knowledge and strategy transfer.
+ *
+ * Phase 1 (MVP): Transfer is always suggestion-only.
+ * applyTransfer() exists but should only be called after explicit user approval.
+ *
+ * Stored in-memory (Map/array). No file persistence for MVP.
+ */
+export declare class KnowledgeTransfer {
+    private readonly deps;
+    /** In-memory candidate store: candidate_id → TransferCandidate */
+    private readonly candidates;
+    /** In-memory result store: transfer_id → TransferResult */
+    private readonly results;
+    /** Context stored at apply time: transfer_id → TransferContext */
+    private readonly applyContexts;
+    /** Effectiveness records: transfer_id → TransferEffectivenessRecord */
+    private readonly effectivenessRecords;
+    /** Per-pattern consecutive non-positive outcome tracker */
+    private readonly patternTrackers;
+    /** Cross-goal pattern store: pattern id → CrossGoalPattern */
+    private readonly crossGoalPatterns;
+    constructor(deps: {
+        llmClient: ILLMClient;
+        knowledgeManager: KnowledgeManager;
+        vectorIndex: VectorIndex | null;
+        learningPipeline: LearningPipeline;
+        ethicsGate: EthicsGate;
+        stateManager: StateManager;
+    });
+    /**
+     * Detect transfer opportunities for the given target goal.
+     *
+     * Steps:
+     * 1. Cross-goal knowledge search via KnowledgeManager
+     * 2. Load all learned patterns across goals
+     * 3. Filter patterns whose source_goal_ids doesn't include the target
+     * 4. Score each pattern: similarity × source_confidence × effectiveness
+     * 5. Filter: similarity >= 0.7, confidence >= 0.6
+     * 6. Build TransferCandidate for each qualifying pattern
+     * 7. Store and return ranked candidates
+     */
+    detectTransferOpportunities(goalId: string): Promise<TransferCandidate[]>;
+    /**
+     * Apply a transfer candidate to the target goal.
+     *
+     * Phase 1: Should only be called after explicit user approval.
+     *
+     * Steps:
+     * 1. Look up candidate
+     * 2. Ethics gate check
+     * 3. LLM adaptation of source pattern to target context
+     * 4. Record and return TransferResult
+     */
+    applyTransfer(candidateId: string, targetGoalId: string): Promise<TransferResult>;
+    /**
+     * Evaluate the effectiveness of a previously applied transfer.
+     *
+     * Compares gap before and after application.
+     * If 3 consecutive neutral/negative for the same source pattern,
+     * marks that pattern as ineffective for transfer.
+     */
+    evaluateTransferEffect(transferId: string): TransferEffectivenessRecord;
+    /**
+     * Aggregate all LearnedPatterns across all goals and extract
+     * cross-domain meta-patterns via LLM.
+     *
+     * Stores meta-patterns internally.
+     */
+    buildCrossGoalKnowledgeBase(): Promise<void>;
+    /** Return all detected transfer candidates */
+    getTransferCandidates(): TransferCandidate[];
+    /** Return all transfer results */
+    getTransferResults(): TransferResult[];
+    /**
+     * Store a CrossGoalPattern for later retrieval.
+     * Uses KnowledgeGraph if available, otherwise stores in-memory.
+     */
+    storePattern(pattern: CrossGoalPattern): void;
+    /**
+     * Retrieve stored CrossGoalPatterns, optionally filtered by feedbackType or patternType.
+     */
+    retrievePatterns(filter?: {
+        feedbackType?: StructuralFeedbackType;
+        patternType?: CrossGoalPattern["patternType"];
+    }): CrossGoalPattern[];
+    /**
+     * Estimate the current gap for a goal.
+     * Returns 0.5 as a neutral default if goal state is unavailable.
+     */
+    private _estimateCurrentGap;
+}
+//# sourceMappingURL=knowledge-transfer.d.ts.map