@lepid-labs/weft-core 0.1.0

package/dist/validate/rules/assertions.js

@@ -0,0 +1,149 @@
+export const ASSERT_VERSION_MISMATCH = {
+    id: "assert-version-mismatch",
+    description: "A link asserts a version its target no longer declares",
+    // The expensive one: a stale version pointer reads as current, and nothing
+    // about the document looks wrong to the reader acting on it.
+    defaultSeverity: "error",
+};
+export const ASSERT_LINE_COUNT_MISMATCH = {
+    id: "assert-line-count-mismatch",
+    description: "A link asserts a line count its target no longer has",
+    // A length claim drifts with every ordinary edit, so it warns rather than
+    // failing a build that is otherwise correct.
+    defaultSeverity: "warn",
+};
+export const ASSERT_MODIFIED_MISMATCH = {
+    id: "assert-modified-mismatch",
+    description: "A link asserts a modification date its target no longer matches",
+    defaultSeverity: "warn",
+};
+export const ASSERT_UNVERIFIABLE = {
+    id: "assert-unverifiable",
+    description: "A link asserts something that cannot be checked against its target",
+    // Not a mismatch — nothing is known to be wrong. But an assertion nobody can
+    // check is a check the author believes they have and does not.
+    defaultSeverity: "warn",
+};
+/** Properties a link may assert, for the message when it names something else. */
+const ASSERTABLE = ["version", "lineCount", "modified"];
+/** How far a `~N` line count may be off, as a fraction of the asserted value. */
+const APPROX_TOLERANCE = 0.1;
+function parseLineCount(asserted) {
+    if (typeof asserted === "number") {
+        return Number.isInteger(asserted) && asserted >= 0
+            ? { value: asserted, approximate: false }
+            : undefined;
+    }
+    if (typeof asserted !== "string")
+        return undefined;
+    const match = asserted.trim().match(/^(~?)\s*(\d+)$/);
+    return match ? { value: Number(match[2]), approximate: match[1] === "~" } : undefined;
+}
+function unverifiable(edge, property, asserted, reason, hint) {
+    return {
+        rule: ASSERT_UNVERIFIABLE.id,
+        message: `Cannot check the asserted ${property}: ${reason}`,
+        target: { kind: "edge", edge },
+        hint,
+        data: { property, asserted },
+    };
+}
+function mismatch(rule, edge, property, message, hint, asserted, actual) {
+    return {
+        rule: rule.id,
+        message,
+        target: { kind: "edge", edge },
+        hint,
+        data: { property, asserted, actual },
+    };
+}
+function checkVersion(edge, target, asserted) {
+    const claimed = String(asserted);
+    if (target.version === undefined) {
+        return unverifiable(edge, "version", claimed, `${target.id} declares no version`, "Add `version:` to the target's frontmatter, or drop the assertion.");
+    }
+    if (target.version === claimed)
+        return undefined;
+    return mismatch(ASSERT_VERSION_MISMATCH, edge, "version", `${target.id} is version ${target.version}, not ${claimed}`, `Update the assertion to ${target.version}, and check whether the surrounding prose cites the old version too.`, claimed, target.version);
+}
+function checkLineCount(edge, target, asserted) {
+    const claim = parseLineCount(asserted);
+    if (!claim) {
+        return unverifiable(edge, "lineCount", asserted, `${JSON.stringify(asserted)} is not a line count`, 'Write a whole number, or "~3500" to allow ten percent either way.');
+    }
+    const actual = target.lineCount;
+    if (actual === undefined) {
+        return unverifiable(edge, "lineCount", asserted, `${target.id} has no line count`, "Only a document Weft read from disk has one; a node an external tool declared may not.");
+    }
+    const satisfied = claim.approximate
+        ? Math.abs(actual - claim.value) <= claim.value * APPROX_TOLERANCE
+        : actual === claim.value;
+    if (satisfied)
+        return undefined;
+    return mismatch(ASSERT_LINE_COUNT_MISMATCH, edge, "lineCount", `${target.id} has ${actual} lines, not ${claim.approximate ? `~${claim.value}` : claim.value}`, `Update the assertion to ${actual}${claim.approximate ? `, or widen it to ~${actual}` : ""}.`, asserted, actual);
+}
+function checkModified(edge, target, asserted) {
+    const claimed = String(asserted);
+    if (!target.modified) {
+        return unverifiable(edge, "modified", claimed, `${target.id} has no modification date`, "Dates come from git history, so the file has to be committed and the project a repository.");
+    }
+    // A prefix, so "2026-07" asserts the month and a full timestamp asserts the
+    // instant. The alternative — parsing both sides into dates — would make
+    // "2026-07" mean midnight on the first, which is not what it says.
+    if (target.modified.startsWith(claimed))
+        return undefined;
+    const actual = target.modified.slice(0, 10);
+    return mismatch(ASSERT_MODIFIED_MISMATCH, edge, "modified", `${target.id} last changed ${actual}, which does not match ${claimed}`, `Update the assertion to ${actual}, or to a prefix of it.`, claimed, target.modified);
+}
+/**
+ * Check the claims links make about the documents they point at.
+ *
+ * A version cited across several documents is the most expensive thing in a
+ * documentation set to maintain by hand, because nothing signals when one goes
+ * stale: the claim was true when written, the prose still reads as current, and
+ * the discovery is accidental. This turns that into a build failure.
+ *
+ * Only assertions are checked here. Whether the link resolves at all belongs to
+ * the edge-resolution rules, so an edge whose target is missing or still pending
+ * is left to them rather than reported twice.
+ */
+export const assertionValidator = {
+    rules: [
+        ASSERT_VERSION_MISMATCH,
+        ASSERT_LINE_COUNT_MISMATCH,
+        ASSERT_MODIFIED_MISMATCH,
+        ASSERT_UNVERIFIABLE,
+    ],
+    run({ manifest, nodes }) {
+        const findings = [];
+        for (const edge of manifest.edges) {
+            if (!edge.asserts || edge.pending)
+                continue;
+            const target = nodes.get(edge.to.node);
+            if (!target)
+                continue;
+            for (const [property, asserted] of Object.entries(edge.asserts)) {
+                if (asserted === undefined || asserted === null)
+                    continue;
+                let finding;
+                switch (property) {
+                    case "version":
+                        finding = checkVersion(edge, target, asserted);
+                        break;
+                    case "lineCount":
+                        finding = checkLineCount(edge, target, asserted);
+                        break;
+                    case "modified":
+                        finding = checkModified(edge, target, asserted);
+                        break;
+                    default:
+                        finding = unverifiable(edge, property, asserted, `no node property is called ${property}`, `Assertable properties are ${ASSERTABLE.join(", ")}.`);
+                }
+                if (finding)
+                    findings.push(finding);
+            }
+        }
+        return findings;
+    },
+};
+//# sourceMappingURL=assertions.js.map

