instar 1.3.491 → 1.3.492

package/dist/core/cartographerDetect.d.ts

@@ -0,0 +1,133 @@
+import type { StalenessStatus } from './CartographerTree.js';
+/**
+ * Every detect failure path sets `refused: true` + one of these reasons so it
+ * flows through the poller's `r.refused` branch and feeds the breaker — a
+ * refusal is NEVER mistaken for "genuinely nothing to do". `detect-timeout` and
+ * `detect-worker-start-failure` are set by the ENGINE (the worker can't report
+ * its own timeout/start failure); the rest are set here.
+ */
+export type DetectRefusalReason = 'detect-index-too-large' | 'detect-index-unreadable' | 'detect-git-error' | 'detect-timeout' | 'detect-worker-start-failure';
+export interface DetectInput {
+    /** Absolute path to the cartographer index.json. */
+    indexPath: string;
+    /** Repo root the git plumbing runs against. */
+    projectDir: string;
+    /** Refuse (detect-index-too-large) above this on-disk byte size BEFORE parsing. */
+    maxIndexBytes: number;
+    /** Hard cap on the ordered candidate list this pass returns (maxNodesPerPass × headroom). */
+    maxCandidates: number;
+    /** Per-pass author budget — used for the anti-starvation front-bias cap (maxNodesPerPass/2). */
+    maxNodesPerPass: number;
+    /** A deferred dir at/above this defer count is force-promoted (anti-starvation). */
+    maxDeferredPasses: number;
+    /** How many oldest-fresh nodes to nominate for re-validation this pass. */
+    revalidateSamplePerPass: number;
+    /** Grace window for the never-authored-past-grace freshness split. */
+    graceMs: number;
+    /** Explicit git ls-tree maxBuffer (≥64MB) so a big tree never throws ENOBUFS. */
+    gitMaxBuffer: number;
+    /** Cap on the published stale sample written to the snapshot (the /stale surface). */
+    snapshotSampleMax: number;
+    /** Wall clock for the grace computation (injected for deterministic tests). */
+    nowMs: number;
+}
+export interface DetectCounts {
+    nodeCount: number;
+    authoredCount: number;
+    neverAuthored: number;
+    stale: number;
+    pathGone: number;
+    generatedAt: string | null;
+    headSha: string | null;
+}
+/** The full freshness aggregate (so `/cartographer/health` never recomputes it on the request thread). */
+export interface DetectFreshness {
+    nodeCount: number;
+    authorableCount: number;
+    freshCount: number;
+    staleCount: number;
+    neverAuthoredCount: number;
+    neverAuthoredWithinGrace: number;
+    neverAuthoredPastGrace: number;
+    authorFailedCount: number;
+    freshRatio: number;
+    generatedAt: string | null;
+}
+export interface DetectResult {
+    refused: boolean;
+    refusalReason?: DetectRefusalReason;
+    /** Ordered, BOUNDED (≤ maxCandidates) author candidates (deepest/anti-starvation first). */
+    candidates: string[];
+    /** Count of dirs whose `staleSincePass` was incremented + persisted this pass. */
+    deferredApplied: number;
+    counts: DetectCounts;
+    freshness: DetectFreshness;
+    /** Oldest-authored fresh node paths to re-validate (≤ revalidateSamplePerPass). */
+    revalidationSample: string[];
+    /** Bounded, secret-filtered stale sample for the /cartographer/stale snapshot. */
+    staleSample: {
+        path: string;
+        status: StalenessStatus;
+    }[];
+    /** Total stale+never-authored candidates (the sample's `total` for truncation honesty). */
+    staleTotal: number;
+    /** Measured wall-clock of this detect (operators tune detectTimeoutMs from this). */
+    durationMs: number;
+    /** True when the index file did not exist (distinct from a refusal — boot scaffold builds it). */
+    indexMissing?: boolean;
+}
+/** The detect-health enum carried on the snapshot + both read routes. */
+export type LastDetectStatus = 'ok' | 'timeout' | 'worker-start-failed' | 'index-too-large' | 'index-unreadable' | 'git-error' | 'not-lease-holder';
+/**
+ * The small, per-host snapshot every /cartographer/* read route serves from —
+ * so no request path ever parses the 67MB index or walks the tree. Written
+ * atomically by the sweep engine after each detect; never committed (it is
+ * per-host state under .instar/cartographer/).
+ */
+export interface CartographerSnapshot {
+    generatedAt: string;
+    headSha: string | null;
+    counts: DetectCounts;
+    freshness: DetectFreshness;
+    staleSample: {
+        path: string;
+        status: StalenessStatus;
+    }[];
+    staleTotal: number;
+    staleSampleTruncated: boolean;
+    lastDetectStatus: LastDetectStatus;
+    lastDetectAt: string;
+    durationMs: number;
+}
+/** One authored-summary delta applied to the index in the single author-phase write. */
+export interface IndexDelta {
+    path: string;
+    /** Present when the node's summary/codeHash changed (an author or fingerprint refresh). */
+    summaryUpdatedAt?: string | null;
+    codeHash?: string | null;
+    /** Reset to 0 on a successful author. */
+    staleSincePass?: number;
+    /** Quarantine bookkeeping (failure path). */
+    authorFailed?: boolean;
+}
+export interface ApplyDeltasInput {
+    indexPath: string;
+    maxIndexBytes: number;
+    deltas: IndexDelta[];
+}
+/** Internal: instrumentation surfaced for tests (peak heap + node-file reads). */
+export interface DetectInstrumentation {
+    candidateHeapPeak: number;
+    starvedHeapPeak: number;
+    /** Always 0 — detect reads ZERO node files; the test asserts this. */
+    nodeFileReads: number;
+}
+export declare function runDetect(input: DetectInput, instr?: DetectInstrumentation): DetectResult;
+export declare function writeSnapshot(snapshotPath: string, snap: CartographerSnapshot): void;
+export declare function readSnapshot(snapshotPath: string): CartographerSnapshot | null;
+export declare function applyIndexDeltas(input: ApplyDeltasInput): {
+    written: number;
+    refused: boolean;
+    refusalReason?: DetectRefusalReason;
+};
+//# sourceMappingURL=cartographerDetect.d.ts.map

