@aldus-runtime/regression 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,21 @@
+Aldus
+Copyright 2026 Jam Chen
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this software except in compliance with the License. You may obtain a copy of
+the License in the LICENSE file distributed with this software, or at:
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Aldus is currently owned as personal work and has not been assigned to a
+separate legal entity. If ownership is transferred, this file and the related
+copyright statements will be updated at that time.
+
+No third-party code is bundled, inlined, or vendored into any published Aldus
+package. Dependencies are resolved at install time and reach the consumer under
+their own licenses, from their own publishers. The dependency audit is recorded
+in THIRD-PARTY-NOTICES.md.
+
+This NOTICE file exists by the project's choice rather than by obligation:
+Apache-2.0 section 4(d) governs the preservation of a NOTICE file when the work
+already carries one, and does not itself require that one be created.

package/dist/blindspots.d.ts

@@ -0,0 +1,107 @@
+/**
+ * The known-blind-spot registry (architecture contract §12.1, §9.3).
+ *
+ * §12.1 lists "known blind spots" among what evaluator promotion must consider, and §9.3 makes
+ * negative knowledge first-class: "Known failed approaches, unsafe transformations, evaluator
+ * blind spots, and provider limitations SHOULD be first-class pack content. Learning does not
+ * mean storing only successful examples."
+ *
+ * A blind spot is a failure mode an evaluator is *known* not to catch. It matters to promotion
+ * precisely because the corpus does not contain it — so metrics computed over the corpus are not
+ * evidence against a blind spot, they are evidence that the corpus did not look. An evaluator
+ * with an open blind spot in a slice should never read as promotable in that slice, however good
+ * its numbers are.
+ *
+ * ### Relationship to Knowledge Packs
+ *
+ * `KnowledgePackManifest.negativeKnowledge` (WP-09) holds *resource paths* — Core indexes them
+ * and never parses what is behind them (§1.2, §9.1). This registry holds the structured,
+ * machine-checkable records that gate promotion. They are complementary: a pack points at the
+ * prose describing a blind spot, and this registry carries the part a policy can evaluate.
+ */
+import { z } from "zod";
+import { type ScopeSelector } from "./scope.js";
+/** How a blind spot has been dealt with. */
+export declare const BLIND_SPOT_STATUSES: readonly [
+/** Demonstrated and unaddressed. Disqualifies promotion in scope. */
+"open", 
+/** Addressed, with the mitigation recorded. */
+"mitigated", 
+/**
+ * Known, unmitigated, and deliberately tolerated.
+ *
+ * Distinct from `mitigated` because it is a decision, not a fix — and it must stay visible in
+ * the promotion report so tolerating it is a standing choice rather than a forgotten one.
+ */
+"accepted"];
+/** @see BLIND_SPOT_STATUSES */
+export type BlindSpotStatus = (typeof BLIND_SPOT_STATUSES)[number];
+/** A failure mode an evaluator is known not to catch. */
+export declare const blindSpotSchema: z.ZodObject<{
+    blindSpotId: z.ZodString;
+    evaluatorId: z.ZodString;
+    description: z.ZodString;
+    scope: z.ZodRecord<z.ZodString, z.ZodString>;
+    category: z.ZodOptional<z.ZodString>;
+    severity: z.ZodOptional<z.ZodString>;
+    status: z.ZodEnum<{
+        accepted: "accepted";
+        mitigated: "mitigated";
+        open: "open";
+    }>;
+    evidenceCaseIds: z.ZodArray<z.ZodString>;
+    mitigation: z.ZodOptional<z.ZodString>;
+    recordedBy: z.ZodObject<{
+        kind: z.ZodEnum<{
+            agent: "agent";
+            human: "human";
+            system: "system";
+            worker: "worker";
+        }>;
+        id: z.ZodString;
+        displayName: z.ZodOptional<z.ZodString>;
+        backendId: z.ZodOptional<z.ZodString>;
+        sessionRef: z.ZodOptional<z.ZodString>;
+    }, z.core.$strip>;
+    recordedAt: z.ZodISODateTime;
+}, z.core.$strip>;
+/** @see blindSpotSchema */
+export type BlindSpot = z.infer<typeof blindSpotSchema>;
+/**
+ * An in-memory, serialisable set of blind-spot records.
+ *
+ * Deliberately not file-backed. Persistence is the caller's choice — these records belong
+ * alongside an adopter's Knowledge Packs (§9.3), and binding the registry to one storage
+ * implementation would put a storage dependency in a package that only needs to read a list.
+ */
+export declare class BlindSpotRegistry {
+    #private;
+    /** Build a registry from records, validating each. */
+    static from(records: readonly unknown[]): BlindSpotRegistry;
+    /**
+     * Validate and add one record.
+     *
+     * @throws {AldusError} `ALDUS_BLIND_SPOT_MALFORMED` or `ALDUS_BLIND_SPOT_DUPLICATE`.
+     */
+    record(input: unknown): BlindSpot;
+    /** Every record, in insertion order. */
+    list(): BlindSpot[];
+    /** Every record for one evaluator. */
+    forEvaluator(evaluatorId: string): BlindSpot[];
+    /**
+     * Open blind spots for an evaluator that apply within a scope slice.
+     *
+     * A blind spot applies to a slice when everything it scopes itself to is either held at the
+     * same value by the slice, or not held by the slice at all. The second half matters: a blind
+     * spot scoped to one voice applies to the whole-corpus slice, because the whole corpus
+     * includes that voice.
+     */
+    openFor(evaluatorId: string, selector: ScopeSelector): BlindSpot[];
+    /** Blind spots demonstrated by at least one case in a corpus subset. */
+    demonstratedBy(evaluatorId: string, caseIds: ReadonlySet<string>): BlindSpot[];
+    /** Serialisable form. */
+    toJSON(): BlindSpot[];
+}
+/** True when a blind spot's own scope is satisfied by a case's scope. */
+export declare function blindSpotCoversCase(record: BlindSpot, scope: Readonly<Record<string, string>>): boolean;
+//# sourceMappingURL=blindspots.d.ts.map