package/dist/validate/rules/assertions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assertions.js","sourceRoot":"","sources":["../../../src/validate/rules/assertions.ts"],"names":[],"mappings":"AAGA,MAAM,CAAC,MAAM,uBAAuB,GAAS;IAC5C,EAAE,EAAE,yBAAyB;IAC7B,WAAW,EAAE,wDAAwD;IACrE,2EAA2E;IAC3E,6DAA6D;IAC7D,eAAe,EAAE,OAAO;CACxB,CAAC;AAEF,MAAM,CAAC,MAAM,0BAA0B,GAAS;IAC/C,EAAE,EAAE,4BAA4B;IAChC,WAAW,EAAE,sDAAsD;IACnE,0EAA0E;IAC1E,6CAA6C;IAC7C,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,wBAAwB,GAAS;IAC7C,EAAE,EAAE,0BAA0B;IAC9B,WAAW,EAAE,iEAAiE;IAC9E,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAS;IACxC,EAAE,EAAE,qBAAqB;IACzB,WAAW,EAAE,oEAAoE;IACjF,6EAA6E;IAC7E,+DAA+D;IAC/D,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,kFAAkF;AAClF,MAAM,UAAU,GAAG,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;AAExD,iFAAiF;AACjF,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAS7B,SAAS,cAAc,CAAC,QAAiB;IACxC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAClC,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;YACjD,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE;YACzC,CAAC,CAAC,SAAS,CAAC;IACd,CAAC;IACD,IAAI,OAAO,QAAQ,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAEnD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;IACtD,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACvF,CAAC;AAED,SAAS,YAAY,CACpB,IAAc,EACd,QAAgB,EAChB,QAAiB,EACjB,MAAc,EACd,IAAY;IAEZ,OAAO;QACN,IAAI,EAAE,mBAAmB,CAAC,EAAE;QAC5B,OAAO,EAAE,6BAA6B,QAAQ,KAAK,MAAM,EAAE;QAC3D,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;QAC9B,IAAI;QACJ,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE;KAC5B,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAChB,IAAU,EACV,IAAc,EACd,QAAgB,EAChB,OAAe,EACf,IAAY,EACZ,QAAiB,EACjB,MAAe;IAEf,OAAO;QACN,IAAI,EAAE,IAAI,CAAC,EAAE;QACb,OAAO;QACP,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;QAC9B,IAAI;QACJ,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE;KACpC,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,IAAc,EAAE,MAAgB,EAAE,QAAiB;IACxE,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAEjC,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,YAAY,CAClB,IAAI,EACJ,SAAS,EACT,OAAO,EACP,GAAG,MAAM,CAAC,EAAE,sBAAsB,EAClC,oEAAoE,CACpE,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,OAAO,KAAK,OAAO;QAAE,OAAO,SAAS,CAAC;IAEjD,OAAO,QAAQ,CACd,uBAAuB,EACvB,IAAI,EACJ,SAAS,EACT,GAAG,MAAM,CAAC,EAAE,eAAe,MAAM,CAAC,OAAO,SAAS,OAAO,EAAE,EAC3D,2BAA2B,MAAM,CAAC,OAAO,sEAAsE,EAC/G,OAAO,EACP,MAAM,CAAC,OAAO,CACd,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,IAAc,EAAE,MAAgB,EAAE,QAAiB;IAC1E,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACZ,OAAO,YAAY,CAClB,IAAI,EACJ,WAAW,EACX,QAAQ,EACR,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,sBAAsB,EACjD,mEAAmE,CACnE,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC;IAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,YAAY,CAClB,IAAI,EACJ,WAAW,EACX,QAAQ,EACR,GAAG,MAAM,CAAC,EAAE,oBAAoB,EAChC,wFAAwF,CACxF,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW;QAClC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,gBAAgB;QAClE,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC;IAC1B,IAAI,SAAS;QAAE,OAAO,SAAS,CAAC;IAEhC,OAAO,QAAQ,CACd,0BAA0B,EAC1B,IAAI,EACJ,WAAW,EACX,GAAG,MAAM,CAAC,EAAE,QAAQ,MAAM,eAAe,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,EAC9F,2BAA2B,MAAM,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,qBAAqB,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAC7F,QAAQ,EACR,MAAM,CACN,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAc,EAAE,MAAgB,EAAE,QAAiB;IACzE,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAEjC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QACtB,OAAO,YAAY,CAClB,IAAI,EACJ,UAAU,EACV,OAAO,EACP,GAAG,MAAM,CAAC,EAAE,2BAA2B,EACvC,4FAA4F,CAC5F,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,wEAAwE;IACxE,mEAAmE;IACnE,IAAI,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,SAAS,CAAC;IAE1D,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC5C,OAAO,QAAQ,CACd,wBAAwB,EACxB,IAAI,EACJ,UAAU,EACV,GAAG,MAAM,CAAC,EAAE,iBAAiB,MAAM,0BAA0B,OAAO,EAAE,EACtE,2BAA2B,MAAM,yBAAyB,EAC1D,OAAO,EACP,MAAM,CAAC,QAAQ,CACf,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAc;IAC5C,KAAK,EAAE;QACN,uBAAuB;QACvB,0BAA0B;QAC1B,wBAAwB;QACxB,mBAAmB;KACnB;IAED,GAAG,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE;QACtB,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;gBAAE,SAAS;YAE5C,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI;oBAAE,SAAS;gBAE1D,IAAI,OAA4B,CAAC;gBACjC,QAAQ,QAAQ,EAAE,CAAC;oBAClB,KAAK,SAAS;wBACb,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;wBAC/C,MAAM;oBACP,KAAK,WAAW;wBACf,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;wBACjD,MAAM;oBACP,KAAK,UAAU;wBACd,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;wBAChD,MAAM;oBACP;wBACC,OAAO,GAAG,YAAY,CACrB,IAAI,EACJ,QAAQ,EACR,QAAQ,EACR,8BAA8B,QAAQ,EAAE,EACxC,6BAA6B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CACrD,CAAC;gBACJ,CAAC;gBAED,IAAI,OAAO;oBAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;CACD,CAAC"}

