veriquote 0.1.1

package/dist/judge/json-extract.js

@@ -0,0 +1,117 @@
+/**
+ * Tolerant JSON recovery for LLM output. Small models occasionally emit
+ * truncated or slightly broken top-level JSON; these helpers recover as many
+ * well-formed item objects as possible without ever evaluating code.
+ */
+/** Return the first balanced `{...}` object in `s`, or `null`. String-aware. */
+export function extractFirstJsonObject(s) {
+    let depth = 0;
+    let start = -1;
+    let inString = false;
+    let escaped = false;
+    for (let i = 0; i < s.length; i++) {
+        const c = s[i];
+        if (start === -1) {
+            if (c === '{') {
+                start = i;
+                depth = 1;
+            }
+            continue;
+        }
+        if (inString) {
+            if (escaped)
+                escaped = false;
+            else if (c === '\\')
+                escaped = true;
+            else if (c === '"')
+                inString = false;
+            continue;
+        }
+        if (c === '"')
+            inString = true;
+        else if (c === '{')
+            depth++;
+        else if (c === '}' && --depth === 0)
+            return s.slice(start, i + 1);
+    }
+    return null;
+}
+/**
+ * Return the raw `[...]` array value of `"key"` in possibly-broken JSON text.
+ * Falls back to the unterminated tail when the closing bracket is missing.
+ */
+export function extractArrayByKey(raw, key) {
+    const pos = raw.indexOf(`"${key}"`);
+    if (pos === -1)
+        return null;
+    const lb = raw.indexOf('[', pos);
+    if (lb === -1)
+        return null;
+    let depth = 0;
+    let inString = false;
+    let escaped = false;
+    for (let i = lb; i < raw.length; i++) {
+        const c = raw[i];
+        if (inString) {
+            if (escaped)
+                escaped = false;
+            else if (c === '\\')
+                escaped = true;
+            else if (c === '"')
+                inString = false;
+            continue;
+        }
+        if (c === '"')
+            inString = true;
+        else if (c === '[')
+            depth++;
+        else if (c === ']' && --depth === 0)
+            return raw.slice(lb, i + 1);
+    }
+    return raw.slice(lb); // unterminated array: tolerate the tail
+}
+/** Extract every balanced top-level `{...}` object, skipping junk in between. */
+export function extractAllJsonObjects(s) {
+    const out = [];
+    let rest = s;
+    for (;;) {
+        const obj = extractFirstJsonObject(rest);
+        if (obj === null)
+            return out;
+        out.push(obj);
+        rest = rest.slice(rest.indexOf(obj) + obj.length);
+    }
+}
+/**
+ * Parse `content` (raw LLM output) into an array of item objects.
+ * Tries strict parsing of the first JSON object first, then recovers
+ * individual items from the `items` array of broken JSON.
+ */
+export function parseItemsArray(content, key = 'items') {
+    const objStr = extractFirstJsonObject(content);
+    if (objStr) {
+        try {
+            const parsed = JSON.parse(objStr);
+            const items = parsed?.[key];
+            if (Array.isArray(items))
+                return items;
+        }
+        catch {
+            // fall through to tolerant recovery
+        }
+    }
+    const arrStr = extractArrayByKey(content, key);
+    if (!arrStr)
+        return [];
+    const recovered = [];
+    for (const one of extractAllJsonObjects(arrStr)) {
+        try {
+            recovered.push(JSON.parse(one));
+        }
+        catch {
+            // skip the individual broken item
+        }
+    }
+    return recovered;
+}
+//# sourceMappingURL=json-extract.js.map

