@mailwoman/corpus 9.1.0 → 9.3.0

package/out/src/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAEnE;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAChC;;OAEG;IACH,MAAM,EAAE,MAAM,CAAA;IAEd;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAA;IAEjB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAA;IAEtB;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAA;CACf;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC3B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAA;IAEd;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAA;CACtB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,YAAa,SAAQ,gBAAgB;IACrD;;OAEG;IACH,GAAG,EAAE,MAAM,CAAA;IAEX;;;OAGG;IACH,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAA;IAEjD;;OAEG;IACH,OAAO,EAAE,MAAM,CAAA;IAEf;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,WAAW,CAAA;CACnB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAW,SAAQ,YAAY;IAC/C;;OAEG;IACH,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAEzB;;OAEG;IACH,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAA;IAE3B;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IAE/B;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IAE7B;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,YAAY,EAAE,CAAA;CACnC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC9B,GAAG,EAAE,YAAY,CAAA;IACjB,MAAM,EAAE,MAAM,CAAA;CACd;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,cAAc;IAC9B;;OAEG;IACH,SAAS,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;IAElB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;IAEd;;OAEG;IACH,MAAM,CAAC,EAAE,WAAW,CAAA;CACpB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,aAAa;IAC7B;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IAEnB;;OAEG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAE/B;;OAEG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAE5B;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAC,IAAI,EAAE,cAAc,GAAG,aAAa,CAAC,YAAY,CAAC,CAAA;CACvD"}

package/out/src/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}

package/out/src/utils/align.d.ts

