seer-mcp 0.1.0

package/dist/parser/workerpool.js

@@ -0,0 +1,383 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WorkerPool = void 0;
+exports.defaultWorkerPath = defaultWorkerPath;
+/**
+ * WorkerPool — a fixed-size pool of parser workers with ordered draining,
+ * bounded out-of-order buffering, per-job attempt limits, and crash recovery.
+ *
+ * Used by the indexer's parallel-parsing path. The pool owns:
+ *   - N workers, each its own V8 isolate + WASM heap.
+ *   - A FIFO queue of pending jobs.
+ *   - A small bounded buffer for out-of-order completions (results that
+ *     finished ahead of the current head seq are held until the head
+ *     advances). The buffer is bounded by `maxLag` so a slow head can't
+ *     pile up unbounded memory.
+ *   - An "inflight" map: workerId → currently-assigned job. On worker
+ *     death this is what gets requeued.
+ *
+ * Design discipline:
+ *   - Workers parse only. The pool never touches the DB or graph.
+ *   - The consumer callback is invoked strictly in input order. Symbol IDs
+ *     in the indexer depend on this for cross-run determinism.
+ *   - Crashes are recoverable but bounded: a job that has crashed `maxAttempts`
+ *     workers in a row is reported as a parse-error and the run continues.
+ *   - Shutdown is graceful: drain inflight, send `shutdown` to each worker,
+ *     await exit. Terminate is the hammer for tests.
+ */
+const worker_threads_1 = require("worker_threads");
+const fs_1 = __importDefault(require("fs"));
+const path_1 = __importDefault(require("path"));
+const os_1 = __importDefault(require("os"));
+// ── Default worker-path resolver ─────────────────────────────────────────────
+//
+// Workers always run from the compiled .js artifact. In dev (tsx) the source
+// of this module is .ts; we reflect __dirname to dist. This means callers
+// must `npm run build` before turning on parallel mode in dev — which matches
+// the pattern already used by the MCP test suite. If the dist artifact is
+// missing we throw with a clear message rather than silently fall back.
+function defaultWorkerPath() {
+    const here = __filename;
+    if (here.endsWith('.js')) {
+        return path_1.default.join(__dirname, 'worker.js');
+    }
+    // Source mode: reflect src/parser/<this>.ts → dist/parser/worker.js.
+    const distDir = __dirname
+        .replace(`${path_1.default.sep}src${path_1.default.sep}parser`, `${path_1.default.sep}dist${path_1.default.sep}parser`)
+        .replace('/src/parser', '/dist/parser');
+    const distWorker = path_1.default.join(distDir, 'worker.js');
+    if (!fs_1.default.existsSync(distWorker)) {
+        throw new Error(`Parallel parsing requires the compiled worker at ${distWorker}. ` +
+            `Run \`npm run build\` first, or set SEER_PARALLEL_PARSE=0.`);
+    }
+    return distWorker;
+}
+// ── WorkerPool ───────────────────────────────────────────────────────────────
+class WorkerPool {
+    workerPath;
+    maxLag;
+    maxAttempts;
+    _jobs;
+    workers = [];
+    idle = [];
+    nextWorkerId = 0;
+    /** Sequence number of the next result we expect to deliver via the callback. */
+    headSeq = 0;
+    /** Total jobs in the current dispatch. */
+    totalJobs = 0;
+    /** Next seq to send to a worker. */
+    nextDispatchSeq = 0;
+    /** seq → WorkItem (for the entire dispatch). */
+    items = [];
+    /** seq → attempt count. */
+    attempts = new Map();
+    /** Out-of-order buffer for seq > headSeq. */
+    buffered = new Map();
+    /** Awaiting-worker queue: seqs that need to be dispatched but no worker is free. */
+    pendingDispatch = [];
+    /** Currently active dispatch — null when idle. */
+    active = null;
+    /**
+     * Synchronous flag set the moment `dispatch()` is entered. Prevents two
+     * synchronous `dispatch()` calls from both passing the `if (this.active)`
+     * guard before the first reaches its `await this.ready()`. `this.active`
+     * itself is set after that await, so it can't be the only guard.
+     */
+    dispatching = false;
+    /** A rolling promise chain so the consumer callback is invoked strictly serially. */
+    callbackChain = Promise.resolve();
+    _wasmResets = 0;
+    terminated = false;
+    constructor(opts = {}) {
+        this._jobs = Math.max(1, opts.jobs ?? defaultJobCount());
+        this.workerPath = opts.workerPath ?? defaultWorkerPath();
+        this.maxLag = Math.max(this._jobs, opts.maxLag ?? this._jobs * 4);
+        this.maxAttempts = Math.max(1, opts.maxAttempts ?? 3);
+    }
+    /** Number of workers actually spawned (after `ready()`). */
+    get jobs() { return this._jobs; }
+    /** Total worker-local ParserContext resets observed across this pool. */
+    wasmResetCount() { return this._wasmResets; }
+    /** Spawn workers and wait for all of them to post `ready`. */
+    async ready() {
+        if (this.workers.length > 0)
+            return; // already spawned
+        const readyPromises = [];
+        for (let i = 0; i < this._jobs; i++) {
+            const handle = this.spawnWorker();
+            this.workers.push(handle);
+            readyPromises.push(new Promise((resolve, reject) => {
+                handle.worker.once('error', reject);
+                const onMsg = (msg) => {
+                    if (msg.kind === 'ready') {
+                        handle.ready = true;
+                        this.idle.push(handle);
+                        handle.worker.off('message', onMsg);
+                        resolve();
+                    }
+                };
+                handle.worker.on('message', onMsg);
+            }));
+        }
+        await Promise.all(readyPromises);
+    }
+    /**
+     * Dispatch every WorkItem to the pool. The callback is invoked exactly once
+     * per item, in input order, regardless of which worker finished it.
+     *
+     * Resolves when every item has been delivered to the callback. Rejects if
+     * the pool is terminated mid-dispatch.
+     */
+    async dispatch(items, onResult) {
+        if (this.dispatching || this.active) {
+            throw new Error('WorkerPool: dispatch already in progress');
+        }
+        if (this.terminated) {
+            throw new Error('WorkerPool: terminated');
+        }
+        if (items.length === 0)
+            return;
+        this.dispatching = true;
+        try {
+            await this.ready();
+            this.items = items;
+            this.totalJobs = items.length;
+            this.headSeq = 0;
+            this.nextDispatchSeq = 0;
+            this.attempts.clear();
+            this.buffered.clear();
+            this.pendingDispatch.length = 0;
+            this.callbackChain = Promise.resolve();
+            await new Promise((resolve, reject) => {
+                this.active = {
+                    onResult,
+                    resolve,
+                    reject,
+                    delivering: this.callbackChain,
+                };
+                this.pump();
+            });
+            // Wait for the callback chain to fully drain before returning.
+            await this.callbackChain;
+            this.active = null;
+            this.items = [];
+        }
+        finally {
+            this.dispatching = false;
+        }
+    }
+    /** Shutdown: send 'shutdown' to each worker, await all exits. */
+    async shutdown() {
+        if (this.terminated)
+            return;
+        this.terminated = true;
+        const exits = [];
+        for (const h of this.workers) {
+            exits.push(new Promise(resolve => {
+                h.worker.once('exit', () => resolve());
+                try {
+                    h.worker.postMessage({ kind: 'shutdown' });
+                }
+                catch {
+                    resolve();
+                }
+            }));
+        }
+        await Promise.all(exits);
+        this.workers = [];
+        this.idle = [];
+    }
+    /** Hammer: force-terminate all workers. Use only when shutdown() can't. */
+    async terminate() {
+        if (this.terminated && this.workers.length === 0)
+            return;
+        this.terminated = true;
+        const exits = [];
+        for (const h of this.workers)
+            exits.push(h.worker.terminate());
+        await Promise.all(exits);
+        this.workers = [];
+        this.idle = [];
+    }
+    // ── Internals ──────────────────────────────────────────────────────────────
+    /** Pump dispatch + drain until either no work is left or no slack remains. */
+    pump() {
+        // 1. Dispatch as many new seqs as backpressure allows.
+        //    Constraint: seqDispatched < headSeq + maxLag, so the buffered out-of-order
+        //    set can't grow past `maxLag` entries.
+        while (this.idle.length > 0
+            && this.nextDispatchSeq < this.totalJobs
+            && this.nextDispatchSeq < this.headSeq + this.maxLag) {
+            const seq = this.nextDispatchSeq++;
+            const handle = this.idle.pop();
+            this.sendJob(handle, seq);
+        }
+        // 2. Also drain any pendingDispatch (requeued after a crash) while workers idle.
+        while (this.idle.length > 0 && this.pendingDispatch.length > 0) {
+            const seq = this.pendingDispatch.shift();
+            const handle = this.idle.pop();
+            this.sendJob(handle, seq);
+        }
+        // 3. If everything is delivered, finish the dispatch.
+        if (this.active && this.headSeq >= this.totalJobs) {
+            const a = this.active;
+            // Resolve once the callback chain has drained the last buffered result.
+            this.callbackChain.then(() => a.resolve(), err => a.reject(err));
+        }
+    }
+    sendJob(handle, seq) {
+        const item = this.items[seq];
+        handle.inflight = { seq, item };
+        const job = {
+            kind: 'parse',
+            seq,
+            abs: item.abs,
+            lang: item.lang,
+            expectedHash: item.expectedHash,
+            maxFileBytes: item.maxFileBytes,
+        };
+        try {
+            handle.worker.postMessage(job);
+        }
+        catch (err) {
+            // Worker is gone — treat as crash.
+            this.onWorkerCrash(handle, err);
+        }
+    }
+    spawnWorker() {
+        const id = this.nextWorkerId++;
+        const worker = new worker_threads_1.Worker(this.workerPath);
+        const handle = { id, worker, inflight: null, ready: false, wasmResets: 0 };
+        worker.on('message', (msg) => this.onWorkerMessage(handle, msg));
+        worker.on('error', err => this.onWorkerCrash(handle, err));
+        worker.on('exit', code => {
+            if (this.terminated)
+                return;
+            if (handle.inflight) {
+                // Unexpected exit during a job.
+                this.onWorkerCrash(handle, new Error(`worker ${id} exited with code ${code} mid-job`));
+                return;
+            }
+            // Exited idle — only fine if we're tearing down. If we're still active,
+            // respawn so the pool doesn't shrink under load.
+            if (this.active && !this.terminated) {
+                this.respawnWorker(handle);
+            }
+        });
+        return handle;
+    }
+    respawnWorker(dead) {
+        const idx = this.workers.indexOf(dead);
+        if (idx >= 0)
+            this.workers.splice(idx, 1);
+        const idleIdx = this.idle.indexOf(dead);
+        if (idleIdx >= 0)
+            this.idle.splice(idleIdx, 1);
+        const fresh = this.spawnWorker();
+        this.workers.push(fresh);
+        // Wait for fresh worker's ready message before counting it as idle.
+        const onMsg = (msg) => {
+            if (msg.kind === 'ready') {
+                fresh.ready = true;
+                fresh.worker.off('message', onMsg);
+                this.idle.push(fresh);
+                if (this.active)
+                    this.pump();
+            }
+        };
+        fresh.worker.on('message', onMsg);
+    }
+    onWorkerCrash(handle, err) {
+        const job = handle.inflight;
+        handle.inflight = null;
+        if (job) {
+            const prior = this.attempts.get(job.seq) ?? 0;
+            const attempts = prior + 1;
+            this.attempts.set(job.seq, attempts);
+            if (attempts >= this.maxAttempts) {
+                // Give up on this seq — synthesize a parse-error so the dispatch can drain.
+                this.deliver(job.seq, {
+                    kind: 'parse-error',
+                    seq: job.seq,
+                    hash: '',
+                    lines: 0,
+                    size: 0,
+                    wasmResets: handle.wasmResets,
+                });
+            }
+            else {
+                // Retry on another worker.
+                this.pendingDispatch.push(job.seq);
+            }
+        }
+        if (!this.terminated && this.active) {
+            this.respawnWorker(handle);
+        }
+        else {
+            // Out-of-band crash — surface only if no active dispatch is going to swallow it.
+            if (this.active && !job)
+                this.active.reject(err);
+        }
+    }
+    onWorkerMessage(handle, msg) {
+        if (msg.kind === 'ready' || msg.kind === 'shutdown-ack')
+            return;
+        const seq = msg.seq;
+        // Worker becomes idle again right away.
+        if (handle.inflight && handle.inflight.seq === seq)
+            handle.inflight = null;
+        if (!this.idle.includes(handle))
+            this.idle.push(handle);
+        if ('wasmResets' in msg) {
+            const total = msg.wasmResets;
+            const delta = Math.max(0, total - handle.wasmResets);
+            handle.wasmResets = total;
+            this._wasmResets += delta;
+        }
+        this.deliver(seq, msg);
+    }
+    deliver(seq, result) {
+        if (!this.active)
+            return; // late message after shutdown
+        if (seq === this.headSeq) {
+            this.invokeCallback(seq, result);
+            this.headSeq++;
+            // Drain any contiguous buffered successors.
+            while (this.buffered.has(this.headSeq)) {
+                const next = this.buffered.get(this.headSeq);
+                this.buffered.delete(this.headSeq);
+                this.invokeCallback(this.headSeq, next);
+                this.headSeq++;
+            }
+        }
+        else {
+            this.buffered.set(seq, result);
+        }
+        this.pump();
+    }
+    invokeCallback(seq, result) {
+        if (!this.active)
+            return;
+        const a = this.active;
+        const item = this.items[seq];
+        this.callbackChain = this.callbackChain.then(() => Promise.resolve(a.onResult(seq, result, item)));
+        // If the callback rejects, surface it through the active dispatch.
+        this.callbackChain = this.callbackChain.catch(err => {
+            if (this.active)
+                this.active.reject(err);
+        });
+    }
+}
+exports.WorkerPool = WorkerPool;
+// ── Helpers ──────────────────────────────────────────────────────────────────
+function defaultJobCount() {
+    // availableParallelism is the most accurate counter on cgroup-limited
+    // containers; fall back to cpus().length on older Node where it's missing.
+    const fn = os_1.default.availableParallelism;
+    const cores = typeof fn === 'function' ? fn() : os_1.default.cpus().length;
+    return Math.min(8, Math.max(1, cores - 1));
+}
+//# sourceMappingURL=workerpool.js.map

