@intentset/verification 0.6.1 → 0.7.1

package/dist/subject.js

@@ -0,0 +1,329 @@
+/**
+ * The subject of a verification (Core §8, ADR 0013): a hash of what the check
+ * is about, so a run record can stay current while the subject is unchanged.
+ * Pure: it reads nothing but what it is given, so the same inputs give the
+ * same hash on every machine.
+ *
+ * The subject is:
+ *
+ * - the verification record and what it verifies (each verified behavior, the
+ *   rules that govern it and the scenarios that illustrate it), each by the
+ *   source hash of its whole record: its prose is its promise;
+ * - the slices that implement the verified behaviors, the transitive closure
+ *   of their `dependsOn`, and those the verification names in
+ *   `verification.exercises`: each by the hash of its **binding fields**
+ *   (`implements`, `dependsOn`, `claims`, `usesResources`, `entrypoints`;
+ *   never its prose) and the content of every file its claims resolve to;
+ *   A slice reached only through `dependsOn` is a **dependency**: under
+ *   `dependencies: "entrypoint"` (`evidence.dependencies`) it contributes its
+ *   binding fields, the files of its `entrypoints` and the records of the
+ *   contracts it exposes or consumes and the decisions those name (a
+ *   `contract` and a `decision` part), not its other claimed files; the
+ *   files left out are `dependencyInternals`, so a report can say what the
+ *   subject could not see (EVID007). An implementing slice and an exercised
+ *   slice always contribute every file. `dependencies: "files"` is the rule
+ *   of Core §8 up to 0.7.0 (ADR 0013, amended 2026-10-15, second);
+ * - the resources the verification exercises: each by its registry entry and
+ *   the content of the files its path matches. A resource counts where
+ *   `verification.exercises` names it, or where a slice that implements a
+ *   verified behavior lists it in `usesResources` and also claims a file it
+ *   matches (the slice's own resource). A resource a slice merely lists is not
+ *   hashed, so a change to a backend a web slice talks to does not move every
+ *   check of that slice; `resourceMode: "used"` (`evidence.resources: used`)
+ *   hashes the files of every resource an included slice lists, as Core §8
+ *   did from 0.7.0 to 0.7.1 (ADR 0013, amended 2026-10-15). What a subject
+ *   leaves out is `unexercised`, so a report can say what it could not see
+ *   (EVID006);
+ * - the test file (`locator`) and the local files it imports, transitively,
+ *   which the caller resolves (`localImports`) with the architecture
+ *   package's resolver and stops at a package boundary;
+ * - the repository's global inputs, which the caller has expanded to paths.
+ *
+ * The slices' and resources' files are resolved by the architecture package
+ * and passed in, so this package does not depend on it. The hash is the
+ * SHA-256 of the canonical JSON of the sorted entries (ADR 0005), like
+ * `graphHash`; a file is its content's SHA-256, a missing one the word
+ * `absent`, so a deleted file moves the subject. `parts` carries each entry,
+ * so a report can say which part moved (`movedParts`).
+ */
+import { canonicalJson, DEFAULT_EVIDENCE_DEPENDENCIES, sha256Hex, } from "@intentset/core";
+export const SUBJECT_PART_KINDS = [
+    "verification",
+    "verified",
+    "slice",
+    "slice-file",
+    "contract",
+    "decision",
+    "resource",
+    "resource-file",
+    "test",
+    "test-import",
+    "global-input",
+];
+/** What a missing file hashes as, so a deleted file moves the subject and is told apart from an empty one. */
+export const ABSENT = "absent";
+const cmp = (a, b) => (a < b ? -1 : a > b ? 1 : 0);
+/** The verification's `verification.exercises`, or none. */
+export function exercisesOf(graph, id) {
+    const list = graph.artifacts.get(id)?.meta.verification?.exercises;
+    return Array.isArray(list) ? list.filter((x) => typeof x === "string") : [];
+}
+/** The behaviors a verification is about: those it verifies, those governed by a rule it verifies, those a scenario it verifies illustrates. */
+export function verifiedBehaviors(graph, verificationId) {
+    const behaviors = new Set();
+    for (const edge of graph.out.get(verificationId) ?? []) {
+        if (edge.kind !== "verifies")
+            continue;
+        const target = graph.artifacts.get(edge.to);
+        if (target === undefined)
+            continue;
+        if (target.meta.type === "behavior")
+            behaviors.add(target.meta.id);
+        else if (target.meta.type === "rule") {
+            for (const back of graph.in.get(target.meta.id) ?? [])
+                if (back.kind === "governedBy")
+                    behaviors.add(back.from);
+        }
+        else if (target.meta.type === "scenario") {
+            for (const out of graph.out.get(target.meta.id) ?? [])
+                if (out.kind === "illustrates")
+                    behaviors.add(out.to);
+        }
+    }
+    return [...behaviors].filter((id) => graph.artifacts.get(id)?.meta.type === "behavior").sort(cmp);
+}
+/** The slices a subject includes, each with why: implementers, their `dependsOn` closure, and the exercised slices. */
+export function includedSlices(graph, verificationId) {
+    const why = new Map();
+    const add = (id, reason) => {
+        const set = why.get(id) ?? new Set();
+        set.add(reason);
+        why.set(id, set);
+    };
+    const queue = [];
+    const seed = (id, reason) => {
+        if (graph.artifacts.get(id)?.meta.type !== "slice")
+            return;
+        if (!why.has(id))
+            queue.push(id);
+        add(id, reason);
+    };
+    for (const behavior of verifiedBehaviors(graph, verificationId)) {
+        for (const edge of graph.in.get(behavior) ?? [])
+            if (edge.kind === "implements")
+                seed(edge.from, "implements");
+    }
+    for (const id of exercisesOf(graph, verificationId))
+        seed(id, "exercises");
+    while (queue.length > 0) {
+        const id = queue.pop();
+        for (const edge of graph.out.get(id) ?? []) {
+            if (edge.kind !== "dependsOn")
+                continue;
+            if (!why.has(edge.to))
+                queue.push(edge.to);
+            if (graph.artifacts.get(edge.to)?.meta.type === "slice")
+                add(edge.to, "dependsOn");
+        }
+    }
+    return new Map([...why].sort(([a], [b]) => cmp(a, b)).map(([id, set]) => [id, [...set].sort(cmp).join(",")]));
+}
+/** The contracts a slice exposes or consumes: its public contract records, whose change a dependent sees. */
+export function contractsOf(graph, id) {
+    const out = new Set();
+    for (const edge of graph.out.get(id) ?? []) {
+        if ((edge.kind === "exposes" || edge.kind === "consumes") &&
+            graph.artifacts.get(edge.to)?.meta.type === "contract") {
+            out.add(edge.to);
+        }
+    }
+    return [...out].sort(cmp);
+}
+/** The binding fields of a slice record, canonical: what the subject hashes of it instead of the whole record. */
+export function sliceBinding(graph, id) {
+    const artifact = graph.artifacts.get(id);
+    if (artifact === undefined)
+        return null;
+    const links = artifact.meta.links;
+    const slice = artifact.meta.slice;
+    const sorted = (list) => [...(list ?? [])].sort(cmp);
+    return {
+        implements: sorted(links.implements),
+        dependsOn: sorted(links.dependsOn),
+        claims: (slice?.claims ?? [])
+            .map((c) => ({ kind: c.kind, path: c.path }))
+            .sort((a, b) => cmp(a.kind, b.kind) || cmp(a.path, b.path)),
+        usesResources: sorted(slice?.usesResources),
+        entrypoints: sorted(slice?.entrypoints),
+    };
+}
+export function computeSubject(input) {
+    const { graph, verificationId, readFile, globalInputs } = input;
+    const verification = graph.artifacts.get(verificationId);
+    if (verification === undefined || verification.meta.type !== "verification") {
+        throw new Error(`${verificationId} is not a verification in the graph`);
+    }
+    const claimed = (id) => input.sliceFiles instanceof Map
+        ? (input.sliceFiles.get(id) ?? [])
+        : (input.sliceFiles[id] ?? []);
+    const fileHash = input.fileHash ??
+        ((path) => {
+            const bytes = readFile(path);
+            return bytes === undefined ? ABSENT : sha256Hex(bytes);
+        });
+    const recordPart = (kind, id, extra = {}) => {
+        const artifact = graph.artifacts.get(id);
+        return {
+            kind,
+            id,
+            hash: artifact === undefined ? ABSENT : artifact.sourceHash,
+            ...extra,
+            ...(artifact === undefined ? {} : { path: artifact.path }),
+        };
+    };
+    const parts = [recordPart("verification", verificationId)];
+    const targets = new Set();
+    for (const edge of graph.out.get(verificationId) ?? [])
+        if (edge.kind === "verifies")
+            targets.add(edge.to);
+    for (const id of verifiedBehaviors(graph, verificationId)) {
+        targets.add(id);
+        for (const edge of graph.out.get(id) ?? [])
+            if (edge.kind === "governedBy")
+                targets.add(edge.to);
+        for (const edge of graph.in.get(id) ?? [])
+            if (edge.kind === "illustrates")
+                targets.add(edge.from);
+    }
+    for (const id of targets)
+        parts.push(recordPart("verified", id));
+    const mode = input.resourceMode ?? "exercised";
+    const dependencyMode = input.dependencyMode ?? DEFAULT_EVIDENCE_DEPENDENCIES;
+    const internal = new Map();
+    const contractIds = new Set();
+    const resourceWhy = new Map();
+    const useResource = (id, reason) => {
+        if (input.resources?.has(id) !== true)
+            return;
+        const set = resourceWhy.get(id) ?? new Set();
+        set.add(reason);
+        resourceWhy.set(id, set);
+    };
+    const listed = new Set();
+    for (const id of exercisesOf(graph, verificationId))
+        useResource(id, "exercises");
+    for (const [id, why] of includedSlices(graph, verificationId)) {
+        const artifact = graph.artifacts.get(id);
+        parts.push({
+            kind: "slice",
+            id,
+            hash: artifact === undefined ? ABSENT : sha256Hex(canonicalJson(sliceBinding(graph, id))),
+            why,
+            ...(artifact === undefined ? {} : { path: artifact.path }),
+        });
+        const dependency = why === "dependsOn";
+        if (dependency && dependencyMode === "entrypoint") {
+            const surface = new Set(artifact?.meta.slice?.entrypoints ?? []);
+            for (const path of [...surface].sort(cmp)) {
+                parts.push({ kind: "slice-file", id: path, hash: fileHash(path), owner: id, path });
+            }
+            internal.set(id, [...new Set(claimed(id))].filter((path) => !surface.has(path)).sort(cmp));
+            for (const contract of contractsOf(graph, id))
+                contractIds.add(contract);
+        }
+        else {
+            for (const path of [...new Set(claimed(id))].sort(cmp)) {
+                parts.push({ kind: "slice-file", id: path, hash: fileHash(path), owner: id, path });
+            }
+        }
+        const implementing = why.split(",").includes("implements");
+        for (const resource of artifact?.meta.slice?.usesResources ?? []) {
+            if (input.resources?.has(resource) !== true)
+                continue;
+            if (mode === "used" || (implementing && ownsResource(claimed(id), input.resources.get(resource)?.files ?? []))) {
+                useResource(resource, "usesResources");
+            }
+            else
+                listed.add(resource);
+        }
+    }
+    const decisionIds = new Set();
+    for (const id of [...contractIds].sort(cmp)) {
+        parts.push(recordPart("contract", id));
+        for (const edge of graph.out.get(id) ?? [])
+            if (edge.kind === "informedBy")
+                decisionIds.add(edge.to);
+    }
+    for (const id of [...decisionIds].sort(cmp))
+        parts.push(recordPart("decision", id));
+    const unexercised = [...listed]
+        .filter((id) => !resourceWhy.has(id))
+        .sort(cmp)
+        .map((id) => ({ id, files: [...new Set(input.resources?.get(id)?.files ?? [])].sort(cmp) }));
+    for (const [id, set] of resourceWhy) {
+        const resource = input.resources?.get(id);
+        parts.push({
+            kind: "resource",
+            id,
+            hash: sha256Hex(canonicalJson(resource.record)),
+            why: [...set].sort(cmp).join(","),
+        });
+        for (const path of [...new Set(resource.files)].sort(cmp)) {
+            parts.push({ kind: "resource-file", id: path, hash: fileHash(path), owner: id, path });
+        }
+    }
+    const locator = verification.meta.verification?.locator;
+    if (locator !== undefined && locator !== "") {
+        parts.push({ kind: "test", id: locator, hash: fileHash(locator), path: locator });
+        for (const path of [...new Set(input.localImports?.(locator) ?? [])].sort(cmp)) {
+            if (path !== locator)
+                parts.push({ kind: "test-import", id: path, hash: fileHash(path), path });
+        }
+    }
+    for (const path of [...new Set(globalInputs)]) {
+        parts.push({ kind: "global-input", id: path, hash: fileHash(path), path });
+    }
+    // A claimed file of a dependency that another part hashes (an entrypoint of another slice, the test, a global input) is seen.
+    const hashed = new Set(parts.filter((p) => p.path !== undefined).map((p) => p.path));
+    const dependencyInternals = [...internal]
+        .map(([id, files]) => ({ id, files: files.filter((path) => !hashed.has(path)) }))
+        .filter((entry) => entry.files.length > 0)
+        .sort((a, b) => cmp(a.id, b.id));
+    parts.sort((a, b) => cmp(a.kind, b.kind) || cmp(a.id, b.id) || cmp(a.owner ?? "", b.owner ?? ""));
+    const entries = parts.map(({ kind, id, hash, why, owner }) => ({ kind, id, hash, why, owner }));
+    return { hash: sha256Hex(canonicalJson(entries)), parts, unexercised, dependencyInternals };
+}
+/** True when a slice claims a file a resource's path matches: the resource is the slice's own, not only one it talks to. */
+function ownsResource(claimedFiles, resourceFiles) {
+    if (claimedFiles.length === 0 || resourceFiles.length === 0)
+        return false;
+    const files = new Set(resourceFiles);
+    return claimedFiles.some((path) => files.has(path));
+}
+const partKey = (p) => `${p.kind} ${p.id}${p.owner === undefined ? "" : ` (${p.owner})`}`;
+/** The parts that differ between two subjects, as `kind id` keys, sorted: added, removed or changed. */
+export function movedParts(before, after) {
+    const a = new Map(before.parts.map((p) => [partKey(p), p.hash]));
+    const b = new Map(after.parts.map((p) => [partKey(p), p.hash]));
+    const moved = [];
+    for (const [k, h] of a)
+        if (b.get(k) !== h)
+            moved.push(k);
+    for (const k of b.keys())
+        if (!a.has(k))
+            moved.push(k);
+    return moved.sort(cmp);
+}
+/**
+ * The parts of a subject whose file or record is among `changed`: what a
+ * `git diff --name-only` since a record's commit says may have moved. A record
+ * file that changed only in prose is named too, since the diff cannot tell it
+ * from a change to a binding field; the hash decided the subject moved.
+ */
+export function partsChangedAmong(subject, changed) {
+    return subject.parts
+        .filter((p) => p.path !== undefined && changed.has(p.path))
+        .map(partKey)
+        .sort(cmp);
+}
+//# sourceMappingURL=subject.js.map

