@descryy/core 0.1.0

package/dist/governance/finding-funnel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-funnel.d.ts","sourceRoot":"","sources":["../../src/governance/finding-funnel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AAEH,OAAO,EAAsB,KAAK,OAAO,EAAuB,MAAM,aAAa,CAAC;AAEpF,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEnD;;;;;;GAMG;AACH,eAAO,MAAM,YAAY;IACvB,yFAAyF;;IAEzF,uEAAuE;;IAEvE,kCAAkC;;IAElC,oFAAoF;;CAE1C,CAAC;AAc7C,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,OAAO,CAAC;IACrD,iGAAiG;IACjG,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,sGAAsG;IACtG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,WAAW,mBAAmB;IAClC,yEAAyE;IACzE,QAAQ,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,CAAC;IACtC,iFAAiF;IACjF,QAAQ,CAAC,WAAW,EAAE,SAAS,OAAO,EAAE,CAAC;IACzC,wFAAwF;IACxF,QAAQ,CAAC,UAAU,EAAE,SAAS,OAAO,EAAE,CAAC;IACxC,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;CACxC;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,SAAS,OAAO,EAAE,EAC5B,OAAO,EAAE,oBAAoB,GAC5B,mBAAmB,CAqCrB;AAYD;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC"}

package/dist/governance/finding-funnel.js

@@ -0,0 +1,137 @@
+/**
+ * The governance funnel — architecture §20.1.
+ *
+ * > *"Without this layer, a run that surfaces 200 findings gets read by
+ * > nobody. Volume without governance is functionally the same as no output at
+ * > all."*
+ *
+ * §20.1 draws a five-filter funnel ending in a hard cap. Two of its boxes had
+ * no implementation anywhere: **F2, "known false positives from the feedback
+ * store,"** and **the HARD CAP itself**, whose value architecture §32 item 6
+ * has carried as a blank since the document was written (*"Hard cap value —
+ * how many findings is 'a few'"*, Tuning, *"set from early runs"*).
+ *
+ * `CLAUDE.md` rule 5 — *"a few high-confidence findings, never an exhaustive
+ * maybe-list"* — is the rule aimed most directly at what this whole category
+ * of tool gets wrong, and it was the one rule with no number behind it. Three
+ * per-check caps of 25 existed (`contracts/orphans.ts`, `validation/rollback.ts`,
+ * `validation/env.ts`), which is not the same thing: three checks at 25 present
+ * 75 items and nothing objects.
+ *
+ * ## The cap values, and where they come from
+ *
+ * §20.1 states its own worked example in prose: *"Twenty-seven possible issues
+ * get ignored. Three confirmed issues plus two worth checking get acted on
+ * immediately."* **Three plus two is five**, and that is `pr`'s cap — read off
+ * the architecture rather than invented.
+ *
+ * The other three are scaled to their trigger the same way `NODE_BUDGETS`
+ * already is, and for the same reason: an IDE hover and a nightly sweep are
+ * not the same reading surface. **Starting values, not measurements** —
+ * `CLAUDE.md`'s standing convention for every number in this project.
+ *
+ * ## What this module deliberately does not own
+ *
+ * - **It does not assign a category.** Only G4 does (`ai-governance-spec.md`
+ *   §11). This runs strictly after, on already-categorised findings, and
+ *   reorders and truncates them without touching a single field.
+ * - **It does not store dismissals.** `isDismissed` is a caller-supplied
+ *   predicate. The ledger is `descry-desktop`'s (§21.3 puts the feedback store
+ *   next to the runs it belongs to); the *filter* is governance and belongs
+ *   here, next to G1–G4.
+ * - **It never silently drops anything.** Every finding that entered leaves in
+ *   exactly one of `reported` / `unconfirmed` / `suppressed`, and the count it
+ *   truncated is a structured field with a rendered sentence — the same rule
+ *   `ai-tool-contract.md` §4 technique 5 applies one layer down (*"a capped
+ *   result that looks complete is the same defect as a zero that looks like a
+ *   finding"*).
+ */
+import { findingFingerprint } from "@descryy/ir";
+/**
+ * How many findings one run may report, per trigger.
+ *
+ * `pr` is architecture §20.1's own arithmetic (3 confirmed + 2 worth
+ * checking). The rest are scaled to the reading surface, the same shape
+ * `NODE_BUDGETS` uses, and are starting values pending real runs to tune from.
+ */
+export const FINDING_CAPS = {
+    /** A hover is one line of screen. More than one finding there is a list nobody reads. */
+    "ide-hover": 1,
+    /** A developer is mid-push and blocked. Only the strongest survive. */
+    "pre-push": 3,
+    /** §20.1's own worked example. */
+    pr: 5,
+    /** Someone opened a report deliberately and is reading it. Looser, still capped. */
+    nightly: 10,
+};
+/** Rank order for §20.1's "rank by confidence × impact". Higher wins. */
+const CATEGORY_RANK = {
+    confirmed: 4,
+    "strongly supported": 3,
+    unconfirmed: 2,
+    "not analysable": 1,
+    unsupported: 0,
+};
+/** Categories that belong in §20.1's separate unconfirmed list rather than the capped one. */
+const NOT_CONFIDENT = new Set(["unconfirmed", "not analysable", "unsupported"]);
+/**
+ * Run §20.1's funnel over one run's findings.
+ *
+ * Pure and total: same input, same output, and every input finding appears in
+ * exactly one output list. Deterministic ordering — required by
+ * `ai-layer-plan.md` §9 layer 6's replay guarantee, so ties break on the
+ * finding's own fingerprint rather than on input order.
+ */
+export function runFindingFunnel(findings, options) {
+    const isDismissed = options.isDismissed ?? (() => false);
+    const suppressed = [];
+    const confident = [];
+    const unconfirmed = [];
+    for (const finding of findings) {
+        if (isDismissed(finding)) {
+            suppressed.push(finding);
+            continue;
+        }
+        if (NOT_CONFIDENT.has(finding.confidence))
+            unconfirmed.push(finding);
+        else
+            confident.push(finding);
+    }
+    const ranked = [...confident].sort(compareFindings);
+    const cap = Math.max(0, Math.floor(options.cap ?? FINDING_CAPS[options.trigger]));
+    const reported = ranked.slice(0, cap);
+    const dropped = ranked.length - reported.length;
+    return {
+        reported,
+        unconfirmed: [...unconfirmed].sort(compareFindings),
+        suppressed,
+        truncation: {
+            total: ranked.length,
+            shown: reported.length,
+            dropped,
+            disclosure: dropped === 0
+                ? null
+                : `${dropped} further finding${dropped === 1 ? "" : "s"} met the confidence bar and ` +
+                    `${dropped === 1 ? "was" : "were"} not shown: this run reports at most ${cap}, ranked by ` +
+                    "confidence. They were found, not missed.",
+        },
+    };
+}
+function compareFindings(a, b) {
+    const byCategory = CATEGORY_RANK[b.confidence] - CATEGORY_RANK[a.confidence];
+    if (byCategory !== 0)
+        return byCategory;
+    // Then by how well the code beneath it was understood — rule 3's axis.
+    const byResolution = Number(b.resolutionLevel) - Number(a.resolutionLevel);
+    if (byResolution !== 0)
+        return byResolution;
+    // A stable, content-derived tiebreak, so replay reproduces the order.
+    return findingFingerprint(a) < findingFingerprint(b) ? -1 : 1;
+}
+/**
+ * Re-exported so a caller wiring the funnel and its ledger imports one module.
+ * The implementation lives in `@descryy/ir`'s identity module — see
+ * `DEC-NEXT-edge-id-prefix-split` for why an identity gets exactly one home.
+ */
+export { findingFingerprint } from "@descryy/ir";
+//# sourceMappingURL=finding-funnel.js.map

