@intentset/core 0.1.0

package/dist/export.d.ts

@@ -0,0 +1,23 @@
+import { type ExportEnvelope, type Level, type Registries, type ValidationResult } from "./types.ts";
+/** What the caller knows and the validation result does not: identity, commit, scope, level, release. */
+export interface ExportMeta {
+    /** Stable identity of the repository, from config. */
+    repository: string;
+    /** The commit the export describes, or null with `commitUnavailable` saying why (a default reason is written when none is given). */
+    commit: string | null;
+    commitUnavailable?: string;
+    /** The scope globs validated; defaults to every Markdown file. */
+    scope?: string[];
+    /** The level the validation ran at; defaults to L1. */
+    level?: Level;
+    release?: {
+        product: string;
+        label: string;
+    } | null;
+    /** ISO 8601; defaults to now. Fix it to make two exports comparable byte for byte. */
+    generatedAt?: string;
+    includeBodies?: boolean;
+}
+/** Core §12 and the integration contract: the `intentset/export/0.1` envelope over a validation result. */
+export declare function exportGraph(result: ValidationResult, registries: Registries, meta: ExportMeta): ExportEnvelope;
+//# sourceMappingURL=export.d.ts.map

package/dist/export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.d.ts","sourceRoot":"","sources":["../src/export.ts"],"names":[],"mappings":"AAQA,OAAO,EAIL,KAAK,cAAc,EAEnB,KAAK,KAAK,EAEV,KAAK,UAAU,EAGf,KAAK,gBAAgB,EACtB,MAAM,YAAY,CAAC;AAEpB,yGAAyG;AACzG,MAAM,WAAW,UAAU;IACzB,sDAAsD;IACtD,UAAU,EAAE,MAAM,CAAC;IACnB,qIAAqI;IACrI,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kEAAkE;IAClE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,uDAAuD;IACvD,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,OAAO,CAAC,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IACpD,sFAAsF;IACtF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED,2GAA2G;AAC3G,wBAAgB,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,cAAc,CA6B9G"}

package/dist/export.js

