@blamechris/repo-memory 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 blamechris
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,85 @@
+# repo-memory
+
+An MCP server that gives AI coding agents persistent memory about your codebase.
+
+## Why?
+
+AI agents waste tokens re-reading files they've already seen. repo-memory fixes this by:
+- **Caching file summaries** -- exports, imports, purpose, line count
+- **Tracking changes** -- only re-read files that actually changed (SHA-256 hash comparison)
+- **Dependency graphs** -- understand which files depend on which
+- **Task memory** -- remember what's been explored across conversation turns
+- **Token telemetry** -- measure and prove the savings
+
+## Quick Start
+
+### With Claude Code
+Add to your Claude Code MCP settings:
+```json
+{
+  "mcpServers": {
+    "repo-memory": {
+      "command": "npx",
+      "args": ["-y", "repo-memory"]
+    }
+  }
+}
+```
+
+### Manual
+```bash
+npm install -g repo-memory
+repo-memory  # starts MCP server on stdio
+```
+
+## Tools
+
+| Tool | Description |
+|------|-------------|
+| `get_file_summary` | Cached file summary (exports, imports, purpose) |
+| `get_changed_files` | Files changed since last check |
+| `get_project_map` | Structural overview of project |
+| `force_reread` | Force fresh summary generation |
+| `invalidate` | Clear cache entries |
+| `get_dependency_graph` | File dependency relationships |
+| `create_task` | Create investigation task |
+| `get_task_context` | Task state and explored files |
+| `mark_explored` | Mark file as explored for task |
+| `get_token_report` | Token usage telemetry report |
+
+## How It Works
+
+1. Files are hashed (SHA-256) on first access
+2. Summaries extracted via regex analysis (exports, imports, purpose, declarations)
+3. Cached in SQLite (`.repo-memory/cache.db` in your project)
+4. Subsequent requests return cached data if hash unchanged
+5. ~96% token reduction vs reading full files
+
+## Architecture
+
+```
+MCP Server (stdio transport)
+├── Cache Engine (hash, store, invalidation, ranking, GC)
+├── Indexer Pipeline (scanner, summarizer, imports, diff-analyzer)
+├── Dependency Graph (in-memory adjacency maps backed by SQLite)
+├── Task Memory (CRUD, exploration tracking, frontier)
+├── Telemetry (token tracking, sampling, export)
+├── Session Manager (cross-turn persistence)
+└── Persistence Layer (SQLite with WAL mode)
+```
+
+## Development
+
+```bash
+git clone https://github.com/blamechris/repo-memory.git
+cd repo-memory
+npm install
+npm test           # unit tests
+npm run test:integration  # integration tests
+npm run typecheck  # TypeScript check
+npm run lint       # ESLint
+npm run build      # compile
+```
+
+## License
+MIT

package/dist/cache/gc.d.ts

@@ -0,0 +1,14 @@
+export interface GCOptions {
+    cacheMaxAgeDays?: number;
+    taskMaxAgeDays?: number;
+    telemetryMaxAgeDays?: number;
+    dryRun?: boolean;
+}
+export interface GCResult {
+    removedCacheEntries: string[];
+    removedTasks: string[];
+    removedTelemetryCount: number;
+    removedOrphanImports: number;
+}
+export declare function runGC(projectRoot: string, options?: GCOptions): Promise<GCResult>;
+//# sourceMappingURL=gc.d.ts.map

package/dist/cache/gc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gc.d.ts","sourceRoot":"","sources":["../../src/cache/gc.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,SAAS;IACxB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,QAAQ;IACvB,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,qBAAqB,EAAE,MAAM,CAAC;IAC9B,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAID,wBAAsB,KAAK,CACzB,WAAW,EAAE,MAAM,EACnB,OAAO,CAAC,EAAE,SAAS,GAClB,OAAO,CAAC,QAAQ,CAAC,CA4FnB"}

package/dist/cache/gc.js