package/dist/judge/json-extract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-extract.js","sourceRoot":"","sources":["../../src/judge/json-extract.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,gFAAgF;AAChF,MAAM,UAAU,sBAAsB,CAAC,CAAS;IAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACd,KAAK,GAAG,CAAC,CAAC;gBACV,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,OAAO;gBAAE,OAAO,GAAG,KAAK,CAAC;iBACxB,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,GAAG,IAAI,CAAC;iBAC/B,IAAI,CAAC,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YACrC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;aAC1B,IAAI,CAAC,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACvB,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW,EAAE,GAAW;IACxD,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjC,IAAI,EAAE,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,OAAO;gBAAE,OAAO,GAAG,KAAK,CAAC;iBACxB,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,GAAG,IAAI,CAAC;iBAC/B,IAAI,CAAC,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YACrC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;aAC1B,IAAI,CAAC,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACvB,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,wCAAwC;AAChE,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,qBAAqB,CAAC,CAAS;IAC7C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,SAAS,CAAC;QACR,MAAM,GAAG,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,GAAG,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe,EAAE,GAAG,GAAG,OAAO;IAC5D,MAAM,MAAM,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAC/C,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,CAAC;YACH,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAI,MAAkC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QACzC,CAAC;QAAC,MAAM,CAAC;YACP,oCAAoC;QACtC,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC/C,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IACvB,MAAM,SAAS,GAAc,EAAE,CAAC;IAChC,KAAK,MAAM,GAAG,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;QAChD,IAAI,CAAC;YACH,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,kCAAkC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/match/fuzzy.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Deterministic fuzzy quote matching.
+ *
+ * Strategy, in order of preference:
+ *   1. exact raw substring,
+ *   2. exact substring after normalization (quotes, dashes, case, whitespace),
+ *   3. best sliding window by character-trigram Dice similarity, with a
+ *      coarse scan followed by a fine refinement around the best offset.
+ *
+ * Everything here is pure and deterministic: same inputs, same result.
+ */
+import type { QuoteMatch, SourceDocument } from '../types.js';
+export interface MatchOptions {
+    /** Source fields shorter than this are skipped (too little signal). Default 40. */
+    minSourceLength?: number;
+    /**
+     * Quotes shorter than this get a proportional score penalty, because short
+     * strings produce spuriously high trigram similarity. Default 90.
+     */
+    shortQuoteLength?: number;
+    /** Fuzzy score below this yields method `"not_found"`. Default 0.4. */
+    fuzzyThreshold?: number;
+    /** Window sizes to try, as multiples of the quote length. Default [0.85, 1, 1.15]. */
+    windowScales?: number[];
+}
+/** Multiset of character trigrams of `s` as gram -> count. */
+export declare function trigramCounts(s: string): Map<string, number>;
+/** Sørensen–Dice similarity between two trigram multisets. */
+export declare function diceSimilarity(a: Map<string, number>, b: Map<string, number>): number;
+interface WindowHit {
+    score: number;
+    /** Start offset in the scanned text; -1 when nothing scored above 0. */
+    offset: number;
+    windowLength: number;
+}
+/** Best fuzzy window of `text` for `quote` (both already normalized). */
+export declare function bestFuzzyWindow(quote: string, text: string, scales: number[]): WindowHit;
+/** Match `quote` against a single text field. Offsets refer to `text` as given. */
+export declare function matchQuoteAgainstText(quote: string, text: string, options?: MatchOptions): QuoteMatch;
+/**
+ * Match `quote` against all text fields of a source document and return the
+ * best result. Stops early on the first perfect hit.
+ */
+export declare function matchQuoteAgainstSource(quote: string, source: SourceDocument, options?: MatchOptions): QuoteMatch;
+export {};
+//# sourceMappingURL=fuzzy.d.ts.map

package/dist/match/fuzzy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy.d.ts","sourceRoot":"","sources":["../../src/match/fuzzy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAG9D,MAAM,WAAW,YAAY;IAC3B,mFAAmF;IACnF,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,uEAAuE;IACvE,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,sFAAsF;IACtF,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AASD,8DAA8D;AAC9D,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAO5D;AAED,8DAA8D;AAC9D,wBAAgB,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAarF;AAED,UAAU,SAAS;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,wEAAwE;IACxE,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;CACtB;AAsED,yEAAyE;AACzE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CA4BxF;AAED,mFAAmF;AACnF,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,YAAY,GACrB,UAAU,CA8CZ;AAUD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,cAAc,EACtB,OAAO,CAAC,EAAE,YAAY,GACrB,UAAU,CAeZ"}

package/dist/match/fuzzy.js

