codesift-mcp 0.9.10 → 0.10.0

package/dist/utils/edge-provenance.js

@@ -0,0 +1,53 @@
+/**
+ * Edge-provenance classifier — pure functions, no I/O.
+ *
+ * Classifies graph edges (call edges, import edges) as either directly
+ * "EXTRACTED" from source (high confidence, unambiguous) or "INFERRED"
+ * via heuristic resolution (lower confidence — overload/candidate
+ * disambiguation, star imports, or best-effort layout resolution).
+ * Consumers (call-hierarchy, import-graph formatters) use this to
+ * annotate ambiguous edges instead of presenting them with the same
+ * confidence as directly-resolved ones.
+ */
+const INFERRED_RESOLUTIONS = new Set([
+    "python-src-layout",
+    "php-psr4",
+]);
+/**
+ * Classifies a call edge by how many candidate targets were resolved
+ * for it. Exactly one candidate means the call was unambiguously
+ * matched to source (EXTRACTED). Two or more candidates means the
+ * resolver had to disambiguate (e.g. overloads, dynamic dispatch),
+ * so the edge is INFERRED. Zero or negative counts are treated as
+ * the safe EXTRACTED default rather than throwing — there is no
+ * ambiguity to flag when no candidates were even considered.
+ */
+export function classifyCallEdgeProvenance(candidateCount) {
+    return candidateCount > 1 ? "INFERRED" : "EXTRACTED";
+}
+/**
+ * Classifies an import edge. Star imports (`from x import *`) can't
+ * be tied to a specific exported symbol, so they're always INFERRED.
+ * Otherwise, the resolution strategy used to find the target file
+ * determines confidence: src-layout and PSR-4 resolution are
+ * heuristic guesses (INFERRED); direct and workspace-alias lookups
+ * are unambiguous (EXTRACTED), as is the case with no resolution
+ * hint at all (default: direct extraction).
+ */
+export function classifyImportEdgeProvenance(edge, resolution) {
+    if (edge.star_import)
+        return "INFERRED";
+    if (resolution && INFERRED_RESOLUTIONS.has(resolution))
+        return "INFERRED";
+    return "EXTRACTED";
+}
+/**
+ * Renders a human-readable suffix for an edge's provenance. EXTRACTED
+ * is the default, unannotated case (no visual noise for the common
+ * path); INFERRED edges get a trailing ` [inferred]` tag so callers
+ * can flag lower-confidence edges in formatted output.
+ */
+export function formatProvenanceTag(provenance) {
+    return provenance === "INFERRED" ? " [inferred]" : "";
+}
+//# sourceMappingURL=edge-provenance.js.map

package/dist/utils/edge-provenance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-provenance.js","sourceRoot":"","sources":["../../src/utils/edge-provenance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAyBH,MAAM,oBAAoB,GAAsC,IAAI,GAAG,CAAC;IACtE,mBAAmB;IACnB,UAAU;CACX,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,MAAM,UAAU,0BAA0B,CAAC,cAAsB;IAC/D,OAAO,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,4BAA4B,CAC1C,IAAoB,EACpB,UAAiC;IAEjC,IAAI,IAAI,CAAC,WAAW;QAAE,OAAO,UAAU,CAAC;IACxC,IAAI,UAAU,IAAI,oBAAoB,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,UAAU,CAAC;IAC1E,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,UAA2B;IAC7D,OAAO,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;AACxD,CAAC"}

package/dist/utils/overlay-cache.d.ts

@@ -0,0 +1,38 @@
+/**
+ * OverlayCache — small bounded LRU cache for expensive per-symbol overlay
+ * computations, keyed `${repo}:${symbol}`.
+ *
+ * - True LRU: delete+set on hit re-inserts at the end (Map preserves
+ *   insertion order), so the oldest untouched key is always evicted first.
+ * - TTL eviction: entries expire after `ttlMs`; `null` (negative) results
+ *   use a shorter `negativeTtlMs` so failed lookups retry sooner.
+ * - sha-based invalidation: a lookup whose sha differs from the stored sha
+ *   is a miss, and the stale entry is dropped before recomputing.
+ * - In-flight promise dedupe: concurrent getOrCompute() calls for the same
+ *   key share a single loader invocation.
+ * - Injectable clock (`now`) for deterministic TTL tests — no real sleeps.
+ */
+export interface OverlayCacheOptions {
+    maxEntries?: number;
+    ttlMs?: number;
+    negativeTtlMs?: number;
+    now?: () => number;
+}
+export declare class OverlayCache<T> {
+    private entries;
+    private inflight;
+    private readonly maxEntries;
+    private readonly ttlMs;
+    private readonly negativeTtlMs;
+    private readonly now;
+    constructor(options?: OverlayCacheOptions);
+    /**
+     * Get a cached value or compute it via `loader`. A hit requires both a
+     * matching sha and an unexpired entry; otherwise any stale entry is
+     * dropped and `loader` runs. Concurrent calls for the same key share one
+     * in-flight loader invocation.
+     */
+    getOrCompute(repo: string, symbol: string, sha: string, loader: () => Promise<T | null>): Promise<T | null>;
+    private evictOverflow;
+}
+//# sourceMappingURL=overlay-cache.d.ts.map

