agentfootprint 10.9.0 → 11.0.0

package/dist/integrity/negative-claim/language.js

@@ -0,0 +1,46 @@
+"use strict";
+/**
+ * language — whether a unit is English, over a CLOSED stop-word set. The grammar is English
+ * only; a unit in another language is noted `language-unsupported`, never passed silently.
+ *
+ * Pattern: a count, not a model. A unit is unsupported when it is mostly letters of a non-Latin
+ *          script, or when one other language's stop words outnumber the English ones (and at
+ *          least two of them are there). The foreign lists hold no word that is also common
+ *          English (`die`, `den`, `per`, `con`, `as`, `on` are left out), so an English sentence
+ *          naming "the San José cluster" stays English.
+ * Role:    integrity/ layer (L3), read by `detect.ts`.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSupportedLanguage = void 0;
+const ENGLISH = new Set(('the a an is are was were be been there no not none nothing has have had do does did of to ' +
+    'and or in on at for with by from any this that these those it its all every found exist ' +
+    'exists open i we you they our your their').split(' '));
+const FOREIGN = {
+    es: new Set('hay los las el del una unos unas para por que está están ningún ninguna ninguno nada existe en sin también pero sí abiertos abiertas'.split(' ')),
+    fr: new Set("les des est sont une aucun aucune pas il elle avec pour dans sur ce cette qui du au aux rien n'y y ouvert ouverte".split(' ')),
+    de: new Set('der das und ist sind nicht kein keine keinen ein eine einen mit für auf es gibt nichts dem zu offenen'.split(' ')),
+    pt: new Set('não há os um uma nenhum nenhuma são existem também abertos'.split(' ')),
+    it: new Set('il gli non sono è nessun nessuna ci della delle aperti'.split(' ')),
+    nl: new Set('het een niet geen zijn er voor ook'.split(' ')),
+};
+/** Whether a unit can be read by the English grammar. */
+function isSupportedLanguage(unitText, tokens) {
+    const letters = unitText.match(/\p{L}/gu)?.length ?? 0;
+    const latin = unitText.match(/\p{Script=Latin}/gu)?.length ?? 0;
+    if (letters - latin >= 3 && letters - latin > latin)
+        return false;
+    let english = 0;
+    const foreign = {};
+    for (const token of tokens) {
+        if (ENGLISH.has(token.text))
+            english += 1;
+        for (const [language, words] of Object.entries(FOREIGN)) {
+            if (words.has(token.text))
+                foreign[language] = (foreign[language] ?? 0) + 1;
+        }
+    }
+    const most = Math.max(0, ...Object.values(foreign));
+    return !(most >= 2 && most > english);
+}
+exports.isSupportedLanguage = isSupportedLanguage;
+//# sourceMappingURL=language.js.map

package/dist/integrity/negative-claim/language.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"language.js","sourceRoot":"","sources":["../../../src/integrity/negative-claim/language.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAIH,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CACE,4FAA4F;IAC5F,0FAA0F;IAC1F,0CAA0C,CAC3C,CAAC,KAAK,CAAC,GAAG,CAAC,CACb,CAAC;AAEF,MAAM,OAAO,GAAkD;IAC7D,EAAE,EAAE,IAAI,GAAG,CACT,sIAAsI,CAAC,KAAK,CAC1I,GAAG,CACJ,CACF;IACD,EAAE,EAAE,IAAI,GAAG,CACT,mHAAmH,CAAC,KAAK,CACvH,GAAG,CACJ,CACF;IACD,EAAE,EAAE,IAAI,GAAG,CACT,uGAAuG,CAAC,KAAK,CAC3G,GAAG,CACJ,CACF;IACD,EAAE,EAAE,IAAI,GAAG,CAAC,4DAA4D,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACpF,EAAE,EAAE,IAAI,GAAG,CAAC,wDAAwD,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChF,EAAE,EAAE,IAAI,GAAG,CAAC,oCAAoC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;CAC7D,CAAC;AAEF,yDAAyD;AACzD,SAAgB,mBAAmB,CAAC,QAAgB,EAAE,MAAwB;IAC5E,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;IAChE,IAAI,OAAO,GAAG,KAAK,IAAI,CAAC,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK;QAAE,OAAO,KAAK,CAAC;IAClE,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACxD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC;AACxC,CAAC;AAdD,kDAcC"}

package/dist/integrity/negative-claim/limits.js

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MAX_NEGATIVE_CLAIMS = void 0;
+/** Maximum claims judged per answer field, shared by the typed and prose doors. */
+exports.MAX_NEGATIVE_CLAIMS = 32;
+//# sourceMappingURL=limits.js.map

package/dist/integrity/negative-claim/limits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../../src/integrity/negative-claim/limits.ts"],"names":[],"mappings":";;;AAAA,mFAAmF;AACtE,QAAA,mBAAmB,GAAG,EAAE,CAAC"}

package/dist/integrity/negative-claim/matcher.js