package/dist/governance/finding-funnel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finding-funnel.js","sourceRoot":"","sources":["../../src/governance/finding-funnel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AAEH,OAAO,EAAE,kBAAkB,EAAqC,MAAM,aAAa,CAAC;AAIpF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,yFAAyF;IACzF,WAAW,EAAE,CAAC;IACd,uEAAuE;IACvE,UAAU,EAAE,CAAC;IACb,kCAAkC;IAClC,EAAE,EAAE,CAAC;IACL,oFAAoF;IACpF,OAAO,EAAE,EAAE;CAC+B,CAAC;AAE7C,yEAAyE;AACzE,MAAM,aAAa,GAAmC;IACpD,SAAS,EAAE,CAAC;IACZ,oBAAoB,EAAE,CAAC;IACvB,WAAW,EAAE,CAAC;IACd,gBAAgB,EAAE,CAAC;IACnB,WAAW,EAAE,CAAC;CACf,CAAC;AAEF,8FAA8F;AAC9F,MAAM,aAAa,GAAgC,IAAI,GAAG,CAAC,CAAC,aAAa,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC,CAAC;AA+B7G;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAA4B,EAC5B,OAA6B;IAE7B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IAEzD,MAAM,UAAU,GAAc,EAAE,CAAC;IACjC,MAAM,SAAS,GAAc,EAAE,CAAC;IAChC,MAAM,WAAW,GAAc,EAAE,CAAC;IAElC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,SAAS;QACX,CAAC;QACD,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;;YAChE,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEhD,OAAO;QACL,QAAQ;QACR,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;QACnD,UAAU;QACV,UAAU,EAAE;YACV,KAAK,EAAE,MAAM,CAAC,MAAM;YACpB,KAAK,EAAE,QAAQ,CAAC,MAAM;YACtB,OAAO;YACP,UAAU,EACR,OAAO,KAAK,CAAC;gBACX,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,GAAG,OAAO,mBAAmB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,8BAA8B;oBACnF,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,wCAAwC,GAAG,cAAc;oBAC1F,0CAA0C;SACjD;KACF,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,CAAU,EAAE,CAAU;IAC7C,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAC7E,IAAI,UAAU,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IACxC,uEAAuE;IACvE,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;IAC3E,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC;IAC5C,sEAAsE;IACtE,OAAO,kBAAkB,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC"}

package/dist/governance/index.d.ts

