@plusplusoneplusplus/coc 1.0.2 → 1.0.3

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-retriever.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Tool Call Cache Retriever
+ *
+ * Looks up cached explore answers using keyword-based Jaccard similarity
+ * and returns them with staleness metadata derived from git hash comparison.
+ * Pure algorithmic matching (no AI dependency) with configurable staleness
+ * strategies.
+ *
+ * No VS Code dependencies — pure Node.js.
+ */
+import type { ToolCallCacheStore, StalenessStrategy, ToolCallCacheLookupResult } from './tool-call-cache-types';
+export interface ToolCallCacheRetrieverOptions {
+    /** How to handle stale entries. Default: 'warn' */
+    stalenessStrategy?: StalenessStrategy;
+    /** Minimum Jaccard similarity score to consider a match. Default: 0.4 */
+    similarityThreshold?: number;
+}
+export declare class ToolCallCacheRetriever {
+    private readonly store;
+    private readonly stalenessStrategy;
+    private readonly similarityThreshold;
+    private indexCache;
+    private static readonly STOP_WORDS;
+    constructor(store: ToolCallCacheStore, options?: ToolCallCacheRetrieverOptions);
+    /**
+     * Look up a cached answer for the given question.
+     *
+     * Uses Jaccard similarity on tokenized words to find the best match.
+     * Returns null if no match meets the similarity threshold or if the
+     * staleness strategy dictates skipping stale entries.
+     */
+    lookup(question: string, currentGitHash?: string): Promise<ToolCallCacheLookupResult | null>;
+    /**
+     * Increment the hit count for a matched entry and persist.
+     * Uses the single-entry write API to avoid rewriting all answer files.
+     */
+    incrementHitCount(entryId: string): Promise<void>;
+    /** Force reload from store on next lookup. */
+    invalidateCache(): void;
+    /**
+     * Tokenize a question string into a set of meaningful words.
+     *
+     * Steps:
+     * 1. Lowercase the input
+     * 2. Replace non-alphanumeric chars (except hyphens in identifiers) with spaces
+     * 3. Split on whitespace
+     * 4. Remove stop words
+     * 5. Remove tokens shorter than 2 characters
+     * 6. Return as a Set<string>
+     */
+    static tokenize(text: string): Set<string>;
+    /**
+     * Compute Jaccard similarity coefficient between two token sets.
+     *
+     * Jaccard(A, B) = |A ∩ B| / |A ∪ B|
+     *
+     * Returns 0 if both sets are empty.
+     */
+    static jaccardSimilarity(a: Set<string>, b: Set<string>): number;
+    /**
+     * Load consolidated index from the store, cached in-memory.
+     * Only loads metadata (no answer payloads) for efficient scoring.
+     */
+    private loadIndex;
+}
+//# sourceMappingURL=tool-call-cache-retriever.d.ts.map

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-retriever.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-call-cache-retriever.d.ts","sourceRoot":"","sources":["../../src/memory/tool-call-cache-retriever.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EACR,kBAAkB,EAGlB,iBAAiB,EACjB,yBAAyB,EAC5B,MAAM,yBAAyB,CAAC;AAEjC,MAAM,WAAW,6BAA6B;IAC1C,mDAAmD;IACnD,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IACtC,yEAAyE;IACzE,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAChC;AAED,qBAAa,sBAAsB;IAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAqB;IAC3C,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAoB;IACtD,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAS;IAC7C,OAAO,CAAC,UAAU,CAAyC;IAE3D,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAc/B;gBAES,KAAK,EAAE,kBAAkB,EAAE,OAAO,CAAC,EAAE,6BAA6B;IAM9E;;;;;;OAMG;IACG,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,yBAAyB,GAAG,IAAI,CAAC;IAwClG;;;OAGG;IACG,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWvD,8CAA8C;IAC9C,eAAe,IAAI,IAAI;IAIvB;;;;;;;;;;OAUG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAS1C;;;;;;OAMG;IACH,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM;IAehE;;;OAGG;YACW,SAAS;CAQ1B"}

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-retriever.js