package/dist/subject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subject.js","sourceRoot":"","sources":["../src/subject.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+CG;AACH,OAAO,EACL,aAAa,EACb,6BAA6B,EAI7B,SAAS,GACV,MAAM,iBAAiB,CAAC;AAEzB,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,cAAc;IACd,UAAU;IACV,OAAO;IACP,YAAY;IACZ,UAAU;IACV,UAAU;IACV,UAAU;IACV,eAAe;IACf,MAAM;IACN,aAAa;IACb,cAAc;CACN,CAAC;AAiEX,8GAA8G;AAC9G,MAAM,CAAC,MAAM,MAAM,GAAG,QAAQ,CAAC;AAE/B,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnE,4DAA4D;AAC5D,MAAM,UAAU,WAAW,CAAC,KAAY,EAAE,EAAU;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC;IACnE,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3F,CAAC;AAED,gJAAgJ;AAChJ,MAAM,UAAU,iBAAiB,CAAC,KAAY,EAAE,cAAsB;IACpE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;QACvD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QACvC,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC9D,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;oBAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClH,CAAC;aAAM,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3C,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;oBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/G,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACpG,CAAC;AAED,uHAAuH;AACvH,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,cAAsB;IACjE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,MAAM,GAAG,GAAG,CAAC,EAAU,EAAE,MAAc,EAAE,EAAE;QACzC,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAC7C,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChB,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACnB,CAAC,CAAC;IACF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,MAAc,EAAE,EAAE;QAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO;QAC3D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAClB,CAAC,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,iBAAiB,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;QAChE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACjH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,KAAK,EAAE,cAAc,CAAC;QAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAC3E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;gBAAE,SAAS;YACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;IACD,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChH,CAAC;AAED,6GAA6G;AAC7G,MAAM,UAAU,WAAW,CAAC,KAAY,EAAE,EAAU;IAClD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QAC3C,IACE,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;YACrD,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,UAAU,EACtD,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED,kHAAkH;AAClH,MAAM,UAAU,YAAY,CAAC,KAAY,EAAE,EAAU;IACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;IAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;IAClC,MAAM,MAAM,GAAG,CAAC,IAAmC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpF,OAAO;QACL,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;QACpC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;QAClC,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC;aAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;aAC5C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7D,aAAa,EAAE,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC;QAC3C,WAAW,EAAE,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC;KACxC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAmB;IAChD,MAAM,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;IAChE,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACzD,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAC5E,MAAM,IAAI,KAAK,CAAC,GAAG,cAAc,qCAAqC,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAU,EAAqB,EAAE,CAChD,KAAK,CAAC,UAAU,YAAY,GAAG;QAC7B,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAClC,CAAC,CAAC,CAAE,KAAK,CAAC,UAAgD,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1E,MAAM,QAAQ,GACZ,KAAK,CAAC,QAAQ;QACd,CAAC,CAAC,IAAY,EAAE,EAAE;YAChB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC7B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;IACL,MAAM,UAAU,GAAG,CAAC,IAAqB,EAAE,EAAU,EAAE,KAAK,GAAyB,EAAE,EAAe,EAAE;QACtG,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzC,OAAO;YACL,IAAI;YACJ,EAAE;YACF,IAAI,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU;YAC3D,GAAG,KAAK;YACR,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC;SAC3D,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,KAAK,GAAkB,CAAC,UAAU,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC;IAE1E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE;QAAE,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3G,KAAK,MAAM,EAAE,IAAI,iBAAiB,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;QAC1D,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjG,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrG,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,OAAO;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;IAEjE,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,IAAI,WAAW,CAAC;IAC/C,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,IAAI,6BAA6B,CAAC;IAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,MAAM,WAAW,GAAG,CAAC,EAAU,EAAE,MAAc,EAAE,EAAE;QACjD,IAAI,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI;YAAE,OAAO;QAC9C,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACrD,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChB,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,KAAK,EAAE,cAAc,CAAC;QAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAElF,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,cAAc,CAAC,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;QAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,OAAO;YACb,EAAE;YACF,IAAI,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YACzF,GAAG;YACH,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC;SAC3D,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,GAAG,KAAK,WAAW,CAAC;QACvC,IAAI,UAAU,IAAI,cAAc,KAAK,YAAY,EAAE,CAAC;YAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,WAAW,IAAI,EAAE,CAAC,CAAC;YACjE,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;YACtF,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3F,KAAK,MAAM,QAAQ,IAAI,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3E,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;QACD,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC3D,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,aAAa,IAAI,EAAE,EAAE,CAAC;YACjE,IAAI,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI;gBAAE,SAAS;YACtD,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/G,WAAW,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;YACzC,CAAC;;gBAAM,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;gBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvG,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;IACpF,MAAM,WAAW,GAA0B,CAAC,GAAG,MAAM,CAAC;SACnD,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SACpC,IAAI,CAAC,GAAG,CAAC;SACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/F,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAoB,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,UAAU;YAChB,EAAE;YACF,IAAI,EAAE,SAAS,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC/C,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;SAClC,CAAC,CAAC;QACH,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1D,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,CAAC;IACxD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,EAAE,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QAClF,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/E,IAAI,IAAI,KAAK,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAClG,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,8HAA8H;IAC9H,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACrF,MAAM,mBAAmB,GAA0B,CAAC,GAAG,QAAQ,CAAC;SAC7D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;SAChF,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;SACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAChG,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,mBAAmB,EAAE,CAAC;AAC9F,CAAC;AAED,4HAA4H;AAC5H,SAAS,YAAY,CAAC,YAA+B,EAAE,aAAgC;IACrF,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;IACrC,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAc,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;AAEvG,wGAAwG;AACxG,MAAM,UAAU,UAAU,CAAC,MAAe,EAAE,KAAc;IACxD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAgB,EAAE,OAA4B;IAC9E,OAAO,OAAO,CAAC,KAAK;SACjB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;SAC1D,GAAG,CAAC,OAAO,CAAC;SACZ,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC"}