@@ -0,0 +1,11 @@
+export { checkFactBoundary } from "./fact-boundary.ts";
+export type { Citation, CitationPathSegment, FactualClaim, SlotOutput, RejectedClaim, FactBoundaryResult } from "./fact-boundary.ts";
+export { checkCandidateBoundary } from "./candidate-boundary.ts";
+export type { PlanItem, RejectedPlanItem, CandidateBoundaryResult } from "./candidate-boundary.ts";
+export { BUDGET_CAP_NAMES, DEFAULT_INVESTIGATION_BUDGET, checkRunBudget, hypothesisRoundLimitReached, } from "./budget.ts";
+export type { BudgetCapExceeded, BudgetCapName, BudgetCheckResult, HypothesisBudgetUsage, InvestigationBudget, RunBudgetUsage, } from "./budget.ts";
+export { ESCALATION_TRIGGERS, checkEscalation } from "./escalation.ts";
+export type { EscalationCheckInput, EscalationTrigger } from "./escalation.ts";
+export { runFindingFunnel, findingFingerprint, FINDING_CAPS } from "./finding-funnel.ts";
+export type { FindingFunnelOptions, FindingFunnelResult, FindingTruncation, } from "./finding-funnel.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/governance/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/governance/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,QAAQ,EAAE,mBAAmB,EAAE,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAErI,OAAO,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACjE,YAAY,EAAE,QAAQ,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EACL,gBAAgB,EAChB,4BAA4B,EAC5B,cAAc,EACd,2BAA2B,GAC5B,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,qBAAqB,EACrB,mBAAmB,EACnB,cAAc,GACf,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACvE,YAAY,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAE/E,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACzF,YAAY,EACV,oBAAoB,EACpB,mBAAmB,EACnB,iBAAiB,GAClB,MAAM,qBAAqB,CAAC"}

package/dist/governance/index.js

@@ -0,0 +1,6 @@
+export { checkFactBoundary } from "./fact-boundary.js";
+export { checkCandidateBoundary } from "./candidate-boundary.js";
+export { BUDGET_CAP_NAMES, DEFAULT_INVESTIGATION_BUDGET, checkRunBudget, hypothesisRoundLimitReached, } from "./budget.js";
+export { ESCALATION_TRIGGERS, checkEscalation } from "./escalation.js";
+export { runFindingFunnel, findingFingerprint, FINDING_CAPS } from "./finding-funnel.js";
+//# sourceMappingURL=index.js.map

package/dist/governance/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/governance/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAGvD,OAAO,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAGjE,OAAO,EACL,gBAAgB,EAChB,4BAA4B,EAC5B,cAAc,EACd,2BAA2B,GAC5B,MAAM,aAAa,CAAC;AAUrB,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAGvE,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/graph/build.d.ts

@@ -0,0 +1,127 @@
+/**
+ * The Graph Builder.
+ *
+ * This is the first place the multi-language thesis is true or false in code.
+ * Everything before it works on one adapter's output at a time; this folds
+ * several adapters' IR into one graph, and either the cross-language join
+ * happens here or it never happens at all.
+ *
+ * Its acceptance test is XL-1 — *exactly one* `API_ENDPOINT` node after merging
+ * both adapters — and XL-2, that the node carries no language. Step 7 showed the
+ * two fakes reach the same endpoint id independently; this has to preserve that
+ * through the merge rather than produce two nodes or one wrong one.
+ *
+ * ## Four rules, in order of how much damage they prevent
+ *
+ * **1. Never invent a node.** An edge whose target cannot be resolved is
+ * dropped. It never becomes a stub node, however convenient that would be for
+ * traversal. On the prior-art graphs measured for this build, 52-60% of edges
+ * pointed at a non-existent target — `append` with in-degree 1,036, `get` with
+ * 973. Materialising those as nodes is how a graph acquires a thousand-way hub
+ * that every impact score then routes through.
+ *
+ * **2. Merge is order-independent.** DEC-012's third tie-break exists only for
+ * this. Without it, "which adapter ran first" leaks into every impact score, and
+ * the symptom is an unreproducible difference nobody can bisect.
+ *
+ * **3. Collisions are reported, not merged.** Two nodes sharing an id but
+ * disagreeing on type or language are not the same thing, and merging them pools
+ * the edges of two unrelated symbols. See DEC-024 — this is a live hazard in a
+ * polyglot monorepo, not a hypothetical one.
+ *
+ * **4. Nothing enters without passing the Normaliser.** The builder calls it
+ * rather than trusting its caller, because the batch-spanning `nodeExists` it
+ * needs — an edge may legitimately point into a sibling batch in the same build
+ * — can only be computed here.
+ */
+import { type IRBatch, type IREdge, type IRNode, type NodeType, type NormaliseOptions, type Rejection, type UnresolvedRef } from "@descryy/ir";
+/**
+ * Two nodes claimed the same id but are not the same thing.
+ *
+ * Reported rather than resolved. There is no correct merge — the ids are equal,
+ * so the graph has no way to represent them separately — and picking one
+ * silently is the corruption DEC-024 describes. Surfacing it puts the failure in
+ * §20.2's "not analysable" category, where a user can see it.
+ */
+export interface IdentityCollision {
+    readonly nodeId: string;
+    readonly kept: {
+        readonly type: string;
+        readonly language: string | null;
+        readonly producedBy: string;
+    };
+    readonly discarded: {
+        readonly type: string;
+        readonly language: string | null;
+        readonly producedBy: string;
+    };
+}
+/**
+ * How much of a workspace-scoped node type actually crossed a repository
+ * boundary, and how much only ever existed in one.
+ *
+ * Counted per *repository*, not per producer: two adapters in one repo agreeing
+ * on a node is a within-repo merge and is not what DEC-054's scope table exists
+ * to achieve.
+ */
+export interface JoinMetric {
+    readonly type: NodeType;
+    /** Distinct nodes of this type in the built graph. */
+    readonly total: number;
+    /** Of those, how many were supplied by more than one repository — the join. */
+    readonly joined: number;
+    /** Repositories in this build that emitted the type at all. */
+    readonly repos: readonly string[];
+    /** The identity scope each of those repositories resolved to, deduplicated. */
+    readonly scopes: readonly string[];
+}
+/**
+ * Something the build cannot call an error but must not pass over in silence.
+ *
+ * `NO_CROSS_REPO_JOIN` is the one that matters and the reason this list exists.
+ * A workspace id has to be byte-identical in every repository that shares it,
+ * and when it is not, nothing fails: every batch normalises, every node is
+ * well-formed, every edge resolves, and the two sides simply never meet. Zero
+ * joins, zero errors, zero warnings — which is why the zero itself has to be the
+ * warning.
+ */
+export interface BuildWarning {
+    readonly code: "NO_CROSS_REPO_JOIN";
+    readonly type: NodeType;
+    readonly detail: string;
+}
+export interface BuildResult {
+    readonly nodes: readonly IRNode[];
+    readonly edges: readonly IREdge[];
+    readonly unresolved: readonly UnresolvedRef[];
+    /** Everything the Normaliser turned away, per batch, with its typed reason. */
+    readonly rejections: readonly Rejection[];
+    /** Node ids more than one batch supplied. Normal and expected — this is the join. */
+    readonly mergedNodes: number;
+    /** Edge ids more than one batch supplied. DEC-012 resolved each. */
+    readonly mergedEdges: number;
+    readonly collisions: readonly IdentityCollision[];
+    /** Edges dropped because an endpoint resolved to nothing. Never stubbed. */
+    readonly droppedEdges: number;
+    /** Per workspace-scoped type, emitted by at least one repository in this build. */
+    readonly joins: readonly JoinMetric[];
+    readonly warnings: readonly BuildWarning[];
+}
+export interface BuildOptions {
+    /**
+     * Does a node with this id already exist in the store? An incremental build
+     * over one changed file legitimately points at nodes no batch in this build
+     * supplied.
+     */
+    readonly nodeExists?: (id: string) => boolean;
+    readonly confidenceCeilings?: NormaliseOptions["confidenceCeilings"];
+}
+/**
+ * Fold normalised batches into one graph.
+ *
+ * Pure: no store, no IO. The store is one consumer of the result, the
+ * conformance harness is another, and a builder that wrote as it went could be
+ * tested by neither without a database.
+ */
+export declare function buildGraph(batches: readonly IRBatch[], options?: BuildOptions): BuildResult;
+//# sourceMappingURL=build.d.ts.map