package/dist/core/cartographerDetect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartographerDetect.d.ts","sourceRoot":"","sources":["../../src/core/cartographerDetect.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EAGV,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAM/B;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAC3B,wBAAwB,GACxB,yBAAyB,GACzB,kBAAkB,GAClB,gBAAgB,GAChB,6BAA6B,CAAC;AAElC,MAAM,WAAW,WAAW;IAC1B,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;IAClB,+CAA+C;IAC/C,UAAU,EAAE,MAAM,CAAC;IACnB,mFAAmF;IACnF,aAAa,EAAE,MAAM,CAAC;IACtB,6FAA6F;IAC7F,aAAa,EAAE,MAAM,CAAC;IACtB,gGAAgG;IAChG,eAAe,EAAE,MAAM,CAAC;IACxB,oFAAoF;IACpF,iBAAiB,EAAE,MAAM,CAAC;IAC1B,2EAA2E;IAC3E,uBAAuB,EAAE,MAAM,CAAC;IAChC,sEAAsE;IACtE,OAAO,EAAE,MAAM,CAAC;IAChB,iFAAiF;IACjF,YAAY,EAAE,MAAM,CAAC;IACrB,sFAAsF;IACtF,iBAAiB,EAAE,MAAM,CAAC;IAC1B,+EAA+E;IAC/E,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB;AAED,0GAA0G;AAC1G,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,wBAAwB,EAAE,MAAM,CAAC;IACjC,sBAAsB,EAAE,MAAM,CAAC;IAC/B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,OAAO,CAAC;IACjB,aAAa,CAAC,EAAE,mBAAmB,CAAC;IACpC,4FAA4F;IAC5F,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,kFAAkF;IAClF,eAAe,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,YAAY,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,mFAAmF;IACnF,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,kFAAkF;IAClF,WAAW,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,eAAe,CAAA;KAAE,EAAE,CAAC;IACzD,2FAA2F;IAC3F,UAAU,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,UAAU,EAAE,MAAM,CAAC;IACnB,kGAAkG;IAClG,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,yEAAyE;AACzE,MAAM,MAAM,gBAAgB,GACxB,IAAI,GACJ,SAAS,GACT,qBAAqB,GACrB,iBAAiB,GACjB,kBAAkB,GAClB,WAAW,GACX,kBAAkB,CAAC;AAEvB;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,MAAM,EAAE,YAAY,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,WAAW,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,eAAe,CAAA;KAAE,EAAE,CAAC;IACzD,UAAU,EAAE,MAAM,CAAC;IACnB,oBAAoB,EAAE,OAAO,CAAC;IAC9B,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wFAAwF;AACxF,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,2FAA2F;IAC3F,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,yCAAyC;IACzC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,6CAA6C;IAC7C,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,UAAU,EAAE,CAAC;CACtB;AAkID,kFAAkF;AAClF,MAAM,WAAW,qBAAqB;IACpC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,sEAAsE;IACtE,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,EAAE,qBAAqB,GAAG,YAAY,CA4LzF;AAID,wBAAgB,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,GAAG,IAAI,CAEpF;AAED,wBAAgB,YAAY,CAAC,YAAY,EAAE,MAAM,GAAG,oBAAoB,GAAG,IAAI,CAW9E;AAID,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,gBAAgB,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,aAAa,CAAC,EAAE,mBAAmB,CAAA;CAAE,CA8BpI"}

package/dist/core/cartographerDetect.js