package/dist/blindspots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blindspots.d.ts","sourceRoot":"","sources":["../src/blindspots.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAGH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,YAAY,CAAC;AAE9D,4CAA4C;AAC5C,eAAO,MAAM,mBAAmB;AAC9B,qEAAqE;AACrE,MAAM;AACN,+CAA+C;AAC/C,WAAW;AACX;;;;;GAKG;AACH,UAAU,CACF,CAAC;AAEX,+BAA+B;AAC/B,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE,yDAAyD;AACzD,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA4CxB,CAAC;AAEL,2BAA2B;AAC3B,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,eAAe,CAAC,CAAC;AAExD;;;;;;GAMG;AACH,qBAAa,iBAAiB;;IAG5B,sDAAsD;IACtD,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,OAAO,EAAE,GAAG,iBAAiB,CAI1D;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,CA2BhC;IAED,wCAAwC;IACxC,IAAI,IAAI,SAAS,EAAE,CAElB;IAED,sCAAsC;IACtC,YAAY,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,EAAE,CAE7C;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,GAAG,SAAS,EAAE,CAQjE;IAED,wEAAwE;IACxE,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,SAAS,EAAE,CAI7E;IAED,yBAAyB;IACzB,MAAM,IAAI,SAAS,EAAE,CAEpB;CACF;AAED,yEAAyE;AACzE,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACtC,OAAO,CAKT"}

package/dist/blindspots.js

