pi-lens 4.3.0 → 4.4.1

package/dist/clients/dispatch/fact-provider-types.js

@@ -1 +0,0 @@
-export {};

package/dist/clients/dispatch/fact-rule-runner.js

@@ -1,17 +0,0 @@
-const rules = [];
-export function registerRule(r) {
-    rules.push(r);
-}
-export function clearRules() {
-    rules.length = 0;
-}
-export function evaluateRules(ctx) {
-    const diagnostics = [];
-    for (const rule of rules) {
-        if (!rule.appliesTo(ctx))
-            continue;
-        const results = rule.evaluate(ctx, ctx.facts);
-        diagnostics.push(...results);
-    }
-    return diagnostics;
-}

package/dist/clients/dispatch/fact-runner.js

@@ -1,30 +0,0 @@
-import { scheduleProviders } from "./fact-scheduler.js";
-const providers = [];
-export function registerProvider(p) {
-    providers.push(p);
-}
-export function clearProviders() {
-    providers.length = 0;
-}
-/**
- * Run the registered fact providers for `ctx`, in dependency order.
- *
- * Providers + fact rules are registered eagerly at `integration.ts` import (the
- * dispatch entry) — including the tree-sitter-backed providers. That's safe for
- * pi-lens's eager graph because the parsing stack loads `web-tree-sitter` (an
- * optional dep) via a dynamic `import()` inside `client.init()`, not at module
- * import, so an unavailable grammar/runtime degrades there rather than crashing
- * the extension at load. As of #402 nothing here uses the `typescript` compiler,
- * so the old lazy-import-with-degrade indirection (#285/#335) is gone.
- */
-export async function runProviders(ctx) {
-    const applicable = providers.filter((p) => p.appliesTo(ctx));
-    const ordered = scheduleProviders(applicable);
-    for (const provider of ordered) {
-        // Skip if all provided facts are already present
-        const allPresent = provider.provides.every((key) => ctx.facts.hasFileFact(ctx.filePath, key));
-        if (allPresent)
-            continue;
-        await provider.run(ctx, ctx.facts);
-    }
-}

package/dist/clients/dispatch/fact-scheduler.js

@@ -1,68 +0,0 @@
-/**
- * Orders providers topologically so each provider's `requires` are satisfied
- * before it runs. Tie-breaks alphabetically by `id`. Detects cycles.
- *
- * Only deps that have a provider in the input list count toward in-degree;
- * external facts (provided outside this list) are treated as always available.
- */
-export function scheduleProviders(providers) {
-    if (providers.length <= 1)
-        return providers.slice();
-    // Map: factKey → provider that provides it
-    const factToProvider = new Map();
-    for (const p of providers) {
-        for (const key of p.provides) {
-            factToProvider.set(key, p);
-        }
-    }
-    // For each provider, track in-degree and which providers depend on it
-    const inDegree = new Map();
-    // dependents[id] = set of provider ids that require a fact provided by this provider
-    const dependents = new Map();
-    for (const p of providers) {
-        if (!inDegree.has(p.id))
-            inDegree.set(p.id, 0);
-        if (!dependents.has(p.id))
-            dependents.set(p.id, new Set());
-    }
-    for (const p of providers) {
-        const seenDeps = new Set();
-        for (const req of p.requires) {
-            const dep = factToProvider.get(req);
-            if (dep && dep.id !== p.id && !seenDeps.has(dep.id)) {
-                seenDeps.add(dep.id);
-                inDegree.set(p.id, (inDegree.get(p.id) ?? 0) + 1);
-                dependents.get(dep.id).add(p.id);
-            }
-        }
-    }
-    const idToProvider = new Map(providers.map((p) => [p.id, p]));
-    // Start with providers that have no unsatisfied deps, sorted by id
-    let wave = providers
-        .filter((p) => (inDegree.get(p.id) ?? 0) === 0)
-        .sort((a, b) => a.id.localeCompare(b.id));
-    const result = [];
-    while (wave.length > 0) {
-        const nextWave = [];
-        for (const p of wave) {
-            result.push(p);
-            for (const depId of dependents.get(p.id) ?? []) {
-                const newDegree = (inDegree.get(depId) ?? 0) - 1;
-                inDegree.set(depId, newDegree);
-                if (newDegree === 0) {
-                    nextWave.push(idToProvider.get(depId));
-                }
-            }
-        }
-        nextWave.sort((a, b) => a.id.localeCompare(b.id));
-        wave = nextWave;
-    }
-    if (result.length < providers.length) {
-        const cycleParticipants = providers
-            .filter((p) => !result.includes(p))
-            .map((p) => p.id)
-            .sort((a, b) => a.localeCompare(b));
-        throw new Error(`Cycle detected among FactProviders: ${cycleParticipants.join(", ")}`);
-    }
-    return result;
-}