@@ -0,0 +1,179 @@
+"use strict";
+/**
+ * matcher — the prose grammar's machinery: a reply's tokens with their offsets, and the phrase
+ * matcher over them. It owns NO spelling rule: every token is spelled by the library's one
+ * spelling leaf (`lib/normalize.ts` · `foldCase`), and names compare by its `sameName`.
+ *
+ * Pattern: pure functions, linear in the text. A token is a run of letters, digits and marks,
+ *          with `- _ . / : @ #` kept INSIDE an identifier (`host-07.dc1.example.com`, `eth1/3`)
+ *          and an apostrophe kept inside a word (`doesn't`); every step of the one tokenizer
+ *          regex consumes a character, so no input backtracks. Spans are offsets into the text
+ *          as given; only each token's own text is spelled.
+ * Role:    integrity/ layer (L3), read by `units.ts`, `detect.ts`, `language.ts`,
+ *          `resolve.ts` and `containment.ts`.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.allHits = exports.firstHit = exports.matchPhrase = exports.numberOf = exports.nameAt = exports.holdsName = exports.holdsAnySaid = exports.findWords = exports.holdsWords = exports.spell = exports.tokensOf = exports.spellToken = void 0;
+const normalize_js_1 = require("../../lib/normalize.js");
+const TOKEN = /[\p{L}\p{N}\p{M}](?:[\p{L}\p{N}\p{M}]|['\u{2019}](?=\p{L})|[-_./:@#](?=[\p{L}\p{N}]))*/gu;
+/** One token as the grammar compares it: the leaf's case fold, a curly apostrophe straightened. */
+function spellToken(raw) {
+    return (0, normalize_js_1.foldCase)(raw.normalize('NFC')).replace(/\u{2019}/gu, "'");
+}
+exports.spellToken = spellToken;
+/** The tokens of `text[from, to)`, with offsets into `text`. */
+function tokensOf(text, from = 0, to = text.length) {
+    const out = [];
+    const slice = text.slice(from, to);
+    for (const m of slice.matchAll(TOKEN)) {
+        const start = from + (m.index ?? 0);
+        out.push({ text: spellToken(m[0]), start, end: start + m[0].length });
+    }
+    return out;
+}
+exports.tokensOf = tokensOf;
+/** A phrase's or a said word's tokens, as text. */
+function spell(phrase, work) {
+    work?.charge(phrase.length + 1);
+    return tokensOf(phrase).map((t) => t.text);
+}
+exports.spell = spell;
+/** Whether `tokens` hold `words` as consecutive tokens, anywhere. */
+function holdsWords(tokens, words, work) {
+    return findWords(tokens, words, 0, work) !== -1;
+}
+exports.holdsWords = holdsWords;
+/** The first index at which `tokens` hold `words` consecutively, or -1. */
+function findWords(tokens, words, from = 0, work) {
+    if (words.length === 0)
+        return -1;
+    outer: for (let i = from; i + words.length <= tokens.length; i += 1) {
+        for (let j = 0; j < words.length; j += 1) {
+            work?.charge(1);
+            if (tokens[i + j]?.text !== words[j])
+                continue outer;
+        }
+        return i;
+    }
+    return -1;
+}
+exports.findWords = findWords;
+/** Whether any of the said phrases is held by `tokens`. */
+function holdsAnySaid(tokens, said, work) {
+    return (said ?? []).some((phrase) => holdsWords(tokens, spell(phrase, work), work));
+}
+exports.holdsAnySaid = holdsAnySaid;
+/** Whether the unit holds `name` as one of its token runs, by the leaf's name rule (`sameName`). */
+function holdsName(text, tokens, name, work) {
+    return nameAt(text, tokens, name, 0, work) !== -1;
+}
+exports.holdsName = holdsName;
+/** The first token index at which the unit holds `name` (by `sameName`), from `from`; or -1. */
+function nameAt(text, tokens, name, from, work) {
+    const words = spell(name, work);
+    for (let at = findWords(tokens, words, from, work); at !== -1; at = findWords(tokens, words, at + 1, work)) {
+        const first = tokens[at];
+        const last = tokens[at + words.length - 1];
+        work?.charge(last.end - first.start + name.length + 1);
+        if ((0, normalize_js_1.sameName)(text.slice(first.start, last.end), name))
+            return at;
+    }
+    return -1;
+}
+exports.nameAt = nameAt;
+// ─── the phrase matcher ──────────────────────────────────────────────────
+const NUMBER_WORDS = new Set('one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen twenty'.split(' '));
+/** A number word's value, or a digit string's. */
+function numberOf(token) {
+    if (/^\d{1,6}$/.test(token))
+        return Number(token);
+    const words = [...NUMBER_WORDS];
+    const at = words.indexOf(token);
+    return at === -1 ? undefined : at + 1;
+}
+exports.numberOf = numberOf;
+const startsWithLetter = (token) => /^\p{L}/u.test(token);
+function compileSlot(raw) {
+    const optional = raw.endsWith('?') && raw.length > 1;
+    const body = optional ? raw.slice(0, -1) : raw;
+    if (body === '<word>')
+        return { optional, test: startsWithLetter };
+    if (body === '<num>')
+        return { optional, test: (t) => numberOf(t) !== undefined };
+    if (body === '<dur>')
+        return { optional, test: (t) => /^\d{1,6}[mhdw]$/.test(t) };
+    if (body.startsWith('!')) {
+        const except = new Set(body.slice(1).split('|'));
+        return { optional, test: (t) => startsWithLetter(t) && !except.has(t) };
+    }
+    const options = new Set(body.split('|'));
+    return { optional, test: (t) => options.has(t) };
+}
+const COMPILED = new WeakMap();
+function compiled(phrase) {
+    const known = COMPILED.get(phrase);
+    if (known !== undefined)
+        return known;
+    const anchored = phrase.literal !== true && phrase.words[0] === '^';
+    const words = anchored ? phrase.words.slice(1) : phrase.words;
+    const made = {
+        anchored,
+        slots: words.map((word) => phrase.literal === true
+            ? { optional: false, test: (token) => token === word }
+            : compileSlot(word)),
+    };
+    COMPILED.set(phrase, made);
+    return made;
+}
+/** Only spaces between two matched tokens — a comma or a full stop breaks a phrase. */
+const spaced = (text, left, right) => /^[ \t\u{A0}]*$/u.test(text.slice(left.end, right.start));
+/** The token index after a match of `slots` from `slot`/`at`, or -1. Optional slots fork. */
+function matchFrom(text, tokens, slots, slot, at, previous) {
+    if (slot === slots.length)
+        return at;
+    const s = slots[slot];
+    const token = tokens[at];
+    if (token !== undefined &&
+        s.test(token.text) &&
+        (previous === undefined || spaced(text, previous, token))) {
+        const end = matchFrom(text, tokens, slots, slot + 1, at + 1, token);
+        if (end !== -1)
+            return end;
+    }
+    return s.optional ? matchFrom(text, tokens, slots, slot + 1, at, previous) : -1;
+}
+/** The first hit of `phrase` in a unit's tokens, or undefined. */
+function matchPhrase(text, tokens, phrase) {
+    const { anchored, slots } = compiled(phrase);
+    const starts = anchored ? Math.min(1, tokens.length) : tokens.length;
+    for (let i = 0; i < starts; i += 1) {
+        const end = matchFrom(text, tokens, slots, 0, i, undefined);
+        if (end > i)
+            return { phrase, first: i, last: end - 1 };
+    }
+    return undefined;
+}
+exports.matchPhrase = matchPhrase;
+/** The earliest hit of any phrase of a pack (ties go to pack order), or undefined. */
+function firstHit(text, tokens, pack) {
+    let best;
+    for (const phrase of pack) {
+        const hit = matchPhrase(text, tokens, phrase);
+        if (hit !== undefined && (best === undefined || hit.first < best.first))
+            best = hit;
+    }
+    return best;
+}
+exports.firstHit = firstHit;
+/** Every phrase of a pack that matches somewhere in the unit. */
+function allHits(text, tokens, pack) {
+    const out = [];
+    for (const phrase of pack) {
+        const hit = matchPhrase(text, tokens, phrase);
+        if (hit !== undefined)
+            out.push(hit);
+    }
+    return out;
+}
+exports.allHits = allHits;
+//# sourceMappingURL=matcher.js.map

