@lzehrung/codegraph 2.1.0

package/dist/types.d.ts

@@ -0,0 +1,39 @@
+export type Pos = {
+    line: number;
+    column: number;
+    index?: number;
+};
+export type Range = {
+    start: Pos;
+    end: Pos;
+};
+export type FileId = string;
+export type EdgeTo = {
+    type: "file";
+    path: FileId;
+} | {
+    type: "external";
+    name: string;
+};
+export type Edge = {
+    from: FileId;
+    to: EdgeTo;
+    raw: string;
+    typeOnly?: boolean;
+    resolved?: "heuristic" | "precise";
+    confidence?: number;
+};
+export type ProgressUpdate = {
+    type: "progress";
+    message: string;
+    current: number;
+    total: number;
+    phase?: "start" | "update" | "complete";
+    mode?: "build" | "update" | "check";
+    elapsedMs?: number;
+};
+export type Graph = {
+    nodes: Set<FileId>;
+    edges: Edge[];
+};
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,GAAG,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AACnE,MAAM,MAAM,KAAK,GAAG;IAAE,KAAK,EAAE,GAAG,CAAC;IAAC,GAAG,EAAE,GAAG,CAAA;CAAE,CAAC;AAC7C,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAE5B,MAAM,MAAM,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzF,MAAM,MAAM,IAAI,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,QAAQ,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,UAAU,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,OAAO,GAAG,QAAQ,GAAG,UAAU,CAAC;IACxC,IAAI,CAAC,EAAE,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;IACpC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,KAAK,GAAG;IAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,KAAK,EAAE,IAAI,EAAE,CAAA;CAAE,CAAC"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/dist/util/ast.d.ts

@@ -0,0 +1,20 @@
+import type { Range } from "../types.js";
+/** Node-like interface for AST nodes with position info */
+interface NodeLike {
+    startIndex: number;
+    endIndex: number;
+    startPosition: {
+        row: number;
+        column: number;
+    };
+    endPosition: {
+        row: number;
+        column: number;
+    };
+}
+export declare function sliceText(node: NodeLike | null | undefined, src: string): string;
+export declare function unquote(s: string): string;
+export declare function toRange(node: NodeLike | null | undefined): Range;
+export declare function stringifyUnknown(value: unknown): string;
+export {};
+//# sourceMappingURL=ast.d.ts.map

package/dist/util/ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../src/util/ast.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAEzC,2DAA2D;AAC3D,UAAU,QAAQ;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/C,WAAW,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9C;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAGhF;AACD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQzC;AACD,wBAAgB,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,GAAG,SAAS,GAAG,KAAK,CAmBhE;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAqBvD"}

package/dist/util/ast.js

@@ -0,0 +1,62 @@
+export function sliceText(node, src) {
+    if (!node || !src)
+        return "";
+    return src.slice(node.startIndex, node.endIndex);
+}
+export function unquote(s) {
+    if (!s || typeof s !== "string")
+        return s;
+    const t = s.trim();
+    return (t.startsWith('"') && t.endsWith('"')) ||
+        (t.startsWith("'") && t.endsWith("'")) ||
+        (t.startsWith("`") && t.endsWith("`"))
+        ? t.slice(1, -1)
+        : t;
+}
+export function toRange(node) {
+    if (!node) {
+        return {
+            start: { line: 0, column: 0, index: 0 },
+            end: { line: 0, column: 0, index: 0 },
+        };
+    }
+    return {
+        start: {
+            line: node.startPosition.row + 1,
+            column: node.startPosition.column + 1,
+            index: node.startIndex,
+        },
+        end: {
+            line: node.endPosition.row + 1,
+            column: node.endPosition.column + 1,
+            index: node.endIndex,
+        },
+    };
+}
+export function stringifyUnknown(value) {
+    if (value instanceof Error)
+        return value.message;
+    if (typeof value === "string")
+        return value;
+    if (typeof value === "number" || typeof value === "boolean" || typeof value === "bigint") {
+        return String(value);
+    }
+    if (value === null || value === undefined) {
+        return String(value);
+    }
+    if (typeof value === "object") {
+        try {
+            return JSON.stringify(value);
+        }
+        catch {
+            return "[Object]";
+        }
+    }
+    if (typeof value === "symbol")
+        return value.toString();
+    if (typeof value === "function") {
+        return `[Function: ${value.name || "anonymous"}]`;
+    }
+    return "unknown";
+}
+//# sourceMappingURL=ast.js.map