package/package.json

@@ -1,7 +1,14 @@
 {
   "name": "@intentset/verification",
-  "version": "0.6.1",
+  "version": "0.7.1",
   "description": "Run records, evidence freshness classification, and test-reporter adapters.",
+  "keywords": [
+    "intentset",
+    "verification",
+    "test-evidence",
+    "vitest",
+    "traceability"
+  ],
   "license": "MIT",
   "type": "module",
   "engines": {
@@ -28,6 +35,6 @@
     }
   },
   "dependencies": {
-    "@intentset/core": "^0.6.1"
+    "@intentset/core": "^0.7.1"
   }
 }

package/src/adapters/common.ts

@@ -22,8 +22,12 @@ export interface ParsedRun {
 }
 
 export interface ToRunRecordsOptions {
-  /** Selector -> verification ID, from the graph's automated verifications. */
-  verifications: ReadonlyMap<string, string>;
+  /**
+   * Selector -> the verification ID, or every verification ID, that names it, from the graph's automated
+   * verifications. A selector two verifications share (one test verifying two behaviors) gives each of them its own
+   * record from the same tests.
+   */
+  verifications: ReadonlyMap<string, string | readonly string[]>;
   commit: string;
   graphHash: string;
   environment: string;
@@ -34,12 +38,18 @@ export interface ToRunRecordsOptions {
   finishedAt: string;
   /** Where the run's report lives; each record's uri is this plus `#` and the verification ID. */
   uriBase: string;
+  /**
+   * Verification ID -> the hash of its subject, when the effective binding is subject (Core §8): a record is then
+   * written with `binding: "subject"` and that hash, and the commit and graph hash stay as provenance. A
+   * verification with no entry, or no map at all, gets a commit-binding record.
+   */
+  subjects?: ReadonlyMap<string, string>;
 }
 
 export interface ConvertedRun {
-  /** One record per verification at least one test matched, by verification ID. */
+  /** One record per verification whose selector at least one test matched, by verification ID. */
   records: RunRecord[];
-  /** Selectors no test matched, sorted: their verifications get no record from this run, and read as missing. */
+  /** Selectors no test matched, sorted and listed once however many verifications name them: those verifications get no record from this run, and read as missing. */
   unmatched: string[];
 }
 
@@ -82,8 +92,8 @@ export function worst(a: RunResult, b: RunResult): RunResult {
 }
 
 /**
- * One run record per verification whose selector matched at least one test.
- * Several matching tests make one record with the worst result and a
+ * One run record per verification whose selector matched at least one test,
+ * so a selector two verifications share gives each its own record. Several matching tests make one record with the worst result and a
  * rationale that counts them. Throws when the options would make a malformed
  * record, since that is a caller's mistake rather than evidence.
  */
@@ -91,16 +101,19 @@ export function toRunRecords(parsed: ParsedRun, options: ToRunRecordsOptions): C
   const matched = new Map<string, { selectors: Set<string>; tests: Set<number> }>();
   const unmatched: string[] = [];
   for (const selector of [...options.verifications.keys()].sort(compareStrings)) {
-    const verificationId = options.verifications.get(selector) as string;
+    const named = options.verifications.get(selector) as string | readonly string[];
+    const verificationIds = [...new Set(typeof named === "string" ? [named] : named)].sort(compareStrings);
     const hits = parsed.tests.flatMap((test, index) => (selectorMatches(selector, test.fullName) ? [index] : []));
     if (hits.length === 0) {
       unmatched.push(selector);
       continue;
     }
-    const entry = matched.get(verificationId) ?? { selectors: new Set<string>(), tests: new Set<number>() };
-    entry.selectors.add(selector);
-    for (const hit of hits) entry.tests.add(hit);
-    matched.set(verificationId, entry);
+    for (const verificationId of verificationIds) {
+      const entry = matched.get(verificationId) ?? { selectors: new Set<string>(), tests: new Set<number>() };
+      entry.selectors.add(selector);
+      for (const hit of hits) entry.tests.add(hit);
+      matched.set(verificationId, entry);
+    }
   }
 
   const records: RunRecord[] = [];
@@ -114,6 +127,7 @@ export function toRunRecords(parsed: ParsedRun, options: ToRunRecordsOptions): C
       .map(([r, n]) => `${n} ${r}`)
       .join(", ");
     const names = [...selectors].sort(compareStrings).join(", ");
+    const subjectHash = options.subjects?.get(verificationId);
     records.push({
       evidenceId: deriveEvidenceId(verificationId, options.commit, options.graphHash, options.finishedAt),
       verificationId,
@@ -127,6 +141,7 @@ export function toRunRecords(parsed: ParsedRun, options: ToRunRecordsOptions): C
       finishedAt: options.finishedAt,
       result,
       uri: `${options.uriBase}#${encodeURIComponent(verificationId)}`,
+      ...(subjectHash === undefined ? {} : { binding: "subject" as const, subjectHash }),
       rationale: `${results.length} test${results.length === 1 ? "" : "s"} matched ${names}: ${counts}.`,
     });
   }