@@ -0,0 +1,75 @@
+import { getDatabase } from '../persistence/db.js';
+import { CacheStore } from './store.js';
+import { scanProject } from '../indexer/scanner.js';
+const MS_PER_DAY = 24 * 60 * 60 * 1000;
+export async function runGC(projectRoot, options) {
+    const cacheMaxAgeDays = options?.cacheMaxAgeDays ?? 30;
+    const taskMaxAgeDays = options?.taskMaxAgeDays ?? 30;
+    const telemetryMaxAgeDays = options?.telemetryMaxAgeDays ?? 90;
+    const dryRun = options?.dryRun ?? false;
+    const db = getDatabase(projectRoot);
+    const store = new CacheStore(projectRoot);
+    const result = {
+        removedCacheEntries: [],
+        removedTasks: [],
+        removedTelemetryCount: 0,
+        removedOrphanImports: 0,
+    };
+    // 1. Remove cache entries for deleted files
+    const currentFiles = new Set(await scanProject(projectRoot));
+    const allEntries = store.getAllEntries();
+    const deletedFilePaths = allEntries
+        .filter((entry) => !currentFiles.has(entry.path))
+        .map((entry) => entry.path);
+    result.removedCacheEntries.push(...deletedFilePaths);
+    // 2. Remove old cache entries (by lastChecked age)
+    const staleEntries = store.getStaleEntries(cacheMaxAgeDays * MS_PER_DAY);
+    const stalePaths = staleEntries
+        .filter((entry) => !result.removedCacheEntries.includes(entry.path))
+        .map((entry) => entry.path);
+    result.removedCacheEntries.push(...stalePaths);
+    if (!dryRun) {
+        for (const path of result.removedCacheEntries) {
+            store.deleteEntry(path);
+        }
+    }
+    // 3. Remove old completed/archived tasks
+    const taskCutoff = Date.now() - taskMaxAgeDays * MS_PER_DAY;
+    const oldTasks = db
+        .prepare(`SELECT id FROM tasks
+       WHERE state IN ('completed', 'archived')
+         AND updated_at < ?`)
+        .all(taskCutoff);
+    result.removedTasks = oldTasks.map((t) => t.id);
+    if (!dryRun && result.removedTasks.length > 0) {
+        const deleteTaskFiles = db.prepare('DELETE FROM task_files WHERE task_id = ?');
+        const deleteTask = db.prepare('DELETE FROM tasks WHERE id = ?');
+        const deleteTasks = db.transaction(() => {
+            for (const id of result.removedTasks) {
+                deleteTaskFiles.run(id);
+                deleteTask.run(id);
+            }
+        });
+        deleteTasks();
+    }
+    // 4. Remove old telemetry events
+    const telemetryCutoff = Date.now() - telemetryMaxAgeDays * MS_PER_DAY;
+    const telemetryCount = db
+        .prepare('SELECT COUNT(*) as count FROM telemetry WHERE timestamp < ?')
+        .get(telemetryCutoff);
+    result.removedTelemetryCount = telemetryCount.count;
+    if (!dryRun && result.removedTelemetryCount > 0) {
+        db.prepare('DELETE FROM telemetry WHERE timestamp < ?').run(telemetryCutoff);
+    }
+    // 5. Remove orphan import records (source not in files table)
+    const orphanCount = db
+        .prepare(`SELECT COUNT(*) as count FROM imports
+       WHERE source NOT IN (SELECT path FROM files)`)
+        .get();
+    result.removedOrphanImports = orphanCount.count;
+    if (!dryRun && result.removedOrphanImports > 0) {
+        db.prepare('DELETE FROM imports WHERE source NOT IN (SELECT path FROM files)').run();
+    }
+    return result;
+}
+//# sourceMappingURL=gc.js.map