@@ -0,0 +1,144 @@
+/**
+ * The export envelope (Core §12; the integration contract; spec/export.schema.json).
+ * Artifacts are sorted by ID and every list inside is sorted, so the same
+ * validation result with the same `generatedAt` is the same bytes. Bodies
+ * are included only when asked for.
+ */
+import { graphHash, sortKeysDeep } from "./hash.js";
+import { compareStrings } from "./report.js";
+import { EXPORT_CONTRACT, LINK_KINDS, SPEC_VERSION, } from "./types.js";
+/** Core §12 and the integration contract: the `intentset/export/0.1` envelope over a validation result. */
+export function exportGraph(result, registries, meta) {
+    const { graph } = result;
+    const ids = [...graph.artifacts.keys()].sort(compareStrings);
+    const errors = result.diagnostics.filter((d) => d.severity === "error").length;
+    const warnings = result.diagnostics.length - errors;
+    const source = { commit: meta.commit };
+    if (meta.commit === null)
+        source.commitUnavailable = meta.commitUnavailable ?? "No commit was supplied to the export.";
+    return {
+        contract: EXPORT_CONTRACT,
+        spec: SPEC_VERSION,
+        generatedAt: meta.generatedAt ?? new Date().toISOString(),
+        repository: meta.repository,
+        products: ids.filter((id) => graph.artifacts.get(id)?.meta.type === "product"),
+        source,
+        graphHash: graphHash(graph),
+        release: meta.release ?? null,
+        validation: {
+            level: meta.level ?? "L1",
+            scope: [...(meta.scope ?? ["**/*.md"])],
+            status: result.ok ? "pass" : "fail",
+            errors,
+            warnings,
+            diagnostics: [...result.diagnostics],
+        },
+        registries: exportRegistries(registries),
+        artifacts: ids.map((id) => exportArtifact(result, id, meta.includeBodies === true)),
+    };
+}
+function exportArtifact(result, id, includeBody) {
+    const { graph } = result;
+    const artifact = graph.artifacts.get(id);
+    if (artifact === undefined)
+        throw new Error(`graph has no artifact ${id}`);
+    const { meta } = artifact;
+    const links = {};
+    for (const kind of LINK_KINDS) {
+        if (kind === "parent")
+            continue;
+        const list = meta.links[kind];
+        if (list !== undefined)
+            links[kind] = [...list].sort(compareStrings);
+    }
+    const derived = {};
+    const byKind = new Map();
+    for (const edge of graph.in.get(id) ?? []) {
+        const list = byKind.get(edge.kind);
+        if (list === undefined)
+            byKind.set(edge.kind, [edge.from]);
+        else
+            list.push(edge.from);
+    }
+    for (const kind of LINK_KINDS) {
+        const list = byKind.get(kind);
+        if (list !== undefined)
+            derived[kind] = [...new Set(list)].sort(compareStrings);
+    }
+    const exported = {
+        id,
+        type: meta.type,
+        title: meta.title,
+        status: meta.status,
+        owner: meta.owner,
+        visibility: meta.visibility,
+        audiences: [...meta.audiences].sort(compareStrings),
+        profile: meta.profile,
+        revision: meta.revision ?? null,
+        path: artifact.path,
+        sourceHash: artifact.sourceHash,
+        parent: meta.parent ?? null,
+        links,
+        derived,
+        availability: meta.availability === undefined ? null : sortedAvailability(meta.availability),
+        slice: meta.slice === undefined ? null : sortedSlice(meta.slice),
+        verification: meta.verification === undefined
+            ? null
+            : {
+                method: meta.verification.method,
+                locator: meta.verification.locator,
+                selector: meta.verification.selector,
+            },
+        extensions: meta.extensions === undefined ? null : sortKeysDeep(meta.extensions),
+    };
+    if (includeBody)
+        exported.body = artifact.body;
+    return exported;
+}
+function sortedAvailability(availability) {
+    return {
+        products: [...availability.products].sort(compareStrings),
+        releases: [...availability.releases].sort(compareStrings),
+        roles: [...availability.roles].sort(compareStrings),
+        editions: [...availability.editions].sort(compareStrings),
+        flags: [...availability.flags].sort(compareStrings),
+    };
+}
+function sortedSlice(slice) {
+    const layers = {};
+    for (const layer of Object.keys(slice.layers).sort(compareStrings)) {
+        layers[layer] = [...slice.layers[layer]].sort(compareStrings);
+    }
+    const out = {
+        kind: slice.kind,
+        domain: slice.domain,
+        entrypoints: [...slice.entrypoints].sort(compareStrings),
+        layers,
+        claims: [...slice.claims]
+            .map((claim) => ({ kind: claim.kind, path: claim.path }))
+            .sort((a, b) => compareStrings(a.kind, b.kind) || compareStrings(a.path, b.path)),
+        usesResources: [...slice.usesResources].sort(compareStrings),
+    };
+    if (slice.rationale !== undefined)
+        out.rationale = slice.rationale;
+    return out;
+}
+function exportRegistries(registries) {
+    return {
+        owners: [...registries.owners].sort(compareStrings),
+        audiences: [...registries.audiences].sort(compareStrings),
+        releases: [...registries.releases].sort(compareStrings),
+        roles: [...registries.roles].sort(compareStrings),
+        editions: [...registries.editions].sort(compareStrings),
+        flags: [...registries.flags].sort(compareStrings),
+        resources: [...registries.resources]
+            .map((resource) => ({
+            id: resource.id,
+            path: resource.path,
+            owner: resource.owner,
+            consumers: [...resource.consumers].sort(compareStrings),
+        }))
+            .sort((a, b) => compareStrings(a.id, b.id)),
+    };
+}
+//# sourceMappingURL=export.js.map

