grafeo-ogm 1.13.0 → 2.0.0

package/dist/cjs/utils/validation.js

@@ -6,8 +6,13 @@ exports.assertSafeIdentifier = assertSafeIdentifier;
 exports.escapeIdentifier = escapeIdentifier;
 exports.assertSafeLabel = assertSafeLabel;
 exports.assertSortDirection = assertSortDirection;
+exports.assertSingleSortKey = assertSingleSortKey;
+exports.assertSingleFulltextKey = assertSingleFulltextKey;
+exports.assertSingleFulltextOperator = assertSingleFulltextOperator;
 exports.isPlainObject = isPlainObject;
+exports.assertPlainObject = assertPlainObject;
 exports.mergeParams = mergeParams;
+exports.assertSafeRegexPattern = assertSafeRegexPattern;
 const errors_1 = require("../errors");
 /** Dangerous property names that could indicate prototype pollution */
 const BLOCKED_KEYS = new Set(['__proto__', 'constructor', 'prototype']);
@@ -80,6 +85,108 @@ function assertSortDirection(direction) {
         throw new errors_1.OGMError(`Invalid sort direction "${direction}". Must be "ASC" or "DESC".`);
     return direction;
 }
+/**
+ * Shared opening clause for "this object may carry only one key" violations.
+ *
+ * Keys are interpolated verbatim, so every caller must have run
+ * `assertSafeIdentifier` over ALL of them first — never just the surviving one.
+ */
+function singleKeyPrefix(entries, subject) {
+    const keys = entries.map(([key]) => key);
+    return `${subject} has ${entries.length} keys (${keys.join(', ')}); `;
+}
+/**
+ * Assert that a single `sort` array entry carries exactly one ordering key.
+ *
+ * v2.0.0 — pre-2.0.0 `compileSortClause` read only `Object.entries(entry)[0]`
+ * and silently discarded the rest, so `[{ a: 'ASC', b: 'DESC' }]` compiled to
+ * `ORDER BY n.a ASC` with no error and no log: a successful query answering a
+ * different question. Which key survived depended purely on source insertion
+ * order.
+ *
+ * Ordering precedence must be carried by ARRAY POSITION, never by object key
+ * order. Honoring every key would only move the bug: graphql-js
+ * `coerceInputValue` rebuilds input objects by iterating the schema's field
+ * definitions, so the key order a client wrote is already gone by the time the
+ * object reaches the OGM.
+ *
+ * Callers must validate each key with `assertSafeIdentifier` BEFORE calling
+ * this, so the keys interpolated into the message are known-safe.
+ */
+function assertSingleSortKey(entries) {
+    if (entries.length <= 1)
+        return;
+    // Only echo directions we recognise — an unvalidated value must never reach
+    // an error string that may be logged.
+    const suggestion = entries
+        .map(([key, value]) => `{ ${key}: ${value === 'ASC' || value === 'DESC' ? `'${value}'` : '...'} }`)
+        .join(', ');
+    throw new errors_1.OGMError(singleKeyPrefix(entries, 'Sort entry') +
+        `each sort entry must carry exactly one ordering key, because ORDER BY ` +
+        `precedence comes from array position and not object key order. ` +
+        `Use one entry per key: [${suggestion}].`);
+}
+/**
+ * Assert that a fulltext input object references exactly one index.
+ *
+ * v2.0.0 — the same silent-truncation defect fixed for `sort` (see
+ * `assertSingleSortKey`) also lived in `FulltextCompiler`, at three sites that
+ * each guarded the empty case and then read `Object.keys(input)[0]`. A leaf
+ * naming two indexes searched only the first and dropped the second with no
+ * error, so the query returned a strictly WIDER result set than asked for — a
+ * filter that silently stops filtering.
+ *
+ * Multiple indexes are expressed with the existing `AND` / `OR` combinators,
+ * which compile to correlated subqueries and `UNION` respectively.
+ *
+ * Phrase values are never echoed: they are user data and may carry control
+ * characters or sensitive content. Callers must validate each key with
+ * `assertSafeIdentifier` BEFORE calling this.
+ */
+function assertSingleFulltextKey(entries, subject) {
+    if (entries.length <= 1)
+        return;
+    const suggestion = entries.map(([key]) => `{ ${key}: … }`).join(', ');
+    throw new errors_1.OGMError(singleKeyPrefix(entries, subject) +
+        `a fulltext entry must reference exactly one index. Combine indexes with ` +
+        `the AND / OR operators instead: { AND: [${suggestion}] }.`);
+}
+/** The logical operators a fulltext input may carry, each exclusive. */
+const FULLTEXT_OPERATORS = ['OR', 'AND', 'NOT'];
+/**
+ * Assert that a fulltext input carrying `OR` / `AND` / `NOT` carries nothing
+ * else alongside it.
+ *
+ * v2.0.0 — the dispatch in `FulltextCompiler.compileNode` tests the operators
+ * in order (`OR`, then `AND`, then `NOT`) and returns on the first hit, so any
+ * remaining top-level key was silently discarded:
+ *
+ * - `{ OR: [...], AND: [...] }` compiled the OR branch only.
+ * - `{ OR: [...], SomeIndex: {...} }` compiled the OR branch only.
+ * - `{ NOT: {...}, AND: [...] }` compiled the AND branch only — an exclusion
+ *   filter vanished entirely, which inverts the caller's intent rather than
+ *   merely widening the result set.
+ *
+ * Operators nest instead of stacking: `{ AND: [{ OR: [...] }, { ... }] }`.
+ *
+ * Only the recognised operator names — fixed literals — are interpolated into
+ * the message. Sibling keys are counted, never echoed, because they have not
+ * been identifier-validated at this point in the pipeline.
+ */
+function assertSingleFulltextOperator(keys) {
+    const operators = FULLTEXT_OPERATORS.filter((op) => keys.includes(op));
+    // No operator → a plain leaf, whose arity `assertSingleFulltextKey` owns.
+    if (operators.length === 0)
+        return;
+    if (keys.length === 1)
+        return;
+    const others = keys.length - operators.length;
+    const alongside = others > 0 ? ` and ${others} other top-level key(s)` : '';
+    throw new errors_1.OGMError(`Fulltext input carries ${operators.join(' + ')}${alongside}; ` +
+        `AND / OR / NOT must each be the only key in their object, because the ` +
+        `compiler reads the first one and ignores the rest. ` +
+        `Nest them instead: { AND: [{ OR: [...] }, { ... }] }.`);
+}
 /**
  * Type guard that narrows an unknown value to a plain object.
  * Returns false for null, arrays, and non-object primitives.
@@ -87,6 +194,33 @@ function assertSortDirection(direction) {
 function isPlainObject(value) {
     return typeof value === 'object' && value !== null && !Array.isArray(value);
 }
+/**
+ * Assert that a value the compilers are about to enumerate — with
+ * `Object.entries`, `Object.keys`, or the `in` operator — is a plain object.
+ *
+ * v2.0.0 — without this, `sort: [null]` surfaced as a bare
+ * `TypeError: Cannot convert undefined or null to object` thrown from deep
+ * inside the compiler, and fulltext inputs failed similarly on `'OR' in input`.
+ * Both escaped `catch (e) { if (e instanceof OGMError) … }`, even though every
+ * other malformed input on those paths is an `OGMError`.
+ *
+ * Only the value's KIND is reported, never the value itself — the caller may
+ * have handed us anything.
+ */
+function assertPlainObject(value, subject) {
+    if (isPlainObject(value))
+        return;
+    const kind = value === null
+        ? 'null'
+        : value === undefined
+            ? 'undefined'
+            : Array.isArray(value)
+                ? 'an array'
+                : // Every remaining `typeof` result is consonant-initial, so a plain
+                    // "a" article reads correctly here.
+                    `a ${typeof value}`;
+    throw new errors_1.OGMError(`${subject} must be an object, got ${kind}.`);
+}
 /**
  * Merge parameter records into the target. Skips merge if `source` is empty
  * or undefined. Returns the target for chaining.
@@ -99,4 +233,424 @@ function mergeParams(target, source) {
         Object.assign(target, source);
     return target;
 }
+/* -------------------------------------------------------------------------- *
+ *  `_MATCHES` ReDoS guard — assertSafeRegexPattern
+ * -------------------------------------------------------------------------- *
+ * The `_MATCHES` where-operator forwards its (bound) value into a Neo4j `=~`
+ * predicate, which the server evaluates with Java's *backtracking* regex
+ * engine. An attacker who can influence a `where` filter could otherwise
+ * supply a catastrophic-backtracking pattern (e.g. `(a+)+$`, `([a-z]+)+$`,
+ * `(a?)+$`, `(a|ab)*$`) and pin shared Neo4j CPU — a server-side ReDoS
+ * (CWE-1333). Parameterization stops *injection* but not this: the payload
+ * *is* the regex.
+ *
+ * DESIGN — SOUND BY CONSTRUCTION. A static blacklist ("detect the evil
+ * shapes, else accept") is fundamentally incomplete: there is always another
+ * evil family it misses. So this guard is inverted — it ACCEPTS a pattern
+ * only when it can *prove* the pattern is linear, and REJECTS everything
+ * else (fail-closed), including every construct it does not fully model.
+ * The cost is precision, not safety: some exotic-but-safe patterns are
+ * refused. That is the intended trade for a security guard on untrusted
+ * input; operators that only need substring/prefix/suffix semantics have
+ * dedicated, always-safe forms (`_CONTAINS` / `_STARTS_WITH` / `_ENDS_WITH`
+ * / `_IN`), and `_MATCHES` itself can be turned off entirely via
+ * `features.filters.String.MATCHES`.
+ *
+ * The proof sketch: after rejecting alternation, quantified groups, and any
+ * unsupported feature, an accepted pattern is a flat concatenation of
+ * single-atom matchers (non-quantified groups are transparent). In that
+ * shape the ONLY source of super-linear backtracking is two "loose"
+ * (variable-length or optional) quantifiers contending over an overlapping
+ * character set; the guard rejects unless every such pair is either over
+ * provably-disjoint character sets or separated by a required atom whose
+ * character set is provably disjoint from both (a hard fence). Both the
+ * parse and the pair check are single-pass / bounded (no regex is ever run
+ * against the input), so the guard cannot itself become a DoS vector.
+ */
+/** Longest `_MATCHES` pattern accepted — a shape-independent backstop. */
+const MAX_MATCHES_PATTERN_LENGTH = 1000;
+/** Most atoms a `_MATCHES` pattern may parse to — bounds the fence scan. */
+const MAX_MATCHES_ATOMS = 256;
+const BROAD_CHARSET = { kind: 'broad' };
+const ranges = (...rs) => ({ kind: 'ranges', ranges: rs });
+// Predefined ASCII classes (Java's default, non-Unicode semantics).
+const CS_DIGIT = ranges([48, 57]); // \d
+const CS_WORD = ranges([48, 57], [65, 90], [95, 95], [97, 122]); // \w
+const CS_SPACE = ranges([9, 13], [32, 32]); // \s : \t \n \x0B \f \r space
+/** All ASCII punctuation — the characters valid as a `\`-escaped literal. */
+const ASCII_PUNCT = /[!-/:-@[-`{-~]/;
+/** True only when two character sets are *provably* disjoint. */
+function provablyDisjoint(a, b) {
+    if (a.kind === 'broad' || b.kind === 'broad')
+        return false;
+    for (const [al, ah] of a.ranges)
+        for (const [bl, bh] of b.ranges)
+            if (al <= bh && bl <= ah)
+                return false;
+    return true;
+}
+/**
+ * Inline-flag characters accepted inside `(?…)` / `(?…:`. Deliberately ONLY
+ * the flags that provably do not change this analysis: `i` (modeled via
+ * caseFold), `m`/`d` (affect only where zero-width `^`/`$` match — never a
+ * fence), and `s` (affects only `.`, which is already `broad`). `x`
+ * (COMMENTS: whitespace/comments stripped → changes parsing) and `u`/`U`
+ * (Unicode-widen `\d\w\s` and Unicode case-folding beyond ASCII) are NOT
+ * modeled, so a group carrying them fails the flag scan and is refused
+ * fail-closed — otherwise e.g. `(?x)(a+) +` would parse as the exponential
+ * `(a+)+` on the server while looking benign here.
+ */
+const FLAG_CHARS = /[imsd-]/;
+/**
+ * Fold ASCII letter case into a character set. Under a case-insensitive
+ * flag (`(?i)`) `a` also matches `A`, so disjointness must account for it —
+ * otherwise `A` could be mistaken for a fence between two `a`-matchers. We
+ * over-approximate (fold the whole pattern when `i` appears anywhere), which
+ * only ever merges sets and therefore stays sound.
+ */
+function caseFold(cs) {
+    if (cs.kind === 'broad')
+        return cs;
+    const out = [];
+    for (const [lo, hi] of cs.ranges) {
+        out.push([lo, hi]);
+        const uLo = Math.max(lo, 65);
+        const uHi = Math.min(hi, 90); // A–Z → +32
+        if (uLo <= uHi)
+            out.push([uLo + 32, uHi + 32]);
+        const lLo = Math.max(lo, 97);
+        const lHi = Math.min(hi, 122); // a–z → −32
+        if (lLo <= lHi)
+            out.push([lLo - 32, lHi - 32]);
+    }
+    return { kind: 'ranges', ranges: out };
+}
+/**
+ * Assert that a `_MATCHES` regex pattern is provably free of catastrophic
+ * backtracking. Throws `OGMError` on anything it cannot prove linear. Only
+ * string values reach here; the value is already parameterized, so this is a
+ * semantic guard on the operator, never string interpolation.
+ */
+function assertSafeRegexPattern(pattern, context) {
+    const refuse = (why) => {
+        throw new errors_1.OGMError(`Unsafe \`_MATCHES\` pattern in ${context}: ${why}. ` +
+            `It cannot be proven free of catastrophic backtracking (ReDoS) and is refused. ` +
+            `Use a dedicated operator (_CONTAINS / _STARTS_WITH / _ENDS_WITH / _IN) where possible, ` +
+            `simplify the pattern, or disable the _MATCHES operator via features.filters.String.MATCHES if you must run arbitrary regexes and accept the risk.`);
+    };
+    // 1. Length cap first — O(1), and bounds every step that follows.
+    if (pattern.length > MAX_MATCHES_PATTERN_LENGTH)
+        refuse(`pattern exceeds ${MAX_MATCHES_PATTERN_LENGTH} characters`);
+    // 2. Parse into a flat atom list, rejecting anything not fully modeled.
+    const parsed = parseLinearAtomsOrRefuse(pattern, refuse);
+    const atoms = parsed.caseInsensitive
+        ? parsed.atoms.map((a) => ({ ...a, charset: caseFold(a.charset) }))
+        : parsed.atoms;
+    // Hard atom cap — bounds the O(atoms^3) fence scan below to a few ms even
+    // on a fully-fenced adversarial pattern. No realistic filter regex has this
+    // many atoms; refusing one is a fail-closed backstop, not a real limit.
+    if (atoms.length > MAX_MATCHES_ATOMS)
+        refuse(`pattern has too many components (>${MAX_MATCHES_ATOMS})`);
+    // 3. Loose-pair rule: no two loose atoms may contend over an overlapping
+    //    character set unless a hard fence provably separates them.
+    for (let i = 0; i < atoms.length; i++) {
+        const a = atoms[i];
+        if (!a.loose)
+            continue;
+        for (let j = i + 1; j < atoms.length; j++) {
+            const b = atoms[j];
+            if (!b.loose)
+                continue;
+            if (provablyDisjoint(a.charset, b.charset))
+                continue;
+            let fenced = false;
+            for (let k = i + 1; k < j; k++) {
+                const m = atoms[k];
+                if (m.required &&
+                    provablyDisjoint(m.charset, a.charset) &&
+                    provablyDisjoint(m.charset, b.charset)) {
+                    fenced = true;
+                    break;
+                }
+            }
+            if (!fenced)
+                refuse('two variable-length quantifiers can contend over the same input');
+        }
+    }
+}
+/**
+ * Parse a regex into a flat list of single-atom matchers, inlining
+ * non-quantified groups and REFUSING on any construct outside the provably
+ * modelable subset (alternation, quantified groups, lookaround, named
+ * groups, backreferences, unrecognized escapes, unbalanced brackets, stray
+ * quantifiers). Single forward pass — O(n), no backtracking.
+ */
+function parseLinearAtomsOrRefuse(pattern, refuse) {
+    const atoms = [];
+    const n = pattern.length;
+    let depth = 0; // open non-quantified groups
+    let caseInsensitive = false;
+    let i = 0;
+    while (i < n) {
+        const c = pattern[i];
+        // Anchors (zero-width) — not atoms, and not fences.
+        if (c === '^' || c === '$') {
+            i++;
+            continue;
+        }
+        // Word-boundary anchors.
+        if (c === '\\' && (pattern[i + 1] === 'b' || pattern[i + 1] === 'B')) {
+            i += 2;
+            continue;
+        }
+        // Alternation — not modeled; refuse.
+        if (c === '|')
+            refuse('alternation (`|`) is not supported');
+        // Group open — plain `(`, non-capturing `(?:`, or inline-flag groups.
+        if (c === '(') {
+            if (pattern[i + 1] === '?') {
+                if (pattern[i + 2] === ':') {
+                    depth++;
+                    i += 3;
+                    continue;
+                }
+                // `(?flags)` (zero-width) or `(?flags:...)` (scoped). Any other
+                // `(?…)` — lookaround, named, atomic — is refused (fail-closed).
+                let j = i + 2;
+                while (j < n && FLAG_CHARS.test(pattern[j]))
+                    j++;
+                if (j > i + 2 && (pattern[j] === ')' || pattern[j] === ':')) {
+                    if (pattern.slice(i + 2, j).includes('i'))
+                        caseInsensitive = true;
+                    if (pattern[j] === ')')
+                        i = j + 1; // zero-width flag setting — emits no atom
+                    else {
+                        depth++;
+                        i = j + 1; // scoped-flag group behaves like a plain group
+                    }
+                    continue;
+                }
+                refuse('lookaround, named, atomic, or unsupported group syntax');
+            }
+            depth++;
+            i++;
+            continue;
+        }
+        // Group close — refuse a quantifier applied to the group.
+        if (c === ')') {
+            if (depth === 0)
+                refuse('unbalanced `)`');
+            depth--;
+            const q = pattern[i + 1];
+            if (q === '*' || q === '+' || q === '?' || q === '{')
+                refuse('a quantified group cannot be proven linear');
+            i++;
+            continue;
+        }
+        // Otherwise: an atom (with an optional quantifier).
+        const atom = parseAtomOrRefuse(pattern, i, refuse);
+        const quant = parseQuantifier(pattern, atom.next);
+        atoms.push({
+            charset: atom.charset,
+            loose: quant.max !== quant.min || quant.min === 0,
+            required: quant.min >= 1,
+        });
+        i = quant.next;
+    }
+    if (depth !== 0)
+        refuse('unbalanced `(`');
+    return { atoms, caseInsensitive };
+}
+/** Parse a single atom's character set. Returns the index after the atom. */
+function parseAtomOrRefuse(p, i, refuse) {
+    const c = p[i];
+    if (c === '*' || c === '+' || c === '?' || c === '{' || c === '}')
+        refuse('quantifier or brace with no preceding atom');
+    if (c === '.')
+        return { charset: BROAD_CHARSET, next: i + 1 };
+    if (c === '[')
+        return parseClassOrRefuse(p, i, refuse);
+    if (c === '\\')
+        return parseEscapeOrRefuse(p, i, refuse);
+    // Ordinary literal character.
+    return { charset: ranges([c.charCodeAt(0), c.charCodeAt(0)]), next: i + 1 };
+}
+/** Parse a `\`-escape at index `i` (points at the backslash). */
+function parseEscapeOrRefuse(p, i, refuse) {
+    if (i + 1 >= p.length)
+        refuse('trailing backslash');
+    const e = p[i + 1];
+    switch (e) {
+        case 'd':
+            return { charset: CS_DIGIT, next: i + 2 };
+        case 'w':
+            return { charset: CS_WORD, next: i + 2 };
+        case 's':
+            return { charset: CS_SPACE, next: i + 2 };
+        case 'D':
+        case 'W':
+        case 'S':
+            return { charset: BROAD_CHARSET, next: i + 2 }; // complement — broad
+        case 'n':
+            return { charset: ranges([10, 10]), next: i + 2 };
+        case 'r':
+            return { charset: ranges([13, 13]), next: i + 2 };
+        case 't':
+            return { charset: ranges([9, 9]), next: i + 2 };
+        case 'f':
+            return { charset: ranges([12, 12]), next: i + 2 };
+        case 'v':
+            // Java (JDK 8+): `\v` is the vertical-whitespace CLASS (includes \n),
+            // NOT the single vertical tab it is in JavaScript. Under-modeling it as
+            // one char would let `\n*\v*` slip the loose-pair check while Java's
+            // engine backtracks on the shared newline — so model it as broad.
+            return { charset: BROAD_CHARSET, next: i + 2 };
+        default: {
+            // `\0`, `\1`…`\9` — octal escapes / backreferences. Java's octal rule
+            // (`\0` + 1–3 octal digits) differs from JS and would let the trailing
+            // digits mis-parse (e.g. Java reads `\011` as one TAB, inside `\s`); a
+            // backreference we cannot model. Refuse all `\<digit>` (fail-closed).
+            // Escaped ASCII punctuation → the literal character.
+            if (ASCII_PUNCT.test(e))
+                return {
+                    charset: ranges([e.charCodeAt(0), e.charCodeAt(0)]),
+                    next: i + 2,
+                };
+            // Backreferences, \x, \u, \p, \k, \Q…\E, and any other escape are not
+            // modeled — refuse (fail-closed).
+            return refuse(`unsupported escape \`\\${e}\``);
+        }
+    }
+}
+/** Parse a `[...]` character class. Returns the index after the closing `]`. */
+function parseClassOrRefuse(p, start, refuse) {
+    let i = start + 1;
+    let negated = false;
+    if (p[i] === '^') {
+        negated = true;
+        i++;
+    }
+    const rs = [];
+    let broad = false;
+    let first = true;
+    while (i < p.length) {
+        const c = p[i];
+        // A `]` closes the class — unless it is the very first member (Java
+        // treats a leading `]` as a literal).
+        if (c === ']' && !first) {
+            i++;
+            if (negated || broad)
+                return { charset: BROAD_CHARSET, next: i };
+            return { charset: ranges(...rs), next: i };
+        }
+        first = false;
+        if (c === '[')
+            refuse('nested character class is not supported');
+        if (c === '&' && p[i + 1] === '&')
+            refuse('character-class intersection (`&&`) is not supported');
+        // One class member → its low code point (and its index advance).
+        let low;
+        if (c === '\\') {
+            if (i + 1 >= p.length)
+                refuse('trailing backslash in character class');
+            const e = p[i + 1];
+            if (e === 'd' || e === 'w' || e === 's') {
+                const set = e === 'd' ? CS_DIGIT : e === 'w' ? CS_WORD : CS_SPACE;
+                if (set.kind === 'ranges')
+                    rs.push(...set.ranges);
+                i += 2;
+                continue;
+            }
+            // `\v` (Java vertical-whitespace class) and the negated/property
+            // classes broaden the set beyond a finite positive range we model.
+            if (e === 'D' ||
+                e === 'W' ||
+                e === 'S' ||
+                e === 'p' ||
+                e === 'P' ||
+                e === 'v') {
+                broad = true;
+                i += 2;
+                continue;
+            }
+            const lit = {
+                n: 10,
+                r: 13,
+                t: 9,
+                f: 12,
+            };
+            if (e in lit)
+                low = lit[e];
+            else if (ASCII_PUNCT.test(e))
+                low = e.charCodeAt(0);
+            else
+                return refuse(`unsupported escape \`\\${e}\` in character class`);
+            i += 2;
+        }
+        else {
+            low = c.charCodeAt(0);
+            i++;
+        }
+        // Optional range `low-high` (a `-` not immediately before the closing `]`).
+        if (p[i] === '-' && i + 1 < p.length && p[i + 1] !== ']') {
+            const hc = p[i + 1];
+            let high;
+            if (hc === '\\') {
+                if (i + 2 < p.length && ASCII_PUNCT.test(p[i + 2]))
+                    high = p[i + 2].charCodeAt(0);
+                else
+                    return refuse('unsupported range endpoint in character class');
+                i += 3;
+            }
+            else {
+                high = hc.charCodeAt(0);
+                i += 2;
+            }
+            if (high < low)
+                refuse('inverted range in character class');
+            rs.push([low, high]);
+        }
+        else
+            rs.push([low, low]);
+    }
+    return refuse('unterminated character class');
+}
+/**
+ * Parse a quantifier at index `i` (the position just after an atom). Returns
+ * the repetition bounds and the index after the quantifier (and any lazy `?`
+ * or possessive `+` modifier). No quantifier → exactly-once `(1,1)`.
+ */
+function parseQuantifier(p, i) {
+    const c = p[i];
+    let min;
+    let max;
+    let next;
+    if (c === '*')
+        [min, max, next] = [0, Infinity, i + 1];
+    else if (c === '+')
+        [min, max, next] = [1, Infinity, i + 1];
+    else if (c === '?')
+        [min, max, next] = [0, 1, i + 1];
+    else if (c === '{') {
+        const m = /^\{(\d+)(?:(,)(\d*))?\}/.exec(p.slice(i));
+        if (!m)
+            return { min: 1, max: 1, next: i }; // literal `{` — treat atom as exact
+        min = Number(m[1]);
+        const comma = m[2];
+        const upper = m[3];
+        if (comma === undefined)
+            max = min;
+        else if (upper === undefined || upper === '')
+            max = Infinity;
+        else
+            max = Number(upper);
+        next = i + m[0].length;
+    }
+    else
+        return { min: 1, max: 1, next: i };
+    // Consume an optional lazy (`?`) or possessive (`+`) modifier.
+    if (p[next] === '?' || p[next] === '+')
+        next++;
+    return { min, max, next };
+}
 //# sourceMappingURL=validation.js.map

