pulseed 0.4.3 → 0.4.6

package/dist/knowledge/memory/memory-query.js

@@ -1,64 +0,0 @@
-import * as path from "node:path";
-import { z } from "zod";
-import { LessonEntrySchema } from "../../types/memory-lifecycle.js";
-import { readJsonFileAsync } from "./memory-persistence.js";
-// ─── Lesson query ───
-export async function queryLessons(memoryDir, tags, dimensions, maxCount) {
-    const results = [];
-    const seen = new Set();
-    // Query by-dimension lessons
-    for (const dim of dimensions) {
-        const byDimPath = path.join(memoryDir, "long-term", "lessons", "by-dimension", `${dim}.json`);
-        const lessons = (await readJsonFileAsync(byDimPath, z.array(LessonEntrySchema))) ?? [];
-        for (const l of lessons) {
-            if (!seen.has(l.lesson_id) &&
-                l.status === "active" &&
-                results.length < maxCount) {
-                results.push(l);
-                seen.add(l.lesson_id);
-            }
-        }
-    }
-    // Query global lessons matching tags
-    if (results.length < maxCount && tags.length > 0) {
-        const globalPath = path.join(memoryDir, "long-term", "lessons", "global.json");
-        const globalLessons = (await readJsonFileAsync(globalPath, z.array(LessonEntrySchema))) ?? [];
-        const matching = globalLessons.filter((l) => !seen.has(l.lesson_id) &&
-            l.status === "active" &&
-            tags.some((t) => l.relevance_tags.includes(t)));
-        // Sort by extracted_at descending (most recent first)
-        matching.sort((a, b) => new Date(b.extracted_at).getTime() -
-            new Date(a.extracted_at).getTime());
-        for (const l of matching) {
-            if (results.length >= maxCount)
-                break;
-            results.push(l);
-            seen.add(l.lesson_id);
-        }
-    }
-    return results;
-}
-export async function queryCrossGoalLessons(memoryDir, tags, dimensions, excludeGoalId, maxCount) {
-    const results = [];
-    const seen = new Set();
-    // Query global lessons (which include all goals)
-    const globalPath = path.join(memoryDir, "long-term", "lessons", "global.json");
-    const globalLessons = (await readJsonFileAsync(globalPath, z.array(LessonEntrySchema))) ?? [];
-    // Filter to lessons from other goals that match tags or dimensions
-    const crossGoalLessons = globalLessons.filter((l) => l.goal_id !== excludeGoalId &&
-        l.status === "active" &&
-        (tags.some((t) => l.relevance_tags.includes(t)) ||
-            dimensions.some((d) => l.relevance_tags.includes(d))));
-    // Sort by recency
-    crossGoalLessons.sort((a, b) => new Date(b.extracted_at).getTime() - new Date(a.extracted_at).getTime());
-    for (const l of crossGoalLessons) {
-        if (results.length >= maxCount)
-            break;
-        if (!seen.has(l.lesson_id)) {
-            results.push(l);
-            seen.add(l.lesson_id);
-        }
-    }
-    return results;
-}
-//# sourceMappingURL=memory-query.js.map

package/dist/knowledge/memory/memory-query.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-query.js","sourceRoot":"","sources":["../../../src/knowledge/memory/memory-query.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAEpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAE5D,uBAAuB;AAEvB,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,SAAiB,EACjB,IAAc,EACd,UAAoB,EACpB,QAAgB;IAEhB,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,6BAA6B;IAC7B,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CACzB,SAAS,EACT,WAAW,EACX,SAAS,EACT,cAAc,EACd,GAAG,GAAG,OAAO,CACd,CAAC;QACF,MAAM,OAAO,GACX,CAAC,MAAM,iBAAiB,CAAgB,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IACE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;gBACtB,CAAC,CAAC,MAAM,KAAK,QAAQ;gBACrB,OAAO,CAAC,MAAM,GAAG,QAAQ,EACzB,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,IAAI,OAAO,CAAC,MAAM,GAAG,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAC1B,SAAS,EACT,WAAW,EACX,SAAS,EACT,aAAa,CACd,CAAC;QACF,MAAM,aAAa,GACjB,CAAC,MAAM,iBAAiB,CAAgB,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzF,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YACtB,CAAC,CAAC,MAAM,KAAK,QAAQ;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CACjD,CAAC;QACF,sDAAsD;QACtD,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE;YAClC,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CACrC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;gBAAE,MAAM;YACtC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,SAAiB,EACjB,IAAc,EACd,UAAoB,EACpB,aAAqB,EACrB,QAAgB;IAEhB,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,iDAAiD;IACjD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAC1B,SAAS,EACT,WAAW,EACX,SAAS,EACT,aAAa,CACd,CAAC;IACF,MAAM,aAAa,GACjB,CAAC,MAAM,iBAAiB,CAAgB,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEzF,mEAAmE;IACnE,MAAM,gBAAgB,GAAG,aAAa,CAAC,MAAM,CAC3C,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,OAAO,KAAK,aAAa;QAC3B,CAAC,CAAC,MAAM,KAAK,QAAQ;QACrB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC7C,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAC1D,CAAC;IAEF,kBAAkB;IAClB,gBAAgB,CAAC,IAAI,CACnB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAC1E,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;QACjC,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;YAAE,MAAM;QACtC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/knowledge/memory/memory-selection.d.ts

