conatus 0.1.0

package/dist/knowledge/knowledge-manager.js

@@ -0,0 +1,497 @@
+import { randomUUID } from "node:crypto";
+import { z } from "zod";
+import { TaskSchema } from "../types/task.js";
+import { KnowledgeEntrySchema, DomainKnowledgeSchema, KnowledgeGapSignalSchema, ContradictionResultSchema, SharedKnowledgeEntrySchema, } from "../types/knowledge.js";
+import { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowledge, loadSharedEntries, loadDomainKnowledge, } from "./knowledge-search.js";
+import { classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue, } from "./knowledge-revalidation.js";
+import { recordDecision, enrichDecisionRecord, queryDecisions, updateDecisionOutcome, purgeOldDecisions, } from "./knowledge-decisions.js";
+// Re-export for backward compatibility
+export { searchKnowledge, searchAcrossGoals, searchByEmbedding, querySharedKnowledge, classifyDomainStability, getStaleEntries, generateRevalidationTasks, computeRevalidationDue, };
+// ─── LLM response schemas ───
+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;
+    gateway;
+    constructor(stateManager, llmClient, vectorIndex, embeddingClient, gateway) {
+        this.stateManager = stateManager;
+        this.llmClient = llmClient;
+        this.vectorIndex = vectorIndex;
+        this.embeddingClient = embeddingClient;
+        this.gateway = gateway;
+    }
+    // ─── 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
+}`;
+        let parsed;
+        if (this.gateway) {
+            try {
+                parsed = await this.gateway.execute({
+                    purpose: "knowledge_gap_detection",
+                    additionalContext: { gap_detection_prompt: prompt },
+                    responseSchema: GapDetectionResponseSchema,
+                    maxTokens: 512,
+                });
+            }
+            catch {
+                return null;
+            }
+        }
+        else {
+            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 {
+                parsed = this.llmClient.parseJSON(response.content, GapDetectionResponseSchema);
+            }
+            catch {
+                return null;
+            }
+        }
+        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,
+        });
+    }
+    // ─── 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"]
+}`;
+        let fields;
+        if (this.gateway) {
+            fields = await this.gateway.execute({
+                purpose: "knowledge_acquisition",
+                goalId,
+                additionalContext: { acquisition_prompt: prompt },
+                responseSchema: AcquisitionTaskFieldsSchema,
+                maxTokens: 1024,
+            });
+        }
+        else {
+            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,
+            });
+            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
+        await 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);
+        await 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
+}`;
+        if (this.gateway) {
+            try {
+                const parsed = await this.gateway.execute({
+                    purpose: "knowledge_contradiction",
+                    goalId,
+                    additionalContext: { contradiction_prompt: prompt },
+                    responseSchema: ContradictionCheckResponseSchema,
+                    maxTokens: 512,
+                });
+                return ContradictionResultSchema.parse(parsed);
+            }
+            catch {
+                return ContradictionResultSchema.parse({
+                    has_contradiction: false,
+                    conflicting_entry_id: null,
+                    resolution: null,
+                });
+            }
+        }
+        else {
+            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) {
+        return searchKnowledge({ stateManager: this.stateManager, vectorIndex: this.vectorIndex }, query, topK);
+    }
+    // ─── 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) {
+        return searchAcrossGoals({ stateManager: this.stateManager, vectorIndex: this.vectorIndex }, 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: computeRevalidationDue(now, "moderate"),
+            embedding_id: null,
+        });
+        // Load existing entries and merge / append
+        const all = await loadSharedEntries(this.stateManager);
+        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;
+        }
+        await 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.
+     */
+    async querySharedKnowledge(tags, goalId) {
+        return querySharedKnowledge(this.stateManager, tags, goalId);
+    }
+    // ─── 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) {
+        return searchByEmbedding({ stateManager: this.stateManager, vectorIndex: this.vectorIndex }, query, topK);
+    }
+    // ─── 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) {
+        return classifyDomainStability({ stateManager: this.stateManager, llmClient: this.llmClient }, domain, entries);
+    }
+    /**
+     * Return shared knowledge entries whose revalidation_due_at is in the past.
+     */
+    async getStaleEntries() {
+        return getStaleEntries(this.stateManager);
+    }
+    /**
+     * Generate KnowledgeAcquisitionTask-style Task objects for each stale entry,
+     * re-asking the original question.
+     */
+    async generateRevalidationTasks(staleEntries) {
+        return generateRevalidationTasks(staleEntries);
+    }
+    // ─── Decision History (M14-S3) ───
+    /**
+     * Save a DecisionRecord to ~/.motiva/decisions/<goalId>-<timestamp>.json
+     * For completed records (outcome !== "pending"), enriches with LLM-extracted
+     * what_worked/what_failed/suggested_next before saving.
+     */
+    async recordDecision(record) {
+        return recordDecision({ stateManager: this.stateManager, llmClient: this.llmClient }, record);
+    }
+    /**
+     * Enrich a completed DecisionRecord by extracting what_worked/what_failed/suggested_next via LLM.
+     * Falls back to default empty arrays on LLM failure.
+     */
+    async enrichDecisionRecord(record) {
+        return enrichDecisionRecord({ stateManager: this.stateManager, llmClient: this.llmClient }, record);
+    }
+    /**
+     * Load decision records filtered by goal_type, sorted by recency.
+     * Applies time-decay scoring (1.0 at day 0, 0.0 at day 30+).
+     */
+    async queryDecisions(goalType, limit = 20) {
+        return queryDecisions({ stateManager: this.stateManager, llmClient: this.llmClient }, goalType, limit);
+    }
+    /**
+     * Update the outcome of a DecisionRecord identified by strategy_id.
+     * Finds the most recent pending record for the given strategy and rewrites it.
+     * No-op when no matching pending record is found.
+     */
+    async updateDecisionOutcome(strategyId, outcome) {
+        return updateDecisionOutcome({ stateManager: this.stateManager, llmClient: this.llmClient }, strategyId, outcome);
+    }
+    /**
+     * Remove decision records older than 90 days.
+     * Returns the count of purged records.
+     */
+    async purgeOldDecisions() {
+        return purgeOldDecisions({
+            stateManager: this.stateManager,
+            llmClient: this.llmClient,
+        });
+    }
+    // ─── Private Helpers ───
+    async _loadDomainKnowledge(goalId) {
+        return loadDomainKnowledge(this.stateManager, goalId);
+    }
+}
+//# sourceMappingURL=knowledge-manager.js.map

package/dist/knowledge/knowledge-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-manager.js","sourceRoot":"","sources":["../../src/knowledge/knowledge-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,wBAAwB,EACxB,yBAAyB,EACzB,0BAA0B,GAE3B,MAAM,uBAAuB,CAAC;AAY/B,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,EACjB,mBAAmB,GACpB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,GACvB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,cAAc,EACd,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,0BAA0B,CAAC;AAElC,uCAAuC;AACvC,OAAO,EACL,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,uBAAuB,EACvB,eAAe,EACf,yBAAyB,EACzB,sBAAsB,GACvB,CAAC;AAEF,+BAA+B;AAE/B,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;IACnC,OAAO,CAAkB;IAE1C,YACE,YAA0B,EAC1B,SAAqB,EACrB,WAAyB,EACzB,eAAkC,EAClC,OAAwB;QAExB,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;QACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,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,IAAI,MAAkD,CAAC;QACvD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;oBAClC,OAAO,EAAE,yBAAyB;oBAClC,iBAAiB,EAAE,EAAE,oBAAoB,EAAE,MAAM,EAAE;oBACnD,cAAc,EAAE,0BAA0B;oBAC1C,SAAS,EAAE,GAAG;iBACf,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;gBACE,MAAM,EACJ,kHAAkH;gBACpH,UAAU,EAAE,GAAG;aAChB,CACF,CAAC;YAEF,IAAI,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAC/B,QAAQ,CAAC,OAAO,EAChB,0BAA0B,CAC3B,CAAC;YACJ,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,wBAAwB,CAAC,KAAK,CAAC;YACpC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,2BAA2B;YAC9D,iBAAiB,EACf,MAAM,CAAC,iBAAiB,IAAI,oCAAoC;YAClE,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,iBAAiB;YACpD,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,IAAI;SACpD,CAAC,CAAC;IACL,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,IAAI,MAAmD,CAAC;QACxD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;gBAClC,OAAO,EAAE,uBAAuB;gBAChC,MAAM;gBACN,iBAAiB,EAAE,EAAE,kBAAkB,EAAE,MAAM,EAAE;gBACjD,cAAc,EAAE,2BAA2B;gBAC3C,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;gBACE,MAAM,EACJ,4GAA4G;gBAC9G,UAAU,EAAE,IAAI;aACjB,CACF,CAAC;YAEF,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAC/B,QAAQ,CAAC,OAAO,EAChB,2BAA2B,CAC5B,CAAC;QACJ,CAAC;QAED,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,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,MAAM,IAAI,MAAM,OAAO,EAAE,IAAI,CAAC,CAAC;QAEzE,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,oBAAoB,CAAC,MAAM,CAAC,CAAC;QAEhE,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,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAC9B,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,oBAAoB,CAAC,MAAM,CAAC,CAAC;QAChE,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,oBAAoB,CAAC,MAAM,CAAC,CAAC;QAChE,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,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;oBACxC,OAAO,EAAE,yBAAyB;oBAClC,MAAM;oBACN,iBAAiB,EAAE,EAAE,oBAAoB,EAAE,MAAM,EAAE;oBACnD,cAAc,EAAE,gCAAgC;oBAChD,SAAS,EAAE,GAAG;iBACf,CAAC,CAAC;gBACH,OAAO,yBAAyB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,yBAAyB,CAAC,KAAK,CAAC;oBACrC,iBAAiB,EAAE,KAAK;oBACxB,oBAAoB,EAAE,IAAI;oBAC1B,UAAU,EAAE,IAAI;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAC/C,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EACnC;gBACE,MAAM,EACJ,2HAA2H;gBAC7H,UAAU,EAAE,GAAG;aAChB,CACF,CAAC;YAEF,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CACrC,QAAQ,CAAC,OAAO,EAChB,gCAAgC,CACjC,CAAC;gBACF,OAAO,yBAAyB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,yBAAyB,CAAC,KAAK,CAAC;oBACrC,iBAAiB,EAAE,KAAK;oBACxB,oBAAoB,EAAE,IAAI;oBAC1B,UAAU,EAAE,IAAI;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,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,OAAO,eAAe,CACpB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,EAClE,KAAK,EACL,IAAI,CACL,CAAC;IACJ,CAAC;IAED,sCAAsC;IAEtC;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAa,EACb,OAAe,CAAC;QAEhB,OAAO,iBAAiB,CACtB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,EAClE,KAAK,EACL,IAAI,CACL,CAAC;IACJ,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,sBAAsB,CAAC,GAAG,EAAE,UAAU,CAAC;YAC5D,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QAEH,2CAA2C;QAC3C,MAAM,GAAG,GAAG,MAAM,iBAAiB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACvD,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,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACtD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,oBAAoB,CACxB,IAAc,EACd,MAAe;QAEf,OAAO,oBAAoB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IAC/D,CAAC;IAED,oDAAoD;IAEpD;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAa,EACb,OAAe,CAAC;QAEhB,OAAO,iBAAiB,CACtB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,EAClE,KAAK,EACL,IAAI,CACL,CAAC;IACJ,CAAC;IAED,mDAAmD;IAEnD;;;OAGG;IACH,KAAK,CAAC,uBAAuB,CAC3B,MAAc,EACd,OAAyB;QAEzB,OAAO,uBAAuB,CAC5B,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAC9D,MAAM,EACN,OAAO,CACR,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe;QACnB,OAAO,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,yBAAyB,CAAC,YAAoC;QAClE,OAAO,yBAAyB,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC;IAED,oCAAoC;IAEpC;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAAC,MAAsB;QACzC,OAAO,cAAc,CACnB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAC9D,MAAM,CACP,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,oBAAoB,CAAC,MAAsB;QAC/C,OAAO,oBAAoB,CACzB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAC9D,MAAM,CACP,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc,CAAC,QAAgB,EAAE,QAAgB,EAAE;QACvD,OAAO,cAAc,CACnB,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAC9D,QAAQ,EACR,KAAK,CACN,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,qBAAqB,CACzB,UAAkB,EAClB,OAA8B;QAE9B,OAAO,qBAAqB,CAC1B,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAC9D,UAAU,EACV,OAAO,CACR,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB;QACrB,OAAO,iBAAiB,CAAC;YACvB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,0BAA0B;IAElB,KAAK,CAAC,oBAAoB,CAAC,MAAc;QAC/C,OAAO,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;CACF"}

package/dist/knowledge/knowledge-revalidation.d.ts

@@ -0,0 +1,27 @@
+import type { Task } from "../types/task.js";
+import type { KnowledgeEntry, SharedKnowledgeEntry, DomainStability } from "../types/knowledge.js";
+import type { ILLMClient } from "../llm/llm-client.js";
+import type { IPromptGateway } from "../prompt/gateway.js";
+import type { StateManager } from "../state-manager.js";
+export interface RevalidationDeps {
+    stateManager: StateManager;
+    llmClient: ILLMClient;
+    gateway?: IPromptGateway;
+}
+/**
+ * Classify the domain stability of a set of knowledge entries via LLM.
+ * Returns "stable", "moderate", or "volatile".
+ */
+export declare function classifyDomainStability(deps: RevalidationDeps, domain: string, entries: KnowledgeEntry[]): Promise<DomainStability>;
+/**
+ * Return shared knowledge entries whose revalidation_due_at is in the past.
+ */
+export declare function getStaleEntries(stateManager: StateManager): Promise<SharedKnowledgeEntry[]>;
+/**
+ * Generate KnowledgeAcquisitionTask-style Task objects for each stale entry,
+ * re-asking the original question.
+ */
+export declare function generateRevalidationTasks(staleEntries: SharedKnowledgeEntry[]): Promise<Task[]>;
+/** Compute revalidation due date based on stability and a base date. */
+export declare function computeRevalidationDue(base: Date, stability: DomainStability): string;
+//# sourceMappingURL=knowledge-revalidation.d.ts.map

package/dist/knowledge/knowledge-revalidation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-revalidation.d.ts","sourceRoot":"","sources":["../../src/knowledge/knowledge-revalidation.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAK7C,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAWxD,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,YAAY,CAAC;IAC3B,SAAS,EAAE,UAAU,CAAC;IACtB,OAAO,CAAC,EAAE,cAAc,CAAC;CAC1B;AAID;;;GAGG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,gBAAgB,EACtB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,cAAc,EAAE,GACxB,OAAO,CAAC,eAAe,CAAC,CAoD1B;AAED;;GAEG;AACH,wBAAsB,eAAe,CAAC,YAAY,EAAE,YAAY,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAgBjG;AAED;;;GAGG;AACH,wBAAsB,yBAAyB,CAC7C,YAAY,EAAE,oBAAoB,EAAE,GACnC,OAAO,CAAC,IAAI,EAAE,CAAC,CA4CjB;AAED,wEAAwE;AACxE,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,GAAG,MAAM,CAIrF"}