package/dist/integrity/negative-claim/matcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matcher.js","sourceRoot":"","sources":["../../../src/integrity/negative-claim/matcher.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAEH,yDAA4D;AAW5D,MAAM,KAAK,GACT,0FAA0F,CAAC;AAE7F,mGAAmG;AACnG,SAAgB,UAAU,CAAC,GAAW;IACpC,OAAO,IAAA,uBAAQ,EAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;AACnE,CAAC;AAFD,gCAEC;AAED,gEAAgE;AAChE,SAAgB,QAAQ,CAAC,IAAY,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM;IAC/D,MAAM,GAAG,GAAY,EAAE,CAAC;IACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AARD,4BAQC;AAED,mDAAmD;AACnD,SAAgB,KAAK,CAAC,MAAc,EAAE,IAAsB;IAC1D,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAHD,sBAGC;AAED,qEAAqE;AACrE,SAAgB,UAAU,CACxB,MAAwB,EACxB,KAAwB,EACxB,IAAsB;IAEtB,OAAO,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAClD,CAAC;AAND,gCAMC;AAED,2EAA2E;AAC3E,SAAgB,SAAS,CACvB,MAAwB,EACxB,KAAwB,EACxB,IAAI,GAAG,CAAC,EACR,IAAsB;IAEtB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAClC,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC;gBAAE,SAAS,KAAK,CAAC;QACvD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAfD,8BAeC;AAED,2DAA2D;AAC3D,SAAgB,YAAY,CAC1B,MAAwB,EACxB,IAAmC,EACnC,IAAsB;IAEtB,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACtF,CAAC;AAND,oCAMC;AAED,oGAAoG;AACpG,SAAgB,SAAS,CACvB,IAAY,EACZ,MAAwB,EACxB,IAAY,EACZ,IAAsB;IAEtB,OAAO,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACpD,CAAC;AAPD,8BAOC;AAED,gGAAgG;AAChG,SAAgB,MAAM,CACpB,IAAY,EACZ,MAAwB,EACxB,IAAY,EACZ,IAAY,EACZ,IAAsB;IAEtB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAChC,KACE,IAAI,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,EAC7C,EAAE,KAAK,CAAC,CAAC,EACT,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAC3C,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAU,CAAC;QAClC,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAU,CAAC;QACpD,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvD,IAAI,IAAA,uBAAQ,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;IACnE,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAnBD,wBAmBC;AAED,4EAA4E;AAE5E,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,qIAAqI,CAAC,KAAK,CACzI,GAAG,CACJ,CACF,CAAC;AAEF,kDAAkD;AAClD,SAAgB,QAAQ,CAAC,KAAa;IACpC,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACxC,CAAC;AALD,4BAKC;AAYD,MAAM,gBAAgB,GAAG,CAAC,KAAa,EAAW,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAE3E,SAAS,WAAW,CAAC,GAAW;IAC9B,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,IAAI,IAAI,KAAK,QAAQ;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC;IACnE,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;IAClF,IAAI,IAAI,KAAK,OAAO;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IAClF,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1E,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AACnD,CAAC;AAED,MAAM,QAAQ,GAAG,IAAI,OAAO,EAA+B,CAAC;AAE5D,SAAS,QAAQ,CAAC,MAAmB;IACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,KAAK,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;IACpE,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;IAC9D,MAAM,IAAI,GAAG;QACX,QAAQ;QACR,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACxB,MAAM,CAAC,OAAO,KAAK,IAAI;YACrB,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,EAAE;YAC9D,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CACtB;KACF,CAAC;IACF,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uFAAuF;AACvF,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,IAAW,EAAE,KAAY,EAAW,EAAE,CAClE,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AAS5D,6FAA6F;AAC7F,SAAS,SAAS,CAChB,IAAY,EACZ,MAAwB,EACxB,KAAsB,EACtB,IAAY,EACZ,EAAU,EACV,QAA2B;IAE3B,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IACrC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAS,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACzB,IACE,KAAK,KAAK,SAAS;QACnB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAClB,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,EACzD,CAAC;QACD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACpE,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,GAAG,CAAC;IAC7B,CAAC;IACD,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClF,CAAC;AAED,kEAAkE;AAClE,SAAgB,WAAW,CACzB,IAAY,EACZ,MAAwB,EACxB,MAAmB;IAEnB,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAC5D,IAAI,GAAG,GAAG,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC;IAC1D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAZD,kCAYC;AAED,sFAAsF;AACtF,SAAgB,QAAQ,CACtB,IAAY,EACZ,MAAwB,EACxB,IAA4B;IAE5B,IAAI,IAA2B,CAAC;IAChC,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,GAAG,GAAG,CAAC;IACtF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAXD,4BAWC;AAED,iEAAiE;AACjE,SAAgB,OAAO,CACrB,IAAY,EACZ,MAAwB,EACxB,IAA4B;IAE5B,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,SAAS;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAXD,0BAWC"}