package/dist/clients/dispatch/fact-store.js

@@ -1,377 +0,0 @@
-import { BoundedLruCache } from "../bounded-cache.js";
-import { normalizeMapKey } from "../path-utils.js";
-let capacityEvictionReporter;
-export function setFactStoreEvictionReporter(reporter) {
-    capacityEvictionReporter = reporter;
-}
-export function getFactStoreEvictionReporter() {
-    return capacityEvictionReporter;
-}
-// #2240: the dispatch store is module-scope in integration.ts, so it lives for
-// the whole process, and a review-graph project walk seeds facts for EVERY file
-// it visits. Nothing removed an entry except the next dispatch of that same
-// path, so a several-hundred-file batch retained one entry per distinct path
-// until the heap ran out. Bound the record count the way widget-state.ts bounds
-// its file records.
-const MAX_FILE_FACT_RECORDS = 1024;
-// Keep enough content for 1024 typical source files averaging 64 KiB, while
-// preventing a small number of generated or vendored files from retaining
-// hundreds of MiB for the process lifetime (#2247).
-const MAX_FILE_FACT_CONTENT_BYTES = 64 * 1024 * 1024;
-// Pinned records are exempt from capacity eviction. A dispatch reads its
-// file's facts back after the runner groups settle (`file.content` misses read as
-// empty content, not as "re-derive"), and the fire-and-forget blast-radius
-// build runs a whole-project walk against the SAME store meanwhile — plain LRU
-// recency would let that walk evict the file being dispatched. Every other holder
-// re-derives an evicted fact from disk.
-//
-// #2243 item 2: a dispatch pins its file at start (`clearFileFactsFor`) and
-// releases it at completion (`endDispatchFor`, in the dispatch's finally). The
-// pin set therefore tracks dispatches actually IN FLIGHT, not the last N files
-// touched.
-// #2282: `sessionFacts` below is a flat `Map<factId, value>` shared by two
-// unrelated fact shapes — a small FIXED vocabulary (tool availability keyed by
-// command, the singleton "session.reviewGraph") and PER-FILE families that
-// mint one key per file touched (session baseline, cascade baseline, review-
-// graph entity snapshots) and never shrink. Only the second shape grows with
-// batch size, so only it gets a bound; the fixed vocabulary stays on the plain
-// map, unbounded, because its cardinality is small and stable. Per-file
-// session facts opt into `boundedSessionFacts` instead, reusing fileFacts'
-// LRU-count-cap-and-report discipline rather than adding a third mechanism.
-// No pin exemption here (unlike fileFacts): every current per-file session
-// fact is read once near dispatch start and written once at dispatch end, so
-// nothing re-reads its OWN key later in the same dispatch the way a runner
-// re-reads `file.content` — an eviction mid-batch only means the next dispatch
-// of that path sees no previous baseline, the same safe state as its first
-// ever dispatch this session.
-//
-// That equivalence holds only where an absent baseline means "report
-// everything", which is true for the diagnostic baselines and false for the
-// review-graph entity snapshot: there, an absent snapshot read as an empty one
-// puts every symbol in `added` and drives a blast-radius run for a file that
-// did not change. So an eviction leaves a tombstone, and a reader that needs
-// the distinction asks `wasBoundedSessionFactEvicted`. Tombstones are keys
-// only, and carry the same cap, so the coldest of them fall off in turn and
-// that key reverts to first-dispatch semantics.
-//
-// Four per-file keys are minted per dispatched file today (diagnostic
-// baseline, cascade baseline, entity snapshot, changed symbols), so 4096
-// records covers roughly 1024 distinct files before the coldest file's
-// baseline starts degrading.
-const MAX_SESSION_FACT_RECORDS = 4096;
-export class FactStore {
-    subject;
-    // Insertion order is eviction order: the oldest-used record is evicted first.
-    fileFacts = new Map();
-    sessionFacts = new Map();
-    // Bounded sibling of `sessionFacts` for per-file-keyed session facts (#2282).
-    // True LRU: every fetch (get or create, see getBoundedSessionFact) refreshes
-    // recency, so the oldest-UNUSED record is evicted first, not merely the
-    // oldest-inserted.
-    boundedSessionFacts = new BoundedLruCache(MAX_SESSION_FACT_RECORDS);
-    // Keys evicted from `boundedSessionFacts` and not written since, so a reader
-    // can tell "evicted" from "never seen" (#2282). Same cap, same FIFO order.
-    evictedSessionFactKeys = new Set();
-    // Pin refcount per file. A file is exempt from capacity eviction while its
-    // count is > 0. Refcounted, not a Set, so two overlapping dispatches of the
-    // same file both hold the pin until BOTH settle (#2243 item 2).
-    pinnedFiles = new Map();
-    // Running UTF-8 byte total for file.content only. Maintaining it at every
-    // mutation keeps getFileFact/setFileFact O(1) amortized; never scan the map
-    // to decide whether the byte budget is exceeded.
-    retainedContentBytes = 0;
-    // Subset of retainedContentBytes held by currently pinned files (#2247
-    // review F2). Maintained incrementally the same way — a scan over
-    // `pinnedFiles` looks small in isolation, but `evictColdFileFacts` calls it
-    // on EVERY unpinned insert for as long as pinned bytes stay over budget, so
-    // a scan there would re-walk a large pinned file's full string on every
-    // single write admitted during that window. Keeping a running total avoids
-    // reintroducing exactly the scan `retainedContentBytes` exists to avoid.
-    pinnedContentBytesTotal = 0;
-    /**
-     * @param subject Discriminates this store's capacity-eviction telemetry
-     *   from every other production FactStore's (#2243 review round 3, F1).
-     *   Production callers pass a label naming the store (e.g. `"dispatch"`,
-     *   `"runtime-session-call-graph"`); the default is only for call sites
-     *   that never wired a reporter and tests that don't care.
-     */
-    constructor(subject = "session-fact-store") {
-        this.subject = subject;
-    }
-    // All file-keyed methods normalize the path internally via normalizeMapKey().
-    // Callers always pass raw/resolved paths — normalization is not their concern.
-    getFileFact(filePath, factId) {
-        return this.touchFileFacts(normalizeMapKey(filePath))?.get(factId);
-    }
-    setFileFact(filePath, factId, value) {
-        const key = normalizeMapKey(filePath);
-        let facts = this.touchFileFacts(key);
-        if (!facts) {
-            facts = new Map();
-            this.fileFacts.set(key, facts);
-        }
-        if (factId === "file.content") {
-            const delta = this.contentBytes(value) - this.contentBytes(facts.get(factId));
-            this.retainedContentBytes += delta;
-            if (this.pinnedFiles.has(key))
-                this.pinnedContentBytesTotal += delta;
-        }
-        facts.set(factId, value);
-        this.evictColdFileFacts();
-    }
-    hasFileFact(filePath, factId) {
-        return this.fileFacts.get(normalizeMapKey(filePath))?.has(factId) ?? false;
-    }
-    /** Drop one file fact without disturbing the file's derived facts.
-     *  Removes the per-file entry too when the deleted fact was its last value. */
-    deleteFileFact(filePath, factId) {
-        const key = normalizeMapKey(filePath);
-        const facts = this.fileFacts.get(key);
-        if (!facts)
-            return;
-        if (factId === "file.content") {
-            const dropped = this.contentBytes(facts.get(factId));
-            this.retainedContentBytes -= dropped;
-            if (this.pinnedFiles.has(key))
-                this.pinnedContentBytesTotal -= dropped;
-        }
-        facts.delete(factId);
-        if (facts.size === 0)
-            this.fileFacts.delete(key);
-    }
-    /** Clear facts for one specific file only, and mark the file's dispatch as
-     *  begun. Use at the start of each per-file dispatch call.
-     *  Preserves facts for other files computed in the same turn.
-     *  Normalizes filePath internally — callers pass raw paths.
-     *  Pins the file against capacity eviction until the matching
-     *  {@link endDispatchFor} runs in the dispatch's settle path (#2243 item 2).
-     *  Every `clearFileFactsFor` MUST be paired with an `endDispatchFor`. */
-    clearFileFactsFor(filePath) {
-        const key = normalizeMapKey(filePath);
-        this.deleteFileFactsRecord(key);
-        this.pinFile(key);
-    }
-    /** Pin a file against capacity eviction for the duration of a dispatch,
-     *  WITHOUT clearing its existing facts. Pairs with {@link endDispatchFor}
-     *  exactly like {@link clearFileFactsFor} does.
-     *
-     *  #2243 review round 3 (F5): `clearFileFactsFor`'s clear+re-derive is
-     *  right for a dispatch driven by a fresh edit, but the debounced
-     *  ast-grep warning scan runs ~2s AFTER the inline dispatch for that same
-     *  edit already re-derived every fact for this exact file — a second
-     *  clear there bought nothing but ~51ms of redundant re-parsing across
-     *  all five providers (measured; a warm-cache read is ~1ms). Use this
-     *  where the facts are very likely already fresh: `runProviders` still
-     *  re-derives any fact this file is missing (a genuine miss, e.g. the
-     *  fact was evicted meanwhile), so a read never depends on staleness. */
-    beginDispatchFor(filePath) {
-        this.pinFile(normalizeMapKey(filePath));
-    }
-    /** Release the pin a {@link clearFileFactsFor} or {@link beginDispatchFor}
-     *  took for one file's dispatch. Call once per matching call, from the
-     *  dispatch's finally/settle path, so the pin set tracks dispatches
-     *  actually in flight rather than the last N files touched (#2243 item 2). */
-    endDispatchFor(filePath) {
-        this.unpinFile(normalizeMapKey(filePath));
-        this.evictColdFileFacts();
-    }
-    /** Clear one file's facts WITHOUT pinning. For sequential single-store scans
-     *  (project-diagnostics) that own their store and race no concurrent walk:
-     *  pinning there would exempt every scanned file from the capacity cap and
-     *  defeat it. Normalizes filePath internally. */
-    dropFileFacts(filePath) {
-        this.deleteFileFactsRecord(normalizeMapKey(filePath));
-    }
-    /** LRU touch: re-inserting an existing record moves it to the end of the
-     *  eviction order, so a record still in use is not the next victim. */
-    touchFileFacts(key) {
-        const facts = this.fileFacts.get(key);
-        if (!facts)
-            return undefined;
-        this.fileFacts.delete(key);
-        this.fileFacts.set(key, facts);
-        return facts;
-    }
-    pinFile(key) {
-        const count = this.pinnedFiles.get(key) ?? 0;
-        // Transition from unpinned to pinned: this file's content joins the
-        // pinned subset. A refcount bump past 1 (an already-pinned file, two
-        // overlapping dispatches) does not — it is already counted.
-        if (count === 0) {
-            this.pinnedContentBytesTotal += this.contentBytes(this.fileFacts.get(key)?.get("file.content"));
-        }
-        this.pinnedFiles.set(key, count + 1);
-    }
-    unpinFile(key) {
-        const count = this.pinnedFiles.get(key);
-        if (count === undefined)
-            return;
-        if (count <= 1) {
-            this.pinnedFiles.delete(key);
-            // Transition from pinned to unpinned: this file's content leaves the
-            // pinned subset.
-            this.pinnedContentBytesTotal -= this.contentBytes(this.fileFacts.get(key)?.get("file.content"));
-        }
-        else {
-            this.pinnedFiles.set(key, count - 1);
-        }
-    }
-    /** Drop least-recently-used records past either cap, skipping the files whose
-     *  dispatch pinned them. Pinned content counts toward the byte total, but is
-     *  never evicted before endDispatchFor. Pins survive until clearAll.
-     *
-     *  #2247 review F2: a leaked (or several overlapping) pin(s) can put pinned
-     *  bytes over budget ON THEIR OWN. Evicting every unpinned record can never
-     *  bring the total back under budget in that state — before this guard, the
-     *  loop below evicted each newly inserted unpinned record on the very next
-     *  call (it was always the sole remaining unpinned key), so unpinned writes
-     *  never retained anything: a silent, permanent collapse for the rest of
-     *  the process. Once byte pressure is unpinned-bytes-driven-only, stop
-     *  evicting and admit unpinned inserts as-is — best-effort under pin
-     *  pressure — and record the state distinctly so it is visible instead of
-     *  inferred from "the store stopped retaining anything". */
-    evictColdFileFacts() {
-        if (!this.overCapacity())
-            return;
-        for (const key of this.fileFacts.keys()) {
-            if (this.pinnedFiles.has(key))
-                continue;
-            const axis = this.capacityAxis();
-            if (axis === "bytes" &&
-                this.pinnedContentBytesTotal > MAX_FILE_FACT_CONTENT_BYTES) {
-                this.reportPinnedOverBudget();
-                return;
-            }
-            this.deleteFileFactsRecord(key);
-            this.reportCapacityEviction(key, axis);
-            if (!this.overCapacity())
-                return;
-        }
-    }
-    overCapacity() {
-        return (this.fileFacts.size > MAX_FILE_FACT_RECORDS ||
-            this.retainedContentBytes > MAX_FILE_FACT_CONTENT_BYTES);
-    }
-    capacityAxis() {
-        return this.fileFacts.size > MAX_FILE_FACT_RECORDS ? "count" : "bytes";
-    }
-    contentBytes(value) {
-        return typeof value === "string" ? Buffer.byteLength(value, "utf8") : 0;
-    }
-    deleteFileFactsRecord(key) {
-        const facts = this.fileFacts.get(key);
-        if (!facts)
-            return;
-        const dropped = this.contentBytes(facts.get("file.content"));
-        this.retainedContentBytes -= dropped;
-        if (this.pinnedFiles.has(key))
-            this.pinnedContentBytesTotal -= dropped;
-        this.fileFacts.delete(key);
-    }
-    // #2243 item 4: the cap silently drops a fact a live dispatch may read back
-    // as "" (dispatcher.ts reads `file.content` with `?? ""`). Emit through the
-    // injected reporter so the drop is visible in the ledger instead of being
-    // inferred from a downstream symptom. integration.ts routes this to
-    // `recordDegradationOnce` keyed on THIS store's `subject` (#2243 review
-    // round 3, F1), so the ledger's own per-kind+subject dedupe yields exactly
-    // ONE record per session PER STORE (re-arming at session_start when the
-    // ledger resets) — no latch or generation compare here, so fact-store
-    // keeps no session-scoped state to forget to re-arm.
-    reportCapacityEviction(evictedKey, axis) {
-        capacityEvictionReporter?.(this.subject, axis, axis === "count"
-            ? `file-fact store axis=count exceeded ${MAX_FILE_FACT_RECORDS} records; evicted least-recently-used fact for ${evictedKey}`
-            : `file-fact store axis=bytes exceeded ${MAX_FILE_FACT_CONTENT_BYTES} retained content bytes; evicted least-recently-used fact for ${evictedKey}`);
-    }
-    // #2247 review F2: pinned bytes alone exceeding budget is not an eviction —
-    // nothing is dropped — so it is reported through a distinct axis rather
-    // than reusing `reportCapacityEviction`'s "evicted least-recently-used
-    // fact for X" language, which would misdescribe what happened.
-    reportPinnedOverBudget() {
-        const pinnedBytes = this.pinnedContentBytesTotal;
-        capacityEvictionReporter?.(this.subject, "pinned-over-budget", `file-fact store pinned content bytes (${pinnedBytes}) exceed the ` +
-            `${MAX_FILE_FACT_CONTENT_BYTES}-byte budget; unpinned inserts are ` +
-            `admitted without eviction until a pin releases`);
-    }
-    /** Running UTF-8 byte total for retained `file.content` values. Exposed so
-     *  tests can crosscheck it against a fresh sum over retained records
-     *  (#2247 review F3) — the running total is maintained incrementally on
-     *  every insert/delete path rather than recomputed, so a subtraction
-     *  dropped from one of those paths would otherwise drift silently. */
-    getRetainedContentBytes() {
-        return this.retainedContentBytes;
-    }
-    /** Running UTF-8 byte total for the pinned SUBSET of retained
-     *  `file.content` values. Exposed so tests can crosscheck it against a
-     *  fresh sum over `pinnedFiles ∩ fileFacts` (#2247 review F4) — like
-     *  `retainedContentBytes`, it is maintained incrementally on the pin
-     *  0→1 transition, the unpin 1→0 transition, content overwrite/delete,
-     *  and `clearAll`, so a drop from any one of those paths would
-     *  otherwise drift silently instead of failing loudly. */
-    getPinnedContentBytes() {
-        return this.pinnedContentBytesTotal;
-    }
-    getSessionFact(factId) {
-        return this.sessionFacts.get(factId);
-    }
-    setSessionFact(factId, value) {
-        this.sessionFacts.set(factId, value);
-    }
-    hasSessionFact(factId) {
-        return this.sessionFacts.has(factId);
-    }
-    /** Bounded counterpart to {@link getSessionFact} for per-file-keyed session
-     *  facts (#2282) — session baselines, cascade baselines, review-graph entity
-     *  snapshots. LRU touch: a read moves the record off the eviction end. */
-    getBoundedSessionFact(factId) {
-        if (!this.boundedSessionFacts.has(factId))
-            return undefined;
-        return this.boundedSessionFacts.get(factId);
-    }
-    /** Bounded counterpart to {@link setSessionFact}. Callers use this instead
-     *  of `setSessionFact` for any family that mints one key per file/entity
-     *  touched, so the store's count stays bounded across a large batch instead
-     *  of retaining one entry per distinct path for the process lifetime. */
-    setBoundedSessionFact(factId, value) {
-        this.evictedSessionFactKeys.delete(factId);
-        const evicted = this.boundedSessionFacts.set(factId, value);
-        for (const [oldestKey] of evicted) {
-            this.evictedSessionFactKeys.add(oldestKey);
-            while (this.evictedSessionFactKeys.size > MAX_SESSION_FACT_RECORDS) {
-                const oldestTombstone = this.evictedSessionFactKeys
-                    .values()
-                    .next().value;
-                if (oldestTombstone === undefined)
-                    break;
-                this.evictedSessionFactKeys.delete(oldestTombstone);
-            }
-            capacityEvictionReporter?.(this.subject, "session-count", `session-fact store axis=count exceeded ${MAX_SESSION_FACT_RECORDS} records; evicted least-recently-used fact for ${oldestKey}`);
-        }
-    }
-    hasBoundedSessionFact(factId) {
-        return this.boundedSessionFacts.has(factId);
-    }
-    /** True when this key held a bounded session fact that capacity eviction
-     *  dropped and nothing has rewritten since (#2282). Readers whose "absent"
-     *  branch is not a safe default — the review-graph entity snapshot, where
-     *  absent would read as "every symbol is new" — use this to tell an evicted
-     *  key from one this session has never seen. */
-    wasBoundedSessionFactEvicted(factId) {
-        return this.evictedSessionFactKeys.has(factId);
-    }
-    /** O(1) entry count for memory-attribution sampling (#2282 Observability):
-     *  the fixed-vocabulary map plus the bounded per-file map, so a caller gets
-     *  this store's whole `sessionFacts` footprint in one number. */
-    getSessionFactEntryCount() {
-        return this.sessionFacts.size + this.boundedSessionFacts.size;
-    }
-    /** Call on session reset only. Clears everything including tool cache and baselines. */
-    clearAll() {
-        this.fileFacts.clear();
-        this.sessionFacts.clear();
-        this.boundedSessionFacts.clear();
-        this.evictedSessionFactKeys.clear();
-        this.pinnedFiles.clear();
-        this.retainedContentBytes = 0;
-        this.pinnedContentBytesTotal = 0;
-    }
-}