package/dist/cjs/utils/validation.js.map

@@ -1 +1 @@
-{"version":3,"file":"validation.js","sourceRoot":"","sources":["../../../src/utils/validation.ts"],"names":[],"mappings":";;AAQA,sCAKC;AAgBD,wDAGC;AASD,oDAKC;AAeD,4CAIC;AAKD,0CAGC;AAKD,kDAMC;AAMD,sCAIC;AASD,kCAMC;AA7GD,sCAAqC;AAErC,uEAAuE;AACvE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC;AAExE;;GAEG;AACH,SAAgB,aAAa,CAAC,GAAW,EAAE,OAAe;IACxD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC;QACvB,MAAM,IAAI,iBAAQ,CAChB,8BAA8B,GAAG,QAAQ,OAAO,4BAA4B,CAC7E,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,sBAAsB,CAAC,IAAY,EAAE,OAAe;IAClE,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC7B,oBAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AACtC,CAAC;AAED,yCAAyC;AACzC,MAAM,eAAe,GAAG,0BAA0B,CAAC;AAEnD;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,KAAa,EAAE,OAAe;IACjE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC;QAC9B,MAAM,IAAI,iBAAQ,CAChB,uBAAuB,KAAK,QAAQ,OAAO,sDAAsD,CAClG,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,gBAAgB,CAAC,UAAkB;IACjD,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,KAAK,UAAU,IAAI,CAAC;IAC/D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjD,OAAO,KAAK,SAAS,IAAI,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,KAAa;IAC3C,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACrC,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,SAAiB;IACnD,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM;QAC7C,MAAM,IAAI,iBAAQ,CAChB,2BAA2B,SAAS,6BAA6B,CAClE,CAAC;IACJ,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAC3B,KAAc;IAEd,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CACzB,MAA+B,EAC/B,MAA2C;IAE3C,IAAI,MAAM;QAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"validation.js","sourceRoot":"","sources":["../../../src/utils/validation.ts"],"names":[],"mappings":";;AAQA,sCAKC;AAgBD,wDAGC;AASD,oDAKC;AAeD,4CAIC;AAKD,0CAGC;AAKD,kDAMC;AAkCD,kDAoBC;AAmBD,0DAaC;AAyBD,oEAeC;AAMD,sCAIC;AAeD,8CAeC;AASD,kCAMC;AAgID,wDAqDC;AA9bD,sCAAqC;AAErC,uEAAuE;AACvE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC;AAExE;;GAEG;AACH,SAAgB,aAAa,CAAC,GAAW,EAAE,OAAe;IACxD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC;QACvB,MAAM,IAAI,iBAAQ,CAChB,8BAA8B,GAAG,QAAQ,OAAO,4BAA4B,CAC7E,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,sBAAsB,CAAC,IAAY,EAAE,OAAe;IAClE,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC7B,oBAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AACtC,CAAC;AAED,yCAAyC;AACzC,MAAM,eAAe,GAAG,0BAA0B,CAAC;AAEnD;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,KAAa,EAAE,OAAe;IACjE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC;QAC9B,MAAM,IAAI,iBAAQ,CAChB,uBAAuB,KAAK,QAAQ,OAAO,sDAAsD,CAClG,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,gBAAgB,CAAC,UAAkB;IACjD,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,KAAK,UAAU,IAAI,CAAC;IAC/D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjD,OAAO,KAAK,SAAS,IAAI,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,KAAa;IAC3C,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACrC,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,SAAiB;IACnD,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM;QAC7C,MAAM,IAAI,iBAAQ,CAChB,2BAA2B,SAAS,6BAA6B,CAClE,CAAC;IACJ,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CACtB,OAAyC,EACzC,OAAe;IAEf,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACzC,OAAO,GAAG,OAAO,QAAQ,OAAO,CAAC,MAAM,UAAU,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;AACxE,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,mBAAmB,CACjC,OAAyC;IAEzC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO;IAEhC,4EAA4E;IAC5E,sCAAsC;IACtC,MAAM,UAAU,GAAG,OAAO;SACvB,GAAG,CACF,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CACf,KAAK,GAAG,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAC9E;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,IAAI,iBAAQ,CAChB,eAAe,CAAC,OAAO,EAAE,YAAY,CAAC;QACpC,wEAAwE;QACxE,iEAAiE;QACjE,2BAA2B,UAAU,IAAI,CAC5C,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,uBAAuB,CACrC,OAAyC,EACzC,OAAe;IAEf,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO;IAEhC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEtE,MAAM,IAAI,iBAAQ,CAChB,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC;QAC/B,0EAA0E;QAC1E,2CAA2C,UAAU,MAAM,CAC9D,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,MAAM,kBAAkB,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAU,CAAC;AAEzD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAgB,4BAA4B,CAAC,IAAuB;IAClE,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IACvE,0EAA0E;IAC1E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACnC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAC9C,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,MAAM,yBAAyB,CAAC,CAAC,CAAC,EAAE,CAAC;IAE5E,MAAM,IAAI,iBAAQ,CAChB,0BAA0B,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,IAAI;QAC7D,wEAAwE;QACxE,qDAAqD;QACrD,uDAAuD,CAC1D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAC3B,KAAc;IAEd,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,iBAAiB,CAAC,KAAc,EAAE,OAAe;IAC/D,IAAI,aAAa,CAAC,KAAK,CAAC;QAAE,OAAO;IAEjC,MAAM,IAAI,GACR,KAAK,KAAK,IAAI;QACZ,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,KAAK,KAAK,SAAS;YACnB,CAAC,CAAC,WAAW;YACb,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBACpB,CAAC,CAAC,UAAU;gBACZ,CAAC,CAAC,mEAAmE;oBACnE,oCAAoC;oBACpC,KAAK,OAAO,KAAK,EAAE,CAAC;IAE9B,MAAM,IAAI,iBAAQ,CAAC,GAAG,OAAO,2BAA2B,IAAI,GAAG,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CACzB,MAA+B,EAC/B,MAA2C;IAE3C,IAAI,MAAM;QAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,0EAA0E;AAC1E,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAExC,4EAA4E;AAC5E,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAyB9B,MAAM,aAAa,GAAiB,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AACtD,MAAM,MAAM,GAAG,CACb,GAAG,EAA4C,EACjC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;AAEpD,oEAAoE;AACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK;AACxC,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK;AACtE,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,8BAA8B;AAE1E,6EAA6E;AAC7E,MAAM,WAAW,GAAG,gBAAgB,CAAC;AAErC,iEAAiE;AACjE,SAAS,gBAAgB,CAAC,CAAe,EAAE,CAAe;IACxD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3D,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM;QAC7B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM;YAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;gBAAE,OAAO,KAAK,CAAC;IAC1E,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,GAAG,SAAS,CAAC;AAE7B;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,EAAgB;IAChC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,EAAE,CAAC;IACnC,MAAM,GAAG,GAAqC,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY;QAC1C,IAAI,GAAG,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY;QAC3C,IAAI,GAAG,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AACzC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,sBAAsB,CAAC,OAAe,EAAE,OAAe;IACrE,MAAM,MAAM,GAAG,CAAC,GAAW,EAAS,EAAE;QACpC,MAAM,IAAI,iBAAQ,CAChB,kCAAkC,OAAO,KAAK,GAAG,IAAI;YACnD,gFAAgF;YAChF,yFAAyF;YACzF,mJAAmJ,CACtJ,CAAC;IACJ,CAAC,CAAC;IAEF,kEAAkE;IAClE,IAAI,OAAO,CAAC,MAAM,GAAG,0BAA0B;QAC7C,MAAM,CAAC,mBAAmB,0BAA0B,aAAa,CAAC,CAAC;IAErE,wEAAwE;IACxE,MAAM,MAAM,GAAG,wBAAwB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe;QAClC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;IAEjB,0EAA0E;IAC1E,4EAA4E;IAC5E,wEAAwE;IACxE,IAAI,KAAK,CAAC,MAAM,GAAG,iBAAiB;QAClC,MAAM,CAAC,qCAAqC,iBAAiB,GAAG,CAAC,CAAC;IAEpE,yEAAyE;IACzE,gEAAgE;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,CAAC,KAAK;YAAE,SAAS;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,CAAC,CAAC,KAAK;gBAAE,SAAS;YACvB,IAAI,gBAAgB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;gBAAE,SAAS;YACrD,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,IACE,CAAC,CAAC,QAAQ;oBACV,gBAAgB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;oBACtC,gBAAgB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,EACtC,CAAC;oBACD,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,MAAM;gBACT,MAAM,CACJ,iEAAiE,CAClE,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,wBAAwB,CAC/B,OAAe,EACf,MAA8B;IAE9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,6BAA6B;IAC5C,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAErB,oDAAoD;QACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,yBAAyB;QACzB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACrE,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,qCAAqC;QACrC,IAAI,CAAC,KAAK,GAAG;YAAE,MAAM,CAAC,oCAAoC,CAAC,CAAC;QAC5D,sEAAsE;QACtE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC3B,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;oBAC3B,KAAK,EAAE,CAAC;oBACR,CAAC,IAAI,CAAC,CAAC;oBACP,SAAS;gBACX,CAAC;gBACD,gEAAgE;gBAChE,iEAAiE;gBACjE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,OAAO,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAAE,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;oBAC5D,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;wBAAE,eAAe,GAAG,IAAI,CAAC;oBAClE,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;wBACpB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,0CAA0C;yBAClD,CAAC;wBACJ,KAAK,EAAE,CAAC;wBACR,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,+CAA+C;oBAC5D,CAAC;oBACD,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,wDAAwD,CAAC,CAAC;YACnE,CAAC;YACD,KAAK,EAAE,CAAC;YACR,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,0DAA0D;QAC1D,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,IAAI,KAAK,KAAK,CAAC;gBAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;YAC1C,KAAK,EAAE,CAAC;YACR,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;gBAClD,MAAM,CAAC,4CAA4C,CAAC,CAAC;YACvD,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,oDAAoD;QACpD,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,KAAK,EAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;YACjD,QAAQ,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;SACzB,CAAC,CAAC;QACH,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;IACjB,CAAC;IAED,IAAI,KAAK,KAAK,CAAC;QAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAC1C,OAAO,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;AACpC,CAAC;AAED,6EAA6E;AAC7E,SAAS,iBAAiB,CACxB,CAAS,EACT,CAAS,EACT,MAA8B;IAE9B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;QAC/D,MAAM,CAAC,4CAA4C,CAAC,CAAC;IACvD,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAC9D,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACvD,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACzD,8BAA8B;IAC9B,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED,iEAAiE;AACjE,SAAS,mBAAmB,CAC1B,CAAS,EACT,CAAS,EACT,MAA8B;IAE9B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM;QAAE,MAAM,CAAC,oBAAoB,CAAC,CAAC;IACpD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnB,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3C,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,KAAK,GAAG,CAAC;QACT,KAAK,GAAG,CAAC;QACT,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,qBAAqB;QACvE,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAClD,KAAK,GAAG;YACN,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,KAAK,GAAG;YACN,sEAAsE;YACtE,wEAAwE;YACxE,qEAAqE;YACrE,kEAAkE;YAClE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACjD,OAAO,CAAC,CAAC,CAAC;YACR,sEAAsE;YACtE,uEAAuE;YACvE,uEAAuE;YACvE,sEAAsE;YACtE,qDAAqD;YACrD,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;gBACrB,OAAO;oBACL,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnD,IAAI,EAAE,CAAC,GAAG,CAAC;iBACZ,CAAC;YACJ,sEAAsE;YACtE,kCAAkC;YAClC,OAAO,MAAM,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,SAAS,kBAAkB,CACzB,CAAS,EACT,KAAa,EACb,MAA8B;IAE9B,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;IAClB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACjB,OAAO,GAAG,IAAI,CAAC;QACf,CAAC,EAAE,CAAC;IACN,CAAC;IACD,MAAM,EAAE,GAAqC,EAAE,CAAC;IAChD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,KAAK,GAAG,IAAI,CAAC;IAEjB,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,oEAAoE;QACpE,sCAAsC;QACtC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACxB,CAAC,EAAE,CAAC;YACJ,IAAI,OAAO,IAAI,KAAK;gBAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;YACjE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QAC7C,CAAC;QACD,KAAK,GAAG,KAAK,CAAC;QACd,IAAI,CAAC,KAAK,GAAG;YAAE,MAAM,CAAC,yCAAyC,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;YAC/B,MAAM,CAAC,sDAAsD,CAAC,CAAC;QAEjE,iEAAiE;QACjE,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,MAAM,CAAC,uCAAuC,CAAC,CAAC;YACvE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAClE,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;oBAAE,EAAE,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;gBAClD,CAAC,IAAI,CAAC,CAAC;gBACP,SAAS;YACX,CAAC;YACD,iEAAiE;YACjE,mEAAmE;YACnE,IACE,CAAC,KAAK,GAAG;gBACT,CAAC,KAAK,GAAG;gBACT,CAAC,KAAK,GAAG;gBACT,CAAC,KAAK,GAAG;gBACT,CAAC,KAAK,GAAG;gBACT,CAAC,KAAK,GAAG,EACT,CAAC;gBACD,KAAK,GAAG,IAAI,CAAC;gBACb,CAAC,IAAI,CAAC,CAAC;gBACP,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAA2B;gBAClC,CAAC,EAAE,EAAE;gBACL,CAAC,EAAE,EAAE;gBACL,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,EAAE;aACN,CAAC;YACF,IAAI,CAAC,IAAI,GAAG;gBAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;iBACtB,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,GAAG,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;;gBAC/C,OAAO,MAAM,CAAC,0BAA0B,CAAC,uBAAuB,CAAC,CAAC;YACvE,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC,EAAE,CAAC;QACN,CAAC;QAED,4EAA4E;QAC5E,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACzD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,IAAI,IAAY,CAAC;YACjB,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAChD,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;;oBAC3B,OAAO,MAAM,CAAC,+CAA+C,CAAC,CAAC;gBACpE,CAAC,IAAI,CAAC,CAAC;YACT,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC,IAAI,CAAC,CAAC;YACT,CAAC;YACD,IAAI,IAAI,GAAG,GAAG;gBAAE,MAAM,CAAC,mCAAmC,CAAC,CAAC;YAC5D,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QACvB,CAAC;;YAAM,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,MAAM,CAAC,8BAA8B,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CACtB,CAAS,EACT,CAAS;IAET,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACf,IAAI,GAAW,CAAC;IAChB,IAAI,GAAW,CAAC;IAChB,IAAI,IAAY,CAAC;IACjB,IAAI,CAAC,KAAK,GAAG;QAAE,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SAClD,IAAI,CAAC,KAAK,GAAG;QAAE,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACvD,IAAI,CAAC,KAAK,GAAG;QAAE,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SAChD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACnB,MAAM,CAAC,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,oCAAoC;QAChF,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAuB,CAAC;QACzC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAuB,CAAC;QACzC,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,GAAG,GAAG,CAAC;aAC9B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE;YAAE,GAAG,GAAG,QAAQ,CAAC;;YACxD,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACzB,CAAC;;QAAM,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAE1C,+DAA+D;IAC/D,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG;QAAE,IAAI,EAAE,CAAC;IAC/C,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC"}

package/dist/esm/compilers/fulltext.compiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fulltext.compiler.d.ts","sourceRoot":"","sources":["../../../src/compilers/fulltext.compiler.ts"],"names":[],"mappings":"AACA,OAAO,EAGL,aAAa,EAEd,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AA+BhF,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;GAUG;AACH,qBAAa,gBAAgB;IACf,OAAO,CAAC,MAAM;gBAAN,MAAM,EAAE,cAAc;IAE1C;;;OAGG;IACH,OAAO,CACL,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,cAAc,EACvB,OAAO,SAAM,GACZ,cAAc;IAqBjB;;;OAGG;IACH,mBAAmB,CACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,EAC5D,QAAQ,EAAE,aAAa,EACvB,MAAM,SAAM,GACX,cAAc;IA2CjB,OAAO,CAAC,WAAW;IA4CnB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IAgCnB,+EAA+E;IAC/E,OAAO,CAAC,gBAAgB;IAoCxB;;;;;;OAMG;IACH,OAAO,CAAC,wBAAwB;IA4EhC;;OAEG;IACH,OAAO,CAAC,SAAS;IAiDjB;;;OAGG;IACH,OAAO,CAAC,UAAU;IA8DlB;;;OAGG;IACH,OAAO,CAAC,UAAU;CA2BnB"}
+{"version":3,"file":"fulltext.compiler.d.ts","sourceRoot":"","sources":["../../../src/compilers/fulltext.compiler.ts"],"names":[],"mappings":"AACA,OAAO,EAGL,aAAa,EAEd,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAkChF,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;GAUG;AACH,qBAAa,gBAAgB;IACf,OAAO,CAAC,MAAM;gBAAN,MAAM,EAAE,cAAc;IAE1C;;;OAGG;IACH,OAAO,CACL,QAAQ,EAAE,aAAa,EACvB,OAAO,EAAE,cAAc,EACvB,OAAO,SAAM,GACZ,cAAc;IAqBjB;;;OAGG;IACH,mBAAmB,CACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,EAC5D,QAAQ,EAAE,aAAa,EACvB,MAAM,SAAM,GACX,cAAc;IAgDjB,OAAO,CAAC,WAAW;IAmDnB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IAqCnB,+EAA+E;IAC/E,OAAO,CAAC,gBAAgB;IAoCxB;;;;;;OAMG;IACH,OAAO,CAAC,wBAAwB;IAgFhC;;OAEG;IACH,OAAO,CAAC,SAAS;IAiDjB;;;OAGG;IACH,OAAO,CAAC,UAAU;IA8DlB;;;OAGG;IACH,OAAO,CAAC,UAAU;CA2BnB"}