@xopcai/xopc 0.0.25 → 0.0.27

package/dist/src/agent/memory/dreaming/rem-patterns.js

@@ -0,0 +1,286 @@
+import { createLogger } from "../../../utils/logger/index.js";
+import { init_logger } from "../../../utils/logger.js";
+import { DREAMING_DIR_RELATIVE, DREAMS_MD_FILENAME, MS_PER_DAY } from "./constants.js";
+import { isoDay } from "./utils.js";
+import { bumpEntryPhaseSignal, loadDreamingStore, saveDreamingStore } from "./short-term-store.js";
+import "./last-run.js";
+import path from "node:path";
+import fs from "node:fs/promises";
+//#region src/agent/memory/dreaming/rem-patterns.ts
+init_logger();
+const log = createLogger("Dreaming:REM");
+function resolveConfig(overrides) {
+	return {
+		enabled: overrides?.enabled === true,
+		cron: typeof overrides?.cron === "string" ? overrides.cron : "0 5 * * 0",
+		lookbackDays: Math.max(1, Math.floor(Number(overrides?.lookbackDays) || 7)),
+		limit: Math.max(0, Math.floor(Number(overrides?.limit) || 10)),
+		minPatternStrength: Math.max(0, Math.min(1, Number(overrides?.minPatternStrength) || .75))
+	};
+}
+/**
+* REM phase: cross-session pattern discovery.
+*
+* Scans the short-term store for entries that share query hashes or
+* appear across multiple daily files, then clusters them to identify
+* recurring themes/patterns. Bumps `remHits` on touched entries and
+* optionally writes a pattern summary to DREAMS.md.
+*
+* Runs weekly; expensive but insightful.
+*/
+async function runRemPatterns(params) {
+	const cfg = resolveConfig(params.config);
+	const now = params.now ?? /* @__PURE__ */ new Date();
+	const startedAt = now.toISOString();
+	const runId = `rem:${startedAt}:${process.pid}`;
+	const startMs = Date.now();
+	const nowMs = now.getTime();
+	if (!cfg.enabled) {
+		await writeLastRun(params.workspaceDir, {
+			runId,
+			startedAt,
+			cfg,
+			ok: true,
+			reason: "REM patterns disabled",
+			startMs,
+			rem: {
+				patternsDiscovered: 0,
+				entriesAnalyzed: 0
+			}
+		});
+		return {
+			ok: true,
+			reason: "REM patterns disabled",
+			patternsDiscovered: 0,
+			entriesAnalyzed: 0
+		};
+	}
+	try {
+		const { store } = await loadDreamingStore({ workspaceDir: params.workspaceDir });
+		const cutoffMs = nowMs - cfg.lookbackDays * MS_PER_DAY;
+		const recentEntries = Object.values(store.entries ?? {}).filter((entry) => {
+			if (!entry || typeof entry !== "object") return false;
+			if (!entry.lastRecalledAt) return false;
+			const lastMs = Date.parse(entry.lastRecalledAt);
+			return Number.isFinite(lastMs) && lastMs >= cutoffMs;
+		});
+		if (recentEntries.length < 2) {
+			await writeLastRun(params.workspaceDir, {
+				runId,
+				startedAt,
+				cfg,
+				ok: true,
+				reason: "not enough recent entries for pattern analysis",
+				startMs,
+				rem: {
+					patternsDiscovered: 0,
+					entriesAnalyzed: recentEntries.length
+				}
+			});
+			return {
+				ok: true,
+				reason: "not enough recent entries for pattern analysis",
+				patternsDiscovered: 0,
+				entriesAnalyzed: recentEntries.length
+			};
+		}
+		const topClusters = discoverPatternClusters(recentEntries, cfg.minPatternStrength).slice(0, cfg.limit);
+		const touchedKeys = /* @__PURE__ */ new Set();
+		for (const cluster of topClusters) for (const member of cluster.members) if (!touchedKeys.has(member.key)) {
+			touchedKeys.add(member.key);
+			const storeEntry = store.entries[member.key];
+			if (storeEntry) bumpEntryPhaseSignal(storeEntry, "remHits");
+		}
+		store.updatedAt = now.toISOString();
+		await saveDreamingStore({
+			workspaceDir: params.workspaceDir,
+			store
+		});
+		if (topClusters.length > 0) await appendPatternSummary(params.workspaceDir, topClusters, now);
+		log.info({
+			workspaceDir: params.workspaceDir,
+			patterns: topClusters.length,
+			entriesAnalyzed: recentEntries.length,
+			touched: touchedKeys.size
+		}, "REM pattern discovery complete");
+		await writeLastRun(params.workspaceDir, {
+			runId,
+			startedAt,
+			cfg,
+			ok: true,
+			reason: "REM patterns complete",
+			startMs,
+			rem: {
+				patternsDiscovered: topClusters.length,
+				entriesAnalyzed: recentEntries.length
+			}
+		});
+		return {
+			ok: true,
+			reason: "REM patterns complete",
+			patternsDiscovered: topClusters.length,
+			entriesAnalyzed: recentEntries.length
+		};
+	} catch (err) {
+		const errorMessage = err instanceof Error ? err.message : String(err);
+		log.error({
+			err,
+			errorMessage,
+			workspaceDir: params.workspaceDir
+		}, `REM pattern discovery failed: ${errorMessage}`);
+		await writeLastRun(params.workspaceDir, {
+			runId,
+			startedAt,
+			cfg,
+			ok: false,
+			reason: `REM error: ${errorMessage}`,
+			startMs,
+			rem: {
+				patternsDiscovered: 0,
+				entriesAnalyzed: 0
+			},
+			errorMessage
+		}).catch(() => void 0);
+		return {
+			ok: false,
+			reason: errorMessage,
+			patternsDiscovered: 0,
+			entriesAnalyzed: 0
+		};
+	}
+}
+/**
+* Build an inverted index of queryHash → entries, then form clusters
+* where multiple entries share overlapping query hashes. Each cluster's
+* "strength" is the ratio of shared queries to total unique queries.
+*/
+function discoverPatternClusters(entries, minStrength) {
+	const hashToEntries = /* @__PURE__ */ new Map();
+	for (const entry of entries) for (const queryHash of entry.queryHashes ?? []) {
+		const group = hashToEntries.get(queryHash);
+		if (group) group.push(entry);
+		else hashToEntries.set(queryHash, [entry]);
+	}
+	const significantHashes = [];
+	for (const [hash, group] of hashToEntries) {
+		const uniquePaths = new Set(group.map((e) => e.path));
+		if (group.length >= 2 && uniquePaths.size >= 2) significantHashes.push({
+			hash,
+			entries: group
+		});
+	}
+	if (significantHashes.length === 0) return [];
+	const keyToCluster = /* @__PURE__ */ new Map();
+	const keyToEntry = /* @__PURE__ */ new Map();
+	for (const entry of entries) keyToEntry.set(entry.key, entry);
+	for (const { entries: groupEntries } of significantHashes) {
+		const keys = groupEntries.map((e) => e.key);
+		let mergedCluster = keyToCluster.get(keys[0]);
+		if (!mergedCluster) {
+			mergedCluster = /* @__PURE__ */ new Set();
+			mergedCluster.add(keys[0]);
+			keyToCluster.set(keys[0], mergedCluster);
+		}
+		for (const key of keys.slice(1)) {
+			const existingCluster = keyToCluster.get(key);
+			if (existingCluster && existingCluster !== mergedCluster) for (const existingKey of existingCluster) {
+				mergedCluster.add(existingKey);
+				keyToCluster.set(existingKey, mergedCluster);
+			}
+			else {
+				mergedCluster.add(key);
+				keyToCluster.set(key, mergedCluster);
+			}
+		}
+	}
+	const seenClusters = /* @__PURE__ */ new Set();
+	const rawClusters = [];
+	for (const cluster of keyToCluster.values()) if (!seenClusters.has(cluster) && cluster.size >= 2) {
+		seenClusters.add(cluster);
+		rawClusters.push(cluster);
+	}
+	const scoredClusters = [];
+	for (const clusterKeys of rawClusters) {
+		const members = [];
+		for (const key of clusterKeys) {
+			const entry = keyToEntry.get(key);
+			if (entry) members.push(entry);
+		}
+		if (members.length < 2) continue;
+		const hashCounts = /* @__PURE__ */ new Map();
+		for (const member of members) for (const hash of member.queryHashes ?? []) hashCounts.set(hash, (hashCounts.get(hash) ?? 0) + 1);
+		const sharedQueries = [...hashCounts.entries()].filter(([, count]) => count >= 2).map(([hash]) => hash);
+		const allUniqueHashes = /* @__PURE__ */ new Set();
+		for (const member of members) for (const hash of member.queryHashes ?? []) allUniqueHashes.add(hash);
+		const strength = allUniqueHashes.size > 0 ? sharedQueries.length / allUniqueHashes.size : 0;
+		if (strength < minStrength) continue;
+		const distinctPaths = [...new Set(members.map((m) => m.path))];
+		const representative = members.reduce((best, current) => (current.totalSignalCount ?? 0) > (best.totalSignalCount ?? 0) ? current : best);
+		scoredClusters.push({
+			representative,
+			members,
+			strength,
+			sharedQueries,
+			distinctPaths
+		});
+	}
+	scoredClusters.sort((a, b) => {
+		if (b.strength !== a.strength) return b.strength - a.strength;
+		return b.members.length - a.members.length;
+	});
+	return scoredClusters;
+}
+async function appendPatternSummary(workspaceDir, clusters, now) {
+	const dreamsPath = path.join(workspaceDir, DREAMS_MD_FILENAME);
+	const existing = await fs.readFile(dreamsPath, "utf-8").catch((err) => {
+		if (err?.code === "ENOENT") return "";
+		throw err;
+	});
+	const day = isoDay(now);
+	const lines = [];
+	if (existing.trim().length === 0) lines.push("# Dream Diary", "");
+	lines.push(`## REM Pattern Discovery — ${day}`, "");
+	lines.push(`*${now.toISOString()}*`, "");
+	for (let i = 0; i < clusters.length; i++) {
+		const cluster = clusters[i];
+		lines.push(`### Pattern ${i + 1}: ${cluster.distinctPaths.length} files, strength=${cluster.strength.toFixed(2)}`);
+		lines.push("");
+		lines.push(`**Files involved:** ${cluster.distinctPaths.join(", ")}`);
+		lines.push(`**Shared query themes:** ${cluster.sharedQueries.length} overlapping queries`);
+		lines.push(`**Members:** ${cluster.members.length} snippets`);
+		lines.push("");
+		const rep = cluster.representative;
+		lines.push(`> ${rep.snippet?.slice(0, 200) ?? "(no snippet)"}`);
+		lines.push(`> — ${rep.path}:${rep.startLine}-${rep.endLine}`);
+		lines.push("");
+	}
+	lines.push("---", "");
+	const next = `${existing}${existing.trim().length > 0 && !existing.endsWith("\n") ? "\n" : ""}${lines.join("\n")}`;
+	await fs.writeFile(dreamsPath, next, "utf-8");
+}
+async function writeLastRun(workspaceDir, params) {
+	const finishedAt = (/* @__PURE__ */ new Date()).toISOString();
+	const durationMs = Math.max(0, Date.now() - params.startMs);
+	const lastRun = {
+		version: 2,
+		phase: "rem",
+		runId: params.runId,
+		startedAt: params.startedAt,
+		finishedAt,
+		durationMs,
+		ok: params.ok,
+		reason: params.reason,
+		config: params.cfg,
+		rem: params.rem,
+		...params.errorMessage ? { errorMessage: params.errorMessage } : {}
+	};
+	const lastRunPath = path.join(workspaceDir, DREAMING_DIR_RELATIVE, "last-run-rem.json");
+	await fs.mkdir(path.dirname(lastRunPath), { recursive: true });
+	const tmp = `${lastRunPath}.${process.pid}.${Date.now()}.tmp`;
+	await fs.writeFile(tmp, `${JSON.stringify(lastRun, null, 2)}\n`, "utf-8");
+	await fs.rename(tmp, lastRunPath);
+}
+//#endregion
+export { runRemPatterns };
+
+//# sourceMappingURL=rem-patterns.js.map