package/dist/clients/dispatch/facts/comment-facts.js

@@ -1,22 +0,0 @@
-import { extractFactsFromTree, walk } from "./tree-sitter-facts.js";
-export const commentFactProvider = {
-    id: "fact.file.comments",
-    provides: ["file.comments"],
-    requires: ["file.content"],
-    appliesTo(ctx) {
-        return /\.tsx?$/.test(ctx.filePath);
-    },
-    async run(ctx, store) {
-        await extractFactsFromTree(ctx, store, { "file.comments": [] }, (root) => {
-            // Tree-sitter attaches comments as `comment` nodes wherever they occur; a
-            // pre-order walk yields them in source order (matching the old scanner pass).
-            const comments = [];
-            walk(root, (node) => {
-                if (node.type === "comment") {
-                    comments.push({ line: node.startPosition.row + 1, text: node.text });
-                }
-            });
-            return { "file.comments": comments };
-        });
-    },
-};

package/dist/clients/dispatch/facts/file-content.js

@@ -1,19 +0,0 @@
-import * as fs from "node:fs/promises";
-export const fileContentProvider = {
-    id: "fact.file.content",
-    provides: ["file.content"],
-    requires: [],
-    appliesTo(_ctx) {
-        return true;
-    },
-    async run(ctx, store) {
-        let content;
-        try {
-            content = await fs.readFile(ctx.filePath, "utf-8");
-        }
-        catch {
-            content = null;
-        }
-        store.setFileFact(ctx.filePath, "file.content", content);
-    },
-};