pulseed 0.4.16 → 0.4.18

package/dist/platform/knowledge/knowledge-manager-lint.js

@@ -1,137 +0,0 @@
-import { LintResponseSchema, } from "./types/agent-memory.js";
-const LINT_SYSTEM_PROMPT = `You are a memory quality auditor. Analyze the provided compiled memory entries and identify:
-1. CONTRADICTIONS: entries that conflict with each other (e.g., different values for the same preference/fact)
-2. STALENESS: entries that appear outdated based on timestamps or content suggesting superseded information
-3. REDUNDANCY: entries with significantly overlapping content that should be merged
-
-Return a JSON object with a "findings" array. Each finding has:
-- type: "contradiction" | "staleness" | "redundancy"
-- entry_ids: array of entry IDs involved
-- description: brief explanation of the issue
-- confidence: 0-1 confidence score
-- suggested_action: "flag_review" | "auto_resolve_newest" | "mark_stale" | "merge"
-
-If no issues found, return {"findings": []}.
-Return ONLY valid JSON, no markdown fences.`;
-function buildUserPrompt(entries) {
-    const formatted = entries.map((e) => ({
-        id: e.id,
-        key: e.key,
-        value: e.value,
-        summary: e.summary,
-        tags: e.tags,
-        category: e.category,
-        memory_type: e.memory_type,
-        updated_at: e.updated_at,
-    }));
-    return `Analyze these ${entries.length} compiled memory entries for contradictions, staleness, and redundancy:\n\n${JSON.stringify(formatted, null, 2)}`;
-}
-function actionMatchesAutoRepair(finding) {
-    switch (finding.type) {
-        case "contradiction":
-            return finding.suggested_action === "auto_resolve_newest";
-        case "staleness":
-            return finding.suggested_action === "mark_stale";
-        case "redundancy":
-            return finding.suggested_action === "merge";
-    }
-}
-export async function lintAgentMemory(opts) {
-    const { km, llmCall, autoRepair = false, minAutoRepairConfidence = 0, categories } = opts;
-    // 1. Load compiled entries (listAgentMemory has no status filter — filter manually)
-    const allEntries = await km.listAgentMemory({ limit: 10000, include_archived: false });
-    let entries = allEntries.filter((e) => e.status === "compiled");
-    if (categories && categories.length > 0) {
-        entries = entries.filter((e) => e.category && categories.includes(e.category));
-    }
-    if (entries.length < 2) {
-        return { findings: [], repairs_applied: 0, entries_flagged: 0 };
-    }
-    // NOTE: Chunking processes entries independently per window. Contradictions/redundancies
-    // across chunk boundaries will not be detected. For most use cases compiled entries
-    // are well under 30, so this limit rarely applies.
-    // 2. Chunk if needed (max 30 per call)
-    const CHUNK_SIZE = 30;
-    const allFindings = [];
-    for (let i = 0; i < entries.length; i += CHUNK_SIZE) {
-        const chunk = entries.slice(i, i + CHUNK_SIZE);
-        const userPrompt = buildUserPrompt(chunk);
-        const raw = await llmCall(LINT_SYSTEM_PROMPT + "\n\n" + userPrompt);
-        // Sanitize: strip markdown fences
-        const cleaned = raw
-            .replace(/```(?:json)?\s*/g, "")
-            .replace(/```\s*/g, "")
-            .trim();
-        try {
-            const parsed = LintResponseSchema.parse(JSON.parse(cleaned));
-            allFindings.push(...parsed.findings);
-        }
-        catch (err) {
-            // Log but don't fail — partial results are acceptable
-            console.warn("Failed to parse lint LLM response:", err);
-        }
-    }
-    // 3. Apply repairs if autoRepair is enabled
-    let repairsApplied = 0;
-    const flaggedIds = new Set();
-    const entriesById = new Map(entries.map((entry) => [entry.id, entry]));
-    for (const finding of allFindings) {
-        if (!autoRepair || finding.confidence < minAutoRepairConfidence || !actionMatchesAutoRepair(finding)) {
-            for (const id of finding.entry_ids) {
-                flaggedIds.add(id);
-            }
-            continue;
-        }
-        switch (finding.type) {
-            case "contradiction": {
-                // Keep the most recently updated entry, archive others
-                const involved = Array.from(new Set(finding.entry_ids), (id) => entriesById.get(id)).filter((entry) => Boolean(entry));
-                if (involved.length < 2)
-                    break;
-                involved.sort((a, b) => new Date(b.updated_at).getTime() - new Date(a.updated_at).getTime());
-                const toArchive = involved.slice(1);
-                const archiveIds = toArchive.map((e) => e.id);
-                const archived = await km.archiveAgentMemory(archiveIds);
-                repairsApplied += archived;
-                break;
-            }
-            case "staleness": {
-                // Mark stale entries as raw so they re-enter consolidation pipeline:
-                // delete existing entry + re-save with "needs-reverification" tag (new entries default to "raw")
-                for (const id of finding.entry_ids) {
-                    const entry = entriesById.get(id);
-                    if (entry) {
-                        await km.deleteAgentMemory(entry.key);
-                        await km.saveAgentMemory({
-                            key: entry.key,
-                            value: entry.value,
-                            tags: [...entry.tags, "needs-reverification"],
-                            category: entry.category,
-                            memory_type: entry.memory_type,
-                        });
-                        repairsApplied++;
-                    }
-                }
-                break;
-            }
-            case "redundancy": {
-                // Keep the first (richest by value length), archive others
-                const involved = Array.from(new Set(finding.entry_ids), (id) => entriesById.get(id)).filter((entry) => Boolean(entry));
-                if (involved.length < 2)
-                    break;
-                involved.sort((a, b) => b.value.length - a.value.length);
-                const toArchive = involved.slice(1);
-                const archiveIds = toArchive.map((e) => e.id);
-                const archived = await km.archiveAgentMemory(archiveIds);
-                repairsApplied += archived;
-                break;
-            }
-        }
-    }
-    return {
-        findings: allFindings,
-        repairs_applied: repairsApplied,
-        entries_flagged: flaggedIds.size,
-    };
-}
-//# sourceMappingURL=knowledge-manager-lint.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-manager-lint.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-lint.ts"],"names":[],"mappings":"AAEA,OAAO,EAEL,kBAAkB,GAGnB,MAAM,yBAAyB,CAAC;AAEjC,MAAM,kBAAkB,GAAG;;;;;;;;;;;;;4CAaiB,CAAC;AAE7C,SAAS,eAAe,CAAC,OAA2B;IAClD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpC,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,UAAU,EAAE,CAAC,CAAC,UAAU;KACzB,CAAC,CAAC,CAAC;IACJ,OAAO,iBAAiB,OAAO,CAAC,MAAM,8EAA8E,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;AAC3J,CAAC;AAED,SAAS,uBAAuB,CAAC,OAA0C;IACzE,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,eAAe;YAClB,OAAO,OAAO,CAAC,gBAAgB,KAAK,qBAAqB,CAAC;QAC5D,KAAK,WAAW;YACd,OAAO,OAAO,CAAC,gBAAgB,KAAK,YAAY,CAAC;QACnD,KAAK,YAAY;YACf,OAAO,OAAO,CAAC,gBAAgB,KAAK,OAAO,CAAC;IAChD,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAMrC;IACC,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,GAAG,KAAK,EAAE,uBAAuB,GAAG,CAAC,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;IAE1F,oFAAoF;IACpF,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,eAAe,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;IACvF,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;IAEhE,IAAI,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IAClE,CAAC;IAED,yFAAyF;IACzF,oFAAoF;IACpF,mDAAmD;IACnD,uCAAuC;IACvC,MAAM,UAAU,GAAG,EAAE,CAAC;IACtB,MAAM,WAAW,GAAwC,EAAE,CAAC;IAE5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,kBAAkB,GAAG,MAAM,GAAG,UAAU,CAAC,CAAC;QAEpE,kCAAkC;QAClC,MAAM,OAAO,GAAG,GAAG;aAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;aAC/B,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,IAAI,EAAE,CAAC;QAEV,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7D,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,sDAAsD;YACtD,OAAO,CAAC,IAAI,CAAC,oCAAoC,EAAE,GAAG,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAU,CAAC,CAAC,CAAC;IAEhF,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,GAAG,uBAAuB,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrG,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACnC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;YACD,SAAS;QACX,CAAC;QAED,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACrB,KAAK,eAAe,CAAC,CAAC,CAAC;gBACrB,uDAAuD;gBACvD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CACzB,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,EAC1B,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5B,CAAC,MAAM,CAAC,CAAC,KAAK,EAA6B,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC/D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM;gBAC/B,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CACtE,CAAC;gBACF,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBACzD,cAAc,IAAI,QAAQ,CAAC;gBAC3B,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,CAAC,CAAC;gBACjB,qEAAqE;gBACrE,iGAAiG;gBACjG,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAClC,IAAI,KAAK,EAAE,CAAC;wBACV,MAAM,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;wBACtC,MAAM,EAAE,CAAC,eAAe,CAAC;4BACvB,GAAG,EAAE,KAAK,CAAC,GAAG;4BACd,KAAK,EAAE,KAAK,CAAC,KAAK;4BAClB,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,sBAAsB,CAAC;4BAC7C,QAAQ,EAAE,KAAK,CAAC,QAAQ;4BACxB,WAAW,EAAE,KAAK,CAAC,WAAW;yBAC/B,CAAC,CAAC;wBACH,cAAc,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;gBACD,MAAM;YACR,CAAC;YACD,KAAK,YAAY,CAAC,CAAC,CAAC;gBAClB,2DAA2D;gBAC3D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CACzB,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,EAC1B,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5B,CAAC,MAAM,CAAC,CAAC,KAAK,EAA6B,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC/D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM;gBAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACzD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBACzD,cAAc,IAAI,QAAQ,CAAC;gBAC3B,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,WAAW;QACrB,eAAe,EAAE,cAAc;QAC/B,eAAe,EAAE,UAAU,CAAC,IAAI;KACjC,CAAC;AACJ,CAAC"}