package/dist/util/ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.js","sourceRoot":"","sources":["../../src/util/ast.ts"],"names":[],"mappings":"AAUA,MAAM,UAAU,SAAS,CAAC,IAAiC,EAAE,GAAW;IACtE,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IAC7B,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACnD,CAAC;AACD,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACnB,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC;AACR,CAAC;AACD,MAAM,UAAU,OAAO,CAAC,IAAiC;IACvD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO;YACL,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YACvC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;SACtC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,KAAK,EAAE;YACL,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;YAChC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;YACrC,KAAK,EAAE,IAAI,CAAC,UAAU;SACvB;QACD,GAAG,EAAE;YACH,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;YAC9B,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YACnC,KAAK,EAAE,IAAI,CAAC,QAAQ;SACrB;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAc;IAC7C,IAAI,KAAK,YAAY,KAAK;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC;IACjD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACzF,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1C,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,QAAQ,EAAE,CAAC;IACvD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,OAAO,cAAc,KAAK,CAAC,IAAI,IAAI,WAAW,GAAG,CAAC;IACpD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/util/bloomFilter.d.ts

@@ -0,0 +1,99 @@
+/**
+ * Simple bloom filter implementation for fast reference pre-filtering
+ *
+ * Used to quickly determine if a file MIGHT contain references to a symbol,
+ * allowing us to skip files that definitely don't contain the symbol.
+ */
+/**
+ * Calculate optimal bloom filter parameters for a target false positive rate.
+ * @param expectedItems - Expected number of items to be added
+ * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+ * @returns Optimal size in bits and hash count
+ */
+export declare function calculateOptimalBloomParams(expectedItems: number, falsePositiveRate?: number): {
+    size: number;
+    hashCount: number;
+};
+export declare class BloomFilter {
+    private bits;
+    private size;
+    private hashCount;
+    private itemCount;
+    /**
+     * Create a bloom filter
+     * @param size - Number of bits in the filter (default: 10000)
+     * @param hashCount - Number of hash functions to use (default: 3)
+     */
+    constructor(size?: number, hashCount?: number);
+    /**
+     * Create an optimally-sized bloom filter for the expected number of items.
+     * @param expectedItems - Expected number of items to be added
+     * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+     */
+    static createOptimal(expectedItems: number, falsePositiveRate?: number): BloomFilter;
+    /**
+     * Add an item to the bloom filter
+     */
+    add(item: string): void;
+    /**
+     * Get the number of items added to the filter
+     */
+    getItemCount(): number;
+    /**
+     * Get the current estimated false positive rate based on items added
+     */
+    getCurrentFalsePositiveRate(): number;
+    /**
+     * Check if an item might be in the set
+     * Returns false if definitely not present, true if might be present
+     */
+    mightContain(item: string): boolean;
+    /**
+     * Generate multiple hash values for an item
+     */
+    private getHashes;
+    /**
+     * Get the approximate false positive rate
+     */
+    getFalsePositiveRate(itemCount: number): number;
+    /**
+     * Serialize to buffer for caching
+     */
+    toBuffer(): Buffer;
+    /**
+     * Deserialize from buffer
+     */
+    static fromBuffer(buffer: Buffer, size: number, hashCount: number): BloomFilter;
+    /**
+     * Get metadata for serialization
+     */
+    getMetadata(): {
+        size: number;
+        hashCount: number;
+    };
+}
+/**
+ * Build a bloom filter from source code with auto-sizing.
+ * Extracts all identifiers and adds them to an optimally-sized filter.
+ * @param source - The source code to analyze
+ * @param languageId - The language identifier (unused, for future extension)
+ * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+ */
+export declare function buildBloomFilterFromSource(source: string, languageId: string, falsePositiveRate?: number): BloomFilter;
+/**
+ * Cache of bloom filters per file
+ */
+export declare class BloomFilterCache {
+    private filters;
+    set(file: string, filter: BloomFilter): void;
+    get(file: string): BloomFilter | undefined;
+    has(file: string): boolean;
+    /**
+     * Check if a symbol might be in any of the provided files
+     * Returns only files that might contain the symbol
+     */
+    filterFiles(symbol: string, files: string[]): string[];
+    clear(): void;
+    size(): number;
+}
+//# sourceMappingURL=bloomFilter.d.ts.map