package/dist/utils/overlay-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"overlay-cache.d.ts","sourceRoot":"","sources":["../../src/utils/overlay-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAYH,MAAM,WAAW,mBAAmB;IAClC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,qBAAa,YAAY,CAAC,CAAC;IACzB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,QAAQ,CAAwC;IACxD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;gBAEvB,OAAO,GAAE,mBAAwB;IAO7C;;;;;OAKG;IACG,YAAY,CAChB,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAC9B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC;IA8BpB,OAAO,CAAC,aAAa;CAOtB"}

package/dist/utils/overlay-cache.js

@@ -0,0 +1,73 @@
+/**
+ * OverlayCache — small bounded LRU cache for expensive per-symbol overlay
+ * computations, keyed `${repo}:${symbol}`.
+ *
+ * - True LRU: delete+set on hit re-inserts at the end (Map preserves
+ *   insertion order), so the oldest untouched key is always evicted first.
+ * - TTL eviction: entries expire after `ttlMs`; `null` (negative) results
+ *   use a shorter `negativeTtlMs` so failed lookups retry sooner.
+ * - sha-based invalidation: a lookup whose sha differs from the stored sha
+ *   is a miss, and the stale entry is dropped before recomputing.
+ * - In-flight promise dedupe: concurrent getOrCompute() calls for the same
+ *   key share a single loader invocation.
+ * - Injectable clock (`now`) for deterministic TTL tests — no real sleeps.
+ */
+const DEFAULT_MAX_ENTRIES = 200;
+const DEFAULT_TTL_MS = 5 * 60_000;
+const DEFAULT_NEGATIVE_TTL_MS = 30_000;
+export class OverlayCache {
+    entries = new Map();
+    inflight = new Map();
+    maxEntries;
+    ttlMs;
+    negativeTtlMs;
+    now;
+    constructor(options = {}) {
+        this.maxEntries = options.maxEntries ?? DEFAULT_MAX_ENTRIES;
+        this.ttlMs = options.ttlMs ?? DEFAULT_TTL_MS;
+        this.negativeTtlMs = options.negativeTtlMs ?? DEFAULT_NEGATIVE_TTL_MS;
+        this.now = options.now ?? Date.now;
+    }
+    /**
+     * Get a cached value or compute it via `loader`. A hit requires both a
+     * matching sha and an unexpired entry; otherwise any stale entry is
+     * dropped and `loader` runs. Concurrent calls for the same key share one
+     * in-flight loader invocation.
+     */
+    async getOrCompute(repo, symbol, sha, loader) {
+        const key = `${repo}:${symbol}`;
+        const cached = this.entries.get(key);
+        if (cached) {
+            if (cached.sha === sha && cached.expiresAt > this.now()) {
+                this.entries.delete(key);
+                this.entries.set(key, cached); // re-insert at end: true LRU
+                return cached.value;
+            }
+            this.entries.delete(key); // stale (expired or sha mismatch)
+        }
+        const pending = this.inflight.get(key);
+        if (pending)
+            return pending;
+        const promise = loader()
+            .then((value) => {
+            const ttl = value === null ? this.negativeTtlMs : this.ttlMs;
+            this.entries.set(key, { value, sha, expiresAt: this.now() + ttl });
+            this.evictOverflow();
+            return value;
+        })
+            .finally(() => {
+            this.inflight.delete(key);
+        });
+        this.inflight.set(key, promise);
+        return promise;
+    }
+    evictOverflow() {
+        while (this.entries.size > this.maxEntries) {
+            const oldest = this.entries.keys().next().value;
+            if (oldest === undefined)
+                break;
+            this.entries.delete(oldest);
+        }
+    }
+}
+//# sourceMappingURL=overlay-cache.js.map

package/dist/utils/overlay-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"overlay-cache.js","sourceRoot":"","sources":["../../src/utils/overlay-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,MAAM,cAAc,GAAG,CAAC,GAAG,MAAM,CAAC;AAClC,MAAM,uBAAuB,GAAG,MAAM,CAAC;AAevC,MAAM,OAAO,YAAY;IACf,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC7C,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;IACvC,UAAU,CAAS;IACnB,KAAK,CAAS;IACd,aAAa,CAAS;IACtB,GAAG,CAAe;IAEnC,YAAY,UAA+B,EAAE;QAC3C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;QAC5D,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,cAAc,CAAC;QAC7C,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,uBAAuB,CAAC;QACtE,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAChB,IAAY,EACZ,MAAc,EACd,GAAW,EACX,MAA+B;QAE/B,MAAM,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,MAAM,CAAC,GAAG,KAAK,GAAG,IAAI,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;gBACxD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,6BAA6B;gBAC5D,OAAO,MAAM,CAAC,KAAK,CAAC;YACtB,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,kCAAkC;QAC9D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC;QAE5B,MAAM,OAAO,GAAG,MAAM,EAAE;aACrB,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;YACd,MAAM,GAAG,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;YACnE,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,aAAa;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS;gBAAE,MAAM;YAChC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;CACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "codesift-mcp",
-  "version": "0.9.10",
+  "version": "0.10.0",
   "description": "MCP server for code intelligence — 146 tools for symbol search, call graph, semantic search, route tracing, community detection, LSP bridge, secret detection, conversation search, and Hono framework intelligence",
   "license": "BSL-1.1",
   "author": "Greg Laskowski",