scoutline 0.23.0 → 0.24.0

package/dist/lib/investigate-claims.d.ts

@@ -0,0 +1,90 @@
+/**
+ * Deterministic claim splitting + claim↔evidence matching for
+ * `investigate --verify` (investigate-verify lane, Ticket T1; DESIGN
+ * D2, PRD AC-2/AC-4/AC-5).
+ *
+ * splitClaims: the extract grammar's terminator rules verbatim
+ * (lib/investigate-extract.ts splitWindows) — `[.!?]` followed by a
+ * space (or end of input), or a newline; the terminator char belongs
+ * to the window, the separator run (spaces/tabs) to neither. The
+ * splitter is PURE: the ≤ 8 claim cap is the CALLER's fail-loud
+ * validation (commands/investigate.ts, T3) — a 9-sentence statement
+ * returns 9 claims here, never a throw, never a truncation.
+ *
+ * matchClaimsToEvidence: zero-model, deterministic. Per claim —
+ * terms = normalizeTerms over the claim's stopword-filtered tokens
+ * (reused from lib/investigate-extract.ts, imports only); a passage
+ * matches when any term appears whole-word case-folded in
+ * passage.quote; the negation-cue scan runs over MATCHING passages
+ * only; evidence pointers land in first-encounter order (source
+ * order, then passage order); negationCues counts cue-bearing
+ * matching passages.
+ *
+ * Byte-stable: no clocks, no randomness, no locale-dependent casing
+ * beyond toLowerCase.
+ */
+import type { EvidenceSource } from "../capabilities/investigation.js";
+/**
+ * The verify-mode claim cap (PRD AC-1: > 8 sentence-claims is a
+ * fail-loud VALIDATION_ERROR, the R1 pipe-cap precedent — fail, never
+ * truncate). Exported so the command's error message names the cap
+ * from the single source of truth.
+ */
+export declare const MAX_VERIFY_CLAIMS = 8;
+/**
+ * Split a statement into sentence-claims: extract-grammar windows,
+ * whitespace-only sentences dropped, quotes trimmed. Deterministic —
+ * the same statement yields the identical claim array byte-stably.
+ * `|` needs no handling: claims split on sentences, never pipes.
+ */
+export declare function splitClaims(statement: string): string[];
+/**
+ * The negation-cue list behind `contradicted`. FROZEN and versioned:
+ * additions change verdicts and are release-visible (the parent-owned
+ * CHANGELOG bullet names them). Every cue is a LITERAL whole-word
+ * string (fix-round m1: the parenthesized inflection grammar is gone —
+ * variants spell out; a missing-absence family covers "without",
+ * "lacks", "untrue", "false", "absent", "rarely", "seldom").
+ *
+ * DISCLOSED as hint-grade: `contradicted` means "a term-matching
+ * passage carries a negation cue", NOT semantic contradiction —
+ * semantic judgment stays with the calling agent (agent-synthesis
+ * contract); the per-claim cue count exists for exactly that
+ * re-judgment.
+ */
+export declare const NEGATION_CUES: readonly string[];
+/** The deterministic verdict vocabulary (PRD AC-5). */
+export type ClaimVerdict = "corroborated" | "contradicted" | "unresolved";
+/** One evidence pointer into the pack's own sources array. */
+export interface ClaimEvidencePointer {
+    readonly sourceIndex: number;
+    readonly passageIndex: number;
+}
+/** One claim row: text, verdict, cue count, evidence pointers. */
+export interface ClaimRow {
+    readonly text: string;
+    readonly verdict: ClaimVerdict;
+    /** Number of cue-bearing MATCHING passages (agent re-judgment input). */
+    readonly negationCues: number;
+    readonly evidence: readonly ClaimEvidencePointer[];
+}
+/** The additive verify block (PRD AC-6): statement + per-claim rows. */
+export interface VerifyBlock {
+    readonly statement: string;
+    readonly claims: readonly ClaimRow[];
+}
+export interface MatchClaimsArgs {
+    readonly statement: string;
+    readonly claims: readonly string[];
+    readonly sources: readonly EvidenceSource[];
+}
+/**
+ * Match claims to evidence: per claim, every (source, passage) whose
+ * quote contains ≥ 1 claim term whole-word case-folded becomes an
+ * evidence pointer in first-encounter order; the cue scan runs over
+ * matching passages only; the verdict follows PRD-5 (corroborated =
+ * matches + 0 cues; contradicted = ≥ 1 cue-bearing match; unresolved
+ * = no matches).
+ */
+export declare function matchClaimsToEvidence({ statement, claims, sources }: MatchClaimsArgs): VerifyBlock;
+//# sourceMappingURL=investigate-claims.d.ts.map

