@aburi/diff 0.2.0 → 0.4.0

package/dist/index.mjs

@@ -1,1280 +1 @@
-import { RESERVED_LANGUAGE_IDS, computeWeaklyConnectedComponents, reconstructCallEdgesFromIR, serializeCanonical, trySymbolId } from "@aburi/core";
-
-//#region src/components.ts
-/**
-* §6.1 — Component diff. Component identity is `id`; when a Component is present in both
-* base and head with the same id, the three delta booleans describe which axes actually
-* moved (roots reshuffle, public API globs, or framework hint list). `modified` deltas
-* are intentionally absent from this diff (§5.2.3): fields are reported as before/after
-* pairs via the `changed[]` entries so consumers can render them without stringifying
-* arrays.
-*/
-function diffComponents(base, head) {
-	const baseById = /* @__PURE__ */ new Map();
-	for (const c of base) baseById.set(c.id, c);
-	const headById = /* @__PURE__ */ new Map();
-	for (const c of head) headById.set(c.id, c);
-	const added = [];
-	const removed = [];
-	const changed = [];
-	for (const [id, headComp] of headById) {
-		const baseComp = baseById.get(id);
-		if (baseComp === void 0) {
-			added.push(headComp);
-			continue;
-		}
-		const rootsChanged = !stringArraysEqual(baseComp.roots, headComp.roots);
-		const publicApiChanged = !stringArraysEqual(baseComp.publicApi ?? [], headComp.publicApi ?? []);
-		const frameworksChanged = !stringArraysEqual(baseComp.frameworks ?? [], headComp.frameworks ?? []);
-		if (rootsChanged || publicApiChanged || frameworksChanged) changed.push({
-			before: baseComp,
-			after: headComp,
-			delta: {
-				rootsChanged,
-				publicApiChanged,
-				frameworksChanged
-			}
-		});
-	}
-	for (const [id, baseComp] of baseById) if (!headById.has(id)) removed.push(baseComp);
-	sortById(added);
-	sortById(removed);
-	changed.sort((a, b) => a.after.id < b.after.id ? -1 : a.after.id > b.after.id ? 1 : 0);
-	return {
-		added,
-		removed,
-		changed
-	};
-}
-/**
-* §6.2 — Dependency diff. Identity is the composite `(from, to, via)` triple; direction
-* and effect changes are surfaced as an added + removed pair so `modified` is not part of
-* the schema (§6.2 tail).
-*/
-function diffDependencies(base, head) {
-	const baseKeys = /* @__PURE__ */ new Map();
-	for (const d of base) baseKeys.set(dependencyKey(d), d);
-	const headKeys = /* @__PURE__ */ new Map();
-	for (const d of head) headKeys.set(dependencyKey(d), d);
-	const added = [];
-	const removed = [];
-	for (const [key, dep] of headKeys) {
-		const b = baseKeys.get(key);
-		if (b === void 0) {
-			added.push(dep);
-			continue;
-		}
-		if (b.direction !== dep.direction || (b.effect ?? null) !== (dep.effect ?? null)) {
-			removed.push(b);
-			added.push(dep);
-		}
-	}
-	for (const [key, dep] of baseKeys) if (!headKeys.has(key)) removed.push(dep);
-	added.sort(compareDependencies);
-	removed.sort(compareDependencies);
-	return {
-		added,
-		removed
-	};
-}
-function dependencyKey(d) {
-	return `${d.from}::${d.to}::${d.via}`;
-}
-function compareDependencies(a, b) {
-	const keyA = dependencyKey(a);
-	const keyB = dependencyKey(b);
-	return keyA < keyB ? -1 : keyA > keyB ? 1 : 0;
-}
-function stringArraysEqual(a, b) {
-	if (a.length !== b.length) return false;
-	for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
-	return true;
-}
-function sortById(items) {
-	items.sort((a, b) => a.id < b.id ? -1 : a.id > b.id ? 1 : 0);
-}
-
-//#endregion
-//#region src/errors.ts
-var DiffError = class extends Error {
-	code;
-	value;
-	constructor(message, detail, options) {
-		super(message, options);
-		this.name = "DiffError";
-		this.code = detail.code;
-		this.value = detail.value;
-	}
-};
-
-//#endregion
-//#region src/delta.ts
-const DEFAULT_LINE_FUZZ = 2;
-const MAX_LINE_FUZZ = 10;
-const MIN_LINE_FUZZ = 0;
-/**
-* §5 — Compute the full per-Symbol delta between two paired Symbols. The three axis
-* booleans (`apiChanged` / `logicChanged` / `syntaxChanged`) come from fingerprint
-* comparison; the array deltas (`rules` / `effects` / `calls` / `decorators`) come from
-* identity-preserving diff with configurable line fuzz.
-*/
-function computeSymbolDelta(base, head, options = {}) {
-	const fuzz = validateLineFuzz(options.lineFuzz ?? 2);
-	const delta = {
-		apiChanged: base.fingerprint.api !== head.fingerprint.api,
-		logicChanged: base.fingerprint.logic !== head.fingerprint.logic,
-		syntaxChanged: base.fingerprint.syntax !== head.fingerprint.syntax,
-		componentChanged: (base.component ?? null) !== (head.component ?? null),
-		visibilityChanged: base.visibility !== head.visibility
-	};
-	delta.rules = diffRules(base.rules, head.rules, fuzz);
-	delta.effects = diffEffects(base.effects, head.effects);
-	delta.calls = diffCalls(base.calls, head.calls, fuzz);
-	delta.decorators = diffDecorators(base.decorators, head.decorators, fuzz);
-	delta.signature = diffSignature(base.signature ?? null, head.signature ?? null);
-	return delta;
-}
-/**
-* §5.2.1 range check. Loud on violation rather than silently clamping so a config typo
-* (`lineFuzz: 999`) or an upstream numeric bug (`NaN`, `Infinity`) surfaces at the diff
-* boundary instead of quietly rounding into a range that produces the wrong deltas.
-*/
-function validateLineFuzz(value) {
-	if (!Number.isFinite(value) || !Number.isInteger(value)) throw new DiffError(`config.diff.lineFuzz must be an integer in [${0}, ${10}]; got ${String(value)}.`, {
-		code: "invalid-line-fuzz",
-		value: String(value)
-	});
-	if (value < 0 || value > 10) throw new DiffError(`config.diff.lineFuzz must be within [${0}, ${10}]; got ${value}.`, {
-		code: "invalid-line-fuzz",
-		value: String(value)
-	});
-	return value;
-}
-/**
-* Two-index diff: build key-indexed maps for both sides, then classify each key into
-* `added` / `removed` / `modified`. Line-fuzzed identities are matched within tolerance
-* so cosmetic line shifts do not produce added/removed noise. `modified` only fires when
-* the identity key stays the same but the content differs.
-*/
-function differentiate(base, head, isEqual, lineFuzz) {
-	const added = [];
-	const removed = [];
-	const modified = [];
-	const consumedBase = /* @__PURE__ */ new Set();
-	for (const h of head) {
-		let matchIdx = -1;
-		for (let j = 0; j < base.length; j++) {
-			if (consumedBase.has(j)) continue;
-			const b = base[j];
-			if (b === void 0) continue;
-			if (b.key !== h.key) continue;
-			if (Math.abs(b.line - h.line) > lineFuzz) continue;
-			matchIdx = j;
-			break;
-		}
-		if (matchIdx === -1) {
-			added.push(h.item);
-			continue;
-		}
-		consumedBase.add(matchIdx);
-		const bmatch = base[matchIdx];
-		if (bmatch === void 0) continue;
-		if (!isEqual(bmatch.item, h.item)) modified.push(h.item);
-	}
-	for (let j = 0; j < base.length; j++) {
-		if (consumedBase.has(j)) continue;
-		const b = base[j];
-		if (b === void 0) continue;
-		removed.push(b.item);
-	}
-	return {
-		added,
-		removed,
-		modified
-	};
-}
-function diffRules(base, head, lineFuzz) {
-	const mapper = (r) => ({
-		item: r,
-		key: r.type,
-		line: r.line
-	});
-	return differentiate(base.map(mapper), head.map(mapper), rulesEqual, lineFuzz);
-}
-function rulesEqual(a, b) {
-	return a.type === b.type && (a.condition ?? null) === (b.condition ?? null) && (a.what ?? null) === (b.what ?? null) && (a.expr ?? null) === (b.expr ?? null) && (a.loopKind ?? null) === (b.loopKind ?? null);
-}
-function diffEffects(base, head) {
-	const mapper = (e) => ({
-		item: e,
-		key: `${e.id}::${e.target}`,
-		line: e.line ?? 0
-	});
-	return differentiate(base.map(mapper), head.map(mapper), effectsEqual, Number.POSITIVE_INFINITY);
-}
-function effectsEqual(a, b) {
-	return a.id === b.id && a.target === b.target && a.plugin === b.plugin && a.confidence === b.confidence;
-}
-function diffCalls(base, head, lineFuzz) {
-	const mapper = (c) => ({
-		item: c,
-		key: c.target,
-		line: c.line
-	});
-	return differentiate(base.map(mapper), head.map(mapper), callsEqual, lineFuzz);
-}
-function callsEqual(a, b) {
-	return a.target === b.target && (a.resolved ?? null) === (b.resolved ?? null);
-}
-/**
-* §5.2.2 — decorator diff. Identity is `name`; when the same-named decorator is present
-* on both sides within the line-fuzz window, the argument list determines whether the
-* entry is a modified pair or an implicit no-op.
-*/
-function diffDecorators(base, head, lineFuzz) {
-	const mapper = (d) => ({
-		item: d,
-		key: d.name,
-		line: d.line
-	});
-	return differentiate(base.map(mapper), head.map(mapper), decoratorsEqual, lineFuzz);
-}
-function decoratorsEqual(a, b) {
-	if (a.name !== b.name) return false;
-	if (a.arguments.length !== b.arguments.length) return false;
-	for (let i = 0; i < a.arguments.length; i++) if (a.arguments[i] !== b.arguments[i]) return false;
-	return true;
-}
-/**
-* §5.3 — signature delta. Three cases:
-* - both sides `null` → `null` (nothing to compare)
-* - exactly one side `null` → the present side is emitted verbatim as
-*   `added` (when only head has a signature) or `removed` (when only base has one);
-*   the three axis booleans compare the missing side against `false` defaults
-* - both sides non-null → per-list sub-deltas:
-*   - `inputs`: strict positional compare via `differentiate(..., lineFuzz: 0)` — index
-*     used as the line key so ordered parameter lists match position-for-position
-*   - `outputs`: positional compare (added/removed emitted when the arrays diverge at
-*     an index), no `modified` category
-*   - `throws`: unordered set diff — duplicates collapse per Set semantics
-*   - `async` / `generator` / `typeParameters` change flags follow the raw fields
-*/
-function diffSignature(base, head) {
-	if (base === null && head === null) return null;
-	if (base === null || head === null) {
-		const empty = {
-			added: [],
-			removed: [],
-			modified: []
-		};
-		const present = base ?? head;
-		if (present === null) return null;
-		const isBaseNull = base === null;
-		return {
-			inputs: isBaseNull ? {
-				added: [...present.inputs],
-				removed: [],
-				modified: []
-			} : {
-				added: [],
-				removed: [...present.inputs],
-				modified: []
-			},
-			outputs: isBaseNull ? {
-				added: [...present.outputs],
-				removed: [],
-				modified: []
-			} : {
-				added: [],
-				removed: [...present.outputs],
-				modified: []
-			},
-			throws: isBaseNull ? {
-				added: [...present.throws],
-				removed: [],
-				modified: []
-			} : {
-				added: [],
-				removed: [...present.throws],
-				modified: []
-			},
-			asyncChanged: (base?.async ?? false) !== (head?.async ?? false),
-			generatorChanged: (base?.generator ?? false) !== (head?.generator ?? false),
-			typeParametersChanged: !arraysEqual(base?.typeParameters ?? empty.added.map(String), head?.typeParameters ?? empty.added.map(String))
-		};
-	}
-	const inputMapper = (input, index) => ({
-		item: input,
-		key: `${index}:${input.name}`,
-		line: index
-	});
-	return {
-		inputs: differentiate(base.inputs.map(inputMapper), head.inputs.map(inputMapper), (a, b) => a.name === b.name && a.type === b.type, 0),
-		outputs: diffStringList(base.outputs, head.outputs),
-		throws: diffStringSet(base.throws, head.throws),
-		asyncChanged: base.async !== head.async,
-		generatorChanged: base.generator !== head.generator,
-		typeParametersChanged: !arraysEqual(base.typeParameters, head.typeParameters)
-	};
-}
-function diffStringList(base, head) {
-	const added = [];
-	const removed = [];
-	const max = Math.max(base.length, head.length);
-	for (let i = 0; i < max; i++) {
-		const b = i < base.length ? base[i] : void 0;
-		const h = i < head.length ? head[i] : void 0;
-		if (b === void 0 && h !== void 0) added.push(h);
-		else if (h === void 0 && b !== void 0) removed.push(b);
-		else if (b !== h) {
-			if (b !== void 0) removed.push(b);
-			if (h !== void 0) added.push(h);
-		}
-	}
-	return {
-		added,
-		removed,
-		modified: []
-	};
-}
-function diffStringSet(base, head) {
-	const setB = new Set(base);
-	const setH = new Set(head);
-	const added = [];
-	const removed = [];
-	for (const h of setH) if (!setB.has(h)) added.push(h);
-	for (const b of setB) if (!setH.has(b)) removed.push(b);
-	return {
-		added,
-		removed,
-		modified: []
-	};
-}
-function arraysEqual(a, b) {
-	if (a.length !== b.length) return false;
-	for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
-	return true;
-}
-
-//#endregion
-//#region src/signature.ts
-/**
-* §3.4.2 signatureSimilarity — averaged type-similarity across `inputs`, `outputs`, and
-* `throws`. Follows diff-algorithm.md §3.4.2:
-* - null + null    → 1.0 (both symbols are signature-less; nothing to compare)
-* - null + non-null (either side) → 0.0
-* - both non-null: mean of three subscores
-*
-* Subscores:
-* - inputs: ordered type-string equality rate (`i-th type equal` counts as 1, else 0)
-* - outputs: same shape, but outputs is an array of type strings
-* - throws: unordered set intersection over union
-*
-* Empty subarrays on both sides count as 1.0 (they are trivially equal); on one side only
-* they count as 0.0 (asymmetric information).
-*/
-function signatureSimilarity(base, head) {
-	const baseSig = base ?? null;
-	const headSig = head ?? null;
-	if (baseSig === null && headSig === null) return 1;
-	if (baseSig === null || headSig === null) return 0;
-	const inputsScore = compareOrderedTypes(baseSig.inputs.map((i) => i.type), headSig.inputs.map((i) => i.type));
-	const outputsScore = compareOrderedTypes(baseSig.outputs, headSig.outputs);
-	const throwsScore = compareUnorderedSet(baseSig.throws, headSig.throws);
-	return (inputsScore + outputsScore + throwsScore) / 3;
-}
-function compareOrderedTypes(a, b) {
-	if (a.length === 0 && b.length === 0) return 1;
-	if (a.length !== b.length) return 0;
-	let matches = 0;
-	for (let i = 0; i < a.length; i++) if (a[i] === b[i]) matches++;
-	return matches / a.length;
-}
-function compareUnorderedSet(a, b) {
-	if (a.length === 0 && b.length === 0) return 1;
-	const setA = new Set(a);
-	const setB = new Set(b);
-	let intersection = 0;
-	for (const t of setA) if (setB.has(t)) intersection++;
-	const union = setA.size + setB.size - intersection;
-	return union === 0 ? 1 : intersection / union;
-}
-
-//#endregion
-//#region src/similarity.ts
-/**
-* String similarity utilities dedicated to the diff engine. Kept in one file so the
-* name/signature/owner formulas are auditable side by side against diff-algorithm.md §3.4.
-*/
-/**
-* Tokenise a qualified name into normalised lowercase word segments. Splits on:
-* - camelCase / PascalCase boundaries (`fooBar` → `foo`, `Bar`)
-* - snake_case underscores (`foo_bar` → `foo`, `bar`)
-* - dotted namespaces (`ns.Class` → `ns`, `Class`)
-* - `::` static-method separator (`Class::method` → `Class`, `method`)
-* - runs of digits (`get2Users` → `get`, `2`, `Users`)
-*
-* The result is de-duplicated so `InvoiceService.createInvoice` collapses to
-* `["invoice", "service", "create"]` — Jaccard similarity relies on set semantics, so
-* repeated tokens must not double-count.
-*/
-function tokenizeName(input) {
-	const seen = /* @__PURE__ */ new Set();
-	const out = [];
-	for (const raw of input.split(/[.:_\-\s/]+/)) {
-		if (raw.length === 0) continue;
-		for (const piece of splitCamel(raw)) {
-			const norm = piece.toLowerCase();
-			if (norm.length === 0 || seen.has(norm)) continue;
-			seen.add(norm);
-			out.push(norm);
-		}
-	}
-	return out;
-}
-function splitCamel(word) {
-	const chunks = [];
-	let current = "";
-	for (const ch of word) {
-		if (current === "") {
-			current = ch;
-			continue;
-		}
-		if (isCamelBoundary(current.slice(-1), ch)) {
-			chunks.push(current);
-			current = ch;
-		} else current += ch;
-	}
-	if (current.length > 0) chunks.push(current);
-	return chunks;
-}
-function isCamelBoundary(prev, curr) {
-	const prevLower = prev >= "a" && prev <= "z";
-	const prevUpper = prev >= "A" && prev <= "Z";
-	const prevDigit = prev >= "0" && prev <= "9";
-	const currLower = curr >= "a" && curr <= "z";
-	const currUpper = curr >= "A" && curr <= "Z";
-	const currDigit = curr >= "0" && curr <= "9";
-	if (prevLower && currUpper) return true;
-	if ((prevLower || prevUpper) && currDigit) return true;
-	if (prevDigit && (currLower || currUpper)) return true;
-	return false;
-}
-/**
-* Jaccard similarity between two token multisets. Formula: |A ∩ B| / |A ∪ B|.
-* Empty on both sides returns 1.0 (both are "no tokens", which are equivalent for the
-* purpose of §3.4.1). Empty on one side only returns 0.0.
-*/
-function jaccard(a, b) {
-	if (a.length === 0 && b.length === 0) return 1;
-	if (a.length === 0 || b.length === 0) return 0;
-	const setA = new Set(a);
-	const setB = new Set(b);
-	let intersection = 0;
-	for (const t of setA) if (setB.has(t)) intersection++;
-	const union = setA.size + setB.size - intersection;
-	return intersection / union;
-}
-/** name-token Jaccard shortcut used by nameSimilarity and ownerSimilarity call sites. */
-function jaccardTokens(a, b) {
-	return jaccard(tokenizeName(a), tokenizeName(b));
-}
-/**
-* §3.4.1 — Jaccard over the tokens of the full qualified name. The last segment is not
-* given extra weight; the entire path contributes uniformly because the intersection is
-* what the score should reward.
-*/
-function nameSimilarity(baseName, headName) {
-	return jaccardTokens(baseName, headName);
-}
-/**
-* §3.4.6 — owner similarity: same as nameSimilarity but restricted to everything **before**
-* the last segment. Compensates for the R-8 same-name-different-class collision, where
-* `UserRepo.getUser` should not be pair-swapped with `AdminRepo.getUser`.
-*
-* Owner extraction:
-* - `Class::method` → `Class`
-* - `A.B.C.method` → `A.B.C`
-* - `topLevel`     → `` (empty)
-*
-* When both owners are empty (top-level functions), returns 1.0 because both live in the
-* same "no-owner" bucket. When one is empty and the other is not, returns 0.0 because the
-* two Symbols live in structurally different scopes.
-*/
-function ownerSimilarity(baseName, headName) {
-	const baseOwner = extractOwner(baseName);
-	const headOwner = extractOwner(headName);
-	if (baseOwner === "" && headOwner === "") return 1;
-	if (baseOwner === "" || headOwner === "") return 0;
-	return jaccardTokens(baseOwner, headOwner);
-}
-function extractOwner(qname) {
-	const staticIdx = qname.indexOf("::");
-	if (staticIdx >= 0) return qname.slice(0, staticIdx);
-	const lastDot = qname.lastIndexOf(".");
-	if (lastDot >= 0) return qname.slice(0, lastDot);
-	return "";
-}
-/** §3.4.1 tail note — used by drop-4.5 weak matcher and threshold lookup. */
-function lastSegment(qname) {
-	const staticIdx = qname.indexOf("::");
-	if (staticIdx >= 0) return qname.slice(staticIdx + 2);
-	const lastDot = qname.lastIndexOf(".");
-	if (lastDot >= 0) return qname.slice(lastDot + 1);
-	return qname;
-}
-
-//#endregion
-//#region src/match.ts
-/** Fingerprint for the 12-hex-char "everything zero" (i.e. dropped) canonical hash. */
-const ZERO_LOGIC_FP = "000000000000";
-/**
-* §3.1 — segments Symbols with identical `id` into paired matches. Runs first because it
-* is the highest-confidence signal (no heuristics, just hash lookup).
-*/
-function matchStageId(base, head) {
-	const headById = /* @__PURE__ */ new Map();
-	for (const s of head) headById.set(s.id, s);
-	const matched = [];
-	const remainingBase = [];
-	const usedHead = /* @__PURE__ */ new Set();
-	for (const b of base) {
-		const h = headById.get(b.id);
-		if (h !== void 0) {
-			matched.push({
-				base: b,
-				head: h,
-				rationale: "id-match"
-			});
-			usedHead.add(b.id);
-		} else remainingBase.push(b);
-	}
-	return {
-		matched,
-		remainingBase,
-		remainingHead: head.filter((h) => !usedHead.has(h.id))
-	};
-}
-/**
-* §3.2 — git rename detection. When a rename map is available (typical of ref-driven
-* scans), rewrite the base id with the head-side file path and look for a hit.
-*
-* The rewriter only touches the `file` portion of the id — the `<language>:` prefix and
-* the trailing `#<qualified-name>` segment stay unchanged so a moved file with the same
-* qualified name is picked up correctly. When a Symbol's file is not in the rename map,
-* it is left for later stages.
-*/
-function matchStageGitRename(remainingBase, remainingHead, renameMap) {
-	if (renameMap === null || renameMap.size === 0) return {
-		matched: [],
-		remainingBase: [...remainingBase],
-		remainingHead: [...remainingHead]
-	};
-	const headById = /* @__PURE__ */ new Map();
-	for (const h of remainingHead) headById.set(h.id, h);
-	const matched = [];
-	const usedHead = /* @__PURE__ */ new Set();
-	const remaining = [];
-	for (const b of remainingBase) {
-		const newPath = renameMap.get(b.source.file);
-		if (newPath === void 0) {
-			remaining.push(b);
-			continue;
-		}
-		const expectedId = rewriteIdFile(b.id, b.source.file, newPath);
-		const h = expectedId === null ? void 0 : headById.get(expectedId);
-		if (h === void 0 || usedHead.has(h.id)) {
-			remaining.push(b);
-			continue;
-		}
-		matched.push({
-			base: b,
-			head: h,
-			rationale: "git-rename"
-		});
-		usedHead.add(h.id);
-	}
-	return {
-		matched,
-		remainingBase: remaining,
-		remainingHead: remainingHead.filter((h) => !usedHead.has(h.id))
-	};
-}
-/**
-* Predict the id a base Symbol would carry after git moved its file. The second Symbol-id
-* derivation in the codebase after `makeSymbolId` itself, so it goes back through the same
-* constructor rather than re-concatenating the parts: `trySymbolId` rejects a rename target
-* the id grammar cannot express (a backslash path, say) instead of minting an id no head
-* Symbol can ever equal.
-*
-* Returns `null` for that case, and the unchanged id when no rename applies — the caller
-* treats a null the same way it treats a lookup miss, leaving the pair for stage 3.
-*/
-function rewriteIdFile(id, oldPath, newPath) {
-	const colon = id.indexOf(":");
-	const hash = id.indexOf("#");
-	if (colon < 0 || hash < 0 || hash < colon) return id;
-	if (id.slice(colon + 1, hash) !== oldPath) return id;
-	return trySymbolId({
-		language: id.slice(0, colon),
-		file: newPath,
-		qualifiedName: id.slice(hash + 1)
-	});
-}
-/**
-* §3.3 — group base Symbols by `fingerprint.logic` and match head Symbols whose logic
-* fingerprint is in the map. Two disambiguation branches:
-* - single candidate → paired with `logic-fingerprint`
-* - multiple candidates → best `nameSimilarity` wins if ≥ 0.85; otherwise leave both
-*   sides in remaining for stage 4 to re-evaluate
-*
-* Dropped symbols are excluded (§3.3 tail) — their logic fingerprint is the sentinel
-* `"000000000000"` and would collide with every other dropped Symbol in the workspace.
-* They flow to the stage-4.5 weak matcher instead.
-*/
-function matchStageLogicFingerprint(remainingBase, remainingHead) {
-	const logicMap = /* @__PURE__ */ new Map();
-	const carryBase = [];
-	for (const b of remainingBase) {
-		if (b.dropped || b.fingerprint.logic === ZERO_LOGIC_FP) {
-			carryBase.push(b);
-			continue;
-		}
-		const bucket = logicMap.get(b.fingerprint.logic) ?? [];
-		bucket.push(b);
-		logicMap.set(b.fingerprint.logic, bucket);
-	}
-	const matched = [];
-	const carryHead = [];
-	const usedBaseIds = /* @__PURE__ */ new Set();
-	for (const h of remainingHead) {
-		if (h.dropped || h.fingerprint.logic === ZERO_LOGIC_FP) {
-			carryHead.push(h);
-			continue;
-		}
-		const candidates = logicMap.get(h.fingerprint.logic);
-		if (candidates === void 0 || candidates.length === 0) {
-			carryHead.push(h);
-			continue;
-		}
-		if (candidates.length === 1) {
-			const only = candidates[0];
-			if (only === void 0) continue;
-			matched.push({
-				base: only,
-				head: h,
-				rationale: "logic-fingerprint"
-			});
-			usedBaseIds.add(only.id);
-			logicMap.delete(h.fingerprint.logic);
-			continue;
-		}
-		let best = null;
-		for (const c of candidates) {
-			const score = nameSimilarity(c.name, h.name);
-			if (best === null || score > best.score) best = {
-				symbol: c,
-				score
-			};
-		}
-		if (best !== null && best.score >= .85) {
-			matched.push({
-				base: best.symbol,
-				head: h,
-				rationale: "logic-fingerprint+name-disambiguation"
-			});
-			usedBaseIds.add(best.symbol.id);
-			const remainingBucket = candidates.filter((c) => c.id !== best?.symbol.id);
-			if (remainingBucket.length === 0) logicMap.delete(h.fingerprint.logic);
-			else logicMap.set(h.fingerprint.logic, remainingBucket);
-		} else carryHead.push(h);
-	}
-	const finalBase = [...carryBase];
-	for (const bucket of logicMap.values()) for (const b of bucket) if (!usedBaseIds.has(b.id)) finalBase.push(b);
-	return {
-		matched,
-		remainingBase: finalBase,
-		remainingHead: carryHead
-	};
-}
-/**
-* §3.4 — name + signature similarity with `(kind, signatureNullness)` bucket pre-filter.
-* `signatureNullness` distinguishes symbols with no signature (`interface`, `type`,
-* `class`) from callable ones so that a class body is never paired against a function.
-*
-* The composite score:
-*   0.5 * nameSimilarity + 0.3 * signatureSimilarity + 0.2 * ownerSimilarity
-*
-* §3.4.3 threshold table:
-* - 1-token name → 1.0 (unreachable → never paired; false-positive shield)
-* - 2-token name → 0.95 (strict, avoids `getUser` vs `getUsers`)
-* - default      → 0.85
-*
-* §3.4.3 tail — if both sides are signature-less, we skip pairing entirely because
-* signatureSimilarity always returns 1.0 for `null + null` and would flood the bucket with
-* false pairings.
-*/
-function matchStageNameSignature(remainingBase, remainingHead) {
-	const buckets = /* @__PURE__ */ new Map();
-	for (const b of remainingBase) {
-		if (b.dropped) continue;
-		const key = bucketKey(b);
-		const bucket = buckets.get(key) ?? [];
-		bucket.push(b);
-		buckets.set(key, bucket);
-	}
-	const matched = [];
-	const remainingHeadOut = [];
-	const usedBaseIds = /* @__PURE__ */ new Set();
-	for (const h of remainingHead) {
-		if (h.dropped) {
-			remainingHeadOut.push(h);
-			continue;
-		}
-		const key = bucketKey(h);
-		const bucket = buckets.get(key);
-		if (bucket === void 0 || bucket.length === 0) {
-			remainingHeadOut.push(h);
-			continue;
-		}
-		if ((h.signature === null || h.signature === void 0) && bucket.every((c) => c.signature === null || c.signature === void 0)) {
-			remainingHeadOut.push(h);
-			continue;
-		}
-		let best = null;
-		for (const c of bucket) {
-			const score = .5 * nameSimilarity(c.name, h.name) + .3 * signatureSimilarity(c.signature ?? null, h.signature ?? null) + .2 * ownerSimilarity(c.name, h.name);
-			if (best === null || score > best.score) best = {
-				symbol: c,
-				score
-			};
-		}
-		const threshold = thresholdFor(h.name);
-		if (best !== null && best.score >= threshold) {
-			matched.push({
-				base: best.symbol,
-				head: h,
-				rationale: "name-signature"
-			});
-			usedBaseIds.add(best.symbol.id);
-			buckets.set(key, bucket.filter((c) => c.id !== best?.symbol.id));
-		} else remainingHeadOut.push(h);
-	}
-	const remainingBaseOut = [];
-	for (const b of remainingBase) {
-		if (b.dropped) {
-			remainingBaseOut.push(b);
-			continue;
-		}
-		if (!usedBaseIds.has(b.id)) remainingBaseOut.push(b);
-	}
-	return {
-		matched,
-		remainingBase: remainingBaseOut,
-		remainingHead: remainingHeadOut
-	};
-}
-function bucketKey(s) {
-	const sig = s.signature === null || s.signature === void 0 ? "no-sig" : "has-sig";
-	return `${s.kind}::${sig}`;
-}
-function thresholdFor(qname) {
-	const tokens = tokenizeName(lastSegment(qname)).length;
-	if (tokens <= 1) return 1;
-	if (tokens === 2) return .95;
-	return .85;
-}
-/**
-* §3.4.5 — dropped-only weak matcher. For dropped Symbols the fingerprint is zeroed and
-* name/signature are the only remaining signals. Score is a coarse "did the last name
-* segment or file basename survive?" — if either half matches we pair (threshold 0.5).
-*
-* This is deliberately lax; diff-algorithm.md §3.4.5 already accepts that dropped Symbols live
-* outside the main IR review surface, so occasional false pairings only affect the
-* "Drop-rule variation" fold-out section in the Markdown projection.
-*/
-function matchStageDroppedWeak(remainingBase, remainingHead) {
-	const droppedBase = remainingBase.filter((s) => s.dropped);
-	const nonDroppedBase = remainingBase.filter((s) => !s.dropped);
-	const droppedHead = remainingHead.filter((s) => s.dropped);
-	const nonDroppedHead = remainingHead.filter((s) => !s.dropped);
-	const matched = [];
-	const usedBaseIds = /* @__PURE__ */ new Set();
-	const carryHead = [];
-	for (const h of droppedHead) {
-		let best = null;
-		for (const b of droppedBase) {
-			if (b.kind !== h.kind) continue;
-			if (usedBaseIds.has(b.id)) continue;
-			const nameHit = lastSegment(b.name) === lastSegment(h.name) ? 1 : 0;
-			const fileHit = basename(b.source.file) === basename(h.source.file) ? 1 : 0;
-			const score = .5 * nameHit + .5 * fileHit;
-			if (best === null || score > best.score) best = {
-				symbol: b,
-				score
-			};
-		}
-		if (best !== null && best.score >= .5) {
-			matched.push({
-				base: best.symbol,
-				head: h,
-				rationale: "dropped-weak-match"
-			});
-			usedBaseIds.add(best.symbol.id);
-		} else carryHead.push(h);
-	}
-	return {
-		matched,
-		remainingBase: [...nonDroppedBase, ...droppedBase.filter((b) => !usedBaseIds.has(b.id))],
-		remainingHead: [...nonDroppedHead, ...carryHead]
-	};
-}
-function basename(path) {
-	const slash = path.lastIndexOf("/");
-	return slash >= 0 ? path.slice(slash + 1) : path;
-}
-
-//#endregion
-//#region src/slice.ts
-/**
-* Slice View clustering pass — docs/design/slice-view.md §2, §4–§8.
-*
-* Groups the changed-Symbol set of a diff into weakly-connected components
-* over the union of base and head call edges. Emits a `SliceRecord[]` whose
-* cluster ids are `"slice:" + <smallest-member Symbol id>`, both `slices[]`
-* and each `members[]` sorted ascending.
-*
-* Pure function: `(changes, baseCallEdges, headCallEdges)` → `SliceRecord[]`.
-* Determinism, idempotence, input-order insensitivity, and locality are all
-* guaranteed — see `computeWeaklyConnectedComponents` in `@aburi/core`.
-*
-* Returns `[]` when no SymbolChange is Node-eligible per §4.1; callers should
-* still serialise the empty array — the Markdown projection omits the section
-* (§9.4 / §12.5) but the JSON always emits the key so consumers never
-* distinguish "field absent" from "no slices" (§11.2).
-*
-* Every returned record has passed `assertSliceRecordInvariant` (§7.4).
-*/
-function computeSlices(input) {
-	const nodeIds = collectNodeIds(input.changes);
-	if (nodeIds.length === 0) return [];
-	const nodeIdSet = new Set(nodeIds);
-	return computeWeaklyConnectedComponents(nodeIds, collectEdges(input.baseCallEdges, input.headCallEdges, nodeIdSet), (id) => id).map(makeSliceRecord);
-}
-const SLICE_ID_PREFIX = "slice:";
-/**
-* §7.1 — the single place production code derives a Slice id. Everything else
-* in `src/` either receives an id or renders one. (Tests spell the prefix out
-* literally on purpose: an expectation written in terms of the function under
-* test would agree with it no matter what it produced.)
-*
-* The cast is the one place a `SliceId` comes into existence. `SliceId` and
-* `SymbolId` are separate brands precisely so this concatenation cannot be
-* open-coded anywhere else: a bare `"slice:" + x` evaluates to `string`, which
-* `SliceRecord.id` no longer accepts.
-*/
-function sliceIdFor(anchor) {
-	return `${SLICE_ID_PREFIX}${anchor}`;
-}
-/**
-* Build one SliceRecord from an ascending-sorted component and check its own
-* post-condition before letting it out (§7.4 layer 1).
-*
-* The check is not defending against untrusted input — this function builds
-* the id itself, so the derivation clause is true by construction here and
-* only the two clauses about `members` can actually fire. Those are the point:
-* `members[0]` is the anchor only because `computeWeaklyConnectedComponents`
-* returns each component sorted ascending, a guarantee that lives one layer
-* down and is invisible from this file. If it ever stops holding, the diff
-* would otherwise keep emitting well-formed-looking SliceRecords naming the
-* wrong anchor. Here it fails instead.
-*/
-function makeSliceRecord(members) {
-	const anchor = members[0];
-	if (anchor === void 0) throw new DiffError("computeSlices: the clustering utility returned an empty component; every weakly-connected component contains at least the node that seeded it (slice-view.md §6).", { code: "slice-invariant-violated" });
-	const record = {
-		id: sliceIdFor(anchor),
-		members: [...members]
-	};
-	assertSliceRecordInvariant(record);
-	return record;
-}
-/**
-* §7.1 — the anchor of a Slice: its lexicographically smallest member.
-*
-* Answers from `members[0]`. `id` is derived from the anchor, so
-* reconstructing the anchor by stripping the `"slice:"` prefix is circular at
-* best and, for a record that broke the derivation, silently wrong: it would
-* name a Symbol that is not in the Slice. `id` is read here only to name the
-* offending record in the error message. Consumers that need the anchor call
-* this; consumers that need a label keep using `id` directly.
-*/
-function sliceAnchor(record) {
-	const anchor = record.members[0];
-	if (anchor === void 0) {
-		const violation = emptyMembersViolation(record.id);
-		throw new DiffError(violation.message, {
-			code: "slice-invariant-violated",
-			value: violation.subject
-		});
-	}
-	return anchor;
-}
-/**
-* Report which clause of the §7.1 / §8.2 invariant a value breaks, or `null`
-* when it is a well-formed `SliceRecord`. Non-throwing counterpart of
-* `assertSliceRecordInvariant`: the pass wants an exception, a schema
-* validator wants a verdict it can turn into its own error.
-*
-* Takes `unknown` rather than `SliceRecord` deliberately. §7.4 layer 2 points
-* this at documents written by third-party or older producers — data that has
-* not been type-checked by definition — so anything that assumed a well-typed
-* argument would crash on exactly the input it exists to reject.
-*/
-function sliceRecordViolation(value) {
-	if (typeof value !== "object" || value === null) return {
-		kind: "malformed-shape",
-		subject: "<not an object>",
-		message: `Expected a SliceRecord object; got ${value === null ? "null" : typeof value}.`
-	};
-	const { id, members } = value;
-	const subject = typeof id === "string" ? id : "<missing id>";
-	if (typeof id !== "string") return {
-		kind: "malformed-shape",
-		subject,
-		message: `SliceRecord ${subject}: id must be a string; got ${typeof id}.`
-	};
-	if (!Array.isArray(members) || members.some((member) => typeof member !== "string")) return {
-		kind: "malformed-shape",
-		subject,
-		message: `SliceRecord ${subject}: members must be an array of strings.`
-	};
-	const anchor = members[0];
-	if (anchor === void 0) return emptyMembersViolation(subject);
-	const reservedAnchor = reservedNamespaceOf(anchor);
-	if (reservedAnchor !== null) return {
-		kind: "anchor-in-reserved-namespace",
-		subject,
-		message: `SliceRecord anchor "${anchor}" uses the reserved language token "${reservedAnchor}", so its Slice id would repeat the prefix (ir-schema.md §3.5, slice-view.md §7.5).`
-	};
-	for (let i = 1; i < members.length; i++) {
-		const previous = members[i - 1];
-		const current = members[i];
-		if (previous < current) continue;
-		return {
-			kind: "members-unordered",
-			subject,
-			message: `SliceRecord ${subject}: members[] is not in strictly ascending order at index ${i} ("${current}" follows "${previous}"), so members[0] is not necessarily the anchor (slice-view.md §8.2 for the order, §11.1 for uniqueness).`
-		};
-	}
-	const expected = sliceIdFor(anchor);
-	if (id !== expected) return {
-		kind: "id-not-derived",
-		subject,
-		message: `SliceRecord id "${id}" is not derived from the anchor "${anchor}"; expected "${expected}" (slice-view.md §7.1).`
-	};
-	return null;
-}
-/** The reserved token an id opens with, or `null`. Shares the list `@aburi/core` enforces. */
-function reservedNamespaceOf(id) {
-	const colon = id.indexOf(":");
-	if (colon < 0) return null;
-	const token = id.slice(0, colon);
-	return RESERVED_LANGUAGE_IDS.has(token) ? token : null;
-}
-/** Single source of the empty-`members[]` wording, shared with `sliceAnchor`. */
-function emptyMembersViolation(subject) {
-	return {
-		kind: "members-empty",
-		subject,
-		message: `SliceRecord ${subject}: members[] is empty, so the Slice has no anchor (slice-view.md §11.1 requires at least one member).`
-	};
-}
-/**
-* Throwing form of `sliceRecordViolation`. Raised as a coded `DiffError` so
-* callers branch on `code` rather than parsing the message; which clause broke
-* is `SliceRecordViolation.kind`, for callers that need to tell them apart.
-*/
-function assertSliceRecordInvariant(record) {
-	const violation = sliceRecordViolation(record);
-	if (violation === null) return;
-	throw new DiffError(violation.message, {
-		code: "slice-invariant-violated",
-		value: violation.subject
-	});
-}
-/**
-* §4.1 Node selection: keep every SymbolChange whose status is
-* added / removed / changed / moved+changed / dropped-toggled. The identity
-* is the head-side Symbol id where present (added / changed / moved+changed /
-* dropped-toggled), the base-side id for removed. Pure moved and unchanged
-* (already stripped upstream) are excluded — §4.1 / §4.3.
-*
-* The returned array is deliberately not deduplicated: a well-formed
-* SymbolChange list from `buildDiff` never mentions the same Symbol id
-* twice, and Union-Find would coalesce any accidental duplicate anyway.
-*/
-function collectNodeIds(changes) {
-	const ids = [];
-	for (const change of changes) {
-		const id = nodeIdOf(change);
-		if (id === null) continue;
-		ids.push(id);
-	}
-	return ids;
-}
-function nodeIdOf(change) {
-	switch (change.status) {
-		case "added": return change.symbol.id;
-		case "removed": return change.symbol.id;
-		case "changed":
-		case "moved+changed":
-		case "dropped-toggled": return change.after.id;
-		case "moved": return null;
-	}
-}
-/**
-* §5.1 Edge selection: union of base and head, restricted to edges whose
-* BOTH endpoints are Nodes, canonicalised to `(u, v)` with `u < v` (self-
-* loops implicitly dropped). Multi-edges collapse naturally inside the WCC
-* primitive — no explicit dedup needed.
-*
-* The union is the load-bearing rule of §5.3: a controller that called an
-* old service in base and a new service in head needs both edges to land
-* all three Symbols in a single Slice.
-*/
-function collectEdges(baseEdges, headEdges, nodeIds) {
-	const pairs = [];
-	for (const edge of baseEdges) appendEdgeIfBothNodes(edge, nodeIds, pairs);
-	for (const edge of headEdges) appendEdgeIfBothNodes(edge, nodeIds, pairs);
-	return pairs;
-}
-function appendEdgeIfBothNodes(edge, nodeIds, out) {
-	if (!nodeIds.has(edge.from) || !nodeIds.has(edge.to)) return;
-	out.push([edge.from, edge.to]);
-}
-
-//#endregion
-//#region src/status.ts
-/**
-* §4 — determine which of the five statuses a matched pair falls into. `dropped-toggled`
-* has absolute priority: whenever `dropped` differs between base and head, every other
-* signal is ignored because the underlying fingerprint change is a consequence of the
-* drop-rule flip, not a genuine code edit (§4.1 rationale).
-*
-* "pathChanged" catches both physical file relocation AND in-file rename: any Symbol id
-* mismatch between base and head means the identifier moved, and DF9 ("method rename
-* (same file, same logic) → moved") relies on this. Stage-1 pairs cannot trigger the id branch
-* (they match by exact id), so this only affects stage-2+ pairings where the pair was
-* discovered via fingerprint or name/signature similarity.
-*/
-function classifyStatus(base, head) {
-	if (base.dropped !== head.dropped) return "dropped-toggled";
-	const pathChanged = base.source.file !== head.source.file || base.id !== head.id;
-	const fingerprintChanged = base.fingerprint.api !== head.fingerprint.api || base.fingerprint.logic !== head.fingerprint.logic || base.fingerprint.syntax !== head.fingerprint.syntax;
-	if (pathChanged && fingerprintChanged) return "moved+changed";
-	if (pathChanged) return "moved";
-	if (fingerprintChanged) return "changed";
-	return "unchanged";
-}
-function dropDirection(head) {
-	return head.dropped ? "to-dropped" : "to-kept";
-}
-
-//#endregion
-//#region src/diff.ts
-const DIFF_SCHEMA = "https://aburi.dev/schema/aburi.diff.v1.json";
-const DEFAULT_GENERATOR = {
-	name: "aburi",
-	version: "0.0.0"
-};
-/**
-* Top-level entry: run the 5-stage matcher, classify each pair, produce array deltas,
-* fold in Component / Dependency diffs, and assemble the `aburi.diff.v1` JSON projection.
-* The function is pure; write-to-disk is delegated to `writeCanonicalDiff` so callers can
-* pipe the result through additional steps (Markdown projection, `--fail-on` gate) before
-* serialisation.
-*/
-function buildDiff(input) {
-	assertIRShape(input.baseIR, "baseIR");
-	assertIRShape(input.headIR, "headIR");
-	ensureSchemasAgree(input.baseIR, input.headIR);
-	const stage1 = matchStageId(input.baseIR.symbols, input.headIR.symbols);
-	const stage2 = matchStageGitRename(stage1.remainingBase, stage1.remainingHead, input.gitRenames ?? null);
-	const stage3 = matchStageLogicFingerprint(stage2.remainingBase, stage2.remainingHead);
-	const stage4 = matchStageNameSignature(stage3.remainingBase, stage3.remainingHead);
-	const stage4_5 = matchStageDroppedWeak(stage4.remainingBase, stage4.remainingHead);
-	const pairs = [
-		...stage1.matched,
-		...stage2.matched,
-		...stage3.matched,
-		...stage4.matched,
-		...stage4_5.matched
-	];
-	const summary = {
-		added: 0,
-		removed: 0,
-		moved: 0,
-		movedChanged: 0,
-		changed: 0,
-		droppedToggled: 0,
-		unchanged: 0,
-		droppedAdded: 0,
-		droppedRemoved: 0,
-		componentsAdded: 0,
-		componentsRemoved: 0,
-		componentsChanged: 0,
-		depsAdded: 0,
-		depsRemoved: 0
-	};
-	const symbols = [];
-	for (const pair of pairs) {
-		const status = classifyStatus(pair.base, pair.head);
-		if (status === "unchanged") {
-			summary.unchanged++;
-			continue;
-		}
-		if (status === "dropped-toggled") {
-			summary.droppedToggled++;
-			symbols.push({
-				status: "dropped-toggled",
-				before: pair.base,
-				after: pair.head,
-				direction: dropDirection(pair.head)
-			});
-			continue;
-		}
-		if (status === "moved") {
-			summary.moved++;
-			symbols.push({
-				status: "moved",
-				before: pair.base,
-				after: pair.head,
-				rationale: pair.rationale
-			});
-			continue;
-		}
-		if (status === "changed") {
-			summary.changed++;
-			symbols.push({
-				status: "changed",
-				before: pair.base,
-				after: pair.head,
-				delta: computeSymbolDelta(pair.base, pair.head, input.delta ?? {})
-			});
-			continue;
-		}
-		summary.movedChanged++;
-		symbols.push({
-			status: "moved+changed",
-			before: pair.base,
-			after: pair.head,
-			rationale: pair.rationale,
-			delta: computeSymbolDelta(pair.base, pair.head, input.delta ?? {})
-		});
-	}
-	const finalRemainingHead = stage4_5.remainingHead;
-	const finalRemainingBase = stage4_5.remainingBase;
-	for (const h of finalRemainingHead) if (h.dropped) summary.droppedAdded++;
-	else {
-		summary.added++;
-		symbols.push({
-			status: "added",
-			symbol: h
-		});
-	}
-	for (const b of finalRemainingBase) if (b.dropped) summary.droppedRemoved++;
-	else {
-		summary.removed++;
-		symbols.push({
-			status: "removed",
-			symbol: b
-		});
-	}
-	const components = diffComponents(input.baseIR.components, input.headIR.components);
-	summary.componentsAdded = components.added.length;
-	summary.componentsRemoved = components.removed.length;
-	summary.componentsChanged = components.changed.length;
-	const dependencies = diffDependencies(input.baseIR.dependencies, input.headIR.dependencies);
-	summary.depsAdded = dependencies.added.length;
-	summary.depsRemoved = dependencies.removed.length;
-	symbols.sort(compareSymbolChange);
-	const slices = computeSlices({
-		changes: symbols,
-		baseCallEdges: reconstructCallEdgesFromIR(input.baseIR),
-		headCallEdges: reconstructCallEdgesFromIR(input.headIR)
-	});
-	return {
-		$schema: DIFF_SCHEMA,
-		generator: input.generator ?? DEFAULT_GENERATOR,
-		base: input.base,
-		head: input.head,
-		summary,
-		symbols,
-		components,
-		dependencies,
-		slices
-	};
-}
-/** §9.1 — refuse to diff across schema versions. */
-function ensureSchemasAgree(base, head) {
-	if (base.$schema !== head.$schema) throw new DiffError(`Base IR schema "${base.$schema}" does not match head IR schema "${head.$schema}"; a diff across schema versions is not supported.`, {
-		code: "schema-mismatch",
-		value: base.$schema
-	});
-}
-/**
-* Top-level shape check. Refuses to enter the 5-stage matcher when a caller hands in an
-* IR-shaped object that is missing one of the collections the matcher requires as an
-* array. Without this, a malformed `baseIR = { symbols: undefined, ... }` would crash
-* deep inside `matchStageId` with `TypeError: undefined is not iterable`, leaving the
-* root cause obscured. Not a full schema validation — just an entry-point smoke test.
-*/
-function assertIRShape(ir, name) {
-	if (ir === null || typeof ir !== "object") throw new DiffError(`${name} must be an IR object; got ${typeof ir}.`, {
-		code: "ir-shape-invalid",
-		value: name
-	});
-	if (typeof ir.$schema !== "string" || ir.$schema.length === 0) throw new DiffError(`${name}.$schema must be a non-empty schema URL.`, {
-		code: "ir-shape-invalid",
-		value: `${name}.$schema`
-	});
-	for (const field of [
-		"symbols",
-		"components",
-		"dependencies"
-	]) if (!Array.isArray(ir[field])) throw new DiffError(`${name}.${field} must be an array.`, {
-		code: "ir-shape-invalid",
-		value: `${name}.${field}`
-	});
-}
-/**
-* Deterministic ordering of the `symbols[]` output:
-* 1. by status (alphabetical) — pins added/changed/moved sections
-* 2. by the "reference" id (`after` for change/move/toggle, otherwise `symbol`)
-*
-* The result is stable byte-for-byte for equal inputs, matching the canonicalisation
-* guarantee the diff JSON must uphold when persisted to `out/diff.json`.
-*/
-function compareSymbolChange(a, b) {
-	if (a.status !== b.status) return a.status < b.status ? -1 : 1;
-	const idA = referenceId(a);
-	const idB = referenceId(b);
-	return idA < idB ? -1 : idA > idB ? 1 : 0;
-}
-function referenceId(change) {
-	if (change.status === "added" || change.status === "removed") return change.symbol.id;
-	return change.after.id;
-}
-/**
-* Byte-deterministic serialiser for a DiffResult. Delegates to `@aburi/core`
-* `serializeCanonical` so the sort order, NFC normalisation, and codepoint key sort are
-* shared with the IR side.
-*/
-function writeCanonicalDiff(diff, options = {}) {
-	return serializeCanonical(diff, options);
-}
-
-//#endregion
-export { DEFAULT_LINE_FUZZ, DiffError, MAX_LINE_FUZZ, MIN_LINE_FUZZ, assertSliceRecordInvariant, buildDiff, classifyStatus, computeSlices, computeSymbolDelta, diffComponents, diffDependencies, dropDirection, jaccard, jaccardTokens, lastSegment, matchStageDroppedWeak, matchStageGitRename, matchStageId, matchStageLogicFingerprint, matchStageNameSignature, nameSimilarity, ownerSimilarity, signatureSimilarity, sliceAnchor, sliceRecordViolation, tokenizeName, writeCanonicalDiff };
-//# sourceMappingURL=index.mjs.map
+import{DOCUMENT_SUBJECT as e,RESERVED_LANGUAGE_IDS as t,checkDocumentShape as n,computeWeaklyConnectedComponents as r,reconstructCallEdgesFromIR as i,serializeCanonical as a,trySymbolId as o}from"@aburi/core";var s=class extends Error{code;value;violations;constructor(e,t,n){super(e,n),this.name=`DiffError`,this.code=t.code,this.value=t.value,this.violations=t.violations}};function c(e,t){let n=new Map;for(let t of e)n.set(t.id,t);let r=new Map;for(let e of t)r.set(e.id,e);let i=[],a=[],o=[];for(let[e,t]of r){let r=n.get(e);if(r===void 0){i.push(t);continue}g(r,t)||o.push({before:r,after:t,delta:{rootsChanged:!b(r.roots,t.roots),publicApiChanged:!b(r.publicApi??[],t.publicApi??[]),frameworksChanged:!b(r.frameworks??[],t.frameworks??[])}})}for(let[e,t]of n)r.has(e)||a.push(t);return x(i),x(a),o.sort((e,t)=>e.after.id<t.after.id?-1:+(e.after.id>t.after.id)),{added:i,removed:a,changed:o}}function l(e){let t=new Map;for(let n of e.symbols)t.set(n.id,n.source.file);let n=new Map;for(let t of e.stats.skippedFiles??[])n.set(t.path,t.reason);return{symbolFiles:t,lostFiles:n}}function u(e,t,n){let r=new Map;for(let t of e)r.set(m(t),t);let i=new Map;for(let e of t)i.set(m(e),e);let a=[],o=[],s=[];for(let[e,t]of i){let i=r.get(e);if(i===void 0){let e=d(t,n.head,n.base);e.length>0?s.push({dependency:t,absentFrom:`base`,lostFiles:e}):a.push(t);continue}(i.direction!==t.direction||(i.effect??null)!==(t.effect??null))&&(o.push(i),a.push(t))}for(let[e,t]of r){if(i.has(e))continue;let r=d(t,n.base,n.head);r.length>0?s.push({dependency:t,absentFrom:`head`,lostFiles:r}):o.push(t)}return a.sort(h),o.sort(h),s.sort((e,t)=>h(e.dependency,t.dependency)),{added:a,removed:o,unknown:s}}function d(e,t,n){let r=new Map;for(let i of[e.from,e.to]){let e=t.symbolFiles.get(i);if(e===void 0)continue;let a=n.lostFiles.get(e);a!==void 0&&r.set(e,a)}return[...r.entries()].map(([e,t])=>({path:e,reason:t})).sort((e,t)=>e.path<t.path?-1:+(e.path>t.path))}const f=[`from`,`to`,`via`];function p(e){return e.join(`::`)}function m(e){return p(f.map(t=>e[t]))}function h(e,t){let n=m(e),r=m(t);return n<r?-1:+(n>r)}function g(e,t){return _(e,`base`)===_(t,`head`)}function _(e,t){try{return a(v(e),{format:`compact`})}catch(n){throw new s(`${t} components[id=${e.id}] cannot be compared: ${n instanceof Error?n.message:String(n)}`,{code:`ir-shape-invalid`,value:`components[id=${e.id}]`},{cause:n})}}function v(e){let t={...e};(t.description===null||t.description===void 0)&&delete t.description;for(let e of y){let n=t[e];(n===void 0||Array.isArray(n)&&n.length===0)&&delete t[e]}return t}const y=[`publicApi`,`frameworks`];function b(e,t){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n++)if(e[n]!==t[n])return!1;return!0}function x(e){e.sort((e,t)=>e.id<t.id?-1:+(e.id>t.id))}const S=2,ee=10,te=0;function C(e,t,n={}){let r=ne(n.lineFuzz??2),i={apiChanged:e.fingerprint.api!==t.fingerprint.api,logicChanged:e.fingerprint.logic!==t.fingerprint.logic,syntaxChanged:e.fingerprint.syntax!==t.fingerprint.syntax,componentChanged:(e.component??null)!==(t.component??null),visibilityChanged:e.visibility!==t.visibility};return i.rules=ae(e.rules,t.rules,r),i.effects=se(e.effects,t.effects),i.calls=le(e.calls,t.calls,r),i.decorators=de(e.decorators,t.decorators,r),i.signature=pe(e.signature??null,t.signature??null),i}function ne(e){if(!Number.isFinite(e)||!Number.isInteger(e))throw new s(`config.diff.lineFuzz must be an integer in [0, 10]; got ${String(e)}.`,{code:`invalid-line-fuzz`,value:String(e)});if(e<0||e>10)throw new s(`config.diff.lineFuzz must be within [0, 10]; got ${e}.`,{code:`invalid-line-fuzz`,value:String(e)});return e}function w(e,t,n,r){let i=new Set(e.map((e,t)=>t)),a=new Set(t.map((e,t)=>t)),o=new Map;for(let s of[!0,!1]){let c=(e,t)=>e.key===t.key&&Math.abs(e.line-t.line)<=r&&(!s||n(e.item,t.item));for(let[n,r]of ie(e,t,i,a,c)){i.delete(n),a.delete(r);let t=e[n];t!==void 0&&o.set(r,t)}}let s=[],c=[];for(let[e,r]of t.entries()){let t=o.get(e);t===void 0?s.push(r.item):n(t.item,r.item)||c.push(r.item)}return{added:s,removed:e.filter((e,t)=>i.has(t)).map(e=>e.item),modified:c}}const T={pairs:0,distance:0};function re(e,t){return e.pairs===t.pairs?e.distance<t.distance:e.pairs>t.pairs}function ie(e,t,n,r,i){let a=Array.from({length:e.length+1},()=>Array.from({length:t.length+1},()=>T)),o=(o,s)=>{let c=e[o],l=t[s];if(c===void 0||l===void 0||!n.has(o)||!r.has(s)||!i(c,l))return null;let u=a[o+1]?.[s+1]??T;return{pairs:u.pairs+1,distance:u.distance+Math.abs(c.line-l.line)}};for(let n=e.length-1;n>=0;n--)for(let e=t.length-1;e>=0;e--){let t=a[n+1]?.[e]??T,r=a[n]?.[e+1]??T,i=re(t,r)?t:r,s=o(n,e);s!==null&&re(s,i)&&(i=s);let c=a[n];c!==void 0&&(c[e]=i)}let s=[],c=0,l=0;for(;c<e.length&&l<t.length;){let e=a[c]?.[l]??T,t=o(c,l);if(t!==null&&t.pairs===e.pairs&&t.distance===e.distance){s.push([c,l]),c++,l++;continue}let n=a[c+1]?.[l]??T;n.pairs===e.pairs&&n.distance===e.distance?c++:l++}return s}function ae(e,t,n){let r=e=>({item:e,key:e.type,line:e.line});return w(e.map(r),t.map(r),oe,n)}function oe(e,t){return e.type===t.type&&(e.condition??null)===(t.condition??null)&&(e.what??null)===(t.what??null)&&(e.expr??null)===(t.expr??null)&&(e.loopKind??null)===(t.loopKind??null)}function se(e,t){let n=e=>({item:e,key:`${e.id}::${e.target}`,line:e.line??0});return w(e.map(n),t.map(n),ce,1/0)}function ce(e,t){return e.id===t.id&&e.target===t.target&&e.plugin===t.plugin&&e.confidence===t.confidence}function le(e,t,n){let r=e=>({item:e,key:e.target,line:e.line});return w(e.map(r),t.map(r),ue,n)}function ue(e,t){return e.target===t.target&&(e.resolved??null)===(t.resolved??null)}function de(e,t,n){let r=e=>({item:e,key:e.name,line:e.line});return w(e.map(r),t.map(r),fe,n)}function fe(e,t){if(e.name!==t.name||e.arguments.length!==t.arguments.length)return!1;for(let n=0;n<e.arguments.length;n++)if(e.arguments[n]!==t.arguments[n])return!1;return!0}function pe(e,t){if(e===null&&t===null)return null;if(e===null||t===null){let n={added:[],removed:[],modified:[]},r=e??t;if(r===null)return null;let i=e===null;return{inputs:i?{added:[...r.inputs],removed:[],modified:[]}:{added:[],removed:[...r.inputs],modified:[]},outputs:i?{added:[...r.outputs],removed:[],modified:[]}:{added:[],removed:[...r.outputs],modified:[]},throws:i?{added:[...r.throws],removed:[],modified:[]}:{added:[],removed:[...r.throws],modified:[]},asyncChanged:(e?.async??!1)!==(t?.async??!1),generatorChanged:(e?.generator??!1)!==(t?.generator??!1),typeParametersChanged:!ge(e?.typeParameters??n.added.map(String),t?.typeParameters??n.added.map(String))}}let n=(e,t)=>({item:e,key:`${t}:${e.name}`,line:t});return{inputs:w(e.inputs.map(n),t.inputs.map(n),(e,t)=>e.name===t.name&&e.type===t.type,0),outputs:me(e.outputs,t.outputs),throws:he(e.throws,t.throws),asyncChanged:e.async!==t.async,generatorChanged:e.generator!==t.generator,typeParametersChanged:!ge(e.typeParameters,t.typeParameters)}}function me(e,t){let n=[],r=[],i=Math.max(e.length,t.length);for(let a=0;a<i;a++){let i=a<e.length?e[a]:void 0,o=a<t.length?t[a]:void 0;i===void 0&&o!==void 0?n.push(o):o===void 0&&i!==void 0?r.push(i):i!==o&&(i!==void 0&&r.push(i),o!==void 0&&n.push(o))}return{added:n,removed:r,modified:[]}}function he(e,t){let n=new Set(e),r=new Set(t),i=[],a=[];for(let e of r)n.has(e)||i.push(e);for(let e of n)r.has(e)||a.push(e);return{added:i,removed:a,modified:[]}}function ge(e,t){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n++)if(e[n]!==t[n])return!1;return!0}function E(e,t){let n=e??null,r=t??null;if(n===null&&r===null)return 1;if(n===null||r===null)return 0;let i=D(n.inputs.map(e=>e.type),r.inputs.map(e=>e.type)),a=D(n.outputs,r.outputs),o=_e(n.throws,r.throws);return(i+a+o)/3}function D(e,t){if(e.length===0&&t.length===0)return 1;if(e.length!==t.length)return 0;let n=0;for(let r=0;r<e.length;r++)e[r]===t[r]&&n++;return n/e.length}function _e(e,t){if(e.length===0&&t.length===0)return 1;let n=new Set(e),r=new Set(t),i=0;for(let e of n)r.has(e)&&i++;let a=n.size+r.size-i;return a===0?1:i/a}function O(e){let t=new Set,n=[];for(let r of e.split(/[.:_\-\s/]+/))if(r.length!==0)for(let e of ve(r)){let r=e.toLowerCase();r.length===0||t.has(r)||(t.add(r),n.push(r))}return n}function ve(e){let t=[],n=``;for(let r of e){if(n===``){n=r;continue}ye(n.slice(-1),r)?(t.push(n),n=r):n+=r}return n.length>0&&t.push(n),t}function ye(e,t){let n=e>=`a`&&e<=`z`,r=e>=`A`&&e<=`Z`,i=e>=`0`&&e<=`9`,a=t>=`a`&&t<=`z`,o=t>=`A`&&t<=`Z`;return!!(n&&o||(n||r)&&t>=`0`&&t<=`9`||i&&(a||o))}function be(e,t){return k(new Set(e),new Set(t))}function k(e,t){if(e.size===0&&t.size===0)return 1;if(e.size===0||t.size===0)return 0;let[n,r]=e.size<=t.size?[e,t]:[t,e],i=0;for(let e of n)r.has(e)&&i++;return i/(e.size+t.size-i)}function xe(e,t){return be(O(e),O(t))}const A=e=>new Set(O(e));function Se(e,t){return j(A,e,t)}function Ce(e,t){return M(A,e,t)}function we(e,t){return De(A,e,t)}function Te(e,t){if(e===t)return!0;let[n,r]=e.length<=t.length?[e,t]:[t,e];return Ee(n,r)}function Ee(e,t){return t===`${e}s`||t===`${e}es`?!0:e.endsWith(`y`)&&t===`${e.slice(0,-1)}ies`}function j(e,t,n){return k(e(t),e(n))}function M(e,t,n){return k(e(R(t)),e(R(n)))}function De(e,t,n){let r=L(t),i=L(n);return r===``&&i===``?!0:r===``||i===``?!1:r===i?!0:N(r,i,e)}function N(e,t,n){let r=e.split(`.`),i=t.split(`.`);return r.length===i.length?r.every((e,t)=>{let r=i[t];return r===void 0?!1:e===r?!0:Oe(n(e),n(r))}):!1}function Oe(e,t){if(e.size!==t.size||e.size>32)return!1;let n=[...t],r=new Map;for(let t of e)if(!P(t,n,r,new Set))return!1;return!0}function P(e,t,n,r){for(let i of t){if(r.has(i)||!Te(e,i))continue;r.add(i);let a=n.get(i);if(a===void 0||P(a,t,n,r))return n.set(i,e),!0}return!1}function ke(e,t,n){let r=e.slice(0,F(e)),i=t.slice(0,F(t));if(r===i)return!0;let a=n(r),o=n(i);if(a.size!==o.size||a.size>32)return!1;for(let e of a){let t=!1;for(let n of o)if(Te(e,n)){t=!0;break}if(!t)return!1}return!0}function F(e){let t=e.indexOf(`.`);return t<0?e.length:t}function I(){let e=new Map,t=t=>{let n=e.get(t);if(n!==void 0)return n;let r=new Set(O(t));return e.set(t,r),r},n=new Map,r=e=>{let t=n.get(e);if(t!==void 0)return t;let r=L(e);return n.set(e,r),r};return{name:(e,n)=>j(t,e,n),member:(e,n)=>M(t,e,n),ownersCompatible:(e,n)=>{let i=r(e),a=r(n);return i===a?!0:i===``||a===``||!ke(i,a,t)?!1:N(i,a,t)}}}function L(e){let t=e.indexOf(`::`);if(t>=0)return e.slice(0,t);let n=e.lastIndexOf(`.`);return n>=0?e.slice(0,n):``}function R(e){let t=e.indexOf(`::`);if(t>=0)return e.slice(t+2);let n=e.lastIndexOf(`.`);return n>=0?e.slice(n+1):e}function z(e){e.sort(Ae);let t=new Set,n=new Set,r=[];for(let i of e)t.has(i.base.id)||n.has(i.head.id)||(t.add(i.base.id),n.add(i.head.id),r.push(i));return{pairs:r,baseIds:t,headIds:n}}function Ae(e,t){return e.score===t.score?e.base.id===t.base.id?e.head.id<t.head.id?-1:+(e.head.id>t.head.id):e.base.id<t.base.id?-1:1:t.score-e.score}function B(e,t){return e.filter(e=>!t.has(e.id))}function V(e,t){let n=new Map;for(let e of t)n.set(e.id,e);let r=[],i=[],a=new Set;for(let t of e){let e=n.get(t.id);e===void 0?i.push(t):(r.push({base:t,head:e,rationale:`id-match`}),a.add(t.id))}return{matched:r,remainingBase:i,remainingHead:t.filter(e=>!a.has(e.id))}}function H(e,t,n){if(n===null||n.size===0)return{matched:[],remainingBase:[...e],remainingHead:[...t]};let r=new Map;for(let e of t)r.set(e.id,e);let i=new Map;for(let t of e){let e=n.get(t.source.file);if(e===void 0)continue;let a=Me(t.id,t.source.file,e);if(a===null)continue;let o=r.get(a);if(o===void 0)continue;let s=i.get(a);s===void 0?i.set(a,{head:o,bases:[t]}):s.bases.push(t)}let a=[],o=new Set,s=new Set;for(let{head:e,bases:t}of i.values()){let n=je(t);a.push({base:n,head:e,rationale:`git-rename`}),o.add(n.id),s.add(e.id)}return{matched:a,remainingBase:B(e,o),remainingHead:B(t,s)}}function je(e){let t=e[0];for(let n of e)n.id<t.id&&(t=n);return t}function Me(e,t,n){let r=e.indexOf(`:`),i=e.indexOf(`#`);return r<0||i<0||i<r||e.slice(r+1,i)!==t?e:o({language:e.slice(0,r),file:n,qualifiedName:e.slice(i+1)})}function U(e,t){let n=W(e),r=W(t),i=I(),a=[];for(let[e,t]of r){let r=n.get(e);r!==void 0&&a.push(...Ne(r,t,i))}let o=new Set(a.map(e=>e.base.id)),s=new Set(a.map(e=>e.head.id));return{matched:a,remainingBase:B(e,o),remainingHead:B(t,s)}}function W(e){let t=new Map;for(let n of e){if(n.dropped||n.fingerprint.logic===`000000000000`)continue;let e=t.get(n.fingerprint.logic)??[];e.push(n),t.set(n.fingerprint.logic,e)}return t}function Ne(e,t,n){let r=[...e],i=[...t],a=[];for(;r.length>0&&i.length>0;){let e=r.length===1?r[0]:void 0;if(e!==void 0){let t=Pe(e,i,n);if(t===void 0)break;a.push({base:e,head:t,rationale:`logic-fingerprint`});break}let t=[];for(let e of r)for(let r of i){let i=n.name(e.name,r.name);i>=.85&&t.push({base:e,head:r,score:i})}let o=z(t);if(o.pairs.length===0)break;for(let{base:e,head:t}of o.pairs)a.push({base:e,head:t,rationale:`logic-fingerprint+name-disambiguation`});r=B(r,o.baseIds),i=B(i,o.headIds)}return a}function Pe(e,t,n){let r;for(let i of t){let t=n.name(e.name,i.name);if(r===void 0||t>r.score){r={head:i,score:t};continue}t===r.score&&i.id<r.head.id&&(r={head:i,score:t})}return r?.head}function G(e,t){let n=new Map;for(let t of e){if(t.dropped||!J(t.name))continue;let e=Fe(t),r=n.get(e)??{members:[],byToken:new Map},i=r.members.length;r.members.push(t);for(let e of q(t.name)){let t=r.byToken.get(e)??[];t.push(i),r.byToken.set(e,t)}n.set(e,r)}let r=new Map;for(let e of n.values())r.set(e,new Int32Array(e.members.length));let i=I(),a=[],o=0;for(let e of t){if(e.dropped||e.signature===null||e.signature===void 0||!J(e.name))continue;let t=n.get(Fe(e));if(t===void 0)continue;let s=Re(e.name),c=Ie(s),l=q(e.name),u=0;for(let e of l)u+=t.byToken.get(e)?.length??0;if(u>=t.members.length){for(let n of t.members)K(n,e,i,c,s,a);continue}let d=r.get(t);if(d!==void 0){o++;for(let n of l)for(let r of t.byToken.get(n)??[]){if(d[r]===o)continue;d[r]=o;let n=t.members[r];n!==void 0&&K(n,e,i,c,s,a)}}}let s=z(a);return{matched:s.pairs.map(({base:e,head:t})=>({base:e,head:t,rationale:`name-signature`})),remainingBase:B(e,s.baseIds),remainingHead:B(t,s.headIds)}}function K(e,t,n,r,i,a){let o=n.member(e.name,t.name);if(o<r||!n.ownersCompatible(e.name,t.name))return;let s=.5*o+.3*E(e.signature??null,t.signature??null)+.2*Le;s>=i&&a.push({base:e,head:t,score:s})}function Fe(e){let t=e.signature===null||e.signature===void 0?`no-sig`:`has-sig`;return`${e.kind}::${t}`}function Ie(e){return 2*(e-.5)}function q(e){let t=O(R(e));return t.length===0?[` none`]:t}const Le=1;function Re(e){let t=O(R(e)).length;return t<=1?1:t===2?.95:.85}function J(e){return O(e).length>1}function Y(e,t){let n=e.filter(e=>e.dropped),r=t.filter(e=>e.dropped),i=[];for(let e of[Ue,We])i.push(...Ve(n,r,e));let a=ze(i);return{matched:a.map(({base:e,head:t})=>({base:e,head:t,rationale:`dropped-weak-match`})),remainingBase:B(e,new Set(a.map(e=>e.base.id))),remainingHead:B(t,new Set(a.map(e=>e.head.id)))}}function ze(e){let t=[...e].sort(Be),n=new Map,r=new Map;for(let[e,i]of t.entries())X(n,i.base.id,e),X(r,i.head.id,e);let i=e=>{let i=t[e];return i===void 0?[]:[...n.get(i.base.id)??[],...r.get(i.head.id)??[]].filter(t=>t!==e)},a=t.map(()=>!1),o=[],s=e=>{let n=e,r=!0;for(;!a[n];){a[n]=!0;let e=t[n];r&&e!==void 0&&o.push(e),r=!r;let s=i(n).find(e=>a[e]===!1);if(s===void 0)return;n=s}};for(let[e]of t.entries())!a[e]&&i(e).length<=1&&s(e);for(let[e]of t.entries())a[e]||s(e);return o}function Be(e,t){return e.base.id===t.base.id?e.head.id<t.head.id?-1:+(e.head.id>t.head.id):e.base.id<t.base.id?-1:1}function X(e,t,n){let r=e.get(t);r===void 0?e.set(t,[n]):r.push(n)}function Ve(e,t,n){let r=He(e,n),i=He(t,n),a=[];for(let[e,t]of r){let n=i.get(e);n!==void 0&&a.push({base:t,head:n})}return a}function He(e,t){let n=new Map,r=new Set;for(let i of e){let e=t(i);if(!r.has(e)){if(n.has(e)){n.delete(e),r.add(e);continue}n.set(e,i)}}return n}function Ue(e){return`${e.kind}/${R(e.name)}`}function We(e){return`${e.kind}/${Ge(e.source.file)}`}function Ge(e){let t=e.lastIndexOf(`/`);return t>=0?e.slice(t+1):e}function Ke(e){let t=$e(e.changes);if(t.length===0)return[];let n=new Set(t);return r(t,tt(e.baseCallEdges,e.headCallEdges,n),e=>e).map(Je)}function qe(e){return`slice:${e}`}function Je(e){let t=e[0];if(t===void 0)throw new s(`computeSlices: the clustering utility returned an empty component; every weakly-connected component contains at least the node that seeded it (slice-view.md §6).`,{code:`slice-invariant-violated`});let n={id:qe(t),members:[...e]};return Z(n),n}function Ye(e){let t=e.members[0];if(t===void 0){let t=Qe(e.id);throw new s(t.message,{code:`slice-invariant-violated`,value:t.subject})}return t}function Xe(e){if(typeof e!=`object`||!e)return{kind:`malformed-shape`,subject:`<not an object>`,message:`Expected a SliceRecord object; got ${e===null?`null`:typeof e}.`};let{id:t,members:n}=e,r=typeof t==`string`?t:`<missing id>`;if(typeof t!=`string`)return{kind:`malformed-shape`,subject:r,message:`SliceRecord ${r}: id must be a string; got ${typeof t}.`};if(!Array.isArray(n)||n.some(e=>typeof e!=`string`))return{kind:`malformed-shape`,subject:r,message:`SliceRecord ${r}: members must be an array of strings.`};let i=n[0];if(i===void 0)return Qe(r);let a=Ze(i);if(a!==null)return{kind:`anchor-in-reserved-namespace`,subject:r,message:`SliceRecord anchor "${i}" uses the reserved language token "${a}", so its Slice id would repeat the prefix (ir-schema.md §3.5, slice-view.md §7.5).`};for(let e=1;e<n.length;e++){let t=n[e-1],i=n[e];if(!(t<i))return{kind:`members-unordered`,subject:r,message:`SliceRecord ${r}: members[] is not in strictly ascending order at index ${e} ("${i}" follows "${t}"), so members[0] is not necessarily the anchor (slice-view.md §8.2 for the order, §11.1 for uniqueness).`}}let o=qe(i);return t===o?null:{kind:`id-not-derived`,subject:r,message:`SliceRecord id "${t}" is not derived from the anchor "${i}"; expected "${o}" (slice-view.md §7.1).`}}function Ze(e){let n=e.indexOf(`:`);if(n<0)return null;let r=e.slice(0,n);return t.has(r)?r:null}function Qe(e){return{kind:`members-empty`,subject:e,message:`SliceRecord ${e}: members[] is empty, so the Slice has no anchor (slice-view.md §11.1 requires at least one member).`}}function Z(e){let t=Xe(e);if(t!==null)throw new s(t.message,{code:`slice-invariant-violated`,value:t.subject})}function $e(e){let t=[];for(let n of e){let e=et(n);e!==null&&t.push(e)}return t}function et(e){switch(e.status){case`added`:return e.symbol.id;case`removed`:return e.symbol.id;case`unknown`:return e.symbol.id;case`changed`:case`moved+changed`:case`dropped-toggled`:return e.after.id;case`moved`:return null}}function tt(e,t,n){let r=[];for(let t of e)nt(t,n,r);for(let e of t)nt(e,n,r);return r}function nt(e,t,n){!t.has(e.from)||!t.has(e.to)||n.push([e.from,e.to])}function rt(e,t){if(e.dropped!==t.dropped)return`dropped-toggled`;let n=e.source.file!==t.source.file||e.id!==t.id,r=e.fingerprint.api!==t.fingerprint.api||e.fingerprint.logic!==t.fingerprint.logic||e.fingerprint.syntax!==t.fingerprint.syntax;return n&&r?`moved+changed`:n?`moved`:r?`changed`:`unchanged`}function it(e){return e.dropped?`to-dropped`:`to-kept`}const at={name:`aburi`,version:`0.0.0`};function ot(e){ut(e.baseIR,`baseIR`),ut(e.headIR,`headIR`),ct(e.baseIR,e.headIR);let t=V(e.baseIR.symbols,e.headIR.symbols),n=H(t.remainingBase,t.remainingHead,e.gitRenames??null),r=U(n.remainingBase,n.remainingHead),a=G(r.remainingBase,r.remainingHead),o=Y(a.remainingBase,a.remainingHead),s=[...t.matched,...n.matched,...r.matched,...a.matched,...o.matched],d={unknown:0,depsUnknown:0,added:0,removed:0,moved:0,movedChanged:0,changed:0,droppedToggled:0,unchanged:0,droppedAdded:0,droppedRemoved:0,componentsAdded:0,componentsRemoved:0,componentsChanged:0,depsAdded:0,depsRemoved:0},f=0,p=[];for(let t of s){let n=rt(t.base,t.head);if(n===`unchanged`){d.unchanged++;continue}if(n===`dropped-toggled`){d.droppedToggled++,p.push({status:`dropped-toggled`,before:t.base,after:t.head,direction:it(t.head)});continue}if(n===`moved`){d.moved++,p.push({status:`moved`,before:t.base,after:t.head,rationale:t.rationale});continue}if(n===`changed`){d.changed++,p.push({status:`changed`,before:t.base,after:t.head,delta:C(t.base,t.head,e.delta??{})});continue}d.movedChanged++,p.push({status:`moved+changed`,before:t.base,after:t.head,rationale:t.rationale,delta:C(t.base,t.head,e.delta??{})})}let m=o.remainingHead,h=o.remainingBase,g=l(e.baseIR),_=l(e.headIR),v=_.lostFiles,y=g.lostFiles;for(let e of m){if(e.dropped){d.droppedAdded++;continue}let t=y.get(e.source.file);if(t!==void 0){f++,p.push({status:`unknown`,symbol:e,absentFrom:`base`,reason:t});continue}d.added++,p.push({status:`added`,symbol:e})}for(let e of h){if(e.dropped){d.droppedRemoved++;continue}let t=v.get(e.source.file);if(t!==void 0){f++,p.push({status:`unknown`,symbol:e,absentFrom:`head`,reason:t});continue}d.removed++,p.push({status:`removed`,symbol:e})}let b=c(e.baseIR.components,e.headIR.components);d.componentsAdded=b.added.length,d.componentsRemoved=b.removed.length,d.componentsChanged=b.changed.length;let x=u(e.baseIR.dependencies,e.headIR.dependencies,{base:g,head:_});d.depsAdded=x.added.length,d.depsRemoved=x.removed.length,d.depsUnknown=x.unknown.length,d.unknown=f,p.sort(ht);let S=Ke({changes:p,baseCallEdges:i(e.baseIR),headCallEdges:i(e.headIR)});return{$schema:`https://aburi.kage1020.com/schema/aburi.diff.v1.json`,generator:e.generator??at,base:e.base,head:e.head,summary:d,symbols:p,components:b,dependencies:x,slices:S,notCompared:st(y,v)}}function st(e,t){let n=[];for(let[r,i]of e){let e=t.get(r);e!==void 0&&n.push({path:r,baseReason:i,headReason:e})}return n.sort((e,t)=>e.path<t.path?-1:+(e.path>t.path))}function ct(e,t){if(e.$schema!==t.$schema)throw new s(`Base IR schema "${e.$schema}" does not match head IR schema "${t.$schema}"; a diff across schema versions is not supported.`,{code:`schema-mismatch`,value:e.$schema})}const Q=e=>e.join(``),lt=[{field:`symbols`,identityFields:[`id`],keyOf:Q,noun:`id`,show:Q,consequence:`stage 1 pairs Symbols by id and every later stage tracks the base Symbols it has consumed by id, so a repeat leaves one entry out of the diff entirely or classifies its counterpart twice (ir-schema.md §14 #1)`},{field:`components`,identityFields:[`id`],keyOf:Q,noun:`id`,show:Q,consequence:`Component identity is the id, so a repeat hides one entry and can report a change the two revisions do not contain (ir-schema.md §14 #2)`},{field:`dependencies`,identityFields:f,keyOf:p,noun:`(from, to, via) triple`,show:e=>`(${e.join(`, `)})`,consequence:`direction and effect are deliberately outside Dependency identity (§6.2), so a repeat surfaces as an added + removed pair no reader can tell from a real flip (ir-schema.md §14 #13)`}];function ut(e,t){let r=n(e),i=r[0];if(i!==void 0){let e=dt(t,i.subject),n=r.length-1,a=n>0?` (and ${n} more)`:``;throw new s(`${e}: ${i.message}${a}.`,{code:`ir-shape-invalid`,value:e,violations:r.map(e=>({...e,subject:dt(t,e.subject)}))})}if(e.$schema.length===0)throw $(t,`${t}: "$schema" is empty, not a schema URL.`);for(let n of lt)ft(e[n.field],`${t}.${n.field}`,n)}function dt(t,n){return n===e?t:`${t}.${n}`}function ft(e,t,n){if(!Array.isArray(e))throw $(t,`${t} must be an array.`);let r=new Map;for(let[i,a]of e.entries()){let e=`${t}[${i}]`,o=pt(a,e,n),c=n.keyOf(o),l=r.get(c);if(l===void 0){r.set(c,i);continue}let u=n.show(o);throw new s(`${e} repeats the ${n.noun} "${u}" first seen at index ${l}; ${n.consequence}.`,{code:`ir-identity-collision`,value:u})}}function pt(e,t,n){if(typeof e!=`object`||!e||Array.isArray(e))throw $(t,`${t} must be an object; got ${mt(e)}.`);let r=[];for(let i of n.identityFields){let n=e[i];if(typeof n!=`string`)throw $(`${t}.${i}`,`${t}.${i} must be a string; got ${mt(n)}.`);r.push(n)}return r}function $(e,t){return new s(t,{code:`ir-shape-invalid`,value:e})}function mt(e){return e===void 0?`undefined`:e===null?`null`:Array.isArray(e)?`an array`:`a ${typeof e}`}function ht(e,t){if(e.status!==t.status)return e.status<t.status?-1:1;let n=gt(e),r=gt(t);return n<r?-1:+(n>r)}function gt(e){return e.status===`added`||e.status===`removed`||e.status===`unknown`?e.symbol.id:e.after.id}function _t(e,t={}){return a(e,t)}export{S as DEFAULT_LINE_FUZZ,s as DiffError,ee as MAX_LINE_FUZZ,te as MIN_LINE_FUZZ,Z as assertSliceRecordInvariant,ot as buildDiff,rt as classifyStatus,Ke as computeSlices,C as computeSymbolDelta,l as dependencySideView,c as diffComponents,u as diffDependencies,it as dropDirection,be as jaccard,xe as jaccardTokens,R as lastSegment,Y as matchStageDroppedWeak,H as matchStageGitRename,V as matchStageId,U as matchStageLogicFingerprint,G as matchStageNameSignature,Ce as memberSimilarity,Se as nameSimilarity,we as ownersAreCompatible,E as signatureSimilarity,Ye as sliceAnchor,Xe as sliceRecordViolation,O as tokenizeName,_t as writeCanonicalDiff};