package/dist/graph/build.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../src/graph/build.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EAIL,KAAK,OAAO,EACZ,KAAK,MAAM,EACX,KAAK,MAAM,EACX,KAAK,QAAQ,EACb,KAAK,gBAAgB,EACrB,KAAK,SAAS,EACd,KAAK,aAAa,EACnB,MAAM,aAAa,CAAC;AAMrB;;;;;;;GAOG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IACxG,QAAQ,CAAC,SAAS,EAAE;QAClB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACjC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;KAC7B,CAAC;CACH;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,+EAA+E;IAC/E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+DAA+D;IAC/D,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,+EAA+E;IAC/E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,SAAS,aAAa,EAAE,CAAC;IAC9C,+EAA+E;IAC/E,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C,qFAAqF;IACrF,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,oEAAoE;IACpE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAClD,4EAA4E;IAC5E,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IACtC,QAAQ,CAAC,QAAQ,EAAE,SAAS,YAAY,EAAE,CAAC;CAC5C;AAED,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,CAAC;IAC9C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;CACtE;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,SAAS,OAAO,EAAE,EAAE,OAAO,GAAE,YAAiB,GAAG,WAAW,CA4L/F"}

package/dist/graph/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/graph/build.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EACL,cAAc,EACd,OAAO,EACP,2BAA2B,GAQ5B,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,mBAAmB,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEvE,MAAM,gBAAgB,GAA0B,IAAI,GAAG,CAAC,2BAA2B,CAAC,CAAC;AAoFrF;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,OAA2B,EAAE,UAAwB,EAAE;IAChF,MAAM,UAAU,GAAgB,EAAE,CAAC;IAEnC,4EAA4E;IAC5E,uEAAuE;IACvE,6EAA6E;IAC7E,4EAA4E;IAE5E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,OAAO,IAAI,EAAE,EAAE,KAAK,QAAQ;gBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IACrD,MAAM,UAAU,GAAG,CAAC,EAAU,EAAW,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;IAEhF,4EAA4E;IAE5E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;IACpD,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,6EAA6E;IAC7E,2EAA2E;IAC3E,qEAAqE;IACrE,mEAAmE;IACnE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAyB,CAAC;IACrD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEtD,8EAA8E;IAC9E,yEAAyE;IACzE,2EAA2E;IAC3E,4EAA4E;IAC5E,kBAAkB;IAClB,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzC,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC,aAAa,CACtD,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,SAAS,EAAE,CAC3C,CACF,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,gBAAgB,GAAqB;YACzC,UAAU;YACV,GAAG,CAAC,OAAO,CAAC,kBAAkB,KAAK,SAAS;gBAC1C,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,kBAAkB,EAAE,OAAO,CAAC,kBAAkB,EAAE,CAAC;SACxD,CAAC;QACF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;QACvD,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACtC,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI;YAAE,SAAS;QAEpC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACtC,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpC,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnC,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;gBACrE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAE7B,IAAI,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC1C,IAAI,QAAQ,KAAK,SAAS;oBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC/E,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAEhC,IAAI,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,MAAM,KAAK,SAAS;oBAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACjG,CAAC;YAED,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,IAAI,mBAAmB,CAAC,QAAQ,CAAC,KAAK,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChE,0DAA0D;gBAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACzC,UAAU,CAAC,IAAI,CAAC;oBACd,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;oBACrF,SAAS,EACP,MAAM,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;wBACnC,CAAC,CAAC;4BACE,IAAI,EAAE,QAAQ,CAAC,IAAI;4BACnB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;4BAC3B,UAAU,EAAE,QAAQ,CAAC,UAAU;yBAChC;wBACH,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE;iBAChF,CAAC,CAAC;gBACH,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC3B,SAAS;YACX,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC9C,WAAW,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACrB,SAAS;YACX,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC1C,WAAW,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YAC1C,yEAAyE;YACzE,wEAAwE;YACxE,sDAAsD;YACtD,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;YACzF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,+EAA+E;IAC/E,0EAA0E;IAC1E,yCAAyC;IAEzC,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,MAAM,IAAI,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACpC,YAAY,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,6EAA6E;IAE7E,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,QAAQ,GAAmB,EAAE,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,2BAA2B,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEjC,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACvF,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1D,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAElE,2EAA2E;QAC3E,sEAAsE;QACtE,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,oBAAoB;gBAC1B,IAAI;gBACJ,MAAM,EACJ,GAAG,KAAK,CAAC,MAAM,yBAAyB,IAAI,0BAA0B;oBACtE,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAC9F,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;wBAChB,CAAC,CAAC,wFAAwF;4BACxF,yFAAyF;wBAC3F,CAAC,CAAC,uEAAuE,CAAC;aAC/E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,gBAAgB;IAChB,MAAM,IAAI,GAAG,CAA2B,CAAI,EAAE,CAAI,EAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAExF,OAAO;QACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACrC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC7B,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CACvE;QACD,UAAU,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,aAAa,CACxD,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,CAC7C,CACF;QACD,UAAU;QACV,WAAW;QACX,WAAW;QACX,UAAU;QACV,YAAY;QACZ,KAAK;QACL,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/graph/cross-language.d.ts