package/dist/cache/gc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gc.js","sourceRoot":"","sources":["../../src/cache/gc.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAgBpD,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEvC,MAAM,CAAC,KAAK,UAAU,KAAK,CACzB,WAAmB,EACnB,OAAmB;IAEnB,MAAM,eAAe,GAAG,OAAO,EAAE,eAAe,IAAI,EAAE,CAAC;IACvD,MAAM,cAAc,GAAG,OAAO,EAAE,cAAc,IAAI,EAAE,CAAC;IACrD,MAAM,mBAAmB,GAAG,OAAO,EAAE,mBAAmB,IAAI,EAAE,CAAC;IAC/D,MAAM,MAAM,GAAG,OAAO,EAAE,MAAM,IAAI,KAAK,CAAC;IAExC,MAAM,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;IAE1C,MAAM,MAAM,GAAa;QACvB,mBAAmB,EAAE,EAAE;QACvB,YAAY,EAAE,EAAE;QAChB,qBAAqB,EAAE,CAAC;QACxB,oBAAoB,EAAE,CAAC;KACxB,CAAC;IAEF,4CAA4C;IAC5C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IACzC,MAAM,gBAAgB,GAAG,UAAU;SAChC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SAChD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE9B,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;IAErD,mDAAmD;IACnD,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,eAAe,GAAG,UAAU,CAAC,CAAC;IACzE,MAAM,UAAU,GAAG,YAAY;SAC5B,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SACnE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE9B,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;IAE/C,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,mBAAmB,EAAE,CAAC;YAC9C,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,cAAc,GAAG,UAAU,CAAC;IAC5D,MAAM,QAAQ,GAAG,EAAE;SAChB,OAAO,CACN;;4BAEsB,CACvB;SACA,GAAG,CAAC,UAAU,CAA0B,CAAC;IAE5C,MAAM,CAAC,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEhD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;QAC/E,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACtC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACrC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxB,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,WAAW,EAAE,CAAC;IAChB,CAAC;IAED,iCAAiC;IACjC,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,mBAAmB,GAAG,UAAU,CAAC;IACtE,MAAM,cAAc,GAAG,EAAE;SACtB,OAAO,CAAC,6DAA6D,CAAC;SACtE,GAAG,CAAC,eAAe,CAAsB,CAAC;IAE7C,MAAM,CAAC,qBAAqB,GAAG,cAAc,CAAC,KAAK,CAAC;IAEpD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,qBAAqB,GAAG,CAAC,EAAE,CAAC;QAChD,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC/E,CAAC;IAED,8DAA8D;IAC9D,MAAM,WAAW,GAAG,EAAE;SACnB,OAAO,CACN;oDAC8C,CAC/C;SACA,GAAG,EAAuB,CAAC;IAE9B,MAAM,CAAC,oBAAoB,GAAG,WAAW,CAAC,KAAK,CAAC;IAEhD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC;QAC/C,EAAE,CAAC,OAAO,CACR,kEAAkE,CACnE,CAAC,GAAG,EAAE,CAAC;IACV,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/cache/hash.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Compute a SHA-256 hex digest of a file at the given absolute path.
+ * Returns `null` if the file does not exist or cannot be read.
+ */
+export declare function hashFile(absolutePath: string): Promise<string | null>;
+/**
+ * Compute a SHA-256 hex digest of the given string or Buffer.
+ */
+export declare function hashContents(contents: string | Buffer): string;
+//# sourceMappingURL=hash.d.ts.map

package/dist/cache/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/cache/hash.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,wBAAsB,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAO3E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAE9D"}

package/dist/cache/hash.js