@@ -0,0 +1,431 @@
+/**
+ * cartographerDetect — the PURE, importable detect/index-write logic for the
+ * doc-freshness sweep, extracted so it can run OFF the server's main event loop
+ * in a worker thread (fix instar#1069) while staying unit-testable in-process.
+ *
+ * THE INVARIANT THIS MODULE EXISTS TO HOLD (spec CARTOGRAPHER-SWEEP-EVENTLOOP-SAFETY):
+ * the cartographer index on a real tree is hundreds of thousands of nodes / tens
+ * of megabytes. Parsing it and walking it is an O(nodeCount)/O(67MB) synchronous
+ * operation that MUST NOT run on the server's main thread — doing so starves the
+ * event loop, `/health` stops answering, and the supervisor kill-loops the server.
+ * So:
+ *   - This module is `import_type`-only against CartographerTree (no value import
+ *     of the storage class), so a `worker_threads` worker can load the compiled
+ *     `.js` without dragging the whole server in.
+ *   - `runDetect()` reads + parses the index, derives staleness from ONE batched
+ *     `git ls-tree` (explicit large maxBuffer — never the 10MB default that throws
+ *     on a big tree), orders a BOUNDED candidate set via bounded heaps (never a
+ *     full sort of a full materialized array), computes the freshness aggregate,
+ *     applies the pass's anti-starvation defer increments, and writes the index
+ *     ONCE. It reads ZERO per-node files (every field it needs — including the
+ *     accumulated `staleSincePass`, the `firstSeenAt` grace anchor, and the
+ *     `authorFailed` quarantine flag — is carried on the index entry).
+ *   - `applyIndexDeltas()` is the author-phase write: it re-reads the index,
+ *     applies the ≤maxNodesPerPass authored-summary deltas, and writes ONCE — so
+ *     authoring N nodes is ONE off-thread 67MB write, not N per-node main-thread
+ *     parse+serialize (closes the sixth starver).
+ *
+ * Both functions are shared VERBATIM by the worker wrapper AND the synchronous
+ * rollback path (`freshnessSweep.detectInWorker: false`): the byte-guard, the
+ * explicit git maxBuffer, the bounded heap ordering, and the refusal taxonomy are
+ * properties of THIS module, so the rollback runs the same bounded logic on the
+ * main thread (bounded — never the legacy `tree.staleNodes()` full walk).
+ */
+import fs from 'node:fs';
+import crypto from 'node:crypto';
+import { SafeGitExecutor } from './SafeGitExecutor.js';
+import { isSecretBearingPath } from './cartographerSummary.js';
+const GIT_OP = 'cartographer-detect';
+// ── pure helpers (no I/O) ──────────────────────────────────────────────────
+function deriveStatus(storedHash, currentOid) {
+    if (storedHash == null)
+        return 'never-authored';
+    if (currentOid == null)
+        return 'path-gone';
+    return currentOid === storedHash ? 'fresh' : 'stale';
+}
+function depthOf(p) {
+    if (p === '')
+        return 0;
+    return p.split('/').length;
+}
+function parentOf(p) {
+    if (p === '')
+        return '';
+    const i = p.lastIndexOf('/');
+    return i < 0 ? '' : p.slice(0, i);
+}
+function atomicWrite(filePath, contents) {
+    // Per-host-unique tmp suffix so a shared state dir across machines can't collide.
+    const tmp = `${filePath}.${process.pid}.${crypto.randomBytes(6).toString('hex')}.tmp`;
+    fs.writeFileSync(tmp, contents);
+    fs.renameSync(tmp, filePath);
+}
+// ── git plumbing (explicit large maxBuffer; failure → caller refuses) ────────
+/** Throws on git failure so the caller can map it to a `detect-git-error` refusal. */
+function readCurrentOids(projectDir, gitMaxBuffer) {
+    const map = new Map();
+    const rootTree = SafeGitExecutor.readSync(['rev-parse', 'HEAD^{tree}'], {
+        cwd: projectDir, operation: GIT_OP, maxBuffer: gitMaxBuffer,
+    });
+    if (rootTree)
+        map.set('', rootTree.trim());
+    const out = SafeGitExecutor.readSync(['ls-tree', '-r', '-t', '-z', 'HEAD'], {
+        cwd: projectDir, operation: GIT_OP, maxBuffer: gitMaxBuffer,
+    });
+    for (const entry of out.split('\0')) {
+        if (!entry)
+            continue;
+        const tab = entry.indexOf('\t');
+        if (tab < 0)
+            continue;
+        const meta = entry.slice(0, tab).split(' ');
+        const p = entry.slice(tab + 1);
+        const oid = meta[2];
+        if (oid && p)
+            map.set(p, oid);
+    }
+    return map;
+}
+function headShort(projectDir) {
+    try {
+        const out = SafeGitExecutor.readSync(['rev-parse', '--short', 'HEAD'], {
+            cwd: projectDir, operation: GIT_OP, maxBuffer: 1024 * 1024,
+        });
+        return out ? out.trim() : null;
+    }
+    catch {
+        // @silent-fallback-ok — headSha is provenance-only; absence is reported as null,
+        // never a refusal (the ls-tree read above is the one that gates the pass).
+        return null;
+    }
+}
+// ── bounded top-N min-heap (keeps the N highest-priority items, O(N) memory) ──
+/**
+ * A fixed-capacity min-heap keyed by a numeric priority where HIGHER priority =
+ * keep. Streaming every candidate through `offer()` keeps only the top `cap`
+ * without ever materializing or sorting the full candidate set — the structural
+ * guarantee that peak memory is O(cap), not O(nodeCount).
+ */
+class BoundedTopHeap {
+    cap;
+    heap = [];
+    peak = 0;
+    constructor(cap) {
+        this.cap = cap;
+    }
+    offer(key, tie, v) {
+        if (this.cap <= 0)
+            return;
+        if (this.heap.length < this.cap) {
+            this.heap.push({ key, tie, v });
+            this.siftUp(this.heap.length - 1);
+        }
+        else if (this.worseThanRoot(key, tie)) {
+            // new item outranks the current minimum → replace root
+            this.heap[0] = { key, tie, v };
+            this.siftDown(0);
+        }
+        if (this.heap.length > this.peak)
+            this.peak = this.heap.length;
+    }
+    /** Highest-priority first. */
+    drainSorted() {
+        return [...this.heap]
+            .sort((a, b) => b.key - a.key || a.tie.localeCompare(b.tie))
+            .map((e) => e.v);
+    }
+    peakSize() { return this.peak; }
+    worseThanRoot(key, tie) {
+        const r = this.heap[0];
+        return key > r.key || (key === r.key && tie.localeCompare(r.tie) < 0);
+    }
+    less(a, b) {
+        // min-heap: the WORST (lowest priority) item floats to the root so it's evicted first
+        return a.key < b.key || (a.key === b.key && a.tie.localeCompare(b.tie) > 0);
+    }
+    siftUp(i) {
+        while (i > 0) {
+            const p = (i - 1) >> 1;
+            if (this.less(this.heap[i], this.heap[p])) {
+                this.swap(i, p);
+                i = p;
+            }
+            else
+                break;
+        }
+    }
+    siftDown(i) {
+        const n = this.heap.length;
+        for (;;) {
+            const l = 2 * i + 1, r = 2 * i + 2;
+            let s = i;
+            if (l < n && this.less(this.heap[l], this.heap[s]))
+                s = l;
+            if (r < n && this.less(this.heap[r], this.heap[s]))
+                s = r;
+            if (s === i)
+                break;
+            this.swap(i, s);
+            i = s;
+        }
+    }
+    swap(i, j) { const t = this.heap[i]; this.heap[i] = this.heap[j]; this.heap[j] = t; }
+}
+export function runDetect(input, instr) {
+    const startedAt = Date.now();
+    const emptyCounts = {
+        nodeCount: 0, authoredCount: 0, neverAuthored: 0, stale: 0, pathGone: 0,
+        generatedAt: null, headSha: null,
+    };
+    const emptyFreshness = {
+        nodeCount: 0, authorableCount: 0, freshCount: 0, staleCount: 0,
+        neverAuthoredCount: 0, neverAuthoredWithinGrace: 0, neverAuthoredPastGrace: 0,
+        authorFailedCount: 0, freshRatio: 1, generatedAt: null,
+    };
+    const refuse = (reason) => ({
+        refused: true, refusalReason: reason, candidates: [], deferredApplied: 0,
+        counts: emptyCounts, freshness: emptyFreshness, revalidationSample: [],
+        staleSample: [], staleTotal: 0, durationMs: Date.now() - startedAt,
+    });
+    // Index missing → NOT a refusal (the boot scaffold builds it); honest empty result.
+    let stat;
+    try {
+        stat = fs.statSync(input.indexPath);
+    }
+    catch {
+        return {
+            refused: false, candidates: [], deferredApplied: 0, counts: emptyCounts,
+            freshness: emptyFreshness, revalidationSample: [], staleSample: [], staleTotal: 0,
+            durationMs: Date.now() - startedAt, indexMissing: true,
+        };
+    }
+    // Pre-parse byte guard — the REAL bound on the parse (terminate() cannot interrupt
+    // a synchronous JSON.parse already in flight). Refuse before attempting it.
+    if (stat.size > input.maxIndexBytes)
+        return refuse('detect-index-too-large');
+    let index;
+    try {
+        index = JSON.parse(fs.readFileSync(input.indexPath, 'utf8'));
+        if (!index || typeof index !== 'object' || !index.nodes)
+            return refuse('detect-index-unreadable');
+    }
+    catch {
+        return refuse('detect-index-unreadable');
+    }
+    let current;
+    try {
+        current = readCurrentOids(input.projectDir, input.gitMaxBuffer);
+    }
+    catch {
+        // A git read failure must be a NAMED refusal — never "every node path-gone"
+        // (that would silently mark the whole tree stale and author churn).
+        return refuse('detect-git-error');
+    }
+    const headSha = headShort(input.projectDir);
+    // ── Pass A: derive status for every node; accumulate counts + freshness;
+    //    collect the candidate set; feed the oldest-fresh revalidation heap. ──
+    const entries = Object.entries(index.nodes);
+    const candidateSet = new Set();
+    const staleSample = [];
+    let authoredCount = 0, neverAuthored = 0, stale = 0, pathGone = 0;
+    let authorable = 0, fresh = 0, never = 0, neverWithin = 0, neverPast = 0, authorFailed = 0;
+    const revalHeap = new BoundedTopHeap(Math.max(0, input.revalidateSamplePerPass));
+    const sampleCap = Math.max(0, input.snapshotSampleMax);
+    const addCandidate = (p, status) => {
+        candidateSet.add(p);
+        // Secret-bearing path NAMES are excluded from the published sample so they are
+        // never surfaced via the /stale route or the Files tab (they are still authored-
+        // excluded by the engine; only their NAME is withheld from the snapshot).
+        if (staleSample.length < sampleCap && !isSecretBearingPath(p)) {
+            staleSample.push({ path: p, status });
+        }
+    };
+    for (const [p, entry] of entries) {
+        const status = deriveStatus(entry.codeHash, current.get(p));
+        if (entry.codeHash != null)
+            authoredCount += 1;
+        else
+            neverAuthored += 1;
+        if (status === 'path-gone') {
+            pathGone += 1;
+            continue;
+        }
+        authorable += 1;
+        if (entry.authorFailed === true)
+            authorFailed += 1;
+        if (status === 'fresh') {
+            fresh += 1;
+            if (entry.summaryUpdatedAt != null) {
+                // Re-validation nominee priority: OLDEST summaryUpdatedAt first → higher
+                // priority = larger (nowMs - updatedAt), so older summaries win the heap.
+                const age = input.nowMs - Date.parse(entry.summaryUpdatedAt);
+                revalHeap.offer(Number.isFinite(age) ? age : 0, p, p);
+            }
+        }
+        else if (status === 'stale') {
+            stale += 1;
+            addCandidate(p, status);
+        }
+        else if (status === 'never-authored') {
+            never += 1;
+            const firstSeen = entry.firstSeenAt ? Date.parse(entry.firstSeenAt) : input.nowMs;
+            if (Number.isFinite(firstSeen) && input.nowMs - firstSeen > input.graceMs)
+                neverPast += 1;
+            else
+                neverWithin += 1;
+            addCandidate(p, status);
+        }
+    }
+    // ── childrenOf adjacency from PATH STRINGS in the parsed index (zero node-file
+    //    reads) — needed for the dir-defer rule (author a dir after its candidate
+    //    children). Derived from the index we already parsed, never the filesystem. ──
+    const childrenOf = new Map();
+    for (const [p] of entries) {
+        if (p === '')
+            continue;
+        const par = parentOf(p);
+        const arr = childrenOf.get(par);
+        if (arr)
+            arr.push(p);
+        else
+            childrenOf.set(par, [p]);
+    }
+    // ── Pass B: order candidates through bounded heaps (NEVER a full sort of the
+    //    full set — peak memory O(maxCandidates), not O(nodeCount)). Deepest-first
+    //    guarantees children are authored before their parent dir IN THE SAME pass.
+    //    A starved dir (deferred past maxDeferredPasses) gets a capped front-bias
+    //    lane. A dir that is evicted by the per-pass bound AND still has a candidate
+    //    child is "deferred": its anti-starvation counter is bumped so a subtree
+    //    perpetually pushed out by deeper churn is eventually promoted. ──
+    const frontCap = Math.max(1, Math.floor(input.maxNodesPerPass / 2));
+    const candidateHeap = new BoundedTopHeap(input.maxCandidates);
+    const starvedHeap = new BoundedTopHeap(frontCap);
+    for (const p of candidateSet) {
+        const entry = index.nodes[p];
+        const starved = entry.kind === 'dir' && (entry.staleSincePass ?? 0) >= input.maxDeferredPasses;
+        if (starved)
+            starvedHeap.offer(depthOf(p), p, p);
+        else
+            candidateHeap.offer(depthOf(p), p, p);
+    }
+    const starvedList = starvedHeap.drainSorted();
+    const normalList = candidateHeap.drainSorted();
+    const starvedSet = new Set(starvedList);
+    const candidates = [...starvedList, ...normalList.filter((p) => !starvedSet.has(p))].slice(0, input.maxCandidates);
+    // Anti-starvation: a dir candidate the bound pushed out, that still has a
+    // candidate child, gets its defer counter bumped (persisted in write (a)).
+    const selected = new Set(candidates);
+    let deferredApplied = 0;
+    for (const p of candidateSet) {
+        const entry = index.nodes[p];
+        if (entry.kind !== 'dir' || selected.has(p))
+            continue;
+        const kids = childrenOf.get(p);
+        if (kids && kids.some((c) => candidateSet.has(c))) {
+            entry.staleSincePass = (entry.staleSincePass ?? 0) + 1;
+            deferredApplied += 1;
+        }
+    }
+    if (instr) {
+        instr.candidateHeapPeak = candidateHeap.peakSize();
+        instr.starvedHeapPeak = starvedHeap.peakSize();
+        instr.nodeFileReads = 0; // detect NEVER reads node files
+    }
+    // ── Detect-phase index write (a): persist the defer increments ONCE, off the
+    //    main thread. The deferred set never crosses the worker boundary. ──
+    if (deferredApplied > 0) {
+        atomicWrite(input.indexPath, JSON.stringify(index, null, 2));
+    }
+    const ratioDenom = fresh + stale + neverPast;
+    return {
+        refused: false,
+        candidates,
+        deferredApplied,
+        counts: {
+            nodeCount: entries.length,
+            authoredCount,
+            neverAuthored,
+            stale,
+            pathGone,
+            generatedAt: index.generatedAt ?? null,
+            headSha,
+        },
+        freshness: {
+            nodeCount: entries.length,
+            authorableCount: authorable,
+            freshCount: fresh,
+            staleCount: stale,
+            neverAuthoredCount: never,
+            neverAuthoredWithinGrace: neverWithin,
+            neverAuthoredPastGrace: neverPast,
+            authorFailedCount: authorFailed,
+            freshRatio: ratioDenom === 0 ? 1 : fresh / ratioDenom,
+            generatedAt: index.generatedAt ?? null,
+        },
+        revalidationSample: revalHeap.drainSorted(),
+        staleSample,
+        staleTotal: candidateSet.size,
+        durationMs: Date.now() - startedAt,
+    };
+}
+// ── snapshot read/write (the per-host file every read route serves from) ──────
+export function writeSnapshot(snapshotPath, snap) {
+    atomicWrite(snapshotPath, JSON.stringify(snap, null, 2));
+}
+export function readSnapshot(snapshotPath) {
+    try {
+        const raw = fs.readFileSync(snapshotPath, 'utf8');
+        const snap = JSON.parse(raw);
+        if (!snap || typeof snap !== 'object' || !snap.counts)
+            return null;
+        return snap;
+    }
+    catch {
+        // @silent-fallback-ok — a missing/corrupt snapshot reads as "absent"; the
+        // routes serve snapshot:'absent' and the next detect rewrites it.
+        return null;
+    }
+}
+// ── applyIndexDeltas (author-phase write — ONE off-thread 67MB write) ─────────
+export function applyIndexDeltas(input) {
+    if (input.deltas.length === 0)
+        return { written: 0, refused: false };
+    let stat;
+    try {
+        stat = fs.statSync(input.indexPath);
+    }
+    catch {
+        return { written: 0, refused: true, refusalReason: 'detect-index-unreadable' };
+    }
+    if (stat.size > input.maxIndexBytes)
+        return { written: 0, refused: true, refusalReason: 'detect-index-too-large' };
+    let index;
+    try {
+        index = JSON.parse(fs.readFileSync(input.indexPath, 'utf8'));
+        if (!index || !index.nodes)
+            return { written: 0, refused: true, refusalReason: 'detect-index-unreadable' };
+    }
+    catch {
+        return { written: 0, refused: true, refusalReason: 'detect-index-unreadable' };
+    }
+    let written = 0;
+    for (const d of input.deltas) {
+        const entry = index.nodes[d.path];
+        if (!entry)
+            continue;
+        if (Object.prototype.hasOwnProperty.call(d, 'summaryUpdatedAt'))
+            entry.summaryUpdatedAt = d.summaryUpdatedAt ?? null;
+        if (Object.prototype.hasOwnProperty.call(d, 'codeHash'))
+            entry.codeHash = d.codeHash ?? null;
+        if (Object.prototype.hasOwnProperty.call(d, 'staleSincePass'))
+            entry.staleSincePass = d.staleSincePass;
+        if (Object.prototype.hasOwnProperty.call(d, 'authorFailed'))
+            entry.authorFailed = d.authorFailed;
+        written += 1;
+    }
+    if (written > 0)
+        atomicWrite(input.indexPath, JSON.stringify(index, null, 2));
+    return { written, refused: false };
+}
+//# sourceMappingURL=cartographerDetect.js.map

