@nielspeter/eess 0.2.2 → 0.5.0

package/dist/combinators.js

@@ -1,3 +1,4 @@
+import { combineGlobs, negateGlobs } from './glob-site.js';
 export function not(input) {
     if (typeof input === 'function') {
         return (value) => !input(value);
@@ -5,39 +6,75 @@ export function not(input) {
     return {
         description: `not (${input.description})`,
         test: (element) => !input.test(element),
+        // Negation-normal-form push-down: `op` inverts as well as `polarity`.
+        // `not(unsatisfiable)` selects everything, so a negated site is
+        // over-selection rather than vacuity and can never be a fault — but a
+        // `not` nested inside the subtree flips it back, which is why this cannot
+        // just flip polarity. See `negateGlobs`.
+        globs: input.globs && negateGlobs(input.globs),
     };
 }
-function assertHomogeneous(inputs) {
+/**
+ * Every input to `and()`/`or()` must be the same kind.
+ *
+ * `eess-ts` carried a byte-identical copy — `no-copy-paste` reported it at
+ * 100%, with only the noun in the message differing — so the noun is now the
+ * parameter and the check has one owner.
+ *
+ * A `TypeError` and not a filtered result: mixing an object predicate with a
+ * matcher function silently drops one kind (the implementations below filter
+ * by `typeof`), so a rule composed that way would narrow by half of what its
+ * author wrote and pass on the rest. Refusing at composition time is the only
+ * point where the mistake is still visible.
+ */
+export function assertHomogeneous(inputs, matcherNoun = 'Matcher') {
     if (inputs.length === 0)
         return;
     const firstIsFunction = typeof inputs[0] === 'function';
     if (inputs.some((i) => (typeof i === 'function') !== firstIsFunction)) {
-        throw new TypeError('Cannot mix Predicate objects and Matcher functions in and()/or()');
+        throw new TypeError(`Cannot mix Predicate objects and ${matcherNoun} functions in and()/or()`);
     }
 }
 export function and(...inputs) {
-    assertHomogeneous(inputs);
-    if (typeof inputs[0] === 'function') {
-        const matchers = inputs.filter((input) => typeof input === 'function');
-        const fn = (value) => matchers.every((m) => m(value));
-        return fn;
-    }
-    const predicates = inputs.filter((input) => typeof input !== 'function');
-    return {
-        description: predicates.map((p) => p.description).join(' and '),
-        test: (element) => predicates.every((p) => p.test(element)),
-    };
+    return combine(inputs, 'all');
 }
 export function or(...inputs) {
+    return combine(inputs, 'any');
+}
+/**
+ * The body `and()` and `or()` share, with the quantifier as its one parameter.
+ *
+ * They were the same fifteen lines twice — `no-copy-paste` reported them at
+ * 98%, across both packages — but the reason to share them is that **three
+ * choices have to agree and nothing was making them**:
+ *
+ * | `op`    | quantifier | joined with | glob node |
+ * | ------- | ---------- | ----------- | --------- |
+ * | `'all'` | `every`    | `' and '`   | `'all'`   |
+ * | `'any'` | `some`     | `' or '`    | `'any'`   |
+ *
+ * A conjunction selects nothing as soon as ONE input does; a disjunction only
+ * when EVERY input does. Pairing `some` with a `'all'` glob node — one edit
+ * away, in two files, when they were written out separately — reports a live
+ * selector as dead, which is a configuration finding against a rule that is
+ * fine. Deriving all three from `op` is what makes that unreachable.
+ *
+ * Inputs that declare no globs become retained opaque children rather than
+ * being dropped: dropping them is what would red `or(deadGlob, byName)`.
+ */
+function combine(inputs, op) {
     assertHomogeneous(inputs);
+    const holds = (xs, f) => op === 'all' ? xs.every(f) : xs.some(f);
     if (typeof inputs[0] === 'function') {
         const matchers = inputs.filter((input) => typeof input === 'function');
-        return (value) => matchers.some((m) => m(value));
+        const fn = (value) => holds(matchers, (m) => m(value));
+        return fn;
     }
     const predicates = inputs.filter((input) => typeof input !== 'function');
     return {
-        description: predicates.map((p) => p.description).join(' or '),
-        test: (element) => predicates.some((p) => p.test(element)),
+        description: predicates.map((p) => p.description).join(op === 'all' ? ' and ' : ' or '),
+        test: (element) => holds(predicates, (p) => p.test(element)),
+        globs: combineGlobs(op, predicates.map((p) => p.globs)),
     };
 }
 //# sourceMappingURL=combinators.js.map

package/dist/combinators.js.map

@@ -1 +1 @@
-{"version":3,"file":"combinators.js","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AA0BA,MAAM,UAAU,GAAG,CAAO,KAAgC;IACxD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,OAAO,CAAC,KAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACpC,CAAC;IACD,OAAO;QACL,WAAW,EAAE,QAAQ,KAAK,CAAC,WAAW,GAAG;QACzC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;KAC3C,CAAA;AACH,CAAC;AAED,SAAS,iBAAiB,CAAO,MAAqC;IACpE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAM;IAC/B,MAAM,eAAe,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,CAAA;IACvD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,UAAU,CAAC,KAAK,eAAe,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,SAAS,CAAC,kEAAkE,CAAC,CAAA;IACzF,CAAC;AACH,CAAC;AAiBD,MAAM,UAAU,GAAG,CAAO,GAAG,MAAqC;IAChE,iBAAiB,CAAC,MAAM,CAAC,CAAA;IACzB,IAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAuB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;QAC3F,MAAM,EAAE,GAAe,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QACjE,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAyB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;IAC/F,OAAO;QACL,WAAW,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC/D,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KAC/D,CAAA;AACH,CAAC;AAiBD,MAAM,UAAU,EAAE,CAAO,GAAG,MAAqC;IAC/D,iBAAiB,CAAC,MAAM,CAAC,CAAA;IACzB,IAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAuB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;QAC3F,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IAClD,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAyB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;IAC/F,OAAO;QACL,WAAW,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QAC9D,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KAC9D,CAAA;AACH,CAAC"}
+{"version":3,"file":"combinators.js","sourceRoot":"","sources":["../src/combinators.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AA0B1D,MAAM,UAAU,GAAG,CAAO,KAAgC;IACxD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,OAAO,CAAC,KAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IACpC,CAAC;IACD,OAAO;QACL,WAAW,EAAE,QAAQ,KAAK,CAAC,WAAW,GAAG;QACzC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;QAC1C,sEAAsE;QACtE,gEAAgE;QAChE,sEAAsE;QACtE,0EAA0E;QAC1E,yCAAyC;QACzC,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC;KAC/C,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAqC,EACrC,WAAW,GAAG,SAAS;IAEvB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAM;IAC/B,MAAM,eAAe,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,CAAA;IACvD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,UAAU,CAAC,KAAK,eAAe,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,SAAS,CAAC,oCAAoC,WAAW,0BAA0B,CAAC,CAAA;IAChG,CAAC;AACH,CAAC;AAiBD,MAAM,UAAU,GAAG,CAAO,GAAG,MAAqC;IAChE,OAAO,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC/B,CAAC;AAiBD,MAAM,UAAU,EAAE,CAAO,GAAG,MAAqC;IAC/D,OAAO,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,SAAS,OAAO,CACd,MAAqC,EACrC,EAAiB;IAEjB,iBAAiB,CAAC,MAAM,CAAC,CAAA;IACzB,MAAM,KAAK,GAAG,CAAI,EAAgB,EAAE,CAAoB,EAAW,EAAE,CACnE,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAEzC,IAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAuB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;QAC3F,MAAM,EAAE,GAAe,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QAClE,OAAO,EAAE,CAAA;IACX,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAyB,EAAE,CAAC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAA;IAC/F,OAAO;QACL,WAAW,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QACvF,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/D,KAAK,EAAE,YAAY,CACjB,EAAE,EACF,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAC/B;KACF,CAAA;AACH,CAAC"}

package/dist/comment-suppression.d.ts

@@ -0,0 +1,60 @@
+/**
+ * What inline exclusion comments suppressed, said out loud.
+ *
+ * Every other filter in the pipeline discloses itself: `.excluding()` warns on
+ * a pattern that matched nothing (`execute-rule.ts`), diff-aware has
+ * `suppressionNotice`, the baseline has `unmatchedBaselineFinding`. The inline
+ * comment filter dropped violations and returned no count — and after
+ * [ts-archunit bug 0041](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0041-an-exclusion-comment-is-a-no-op-for-most-conditions.md)
+ * made comments work for every condition family, it became the **widest** filter
+ * in the pipeline and the only silent one.
+ *
+ * `diff-disclosure.ts` states the principle this module inherits: *a run with
+ * every finding suppressed is indistinguishable from a clean run.* That is the
+ * false green ADR-008 exists to prevent, and it is worse here than for
+ * `--changed`, because a comment is written once and then read by nobody. The
+ * flag at least appears in the CI invocation.
+ *
+ * ## Identities, not a total (ADR-009 rule 4)
+ *
+ * The notice names **which rule in which file**, not just how many. A count is a
+ * snapshot: it moves when anything moves and tells the reader nothing about what
+ * to look at. `arch/no-cycles in src/legacy/gateway.ts` is an identity — it
+ * survives a renumbering and it is greppable.
+ *
+ * Capped, and the cap is disclosed rather than silent: a suite with hundreds of
+ * exemptions should not print hundreds of lines on every green run, but
+ * "and 47 more" is a very different statement from printing 3 and implying that
+ * is all of them.
+ *
+ * ## Why module state
+ *
+ * `applyFilters` runs once per rule and has no view of the run. This is the same
+ * shape `edge-coverage.ts` uses for the same reason: accumulate per rule, reset
+ * at the run boundary, render once. The two aggregating surfaces — CLI `check`
+ * and `checkAll` — both already call a reset and read a notice, so this hooks
+ * into a pattern that exists rather than inventing one.
+ *
+ * The per-rule terminals (`.check()` / `.warn()` on a single rule) have no run
+ * boundary, so they do not render it. Same honest limitation `diff-disclosure`
+ * documents and for the same reason: a per-rule count presented as a run total
+ * would be wrong, and 79 lines on a 79-rule suite is not disclosure.
+ */
+/** Start a run. Both aggregating surfaces call this before evaluating. */
+export declare function resetCommentSuppression(): void;
+/** Record that a comment suppressed a finding. Called from `applyFilters`. */
+export declare function recordCommentSuppression(ruleId: string, file: string): void;
+/** Every suppression recorded this run, for `--format json`. */
+export declare function commentSuppressions(): readonly {
+    ruleId: string;
+    file: string;
+}[];
+/**
+ * One or more lines naming what inline comments suppressed, or `undefined` when
+ * nothing was.
+ *
+ * `undefined` rather than `''` so a caller cannot print a blank line by
+ * forgetting to check — both call sites feed this straight to `writeStderr`.
+ */
+export declare function commentSuppressionNotice(): string | undefined;
+//# sourceMappingURL=comment-suppression.d.ts.map

package/dist/comment-suppression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comment-suppression.d.ts","sourceRoot":"","sources":["../src/comment-suppression.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAaH,0EAA0E;AAC1E,wBAAgB,uBAAuB,IAAI,IAAI,CAE9C;AAED,8EAA8E;AAC9E,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAE3E;AAED,gEAAgE;AAChE,wBAAgB,mBAAmB,IAAI,SAAS;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EAAE,CAEjF;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,IAAI,MAAM,GAAG,SAAS,CA0B7D"}

package/dist/comment-suppression.js

@@ -0,0 +1,89 @@
+/**
+ * What inline exclusion comments suppressed, said out loud.
+ *
+ * Every other filter in the pipeline discloses itself: `.excluding()` warns on
+ * a pattern that matched nothing (`execute-rule.ts`), diff-aware has
+ * `suppressionNotice`, the baseline has `unmatchedBaselineFinding`. The inline
+ * comment filter dropped violations and returned no count — and after
+ * [ts-archunit bug 0041](https://github.com/nielspeter/ts-archunit/blob/main/bugs/fixed/0041-an-exclusion-comment-is-a-no-op-for-most-conditions.md)
+ * made comments work for every condition family, it became the **widest** filter
+ * in the pipeline and the only silent one.
+ *
+ * `diff-disclosure.ts` states the principle this module inherits: *a run with
+ * every finding suppressed is indistinguishable from a clean run.* That is the
+ * false green ADR-008 exists to prevent, and it is worse here than for
+ * `--changed`, because a comment is written once and then read by nobody. The
+ * flag at least appears in the CI invocation.
+ *
+ * ## Identities, not a total (ADR-009 rule 4)
+ *
+ * The notice names **which rule in which file**, not just how many. A count is a
+ * snapshot: it moves when anything moves and tells the reader nothing about what
+ * to look at. `arch/no-cycles in src/legacy/gateway.ts` is an identity — it
+ * survives a renumbering and it is greppable.
+ *
+ * Capped, and the cap is disclosed rather than silent: a suite with hundreds of
+ * exemptions should not print hundreds of lines on every green run, but
+ * "and 47 more" is a very different statement from printing 3 and implying that
+ * is all of them.
+ *
+ * ## Why module state
+ *
+ * `applyFilters` runs once per rule and has no view of the run. This is the same
+ * shape `edge-coverage.ts` uses for the same reason: accumulate per rule, reset
+ * at the run boundary, render once. The two aggregating surfaces — CLI `check`
+ * and `checkAll` — both already call a reset and read a notice, so this hooks
+ * into a pattern that exists rather than inventing one.
+ *
+ * The per-rule terminals (`.check()` / `.warn()` on a single rule) have no run
+ * boundary, so they do not render it. Same honest limitation `diff-disclosure`
+ * documents and for the same reason: a per-rule count presented as a run total
+ * would be wrong, and 79 lines on a 79-rule suite is not disclosure.
+ */
+let suppressions = [];
+/** How many identities the notice lists before summarising the remainder. */
+const LISTED = 5;
+/** Start a run. Both aggregating surfaces call this before evaluating. */
+export function resetCommentSuppression() {
+    suppressions = [];
+}
+/** Record that a comment suppressed a finding. Called from `applyFilters`. */
+export function recordCommentSuppression(ruleId, file) {
+    suppressions.push({ ruleId, file });
+}
+/** Every suppression recorded this run, for `--format json`. */
+export function commentSuppressions() {
+    return suppressions;
+}
+/**
+ * One or more lines naming what inline comments suppressed, or `undefined` when
+ * nothing was.
+ *
+ * `undefined` rather than `''` so a caller cannot print a blank line by
+ * forgetting to check — both call sites feed this straight to `writeStderr`.
+ */
+export function commentSuppressionNotice() {
+    if (suppressions.length === 0)
+        return undefined;
+    const total = suppressions.length;
+    const findings = total === 1 ? 'finding' : 'findings';
+    const head = `[eess] ${String(total)} ${findings} suppressed by inline ` +
+        `// eess-exclude comments. They are exemptions, not passes:`;
+    // Deduplicate by identity so one rule silenced ten times in one file reads as
+    // one line with a count, rather than ten lines that look like ten problems.
+    const byIdentity = new Map();
+    for (const s of suppressions) {
+        const key = `${s.ruleId} in ${s.file === '' ? '(no file)' : s.file}`;
+        byIdentity.set(key, (byIdentity.get(key) ?? 0) + 1);
+    }
+    const entries = [...byIdentity.entries()];
+    const shown = entries.slice(0, LISTED);
+    const lines = shown.map(([key, n]) => `  - ${key}${n > 1 ? ` (${String(n)}×)` : ''}`);
+    // The cap is stated. A silent truncation reads as "that is all of them", which
+    // is the same lie as no disclosure at all.
+    if (entries.length > LISTED) {
+        lines.push(`  - …and ${String(entries.length - LISTED)} more`);
+    }
+    return [head, ...lines].join('\n');
+}
+//# sourceMappingURL=comment-suppression.js.map

package/dist/comment-suppression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"comment-suppression.js","sourceRoot":"","sources":["../src/comment-suppression.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAQH,IAAI,YAAY,GAAkB,EAAE,CAAA;AAEpC,6EAA6E;AAC7E,MAAM,MAAM,GAAG,CAAC,CAAA;AAEhB,0EAA0E;AAC1E,MAAM,UAAU,uBAAuB;IACrC,YAAY,GAAG,EAAE,CAAA;AACnB,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,wBAAwB,CAAC,MAAc,EAAE,IAAY;IACnE,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;AACrC,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,mBAAmB;IACjC,OAAO,YAAY,CAAA;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB;IACtC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IAE/C,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAA;IACjC,MAAM,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAA;IACrD,MAAM,IAAI,GACR,UAAU,MAAM,CAAC,KAAK,CAAC,IAAI,QAAQ,wBAAwB;QAC3D,4DAA4D,CAAA;IAE9D,8EAA8E;IAC9E,4EAA4E;IAC5E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACpE,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACrD,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAA;IACzC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;IACtC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACrF,+EAA+E;IAC/E,2CAA2C;IAC3C,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,YAAY,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;IAChE,CAAC;IACD,OAAO,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACpC,CAAC"}

package/dist/condition.d.ts

@@ -1,4 +1,7 @@
 import type { ArchViolation } from './violation.js';
+import { type CollectResult } from './collect-result.js';
+import type { DeclaredGlobs } from './glob-site.js';
+import type { RuleMetadata } from './rule-metadata.js';
 /**
  * Context passed to conditions during evaluation.
  *
@@ -32,6 +35,25 @@ export interface ConditionContext {
      */
     identifyByArgument?: number;
 }
+/**
+ * The context a condition receives, projected from what the rule declared.
+ *
+ * Four of the five fields are read off `RuleMetadata` identically everywhere;
+ * only `rule` — the assembled English sentence — differs, because the kernel's
+ * `RuleBuilder` builds it from its own lists and `eess-ts`'s builds it from a
+ * `DeclaredRule`. The two bodies were 93% similar with that as the sole varying
+ * axis.
+ *
+ * Worth one owner beyond the duplicate count: this context is what a violation
+ * message is written from, so a field silently absent on one side of the family
+ * produces findings that name their rule in one dialect and not the other —
+ * exactly the "a violation must be actionable" clause of ADR-009.
+ */
+export declare function conditionContextFrom(opts: {
+    metadata: RuleMetadata | undefined;
+    reason: string | undefined;
+    rule: string;
+}): ConditionContext;
 /**
  * A condition that evaluates filtered elements and returns violations.
  *
@@ -52,5 +74,26 @@ export interface Condition<T> {
      * @returns Violations for elements that don't satisfy the condition
      */
     evaluate(elements: T[], context: ConditionContext): ArchViolation[];
+    /**
+     * The path globs this condition matches against, if any. See
+     * `Predicate.globs` — same contract, stamped with `position: 'condition'`.
+     */
+    readonly globs?: DeclaredGlobs;
 }
+/**
+ * Run every condition over the selected elements, carrying the evidence.
+ *
+ * `examined` is the count the conditions were actually HANDED — not the
+ * pre-predicate population — and that distinction is the reason this is shared
+ * rather than written per builder. `graphql/resolver-rule-builder.ts` records
+ * what happened when two sibling builders derived it separately: one counted
+ * pre-predicate and the other post, and a chain whose `.that()` selected nothing
+ * reported 14 units examined, handed its conditions 0, and passed green with
+ * `diagnose()` silent. That is the fail-open cell ADR-009 exists to close.
+ *
+ * The zero-element early exit is stated rather than implied by an empty
+ * violation list (plan 0098): a receipt with `examined: 0` is the
+ * zero-evidence case, and ADR-010 wants it said out loud.
+ */
+export declare function evaluateConditions<T>(elements: T[], conditions: readonly Condition<T>[], context: ConditionContext): CollectResult;
 //# sourceMappingURL=condition.d.ts.map

package/dist/condition.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"condition.d.ts","sourceRoot":"","sources":["../src/condition.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAEnD;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAA;IACZ,iDAAiD;IACjD,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,gDAAgD;IAChD,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,2DAA2D;IAC3D,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,iDAAiD;IACjD,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;;;;;;;;;;;;OAaG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAA;CAC5B;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,+DAA+D;IAC/D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAE5B;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,gBAAgB,GAAG,aAAa,EAAE,CAAA;CACpE"}
+{"version":3,"file":"condition.d.ts","sourceRoot":"","sources":["../src/condition.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AACnD,OAAO,EAAE,KAAK,aAAa,EAAiB,MAAM,qBAAqB,CAAA;AACvE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AACnD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AAEtD;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sEAAsE;IACtE,IAAI,EAAE,MAAM,CAAA;IACZ,iDAAiD;IACjD,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,gDAAgD;IAChD,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,2DAA2D;IAC3D,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,iDAAiD;IACjD,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;;;;;;;;;;;;OAaG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAA;CAC5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE;IACzC,QAAQ,EAAE,YAAY,GAAG,SAAS,CAAA;IAClC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;IAC1B,IAAI,EAAE,MAAM,CAAA;CACb,GAAG,gBAAgB,CAQnB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,+DAA+D;IAC/D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAE5B;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,gBAAgB,GAAG,aAAa,EAAE,CAAA;IAEnE;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,CAAA;CAC/B;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,QAAQ,EAAE,CAAC,EAAE,EACb,UAAU,EAAE,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,EACnC,OAAO,EAAE,gBAAgB,GACxB,aAAa,CAOf"}

package/dist/condition.js

@@ -1,2 +1,49 @@
-export {};
+import { collectResult } from './collect-result.js';
+/**
+ * The context a condition receives, projected from what the rule declared.
+ *
+ * Four of the five fields are read off `RuleMetadata` identically everywhere;
+ * only `rule` — the assembled English sentence — differs, because the kernel's
+ * `RuleBuilder` builds it from its own lists and `eess-ts`'s builds it from a
+ * `DeclaredRule`. The two bodies were 93% similar with that as the sole varying
+ * axis.
+ *
+ * Worth one owner beyond the duplicate count: this context is what a violation
+ * message is written from, so a field silently absent on one side of the family
+ * produces findings that name their rule in one dialect and not the other —
+ * exactly the "a violation must be actionable" clause of ADR-009.
+ */
+export function conditionContextFrom(opts) {
+    return {
+        rule: opts.rule,
+        because: opts.reason,
+        ruleId: opts.metadata?.id,
+        suggestion: opts.metadata?.suggestion,
+        docs: opts.metadata?.docs,
+    };
+}
+/**
+ * Run every condition over the selected elements, carrying the evidence.
+ *
+ * `examined` is the count the conditions were actually HANDED — not the
+ * pre-predicate population — and that distinction is the reason this is shared
+ * rather than written per builder. `graphql/resolver-rule-builder.ts` records
+ * what happened when two sibling builders derived it separately: one counted
+ * pre-predicate and the other post, and a chain whose `.that()` selected nothing
+ * reported 14 units examined, handed its conditions 0, and passed green with
+ * `diagnose()` silent. That is the fail-open cell ADR-009 exists to close.
+ *
+ * The zero-element early exit is stated rather than implied by an empty
+ * violation list (plan 0098): a receipt with `examined: 0` is the
+ * zero-evidence case, and ADR-010 wants it said out loud.
+ */
+export function evaluateConditions(elements, conditions, context) {
+    if (elements.length === 0)
+        return collectResult([], { examined: 0 });
+    const violations = [];
+    for (const condition of conditions) {
+        violations.push(...condition.evaluate(elements, context));
+    }
+    return collectResult(violations, { examined: elements.length });
+}
 //# sourceMappingURL=condition.js.map

package/dist/condition.js.map

@@ -1 +1 @@
-{"version":3,"file":"condition.js","sourceRoot":"","sources":["../src/condition.ts"],"names":[],"mappings":""}
+{"version":3,"file":"condition.js","sourceRoot":"","sources":["../src/condition.ts"],"names":[],"mappings":"AACA,OAAO,EAAsB,aAAa,EAAE,MAAM,qBAAqB,CAAA;AAsCvE;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAIpC;IACC,OAAO;QACL,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO,EAAE,IAAI,CAAC,MAAM;QACpB,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE;QACzB,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU;QACrC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI;KAC1B,CAAA;AACH,CAAC;AA+BD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAAa,EACb,UAAmC,EACnC,OAAyB;IAEzB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAA;IACpE,MAAM,UAAU,GAAoB,EAAE,CAAA;IACtC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,UAAU,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAA;IAC3D,CAAC;IACD,OAAO,aAAa,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;AACjE,CAAC"}

package/dist/correspondence-core.d.ts

@@ -0,0 +1,35 @@
+/**
+ * F2 — the shared set-difference + non-vacuity core.
+ *
+ * Pure and engine-neutral: it compares two key sets by **identity** and reports
+ * the asymmetric differences plus emptiness. It never counts and never decides
+ * policy — the caller chooses which differences are violations (coverage /
+ * orphans / bijection) and how to treat an empty side (non-vacuity).
+ *
+ * Both `correspondence()` (plan 0064+/proposal 017) and `crossLayer`'s
+ * existence check (`haveMatchingCounterpart`) build on this one function, so
+ * the two "every X has a matching Y" engines can never drift — and neither can
+ * silently green on an empty side (ADR-008).
+ */
+/** The identity comparison of two key sets. No counts — sets of keys. */
+export interface CorrespondenceResult {
+    /** Side-A keys with no match in side B — coverage gaps. */
+    readonly missing: readonly string[];
+    /** Side-B keys with no match in side A — orphans. */
+    readonly orphans: readonly string[];
+    /** True when side A contributed zero keys (non-vacuity signal). */
+    readonly aEmpty: boolean;
+    /** True when side B contributed zero keys (non-vacuity signal). */
+    readonly bEmpty: boolean;
+}
+/**
+ * Compare two key sets by identity.
+ *
+ * `missing` = A \ B (every A-key must have a B match for coverage).
+ * `orphans` = B \ A (every B-key must have an A source for no-orphans).
+ * Bijection holds iff both are empty. Duplicate keys within a side collapse
+ * (set semantics); order of `missing`/`orphans` follows first appearance in
+ * the respective input for stable, readable output.
+ */
+export declare function setCorrespondence(aKeys: Iterable<string>, bKeys: Iterable<string>): CorrespondenceResult;
+//# sourceMappingURL=correspondence-core.d.ts.map

package/dist/correspondence-core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"correspondence-core.d.ts","sourceRoot":"","sources":["../src/correspondence-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,yEAAyE;AACzE,MAAM,WAAW,oBAAoB;IACnC,2DAA2D;IAC3D,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,qDAAqD;IACrD,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;IACxB,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;CACzB;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EACvB,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,GACtB,oBAAoB,CAetB"}

package/dist/correspondence-core.js

@@ -0,0 +1,38 @@
+/**
+ * F2 — the shared set-difference + non-vacuity core.
+ *
+ * Pure and engine-neutral: it compares two key sets by **identity** and reports
+ * the asymmetric differences plus emptiness. It never counts and never decides
+ * policy — the caller chooses which differences are violations (coverage /
+ * orphans / bijection) and how to treat an empty side (non-vacuity).
+ *
+ * Both `correspondence()` (plan 0064+/proposal 017) and `crossLayer`'s
+ * existence check (`haveMatchingCounterpart`) build on this one function, so
+ * the two "every X has a matching Y" engines can never drift — and neither can
+ * silently green on an empty side (ADR-008).
+ */
+/**
+ * Compare two key sets by identity.
+ *
+ * `missing` = A \ B (every A-key must have a B match for coverage).
+ * `orphans` = B \ A (every B-key must have an A source for no-orphans).
+ * Bijection holds iff both are empty. Duplicate keys within a side collapse
+ * (set semantics); order of `missing`/`orphans` follows first appearance in
+ * the respective input for stable, readable output.
+ */
+export function setCorrespondence(aKeys, bKeys) {
+    const a = new Set(aKeys);
+    const b = new Set(bKeys);
+    const missing = [];
+    for (const key of a) {
+        if (!b.has(key))
+            missing.push(key);
+    }
+    const orphans = [];
+    for (const key of b) {
+        if (!a.has(key))
+            orphans.push(key);
+    }
+    return { missing, orphans, aEmpty: a.size === 0, bEmpty: b.size === 0 };
+}
+//# sourceMappingURL=correspondence-core.js.map

package/dist/correspondence-core.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"correspondence-core.js","sourceRoot":"","sources":["../src/correspondence-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAcH;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAuB,EACvB,KAAuB;IAEvB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;IACxB,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;IAExB,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpC,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAA;AACzE,CAAC"}

package/dist/correspondence.d.ts

@@ -1,5 +1,5 @@
-import type { ArchViolation } from './violation.js';
-import { TerminalBuilder } from './terminal-builder.js';
+import type { Predicate } from './predicate.js';
+import { TerminalBuilder, type CollectResult } from './terminal-builder.js';
 /** How to identify an element for a two-sided violation message. */
 export interface ElementInfo {
     readonly name: string;
@@ -65,14 +65,66 @@ export declare class CorrespondenceBuilder<L, R> extends TerminalBuilder {
     should(): this;
     /** Chain another correspondence check (AND). */
     andShould(): this;
-    /** Every element on the named side(s) has a counterpart on the other. */
+    /**
+     * Every element on the named side(s) has a counterpart on the other. An
+     * absence assertion — "no element lacks a counterpart" — so it's marked
+     * cardinality-exempt (see `assertsCardinality()`).
+     */
     beComplete(opts?: {
         direction?: Direction;
     }): this;
-    /** Related endpoints on one side have matching relations on the other. */
+    /**
+     * Related endpoints on one side have matching relations on the other. Also
+     * an absence assertion — "no matched pair disagrees" — cardinality-exempt
+     * for the same reason `beComplete()` is.
+     */
     preserveRelations(spec: RelationSpec<L, R>): this;
-    protected collectViolations(): ArchViolation[];
+    protected collectViolations(): CollectResult;
+    /**
+     * ADR-010: mirrors `RuleBuilder.assertsCardinality()` — per-check, not a
+     * blanket class-wide exemption. `beComplete()`/`preserveRelations()` mark
+     * the function they push via `marksAssertsCardinality()`, the same
+     * unforgeable registry `.notExist()` uses, because both are absence
+     * assertions ("no element lacks a counterpart", "no matched pair
+     * disagrees") that can never produce a violation from an empty side — an
+     * empty selection here is the correctly computed input (e.g. release-gate's
+     * "no packages changed this diff" on a clean tree), not a broken instrument.
+     * `.every()`, not `.some()`, for the same reason `RuleBuilder` uses it: a
+     * future check type that isn't an absence assertion must not silently
+     * inherit this exemption just because it's chained alongside one that is.
+     * An empty `_checks` list is not exempt — nothing was asserted yet.
+     */
+    protected assertsCardinality(): boolean;
 }
 /** Bind two selections into a correspondence. */
 export declare function correspondence<L, R>(opts: CorrespondenceOptions<L, R>): CorrespondenceBuilder<L, R>;
+/**
+ * The elements a rule's predicates admit, as a `Selection`.
+ *
+ * A free function over the elements and the predicates rather than a method,
+ * for the same reason as `recordExclusions`: the two builders that need it sit
+ * in incompatible hierarchies — `eess-ts` has three levels where the kernel has
+ * two — so there is no common base to hold it. The two copies were
+ * byte-identical.
+ */
+export declare function selectMatching<T>(elements: readonly T[], predicates: readonly Predicate<T>[], opts: {
+    label: string;
+    identify: (element: T) => ElementInfo;
+}): Selection<T>;
+/**
+ * The elements every predicate admits.
+ *
+ * The same conjunction as `selectMatching`, without a `Selection` around it —
+ * split out because `eess-ts`'s two GraphQL builders want the ARRAY, to memoise
+ * it as the one set both `check()` and `diagnose()` read (plan 0096). They each
+ * carried this filter inline, byte for byte, which `no-copy-paste` reported at
+ * 100%; folding them onto `selectMatching` was not open, since a `Selection`
+ * carries a label and an `identify` neither of them has at that point.
+ *
+ * Sharing it with `selectMatching` matters beyond the duplicate count: "the
+ * elements a rule selected" must be ONE answer, or a builder's `.select()` side
+ * and its condition side can disagree about which elements the predicates
+ * admitted — the divergence ADR-010 exists to make impossible.
+ */
+export declare function matchingElements<T>(elements: readonly T[], predicates: readonly Predicate<T>[]): T[];
 //# sourceMappingURL=correspondence.d.ts.map

package/dist/correspondence.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"correspondence.d.ts","sourceRoot":"","sources":["../src/correspondence.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AAGvD,oEAAoE;AACpE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,WAAW,CAAA;CAC/C;AAED,MAAM,MAAM,SAAS,GAAG,eAAe,GAAG,eAAe,GAAG,MAAM,CAAA;AAElE,2EAA2E;AAC3E,MAAM,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,CAAA;IAChD,QAAQ,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,CAAA;IACjD,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAA;CAC/B;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAClB,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAA;CAAE,CAAA;AAEzE,MAAM,WAAW,qBAAqB,CAAC,CAAC,EAAE,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAA;IAC5B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACjD,mEAAmE;IACnE,QAAQ,CAAC,OAAO,CAAC,EAAE;QACjB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;QAClE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;KACnE,CAAA;CACF;AAgBD;;;;;;GAMG;AACH,qBAAa,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,eAAe;IAGlD,OAAO,CAAC,QAAQ,CAAC,IAAI;IAFjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoB;gBAEf,IAAI,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC;IAI9D,2DAA2D;IAC3D,MAAM,IAAI,IAAI;IAId,gDAAgD;IAChD,SAAS,IAAI,IAAI;IAIjB,yEAAyE;IACzE,UAAU,CAAC,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,SAAS,CAAA;KAAO,GAAG,IAAI;IAKtD,0EAA0E;IAC1E,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI;IAKjD,SAAS,CAAC,iBAAiB,IAAI,aAAa,EAAE;CAI/C;AAED,iDAAiD;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EACjC,IAAI,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,GAChC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAE7B"}
+{"version":3,"file":"correspondence.d.ts","sourceRoot":"","sources":["../src/correspondence.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC/C,OAAO,EAAE,eAAe,EAAE,KAAK,aAAa,EAAE,MAAM,uBAAuB,CAAA;AAO3E,oEAAoE;AACpE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CACvB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAA;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,WAAW,CAAA;CAC/C;AAED,MAAM,MAAM,SAAS,GAAG,eAAe,GAAG,eAAe,GAAG,MAAM,CAAA;AAElE,2EAA2E;AAC3E,MAAM,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,CAAA;IAChD,QAAQ,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,CAAA;IACjD,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAA;CAC/B;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAClB,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,GAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAA;CAAE,CAAA;AAEzE,MAAM,WAAW,qBAAqB,CAAC,CAAC,EAAE,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAA;IAC5B,yFAAyF;IACzF,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAA;IACjD,mEAAmE;IACnE,QAAQ,CAAC,OAAO,CAAC,EAAE;QACjB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;QAClE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;KACnE,CAAA;CACF;AAgBD;;;;;;GAMG;AACH,qBAAa,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,eAAe;IAGlD,OAAO,CAAC,QAAQ,CAAC,IAAI;IAFjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoB;gBAEf,IAAI,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC;IAI9D,2DAA2D;IAC3D,MAAM,IAAI,IAAI;IAId,gDAAgD;IAChD,SAAS,IAAI,IAAI;IAIjB;;;;OAIG;IACH,UAAU,CAAC,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,SAAS,CAAA;KAAO,GAAG,IAAI;IAStD;;;;OAIG;IACH,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI;IASjD,SAAS,CAAC,iBAAiB,IAAI,aAAa;IAW5C;;;;;;;;;;;;;OAaG;cACgB,kBAAkB,IAAI,OAAO;CAIjD;AAED,iDAAiD;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EACjC,IAAI,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,GAChC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAE7B;AA6GD;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAC9B,QAAQ,EAAE,SAAS,CAAC,EAAE,EACtB,UAAU,EAAE,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,EACnC,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,WAAW,CAAA;CAAE,GAC7D,SAAS,CAAC,CAAC,CAAC,CAMd;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,QAAQ,EAAE,SAAS,CAAC,EAAE,EACtB,UAAU,EAAE,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,GAClC,CAAC,EAAE,CAEL"}