@@ -0,0 +1,151 @@
+"use strict";
+/**
+ * Tool Call Cache Retriever
+ *
+ * Looks up cached explore answers using keyword-based Jaccard similarity
+ * and returns them with staleness metadata derived from git hash comparison.
+ * Pure algorithmic matching (no AI dependency) with configurable staleness
+ * strategies.
+ *
+ * No VS Code dependencies — pure Node.js.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ToolCallCacheRetriever = void 0;
+class ToolCallCacheRetriever {
+    constructor(store, options) {
+        this.indexCache = null;
+        this.store = store;
+        this.stalenessStrategy = options?.stalenessStrategy ?? 'warn';
+        this.similarityThreshold = options?.similarityThreshold ?? 0.4;
+    }
+    /**
+     * Look up a cached answer for the given question.
+     *
+     * Uses Jaccard similarity on tokenized words to find the best match.
+     * Returns null if no match meets the similarity threshold or if the
+     * staleness strategy dictates skipping stale entries.
+     */
+    async lookup(question, currentGitHash) {
+        const entries = await this.loadIndex();
+        if (entries.length === 0)
+            return null;
+        const questionTokens = ToolCallCacheRetriever.tokenize(question);
+        let bestEntry = null;
+        let bestScore = -1;
+        for (const entry of entries) {
+            const entryTokens = ToolCallCacheRetriever.tokenize(entry.question);
+            const score = ToolCallCacheRetriever.jaccardSimilarity(questionTokens, entryTokens);
+            if (score > bestScore) {
+                bestScore = score;
+                bestEntry = entry;
+            }
+        }
+        if (bestEntry === null || bestScore < this.similarityThreshold)
+            return null;
+        // Staleness detection
+        let stale;
+        if (currentGitHash === undefined) {
+            stale = false;
+        }
+        else if (bestEntry.gitHash === undefined) {
+            stale = true;
+        }
+        else {
+            stale = bestEntry.gitHash !== currentGitHash;
+        }
+        // Apply staleness strategy
+        if (stale && this.stalenessStrategy === 'skip')
+            return null;
+        // Lazy-load answer only for the matched entry
+        const answer = await this.store.readEntryAnswer(bestEntry.id) ?? '';
+        // 'warn' and 'revalidate' (v1: same as warn) return the result
+        return { entry: { ...bestEntry, answer }, score: bestScore, stale };
+    }
+    /**
+     * Increment the hit count for a matched entry and persist.
+     * Uses the single-entry write API to avoid rewriting all answer files.
+     */
+    async incrementHitCount(entryId) {
+        const entries = await this.loadIndex();
+        const entry = entries.find(e => e.id === entryId);
+        if (!entry)
+            return;
+        entry.hitCount = (entry.hitCount ?? 0) + 1;
+        // Load answer to produce a full entry for writeConsolidatedEntry
+        const answer = await this.store.readEntryAnswer(entryId) ?? '';
+        await this.store.writeConsolidatedEntry({ ...entry, answer });
+        // In-memory index cache already updated (mutated in-place)
+    }
+    /** Force reload from store on next lookup. */
+    invalidateCache() {
+        this.indexCache = null;
+    }
+    /**
+     * Tokenize a question string into a set of meaningful words.
+     *
+     * Steps:
+     * 1. Lowercase the input
+     * 2. Replace non-alphanumeric chars (except hyphens in identifiers) with spaces
+     * 3. Split on whitespace
+     * 4. Remove stop words
+     * 5. Remove tokens shorter than 2 characters
+     * 6. Return as a Set<string>
+     */
+    static tokenize(text) {
+        const words = text
+            .toLowerCase()
+            .replace(/[^a-z0-9\-]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length >= 2 && !ToolCallCacheRetriever.STOP_WORDS.has(w));
+        return new Set(words);
+    }
+    /**
+     * Compute Jaccard similarity coefficient between two token sets.
+     *
+     * Jaccard(A, B) = |A ∩ B| / |A ∪ B|
+     *
+     * Returns 0 if both sets are empty.
+     */
+    static jaccardSimilarity(a, b) {
+        if (a.size === 0 && b.size === 0)
+            return 0;
+        let intersection = 0;
+        const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];
+        for (const token of smaller) {
+            if (larger.has(token)) {
+                intersection++;
+            }
+        }
+        const union = a.size + b.size - intersection;
+        return union === 0 ? 0 : intersection / union;
+    }
+    /**
+     * Load consolidated index from the store, cached in-memory.
+     * Only loads metadata (no answer payloads) for efficient scoring.
+     */
+    async loadIndex() {
+        if (this.indexCache !== null) {
+            return this.indexCache;
+        }
+        const data = await this.store.readConsolidatedIndex();
+        this.indexCache = data ?? [];
+        return this.indexCache;
+    }
+}
+exports.ToolCallCacheRetriever = ToolCallCacheRetriever;
+ToolCallCacheRetriever.STOP_WORDS = new Set([
+    'a', 'an', 'the', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'shall', 'can', 'need', 'dare', 'ought',
+    'used', 'to', 'of', 'in', 'for', 'on', 'with', 'at', 'by', 'from',
+    'as', 'into', 'through', 'during', 'before', 'after', 'above', 'below',
+    'between', 'out', 'off', 'over', 'under', 'again', 'further', 'then',
+    'once', 'here', 'there', 'when', 'where', 'why', 'how', 'all', 'each',
+    'every', 'both', 'few', 'more', 'most', 'other', 'some', 'such', 'no',
+    'nor', 'not', 'only', 'own', 'same', 'so', 'than', 'too', 'very',
+    'just', 'because', 'but', 'and', 'or', 'if', 'while', 'what', 'which',
+    'who', 'whom', 'this', 'that', 'these', 'those', 'i', 'me', 'my',
+    'myself', 'we', 'our', 'ours', 'you', 'your', 'yours', 'he', 'him',
+    'his', 'she', 'her', 'hers', 'it', 'its', 'they', 'them', 'their',
+]);
+//# sourceMappingURL=tool-call-cache-retriever.js.map

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-retriever.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-call-cache-retriever.js","sourceRoot":"","sources":["../../src/memory/tool-call-cache-retriever.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAiBH,MAAa,sBAAsB;IAsB/B,YAAY,KAAyB,EAAE,OAAuC;QAlBtE,eAAU,GAAoC,IAAI,CAAC;QAmBvD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,OAAO,EAAE,iBAAiB,IAAI,MAAM,CAAC;QAC9D,IAAI,CAAC,mBAAmB,GAAG,OAAO,EAAE,mBAAmB,IAAI,GAAG,CAAC;IACnE,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAC,QAAgB,EAAE,cAAuB;QAClD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEtC,MAAM,cAAc,GAAG,sBAAsB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAEjE,IAAI,SAAS,GAAkC,IAAI,CAAC;QACpD,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAG,sBAAsB,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpE,MAAM,KAAK,GAAG,sBAAsB,CAAC,iBAAiB,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;YACpF,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACpB,SAAS,GAAG,KAAK,CAAC;gBAClB,SAAS,GAAG,KAAK,CAAC;YACtB,CAAC;QACL,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,GAAG,IAAI,CAAC,mBAAmB;YAAE,OAAO,IAAI,CAAC;QAE5E,sBAAsB;QACtB,IAAI,KAAc,CAAC;QACnB,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAC/B,KAAK,GAAG,KAAK,CAAC;QAClB,CAAC;aAAM,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YACzC,KAAK,GAAG,IAAI,CAAC;QACjB,CAAC;aAAM,CAAC;YACJ,KAAK,GAAG,SAAS,CAAC,OAAO,KAAK,cAAc,CAAC;QACjD,CAAC;QAED,2BAA2B;QAC3B,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;QAE5D,8CAA8C;QAC9C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAEpE,+DAA+D;QAC/D,OAAO,EAAE,KAAK,EAAE,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACxE,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB,CAAC,OAAe;QACnC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,KAAK,CAAC,QAAQ,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3C,iEAAiE;QACjE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/D,MAAM,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9D,2DAA2D;IAC/D,CAAC;IAED,8CAA8C;IAC9C,eAAe;QACX,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAY;QACxB,MAAM,KAAK,GAAG,IAAI;aACb,WAAW,EAAE;aACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;aAC5B,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,iBAAiB,CAAC,CAAc,EAAE,CAAc;QACnD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE3C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,YAAY,EAAE,CAAC;YACnB,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;QAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;IAClD,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,SAAS;QACnB,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,UAAU,CAAC;QAC3B,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,qBAAqB,EAAE,CAAC;QACtD,IAAI,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;;AApJL,wDAqJC;AA/I2B,iCAAU,GAAG,IAAI,GAAG,CAAC;IACzC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;IACjE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACtE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;IACpE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACrE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI;IACrE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAChE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IACrE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;IAChE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;IAClE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;CACpE,CAAC,AAdgC,CAc/B"}

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-store.d.ts