package/dist/validate/rules/duplicates.d.ts

@@ -0,0 +1,20 @@
+import type { Rule, Validator } from "../types.js";
+export declare const NODE_DUPLICATE: Rule;
+export declare const NODE_DIVERGED: Rule;
+/**
+ * Report copies of one document, both while they still agree and once they
+ * have stopped.
+ *
+ * Two halves, because a copy is a different problem before and after it drifts.
+ * Identical copies are found by comparing current content hashes. Diverged ones
+ * cannot be — the moment two files differ they no longer share a hash, so a
+ * check built only on that goes silent exactly when the problem appears. Git
+ * blobs answer the question the hashes no longer can: these two paths held the
+ * same content once, and do not now.
+ *
+ * Both halves read only nodes that reached the manifest, so `ignore` is already
+ * respected and a build output directory excluded from indexing cannot make
+ * every document in the project look like a copy of itself.
+ */
+export declare const duplicateValidator: Validator;
+//# sourceMappingURL=duplicates.d.ts.map

package/dist/validate/rules/duplicates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicates.d.ts","sourceRoot":"","sources":["../../../src/validate/rules/duplicates.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAyB,IAAI,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE1E,eAAO,MAAM,cAAc,EAAE,IAO5B,CAAC;AAEF,eAAO,MAAM,aAAa,EAAE,IAM3B,CAAC;AA4BF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,kBAAkB,EAAE,SAgChC,CAAC"}