package/dist/core/cartographerDetect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartographerDetect.js","sourceRoot":"","sources":["../../src/core/cartographerDetect.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,MAAM,MAAM,aAAa,CAAC;AAMjC,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,MAAM,MAAM,GAAG,qBAAqB,CAAC;AAqIrC,8EAA8E;AAE9E,SAAS,YAAY,CAAC,UAAyB,EAAE,UAA8B;IAC7E,IAAI,UAAU,IAAI,IAAI;QAAE,OAAO,gBAAgB,CAAC;IAChD,IAAI,UAAU,IAAI,IAAI;QAAE,OAAO,WAAW,CAAC;IAC3C,OAAO,UAAU,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;AACvD,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;AAC7B,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,WAAW,CAAC,QAAgB,EAAE,QAAgB;IACrD,kFAAkF;IAClF,MAAM,GAAG,GAAG,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;IACtF,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAChC,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;AAC/B,CAAC;AAED,gFAAgF;AAEhF,sFAAsF;AACtF,SAAS,eAAe,CAAC,UAAkB,EAAE,YAAoB;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,EAAE;QACtE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY;KAC5D,CAAC,CAAC;IACH,IAAI,QAAQ;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE;QAC1E,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY;KAC5D,CAAC,CAAC;IACH,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC;YAAE,SAAS;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,UAAkB;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE;YACrE,GAAG,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,GAAG,IAAI;SAC3D,CAAC,CAAC;QACH,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,iFAAiF;QACjF,2EAA2E;QAC3E,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,iFAAiF;AAEjF;;;;;GAKG;AACH,MAAM,cAAc;IAGW;IAFZ,IAAI,GAAyC,EAAE,CAAC;IACzD,IAAI,GAAG,CAAC,CAAC;IACjB,YAA6B,GAAW;QAAX,QAAG,GAAH,GAAG,CAAQ;IAAG,CAAC;IAE5C,KAAK,CAAC,GAAW,EAAE,GAAW,EAAE,CAAI;QAClC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;YAAE,OAAO;QAC1B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACxC,uDAAuD;YACvD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACjE,CAAC;IAED,8BAA8B;IAC9B,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;aAClB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAC3D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,QAAQ,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEhC,aAAa,CAAC,GAAW,EAAE,GAAW;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACxE,CAAC;IACO,IAAI,CAAC,CAA+B,EAAE,CAA+B;QAC3E,sFAAsF;QACtF,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAC,CAAC,GAAG,CAAC,CAAC;YAAC,CAAC;;gBAAM,MAAM;QACpF,CAAC;IACH,CAAC;IACO,QAAQ,CAAC,CAAS;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,SAAS,CAAC;YACR,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,CAAC,KAAK,CAAC;gBAAE,MAAM;YACnB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACO,IAAI,CAAC,CAAS,EAAE,CAAS,IAAU,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CACpH;AAYD,MAAM,UAAU,SAAS,CAAC,KAAkB,EAAE,KAA6B;IACzE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAiB;QAChC,SAAS,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;QACvE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI;KACjC,CAAC;IACF,MAAM,cAAc,GAAoB;QACtC,SAAS,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;QAC9D,kBAAkB,EAAE,CAAC,EAAE,wBAAwB,EAAE,CAAC,EAAE,sBAAsB,EAAE,CAAC;QAC7E,iBAAiB,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI;KACvD,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,MAA2B,EAAgB,EAAE,CAAC,CAAC;QAC7D,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC;QACxE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,EAAE,kBAAkB,EAAE,EAAE;QACtE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnE,CAAC,CAAC;IAEH,oFAAoF;IACpF,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW;YACvE,SAAS,EAAE,cAAc,EAAE,kBAAkB,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;YACjF,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,IAAI;SACvD,CAAC;IACJ,CAAC;IACD,mFAAmF;IACnF,4EAA4E;IAC5E,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,aAAa;QAAE,OAAO,MAAM,CAAC,wBAAwB,CAAC,CAAC;IAE7E,IAAI,KAAwB,CAAC;IAC7B,IAAI,CAAC;QACH,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAsB,CAAC;QAClF,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,KAAK;YAAE,OAAO,MAAM,CAAC,yBAAyB,CAAC,CAAC;IACpG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,yBAAyB,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,OAA4B,CAAC;IACjC,IAAI,CAAC;QACH,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;IAClE,CAAC;IAAC,MAAM,CAAC;QACP,4EAA4E;QAC5E,oEAAoE;QACpE,OAAO,MAAM,CAAC,kBAAkB,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAE5C,0EAA0E;IAC1E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,MAAM,WAAW,GAAgD,EAAE,CAAC;IACpE,IAAI,aAAa,GAAG,CAAC,EAAE,aAAa,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;IAClE,IAAI,UAAU,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;IAC3F,MAAM,SAAS,GAAG,IAAI,cAAc,CAAS,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC,CAAC;IACzF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAEvD,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,MAAuB,EAAQ,EAAE;QAChE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,+EAA+E;QAC/E,iFAAiF;QACjF,0EAA0E;QAC1E,IAAI,WAAW,CAAC,MAAM,GAAG,SAAS,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9D,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,QAAQ,IAAI,IAAI;YAAE,aAAa,IAAI,CAAC,CAAC;;YAAM,aAAa,IAAI,CAAC,CAAC;QAExE,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAAC,QAAQ,IAAI,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACxD,UAAU,IAAI,CAAC,CAAC;QAChB,IAAI,KAAK,CAAC,YAAY,KAAK,IAAI;YAAE,YAAY,IAAI,CAAC,CAAC;QACnD,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,CAAC;YACX,IAAI,KAAK,CAAC,gBAAgB,IAAI,IAAI,EAAE,CAAC;gBACnC,yEAAyE;gBACzE,0EAA0E;gBAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBAC7D,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,CAAC;YACX,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;aAAM,IAAI,MAAM,KAAK,gBAAgB,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,CAAC;YACX,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YAClF,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,OAAO;gBAAE,SAAS,IAAI,CAAC,CAAC;;gBACrF,WAAW,IAAI,CAAC,CAAC;YACtB,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,8EAA8E;IAC9E,mFAAmF;IACnF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,EAAE;YAAE,SAAS;QACvB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAAM,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,8EAA8E;IAC9E,+EAA+E;IAC/E,gFAAgF;IAChF,8EAA8E;IAC9E,iFAAiF;IACjF,6EAA6E;IAC7E,uEAAuE;IACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,aAAa,GAAG,IAAI,cAAc,CAAS,KAAK,CAAC,aAAa,CAAC,CAAC;IACtE,MAAM,WAAW,GAAG,IAAI,cAAc,CAAS,QAAQ,CAAC,CAAC;IAEzD,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,iBAAiB,CAAC;QAC/F,IAAI,OAAO;YAAE,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;;YAC5C,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC;IAC9C,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAEnH,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QACtD,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClD,KAAK,CAAC,cAAc,GAAG,CAAC,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvD,eAAe,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,CAAC,iBAAiB,GAAG,aAAa,CAAC,QAAQ,EAAE,CAAC;QACnD,KAAK,CAAC,eAAe,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC;QAC/C,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,gCAAgC;IAC3D,CAAC;IAED,8EAA8E;IAC9E,yEAAyE;IACzE,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;QACxB,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,GAAG,KAAK,GAAG,SAAS,CAAC;IAC7C,OAAO;QACL,OAAO,EAAE,KAAK;QACd,UAAU;QACV,eAAe;QACf,MAAM,EAAE;YACN,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,aAAa;YACb,aAAa;YACb,KAAK;YACL,QAAQ;YACR,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,IAAI;YACtC,OAAO;SACR;QACD,SAAS,EAAE;YACT,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,eAAe,EAAE,UAAU;YAC3B,UAAU,EAAE,KAAK;YACjB,UAAU,EAAE,KAAK;YACjB,kBAAkB,EAAE,KAAK;YACzB,wBAAwB,EAAE,WAAW;YACrC,sBAAsB,EAAE,SAAS;YACjC,iBAAiB,EAAE,YAAY;YAC/B,UAAU,EAAE,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,UAAU;YACrD,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,IAAI;SACvC;QACD,kBAAkB,EAAE,SAAS,CAAC,WAAW,EAAE;QAC3C,WAAW;QACX,UAAU,EAAE,YAAY,CAAC,IAAI;QAC7B,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACnC,CAAC;AACJ,CAAC;AAED,iFAAiF;AAEjF,MAAM,UAAU,aAAa,CAAC,YAAoB,EAAE,IAA0B;IAC5E,WAAW,CAAC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,YAAoB;IAC/C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAyB,CAAC;QACrD,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACnE,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,0EAA0E;QAC1E,kEAAkE;QAClE,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,iFAAiF;AAEjF,MAAM,UAAU,gBAAgB,CAAC,KAAuB;IACtD,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACrE,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,yBAAyB,EAAE,CAAC;IACjF,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,aAAa;QAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,wBAAwB,EAAE,CAAC;IAEnH,IAAI,KAAwB,CAAC;IAC7B,IAAI,CAAC;QACH,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAsB,CAAC;QAClF,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK;YAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,yBAAyB,EAAE,CAAC;IAC7G,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,yBAAyB,EAAE,CAAC;IACjF,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAuC,CAAC;QACxE,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,kBAAkB,CAAC;YAAE,KAAK,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,IAAI,IAAI,CAAC;QACrH,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC;YAAE,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC;QAC7F,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,gBAAgB,CAAC;YAAE,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC;QACvG,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,cAAc,CAAC;YAAE,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACjG,OAAO,IAAI,CAAC,CAAC;IACf,CAAC;IACD,IAAI,OAAO,GAAG,CAAC;QAAE,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACrC,CAAC"}