package/dist/export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.js","sourceRoot":"","sources":["../src/export.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAEL,eAAe,EAGf,UAAU,EAIV,YAAY,GAGb,MAAM,YAAY,CAAC;AAmBpB,2GAA2G;AAC3G,MAAM,UAAU,WAAW,CAAC,MAAwB,EAAE,UAAsB,EAAE,IAAgB;IAC5F,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IAC/E,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,MAAM,CAAC;IACpD,MAAM,MAAM,GAA6B,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IACjE,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;QACtB,MAAM,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,uCAAuC,CAAC;IAE/F,OAAO;QACL,QAAQ,EAAE,eAAe;QACzB,IAAI,EAAE,YAAY;QAClB,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACzD,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;QAC9E,MAAM;QACN,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC;QAC3B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI;QAC7B,UAAU,EAAE;YACV,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI;YACzB,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACvC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;YACnC,MAAM;YACN,QAAQ;YACR,WAAW,EAAE,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC;SACrC;QACD,UAAU,EAAE,gBAAgB,CAAC,UAAU,CAAC;QACxC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC;KACpF,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,MAAwB,EAAE,EAAU,EAAE,WAAoB;IAChF,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzC,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC;IAC3E,MAAM,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC;IAE1B,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,QAAQ;YAAE,SAAS;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,OAAO,GAA8B,EAAE,CAAC;IAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;;YACtD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,QAAQ,GAAmB;QAC/B,EAAE;QACF,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACnD,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI;QAC/B,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;QAC3B,KAAK;QACL,OAAO;QACP,YAAY,EAAE,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,YAAY,CAAC;QAC5F,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;QAChE,YAAY,EACV,IAAI,CAAC,YAAY,KAAK,SAAS;YAC7B,CAAC,CAAC,IAAI;YACN,CAAC,CAAC;gBACE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM;gBAChC,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO;gBAClC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,QAAQ;aACrC;QACP,UAAU,EAAE,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAA6B;KAC9G,CAAC;IACF,IAAI,WAAW;QAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;IAC/C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,kBAAkB,CAAC,YAA0B;IACpD,OAAO;QACL,QAAQ,EAAE,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACzD,QAAQ,EAAE,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACzD,KAAK,EAAE,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACnD,QAAQ,EAAE,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACzD,KAAK,EAAE,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,KAAgB;IACnC,MAAM,MAAM,GAA6B,EAAE,CAAC;IAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;QACnE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,GAAG,GAAc;QACrB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACxD,MAAM;QACN,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;aACtB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;aACxD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACnF,aAAa,EAAE,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;KAC7D,CAAC;IACF,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;QAAE,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;IACnE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,UAAsB;IAC9C,OAAO;QACL,MAAM,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACnD,SAAS,EAAE,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACzD,QAAQ,EAAE,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACvD,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACjD,QAAQ,EAAE,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACvD,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QACjD,SAAS,EAAE,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;aACjC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAClB,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,SAAS,EAAE,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;SACxD,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;KAC9C,CAAC;AACJ,CAAC"}

package/dist/graph.d.ts

@@ -0,0 +1,17 @@
+/**
+ * The typed graph (Core §5, §12): authored edges in the direction they are
+ * written, and one derived inverse per authored edge, marked derived.
+ */
+import { type Artifact, type Edge, type Graph } from "./types.ts";
+/**
+ * Core §5 and §12: build the graph from artifacts whose IDs are already
+ * unique. Edges follow document order (the order given) then field order
+ * (`parent`, then the Core §5 table). Edges to IDs that are not in the graph
+ * are kept as authored; the validator reports them.
+ */
+export declare function buildGraph(artifacts: readonly Artifact[]): Graph;
+/** Core §5: authored edges of one kind leaving an artifact. */
+export declare function outgoing(graph: Graph, id: string, kind: Edge["kind"]): Edge[];
+/** Core §5: authored edges of one kind arriving at an artifact, the authored side of a derived inverse. */
+export declare function incomingEdges(graph: Graph, id: string, kind: Edge["kind"]): Edge[];
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,KAAK,QAAQ,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK,EAAc,MAAM,YAAY,CAAC;AAE9E;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,SAAS,QAAQ,EAAE,GAAG,KAAK,CAoBhE;AAQD,+DAA+D;AAC/D,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,CAE7E;AAED,2GAA2G;AAC3G,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,CAElF"}