package/dist/platform/knowledge/knowledge-manager-query.d.ts

@@ -1,87 +0,0 @@
-import { z } from "zod";
-import { StateManager } from "../../base/state/state-manager.js";
-import type { ILLMClient } from "../../base/llm/llm-client.js";
-import type { IPromptGateway } from "../../prompt/gateway.js";
-import type { Logger } from "../../runtime/logger.js";
-import type { Task } from "../../base/types/task.js";
-import type { KnowledgeEntry, KnowledgeGapSignal, ContradictionResult } from "../../base/types/knowledge.js";
-export interface KnowledgeQueryDeps {
-    llmClient: ILLMClient;
-    gateway?: IPromptGateway;
-    stateManager: StateManager;
-    logger?: Logger;
-}
-export declare const GapDetectionResponseSchema: z.ZodObject<{
-    has_gap: z.ZodBoolean;
-    signal_type: z.ZodOptional<z.ZodEnum<["interpretation_difficulty", "strategy_deadlock", "stall_information_deficit", "new_domain", "prerequisite_missing"]>>;
-    missing_knowledge: z.ZodOptional<z.ZodString>;
-    source_step: z.ZodOptional<z.ZodString>;
-    related_dimension: z.ZodOptional<z.ZodNullable<z.ZodString>>;
-}, "strip", z.ZodTypeAny, {
-    has_gap: boolean;
-    signal_type?: "interpretation_difficulty" | "strategy_deadlock" | "stall_information_deficit" | "new_domain" | "prerequisite_missing" | undefined;
-    missing_knowledge?: string | undefined;
-    source_step?: string | undefined;
-    related_dimension?: string | null | undefined;
-}, {
-    has_gap: boolean;
-    signal_type?: "interpretation_difficulty" | "strategy_deadlock" | "stall_information_deficit" | "new_domain" | "prerequisite_missing" | undefined;
-    missing_knowledge?: string | undefined;
-    source_step?: string | undefined;
-    related_dimension?: string | null | undefined;
-}>;
-export declare const AcquisitionTaskFieldsSchema: z.ZodObject<{
-    knowledge_target: z.ZodString;
-    knowledge_questions: z.ZodArray<z.ZodString, "many">;
-    in_scope: z.ZodArray<z.ZodString, "many">;
-    out_of_scope: z.ZodArray<z.ZodString, "many">;
-}, "strip", z.ZodTypeAny, {
-    in_scope: string[];
-    out_of_scope: string[];
-    knowledge_questions: string[];
-    knowledge_target: string;
-}, {
-    in_scope: string[];
-    out_of_scope: string[];
-    knowledge_questions: string[];
-    knowledge_target: string;
-}>;
-export declare const ContradictionCheckResponseSchema: z.ZodObject<{
-    has_contradiction: z.ZodBoolean;
-    conflicting_entry_id: z.ZodDefault<z.ZodNullable<z.ZodString>>;
-    resolution: z.ZodDefault<z.ZodNullable<z.ZodString>>;
-}, "strip", z.ZodTypeAny, {
-    has_contradiction: boolean;
-    conflicting_entry_id: string | null;
-    resolution: string | null;
-}, {
-    has_contradiction: boolean;
-    conflicting_entry_id?: string | null | undefined;
-    resolution?: string | null | undefined;
-}>;
-/**
- * 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.
- */
-export declare function detectKnowledgeGap(deps: KnowledgeQueryDeps, context: {
-    observations: unknown[];
-    strategies: unknown[] | null | undefined;
-    confidence: number;
-}): Promise<KnowledgeGapSignal | null>;
-/**
- * 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.
- */
-export declare function generateAcquisitionTask(deps: KnowledgeQueryDeps, signal: KnowledgeGapSignal, goalId: string): Promise<Task>;
-/**
- * Check whether a new entry contradicts existing same-tag entries.
- * Uses LLM to compare answers for entries sharing tags with the new entry.
- */
-export declare function checkContradiction(deps: KnowledgeQueryDeps, goalId: string, newEntry: KnowledgeEntry): Promise<ContradictionResult>;
-//# sourceMappingURL=knowledge-manager-query.d.ts.map