package/dist/core/cartographerDetect.worker.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=cartographerDetect.worker.d.ts.map

package/dist/core/cartographerDetect.worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartographerDetect.worker.d.ts","sourceRoot":"","sources":["../../src/core/cartographerDetect.worker.ts"],"names":[],"mappings":""}

package/dist/core/cartographerDetect.worker.js

@@ -0,0 +1,37 @@
+/**
+ * cartographerDetect.worker — the TRIVIAL `worker_threads` entrypoint for the
+ * off-event-loop cartographer detect / index-write (fix instar#1069).
+ *
+ * It contains NO logic that can drift: it reads `workerData`, dispatches to the
+ * pure module (`runDetect` / `applyIndexDeltas` in cartographerDetect.ts), posts
+ * the bounded result back, and exits. The 67MB parse + O(nodeCount) walk happen
+ * HERE, on a worker thread — never on the server's main event loop.
+ *
+ * The engine spawns this with an explicit minimal `env` allowlist (NOT the parent
+ * process.env), so the Telegram token / Anthropic keys / Bearer authToken / PIN
+ * material are absent — the detect worker reads paths + git oids only, never blob
+ * content, so it needs none of them.
+ */
+import { parentPort, workerData } from 'node:worker_threads';
+import { runDetect, applyIndexDeltas } from './cartographerDetect.js';
+function main() {
+    const job = workerData;
+    if (!parentPort)
+        return; // not run as a worker — nothing to post to
+    try {
+        if (job.mode === 'detect') {
+            parentPort.postMessage({ ok: true, result: runDetect(job.input) });
+        }
+        else if (job.mode === 'apply-deltas') {
+            parentPort.postMessage({ ok: true, result: applyIndexDeltas(job.input) });
+        }
+        else {
+            parentPort.postMessage({ ok: false, error: `unknown worker mode` });
+        }
+    }
+    catch (err) {
+        parentPort.postMessage({ ok: false, error: err instanceof Error ? err.message : String(err) });
+    }
+}
+main();
+//# sourceMappingURL=cartographerDetect.worker.js.map

package/dist/core/cartographerDetect.worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartographerDetect.worker.js","sourceRoot":"","sources":["../../src/core/cartographerDetect.worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAA2C,MAAM,yBAAyB,CAAC;AAM/G,SAAS,IAAI;IACX,MAAM,GAAG,GAAG,UAAuB,CAAC;IACpC,IAAI,CAAC,UAAU;QAAE,OAAO,CAAC,2CAA2C;IACpE,IAAI,CAAC;QACH,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC1B,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;aAAM,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YACvC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,qBAAqB,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjG,CAAC;AACH,CAAC;AAED,IAAI,EAAE,CAAC"}