@@ -0,0 +1,210 @@
+/**
+ * Deterministic fuzzy quote matching.
+ *
+ * Strategy, in order of preference:
+ *   1. exact raw substring,
+ *   2. exact substring after normalization (quotes, dashes, case, whitespace),
+ *   3. best sliding window by character-trigram Dice similarity, with a
+ *      coarse scan followed by a fine refinement around the best offset.
+ *
+ * Everything here is pure and deterministic: same inputs, same result.
+ */
+import { normalizeForMatch } from './normalize.js';
+const DEFAULTS = {
+    minSourceLength: 40,
+    shortQuoteLength: 90,
+    fuzzyThreshold: 0.4,
+    windowScales: [0.85, 1, 1.15],
+};
+/** Multiset of character trigrams of `s` as gram -> count. */
+export function trigramCounts(s) {
+    const out = new Map();
+    for (let i = 0; i + 3 <= s.length; i++) {
+        const g = s.slice(i, i + 3);
+        out.set(g, (out.get(g) ?? 0) + 1);
+    }
+    return out;
+}
+/** Sørensen–Dice similarity between two trigram multisets. */
+export function diceSimilarity(a, b) {
+    let aTotal = 0;
+    let bTotal = 0;
+    for (const v of a.values())
+        aTotal += v;
+    for (const v of b.values())
+        bTotal += v;
+    if (!aTotal || !bTotal)
+        return 0;
+    let inter = 0;
+    const [small, large] = a.size <= b.size ? [a, b] : [b, a];
+    for (const [g, v] of small) {
+        const w = large.get(g);
+        if (w)
+            inter += Math.min(v, w);
+    }
+    return (2 * inter) / (aTotal + bTotal);
+}
+/**
+ * Rolling-window Dice scan: slides a window of `windowLength` over `text` in
+ * steps of `step`, keeping trigram counts and the multiset intersection with
+ * the quote incrementally updated — O(text length) per window size instead of
+ * O(text length x window length).
+ */
+function scanWindows(quoteGrams, quoteTotal, text, windowLength, step, from, to) {
+    const best = { score: 0, offset: -1, windowLength };
+    if (quoteTotal === 0)
+        return best;
+    const gramsInWindow = windowLength - 2;
+    if (gramsInWindow <= 0 || windowLength > text.length) {
+        const d = diceSimilarity(quoteGrams, trigramCounts(text));
+        if (d > best.score) {
+            best.score = d;
+            best.offset = 0;
+            best.windowLength = text.length;
+        }
+        return best;
+    }
+    const start = Math.max(0, from);
+    const end = Math.min(to, text.length - windowLength);
+    if (start > end)
+        return best;
+    // Initialize counts/intersection for the window at `start`.
+    const counts = new Map();
+    let inter = 0;
+    const add = (g) => {
+        const c = (counts.get(g) ?? 0) + 1;
+        counts.set(g, c);
+        if (c <= (quoteGrams.get(g) ?? 0))
+            inter++;
+    };
+    const remove = (g) => {
+        const c = (counts.get(g) ?? 1) - 1;
+        if (c === 0)
+            counts.delete(g);
+        else
+            counts.set(g, c);
+        if (c < (quoteGrams.get(g) ?? 0))
+            inter--;
+    };
+    for (let i = start; i < start + gramsInWindow; i++)
+        add(text.slice(i, i + 3));
+    const denom = quoteTotal + gramsInWindow;
+    for (let pos = start;; pos += step) {
+        const d = (2 * inter) / denom;
+        if (d > best.score) {
+            best.score = d;
+            best.offset = pos;
+        }
+        if (best.score >= 0.995 || pos + step > end)
+            break;
+        // Slide by `step`: retire grams starting in [pos, pos+step),
+        // admit grams starting in [pos+gramsInWindow, pos+gramsInWindow+step).
+        for (let i = pos; i < pos + step; i++)
+            remove(text.slice(i, i + 3));
+        for (let i = pos + gramsInWindow; i < pos + gramsInWindow + step; i++) {
+            add(text.slice(i, i + 3));
+        }
+    }
+    return best;
+}
+/** Best fuzzy window of `text` for `quote` (both already normalized). */
+export function bestFuzzyWindow(quote, text, scales) {
+    const qLen = quote.length;
+    if (!qLen || !text.length)
+        return { score: 0, offset: -1, windowLength: 0 };
+    const quoteGrams = trigramCounts(quote);
+    let quoteTotal = 0;
+    for (const v of quoteGrams.values())
+        quoteTotal += v;
+    const coarseStep = Math.max(10, Math.min(80, Math.round(qLen / 8)));
+    let best = { score: 0, offset: -1, windowLength: 0 };
+    for (const scale of scales) {
+        const w = Math.max(40, Math.round(qLen * scale));
+        const hit = scanWindows(quoteGrams, quoteTotal, text, w, coarseStep, 0, text.length);
+        if (hit.score > best.score)
+            best = hit;
+    }
+    if (best.offset >= 0 && coarseStep > 1) {
+        // Fine pass: re-scan around the coarse optimum with step 1.
+        const refined = scanWindows(quoteGrams, quoteTotal, text, best.windowLength, 1, best.offset - coarseStep, best.offset + coarseStep);
+        if (refined.score > best.score)
+            best = refined;
+    }
+    return best;
+}
+/** Match `quote` against a single text field. Offsets refer to `text` as given. */
+export function matchQuoteAgainstText(quote, text, options) {
+    const opts = { ...DEFAULTS, ...options };
+    const quoteRaw = quote.trim();
+    const empty = { method: 'not_found', score: 0, field: 'text' };
+    if (!quoteRaw || !text)
+        return empty;
+    const rawIndex = text.indexOf(quoteRaw);
+    if (rawIndex !== -1) {
+        return {
+            method: 'exact',
+            score: 1,
+            start: rawIndex,
+            end: rawIndex + quoteRaw.length,
+            field: 'text',
+        };
+    }
+    const q = normalizeForMatch(quoteRaw);
+    const t = normalizeForMatch(text);
+    if (!q.text || !t.text)
+        return empty;
+    const normIndex = t.text.indexOf(q.text);
+    if (normIndex !== -1) {
+        return {
+            method: 'normalized',
+            score: 1,
+            start: t.map[normIndex],
+            end: mapEndOffset(t.map, normIndex + q.text.length - 1, text),
+            field: 'text',
+        };
+    }
+    const hit = bestFuzzyWindow(q.text, t.text, opts.windowScales);
+    const lengthPenalty = Math.min(1, q.text.length / opts.shortQuoteLength);
+    const score = Math.max(0, Math.min(0.99, hit.score * lengthPenalty));
+    if (hit.offset < 0 || score < opts.fuzzyThreshold) {
+        return { ...empty, score };
+    }
+    const lastNormIndex = Math.min(hit.offset + hit.windowLength - 1, t.map.length - 1);
+    return {
+        method: 'fuzzy',
+        score,
+        start: t.map[hit.offset],
+        end: mapEndOffset(t.map, lastNormIndex, text),
+        field: 'text',
+    };
+}
+/** Exclusive end offset in the original text for the normalized char at `lastIndex`. */
+function mapEndOffset(map, lastIndex, original) {
+    const srcIndex = map[Math.max(0, Math.min(lastIndex, map.length - 1))];
+    // Advance past the full code point at srcIndex.
+    const cp = original.codePointAt(srcIndex);
+    return srcIndex + (cp !== undefined && cp > 0xffff ? 2 : 1);
+}
+/**
+ * Match `quote` against all text fields of a source document and return the
+ * best result. Stops early on the first perfect hit.
+ */
+export function matchQuoteAgainstSource(quote, source, options) {
+    const opts = { ...DEFAULTS, ...options };
+    const fields = [
+        { name: 'text', text: source.text ?? '' },
+    ];
+    (source.extraTexts ?? []).forEach((t, i) => fields.push({ name: `extraTexts[${i}]`, text: t }));
+    let best = { method: 'not_found', score: 0, field: 'text' };
+    for (const field of fields) {
+        if (field.text.trim().length < opts.minSourceLength)
+            continue;
+        const r = matchQuoteAgainstText(quote, field.text, opts);
+        if (r.score > best.score)
+            best = { ...r, field: field.name };
+        if (best.score === 1)
+            break;
+    }
+    return best;
+}
+//# sourceMappingURL=fuzzy.js.map