@@ -1,73 +0,0 @@
-import type { VectorIndex } from "../vector-index.js";
-import type { ShortTermEntry, LessonEntry } from "../../types/memory-lifecycle.js";
-import type { IDriveScorer } from "../drive-score-adapter.js";
-export { getCompressionDelay, getDeadlineBonus } from "./memory-tier.js";
-export interface MemorySelectionDeps {
-    memoryDir: string;
-    vectorIndex?: VectorIndex;
-    driveScorer?: IDriveScorer;
-}
-/**
- * Compute a relevance score for a short-term entry given a context.
- *
- * Score = tag_match_ratio * drive_weight * freshness_factor * (0.7 + 0.3 * importance_factor)
- *   - tag_match_ratio     = matching tags / total unique tags (0 if no tags)
- *   - drive_weight        = DriveScorer dissatisfaction score for first matching
- *                           dimension (1.0 if no DriveScorer or no dimensions)
- *   - freshness_factor    = Math.exp(-daysSinceCreation / 30)
- *   - importance_factor   = Math.log2(1 + accessCount) / Math.log2(11)
- *                           (0 accesses → 0, 10 accesses → 1.0; undefined → multiplier=1.0 for backward compat)
- */
-export declare function relevanceScore(deps: Pick<MemorySelectionDeps, "driveScorer">, entry: ShortTermEntry, context: {
-    goalId: string;
-    dimensions: string[];
-    tags: string[];
-}, accessCount?: number): number;
-export interface SelectionContext {
-    maxEntries?: number;
-    activeGoalIds?: string[];
-    completedGoalIds?: string[];
-    satisfiedDimensions?: string[];
-    highDissatisfactionDimensions?: string[];
-    maxDissatisfaction?: number;
-    useLLMClassification?: boolean;
-    llmClient?: {
-        generateStructured: (...args: any[]) => Promise<any>;
-    };
-}
-/**
- * Select relevant entries for working memory.
- * Phase 1: tag exact-match + recency sort.
- * Phase 2 (5.2b): semantic search fallback via VectorIndex if tag results are insufficient.
- * Phase 2 (5.2c): includes cross-goal lessons (up to 25% of budget).
- *
- * Tier-aware mode (optional): when activeGoalIds / completedGoalIds are provided,
- * classify entries into tiers and guarantee core-tier entries are included first.
- */
-export declare function selectForWorkingMemory(deps: MemorySelectionDeps, goalId: string, dimensions: string[], tags: string[], ctx?: SelectionContext): Promise<{
-    shortTerm: ShortTermEntry[];
-    lessons: LessonEntry[];
-}>;
-/**
- * Search long-term lessons across ALL goals using semantic search.
- * Falls back to tag-based global search if VectorIndex is unavailable.
- *
- * @param query  - natural language search query
- * @param topK   - maximum number of lessons to return (default 5)
- */
-export declare function searchCrossGoalLessons(deps: Pick<MemorySelectionDeps, "memoryDir" | "vectorIndex">, query: string, topK?: number): Promise<LessonEntry[]>;
-/**
- * Semantic variant of selectForWorkingMemory.
- * Uses VectorIndex.search() to find semantically relevant entries.
- * Applies deadline bonus to relevance scores.
- * Falls back to existing sync method if no vectorIndex available.
- */
-export declare function selectForWorkingMemorySemantic(deps: MemorySelectionDeps, goalId: string, query: string, dimensions: string[], tags: string[], maxEntries?: number, driveScores?: Array<{
-    dimension: string;
-    dissatisfaction: number;
-    deadline: number;
-}>): Promise<{
-    shortTerm: ShortTermEntry[];
-    lessons: LessonEntry[];
-}>;
-//# sourceMappingURL=memory-selection.d.ts.map

package/dist/knowledge/memory/memory-selection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-selection.d.ts","sourceRoot":"","sources":["../../../src/knowledge/memory/memory-selection.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAItD,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACZ,MAAM,iCAAiC,CAAC;AACzC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAO9D,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAIzE,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,WAAW,CAAC,EAAE,YAAY,CAAC;CAC5B;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,IAAI,CAAC,mBAAmB,EAAE,aAAa,CAAC,EAC9C,KAAK,EAAE,cAAc,EACrB,OAAO,EAAE;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAA;CAAE,EACjE,WAAW,CAAC,EAAE,MAAM,GACnB,MAAM,CAmCR;AAID,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC/B,6BAA6B,CAAC,EAAE,MAAM,EAAE,CAAC;IACzC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,SAAS,CAAC,EAAE;QAAE,kBAAkB,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;KAAE,CAAC;CACtE;AAID;;;;;;;;GAQG;AACH,wBAAsB,sBAAsB,CAC1C,IAAI,EAAE,mBAAmB,EACzB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAAE,EACpB,IAAI,EAAE,MAAM,EAAE,EACd,GAAG,GAAE,gBAAqB,GACzB,OAAO,CAAC;IAAE,SAAS,EAAE,cAAc,EAAE,CAAC;IAAC,OAAO,EAAE,WAAW,EAAE,CAAA;CAAE,CAAC,CAoNlE;AAuBD;;;;;;GAMG;AACH,wBAAsB,sBAAsB,CAC1C,IAAI,EAAE,IAAI,CAAC,mBAAmB,EAAE,WAAW,GAAG,aAAa,CAAC,EAC5D,KAAK,EAAE,MAAM,EACb,IAAI,SAAI,GACP,OAAO,CAAC,WAAW,EAAE,CAAC,CAsExB;AAID;;;;;GAKG;AACH,wBAAsB,8BAA8B,CAClD,IAAI,EAAE,mBAAmB,EACzB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,EAAE,EACpB,IAAI,EAAE,MAAM,EAAE,EACd,UAAU,GAAE,MAAW,EACvB,WAAW,CAAC,EAAE,KAAK,CAAC;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,GACpF,OAAO,CAAC;IAAE,SAAS,EAAE,cAAc,EAAE,CAAC;IAAC,OAAO,EAAE,WAAW,EAAE,CAAA;CAAE,CAAC,CA4ElE"}

