@ifc-lite/ids 1.15.49 → 1.15.51

package/dist/constraints/index.js

@@ -1,11 +1,7 @@
 /* This Source Code Form is subject to the terms of the Mozilla Public
  * License, v. 2.0. If a copy of the MPL was not distributed with this
  * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
-import { compareBoolean, compareNumeric, compareString, isStrictNumericLiteral, isBooleanLiteral, } from './comparators.js';
-import { isNumericXsdBase, isBooleanXsdBase } from './xsd-cast.js';
-import { translateXsdRegex } from './xsd-regex.js';
-/** Tolerance for the bounds matcher's exclusive comparators. */
-const NUMERIC_TOLERANCE = 1e-6;
+import { conjunctiveFacetsOf, matchOneFamily } from './match-family.js';
 /**
  * Check if a value matches a constraint
  */
@@ -14,365 +10,21 @@ export function matchConstraint(constraint, actualValue, options) {
         return false;
     }
     const ci = options?.caseInsensitive ?? false;
-    switch (constraint.type) {
-        case 'simpleValue':
-            return matchSimpleValue(constraint, actualValue, ci);
-        case 'pattern':
-            return matchPattern(constraint, actualValue, ci);
-        case 'enumeration':
-            return matchEnumeration(constraint, actualValue, ci);
-        case 'bounds':
-            return matchBounds(constraint, actualValue);
-        default:
-            return false;
-    }
-}
-/**
- * Per-constraint comparator applicability. `compareNumeric` runs two
- * regex tests and `compareBoolean` two equality checks per call — and
- * simple-value matching sits inside per-entity × per-specification hot
- * loops (name matching against every pset/property). Whether the IDS
- * literal could EVER match numerically or boolean-ly depends only on
- * the constraint, so decide it once.
- */
-const SIMPLE_VALUE_COERCIBLE = new WeakMap();
-function isCoercibleSimpleValue(constraint) {
-    let coercible = SIMPLE_VALUE_COERCIBLE.get(constraint);
-    if (coercible === undefined) {
-        coercible =
-            isStrictNumericLiteral(constraint.value) ||
-                isBooleanLiteral(constraint.value);
-        SIMPLE_VALUE_COERCIBLE.set(constraint, coercible);
-    }
-    return coercible;
-}
-/**
- * Match against a simple value. Tries each comparator in order:
- * string → numeric → boolean. The first decisive result wins;
- * `undefined` lets the next strategy run.
- */
-function matchSimpleValue(constraint, actualValue, caseInsensitive) {
-    const expected = constraint.value;
-    const stringResult = compareString(expected, actualValue, caseInsensitive);
-    if (stringResult !== undefined)
-        return stringResult;
-    // A non-numeric, non-boolean literal can only match through string
-    // equality — skip the comparators that would return undefined anyway.
-    if (!isCoercibleSimpleValue(constraint))
-        return false;
-    const numericResult = compareNumeric(expected, actualValue);
-    if (numericResult !== undefined)
-        return numericResult;
-    const booleanResult = compareBoolean(expected, actualValue);
-    if (booleanResult !== undefined)
-        return booleanResult;
-    return false;
-}
-/**
- * Match against a regex pattern
- * IDS uses XSD regex syntax which is slightly different from JavaScript
- */
-function matchPattern(constraint, actualValue, caseInsensitive = false) {
-    // An XSD `xs:pattern` facet constrains the *lexical* space of its base
-    // datatype, so it matches the textual representation of the value — the
-    // official IDS reference (ifctester) does `re.fullmatch(pattern,
-    // str(value))`. A numeric value therefore satisfies e.g.
-    // `<restriction base="xs:decimal"><pattern value="^.*$"/>` ("any
-    // decimal value present"), which the previous blanket number/boolean
-    // bail-out wrongly failed on every numeric property.
-    //
-    // But the runtime value must first be type-compatible with the declared
-    // base: a number only matches a numeric base and a boolean only a
-    // boolean base. A number tested against `base="xs:string"` is a type
-    // mismatch — buildingSMART's corpus encodes exactly this as
-    // `patterns_always_fail_on_any_number`. (A string actual is already the
-    // lexical form, so it is matched directly regardless of base.)
-    if (typeof actualValue === 'number') {
-        if (!isNumericXsdBase(constraint.base))
-            return false;
-    }
-    else if (typeof actualValue === 'boolean') {
-        if (!isBooleanXsdBase(constraint.base))
-            return false;
-    }
-    const actualStr = String(actualValue);
-    const regex = compilePatternRegex(constraint, caseInsensitive);
-    // An un-compilable pattern can't match anything (e.g. an unbalanced
-    // `[`); treat it as a non-match rather than throwing.
-    return regex ? regex.test(actualStr) : false;
-}
-/**
- * Compiled-pattern cache. Translating XSD → JS regex and building the
- * `RegExp` on every value check dominated pattern-heavy validation; the
- * compiled form depends only on (constraint, caseInsensitive), and the
- * constraint object is stable per parsed document.
- */
-const PATTERN_REGEX_CACHE = new WeakMap();
-function compilePatternRegex(constraint, caseInsensitive) {
-    let entry = PATTERN_REGEX_CACHE.get(constraint);
-    if (!entry) {
-        entry = {};
-        PATTERN_REGEX_CACHE.set(constraint, entry);
-    }
-    const slot = caseInsensitive ? 'ci' : 'cs';
-    let regex = entry[slot];
-    if (regex === undefined) {
-        regex = buildPatternRegex(constraint.pattern, caseInsensitive);
-        entry[slot] = regex;
-    }
-    return regex;
-}
-function buildPatternRegex(xsdPattern, caseInsensitive) {
-    // XSD char-class subtraction `[a-z-[aeiou]]` has no JS equivalent;
-    // approximate as the positive class (drop the exclusion) so the rest
-    // of the pattern still evaluates, matching long-standing behaviour.
-    const desubtracted = xsdPattern.replace(/\[([^\]]+)-\[[^\]]+\]\]/g, '[$1]');
-    // Shared XSD → JS translation: `\i`/`\c`/`\d`/`\w` (and their
-    // negations) map to Unicode property escapes, and verbatim `\p{…}`
-    // classes pass through — both require the `u` flag for full fidelity.
-    const { pattern } = translateXsdRegex(desubtracted);
-    // IDS patterns must match the entire lexical value. Wrapping in a
-    // non-capturing group anchors top-level alternation correctly
-    // (`a|b` → `^(?:a|b)$`, not `^a|b$`). Case-insensitive matching is
-    // opt-in per the call site (entity / predefined-type names use it;
-    // property and attribute values do not).
-    const anchored = `^(?:${pattern})$`;
-    try {
-        return new RegExp(anchored, caseInsensitive ? 'iu' : 'u');
-    }
-    catch {
-        // Some patterns are valid under JS's lenient (Annex-B) dialect but
-        // rejected under `u`. Retry without it so plain patterns keep
-        // matching; this loses `\p{…}` fidelity for that one pattern only.
-        try {
-            return new RegExp(anchored, caseInsensitive ? 'i' : '');
-        }
-        catch {
-            return null;
-        }
-    }
-}
-/**
- * Compiled exact-match sets per enumeration constraint. Real-world IDS
- * code lists carry hundreds of values and are matched against every
- * candidate entity, so the linear comparator walk dominated validation
- * time. Constraint objects are stable per parsed document, making a
- * WeakMap cache safe.
- */
-const ENUM_VALUE_SETS = new WeakMap();
-function getEnumValueSets(constraint) {
-    let sets = ENUM_VALUE_SETS.get(constraint);
-    if (!sets) {
-        const exact = new Set(constraint.values);
-        const upper = new Set();
-        let anyCoercible = false;
-        for (const v of constraint.values) {
-            upper.add(v.toUpperCase());
-            if (isStrictNumericLiteral(v) || isBooleanLiteral(v))
-                anyCoercible = true;
-        }
-        sets = { exact, upper, anyCoercible };
-        ENUM_VALUE_SETS.set(constraint, sets);
-    }
-    return sets;
-}
-/**
- * Match against an enumeration. The actual value matches if ANY of the
- * declared options matches under string / numeric / boolean comparison
- * — same strategy table as `matchSimpleValue`, just iterated.
- */
-function matchEnumeration(constraint, actualValue, caseInsensitive) {
-    // O(1) fast path: a set hit is exactly the condition under which
-    // `compareString` would have returned true for some value, so this
-    // never changes the outcome — misses fall through to the full
-    // comparator walk for numeric / boolean semantics.
-    const sets = getEnumValueSets(constraint);
-    const actualStr = String(actualValue);
-    if (sets.exact.has(actualStr))
-        return true;
-    if (caseInsensitive && sets.upper.has(actualStr.toUpperCase()))
+    if (!matchOneFamily(constraint, actualValue, ci))
+        return false;
+    // XSD facets declared in the same `<xs:restriction>` are conjunctive.
+    // `parseRestriction` keeps the first family as the constraint itself
+    // and hangs the others here; a value has to satisfy all of them. The
+    // overwhelmingly common restriction declares one family and leaves
+    // `and` undefined, so this costs one property read.
+    const siblings = conjunctiveFacetsOf(constraint);
+    if (siblings === undefined)
         return true;
-    // Pure-string enumerations are fully decided by the set lookups —
-    // only numeric/boolean literals can still match in the slow walk.
-    if (!sets.anyCoercible)
-        return false;
-    return constraint.values.some((v) => {
-        const stringResult = compareString(v, actualValue, caseInsensitive);
-        if (stringResult !== undefined)
-            return stringResult;
-        const numericResult = compareNumeric(v, actualValue);
-        if (numericResult !== undefined)
-            return numericResult;
-        const booleanResult = compareBoolean(v, actualValue);
-        if (booleanResult !== undefined)
-            return booleanResult;
-        return false;
-    });
-}
-/**
- * Match against numeric bounds
- */
-function matchBounds(constraint, actualValue) {
-    // String-length facets (xs:length / xs:minLength / xs:maxLength)
-    // operate on the textual length, not on numeric magnitude. When any
-    // of them are present, evaluate the length constraints first.
-    if (constraint.length !== undefined ||
-        constraint.minLength !== undefined ||
-        constraint.maxLength !== undefined) {
-        const str = String(actualValue);
-        if (constraint.length !== undefined && str.length !== constraint.length) {
-            return false;
-        }
-        if (constraint.minLength !== undefined && str.length < constraint.minLength) {
+    for (const sibling of siblings) {
+        if (!matchOneFamily(sibling, actualValue, ci))
             return false;
-        }
-        if (constraint.maxLength !== undefined && str.length > constraint.maxLength) {
-            return false;
-        }
-        // Length-only restrictions don't impose numeric bounds; if the
-        // constraint also carries min/max we fall through to the numeric
-        // check below (rare in practice).
-        if (constraint.minInclusive === undefined &&
-            constraint.maxInclusive === undefined &&
-            constraint.minExclusive === undefined &&
-            constraint.maxExclusive === undefined) {
-            return true;
-        }
-    }
-    const num = typeof actualValue === 'number'
-        ? actualValue
-        : parseFloat(String(actualValue));
-    if (isNaN(num))
-        return false;
-    if (constraint.minInclusive !== undefined &&
-        num < constraint.minInclusive) {
-        return false;
-    }
-    if (constraint.maxInclusive !== undefined &&
-        num > constraint.maxInclusive) {
-        return false;
-    }
-    if (constraint.minExclusive !== undefined && num <= constraint.minExclusive) {
-        return false;
-    }
-    if (constraint.maxExclusive !== undefined && num >= constraint.maxExclusive) {
-        return false;
     }
     return true;
 }
-/**
- * Cap enumeration rendering. These strings are embedded in per-entity
- * validation results — an uncapped 800-value code list produced ~20KB
- * per result and ballooned reports into the gigabytes (OOM crash on
- * large models). The full value list stays available on the constraint
- * object itself.
- */
-const MAX_ENUM_DISPLAY_VALUES = 10;
-function formatEnumValues(values) {
-    const shown = values
-        .slice(0, MAX_ENUM_DISPLAY_VALUES)
-        .map((v) => `"${v}"`)
-        .join(', ');
-    const more = values.length - MAX_ENUM_DISPLAY_VALUES;
-    return more > 0 ? `[${shown}, … +${more} more]` : `[${shown}]`;
-}
-/**
- * Get a human-readable description of why a constraint match failed
- */
-export function getConstraintMismatchReason(constraint, actualValue) {
-    if (actualValue === null || actualValue === undefined) {
-        return 'value is missing';
-    }
-    switch (constraint.type) {
-        case 'simpleValue':
-            return `expected "${constraint.value}", got "${actualValue}"`;
-        case 'pattern':
-            return `"${actualValue}" does not match pattern "${constraint.pattern}"`;
-        case 'enumeration':
-            return `"${actualValue}" is not one of ${formatEnumValues(constraint.values)}`;
-        case 'bounds':
-            return getBoundsMismatchReason(constraint, actualValue);
-        default:
-            return 'unknown constraint type';
-    }
-}
-function getBoundsMismatchReason(constraint, actualValue) {
-    const num = typeof actualValue === 'number'
-        ? actualValue
-        : parseFloat(String(actualValue));
-    if (isNaN(num)) {
-        return `"${actualValue}" is not a valid number`;
-    }
-    const violations = [];
-    if (constraint.minInclusive !== undefined &&
-        num < constraint.minInclusive - NUMERIC_TOLERANCE) {
-        violations.push(`must be >= ${constraint.minInclusive}`);
-    }
-    if (constraint.maxInclusive !== undefined &&
-        num > constraint.maxInclusive + NUMERIC_TOLERANCE) {
-        violations.push(`must be <= ${constraint.maxInclusive}`);
-    }
-    if (constraint.minExclusive !== undefined && num <= constraint.minExclusive) {
-        violations.push(`must be > ${constraint.minExclusive}`);
-    }
-    if (constraint.maxExclusive !== undefined && num >= constraint.maxExclusive) {
-        violations.push(`must be < ${constraint.maxExclusive}`);
-    }
-    return `${num} ${violations.join(' and ')}`;
-}
-/**
- * Per-constraint display-string cache. Failure paths format the same
- * constraint for every non-matching entity — millions of times during
- * applicability filtering — and the output depends only on the
- * constraint object.
- */
-const FORMAT_CACHE = new WeakMap();
-/**
- * Format a constraint for display
- */
-export function formatConstraint(constraint) {
-    let formatted = FORMAT_CACHE.get(constraint);
-    if (formatted === undefined) {
-        formatted = formatConstraintUncached(constraint);
-        FORMAT_CACHE.set(constraint, formatted);
-    }
-    return formatted;
-}
-function formatConstraintUncached(constraint) {
-    switch (constraint.type) {
-        case 'simpleValue':
-            return `"${constraint.value}"`;
-        case 'pattern':
-            return `pattern "${constraint.pattern}"`;
-        case 'enumeration':
-            if (constraint.values.length === 1) {
-                return `"${constraint.values[0]}"`;
-            }
-            return `one of ${formatEnumValues(constraint.values)}`;
-        case 'bounds':
-            return formatBounds(constraint);
-        default:
-            return 'unknown';
-    }
-}
-function formatBounds(constraint) {
-    const parts = [];
-    if (constraint.minInclusive !== undefined &&
-        constraint.maxInclusive !== undefined) {
-        return `between ${constraint.minInclusive} and ${constraint.maxInclusive}`;
-    }
-    if (constraint.minInclusive !== undefined) {
-        parts.push(`>= ${constraint.minInclusive}`);
-    }
-    if (constraint.maxInclusive !== undefined) {
-        parts.push(`<= ${constraint.maxInclusive}`);
-    }
-    if (constraint.minExclusive !== undefined) {
-        parts.push(`> ${constraint.minExclusive}`);
-    }
-    if (constraint.maxExclusive !== undefined) {
-        parts.push(`< ${constraint.maxExclusive}`);
-    }
-    return parts.join(' and ') || 'any value';
-}
+export { getConstraintMismatchReason, formatConstraint, } from './describe.js';
 //# sourceMappingURL=index.js.map

package/dist/constraints/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/constraints/index.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAc/D,OAAO,EACL,cAAc,EACd,cAAc,EACd,aAAa,EAEb,sBAAsB,EACtB,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACnE,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAEnD,gEAAgE;AAChE,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAa/B;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAyB,EACzB,WAAyD,EACzD,OAAsB;IAEtB,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACtD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,EAAE,GAAG,OAAO,EAAE,eAAe,IAAI,KAAK,CAAC;IAE7C,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;QACvD,KAAK,SAAS;YACZ,OAAO,YAAY,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;QACnD,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;QACvD,KAAK,QAAQ;YACX,OAAO,WAAW,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC9C;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,sBAAsB,GAAG,IAAI,OAAO,EAA2B,CAAC;AAEtE,SAAS,sBAAsB,CAAC,UAA0B;IACxD,IAAI,SAAS,GAAG,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACvD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,SAAS;YACP,sBAAsB,CAAC,UAAU,CAAC,KAAK,CAAC;gBACxC,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,sBAAsB,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,UAA0B,EAC1B,WAAsC,EACtC,eAAwB;IAExB,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC;IAClC,MAAM,YAAY,GAAG,aAAa,CAAC,QAAQ,EAAE,WAAW,EAAE,eAAe,CAAC,CAAC;IAC3E,IAAI,YAAY,KAAK,SAAS;QAAE,OAAO,YAAY,CAAC;IACpD,mEAAmE;IACnE,sEAAsE;IACtE,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,aAAa,GAAG,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IAC5D,IAAI,aAAa,KAAK,SAAS;QAAE,OAAO,aAAa,CAAC;IACtD,MAAM,aAAa,GAAG,cAAc,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IAC5D,IAAI,aAAa,KAAK,SAAS;QAAE,OAAO,aAAa,CAAC;IACtD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACnB,UAAgC,EAChC,WAAsC,EACtC,eAAe,GAAG,KAAK;IAEvB,uEAAuE;IACvE,wEAAwE;IACxE,iEAAiE;IACjE,yDAAyD;IACzD,iEAAiE;IACjE,qEAAqE;IACrE,qDAAqD;IACrD,EAAE;IACF,wEAAwE;IACxE,kEAAkE;IAClE,qEAAqE;IACrE,4DAA4D;IAC5D,wEAAwE;IACxE,+DAA+D;IAC/D,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;QACpC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;IACvD,CAAC;SAAM,IAAI,OAAO,WAAW,KAAK,SAAS,EAAE,CAAC;QAC5C,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;IACvD,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;IAEtC,MAAM,KAAK,GAAG,mBAAmB,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;IAC/D,oEAAoE;IACpE,sDAAsD;IACtD,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/C,CAAC;AAED;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,IAAI,OAAO,EAGpC,CAAC;AAEJ,SAAS,mBAAmB,CAC1B,UAAgC,EAChC,eAAwB;IAExB,IAAI,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAChD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,EAAE,CAAC;QACX,mBAAmB,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3C,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,iBAAiB,CAAC,UAAU,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC/D,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CACxB,UAAkB,EAClB,eAAwB;IAExB,mEAAmE;IACnE,qEAAqE;IACrE,oEAAoE;IACpE,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CACrC,0BAA0B,EAC1B,MAAM,CACP,CAAC;IACF,8DAA8D;IAC9D,mEAAmE;IACnE,sEAAsE;IACtE,MAAM,EAAE,OAAO,EAAE,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;IACpD,kEAAkE;IAClE,8DAA8D;IAC9D,mEAAmE;IACnE,mEAAmE;IACnE,yCAAyC;IACzC,MAAM,QAAQ,GAAG,OAAO,OAAO,IAAI,CAAC;IACpC,IAAI,CAAC;QACH,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAAC,MAAM,CAAC;QACP,mEAAmE;QACnE,8DAA8D;QAC9D,mEAAmE;QACnE,IAAI,CAAC;YACH,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,IAAI,OAAO,EAGhC,CAAC;AAEJ,SAAS,gBAAgB,CAAC,UAAoC;IAK5D,IAAI,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC3C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YAClC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YAC3B,IAAI,sBAAsB,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;gBAAE,YAAY,GAAG,IAAI,CAAC;QAC5E,CAAC;QACD,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;QACtC,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,UAAoC,EACpC,WAAsC,EACtC,eAAwB;IAExB,iEAAiE;IACjE,mEAAmE;IACnE,8DAA8D;IAC9D,mDAAmD;IACnD,MAAM,IAAI,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;IACtC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3C,IAAI,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5E,kEAAkE;IAClE,kEAAkE;IAClE,IAAI,CAAC,IAAI,CAAC,YAAY;QAAE,OAAO,KAAK,CAAC;IAErC,OAAO,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,EAAE,WAAW,EAAE,eAAe,CAAC,CAAC;QACpE,IAAI,YAAY,KAAK,SAAS;YAAE,OAAO,YAAY,CAAC;QACpD,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,IAAI,aAAa,KAAK,SAAS;YAAE,OAAO,aAAa,CAAC;QACtD,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,IAAI,aAAa,KAAK,SAAS;YAAE,OAAO,aAAa,CAAC;QACtD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAClB,UAA+B,EAC/B,WAAsC;IAEtC,iEAAiE;IACjE,oEAAoE;IACpE,8DAA8D;IAC9D,IACE,UAAU,CAAC,MAAM,KAAK,SAAS;QAC/B,UAAU,CAAC,SAAS,KAAK,SAAS;QAClC,UAAU,CAAC,SAAS,KAAK,SAAS,EAClC,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAChC,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;YACxE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YAC5E,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YAC5E,OAAO,KAAK,CAAC;QACf,CAAC;QACD,+DAA+D;QAC/D,iEAAiE;QACjE,kCAAkC;QAClC,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;YACrC,UAAU,CAAC,YAAY,KAAK,SAAS;YACrC,UAAU,CAAC,YAAY,KAAK,SAAS;YACrC,UAAU,CAAC,YAAY,KAAK,SAAS,EACrC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GACP,OAAO,WAAW,KAAK,QAAQ;QAC7B,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;IAEtC,IAAI,KAAK,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAE7B,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;QACrC,GAAG,GAAG,UAAU,CAAC,YAAY,EAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;QACrC,GAAG,GAAG,UAAU,CAAC,YAAY,EAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,IAAI,GAAG,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC;QAC5E,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,IAAI,GAAG,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC;QAC5E,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,SAAS,gBAAgB,CAAC,MAAgB;IACxC,MAAM,KAAK,GAAG,MAAM;SACjB,KAAK,CAAC,CAAC,EAAE,uBAAuB,CAAC;SACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;SACpB,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,uBAAuB,CAAC;IACrD,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;AACjE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,2BAA2B,CACzC,UAAyB,EACzB,WAAyD;IAEzD,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACtD,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,aAAa;YAChB,OAAO,aAAa,UAAU,CAAC,KAAK,WAAW,WAAW,GAAG,CAAC;QAChE,KAAK,SAAS;YACZ,OAAO,IAAI,WAAW,6BAA6B,UAAU,CAAC,OAAO,GAAG,CAAC;QAC3E,KAAK,aAAa;YAChB,OAAO,IAAI,WAAW,mBAAmB,gBAAgB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACjF,KAAK,QAAQ;YACX,OAAO,uBAAuB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC1D;YACE,OAAO,yBAAyB,CAAC;IACrC,CAAC;AACH,CAAC;AAED,SAAS,uBAAuB,CAC9B,UAA+B,EAC/B,WAAsC;IAEtC,MAAM,GAAG,GACP,OAAO,WAAW,KAAK,QAAQ;QAC7B,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;IAEtC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACf,OAAO,IAAI,WAAW,yBAAyB,CAAC;IAClD,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;QACrC,GAAG,GAAG,UAAU,CAAC,YAAY,GAAG,iBAAiB,EACjD,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,cAAc,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;QACrC,GAAG,GAAG,UAAU,CAAC,YAAY,GAAG,iBAAiB,EACjD,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,cAAc,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,IAAI,GAAG,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC;QAC5E,UAAU,CAAC,IAAI,CAAC,aAAa,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,IAAI,GAAG,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC;QAC5E,UAAU,CAAC,IAAI,CAAC,aAAa,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,GAAG,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;AAC9C,CAAC;AAED;;;;;GAKG;AACH,MAAM,YAAY,GAAG,IAAI,OAAO,EAAyB,CAAC;AAE1D;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAyB;IACxD,IAAI,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC7C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC;QACjD,YAAY,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,wBAAwB,CAAC,UAAyB;IACzD,QAAQ,UAAU,CAAC,IAAI,EAAE,CAAC;QACxB,KAAK,aAAa;YAChB,OAAO,IAAI,UAAU,CAAC,KAAK,GAAG,CAAC;QACjC,KAAK,SAAS;YACZ,OAAO,YAAY,UAAU,CAAC,OAAO,GAAG,CAAC;QAC3C,KAAK,aAAa;YAChB,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnC,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YACrC,CAAC;YACD,OAAO,UAAU,gBAAgB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACzD,KAAK,QAAQ;YACX,OAAO,YAAY,CAAC,UAAU,CAAC,CAAC;QAClC;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,UAA+B;IACnD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IACE,UAAU,CAAC,YAAY,KAAK,SAAS;QACrC,UAAU,CAAC,YAAY,KAAK,SAAS,EACrC,CAAC;QACD,OAAO,WAAW,UAAU,CAAC,YAAY,QAAQ,UAAU,CAAC,YAAY,EAAE,CAAC;IAC7E,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,MAAM,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,MAAM,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,UAAU,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,WAAW,CAAC;AAC5C,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/constraints/index.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAQ/D,OAAO,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAaxE;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAyB,EACzB,WAAyD,EACzD,OAAsB;IAEtB,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACtD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,EAAE,GAAG,OAAO,EAAE,eAAe,IAAI,KAAK,CAAC;IAE7C,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAE/D,sEAAsE;IACtE,qEAAqE;IACrE,qEAAqE;IACrE,mEAAmE;IACnE,oDAAoD;IACpD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IACjD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACxC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAGD,OAAO,EACL,2BAA2B,EAC3B,gBAAgB,GACjB,MAAM,eAAe,CAAC"}

package/dist/constraints/match-family.d.ts

@@ -0,0 +1,20 @@
+/**
+ * The per-facet-family matchers — simple value, pattern, enumeration
+ * and bounds — plus their compiled-form caches.
+ *
+ * Split out of `constraints/index.ts` so that module is the matching
+ * entry point and this one holds the primitives, letting the reporting
+ * module (`describe.ts`) reach them without an import cycle.
+ */
+import type { IDSConstraint } from '../types.js';
+/** Tolerance for the bounds matcher's exclusive comparators. */
+export declare const NUMERIC_TOLERANCE = 0.000001;
+/**
+ * The conjunctive facets `parseRestriction` attached to this constraint
+ * from the same `<xs:restriction>`, or `undefined` when it declared one
+ * facet family (the common case). `simpleValue` never carries any: it
+ * does not come from a restriction.
+ */
+export declare function conjunctiveFacetsOf(constraint: IDSConstraint): readonly IDSConstraint[] | undefined;
+export declare function matchOneFamily(constraint: IDSConstraint, actualValue: string | number | boolean, ci: boolean): boolean;
+//# sourceMappingURL=match-family.d.ts.map

package/dist/constraints/match-family.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"match-family.d.ts","sourceRoot":"","sources":["../../src/constraints/match-family.ts"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,aAAa,EAKd,MAAM,aAAa,CAAC;AAarB,gEAAgE;AAChE,eAAO,MAAM,iBAAiB,WAAO,CAAC;AAEtC;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,aAAa,GACxB,SAAS,aAAa,EAAE,GAAG,SAAS,CAEtC;AAED,wBAAgB,cAAc,CAC5B,UAAU,EAAE,aAAa,EACzB,WAAW,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,EACtC,EAAE,EAAE,OAAO,GACV,OAAO,CAaT"}