package/dist/match/fuzzy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy.js","sourceRoot":"","sources":["../../src/match/fuzzy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAgBnD,MAAM,QAAQ,GAA2B;IACvC,eAAe,EAAE,EAAE;IACnB,gBAAgB,EAAE,EAAE;IACpB,cAAc,EAAE,GAAG;IACnB,YAAY,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC;CAC9B,CAAC;AAEF,8DAA8D;AAC9D,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,cAAc,CAAC,CAAsB,EAAE,CAAsB;IAC3E,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE;QAAE,MAAM,IAAI,CAAC,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE;QAAE,MAAM,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACjC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC;YAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;AACzC,CAAC;AASD;;;;;GAKG;AACH,SAAS,WAAW,CAClB,UAA+B,EAC/B,UAAkB,EAClB,IAAY,EACZ,YAAoB,EACpB,IAAY,EACZ,IAAY,EACZ,EAAU;IAEV,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC;IAC/D,IAAI,UAAU,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,aAAa,GAAG,YAAY,GAAG,CAAC,CAAC;IACvC,IAAI,aAAa,IAAI,CAAC,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACrD,MAAM,CAAC,GAAG,cAAc,CAAC,UAAU,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;IACrD,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAE7B,4DAA4D;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE;QACxB,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IAC7C,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;;YACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IAC5C,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,aAAa,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE9E,MAAM,KAAK,GAAG,UAAU,GAAG,aAAa,CAAC;IACzC,KAAK,IAAI,GAAG,GAAG,KAAK,GAAI,GAAG,IAAI,IAAI,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACpB,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG;YAAE,MAAM;QACnD,6DAA6D;QAC7D,uEAAuE;QACvE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,aAAa,EAAE,CAAC,GAAG,GAAG,GAAG,aAAa,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,IAAY,EAAE,MAAgB;IAC3E,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAC5E,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE;QAAE,UAAU,IAAI,CAAC,CAAC;IAErD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IAChE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,WAAW,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrF,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;YAAE,IAAI,GAAG,GAAG,CAAC;IACzC,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACvC,4DAA4D;QAC5D,MAAM,OAAO,GAAG,WAAW,CACzB,UAAU,EACV,UAAU,EACV,IAAI,EACJ,IAAI,CAAC,YAAY,EACjB,CAAC,EACD,IAAI,CAAC,MAAM,GAAG,UAAU,EACxB,IAAI,CAAC,MAAM,GAAG,UAAU,CACzB,CAAC;QACF,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;YAAE,IAAI,GAAG,OAAO,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,qBAAqB,CACnC,KAAa,EACb,IAAY,EACZ,OAAsB;IAEtB,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAe,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC3E,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QACpB,OAAO;YACL,MAAM,EAAE,OAAO;YACf,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,QAAQ;YACf,GAAG,EAAE,QAAQ,GAAG,QAAQ,CAAC,MAAM;YAC/B,KAAK,EAAE,MAAM;SACd,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAErC,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO;YACL,MAAM,EAAE,YAAY;YACpB,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;YACvB,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC;YAC7D,KAAK,EAAE,MAAM;SACd,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAC/D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC;IACrE,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAClD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpF,OAAO;QACL,MAAM,EAAE,OAAO;QACf,KAAK;QACL,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;QACxB,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC;QAC7C,KAAK,EAAE,MAAM;KACd,CAAC;AACJ,CAAC;AAED,wFAAwF;AACxF,SAAS,YAAY,CAAC,GAAe,EAAE,SAAiB,EAAE,QAAgB;IACxE,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,gDAAgD;IAChD,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC1C,OAAO,QAAQ,GAAG,CAAC,EAAE,KAAK,SAAS,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAa,EACb,MAAsB,EACtB,OAAsB;IAEtB,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC;IACzC,MAAM,MAAM,GAA0C;QACpD,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE;KAC1C,CAAC;IACF,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhG,IAAI,IAAI,GAAe,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACxE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe;YAAE,SAAS;QAC9D,MAAM,CAAC,GAAG,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzD,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;YAAE,IAAI,GAAG,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7D,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,MAAM;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/match/normalize.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Unicode/typography normalization with an offset map back to the original
+ * string, so fuzzy-match positions can be reported in raw-source coordinates.
+ */
+export interface NormalizedText {
+    /** Normalized text: NFKC, unified quotes/dashes, case-folded, collapsed whitespace. */
+    text: string;
+    /** For every char in `text`, the index of the originating char in the input. */
+    map: Int32Array;
+}
+/**
+ * Normalize `input` for matching while recording, for each output character,
+ * the index of the input character it came from.
+ *
+ * Normalization is applied per code point so the offset map stays exact even
+ * when NFKC or case folding expands a character (e.g. ligatures): every
+ * expanded output character maps to the same input index.
+ */
+export declare function normalizeForMatch(input: string): NormalizedText;
+/** Strip C0/C1 control characters (except `\n` and `\t`) from a string. */
+export declare function stripControlChars(s: string): string;
+/** Remove HTML/XML tags. Used to clean noisy scraped context for the judge. */
+export declare function stripHtmlTags(s: string): string;
+/** Collapse whitespace and trim. */
+export declare function collapseWhitespace(s: string): string;
+//# sourceMappingURL=normalize.d.ts.map