package/dist/validate/rules/duplicates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicates.js","sourceRoot":"","sources":["../../../src/validate/rules/duplicates.ts"],"names":[],"mappings":"AAGA,MAAM,CAAC,MAAM,cAAc,GAAS;IACnC,EAAE,EAAE,gBAAgB;IACpB,WAAW,EAAE,6DAA6D;IAC1E,8EAA8E;IAC9E,8EAA8E;IAC9E,sBAAsB;IACtB,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAS;IAClC,EAAE,EAAE,eAAe;IACnB,WAAW,EAAE,4DAA4D;IACzE,2EAA2E;IAC3E,sEAAsE;IACtE,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,mEAAmE;AACnE,SAAS,QAAQ,CAChB,KAAyB,EACzB,MAAmD;IAEnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAe,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,GAAG;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;;gBACtB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;IACF,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAChC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,SAAS,QAAQ,CAAC,GAAa;IAC9B,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAc;IAC5C,KAAK,EAAE,CAAC,cAAc,EAAE,aAAa,CAAC;IACtC,YAAY,EAAE,IAAI;IAElB,GAAG,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE;QAC/B,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CACnD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CACjD,CAAC;QAEF,uEAAuE;QACvE,yCAAyC;QACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,cAAc,CAAC,EAAE;gBACvB,OAAO,EAAE,wBAAwB,GAAG,CAAC,MAAM,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAClF,+DAA+D;gBAC/D,iEAAiE;gBACjE,oBAAoB;gBACpB,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;gBACzB,IAAI,EAAE,4FAA4F;gBAClG,IAAI,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;aACnD,CAAC,CAAC;QACJ,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;QACjE,OAAO,QAAQ,CAAC;IACjB,CAAC;CACD,CAAC;AAEF,SAAS,QAAQ,CAChB,GAAe,EACf,KAAoC,EACpC,OAAqB,EACrB,IAAiB;IAEjB,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC1B,uEAAuE;QACvE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAE5B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;QACpE,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QAE9B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,QAAQ,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,aAAa,CAAC,EAAE;YACtB,OAAO,EAAE,kCAAkC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACvE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;YACzB,IAAI,EAAE,mFAAmF;YACzF,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;SACtC,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC"}

package/dist/validate/rules/edge-resolution.d.ts

@@ -0,0 +1,15 @@
+import type { Rule, Validator } from "../types.js";
+export declare const EDGE_TARGET_MISSING: Rule;
+export declare const EDGE_ANCHOR_MISSING: Rule;
+export declare const EDGE_SOURCE_ANCHOR_MISSING: Rule;
+export declare const EDGE_PENDING: Rule;
+export declare const EDGE_PENDING_RESOLVED: Rule;
+/**
+ * Check that every edge resolves against the graph it belongs to.
+ *
+ * Nothing new is extracted here — this is a set difference over the built
+ * manifest. `edge.to.node` must be a node, and `edge.to.anchor` must be one of
+ * that node's anchors.
+ */
+export declare const edgeResolutionValidator: Validator;
+//# sourceMappingURL=edge-resolution.d.ts.map

package/dist/validate/rules/edge-resolution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-resolution.d.ts","sourceRoot":"","sources":["../../../src/validate/rules/edge-resolution.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAW,IAAI,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE5D,eAAO,MAAM,mBAAmB,EAAE,IAIjC,CAAC;AAEF,eAAO,MAAM,mBAAmB,EAAE,IAIjC,CAAC;AAEF,eAAO,MAAM,0BAA0B,EAAE,IAIxC,CAAC;AAEF,eAAO,MAAM,YAAY,EAAE,IAI1B,CAAC;AAEF,eAAO,MAAM,qBAAqB,EAAE,IAInC,CAAC;AAiDF;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB,EAAE,SAsHrC,CAAC"}

package/dist/validate/rules/edge-resolution.js

