@descryy/core 0.1.0

package/dist/scoping/score.js

@@ -0,0 +1,125 @@
+/**
+ * The impact score — §12.4.
+ *
+ *     NewScore = ParentScore × EdgeWeight × ChangeCouplingFactor
+ *                            × IncidentCorrelationFactor × EdgeConfidence
+ *
+ * Both history factors **default to 1.0** so a brand-new file, or a repo with no
+ * logged incidents, is not unfairly under-scored. `EdgeConfidence` defaults to
+ * the edge's own value, which is 1.0 for a well-resolved adapter — so in a clean
+ * R3 repository the last three terms vanish and the formula is just weight
+ * decay. They do their work in a degraded one, which is the point.
+ *
+ * **The formula is applied in two parts, not as one product per hop.** Path
+ * decay uses only `EdgeWeight × EdgeConfidence`, which is strictly below 1 and
+ * therefore always terminates; the two history factors are applied once to a
+ * node's final score. See the long note in `weights.ts` for why the literal
+ * per-hop form cannot hold alongside §12.3 and §12.7, and DEC-037 for the
+ * decision. The short version: compounding a node's incident history at every
+ * hop of a path that merely passes through it counts the same evidence
+ * repeatedly.
+ */
+/**
+ * Per-node history factors, computed once and cached.
+ *
+ * Both are looked up on the node being *entered*, not on the edge: "this file
+ * has been involved in incidents" and "this file moves with the change" are
+ * properties of the destination, and computing them per edge would multiply the
+ * same boost in twice for a node reached two ways.
+ */
+export class HistoryFactors {
+    #provider;
+    #config;
+    #seeds;
+    #coupling = new Map();
+    #incident = new Map();
+    constructor(provider, config, seeds) {
+        this.#provider = provider;
+        this.#config = config;
+        this.#seeds = seeds;
+    }
+    /**
+     * §12.4's `ChangeCouplingFactor`, from `CHANGES_WITH` edges (§11.7).
+     *
+     * Boosts a node that historically moves with something in the diff. Two things
+     * make this narrower than it first appears, and both are honest limits rather
+     * than bugs:
+     *
+     * - `CHANGES_WITH` is **file-to-file**, so this only fires for `FILE` nodes.
+     *   A `FUNCTION` never has co-change history of its own.
+     * - The edge is stored in one canonical direction (DEC-036), so both
+     *   directions must be read. This is the one edge type where `outgoing` alone
+     *   is wrong.
+     */
+    couplingFor(nodeId) {
+        const cached = this.#coupling.get(nodeId);
+        if (cached !== undefined)
+            return cached;
+        const types = ["CHANGES_WITH"];
+        const edges = [
+            ...this.#provider.outgoing(nodeId, { types }),
+            ...this.#provider.incoming(nodeId, { types }),
+        ];
+        let best = 0;
+        for (const edge of edges) {
+            const other = edge.from === nodeId ? edge.to : edge.from;
+            if (!this.#seeds.has(other))
+                continue;
+            // The stored confidence is already clamped to R0's ceiling, so it lands in
+            // [0, 0.5]; doubling maps it back onto [0, 1] as a coupling *strength*.
+            best = Math.max(best, Math.min(1, edge.confidence * 2));
+        }
+        const factor = 1 + best * (this.#config.maxCouplingFactor - 1);
+        this.#coupling.set(nodeId, factor);
+        return factor;
+    }
+    /**
+     * §12.4's `IncidentCorrelationFactor`, from `INCIDENT_CORRELATED` edges (§11.6).
+     *
+     * Saturating rather than linear: the third incident on a file says much less
+     * than the first, and an unbounded count would let one pathological file
+     * dominate every blast radius it appears in.
+     */
+    incidentFor(nodeId) {
+        const cached = this.#incident.get(nodeId);
+        if (cached !== undefined)
+            return cached;
+        const count = this.#provider.incoming(nodeId, { types: ["INCIDENT_CORRELATED"] }).length;
+        const saturated = count === 0 ? 0 : count / (count + 2);
+        const factor = 1 + saturated * (this.#config.maxIncidentFactor - 1);
+        this.#incident.set(nodeId, factor);
+        return factor;
+    }
+}
+/**
+ * The per-hop decay: `EdgeWeight × EdgeConfidence`, and nothing else.
+ *
+ * Strictly below 1 for any valid configuration, so the path score decreases
+ * monotonically and traversal terminates on any graph, cyclic or not. That is
+ * the whole termination argument, and it does not depend on what the history
+ * factors happen to be — which is what makes it a guarantee rather than a hope.
+ */
+export function hopDecay(edge, config) {
+    return config.edgeWeights[edge.type] * edge.confidence;
+}
+/**
+ * A node's final score: its best path decay, adjusted once by its own history.
+ *
+ * Capped at `maxScore` because §12.7 tiers on absolute thresholds — a boosted
+ * score above 1.0 would put a two-hop node above the diff itself.
+ */
+export function finalScore(pathScore, nodeId, config, history) {
+    const boosted = pathScore * history.couplingFor(nodeId) * history.incidentFor(nodeId);
+    return Math.min(boosted, config.maxScore);
+}
+/**
+ * The largest amount any node's score can be raised by history.
+ *
+ * Pruning happens on the *unboosted* path score, so the prune point must be
+ * lowered by this much — otherwise a node that would clear the threshold once
+ * boosted is discarded before its boost is ever computed.
+ */
+export function maxBoost(config) {
+    return config.maxCouplingFactor * config.maxIncidentFactor;
+}
+//# sourceMappingURL=score.js.map

package/dist/scoping/score.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"score.js","sourceRoot":"","sources":["../../src/scoping/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH;;;;;;;GAOG;AACH,MAAM,OAAO,cAAc;IAChB,SAAS,CAAoB;IAC7B,OAAO,CAAgB;IACvB,MAAM,CAAsB;IAC5B,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,YAAY,QAA2B,EAAE,MAAqB,EAAE,KAA0B;QACxF,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,WAAW,CAAC,MAAc;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QAExC,MAAM,KAAK,GAAe,CAAC,cAAc,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG;YACZ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;YAC7C,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;SAC9C,CAAC;QAEF,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YACzD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtC,2EAA2E;YAC3E,wEAAwE;YACxE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,MAAc;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QAExC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QACzF,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,MAAqB;IAC1D,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;AACzD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CACxB,SAAiB,EACjB,MAAc,EACd,MAAqB,EACrB,OAAuB;IAEvB,MAAM,OAAO,GAAG,SAAS,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IACtF,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAqB;IAC5C,OAAO,MAAM,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAC7D,CAAC"}

package/dist/scoping/tiers.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Scope tiers — §12.7.
+ *
+ * | Tier | Criteria | Treatment |
+ * | --- | --- | --- |
+ * | 1 | Directly changed (the diff itself) | Always included |
+ * | 2 | Impact score > ~0.7 | Included |
+ * | 3 | Impact score ~0.3–0.7 | Included if budget allows |
+ * | 4 | Impact score < ~0.3 | Dropped under budget pressure |
+ */
+export type ScopeTier = 1 | 2 | 3 | 4;
+export declare const TIER_THRESHOLDS: {
+    readonly tier2: 0.7;
+    readonly tier3: 0.3;
+};
+export declare function tierFor(score: number, isSeed: boolean): ScopeTier;
+/**
+ * Node budgets by trigger — DEC-007 / §12.6 for pre-push/pr/nightly.
+ * `ide-hover` added P28: architecture §7.5 calls hover out as needing the
+ * tightest budget of the seven AI-layer triggers but never gives a figure —
+ * no DEC, no blueprint number, unlike the other three. 50 is a deliberate
+ * starting value (a quarter of pre-push's 200), not a measurement; tune from
+ * data like the rest.
+ */
+export declare const NODE_BUDGETS: {
+    readonly "pre-push": 200;
+    readonly "ide-hover": 50;
+    readonly pr: 1000;
+    readonly nightly: 5000;
+};
+export type Trigger = keyof typeof NODE_BUDGETS;
+//# sourceMappingURL=tiers.d.ts.map

package/dist/scoping/tiers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiers.d.ts","sourceRoot":"","sources":["../../src/scoping/tiers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,MAAM,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEtC,eAAO,MAAM,eAAe;;;CAAsC,CAAC;AAEnE,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,SAAS,CAKjE;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,YAAY;;;;;CAKf,CAAC;AAEX,MAAM,MAAM,OAAO,GAAG,MAAM,OAAO,YAAY,CAAC"}

package/dist/scoping/tiers.js

@@ -0,0 +1,35 @@
+/**
+ * Scope tiers — §12.7.
+ *
+ * | Tier | Criteria | Treatment |
+ * | --- | --- | --- |
+ * | 1 | Directly changed (the diff itself) | Always included |
+ * | 2 | Impact score > ~0.7 | Included |
+ * | 3 | Impact score ~0.3–0.7 | Included if budget allows |
+ * | 4 | Impact score < ~0.3 | Dropped under budget pressure |
+ */
+export const TIER_THRESHOLDS = { tier2: 0.7, tier3: 0.3 };
+export function tierFor(score, isSeed) {
+    if (isSeed)
+        return 1;
+    if (score > TIER_THRESHOLDS.tier2)
+        return 2;
+    if (score >= TIER_THRESHOLDS.tier3)
+        return 3;
+    return 4;
+}
+/**
+ * Node budgets by trigger — DEC-007 / §12.6 for pre-push/pr/nightly.
+ * `ide-hover` added P28: architecture §7.5 calls hover out as needing the
+ * tightest budget of the seven AI-layer triggers but never gives a figure —
+ * no DEC, no blueprint number, unlike the other three. 50 is a deliberate
+ * starting value (a quarter of pre-push's 200), not a measurement; tune from
+ * data like the rest.
+ */
+export const NODE_BUDGETS = {
+    "pre-push": 200,
+    "ide-hover": 50,
+    pr: 1_000,
+    nightly: 5_000,
+};
+//# sourceMappingURL=tiers.js.map

package/dist/scoping/tiers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiers.js","sourceRoot":"","sources":["../../src/scoping/tiers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAW,CAAC;AAEnE,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,MAAe;IACpD,IAAI,MAAM;QAAE,OAAO,CAAC,CAAC;IACrB,IAAI,KAAK,GAAG,eAAe,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IAC5C,IAAI,KAAK,IAAI,eAAe,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IAC7C,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,UAAU,EAAE,GAAG;IACf,WAAW,EAAE,EAAE;IACf,EAAE,EAAE,KAAK;IACT,OAAO,EAAE,KAAK;CACN,CAAC"}

package/dist/scoping/traverse.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Diff scoping — §12.5's algorithm.
+ *
+ * Seeds are the changed nodes at score 1.0. Expansion is best-first on score and
+ * stops when the score falls below the threshold — **never on hop count**, which
+ * is the entire argument of §12.2: a delete reaching a payment gateway four hops
+ * away matters, a logging import one hop away does not, and hop-count scoping
+ * cannot tell them apart.
+ *
+ * ## Tier 1 is budget-exempt, and reported separately
+ *
+ * The diff itself is not a *result* of scoping, it is its input. A PR touching
+ * 1,200 files would otherwise consume the entire 1,000-node PR budget on tier 1
+ * alone and report zero impact — the answer would be least useful exactly when
+ * the change is largest. Seeds are therefore always included and never counted
+ * against the budget, and `budgetUsed` reports only what expansion spent.
+ *
+ * ## Pruning happens on the unboosted score
+ *
+ * A node's history boost is applied to its final score, not per hop (DEC-037),
+ * so expansion cannot know a node's boosted score until it has been reached. The
+ * prune point is therefore lowered by the largest boost the configuration
+ * permits — otherwise a node that *would* clear the threshold once boosted is
+ * discarded before its boost is ever computed. Admissible, in the A* sense: it
+ * can keep a node that later scores below threshold, never drop one that would
+ * have scored above it.
+ */
+import type { IREdge, IRNode } from "@descryy/ir";
+import type { AdjacencyProvider, QueryResult } from "../query/provider.ts";
+import { type ScopeTier, type Trigger } from "./tiers.ts";
+import { type ScopingConfig } from "./weights.ts";
+export interface ScopedNode {
+    readonly node: IRNode;
+    readonly score: number;
+    readonly tier: ScopeTier;
+    readonly depth: number;
+    /** The edge on the best-known path to this node. Null for a seed. */
+    readonly via: IREdge | null;
+}
+export interface Scope {
+    /** Tier 1: the diff itself. Always complete, never truncated. */
+    readonly changed: readonly ScopedNode[];
+    /** Tiers 2–4, ranked by score. Truncated under budget pressure. */
+    readonly affected: readonly ScopedNode[];
+    /** Nodes expansion reached but the budget dropped, highest-scoring first. */
+    readonly dropped: readonly ScopedNode[];
+    readonly budget: number;
+    readonly budgetUsed: number;
+}
+export interface ScopeOptions {
+    readonly trigger?: Trigger;
+    /** Overrides the trigger's budget. Mostly for tests and the nightly sweep. */
+    readonly budget?: number;
+    readonly config?: ScopingConfig;
+    readonly maxDepth?: number;
+    /** Cap on edges expanded per node. Guards hubs with in-degree in the thousands. */
+    readonly perNodeLimit?: number;
+}
+export declare function scopeChange(provider: AdjacencyProvider, changedIds: readonly string[], options?: ScopeOptions): QueryResult<Scope>;
+//# sourceMappingURL=traverse.d.ts.map

package/dist/scoping/traverse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/scoping/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAY,MAAM,EAAE,MAAM,EAAmB,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,iBAAiB,EAAc,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAGvF,OAAO,EAAyB,KAAK,SAAS,EAAE,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AACjF,OAAO,EAIL,KAAK,aAAa,EACnB,MAAM,cAAc,CAAC;AAEtB,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,qEAAqE;IACrE,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,WAAW,KAAK;IACpB,iEAAiE;IACjE,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,CAAC;IACxC,mEAAmE;IACnE,QAAQ,CAAC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,6EAA6E;IAC7E,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,CAAC;IACxC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC;IAC3B,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC;IAChC,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,mFAAmF;IACnF,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AASD,wBAAgB,WAAW,CACzB,QAAQ,EAAE,iBAAiB,EAC3B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,OAAO,GAAE,YAAiB,GACzB,WAAW,CAAC,KAAK,CAAC,CAuJpB"}

package/dist/scoping/traverse.js

@@ -0,0 +1,172 @@
+/**
+ * Diff scoping — §12.5's algorithm.
+ *
+ * Seeds are the changed nodes at score 1.0. Expansion is best-first on score and
+ * stops when the score falls below the threshold — **never on hop count**, which
+ * is the entire argument of §12.2: a delete reaching a payment gateway four hops
+ * away matters, a logging import one hop away does not, and hop-count scoping
+ * cannot tell them apart.
+ *
+ * ## Tier 1 is budget-exempt, and reported separately
+ *
+ * The diff itself is not a *result* of scoping, it is its input. A PR touching
+ * 1,200 files would otherwise consume the entire 1,000-node PR budget on tier 1
+ * alone and report zero impact — the answer would be least useful exactly when
+ * the change is largest. Seeds are therefore always included and never counted
+ * against the budget, and `budgetUsed` reports only what expansion spent.
+ *
+ * ## Pruning happens on the unboosted score
+ *
+ * A node's history boost is applied to its final score, not per hop (DEC-037),
+ * so expansion cannot know a node's boosted score until it has been reached. The
+ * prune point is therefore lowered by the largest boost the configuration
+ * permits — otherwise a node that *would* clear the threshold once boosted is
+ * discarded before its boost is ever computed. Admissible, in the A* sense: it
+ * can keep a node that later scores below threshold, never drop one that would
+ * have scored above it.
+ */
+import { attenuationFor } from "./fanout.js";
+import { finalScore, HistoryFactors, hopDecay, maxBoost } from "./score.js";
+import { NODE_BUDGETS, tierFor } from "./tiers.js";
+import { DEFAULT_SCOPING_CONFIG, ScopingConfigError, validateScopingConfig, } from "./weights.js";
+/**
+ * `CHANGES_WITH` is stored in one canonical direction (DEC-036), so scoping must
+ * read it both ways. Every other edge type is genuinely directional: impact
+ * flows from a changed callee to its callers, not the reverse.
+ */
+const UNDIRECTED = new Set(["CHANGES_WITH"]);
+export function scopeChange(provider, changedIds, options = {}) {
+    const config = options.config ?? DEFAULT_SCOPING_CONFIG;
+    // Refuse to start rather than fail mid-traversal — DEC-028.
+    validateScopingConfig(config);
+    // DEC-067: `perNodeLimit` truncates the very count attenuation is derived
+    // from, so a limit at or below the last finite boundary would put a hub in a
+    // gentler bucket than it belongs in and under-attenuate it. Refused rather
+    // than silently mis-bucketed.
+    const finite = config.fanOutBuckets.filter((b) => Number.isFinite(b.upTo));
+    const lastBoundary = finite.length === 0 ? 0 : finite[finite.length - 1].upTo;
+    if (options.perNodeLimit !== undefined && options.perNodeLimit <= lastBoundary) {
+        throw new ScopingConfigError(`perNodeLimit ${options.perNodeLimit} is at or below the last fan-out boundary ` +
+            `(${lastBoundary}), so a hub's fan-out would be truncated to the limit and scored in a ` +
+            `gentler bucket than it belongs in (DEC-067). Raise the limit above ${lastBoundary}.`);
+    }
+    const trigger = options.trigger ?? "pr";
+    const budget = options.budget ?? NODE_BUDGETS[trigger];
+    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
+    const seeds = new Set(changedIds);
+    const history = new HistoryFactors(provider, config, seeds);
+    const pruneAt = config.threshold / maxBoost(config);
+    const best = new Map();
+    const queue = [];
+    let resolutionFloor = 4;
+    for (const id of changedIds) {
+        best.set(id, { score: 1, depth: 0, via: null });
+        queue.push({ id, score: 1, depth: 0 });
+    }
+    // Best-first. A binary heap would be faster, but expansion is bounded by the
+    // score threshold rather than by the queue, so the queue stays small in
+    // practice and a sorted pop keeps the algorithm readable.
+    while (queue.length > 0) {
+        queue.sort((a, b) => b.score - a.score);
+        const current = queue.shift();
+        const known = best.get(current.id);
+        if (known === undefined || known.score > current.score)
+            continue; // stale entry
+        if (current.depth >= maxDepth)
+            continue;
+        // Impact flows to the *dependents* of a changed node: what breaks if this
+        // changes is its callers, not its callees.
+        const adjacency = options.perNodeLimit === undefined ? {} : { limit: options.perNodeLimit };
+        const candidates = provider
+            .incoming(current.id, adjacency)
+            .map((edge) => ({ edge, next: edge.from }));
+        for (const edge of provider.outgoing(current.id, adjacency)) {
+            // Only the undirected types expand outward as well; otherwise a changed
+            // node would report everything it depends on as affected by it.
+            if (UNDIRECTED.has(edge.type))
+                candidates.push({ edge, next: edge.to });
+        }
+        // DEC-067. `candidates.length` is this node's operational fan-out — the
+        // number of ways expansion can explode out of it — and it is already in
+        // hand, so no index or second query is needed. The seed exemption lives
+        // inside `attenuationFor`: a hub that was *changed* expands at full
+        // strength, a hub that was merely *reached* does not.
+        const attenuation = attenuationFor(candidates.length, current.depth, config.fanOutBuckets);
+        for (const { edge, next } of candidates) {
+            // Attenuation can only shrink a score, so `pruneAt` stays admissible —
+            // nothing that could clear the threshold once boosted is discarded here
+            // that would not have been discarded before.
+            const score = current.score * hopDecay(edge, config) * attenuation;
+            // §12.5: prune this path. Lowered by the maximum boost, so nothing that
+            // could clear the threshold once boosted is discarded unseen.
+            if (score < pruneAt)
+                continue;
+            const existing = best.get(next);
+            if (existing !== undefined && existing.score >= score)
+                continue;
+            if (edge.resolution < resolutionFloor)
+                resolutionFloor = edge.resolution;
+            best.set(next, { score, depth: current.depth + 1, via: edge });
+            queue.push({ id: next, score, depth: current.depth + 1 });
+        }
+    }
+    // --- assemble ------------------------------------------------------------
+    const changed = [];
+    const expanded = [];
+    for (const [id, entry] of best) {
+        const node = provider.node(id);
+        if (node === undefined)
+            continue;
+        const isSeed = seeds.has(id);
+        const score = isSeed ? 1 : finalScore(entry.score, id, config, history);
+        // A node kept by the lowered prune point that does not clear the real
+        // threshold once boosted was correctly explored and is correctly discarded.
+        if (!isSeed && score < config.threshold)
+            continue;
+        const scoped = {
+            node,
+            score,
+            tier: tierFor(score, isSeed),
+            depth: entry.depth,
+            via: entry.via,
+        };
+        (isSeed ? changed : expanded).push(scoped);
+    }
+    // §12.6: when the cap is hit, keep the highest-impact nodes and drop the rest.
+    // Ranked by score, then id, so truncation is deterministic rather than
+    // dependent on the order the map happened to fill.
+    expanded.sort((a, b) => b.score - a.score || a.node.id.localeCompare(b.node.id));
+    changed.sort((a, b) => a.node.id.localeCompare(b.node.id));
+    const affected = expanded.slice(0, budget);
+    const dropped = expanded.slice(budget);
+    const notes = [];
+    if (dropped.length > 0) {
+        const worstKept = affected.at(-1)?.score ?? 0;
+        notes.push(`The ${trigger} budget of ${budget} nodes was reached: ${dropped.length} lower-impact ` +
+            `node(s) were dropped, all scoring at or below ${worstKept.toFixed(3)}. They were not ` +
+            `examined and are not reported as clean.`);
+    }
+    if (resolutionFloor <= 1) {
+        notes.push(`This blast radius rests on edges resolved no better than R${resolutionFloor}. Cross-file ` +
+            "calls are not reliably resolved at that level, so the radius is a lower bound.");
+    }
+    if (changed.length > budget) {
+        notes.push(`The diff itself contains ${changed.length} changed node(s), more than the ${budget}-node ` +
+            "budget. Tier 1 is reported in full and does not consume the budget, so impact analysis " +
+            "still ran.");
+    }
+    const stamp = { ...provider.baseStamp(), resolutionFloor };
+    return {
+        data: {
+            changed,
+            affected,
+            dropped,
+            budget,
+            budgetUsed: affected.length,
+        },
+        stamp,
+        truncated: dropped.length > 0,
+        notes,
+    };
+}
+//# sourceMappingURL=traverse.js.map

package/dist/scoping/traverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/scoping/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAKH,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC5E,OAAO,EAAE,YAAY,EAAE,OAAO,EAAgC,MAAM,YAAY,CAAC;AACjF,OAAO,EACL,sBAAsB,EACtB,kBAAkB,EAClB,qBAAqB,GAEtB,MAAM,cAAc,CAAC;AAgCtB;;;;GAIG;AACH,MAAM,UAAU,GAA0B,IAAI,GAAG,CAAW,CAAC,cAAc,CAAC,CAAC,CAAC;AAE9E,MAAM,UAAU,WAAW,CACzB,QAA2B,EAC3B,UAA6B,EAC7B,UAAwB,EAAE;IAE1B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,sBAAsB,CAAC;IACxD,4DAA4D;IAC5D,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAE9B,0EAA0E;IAC1E,6EAA6E;IAC7E,2EAA2E;IAC3E,8BAA8B;IAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3E,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC;IAC/E,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,IAAI,OAAO,CAAC,YAAY,IAAI,YAAY,EAAE,CAAC;QAC/E,MAAM,IAAI,kBAAkB,CAC1B,gBAAgB,OAAO,CAAC,YAAY,4CAA4C;YAC9E,IAAI,YAAY,wEAAwE;YACxF,sEAAsE,YAAY,GAAG,CACxF,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAY,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC;IACjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAE5D,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgE,CAAC;IACrF,MAAM,KAAK,GAAmD,EAAE,CAAC;IACjE,IAAI,eAAe,GAAoB,CAAC,CAAC;IAEzC,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,6EAA6E;IAC7E,wEAAwE;IACxE,0DAA0D;IAC1D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK;YAAE,SAAS,CAAC,cAAc;QAChF,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ;YAAE,SAAS;QAExC,0EAA0E;QAC1E,2CAA2C;QAC3C,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;QAC5F,MAAM,UAAU,GAAqC,QAAQ;aAC1D,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC;aAC/B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAE9C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5D,wEAAwE;YACxE,gEAAgE;YAChE,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1E,CAAC;QAED,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,oEAAoE;QACpE,sDAAsD;QACtD,MAAM,WAAW,GAAG,cAAc,CAAC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QAE3F,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,UAAU,EAAE,CAAC;YACxC,uEAAuE;YACvE,wEAAwE;YACxE,6CAA6C;YAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,WAAW,CAAC;YACnE,wEAAwE;YACxE,8DAA8D;YAC9D,IAAI,KAAK,GAAG,OAAO;gBAAE,SAAS;YAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,IAAI,KAAK;gBAAE,SAAS;YAChE,IAAI,IAAI,CAAC,UAAU,GAAG,eAAe;gBAAE,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC;YAEzE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;YAC/D,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,4EAA4E;IAE5E,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAiB,EAAE,CAAC;IAElC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACxE,sEAAsE;QACtE,4EAA4E;QAC5E,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,MAAM,CAAC,SAAS;YAAE,SAAS;QAClD,MAAM,MAAM,GAAe;YACzB,IAAI;YACJ,KAAK;YACL,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;YAC5B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,GAAG,EAAE,KAAK,CAAC,GAAG;SACf,CAAC;QACF,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,+EAA+E;IAC/E,uEAAuE;IACvE,mDAAmD;IACnD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACjF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3D,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAEvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;QAC9C,KAAK,CAAC,IAAI,CACR,OAAO,OAAO,cAAc,MAAM,uBAAuB,OAAO,CAAC,MAAM,gBAAgB;YACrF,iDAAiD,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB;YACvF,yCAAyC,CAC5C,CAAC;IACJ,CAAC;IACD,IAAI,eAAe,IAAI,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CACR,6DAA6D,eAAe,eAAe;YACzF,gFAAgF,CACnF,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CACR,4BAA4B,OAAO,CAAC,MAAM,mCAAmC,MAAM,QAAQ;YACzF,yFAAyF;YACzF,YAAY,CACf,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,CAAC;IACvE,OAAO;QACL,IAAI,EAAE;YACJ,OAAO;YACP,QAAQ;YACR,OAAO;YACP,MAAM;YACN,UAAU,EAAE,QAAQ,CAAC,MAAM;SAC5B;QACD,KAAK;QACL,SAAS,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;QAC7B,KAAK;KACN,CAAC;AACJ,CAAC"}

package/dist/scoping/weights.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Scoring configuration for diff scoping — §12.4.
+ *
+ * ## The one number in the architecture that cannot be used as written
+ *
+ * §12.3's worked example decays a `CALLS` edge by **×1.0** on its first hop and
+ * by **×0.95** on its third. The 0.95 is the usable one; 1.0 is not, for two
+ * independent reasons:
+ *
+ * 1. **It breaks the premise of the whole engine.** §12.2 argues that hop count
+ *    is a poor proxy for importance and that expansion must stop on *score*. An
+ *    edge weight of 1.0 means a `CALLS` chain never decays — every node reachable
+ *    by calls scores exactly 1.0 forever, so the stopping rule degenerates into
+ *    "stop when the budget runs out", which is hop-count scoping wearing a
+ *    different name.
+ * 2. **It does not terminate.** With `EdgeConfidence` at 1.0 for an R3 edge, the
+ *    hop factor is exactly 1.0, and on a `CALLS` cycle the traversal never ends.
+ *    DEC-028 requires the factor to be strictly inside (0, 1).
+ *
+ * The defaults below therefore use 0.95, and §12.3's stated outcome still holds:
+ * the payment gateway three hops out survives and `logger.ts` two hops out is
+ * dropped. That test discriminates on the *shape* of the decay, not on whether
+ * the first hop was 1.00 or 0.95.
+ *
+ * ## Three parts of the architecture cannot all be true — and the resolution
+ *
+ * Writing this file surfaced a genuine inconsistency between §12.3, §12.4 and
+ * §12.7. Any two can hold; all three cannot.
+ *
+ * - **§12.3** needs *high* weights. Its worked example decays `CALLS` and
+ *   `PROPAGATES_TO` at ~0.95 so a three-hop chain still scores 0.90.
+ * - **§12.7** tiers on *absolute* thresholds — tier 2 above 0.7, tier 4 below
+ *   0.3 — which are only meaningful if a few hops of a strong edge stay high.
+ *   Scale the weights down for headroom and the payment gateway §12.3 calls
+ *   critical lands in tier 4, "dropped under budget pressure".
+ * - **§12.4** multiplies by `ChangeCouplingFactor` and
+ *   `IncidentCorrelationFactor` *at every hop*, and both are boosts above 1.0.
+ *   A weight of 0.95 with any coupling above 1.053 makes the hop factor exceed
+ *   1.0, at which point the score stops decaying and a cycle never terminates.
+ *
+ * **Resolution: the history factors adjust a node's score once, they do not
+ * compound per hop.** Path decay is the product of `edgeWeight × confidence`
+ * over the hops, strictly below 1 at every step, so termination is structural.
+ * Coupling and incident are then applied to the node's final score.
+ *
+ * This keeps §12.3's numbers exactly, keeps §12.7's thresholds meaningful, and
+ * keeps §12.4's terms doing the work they were introduced for. It is also more
+ * defensible than the literal formula: compounding a node's incident history at
+ * every hop of a path that merely *passes through* it counts the same evidence
+ * repeatedly, which the multiplicative form does silently. See DEC-037.
+ */
+import { type EdgeType } from "@descryy/ir";
+import { type FanOutBucket } from "./fanout.ts";
+export interface ScopingConfig {
+    /** Per-type decay, §12.4's `EdgeWeight`. Never per-edge — see DEC-021 correction 2. */
+    readonly edgeWeights: Readonly<Record<EdgeType, number>>;
+    /** Ceiling on §12.4's `ChangeCouplingFactor`. 1.0 disables the boost. */
+    readonly maxCouplingFactor: number;
+    /** Ceiling on §12.4's `IncidentCorrelationFactor`. 1.0 disables the boost. */
+    readonly maxIncidentFactor: number;
+    /**
+     * Ceiling on a node's final boosted score. Scores are compared against §12.7's
+     * absolute tier thresholds, so they must stay on the same scale as an
+     * unboosted one.
+     */
+    readonly maxScore: number;
+    /** §12.6: expansion halts once the score falls below this. Not a hop count. */
+    readonly threshold: number;
+    /**
+     * DEC-067's fan-out attenuation table, applied to expansion out of a hub that
+     * traversal *arrived at* — never to a seed, and never to an edge's weight.
+     */
+    readonly fanOutBuckets: readonly FanOutBucket[];
+}
+/**
+ * Default weights.
+ *
+ * **Tuning, not architecture.** §12 is marked `DECIDED, TUNING OPEN` and §32
+ * items 1 and 4 list edge weights as values to set from real traversal data.
+ * These are starting points chosen to reproduce §12.3's example, and the three
+ * that matter are the ones that example names: `CALLS`, `PROPAGATES_TO` and
+ * `IMPORTS`.
+ */
+export declare const DEFAULT_EDGE_WEIGHTS: Readonly<Record<EdgeType, number>>;
+export declare const DEFAULT_SCOPING_CONFIG: ScopingConfig;
+export declare class ScopingConfigError extends Error {
+    readonly name = "ScopingConfigError";
+}
+/**
+ * Refuse a configuration that could fail to terminate — DEC-028's config-load half.
+ *
+ * The check is per edge type because the failure is: one type's weight, boosted
+ * to its declared maxima, reaching 1.0. A global average would hide exactly the
+ * case that matters.
+ */
+export declare function validateScopingConfig(config: ScopingConfig): void;
+//# sourceMappingURL=weights.d.ts.map

package/dist/scoping/weights.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"weights.d.ts","sourceRoot":"","sources":["../../src/scoping/weights.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AAEH,OAAO,EAAc,KAAK,QAAQ,EAAE,MAAM,aAAa,CAAC;AAExD,OAAO,EAA0C,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAExF,MAAM,WAAW,aAAa;IAC5B,uFAAuF;IACvF,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,yEAAyE;IACzE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,8EAA8E;IAC9E,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,+EAA+E;IAC/E,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,YAAY,EAAE,CAAC;CACjD;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CA2BnE,CAAC;AAEF,eAAO,MAAM,sBAAsB,EAAE,aAUpC,CAAC;AAEF,qBAAa,kBAAmB,SAAQ,KAAK;IAC3C,SAAkB,IAAI,wBAAwB;CAC/C;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,CAmEjE"}