package/dist/parser/workerpool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workerpool.js","sourceRoot":"","sources":["../../src/parser/workerpool.ts"],"names":[],"mappings":";;;;;;AAwFA,8CAiBC;AAzGD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,mDAAwC;AACxC,4CAAoB;AACpB,gDAAwB;AACxB,4CAAoB;AAsDpB,gFAAgF;AAChF,EAAE;AACF,6EAA6E;AAC7E,0EAA0E;AAC1E,8EAA8E;AAC9E,0EAA0E;AAC1E,wEAAwE;AAExE,SAAgB,iBAAiB;IAC/B,MAAM,IAAI,GAAG,UAAU,CAAC;IACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,cAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IAC3C,CAAC;IACD,qEAAqE;IACrE,MAAM,OAAO,GAAG,SAAS;SACtB,OAAO,CAAC,GAAG,cAAI,CAAC,GAAG,MAAM,cAAI,CAAC,GAAG,QAAQ,EAAE,GAAG,cAAI,CAAC,GAAG,OAAO,cAAI,CAAC,GAAG,QAAQ,CAAC;SAC9E,OAAO,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,cAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACnD,IAAI,CAAC,YAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,oDAAoD,UAAU,IAAI;YAClE,4DAA4D,CAC7D,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,gFAAgF;AAEhF,MAAa,UAAU;IACJ,UAAU,CAAS;IACnB,MAAM,CAAS;IACf,WAAW,CAAS;IACpB,KAAK,CAAS;IAEvB,OAAO,GAAmB,EAAE,CAAC;IAC7B,IAAI,GAAmB,EAAE,CAAC;IAC1B,YAAY,GAAG,CAAC,CAAC;IAEzB,gFAAgF;IACxE,OAAO,GAAG,CAAC,CAAC;IACpB,0CAA0C;IAClC,SAAS,GAAG,CAAC,CAAC;IACtB,oCAAoC;IAC5B,eAAe,GAAG,CAAC,CAAC;IAC5B,gDAAgD;IACxC,KAAK,GAAe,EAAE,CAAC;IAC/B,2BAA2B;IACnB,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,6CAA6C;IACrC,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IACjD,oFAAoF;IAC5E,eAAe,GAAa,EAAE,CAAC;IACvC,kDAAkD;IAC1C,MAAM,GAKH,IAAI,CAAC;IAChB;;;;;OAKG;IACK,WAAW,GAAG,KAAK,CAAC;IAC5B,qFAAqF;IAC7E,aAAa,GAAkB,OAAO,CAAC,OAAO,EAAE,CAAC;IACjD,WAAW,GAAG,CAAC,CAAC;IAEhB,UAAU,GAAG,KAAK,CAAC;IAE3B,YAAY,OAA0B,EAAE;QACtC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,eAAe,EAAE,CAAC,CAAC;QACzD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,iBAAiB,EAAE,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,4DAA4D;IAC5D,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzC,yEAAyE;IACzE,cAAc,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAErD,8DAA8D;IAC9D,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,kBAAkB;QACvD,MAAM,aAAa,GAAyB,EAAE,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,aAAa,CAAC,IAAI,CAChB,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACpC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,KAAK,GAAG,CAAC,GAAiB,EAAQ,EAAE;oBACxC,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;wBACzB,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;wBACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBACvB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;wBACpC,OAAO,EAAE,CAAC;oBACZ,CAAC;gBACH,CAAC,CAAC;gBACF,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACrC,CAAC,CAAC,CACH,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAiB,EAAE,QAAwB;QACxD,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YAEnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;YAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;YAEvC,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC1C,IAAI,CAAC,MAAM,GAAG;oBACZ,QAAQ;oBACR,OAAO;oBACP,MAAM;oBACN,UAAU,EAAE,IAAI,CAAC,aAAa;iBAC/B,CAAC;gBACF,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,CAAC,CAAC,CAAC;YAEH,+DAA+D;YAC/D,MAAM,IAAI,CAAC,aAAa,CAAC;YACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAClB,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,KAAK,CAAC,QAAQ;QACZ,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,MAAM,KAAK,GAAyB,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,OAAO,CAAO,OAAO,CAAC,EAAE;gBACrC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;gBACvC,IAAI,CAAC;oBAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,UAAU,EAAwB,CAAC,CAAC;gBAAC,CAAC;gBACzE,MAAM,CAAC;oBAAC,OAAO,EAAE,CAAC;gBAAC,CAAC;YACtB,CAAC,CAAC,CAAC,CAAC;QACN,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,KAAK,CAAC,SAAS;QACb,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACzD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,MAAM,KAAK,GAA2B,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;QAC/D,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,8EAA8E;IAE9E,8EAA8E;IACtE,IAAI;QACV,uDAAuD;QACvD,gFAAgF;QAChF,2CAA2C;QAC3C,OACE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;eACjB,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,SAAS;eACrC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,EACpD,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,iFAAiF;QACjF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/D,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAG,CAAC;YAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,sDAAsD;QACtD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,wEAAwE;YACxE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAEO,OAAO,CAAC,MAAoB,EAAE,GAAW;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,QAAQ,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAChC,MAAM,GAAG,GAAgB;YACvB,IAAI,EAAE,OAAO;YACb,GAAG;YACH,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC;QACF,IAAI,CAAC;YACH,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,mCAAmC;YACnC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,GAAY,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAEO,WAAW;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,uBAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAiB,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAEzF,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;YACvB,IAAI,IAAI,CAAC,UAAU;gBAAE,OAAO;YAC5B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpB,gCAAgC;gBAChC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,UAAU,EAAE,qBAAqB,IAAI,UAAU,CAAC,CAAC,CAAC;gBACvF,OAAO;YACT,CAAC;YACD,wEAAwE;YACxE,iDAAiD;YACjD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,aAAa,CAAC,IAAkB;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,GAAG,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,OAAO,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAE/C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,oEAAoE;QACpE,MAAM,KAAK,GAAG,CAAC,GAAiB,EAAQ,EAAE;YACxC,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBACzB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;gBACnB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,IAAI,IAAI,CAAC,MAAM;oBAAE,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC,CAAC;QACF,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;IAEO,aAAa,CAAC,MAAoB,EAAE,GAAU;QACpD,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC5B,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC;QAEvB,IAAI,GAAG,EAAE,CAAC;YACR,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAErC,IAAI,QAAQ,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjC,4EAA4E;gBAC5E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;oBACpB,IAAI,EAAE,aAAa;oBACnB,GAAG,EAAE,GAAG,CAAC,GAAG;oBACZ,IAAI,EAAE,EAAE;oBACR,KAAK,EAAE,CAAC;oBACR,IAAI,EAAE,CAAC;oBACP,UAAU,EAAE,MAAM,CAAC,UAAU;iBAC9B,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,2BAA2B;gBAC3B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,iFAAiF;YACjF,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,MAAoB,EAAE,GAAiB;QAC7D,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc;YAAE,OAAO;QAEhE,MAAM,GAAG,GAAI,GAAuB,CAAC,GAAG,CAAC;QACzC,wCAAwC;QACxC,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,KAAK,GAAG;YAAE,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC3E,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAExD,IAAI,YAAY,IAAI,GAAG,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;YACrD,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC;YAC1B,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAiB,CAAC,CAAC;IACvC,CAAC;IAEO,OAAO,CAAC,GAAW,EAAE,MAAkB;QAC7C,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,CAAC,8BAA8B;QACxD,IAAI,GAAG,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACjC,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,4CAA4C;YAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAE,CAAC;gBAC9C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACxC,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAEO,cAAc,CAAC,GAAW,EAAE,MAAkB;QACpD,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACnG,mEAAmE;QACnE,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YAClD,IAAI,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAxUD,gCAwUC;AAED,gFAAgF;AAEhF,SAAS,eAAe;IACtB,sEAAsE;IACtE,2EAA2E;IAC3E,MAAM,EAAE,GAAI,YAAyD,CAAC,oBAAoB,CAAC;IAC3F,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAE,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC;IACjE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC"}