@@ -0,0 +1,185 @@
+import { isIndexedPath, resolveIndexedExtensions } from "../../manifest.js";
+export const EDGE_TARGET_MISSING = {
+    id: "edge-target-missing",
+    description: "An edge points at a document that is not in the graph",
+    defaultSeverity: "error",
+};
+export const EDGE_ANCHOR_MISSING = {
+    id: "edge-anchor-missing",
+    description: "An edge points at an anchor its target document does not define",
+    defaultSeverity: "error",
+};
+export const EDGE_SOURCE_ANCHOR_MISSING = {
+    id: "edge-source-anchor-missing",
+    description: "An edge declares a source anchor its own document does not define",
+    defaultSeverity: "error",
+};
+export const EDGE_PENDING = {
+    id: "edge-pending",
+    description: "An edge marked pending still does not resolve",
+    defaultSeverity: "info",
+};
+export const EDGE_PENDING_RESOLVED = {
+    id: "edge-pending-resolved",
+    description: "An edge marked pending now resolves, so the marker can be dropped",
+    defaultSeverity: "info",
+};
+/** Levenshtein distance, iterative with two rows. */
+function distance(a, b) {
+    if (a === b)
+        return 0;
+    if (!a.length)
+        return b.length;
+    if (!b.length)
+        return a.length;
+    let previous = Array.from({ length: b.length + 1 }, (_, i) => i);
+    for (let i = 1; i <= a.length; i++) {
+        const current = [i];
+        for (let j = 1; j <= b.length; j++) {
+            const substitution = previous[j - 1] + (a[i - 1] === b[j - 1] ? 0 : 1);
+            current[j] = Math.min(current[j - 1] + 1, previous[j] + 1, substitution);
+        }
+        previous = current;
+    }
+    return previous[b.length];
+}
+/**
+ * Find the anchor a broken one was most likely renamed from.
+ *
+ * A slug that vanished while a very similar one exists is a reworded heading,
+ * not a deleted section — the distinction a bare slug list could never express.
+ * The threshold scales with length so short slugs are not matched on noise.
+ */
+function closestAnchor(anchors, missing) {
+    const limit = Math.max(2, Math.floor(missing.length * 0.25));
+    let best;
+    let bestDistance = Number.POSITIVE_INFINITY;
+    for (const anchor of anchors) {
+        const d = distance(missing.toLowerCase(), anchor.slug.toLowerCase());
+        if (d < bestDistance) {
+            bestDistance = d;
+            best = anchor;
+        }
+    }
+    return bestDistance <= limit ? best : undefined;
+}
+function hasAnchor(node, slug) {
+    return node.anchors.some((anchor) => anchor.slug === slug);
+}
+/**
+ * Check that every edge resolves against the graph it belongs to.
+ *
+ * Nothing new is extracted here — this is a set difference over the built
+ * manifest. `edge.to.node` must be a node, and `edge.to.anchor` must be one of
+ * that node's anchors.
+ */
+export const edgeResolutionValidator = {
+    rules: [
+        EDGE_TARGET_MISSING,
+        EDGE_ANCHOR_MISSING,
+        EDGE_SOURCE_ANCHOR_MISSING,
+        EDGE_PENDING,
+        EDGE_PENDING_RESOLVED,
+    ],
+    // Only to explain a broken link, never to decide there is one.
+    needsHistory: true,
+    run({ manifest, nodes, history, config }) {
+        const findings = [];
+        const indexedExtensions = resolveIndexedExtensions(config);
+        for (const edge of manifest.edges) {
+            // A declared source anchor is a claim about the document making the
+            // link, so it is checked whatever happens at the other end.
+            if (edge.from.anchor) {
+                const source = nodes.get(edge.from.node);
+                if (source && !hasAnchor(source, edge.from.anchor)) {
+                    const suggestion = closestAnchor(source.anchors, edge.from.anchor);
+                    findings.push({
+                        rule: EDGE_SOURCE_ANCHOR_MISSING.id,
+                        message: `${edge.from.node} defines no anchor ${edge.from.anchor}`,
+                        target: { kind: "edge", edge },
+                        ...(suggestion
+                            ? { hint: `Did you mean ${suggestion.slug} ("${suggestion.text}")?` }
+                            : {}),
+                        data: {
+                            anchor: edge.from.anchor,
+                            ...(suggestion ? { suggestion: suggestion.slug } : {}),
+                        },
+                    });
+                }
+            }
+            // Weft only makes nodes from documents it indexes, so a link to an
+            // image or a PDF was never going to resolve to one. That is not a
+            // broken reference, and reporting it would bury the real ones.
+            if (!isIndexedPath(edge.to.node, indexedExtensions))
+                continue;
+            const target = nodes.get(edge.to.node);
+            if (!target) {
+                if (edge.pending) {
+                    findings.push({
+                        rule: EDGE_PENDING.id,
+                        message: "Target document does not exist yet",
+                        target: { kind: "edge", edge },
+                    });
+                    continue;
+                }
+                // Moving a document is ordinary maintenance, and it breaks every
+                // link to it. Git already knows what moved where, so say so rather
+                // than leaving a pile of dangling references to be worked out by
+                // hand. Only when the destination is really in the graph — a rename
+                // to something since deleted explains nothing.
+                const movedTo = history.renames.get(edge.to.node);
+                const renamedTo = movedTo && nodes.has(movedTo) ? movedTo : undefined;
+                findings.push({
+                    rule: EDGE_TARGET_MISSING.id,
+                    message: renamedTo
+                        ? `${edge.to.node} moved to ${renamedTo}`
+                        : `No document ${edge.to.node} is in the graph`,
+                    target: { kind: "edge", edge },
+                    hint: renamedTo
+                        ? `Point the link at ${renamedTo}.`
+                        : "Create the document, fix the path, or mark the link pending in a sidecar.",
+                    data: { target: edge.to.node, ...(renamedTo ? { renamedTo } : {}) },
+                });
+                continue;
+            }
+            if (edge.to.anchor && !hasAnchor(target, edge.to.anchor)) {
+                if (edge.pending) {
+                    findings.push({
+                        rule: EDGE_PENDING.id,
+                        message: "Target anchor does not exist yet",
+                        target: { kind: "edge", edge },
+                    });
+                    continue;
+                }
+                const suggestion = closestAnchor(target.anchors, edge.to.anchor);
+                findings.push({
+                    rule: EDGE_ANCHOR_MISSING.id,
+                    // Worth separating from a missing document: the target is right
+                    // and only the heading moved, which is a different fix.
+                    message: `${edge.to.node} exists but defines no anchor ${edge.to.anchor}`,
+                    target: { kind: "edge", edge },
+                    hint: suggestion
+                        ? `Did you mean ${suggestion.slug} ("${suggestion.text}")?`
+                        : "No similarly named anchor exists; the section may have been removed.",
+                    data: {
+                        target: edge.to.node,
+                        anchor: edge.to.anchor,
+                        ...(suggestion ? { suggestion: suggestion.slug } : {}),
+                    },
+                });
+                continue;
+            }
+            // Resolves, but is still carrying a pending marker — say so, or the
+            // suppression outlives the reason for it.
+            if (edge.pending) {
+                findings.push({
+                    rule: EDGE_PENDING_RESOLVED.id,
+                    message: "Resolves now, so `pending: true` can be removed",
+                    target: { kind: "edge", edge },
+                });
+            }
+        }
+        return findings;
+    },
+};
+//# sourceMappingURL=edge-resolution.js.map