package/dist/src/agent/memory/dreaming/rem-patterns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rem-patterns.js","names":[],"sources":["../../../../../src/agent/memory/dreaming/rem-patterns.ts"],"sourcesContent":["import fs from 'node:fs/promises';\nimport path from 'node:path';\n\nimport { createLogger } from '../../../utils/logger.js';\nimport { DREAMING_DIR_RELATIVE, DREAMS_MD_FILENAME, MS_PER_DAY } from './constants.js';\nimport type { DreamingRemConfig } from './config.js';\nimport {\n  bumpEntryPhaseSignal,\n  loadDreamingStore,\n  saveDreamingStore,\n  type DreamingStoreEntry,\n} from './short-term-store.js';\nimport { isoDay } from './utils.js';\nimport {\n  DREAMING_LAST_RUN_FORMAT_VERSION,\n  type DreamingRemLastRun,\n} from './last-run.js';\n\nconst log = createLogger('Dreaming:REM');\n\n// ── Pattern types ──────────────────────────────────────────────────────\n\ntype PatternCluster = {\n  representative: DreamingStoreEntry;\n  members: DreamingStoreEntry[];\n  strength: number;\n  /** Shared query hashes across members. */\n  sharedQueries: string[];\n  /** Distinct source files involved. */\n  distinctPaths: string[];\n};\n\n// ── Config defaults ────────────────────────────────────────────────────\n\nfunction resolveConfig(overrides?: Partial<DreamingRemConfig>): DreamingRemConfig {\n  return {\n    enabled: overrides?.enabled === true,\n    cron: typeof overrides?.cron === 'string' ? overrides.cron : '0 5 * * 0',\n    lookbackDays: Math.max(1, Math.floor(Number(overrides?.lookbackDays) || 7)),\n    limit: Math.max(0, Math.floor(Number(overrides?.limit) || 10)),\n    minPatternStrength: Math.max(0, Math.min(1, Number(overrides?.minPatternStrength) || 0.75)),\n  };\n}\n\n// ── Core REM pattern discovery ─────────────────────────────────────────\n\n/**\n * REM phase: cross-session pattern discovery.\n *\n * Scans the short-term store for entries that share query hashes or\n * appear across multiple daily files, then clusters them to identify\n * recurring themes/patterns. Bumps `remHits` on touched entries and\n * optionally writes a pattern summary to DREAMS.md.\n *\n * Runs weekly; expensive but insightful.\n */\nexport async function runRemPatterns(params: {\n  workspaceDir: string;\n  config?: Partial<DreamingRemConfig>;\n  now?: Date;\n}): Promise<{\n  ok: boolean;\n  reason: string;\n  patternsDiscovered: number;\n  entriesAnalyzed: number;\n}> {\n  const cfg = resolveConfig(params.config);\n  const now = params.now ?? new Date();\n  const startedAt = now.toISOString();\n  const runId = `rem:${startedAt}:${process.pid}`;\n  const startMs = Date.now();\n  const nowMs = now.getTime();\n\n  if (!cfg.enabled) {\n    await writeLastRun(params.workspaceDir, {\n      runId, startedAt, cfg, ok: true, reason: 'REM patterns disabled', startMs,\n      rem: { patternsDiscovered: 0, entriesAnalyzed: 0 },\n    });\n    return { ok: true, reason: 'REM patterns disabled', patternsDiscovered: 0, entriesAnalyzed: 0 };\n  }\n\n  try {\n    const { store } = await loadDreamingStore({ workspaceDir: params.workspaceDir });\n\n    // Filter entries within the lookback window.\n    const cutoffMs = nowMs - cfg.lookbackDays * MS_PER_DAY;\n    const recentEntries = Object.values(store.entries ?? {}).filter(\n      (entry): entry is DreamingStoreEntry => {\n        if (!entry || typeof entry !== 'object') return false;\n        if (!entry.lastRecalledAt) return false;\n        const lastMs = Date.parse(entry.lastRecalledAt);\n        return Number.isFinite(lastMs) && lastMs >= cutoffMs;\n      },\n    );\n\n    if (recentEntries.length < 2) {\n      await writeLastRun(params.workspaceDir, {\n        runId, startedAt, cfg, ok: true, reason: 'not enough recent entries for pattern analysis', startMs,\n        rem: { patternsDiscovered: 0, entriesAnalyzed: recentEntries.length },\n      });\n      return {\n        ok: true,\n        reason: 'not enough recent entries for pattern analysis',\n        patternsDiscovered: 0,\n        entriesAnalyzed: recentEntries.length,\n      };\n    }\n\n    // Discover patterns by clustering entries that share query hashes.\n    const clusters = discoverPatternClusters(recentEntries, cfg.minPatternStrength);\n    const topClusters = clusters.slice(0, cfg.limit);\n\n    // Bump remHits on all entries that belong to a discovered pattern.\n    const touchedKeys = new Set<string>();\n    for (const cluster of topClusters) {\n      for (const member of cluster.members) {\n        if (!touchedKeys.has(member.key)) {\n          touchedKeys.add(member.key);\n          const storeEntry = store.entries[member.key];\n          if (storeEntry) {\n            bumpEntryPhaseSignal(storeEntry, 'remHits');\n          }\n        }\n      }\n    }\n\n    store.updatedAt = now.toISOString();\n    await saveDreamingStore({ workspaceDir: params.workspaceDir, store });\n\n    // Write pattern summary to DREAMS.md (append).\n    if (topClusters.length > 0) {\n      await appendPatternSummary(params.workspaceDir, topClusters, now);\n    }\n\n    log.info(\n      {\n        workspaceDir: params.workspaceDir,\n        patterns: topClusters.length,\n        entriesAnalyzed: recentEntries.length,\n        touched: touchedKeys.size,\n      },\n      'REM pattern discovery complete',\n    );\n\n    await writeLastRun(params.workspaceDir, {\n      runId, startedAt, cfg, ok: true, reason: 'REM patterns complete', startMs,\n      rem: { patternsDiscovered: topClusters.length, entriesAnalyzed: recentEntries.length },\n    });\n\n    return {\n      ok: true,\n      reason: 'REM patterns complete',\n      patternsDiscovered: topClusters.length,\n      entriesAnalyzed: recentEntries.length,\n    };\n  } catch (err) {\n    const errorMessage = err instanceof Error ? err.message : String(err);\n    log.error({ err, errorMessage, workspaceDir: params.workspaceDir }, `REM pattern discovery failed: ${errorMessage}`);\n    await writeLastRun(params.workspaceDir, {\n      runId, startedAt, cfg, ok: false, reason: `REM error: ${errorMessage}`, startMs,\n      rem: { patternsDiscovered: 0, entriesAnalyzed: 0 }, errorMessage,\n    }).catch(() => undefined);\n    return { ok: false, reason: errorMessage, patternsDiscovered: 0, entriesAnalyzed: 0 };\n  }\n}\n\n// ── Pattern clustering ─────────────────────────────────────────────────\n\n/**\n * Build an inverted index of queryHash → entries, then form clusters\n * where multiple entries share overlapping query hashes. Each cluster's\n * \"strength\" is the ratio of shared queries to total unique queries.\n */\nfunction discoverPatternClusters(\n  entries: DreamingStoreEntry[],\n  minStrength: number,\n): PatternCluster[] {\n  // Build inverted index: queryHash → entry keys.\n  const hashToEntries = new Map<string, DreamingStoreEntry[]>();\n  for (const entry of entries) {\n    for (const queryHash of entry.queryHashes ?? []) {\n      const group = hashToEntries.get(queryHash);\n      if (group) {\n        group.push(entry);\n      } else {\n        hashToEntries.set(queryHash, [entry]);\n      }\n    }\n  }\n\n  // Find query hashes that appear in 2+ distinct entries from different paths.\n  const significantHashes: Array<{ hash: string; entries: DreamingStoreEntry[] }> = [];\n  for (const [hash, group] of hashToEntries) {\n    const uniquePaths = new Set(group.map((e) => e.path));\n    if (group.length >= 2 && uniquePaths.size >= 2) {\n      significantHashes.push({ hash, entries: group });\n    }\n  }\n\n  if (significantHashes.length === 0) return [];\n\n  // Merge overlapping groups into clusters using union-find.\n  const keyToCluster = new Map<string, Set<string>>();\n  const keyToEntry = new Map<string, DreamingStoreEntry>();\n\n  for (const entry of entries) {\n    keyToEntry.set(entry.key, entry);\n  }\n\n  for (const { entries: groupEntries } of significantHashes) {\n    const keys = groupEntries.map((e) => e.key);\n    // Find or create the cluster for the first key.\n    let mergedCluster = keyToCluster.get(keys[0]!);\n    if (!mergedCluster) {\n      mergedCluster = new Set<string>();\n      mergedCluster.add(keys[0]!);\n      keyToCluster.set(keys[0]!, mergedCluster);\n    }\n    // Merge all other keys into this cluster.\n    for (const key of keys.slice(1)) {\n      const existingCluster = keyToCluster.get(key);\n      if (existingCluster && existingCluster !== mergedCluster) {\n        for (const existingKey of existingCluster) {\n          mergedCluster.add(existingKey);\n          keyToCluster.set(existingKey, mergedCluster);\n        }\n      } else {\n        mergedCluster.add(key);\n        keyToCluster.set(key, mergedCluster);\n      }\n    }\n  }\n\n  // Deduplicate cluster sets.\n  const seenClusters = new Set<Set<string>>();\n  const rawClusters: Set<string>[] = [];\n  for (const cluster of keyToCluster.values()) {\n    if (!seenClusters.has(cluster) && cluster.size >= 2) {\n      seenClusters.add(cluster);\n      rawClusters.push(cluster);\n    }\n  }\n\n  // Score each cluster.\n  const scoredClusters: PatternCluster[] = [];\n  for (const clusterKeys of rawClusters) {\n    const members: DreamingStoreEntry[] = [];\n    for (const key of clusterKeys) {\n      const entry = keyToEntry.get(key);\n      if (entry) members.push(entry);\n    }\n    if (members.length < 2) continue;\n\n    // Shared queries: hashes that appear in 2+ members.\n    const hashCounts = new Map<string, number>();\n    for (const member of members) {\n      for (const hash of member.queryHashes ?? []) {\n        hashCounts.set(hash, (hashCounts.get(hash) ?? 0) + 1);\n      }\n    }\n    const sharedQueries = [...hashCounts.entries()]\n      .filter(([, count]) => count >= 2)\n      .map(([hash]) => hash);\n\n    const allUniqueHashes = new Set<string>();\n    for (const member of members) {\n      for (const hash of member.queryHashes ?? []) allUniqueHashes.add(hash);\n    }\n\n    const strength = allUniqueHashes.size > 0 ? sharedQueries.length / allUniqueHashes.size : 0;\n    if (strength < minStrength) continue;\n\n    const distinctPaths = [...new Set(members.map((m) => m.path))];\n\n    // Representative: the member with the highest totalSignalCount.\n    const representative = members.reduce((best, current) =>\n      (current.totalSignalCount ?? 0) > (best.totalSignalCount ?? 0) ? current : best,\n    );\n\n    scoredClusters.push({\n      representative,\n      members,\n      strength,\n      sharedQueries,\n      distinctPaths,\n    });\n  }\n\n  // Sort by strength descending, then by member count.\n  scoredClusters.sort((a, b) => {\n    if (b.strength !== a.strength) return b.strength - a.strength;\n    return b.members.length - a.members.length;\n  });\n\n  return scoredClusters;\n}\n\n// ── DREAMS.md writer ───────────────────────────────────────────────────\n\nasync function appendPatternSummary(\n  workspaceDir: string,\n  clusters: PatternCluster[],\n  now: Date,\n): Promise<void> {\n  const dreamsPath = path.join(workspaceDir, DREAMS_MD_FILENAME);\n  const existing = await fs.readFile(dreamsPath, 'utf-8').catch((err: unknown) => {\n    if ((err as NodeJS.ErrnoException)?.code === 'ENOENT') return '';\n    throw err;\n  });\n\n  const day = isoDay(now);\n  const lines: string[] = [];\n\n  if (existing.trim().length === 0) {\n    lines.push('# Dream Diary', '');\n  }\n\n  lines.push(`## REM Pattern Discovery — ${day}`, '');\n  lines.push(`*${now.toISOString()}*`, '');\n\n  for (let i = 0; i < clusters.length; i++) {\n    const cluster = clusters[i]!;\n    lines.push(\n      `### Pattern ${i + 1}: ${cluster.distinctPaths.length} files, strength=${cluster.strength.toFixed(2)}`,\n    );\n    lines.push('');\n    lines.push(`**Files involved:** ${cluster.distinctPaths.join(', ')}`);\n    lines.push(`**Shared query themes:** ${cluster.sharedQueries.length} overlapping queries`);\n    lines.push(`**Members:** ${cluster.members.length} snippets`);\n    lines.push('');\n    // Include the representative snippet.\n    const rep = cluster.representative;\n    lines.push(`> ${rep.snippet?.slice(0, 200) ?? '(no snippet)'}`);\n    lines.push(`> — ${rep.path}:${rep.startLine}-${rep.endLine}`);\n    lines.push('');\n  }\n\n  lines.push('---', '');\n\n  const separator = existing.trim().length > 0 && !existing.endsWith('\\n') ? '\\n' : '';\n  const next = `${existing}${separator}${lines.join('\\n')}`;\n  await fs.writeFile(dreamsPath, next, 'utf-8');\n}\n\n// ── Last-run writer ────────────────────────────────────────────────────\n\nasync function writeLastRun(\n  workspaceDir: string,\n  params: {\n    runId: string;\n    startedAt: string;\n    cfg: DreamingRemConfig;\n    ok: boolean;\n    reason: string;\n    startMs: number;\n    rem: DreamingRemLastRun['rem'];\n    errorMessage?: string;\n  },\n): Promise<void> {\n  const finishedAt = new Date().toISOString();\n  const durationMs = Math.max(0, Date.now() - params.startMs);\n\n  const lastRun: DreamingRemLastRun = {\n    version: DREAMING_LAST_RUN_FORMAT_VERSION,\n    phase: 'rem',\n    runId: params.runId,\n    startedAt: params.startedAt,\n    finishedAt,\n    durationMs,\n    ok: params.ok,\n    reason: params.reason,\n    config: params.cfg,\n    rem: params.rem,\n    ...(params.errorMessage ? { errorMessage: params.errorMessage } : {}),\n  };\n\n  const lastRunPath = path.join(workspaceDir, DREAMING_DIR_RELATIVE, 'last-run-rem.json');\n  await fs.mkdir(path.dirname(lastRunPath), { recursive: true });\n  const tmp = `${lastRunPath}.${process.pid}.${Date.now()}.tmp`;\n  await fs.writeFile(tmp, `${JSON.stringify(lastRun, null, 2)}\\n`, 'utf-8');\n  await fs.rename(tmp, lastRunPath);\n}\n"],"mappings":";;;;;;;;;aAGwD;AAexD,MAAM,MAAM,aAAa,eAAe;AAgBxC,SAAS,cAAc,WAA2D;AAChF,QAAO;EACL,SAAS,WAAW,YAAY;EAChC,MAAM,OAAO,WAAW,SAAS,WAAW,UAAU,OAAO;EAC7D,cAAc,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,WAAW,aAAa,IAAI,EAAE,CAAC;EAC3E,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,WAAW,MAAM,IAAI,GAAG,CAAC;EAC9D,oBAAoB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,WAAW,mBAAmB,IAAI,IAAK,CAAC;EAC5F;;;;;;;;;;;;AAeH,eAAsB,eAAe,QASlC;CACD,MAAM,MAAM,cAAc,OAAO,OAAO;CACxC,MAAM,MAAM,OAAO,uBAAO,IAAI,MAAM;CACpC,MAAM,YAAY,IAAI,aAAa;CACnC,MAAM,QAAQ,OAAO,UAAU,GAAG,QAAQ;CAC1C,MAAM,UAAU,KAAK,KAAK;CAC1B,MAAM,QAAQ,IAAI,SAAS;AAE3B,KAAI,CAAC,IAAI,SAAS;AAChB,QAAM,aAAa,OAAO,cAAc;GACtC;GAAO;GAAW;GAAK,IAAI;GAAM,QAAQ;GAAyB;GAClE,KAAK;IAAE,oBAAoB;IAAG,iBAAiB;IAAG;GACnD,CAAC;AACF,SAAO;GAAE,IAAI;GAAM,QAAQ;GAAyB,oBAAoB;GAAG,iBAAiB;GAAG;;AAGjG,KAAI;EACF,MAAM,EAAE,UAAU,MAAM,kBAAkB,EAAE,cAAc,OAAO,cAAc,CAAC;EAGhF,MAAM,WAAW,QAAQ,IAAI,eAAe;EAC5C,MAAM,gBAAgB,OAAO,OAAO,MAAM,WAAW,EAAE,CAAC,CAAC,QACtD,UAAuC;AACtC,OAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,OAAI,CAAC,MAAM,eAAgB,QAAO;GAClC,MAAM,SAAS,KAAK,MAAM,MAAM,eAAe;AAC/C,UAAO,OAAO,SAAS,OAAO,IAAI,UAAU;IAE/C;AAED,MAAI,cAAc,SAAS,GAAG;AAC5B,SAAM,aAAa,OAAO,cAAc;IACtC;IAAO;IAAW;IAAK,IAAI;IAAM,QAAQ;IAAkD;IAC3F,KAAK;KAAE,oBAAoB;KAAG,iBAAiB,cAAc;KAAQ;IACtE,CAAC;AACF,UAAO;IACL,IAAI;IACJ,QAAQ;IACR,oBAAoB;IACpB,iBAAiB,cAAc;IAChC;;EAKH,MAAM,cADW,wBAAwB,eAAe,IAAI,mBAChC,CAAC,MAAM,GAAG,IAAI,MAAM;EAGhD,MAAM,8BAAc,IAAI,KAAa;AACrC,OAAK,MAAM,WAAW,YACpB,MAAK,MAAM,UAAU,QAAQ,QAC3B,KAAI,CAAC,YAAY,IAAI,OAAO,IAAI,EAAE;AAChC,eAAY,IAAI,OAAO,IAAI;GAC3B,MAAM,aAAa,MAAM,QAAQ,OAAO;AACxC,OAAI,WACF,sBAAqB,YAAY,UAAU;;AAMnD,QAAM,YAAY,IAAI,aAAa;AACnC,QAAM,kBAAkB;GAAE,cAAc,OAAO;GAAc;GAAO,CAAC;AAGrE,MAAI,YAAY,SAAS,EACvB,OAAM,qBAAqB,OAAO,cAAc,aAAa,IAAI;AAGnE,MAAI,KACF;GACE,cAAc,OAAO;GACrB,UAAU,YAAY;GACtB,iBAAiB,cAAc;GAC/B,SAAS,YAAY;GACtB,EACD,iCACD;AAED,QAAM,aAAa,OAAO,cAAc;GACtC;GAAO;GAAW;GAAK,IAAI;GAAM,QAAQ;GAAyB;GAClE,KAAK;IAAE,oBAAoB,YAAY;IAAQ,iBAAiB,cAAc;IAAQ;GACvF,CAAC;AAEF,SAAO;GACL,IAAI;GACJ,QAAQ;GACR,oBAAoB,YAAY;GAChC,iBAAiB,cAAc;GAChC;UACM,KAAK;EACZ,MAAM,eAAe,eAAe,QAAQ,IAAI,UAAU,OAAO,IAAI;AACrE,MAAI,MAAM;GAAE;GAAK;GAAc,cAAc,OAAO;GAAc,EAAE,iCAAiC,eAAe;AACpH,QAAM,aAAa,OAAO,cAAc;GACtC;GAAO;GAAW;GAAK,IAAI;GAAO,QAAQ,cAAc;GAAgB;GACxE,KAAK;IAAE,oBAAoB;IAAG,iBAAiB;IAAG;GAAE;GACrD,CAAC,CAAC,YAAY,KAAA,EAAU;AACzB,SAAO;GAAE,IAAI;GAAO,QAAQ;GAAc,oBAAoB;GAAG,iBAAiB;GAAG;;;;;;;;AAWzF,SAAS,wBACP,SACA,aACkB;CAElB,MAAM,gCAAgB,IAAI,KAAmC;AAC7D,MAAK,MAAM,SAAS,QAClB,MAAK,MAAM,aAAa,MAAM,eAAe,EAAE,EAAE;EAC/C,MAAM,QAAQ,cAAc,IAAI,UAAU;AAC1C,MAAI,MACF,OAAM,KAAK,MAAM;MAEjB,eAAc,IAAI,WAAW,CAAC,MAAM,CAAC;;CAM3C,MAAM,oBAA4E,EAAE;AACpF,MAAK,MAAM,CAAC,MAAM,UAAU,eAAe;EACzC,MAAM,cAAc,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,CAAC;AACrD,MAAI,MAAM,UAAU,KAAK,YAAY,QAAQ,EAC3C,mBAAkB,KAAK;GAAE;GAAM,SAAS;GAAO,CAAC;;AAIpD,KAAI,kBAAkB,WAAW,EAAG,QAAO,EAAE;CAG7C,MAAM,+BAAe,IAAI,KAA0B;CACnD,MAAM,6BAAa,IAAI,KAAiC;AAExD,MAAK,MAAM,SAAS,QAClB,YAAW,IAAI,MAAM,KAAK,MAAM;AAGlC,MAAK,MAAM,EAAE,SAAS,kBAAkB,mBAAmB;EACzD,MAAM,OAAO,aAAa,KAAK,MAAM,EAAE,IAAI;EAE3C,IAAI,gBAAgB,aAAa,IAAI,KAAK,GAAI;AAC9C,MAAI,CAAC,eAAe;AAClB,mCAAgB,IAAI,KAAa;AACjC,iBAAc,IAAI,KAAK,GAAI;AAC3B,gBAAa,IAAI,KAAK,IAAK,cAAc;;AAG3C,OAAK,MAAM,OAAO,KAAK,MAAM,EAAE,EAAE;GAC/B,MAAM,kBAAkB,aAAa,IAAI,IAAI;AAC7C,OAAI,mBAAmB,oBAAoB,cACzC,MAAK,MAAM,eAAe,iBAAiB;AACzC,kBAAc,IAAI,YAAY;AAC9B,iBAAa,IAAI,aAAa,cAAc;;QAEzC;AACL,kBAAc,IAAI,IAAI;AACtB,iBAAa,IAAI,KAAK,cAAc;;;;CAM1C,MAAM,+BAAe,IAAI,KAAkB;CAC3C,MAAM,cAA6B,EAAE;AACrC,MAAK,MAAM,WAAW,aAAa,QAAQ,CACzC,KAAI,CAAC,aAAa,IAAI,QAAQ,IAAI,QAAQ,QAAQ,GAAG;AACnD,eAAa,IAAI,QAAQ;AACzB,cAAY,KAAK,QAAQ;;CAK7B,MAAM,iBAAmC,EAAE;AAC3C,MAAK,MAAM,eAAe,aAAa;EACrC,MAAM,UAAgC,EAAE;AACxC,OAAK,MAAM,OAAO,aAAa;GAC7B,MAAM,QAAQ,WAAW,IAAI,IAAI;AACjC,OAAI,MAAO,SAAQ,KAAK,MAAM;;AAEhC,MAAI,QAAQ,SAAS,EAAG;EAGxB,MAAM,6BAAa,IAAI,KAAqB;AAC5C,OAAK,MAAM,UAAU,QACnB,MAAK,MAAM,QAAQ,OAAO,eAAe,EAAE,CACzC,YAAW,IAAI,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE;EAGzD,MAAM,gBAAgB,CAAC,GAAG,WAAW,SAAS,CAAC,CAC5C,QAAQ,GAAG,WAAW,SAAS,EAAE,CACjC,KAAK,CAAC,UAAU,KAAK;EAExB,MAAM,kCAAkB,IAAI,KAAa;AACzC,OAAK,MAAM,UAAU,QACnB,MAAK,MAAM,QAAQ,OAAO,eAAe,EAAE,CAAE,iBAAgB,IAAI,KAAK;EAGxE,MAAM,WAAW,gBAAgB,OAAO,IAAI,cAAc,SAAS,gBAAgB,OAAO;AAC1F,MAAI,WAAW,YAAa;EAE5B,MAAM,gBAAgB,CAAC,GAAG,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC;EAG9D,MAAM,iBAAiB,QAAQ,QAAQ,MAAM,aAC1C,QAAQ,oBAAoB,MAAM,KAAK,oBAAoB,KAAK,UAAU,KAC5E;AAED,iBAAe,KAAK;GAClB;GACA;GACA;GACA;GACA;GACD,CAAC;;AAIJ,gBAAe,MAAM,GAAG,MAAM;AAC5B,MAAI,EAAE,aAAa,EAAE,SAAU,QAAO,EAAE,WAAW,EAAE;AACrD,SAAO,EAAE,QAAQ,SAAS,EAAE,QAAQ;GACpC;AAEF,QAAO;;AAKT,eAAe,qBACb,cACA,UACA,KACe;CACf,MAAM,aAAa,KAAK,KAAK,cAAc,mBAAmB;CAC9D,MAAM,WAAW,MAAM,GAAG,SAAS,YAAY,QAAQ,CAAC,OAAO,QAAiB;AAC9E,MAAK,KAA+B,SAAS,SAAU,QAAO;AAC9D,QAAM;GACN;CAEF,MAAM,MAAM,OAAO,IAAI;CACvB,MAAM,QAAkB,EAAE;AAE1B,KAAI,SAAS,MAAM,CAAC,WAAW,EAC7B,OAAM,KAAK,iBAAiB,GAAG;AAGjC,OAAM,KAAK,8BAA8B,OAAO,GAAG;AACnD,OAAM,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,GAAG;AAExC,MAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,UAAU,SAAS;AACzB,QAAM,KACJ,eAAe,IAAI,EAAE,IAAI,QAAQ,cAAc,OAAO,mBAAmB,QAAQ,SAAS,QAAQ,EAAE,GACrG;AACD,QAAM,KAAK,GAAG;AACd,QAAM,KAAK,uBAAuB,QAAQ,cAAc,KAAK,KAAK,GAAG;AACrE,QAAM,KAAK,4BAA4B,QAAQ,cAAc,OAAO,sBAAsB;AAC1F,QAAM,KAAK,gBAAgB,QAAQ,QAAQ,OAAO,WAAW;AAC7D,QAAM,KAAK,GAAG;EAEd,MAAM,MAAM,QAAQ;AACpB,QAAM,KAAK,KAAK,IAAI,SAAS,MAAM,GAAG,IAAI,IAAI,iBAAiB;AAC/D,QAAM,KAAK,OAAO,IAAI,KAAK,GAAG,IAAI,UAAU,GAAG,IAAI,UAAU;AAC7D,QAAM,KAAK,GAAG;;AAGhB,OAAM,KAAK,OAAO,GAAG;CAGrB,MAAM,OAAO,GAAG,WADE,SAAS,MAAM,CAAC,SAAS,KAAK,CAAC,SAAS,SAAS,KAAK,GAAG,OAAO,KAC3C,MAAM,KAAK,KAAK;AACvD,OAAM,GAAG,UAAU,YAAY,MAAM,QAAQ;;AAK/C,eAAe,aACb,cACA,QAUe;CACf,MAAM,8BAAa,IAAI,MAAM,EAAC,aAAa;CAC3C,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,KAAK,GAAG,OAAO,QAAQ;CAE3D,MAAM,UAA8B;EAClC,SAAA;EACA,OAAO;EACP,OAAO,OAAO;EACd,WAAW,OAAO;EAClB;EACA;EACA,IAAI,OAAO;EACX,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,KAAK,OAAO;EACZ,GAAI,OAAO,eAAe,EAAE,cAAc,OAAO,cAAc,GAAG,EAAE;EACrE;CAED,MAAM,cAAc,KAAK,KAAK,cAAc,uBAAuB,oBAAoB;AACvF,OAAM,GAAG,MAAM,KAAK,QAAQ,YAAY,EAAE,EAAE,WAAW,MAAM,CAAC;CAC9D,MAAM,MAAM,GAAG,YAAY,GAAG,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC;AACxD,OAAM,GAAG,UAAU,KAAK,GAAG,KAAK,UAAU,SAAS,MAAM,EAAE,CAAC,KAAK,QAAQ;AACzE,OAAM,GAAG,OAAO,KAAK,YAAY"}