package/dist/graph.js

@@ -0,0 +1,51 @@
+/**
+ * The typed graph (Core §5, §12): authored edges in the direction they are
+ * written, and one derived inverse per authored edge, marked derived.
+ */
+import { LINK_KINDS } from "./types.js";
+/**
+ * Core §5 and §12: build the graph from artifacts whose IDs are already
+ * unique. Edges follow document order (the order given) then field order
+ * (`parent`, then the Core §5 table). Edges to IDs that are not in the graph
+ * are kept as authored; the validator reports them.
+ */
+export function buildGraph(artifacts) {
+    const map = new Map();
+    const edges = [];
+    for (const artifact of artifacts) {
+        const { meta } = artifact;
+        map.set(meta.id, artifact);
+        if (meta.parent !== undefined)
+            edges.push({ kind: "parent", from: meta.id, to: meta.parent, derived: false });
+        for (const kind of LINK_KINDS) {
+            if (kind === "parent")
+                continue;
+            for (const to of meta.links[kind] ?? [])
+                edges.push({ kind, from: meta.id, to, derived: false });
+        }
+    }
+    const derived = edges.map((edge) => ({ kind: edge.kind, from: edge.to, to: edge.from, derived: true }));
+    const out = new Map();
+    const incoming = new Map();
+    for (const edge of edges) {
+        push(out, edge.from, edge);
+        push(incoming, edge.to, edge);
+    }
+    return { artifacts: map, edges, derived, out, in: incoming };
+}
+function push(map, key, edge) {
+    const list = map.get(key);
+    if (list === undefined)
+        map.set(key, [edge]);
+    else
+        list.push(edge);
+}
+/** Core §5: authored edges of one kind leaving an artifact. */
+export function outgoing(graph, id, kind) {
+    return (graph.out.get(id) ?? []).filter((edge) => edge.kind === kind);
+}
+/** Core §5: authored edges of one kind arriving at an artifact, the authored side of a derived inverse. */
+export function incomingEdges(graph, id, kind) {
+    return (graph.in.get(id) ?? []).filter((edge) => edge.kind === kind);
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAwC,UAAU,EAAE,MAAM,YAAY,CAAC;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,SAA8B;IACvD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC;QAC1B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9G,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAChC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACnG,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAW,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAChH,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;AAC/D,CAAC;AAED,SAAS,IAAI,CAAC,GAAwB,EAAE,GAAW,EAAE,IAAU;IAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,IAAI,KAAK,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;;QACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,KAAY,EAAE,EAAU,EAAE,IAAkB;IACnE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACxE,CAAC;AAED,2GAA2G;AAC3G,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,EAAU,EAAE,IAAkB;IACxE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACvE,CAAC"}

package/dist/hash.d.ts

@@ -0,0 +1,16 @@
+import type { Graph } from "./types.ts";
+/** ADR 0005: JSON with keys sorted recursively and no whitespace. `undefined` members are omitted, as JSON.stringify omits them. */
+export declare function canonicalJson(value: unknown): string;
+/** ADR 0005: the same value with every object's keys in sorted order, arrays untouched. */
+export declare function sortKeysDeep(value: unknown): unknown;
+/** ADR 0005: lowercase hex SHA-256 of a string's UTF-8 bytes or of raw bytes. */
+export declare function sha256Hex(input: string | Uint8Array): string;
+/**
+ * ADR 0005: SHA-256 of the canonical JSON of the sorted list of
+ * `{ id, type, sourceHash, links }`, where `links` holds the artifact's
+ * authored edges by kind (`parent` included) with each target list sorted.
+ * Timestamps and commits stay outside, so the same files at two commits hash
+ * the same.
+ */
+export declare function graphHash(graph: Graph): string;
+//# sourceMappingURL=hash.d.ts.map

package/dist/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../src/hash.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,KAAK,EAAY,MAAM,YAAY,CAAC;AAElD,oIAAoI;AACpI,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEpD;AAED,2FAA2F;AAC3F,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAWpD;AAED,iFAAiF;AACjF,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAE5D;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAc9C"}

package/dist/hash.js

@@ -0,0 +1,55 @@
+/**
+ * Canonical JSON and SHA-256 (ADR 0005). Everything hashed goes through
+ * `canonicalJson`, so the same value is the same bytes on every machine.
+ */
+import { createHash } from "node:crypto";
+/** ADR 0005: JSON with keys sorted recursively and no whitespace. `undefined` members are omitted, as JSON.stringify omits them. */
+export function canonicalJson(value) {
+    return JSON.stringify(sortKeysDeep(value));
+}
+/** ADR 0005: the same value with every object's keys in sorted order, arrays untouched. */
+export function sortKeysDeep(value) {
+    if (Array.isArray(value))
+        return value.map(sortKeysDeep);
+    if (typeof value === "object" && value !== null) {
+        const record = value;
+        const out = {};
+        for (const key of Object.keys(record).sort()) {
+            if (record[key] !== undefined)
+                out[key] = sortKeysDeep(record[key]);
+        }
+        return out;
+    }
+    return value;
+}
+/** ADR 0005: lowercase hex SHA-256 of a string's UTF-8 bytes or of raw bytes. */
+export function sha256Hex(input) {
+    return createHash("sha256").update(input).digest("hex");
+}
+/**
+ * ADR 0005: SHA-256 of the canonical JSON of the sorted list of
+ * `{ id, type, sourceHash, links }`, where `links` holds the artifact's
+ * authored edges by kind (`parent` included) with each target list sorted.
+ * Timestamps and commits stay outside, so the same files at two commits hash
+ * the same.
+ */
+export function graphHash(graph) {
+    const entries = [...graph.artifacts.keys()].sort().map((id) => {
+        const artifact = graph.artifacts.get(id);
+        if (artifact === undefined)
+            throw new Error(`graph has no artifact ${id}`);
+        const links = {};
+        for (const edge of graph.out.get(id) ?? []) {
+            const list = links[edge.kind];
+            if (list === undefined)
+                links[edge.kind] = [edge.to];
+            else
+                list.push(edge.to);
+        }
+        for (const kind of Object.keys(links))
+            links[kind]?.sort();
+        return { id, type: artifact.meta.type, sourceHash: artifact.sourceHash, links };
+    });
+    return sha256Hex(canonicalJson(entries));
+}
+//# sourceMappingURL=hash.js.map

package/dist/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../src/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC,oIAAoI;AACpI,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,YAAY,CAAC,KAAc;IACzC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,KAAgC,CAAC;QAChD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,KAAY;IACpC,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAC5D,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC;QAC3E,MAAM,KAAK,GAAwC,EAAE,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;;gBAChD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAe;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;QACzE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC;IAClF,CAAC,CAAC,CAAC;IACH,OAAO,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;AAC3C,CAAC"}

package/dist/impact.d.ts

@@ -0,0 +1,6 @@
+import type { Edge, Graph, ImpactReport } from "./types.ts";
+/** Core §10: the reason recorded for one step, a sentence read from the authored edge's source. */
+export declare function reasonFor(edge: Edge): string;
+/** Core §10: the impact report for an artifact. An ID not in the graph yields an empty report. */
+export declare function impact(graph: Graph, id: string): ImpactReport;
+//# sourceMappingURL=impact.d.ts.map

package/dist/impact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"impact.d.ts","sourceRoot":"","sources":["../src/impact.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,IAAI,EAAE,KAAK,EAAa,YAAY,EAAwB,MAAM,YAAY,CAAC;AAoB7F,mGAAmG;AACnG,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE5C;AAED,kGAAkG;AAClG,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,GAAG,YAAY,CA+C7D"}

package/dist/impact.js

@@ -0,0 +1,89 @@
+/**
+ * Impact traversal (Core §10). From a starting ID, the artifacts one
+ * derived edge away are direct; everything reachable beyond them by further
+ * reverse traversal, with a visited set, is a candidate; the start's own
+ * rules, contracts and decisions are review context; navigation ancestors
+ * come through `parent`. Each hit carries the path that reached it, with a
+ * reason sentence per step. Reachability is recorded, never asserted as
+ * proof that runtime behavior changed.
+ */
+import { compareStrings } from "./report.js";
+const PHRASES = {
+    parent: "has {to} as its navigation parent",
+    governedBy: "is governed by {to}",
+    illustrates: "illustrates {to}",
+    implements: "implements {to}",
+    dependsOn: "depends on {to}",
+    exposes: "exposes {to}",
+    consumes: "consumes {to}",
+    verifies: "verifies {to}",
+    explains: "explains {to}",
+    informedBy: "is informed by {to}",
+    requires: "requires {to}",
+    supports: "supports {to}",
+    replacedBy: "is replaced by {to}",
+};
+const CONTEXT_KINDS = ["governedBy", "exposes", "consumes", "informedBy"];
+/** Core §10: the reason recorded for one step, a sentence read from the authored edge's source. */
+export function reasonFor(edge) {
+    return `${edge.from} ${PHRASES[edge.kind].replace("{to}", edge.to)}.`;
+}
+/** Core §10: the impact report for an artifact. An ID not in the graph yields an empty report. */
+export function impact(graph, id) {
+    const report = { start: id, direct: [], candidates: [], context: [], ancestors: [] };
+    if (!graph.artifacts.has(id))
+        return report;
+    const paths = new Map();
+    const queue = [id];
+    paths.set(id, []);
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const sofar = paths.get(current);
+        const arriving = [...(graph.in.get(current) ?? [])].sort((a, b) => compareStrings(a.from, b.from) || compareStrings(a.kind, b.kind));
+        for (const edge of arriving) {
+            if (paths.has(edge.from))
+                continue;
+            paths.set(edge.from, [...sofar, { id: edge.from, via: `${edge.kind}←`, reason: reasonFor(edge) }]);
+            queue.push(edge.from);
+        }
+    }
+    for (const hitId of [...paths.keys()].sort(compareStrings)) {
+        if (hitId === id)
+            continue;
+        const path = paths.get(hitId);
+        const hit = toHit(graph, hitId, path);
+        if (hit === null)
+            continue;
+        if (path.length === 1)
+            report.direct.push(hit);
+        else
+            report.candidates.push(hit);
+    }
+    const contextEdges = (graph.out.get(id) ?? [])
+        .filter((edge) => CONTEXT_KINDS.includes(edge.kind) && graph.artifacts.has(edge.to))
+        .sort((a, b) => compareStrings(a.to, b.to) || compareStrings(a.kind, b.kind));
+    const seenContext = new Set();
+    for (const edge of contextEdges) {
+        if (seenContext.has(edge.to))
+            continue;
+        seenContext.add(edge.to);
+        const hit = toHit(graph, edge.to, [{ id: edge.to, via: `${edge.kind}→`, reason: reasonFor(edge) }]);
+        if (hit !== null)
+            report.context.push(hit);
+    }
+    const visited = new Set([id]);
+    let cursor = graph.artifacts.get(id)?.meta.parent;
+    while (cursor !== undefined && !visited.has(cursor) && graph.artifacts.has(cursor)) {
+        visited.add(cursor);
+        report.ancestors.push(cursor);
+        cursor = graph.artifacts.get(cursor)?.meta.parent;
+    }
+    return report;
+}
+function toHit(graph, id, path) {
+    const artifact = graph.artifacts.get(id);
+    if (artifact === undefined)
+        return null;
+    return { id, type: artifact.meta.type, title: artifact.meta.title, path };
+}
+//# sourceMappingURL=impact.js.map