package/dist/lib/investigate-claims.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-claims.d.ts","sourceRoot":"","sources":["../../src/lib/investigate-claims.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAQvE;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAgDnC;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CASvD;AAMD;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,aAAa,EAAE,SAAS,MAAM,EAgCzC,CAAC;AAQH,uDAAuD;AACvD,MAAM,MAAM,YAAY,GAAG,cAAc,GAAG,cAAc,GAAG,YAAY,CAAC;AAE1E,8DAA8D;AAC9D,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,kEAAkE;AAClE,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,yEAAyE;IACzE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAC;CACpD;AAED,wEAAwE;AACxE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;CACtC;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,CAAC;CAC7C;AAuBD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,eAAe,GAAG,WAAW,CAqBlG"}

package/dist/lib/investigate-claims.js

@@ -0,0 +1,188 @@
+/**
+ * Deterministic claim splitting + claim↔evidence matching for
+ * `investigate --verify` (investigate-verify lane, Ticket T1; DESIGN
+ * D2, PRD AC-2/AC-4/AC-5).
+ *
+ * splitClaims: the extract grammar's terminator rules verbatim
+ * (lib/investigate-extract.ts splitWindows) — `[.!?]` followed by a
+ * space (or end of input), or a newline; the terminator char belongs
+ * to the window, the separator run (spaces/tabs) to neither. The
+ * splitter is PURE: the ≤ 8 claim cap is the CALLER's fail-loud
+ * validation (commands/investigate.ts, T3) — a 9-sentence statement
+ * returns 9 claims here, never a throw, never a truncation.
+ *
+ * matchClaimsToEvidence: zero-model, deterministic. Per claim —
+ * terms = normalizeTerms over the claim's stopword-filtered tokens
+ * (reused from lib/investigate-extract.ts, imports only); a passage
+ * matches when any term appears whole-word case-folded in
+ * passage.quote; the negation-cue scan runs over MATCHING passages
+ * only; evidence pointers land in first-encounter order (source
+ * order, then passage order); negationCues counts cue-bearing
+ * matching passages.
+ *
+ * Byte-stable: no clocks, no randomness, no locale-dependent casing
+ * beyond toLowerCase.
+ */
+import { STOPWORDS } from "./context-file.js";
+import { normalizeTerms } from "./investigate-extract.js";
+// ---------------------------------------------------------------------------
+// Claim splitting (extract-grammar terminators)
+// ---------------------------------------------------------------------------
+const STOPWORD_SET = new Set(STOPWORDS);
+/**
+ * The verify-mode claim cap (PRD AC-1: > 8 sentence-claims is a
+ * fail-loud VALIDATION_ERROR, the R1 pipe-cap precedent — fail, never
+ * truncate). Exported so the command's error message names the cap
+ * from the single source of truth.
+ */
+export const MAX_VERIFY_CLAIMS = 8;
+/**
+ * Split input into sentence windows on the extract grammar: `[.!?]`
+ * followed by a space (or end of input), plus newline boundaries.
+ * Pinned to lib/investigate-extract.ts splitWindows — a decimal like
+ * "3.14" has no space after the dot, so it never terminates.
+ */
+function splitWindows(content) {
+    const windows = [];
+    let start = 0;
+    for (let i = 0; i < content.length; i += 1) {
+        const ch = content.charAt(i);
+        const next = content.charAt(i + 1);
+        const isTerminator = (ch === "." || ch === "!" || ch === "?") &&
+            (i + 1 >= content.length || next === " ");
+        const isNewline = ch === "\n";
+        if (!isTerminator && !isNewline) {
+            continue;
+        }
+        const end = i + 1; // terminator char owned by the window
+        windows.push({ start, end });
+        // Skip the horizontal-whitespace separator run; the next window
+        // starts at the first character that is neither space nor tab.
+        let cursor = end;
+        while (cursor < content.length) {
+            const sep = content.charAt(cursor);
+            if (sep !== " " && sep !== "\t") {
+                break;
+            }
+            cursor += 1;
+        }
+        start = cursor;
+        i = cursor - 1; // loop increment lands on `cursor`
+    }
+    if (start < content.length) {
+        windows.push({ start, end: content.length });
+    }
+    return windows;
+}
+/**
+ * Split a statement into sentence-claims: extract-grammar windows,
+ * whitespace-only sentences dropped, quotes trimmed. Deterministic —
+ * the same statement yields the identical claim array byte-stably.
+ * `|` needs no handling: claims split on sentences, never pipes.
+ */
+export function splitClaims(statement) {
+    const claims = [];
+    for (const window of splitWindows(statement)) {
+        const claim = statement.slice(window.start, window.end).trim();
+        if (claim.length > 0) {
+            claims.push(claim);
+        }
+    }
+    return claims;
+}
+// ---------------------------------------------------------------------------
+// Negation cues (frozen, versioned contract — PRD AC-5)
+// ---------------------------------------------------------------------------
+/**
+ * The negation-cue list behind `contradicted`. FROZEN and versioned:
+ * additions change verdicts and are release-visible (the parent-owned
+ * CHANGELOG bullet names them). Every cue is a LITERAL whole-word
+ * string (fix-round m1: the parenthesized inflection grammar is gone —
+ * variants spell out; a missing-absence family covers "without",
+ * "lacks", "untrue", "false", "absent", "rarely", "seldom").
+ *
+ * DISCLOSED as hint-grade: `contradicted` means "a term-matching
+ * passage carries a negation cue", NOT semantic contradiction —
+ * semantic judgment stays with the calling agent (agent-synthesis
+ * contract); the per-claim cue count exists for exactly that
+ * re-judgment.
+ */
+export const NEGATION_CUES = Object.freeze([
+    "not",
+    "no",
+    "never",
+    "none",
+    "cannot",
+    "can't",
+    "isn't",
+    "aren't",
+    "wasn't",
+    "weren't",
+    "doesn't",
+    "don't",
+    "didn't",
+    "won't",
+    "wouldn't",
+    "fail to",
+    "fails to",
+    "failed to",
+    "denies",
+    "denied",
+    "refutes",
+    "refuted",
+    "disputes",
+    "disputed",
+    "without",
+    "lacks",
+    "untrue",
+    "false",
+    "absent",
+    "rarely",
+    "seldom",
+]);
+const CUE_LITERALS = NEGATION_CUES;
+function escapeRegExp(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function containsWholeWord(content, term) {
+    const re = new RegExp(`(^|[^\\p{L}\\p{N}_])${escapeRegExp(term)}(?:[^\\p{L}\\p{N}_]|$)`, "iu");
+    return re.test(content);
+}
+/** Claim terms: lowercase tokens, stopword-filtered, normalizeTerms-dedupe. */
+function claimTerms(claim) {
+    const tokens = claim
+        .toLowerCase()
+        .split(/[^a-z0-9']+/)
+        .filter((t) => t.length > 0 && !STOPWORD_SET.has(t));
+    return normalizeTerms(tokens);
+}
+/**
+ * Match claims to evidence: per claim, every (source, passage) whose
+ * quote contains ≥ 1 claim term whole-word case-folded becomes an
+ * evidence pointer in first-encounter order; the cue scan runs over
+ * matching passages only; the verdict follows PRD-5 (corroborated =
+ * matches + 0 cues; contradicted = ≥ 1 cue-bearing match; unresolved
+ * = no matches).
+ */
+export function matchClaimsToEvidence({ statement, claims, sources }) {
+    const rows = claims.map((text) => {
+        const terms = claimTerms(text);
+        const evidence = [];
+        let cueBearers = 0;
+        sources.forEach((source, sourceIndex) => {
+            source.passages.forEach((passage, passageIndex) => {
+                const matched = terms.some((term) => containsWholeWord(passage.quote, term));
+                if (!matched)
+                    return;
+                evidence.push({ sourceIndex, passageIndex });
+                const carriesCue = CUE_LITERALS.some((cue) => containsWholeWord(passage.quote.toLowerCase(), cue));
+                if (carriesCue)
+                    cueBearers += 1;
+            });
+        });
+        const verdict = evidence.length === 0 ? "unresolved" : cueBearers > 0 ? "contradicted" : "corroborated";
+        return { text, verdict, negationCues: cueBearers, evidence };
+    });
+    return { statement, claims: rows };
+}
+//# sourceMappingURL=investigate-claims.js.map

package/dist/lib/investigate-claims.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-claims.js","sourceRoot":"","sources":["../../src/lib/investigate-claims.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAG1D,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;AAE7D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAQnC;;;;;GAKG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,YAAY,GAChB,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC;YACxC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,EAAE,KAAK,IAAI,CAAC;QAC9B,IAAI,CAAC,YAAY,IAAI,CAAC,SAAS,EAAE,CAAC;YAChC,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,sCAAsC;QACzD,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7B,gEAAgE;QAChE,+DAA+D;QAC/D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,OAAO,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBAChC,MAAM;YACR,CAAC;YACD,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QACD,KAAK,GAAG,MAAM,CAAC;QACf,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,mCAAmC;IACrD,CAAC;IACD,IAAI,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB;IAC3C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,wDAAwD;AACxD,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,aAAa,GAAsB,MAAM,CAAC,MAAM,CAAC;IAC5D,KAAK;IACL,IAAI;IACJ,OAAO;IACP,MAAM;IACN,QAAQ;IACR,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,UAAU;IACV,SAAS;IACT,UAAU;IACV,WAAW;IACX,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,UAAU;IACV,UAAU;IACV,SAAS;IACT,OAAO;IACP,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,QAAQ;CACT,CAAC,CAAC;AAEH,MAAM,YAAY,GAAsB,aAAa,CAAC;AAoCtD,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,iBAAiB,CAAC,OAAe,EAAE,IAAY;IACtD,MAAM,EAAE,GAAG,IAAI,MAAM,CACnB,uBAAuB,YAAY,CAAC,IAAI,CAAC,wBAAwB,EACjE,IAAI,CACL,CAAC;IACF,OAAO,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC1B,CAAC;AAED,+EAA+E;AAC/E,SAAS,UAAU,CAAC,KAAa;IAC/B,MAAM,MAAM,GAAG,KAAK;SACjB,WAAW,EAAE;SACb,KAAK,CAAC,aAAa,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,cAAc,CAAC,MAAM,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAmB;IACnF,MAAM,IAAI,GAAe,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;YACtC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE;gBAChD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;gBAC7E,IAAI,CAAC,OAAO;oBAAE,OAAO;gBACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC,CAAC;gBAC7C,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAC3C,iBAAiB,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,CACpD,CAAC;gBACF,IAAI,UAAU;oBAAE,UAAU,IAAI,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GACX,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC;QAC1F,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AACrC,CAAC"}

package/dist/lib/investigate-extract.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Deterministic passage extraction for the investigate pipeline
+ * (T3, docs/plans/investigate-pipeline DESIGN D4, PRD AC-5).
+ *
+ * Splits content into sentence windows with character-index tracking,
+ * keeps the windows containing >= 1 term as a whole word (case-folded),
+ * dedupes by exact quote equality, caps at 5 first-encounter passages.
+ *
+ * Boundary-char ownership: the terminator that ended a window
+ * (`.`/`!`/`?`/`\n`) belongs to the window; the separator run
+ * (spaces/tabs after a terminator) belongs to neither window. The
+ * round-trip pin — content.slice(...charRange) === quote for every
+ * passage — holds byte-exactly under this rule, and is invariant to
+ * it (any slicing convention preserves the pin).
+ *
+ * Byte-stable: no clocks, no randomness, no locale-dependent casing
+ * beyond toLowerCase. Self-contained: no imports.
+ */
+export interface Passage {
+    quote: string;
+    charRange: [number, number];
+}
+export interface ExtractPassagesArgs {
+    content: string;
+    terms: string[];
+}
+/** Normalize the term set: trim, case-fold, drop empties, dedupe. */
+export declare function normalizeTerms(terms: string[]): string[];
+/**
+ * Extract passages: sentence windows of `content` containing >= 1 of
+ * `terms` as a whole word (case-folded), deduped by exact quote,
+ * capped at 5 first-encounter. Empty term set -> [] (valid).
+ */
+export declare function extractPassages({ content, terms }: ExtractPassagesArgs): Passage[];
+//# sourceMappingURL=investigate-extract.d.ts.map

package/dist/lib/investigate-extract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-extract.d.ts","sourceRoot":"","sources":["../../src/lib/investigate-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7B;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAID,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CASxD;AA4DD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,mBAAmB,GAAG,OAAO,EAAE,CAqBlF"}

package/dist/lib/investigate-extract.js

@@ -0,0 +1,101 @@
+/**
+ * Deterministic passage extraction for the investigate pipeline
+ * (T3, docs/plans/investigate-pipeline DESIGN D4, PRD AC-5).
+ *
+ * Splits content into sentence windows with character-index tracking,
+ * keeps the windows containing >= 1 term as a whole word (case-folded),
+ * dedupes by exact quote equality, caps at 5 first-encounter passages.
+ *
+ * Boundary-char ownership: the terminator that ended a window
+ * (`.`/`!`/`?`/`\n`) belongs to the window; the separator run
+ * (spaces/tabs after a terminator) belongs to neither window. The
+ * round-trip pin — content.slice(...charRange) === quote for every
+ * passage — holds byte-exactly under this rule, and is invariant to
+ * it (any slicing convention preserves the pin).
+ *
+ * Byte-stable: no clocks, no randomness, no locale-dependent casing
+ * beyond toLowerCase. Self-contained: no imports.
+ */
+const MAX_PASSAGES = 5;
+/** Normalize the term set: trim, case-fold, drop empties, dedupe. */
+export function normalizeTerms(terms) {
+    const seen = new Set();
+    for (const term of terms) {
+        const normalized = term.trim().toLowerCase();
+        if (normalized.length > 0) {
+            seen.add(normalized);
+        }
+    }
+    return [...seen];
+}
+/**
+ * Split content into sentence windows on `[.!?]` terminators followed
+ * by a space (the literal `[.!?] +` grammar), plus newline
+ * boundaries, tracking exact offsets into the original content.
+ * Newlines terminate but never separate: "here.\n" ends at the `\n`.
+ */
+function splitWindows(content) {
+    const windows = [];
+    let start = 0;
+    for (let i = 0; i < content.length; i += 1) {
+        const ch = content.charAt(i);
+        const next = content.charAt(i + 1);
+        const isTerminator = (ch === "." || ch === "!" || ch === "?") &&
+            (i + 1 >= content.length || next === " ");
+        const isNewline = ch === "\n";
+        if (!isTerminator && !isNewline) {
+            continue;
+        }
+        const end = i + 1; // terminator char owned by the window
+        windows.push({ start, end });
+        // Skip the horizontal-whitespace separator run; the next window
+        // starts at the first character that is neither space nor tab.
+        let cursor = end;
+        while (cursor < content.length) {
+            const sep = content.charAt(cursor);
+            if (sep !== " " && sep !== "\t") {
+                break;
+            }
+            cursor += 1;
+        }
+        start = cursor;
+        i = cursor - 1; // loop increment lands on `cursor`
+    }
+    if (start < content.length) {
+        windows.push({ start, end: content.length });
+    }
+    return windows;
+}
+function containsWholeWord(content, term) {
+    const re = new RegExp(`(^|[^\\p{L}\\p{N}_])${escapeRegExp(term)}(?:[^\\p{L}\\p{N}_]|$)`, "iu");
+    return re.test(content);
+}
+function escapeRegExp(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+/**
+ * Extract passages: sentence windows of `content` containing >= 1 of
+ * `terms` as a whole word (case-folded), deduped by exact quote,
+ * capped at 5 first-encounter. Empty term set -> [] (valid).
+ */
+export function extractPassages({ content, terms }) {
+    const normalized = normalizeTerms(terms);
+    if (normalized.length === 0) {
+        return [];
+    }
+    const seenQuotes = new Set();
+    const passages = [];
+    for (const window of splitWindows(content)) {
+        const quote = content.slice(window.start, window.end);
+        if (normalized.some((term) => containsWholeWord(quote, term)) &&
+            !seenQuotes.has(quote)) {
+            seenQuotes.add(quote);
+            passages.push({ quote, charRange: [window.start, window.end] });
+            if (passages.length >= MAX_PASSAGES) {
+                break;
+            }
+        }
+    }
+    return passages;
+}
+//# sourceMappingURL=investigate-extract.js.map

package/dist/lib/investigate-extract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-extract.js","sourceRoot":"","sources":["../../src/lib/investigate-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAYH,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,qEAAqE;AACrE,MAAM,UAAU,cAAc,CAAC,KAAe;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AACnB,CAAC;AAQD;;;;;GAKG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,YAAY,GAChB,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC;YACxC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,EAAE,KAAK,IAAI,CAAC;QAC9B,IAAI,CAAC,YAAY,IAAI,CAAC,SAAS,EAAE,CAAC;YAChC,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,sCAAsC;QACzD,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7B,gEAAgE;QAChE,+DAA+D;QAC/D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,OAAO,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBAChC,MAAM;YACR,CAAC;YACD,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QACD,KAAK,GAAG,MAAM,CAAC;QACf,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,mCAAmC;IACrD,CAAC;IACD,IAAI,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,iBAAiB,CAAC,OAAe,EAAE,IAAY;IACtD,MAAM,EAAE,GAAG,IAAI,MAAM,CACnB,uBAAuB,YAAY,CAAC,IAAI,CAAC,wBAAwB,EACjE,IAAI,CACL,CAAC;IACF,OAAO,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,EAAE,OAAO,EAAE,KAAK,EAAuB;IACrE,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtD,IACE,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACzD,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EACtB,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChE,IAAI,QAAQ,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;gBACpC,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/lib/investigate-planner.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Three-tier deterministic sub-query planner for `investigate`
+ * (investigate-pipeline lane, Ticket T2; DESIGN.md D2, ADR-0013).
+ *
+ * Tier resolution order:
+ *   1. explicit — the query contains an unescaped `|`: split on the
+ *      SAME grammar `search --merge` uses; wins over `--context` with
+ *      a notice stating the override.
+ *   2. context — a `--context` file is present: `deriveSubQueries`
+ *      over the parsed text, verbatim (no original prepend — context
+ *      mode owns the grid, mirroring `search --context`). An empty
+ *      derivation degrades to the original query.
+ *   3. template — transforms of the bare question (see TEMPLATE
+ *      order below).
+ *
+ * Byte-stable everywhere: no clocks, no randomness, no
+ * locale-dependent casing beyond `toLowerCase`. The unit has no
+ * filesystem access — `loadContextText` is dependency-injected;
+ * production wiring lives in the orchestrator command.
+ */
+/**
+ * PR #264 R1 (owner-approved): explicit pipe plans are capped at 8
+ * sub-queries — the context tier's MAX_SUBQUERIES precedent. Exceeding
+ * the cap fails loud with VALIDATION_ERROR (silent truncation rejected:
+ * a truncated plan would silently under-bill the user's intent).
+ */
+export declare const MAX_EXPLICIT_SUBQUERIES = 8;
+export type PlannerTier = "explicit" | "context" | "template";
+export interface PlanSubQueriesOptions {
+    readonly query: string;
+    /** `--context` file path; presence selects the context tier. */
+    readonly contextFile?: string;
+}
+export interface PlanSubQueriesDeps {
+    /**
+     * Injected context reader (production: the context-file io
+     * adapter). The unit never touches the filesystem itself.
+     */
+    loadContextText(filePath: string): Promise<string>;
+}
+export interface SubQueryPlan {
+    readonly subQueries: readonly string[];
+    readonly tier: PlannerTier;
+    readonly notice?: string;
+}
+/**
+ * Key-terms join for the template tier: lowercase the question,
+ * tokenize on non-alphanumerics, drop stopwords and tokens outside the
+ * context-file term bounds, preserve order, dedupe, join with spaces.
+ * Only `toLowerCase` is applied (byte-stable, no locale).
+ */
+export declare function deriveTemplateTopic(query: string): string;
+/**
+ * Resolve the sub-query plan for an investigation. Throws only on the
+ * explicit-tier fail-loud cases (all fragments empty; > 8 fragments).
+ */
+export declare function planSubQueries(options: PlanSubQueriesOptions, deps: PlanSubQueriesDeps): Promise<SubQueryPlan>;
+//# sourceMappingURL=investigate-planner.d.ts.map

package/dist/lib/investigate-planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-planner.d.ts","sourceRoot":"","sources":["../../src/lib/investigate-planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAKH;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAyBzC,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;AAE9D,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,gEAAgE;IAChE,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACpD;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAczD;AAwBD;;;GAGG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,qBAAqB,EAC9B,IAAI,EAAE,kBAAkB,GACvB,OAAO,CAAC,YAAY,CAAC,CA6BvB"}

package/dist/lib/investigate-planner.js

@@ -0,0 +1,141 @@
+/**
+ * Three-tier deterministic sub-query planner for `investigate`
+ * (investigate-pipeline lane, Ticket T2; DESIGN.md D2, ADR-0013).
+ *
+ * Tier resolution order:
+ *   1. explicit — the query contains an unescaped `|`: split on the
+ *      SAME grammar `search --merge` uses; wins over `--context` with
+ *      a notice stating the override.
+ *   2. context — a `--context` file is present: `deriveSubQueries`
+ *      over the parsed text, verbatim (no original prepend — context
+ *      mode owns the grid, mirroring `search --context`). An empty
+ *      derivation degrades to the original query.
+ *   3. template — transforms of the bare question (see TEMPLATE
+ *      order below).
+ *
+ * Byte-stable everywhere: no clocks, no randomness, no
+ * locale-dependent casing beyond `toLowerCase`. The unit has no
+ * filesystem access — `loadContextText` is dependency-injected;
+ * production wiring lives in the orchestrator command.
+ */
+import { ValidationError } from "./errors.js";
+import { STOPWORDS, parseContextText } from "./context-file.js";
+/**
+ * PR #264 R1 (owner-approved): explicit pipe plans are capped at 8
+ * sub-queries — the context tier's MAX_SUBQUERIES precedent. Exceeding
+ * the cap fails loud with VALIDATION_ERROR (silent truncation rejected:
+ * a truncated plan would silently under-bill the user's intent).
+ */
+export const MAX_EXPLICIT_SUBQUERIES = 8;
+/**
+ * Pinned to `src/commands/search.ts` `splitMergeSubQueries` — the
+ * same split grammar the `--merge` flag defines: split on unescaped
+ * `|` (a literal pipe is escaped as `\|`), unescape, trim, drop
+ * empty fragments. Deliberately duplicated as a local constant: the
+ * original is module-private there and this lane's file allowlist
+ * keeps `search.ts` read-only (orchestrator ruling, T2 pickup).
+ */
+const MERGE_SPLIT_PATTERN = /(?<!\\)\|/;
+const MERGE_UNESCAPE = /\\\|/g;
+/**
+ * Pinned to `src/lib/context-file.ts` `MIN_TERM_CHARS`/`MAX_TERM_CHARS`
+ * (module-private there; allowlist keeps the file read-only — same
+ * ruling as the splitter). Keep in sync with that module's D2.3 bounds.
+ */
+const MIN_TERM_CHARS = 4;
+const MAX_TERM_CHARS = 40;
+const STOPWORD_SET = new Set(STOPWORDS);
+const TEMPLATE_SUFFIXES = ["overview", "evidence", "criticism"];
+/**
+ * Key-terms join for the template tier: lowercase the question,
+ * tokenize on non-alphanumerics, drop stopwords and tokens outside the
+ * context-file term bounds, preserve order, dedupe, join with spaces.
+ * Only `toLowerCase` is applied (byte-stable, no locale).
+ */
+export function deriveTemplateTopic(query) {
+    const terms = [];
+    const seen = new Set();
+    for (const token of query.toLowerCase().split(/[^a-z0-9]+/)) {
+        if (token.length < MIN_TERM_CHARS || token.length > MAX_TERM_CHARS) {
+            continue;
+        }
+        if (STOPWORD_SET.has(token) || seen.has(token)) {
+            continue;
+        }
+        seen.add(token);
+        terms.push(token);
+    }
+    return terms.join(" ");
+}
+/**
+ * Explicit tier split — see the grammar pin above. Same fail-loud
+ * contract as `search --merge`: no non-empty fragments is an error.
+ * R1: > 8 fragments is VALIDATION_ERROR (never silent truncation).
+ */
+function splitExplicit(query) {
+    const subQueries = query
+        .split(MERGE_SPLIT_PATTERN)
+        .map((q) => q.replace(MERGE_UNESCAPE, "|").trim())
+        .filter((q) => q.length > 0);
+    if (subQueries.length === 0) {
+        throw new Error("--merge requires at least one non-empty query (split with '|')");
+    }
+    if (subQueries.length > MAX_EXPLICIT_SUBQUERIES) {
+        throw new ValidationError(`Explicit pipe plan exceeds the ${MAX_EXPLICIT_SUBQUERIES}-sub-query cap (${subQueries.length} fragments).`, "Split fewer sub-queries with '|', or move the investigation into a --context file (the context tier derives up to 8).");
+    }
+    return subQueries;
+}
+/**
+ * Resolve the sub-query plan for an investigation. Throws only on the
+ * explicit-tier fail-loud cases (all fragments empty; > 8 fragments).
+ */
+export async function planSubQueries(options, deps) {
+    const hasPipes = MERGE_SPLIT_PATTERN.test(options.query);
+    if (hasPipes) {
+        return {
+            subQueries: splitExplicit(options.query),
+            tier: "explicit",
+            notice: "--context ignored: explicit pipe split takes precedence over the context file",
+        };
+    }
+    if (options.contextFile !== undefined) {
+        const text = await deps.loadContextText(options.contextFile);
+        const derived = [...parseContextText(text).subQueries];
+        // Orchestrator ruling (T2 pickup): search's zero-derivation
+        // fallback precedent — an empty derivation degrades to the
+        // original query rather than an empty grid.
+        const subQueries = derived.length > 0 ? derived : [options.query];
+        return { subQueries, tier: "context" };
+    }
+    const topic = deriveTemplateTopic(options.query);
+    const subQueries = [options.query];
+    if (topic.length > 0) {
+        subQueries.push(topic);
+        for (const suffix of TEMPLATE_SUFFIXES) {
+            subQueries.push(`${topic} ${suffix}`);
+        }
+    }
+    return { subQueries: dedupe(subQueries), tier: "template" };
+}
+/**
+ * Exact-equal dedupe on trimmed, case-sensitive members, preserving
+ * first-occurrence order, capped at 5 (the template tier emits at
+ * most 5 candidates, so the cap is a hard upper bound).
+ */
+function dedupe(candidates) {
+    const seen = new Set();
+    const result = [];
+    for (const candidate of candidates) {
+        const key = candidate.trim();
+        if (key.length === 0 || seen.has(key)) {
+            continue;
+        }
+        seen.add(key);
+        result.push(key);
+        if (result.length === 5) {
+            break;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=investigate-planner.js.map

package/dist/lib/investigate-planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"investigate-planner.js","sourceRoot":"","sources":["../../src/lib/investigate-planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAoB,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAElF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAEzC;;;;;;;GAOG;AACH,MAAM,mBAAmB,GAAG,WAAW,CAAC;AACxC,MAAM,cAAc,GAAG,OAAO,CAAC;AAE/B;;;;GAIG;AACH,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;AAE7D,MAAM,iBAAiB,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,WAAW,CAAU,CAAC;AAwBzE;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;QAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,cAAc,IAAI,KAAK,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;YACnE,SAAS;QACX,CAAC;QACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/C,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,KAAa;IAClC,MAAM,UAAU,GAAG,KAAK;SACrB,KAAK,CAAC,mBAAmB,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,uBAAuB,EAAE,CAAC;QAChD,MAAM,IAAI,eAAe,CACvB,kCAAkC,uBAAuB,mBAAmB,UAAU,CAAC,MAAM,cAAc,EAC3G,uHAAuH,CACxH,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAA8B,EAC9B,IAAwB;IAExB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACzD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO;YACL,UAAU,EAAE,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC;YACxC,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,+EAA+E;SACxF,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC;QACvD,4DAA4D;QAC5D,2DAA2D;QAC3D,4CAA4C;QAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IACzC,CAAC;IAED,MAAM,KAAK,GAAG,mBAAmB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,UAAU,GAAa,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,iBAAiB,EAAE,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,UAA6B;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/providers/registry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/providers/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAwBH,OAAO,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAMjE;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,6BAA6B,EAAE,SAAS,kBAAkB,EAyBtE,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,UAAU,EACd,WAAW,GAAE,SAAS,kBAAkB,EAAkC,GACzE,kBAAkB,CAEpB;AAED;;;GAGG;AACH,wBAAgB,gCAAgC,CAC9C,GAAG,EAAE,MAAM,CAAC,UAAU,EACtB,WAAW,GAAE,SAAS,kBAAkB,EAAkC,GACzE,SAAS,kBAAkB,EAAE,CAE/B"}
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/providers/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAwBH,OAAO,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAMjE;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,6BAA6B,EAAE,SAAS,kBAAkB,EA4BtE,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,UAAU,EACd,WAAW,GAAE,SAAS,kBAAkB,EAAkC,GACzE,kBAAkB,CAEpB;AAED;;;GAGG;AACH,wBAAgB,gCAAgC,CAC9C,GAAG,EAAE,MAAM,CAAC,UAAU,EACtB,WAAW,GAAE,SAAS,kBAAkB,EAAkC,GACzE,SAAS,kBAAkB,EAAE,CAE/B"}