@@ -0,0 +1,22 @@
+import { createHash } from 'node:crypto';
+import { readFile } from 'node:fs/promises';
+/**
+ * Compute a SHA-256 hex digest of a file at the given absolute path.
+ * Returns `null` if the file does not exist or cannot be read.
+ */
+export async function hashFile(absolutePath) {
+    try {
+        const contents = await readFile(absolutePath);
+        return hashContents(contents);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Compute a SHA-256 hex digest of the given string or Buffer.
+ */
+export function hashContents(contents) {
+    return createHash('sha256').update(contents).digest('hex');
+}
+//# sourceMappingURL=hash.js.map

package/dist/cache/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/cache/hash.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,YAAoB;IACjD,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC9C,OAAO,YAAY,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAyB;IACpD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC7D,CAAC"}

package/dist/cache/invalidation.d.ts

@@ -0,0 +1,29 @@
+import type { CacheStore } from './store.js';
+export declare class CacheInvalidator {
+    private readonly projectRoot;
+    private readonly store;
+    constructor(projectRoot: string, store: CacheStore);
+    /**
+     * Hash the file at `absolutePath` and compare to the stored hash.
+     * Returns whether the cached entry is still valid and the current hash.
+     */
+    validateEntry(absolutePath: string): Promise<{
+        valid: boolean;
+        currentHash: string | null;
+    }>;
+    /**
+     * Delete the cache entry for the given relative path.
+     */
+    invalidate(relativePath: string): void;
+    /**
+     * Delete all cache entries.
+     */
+    invalidateAll(): void;
+    /**
+     * Given a list of relative paths, return those whose current hash
+     * differs from the cached hash. Includes new files (no cache entry)
+     * and deleted files (hash is null).
+     */
+    findChangedFiles(trackedPaths: string[]): Promise<string[]>;
+}
+//# sourceMappingURL=invalidation.d.ts.map

package/dist/cache/invalidation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"invalidation.d.ts","sourceRoot":"","sources":["../../src/cache/invalidation.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;gBAEvB,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU;IAKlD;;;OAGG;IACG,aAAa,CACjB,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IAe1D;;OAEG;IACH,UAAU,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI;IAItC;;OAEG;IACH,aAAa,IAAI,IAAI;IAOrB;;;;OAIG;IACG,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;CAelE"}

package/dist/cache/invalidation.js

@@ -0,0 +1,58 @@
+import { join } from 'node:path';
+import { hashFile } from './hash.js';
+export class CacheInvalidator {
+    projectRoot;
+    store;
+    constructor(projectRoot, store) {
+        this.projectRoot = projectRoot;
+        this.store = store;
+    }
+    /**
+     * Hash the file at `absolutePath` and compare to the stored hash.
+     * Returns whether the cached entry is still valid and the current hash.
+     */
+    async validateEntry(absolutePath) {
+        const currentHash = await hashFile(absolutePath);
+        const relativePath = absolutePath.startsWith(this.projectRoot)
+            ? absolutePath.slice(this.projectRoot.length).replace(/^\//, '')
+            : absolutePath;
+        const entry = this.store.getEntry(relativePath);
+        if (currentHash === null || entry === null) {
+            return { valid: false, currentHash };
+        }
+        return { valid: entry.hash === currentHash, currentHash };
+    }
+    /**
+     * Delete the cache entry for the given relative path.
+     */
+    invalidate(relativePath) {
+        this.store.deleteEntry(relativePath);
+    }
+    /**
+     * Delete all cache entries.
+     */
+    invalidateAll() {
+        const entries = this.store.getAllEntries();
+        for (const entry of entries) {
+            this.store.deleteEntry(entry.path);
+        }
+    }
+    /**
+     * Given a list of relative paths, return those whose current hash
+     * differs from the cached hash. Includes new files (no cache entry)
+     * and deleted files (hash is null).
+     */
+    async findChangedFiles(trackedPaths) {
+        const changed = [];
+        for (const relativePath of trackedPaths) {
+            const absolutePath = join(this.projectRoot, relativePath);
+            const currentHash = await hashFile(absolutePath);
+            const entry = this.store.getEntry(relativePath);
+            if (entry === null || currentHash === null || entry.hash !== currentHash) {
+                changed.push(relativePath);
+            }
+        }
+        return changed;
+    }
+}
+//# sourceMappingURL=invalidation.js.map

package/dist/cache/invalidation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"invalidation.js","sourceRoot":"","sources":["../../src/cache/invalidation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,MAAM,OAAO,gBAAgB;IACV,WAAW,CAAS;IACpB,KAAK,CAAa;IAEnC,YAAY,WAAmB,EAAE,KAAiB;QAChD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,aAAa,CACjB,YAAoB;QAEpB,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,YAAY,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC;YAC5D,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;YAChE,CAAC,CAAC,YAAY,CAAC;QAEjB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEhD,IAAI,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAC3C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;QACvC,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,WAAW,EAAE,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,YAAoB;QAC7B,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,aAAa;QACX,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,gBAAgB,CAAC,YAAsB;QAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,YAAY,IAAI,YAAY,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,YAAY,CAAC,CAAC;YACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAEhD,IAAI,KAAK,KAAK,IAAI,IAAI,WAAW,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACzE,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/cache/ranking.d.ts

@@ -0,0 +1,57 @@
+import type { DependencyGraph } from '../graph/dependency-graph.js';
+import type { CacheStore } from './store.js';
+export interface RankingSignals {
+    dependencyProximity: number;
+    recency: number;
+    fileTypeRelevance: number;
+    taskContextRelevance: number;
+    changeFrequency: number;
+}
+export interface RankingWeights {
+    dependencyProximity: number;
+    recency: number;
+    fileTypeRelevance: number;
+    taskContextRelevance: number;
+    changeFrequency: number;
+}
+export interface RankedFile {
+    path: string;
+    score: number;
+    signals: RankingSignals;
+}
+export interface RankingOptions {
+    projectRoot: string;
+    weights?: Partial<RankingWeights>;
+    exploredFiles?: string[];
+    flaggedFiles?: string[];
+    graph?: DependencyGraph;
+    cacheStore?: CacheStore;
+    limit?: number;
+}
+export declare const DEFAULT_WEIGHTS: RankingWeights;
+/** Score file type relevance: source=1.0, config=0.5, test=0.3, other=0.2 */
+export declare function computeFileTypeRelevance(filePath: string): number;
+/**
+ * Exponential decay based on how recently the file was checked.
+ * Files checked in the last hour get ~1.0, files checked days ago get ~0.0.
+ * Uses a half-life of 4 hours.
+ */
+export declare function computeRecency(lastChecked: number, now?: number): number;
+/**
+ * Score based on distance in the dependency graph from explored files.
+ * 1.0 if directly connected, 0.5 if 2 hops away, decaying by 1/2^(distance-1).
+ * Returns 0 if no graph or no explored files.
+ */
+export declare function computeDependencyProximity(filePath: string, exploredFiles: string[], graph: DependencyGraph): number;
+/**
+ * Score based on directory proximity to flagged and explored files.
+ * 1.0 if in same directory as flagged files, 0.7 if in same directory as explored files,
+ * 0.4 if in sibling directory of flagged/explored, 0.1 otherwise.
+ */
+export declare function computeTaskContextRelevance(filePath: string, exploredFiles: string[], flaggedFiles: string[]): number;
+/**
+ * Composite ranking: scores each file on all signals, combines with weights,
+ * returns sorted results descending by score.
+ */
+export declare function rankFiles(files: string[], options: RankingOptions): RankedFile[];
+//# sourceMappingURL=ranking.d.ts.map

package/dist/cache/ranking.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranking.d.ts","sourceRoot":"","sources":["../../src/cache/ranking.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AACpE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C,MAAM,WAAW,cAAc;IAC7B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,cAAc,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IAClC,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,eAAO,MAAM,eAAe,EAAE,cAM7B,CAAC;AAiCF,6EAA6E;AAC7E,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAoBjE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAQxE;AAED;;;;GAIG;AACH,wBAAgB,0BAA0B,CACxC,QAAQ,EAAE,MAAM,EAChB,aAAa,EAAE,MAAM,EAAE,EACvB,KAAK,EAAE,eAAe,GACrB,MAAM,CA0CR;AAED;;;;GAIG;AACH,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,MAAM,EAChB,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,EAAE,MAAM,EAAE,GACrB,MAAM,CA+BR;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,cAAc,GAAG,UAAU,EAAE,CA4DhF"}

package/dist/cache/ranking.js

@@ -0,0 +1,196 @@
+import { dirname } from 'path';
+export const DEFAULT_WEIGHTS = {
+    dependencyProximity: 0.3,
+    recency: 0.2,
+    fileTypeRelevance: 0.15,
+    taskContextRelevance: 0.25,
+    changeFrequency: 0.1,
+};
+const SOURCE_EXTENSIONS = new Set(['.ts', '.js', '.tsx', '.jsx']);
+const CONFIG_BASENAMES = new Set([
+    'package.json',
+    'tsconfig.json',
+    'tsconfig.base.json',
+    '.eslintrc',
+    '.eslintrc.json',
+    '.eslintrc.js',
+    '.prettierrc',
+    '.prettierrc.json',
+    'jest.config.js',
+    'jest.config.ts',
+    'vitest.config.ts',
+    'vitest.config.js',
+    'webpack.config.js',
+    'webpack.config.ts',
+    'rollup.config.js',
+    'rollup.config.ts',
+    'vite.config.ts',
+    'vite.config.js',
+    'eslint.config.mjs',
+    'eslint.config.js',
+]);
+const TEST_PATTERNS = [
+    /\.test\.[jt]sx?$/,
+    /\.spec\.[jt]sx?$/,
+    /\/__tests__\//,
+    /\/tests?\//,
+];
+/** Score file type relevance: source=1.0, config=0.5, test=0.3, other=0.2 */
+export function computeFileTypeRelevance(filePath) {
+    const basename = filePath.split('/').pop() ?? filePath;
+    const ext = getExtension(basename);
+    // Check test patterns first (test files may also be .ts/.js)
+    if (TEST_PATTERNS.some((p) => p.test(filePath))) {
+        return 0.3;
+    }
+    // Config files
+    if (CONFIG_BASENAMES.has(basename)) {
+        return 0.5;
+    }
+    // Source files
+    if (SOURCE_EXTENSIONS.has(ext)) {
+        return 1.0;
+    }
+    return 0.2;
+}
+/**
+ * Exponential decay based on how recently the file was checked.
+ * Files checked in the last hour get ~1.0, files checked days ago get ~0.0.
+ * Uses a half-life of 4 hours.
+ */
+export function computeRecency(lastChecked, now) {
+    const currentTime = now ?? Date.now();
+    const ageMs = currentTime - lastChecked;
+    if (ageMs <= 0)
+        return 1.0;
+    const HALF_LIFE_MS = 4 * 60 * 60 * 1000; // 4 hours
+    return Math.pow(2, -ageMs / HALF_LIFE_MS);
+}
+/**
+ * Score based on distance in the dependency graph from explored files.
+ * 1.0 if directly connected, 0.5 if 2 hops away, decaying by 1/2^(distance-1).
+ * Returns 0 if no graph or no explored files.
+ */
+export function computeDependencyProximity(filePath, exploredFiles, graph) {
+    if (exploredFiles.length === 0)
+        return 0;
+    let bestScore = 0;
+    for (const explored of exploredFiles) {
+        // Check direct connection (1 hop)
+        const deps = graph.getDependencies(explored);
+        const dependents = graph.getDependents(explored);
+        const directNeighbors = new Set([...deps, ...dependents]);
+        if (directNeighbors.has(filePath)) {
+            return 1.0; // Can't get better than this
+        }
+        // Check 2 hops
+        for (const neighbor of directNeighbors) {
+            const neighborDeps = graph.getDependencies(neighbor);
+            const neighborDependents = graph.getDependents(neighbor);
+            const secondHop = new Set([...neighborDeps, ...neighborDependents]);
+            if (secondHop.has(filePath)) {
+                bestScore = Math.max(bestScore, 0.5);
+                break; // Found at 2 hops from this explored file
+            }
+        }
+        if (bestScore >= 0.5) {
+            // Check 3 hops via transitive
+            continue;
+        }
+        // Check 3 hops
+        const transitiveDeps = new Set(graph.getTransitiveDependencies(explored, 3));
+        const transitiveDependents = new Set(graph.getTransitiveDependents(explored, 3));
+        if (transitiveDeps.has(filePath) || transitiveDependents.has(filePath)) {
+            bestScore = Math.max(bestScore, 0.25);
+        }
+    }
+    return bestScore;
+}
+/**
+ * Score based on directory proximity to flagged and explored files.
+ * 1.0 if in same directory as flagged files, 0.7 if in same directory as explored files,
+ * 0.4 if in sibling directory of flagged/explored, 0.1 otherwise.
+ */
+export function computeTaskContextRelevance(filePath, exploredFiles, flaggedFiles) {
+    const fileDir = dirname(filePath);
+    // Check flagged files first (higher priority)
+    for (const flagged of flaggedFiles) {
+        if (dirname(flagged) === fileDir) {
+            return 1.0;
+        }
+    }
+    // Check explored files
+    for (const explored of exploredFiles) {
+        if (dirname(explored) === fileDir) {
+            return 0.7;
+        }
+    }
+    // Check sibling directories (parent directory matches)
+    const parentDir = dirname(fileDir);
+    for (const flagged of flaggedFiles) {
+        if (dirname(dirname(flagged)) === parentDir) {
+            return 0.4;
+        }
+    }
+    for (const explored of exploredFiles) {
+        if (dirname(dirname(explored)) === parentDir) {
+            return 0.4;
+        }
+    }
+    return 0.1;
+}
+/**
+ * Composite ranking: scores each file on all signals, combines with weights,
+ * returns sorted results descending by score.
+ */
+export function rankFiles(files, options) {
+    const weights = {
+        ...DEFAULT_WEIGHTS,
+        ...options.weights,
+    };
+    const exploredFiles = options.exploredFiles ?? [];
+    const flaggedFiles = options.flaggedFiles ?? [];
+    const now = Date.now();
+    const results = files.map((filePath) => {
+        const fileTypeRelevance = computeFileTypeRelevance(filePath);
+        let recency = 0.5; // default if no cache store
+        if (options.cacheStore) {
+            const entry = options.cacheStore.getEntry(filePath);
+            if (entry) {
+                recency = computeRecency(entry.lastChecked, now);
+            }
+        }
+        let dependencyProximity = 0;
+        if (options.graph) {
+            dependencyProximity = computeDependencyProximity(filePath, exploredFiles, options.graph);
+        }
+        const taskContextRelevance = computeTaskContextRelevance(filePath, exploredFiles, flaggedFiles);
+        // changeFrequency is a placeholder — would need git log data to compute properly
+        const changeFrequency = 0.5;
+        const signals = {
+            dependencyProximity,
+            recency,
+            fileTypeRelevance,
+            taskContextRelevance,
+            changeFrequency,
+        };
+        const score = signals.dependencyProximity * weights.dependencyProximity +
+            signals.recency * weights.recency +
+            signals.fileTypeRelevance * weights.fileTypeRelevance +
+            signals.taskContextRelevance * weights.taskContextRelevance +
+            signals.changeFrequency * weights.changeFrequency;
+        return { path: filePath, score, signals };
+    });
+    results.sort((a, b) => b.score - a.score);
+    if (options.limit !== undefined && options.limit > 0) {
+        return results.slice(0, options.limit);
+    }
+    return results;
+}
+function getExtension(filename) {
+    const dotIndex = filename.lastIndexOf('.');
+    if (dotIndex === -1)
+        return '';
+    return filename.slice(dotIndex);
+}
+//# sourceMappingURL=ranking.js.map

package/dist/cache/ranking.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranking.js","sourceRoot":"","sources":["../../src/cache/ranking.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAoC/B,MAAM,CAAC,MAAM,eAAe,GAAmB;IAC7C,mBAAmB,EAAE,GAAG;IACxB,OAAO,EAAE,GAAG;IACZ,iBAAiB,EAAE,IAAI;IACvB,oBAAoB,EAAE,IAAI;IAC1B,eAAe,EAAE,GAAG;CACrB,CAAC;AAEF,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAClE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,cAAc;IACd,eAAe;IACf,oBAAoB;IACpB,WAAW;IACX,gBAAgB;IAChB,cAAc;IACd,aAAa;IACb,kBAAkB;IAClB,gBAAgB;IAChB,gBAAgB;IAChB,kBAAkB;IAClB,kBAAkB;IAClB,mBAAmB;IACnB,mBAAmB;IACnB,kBAAkB;IAClB,kBAAkB;IAClB,gBAAgB;IAChB,gBAAgB;IAChB,mBAAmB;IACnB,kBAAkB;CACnB,CAAC,CAAC;AAEH,MAAM,aAAa,GAAG;IACpB,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,YAAY;CACb,CAAC;AAEF,6EAA6E;AAC7E,MAAM,UAAU,wBAAwB,CAAC,QAAgB;IACvD,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,QAAQ,CAAC;IACvD,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IAEnC,6DAA6D;IAC7D,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;QAChD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,eAAe;IACf,IAAI,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,eAAe;IACf,IAAI,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/B,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,WAAmB,EAAE,GAAY;IAC9D,MAAM,WAAW,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,WAAW,GAAG,WAAW,CAAC;IAExC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IAE3B,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,UAAU;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CACxC,QAAgB,EAChB,aAAuB,EACvB,KAAsB;IAEtB,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACrC,kCAAkC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC;QAE1D,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,OAAO,GAAG,CAAC,CAAC,6BAA6B;QAC3C,CAAC;QAED,eAAe;QACf,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAG,KAAK,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC;YAEpE,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBACrC,MAAM,CAAC,0CAA0C;YACnD,CAAC;QACH,CAAC;QAED,IAAI,SAAS,IAAI,GAAG,EAAE,CAAC;YACrB,8BAA8B;YAC9B,SAAS;QACX,CAAC;QAED,eAAe;QACf,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,uBAAuB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAEjF,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvE,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAgB,EAChB,aAAuB,EACvB,YAAsB;IAEtB,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAElC,8CAA8C;IAC9C,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;QACnC,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,OAAO,EAAE,CAAC;YACjC,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,OAAO,EAAE,CAAC;YAClC,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACnC,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;QACnC,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAC7C,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAe,EAAE,OAAuB;IAChE,MAAM,OAAO,GAAmB;QAC9B,GAAG,eAAe;QAClB,GAAG,OAAO,CAAC,OAAO;KACnB,CAAC;IAEF,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;IAClD,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,EAAE,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,MAAM,OAAO,GAAiB,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QACnD,MAAM,iBAAiB,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QAE7D,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,4BAA4B;QAC/C,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACpD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,mBAAmB,GAAG,0BAA0B,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC3F,CAAC;QAED,MAAM,oBAAoB,GAAG,2BAA2B,CACtD,QAAQ,EACR,aAAa,EACb,YAAY,CACb,CAAC;QAEF,iFAAiF;QACjF,MAAM,eAAe,GAAG,GAAG,CAAC;QAE5B,MAAM,OAAO,GAAmB;YAC9B,mBAAmB;YACnB,OAAO;YACP,iBAAiB;YACjB,oBAAoB;YACpB,eAAe;SAChB,CAAC;QAEF,MAAM,KAAK,GACT,OAAO,CAAC,mBAAmB,GAAG,OAAO,CAAC,mBAAmB;YACzD,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO;YACjC,OAAO,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB;YACrD,OAAO,CAAC,oBAAoB,GAAG,OAAO,CAAC,oBAAoB;YAC3D,OAAO,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC;QAEpD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE1C,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QACrD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,YAAY,CAAC,QAAgB;IACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC3C,IAAI,QAAQ,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/B,OAAO,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AAClC,CAAC"}

package/dist/cache/store.d.ts

@@ -0,0 +1,16 @@
+import type { CacheEntry, FileSummary } from '../types.js';
+export declare class CacheStore {
+    private readonly projectRoot;
+    constructor(projectRoot: string);
+    getEntry(path: string): CacheEntry | null;
+    setEntry(path: string, hash: string, summary: FileSummary | null): void;
+    getAllEntries(): CacheEntry[];
+    deleteEntry(path: string): void;
+    setEntries(entries: Array<{
+        path: string;
+        hash: string;
+        summary?: FileSummary | null;
+    }>): void;
+    getStaleEntries(maxAge: number): CacheEntry[];
+}
+//# sourceMappingURL=store.d.ts.map

package/dist/cache/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/cache/store.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAkB3D,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;gBAEzB,WAAW,EAAE,MAAM;IAI/B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IASzC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI,GAAG,IAAI;IAevE,aAAa,IAAI,UAAU,EAAE;IAS7B,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAK/B,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,WAAW,GAAG,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;IAsB9F,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE;CAW9C"}