@@ -0,0 +1,70 @@
+/**
+ * The cross-language declaration index — DEC-161.
+ *
+ * Runs **after** every adapter has produced its batch, over the batches
+ * themselves rather than inside any one adapter, because the target id an
+ * unresolved reference should join to is not something the referencing
+ * adapter can compute — it does not have the declaring language's source.
+ *
+ * ## Why the key is a string neither side derives from the other
+ *
+ * `UnresolvedRef.rawTarget` is what the referencing side's own source spells —
+ * a Java `import okhttp3.OkHttpClient;` cannot carry Kotlin's module or source
+ * set, because nothing in that line names either.
+ * `CrossLanguageDeclaration.qualifiedName` is the same kind of fact, stated by
+ * the *declaring* adapter about how an external reader would reach its node.
+ * Matching the two is a string comparison over two independently-computed
+ * facts, not a derivation of one from the other — which is what keeps this a
+ * resolver rather than a heuristic.
+ *
+ * ## Mutual declaration
+ *
+ * Two adapters resolve against each other only when each names the other as a
+ * peer (`CapabilityMatrix.crossLanguageNamespace`). A one-sided declaration —
+ * or two unrelated adapters that happen to pick the same namespace `id` by
+ * accident — resolves nothing. This is deliberate: equality-only comparison
+ * makes an accidental id collision silent otherwise, and that is the exact
+ * failure this mechanism exists to prevent, arriving through its own door if
+ * declaration were not mutual.
+ *
+ * ## Ambiguity is the normal case, not the exception
+ *
+ * More than one candidate for a `qualifiedName`, with no stated basis to
+ * choose between them, is reported and resolves nothing — precision over
+ * recall, and the same rule `dup-ids.mjs` enforces on plain node identity.
+ *
+ * ## Resolution and provenance
+ *
+ * Every resolved edge is stamped `resolution: 1` (R1 — a name match between
+ * two adapters, neither of which type-checked the other's file) and
+ * `producedBy: RESOLVER_PRODUCED_BY`. Neither adapter produced this edge, and
+ * attributing it to one would make that adapter's own precision figures
+ * answer for a join it did not make.
+ */
+import type { IRBatch, IREdge, UnresolvedRef } from "@descryy/ir";
+/** Stamped on every edge this pass mints. Neither adapter's own id, on purpose. */
+export declare const RESOLVER_PRODUCED_BY = "cross-language-resolver@1";
+export interface NamespaceDeclaration {
+    readonly id: string;
+    readonly peers: readonly string[];
+}
+/** More than one declared node answers to this `qualifiedName` inside a
+ *  matched namespace pair — refused rather than guessed. */
+export interface CrossLanguageAmbiguity {
+    readonly unresolved: UnresolvedRef;
+    readonly qualifiedName: string;
+    readonly candidateNodeIds: readonly string[];
+}
+export interface CrossLanguageResult {
+    readonly resolved: readonly IREdge[];
+    readonly ambiguous: readonly CrossLanguageAmbiguity[];
+}
+/**
+ * @param batches Every batch in this build, from every adapter.
+ * @param namespaceOf A batch's `producedBy` (`adapterId@version`) to its
+ *   declared namespace, if any. The caller supplies this because a
+ *   `CapabilityMatrix` is a per-adapter fact, not a per-batch one, and this
+ *   pass is deliberately kept ignorant of how an adapter is instantiated.
+ */
+export declare function resolveCrossLanguage(batches: readonly IRBatch[], namespaceOf: (producedBy: string) => NamespaceDeclaration | undefined): CrossLanguageResult;
+//# sourceMappingURL=cross-language.d.ts.map