package/dist/integrity/negative-claim/noRead.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.eligibleNoReadClaim = void 0;
+const INCIDENTAL = [['none'], ['no', 'action', 'is', 'needed'], ['tests', '0', 'failed']];
+/** Whether a detected clause may note that no native read is recorded.
+ * Compare the detector's normalized tokens; extra words and other clauses
+ * remain eligible. This never declares a claim grounded or an entity resolved. */
+function eligibleNoReadClaim(claim) {
+    return !INCIDENTAL.some((words) => words.length === claim.tokens.length &&
+        words.every((word, index) => claim.tokens[index]?.text === word));
+}
+exports.eligibleNoReadClaim = eligibleNoReadClaim;
+//# sourceMappingURL=noRead.js.map

package/dist/integrity/negative-claim/noRead.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"noRead.js","sourceRoot":"","sources":["../../../src/integrity/negative-claim/noRead.ts"],"names":[],"mappings":";;;AAKA,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAU,CAAC;AAEnG;;kFAEkF;AAClF,SAAgB,mBAAmB,CAAC,KAAoB;IACtD,OAAO,CAAC,UAAU,CAAC,IAAI,CACrB,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC,MAAM;QACpC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,KAAK,IAAI,CAAC,CACnE,CAAC;AACJ,CAAC;AAND,kDAMC"}

package/dist/integrity/negative-claim/phrases.js