@@ -0,0 +1,57 @@
+import type { ToolCallCacheStore, ToolCallCacheStoreOptions, ToolCallQAEntry, ToolCallCacheIndex, ConsolidatedToolCallEntry, ConsolidatedIndexEntry, ToolCallCacheStats } from './tool-call-cache-types';
+import { BaseFileStore } from './base-file-store';
+/**
+ * Resolve the appropriate {@link ToolCallCacheStoreOptions} for a given
+ * working directory, cascading through git-remote → repo → system scope.
+ *
+ * 1. If `workDir` is provided and has a git remote → `git-remote` level.
+ * 2. If `workDir` is provided but no remote → `repo` level (local-only repo).
+ * 3. If no `workDir` → `system` level (unchanged legacy behavior).
+ */
+export declare function resolveToolCallCacheOptions(workDir?: string, dataDir?: string): ToolCallCacheStoreOptions;
+export declare class FileToolCallCacheStore extends BaseFileStore implements ToolCallCacheStore {
+    private readonly cacheDir;
+    private readonly rawDir;
+    private readonly dataDir;
+    private readonly cacheSubDir;
+    private migrated;
+    private static DEFAULT_INDEX;
+    constructor(options?: ToolCallCacheStoreOptions);
+    private sanitizeToolName;
+    private generateRawFilename;
+    private sanitizeEntryId;
+    getCacheDir(): string;
+    private get consolidatedDir();
+    private get entriesDir();
+    private get consolidatedIndexPath();
+    /** Legacy path for migration detection. */
+    private get legacyConsolidatedPath();
+    /** Absolute path to the git-remote scoped explore-cache for the given remoteHash. */
+    getGitRemoteDir(remoteHash: string): string;
+    /** Absolute path to the repo-scoped explore-cache for the given repoHash. */
+    getRepoExploreDir(repoHash: string): string;
+    writeRaw(entry: ToolCallQAEntry): Promise<string>;
+    readRaw(filename: string): Promise<ToolCallQAEntry | undefined>;
+    listRaw(): Promise<string[]>;
+    deleteRaw(filename: string): Promise<boolean>;
+    /** Auto-migrate legacy consolidated.json to hierarchical layout on first access. */
+    private migrateIfNeeded;
+    /** Strip answer field from a full entry to produce an index-only entry. */
+    private static toIndexEntry;
+    /**
+     * Internal write that splits entries into index + individual answer files.
+     * Cleans up orphaned answer files not in the new entry set.
+     */
+    private writeConsolidatedInternal;
+    readConsolidated(): Promise<ConsolidatedToolCallEntry[]>;
+    writeConsolidated(entries: ConsolidatedToolCallEntry[]): Promise<void>;
+    readConsolidatedIndex(): Promise<ConsolidatedIndexEntry[]>;
+    readEntryAnswer(id: string): Promise<string | undefined>;
+    writeConsolidatedEntry(entry: ConsolidatedToolCallEntry): Promise<void>;
+    deleteConsolidatedEntry(id: string): Promise<boolean>;
+    readIndex(): Promise<ToolCallCacheIndex>;
+    updateIndex(updates: Partial<ToolCallCacheIndex>): Promise<void>;
+    getStats(): Promise<ToolCallCacheStats>;
+    clear(): Promise<void>;
+}
+//# sourceMappingURL=tool-call-cache-store.d.ts.map

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-call-cache-store.d.ts","sourceRoot":"","sources":["../../src/memory/tool-call-cache-store.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EACR,kBAAkB,EAClB,yBAAyB,EACzB,eAAe,EACf,kBAAkB,EAClB,yBAAyB,EACzB,sBAAsB,EACtB,kBAAkB,EACrB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAElD;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CACvC,OAAO,CAAC,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,MAAM,GACjB,yBAAyB,CAgB3B;AAED,qBAAa,sBAAuB,SAAQ,aAAc,YAAW,kBAAkB;IACnF,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAS;IAEzB,OAAO,CAAC,MAAM,CAAC,aAAa,CAI1B;gBAEU,OAAO,CAAC,EAAE,yBAAyB;IA2B/C,OAAO,CAAC,gBAAgB;IAIxB,OAAO,CAAC,mBAAmB;IAM3B,OAAO,CAAC,eAAe;IAMvB,WAAW,IAAI,MAAM;IAIrB,OAAO,KAAK,eAAe,GAE1B;IAED,OAAO,KAAK,UAAU,GAErB;IAED,OAAO,KAAK,qBAAqB,GAEhC;IAED,2CAA2C;IAC3C,OAAO,KAAK,sBAAsB,GAEjC;IAED,qFAAqF;IACrF,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAI3C,6EAA6E;IAC7E,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAMrC,QAAQ,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAYjD,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,SAAS,CAAC;IAU/D,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAS5B,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAanD,oFAAoF;YACtE,eAAe;IAgB7B,2EAA2E;IAC3E,OAAO,CAAC,MAAM,CAAC,YAAY;IAK3B;;;OAGG;YACW,yBAAyB;IA6BjC,gBAAgB,IAAI,OAAO,CAAC,yBAAyB,EAAE,CAAC;IAgBxD,iBAAiB,CAAC,OAAO,EAAE,yBAAyB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAMtE,qBAAqB,IAAI,OAAO,CAAC,sBAAsB,EAAE,CAAC;IAK1D,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAUxD,sBAAsB,CAAC,KAAK,EAAE,yBAAyB,GAAG,OAAO,CAAC,IAAI,CAAC;IAuBvE,uBAAuB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA4BrD,SAAS,IAAI,OAAO,CAAC,kBAAkB,CAAC;IAIxC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,kBAAkB,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAWhE,QAAQ,IAAI,OAAO,CAAC,kBAAkB,CAAC;IA0BvC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAO/B"}