package/dist/graph/cross-language.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-language.d.ts","sourceRoot":"","sources":["../../src/graph/cross-language.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AAEH,OAAO,KAAK,EAAY,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5E,mFAAmF;AACnF,eAAO,MAAM,oBAAoB,8BAA8B,CAAC;AAEhE,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED;4DAC4D;AAC5D,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC;IACnC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9C;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,SAAS,EAAE,SAAS,sBAAsB,EAAE,CAAC;CACvD;AAMD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,SAAS,OAAO,EAAE,EAC3B,WAAW,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,oBAAoB,GAAG,SAAS,GACpE,mBAAmB,CAqDrB"}

package/dist/graph/cross-language.js

@@ -0,0 +1,104 @@
+/**
+ * The cross-language declaration index — DEC-161.
+ *
+ * Runs **after** every adapter has produced its batch, over the batches
+ * themselves rather than inside any one adapter, because the target id an
+ * unresolved reference should join to is not something the referencing
+ * adapter can compute — it does not have the declaring language's source.
+ *
+ * ## Why the key is a string neither side derives from the other
+ *
+ * `UnresolvedRef.rawTarget` is what the referencing side's own source spells —
+ * a Java `import okhttp3.OkHttpClient;` cannot carry Kotlin's module or source
+ * set, because nothing in that line names either.
+ * `CrossLanguageDeclaration.qualifiedName` is the same kind of fact, stated by
+ * the *declaring* adapter about how an external reader would reach its node.
+ * Matching the two is a string comparison over two independently-computed
+ * facts, not a derivation of one from the other — which is what keeps this a
+ * resolver rather than a heuristic.
+ *
+ * ## Mutual declaration
+ *
+ * Two adapters resolve against each other only when each names the other as a
+ * peer (`CapabilityMatrix.crossLanguageNamespace`). A one-sided declaration —
+ * or two unrelated adapters that happen to pick the same namespace `id` by
+ * accident — resolves nothing. This is deliberate: equality-only comparison
+ * makes an accidental id collision silent otherwise, and that is the exact
+ * failure this mechanism exists to prevent, arriving through its own door if
+ * declaration were not mutual.
+ *
+ * ## Ambiguity is the normal case, not the exception
+ *
+ * More than one candidate for a `qualifiedName`, with no stated basis to
+ * choose between them, is reported and resolves nothing — precision over
+ * recall, and the same rule `dup-ids.mjs` enforces on plain node identity.
+ *
+ * ## Resolution and provenance
+ *
+ * Every resolved edge is stamped `resolution: 1` (R1 — a name match between
+ * two adapters, neither of which type-checked the other's file) and
+ * `producedBy: RESOLVER_PRODUCED_BY`. Neither adapter produced this edge, and
+ * attributing it to one would make that adapter's own precision figures
+ * answer for a join it did not make.
+ */
+/** Stamped on every edge this pass mints. Neither adapter's own id, on purpose. */
+export const RESOLVER_PRODUCED_BY = "cross-language-resolver@1";
+function isMutualPeer(a, b) {
+    return a.peers.includes(b.id) && b.peers.includes(a.id);
+}
+/**
+ * @param batches Every batch in this build, from every adapter.
+ * @param namespaceOf A batch's `producedBy` (`adapterId@version`) to its
+ *   declared namespace, if any. The caller supplies this because a
+ *   `CapabilityMatrix` is a per-adapter fact, not a per-batch one, and this
+ *   pass is deliberately kept ignorant of how an adapter is instantiated.
+ */
+export function resolveCrossLanguage(batches, namespaceOf) {
+    // One entry per batch that actually declared a namespace. A batch with no
+    // declaration contributes nothing to either side — it is neither a source
+    // of candidates nor a consumer of them.
+    const declaring = batches
+        .map((batch) => ({ batch, namespace: namespaceOf(batch.producedBy) }))
+        .filter((entry) => entry.namespace !== undefined);
+    // qualifiedName -> candidate node ids, scoped to ONE declaring batch at a
+    // time rather than pooled across batches sharing a namespace id — pooling
+    // would let two same-language batches silently stand in for each other,
+    // which is not a claim this pass is entitled to make.
+    const resolved = [];
+    const ambiguous = [];
+    for (const referencing of declaring) {
+        if (referencing.batch.unresolved.length === 0)
+            continue;
+        for (const ref of referencing.batch.unresolved) {
+            const candidates = [];
+            for (const declaringSide of declaring) {
+                if (declaringSide.batch === referencing.batch)
+                    continue;
+                if (!isMutualPeer(referencing.namespace, declaringSide.namespace))
+                    continue;
+                if (declaringSide.batch.crossLanguageDeclarations === undefined)
+                    continue;
+                for (const decl of declaringSide.batch.crossLanguageDeclarations) {
+                    if (decl.qualifiedName === ref.rawTarget)
+                        candidates.push(decl.nodeId);
+                }
+            }
+            if (candidates.length === 0)
+                continue; // Not this pass's failure to explain.
+            if (candidates.length > 1) {
+                ambiguous.push({ unresolved: ref, qualifiedName: ref.rawTarget, candidateNodeIds: candidates });
+                continue;
+            }
+            resolved.push({
+                from: ref.fromNodeId,
+                to: candidates[0],
+                type: ref.edgeType,
+                resolution: 1,
+                confidence: 1,
+                producedBy: RESOLVER_PRODUCED_BY,
+            });
+        }
+    }
+    return { resolved, ambiguous };
+}
+//# sourceMappingURL=cross-language.js.map