@@ -0,0 +1,253 @@
+"use strict";
+/**
+ * phrases — the prose grammar's CLOSED phrase packs: data, versioned and hashed.
+ *
+ * Pattern: plain frozen data. The matcher (`matcher.ts · matchPhrase`) is the only code that reads
+ *          it, and the hash pins every number measured with it to the grammar it measured
+ *          (`bench/negative/RULE.md`).
+ * Role:    integrity/ layer (L3), read by `detect.ts` (claims, code and language notes) and
+ *          `containment.ts` (source and window markers, unbounded words), and by the free
+ *          replay (`bench/negative/`). The answer bench keeps its own registered readers, frozen;
+ *          the hedge and source packs began as its lists.
+ *
+ * A phrase is a list of SLOTS matched against consecutive tokens of one unit, with only spaces
+ * between them (so "No, the deploy…" is not "no the"):
+ *   - `a|b|c`     — one token, any of the alternatives (tokens are NFC, case-folded);
+ *   - a trailing `?` — the slot may be skipped;
+ *   - `<word>`    — any token that starts with a letter;
+ *   - `!a|b`      — any letter token EXCEPT these;
+ *   - `<num>`     — digits, or a number word (`two` … `twenty`);
+ *   - `<dur>`     — a look-back spelling (`24h`, `7d`);
+ *   - `^`         — only at the start of the unit (first slot only).
+ *
+ * The packs:
+ *   - `none` and `complete` — the CLAIMS: non-existence, and completeness in a frame only
+ *     (never a bare "every" or "zero");
+ *   - `unbounded` — words that make any claim wider than any search ("never", "anywhere");
+ *   - `source` — words that put the negative on the lookup ("the lookup returned nothing"),
+ *     which scope a claim to the source, as a `source.said` word does;
+ *   - `window` — the window a claim names ("in the last 2 hours");
+ *   - `hedge` — words that voice doubt. They are NOT scope: a hedged claim is still a flat claim
+ *     (design § 5.2). The pack exists so that law is data a test can walk.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.resolveNegativeClaimPhrases = exports.NEGATIVE_CLAIM_PHRASES_HASH = exports.NEGATIVE_CLAIM_PHRASES = exports.NEGATIVE_CLAIM_PHRASES_VERSION = void 0;
+const sha256_js_1 = require("../../lib/sha256.js");
+const stableJson_js_1 = require("../../lib/stableJson.js");
+const boundedJson_js_1 = require("../../lib/boundedJson.js");
+const matcher_js_1 = require("./matcher.js");
+/** Bump with ANY edit to the packs or to what a slot means — the test pins version → hash. */
+exports.NEGATIVE_CLAIM_PHRASES_VERSION = '1';
+const phrase = (id, words) => Object.freeze({ id, words: Object.freeze(words.split(' ')) });
+/** Literal phrases, one slot per word (the hedge and source packs). */
+const literal = (pack, text) => phrase(`${pack}.${text.replace(/[^a-z0-9]+/g, '-')}`, text);
+const BE = 'is|are|was|were';
+const BE_NOT = "isn't|aren't|wasn't|weren't";
+const NONE = [
+    phrase('none.there-are-no', `there ${BE} no`),
+    phrase('none.there-have-been-no', 'there have|has been no'),
+    phrase('none.there-may-be-no', 'there may|might|could|will|would|should|must be no'),
+    phrase('none.there-seem-to-be-no', 'there seem|seems|appear|appears to be no'),
+    phrase('none.there-are-not-any', `there ${BE} not any`),
+    phrase('none.there-aren-t-any', `there ${BE_NOT} any`),
+    phrase('none.there-have-not-been-any', 'there has|have|had not been any'),
+    phrase('none.there-haven-t-been-any', "there hasn't|haven't|hadn't been any"),
+    phrase('none.has-no', 'has|have|had no'),
+    phrase('none.does-not-have-any', 'does|do|did not have any'),
+    phrase('none.doesn-t-have-any', "doesn't|don't|didn't have any"),
+    phrase('none.no-such', 'no such'),
+    phrase('none.does-not-exist', 'does|do|did not exist'),
+    phrase('none.doesn-t-exist', "doesn't|don't|didn't exist"),
+    phrase('none.is-not-in', `${BE} not in|anywhere`),
+    phrase('none.isn-t-in', `${BE_NOT} in|anywhere`),
+    phrase('none.is-not-found', `${BE} not found`),
+    phrase('none.isn-t-found', `${BE_NOT} found`),
+    phrase('none.none-of', 'none of'),
+    phrase('none.none-are', `none ${BE}|exist|exists`),
+    phrase('none.nothing-is', 'nothing is|was|has|have'),
+    phrase('none.nothing-deployed', 'nothing deployed|firing|open|running'),
+    phrase('none.none', 'none'),
+    phrase('none.zero-noun', '0 <word>'),
+    phrase('none.no-lead', '^ no !other|doubt|matter|way|longer|more|less|later|earlier|problem'),
+    phrase('none.no-noun-is', `no <word> <word>? ${BE}|exist|exists`),
+    phrase('none.never-had', 'never had|has|have|existed|exist|exists|been|occurred|happened'),
+];
+const COMPLETE = [
+    phrase('complete.these-are-all', 'these|those are|were all|every|everything'),
+    phrase('complete.these-are-the-only', 'these|those are|were the only'),
+    phrase('complete.that-is-all', 'that|this is|was all|every|everything'),
+    phrase('complete.that-s-all', "that's all|every|everything"),
+    phrase('complete.that-is-the-only', 'that|this is|was the only'),
+    phrase('complete.that-s-the-only', "that's the only"),
+    phrase('complete.the-complete-list', 'the complete|full|entire|whole list|set|inventory'),
+    phrase('complete.all-n', 'all <num>'),
+    phrase('complete.nothing-else', 'nothing else'),
+    phrase('complete.no-other', 'no other'),
+];
+const UNBOUNDED = [
+    phrase('unbounded.never', 'never'),
+    phrase('unbounded.ever', 'ever'),
+    phrase('unbounded.anywhere', 'anywhere'),
+    phrase('unbounded.at-all', 'at all'),
+    phrase('unbounded.across-all', 'across all'),
+    phrase('unbounded.in-the-estate', 'in|across|throughout the|your|our|this estate|company|organization|organisation|environment|enterprise'),
+];
+/** The answer bench's attribution list, minus "according to" and "based on" — hedges, never scope. */
+const SOURCE = [
+    'the lookup returned nothing',
+    "couldn't find",
+    'could not find',
+    "didn't find",
+    'did not find',
+    'found no',
+    'found nothing',
+    'returned no',
+    'returned nothing',
+    'returned an empty',
+    'returned empty',
+    'came back empty',
+    'shows no',
+    'show no',
+    'lists no',
+    'no results',
+    'no matching',
+    'matched nothing',
+].map((text) => literal('source', text));
+const UNIT = 'minute|minutes|hour|hours|day|days|week|weeks';
+const WINDOW = [
+    phrase('window.last-n', `in|over|during|for|within? the? last|past|previous <num>? ${UNIT}`),
+    phrase('window.last-duration', 'in|over|during|for|within? the? last|past|previous <dur>'),
+];
+/** The answer bench's hedge list, plus the two § 5.2 names ("based on", "according to"). */
+const HEDGE = [
+    'not sure',
+    'unsure',
+    'uncertain',
+    'unclear',
+    "can't confirm",
+    'cannot confirm',
+    "couldn't confirm",
+    'could not confirm',
+    'unable to confirm',
+    'unable to verify',
+    "can't verify",
+    'cannot verify',
+    "can't tell",
+    'cannot tell',
+    "don't know",
+    'do not know',
+    'not able to',
+    'no way to',
+    'may not',
+    'might not',
+    'may be',
+    'might be',
+    'possibly',
+    "it's possible",
+    'it is possible',
+    'appears to',
+    'seems',
+    'not checked',
+    "wasn't checked",
+    "weren't checked",
+    'not covered',
+    "doesn't cover",
+    'does not cover',
+    "didn't cover",
+    'did not cover',
+    'only covers',
+    'only checked',
+    'only keeps',
+    'only holds',
+    'only shows',
+    'only includes',
+    'only returns',
+    'only lists',
+    'only has',
+    'only goes back',
+    'only reaches',
+    'limited to',
+    'partial',
+    'incomplete',
+    'timed out',
+    'not collected',
+    "couldn't check",
+    'could not check',
+    "didn't check",
+    'did not check',
+    'not included',
+    "wasn't reached",
+    'not reached',
+    'no data for',
+    'no information',
+    "don't have",
+    'do not have',
+    "doesn't have",
+    'does not have',
+    'not available',
+    "isn't available",
+    'caveat',
+    'keep in mind',
+    'according to',
+    'based on',
+].map((text) => literal('hedge', text));
+/** The built-in packs — closed and frozen, independent of app extensions. */
+exports.NEGATIVE_CLAIM_PHRASES = Object.freeze({
+    none: Object.freeze([...NONE]),
+    complete: Object.freeze([...COMPLETE]),
+    unbounded: Object.freeze([...UNBOUNDED]),
+    source: Object.freeze([...SOURCE]),
+    window: Object.freeze([...WINDOW]),
+    hedge: Object.freeze([...HEDGE]),
+});
+/** sha256 of the packs' stable JSON — what a measured number names. */
+exports.NEGATIVE_CLAIM_PHRASES_HASH = (0, sha256_js_1.sha256Hex)((0, stableJson_js_1.stableJson)(exports.NEGATIVE_CLAIM_PHRASES) ?? '');
+const DEFAULT_PHRASES = Object.freeze({
+    packs: exports.NEGATIVE_CLAIM_PHRASES,
+    version: exports.NEGATIVE_CLAIM_PHRASES_VERSION,
+    hash: exports.NEGATIVE_CLAIM_PHRASES_HASH,
+});
+/** Resolve at configuration time. At most 32 literal phrases of 128 UTF-16
+ * units each; regexes and the built-in slot DSL are rejected as patterns.
+ * The full effective-pack hash names any extension without changing the
+ * built-in version/hash or introducing executable predicates. */
+function resolveNegativeClaimPhrases(extensions) {
+    if (extensions === undefined)
+        return DEFAULT_PHRASES;
+    const source = (0, boundedJson_js_1.ownData)((0, boundedJson_js_1.copyJson)(extensions, 32 * 128 * 6 + 1024, true), ['none', 'complete']);
+    const extra = { none: [], complete: [] };
+    let count = 0;
+    for (const kind of ['none', 'complete']) {
+        const values = source[kind];
+        if (values === undefined)
+            continue;
+        if (!Array.isArray(values))
+            throw new Error(`Negative prose phrases.${kind} must be an array.`);
+        count += values.length;
+        if (count > 32)
+            throw new Error('Negative prose phrases accept at most 32 extensions.');
+        for (const [index, value] of values.entries()) {
+            if (typeof value !== 'string' || value.trim().length === 0 || value.length > 128)
+                throw new Error('A negative prose phrase must contain 1–128 characters.');
+            if (/[\p{Cc}\p{Cf}]/u.test(value) ||
+                [...'\\|^$*+?()[]{}<>!'].some((token) => value.includes(token)) ||
+                /^\/.*\/[a-z]*$/iu.test(value))
+                throw new Error('Negative prose phrases are literal text, not regexes or slot patterns.');
+            const words = (0, matcher_js_1.tokensOf)(value).map((token) => token.text);
+            if (words.length === 0)
+                throw new Error('A negative prose phrase must contain words.');
+            extra[kind].push(Object.freeze({ id: `${kind}.app.${index}`, words: Object.freeze(words), literal: true }));
+        }
+    }
+    if (count === 0)
+        return DEFAULT_PHRASES;
+    const packs = Object.freeze({
+        ...exports.NEGATIVE_CLAIM_PHRASES,
+        none: Object.freeze([...exports.NEGATIVE_CLAIM_PHRASES.none, ...extra.none]),
+        complete: Object.freeze([...exports.NEGATIVE_CLAIM_PHRASES.complete, ...extra.complete]),
+    });
+    const hash = (0, sha256_js_1.sha256Hex)((0, stableJson_js_1.stableJson)(packs) ?? '');
+    return Object.freeze({ packs, hash, version: `${exports.NEGATIVE_CLAIM_PHRASES_VERSION}+${hash}` });
+}
+exports.resolveNegativeClaimPhrases = resolveNegativeClaimPhrases;
+//# sourceMappingURL=phrases.js.map