package/dist/impact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"impact.js","sourceRoot":"","sources":["../src/impact.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAG7C,MAAM,OAAO,GAA6B;IACxC,MAAM,EAAE,mCAAmC;IAC3C,UAAU,EAAE,qBAAqB;IACjC,WAAW,EAAE,kBAAkB;IAC/B,UAAU,EAAE,iBAAiB;IAC7B,SAAS,EAAE,iBAAiB;IAC5B,OAAO,EAAE,cAAc;IACvB,QAAQ,EAAE,eAAe;IACzB,QAAQ,EAAE,eAAe;IACzB,QAAQ,EAAE,eAAe;IACzB,UAAU,EAAE,qBAAqB;IACjC,QAAQ,EAAE,eAAe;IACzB,QAAQ,EAAE,eAAe;IACzB,UAAU,EAAE,qBAAqB;CAClC,CAAC;AAEF,MAAM,aAAa,GAAwB,CAAC,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;AAE/F,mGAAmG;AACnG,MAAM,UAAU,SAAS,CAAC,IAAU;IAClC,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;AACxE,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,MAAM,CAAC,KAAY,EAAE,EAAU;IAC7C,MAAM,MAAM,GAAiB,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IACnG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO,MAAM,CAAC;IAE5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC9C,MAAM,KAAK,GAAa,CAAC,EAAE,CAAC,CAAC;IAC7B,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAiB,CAAC;QACjD,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CACtD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAC3E,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YACnC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACnG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;QAC3D,IAAI,KAAK,KAAK,EAAE;YAAE,SAAS;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAiB,CAAC;QAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,GAAG,KAAK,IAAI;YAAE,SAAS;QAC3B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAC1C,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,YAAY,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;SAC3C,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACnF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAChF,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACvC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACpG,IAAI,GAAG,KAAK,IAAI;YAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC;IAClD,OAAO,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACnF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC;IACpD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,KAAK,CAAC,KAAY,EAAE,EAAU,EAAE,IAAkB;IACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;AAC5E,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,15 @@
+export * from "./artifact.ts";
+export * from "./carrier.ts";
+export * from "./config.ts";
+export * from "./context.ts";
+export * from "./diagnostics.ts";
+export * from "./export.ts";
+export * from "./graph.ts";
+export * from "./hash.ts";
+export * from "./impact.ts";
+export * from "./registries.ts";
+export * from "./types.ts";
+export * from "./validate.ts";
+export * from "./yaml.ts";
+export { compareStrings } from "./report.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC"}

