pulseed 0.4.15 → 0.4.17

package/dist/platform/knowledge/knowledge-decisions.js

@@ -1,223 +0,0 @@
-import * as fsp from "node:fs/promises";
-import * as path from "node:path";
-import { z } from "zod";
-import { DecisionRecordSchema } from "../../base/types/knowledge.js";
-import { writeJsonFileAtomic } from "../../base/utils/json-io.js";
-import { projectDecisionsToSoil, rebuildSoilIndex } from "../soil/index.js";
-// ─── LLM response schema ───
-const EnrichmentSchema = z.object({
-    what_worked: z.array(z.string()).default([]),
-    what_failed: z.array(z.string()).default([]),
-    suggested_next: z.array(z.string()).default([]),
-});
-// ─── Decision History functions ───
-/**
- * Save a DecisionRecord to ~/.pulseed/decisions/<goalId>-<timestamp>.json
- * For completed records (outcome !== "pending"), enriches with LLM-extracted
- * what_worked/what_failed/suggested_next before saving.
- */
-export async function recordDecision(deps, record) {
-    let toSave = DecisionRecordSchema.parse(record);
-    if (toSave.outcome !== "pending") {
-        toSave = await enrichDecisionRecord(deps, toSave);
-    }
-    const decisionsDir = path.join(deps.stateManager.getBaseDir(), "decisions");
-    const filename = `${toSave.goal_id}-${toSave.timestamp.replace(/[:.]/g, "-")}.json`;
-    const filePath = path.join(decisionsDir, filename);
-    await writeJsonFileAtomic(filePath, toSave);
-    await projectDecisionDirectoryToSoil(deps);
-}
-/**
- * Enrich a completed DecisionRecord by extracting what_worked/what_failed/suggested_next via LLM.
- * Falls back to default empty arrays on LLM failure.
- */
-export async function enrichDecisionRecord(deps, record) {
-    const prompt = `From the following task decision record, extract:
-- what_worked: things that contributed to a positive outcome
-- what_failed: things that caused problems or failures
-- suggested_next: actions to try next based on this result
-
-Decision: ${record.decision}, Outcome: ${record.outcome}
-Strategy: ${record.strategy_id}
-Context: ${JSON.stringify(record.context).slice(0, 500)}
-
-Respond with JSON only: { "what_worked": [...], "what_failed": [...], "suggested_next": [...] }`;
-    try {
-        let enrichedRaw;
-        if (deps.gateway) {
-            enrichedRaw = await deps.gateway.execute({
-                purpose: "knowledge_enrichment",
-                additionalContext: { enrichment_prompt: prompt },
-                responseSchema: EnrichmentSchema,
-                maxTokens: 512,
-            });
-        }
-        else {
-            const response = await deps.llmClient.sendMessage([{ role: "user", content: prompt }], { max_tokens: 512 });
-            enrichedRaw = deps.llmClient.parseJSON(response.content, EnrichmentSchema);
-        }
-        const enriched = {
-            what_worked: enrichedRaw.what_worked ?? [],
-            what_failed: enrichedRaw.what_failed ?? [],
-            suggested_next: enrichedRaw.suggested_next ?? [],
-        };
-        return DecisionRecordSchema.parse({ ...record, ...enriched });
-    }
-    catch (err) {
-        console.error("[KnowledgeManager] enrichDecisionRecord LLM failed:", err);
-        return 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+).
- */
-export async function queryDecisions(deps, goalType, limit = 20) {
-    const decisionsDir = path.join(deps.stateManager.getBaseDir(), "decisions");
-    let files;
-    try {
-        files = await fsp.readdir(decisionsDir);
-    }
-    catch {
-        return [];
-    }
-    const records = [];
-    for (const file of files) {
-        if (!file.endsWith(".json"))
-            continue;
-        try {
-            const content = await fsp.readFile(path.join(decisionsDir, file), "utf-8");
-            const raw = JSON.parse(content);
-            const record = DecisionRecordSchema.parse(raw);
-            if (record.goal_type === goalType) {
-                records.push(record);
-            }
-        }
-        catch {
-            // Skip invalid files
-        }
-    }
-    // Sort by recency (newest first), with time-decay weight applied
-    records.sort((a, b) => {
-        const wa = calculateTimeDecayWeight(a.timestamp);
-        const wb = calculateTimeDecayWeight(b.timestamp);
-        if (wb !== wa)
-            return wb - wa;
-        return new Date(b.timestamp).getTime() - new Date(a.timestamp).getTime();
-    });
-    return records.slice(0, 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.
- */
-export async function updateDecisionOutcome(deps, strategyId, outcome) {
-    const decisionsDir = path.join(deps.stateManager.getBaseDir(), "decisions");
-    let files;
-    try {
-        files = await fsp.readdir(decisionsDir);
-    }
-    catch {
-        return;
-    }
-    // Collect all pending records for this strategy_id
-    const matches = [];
-    for (const file of files) {
-        if (!file.endsWith(".json"))
-            continue;
-        const filePath = path.join(decisionsDir, file);
-        try {
-            const content = await fsp.readFile(filePath, "utf-8");
-            const raw = JSON.parse(content);
-            const record = DecisionRecordSchema.parse(raw);
-            if (record.strategy_id === strategyId && record.outcome === "pending") {
-                matches.push({ filePath, record });
-            }
-        }
-        catch {
-            // Skip invalid files
-        }
-    }
-    if (matches.length === 0)
-        return;
-    // Update the most recent matching record
-    matches.sort((a, b) => new Date(b.record.timestamp).getTime() -
-        new Date(a.record.timestamp).getTime());
-    const { filePath, record } = matches[0];
-    const updated = DecisionRecordSchema.parse({ ...record, outcome });
-    await writeJsonFileAtomic(filePath, updated);
-    await projectDecisionDirectoryToSoil(deps);
-}
-/**
- * Remove decision records older than 90 days.
- * Returns the count of purged records.
- */
-export async function purgeOldDecisions(deps) {
-    const decisionsDir = path.join(deps.stateManager.getBaseDir(), "decisions");
-    let files;
-    try {
-        files = await fsp.readdir(decisionsDir);
-    }
-    catch {
-        return 0;
-    }
-    const cutoff = Date.now() - 90 * 24 * 60 * 60 * 1000;
-    let purged = 0;
-    for (const file of files) {
-        if (!file.endsWith(".json"))
-            continue;
-        const filePath = path.join(decisionsDir, file);
-        try {
-            const content = await fsp.readFile(filePath, "utf-8");
-            const raw = JSON.parse(content);
-            const record = DecisionRecordSchema.parse(raw);
-            if (new Date(record.timestamp).getTime() < cutoff) {
-                await fsp.unlink(filePath);
-                purged++;
-            }
-        }
-        catch {
-            // Skip invalid files
-        }
-    }
-    if (purged > 0) {
-        await projectDecisionDirectoryToSoil(deps);
-    }
-    return purged;
-}
-async function projectDecisionDirectoryToSoil(deps) {
-    try {
-        const baseDir = deps.stateManager.getBaseDir();
-        const decisionsDir = path.join(baseDir, "decisions");
-        const files = await fsp.readdir(decisionsDir).catch(() => []);
-        const records = [];
-        for (const file of files) {
-            if (!file.endsWith(".json")) {
-                continue;
-            }
-            try {
-                const content = await fsp.readFile(path.join(decisionsDir, file), "utf-8");
-                const raw = JSON.parse(content);
-                records.push(DecisionRecordSchema.parse(raw));
-            }
-            catch {
-                // Skip invalid decision files; SoilDoctor can report source issues separately.
-            }
-        }
-        await projectDecisionsToSoil({ baseDir, records });
-        await rebuildSoilIndex({ rootDir: path.join(baseDir, "soil") });
-    }
-    catch (error) {
-        console.warn(`[soil] Failed to project decision history: ${error instanceof Error ? error.message : String(error)}`);
-    }
-}
-/**
- * Linear decay: 1.0 at day 0, 0.0 at day 30+.
- */
-export function calculateTimeDecayWeight(timestamp) {
-    const ageMs = Date.now() - new Date(timestamp).getTime();
-    const ageDays = ageMs / (1000 * 60 * 60 * 24);
-    return Math.max(0, 1 - ageDays / 30);
-}
-//# sourceMappingURL=knowledge-decisions.js.map

package/dist/platform/knowledge/knowledge-decisions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-decisions.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-decisions.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,GAAG,MAAM,kBAAkB,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AAKrE,OAAO,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAClE,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAE5E,8BAA8B;AAE9B,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IAC5C,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IAC5C,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;CAChD,CAAC,CAAC;AAUH,qCAAqC;AAErC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,IAAkB,EAClB,MAAsB;IAEtB,IAAI,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QACjC,MAAM,GAAG,MAAM,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5E,MAAM,QAAQ,GAAG,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC;IACpF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IACnD,MAAM,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5C,MAAM,8BAA8B,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAAkB,EAClB,MAAsB;IAEtB,MAAM,MAAM,GAAG;;;;;YAKL,MAAM,CAAC,QAAQ,cAAc,MAAM,CAAC,OAAO;YAC3C,MAAM,CAAC,WAAW;WACnB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;;gGAEyC,CAAC;IAE/F,IAAI,CAAC;QACH,IAAI,WAA0F,CAAC;QAC/F,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;gBACvC,OAAO,EAAE,sBAAsB;gBAC/B,iBAAiB,EAAE,EAAE,iBAAiB,EAAE,MAAM,EAAE;gBAChD,cAAc,EAAE,gBAAgB;gBAChC,SAAS,EAAE,GAAG;aACf,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,EAAE,UAAU,EAAE,GAAG,EAAE,CACpB,CAAC;YACF,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAC7E,CAAC;QACD,MAAM,QAAQ,GAAG;YACf,WAAW,EAAE,WAAW,CAAC,WAAW,IAAI,EAAE;YAC1C,WAAW,EAAE,WAAW,CAAC,WAAW,IAAI,EAAE;YAC1C,cAAc,EAAE,WAAW,CAAC,cAAc,IAAI,EAAE;SACjD,CAAC;QACF,OAAO,oBAAoB,CAAC,KAAK,CAAC,EAAE,GAAG,MAAM,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;IAChE,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,KAAK,CAAC,qDAAqD,EAAE,GAAG,CAAC,CAAC;QAC1E,OAAO,MAAM,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,IAAkB,EAClB,QAAgB,EAChB,QAAgB,EAAE;IAElB,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5E,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;YAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;YAC3C,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,MAAM,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,qBAAqB;QACvB,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,EAAE,GAAG,wBAAwB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,wBAAwB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC9B,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,IAAkB,EAClB,UAAkB,EAClB,OAA8B;IAE9B,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5E,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IAED,mDAAmD;IACnD,MAAM,OAAO,GAAwD,EAAE,CAAC;IACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;YAC3C,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,MAAM,CAAC,WAAW,KAAK,UAAU,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBACtE,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,qBAAqB;QACvB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEjC,yCAAyC;IACzC,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE;QACtC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CACzC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;IACzC,MAAM,OAAO,GAAG,oBAAoB,CAAC,KAAK,CAAC,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACnE,MAAM,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,8BAA8B,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,IAAkB;IACxD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,WAAW,CAAC,CAAC;IAC5E,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,CAAC;IACX,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IACrD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;YAC3C,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,MAAM,EAAE,CAAC;gBAClD,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC3B,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,qBAAqB;QACvB,CAAC;IACH,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,MAAM,8BAA8B,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,KAAK,UAAU,8BAA8B,CAAC,IAAkB;IAC9D,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC;QAC/C,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;gBAC3C,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;YAAC,MAAM,CAAC;gBACP,+EAA+E;YACjF,CAAC;QACH,CAAC;QACD,MAAM,sBAAsB,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QACnD,MAAM,gBAAgB,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CACV,8CAA8C,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CACvG,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,SAAiB;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IACzD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,EAAE,CAAC,CAAC;AACvC,CAAC"}

package/dist/platform/knowledge/knowledge-graph.d.ts

@@ -1,74 +0,0 @@
-import { type KnowledgeEdge } from "../../base/types/knowledge.js";
-interface KnowledgeGraphNode {
-    entry_id: string;
-    goal_id: string;
-    tags: string[];
-    added_at: string;
-}
-/**
- * KnowledgeGraph stores cross-goal concept relationships as a directed graph.
- * Nodes represent KnowledgeEntry IDs; edges carry typed semantic relations.
- *
- * Persisted as JSON at graphPath: { nodes: [...], edges: [...] }
- */
-export declare class KnowledgeGraph {
-    private readonly graphPath;
-    private nodes;
-    private edges;
-    constructor(graphPath: string);
-    /**
-     * Factory method: constructs a KnowledgeGraph and loads existing data from disk.
-     */
-    static create(graphPath: string): Promise<KnowledgeGraph>;
-    /**
-     * Add a node for a KnowledgeEntry. If a node with the same entry_id already
-     * exists, it is replaced (update semantics).
-     */
-    addNode(entryId: string, goalId: string, tags: string[]): Promise<void>;
-    /**
-     * Remove a node and all edges that reference it.
-     */
-    removeNode(entryId: string): Promise<void>;
-    getNode(entryId: string): KnowledgeGraphNode | undefined;
-    getAllNodes(): KnowledgeGraphNode[];
-    /**
-     * Add an edge. created_at is set automatically to the current timestamp.
-     * Duplicate edges (same from_id, to_id, relation) are replaced.
-     */
-    addEdge(edge: Omit<KnowledgeEdge, "created_at">): Promise<void>;
-    /**
-     * Remove all edges between fromId and toId (regardless of relation type).
-     */
-    removeEdge(fromId: string, toId: string): Promise<void>;
-    getEdgesFrom(entryId: string): KnowledgeEdge[];
-    getEdgesTo(entryId: string): KnowledgeEdge[];
-    getAllEdges(): KnowledgeEdge[];
-    /**
-     * Returns all nodes reachable from entryId via a single outgoing edge,
-     * paired with the connecting edge.
-     */
-    getRelated(entryId: string): {
-        node: KnowledgeGraphNode;
-        edge: KnowledgeEdge;
-    }[];
-    /**
-     * Returns all edges with relation = "contradicts".
-     */
-    getContradictions(): KnowledgeEdge[];
-    /**
-     * Detect all simple cycles in the directed graph.
-     * Returns an array of node-ID arrays, each representing one cycle.
-     * Uses DFS with a recursion stack.
-     */
-    detectCycles(): string[][];
-    get nodeCount(): number;
-    get edgeCount(): number;
-    private save;
-    _load(): Promise<void>;
-    /**
-     * Remove all nodes and edges and persist the empty state.
-     */
-    clear(): Promise<void>;
-}
-export {};
-//# sourceMappingURL=knowledge-graph.d.ts.map

package/dist/platform/knowledge/knowledge-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-graph.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-graph.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,aAAa,EAAuB,MAAM,+BAA+B,CAAC;AAExF,UAAU,kBAAkB;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAOD;;;;;GAKG;AACH,qBAAa,cAAc;IAIb,OAAO,CAAC,QAAQ,CAAC,SAAS;IAHtC,OAAO,CAAC,KAAK,CAA8C;IAC3D,OAAO,CAAC,KAAK,CAAuB;gBAEP,SAAS,EAAE,MAAM;IAK9C;;OAEG;WACU,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC;IAQ/D;;;OAGG;IACG,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAW7E;;OAEG;IACG,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAShD,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,kBAAkB,GAAG,SAAS;IAIxD,WAAW,IAAI,kBAAkB,EAAE;IAMnC;;;OAGG;IACG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,YAAY,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBrE;;OAEG;IACG,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU7D,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,EAAE;IAI9C,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,EAAE;IAI5C,WAAW,IAAI,aAAa,EAAE;IAM9B;;;OAGG;IACH,UAAU,CACR,OAAO,EAAE,MAAM,GACd;QAAE,IAAI,EAAE,kBAAkB,CAAC;QAAC,IAAI,EAAE,aAAa,CAAA;KAAE,EAAE;IAYtD;;OAEG;IACH,iBAAiB,IAAI,aAAa,EAAE;IAMpC;;;;OAIG;IACH,YAAY,IAAI,MAAM,EAAE,EAAE;IAuC1B,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;YAIa,IAAI;IAeZ,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IA0B5B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAK7B"}

package/dist/platform/knowledge/knowledge-graph.js

@@ -1,207 +0,0 @@
-import * as fsp from "node:fs/promises";
-import * as path from "node:path";
-import { KnowledgeEdgeSchema } from "../../base/types/knowledge.js";
-/**
- * KnowledgeGraph stores cross-goal concept relationships as a directed graph.
- * Nodes represent KnowledgeEntry IDs; edges carry typed semantic relations.
- *
- * Persisted as JSON at graphPath: { nodes: [...], edges: [...] }
- */
-export class KnowledgeGraph {
-    graphPath;
-    nodes = new Map();
-    edges = [];
-    constructor(graphPath) {
-        this.graphPath = graphPath;
-        // Sync loading removed. Use KnowledgeGraph.create() for async load on construction,
-        // or call _load() manually after construction.
-    }
-    /**
-     * Factory method: constructs a KnowledgeGraph and loads existing data from disk.
-     */
-    static async create(graphPath) {
-        const graph = new KnowledgeGraph(graphPath);
-        await graph._load();
-        return graph;
-    }
-    // ─── Node CRUD ───
-    /**
-     * Add a node for a KnowledgeEntry. If a node with the same entry_id already
-     * exists, it is replaced (update semantics).
-     */
-    async addNode(entryId, goalId, tags) {
-        const node = {
-            entry_id: entryId,
-            goal_id: goalId,
-            tags: [...tags],
-            added_at: new Date().toISOString(),
-        };
-        this.nodes.set(entryId, node);
-        await this.save();
-    }
-    /**
-     * Remove a node and all edges that reference it.
-     */
-    async removeNode(entryId) {
-        if (!this.nodes.has(entryId))
-            return;
-        this.nodes.delete(entryId);
-        this.edges = this.edges.filter((e) => e.from_id !== entryId && e.to_id !== entryId);
-        await this.save();
-    }
-    getNode(entryId) {
-        return this.nodes.get(entryId);
-    }
-    getAllNodes() {
-        return Array.from(this.nodes.values());
-    }
-    // ─── Edge CRUD ───
-    /**
-     * Add an edge. created_at is set automatically to the current timestamp.
-     * Duplicate edges (same from_id, to_id, relation) are replaced.
-     */
-    async addEdge(edge) {
-        // Remove existing edge with same from/to/relation to avoid duplicates
-        this.edges = this.edges.filter((e) => !(e.from_id === edge.from_id &&
-            e.to_id === edge.to_id &&
-            e.relation === edge.relation));
-        const full = KnowledgeEdgeSchema.parse({
-            ...edge,
-            created_at: new Date().toISOString(),
-        });
-        this.edges.push(full);
-        await this.save();
-    }
-    /**
-     * Remove all edges between fromId and toId (regardless of relation type).
-     */
-    async removeEdge(fromId, toId) {
-        const before = this.edges.length;
-        this.edges = this.edges.filter((e) => !(e.from_id === fromId && e.to_id === toId));
-        if (this.edges.length !== before) {
-            await this.save();
-        }
-    }
-    getEdgesFrom(entryId) {
-        return this.edges.filter((e) => e.from_id === entryId);
-    }
-    getEdgesTo(entryId) {
-        return this.edges.filter((e) => e.to_id === entryId);
-    }
-    getAllEdges() {
-        return [...this.edges];
-    }
-    // ─── Queries ───
-    /**
-     * Returns all nodes reachable from entryId via a single outgoing edge,
-     * paired with the connecting edge.
-     */
-    getRelated(entryId) {
-        const outgoing = this.getEdgesFrom(entryId);
-        const result = [];
-        for (const edge of outgoing) {
-            const node = this.nodes.get(edge.to_id);
-            if (node) {
-                result.push({ node, edge });
-            }
-        }
-        return result;
-    }
-    /**
-     * Returns all edges with relation = "contradicts".
-     */
-    getContradictions() {
-        return this.edges.filter((e) => e.relation === "contradicts");
-    }
-    // ─── Cycle Detection (DFS) ───
-    /**
-     * Detect all simple cycles in the directed graph.
-     * Returns an array of node-ID arrays, each representing one cycle.
-     * Uses DFS with a recursion stack.
-     */
-    detectCycles() {
-        const visited = new Set();
-        const recStack = new Set();
-        const cycles = [];
-        const path = [];
-        const dfs = (nodeId) => {
-            visited.add(nodeId);
-            recStack.add(nodeId);
-            path.push(nodeId);
-            for (const edge of this.getEdgesFrom(nodeId)) {
-                const neighbor = edge.to_id;
-                if (!visited.has(neighbor)) {
-                    dfs(neighbor);
-                }
-                else if (recStack.has(neighbor)) {
-                    // Found a cycle: extract the cycle portion from path
-                    const cycleStart = path.indexOf(neighbor);
-                    if (cycleStart !== -1) {
-                        cycles.push([...path.slice(cycleStart), neighbor]);
-                    }
-                }
-            }
-            path.pop();
-            recStack.delete(nodeId);
-        };
-        for (const nodeId of this.nodes.keys()) {
-            if (!visited.has(nodeId)) {
-                dfs(nodeId);
-            }
-        }
-        return cycles;
-    }
-    // ─── Stats ───
-    get nodeCount() {
-        return this.nodes.size;
-    }
-    get edgeCount() {
-        return this.edges.length;
-    }
-    // ─── Persistence ───
-    async save() {
-        const dir = path.dirname(this.graphPath);
-        await fsp.mkdir(dir, { recursive: true });
-        const data = {
-            nodes: Array.from(this.nodes.values()),
-            edges: this.edges,
-        };
-        const json = JSON.stringify(data, null, 2);
-        const tmpPath = `${this.graphPath}.tmp`;
-        await fsp.writeFile(tmpPath, json, "utf-8");
-        await fsp.rename(tmpPath, this.graphPath);
-    }
-    async _load() {
-        try {
-            await fsp.access(this.graphPath);
-        }
-        catch {
-            return;
-        }
-        try {
-            const raw = await fsp.readFile(this.graphPath, "utf-8");
-            const parsed = JSON.parse(raw);
-            this.nodes.clear();
-            this.edges = [];
-            for (const node of parsed.nodes ?? []) {
-                this.nodes.set(node.entry_id, node);
-            }
-            for (const edge of parsed.edges ?? []) {
-                const validated = KnowledgeEdgeSchema.parse(edge);
-                this.edges.push(validated);
-            }
-        }
-        catch {
-            // Corrupt or empty file — start fresh
-        }
-    }
-    /**
-     * Remove all nodes and edges and persist the empty state.
-     */
-    async clear() {
-        this.nodes.clear();
-        this.edges = [];
-        await this.save();
-    }
-}
-//# sourceMappingURL=knowledge-graph.js.map

package/dist/platform/knowledge/knowledge-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,GAAG,MAAM,kBAAkB,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAsB,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAcxF;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IAII;IAHrB,KAAK,GAAoC,IAAI,GAAG,EAAE,CAAC;IACnD,KAAK,GAAoB,EAAE,CAAC;IAEpC,YAA6B,SAAiB;QAAjB,cAAS,GAAT,SAAS,CAAQ;QAC5C,oFAAoF;QACpF,+CAA+C;IACjD,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAiB;QACnC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oBAAoB;IAEpB;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,OAAe,EAAE,MAAc,EAAE,IAAc;QAC3D,MAAM,IAAI,GAAuB;YAC/B,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,MAAM;YACf,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;YACf,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACnC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAAe;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO;QACrC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO,CACpD,CAAC;QACF,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,OAAe;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,oBAAoB;IAEpB;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,IAAuC;QACnD,sEAAsE;QACtE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CACC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;YAC1B,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK;YACtB,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAC7B,CACJ,CAAC;QACF,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,CAAC;YACrC,GAAG,IAAI;YACP,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,MAAc,EAAE,IAAY;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,CACnD,CAAC;QACF,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACjC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACzD,CAAC;IAED,UAAU,CAAC,OAAe;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,kBAAkB;IAElB;;;OAGG;IACH,UAAU,CACR,OAAe;QAEf,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAwD,EAAE,CAAC;QACvE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAC;IAChE,CAAC;IAED,gCAAgC;IAEhC;;;;OAIG;IACH,YAAY;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,GAAG,GAAG,CAAC,MAAc,EAAQ,EAAE;YACnC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAElB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChB,CAAC;qBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAClC,qDAAqD;oBACrD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAC1C,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;wBACtB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;oBACrD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gBAAgB;IAEhB,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,sBAAsB;IAEd,KAAK,CAAC,IAAI;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE1C,MAAM,IAAI,GAAc;YACtB,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,SAAS,MAAM,CAAC;QACxC,MAAM,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC;YACH,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QACD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAc,CAAC;YAE5C,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAEhB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;YAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;gBACtC,MAAM,SAAS,GAAG,mBAAmB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,sCAAsC;QACxC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;CACF"}

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

@@ -1,10 +0,0 @@
-import type { KnowledgeManager } from "./knowledge-manager.js";
-import { type LintResult } from "./types/agent-memory.js";
-export declare function lintAgentMemory(opts: {
-    km: KnowledgeManager;
-    llmCall: (prompt: string) => Promise<string>;
-    autoRepair?: boolean;
-    minAutoRepairConfidence?: number;
-    categories?: string[];
-}): Promise<LintResult>;
-//# sourceMappingURL=knowledge-manager-lint.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-manager-lint.d.ts","sourceRoot":"","sources":["../../../src/platform/knowledge/knowledge-manager-lint.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAGL,KAAK,UAAU,EAEhB,MAAM,yBAAyB,CAAC;AA0CjC,wBAAsB,eAAe,CAAC,IAAI,EAAE;IAC1C,EAAE,EAAE,gBAAgB,CAAC;IACrB,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB,GAAG,OAAO,CAAC,UAAU,CAAC,CAkHtB"}