package/dist/scip/format.d.ts

@@ -0,0 +1,87 @@
+/**
+ * Track-F SCIP import.
+ *
+ * Seer accepts SCIP-format precision indexes (https://github.com/sourcegraph/scip)
+ * as an ADDITIVE precision uplift over the tree-sitter baseline. A SCIP index
+ * carries precise definitions and references produced by a real type-aware
+ * indexer (rust-analyzer, scip-typescript, scip-java, etc.). Importing one
+ * lets Seer overlay precise edges where tree-sitter's syntactic heuristics
+ * were guessing.
+ *
+ * The import is source-labelled (`provenance = 'scip'`) so consumers can
+ * always see which signals came from SCIP vs which were tree-sitter's best
+ * effort. Tree-sitter rows are never deleted by a SCIP import; when a SCIP
+ * symbol overlaps an existing tree-sitter row at the same file/line/kind, the
+ * tree-sitter row is re-labeled `'scip-merge'` (precision confirmed) and
+ * SCIP edges target its existing id.
+ *
+ * Format support:
+ *   - .scip       : binary protobuf (the canonical SCIP format)
+ *   - .scip.json  : Seer's JSON envelope mirroring the protobuf shape. Many
+ *                   SCIP producers can dump JSON directly; the schema is also
+ *                   easy to hand-author for testing and migration scripts.
+ *
+ * The JSON envelope is the SUBSET of SCIP that Seer actually consumes — we
+ * don't carry hover-doc payloads or signature_documentation because Seer
+ * doesn't surface them. Adding more fields later is purely additive: a
+ * consumer that doesn't recognize a field ignores it.
+ */
+export type ScipSymbolKind = 'function' | 'method' | 'constructor' | 'class' | 'interface' | 'struct' | 'enum' | 'type' | 'variable';
+export interface ScipSymbol {
+    /**
+     * Globally unique SCIP symbol id. Opaque string; the importer never parses
+     * it — it's just a primary key for cross-document references.
+     */
+    symbolId: string;
+    displayName: string;
+    /** Optional dotted qualified name (e.g. `auth.AuthService.login`). */
+    qualifiedName?: string;
+    kind: ScipSymbolKind;
+    /** Repo-relative file path. */
+    relativePath: string;
+    /** 0-indexed source range. */
+    range: {
+        startLine: number;
+        startCharacter: number;
+        endLine: number;
+        endCharacter: number;
+    };
+    signature?: string;
+}
+export interface ScipOccurrence {
+    /** SCIP symbol id being referenced. */
+    symbolId: string;
+    relativePath: string;
+    range: {
+        startLine: number;
+        startCharacter: number;
+        endLine: number;
+        endCharacter: number;
+    };
+    /**
+     * 'definition' for the canonical defining occurrence (one per symbol),
+     * 'reference' for every other use site.
+     */
+    role: 'definition' | 'reference';
+}
+export interface ScipDocument {
+    /**
+     * Repo-relative path the document covers. Symbol/occurrence rows can also
+     * carry their own relativePath, but the doc-level one is the default.
+     */
+    relativePath: string;
+    symbols: ScipSymbol[];
+    occurrences: ScipOccurrence[];
+}
+export interface ScipIndex {
+    /** Producer identifier — e.g. `scip-typescript 0.3.5`. */
+    tool?: string;
+    /** Absolute project root used by the producer (informational). */
+    projectRoot?: string;
+    /**
+     * Documents keyed by repo-relative path. The same shape SCIP uses, just
+     * flattened for ergonomic JSON authoring.
+     */
+    documents: ScipDocument[];
+}
+//# sourceMappingURL=format.d.ts.map