package/dist/validate/rules/edge-resolution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-resolution.js","sourceRoot":"","sources":["../../../src/validate/rules/edge-resolution.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,mBAAmB,CAAC;AAI5E,MAAM,CAAC,MAAM,mBAAmB,GAAS;IACxC,EAAE,EAAE,qBAAqB;IACzB,WAAW,EAAE,uDAAuD;IACpE,eAAe,EAAE,OAAO;CACxB,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAS;IACxC,EAAE,EAAE,qBAAqB;IACzB,WAAW,EAAE,iEAAiE;IAC9E,eAAe,EAAE,OAAO;CACxB,CAAC;AAEF,MAAM,CAAC,MAAM,0BAA0B,GAAS;IAC/C,EAAE,EAAE,4BAA4B;IAChC,WAAW,EAAE,mEAAmE;IAChF,eAAe,EAAE,OAAO;CACxB,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAS;IACjC,EAAE,EAAE,cAAc;IAClB,WAAW,EAAE,+CAA+C;IAC5D,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,qBAAqB,GAAS;IAC1C,EAAE,EAAE,uBAAuB;IAC3B,WAAW,EAAE,mEAAmE;IAChF,eAAe,EAAE,MAAM;CACvB,CAAC;AAEF,qDAAqD;AACrD,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACrC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAC/B,IAAI,CAAC,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAE/B,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,CAAC;QAC1E,CAAC;QACD,QAAQ,GAAG,OAAO,CAAC;IACpB,CAAC;IAED,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,OAAiB,EAAE,OAAe;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IAC7D,IAAI,IAAwB,CAAC;IAC7B,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAE5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACrE,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACtB,YAAY,GAAG,CAAC,CAAC;YACjB,IAAI,GAAG,MAAM,CAAC;QACf,CAAC;IACF,CAAC;IAED,OAAO,YAAY,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AACjD,CAAC;AAED,SAAS,SAAS,CAAC,IAAc,EAAE,IAAY;IAC9C,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAc;IACjD,KAAK,EAAE;QACN,mBAAmB;QACnB,mBAAmB;QACnB,0BAA0B;QAC1B,YAAY;QACZ,qBAAqB;KACrB;IACD,+DAA+D;IAC/D,YAAY,EAAE,IAAI;IAElB,GAAG,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE;QACvC,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,MAAM,iBAAiB,GAAG,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAE3D,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,oEAAoE;YACpE,4DAA4D;YAC5D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACtB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACpD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACnE,QAAQ,CAAC,IAAI,CAAC;wBACb,IAAI,EAAE,0BAA0B,CAAC,EAAE;wBACnC,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,sBAAsB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;wBAClE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;wBAC9B,GAAG,CAAC,UAAU;4BACb,CAAC,CAAC,EAAE,IAAI,EAAE,gBAAgB,UAAU,CAAC,IAAI,MAAM,UAAU,CAAC,IAAI,KAAK,EAAE;4BACrE,CAAC,CAAC,EAAE,CAAC;wBACN,IAAI,EAAE;4BACL,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;4BACxB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;yBACtD;qBACD,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;YAED,mEAAmE;YACnE,kEAAkE;YAClE,+DAA+D;YAC/D,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC;gBAAE,SAAS;YAE9D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAEvC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACb,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBAClB,QAAQ,CAAC,IAAI,CAAC;wBACb,IAAI,EAAE,YAAY,CAAC,EAAE;wBACrB,OAAO,EAAE,oCAAoC;wBAC7C,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;qBAC9B,CAAC,CAAC;oBACH,SAAS;gBACV,CAAC;gBAED,iEAAiE;gBACjE,mEAAmE;gBACnE,iEAAiE;gBACjE,oEAAoE;gBACpE,+CAA+C;gBAC/C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAClD,MAAM,SAAS,GAAG,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;gBAEtE,QAAQ,CAAC,IAAI,CAAC;oBACb,IAAI,EAAE,mBAAmB,CAAC,EAAE;oBAC5B,OAAO,EAAE,SAAS;wBACjB,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,aAAa,SAAS,EAAE;wBACzC,CAAC,CAAC,eAAe,IAAI,CAAC,EAAE,CAAC,IAAI,kBAAkB;oBAChD,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;oBAC9B,IAAI,EAAE,SAAS;wBACd,CAAC,CAAC,qBAAqB,SAAS,GAAG;wBACnC,CAAC,CAAC,2EAA2E;oBAC9E,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;iBACnE,CAAC,CAAC;gBACH,SAAS;YACV,CAAC;YAED,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBAClB,QAAQ,CAAC,IAAI,CAAC;wBACb,IAAI,EAAE,YAAY,CAAC,EAAE;wBACrB,OAAO,EAAE,kCAAkC;wBAC3C,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;qBAC9B,CAAC,CAAC;oBACH,SAAS;gBACV,CAAC;gBAED,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBACjE,QAAQ,CAAC,IAAI,CAAC;oBACb,IAAI,EAAE,mBAAmB,CAAC,EAAE;oBAC5B,gEAAgE;oBAChE,wDAAwD;oBACxD,OAAO,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,iCAAiC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE;oBACzE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;oBAC9B,IAAI,EAAE,UAAU;wBACf,CAAC,CAAC,gBAAgB,UAAU,CAAC,IAAI,MAAM,UAAU,CAAC,IAAI,KAAK;wBAC3D,CAAC,CAAC,sEAAsE;oBACzE,IAAI,EAAE;wBACL,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI;wBACpB,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM;wBACtB,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;qBACtD;iBACD,CAAC,CAAC;gBACH,SAAS;YACV,CAAC;YAED,oEAAoE;YACpE,0CAA0C;YAC1C,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClB,QAAQ,CAAC,IAAI,CAAC;oBACb,IAAI,EAAE,qBAAqB,CAAC,EAAE;oBAC9B,OAAO,EAAE,iDAAiD;oBAC1D,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;iBAC9B,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;CACD,CAAC"}