package/dist/graph/cross-language.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-language.js","sourceRoot":"","sources":["../../src/graph/cross-language.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AAIH,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAG,2BAA2B,CAAC;AAoBhE,SAAS,YAAY,CAAC,CAAuB,EAAE,CAAuB;IACpE,OAAO,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAA2B,EAC3B,WAAqE;IAErE,0EAA0E;IAC1E,0EAA0E;IAC1E,wCAAwC;IACxC,MAAM,SAAS,GAAG,OAAO;SACtB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;SACrE,MAAM,CACL,CAAC,KAAK,EAAgE,EAAE,CACtE,KAAK,CAAC,SAAS,KAAK,SAAS,CAChC,CAAC;IAEJ,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,sDAAsD;IACtD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,SAAS,GAA6B,EAAE,CAAC;IAE/C,KAAK,MAAM,WAAW,IAAI,SAAS,EAAE,CAAC;QACpC,IAAI,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAExD,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;YAEhC,KAAK,MAAM,aAAa,IAAI,SAAS,EAAE,CAAC;gBACtC,IAAI,aAAa,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK;oBAAE,SAAS;gBACxD,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAC5E,IAAI,aAAa,CAAC,KAAK,CAAC,yBAAyB,KAAK,SAAS;oBAAE,SAAS;gBAE1E,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,CAAC,yBAAyB,EAAE,CAAC;oBACjE,IAAI,IAAI,CAAC,aAAa,KAAK,GAAG,CAAC,SAAS;wBAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzE,CAAC;YACH,CAAC;YAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS,CAAC,sCAAsC;YAE7E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,CAAC,CAAC;gBAChG,SAAS;YACX,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,GAAG,CAAC,UAAU;gBACpB,EAAE,EAAE,UAAU,CAAC,CAAC,CAAE;gBAClB,IAAI,EAAE,GAAG,CAAC,QAA2B;gBACrC,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,oBAAoB;aACjC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,11 @@
+export { buildGraph } from "./build.ts";
+export type { BuildResult, BuildOptions, IdentityCollision } from "./build.ts";
+export { persistGraph } from "./persist.ts";
+export type { PersistResult } from "./persist.ts";
+export { preferIncoming, mergeEdge, mergeNode, corroborators, identityFingerprint, EDGE_MERGE_CONDITION, NODE_MERGE_CONDITION, } from "./merge.ts";
+export type { Mergeable } from "./merge.ts";
+export { resolveCrossLanguage, RESOLVER_PRODUCED_BY } from "./cross-language.ts";
+export type { NamespaceDeclaration, CrossLanguageAmbiguity, CrossLanguageResult } from "./cross-language.ts";
+export { applyRuntimeObservations, reapplyEarnedOverlays, observedEdges, edgeCorrections, recordEdgeCorrection, RUNTIME_ADAPTER_ID, RUNTIME_ADAPTER_VERSION, RUNTIME_PRODUCER, } from "./runtime-confirmation.ts";
+export type { Clock, EdgeCorrectionRow, ObservedEdgeRow, RuntimeConfirmationInput, RuntimeConfirmationResult, RuntimeObservationRefusal, StaleR4Observation, } from "./runtime-confirmation.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAE/E,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAElD,OAAO,EACL,cAAc,EACd,SAAS,EACT,SAAS,EACT,aAAa,EACb,mBAAmB,EACnB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,OAAO,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AACjF,YAAY,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAE7G,OAAO,EACL,wBAAwB,EACxB,qBAAqB,EACrB,aAAa,EACb,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,uBAAuB,EACvB,gBAAgB,GACjB,MAAM,2BAA2B,CAAC;AACnC,YAAY,EACV,KAAK,EACL,iBAAiB,EACjB,eAAe,EACf,wBAAwB,EACxB,yBAAyB,EACzB,yBAAyB,EACzB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,6 @@
+export { buildGraph } from "./build.js";
+export { persistGraph } from "./persist.js";
+export { preferIncoming, mergeEdge, mergeNode, corroborators, identityFingerprint, EDGE_MERGE_CONDITION, NODE_MERGE_CONDITION, } from "./merge.js";
+export { resolveCrossLanguage, RESOLVER_PRODUCED_BY } from "./cross-language.js";
+export { applyRuntimeObservations, reapplyEarnedOverlays, observedEdges, edgeCorrections, recordEdgeCorrection, RUNTIME_ADAPTER_ID, RUNTIME_ADAPTER_VERSION, RUNTIME_PRODUCER, } from "./runtime-confirmation.js";
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAGxC,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAG5C,OAAO,EACL,cAAc,EACd,SAAS,EACT,SAAS,EACT,aAAa,EACb,mBAAmB,EACnB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,oBAAoB,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAGjF,OAAO,EACL,wBAAwB,EACxB,qBAAqB,EACrB,aAAa,EACb,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,uBAAuB,EACvB,gBAAgB,GACjB,MAAM,2BAA2B,CAAC"}