package/dist/platform/knowledge/knowledge-manager-query.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-manager-query.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-query.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAEtD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAKrD,OAAO,KAAK,EACV,cAAc,EACd,kBAAkB,EAClB,mBAAmB,EACpB,MAAM,+BAA+B,CAAC;AAKvC,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,UAAU,CAAC;IACtB,OAAO,CAAC,EAAE,cAAc,CAAC;IACzB,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAID,eAAO,MAAM,0BAA0B;;;;;;;;;;;;;;;;;;EAcrC,CAAC;AAEH,eAAO,MAAM,2BAA2B;;;;;;;;;;;;;;;EAMtC,CAAC;AAEH,eAAO,MAAM,gCAAgC;;;;;;;;;;;;EAI3C,CAAC;AAIH;;;;;;;;GAQG;AACH,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,kBAAkB,EACxB,OAAO,EAAE;IACP,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB,UAAU,EAAE,OAAO,EAAE,GAAG,IAAI,GAAG,SAAS,CAAC;IACzC,UAAU,EAAE,MAAM,CAAC;CACpB,GACA,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,CAkFpC;AAID;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,kBAAkB,EACxB,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CAmGf;AAID;;;GAGG;AACH,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,kBAAkB,EACxB,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,cAAc,GACvB,OAAO,CAAC,mBAAmB,CAAC,CAwF9B"}