package/src/adapters/playwright.ts

@@ -0,0 +1,94 @@
+/**
+ * `playwright test --reporter=json`: `suites[]`, each a file whose `suites[]` are `describe` groups and whose
+ * `specs[]` are the tests, each spec holding one `tests[]` entry per project it ran in. A test's full name is its
+ * describe titles and its own, joined with " > " (the file's own suite is left out, as the runner's list reporter
+ * leaves it out), so a selector is matched as it is for the other runners; a test that runs in several projects makes
+ * one `ParsedTest` for each, and the worst of them is the verification's result.
+ *
+ * Results follow the test's own `status`: expected is pass (a `test.fail()` that failed as declared is expected),
+ * skipped is skip (`test.skip` and `test.fixme` are skipped), flaky is pass (it failed and passed on a retry, and the
+ * retry policy is the project's), and unexpected is fail when its last attempt was an assertion and error when it
+ * timed out, was interrupted or threw anything else. Errors the report lists for the whole run (a global setup that
+ * failed) are listed in `problems`, since no test title can carry them to a selector.
+ */
+import type { RunResult } from "../records.ts";
+import type { ParsedRun, ParsedTest } from "./common.ts";
+
+export function parsePlaywrightJson(json: unknown): ParsedRun {
+  if (!isRecord(json) || !Array.isArray(json.suites)) {
+    throw new TypeError("This is not Playwright JSON reporter output: expected an object with a suites array.");
+  }
+  const tests: ParsedTest[] = [];
+  const problems: string[] = [];
+  if (Array.isArray(json.errors)) {
+    for (const error of json.errors) {
+      problems.push(`The run reported an error: ${firstLine(isRecord(error) ? error.message : error) || "no message"}`);
+    }
+  }
+  json.suites.forEach((file, index) => {
+    if (!isRecord(file)) throw new TypeError(`suites[${index}] is not an object.`);
+    walk(file, [], tests, problems);
+  });
+  return { tests, problems };
+}
+
+function walk(suite: Record<string, unknown>, ancestors: string[], tests: ParsedTest[], problems: string[]): void {
+  for (const spec of Array.isArray(suite.specs) ? suite.specs : []) {
+    if (!isRecord(spec)) throw new TypeError("A spec in the report is not an object.");
+    const title = typeof spec.title === "string" ? spec.title : "";
+    const fullName = [...ancestors, title].join(" > ");
+    for (const test of Array.isArray(spec.tests) ? spec.tests : []) {
+      if (!isRecord(test)) throw new TypeError(`${fullName} has a test entry that is not an object.`);
+      const result = resultOf(test, fullName, problems);
+      tests.push({ fullName, result, durationMs: durationOf(test) });
+    }
+  }
+  for (const child of Array.isArray(suite.suites) ? suite.suites : []) {
+    if (!isRecord(child)) throw new TypeError("A suite in the report is not an object.");
+    const title = typeof child.title === "string" ? child.title : "";
+    walk(child, title === "" ? ancestors : [...ancestors, title], tests, problems);
+  }
+}
+
+function resultOf(test: Record<string, unknown>, fullName: string, problems: string[]): RunResult {
+  switch (test.status) {
+    case "expected":
+    case "flaky":
+      return "pass";
+    case "skipped":
+      return "skip";
+    case "unexpected":
+      return failureKind(lastResult(test));
+    default:
+      problems.push(`${fullName} has the unknown status ${JSON.stringify(test.status)}, read as error`);
+      return "error";
+  }
+}
+
+/** A timeout or an interrupted run is an error; an assertion that did not hold is a fail; anything else thrown is an error. */
+function failureKind(last: Record<string, unknown> | undefined): RunResult {
+  if (last === undefined) return "fail";
+  if (last.status === "timedOut" || last.status === "interrupted") return "error";
+  const error = isRecord(last.error) ? last.error : undefined;
+  const message = typeof error?.message === "string" ? error.message : "";
+  return /\bexpect\(|AssertionError/.test(message) || message === "" ? "fail" : "error";
+}
+
+function lastResult(test: Record<string, unknown>): Record<string, unknown> | undefined {
+  const results = Array.isArray(test.results) ? test.results : [];
+  const last = results[results.length - 1];
+  return isRecord(last) ? last : undefined;
+}
+
+function durationOf(test: Record<string, unknown>): number | null {
+  const duration = lastResult(test)?.duration;
+  return typeof duration === "number" && Number.isFinite(duration) ? duration : null;
+}
+
+function firstLine(value: unknown): string {
+  return typeof value === "string" ? (value.trim().split("\n")[0] ?? "") : "";
+}
+
+function isRecord(value: unknown): value is Record<string, unknown> {
+  return typeof value === "object" && value !== null && !Array.isArray(value);
+}

package/src/binding.ts

@@ -0,0 +1,68 @@
+/**
+ * Which binding judges run evidence (Core §8, ADR 0013) and the subjects it
+ * needs. The decision is pure: the repository's configuration and whether it
+ * has slice claims. Computing a subject needs what the architecture package
+ * resolves (claimed files, import closures), which this package does not
+ * depend on, so a caller hands it in as a `SubjectSource`.
+ */
+import type { EvidenceBinding, EvidenceBindingReason, Graph } from "@intentset/core";
+import { compareStrings } from "./diagnostic.ts";
+import { ABSENT, computeSubject, type Subject, type SubjectInput } from "./subject.ts";
+import { sha256Hex } from "@intentset/core";
+
+export interface BindingDecision {
+  binding: EvidenceBinding;
+  /** `configured`, `default` (subject, since slices exist) or `no-slices` (commit, since there is nothing to hash). */
+  reason: EvidenceBindingReason;
+}
+
+/**
+ * Core §8: `binding: subject` is the default wherever the repository has slice
+ * claims; `binding: commit` is the stricter mode a repository or gate asks
+ * for; a repository with no slice claims is judged by commit binding unless it
+ * asked for that, and says so (EVID004), whatever it asked for.
+ */
+export function resolveBinding(configured: EvidenceBinding | null, hasSlices: boolean): BindingDecision {
+  if (configured === "commit") return { binding: "commit", reason: "configured" };
+  if (!hasSlices) return { binding: "commit", reason: "no-slices" };
+  return { binding: "subject", reason: configured === "subject" ? "configured" : "default" };
+}
+
+/** True when some slice that is not retired claims files: the repository has a subject to hash. */
+export function hasSliceClaims(graph: Graph): boolean {
+  for (const artifact of graph.artifacts.values()) {
+    if (
+      artifact.meta.type === "slice" &&
+      artifact.meta.status !== "retired" &&
+      (artifact.meta.slice?.claims.length ?? 0) > 0
+    )
+      return true;
+  }
+  return false;
+}
+
+/** What a caller resolves for the subject hash: the architecture package's claims and imports, over one tree. */
+export type SubjectSource = Omit<SubjectInput, "graph" | "verificationId"> & {
+  /** True for a file that can move some subject: a slice's, a used resource's, a global input, a test, a record. */
+  covers: (path: string) => boolean;
+};
+
+/** The subject of every verification in the graph, by ID, with each file hashed once. */
+export function subjectsFor(graph: Graph, source: SubjectSource): Map<string, Subject> {
+  const hashes = new Map<string, string>();
+  const fileHash = (path: string): string => {
+    let hash = hashes.get(path);
+    if (hash === undefined) {
+      const bytes = source.readFile(path);
+      hash = bytes === undefined ? ABSENT : sha256Hex(bytes);
+      hashes.set(path, hash);
+    }
+    return hash;
+  };
+  const subjects = new Map<string, Subject>();
+  const ids = [...graph.artifacts.keys()].filter((id) => graph.artifacts.get(id)?.meta.type === "verification");
+  for (const id of ids.sort(compareStrings)) {
+    subjects.set(id, computeSubject({ ...source, graph, verificationId: id, fileHash }));
+  }
+  return subjects;
+}