package/dist/validate/rules/includes.d.ts

@@ -0,0 +1,21 @@
+import type { Rule, Validator } from "../types.js";
+export declare const INCLUDE_CYCLE: Rule;
+/**
+ * Report cycles in the `includes` edge graph.
+ *
+ * Cycles are detected at document granularity even when the edges select anchor
+ * ranges: a range that provably excludes the back-reference is possible in
+ * principle, but proving it means re-implementing range extraction here and
+ * keeping two implementations agreeing forever. Simplicity wins — a document
+ * pair that includes each other's disjoint halves is rare enough to restructure.
+ *
+ * Each cycle is reported once, keyed by its sorted member set, so a cycle of
+ * three documents is one finding rather than three. The finding targets the
+ * graph: nothing knows which document started it, and naming one would imply
+ * the others are innocent.
+ *
+ * Pending edges are skipped — the target does not exist yet, so nothing can
+ * expand through it, and `edge-pending` already reports the marker.
+ */
+export declare const includeValidator: Validator;
+//# sourceMappingURL=includes.d.ts.map

package/dist/validate/rules/includes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"includes.d.ts","sourceRoot":"","sources":["../../../src/validate/rules/includes.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAW,IAAI,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE5D,eAAO,MAAM,aAAa,EAAE,IAM3B,CAAC;AAEF;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAyB9B,CAAC"}

package/dist/validate/rules/includes.js

@@ -0,0 +1,112 @@
+import { INCLUDES } from "../../includes.js";
+export const INCLUDE_CYCLE = {
+    id: "include-cycle",
+    description: "Documents include each other in a cycle, so no composed form of them exists",
+    // A cycle is not a matter of taste: expanding it terminates nowhere, and the
+    // renderer's own guard degrades the page rather than fixing the graph.
+    defaultSeverity: "error",
+};
+/**
+ * Report cycles in the `includes` edge graph.
+ *
+ * Cycles are detected at document granularity even when the edges select anchor
+ * ranges: a range that provably excludes the back-reference is possible in
+ * principle, but proving it means re-implementing range extraction here and
+ * keeping two implementations agreeing forever. Simplicity wins — a document
+ * pair that includes each other's disjoint halves is rare enough to restructure.
+ *
+ * Each cycle is reported once, keyed by its sorted member set, so a cycle of
+ * three documents is one finding rather than three. The finding targets the
+ * graph: nothing knows which document started it, and naming one would imply
+ * the others are innocent.
+ *
+ * Pending edges are skipped — the target does not exist yet, so nothing can
+ * expand through it, and `edge-pending` already reports the marker.
+ */
+export const includeValidator = {
+    rules: [INCLUDE_CYCLE],
+    run({ manifest }) {
+        const adjacency = new Map();
+        for (const edge of manifest.edges) {
+            if (edge.type !== INCLUDES || edge.pending)
+                continue;
+            const targets = adjacency.get(edge.from.node) ?? new Set();
+            targets.add(edge.to.node);
+            adjacency.set(edge.from.node, targets);
+        }
+        const findings = [];
+        for (const cycle of findCycles(adjacency)) {
+            const members = [...cycle].sort();
+            findings.push({
+                rule: INCLUDE_CYCLE.id,
+                message: `Include cycle: ${members.join(" → ")} → ${members[0]}`,
+                target: { kind: "graph" },
+                hint: "Break the cycle by removing one include, or restructure so the shared content lives in a document neither includes.",
+                data: { nodes: members },
+            });
+        }
+        return findings;
+    },
+};
+/**
+ * Strongly connected components with more than one member, plus self-loops —
+ * exactly the node sets whose expansion never terminates. Tarjan, iteratively,
+ * so a pathological include chain cannot overflow the call stack.
+ */
+function findCycles(adjacency) {
+    const index = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const cycles = [];
+    let counter = 0;
+    for (const start of adjacency.keys()) {
+        if (index.has(start))
+            continue;
+        // Each frame is a node plus an iterator over its unvisited successors.
+        const frames = [];
+        const push = (node) => {
+            index.set(node, counter);
+            lowlink.set(node, counter);
+            counter++;
+            stack.push(node);
+            onStack.add(node);
+            frames.push({ node, successors: (adjacency.get(node) ?? new Set()).values() });
+        };
+        push(start);
+        while (frames.length) {
+            const frame = frames[frames.length - 1];
+            const next = frame.successors.next();
+            if (!next.done) {
+                const target = next.value;
+                if (!index.has(target))
+                    push(target);
+                else if (onStack.has(target)) {
+                    const low = Math.min(lowlink.get(frame.node), index.get(target));
+                    lowlink.set(frame.node, low);
+                }
+                continue;
+            }
+            frames.pop();
+            const parent = frames[frames.length - 1];
+            if (parent) {
+                const low = Math.min(lowlink.get(parent.node), lowlink.get(frame.node));
+                lowlink.set(parent.node, low);
+            }
+            if (lowlink.get(frame.node) === index.get(frame.node)) {
+                const component = [];
+                let member;
+                do {
+                    member = stack.pop();
+                    onStack.delete(member);
+                    component.push(member);
+                } while (member !== frame.node);
+                const selfLoop = component.length === 1 && adjacency.get(frame.node)?.has(frame.node);
+                if (component.length > 1 || selfLoop)
+                    cycles.push(component);
+            }
+        }
+    }
+    return cycles;
+}
+//# sourceMappingURL=includes.js.map