package/dist/scip/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../src/scip/format.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,MAAM,MAAM,cAAc,GACtB,UAAU,GAAG,QAAQ,GAAG,aAAa,GAAG,OAAO,GAC/C,WAAW,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,UAAU,CAAC;AAE1D,MAAM,WAAW,UAAU;IACzB;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,sEAAsE;IACtE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,IAAI,EAAE,cAAc,CAAC;IACrB,+BAA+B;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,8BAA8B;IAC9B,KAAK,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5F,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,cAAc;IAC7B,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,cAAc,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5F;;;OAGG;IACH,IAAI,EAAE,YAAY,GAAG,WAAW,CAAC;CAClC;AAED,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,WAAW,EAAE,cAAc,EAAE,CAAC;CAC/B;AAED,MAAM,WAAW,SAAS;IACxB,0DAA0D;IAC1D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kEAAkE;IAClE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,SAAS,EAAE,YAAY,EAAE,CAAC;CAC3B"}

package/dist/scip/format.js

@@ -0,0 +1,31 @@
+"use strict";
+/**
+ * Track-F SCIP import.
+ *
+ * Seer accepts SCIP-format precision indexes (https://github.com/sourcegraph/scip)
+ * as an ADDITIVE precision uplift over the tree-sitter baseline. A SCIP index
+ * carries precise definitions and references produced by a real type-aware
+ * indexer (rust-analyzer, scip-typescript, scip-java, etc.). Importing one
+ * lets Seer overlay precise edges where tree-sitter's syntactic heuristics
+ * were guessing.
+ *
+ * The import is source-labelled (`provenance = 'scip'`) so consumers can
+ * always see which signals came from SCIP vs which were tree-sitter's best
+ * effort. Tree-sitter rows are never deleted by a SCIP import; when a SCIP
+ * symbol overlaps an existing tree-sitter row at the same file/line/kind, the
+ * tree-sitter row is re-labeled `'scip-merge'` (precision confirmed) and
+ * SCIP edges target its existing id.
+ *
+ * Format support:
+ *   - .scip       : binary protobuf (the canonical SCIP format)
+ *   - .scip.json  : Seer's JSON envelope mirroring the protobuf shape. Many
+ *                   SCIP producers can dump JSON directly; the schema is also
+ *                   easy to hand-author for testing and migration scripts.
+ *
+ * The JSON envelope is the SUBSET of SCIP that Seer actually consumes — we
+ * don't carry hover-doc payloads or signature_documentation because Seer
+ * doesn't surface them. Adding more fields later is purely additive: a
+ * consumer that doesn't recognize a field ignores it.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=format.js.map

package/dist/scip/format.js.map

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

package/dist/scip/import.d.ts

@@ -0,0 +1,37 @@
+import { Store } from '../db/store.js';
+export interface ScipImportOptions {
+    /** Workspace root — used to resolve SCIP relativePaths to absolute paths. */
+    repoRoot: string;
+    /** Logger; defaults to no-op. */
+    log?: (msg: string) => void;
+    /**
+     * Skip ALL inserts for files that aren't already indexed by tree-sitter.
+     * Default true: SCIP precision is meant to enhance the existing index, not
+     * to introduce phantom symbols for files Seer can't see (e.g. a SCIP that
+     * covers `vendor/` we deliberately skipped). Set false to widen.
+     */
+    requireFileInIndex?: boolean;
+}
+export interface ScipImportResult {
+    path: string;
+    sha256: string;
+    tool: string | null;
+    documentsProcessed: number;
+    symbolsInserted: number;
+    symbolsMerged: number;
+    edgesInserted: number;
+    filesMissing: number;
+    elapsedMs: number;
+}
+/**
+ * Import a SCIP index into the Store, layering precise SCIP symbols and
+ * references over the existing tree-sitter graph. Tree-sitter rows are never
+ * deleted; SCIP symbols with the same file/line/kind/qualified-name as an
+ * existing row reuse its id (and the existing row is re-labeled 'scip-merge').
+ *
+ * The import is idempotent on the (path, sha256) pair: re-importing the exact
+ * same file is a no-op. Re-importing the same path with new content clears
+ * the SCIP-sourced rows for that path first.
+ */
+export declare function importScip(scipPath: string, store: Store, options: ScipImportOptions): Promise<ScipImportResult>;
+//# sourceMappingURL=import.d.ts.map

package/dist/scip/import.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"import.d.ts","sourceRoot":"","sources":["../../src/scip/import.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAIvC,MAAM,WAAW,iBAAiB;IAChC,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,CAAC;IACjB,iCAAiC;IACjC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IAC5B;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;;GASG;AACH,wBAAsB,UAAU,CAC9B,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,iBAAiB,GACzD,OAAO,CAAC,gBAAgB,CAAC,CAwJ3B"}