package/dist/match/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../src/match/normalize.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,cAAc;IAC7B,uFAAuF;IACvF,IAAI,EAAE,MAAM,CAAC;IACb,gFAAgF;IAChF,GAAG,EAAE,UAAU,CAAC;CACjB;AASD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,cAAc,CAoC/D;AAED,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAGnD;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED,oCAAoC;AACpC,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEpD"}

package/dist/match/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../src/match/normalize.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,kDAAkD;AAClD,MAAM,UAAU,GAAG,kCAAkC,CAAC;AACtD,MAAM,aAAa,GAAG,wCAAwC,CAAC;AAC/D,MAAM,aAAa,GAAG,4BAA4B,CAAC;AACnD,qEAAqE;AACrE,MAAM,MAAM,GAAG,uBAAuB,CAAC;AAEvC;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,IAAI,UAAU,GAAG,KAAK,CAAC;IAEvB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC;QACvB,KAAK,IAAI,EAAE,CAAC,MAAM,CAAC;QAEnB,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAElC,IAAI,KAAa,CAAC;QAClB,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,KAAK,GAAG,GAAG,CAAC;aACnC,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,KAAK,GAAG,GAAG,CAAC;aACxC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,KAAK,GAAG,GAAG,CAAC;;YACjC,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;QAEhD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClB,YAAY,GAAG,UAAU,CAAC,CAAC,yCAAyC;gBACpE,SAAS;YACX,CAAC;YACD,IAAI,YAAY,EAAE,CAAC;gBACjB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtB,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,iBAAiB,CAAC,CAAS;IACzC,4CAA4C;IAC5C,OAAO,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,OAAO,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,oCAAoC;AACpC,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC1C,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC"}