package/dist/index.js

@@ -0,0 +1,15 @@
+export * from "./artifact.js";
+export * from "./carrier.js";
+export * from "./config.js";
+export * from "./context.js";
+export * from "./diagnostics.js";
+export * from "./export.js";
+export * from "./graph.js";
+export * from "./hash.js";
+export * from "./impact.js";
+export * from "./registries.js";
+export * from "./types.js";
+export * from "./validate.js";
+export * from "./yaml.js";
+export { compareStrings } from "./report.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,aAAa,CAAC;AAC5B,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC"}

package/dist/registries.d.ts

@@ -0,0 +1,19 @@
+/**
+ * The repository registries (Core §4, §7; VSA §3): owners, audiences, the
+ * four release dimensions, and the shared-resource inventory. The file is
+ * `registries.yaml` in the shape of examples/scheduling/registries.yaml.
+ * A missing or empty file is empty registries, which the validator reads as
+ * "not declared" rather than "nothing allowed".
+ */
+import type { Diagnostic } from "./diagnostics.ts";
+import { type Registries } from "./types.ts";
+/**
+ * Core §4 and §7, VSA §3: read registries.yaml. Shape problems are CFG002
+ * (origin "profile"); a YAML rejection is CFG002, also with origin "profile" (origin "syntax" is Markset's alone). Every
+ * list comes back sorted. `null` text means the file is absent.
+ */
+export declare function readRegistries(text: string | null, path: string): {
+    registries: Registries;
+    diagnostics: Diagnostic[];
+};
+//# sourceMappingURL=registries.d.ts.map

package/dist/registries.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registries.d.ts","sourceRoot":"","sources":["../src/registries.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD,OAAO,EAAgC,KAAK,UAAU,EAAiB,MAAM,YAAY,CAAC;AAM1F;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,GAAG,IAAI,EACnB,IAAI,EAAE,MAAM,GACX;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,CAwEvD"}