package/dist/validate/rules/includes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"includes.js","sourceRoot":"","sources":["../../../src/validate/rules/includes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAG7C,MAAM,CAAC,MAAM,aAAa,GAAS;IAClC,EAAE,EAAE,eAAe;IACnB,WAAW,EAAE,6EAA6E;IAC1F,6EAA6E;IAC7E,uEAAuE;IACvE,eAAe,EAAE,OAAO;CACxB,CAAC;AAEF;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAc;IAC1C,KAAK,EAAE,CAAC,aAAa,CAAC;IAEtB,GAAG,CAAC,EAAE,QAAQ,EAAE;QACf,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,OAAO;gBAAE,SAAS;YACrD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC3D,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,aAAa,CAAC,EAAE;gBACtB,OAAO,EAAE,kBAAkB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,EAAE;gBAChE,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;gBACzB,IAAI,EAAE,qHAAqH;gBAC3H,IAAI,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE;aACxB,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,QAAQ,CAAC;IACjB,CAAC;CACD,CAAC;AAEF;;;;GAIG;AACH,SAAS,UAAU,CAAC,SAAmC;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAE/B,uEAAuE;QACvE,MAAM,MAAM,GAAqD,EAAE,CAAC;QACpE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAE;YAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC3B,OAAO,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChF,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,CAAC;QAEZ,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;YAErC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,IAAI,CAAC,MAAM,CAAC,CAAC;qBAChC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAW,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAW,CAAC,CAAC;oBACrF,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC9B,CAAC;gBACD,SAAS;YACV,CAAC;YAED,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAW,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAW,CAAC,CAAC;gBAC5F,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvD,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,IAAI,MAAc,CAAC;gBACnB,GAAG,CAAC;oBACH,MAAM,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBAC/B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxB,CAAC,QAAQ,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE;gBAEhC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACtF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ;oBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9D,CAAC;QACF,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC"}

package/dist/validate/run.d.ts

@@ -0,0 +1,20 @@
+import type { Manifest, WeftConfig } from "../types.js";
+import { type ValidatorRegistry } from "./registry.js";
+import type { GraphHistory, ValidationResult } from "./types.js";
+/**
+ * Whether running this registry under this config will read git history.
+ *
+ * Exported so a caller that builds the graph itself — the service — can pay
+ * for one full history walk up front and hand the result to both the indexer
+ * and {@link validateManifest}, instead of each walking on its own.
+ */
+export declare function registryWantsHistory(registry: ValidatorRegistry, config: WeftConfig): boolean;
+/**
+ * Run every registered check over a built manifest.
+ *
+ * Validation is a separate stage from extraction on purpose: it reads the
+ * finished graph and never mutates it, so a check can be added without touching
+ * the indexer.
+ */
+export declare function validateManifest(manifest: Manifest, config: WeftConfig, registry?: ValidatorRegistry, precomputedHistory?: GraphHistory): Promise<ValidationResult>;
+//# sourceMappingURL=run.d.ts.map

package/dist/validate/run.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/validate/run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAA0B,UAAU,EAAY,MAAM,aAAa,CAAC;AAE1F,OAAO,EAAwB,KAAK,iBAAiB,EAAmB,MAAM,eAAe,CAAC;AAC9F,OAAO,KAAK,EAGX,YAAY,EAGZ,gBAAgB,EAChB,MAAM,YAAY,CAAC;AAOpB;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,iBAAiB,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAK7F;AAED;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CACrC,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,UAAU,EAClB,QAAQ,GAAE,iBAAqC,EAC/C,kBAAkB,CAAC,EAAE,YAAY,GAC/B,OAAO,CAAC,gBAAgB,CAAC,CAyE3B"}