package/dist/protocol/evi1.d.ts

@@ -0,0 +1,51 @@
+/**
+ * The EVI1 protocol: a plain-text convention that lets an LLM attach
+ * verifiable evidence to its answer.
+ *
+ * In the answer body, every cited sentence ends with citation markers and a
+ * claim marker, e.g. `...water expands when freezing.[2][5]{c1}`. After the
+ * answer, the model appends:
+ *
+ *     EVI1
+ *     c1|2|"verbatim quote from source 2"
+ *     c1|5|"verbatim quote from source 5"
+ *     END_EVI1
+ *
+ * Quotes are single-line, with `\n`, `\"` and `\\` escapes.
+ */
+import type { Claim, EvidenceItem, ParsedAnswer } from '../types.js';
+export declare const EVI1_START = "EVI1";
+export declare const EVI1_END = "END_EVI1";
+/**
+ * Parse the EVI1 appendix of a raw model answer.
+ * Returns the evidence items plus warnings for malformed lines;
+ * `null` when no complete appendix is present.
+ */
+export declare function parseEvi1Appendix(answer: string): {
+    items: EvidenceItem[];
+    warnings: string[];
+} | null;
+/** Remove the EVI1 appendix from a raw answer; returns the answer body. */
+export declare function stripEvi1Appendix(answer: string): string;
+/** Serialize evidence items into an EVI1 appendix block. */
+export declare function serializeEvi1Appendix(items: EvidenceItem[]): string;
+/**
+ * Extract cited claims from an answer body (appendix already stripped).
+ *
+ * A claim is the text segment ending at a `{cX}` marker, bounded by the start
+ * of its line/block or the previous claim marker. Its cited sources are the
+ * contiguous `[n]` group immediately preceding the marker, per protocol.
+ */
+export declare function extractClaims(body: string): {
+    claims: Claim[];
+    warnings: string[];
+};
+/** Remove all `{cX}` claim markers from a text. */
+export declare function stripClaimMarkers(text: string): string;
+/**
+ * Parse a raw model answer end-to-end: strip the appendix, extract claims and
+ * evidence, and cross-check completeness (every cited (claim, source) pair
+ * should have exactly one evidence item, and vice versa).
+ */
+export declare function parseAnswer(answer: string): ParsedAnswer;
+//# sourceMappingURL=evi1.d.ts.map

package/dist/protocol/evi1.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evi1.d.ts","sourceRoot":"","sources":["../../src/protocol/evi1.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAGrE,eAAO,MAAM,UAAU,SAAS,CAAC;AACjC,eAAO,MAAM,QAAQ,aAAa,CAAC;AAmCnC;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,GACb;IAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,GAAG,IAAI,CAuBtD;AAED,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CASxD;AAED,4DAA4D;AAC5D,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAKnE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG;IAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,CAmCnF;AAOD,mDAAmD;AACnD,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEtD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAmCxD"}