package/dist/graph/merge.d.ts

@@ -0,0 +1,95 @@
+/**
+ * The merge policy — DEC-012.
+ *
+ * Two adapters finding the same relationship produce the same edge id, by
+ * construction: `hash(from, to, type)` deliberately excludes resolution,
+ * confidence and producer. On the prior-art graphs measured for this build, 30%
+ * of edges were exact duplicates, so this is the common path rather than an
+ * edge case.
+ *
+ * ## The rule
+ *
+ *   higher `resolution` wins
+ *   → tie: higher `confidence` wins
+ *   → tie: lexicographically smaller `producedBy` wins
+ *
+ * ## What the rule refuses to do
+ *
+ * **Confidence is never combined.** Two adapters each 0.8 confident does not
+ * make 0.96, or 0.8, or anything else — there is no evidence-combination model
+ * here, the two adapters are not independent observers, and inventing a formula
+ * would silently move every impact score in §12.4 with nothing in the output to
+ * show it happened. Corroboration is recorded as a fact (`attrs.corroboratedBy`)
+ * rather than folded into a number.
+ *
+ * The third tie-break exists only to make the result independent of the order
+ * batches arrive in. Lexicographic order is arbitrary; determinism is not.
+ *
+ * ## Why the rule is written twice
+ *
+ * The merge has to hold in two places: in memory, when the Graph Builder folds
+ * several batches together, and in SQL, when a later batch upserts onto an edge
+ * an earlier one already wrote. A rule enforced in only the first is not
+ * enforced at all, because the writer is reachable directly.
+ *
+ * So it appears as a TypeScript predicate and as a SQL `WHERE` fragment, side by
+ * side, with a differential test that runs the same case table through both.
+ * Two copies with a test that they agree beats one copy that only covers one of
+ * the two paths.
+ */
+import type { IREdge, IRNode } from "@descryy/ir";
+/** The fields the merge decides between. Both the graph and a stored row satisfy it. */
+export interface Mergeable {
+    readonly resolution: number;
+    readonly confidence: number;
+    readonly producedBy: string;
+}
+/**
+ * Should `incoming` replace `existing`?
+ *
+ * Strict: an exact tie on all three keeps what is already there, so re-ingesting
+ * the same batch is a no-op rather than a rewrite.
+ */
+export declare function preferIncoming(incoming: Mergeable, existing: Mergeable): boolean;
+/**
+ * The same rule as a SQL `WHERE` clause on an upsert's `DO UPDATE`.
+ *
+ * `excluded` is the incoming row, `edges` the one already stored — SQLite's
+ * upsert names them that way. Kept adjacent to `preferIncoming` on purpose:
+ * `merge.test.ts` runs one case table through both and fails if they disagree.
+ */
+export declare const EDGE_MERGE_CONDITION = "\n  excluded.resolution > edges.resolution\n  OR (excluded.resolution = edges.resolution AND excluded.confidence > edges.confidence)\n  OR (excluded.resolution = edges.resolution\n      AND excluded.confidence = edges.confidence\n      AND excluded.produced_by < edges.produced_by)\n";
+/** The same, for nodes. Nodes carry no confidence, so the middle key drops out. */
+export declare const NODE_MERGE_CONDITION = "\n  excluded.resolution > nodes.resolution\n  OR (excluded.resolution = nodes.resolution AND excluded.produced_by < nodes.produced_by)\n";
+/**
+ * Producers that corroborated a merged item, sorted and de-duplicated.
+ *
+ * DEC-012 records this instead of combining confidence. It is not decoration:
+ * "two independent adapters agree" is a materially different statement from "one
+ * adapter is fairly sure", and it is the only form in which the graph can carry
+ * that distinction without inventing an evidence model.
+ */
+export declare function corroborators(existing: Readonly<Record<string, unknown>> | undefined, ...producers: string[]): string[];
+/** Merge two edges that share an id. Returns the winner, carrying corroboration. */
+export declare function mergeEdge(incoming: IREdge, existing: IREdge): IREdge;
+/**
+ * Merge two nodes that share an id.
+ *
+ * Attributes are NOT unioned. `attrs` is language- and framework-specific detail
+ * (§11A.4), so pooling two adapters' attributes would produce a node describing
+ * a thing that does not exist. The winner's attrs are kept whole and the loser is
+ * recorded as a corroborator.
+ */
+export declare function mergeNode(incoming: IRNode, existing: IRNode): IRNode;
+/**
+ * The fields two nodes sharing an id must agree on.
+ *
+ * Compared as one opaque string rather than field by field. That is not only
+ * tidier: `n.language !== m.language` reads to the boundary lint as branching on
+ * a language, and the lint is right to be suspicious — the exception here is
+ * that this asks whether two nodes *disagree*, never which language either one
+ * is. Folding both fields into a fingerprint states that intent in the code
+ * rather than in a lint suppression.
+ */
+export declare function identityFingerprint(node: IRNode): string;
+//# sourceMappingURL=merge.d.ts.map