package/dist/knowledge/memory/memory-selection.js

@@ -1,328 +0,0 @@
-import * as path from "node:path";
-import { z } from "zod";
-import { ShortTermEntrySchema, } from "../../types/memory-lifecycle.js";
-import { readJsonFileAsync, } from "./memory-persistence.js";
-import { loadIndex, touchIndexEntry } from "./memory-index.js";
-import { queryLessons, queryCrossGoalLessons } from "./memory-query.js";
-import { classifyTier, sortByTier, computeDynamicBudget, llmClassifyTier, getDeadlineBonus } from "./memory-tier.js";
-export { getCompressionDelay, getDeadlineBonus } from "./memory-tier.js";
-// ─── relevanceScore ───
-/**
- * Compute a relevance score for a short-term entry given a context.
- *
- * Score = tag_match_ratio * drive_weight * freshness_factor * (0.7 + 0.3 * importance_factor)
- *   - tag_match_ratio     = matching tags / total unique tags (0 if no tags)
- *   - drive_weight        = DriveScorer dissatisfaction score for first matching
- *                           dimension (1.0 if no DriveScorer or no dimensions)
- *   - freshness_factor    = Math.exp(-daysSinceCreation / 30)
- *   - importance_factor   = Math.log2(1 + accessCount) / Math.log2(11)
- *                           (0 accesses → 0, 10 accesses → 1.0; undefined → multiplier=1.0 for backward compat)
- */
-export function relevanceScore(deps, entry, context, accessCount) {
-    // 1. Tag match ratio
-    const allTags = new Set([...entry.tags, ...context.tags]);
-    const matchingTags = entry.tags.filter((t) => context.tags.includes(t)).length;
-    const tagMatchRatio = allTags.size > 0 ? matchingTags / allTags.size : 0;
-    // 2. Drive weight
-    let driveWeight = 1.0;
-    if (deps.driveScorer) {
-        // Use the first dimension that matches entry dimensions or context dimensions
-        const relevantDimensions = entry.dimensions.length > 0
-            ? entry.dimensions
-            : context.dimensions;
-        if (relevantDimensions.length > 0) {
-            const dim = relevantDimensions[0];
-            driveWeight = deps.driveScorer.getDissatisfactionScore(dim);
-            // Clamp to [0.1, 2]: floor at 0.1 so satisfied dimensions don't zero out tag-perfect matches
-            driveWeight = Math.max(0.1, driveWeight);
-        }
-    }
-    // 3. Freshness factor (exponential decay over 30 days)
-    const createdAt = new Date(entry.timestamp).getTime();
-    const daysSinceCreation = (Date.now() - createdAt) / (1000 * 60 * 60 * 24);
-    const freshnessFactor = Math.exp(-daysSinceCreation / 30);
-    // 4. Importance factor based on access_count (proxy for usage importance)
-    //    0 accesses → 0, 10 accesses → 1.0; undefined → multiplier = 1.0 (backward compat)
-    //    When accessCount is provided: multiplier = 0.7 + 0.3 * importanceFactor
-    //    When accessCount is undefined: multiplier = 1.0 (preserves old formula exactly)
-    const importanceMultiplier = accessCount === undefined
-        ? 1.0
-        : 0.7 + 0.3 * (Math.log2(1 + accessCount) / Math.log2(11));
-    return tagMatchRatio * driveWeight * freshnessFactor * importanceMultiplier;
-}
-// ─── selectForWorkingMemory ───
-/**
- * Select relevant entries for working memory.
- * Phase 1: tag exact-match + recency sort.
- * Phase 2 (5.2b): semantic search fallback via VectorIndex if tag results are insufficient.
- * Phase 2 (5.2c): includes cross-goal lessons (up to 25% of budget).
- *
- * Tier-aware mode (optional): when activeGoalIds / completedGoalIds are provided,
- * classify entries into tiers and guarantee core-tier entries are included first.
- */
-export async function selectForWorkingMemory(deps, goalId, dimensions, tags, ctx = {}) {
-    const { maxEntries = 10, activeGoalIds, completedGoalIds, satisfiedDimensions, highDissatisfactionDimensions, maxDissatisfaction, useLLMClassification, llmClient, } = ctx;
-    // 1. Tag-based query: short-term entries for this goal matching dimensions/tags
-    const stIndex = await loadIndex(deps.memoryDir, "short-term");
-    let matchingIndexEntries = stIndex.entries.filter((ie) => ie.goal_id === goalId &&
-        (dimensions.some((d) => ie.dimensions.includes(d)) ||
-            tags.some((t) => ie.tags.includes(t))));
-    // Sort by composite score (recency + importance + relevance) descending
-    // before tier re-ordering. Entries without driveScorer fall back to freshness * importance.
-    const context = { goalId, dimensions, tags };
-    matchingIndexEntries.sort((a, b) => {
-        // Build a minimal ShortTermEntry-like object from the index entry for scoring
-        const entryA = { tags: a.tags, dimensions: a.dimensions, timestamp: a.last_accessed };
-        const entryB = { tags: b.tags, dimensions: b.dimensions, timestamp: b.last_accessed };
-        return (relevanceScore(deps, entryB, context, b.access_count) -
-            relevanceScore(deps, entryA, context, a.access_count));
-    });
-    // Tier-aware mode: classify, update memory_tier, then sort by tier
-    if (activeGoalIds !== undefined) {
-        const resolvedCompleted = completedGoalIds ?? [];
-        for (const ie of matchingIndexEntries) {
-            ie.memory_tier = classifyTier(ie, activeGoalIds, resolvedCompleted, satisfiedDimensions, highDissatisfactionDimensions);
-        }
-        // Sub-stage 2.5: LLM classification override (after rule-based)
-        if (useLLMClassification && llmClient) {
-            const llmTiers = await llmClassifyTier(matchingIndexEntries, { goalId, dimensions, gap: maxDissatisfaction }, llmClient);
-            for (const ie of matchingIndexEntries) {
-                const llmTier = llmTiers.get(ie.entry_id);
-                if (llmTier !== undefined) {
-                    ie.memory_tier = llmTier;
-                }
-            }
-        }
-        matchingIndexEntries = sortByTier(matchingIndexEntries);
-    }
-    // Sub-stage 2.3: dynamic budget determines core guarantee ratio
-    // Budget filtering is applied to the loaded entries (not index), so small sets still work
-    const dynamicBudget = activeGoalIds !== undefined
-        ? computeDynamicBudget(maxDissatisfaction ?? 0)
-        : { core: 1.0, recall: 0.0, archival: 0.0 };
-    const coreGuarantee = activeGoalIds !== undefined
-        ? Math.ceil(maxEntries * dynamicBudget.core)
-        : maxEntries;
-    const shortTermEntries = [];
-    const seenEntryIds = new Set();
-    // Pass 1: fill core-guaranteed slots
-    if (activeGoalIds !== undefined) {
-        const coreEntries = matchingIndexEntries.filter((ie) => ie.memory_tier === "core");
-        for (const idxEntry of coreEntries) {
-            if (shortTermEntries.length >= coreGuarantee)
-                break;
-            if (seenEntryIds.has(idxEntry.entry_id))
-                continue;
-            const found = await loadShortTermEntry(deps, idxEntry);
-            if (found) {
-                shortTermEntries.push(found);
-                seenEntryIds.add(idxEntry.entry_id);
-                void touchIndexEntry(deps.memoryDir, "short-term", idxEntry.id);
-            }
-        }
-    }
-    // Pass 2: fill remaining budget (recall first, then archival if space)
-    const recallCandidates = activeGoalIds !== undefined
-        ? matchingIndexEntries.filter((ie) => ie.memory_tier === "recall")
-        : matchingIndexEntries;
-    for (const idxEntry of recallCandidates) {
-        if (shortTermEntries.length >= maxEntries)
-            break;
-        if (seenEntryIds.has(idxEntry.entry_id))
-            continue;
-        const found = await loadShortTermEntry(deps, idxEntry);
-        if (found) {
-            shortTermEntries.push(found);
-            seenEntryIds.add(idxEntry.entry_id);
-            void touchIndexEntry(deps.memoryDir, "short-term", idxEntry.id);
-        }
-    }
-    // Pass 2b: archival entries — use semantic search if VectorIndex available
-    if (activeGoalIds !== undefined && shortTermEntries.length < maxEntries) {
-        const archivalCandidates = matchingIndexEntries.filter((ie) => ie.memory_tier === "archival" && !seenEntryIds.has(ie.entry_id));
-        if (archivalCandidates.length > 0) {
-            let orderedArchival = archivalCandidates;
-            if (deps.vectorIndex) {
-                // Derive query from dimensions and tags for semantic ranking
-                const query = [...dimensions, ...tags].join(" ");
-                const archivalLimit = maxEntries - shortTermEntries.length;
-                try {
-                    const metaResults = await deps.vectorIndex.searchMetadata(query, archivalLimit * 2);
-                    const metaIds = new Set(metaResults.map((r) => r.id));
-                    // Put semantically matched entries first, then remaining by recency
-                    const semantic = archivalCandidates.filter((ie) => metaIds.has(ie.entry_id));
-                    const rest = archivalCandidates.filter((ie) => !metaIds.has(ie.entry_id));
-                    orderedArchival = [...semantic, ...rest];
-                }
-                catch {
-                    // Graceful fallback to existing order on error
-                }
-            }
-            for (const idxEntry of orderedArchival) {
-                if (shortTermEntries.length >= maxEntries)
-                    break;
-                if (seenEntryIds.has(idxEntry.entry_id))
-                    continue;
-                const found = await loadShortTermEntry(deps, idxEntry);
-                if (found) {
-                    shortTermEntries.push(found);
-                    seenEntryIds.add(idxEntry.entry_id);
-                    void touchIndexEntry(deps.memoryDir, "short-term", idxEntry.id);
-                }
-            }
-        }
-    }
-    else if (activeGoalIds === undefined) {
-        // Non-tier-aware: already handled by recallCandidates = matchingIndexEntries above
-    }
-    // Phase 2 (5.2b): If results are fewer than needed and VectorIndex available, do sync lookup
-    // Note: selectForWorkingMemorySemantic (async) handles full semantic search.
-    // Here we merge from the index directly.
-    if (shortTermEntries.length < maxEntries && deps.vectorIndex) {
-        // Pull all goal entries from the short-term index (not yet in result set) as semantic candidates
-        const remaining = stIndex.entries.filter((ie) => ie.goal_id === goalId && !seenEntryIds.has(ie.entry_id));
-        // Sort by access count + recency as a proxy
-        remaining.sort((a, b) => b.access_count - a.access_count ||
-            new Date(b.last_accessed).getTime() - new Date(a.last_accessed).getTime());
-        for (const idxEntry of remaining) {
-            if (shortTermEntries.length >= maxEntries)
-                break;
-            if (seenEntryIds.has(idxEntry.entry_id))
-                continue;
-            const found = await loadShortTermEntry(deps, idxEntry);
-            if (found) {
-                shortTermEntries.push(found);
-                seenEntryIds.add(idxEntry.entry_id);
-            }
-        }
-        // Re-sort by relevanceScore if driveScorer is available
-        if (deps.driveScorer) {
-            shortTermEntries.sort((a, b) => relevanceScore(deps, b, { goalId, dimensions, tags }) -
-                relevanceScore(deps, a, { goalId, dimensions, tags }));
-        }
-    }
-    // 2. Query long-term lessons matching tags (cross-goal OK for lessons)
-    const goalLessons = await queryLessons(deps.memoryDir, tags, dimensions, Math.ceil(maxEntries * 0.75));
-    // Phase 2 (5.2c): Include cross-goal lessons (up to 25% of budget)
-    const crossGoalBudget = Math.max(1, Math.floor(maxEntries * 0.25));
-    const crossGoalLessonList = await queryCrossGoalLessons(deps.memoryDir, tags, dimensions, goalId, crossGoalBudget);
-    // Deduplicate cross-goal lessons against goal lessons
-    const seenLessonIds = new Set(goalLessons.map((l) => l.lesson_id));
-    const dedupedCrossGoal = crossGoalLessonList.filter((l) => !seenLessonIds.has(l.lesson_id));
-    const lessons = [...goalLessons, ...dedupedCrossGoal];
-    return { shortTerm: shortTermEntries, lessons };
-}
-// ─── Internal helper ───
-async function loadShortTermEntry(deps, idxEntry) {
-    const dataFilePath = path.join(deps.memoryDir, "short-term", idxEntry.data_file);
-    const allEntries = (await readJsonFileAsync(dataFilePath, z.array(ShortTermEntrySchema))) ?? [];
-    return allEntries.find((e) => e.id === idxEntry.entry_id);
-}
-// ─── searchCrossGoalLessons ───
-/**
- * Search long-term lessons across ALL goals using semantic search.
- * Falls back to tag-based global search if VectorIndex is unavailable.
- *
- * @param query  - natural language search query
- * @param topK   - maximum number of lessons to return (default 5)
- */
-export async function searchCrossGoalLessons(deps, query, topK = 5) {
-    const { LessonEntrySchema } = await import("../../types/memory-lifecycle.js");
-    if (deps.vectorIndex) {
-        // Semantic search in vector index
-        const results = await deps.vectorIndex.search(query, topK * 2, 0.0);
-        // Filter to lesson entries (metadata.is_lesson === true)
-        const lessonResults = results.filter((r) => r.metadata.is_lesson === true);
-        // Load actual lessons from global file
-        const globalPath = path.join(deps.memoryDir, "long-term", "lessons", "global.json");
-        const globalLessons = (await readJsonFileAsync(globalPath, z.array(LessonEntrySchema))) ?? [];
-        const lessonMap = new Map(globalLessons.map((l) => [l.lesson_id, l]));
-        const matched = [];
-        for (const r of lessonResults) {
-            const lesson = lessonMap.get(r.id);
-            if (lesson && lesson.status === "active") {
-                matched.push(lesson);
-                if (matched.length >= topK)
-                    break;
-            }
-        }
-        // If we got enough results from semantic search, return them
-        if (matched.length > 0) {
-            return matched;
-        }
-    }
-    // Fallback: tag-based global search
-    const { LessonEntrySchema: LessonSchema } = await import("../../types/memory-lifecycle.js");
-    const globalPath = path.join(deps.memoryDir, "long-term", "lessons", "global.json");
-    const globalLessons = (await readJsonFileAsync(globalPath, z.array(LessonSchema))) ?? [];
-    // Simple text match on lesson content
-    const queryLower = query.toLowerCase();
-    const matching = globalLessons.filter((l) => l.status === "active" &&
-        (l.lesson.toLowerCase().includes(queryLower) ||
-            l.context.toLowerCase().includes(queryLower) ||
-            l.relevance_tags.some((t) => t.toLowerCase().includes(queryLower))));
-    // Sort by recency
-    matching.sort((a, b) => new Date(b.extracted_at).getTime() - new Date(a.extracted_at).getTime());
-    return matching.slice(0, topK);
-}
-// ─── selectForWorkingMemorySemantic ───
-/**
- * Semantic variant of selectForWorkingMemory.
- * Uses VectorIndex.search() to find semantically relevant entries.
- * Applies deadline bonus to relevance scores.
- * Falls back to existing sync method if no vectorIndex available.
- */
-export async function selectForWorkingMemorySemantic(deps, goalId, query, dimensions, tags, maxEntries = 10, driveScores) {
-    // Fall back to sync method if no vectorIndex
-    if (!deps.vectorIndex) {
-        return selectForWorkingMemory(deps, goalId, dimensions, tags, { maxEntries });
-    }
-    // Compute deadline bonuses per dimension
-    const deadlineBonus = driveScores
-        ? getDeadlineBonus(driveScores.map((d) => ({ dimension: d.dimension, deadline: d.deadline })))
-        : new Map();
-    const maxBonus = deadlineBonus.size > 0
-        ? Math.max(...Array.from(deadlineBonus.values()))
-        : 0;
-    // Search vector index for semantically similar entries
-    const searchResults = await deps.vectorIndex.search(query, maxEntries * 2, 0.0);
-    // Filter to this goal's entries
-    const goalResults = searchResults.filter((r) => r.metadata.goal_id === goalId);
-    // Load short-term index for recency data
-    const stIndex = await loadIndex(deps.memoryDir, "short-term");
-    const indexEntryMap = new Map(stIndex.entries.map((ie) => [ie.entry_id, ie]));
-    // Score entries by combining semantic score + recency + deadline bonus
-    const now = Date.now();
-    const scoredEntries = [];
-    const seenEntryIds = new Set();
-    for (const result of goalResults) {
-        if (seenEntryIds.has(result.id))
-            continue;
-        const idxEntry = indexEntryMap.get(result.id);
-        if (!idxEntry)
-            continue;
-        // Compute recency score: normalize last_accessed relative to now
-        const ageMs = now - new Date(idxEntry.last_accessed).getTime();
-        const ageHours = ageMs / (1000 * 60 * 60);
-        const recencyScore = Math.max(0, 1 - ageHours / (24 * 7)); // decay over 1 week
-        const combinedScore = result.similarity + recencyScore * 0.3 + maxBonus;
-        // Load the actual entry from disk
-        const dataFilePath = path.join(deps.memoryDir, "short-term", idxEntry.data_file);
-        const allEntries = (await readJsonFileAsync(dataFilePath, z.array(ShortTermEntrySchema))) ?? [];
-        const found = allEntries.find((e) => e.id === idxEntry.entry_id);
-        if (found) {
-            scoredEntries.push({ entry: found, combinedScore });
-            seenEntryIds.add(result.id);
-            touchIndexEntry(deps.memoryDir, "short-term", idxEntry.id);
-        }
-    }
-    // Sort by combined score descending and take top maxEntries
-    scoredEntries.sort((a, b) => b.combinedScore - a.combinedScore);
-    const shortTermEntries = scoredEntries
-        .slice(0, maxEntries)
-        .map((s) => s.entry);
-    // Still use tag/dimension-based lesson query for long-term
-    const lessons = await queryLessons(deps.memoryDir, tags, dimensions, maxEntries);
-    return { shortTerm: shortTermEntries, lessons };
-}
-//# sourceMappingURL=memory-selection.js.map