package/dist/src/agent/memory/dreaming/short-term-store.d.ts

@@ -5,7 +5,20 @@ export type DreamingStoreEntry = {
     startLine: number;
     endLine: number;
     snippet: string;
+    /** Number of times this snippet was returned by a memory recall query. */
     recallCount: number;
+    /** Number of times recorded from daily log scanning (light sweep). */
+    dailyCount: number;
+    /** Number of times replayed from grounded context (agent-initiated). */
+    groundedCount: number;
+    /** Number of times the light phase touched this entry. */
+    lightHits: number;
+    /** Number of times the REM phase touched this entry. */
+    remHits: number;
+    /** Cross-phase hit count (light + deep + rem combined touches). */
+    phaseHitCount: number;
+    /** Weighted aggregate of all signal dimensions. */
+    totalSignalCount: number;
     totalScore: number;
     maxScore: number;
     queryHashes: string[];
@@ -42,4 +55,11 @@ export declare function saveDreamingStore(params: {
     workspaceDir: string;
     store: DreamingStore;
 }): Promise<void>;
+type PhaseSignalField = 'dailyCount' | 'groundedCount' | 'lightHits' | 'remHits';
+/**
+ * Increment a phase-specific signal counter on an existing store entry.
+ * Also bumps `phaseHitCount` and `totalSignalCount`.
+ * Returns `true` if the entry existed and was updated.
+ */
+export declare function bumpEntryPhaseSignal(entry: DreamingStoreEntry, field: PhaseSignalField, increment?: number): void;
 export {};

package/dist/src/agent/memory/dreaming/short-term-store.js

@@ -1,32 +1,20 @@
 import { createLogger } from "../../../utils/logger/index.js";
 import { init_logger } from "../../../utils/logger.js";
 import { SHORT_TERM_PROMOTION_LOCK_RELATIVE, SHORT_TERM_RECALL_STORE_RELATIVE } from "./constants.js";
+import { buildEntryKey, clamp01, isoDay, normalizeMemoryPath } from "./utils.js";
 import path from "node:path";
 import fs from "node:fs/promises";
 import { createHash, randomUUID } from "node:crypto";
 //#region src/agent/memory/dreaming/short-term-store.ts
 init_logger();
 const log = createLogger("Dreaming:Store");
-function normalizeMemoryPath(raw) {
-	return raw.replaceAll("\\", "/").replace(/^\.\//, "");
-}
 function isDailyWorkspaceMemoryPath(rel) {
 	const p = normalizeMemoryPath(rel);
 	return /^memory\/\d{4}-\d{2}-\d{2}\.md$/i.test(p);
 }
-function clampScore(value) {
-	if (!Number.isFinite(value)) return 0;
-	return Math.max(0, Math.min(1, value));
-}
-function isoDay(now) {
-	return now.toISOString().slice(0, 10);
-}
 function hashQuery(query) {
 	return createHash("sha1").update(query.trim().toLowerCase()).digest("hex").slice(0, 12);
 }
-function buildEntryKey(params) {
-	return `memory:${normalizeMemoryPath(params.path)}:${params.startLine}:${params.endLine}`;
-}
 function mergeRecentDistinct(existing, nextValue, limit) {
 	const seen = /* @__PURE__ */ new Set();
 	const normalized = existing.filter((v) => typeof v === "string").map((v) => v.trim()).filter((v) => v.length > 0 && !seen.has(v) && (seen.add(v), true));
@@ -106,7 +94,7 @@ async function recordDreamingRecalls(params) {
 			skipped += 1;
 			continue;
 		}
-		const score = clampScore(Number(match.score));
+		const score = clamp01(Number(match.score));
 		const key = buildEntryKey({
 			path: file,
 			startLine,
@@ -118,6 +106,12 @@ async function recordDreamingRecalls(params) {
 			...existing,
 			snippet,
 			recallCount: Math.max(0, Math.floor(existing.recallCount + 1)),
+			dailyCount: existing.dailyCount ?? 0,
+			groundedCount: existing.groundedCount ?? 0,
+			lightHits: existing.lightHits ?? 0,
+			remHits: existing.remHits ?? 0,
+			phaseHitCount: existing.phaseHitCount ?? 0,
+			totalSignalCount: Math.max(0, (existing.totalSignalCount ?? existing.recallCount ?? 0) + 1),
 			totalScore: Math.max(0, existing.totalScore + score),
 			maxScore: Math.max(existing.maxScore, score),
 			queryHashes: mergeQueryHashes(existing.queryHashes ?? [], qHash),
@@ -130,6 +124,12 @@ async function recordDreamingRecalls(params) {
 			endLine,
 			snippet,
 			recallCount: 1,
+			dailyCount: 0,
+			groundedCount: 0,
+			lightHits: 0,
+			remHits: 0,
+			phaseHitCount: 0,
+			totalSignalCount: 1,
 			totalScore: score,
 			maxScore: score,
 			queryHashes: [qHash],
@@ -181,7 +181,17 @@ async function loadDreamingStore(params) {
 async function saveDreamingStore(params) {
 	await writeStore(params.workspaceDir, params.store);
 }
+/**
+* Increment a phase-specific signal counter on an existing store entry.
+* Also bumps `phaseHitCount` and `totalSignalCount`.
+* Returns `true` if the entry existed and was updated.
+*/
+function bumpEntryPhaseSignal(entry, field, increment = 1) {
+	entry[field] = (entry[field] ?? 0) + increment;
+	entry.phaseHitCount = (entry.phaseHitCount ?? 0) + increment;
+	entry.totalSignalCount = (entry.totalSignalCount ?? 0) + increment;
+}
 //#endregion
-export { loadDreamingStore, recordDreamingRecalls, saveDreamingStore, withDreamingPromotionLock };
+export { bumpEntryPhaseSignal, loadDreamingStore, recordDreamingRecalls, saveDreamingStore, withDreamingPromotionLock };
 
 //# sourceMappingURL=short-term-store.js.map

package/dist/src/agent/memory/dreaming/short-term-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"short-term-store.js","names":[],"sources":["../../../../../src/agent/memory/dreaming/short-term-store.ts"],"sourcesContent":["import fs from 'node:fs/promises';\nimport path from 'node:path';\nimport { createHash, randomUUID } from 'node:crypto';\n\nimport type { MemorySearchOptions } from '../../prompt/memory/index.js';\nimport { createLogger } from '../../../utils/logger.js';\nimport {\n  SHORT_TERM_PROMOTION_LOCK_RELATIVE,\n  SHORT_TERM_RECALL_STORE_RELATIVE,\n} from './constants.js';\n\nconst log = createLogger('Dreaming:Store');\n\nexport type DreamingStoreEntry = {\n  key: string;\n  path: string; // workspace-relative: memory/YYYY-MM-DD.md\n  startLine: number;\n  endLine: number;\n  snippet: string;\n  recallCount: number;\n  totalScore: number;\n  maxScore: number;\n  queryHashes: string[];\n  recallDays: string[];\n  firstRecalledAt: string;\n  lastRecalledAt: string;\n  promotedAt?: string;\n};\n\nexport type DreamingStore = {\n  version: 1;\n  updatedAt: string;\n  entries: Record<string, DreamingStoreEntry>;\n};\n\ntype MemoryMatch = Awaited<ReturnType<typeof import('../../prompt/memory/index.js').memorySearch>>[number];\n\nfunction normalizeMemoryPath(raw: string): string {\n  return raw.replaceAll('\\\\', '/').replace(/^\\.\\//, '');\n}\n\nfunction isDailyWorkspaceMemoryPath(rel: string): boolean {\n  const p = normalizeMemoryPath(rel);\n  return /^memory\\/\\d{4}-\\d{2}-\\d{2}\\.md$/i.test(p);\n}\n\nfunction clampScore(value: number): number {\n  if (!Number.isFinite(value)) return 0;\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction isoDay(now: Date): string {\n  return now.toISOString().slice(0, 10);\n}\n\nfunction hashQuery(query: string): string {\n  return createHash('sha1').update(query.trim().toLowerCase()).digest('hex').slice(0, 12);\n}\n\nfunction buildEntryKey(params: { path: string; startLine: number; endLine: number }): string {\n  return `memory:${normalizeMemoryPath(params.path)}:${params.startLine}:${params.endLine}`;\n}\n\nfunction mergeRecentDistinct(existing: string[], nextValue: string, limit: number): string[] {\n  const seen = new Set<string>();\n  const normalized = existing\n    .filter((v): v is string => typeof v === 'string')\n    .map((v) => v.trim())\n    .filter((v) => v.length > 0 && !seen.has(v) && (seen.add(v), true));\n  if (nextValue && !normalized.includes(nextValue)) {\n    normalized.push(nextValue);\n  }\n  return normalized.length <= limit ? normalized : normalized.slice(-limit);\n}\n\nfunction mergeQueryHashes(existing: string[], nextHash: string): string[] {\n  const out = mergeRecentDistinct(existing, nextHash, 32);\n  return out;\n}\n\nfunction emptyStore(nowIso: string): DreamingStore {\n  return { version: 1, updatedAt: nowIso, entries: {} };\n}\n\nasync function ensureDreamDir(workspaceDir: string): Promise<string> {\n  const dir = path.join(workspaceDir, path.dirname(SHORT_TERM_RECALL_STORE_RELATIVE));\n  await fs.mkdir(dir, { recursive: true });\n  return dir;\n}\n\nasync function readStore(workspaceDir: string, nowIso: string): Promise<DreamingStore> {\n  const storePath = path.join(workspaceDir, SHORT_TERM_RECALL_STORE_RELATIVE);\n  try {\n    const raw = await fs.readFile(storePath, 'utf-8');\n    const parsed = JSON.parse(raw) as unknown;\n    if (!parsed || typeof parsed !== 'object') return emptyStore(nowIso);\n    const rec = parsed as Partial<DreamingStore>;\n    if (rec.version !== 1 || !rec.entries || typeof rec.entries !== 'object') {\n      return emptyStore(nowIso);\n    }\n    return {\n      version: 1,\n      updatedAt: typeof rec.updatedAt === 'string' ? rec.updatedAt : nowIso,\n      entries: rec.entries as Record<string, DreamingStoreEntry>,\n    };\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException | undefined)?.code;\n    if (code === 'ENOENT') return emptyStore(nowIso);\n    log.warn({ err, workspaceDir }, 'Failed to read dreaming store; resetting');\n    return emptyStore(nowIso);\n  }\n}\n\nasync function writeStore(workspaceDir: string, store: DreamingStore): Promise<void> {\n  await ensureDreamDir(workspaceDir);\n  const storePath = path.join(workspaceDir, SHORT_TERM_RECALL_STORE_RELATIVE);\n  const tmp = `${storePath}.${process.pid}.${Date.now()}.${randomUUID()}.tmp`;\n  await fs.writeFile(tmp, `${JSON.stringify(store, null, 2)}\\n`, 'utf-8');\n  await fs.rename(tmp, storePath);\n}\n\nexport async function recordDreamingRecalls(params: {\n  workspaceDir: string;\n  query: string;\n  matches: MemoryMatch[];\n  options?: MemorySearchOptions;\n  now?: Date;\n}): Promise<{ recorded: number; skipped: number; storePath: string }> {\n  const workspaceDir = params.workspaceDir.trim();\n  const query = params.query.trim();\n  if (!workspaceDir || !query) {\n    return { recorded: 0, skipped: params.matches.length, storePath: SHORT_TERM_RECALL_STORE_RELATIVE };\n  }\n  const now = params.now ?? new Date();\n  const nowIso = now.toISOString();\n  const dayBucket = isoDay(now);\n  const qHash = hashQuery(query);\n\n  const store = await readStore(workspaceDir, nowIso);\n\n  let recorded = 0;\n  let skipped = 0;\n  for (const match of params.matches) {\n    const file = typeof match?.file === \"string\" ? match.file : \"\";\n    if (!file || !isDailyWorkspaceMemoryPath(file)) {\n      skipped += 1;\n      continue;\n    }\n    const lines = typeof match?.lines === \"string\" ? match.lines.trim() : \"\";\n    const lineNumbers = Array.isArray(match?.lineNumbers) ? match.lineNumbers : [];\n    const startLine = Math.max(1, Math.min(...lineNumbers.filter((n) => Number.isFinite(n) && n > 0)));\n    const endLine = Math.max(startLine, Math.max(...lineNumbers.filter((n) => Number.isFinite(n) && n > 0)));\n    if (!Number.isFinite(startLine) || !Number.isFinite(endLine)) {\n      skipped += 1;\n      continue;\n    }\n    const score = clampScore(Number(match.score));\n    const key = buildEntryKey({ path: file, startLine, endLine });\n    const existing = store.entries[key];\n    const snippet = lines.length > 0 ? lines.slice(0, 360) : file;\n\n    const next: DreamingStoreEntry = existing\n      ? {\n          ...existing,\n          snippet,\n          recallCount: Math.max(0, Math.floor(existing.recallCount + 1)),\n          totalScore: Math.max(0, existing.totalScore + score),\n          maxScore: Math.max(existing.maxScore, score),\n          queryHashes: mergeQueryHashes(existing.queryHashes ?? [], qHash),\n          recallDays: mergeRecentDistinct(existing.recallDays ?? [], dayBucket, 16),\n          lastRecalledAt: nowIso,\n        }\n      : {\n          key,\n          path: normalizeMemoryPath(file),\n          startLine,\n          endLine,\n          snippet,\n          recallCount: 1,\n          totalScore: score,\n          maxScore: score,\n          queryHashes: [qHash],\n          recallDays: [dayBucket],\n          firstRecalledAt: nowIso,\n          lastRecalledAt: nowIso,\n        };\n\n    store.entries[key] = next;\n    recorded += 1;\n  }\n\n  if (recorded > 0) {\n    store.updatedAt = nowIso;\n    await writeStore(workspaceDir, store);\n  }\n\n  return {\n    recorded,\n    skipped,\n    storePath: SHORT_TERM_RECALL_STORE_RELATIVE,\n  };\n}\n\nexport async function withDreamingPromotionLock<T>(\n  workspaceDir: string,\n  task: () => Promise<T>,\n): Promise<T> {\n  const lockPath = path.join(workspaceDir, SHORT_TERM_PROMOTION_LOCK_RELATIVE);\n  await ensureDreamDir(workspaceDir);\n\n  const startedAt = Date.now();\n  const timeoutMs = 10_000;\n  const retryDelayMs = 50;\n\n  while (true) {\n    try {\n      const handle = await fs.open(lockPath, 'wx');\n      await handle.writeFile(`${process.pid}:${Date.now()}\\n`, 'utf-8').catch(() => undefined);\n      try {\n        return await task();\n      } finally {\n        await handle.close().catch(() => undefined);\n        await fs.unlink(lockPath).catch(() => undefined);\n      }\n    } catch (err) {\n      const code = (err as NodeJS.ErrnoException | undefined)?.code;\n      if (code !== 'EEXIST') {\n        throw err;\n      }\n      if (Date.now() - startedAt >= timeoutMs) {\n        throw new Error(`Timed out waiting for dreaming promotion lock at ${lockPath}`);\n      }\n      await new Promise((r) => setTimeout(r, retryDelayMs));\n    }\n  }\n}\n\nexport async function loadDreamingStore(params: {\n  workspaceDir: string;\n}): Promise<{ store: DreamingStore; storePath: string }> {\n  const nowIso = new Date().toISOString();\n  const store = await readStore(params.workspaceDir, nowIso);\n  return { store, storePath: SHORT_TERM_RECALL_STORE_RELATIVE };\n}\n\nexport async function saveDreamingStore(params: {\n  workspaceDir: string;\n  store: DreamingStore;\n}): Promise<void> {\n  await writeStore(params.workspaceDir, params.store);\n}\n\n"],"mappings":";;;;;;;aAKwD;AAMxD,MAAM,MAAM,aAAa,iBAAiB;AA0B1C,SAAS,oBAAoB,KAAqB;AAChD,QAAO,IAAI,WAAW,MAAM,IAAI,CAAC,QAAQ,SAAS,GAAG;;AAGvD,SAAS,2BAA2B,KAAsB;CACxD,MAAM,IAAI,oBAAoB,IAAI;AAClC,QAAO,mCAAmC,KAAK,EAAE;;AAGnD,SAAS,WAAW,OAAuB;AACzC,KAAI,CAAC,OAAO,SAAS,MAAM,CAAE,QAAO;AACpC,QAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC;;AAGxC,SAAS,OAAO,KAAmB;AACjC,QAAO,IAAI,aAAa,CAAC,MAAM,GAAG,GAAG;;AAGvC,SAAS,UAAU,OAAuB;AACxC,QAAO,WAAW,OAAO,CAAC,OAAO,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC,OAAO,MAAM,CAAC,MAAM,GAAG,GAAG;;AAGzF,SAAS,cAAc,QAAsE;AAC3F,QAAO,UAAU,oBAAoB,OAAO,KAAK,CAAC,GAAG,OAAO,UAAU,GAAG,OAAO;;AAGlF,SAAS,oBAAoB,UAAoB,WAAmB,OAAyB;CAC3F,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,aAAa,SAChB,QAAQ,MAAmB,OAAO,MAAM,SAAS,CACjD,KAAK,MAAM,EAAE,MAAM,CAAC,CACpB,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,EAAE,MAAM;AACrE,KAAI,aAAa,CAAC,WAAW,SAAS,UAAU,CAC9C,YAAW,KAAK,UAAU;AAE5B,QAAO,WAAW,UAAU,QAAQ,aAAa,WAAW,MAAM,CAAC,MAAM;;AAG3E,SAAS,iBAAiB,UAAoB,UAA4B;AAExE,QADY,oBAAoB,UAAU,UAAU,GAC1C;;AAGZ,SAAS,WAAW,QAA+B;AACjD,QAAO;EAAE,SAAS;EAAG,WAAW;EAAQ,SAAS,EAAE;EAAE;;AAGvD,eAAe,eAAe,cAAuC;CACnE,MAAM,MAAM,KAAK,KAAK,cAAc,KAAK,QAAQ,iCAAiC,CAAC;AACnF,OAAM,GAAG,MAAM,KAAK,EAAE,WAAW,MAAM,CAAC;AACxC,QAAO;;AAGT,eAAe,UAAU,cAAsB,QAAwC;CACrF,MAAM,YAAY,KAAK,KAAK,cAAc,iCAAiC;AAC3E,KAAI;EACF,MAAM,MAAM,MAAM,GAAG,SAAS,WAAW,QAAQ;EACjD,MAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,MAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO,WAAW,OAAO;EACpE,MAAM,MAAM;AACZ,MAAI,IAAI,YAAY,KAAK,CAAC,IAAI,WAAW,OAAO,IAAI,YAAY,SAC9D,QAAO,WAAW,OAAO;AAE3B,SAAO;GACL,SAAS;GACT,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,YAAY;GAC/D,SAAS,IAAI;GACd;UACM,KAAK;AAEZ,MADc,KAA2C,SAC5C,SAAU,QAAO,WAAW,OAAO;AAChD,MAAI,KAAK;GAAE;GAAK;GAAc,EAAE,2CAA2C;AAC3E,SAAO,WAAW,OAAO;;;AAI7B,eAAe,WAAW,cAAsB,OAAqC;AACnF,OAAM,eAAe,aAAa;CAClC,MAAM,YAAY,KAAK,KAAK,cAAc,iCAAiC;CAC3E,MAAM,MAAM,GAAG,UAAU,GAAG,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG,YAAY,CAAC;AACtE,OAAM,GAAG,UAAU,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,EAAE,CAAC,KAAK,QAAQ;AACvE,OAAM,GAAG,OAAO,KAAK,UAAU;;AAGjC,eAAsB,sBAAsB,QAM0B;CACpE,MAAM,eAAe,OAAO,aAAa,MAAM;CAC/C,MAAM,QAAQ,OAAO,MAAM,MAAM;AACjC,KAAI,CAAC,gBAAgB,CAAC,MACpB,QAAO;EAAE,UAAU;EAAG,SAAS,OAAO,QAAQ;EAAQ,WAAW;EAAkC;CAErG,MAAM,MAAM,OAAO,uBAAO,IAAI,MAAM;CACpC,MAAM,SAAS,IAAI,aAAa;CAChC,MAAM,YAAY,OAAO,IAAI;CAC7B,MAAM,QAAQ,UAAU,MAAM;CAE9B,MAAM,QAAQ,MAAM,UAAU,cAAc,OAAO;CAEnD,IAAI,WAAW;CACf,IAAI,UAAU;AACd,MAAK,MAAM,SAAS,OAAO,SAAS;EAClC,MAAM,OAAO,OAAO,OAAO,SAAS,WAAW,MAAM,OAAO;AAC5D,MAAI,CAAC,QAAQ,CAAC,2BAA2B,KAAK,EAAE;AAC9C,cAAW;AACX;;EAEF,MAAM,QAAQ,OAAO,OAAO,UAAU,WAAW,MAAM,MAAM,MAAM,GAAG;EACtE,MAAM,cAAc,MAAM,QAAQ,OAAO,YAAY,GAAG,MAAM,cAAc,EAAE;EAC9E,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,YAAY,QAAQ,MAAM,OAAO,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;EAClG,MAAM,UAAU,KAAK,IAAI,WAAW,KAAK,IAAI,GAAG,YAAY,QAAQ,MAAM,OAAO,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;AACxG,MAAI,CAAC,OAAO,SAAS,UAAU,IAAI,CAAC,OAAO,SAAS,QAAQ,EAAE;AAC5D,cAAW;AACX;;EAEF,MAAM,QAAQ,WAAW,OAAO,MAAM,MAAM,CAAC;EAC7C,MAAM,MAAM,cAAc;GAAE,MAAM;GAAM;GAAW;GAAS,CAAC;EAC7D,MAAM,WAAW,MAAM,QAAQ;EAC/B,MAAM,UAAU,MAAM,SAAS,IAAI,MAAM,MAAM,GAAG,IAAI,GAAG;EAEzD,MAAM,OAA2B,WAC7B;GACE,GAAG;GACH;GACA,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,cAAc,EAAE,CAAC;GAC9D,YAAY,KAAK,IAAI,GAAG,SAAS,aAAa,MAAM;GACpD,UAAU,KAAK,IAAI,SAAS,UAAU,MAAM;GAC5C,aAAa,iBAAiB,SAAS,eAAe,EAAE,EAAE,MAAM;GAChE,YAAY,oBAAoB,SAAS,cAAc,EAAE,EAAE,WAAW,GAAG;GACzE,gBAAgB;GACjB,GACD;GACE;GACA,MAAM,oBAAoB,KAAK;GAC/B;GACA;GACA;GACA,aAAa;GACb,YAAY;GACZ,UAAU;GACV,aAAa,CAAC,MAAM;GACpB,YAAY,CAAC,UAAU;GACvB,iBAAiB;GACjB,gBAAgB;GACjB;AAEL,QAAM,QAAQ,OAAO;AACrB,cAAY;;AAGd,KAAI,WAAW,GAAG;AAChB,QAAM,YAAY;AAClB,QAAM,WAAW,cAAc,MAAM;;AAGvC,QAAO;EACL;EACA;EACA,WAAW;EACZ;;AAGH,eAAsB,0BACpB,cACA,MACY;CACZ,MAAM,WAAW,KAAK,KAAK,cAAc,mCAAmC;AAC5E,OAAM,eAAe,aAAa;CAElC,MAAM,YAAY,KAAK,KAAK;CAC5B,MAAM,YAAY;CAClB,MAAM,eAAe;AAErB,QAAO,KACL,KAAI;EACF,MAAM,SAAS,MAAM,GAAG,KAAK,UAAU,KAAK;AAC5C,QAAM,OAAO,UAAU,GAAG,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC,KAAK,QAAQ,CAAC,YAAY,KAAA,EAAU;AACxF,MAAI;AACF,UAAO,MAAM,MAAM;YACX;AACR,SAAM,OAAO,OAAO,CAAC,YAAY,KAAA,EAAU;AAC3C,SAAM,GAAG,OAAO,SAAS,CAAC,YAAY,KAAA,EAAU;;UAE3C,KAAK;AAEZ,MADc,KAA2C,SAC5C,SACX,OAAM;AAER,MAAI,KAAK,KAAK,GAAG,aAAa,UAC5B,OAAM,IAAI,MAAM,oDAAoD,WAAW;AAEjF,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,aAAa,CAAC;;;AAK3D,eAAsB,kBAAkB,QAEiB;CACvD,MAAM,0BAAS,IAAI,MAAM,EAAC,aAAa;AAEvC,QAAO;EAAE,OAAA,MADW,UAAU,OAAO,cAAc,OAAO;EAC1C,WAAW;EAAkC;;AAG/D,eAAsB,kBAAkB,QAGtB;AAChB,OAAM,WAAW,OAAO,cAAc,OAAO,MAAM"}
+{"version":3,"file":"short-term-store.js","names":[],"sources":["../../../../../src/agent/memory/dreaming/short-term-store.ts"],"sourcesContent":["import fs from 'node:fs/promises';\nimport path from 'node:path';\nimport { createHash, randomUUID } from 'node:crypto';\n\nimport type { MemorySearchOptions } from '../../prompt/memory/index.js';\nimport { createLogger } from '../../../utils/logger.js';\nimport {\n  SHORT_TERM_PROMOTION_LOCK_RELATIVE,\n  SHORT_TERM_RECALL_STORE_RELATIVE,\n} from './constants.js';\nimport { buildEntryKey, clamp01, isoDay, normalizeMemoryPath } from './utils.js';\n\nconst log = createLogger('Dreaming:Store');\n\nexport type DreamingStoreEntry = {\n  key: string;\n  path: string; // workspace-relative: memory/YYYY-MM-DD.md\n  startLine: number;\n  endLine: number;\n  snippet: string;\n\n  // ── Signal dimensions ────────────────────────────────────────────────\n  /** Number of times this snippet was returned by a memory recall query. */\n  recallCount: number;\n  /** Number of times recorded from daily log scanning (light sweep). */\n  dailyCount: number;\n  /** Number of times replayed from grounded context (agent-initiated). */\n  groundedCount: number;\n  /** Number of times the light phase touched this entry. */\n  lightHits: number;\n  /** Number of times the REM phase touched this entry. */\n  remHits: number;\n  /** Cross-phase hit count (light + deep + rem combined touches). */\n  phaseHitCount: number;\n  /** Weighted aggregate of all signal dimensions. */\n  totalSignalCount: number;\n\n  // ── Score tracking ───────────────────────────────────────────────────\n  totalScore: number;\n  maxScore: number;\n  queryHashes: string[];\n  recallDays: string[];\n\n  // ── Timestamps ───────────────────────────────────────────────────────\n  firstRecalledAt: string;\n  lastRecalledAt: string;\n  promotedAt?: string;\n};\n\nexport type DreamingStore = {\n  version: 1;\n  updatedAt: string;\n  entries: Record<string, DreamingStoreEntry>;\n};\n\ntype MemoryMatch = Awaited<ReturnType<typeof import('../../prompt/memory/index.js').memorySearch>>[number];\n\nfunction isDailyWorkspaceMemoryPath(rel: string): boolean {\n  const p = normalizeMemoryPath(rel);\n  return /^memory\\/\\d{4}-\\d{2}-\\d{2}\\.md$/i.test(p);\n}\n\nfunction hashQuery(query: string): string {\n  return createHash('sha1').update(query.trim().toLowerCase()).digest('hex').slice(0, 12);\n}\n\nfunction mergeRecentDistinct(existing: string[], nextValue: string, limit: number): string[] {\n  const seen = new Set<string>();\n  const normalized = existing\n    .filter((v): v is string => typeof v === 'string')\n    .map((v) => v.trim())\n    .filter((v) => v.length > 0 && !seen.has(v) && (seen.add(v), true));\n  if (nextValue && !normalized.includes(nextValue)) {\n    normalized.push(nextValue);\n  }\n  return normalized.length <= limit ? normalized : normalized.slice(-limit);\n}\n\nfunction mergeQueryHashes(existing: string[], nextHash: string): string[] {\n  const out = mergeRecentDistinct(existing, nextHash, 32);\n  return out;\n}\n\nfunction emptyStore(nowIso: string): DreamingStore {\n  return { version: 1, updatedAt: nowIso, entries: {} };\n}\n\nasync function ensureDreamDir(workspaceDir: string): Promise<string> {\n  const dir = path.join(workspaceDir, path.dirname(SHORT_TERM_RECALL_STORE_RELATIVE));\n  await fs.mkdir(dir, { recursive: true });\n  return dir;\n}\n\nasync function readStore(workspaceDir: string, nowIso: string): Promise<DreamingStore> {\n  const storePath = path.join(workspaceDir, SHORT_TERM_RECALL_STORE_RELATIVE);\n  try {\n    const raw = await fs.readFile(storePath, 'utf-8');\n    const parsed = JSON.parse(raw) as unknown;\n    if (!parsed || typeof parsed !== 'object') return emptyStore(nowIso);\n    const rec = parsed as Partial<DreamingStore>;\n    if (rec.version !== 1 || !rec.entries || typeof rec.entries !== 'object') {\n      return emptyStore(nowIso);\n    }\n    return {\n      version: 1,\n      updatedAt: typeof rec.updatedAt === 'string' ? rec.updatedAt : nowIso,\n      entries: rec.entries as Record<string, DreamingStoreEntry>,\n    };\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException | undefined)?.code;\n    if (code === 'ENOENT') return emptyStore(nowIso);\n    log.warn({ err, workspaceDir }, 'Failed to read dreaming store; resetting');\n    return emptyStore(nowIso);\n  }\n}\n\nasync function writeStore(workspaceDir: string, store: DreamingStore): Promise<void> {\n  await ensureDreamDir(workspaceDir);\n  const storePath = path.join(workspaceDir, SHORT_TERM_RECALL_STORE_RELATIVE);\n  const tmp = `${storePath}.${process.pid}.${Date.now()}.${randomUUID()}.tmp`;\n  await fs.writeFile(tmp, `${JSON.stringify(store, null, 2)}\\n`, 'utf-8');\n  await fs.rename(tmp, storePath);\n}\n\nexport async function recordDreamingRecalls(params: {\n  workspaceDir: string;\n  query: string;\n  matches: MemoryMatch[];\n  options?: MemorySearchOptions;\n  now?: Date;\n}): Promise<{ recorded: number; skipped: number; storePath: string }> {\n  const workspaceDir = params.workspaceDir.trim();\n  const query = params.query.trim();\n  if (!workspaceDir || !query) {\n    return { recorded: 0, skipped: params.matches.length, storePath: SHORT_TERM_RECALL_STORE_RELATIVE };\n  }\n  const now = params.now ?? new Date();\n  const nowIso = now.toISOString();\n  const dayBucket = isoDay(now);\n  const qHash = hashQuery(query);\n\n  const store = await readStore(workspaceDir, nowIso);\n\n  let recorded = 0;\n  let skipped = 0;\n  for (const match of params.matches) {\n    const file = typeof match?.file === \"string\" ? match.file : \"\";\n    if (!file || !isDailyWorkspaceMemoryPath(file)) {\n      skipped += 1;\n      continue;\n    }\n    const lines = typeof match?.lines === \"string\" ? match.lines.trim() : \"\";\n    const lineNumbers = Array.isArray(match?.lineNumbers) ? match.lineNumbers : [];\n    const startLine = Math.max(1, Math.min(...lineNumbers.filter((n) => Number.isFinite(n) && n > 0)));\n    const endLine = Math.max(startLine, Math.max(...lineNumbers.filter((n) => Number.isFinite(n) && n > 0)));\n    if (!Number.isFinite(startLine) || !Number.isFinite(endLine)) {\n      skipped += 1;\n      continue;\n    }\n    const score = clamp01(Number(match.score));\n    const key = buildEntryKey({ path: file, startLine, endLine });\n    const existing = store.entries[key];\n    const snippet = lines.length > 0 ? lines.slice(0, 360) : file;\n\n    const next: DreamingStoreEntry = existing\n      ? {\n          ...existing,\n          snippet,\n          recallCount: Math.max(0, Math.floor(existing.recallCount + 1)),\n          dailyCount: existing.dailyCount ?? 0,\n          groundedCount: existing.groundedCount ?? 0,\n          lightHits: existing.lightHits ?? 0,\n          remHits: existing.remHits ?? 0,\n          phaseHitCount: existing.phaseHitCount ?? 0,\n          totalSignalCount: Math.max(0, (existing.totalSignalCount ?? existing.recallCount ?? 0) + 1),\n          totalScore: Math.max(0, existing.totalScore + score),\n          maxScore: Math.max(existing.maxScore, score),\n          queryHashes: mergeQueryHashes(existing.queryHashes ?? [], qHash),\n          recallDays: mergeRecentDistinct(existing.recallDays ?? [], dayBucket, 16),\n          lastRecalledAt: nowIso,\n        }\n      : {\n          key,\n          path: normalizeMemoryPath(file),\n          startLine,\n          endLine,\n          snippet,\n          recallCount: 1,\n          dailyCount: 0,\n          groundedCount: 0,\n          lightHits: 0,\n          remHits: 0,\n          phaseHitCount: 0,\n          totalSignalCount: 1,\n          totalScore: score,\n          maxScore: score,\n          queryHashes: [qHash],\n          recallDays: [dayBucket],\n          firstRecalledAt: nowIso,\n          lastRecalledAt: nowIso,\n        };\n\n    store.entries[key] = next;\n    recorded += 1;\n  }\n\n  if (recorded > 0) {\n    store.updatedAt = nowIso;\n    await writeStore(workspaceDir, store);\n  }\n\n  return {\n    recorded,\n    skipped,\n    storePath: SHORT_TERM_RECALL_STORE_RELATIVE,\n  };\n}\n\nexport async function withDreamingPromotionLock<T>(\n  workspaceDir: string,\n  task: () => Promise<T>,\n): Promise<T> {\n  const lockPath = path.join(workspaceDir, SHORT_TERM_PROMOTION_LOCK_RELATIVE);\n  await ensureDreamDir(workspaceDir);\n\n  const startedAt = Date.now();\n  const timeoutMs = 10_000;\n  const retryDelayMs = 50;\n\n  while (true) {\n    try {\n      const handle = await fs.open(lockPath, 'wx');\n      await handle.writeFile(`${process.pid}:${Date.now()}\\n`, 'utf-8').catch(() => undefined);\n      try {\n        return await task();\n      } finally {\n        await handle.close().catch(() => undefined);\n        await fs.unlink(lockPath).catch(() => undefined);\n      }\n    } catch (err) {\n      const code = (err as NodeJS.ErrnoException | undefined)?.code;\n      if (code !== 'EEXIST') {\n        throw err;\n      }\n      if (Date.now() - startedAt >= timeoutMs) {\n        throw new Error(`Timed out waiting for dreaming promotion lock at ${lockPath}`);\n      }\n      await new Promise((r) => setTimeout(r, retryDelayMs));\n    }\n  }\n}\n\nexport async function loadDreamingStore(params: {\n  workspaceDir: string;\n}): Promise<{ store: DreamingStore; storePath: string }> {\n  const nowIso = new Date().toISOString();\n  const store = await readStore(params.workspaceDir, nowIso);\n  return { store, storePath: SHORT_TERM_RECALL_STORE_RELATIVE };\n}\n\nexport async function saveDreamingStore(params: {\n  workspaceDir: string;\n  store: DreamingStore;\n}): Promise<void> {\n  await writeStore(params.workspaceDir, params.store);\n}\n\n// ── Phase-level signal helpers ─────────────────────────────────────────\n\ntype PhaseSignalField = 'dailyCount' | 'groundedCount' | 'lightHits' | 'remHits';\n\n/**\n * Increment a phase-specific signal counter on an existing store entry.\n * Also bumps `phaseHitCount` and `totalSignalCount`.\n * Returns `true` if the entry existed and was updated.\n */\nexport function bumpEntryPhaseSignal(\n  entry: DreamingStoreEntry,\n  field: PhaseSignalField,\n  increment = 1,\n): void {\n  entry[field] = (entry[field] ?? 0) + increment;\n  entry.phaseHitCount = (entry.phaseHitCount ?? 0) + increment;\n  entry.totalSignalCount = (entry.totalSignalCount ?? 0) + increment;\n}\n\n"],"mappings":";;;;;;;;aAKwD;AAOxD,MAAM,MAAM,aAAa,iBAAiB;AA6C1C,SAAS,2BAA2B,KAAsB;CACxD,MAAM,IAAI,oBAAoB,IAAI;AAClC,QAAO,mCAAmC,KAAK,EAAE;;AAGnD,SAAS,UAAU,OAAuB;AACxC,QAAO,WAAW,OAAO,CAAC,OAAO,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC,OAAO,MAAM,CAAC,MAAM,GAAG,GAAG;;AAGzF,SAAS,oBAAoB,UAAoB,WAAmB,OAAyB;CAC3F,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,aAAa,SAChB,QAAQ,MAAmB,OAAO,MAAM,SAAS,CACjD,KAAK,MAAM,EAAE,MAAM,CAAC,CACpB,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,EAAE,MAAM;AACrE,KAAI,aAAa,CAAC,WAAW,SAAS,UAAU,CAC9C,YAAW,KAAK,UAAU;AAE5B,QAAO,WAAW,UAAU,QAAQ,aAAa,WAAW,MAAM,CAAC,MAAM;;AAG3E,SAAS,iBAAiB,UAAoB,UAA4B;AAExE,QADY,oBAAoB,UAAU,UAAU,GAC1C;;AAGZ,SAAS,WAAW,QAA+B;AACjD,QAAO;EAAE,SAAS;EAAG,WAAW;EAAQ,SAAS,EAAE;EAAE;;AAGvD,eAAe,eAAe,cAAuC;CACnE,MAAM,MAAM,KAAK,KAAK,cAAc,KAAK,QAAQ,iCAAiC,CAAC;AACnF,OAAM,GAAG,MAAM,KAAK,EAAE,WAAW,MAAM,CAAC;AACxC,QAAO;;AAGT,eAAe,UAAU,cAAsB,QAAwC;CACrF,MAAM,YAAY,KAAK,KAAK,cAAc,iCAAiC;AAC3E,KAAI;EACF,MAAM,MAAM,MAAM,GAAG,SAAS,WAAW,QAAQ;EACjD,MAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,MAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO,WAAW,OAAO;EACpE,MAAM,MAAM;AACZ,MAAI,IAAI,YAAY,KAAK,CAAC,IAAI,WAAW,OAAO,IAAI,YAAY,SAC9D,QAAO,WAAW,OAAO;AAE3B,SAAO;GACL,SAAS;GACT,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,YAAY;GAC/D,SAAS,IAAI;GACd;UACM,KAAK;AAEZ,MADc,KAA2C,SAC5C,SAAU,QAAO,WAAW,OAAO;AAChD,MAAI,KAAK;GAAE;GAAK;GAAc,EAAE,2CAA2C;AAC3E,SAAO,WAAW,OAAO;;;AAI7B,eAAe,WAAW,cAAsB,OAAqC;AACnF,OAAM,eAAe,aAAa;CAClC,MAAM,YAAY,KAAK,KAAK,cAAc,iCAAiC;CAC3E,MAAM,MAAM,GAAG,UAAU,GAAG,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG,YAAY,CAAC;AACtE,OAAM,GAAG,UAAU,KAAK,GAAG,KAAK,UAAU,OAAO,MAAM,EAAE,CAAC,KAAK,QAAQ;AACvE,OAAM,GAAG,OAAO,KAAK,UAAU;;AAGjC,eAAsB,sBAAsB,QAM0B;CACpE,MAAM,eAAe,OAAO,aAAa,MAAM;CAC/C,MAAM,QAAQ,OAAO,MAAM,MAAM;AACjC,KAAI,CAAC,gBAAgB,CAAC,MACpB,QAAO;EAAE,UAAU;EAAG,SAAS,OAAO,QAAQ;EAAQ,WAAW;EAAkC;CAErG,MAAM,MAAM,OAAO,uBAAO,IAAI,MAAM;CACpC,MAAM,SAAS,IAAI,aAAa;CAChC,MAAM,YAAY,OAAO,IAAI;CAC7B,MAAM,QAAQ,UAAU,MAAM;CAE9B,MAAM,QAAQ,MAAM,UAAU,cAAc,OAAO;CAEnD,IAAI,WAAW;CACf,IAAI,UAAU;AACd,MAAK,MAAM,SAAS,OAAO,SAAS;EAClC,MAAM,OAAO,OAAO,OAAO,SAAS,WAAW,MAAM,OAAO;AAC5D,MAAI,CAAC,QAAQ,CAAC,2BAA2B,KAAK,EAAE;AAC9C,cAAW;AACX;;EAEF,MAAM,QAAQ,OAAO,OAAO,UAAU,WAAW,MAAM,MAAM,MAAM,GAAG;EACtE,MAAM,cAAc,MAAM,QAAQ,OAAO,YAAY,GAAG,MAAM,cAAc,EAAE;EAC9E,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,YAAY,QAAQ,MAAM,OAAO,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;EAClG,MAAM,UAAU,KAAK,IAAI,WAAW,KAAK,IAAI,GAAG,YAAY,QAAQ,MAAM,OAAO,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;AACxG,MAAI,CAAC,OAAO,SAAS,UAAU,IAAI,CAAC,OAAO,SAAS,QAAQ,EAAE;AAC5D,cAAW;AACX;;EAEF,MAAM,QAAQ,QAAQ,OAAO,MAAM,MAAM,CAAC;EAC1C,MAAM,MAAM,cAAc;GAAE,MAAM;GAAM;GAAW;GAAS,CAAC;EAC7D,MAAM,WAAW,MAAM,QAAQ;EAC/B,MAAM,UAAU,MAAM,SAAS,IAAI,MAAM,MAAM,GAAG,IAAI,GAAG;EAEzD,MAAM,OAA2B,WAC7B;GACE,GAAG;GACH;GACA,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,cAAc,EAAE,CAAC;GAC9D,YAAY,SAAS,cAAc;GACnC,eAAe,SAAS,iBAAiB;GACzC,WAAW,SAAS,aAAa;GACjC,SAAS,SAAS,WAAW;GAC7B,eAAe,SAAS,iBAAiB;GACzC,kBAAkB,KAAK,IAAI,IAAI,SAAS,oBAAoB,SAAS,eAAe,KAAK,EAAE;GAC3F,YAAY,KAAK,IAAI,GAAG,SAAS,aAAa,MAAM;GACpD,UAAU,KAAK,IAAI,SAAS,UAAU,MAAM;GAC5C,aAAa,iBAAiB,SAAS,eAAe,EAAE,EAAE,MAAM;GAChE,YAAY,oBAAoB,SAAS,cAAc,EAAE,EAAE,WAAW,GAAG;GACzE,gBAAgB;GACjB,GACD;GACE;GACA,MAAM,oBAAoB,KAAK;GAC/B;GACA;GACA;GACA,aAAa;GACb,YAAY;GACZ,eAAe;GACf,WAAW;GACX,SAAS;GACT,eAAe;GACf,kBAAkB;GAClB,YAAY;GACZ,UAAU;GACV,aAAa,CAAC,MAAM;GACpB,YAAY,CAAC,UAAU;GACvB,iBAAiB;GACjB,gBAAgB;GACjB;AAEL,QAAM,QAAQ,OAAO;AACrB,cAAY;;AAGd,KAAI,WAAW,GAAG;AAChB,QAAM,YAAY;AAClB,QAAM,WAAW,cAAc,MAAM;;AAGvC,QAAO;EACL;EACA;EACA,WAAW;EACZ;;AAGH,eAAsB,0BACpB,cACA,MACY;CACZ,MAAM,WAAW,KAAK,KAAK,cAAc,mCAAmC;AAC5E,OAAM,eAAe,aAAa;CAElC,MAAM,YAAY,KAAK,KAAK;CAC5B,MAAM,YAAY;CAClB,MAAM,eAAe;AAErB,QAAO,KACL,KAAI;EACF,MAAM,SAAS,MAAM,GAAG,KAAK,UAAU,KAAK;AAC5C,QAAM,OAAO,UAAU,GAAG,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC,KAAK,QAAQ,CAAC,YAAY,KAAA,EAAU;AACxF,MAAI;AACF,UAAO,MAAM,MAAM;YACX;AACR,SAAM,OAAO,OAAO,CAAC,YAAY,KAAA,EAAU;AAC3C,SAAM,GAAG,OAAO,SAAS,CAAC,YAAY,KAAA,EAAU;;UAE3C,KAAK;AAEZ,MADc,KAA2C,SAC5C,SACX,OAAM;AAER,MAAI,KAAK,KAAK,GAAG,aAAa,UAC5B,OAAM,IAAI,MAAM,oDAAoD,WAAW;AAEjF,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,aAAa,CAAC;;;AAK3D,eAAsB,kBAAkB,QAEiB;CACvD,MAAM,0BAAS,IAAI,MAAM,EAAC,aAAa;AAEvC,QAAO;EAAE,OAAA,MADW,UAAU,OAAO,cAAc,OAAO;EAC1C,WAAW;EAAkC;;AAG/D,eAAsB,kBAAkB,QAGtB;AAChB,OAAM,WAAW,OAAO,cAAc,OAAO,MAAM;;;;;;;AAYrD,SAAgB,qBACd,OACA,OACA,YAAY,GACN;AACN,OAAM,UAAU,MAAM,UAAU,KAAK;AACrC,OAAM,iBAAiB,MAAM,iBAAiB,KAAK;AACnD,OAAM,oBAAoB,MAAM,oBAAoB,KAAK"}

package/dist/src/agent/memory/dreaming/utils.d.ts

@@ -0,0 +1,42 @@
+import type { DreamingDeepConfig } from './config.js';
+import type { DreamingStoreEntry } from './short-term-store.js';
+/** Normalize a workspace-relative memory path: forward slashes, no odd ../ escapes at start. */
+export declare function normalizeMemoryPath(rel: string): string;
+/**
+ * Stable id for a short-term store entry (path + line range).
+ * Format: `{normalizedPath}#{start}-{end}` (1-based, inclusive end).
+ */
+export declare function buildEntryKey(parts: {
+    path: string;
+    startLine: number;
+    endLine: number;
+}): string;
+/** YYYY-MM-DD in local time (for daily `memory/YYYY-MM-DD.md` names). */
+export declare function isoDay(d: Date): string;
+export declare function clamp01(value: number): number;
+/** Fills in deep-phase defaults; mirrors `resolveDreamingConfig` deep object when only partial overrides are given. */
+export declare function resolveDeepDefaults(overrides?: Partial<DreamingDeepConfig>): DreamingDeepConfig;
+export declare function computeCandidateScore(entry: DreamingStoreEntry, nowMs: number, recencyHalfLifeDays: number): {
+    avgScore: number;
+    score: number;
+    recencyDecay: number;
+};
+export declare function compareCandidatesByScore(a: {
+    score: number;
+    key: string;
+}, b: {
+    score: number;
+    key: string;
+}): number;
+export declare function readFileLines(fullPath: string): Promise<string[] | null>;
+/** 1-based inclusive line range. Joins with newlines. */
+export declare function sliceRange(lines: string[], startLine: number, endLine: number): string;
+export declare function isExpiredEntry(lastRecalledAt: string | undefined, nowMs: number, maxAgeDays: number): boolean;
+/** Reject empty, tiny, or absurdly long snippets; blocks obvious “tool error” text. */
+export declare function isContaminatedSnippet(snippet: string): boolean;
+export declare function normalizeSnippetForHash(text: string): string;
+export declare function snippetHash(text: string): string;
+export declare function extractPromotionMarkers(markdown: string): {
+    keys: Set<string>;
+    hashes: Set<string>;
+};