package/dist/platform/knowledge/knowledge-manager-query.js

@@ -1,287 +0,0 @@
-import { randomUUID } from "node:crypto";
-import { z } from "zod";
-import { TaskSchema } from "../../base/types/task.js";
-import { KnowledgeGapSignalSchema, ContradictionResultSchema, } from "../../base/types/knowledge.js";
-import { loadDomainKnowledge } from "./knowledge-search.js";
-// ─── LLM response schemas ───
-export 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(),
-});
-export 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()),
-});
-export const ContradictionCheckResponseSchema = z.object({
-    has_contradiction: z.boolean(),
-    conflicting_entry_id: z.string().nullable().default(null),
-    resolution: z.string().nullable().default(null),
-});
-// ─── 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.
- */
-export async function detectKnowledgeGap(deps, context) {
-    const { llmClient, gateway } = deps;
-    // 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 (gateway) {
-        try {
-            parsed = await gateway.execute({
-                purpose: "knowledge_gap_detection",
-                additionalContext: { gap_detection_prompt: prompt },
-                responseSchema: GapDetectionResponseSchema,
-                maxTokens: 512,
-            });
-        }
-        catch {
-            return null;
-        }
-    }
-    else {
-        const response = await 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 = 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.
- */
-export async function generateAcquisitionTask(deps, signal, goalId) {
-    const { llmClient, gateway, stateManager } = deps;
-    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 (gateway) {
-        fields = await gateway.execute({
-            purpose: "knowledge_acquisition",
-            goalId,
-            additionalContext: { acquisition_prompt: prompt },
-            responseSchema: AcquisitionTaskFieldsSchema,
-            maxTokens: 1024,
-        });
-    }
-    else {
-        const response = await 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 = 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:
-${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 stateManager.writeRaw(`tasks/${goalId}/${taskId}.json`, task);
-    return task;
-}
-// ─── checkContradiction ───
-/**
- * Check whether a new entry contradicts existing same-tag entries.
- * Uses LLM to compare answers for entries sharing tags with the new entry.
- */
-export async function checkContradiction(deps, goalId, newEntry) {
-    const { llmClient, gateway, stateManager } = deps;
-    // Load entries that share at least one tag with the new entry
-    const domainKnowledge = await loadDomainKnowledge(stateManager, 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}:
-  Question: ${e.question}
-  Answer: ${e.answer}
-  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 (gateway) {
-        try {
-            const parsed = await 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 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 = llmClient.parseJSON(response.content, ContradictionCheckResponseSchema);
-            return ContradictionResultSchema.parse(parsed);
-        }
-        catch {
-            return ContradictionResultSchema.parse({
-                has_contradiction: false,
-                conflicting_entry_id: null,
-                resolution: null,
-            });
-        }
-    }
-}
-//# sourceMappingURL=knowledge-manager-query.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-manager-query.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-query.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAKxB,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,OAAO,EACL,wBAAwB,EACxB,yBAAyB,GAC1B,MAAM,+BAA+B,CAAC;AAMvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAW5D,+BAA+B;AAE/B,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC,MAAM,CAAC;IACjD,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,CAAC,MAAM,2BAA2B,GAAG,CAAC,CAAC,MAAM,CAAC;IAClD,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,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC,MAAM,CAAC;IACvD,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,6BAA6B;AAE7B;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAwB,EACxB,OAIC;IAED,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEpC,wDAAwD;IACxD,IAAI,OAAO,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;QAC7B,OAAO,wBAAwB,CAAC,KAAK,CAAC;YACpC,WAAW,EAAE,2BAA2B;YACxC,iBAAiB,EACf,iEAAiE;YACnE,WAAW,EAAE,iBAAiB;YAC9B,iBAAiB,EAAE,IAAI;SACxB,CAAC,CAAC;IACL,CAAC;IAED,+FAA+F;IAC/F,gFAAgF;IAChF,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzE,OAAO,wBAAwB,CAAC,KAAK,CAAC;YACpC,WAAW,EAAE,mBAAmB;YAChC,iBAAiB,EACf,0EAA0E;YAC5E,WAAW,EAAE,oBAAoB;YACjC,iBAAiB,EAAE,IAAI;SACxB,CAAC,CAAC;IACL,CAAC;IAED,2CAA2C;IAC3C,MAAM,MAAM,GAAG;;gBAED,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;IAED,IAAI,MAAkD,CAAC;IACvD,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBAC7B,OAAO,EAAE,yBAAyB;gBAClC,iBAAiB,EAAE,EAAE,oBAAoB,EAAE,MAAM,EAAE;gBACnD,cAAc,EAAE,0BAA0B;gBAC1C,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,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,GAAG,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,0BAA0B,CAAC,CAAC;QAC7E,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,wBAAwB,CAAC,KAAK,CAAC;QACpC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,2BAA2B;QAC9D,iBAAiB,EACf,MAAM,CAAC,iBAAiB,IAAI,oCAAoC;QAClE,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,iBAAiB;QACpD,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,IAAI;KACpD,CAAC,CAAC;AACL,CAAC;AAED,kCAAkC;AAElC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,IAAwB,EACxB,MAA0B,EAC1B,MAAc;IAEd,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;IAElD,MAAM,MAAM,GAAG;;WAEN,MAAM;;UAEP,MAAM,CAAC,WAAW;uBACL,MAAM,CAAC,iBAAiB;iBAC9B,MAAM,CAAC,WAAW;uBACZ,MAAM,CAAC,iBAAiB,IAAI,MAAM;;;;;;;;;;;EAWvD,CAAC;IAED,IAAI,MAAmD,CAAC;IACxD,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;YAC7B,OAAO,EAAE,uBAAuB;YAChC,MAAM;YACN,iBAAiB,EAAE,EAAE,kBAAkB,EAAE,MAAM,EAAE;YACjD,cAAc,EAAE,2BAA2B;YAC3C,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,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,GAAG,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,2BAA2B,CAAC,CAAC;IAC9E,CAAC;IAED,yBAAyB;IACzB,MAAM,SAAS,GAAG,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAErC,MAAM,mBAAmB,GAAG,OAAO,SAAS,CAAC,MAAM,wDAAwD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAElI,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;QAC5B,EAAE,EAAE,MAAM;QACV,OAAO,EAAE,MAAM;QACf,WAAW,EAAE,IAAI;QACjB,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;YACzC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;YAC5B,CAAC,CAAC,EAAE;QACN,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,WAAW;QAC1D,gBAAgB,EAAE,kBAAkB,MAAM,CAAC,gBAAgB,EAAE;QAC7D,SAAS,EAAE,2BAA2B,MAAM,CAAC,WAAW,MAAM,MAAM,CAAC,iBAAiB,EAAE;QACxF,QAAQ,EAAE;EACZ,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;QACpD,gBAAgB,EAAE;YAChB;gBACE,WAAW,EAAE,mBAAmB;gBAChC,mBAAmB,EACjB,4DAA4D;gBAC9D,WAAW,EAAE,IAAI;aAClB;SACF;QACD,cAAc,EAAE;YACd,QAAQ,EAAE,CAAC,wBAAwB,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC1F,YAAY,EAAE;gBACZ,sBAAsB;gBACtB,cAAc;gBACd,gBAAgB;gBAChB,GAAG,MAAM,CAAC,YAAY;aACvB;YACD,YAAY,EAAE,gCAAgC;SAC/C;QACD,WAAW,EAAE;YACX,aAAa,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC1F,iCAAiC;YACjC,yCAAyC;SAC1C;QACD,aAAa,EAAE,YAAY;QAC3B,kBAAkB,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE;QAC/C,aAAa,EAAE,uBAAuB;QACtC,MAAM,EAAE,SAAS;QACjB,UAAU,EAAE,GAAG;KAChB,CAAC,CAAC;IAEH,UAAU;IACV,MAAM,YAAY,CAAC,QAAQ,CAAC,SAAS,MAAM,IAAI,MAAM,OAAO,EAAE,IAAI,CAAC,CAAC;IAEpE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6BAA6B;AAE7B;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAwB,EACxB,MAAc,EACd,QAAwB;IAExB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;IAElD,8DAA8D;IAC9D,MAAM,eAAe,GAAG,MAAM,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IACxE,MAAM,gBAAgB,GAAG,eAAe,CAAC,OAAO,CAAC,MAAM,CACrD,CAAC,QAAQ,EAAE,EAAE,CACX,QAAQ,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;QACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACxD,QAAQ,CAAC,aAAa,KAAK,IAAI,CAClC,CAAC;IAEF,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,yBAAyB,CAAC,KAAK,CAAC;YACrC,iBAAiB,EAAE,KAAK;YACxB,oBAAoB,EAAE,IAAI;YAC1B,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;IACL,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB;SACrC,GAAG,CACF,CAAC,CAAC,EAAE,EAAE,CACJ,SAAS,CAAC,CAAC,QAAQ;cACb,CAAC,CAAC,QAAQ;YACZ,CAAC,CAAC,MAAM;UACV,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACxB;SACA,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG;;;cAGH,QAAQ,CAAC,QAAQ;YACnB,QAAQ,CAAC,MAAM;UACjB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;;;EAGhC,eAAe;;;;;;;EAOf,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC;gBACnC,OAAO,EAAE,yBAAyB;gBAClC,MAAM;gBACN,iBAAiB,EAAE,EAAE,oBAAoB,EAAE,MAAM,EAAE;gBACnD,cAAc,EAAE,gCAAgC;gBAChD,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;YACH,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;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,WAAW,CAC1C,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,SAAS,CAAC,SAAS,CAChC,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;AACH,CAAC"}