@@ -0,0 +1,169 @@
+/**
+ * The known-blind-spot registry (architecture contract §12.1, §9.3).
+ *
+ * §12.1 lists "known blind spots" among what evaluator promotion must consider, and §9.3 makes
+ * negative knowledge first-class: "Known failed approaches, unsafe transformations, evaluator
+ * blind spots, and provider limitations SHOULD be first-class pack content. Learning does not
+ * mean storing only successful examples."
+ *
+ * A blind spot is a failure mode an evaluator is *known* not to catch. It matters to promotion
+ * precisely because the corpus does not contain it — so metrics computed over the corpus are not
+ * evidence against a blind spot, they are evidence that the corpus did not look. An evaluator
+ * with an open blind spot in a slice should never read as promotable in that slice, however good
+ * its numbers are.
+ *
+ * ### Relationship to Knowledge Packs
+ *
+ * `KnowledgePackManifest.negativeKnowledge` (WP-09) holds *resource paths* — Core indexes them
+ * and never parses what is behind them (§1.2, §9.1). This registry holds the structured,
+ * machine-checkable records that gate promotion. They are complementary: a pack points at the
+ * prose describing a blind spot, and this registry carries the part a policy can evaluate.
+ */
+import { actorRefSchema } from "@aldus-runtime/core";
+import { z } from "zod";
+import { findingCategory, scopeDimensions, severityLevel } from "./corpus.js";
+import { RegressionErrorCodes, regressionError } from "./errors.js";
+import { scopeMatches } from "./scope.js";
+/** How a blind spot has been dealt with. */
+export const BLIND_SPOT_STATUSES = [
+    /** Demonstrated and unaddressed. Disqualifies promotion in scope. */
+    "open",
+    /** Addressed, with the mitigation recorded. */
+    "mitigated",
+    /**
+     * Known, unmitigated, and deliberately tolerated.
+     *
+     * Distinct from `mitigated` because it is a decision, not a fix — and it must stay visible in
+     * the promotion report so tolerating it is a standing choice rather than a forgotten one.
+     */
+    "accepted",
+];
+/** A failure mode an evaluator is known not to catch. */
+export const blindSpotSchema = z
+    .object({
+    /** Identity of this record. */
+    blindSpotId: z.string().min(1).max(200),
+    /** Evaluator the blind spot belongs to. */
+    evaluatorId: z.string().min(1).max(200),
+    /** What the evaluator fails to catch. Prose, for a human reading the promotion report. */
+    description: z.string().min(1).max(4000),
+    /**
+     * Scope the blind spot applies to.
+     *
+     * An empty scope means it applies everywhere. A scoped blind spot disqualifies only the
+     * slices it covers — an evaluator blind to one voice's artefacts is not thereby disqualified
+     * for every other voice.
+     */
+    scope: scopeDimensions,
+    /** Category from the adopter's taxonomy, where the blind spot maps to one (§12.3). */
+    category: findingCategory.optional(),
+    /** Severity of what goes undetected. */
+    severity: severityLevel.optional(),
+    /** Current status. */
+    status: z.enum(BLIND_SPOT_STATUSES),
+    /**
+     * Cases that demonstrate it, where the corpus contains any.
+     *
+     * Often empty, and that is the point: a blind spot the corpus can demonstrate is a
+     * measurable false negative, while one it cannot is invisible to every metric here.
+     */
+    evidenceCaseIds: z.array(z.string().min(1).max(200)).max(1024),
+    /** What was done about it. Required in spirit when `mitigated`; prose either way. */
+    mitigation: z.string().max(4000).optional(),
+    /** Who recorded it (contract §19.2). */
+    recordedBy: actorRefSchema,
+    /** When it was recorded. */
+    recordedAt: z.iso.datetime({ offset: true }),
+})
+    .meta({
+    id: "BlindSpot",
+    title: "BlindSpot",
+    description: "A failure mode an evaluator is known not to catch (architecture contract §12.1, §9.3). " +
+        "Corpus metrics are not evidence against a blind spot — a blind spot is by definition " +
+        "something the corpus did not sample. An `open` blind spot in scope disqualifies promotion " +
+        "there regardless of metrics.",
+});
+/**
+ * An in-memory, serialisable set of blind-spot records.
+ *
+ * Deliberately not file-backed. Persistence is the caller's choice — these records belong
+ * alongside an adopter's Knowledge Packs (§9.3), and binding the registry to one storage
+ * implementation would put a storage dependency in a package that only needs to read a list.
+ */
+export class BlindSpotRegistry {
+    #records = new Map();
+    /** Build a registry from records, validating each. */
+    static from(records) {
+        const registry = new BlindSpotRegistry();
+        for (const record of records)
+            registry.record(record);
+        return registry;
+    }
+    /**
+     * Validate and add one record.
+     *
+     * @throws {AldusError} `ALDUS_BLIND_SPOT_MALFORMED` or `ALDUS_BLIND_SPOT_DUPLICATE`.
+     */
+    record(input) {
+        const result = blindSpotSchema.safeParse(input);
+        if (!result.success) {
+            // Paths and issue codes only — never the received value (contract §19.2).
+            throw regressionError(RegressionErrorCodes.BLIND_SPOT_MALFORMED, "The blind-spot record does not validate.", {
+                category: "validation",
+                details: {
+                    issues: result.error.issues.map((issue) => ({
+                        path: issue.path.join("."),
+                        code: issue.code,
+                    })),
+                },
+            });
+        }
+        if (this.#records.has(result.data.blindSpotId)) {
+            throw regressionError(RegressionErrorCodes.BLIND_SPOT_DUPLICATE, `A blind spot with id "${result.data.blindSpotId}" is already registered.`, { category: "conflict", details: { blindSpotId: result.data.blindSpotId } });
+        }
+        this.#records.set(result.data.blindSpotId, result.data);
+        return result.data;
+    }
+    /** Every record, in insertion order. */
+    list() {
+        return [...this.#records.values()];
+    }
+    /** Every record for one evaluator. */
+    forEvaluator(evaluatorId) {
+        return this.list().filter((record) => record.evaluatorId === evaluatorId);
+    }
+    /**
+     * Open blind spots for an evaluator that apply within a scope slice.
+     *
+     * A blind spot applies to a slice when everything it scopes itself to is either held at the
+     * same value by the slice, or not held by the slice at all. The second half matters: a blind
+     * spot scoped to one voice applies to the whole-corpus slice, because the whole corpus
+     * includes that voice.
+     */
+    openFor(evaluatorId, selector) {
+        return this.forEvaluator(evaluatorId).filter((record) => {
+            if (record.status !== "open")
+                return false;
+            return Object.entries(record.scope).every(([dimension, value]) => {
+                const held = selector.values[dimension];
+                return held === undefined || held === value;
+            });
+        });
+    }
+    /** Blind spots demonstrated by at least one case in a corpus subset. */
+    demonstratedBy(evaluatorId, caseIds) {
+        return this.forEvaluator(evaluatorId).filter((record) => record.evidenceCaseIds.some((caseId) => caseIds.has(caseId)));
+    }
+    /** Serialisable form. */
+    toJSON() {
+        return this.list();
+    }
+}
+/** True when a blind spot's own scope is satisfied by a case's scope. */
+export function blindSpotCoversCase(record, scope) {
+    return scopeMatches(scope, {
+        dimensions: Object.keys(record.scope),
+        values: record.scope,
+    });
+}
+//# sourceMappingURL=blindspots.js.map

package/dist/blindspots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blindspots.js","sourceRoot":"","sources":["../src/blindspots.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC9E,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACpE,OAAO,EAAE,YAAY,EAAsB,MAAM,YAAY,CAAC;AAE9D,4CAA4C;AAC5C,MAAM,CAAC,MAAM,mBAAmB,GAAG;IACjC,qEAAqE;IACrE,MAAM;IACN,+CAA+C;IAC/C,WAAW;IACX;;;;;OAKG;IACH,UAAU;CACF,CAAC;AAKX,yDAAyD;AACzD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC;KAC7B,MAAM,CAAC;IACN,+BAA+B;IAC/B,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACvC,2CAA2C;IAC3C,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACvC,0FAA0F;IAC1F,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;IACxC;;;;;;OAMG;IACH,KAAK,EAAE,eAAe;IACtB,sFAAsF;IACtF,QAAQ,EAAE,eAAe,CAAC,QAAQ,EAAE;IACpC,wCAAwC;IACxC,QAAQ,EAAE,aAAa,CAAC,QAAQ,EAAE;IAClC,sBAAsB;IACtB,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC;IACnC;;;;;OAKG;IACH,eAAe,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;IAC9D,qFAAqF;IACrF,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC3C,wCAAwC;IACxC,UAAU,EAAE,cAAc;IAC1B,4BAA4B;IAC5B,UAAU,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;CAC7C,CAAC;KACD,IAAI,CAAC;IACJ,EAAE,EAAE,WAAW;IACf,KAAK,EAAE,WAAW;IAClB,WAAW,EACT,yFAAyF;QACzF,uFAAuF;QACvF,4FAA4F;QAC5F,8BAA8B;CACjC,CAAC,CAAC;AAKL;;;;;;GAMG;AACH,MAAM,OAAO,iBAAiB;IACnB,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;IAEjD,sDAAsD;IACtD,MAAM,CAAC,IAAI,CAAC,OAA2B;QACrC,MAAM,QAAQ,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,KAAc;QACnB,MAAM,MAAM,GAAG,eAAe,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,0EAA0E;YAC1E,MAAM,eAAe,CACnB,oBAAoB,CAAC,oBAAoB,EACzC,0CAA0C,EAC1C;gBACE,QAAQ,EAAE,YAAY;gBACtB,OAAO,EAAE;oBACP,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAC1C,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;wBAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;qBACjB,CAAC,CAAC;iBACJ;aACF,CACF,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/C,MAAM,eAAe,CACnB,oBAAoB,CAAC,oBAAoB,EACzC,yBAAyB,MAAM,CAAC,IAAI,CAAC,WAAW,0BAA0B,EAC1E,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAC5E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,wCAAwC;IACxC,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,sCAAsC;IACtC,YAAY,CAAC,WAAmB;QAC9B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,WAAmB,EAAE,QAAuB;QAClD,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YACtD,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC3C,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,EAAE;gBAC/D,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACxC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;YAC9C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,wEAAwE;IACxE,cAAc,CAAC,WAAmB,EAAE,OAA4B;QAC9D,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CACtD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAC7D,CAAC;IACJ,CAAC;IAED,yBAAyB;IACzB,MAAM;QACJ,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;CACF;AAED,yEAAyE;AACzE,MAAM,UAAU,mBAAmB,CACjC,MAAiB,EACjB,KAAuC;IAEvC,OAAO,YAAY,CAAC,KAAK,EAAE;QACzB,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACrC,MAAM,EAAE,MAAM,CAAC,KAAK;KACrB,CAAC,CAAC;AACL,CAAC"}