package/dist/knowledge/memory/memory-selection.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-selection.js","sourceRoot":"","sources":["../../../src/knowledge/memory/memory-selection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EACL,oBAAoB,GACrB,MAAM,iCAAiC,CAAC;AAMzC,OAAO,EACL,iBAAiB,GAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,oBAAoB,EAAsB,eAAe,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACzI,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAUzE,yBAAyB;AAEzB;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA8C,EAC9C,KAAqB,EACrB,OAAiE,EACjE,WAAoB;IAEpB,qBAAqB;IACrB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/E,MAAM,aAAa,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,kBAAkB;IAClB,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,8EAA8E;QAC9E,MAAM,kBAAkB,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;YACpD,CAAC,CAAC,KAAK,CAAC,UAAU;YAClB,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;QACvB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,kBAAkB,CAAC,CAAC,CAAE,CAAC;YACnC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC;YAC5D,6FAA6F;YAC7F,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,MAAM,iBAAiB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3E,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,iBAAiB,GAAG,EAAE,CAAC,CAAC;IAE1D,0EAA0E;IAC1E,uFAAuF;IACvF,6EAA6E;IAC7E,qFAAqF;IACrF,MAAM,oBAAoB,GAAG,WAAW,KAAK,SAAS;QACpD,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE7D,OAAO,aAAa,GAAG,WAAW,GAAG,eAAe,GAAG,oBAAoB,CAAC;AAC9E,CAAC;AAeD,iCAAiC;AAEjC;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,IAAyB,EACzB,MAAc,EACd,UAAoB,EACpB,IAAc,EACd,MAAwB,EAAE;IAE1B,MAAM,EACJ,UAAU,GAAG,EAAE,EACf,aAAa,EACb,gBAAgB,EAChB,mBAAmB,EACnB,6BAA6B,EAC7B,kBAAkB,EAClB,oBAAoB,EACpB,SAAS,GACV,GAAG,GAAG,CAAC;IACR,gFAAgF;IAChF,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAC9D,IAAI,oBAAoB,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAC/C,CAAC,EAAE,EAAE,EAAE,CACL,EAAE,CAAC,OAAO,KAAK,MAAM;QACrB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3C,CAAC;IAEF,wEAAwE;IACxE,4FAA4F;IAC5F,MAAM,OAAO,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;IAC7C,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjC,8EAA8E;QAC9E,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,aAAa,EAAoB,CAAC;QACxG,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC,aAAa,EAAoB,CAAC;QACxG,OAAO,CACL,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC;YACrD,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CACtD,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,mEAAmE;IACnE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,iBAAiB,GAAG,gBAAgB,IAAI,EAAE,CAAC;QACjD,KAAK,MAAM,EAAE,IAAI,oBAAoB,EAAE,CAAC;YACtC,EAAE,CAAC,WAAW,GAAG,YAAY,CAC3B,EAAE,EACF,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,6BAA6B,CAC9B,CAAC;QACJ,CAAC;QAED,gEAAgE;QAChE,IAAI,oBAAoB,IAAI,SAAS,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,MAAM,eAAe,CACpC,oBAAoB,EACpB,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,kBAAkB,EAAE,EAC/C,SAAS,CACV,CAAC;YACF,KAAK,MAAM,EAAE,IAAI,oBAAoB,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;gBAC1C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC1B,EAAE,CAAC,WAAW,GAAG,OAAO,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,oBAAoB,GAAG,UAAU,CAAC,oBAAoB,CAAC,CAAC;IAC1D,CAAC;IAED,gEAAgE;IAChE,0FAA0F;IAC1F,MAAM,aAAa,GAAG,aAAa,KAAK,SAAS;QAC/C,CAAC,CAAC,oBAAoB,CAAC,kBAAkB,IAAI,CAAC,CAAC;QAC/C,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;IAE9C,MAAM,aAAa,GAAG,aAAa,KAAK,SAAS;QAC/C,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC;QAC5C,CAAC,CAAC,UAAU,CAAC;IAEf,MAAM,gBAAgB,GAAqB,EAAE,CAAC;IAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,qCAAqC;IACrC,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,CAC7C,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,KAAK,MAAM,CAClC,CAAC;QACF,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;YACnC,IAAI,gBAAgB,CAAC,MAAM,IAAI,aAAa;gBAAE,MAAM;YACpD,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAElD,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACvD,IAAI,KAAK,EAAE,CAAC;gBACV,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBACpC,KAAK,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,aAAa,KAAK,SAAS;QAClD,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,KAAK,QAAQ,CAAC;QAClE,CAAC,CAAC,oBAAoB,CAAC;IAEzB,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,IAAI,gBAAgB,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;QACjD,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,SAAS;QAElD,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACvD,IAAI,KAAK,EAAE,CAAC;YACV,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACpC,KAAK,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,IAAI,aAAa,KAAK,SAAS,IAAI,gBAAgB,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;QACxE,MAAM,kBAAkB,GAAG,oBAAoB,CAAC,MAAM,CACpD,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,WAAW,KAAK,UAAU,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CACxE,CAAC;QAEF,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,eAAe,GAAG,kBAAkB,CAAC;YAEzC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,6DAA6D;gBAC7D,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjD,MAAM,aAAa,GAAG,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC;gBAC3D,IAAI,CAAC;oBACH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;oBACpF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACtD,oEAAoE;oBACpE,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAC7E,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAC1E,eAAe,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC;gBAC3C,CAAC;gBAAC,MAAM,CAAC;oBACP,+CAA+C;gBACjD,CAAC;YACH,CAAC;YAED,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;gBACvC,IAAI,gBAAgB,CAAC,MAAM,IAAI,UAAU;oBAAE,MAAM;gBACjD,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBAElD,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACvD,IAAI,KAAK,EAAE,CAAC;oBACV,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC7B,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBACpC,KAAK,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;QACvC,mFAAmF;IACrF,CAAC;IAED,6FAA6F;IAC7F,6EAA6E;IAC7E,yCAAyC;IACzC,IAAI,gBAAgB,CAAC,MAAM,GAAG,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAC7D,iGAAiG;QACjG,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CACtC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAChE,CAAC;QAEF,4CAA4C;QAC5C,SAAS,CAAC,IAAI,CACZ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY;YAC/B,IAAI,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE,CAC5E,CAAC;QAEF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,gBAAgB,CAAC,MAAM,IAAI,UAAU;gBAAE,MAAM;YACjD,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAElD,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACvD,IAAI,KAAK,EAAE,CAAC;gBACV,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,gBAAgB,CAAC,IAAI,CACnB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;gBACrD,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CACxD,CAAC;QACJ,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,MAAM,WAAW,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC;IAEvG,mEAAmE;IACnE,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC;IACnE,MAAM,mBAAmB,GAAG,MAAM,qBAAqB,CACrD,IAAI,CAAC,SAAS,EACd,IAAI,EACJ,UAAU,EACV,MAAM,EACN,eAAe,CAChB,CAAC;IAEF,sDAAsD;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACnE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CACvC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,gBAAgB,CAAC,CAAC;IAEtD,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC;AAED,0BAA0B;AAE1B,KAAK,UAAU,kBAAkB,CAC/B,IAA4C,EAC5C,QAAoE;IAEpE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAC5B,IAAI,CAAC,SAAS,EACd,YAAY,EACZ,QAAQ,CAAC,SAAS,CACnB,CAAC;IACF,MAAM,UAAU,GACd,CAAC,MAAM,iBAAiB,CACtB,YAAY,EACZ,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC,IAAI,EAAE,CAAC;IACX,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAC5D,CAAC;AAED,iCAAiC;AAEjC;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,IAA4D,EAC5D,KAAa,EACb,IAAI,GAAG,CAAC;IAER,MAAM,EAAE,iBAAiB,EAAE,GAAG,MAAM,MAAM,CAAC,iCAAiC,CAAC,CAAC;IAE9E,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,kCAAkC;QAClC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAEpE,yDAAyD;QACzD,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;QAE3E,uCAAuC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAC1B,IAAI,CAAC,SAAS,EACd,WAAW,EACX,SAAS,EACT,aAAa,CACd,CAAC;QACF,MAAM,aAAa,GACjB,CAAC,MAAM,iBAAiB,CACtB,UAAU,EACV,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAC3B,CAAC,IAAI,EAAE,CAAC;QAEX,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACzC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI;oBAAE,MAAM;YACpC,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,MAAM,EAAE,iBAAiB,EAAE,YAAY,EAAE,GAAG,MAAM,MAAM,CAAC,iCAAiC,CAAC,CAAC;IAC5F,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAC1B,IAAI,CAAC,SAAS,EACd,WAAW,EACX,SAAS,EACT,aAAa,CACd,CAAC;IACF,MAAM,aAAa,GACjB,CAAC,MAAM,iBAAiB,CACtB,UAAU,EACV,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CACtB,CAAC,IAAI,EAAE,CAAC;IAEX,sCAAsC;IACtC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,QAAQ;QACrB,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC1C,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC5C,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CACxE,CAAC;IAEF,kBAAkB;IAClB,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAC1E,CAAC;IAEF,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACjC,CAAC;AAED,yCAAyC;AAEzC;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAClD,IAAyB,EACzB,MAAc,EACd,KAAa,EACb,UAAoB,EACpB,IAAc,EACd,aAAqB,EAAE,EACvB,WAAqF;IAErF,6CAA6C;IAC7C,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACtB,OAAO,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAChF,CAAC;IAED,yCAAyC;IACzC,MAAM,aAAa,GAAG,WAAW;QAC/B,CAAC,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC9F,CAAC,CAAC,IAAI,GAAG,EAAkB,CAAC;IAE9B,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,GAAG,CAAC;QACrC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC,CAAC;IAEN,uDAAuD;IACvD,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAEhF,gCAAgC;IAChC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,KAAK,MAAM,CACrC,CAAC;IAEF,yCAAyC;IACzC,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAC9D,MAAM,aAAa,GAAG,IAAI,GAAG,CAC3B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAC/C,CAAC;IAEF,uEAAuE;IACvE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,aAAa,GAA4D,EAAE,CAAC;IAClF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAAE,SAAS;QAE1C,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,iEAAiE;QACjE,MAAM,KAAK,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE,CAAC;QAC/D,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB;QAE/E,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,GAAG,YAAY,GAAG,GAAG,GAAG,QAAQ,CAAC;QAExE,kCAAkC;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAC5B,IAAI,CAAC,SAAS,EACd,YAAY,EACZ,QAAQ,CAAC,SAAS,CACnB,CAAC;QACF,MAAM,UAAU,GACd,CAAC,MAAM,iBAAiB,CACtB,YAAY,EACZ,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAC9B,CAAC,IAAI,EAAE,CAAC;QACX,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACjE,IAAI,KAAK,EAAE,CAAC;YACV,aAAa,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;YACpD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IAChE,MAAM,gBAAgB,GAAG,aAAa;SACnC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;SACpB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvB,2DAA2D;IAC3D,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IAEjF,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC"}