package/dist/integrity/negative-claim/phrases.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"phrases.js","sourceRoot":"","sources":["../../../src/integrity/negative-claim/phrases.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;;;AAEH,mDAAgD;AAChD,2DAAqD;AACrD,6DAA6D;AAC7D,6CAAwC;AAoBxC,8FAA8F;AACjF,QAAA,8BAA8B,GAAG,GAAG,CAAC;AAElD,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,KAAa,EAAe,EAAE,CACxD,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AAEhE,uEAAuE;AACvE,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,IAAY,EAAe,EAAE,CAC1D,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;AAE9D,MAAM,EAAE,GAAG,iBAAiB,CAAC;AAC7B,MAAM,MAAM,GAAG,6BAA6B,CAAC;AAE7C,MAAM,IAAI,GAA2B;IACnC,MAAM,CAAC,mBAAmB,EAAE,SAAS,EAAE,KAAK,CAAC;IAC7C,MAAM,CAAC,yBAAyB,EAAE,wBAAwB,CAAC;IAC3D,MAAM,CAAC,sBAAsB,EAAE,oDAAoD,CAAC;IACpF,MAAM,CAAC,0BAA0B,EAAE,0CAA0C,CAAC;IAC9E,MAAM,CAAC,wBAAwB,EAAE,SAAS,EAAE,UAAU,CAAC;IACvD,MAAM,CAAC,uBAAuB,EAAE,SAAS,MAAM,MAAM,CAAC;IACtD,MAAM,CAAC,8BAA8B,EAAE,iCAAiC,CAAC;IACzE,MAAM,CAAC,6BAA6B,EAAE,sCAAsC,CAAC;IAC7E,MAAM,CAAC,aAAa,EAAE,iBAAiB,CAAC;IACxC,MAAM,CAAC,wBAAwB,EAAE,0BAA0B,CAAC;IAC5D,MAAM,CAAC,uBAAuB,EAAE,+BAA+B,CAAC;IAChE,MAAM,CAAC,cAAc,EAAE,SAAS,CAAC;IACjC,MAAM,CAAC,qBAAqB,EAAE,uBAAuB,CAAC;IACtD,MAAM,CAAC,oBAAoB,EAAE,4BAA4B,CAAC;IAC1D,MAAM,CAAC,gBAAgB,EAAE,GAAG,EAAE,kBAAkB,CAAC;IACjD,MAAM,CAAC,eAAe,EAAE,GAAG,MAAM,cAAc,CAAC;IAChD,MAAM,CAAC,mBAAmB,EAAE,GAAG,EAAE,YAAY,CAAC;IAC9C,MAAM,CAAC,kBAAkB,EAAE,GAAG,MAAM,QAAQ,CAAC;IAC7C,MAAM,CAAC,cAAc,EAAE,SAAS,CAAC;IACjC,MAAM,CAAC,eAAe,EAAE,QAAQ,EAAE,eAAe,CAAC;IAClD,MAAM,CAAC,iBAAiB,EAAE,yBAAyB,CAAC;IACpD,MAAM,CAAC,uBAAuB,EAAE,sCAAsC,CAAC;IACvE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC;IAC3B,MAAM,CAAC,gBAAgB,EAAE,UAAU,CAAC;IACpC,MAAM,CAAC,cAAc,EAAE,qEAAqE,CAAC;IAC7F,MAAM,CAAC,iBAAiB,EAAE,qBAAqB,EAAE,eAAe,CAAC;IACjE,MAAM,CAAC,gBAAgB,EAAE,gEAAgE,CAAC;CAC3F,CAAC;AAEF,MAAM,QAAQ,GAA2B;IACvC,MAAM,CAAC,wBAAwB,EAAE,2CAA2C,CAAC;IAC7E,MAAM,CAAC,6BAA6B,EAAE,+BAA+B,CAAC;IACtE,MAAM,CAAC,sBAAsB,EAAE,uCAAuC,CAAC;IACvE,MAAM,CAAC,qBAAqB,EAAE,6BAA6B,CAAC;IAC5D,MAAM,CAAC,2BAA2B,EAAE,2BAA2B,CAAC;IAChE,MAAM,CAAC,0BAA0B,EAAE,iBAAiB,CAAC;IACrD,MAAM,CAAC,4BAA4B,EAAE,mDAAmD,CAAC;IACzF,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC;IACrC,MAAM,CAAC,uBAAuB,EAAE,cAAc,CAAC;IAC/C,MAAM,CAAC,mBAAmB,EAAE,UAAU,CAAC;CACxC,CAAC;AAEF,MAAM,SAAS,GAA2B;IACxC,MAAM,CAAC,iBAAiB,EAAE,OAAO,CAAC;IAClC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAChC,MAAM,CAAC,oBAAoB,EAAE,UAAU,CAAC;IACxC,MAAM,CAAC,kBAAkB,EAAE,QAAQ,CAAC;IACpC,MAAM,CAAC,sBAAsB,EAAE,YAAY,CAAC;IAC5C,MAAM,CACJ,yBAAyB,EACzB,wGAAwG,CACzG;CACF,CAAC;AAEF,sGAAsG;AACtG,MAAM,MAAM,GAA2B;IACrC,6BAA6B;IAC7B,eAAe;IACf,gBAAgB;IAChB,aAAa;IACb,cAAc;IACd,UAAU;IACV,eAAe;IACf,aAAa;IACb,kBAAkB;IAClB,mBAAmB;IACnB,gBAAgB;IAChB,iBAAiB;IACjB,UAAU;IACV,SAAS;IACT,UAAU;IACV,YAAY;IACZ,aAAa;IACb,iBAAiB;CAClB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;AAEzC,MAAM,IAAI,GAAG,+CAA+C,CAAC;AAE7D,MAAM,MAAM,GAA2B;IACrC,MAAM,CAAC,eAAe,EAAE,6DAA6D,IAAI,EAAE,CAAC;IAC5F,MAAM,CAAC,sBAAsB,EAAE,0DAA0D,CAAC;CAC3F,CAAC;AAEF,4FAA4F;AAC5F,MAAM,KAAK,GAA2B;IACpC,UAAU;IACV,QAAQ;IACR,WAAW;IACX,SAAS;IACT,eAAe;IACf,gBAAgB;IAChB,kBAAkB;IAClB,mBAAmB;IACnB,mBAAmB;IACnB,kBAAkB;IAClB,cAAc;IACd,eAAe;IACf,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,aAAa;IACb,aAAa;IACb,WAAW;IACX,SAAS;IACT,WAAW;IACX,QAAQ;IACR,UAAU;IACV,UAAU;IACV,eAAe;IACf,gBAAgB;IAChB,YAAY;IACZ,OAAO;IACP,aAAa;IACb,gBAAgB;IAChB,iBAAiB;IACjB,aAAa;IACb,eAAe;IACf,gBAAgB;IAChB,cAAc;IACd,eAAe;IACf,aAAa;IACb,cAAc;IACd,YAAY;IACZ,YAAY;IACZ,YAAY;IACZ,eAAe;IACf,cAAc;IACd,YAAY;IACZ,UAAU;IACV,gBAAgB;IAChB,cAAc;IACd,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,WAAW;IACX,eAAe;IACf,gBAAgB;IAChB,iBAAiB;IACjB,cAAc;IACd,eAAe;IACf,cAAc;IACd,gBAAgB;IAChB,aAAa;IACb,aAAa;IACb,gBAAgB;IAChB,YAAY;IACZ,aAAa;IACb,cAAc;IACd,eAAe;IACf,eAAe;IACf,iBAAiB;IACjB,QAAQ;IACR,cAAc;IACd,cAAc;IACd,UAAU;CACX,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;AAExC,6EAA6E;AAChE,QAAA,sBAAsB,GAA6B,MAAM,CAAC,MAAM,CAAC;IAC5E,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC9B,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;IACtC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IACxC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAClC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;CACjC,CAAC,CAAC;AAEH,uEAAuE;AAC1D,QAAA,2BAA2B,GAAW,IAAA,qBAAS,EAC1D,IAAA,0BAAU,EAAC,8BAAsB,CAAC,IAAI,EAAE,CACzC,CAAC;AAeF,MAAM,eAAe,GAAiC,MAAM,CAAC,MAAM,CAAC;IAClE,KAAK,EAAE,8BAAsB;IAC7B,OAAO,EAAE,sCAA8B;IACvC,IAAI,EAAE,mCAA2B;CAClC,CAAC,CAAC;AAEH;;;iEAGiE;AACjE,SAAgB,2BAA2B,CACzC,UAA0C;IAE1C,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IACrD,MAAM,MAAM,GAAG,IAAA,wBAAO,EAAC,IAAA,yBAAQ,EAAC,UAAU,EAAE,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9F,MAAM,KAAK,GAA+C,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACrF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,UAAU,CAAU,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,oBAAoB,CAAC,CAAC;QAChG,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC;QACvB,IAAI,KAAK,GAAG,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QACxF,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG;gBAC9E,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;YAC5E,IACE,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7B,CAAC,GAAG,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC/D,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC;gBAE9B,MAAM,IAAI,KAAK,CAAC,wEAAwE,CAAC,CAAC;YAC5F,MAAM,KAAK,GAAG,IAAA,qBAAQ,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACvF,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CACd,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,QAAQ,KAAK,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAC1F,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,eAAe,CAAC;IACxC,MAAM,KAAK,GAA6B,MAAM,CAAC,MAAM,CAAC;QACpD,GAAG,8BAAsB;QACzB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,8BAAsB,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACpE,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,8BAAsB,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;KACjF,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,IAAA,qBAAS,EAAC,IAAA,0BAAU,EAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAChD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,sCAA8B,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;AAC9F,CAAC;AArCD,kEAqCC"}