@@ -1,93 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- *
- *   Alignment: turn a `CanonicalRow` (raw + components) into a `LabeledRow` (raw + tokens + BIO
- *   labels) or a `QuarantinedRow` (raw + reason) per the Phase 1 plan.
- *
- *   Pipeline:
- *
- *   1. For each `(tag, value)` in `components`, find the value's character span in `raw`. First try a
- *        verbatim substring match (case-insensitive, whitespace-collapsed). If that fails, fall
- *        back to fuzzy match via `fastest-levenshtein`, with a tunable edit distance threshold.
- *   2. If any component cannot be located, reject the row with a human-readable reason and send it to
- *        the quarantine pile (`reason: "component-not-found:<tag>"` or
- *        `"edit-distance-exceeded:<tag>:<dist>"`).
- *   3. Tokenize `raw` with the supplied `Tokenizer` (defaults to the whitespace tokenizer).
- *   4. For each token: walk the list of component spans, pick the one whose span contains the token's
- *        character range. First token in a component span → `B-<tag>`; subsequent tokens →
- *        `I-<tag>`; no overlap → `O`.
- *   5. Emit the located char spans verbatim as `span_starts[]` / `span_ends[]` / `span_tags[]` (the
- *        v0.5.0 char-offset format, #519). The token quantization in step 4 is the part the v0.5.0
- *        rebuild deletes; during the transition both representations ride on every labeled row.
- *
- *   Structural invariants the function preserves (the span ones loudly — a violation throws rather
- *   than quarantines, because it indicates a bug here, not bad source data):
- *
- *   - `tokens.length === labels.length` always.
- *   - Each component contributes at most one contiguous BIO run (no `B-tag … O … I-tag` gaps). This is
- *       enforced by greedy first-match span assignment + ordered token iteration.
- *   - The span triple is sorted ascending by start and non-overlapping.
- *   - `raw` is NFC-normalized (asserted per row; a non-NFC raw makes char offsets ambiguous downstream
- *       — NFD `é` occupies two code units where NFC `é` occupies one — and silently so).
- */
-import type { ComponentTag } from "@mailwoman/core/types";
-import type { CanonicalRow, LabeledRow, QuarantinedRow } from "@mailwoman/corpus/types";
-import { type Tokenizer } from "./tokenize.ts";
-/**
- * Options for `alignRow`.
- */
-export interface AlignOptions {
-    /**
-     * Tokenizer to use. Defaults to `whitespaceTokenizer()`.
-     */
-    tokenizer?: Tokenizer;
-    /**
-     * Max Levenshtein edit distance to accept when a verbatim substring match fails. Set `0` to require verbatim matches
-     * only. Default `2`.
-     *
-     * Distance is computed against same-length windows in `raw`, so the threshold scales naturally with the component
-     * value length.
-     */
-    maxEditDistance?: number;
-    /**
-     * Case-insensitive comparison for substring search. Default `true`. The retained span in `raw` is the original case;
-     * only matching is case-insensitive.
-     */
-    caseInsensitive?: boolean;
-}
-/**
- * Either a successful labeled row or a quarantined one.
- */
-export type AlignmentResult = {
-    kind: "labeled";
-    row: LabeledRow;
-} | {
-    kind: "quarantined";
-    row: QuarantinedRow;
-};
-/**
- * One located char-offset label span over a row's `raw` ([start, end) in UTF-16 code units). The element type behind
- * the parallel `span_starts[]`/`span_ends[]`/`span_tags[]` triple on `LabeledRow` (#519).
- */
-export interface ComponentSpan {
-    tag: ComponentTag;
-    start: number;
-    end: number;
-}
-/**
- * Align a single row.
- */
-export declare function alignRow(row: CanonicalRow, opts?: AlignOptions): AlignmentResult;
-/**
- * Enforce the #519 span-triple invariants — in-bounds, sorted ascending by start, non-overlapping — loudly.
- *
- * For `alignRow`: `claimed`-span bookkeeping in `locateSpan` already makes overlap impossible and the caller sorts, so
- * a violation here is a bug in this file, not bad source data: throw (naming the row) rather than quarantine, so the
- * corruption can't ride into a corpus. Exported for every OTHER span producer (`composeAdversarialRow`'s offset
- * arithmetic, future synthesis paths) — any code that emits the triple without going through `alignRow` must pass its
- * output through this.
- */
-export declare function assertSpanInvariants(spans: readonly ComponentSpan[], row: Pick<CanonicalRow, "raw" | "source" | "source_id">): void;
-//# sourceMappingURL=align.d.ts.map

package/out/src/utils/align.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"align.d.ts","sourceRoot":"","sources":["../../../src/utils/align.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAY,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAGvF,OAAO,EAAuC,KAAK,SAAS,EAAE,MAAM,eAAe,CAAA;AAEnF;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,CAAA;IAErB;;;;;;OAMG;IACH,eAAe,CAAC,EAAE,MAAM,CAAA;IAExB;;;OAGG;IACH,eAAe,CAAC,EAAE,OAAO,CAAA;CACzB;AAED;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,GAAG,EAAE,cAAc,CAAA;CAAE,CAAA;AAEjH;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC7B,GAAG,EAAE,YAAY,CAAA;IACjB,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;CACX;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,GAAE,YAAiB,GAAG,eAAe,CAsFpF;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CACnC,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,GAAG,EAAE,IAAI,CAAC,YAAY,EAAE,KAAK,GAAG,QAAQ,GAAG,WAAW,CAAC,GACrD,IAAI,CA4BN"}

package/out/src/utils/align.js

@@ -1,234 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- *
- *   Alignment: turn a `CanonicalRow` (raw + components) into a `LabeledRow` (raw + tokens + BIO
- *   labels) or a `QuarantinedRow` (raw + reason) per the Phase 1 plan.
- *
- *   Pipeline:
- *
- *   1. For each `(tag, value)` in `components`, find the value's character span in `raw`. First try a
- *        verbatim substring match (case-insensitive, whitespace-collapsed). If that fails, fall
- *        back to fuzzy match via `fastest-levenshtein`, with a tunable edit distance threshold.
- *   2. If any component cannot be located, reject the row with a human-readable reason and send it to
- *        the quarantine pile (`reason: "component-not-found:<tag>"` or
- *        `"edit-distance-exceeded:<tag>:<dist>"`).
- *   3. Tokenize `raw` with the supplied `Tokenizer` (defaults to the whitespace tokenizer).
- *   4. For each token: walk the list of component spans, pick the one whose span contains the token's
- *        character range. First token in a component span → `B-<tag>`; subsequent tokens →
- *        `I-<tag>`; no overlap → `O`.
- *   5. Emit the located char spans verbatim as `span_starts[]` / `span_ends[]` / `span_tags[]` (the
- *        v0.5.0 char-offset format, #519). The token quantization in step 4 is the part the v0.5.0
- *        rebuild deletes; during the transition both representations ride on every labeled row.
- *
- *   Structural invariants the function preserves (the span ones loudly — a violation throws rather
- *   than quarantines, because it indicates a bug here, not bad source data):
- *
- *   - `tokens.length === labels.length` always.
- *   - Each component contributes at most one contiguous BIO run (no `B-tag … O … I-tag` gaps). This is
- *       enforced by greedy first-match span assignment + ordered token iteration.
- *   - The span triple is sorted ascending by start and non-overlapping.
- *   - `raw` is NFC-normalized (asserted per row; a non-NFC raw makes char offsets ambiguous downstream
- *       — NFD `é` occupies two code units where NFC `é` occupies one — and silently so).
- */
-import { distance as levenshteinDistance } from "fastest-levenshtein";
-import { whitespaceTokenizer } from "./tokenize.js";
-/**
- * Align a single row.
- */
-export function alignRow(row, opts = {}) {
-    const tokenizer = opts.tokenizer ?? whitespaceTokenizer();
-    const maxEditDistance = opts.maxEditDistance ?? 2;
-    const caseInsensitive = opts.caseInsensitive ?? true;
-    if (!row.raw) {
-        return { kind: "quarantined", row: { row, reason: "raw-empty" } };
-    }
-    // #519 NFC handling — relaxed from a hard throw to normalization (2026-06-12, DeepSeek-validated):
-    // one non-NFC row (e.g. a non-Latin name variant like "দক্ষিণ কোরিয়া") must not crash a multi-hour
-    // build. Normalize `raw` AND every component value to NFC, compute spans over the NFC raw, and
-    // store the NFC raw — preserving the #519 single-normalization-form principle while keeping the row.
-    const raw = row.raw.normalize("NFC");
-    const components = { ...row.components };
-    for (const key of Object.keys(components)) {
-        const v = components[key];
-        if (typeof v === "string") {
-            components[key] = v.normalize("NFC");
-        }
-    }
-    const componentSpans = [];
-    const claimed = [];
-    const haystack = caseInsensitive ? raw.toLowerCase() : raw;
-    // Longest value first: a short component must not claim a word that a longer, more specific
-    // component owns ("Alaska Regional Dr, Alaska" — region "Alaska" stealing the street's first
-    // word quarantined the street; pilot2's residual class). Emit order is unaffected — spans are
-    // re-sorted by start below.
-    const entries = Object.entries(components).toSorted((a, b) => (b[1]?.length ?? 0) - (a[1]?.length ?? 0));
-    for (const [tag, value] of entries) {
-        if (!value)
-            continue;
-        const needle = caseInsensitive ? value.toLowerCase() : value;
-        const span = locateSpan({ haystack, needle, raw, claimed, maxEditDistance });
-        if (!span) {
-            return {
-                kind: "quarantined",
-                row: { row, reason: `component-not-found:${tag}` },
-            };
-        }
-        // Defensive bounds quarantine (2026-06-12): locateSpan's fuzzy/boundary logic can over-run the
-        // raw by a code unit on some non-Latin / combining-mark strings (e.g. Bengali name variants),
-        // yielding a span past the end. An out-of-bounds offset can never be a valid char span —
-        // quarantine the row rather than crash assertSpanInvariants and take down a multi-hour build.
-        // (If this class proves large in the quarantine report, locateSpan's boundary logic needs a
-        // combining-mark fix to KEEP these non-Latin rows.)
-        if (span.start < 0 || span.end > raw.length || span.start >= span.end) {
-            return {
-                kind: "quarantined",
-                row: { row, reason: `span-out-of-bounds:${tag}` },
-            };
-        }
-        componentSpans.push({ tag, start: span.start, end: span.end });
-        claimed.push([span.start, span.end]);
-    }
-    componentSpans.sort((a, b) => a.start - b.start);
-    assertSpanInvariants(componentSpans, { ...row, raw });
-    const tokens = tokenizer.tokenize(raw);
-    const labels = labelTokens(tokens, componentSpans);
-    const labeled = {
-        ...row,
-        raw,
-        components,
-        tokens: tokens.map((t) => t.text),
-        labels,
-        // The v0.5.0 char-offset triple (#519): the located spans, emitted verbatim. The token
-        // quantization above is what the rebuild deletes; both ride during the transition.
-        span_starts: componentSpans.map((s) => s.start),
-        span_ends: componentSpans.map((s) => s.end),
-        span_tags: componentSpans.map((s) => s.tag),
-    };
-    return { kind: "labeled", row: labeled };
-}
-/**
- * Enforce the #519 span-triple invariants — in-bounds, sorted ascending by start, non-overlapping — loudly.
- *
- * For `alignRow`: `claimed`-span bookkeeping in `locateSpan` already makes overlap impossible and the caller sorts, so
- * a violation here is a bug in this file, not bad source data: throw (naming the row) rather than quarantine, so the
- * corruption can't ride into a corpus. Exported for every OTHER span producer (`composeAdversarialRow`'s offset
- * arithmetic, future synthesis paths) — any code that emits the triple without going through `alignRow` must pass its
- * output through this.
- */
-export function assertSpanInvariants(spans, row) {
-    for (let i = 0; i < spans.length; i++) {
-        const s = spans[i];
-        if (!(s.start >= 0 && s.start < s.end && s.end <= row.raw.length)) {
-            throw new Error(`alignRow: span out of bounds (source=${row.source}, source_id=${row.source_id}): ` +
-                `${s.tag}@[${s.start}, ${s.end}) over raw of length ${row.raw.length}`);
-        }
-        if (i === 0)
-            continue;
-        const prev = spans[i - 1];
-        if (s.start < prev.start) {
-            throw new Error(`alignRow: spans not sorted (source=${row.source}, source_id=${row.source_id}): ` +
-                `${prev.tag}@[${prev.start}, ${prev.end}) precedes ${s.tag}@[${s.start}, ${s.end})`);
-        }
-        if (s.start < prev.end) {
-            throw new Error(`alignRow: spans overlap (source=${row.source}, source_id=${row.source_id}): ` +
-                `${prev.tag}@[${prev.start}, ${prev.end}) overlaps ${s.tag}@[${s.start}, ${s.end})`);
-        }
-    }
-}
-/**
- * Locate `needle` in `haystack` (both already normalized for case if requested), preferring verbatim substring match.
- * Falls back to a fuzzy window scan when verbatim fails and `maxEditDistance > 0`. Already-claimed spans are skipped so
- * two components don't grab overlapping ranges.
- *
- * Returns the span in the original `raw` (not the lower-cased `haystack`).
- */
-function locateSpan(args) {
-    const { haystack, needle, claimed, maxEditDistance } = args;
-    if (!needle.length)
-        return undefined;
-    // Pass 1: verbatim substring. Word-boundary-aligned matches are PREFERRED over intra-word ones
-    // — leftmost-substring alone let a short value claim the inside of an earlier word (region "AK"
-    // matched inside "Umak"/"Lake", scrambling every later span; caught by the v0.5.0 pilot build).
-    // Intra-word matches stay allowed as the fallback because they are essential for affix
-    // supervision (street_suffix "straße" inside "Hauptstraße" has no boundary-aligned occurrence —
-    // sub-word spans are the point of the char-offset format).
-    let intraWord;
-    let from = 0;
-    while (true) {
-        const idx = haystack.indexOf(needle, from);
-        if (idx === -1)
-            break;
-        const end = idx + needle.length;
-        if (!overlapsClaimed(idx, end, claimed)) {
-            if (isBoundaryAligned(haystack, idx, end))
-                return { start: idx, end };
-            intraWord ??= { start: idx, end };
-        }
-        from = idx + 1;
-    }
-    if (intraWord)
-        return intraWord;
-    if (maxEditDistance <= 0)
-        return undefined;
-    // Pass 2: fuzzy sliding-window. Walk over candidate windows of length `needle.length`
-    // across haystack, compute Levenshtein, pick the leftmost window under the threshold.
-    const len = needle.length;
-    for (let i = 0; i + len <= haystack.length; i++) {
-        if (overlapsClaimed(i, i + len, claimed))
-            continue;
-        const window = haystack.slice(i, i + len);
-        if (window === needle)
-            return { start: i, end: i + len }; // covered by pass 1, but cheap
-        const d = levenshteinDistance(window, needle);
-        if (d <= maxEditDistance)
-            return { start: i, end: i + len };
-    }
-    return undefined;
-}
-const WORD_CHAR = /[\p{L}\p{N}]/u;
-/**
- * Both needle edges sit on word boundaries of the haystack (string edges count as boundaries).
- */
-function isBoundaryAligned(haystack, start, end) {
-    const before = start === 0 || !WORD_CHAR.test(haystack[start - 1]);
-    const after = end === haystack.length || !WORD_CHAR.test(haystack[end]);
-    return before && after;
-}
-function overlapsClaimed(start, end, claimed) {
-    for (const [a, b] of claimed) {
-        if (start < b && a < end)
-            return true;
-    }
-    return false;
-}
-/**
- * Assign BIO labels to tokens given the component spans. Components MUST be sorted by start offset. For each token,
- * find the first component span that contains the token's start offset; if the token is the first one inside that span
- * emit `B-<tag>`, else `I-<tag>`.
- */
-function labelTokens(tokens, spans) {
-    const out = [];
-    const seenSpan = new Set();
-    // index into `spans`
-    for (const token of tokens) {
-        let assigned = "O";
-        for (let i = 0; i < spans.length; i++) {
-            const s = spans[i];
-            if (token.start >= s.start && token.end <= s.end) {
-                if (!seenSpan.has(i)) {
-                    assigned = `B-${s.tag}`;
-                    seenSpan.add(i);
-                }
-                else {
-                    assigned = `I-${s.tag}`;
-                }
-                break;
-            }
-        }
-        out.push(assigned);
-    }
-    return out;
-}
-//# sourceMappingURL=align.js.map

package/out/src/utils/align.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"align.js","sourceRoot":"","sources":["../../../src/utils/align.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,OAAO,EAAE,QAAQ,IAAI,mBAAmB,EAAE,MAAM,qBAAqB,CAAA;AAErE,OAAO,EAAE,mBAAmB,EAAkC,MAAM,eAAe,CAAA;AA0CnF;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAiB,EAAE,OAAqB,EAAE;IAClE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,mBAAmB,EAAE,CAAA;IACzD,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,CAAC,CAAA;IACjD,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,IAAI,CAAA;IAEpD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACd,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,CAAA;IAClE,CAAC;IAED,mGAAmG;IACnG,oGAAoG;IACpG,+FAA+F;IAC/F,qGAAqG;IACrG,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IACpC,MAAM,UAAU,GAAG,EAAE,GAAG,GAAG,CAAC,UAAU,EAAE,CAAA;IAExC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,UAAU,CAAC,GAA8B,CAAC,CAAA;QAEpD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC3B,UAAU,CAAC,GAA8B,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAChE,CAAC;IACF,CAAC;IAED,MAAM,cAAc,GAAoB,EAAE,CAAA;IAC1C,MAAM,OAAO,GAA4B,EAAE,CAAA;IAE3C,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;IAE1D,4FAA4F;IAC5F,6FAA6F;IAC7F,8FAA8F;IAC9F,4BAA4B;IAC5B,MAAM,OAAO,GAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAA+C,CAAC,QAAQ,CACjG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CACnD,CAAA;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YAAE,SAAQ;QAEpB,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAA;QAC5D,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAA;QAE5E,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,OAAO;gBACN,IAAI,EAAE,aAAa;gBACnB,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB,GAAG,EAAE,EAAE;aAClD,CAAA;QACF,CAAC;QAED,+FAA+F;QAC/F,8FAA8F;QAC9F,yFAAyF;QACzF,8FAA8F;QAC9F,4FAA4F;QAC5F,oDAAoD;QACpD,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACvE,OAAO;gBACN,IAAI,EAAE,aAAa;gBACnB,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,sBAAsB,GAAG,EAAE,EAAE;aACjD,CAAA;QACF,CAAC;QAED,cAAc,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;QAC9D,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;IACrC,CAAC;IAED,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IAChD,oBAAoB,CAAC,cAAc,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IACrD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;IACtC,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAA;IAElD,MAAM,OAAO,GAAe;QAC3B,GAAG,GAAG;QACN,GAAG;QACH,UAAU;QACV,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,MAAM;QACN,uFAAuF;QACvF,mFAAmF;QACnF,WAAW,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/C,SAAS,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3C,SAAS,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;KAC3C,CAAA;IAED,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,CAAA;AACzC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CACnC,KAA+B,EAC/B,GAAuD;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;QAEnB,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACnE,MAAM,IAAI,KAAK,CACd,wCAAwC,GAAG,CAAC,MAAM,eAAe,GAAG,CAAC,SAAS,KAAK;gBAClF,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,wBAAwB,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CACvE,CAAA;QACF,CAAC;QAED,IAAI,CAAC,KAAK,CAAC;YAAE,SAAQ;QACrB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAA;QAE1B,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACd,sCAAsC,GAAG,CAAC,MAAM,eAAe,GAAG,CAAC,SAAS,KAAK;gBAChF,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,GAAG,CACpF,CAAA;QACF,CAAC;QAED,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACd,mCAAmC,GAAG,CAAC,MAAM,eAAe,GAAG,CAAC,SAAS,KAAK;gBAC7E,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,GAAG,CACpF,CAAA;QACF,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,IAMnB;IACA,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,GAAG,IAAI,CAAA;IAE3D,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,SAAS,CAAA;IAEpC,+FAA+F;IAC/F,gGAAgG;IAChG,gGAAgG;IAChG,uFAAuF;IACvF,gGAAgG;IAChG,2DAA2D;IAC3D,IAAI,SAAqD,CAAA;IACzD,IAAI,IAAI,GAAG,CAAC,CAAA;IAEZ,OAAO,IAAI,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAE1C,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAK;QACrB,MAAM,GAAG,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;QAE/B,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;YACzC,IAAI,iBAAiB,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;YACrE,SAAS,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;QAClC,CAAC;QAED,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;IACf,CAAC;IAED,IAAI,SAAS;QAAE,OAAO,SAAS,CAAA;IAE/B,IAAI,eAAe,IAAI,CAAC;QAAE,OAAO,SAAS,CAAA;IAE1C,sFAAsF;IACtF,sFAAsF;IACtF,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,IAAI,eAAe,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,OAAO,CAAC;YAAE,SAAQ;QAClD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAA;QAEzC,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAA,CAAC,+BAA+B;QACxF,MAAM,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAE7C,IAAI,CAAC,IAAI,eAAe;YAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAA;IAC5D,CAAC;IAED,OAAO,SAAS,CAAA;AACjB,CAAC;AAED,MAAM,SAAS,GAAG,eAAe,CAAA;AAEjC;;GAEG;AACH,SAAS,iBAAiB,CAAC,QAAgB,EAAE,KAAa,EAAE,GAAW;IACtE,MAAM,MAAM,GAAG,KAAK,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAA;IACnE,MAAM,KAAK,GAAG,GAAG,KAAK,QAAQ,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAE,CAAC,CAAA;IAExE,OAAO,MAAM,IAAI,KAAK,CAAA;AACvB,CAAC;AAED,SAAS,eAAe,CAAC,KAAa,EAAE,GAAW,EAAE,OAAgC;IACpF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG;YAAE,OAAO,IAAI,CAAA;IACtC,CAAC;IAED,OAAO,KAAK,CAAA;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,MAA4B,EAAE,KAA+B;IACjF,MAAM,GAAG,GAAe,EAAE,CAAA;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAElC,qBAAqB;IAErB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,IAAI,QAAQ,GAAa,GAAG,CAAA;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;YAEnB,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;gBAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtB,QAAQ,GAAG,KAAK,CAAC,CAAC,GAAG,EAAc,CAAA;oBACnC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBAChB,CAAC;qBAAM,CAAC;oBACP,QAAQ,GAAG,KAAK,CAAC,CAAC,GAAG,EAAc,CAAA;gBACpC,CAAC;gBAED,MAAK;YACN,CAAC;QACF,CAAC;QAED,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACnB,CAAC;IAED,OAAO,GAAG,CAAA;AACX,CAAC"}

package/out/src/utils/golden.d.ts

@@ -1,69 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- *
- *   Golden eval-set validator (Phase 1 task #9 in the plan).
- *
- *   The golden set is hand-labeled ground truth for the neural classifier. Each entry must carry
- *   components whose surface forms actually occur in `raw` — otherwise the entry will silently rot
- *   the eval signal. This module:
- *
- *   - Defines `GoldenEntry` (schema check).
- *   - Loads `.jsonl` files (one entry per line).
- *   - Validates every entry: schema shape, ComponentTag membership, reachability of each component in
- *       `raw` via the same `reconcileComponents` helper alignment uses.
- *   - Returns a structured report of per-entry errors so the CLI / CI surface can act on it.
- *
- *   The 1000-entry target (500 US + 500 FR) is a human task. This module catches the regressions that
- *   creep in over time as new entries land.
- */
-import { type ComponentTag } from "@mailwoman/core/types";
-/**
- * One entry in a golden `.jsonl` file.
- */
-export interface GoldenEntry {
-    raw: string;
-    components: Partial<Record<ComponentTag, string>>;
-    country: string;
-    source: "golden";
-    notes?: string;
-}
-/**
- * Per-entry validation failure.
- */
-export interface GoldenIssue {
-    file: string;
-    line: number;
-    reason: string;
-}
-/**
- * Aggregate report from `validateGoldenDir`.
- */
-export interface GoldenReport {
-    entries: number;
-    files: number;
-    issues: GoldenIssue[];
-}
-/**
- * Parse a single JSONL line into a `GoldenEntry`. Throws on schema violations.
- */
-export declare function parseGoldenLine(line: string): GoldenEntry;
-/**
- * Check that every component in `entry` appears in `entry.raw` (reconciliation-equivalent).
- */
-export declare function unreachableComponents(entry: GoldenEntry): ComponentTag[];
-/**
- * Validate one `.jsonl` file end-to-end, returning a list of issues.
- *
- * Parses line by line over `TextSpliterator` rather than `JSONSpliterator`: every issue this returns carries the LINE
- * NUMBER it was found on, and a malformed line has to be REPORTED rather than thrown. `JSONSpliterator` parses each row
- * for you and throws on the first bad one — correct for consumers that want the rows, wrong for the validator whose
- * whole job is locating the bad ones.
- */
-export declare function validateGoldenFile(path: string): Promise<GoldenIssue[]>;
-/**
- * Validate every `.jsonl` in a golden directory.
- */
-export declare function validateGoldenDir(dir: string): Promise<GoldenReport>;
-//# sourceMappingURL=golden.d.ts.map

package/out/src/utils/golden.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"golden.d.ts","sourceRoot":"","sources":["../../../src/utils/golden.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAIH,OAAO,EAAkB,KAAK,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAOzE;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,GAAG,EAAE,MAAM,CAAA;IACX,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAA;IACjD,OAAO,EAAE,MAAM,CAAA;IACf,MAAM,EAAE,QAAQ,CAAA;IAChB,KAAK,CAAC,EAAE,MAAM,CAAA;CACd;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,EAAE,MAAM,CAAA;CACd;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B,OAAO,EAAE,MAAM,CAAA;IACf,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,WAAW,EAAE,CAAA;CACrB;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAmCzD;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,WAAW,GAAG,YAAY,EAAE,CAWxE;AAED;;;;;;;GAOG;AACH,wBAAsB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CA6B7E;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAkB1E"}

package/out/src/utils/golden.js

@@ -1,127 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- *
- *   Golden eval-set validator (Phase 1 task #9 in the plan).
- *
- *   The golden set is hand-labeled ground truth for the neural classifier. Each entry must carry
- *   components whose surface forms actually occur in `raw` — otherwise the entry will silently rot
- *   the eval signal. This module:
- *
- *   - Defines `GoldenEntry` (schema check).
- *   - Loads `.jsonl` files (one entry per line).
- *   - Validates every entry: schema shape, ComponentTag membership, reachability of each component in
- *       `raw` via the same `reconcileComponents` helper alignment uses.
- *   - Returns a structured report of per-entry errors so the CLI / CI surface can act on it.
- *
- *   The 1000-entry target (500 US + 500 FR) is a human task. This module catches the regressions that
- *   creep in over time as new entries land.
- */
-import { readdir } from "node:fs/promises";
-import { COMPONENT_TAGS } from "@mailwoman/core/types";
-import { reconcileComponents } from "@mailwoman/formatter";
-import { join } from "path-ts";
-import { TextSpliterator } from "spliterator";
-const TAG_SET = new Set(COMPONENT_TAGS);
-/**
- * Parse a single JSONL line into a `GoldenEntry`. Throws on schema violations.
- */
-export function parseGoldenLine(line) {
-    // The throw IS the result: `validateGoldenFile` catches it and records the message against the line
-    // number, so a tolerant parse would report a corrupt row as valid.
-    // oxlint-disable-next-line no-restricted-properties
-    const obj = JSON.parse(line);
-    if (typeof obj.raw !== "string" || !obj.raw.length) {
-        throw new Error("missing/empty raw");
-    }
-    if (typeof obj.country !== "string" || !/^[A-Z]{2}$/u.test(obj.country)) {
-        throw new Error(`country must be ISO 3166-1 alpha-2 (got ${JSON.stringify(obj.country)})`);
-    }
-    if (obj.source !== "golden") {
-        throw new Error(`source must be "golden" (got ${JSON.stringify(obj.source)})`);
-    }
-    const components = (obj.components ?? {});
-    for (const [k, v] of Object.entries(components)) {
-        if (!TAG_SET.has(k))
-            throw new Error(`unknown ComponentTag: ${k}`);
-        if (typeof v !== "string" || !v.length) {
-            throw new Error(`components.${k} must be a non-empty string`);
-        }
-    }
-    return {
-        raw: obj.raw,
-        components: components,
-        country: obj.country,
-        source: "golden",
-        notes: typeof obj.notes === "string" ? obj.notes : undefined,
-    };
-}
-/**
- * Check that every component in `entry` appears in `entry.raw` (reconciliation-equivalent).
- */
-export function unreachableComponents(entry) {
-    const reconciled = reconcileComponents(entry.components, entry.raw);
-    const missing = [];
-    for (const tag of Object.keys(entry.components)) {
-        if (!(tag in reconciled)) {
-            missing.push(tag);
-        }
-    }
-    return missing;
-}
-/**
- * Validate one `.jsonl` file end-to-end, returning a list of issues.
- *
- * Parses line by line over `TextSpliterator` rather than `JSONSpliterator`: every issue this returns carries the LINE
- * NUMBER it was found on, and a malformed line has to be REPORTED rather than thrown. `JSONSpliterator` parses each row
- * for you and throws on the first bad one — correct for consumers that want the rows, wrong for the validator whose
- * whole job is locating the bad ones.
- */
-export async function validateGoldenFile(path) {
-    const issues = [];
-    // Counted over EVERY row including blanks, so the number matches what an editor shows.
-    let lineNumber = 0;
-    for await (const raw of TextSpliterator.fromAsync(path, { skipEmpty: false })) {
-        lineNumber++;
-        const line = raw.trim();
-        if (!line)
-            continue;
-        const i = lineNumber - 1;
-        try {
-            const entry = parseGoldenLine(line);
-            const unreachable = unreachableComponents(entry);
-            if (unreachable.length) {
-                issues.push({
-                    file: path,
-                    line: i + 1,
-                    reason: `components not reachable in raw: ${unreachable.join(", ")}`,
-                });
-            }
-        }
-        catch (error) {
-            issues.push({ file: path, line: i + 1, reason: error.message });
-        }
-    }
-    return issues;
-}
-/**
- * Validate every `.jsonl` in a golden directory.
- */
-export async function validateGoldenDir(dir) {
-    const files = (await readdir(dir)).filter((n) => n.endsWith(".jsonl")).toSorted();
-    const issues = [];
-    let entries = 0;
-    for (const name of files) {
-        const fullPath = join(dir, name);
-        const fileIssues = await validateGoldenFile(fullPath);
-        issues.push(...fileIssues);
-        for await (const line of TextSpliterator.fromAsync(fullPath)) {
-            if (line.trim()) {
-                entries++;
-            }
-        }
-    }
-    return { entries, files: files.length, issues };
-}
-//# sourceMappingURL=golden.js.map

package/out/src/utils/golden.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"golden.js","sourceRoot":"","sources":["../../../src/utils/golden.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AAE1C,OAAO,EAAE,cAAc,EAAqB,MAAM,uBAAuB,CAAA;AACzE,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAA;AAC1D,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAA;AAC9B,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA;AAE7C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,cAAmC,CAAC,CAAA;AA+BpE;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC3C,oGAAoG;IACpG,mEAAmE;IACnE,oDAAoD;IACpD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAmD,CAAA;IAE9E,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;QACpD,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAA;IACrC,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACzE,MAAM,IAAI,KAAK,CAAC,2CAA2C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC3F,CAAC;IAED,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAC/E,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAA4B,CAAA;IAEpE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,EAAE,CAAC,CAAA;QAElE,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,6BAA6B,CAAC,CAAA;QAC9D,CAAC;IACF,CAAC;IAED,OAAO;QACN,GAAG,EAAE,GAAG,CAAC,GAAG;QACZ,UAAU,EAAE,UAAuC;QACnD,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,MAAM,EAAE,QAAQ;QAChB,KAAK,EAAE,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;KAC5D,CAAA;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAkB;IACvD,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;IACnE,MAAM,OAAO,GAAmB,EAAE,CAAA;IAElC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAmB,EAAE,CAAC;QACnE,IAAI,CAAC,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC;IACF,CAAC;IAED,OAAO,OAAO,CAAA;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,IAAY;IACpD,MAAM,MAAM,GAAkB,EAAE,CAAA;IAChC,uFAAuF;IACvF,IAAI,UAAU,GAAG,CAAC,CAAA;IAElB,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC/E,UAAU,EAAE,CAAA;QACZ,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAA;QAEvB,IAAI,CAAC,IAAI;YAAE,SAAQ;QACnB,MAAM,CAAC,GAAG,UAAU,GAAG,CAAC,CAAA;QAExB,IAAI,CAAC;YACJ,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,CAAA;YACnC,MAAM,WAAW,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAA;YAEhD,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;gBACxB,MAAM,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,IAAI;oBACV,IAAI,EAAE,CAAC,GAAG,CAAC;oBACX,MAAM,EAAE,oCAAoC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBACpE,CAAC,CAAA;YACH,CAAC;QACF,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAG,KAAe,CAAC,OAAO,EAAE,CAAC,CAAA;QAC3E,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAA;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,GAAW;IAClD,MAAM,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;IACjF,MAAM,MAAM,GAAkB,EAAE,CAAA;IAChC,IAAI,OAAO,GAAG,CAAC,CAAA;IAEf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAChC,MAAM,UAAU,GAAG,MAAM,kBAAkB,CAAC,QAAQ,CAAC,CAAA;QACrD,MAAM,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAA;QAE1B,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9D,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjB,OAAO,EAAE,CAAA;YACV,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,CAAA;AAChD,CAAC"}

package/out/src/utils/index.d.ts

@@ -1,14 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- */
-export * from "./align.ts";
-export * from "../build.ts";
-export * from "./golden.ts";
-export * from "./parquet.ts";
-export * from "./license.ts";
-export * from "./split.ts";
-export * from "./tokenize.ts";
-export * from "./wof-json.ts";
-//# sourceMappingURL=index.d.ts.map

package/out/src/utils/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,YAAY,CAAA;AAC1B,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,cAAc,CAAA;AAC5B,cAAc,cAAc,CAAA;AAC5B,cAAc,YAAY,CAAA;AAC1B,cAAc,eAAe,CAAA;AAC7B,cAAc,eAAe,CAAA"}

package/out/src/utils/index.js

@@ -1,14 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- */
-export * from "./align.js";
-export * from "../build.js";
-export * from "./golden.js";
-export * from "./parquet.js";
-export * from "./license.js";
-export * from "./split.js";
-export * from "./tokenize.js";
-export * from "./wof-json.js";
-//# sourceMappingURL=index.js.map

package/out/src/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,YAAY,CAAA;AAC1B,cAAc,aAAa,CAAA;AAC3B,cAAc,aAAa,CAAA;AAC3B,cAAc,cAAc,CAAA;AAC5B,cAAc,cAAc,CAAA;AAC5B,cAAc,YAAY,CAAA;AAC1B,cAAc,eAAe,CAAA;AAC7B,cAAc,eAAe,CAAA"}

package/out/src/utils/license.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"license.d.ts","sourceRoot":"","sources":["../../../src/utils/license.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH;;;GAGG;AACH,eAAO,MAAM,mBAAmB,QAAmD,CAAA;AAEnF;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAM7D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,EAAE,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAIjG"}

package/out/src/utils/license.js

@@ -1,47 +0,0 @@
-/**
- * @copyright Sister Software
- * @license AGPL-3.0
- * @author Teffen Ellis, et al.
- *
- *   Corpus licensing — the single source of truth for the training-data license policy (#26).
- *
- *   Posture (operator, 2026-06-19): **exclusion is a deliberate act, not a silent default.** The
- *   build INCLUDES every row an adapter yields (stamping its `license`); a build that needs a clean
- *   license set — e.g. the proprietary `@mailwoman/neural-weights-*` weights, which must not
- *   inherit a share-alike obligation — PURPOSELY excludes kinds via `buildCorpus({ excludeLicenses
- *   })` (CLI `--exclude-licenses` / `--exclude-share-alike`). Nothing is dropped on a license
- *   string unless the operator named it. This avoids the trap of silently dropping allowed data
- *   mis-stamped with a conservative license (e.g. BAN, which is dual-licensed Licence Ouverte OR
- *   ODbL — we elect Licence Ouverte; a default-deny on the old `ODbL` stamp would have wrongly
- *   dropped 48M allowed rows).
- *
- *   Tier reference (#26): A = PD/CC0 (allowed); B = CC-BY / Licence Ouverte (allowed WITH attribution
- *   — the model card must carry it); C = share-alike (ODbL, CC-BY-SA, CC-SA) — exclude for a
- *   proprietary-weights build via `--exclude-share-alike`.
- */
-/**
- * Licenses that require share-alike / create a copyleft obligation on derived works (Tier C). The
- * `--exclude-share-alike` convenience expands to this; `allowShareAlike: false` adapters also use it.
- */
-export const SHARE_ALIKE_PATTERN = /^ODbL|^Open Database License|^CC-BY-SA|^CC-SA/i;
-/**
- * Compile a `--exclude-licenses` spec (comma-separated, e.g. `"ODbL,CC-BY-SA"`) into anchored, case-insensitive prefix
- * patterns. Each entry matches a license string that STARTS with it, so `CC-BY-SA` catches `CC-BY-SA-3.0`,
- * `CC-BY-SA-4.0`, etc. Regex metacharacters are escaped — the spec is a literal license prefix, not a user-supplied
- * regex.
- */
-export function compileLicenseExcludes(spec) {
-    return spec
-        .split(",")
-        .map((s) => s.trim())
-        .filter(Boolean)
-        .map((s) => new RegExp("^" + s.replaceAll(/[.*+?^${}()|[\]\\]/g, "\\$&"), "i"));
-}
-/**
- * True iff `license` matches any of the exclude `patterns` (empty patterns → never excluded).
- */
-export function licenseExcluded(license, patterns) {
-    const l = license ?? "";
-    return patterns.some((p) => p.test(l));
-}
-//# sourceMappingURL=license.js.map