package/node_modules/@plusplusoneplusplus/forge/dist/memory/tool-call-cache-store.js

@@ -0,0 +1,364 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FileToolCallCacheStore = void 0;
+exports.resolveToolCallCacheOptions = resolveToolCallCacheOptions;
+/**
+ * FileToolCallCacheStore — persistence layer for the tool-call caching system.
+ *
+ * Stores raw tool-call Q&A entries as individual JSON files, consolidated
+ * summaries, and cache index metadata on disk. Follows FileMemoryStore
+ * patterns: atomic tmp→rename writes, write-queue serialization.
+ *
+ * No VS Code dependencies — pure Node.js.
+ */
+const fs = __importStar(require("fs/promises"));
+const path = __importStar(require("path"));
+const os = __importStar(require("os"));
+const remote_1 = require("../git/remote");
+const memory_store_1 = require("./memory-store");
+const base_file_store_1 = require("./base-file-store");
+/**
+ * Resolve the appropriate {@link ToolCallCacheStoreOptions} for a given
+ * working directory, cascading through git-remote → repo → system scope.
+ *
+ * 1. If `workDir` is provided and has a git remote → `git-remote` level.
+ * 2. If `workDir` is provided but no remote → `repo` level (local-only repo).
+ * 3. If no `workDir` → `system` level (unchanged legacy behavior).
+ */
+function resolveToolCallCacheOptions(workDir, dataDir) {
+    const base = {};
+    if (dataDir) {
+        base.dataDir = dataDir;
+    }
+    if (!workDir) {
+        return { ...base, level: 'system' };
+    }
+    const remoteUrl = (0, remote_1.getRemoteUrl)(workDir);
+    if (remoteUrl) {
+        return { ...base, level: 'git-remote', remoteHash: (0, remote_1.computeRemoteHash)(remoteUrl) };
+    }
+    return { ...base, level: 'repo', repoHash: (0, memory_store_1.computeRepoHash)(workDir) };
+}
+class FileToolCallCacheStore extends base_file_store_1.BaseFileStore {
+    constructor(options) {
+        super();
+        this.migrated = false;
+        const dataDir = options?.dataDir ?? process.env.COC_DATA_DIR ?? path.join(os.homedir(), '.coc', 'memory');
+        const cacheSubDir = options?.cacheSubDir ?? 'explore-cache';
+        const level = options?.level ?? 'system';
+        this.dataDir = dataDir;
+        this.cacheSubDir = cacheSubDir;
+        switch (level) {
+            case 'git-remote':
+                this.cacheDir = path.join(dataDir, 'git-remotes', options?.remoteHash ?? 'unknown', cacheSubDir);
+                break;
+            case 'repo':
+                this.cacheDir = path.join(dataDir, 'repos', options?.repoHash ?? 'unknown', cacheSubDir);
+                break;
+            case 'system':
+            default:
+                this.cacheDir = path.join(dataDir, cacheSubDir);
+                break;
+        }
+        this.rawDir = path.join(this.cacheDir, 'raw');
+    }
+    // --- Filename helpers ---
+    sanitizeToolName(name) {
+        return name.replace(/[^a-zA-Z0-9\-_]/g, '_');
+    }
+    generateRawFilename(entry) {
+        const ts = new Date(entry.timestamp).getTime();
+        const tool = this.sanitizeToolName(entry.toolName);
+        return `${ts}-${tool}.json`;
+    }
+    sanitizeEntryId(id) {
+        return id.replace(/[^a-zA-Z0-9\-_]/g, '_');
+    }
+    // --- Path accessors ---
+    getCacheDir() {
+        return this.cacheDir;
+    }
+    get consolidatedDir() {
+        return path.join(this.cacheDir, 'consolidated');
+    }
+    get entriesDir() {
+        return path.join(this.cacheDir, 'consolidated', 'entries');
+    }
+    get consolidatedIndexPath() {
+        return path.join(this.cacheDir, 'consolidated', 'index.json');
+    }
+    /** Legacy path for migration detection. */
+    get legacyConsolidatedPath() {
+        return path.join(this.cacheDir, 'consolidated.json');
+    }
+    /** Absolute path to the git-remote scoped explore-cache for the given remoteHash. */
+    getGitRemoteDir(remoteHash) {
+        return path.join(this.dataDir, 'git-remotes', remoteHash, this.cacheSubDir);
+    }
+    /** Absolute path to the repo-scoped explore-cache for the given repoHash. */
+    getRepoExploreDir(repoHash) {
+        return path.join(this.dataDir, 'repos', repoHash, this.cacheSubDir);
+    }
+    // --- Raw Q&A entries ---
+    async writeRaw(entry) {
+        const filename = this.generateRawFilename(entry);
+        return this.enqueueWrite(async () => {
+            await fs.mkdir(this.rawDir, { recursive: true });
+            const filePath = path.join(this.rawDir, filename);
+            const tmpPath = filePath + '.tmp';
+            await fs.writeFile(tmpPath, JSON.stringify(entry, null, 2), 'utf-8');
+            await fs.rename(tmpPath, filePath);
+            return filename;
+        });
+    }
+    async readRaw(filename) {
+        try {
+            const filePath = path.join(this.rawDir, filename);
+            const data = await fs.readFile(filePath, 'utf-8');
+            return JSON.parse(data);
+        }
+        catch {
+            return undefined;
+        }
+    }
+    async listRaw() {
+        try {
+            const files = await fs.readdir(this.rawDir);
+            return files.filter(f => f.endsWith('.json')).sort().reverse();
+        }
+        catch {
+            return [];
+        }
+    }
+    async deleteRaw(filename) {
+        return this.enqueueWrite(async () => {
+            try {
+                await fs.unlink(path.join(this.rawDir, filename));
+                return true;
+            }
+            catch {
+                return false;
+            }
+        });
+    }
+    // --- Consolidated entries ---
+    /** Auto-migrate legacy consolidated.json to hierarchical layout on first access. */
+    async migrateIfNeeded() {
+        if (this.migrated)
+            return;
+        this.migrated = true;
+        try {
+            // Check if new-format index already exists — prefer it
+            await fs.access(this.consolidatedIndexPath);
+            return;
+        }
+        catch { /* new format not found, check legacy */ }
+        try {
+            const data = await fs.readFile(this.legacyConsolidatedPath, 'utf-8');
+            const entries = JSON.parse(data);
+            await this.writeConsolidatedInternal(entries);
+            await fs.unlink(this.legacyConsolidatedPath);
+        }
+        catch { /* no legacy file either — nothing to migrate */ }
+    }
+    /** Strip answer field from a full entry to produce an index-only entry. */
+    static toIndexEntry(entry) {
+        const { answer: _, ...rest } = entry;
+        return rest;
+    }
+    /**
+     * Internal write that splits entries into index + individual answer files.
+     * Cleans up orphaned answer files not in the new entry set.
+     */
+    async writeConsolidatedInternal(entries) {
+        await fs.mkdir(this.entriesDir, { recursive: true });
+        // Write each answer file
+        const newIds = new Set();
+        for (const entry of entries) {
+            const safeId = this.sanitizeEntryId(entry.id);
+            newIds.add(safeId);
+            const answerPath = path.join(this.entriesDir, `${safeId}.md`);
+            await this.atomicWrite(answerPath, entry.answer);
+        }
+        // Write index (answer-free)
+        const indexEntries = entries.map(e => FileToolCallCacheStore.toIndexEntry(e));
+        await this.atomicWrite(this.consolidatedIndexPath, JSON.stringify(indexEntries, null, 2));
+        // Clean up orphaned answer files
+        try {
+            const files = await fs.readdir(this.entriesDir);
+            for (const file of files) {
+                if (!file.endsWith('.md'))
+                    continue;
+                const id = file.slice(0, -3);
+                if (!newIds.has(id)) {
+                    await fs.unlink(path.join(this.entriesDir, file)).catch(() => { });
+                }
+            }
+        }
+        catch { /* entries dir may not exist yet */ }
+    }
+    async readConsolidated() {
+        await this.migrateIfNeeded();
+        try {
+            const data = await fs.readFile(this.consolidatedIndexPath, 'utf-8');
+            const indexEntries = JSON.parse(data);
+            const full = [];
+            for (const entry of indexEntries) {
+                const answer = await this.readEntryAnswer(entry.id);
+                full.push({ ...entry, answer: answer ?? '' });
+            }
+            return full;
+        }
+        catch {
+            return [];
+        }
+    }
+    async writeConsolidated(entries) {
+        return this.enqueueWrite(async () => {
+            await this.writeConsolidatedInternal(entries);
+        });
+    }
+    async readConsolidatedIndex() {
+        await this.migrateIfNeeded();
+        return this.readJSON(this.consolidatedIndexPath, []);
+    }
+    async readEntryAnswer(id) {
+        try {
+            const safeId = this.sanitizeEntryId(id);
+            const answerPath = path.join(this.entriesDir, `${safeId}.md`);
+            return await fs.readFile(answerPath, 'utf-8');
+        }
+        catch {
+            return undefined;
+        }
+    }
+    async writeConsolidatedEntry(entry) {
+        return this.enqueueWrite(async () => {
+            await fs.mkdir(this.entriesDir, { recursive: true });
+            // Write answer file
+            const safeId = this.sanitizeEntryId(entry.id);
+            const answerPath = path.join(this.entriesDir, `${safeId}.md`);
+            await this.atomicWrite(answerPath, entry.answer);
+            // Update index — read, upsert, write
+            const indexEntries = await this.readJSON(this.consolidatedIndexPath, []);
+            const indexEntry = FileToolCallCacheStore.toIndexEntry(entry);
+            const existingIdx = indexEntries.findIndex(e => e.id === entry.id);
+            if (existingIdx >= 0) {
+                indexEntries[existingIdx] = indexEntry;
+            }
+            else {
+                indexEntries.push(indexEntry);
+            }
+            await this.atomicWrite(this.consolidatedIndexPath, JSON.stringify(indexEntries, null, 2));
+        });
+    }
+    async deleteConsolidatedEntry(id) {
+        return this.enqueueWrite(async () => {
+            let found = false;
+            // Remove from index
+            try {
+                const data = await fs.readFile(this.consolidatedIndexPath, 'utf-8');
+                const indexEntries = JSON.parse(data);
+                const filtered = indexEntries.filter(e => e.id !== id);
+                if (filtered.length < indexEntries.length) {
+                    found = true;
+                    await this.atomicWrite(this.consolidatedIndexPath, JSON.stringify(filtered, null, 2));
+                }
+            }
+            catch { /* no index */ }
+            // Delete answer file
+            try {
+                const safeId = this.sanitizeEntryId(id);
+                await fs.unlink(path.join(this.entriesDir, `${safeId}.md`));
+                found = true;
+            }
+            catch { /* file may not exist */ }
+            return found;
+        });
+    }
+    // --- Index ---
+    async readIndex() {
+        return this.readJSON(path.join(this.cacheDir, 'index.json'), { ...FileToolCallCacheStore.DEFAULT_INDEX });
+    }
+    async updateIndex(updates) {
+        return this.enqueueWrite(async () => {
+            const existing = await this.readIndex();
+            const merged = { ...existing, ...updates };
+            const filePath = path.join(this.cacheDir, 'index.json');
+            await this.atomicWrite(filePath, JSON.stringify(merged, null, 2));
+        });
+    }
+    // --- Management ---
+    async getStats() {
+        await this.migrateIfNeeded();
+        let rawCount = 0;
+        try {
+            const entries = await fs.readdir(this.rawDir);
+            rawCount = entries.filter(e => e.endsWith('.json')).length;
+        }
+        catch { /* dir may not exist */ }
+        let consolidatedExists = false;
+        let consolidatedCount = 0;
+        try {
+            const data = await fs.readFile(this.consolidatedIndexPath, 'utf-8');
+            consolidatedExists = true;
+            consolidatedCount = JSON.parse(data).length;
+        }
+        catch { /* file may not exist */ }
+        const index = await this.readIndex();
+        return {
+            rawCount,
+            consolidatedExists,
+            consolidatedCount,
+            lastAggregation: index.lastAggregation,
+        };
+    }
+    async clear() {
+        return this.enqueueWrite(async () => {
+            try {
+                await fs.rm(this.cacheDir, { recursive: true, force: true });
+            }
+            catch { /* dir may not exist */ }
+        });
+    }
+}
+exports.FileToolCallCacheStore = FileToolCallCacheStore;
+FileToolCallCacheStore.DEFAULT_INDEX = {
+    lastAggregation: null,
+    rawCount: 0,
+    consolidatedCount: 0,
+};
+//# sourceMappingURL=tool-call-cache-store.js.map