package/dist/knowledge/memory/memory-stats.d.ts

@@ -1,7 +0,0 @@
-import type { ShortTermEntry, StatisticalSummary } from "../../types/memory-lifecycle.js";
-export declare function updateStatistics(memoryDir: string, goalId: string, entries: ShortTermEntry[]): Promise<void>;
-export declare function mergeTaskStats(existing: StatisticalSummary["task_stats"], incoming: StatisticalSummary["task_stats"]): StatisticalSummary["task_stats"];
-export declare function mergeDimStats(existing: StatisticalSummary["dimension_stats"], incoming: StatisticalSummary["dimension_stats"]): StatisticalSummary["dimension_stats"];
-export declare function computeTrend(values: number[]): "rising" | "falling" | "stable";
-export declare function computePeriod(entries: ShortTermEntry[]): string;
-//# sourceMappingURL=memory-stats.d.ts.map

package/dist/knowledge/memory/memory-stats.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-stats.d.ts","sourceRoot":"","sources":["../../../src/knowledge/memory/memory-stats.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,cAAc,EACd,kBAAkB,EACnB,MAAM,iCAAiC,CAAC;AAKzC,wBAAsB,gBAAgB,CACpC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,cAAc,EAAE,GACxB,OAAO,CAAC,IAAI,CAAC,CAkJf;AAED,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,kBAAkB,CAAC,YAAY,CAAC,EAC1C,QAAQ,EAAE,kBAAkB,CAAC,YAAY,CAAC,GACzC,kBAAkB,CAAC,YAAY,CAAC,CAuBlC;AAED,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,kBAAkB,CAAC,iBAAiB,CAAC,EAC/C,QAAQ,EAAE,kBAAkB,CAAC,iBAAiB,CAAC,GAC9C,kBAAkB,CAAC,iBAAiB,CAAC,CAMvC;AAED,wBAAgB,YAAY,CAC1B,MAAM,EAAE,MAAM,EAAE,GACf,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAWjC;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,cAAc,EAAE,GAAG,MAAM,CAM/D"}