package/dist/util/bloomFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bloomFilter.d.ts","sourceRoot":"","sources":["../../src/util/bloomFilter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH;;;;;GAKG;AACH,wBAAgB,2BAA2B,CACzC,aAAa,EAAE,MAAM,EACrB,iBAAiB,SAAO,GACvB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAkBrC;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAa;IAE9B;;;;OAIG;gBACS,IAAI,SAAQ,EAAE,SAAS,SAAI;IAMvC;;;;OAIG;IACH,MAAM,CAAC,aAAa,CAAC,aAAa,EAAE,MAAM,EAAE,iBAAiB,SAAO,GAAG,WAAW;IAKlF;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAevB;;OAEG;IACH,YAAY,IAAI,MAAM;IAItB;;OAEG;IACH,2BAA2B,IAAI,MAAM;IAIrC;;;OAGG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAanC;;OAEG;IACH,OAAO,CAAE,SAAS;IAYlB;;OAEG;IACH,oBAAoB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAO/C;;OAEG;IACH,QAAQ,IAAI,MAAM;IAIlB;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,WAAW;IAM/E;;OAEG;IACH,WAAW,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;CAGnD;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,SAAO,GAAG,WAAW,CAiBpH;AAED;;GAEG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,OAAO,CAAkC;IAEjD,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG,IAAI;IAI5C,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAI1C,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAI1B;;;OAGG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAiBtD,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,MAAM;CAGf"}

package/dist/util/bloomFilter.js

@@ -0,0 +1,205 @@
+/**
+ * Simple bloom filter implementation for fast reference pre-filtering
+ *
+ * Used to quickly determine if a file MIGHT contain references to a symbol,
+ * allowing us to skip files that definitely don't contain the symbol.
+ */
+import { fileIdentityKey } from "./paths.js";
+import crypto from "node:crypto";
+/**
+ * Calculate optimal bloom filter parameters for a target false positive rate.
+ * @param expectedItems - Expected number of items to be added
+ * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+ * @returns Optimal size in bits and hash count
+ */
+export function calculateOptimalBloomParams(expectedItems, falsePositiveRate = 0.01) {
+    // Ensure reasonable bounds
+    const n = Math.max(1, expectedItems);
+    const p = Math.max(0.0001, Math.min(0.5, falsePositiveRate));
+    // Optimal size: m = -n * ln(p) / (ln(2)^2)
+    const ln2 = Math.LN2;
+    const ln2Squared = ln2 * ln2;
+    const optimalSize = Math.ceil((-n * Math.log(p)) / ln2Squared);
+    // Optimal hash count: k = (m/n) * ln(2)
+    const optimalHashCount = Math.max(1, Math.round((optimalSize / n) * ln2));
+    // Clamp to reasonable bounds
+    const size = Math.max(1000, Math.min(1000000, optimalSize)); // 1KB to 125KB
+    const hashCount = Math.max(1, Math.min(10, optimalHashCount));
+    return { size, hashCount };
+}
+export class BloomFilter {
+    bits;
+    size;
+    hashCount;
+    itemCount = 0;
+    /**
+     * Create a bloom filter
+     * @param size - Number of bits in the filter (default: 10000)
+     * @param hashCount - Number of hash functions to use (default: 3)
+     */
+    constructor(size = 10000, hashCount = 3) {
+        this.size = size;
+        this.hashCount = hashCount;
+        this.bits = new Uint8Array(Math.ceil(size / 8));
+    }
+    /**
+     * Create an optimally-sized bloom filter for the expected number of items.
+     * @param expectedItems - Expected number of items to be added
+     * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+     */
+    static createOptimal(expectedItems, falsePositiveRate = 0.01) {
+        const { size, hashCount } = calculateOptimalBloomParams(expectedItems, falsePositiveRate);
+        return new BloomFilter(size, hashCount);
+    }
+    /**
+     * Add an item to the bloom filter
+     */
+    add(item) {
+        // Set all bits first, only increment count if all operations succeed
+        for (const hash of this.getHashes(item)) {
+            const byteIndex = Math.floor(hash / 8);
+            const bitIndex = hash % 8;
+            if (byteIndex < 0 || byteIndex >= this.bits.length)
+                return;
+            const currentByte = this.bits[byteIndex];
+            if (currentByte !== undefined) {
+                this.bits[byteIndex] = currentByte | (1 << bitIndex);
+            }
+        }
+        // Only increment after successful addition
+        this.itemCount++;
+    }
+    /**
+     * Get the number of items added to the filter
+     */
+    getItemCount() {
+        return this.itemCount;
+    }
+    /**
+     * Get the current estimated false positive rate based on items added
+     */
+    getCurrentFalsePositiveRate() {
+        return this.getFalsePositiveRate(this.itemCount);
+    }
+    /**
+     * Check if an item might be in the set
+     * Returns false if definitely not present, true if might be present
+     */
+    mightContain(item) {
+        for (const hash of this.getHashes(item)) {
+            const byteIndex = Math.floor(hash / 8);
+            const bitIndex = hash % 8;
+            if (byteIndex < 0 || byteIndex >= this.bits.length)
+                return false;
+            const currentByte = this.bits[byteIndex];
+            if (currentByte === undefined || (currentByte & (1 << bitIndex)) === 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Generate multiple hash values for an item
+     */
+    *getHashes(item) {
+        // Use a single hash and derive multiple values from it
+        const hash = crypto.createHash("sha256").update(item).digest();
+        for (let i = 0; i < this.hashCount; i++) {
+            // Take different 4-byte segments of the hash
+            const offset = (i * 4) % (hash.length - 4);
+            const value = hash.readUInt32LE(offset);
+            yield value % this.size;
+        }
+    }
+    /**
+     * Get the approximate false positive rate
+     */
+    getFalsePositiveRate(itemCount) {
+        // Formula: (1 - e^(-k*n/m))^k
+        // where k = hashCount, n = itemCount, m = size
+        const exp = Math.exp((-this.hashCount * itemCount) / this.size);
+        return Math.pow(1 - exp, this.hashCount);
+    }
+    /**
+     * Serialize to buffer for caching
+     */
+    toBuffer() {
+        return Buffer.from(this.bits);
+    }
+    /**
+     * Deserialize from buffer
+     */
+    static fromBuffer(buffer, size, hashCount) {
+        const filter = new BloomFilter(size, hashCount);
+        filter.bits = new Uint8Array(buffer);
+        return filter;
+    }
+    /**
+     * Get metadata for serialization
+     */
+    getMetadata() {
+        return { size: this.size, hashCount: this.hashCount };
+    }
+}
+/**
+ * Build a bloom filter from source code with auto-sizing.
+ * Extracts all identifiers and adds them to an optimally-sized filter.
+ * @param source - The source code to analyze
+ * @param languageId - The language identifier (unused, for future extension)
+ * @param falsePositiveRate - Target false positive rate (default: 0.01 = 1%)
+ */
+export function buildBloomFilterFromSource(source, languageId, falsePositiveRate = 0.01) {
+    // Extract all identifiers using a simple regex
+    // This is a fast heuristic - doesn't need to be perfect
+    const identifierPattern = /\b[a-zA-Z_$][a-zA-Z0-9_$]*\b/g;
+    const matches = source.match(identifierPattern);
+    // Use a Set to deduplicate before sizing and adding
+    const unique = matches ? new Set(matches) : new Set();
+    // Create optimally-sized filter based on unique identifier count
+    const filter = BloomFilter.createOptimal(unique.size || 100, falsePositiveRate);
+    for (const identifier of unique) {
+        filter.add(identifier);
+    }
+    return filter;
+}
+/**
+ * Cache of bloom filters per file
+ */
+export class BloomFilterCache {
+    filters = new Map();
+    set(file, filter) {
+        this.filters.set(fileIdentityKey(file), filter);
+    }
+    get(file) {
+        return this.filters.get(fileIdentityKey(file));
+    }
+    has(file) {
+        return this.filters.has(fileIdentityKey(file));
+    }
+    /**
+     * Check if a symbol might be in any of the provided files
+     * Returns only files that might contain the symbol
+     */
+    filterFiles(symbol, files) {
+        const candidates = [];
+        for (const file of files) {
+            const filter = this.filters.get(fileIdentityKey(file));
+            if (!filter) {
+                // If no filter exists, assume it might contain the symbol
+                candidates.push(file);
+            }
+            else if (filter.mightContain(symbol)) {
+                candidates.push(file);
+            }
+            // If filter exists and definitely doesn't contain symbol, skip
+        }
+        return candidates;
+    }
+    clear() {
+        this.filters.clear();
+    }
+    size() {
+        return this.filters.size;
+    }
+}
+//# sourceMappingURL=bloomFilter.js.map

package/dist/util/bloomFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bloomFilter.js","sourceRoot":"","sources":["../../src/util/bloomFilter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,MAAM,MAAM,aAAa,CAAC;AAEjC;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CACzC,aAAqB,EACrB,iBAAiB,GAAG,IAAI;IAExB,2BAA2B;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAE7D,2CAA2C;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IACrB,MAAM,UAAU,GAAG,GAAG,GAAG,GAAG,CAAC;IAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAE/D,wCAAwC;IACxC,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAE1E,6BAA6B;IAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,eAAe;IAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAE9D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,OAAO,WAAW;IACd,IAAI,CAAa;IACjB,IAAI,CAAS;IACb,SAAS,CAAS;IAClB,SAAS,GAAW,CAAC,CAAC;IAE9B;;;;OAIG;IACH,YAAY,IAAI,GAAG,KAAK,EAAE,SAAS,GAAG,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,aAAa,CAAC,aAAqB,EAAE,iBAAiB,GAAG,IAAI;QAClE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,2BAA2B,CAAC,aAAa,EAAE,iBAAiB,CAAC,CAAC;QAC1F,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,IAAY;QACd,qEAAqE;QACrE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1B,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;gBAAE,OAAO;YAC3D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,2CAA2C;QAC3C,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,2BAA2B;QACzB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,IAAY;QACvB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1B,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACjE,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,CAAC,SAAS,CAAC,IAAY;QAC7B,uDAAuD;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAE/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,6CAA6C;YAC7C,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,SAAiB;QACpC,8BAA8B;QAC9B,+CAA+C;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,MAAc,EAAE,IAAY,EAAE,SAAiB;QAC/D,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,MAAM,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACxD,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,UAAU,0BAA0B,CAAC,MAAc,EAAE,UAAkB,EAAE,iBAAiB,GAAG,IAAI;IACrG,+CAA+C;IAC/C,wDAAwD;IACxD,MAAM,iBAAiB,GAAG,+BAA+B,CAAC;IAC1D,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAEhD,oDAAoD;IACpD,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAU,CAAC;IAE9D,iEAAiE;IACjE,MAAM,MAAM,GAAG,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,iBAAiB,CAAC,CAAC;IAEhF,KAAK,MAAM,UAAU,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,gBAAgB;IACnB,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEjD,GAAG,CAAC,IAAY,EAAE,MAAmB;QACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,MAAc,EAAE,KAAe;QACzC,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,0DAA0D;gBAC1D,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;YACD,+DAA+D;QACjE,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;CACF"}

package/dist/util/collections.d.ts

@@ -0,0 +1,3 @@
+export declare function appendToArrayMap<TKey, TValue>(map: Map<TKey, TValue[]>, key: TKey, value: TValue): void;
+export declare function uniqueByKey<T>(items: Iterable<T>, keyFor: (item: T) => string): T[];
+//# sourceMappingURL=collections.d.ts.map

package/dist/util/collections.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.d.ts","sourceRoot":"","sources":["../../src/util/collections.ts"],"names":[],"mappings":"AAAA,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAOvG;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,EAAE,CAUnF"}

package/dist/util/collections.js

@@ -0,0 +1,21 @@
+export function appendToArrayMap(map, key, value) {
+    const existing = map.get(key);
+    if (existing) {
+        existing.push(value);
+        return;
+    }
+    map.set(key, [value]);
+}
+export function uniqueByKey(items, keyFor) {
+    const unique = [];
+    const seen = new Set();
+    for (const item of items) {
+        const key = keyFor(item);
+        if (seen.has(key))
+            continue;
+        seen.add(key);
+        unique.push(item);
+    }
+    return unique;
+}
+//# sourceMappingURL=collections.js.map

package/dist/util/collections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.js","sourceRoot":"","sources":["../../src/util/collections.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,gBAAgB,CAAe,GAAwB,EAAE,GAAS,EAAE,KAAa;IAC/F,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,QAAQ,EAAE,CAAC;QACb,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO;IACT,CAAC;IACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,WAAW,CAAI,KAAkB,EAAE,MAA2B;IAC5E,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/util/comments.d.ts

@@ -0,0 +1,10 @@
+export type InlineCommentTrimMode = "preserve" | "trim";
+export declare function stripHashInlineComment(line: string, trimMode: InlineCommentTrimMode): string;
+export declare function stripJsLikeComments(src: string): string;
+export declare function maskJsLikeCommentsAndStrings(src: string): string;
+export declare function buildJsLikeLiteralMask(source: string): Uint8Array | undefined;
+export declare function maskJsLikeCommentsStringsAndRegex(src: string): string;
+export declare function stripJsonTrailingCommas(src: string): string;
+export declare function parseJsonc<T>(raw: string): T;
+export declare function stripPythonCommentsAndStrings(src: string): string;
+//# sourceMappingURL=comments.d.ts.map

package/dist/util/comments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comments.d.ts","sourceRoot":"","sources":["../../src/util/comments.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,qBAAqB,GAAG,UAAU,GAAG,MAAM,CAAC;AAExD,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,qBAAqB,GAAG,MAAM,CAkB5F;AA4FD,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED,wBAAgB,4BAA4B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAKhE;AA6KD,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAkB7E;AAuBD,wBAAgB,iCAAiC,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAGrE;AAED,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CA8C3D;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,CAE5C;AAED,wBAAgB,6BAA6B,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAMjE"}