@thomasfosterau/effect-rdf 0.0.0 → 0.1.0

package/dist/Validator-BzXMKDeJ.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Validator-BzXMKDeJ.mjs","names":["Term.isLiteral","Term.isNamedNode","Term.isBlankNode","Xsd.isNumericDatatype","Xsd.isValidLexical","Term.isResource","Term.triple","Term.isResource","Term.isTriple","Dataset.match","Term.isVariable","Term.isDefaultGraph","Structure.check","Structure.makeIndex","SemAct.SemActHandler","SemAct.withExternalCode","ShapeMap.resolve","ShapeMap.isStart","Dataset.DatasetSchema"],"sources":["../src/shex/internal/xpathRegex.ts","../src/shex/internal/nodeConstraint.ts","../src/shex/internal/engine.ts","../src/shex/Validator.ts"],"sourcesContent":["import * as Arr from 'effect/Array';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Match from 'effect/Match';\nimport * as Option from 'effect/Option';\n/**\n * Translation of XPath / XML Schema regular expressions (as used by the\n * ShEx `pattern` facet and `fn:matches`) to JavaScript `RegExp`s.\n *\n * Handled differences: `.` excludes only `\\n` and `\\r`; `\\d`, `\\w`, `\\i`,\n * `\\c` and their complements use the XML Schema definitions; character class\n * subtraction (`[a-z-[aeiou]]`); `\\p{IsBlock}` names; the `x` flag removes\n * whitespace; escapes JavaScript rejects in Unicode mode are normalised.\n *\n * @internal\n */\n\nconst NAME_START =\n  ':A-Z_a-z\\\\u00C0-\\\\u00D6\\\\u00D8-\\\\u00F6\\\\u00F8-\\\\u02FF\\\\u0370-\\\\u037D\\\\u037F-\\\\u1FFF\\\\u200C-\\\\u200D\\\\u2070-\\\\u218F\\\\u2C00-\\\\u2FEF\\\\u3001-\\\\uD7FF\\\\uF900-\\\\uFDCF\\\\uFDF0-\\\\uFFFD\\\\u{10000}-\\\\u{EFFFF}';\nconst NAME_CHAR = `${NAME_START}\\\\-.0-9\\\\u00B7\\\\u0300-\\\\u036F\\\\u203F-\\\\u2040`;\n\n/** A character class body, and whether the class is complemented. */\ninterface ClassBody {\n  readonly body: string;\n  readonly negated: boolean;\n}\n\n/** A lookup table keyed by escape letter or block name. */\ninterface Table<A> {\n  readonly [key: string]: A;\n}\n\n/** Class body fragments for the multi-character escapes. */\nconst CLASS_ESCAPES: Table<ClassBody> = {\n  d: { body: '\\\\p{Nd}', negated: false },\n  D: { body: '\\\\p{Nd}', negated: true },\n  w: { body: '\\\\p{L}\\\\p{M}\\\\p{N}\\\\p{S}', negated: false },\n  W: { body: '\\\\p{L}\\\\p{M}\\\\p{N}\\\\p{S}', negated: true },\n  s: { body: ' \\\\t\\\\n\\\\r', negated: false },\n  S: { body: ' \\\\t\\\\n\\\\r', negated: true },\n  i: { body: NAME_START, negated: false },\n  I: { body: NAME_START, negated: true },\n  c: { body: NAME_CHAR, negated: false },\n  C: { body: NAME_CHAR, negated: true },\n};\n\nconst BLOCKS: Table<string> = {\n  BasicLatin: '\\\\u0000-\\\\u007F',\n  'Latin-1Supplement': '\\\\u0080-\\\\u00FF',\n  LatinExtended_A: '\\\\u0100-\\\\u017F',\n  'LatinExtended-A': '\\\\u0100-\\\\u017F',\n  'LatinExtended-B': '\\\\u0180-\\\\u024F',\n  IPAExtensions: '\\\\u0250-\\\\u02AF',\n  Greek: '\\\\u0370-\\\\u03FF',\n  GreekandCoptic: '\\\\u0370-\\\\u03FF',\n  Cyrillic: '\\\\u0400-\\\\u04FF',\n  Hebrew: '\\\\u0590-\\\\u05FF',\n  Arabic: '\\\\u0600-\\\\u06FF',\n  CJKUnifiedIdeographs: '\\\\u4E00-\\\\u9FFF',\n  Hiragana: '\\\\u3040-\\\\u309F',\n  Katakana: '\\\\u30A0-\\\\u30FF',\n};\n\nconst SYNTAX = MutableHashSet.make(\n  '^',\n  '$',\n  '\\\\',\n  '.',\n  '*',\n  '+',\n  '?',\n  '(',\n  ')',\n  '[',\n  ']',\n  '{',\n  '}',\n  '|',\n  '/',\n);\n\n/** What a character class collects besides its body. */\ninterface ClassState {\n  /** Complemented class escapes, which cannot go in the body. */\n  readonly extra: Array<string>;\n  /** The subtracted class (`-[…]`), translated. */\n  subtraction: Option.Option<string>;\n}\n\n/** An escape read by `Translator.escape`: a character, or a class body. */\ntype Escape = { kind: 'char'; text: string } | { kind: 'class'; body: string; negated: boolean };\n\n// Built once: `escape` runs it for every backslash of every pattern.\nconst escapeOf: (c: string, t: Translator) => Escape = Match.fn(\n  (c: string, _t: Translator) => c,\n).pipe(\n  Match.withReturnType<Escape>(),\n  Match.when('n', () => ({ kind: 'char', text: '\\\\n' })),\n  Match.when('r', () => ({ kind: 'char', text: '\\\\r' })),\n  Match.when('t', () => ({ kind: 'char', text: '\\\\t' })),\n  Match.when(Match.is('p', 'P'), (c, _c, t) => {\n    const p = t.property(c === 'P');\n    return { kind: 'class', ...p };\n  }),\n  Match.orElse((c, _c, t) => {\n    const ce = CLASS_ESCAPES[c];\n    if (ce !== undefined) return { kind: 'class', ...ce };\n    if (/[0-9]/.test(c)) return { kind: 'char', text: `\\\\${c}` };\n    if (c === '-') return { kind: 'char', text: '\\\\-' };\n    if (MutableHashSet.has(SYNTAX, c)) return { kind: 'char', text: `\\\\${c}` };\n    return t.fail(`invalid escape \\\\${c}`);\n  }),\n);\n\nclass Translator {\n  i = 0;\n  readonly src: string;\n  readonly dotAll: boolean;\n  readonly extended: boolean;\n  constructor(src: string, dotAll: boolean, extended: boolean) {\n    this.src = src;\n    this.dotAll = dotAll;\n    this.extended = extended;\n  }\n\n  fail(msg: string): never {\n    throw new SyntaxError(`${msg} at ${this.i} in /${this.src}/`);\n  }\n\n  /** Translates a property escape `\\p{..}` / `\\P{..}` (cursor after `p`/`P`). */\n  property(negated: boolean): ClassBody {\n    if (this.src[this.i] !== '{') this.fail('expected {');\n    const end = this.src.indexOf('}', this.i);\n    if (end === -1) this.fail('unterminated property escape');\n    const name = this.src.slice(this.i + 1, end);\n    this.i = end + 1;\n    if (name.startsWith('Is')) {\n      const block = BLOCKS[name.slice(2)];\n      if (block === undefined) this.fail(`unsupported block ${name}`);\n      return { body: block, negated };\n    }\n    return { body: `\\\\p{${name}}`, negated };\n  }\n\n  /** Reads an escape inside or outside a class (cursor after the backslash). */\n  escape(): Escape {\n    const c = this.src[this.i++];\n    if (c === undefined) this.fail('dangling backslash');\n    return escapeOf(c, this);\n  }\n\n  /** Translates a character class (cursor after `[`); returns a JS fragment. */\n  charClass(): string {\n    const negated = this.src[this.i] === '^';\n    if (negated) this.i++;\n    const state: ClassState = { extra: [], subtraction: Option.none() };\n    const raw = Arr.unfold(true, (first) =>\n      Option.map(this.classAtom(first, state), (fragment) => [fragment, false] as const),\n    ).join('');\n    // Ranges were emitted with escaped '-': restore range operators between plain characters.\n    const body = restoreRanges(raw);\n    const { extra } = state;\n    const set = Arr.isReadonlyArrayEmpty(extra)\n      ? `[${negated ? '^' : ''}${body}]`\n      : this.union(negated, [...(body === '' ? [] : [`[${body}]`]), ...extra]);\n    return Option.match(state.subtraction, {\n      onNone: () => set,\n      onSome: (subtraction) => `(?:(?!${subtraction})${set})`,\n    });\n  }\n\n  /** A class with complemented escapes: the union of its alternatives (or its complement). */\n  union(negated: boolean, alts: ReadonlyArray<string>): string {\n    const union = `(?:${alts.join('|')})`;\n    return negated ? `(?:(?!${union})[\\\\s\\\\S])` : union;\n  }\n\n  /**\n   * Reads the next atom of a character class, returning its body fragment,\n   * or none once the class ends (`]`, or a subtraction, which ends it).\n   */\n  classAtom(first: boolean, state: ClassState): Option.Option<string> {\n    const c = this.src[this.i];\n    if (c === undefined) this.fail('unterminated character class');\n    if (c === ']' && !first) {\n      this.i++;\n      return Option.none();\n    }\n    if (c === '-' && this.src[this.i + 1] === '[') {\n      this.i += 2;\n      state.subtraction = Option.some(this.charClass());\n      if (this.src[this.i] !== ']') this.fail('expected ] after class subtraction');\n      this.i++;\n      return Option.none();\n    }\n    this.i++;\n    if (c === '\\\\') {\n      const e = this.escape();\n      if (e.kind === 'char') return Option.some(e.text);\n      if (!e.negated) return Option.some(e.body);\n      state.extra.push(`[^${e.body}]`);\n      return Option.some('');\n    }\n    if (c === '[' || c === '/' || c === '{' || c === '}' || c === '(' || c === ')' || c === '|') {\n      return Option.some(`\\\\${c}`);\n    }\n    return Option.some(c === '-' ? '\\\\-' : c);\n  }\n\n  /** Translates the atom at the cursor (outside a class). */\n  atom(): string {\n    const c = this.src.charAt(this.i);\n    if (this.extended && /\\s/.test(c)) {\n      this.i++;\n      return '';\n    }\n    if (c === '\\\\') {\n      this.i++;\n      const e = this.escape();\n      return e.kind === 'char'\n        ? e.text === '\\\\-'\n          ? '-'\n          : e.text\n        : `[${e.negated ? '^' : ''}${e.body}]`;\n    }\n    if (c === '[') {\n      this.i++;\n      return this.charClass();\n    }\n    if (c === '{') {\n      const q = /^\\{\\d+(?:,\\d*)?\\}/.exec(this.src.slice(this.i));\n      if (q !== null) {\n        this.i += q[0].length;\n        return q[0];\n      }\n      this.i++;\n      return '\\\\{';\n    }\n    this.i++;\n    if (c === '.') return this.dotAll ? '[\\\\s\\\\S]' : '[^\\\\n\\\\r]';\n    if (c === '/') return '\\\\/';\n    if (c === ']' || c === '}') return `\\\\${c}`;\n    return c;\n  }\n\n  translate(): string {\n    return Arr.unfold(this, (t) =>\n      t.i < t.src.length ? Option.some([t.atom(), t] as const) : Option.none(),\n    ).join('');\n  }\n}\n\n/**\n * Inside a translated class body, a `-` between two class atoms that was\n * written unescaped is a range; we escaped every `-` while scanning, so turn\n * back those that had atoms on both sides in the source.\n */\nconst restoreRanges = (body: string): string => {\n  // Tokenise into atoms: escapes (\\x, \\p{..}, \\u{..}) or single code points.\n  const atoms = body.match(CLASS_ATOM) ?? [];\n  const endpointAt = (k: number): boolean => {\n    const a = atoms[k];\n    return a !== undefined && isRangeEndpoint(a);\n  };\n  return Arr.map(atoms, (a, k) =>\n    a === '\\\\-' && endpointAt(k - 1) && endpointAt(k + 1) ? '-' : a,\n  ).join('');\n};\n\nconst CLASS_ATOM = /\\\\(?:[pP]\\{[^}]*\\}|u\\{[0-9A-Fa-f]+\\}|u[0-9A-Fa-f]{4}|.)|./gsu;\n\nconst isRangeEndpoint = (atom: string): boolean => !/^\\\\[pPdDwWsS]/.test(atom) && atom !== '\\\\-';\n\n/**\n * Compiles an XPath regular expression with XPath flags (`s`, `m`, `i`, `x`,\n * `q`) to a JavaScript `RegExp` (Unicode mode).\n *\n * @internal\n */\nexport const compileXPathRegex = (pattern: string, flags: string): RegExp => {\n  if (flags.includes('q')) {\n    const escaped = pattern.replace(/[\\\\^$.*+?()[\\]{}|/-]/g, '\\\\$&');\n    return new RegExp(escaped, `u${flags.includes('i') ? 'i' : ''}`);\n  }\n  const t = new Translator(pattern, flags.includes('s'), flags.includes('x'));\n  const source = t.translate();\n  let jsFlags = 'u';\n  if (flags.includes('i')) jsFlags += 'i';\n  if (flags.includes('m')) jsFlags += 'm';\n  return new RegExp(source, jsFlags);\n};\n","/**\n * Node constraint evaluation (`satisfies2`): node kinds, datatypes, XML\n * Schema string and numeric facets, and value sets.\n *\n * @internal\n */\nimport * as Arr from 'effect/Array';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Match from 'effect/Match';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Result from 'effect/Result';\nimport * as Term from '../../Term.ts';\nimport * as Xsd from '../../Xsd.ts';\nimport type * as ShExJ from '../ShExJ.ts';\nimport { compileXPathRegex } from './xpathRegex.ts';\n\nconst XSD = 'http://www.w3.org/2001/XMLSchema#';\nconst XSD_STRING = `${XSD}string`;\nconst RDF_LANG_STRING = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#langString';\n\nconst decimalDerived = MutableHashSet.fromIterable(\n  [\n    'decimal',\n    'integer',\n    'nonPositiveInteger',\n    'negativeInteger',\n    'long',\n    'int',\n    'short',\n    'byte',\n    'nonNegativeInteger',\n    'unsignedLong',\n    'unsignedInt',\n    'unsignedShort',\n    'unsignedByte',\n    'positiveInteger',\n  ].map((l) => XSD + l),\n);\n\n/** The string a string facet applies to. */\nconst lexicalForm = (n: Term.Term): string =>\n  Term.isLiteral(n) || Term.isNamedNode(n) || Term.isBlankNode(n) ? n.value : n.key;\n\n/** The number of code points (a lone surrogate counts as one, as string iteration does). */\nconst codePointLength = (s: string): number =>\n  s.length - (s.match(/[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/g)?.length ?? 0);\n\nconst regexCache = MutableHashMap.empty<string, Result.Result<RegExp, string>>();\n\n/** Compiles (once) an XPath pattern; fails with the reason it is invalid. */\nconst getRegex = (pattern: string, flags: string): Result.Result<RegExp, string> => {\n  const key = `${flags}/${pattern}`;\n  return Option.getOrElse(MutableHashMap.get(regexCache, key), () => {\n    const re = Result.try({\n      try: () => compileXPathRegex(pattern, flags),\n      // The message of the thrown `SyntaxError`, else the thrown value's string form.\n      catch: (e) =>\n        Predicate.hasProperty(e, 'message') && Predicate.isString(e.message)\n          ? e.message\n          : String(e),\n    });\n    MutableHashMap.set(regexCache, key, re);\n    return re;\n  });\n};\n\ninterface DecimalParts {\n  readonly negative: boolean;\n  /** Integer digits without leading zeros (may be empty). */\n  readonly int: string;\n  /** Fraction digits without trailing zeros (may be empty). */\n  readonly frac: string;\n}\n\nconst decimalParts = (lexical: string): Option.Option<DecimalParts> => {\n  const m = /^([+-]?)(\\d*)(?:\\.(\\d*))?$/.exec(lexical.trim());\n  if (m === null || ((m[2] ?? '') === '' && (m[3] ?? '') === '')) return Option.none();\n  const int = (m[2] ?? '').replace(/^0+/, '');\n  const frac = (m[3] ?? '').replace(/0+$/, '');\n  return Option.some({ negative: m[1] === '-' && (int !== '' || frac !== ''), int, frac });\n};\n\nconst compareDecimalParts = (a: DecimalParts, b: DecimalParts): number => {\n  if (a.negative !== b.negative) return a.negative ? -1 : 1;\n  const sign = a.negative ? -1 : 1;\n  if (a.int.length !== b.int.length) return sign * (a.int.length < b.int.length ? -1 : 1);\n  if (a.int !== b.int) return sign * (a.int < b.int ? -1 : 1);\n  const len = Math.max(a.frac.length, b.frac.length);\n  const fa = a.frac.padEnd(len, '0');\n  const fb = b.frac.padEnd(len, '0');\n  if (fa === fb) return 0;\n  return sign * (fa < fb ? -1 : 1);\n};\n\nconst numberToDecimalParts = (n: number): Option.Option<DecimalParts> => {\n  if (!Number.isFinite(n)) return Option.none();\n  const s = String(n);\n  if (/e/i.test(s)) {\n    // Expand exponent notation exactly.\n    const m = /^(-?)(\\d+)(?:\\.(\\d+))?e([+-]\\d+)$/i.exec(s);\n    if (m === null) return Option.none();\n    const digits = (m[2] ?? '') + (m[3] ?? '');\n    const exp = parseInt(m[4] ?? '', 10) - (m[3] ?? '').length;\n    const body =\n      exp >= 0\n        ? digits + '0'.repeat(exp)\n        : (() => {\n            const padded = digits.padStart(-exp + 1, '0');\n            return `${padded.slice(0, exp)}.${padded.slice(exp)}`;\n          })();\n    return decimalParts(m[1] + body);\n  }\n  return decimalParts(s);\n};\n\n/** Numeric value of a literal for comparison, or undefined if not numeric/invalid. */\ntype Numeric =\n  | { readonly kind: 'decimal'; readonly parts: DecimalParts }\n  | { readonly kind: 'float'; readonly value: number };\n\nconst numericValue = (n: Term.Term): Option.Option<Numeric> => {\n  if (!Term.isLiteral(n)) return Option.none();\n  const dt = n.datatype.value;\n  if (!Xsd.isNumericDatatype(dt) || !Xsd.isValidLexical(dt, n.value)) return Option.none();\n  if (MutableHashSet.has(decimalDerived, dt)) {\n    return Option.map(decimalParts(n.value), (parts): Numeric => ({ kind: 'decimal', parts }));\n  }\n  const v = n.value.trim();\n  const value =\n    v === 'INF' || v === '+INF'\n      ? Infinity\n      : v === '-INF'\n        ? -Infinity\n        : v === 'NaN'\n          ? NaN\n          : Number(v);\n  return Option.some({ kind: 'float', value });\n};\n\n/** Compares a numeric value with a facet; returns NaN when incomparable. */\nconst compareWith = (v: Numeric, facet: number): number => {\n  if (v.kind === 'decimal') {\n    const { parts } = v;\n    return Option.match(numberToDecimalParts(facet), {\n      onNone: () => (Number.isNaN(facet) ? NaN : facet === Infinity ? -1 : 1),\n      onSome: (f) => compareDecimalParts(parts, f),\n    });\n  }\n  if (Number.isNaN(v.value) || Number.isNaN(facet)) return NaN;\n  return v.value < facet ? -1 : v.value > facet ? 1 : 0;\n};\n\nconst lowerEq = (a: string, b: string) => a.toLowerCase() === b.toLowerCase();\n\n/** Basic language-range filtering (RFC 4647 §3.3.1). */\nconst languageMatches = (tag: string, range: string): boolean => {\n  if (range === '' || range === '*') return tag !== '';\n  const t = tag.toLowerCase();\n  const r = range.toLowerCase();\n  return t === r || t.startsWith(`${r}-`);\n};\n\nconst literalEquals = (n: Term.Literal, v: ShExJ.ObjectLiteral): boolean => {\n  if (n.value !== v.value) return false;\n  if (v.language !== undefined) return n.language !== '' && lowerEq(n.language, v.language);\n  if (n.language !== '') return false;\n  return n.datatype.value === (v.type ?? XSD_STRING);\n};\n\n/**\n * Whether a value is in an IRI or literal stem range: under its stem (any\n * value, for a wildcard) and under none of its exclusions.\n */\nconst inStemRange = (value: string, range: ShExJ.IriStemRange | ShExJ.LiteralStemRange): boolean =>\n  (!Predicate.isString(range.stem) || value.startsWith(range.stem)) &&\n  !range.exclusions.some((e) => (Predicate.isString(e) ? value === e : value.startsWith(e.stem)));\n\n// Built once: `valueMatches` runs it for every value set value a node is checked against.\nconst stemValueMatches: (\n  v: Exclude<ShExJ.ValueSetValue, ShExJ.ObjectValue>,\n  n: Term.Term,\n) => boolean = Match.fn(\n  (v: Exclude<ShExJ.ValueSetValue, ShExJ.ObjectValue>, _n: Term.Term) => v,\n).pipe(\n  Match.withReturnType<boolean>(),\n  Match.when({ type: 'IriStem' }, (v, _v, n) => Term.isNamedNode(n) && n.value.startsWith(v.stem)),\n  Match.when(\n    { type: 'IriStemRange' },\n    (v, _v, n) => Term.isNamedNode(n) && inStemRange(n.value, v),\n  ),\n  Match.when(\n    { type: 'LiteralStem' },\n    (v, _v, n) => Term.isLiteral(n) && n.value.startsWith(v.stem),\n  ),\n  Match.when(\n    { type: 'LiteralStemRange' },\n    (v, _v, n) => Term.isLiteral(n) && inStemRange(n.value, v),\n  ),\n  Match.when(\n    { type: 'Language' },\n    (v, _v, n) => Term.isLiteral(n) && n.language !== '' && lowerEq(n.language, v.languageTag),\n  ),\n  Match.when(\n    { type: 'LanguageStem' },\n    (v, _v, n) => Term.isLiteral(n) && n.language !== '' && languageMatches(n.language, v.stem),\n  ),\n  Match.when({ type: 'LanguageStemRange' }, (v, _v, n) => {\n    if (!Term.isLiteral(n) || n.language === '') return false;\n    if (Predicate.isString(v.stem) && !languageMatches(n.language, v.stem)) return false;\n    return !v.exclusions.some((e) =>\n      Predicate.isString(e) ? lowerEq(n.language, e) : languageMatches(n.language, e.stem),\n    );\n  }),\n  Match.orElse(() => false),\n);\n\n/**\n * Whether a term matches a value set value.\n *\n * @internal\n */\nexport const valueMatches = (n: Term.Term, v: ShExJ.ValueSetValue): boolean => {\n  if (Predicate.isString(v)) return Term.isNamedNode(n) && n.value === v;\n  // A value without `type`, or with a `value`, is an object literal in ShExJ.\n  if (!('type' in v) || 'value' in v) return Term.isLiteral(n) && literalEquals(n, v);\n  return stemValueMatches(v, n);\n};\n\nconst failure = (cond: boolean, message: () => string): Option.Option<string> =>\n  cond ? Option.some(message()) : Option.none();\n\n// Built once: `checkNodeConstraint` runs it for every node constraint it evaluates.\nconst nodeKindFailure = Match.fn((nc: ShExJ.NodeConstraint, _n: Term.Term) => nc.nodeKind).pipe(\n  Match.withReturnType<Option.Option<string>>(),\n  Match.when('iri', (_kind, _nc, n) =>\n    failure(!Term.isNamedNode(n), () => `${n.key} is not an IRI`),\n  ),\n  Match.when('bnode', (_kind, _nc, n) =>\n    failure(!Term.isBlankNode(n), () => `${n.key} is not a blank node`),\n  ),\n  Match.when('literal', (_kind, _nc, n) =>\n    failure(!Term.isLiteral(n), () => `${n.key} is not a literal`),\n  ),\n  Match.when('nonliteral', (_kind, _nc, n) =>\n    failure(!Term.isResource(n), () => `${n.key} is not an IRI or blank node`),\n  ),\n  Match.orElse(() => Option.none()),\n);\n\n/** The numeric range facets: how each reads its limit, and which comparisons it accepts. */\nconst numericFacets: ReadonlyArray<\n  readonly [\n    name: string,\n    limit: (nc: ShExJ.NodeConstraint) => Option.Option<number>,\n    ok: (c: number) => boolean,\n  ]\n> = [\n  ['mininclusive', (nc) => Option.fromUndefinedOr(nc.mininclusive), (c) => c >= 0],\n  ['minexclusive', (nc) => Option.fromUndefinedOr(nc.minexclusive), (c) => c > 0],\n  ['maxinclusive', (nc) => Option.fromUndefinedOr(nc.maxinclusive), (c) => c <= 0],\n  ['maxexclusive', (nc) => Option.fromUndefinedOr(nc.maxexclusive), (c) => c < 0],\n];\n\n/** The datatype check of a node constraint with a `datatype`. */\nconst datatypeFailure = (n: Term.Term, datatype: string): Option.Option<string> => {\n  if (!Term.isLiteral(n)) return Option.some(`${n.key} is not a literal of datatype <${datatype}>`);\n  const actual = n.language !== '' ? RDF_LANG_STRING : n.datatype.value;\n  if (actual !== datatype && !(n.language !== '' && n.datatype.value === datatype))\n    return Option.some(`${n.key} does not have datatype <${datatype}>`);\n  return failure(\n    n.language === '' &&\n      (!Xsd.isValidLexical(datatype, n.value) ||\n        ((datatype === `${XSD}float` || datatype === `${XSD}double`) && n.value === '+INF')),\n    () => `${n.key} is not a valid <${datatype}>`,\n  );\n};\n\n/** The string facets (`length`, `minlength`, `maxlength`, `pattern`). */\nconst stringFacetFailure = (n: Term.Term, nc: ShExJ.NodeConstraint): Option.Option<string> => {\n  const lex = lexicalForm(n);\n  const len = codePointLength(lex);\n  if (nc.length !== undefined && len !== nc.length)\n    return Option.some(`${n.key} has length ${len}, expected ${nc.length}`);\n  if (nc.minlength !== undefined && len < nc.minlength)\n    return Option.some(`${n.key} has length ${len}, expected at least ${nc.minlength}`);\n  if (nc.maxlength !== undefined && len > nc.maxlength)\n    return Option.some(`${n.key} has length ${len}, expected at most ${nc.maxlength}`);\n  if (nc.pattern === undefined) return Option.none();\n  const compiled = getRegex(nc.pattern, nc.flags ?? '');\n  if (Result.isFailure(compiled))\n    return Option.some(`invalid pattern /${nc.pattern}/: ${compiled.failure}`);\n  const re = compiled.success;\n  re.lastIndex = 0;\n  return failure(!re.test(lex), () => `${n.key} does not match /${nc.pattern}/${nc.flags ?? ''}`);\n};\n\n/** The numeric range facets, in order: the first one the node violates. */\nconst numericFacetFailure = (n: Term.Term, nc: ShExJ.NodeConstraint): Option.Option<string> =>\n  Arr.findFirst(numericFacets, ([facet, limitOf, ok]) =>\n    Option.flatMap(limitOf(nc), (limit) =>\n      Option.match(numericValue(n), {\n        onNone: () => Option.some(`${n.key} is not numeric (${facet})`),\n        onSome: (v) =>\n          failure(!ok(compareWith(v, limit)), () => `${n.key} violates ${facet} ${limit}`),\n      }),\n    ),\n  );\n\n/** The digits facets (`totaldigits`, `fractiondigits`). */\nconst digitsFailure = (n: Term.Term, nc: ShExJ.NodeConstraint): Option.Option<string> => {\n  const parts =\n    Term.isLiteral(n) &&\n    MutableHashSet.has(decimalDerived, n.datatype.value) &&\n    Xsd.isValidLexical(n.datatype.value, n.value)\n      ? decimalParts(n.value)\n      : Option.none();\n  return Option.match(parts, {\n    onNone: () => Option.some(`${n.key} is not an xsd:decimal value`),\n    onSome: ({ int, frac }) => {\n      const total = Math.max(1, int.length + frac.length);\n      if (nc.totaldigits !== undefined && total > nc.totaldigits)\n        return Option.some(`${n.key} has ${total} digits, expected at most ${nc.totaldigits}`);\n      return failure(\n        nc.fractiondigits !== undefined && frac.length > nc.fractiondigits,\n        () => `${n.key} has ${frac.length} fraction digits, expected at most ${nc.fractiondigits}`,\n      );\n    },\n  });\n};\n\n/**\n * Evaluates a node constraint (without its semantic actions): none on\n * success, or the reason it fails.\n *\n * @internal\n */\nexport const checkNodeConstraint = (\n  n: Term.Term,\n  nc: ShExJ.NodeConstraint,\n): Option.Option<string> => {\n  const kindFailure = nodeKindFailure(nc, n);\n  if (Option.isSome(kindFailure)) return kindFailure;\n  if (nc.datatype !== undefined) {\n    const f = datatypeFailure(n, nc.datatype);\n    if (Option.isSome(f)) return f;\n  }\n  if (\n    nc.length !== undefined ||\n    nc.minlength !== undefined ||\n    nc.maxlength !== undefined ||\n    nc.pattern !== undefined\n  ) {\n    const f = stringFacetFailure(n, nc);\n    if (Option.isSome(f)) return f;\n  }\n  const numeric = numericFacetFailure(n, nc);\n  if (Option.isSome(numeric)) return numeric;\n  if (nc.totaldigits !== undefined || nc.fractiondigits !== undefined) {\n    const f = digitsFailure(n, nc);\n    if (Option.isSome(f)) return f;\n  }\n  return failure(\n    nc.values !== undefined && !nc.values.some((v) => valueMatches(n, v)),\n    () => `${n.key} is not in the value set`,\n  );\n};\n","/**\n * The ShEx validation engine: a synchronous evaluator of `satisfies` with\n * memoisation and coinductive (greatest fixed point) handling of recursive\n * references, partition search for triple expressions over bags of triple\n * constraint assignments, and ShEx 2.2 `EXTENDS` / `ABSTRACT` /\n * `RESTRICTS` semantics.\n *\n * @internal\n */\nimport * as Arr from 'effect/Array';\nimport * as Iterable from 'effect/Iterable';\nimport * as Match from 'effect/Match';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Result from 'effect/Result';\nimport * as Dataset from '../../Dataset.ts';\nimport * as Term from '../../Term.ts';\nimport type * as SemAct from '../SemAct.ts';\nimport type * as ShExJ from '../ShExJ.ts';\nimport { cardinality } from '../ShExJ.ts';\nimport type { SchemaIndex } from '../Structure.ts';\nimport { iterate } from './iterate.ts';\nimport { checkNodeConstraint } from './nodeConstraint.ts';\nimport * as Predicate from 'effect/Predicate';\n\n/** An arc of a node's neighbourhood. */\nexport interface Arc {\n  readonly triple: Term.Triple;\n  readonly dir: 'out' | 'in';\n  readonly predicate: string;\n  /** The node at the other end of the arc. */\n  readonly value: Term.Term;\n}\n\ninterface Target {\n  readonly label: string;\n  count: number;\n}\n\ninterface Ctx {\n  /** The neighbourhood subset being matched (none: the full neighbourhood). */\n  readonly arcs: Option.Option<ReadonlyArray<Arc>>;\n  readonly target: Option.Option<Target>;\n  readonly partitionClosed: boolean;\n}\n\nconst FULL: Ctx = { arcs: Option.none(), target: Option.none(), partitionClosed: false };\n\n/** None means success; a string is a failure reason. */\ntype Outcome = Option.Option<string>;\n\nconst success: Outcome = Option.none();\n\n/** The labels of the unfinished (recursive) checks an outcome depends on. */\ntype Deps = MutableHashSet.MutableHashSet<string>;\n\n/** Whether a triple expression was used, and the outcome of its semantic actions. */\ninterface Visit {\n  readonly used: boolean;\n  readonly r: Outcome;\n}\n\nconst unused: Visit = { used: false, r: success };\n\n/** A triple constraint of a shape and the bag position of its arcs. */\ntype LocalIndex = WeakMap<ShExJ.TripleConstraint, number>;\n\n/** An arc with the triple constraints it can be assigned to. */\ninterface Choice {\n  readonly arc: Arc;\n  readonly tcs: ReadonlyArray<ShExJ.TripleConstraint>;\n}\n\n/** An arc assigned to one of its triple constraints. */\ninterface Assigned {\n  readonly arc: Arc;\n  readonly tc: ShExJ.TripleConstraint;\n}\n\n/** A failure reason as the messages print it (`undefined` when there is none). */\nconst show = (o: Outcome): string => Option.getOrElse(o, () => 'undefined');\n\nconst bagKey = (bag: ReadonlyArray<number>): string => bag.join(',');\n\nconst dedupe = (bags: ReadonlyArray<ReadonlyArray<number>>): Array<ReadonlyArray<number>> =>\n  Arr.fromIterable(\n    MutableHashMap.values(MutableHashMap.fromIterable(Arr.map(bags, (b) => [bagKey(b), b]))),\n  );\n\n/** The first of the alternatives of a `ShapeOr` that `n` satisfies, preferring the target. */\nconst satisfiesOr = (\n  e: ShExJ.ShapeOr,\n  engine: Engine,\n  n: Term.Term,\n  ctx: Ctx,\n  deps: Deps,\n): Outcome => {\n  // When validating a descendant of a target shape, prefer an\n  // alternative that goes through the target.\n  let first: Outcome = Option.none();\n  let passed = false;\n  const throughTarget = Arr.some(e.shapeExprs, (c) => {\n    const before = Option.match(ctx.target, { onNone: () => 0, onSome: (t) => t.count });\n    const r = engine.satisfies(n, c, ctx, deps, Option.none());\n    if (Option.isNone(r)) {\n      if (Option.match(ctx.target, { onNone: () => true, onSome: (t) => t.count > before })) {\n        return true;\n      }\n      passed = true;\n    } else if (Option.isNone(first)) first = r;\n    return false;\n  });\n  return throughTarget || passed\n    ? success\n    : Option.some(`${n.key} matches none of the alternatives (${show(first)})`);\n};\n\n// Built once: `satisfies` runs it for every shape expression of every node it checks.\nconst satisfiesExpr: (\n  e: ShExJ.ShapeExpr,\n  engine: Engine,\n  n: Term.Term,\n  ctx: Ctx,\n  deps: Deps,\n  declLabel: Option.Option<string>,\n) => Outcome = Match.fn(\n  (\n    e: ShExJ.ShapeExpr,\n    _engine: Engine,\n    _n: Term.Term,\n    _ctx: Ctx,\n    _deps: Deps,\n    _declLabel: Option.Option<string>,\n  ) => e,\n).pipe(\n  Match.withReturnType<Outcome>(),\n  Match.when({ type: 'ShapeAnd' }, (e, _e, engine, n, ctx, deps) =>\n    Arr.findFirst(e.shapeExprs, (c) => engine.satisfies(n, c, ctx, deps, Option.none())),\n  ),\n  Match.when({ type: 'ShapeOr' }, (e, _e, engine, n, ctx, deps) =>\n    satisfiesOr(e, engine, n, ctx, deps),\n  ),\n  Match.when({ type: 'ShapeNot' }, (e, _e, engine, n, ctx, deps) =>\n    Option.isNone(engine.satisfies(n, e.shapeExpr, ctx, deps, Option.none()))\n      ? Option.some(`${n.key} matches a negated shape expression`)\n      : success,\n  ),\n  Match.when({ type: 'NodeConstraint' }, (e, _e, engine, n) => {\n    const r = checkNodeConstraint(n, e);\n    if (Option.isSome(r)) return r;\n    return engine.runSemActs(e.semActs, { site: 'nodeConstraint', node: n });\n  }),\n  Match.when({ type: 'ShapeExternal' }, (_e, _input, engine, n, ctx, deps, declLabel) =>\n    Option.match(\n      Option.flatMap(declLabel, (l) => MutableHashMap.get(engine.externs, l)),\n      {\n        onNone: () =>\n          Option.some(\n            `no definition available for external shape ${Option.getOrElse(declLabel, () => 'undefined')}`,\n          ),\n        onSome: (ext) => engine.satisfies(n, ext.shapeExpr, ctx, deps, Option.none()),\n      },\n    ),\n  ),\n  Match.when({ type: 'Shape' }, (e, _e, engine, n, ctx, deps) =>\n    engine.matchesShape(n, e, ctx, deps),\n  ),\n  Match.exhaustive,\n);\n\n/** Appends to `out` the triple constraints of `tcs` it does not have yet. */\nconst addAll = (\n  out: Array<ShExJ.TripleConstraint>,\n  tcs: ReadonlyArray<ShExJ.TripleConstraint>,\n): void =>\n  tcs.forEach((tc) => {\n    if (!out.includes(tc)) out.push(tc);\n  });\n\n// Built once: `extensionTcs` runs it for every shape expression an extension refers to.\nconst extensionTcsOf: (\n  e: ShExJ.ShapeExpr,\n  engine: Engine,\n  out: Array<ShExJ.TripleConstraint>,\n  seen: MutableHashSet.MutableHashSet<string>,\n) => void = Match.fn(\n  (\n    e: ShExJ.ShapeExpr,\n    _engine: Engine,\n    _out: Array<ShExJ.TripleConstraint>,\n    _seen: MutableHashSet.MutableHashSet<string>,\n  ) => e,\n).pipe(\n  Match.when({ type: 'Shape' }, (e, _e, engine, out, seen) => {\n    addAll(out, engine.localTcs(e));\n    e.extends?.forEach((x) => engine.extensionTcs(x, out, seen));\n  }),\n  Match.when({ type: Match.is('ShapeAnd', 'ShapeOr') }, (e, _e, engine, out, seen) => {\n    e.shapeExprs.forEach((c) => engine.extensionTcs(c, out, seen));\n  }),\n  Match.when({ type: 'ShapeNot' }, (e, _e, engine, out, seen) => {\n    engine.extensionTcs(e.shapeExpr, out, seen);\n  }),\n  Match.orElse(() => undefined),\n);\n\n/** The arcs of `quads` in one direction, each triple once. */\nconst arcsOf = (\n  quads: Iterable<Term.Quad>,\n  dir: Arc['dir'],\n  valueOf: (q: Term.Quad) => Term.Term,\n): Array<Arc> => {\n  const seen = MutableHashSet.empty<string>();\n  return Arr.filterMap(Arr.fromIterable(quads), (q) => {\n    const t = Term.triple(q.subject, q.predicate, q.object);\n    if (MutableHashSet.has(seen, t.key)) return Result.failVoid;\n    MutableHashSet.add(seen, t.key);\n    return Result.succeed({ triple: t, dir, predicate: q.predicate.value, value: valueOf(q) });\n  });\n};\n\nexport class Engine {\n  private readonly cache = MutableHashMap.empty<string, Outcome>();\n  private readonly inProgress = MutableHashSet.empty<string>();\n  private readonly neighbourhoods = MutableHashMap.empty<string, ReadonlyArray<Arc>>();\n  private readonly shapeTcs = new WeakMap<object, ReadonlyArray<ShExJ.TripleConstraint>>();\n\n  readonly index: SchemaIndex;\n  readonly dataset: Dataset.Dataset;\n  readonly handler: SemAct.Handler;\n  readonly externs: MutableHashMap.MutableHashMap<string, ShExJ.ShapeDecl>;\n  constructor(\n    index: SchemaIndex,\n    dataset: Dataset.Dataset,\n    handler: SemAct.Handler,\n    externs: MutableHashMap.MutableHashMap<string, ShExJ.ShapeDecl>,\n  ) {\n    this.index = index;\n    this.dataset = dataset;\n    this.handler = handler;\n    this.externs = externs;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Data access\n  // ---------------------------------------------------------------------------\n\n  neighbourhood(n: Term.Term): ReadonlyArray<Arc> {\n    return Option.getOrElse(MutableHashMap.get(this.neighbourhoods, n.key), () => {\n      const arcs = [\n        ...(Term.isResource(n) || Term.isTriple(n)\n          ? arcsOf(Dataset.match(this.dataset, { subject: n }), 'out', (q) => q.object)\n          : []),\n        ...(!Term.isVariable(n) && !Term.isDefaultGraph(n)\n          ? arcsOf(Dataset.match(this.dataset, { object: n }), 'in', (q) => q.subject)\n          : []),\n      ];\n      MutableHashMap.set(this.neighbourhoods, n.key, arcs);\n      return arcs;\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Semantic actions\n  // ---------------------------------------------------------------------------\n\n  runSemActs(acts: ReadonlyArray<ShExJ.SemAct> = [], context: SemAct.SemActContext): Outcome {\n    return Arr.findFirst(acts, (act) => {\n      const r = this.handler(act, context);\n      return Option.isSome(r) && !r.value\n        ? Option.some(`semantic action <${act.name}> failed`)\n        : Option.none();\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Shape labels\n  // ---------------------------------------------------------------------------\n\n  /** Validates `n` against a shape label (or a descendant) on its full neighbourhood. */\n  validateLabel(n: Term.Term, label: string, deps: Deps): Outcome {\n    return this.memoized(`${n.key}\\u0000${label}`, deps, (local) =>\n      this.satisfiesDescendant(n, label, local),\n    );\n  }\n\n  /** Validates `n` against the start shape expression. */\n  validateStart(n: Term.Term, deps: Deps): Outcome {\n    const start = this.index.schema.start;\n    if (start === undefined) return Option.some('the schema has no start shape');\n    return this.memoized(`${n.key}\\u0000\\u0000START`, deps, (local) =>\n      this.satisfies(n, start, FULL, local, Option.none()),\n    );\n  }\n\n  /**\n   * Runs `check` once per `key` (a node and shape pair), caching its outcome.\n   * A key already in progress is a recursive reference: it succeeds for now\n   * and is reported to the caller in `deps`, and an outcome is cached only\n   * once it no longer depends on an unfinished key.\n   */\n  private memoized(key: string, deps: Deps, check: (local: Deps) => Outcome): Outcome {\n    const cached = MutableHashMap.get(this.cache, key);\n    if (Option.isSome(cached)) return cached.value;\n    if (MutableHashSet.has(this.inProgress, key)) {\n      MutableHashSet.add(deps, key);\n      return success;\n    }\n    MutableHashSet.add(this.inProgress, key);\n    const local = MutableHashSet.empty<string>();\n    const result = Result.try(() => check(local));\n    MutableHashSet.remove(this.inProgress, key);\n    if (Result.isFailure(result)) throw result.failure;\n    const r = result.success;\n    MutableHashSet.remove(local, key);\n    if (Option.isSome(r) || MutableHashSet.size(local) === 0)\n      MutableHashMap.set(this.cache, key, r);\n    Iterable.forEach(local, (d) => MutableHashSet.add(deps, d));\n    return r;\n  }\n\n  private satisfiesDescendant(n: Term.Term, label: string, deps: Deps): Outcome {\n    const decl = this.index.shapes.get(label);\n    if (decl === undefined) return Option.some(`unknown shape ${label}`);\n    const candidates = [label, ...(this.index.descendants.get(label) ?? [])].filter(\n      (l) => this.index.shapes.get(l)?.abstract !== true,\n    );\n    if (Arr.isReadonlyArrayEmpty(candidates))\n      return Option.some(`${label} is abstract and has no concrete extension`);\n    let first: Outcome = Option.none();\n    const found = Arr.some(candidates, (c) => {\n      const target: Option.Option<Target> =\n        c === label ? Option.none() : Option.some({ label, count: 0 });\n      const r = this.satisfiesDecl(\n        n,\n        c,\n        { arcs: Option.none(), target, partitionClosed: false },\n        deps,\n      );\n      if (\n        Option.isNone(r) &&\n        Option.match(target, { onNone: () => true, onSome: (t) => t.count > 0 })\n      )\n        return true;\n      if (Option.isNone(first))\n        first = Option.orElse(r, () =>\n          Option.some(`${n.key} matches ${c} but not through ${label}`),\n        );\n      return false;\n    });\n    return found ? success : first;\n  }\n\n  private satisfiesDecl(n: Term.Term, label: string, ctx: Ctx, deps: Deps): Outcome {\n    const decl = this.index.shapes.get(label);\n    if (decl === undefined) return Option.some(`unknown shape ${label}`);\n    return Arr.findFirst([...(decl.restricts ?? []), decl.shapeExpr], (e) =>\n      this.satisfies(n, e, ctx, deps, Option.some(label)),\n    );\n  }\n\n  // ---------------------------------------------------------------------------\n  // Shape expressions\n  // ---------------------------------------------------------------------------\n\n  satisfies(\n    n: Term.Term,\n    e: ShExJ.ShapeExprOrRef,\n    ctx: Ctx,\n    deps: Deps,\n    declLabel: Option.Option<string>,\n  ): Outcome {\n    if (Predicate.isString(e)) {\n      if (Option.isNone(ctx.arcs)) return this.validateLabel(n, e, deps);\n      const r = this.satisfiesDecl(n, e, ctx, deps);\n      if (Option.isNone(r) && Option.isSome(ctx.target) && ctx.target.value.label === e)\n        ctx.target.value.count++;\n      return r;\n    }\n    return satisfiesExpr(e, this, n, ctx, deps, declLabel);\n  }\n\n  // ---------------------------------------------------------------------------\n  // Triple constraints\n  // ---------------------------------------------------------------------------\n\n  /** The triple constraints of a triple expression (through inclusions). */\n  private tcsOf(\n    te: ShExJ.TripleExprOrRef,\n    out: Array<ShExJ.TripleConstraint>,\n    seen: MutableHashSet.MutableHashSet<string>,\n  ): void {\n    if (Predicate.isString(te)) {\n      if (MutableHashSet.has(seen, te)) return;\n      MutableHashSet.add(seen, te);\n      const included = this.index.tripleExprs.get(te);\n      if (included !== undefined) this.tcsOf(included, out, seen);\n      return;\n    }\n    if (te.type === 'TripleConstraint') {\n      if (!out.includes(te)) out.push(te);\n    } else te.expressions.forEach((c) => this.tcsOf(c, out, seen));\n  }\n\n  localTcs(shape: ShExJ.Shape): ReadonlyArray<ShExJ.TripleConstraint> {\n    const cached = this.shapeTcs.get(shape);\n    if (cached !== undefined) return cached;\n    const out: Array<ShExJ.TripleConstraint> = [];\n    if (shape.expression !== undefined) this.tcsOf(shape.expression, out, MutableHashSet.empty());\n    this.shapeTcs.set(shape, out);\n    return out;\n  }\n\n  /** All triple constraints of the shapes an extension refers to (recursively). */\n  extensionTcs(\n    e: ShExJ.ShapeExprOrRef,\n    out: Array<ShExJ.TripleConstraint>,\n    seen: MutableHashSet.MutableHashSet<string>,\n  ): void {\n    if (Predicate.isString(e)) {\n      if (MutableHashSet.has(seen, e)) return;\n      MutableHashSet.add(seen, e);\n      const decl = this.index.shapes.get(e);\n      if (decl !== undefined) {\n        decl.restricts?.forEach((r) => this.extensionTcs(r, out, seen));\n        this.extensionTcs(decl.shapeExpr, out, seen);\n      }\n      return;\n    }\n    extensionTcsOf(e, this, out, seen);\n  }\n\n  matchesShape(n: Term.Term, shape: ShExJ.Shape, ctx: Ctx, deps: Deps): Outcome {\n    const arcs = Option.getOrElse(ctx.arcs, () => this.neighbourhood(n));\n    const closed = shape.closed === true || ctx.partitionClosed;\n    const local = this.localTcs(shape);\n    const extensions = shape.extends ?? [];\n    const extTcs = Arr.map(extensions, (x) => {\n      const out: Array<ShExJ.TripleConstraint> = [];\n      this.extensionTcs(x, out, MutableHashSet.empty());\n      return out;\n    });\n    const all = Arr.dedupeWith([...local, ...Arr.flatten(extTcs)], (a, b) => a === b);\n    const localIndex: LocalIndex = new WeakMap(Arr.map(local, (tc, i) => [tc, i] as const));\n    const extGroupsOf = new WeakMap<ShExJ.TripleConstraint, Array<number>>();\n    extTcs.forEach((group, i) =>\n      group.forEach((tc) => {\n        if (localIndex.has(tc)) return;\n        const g = extGroupsOf.get(tc);\n        if (g === undefined) extGroupsOf.set(tc, [i]);\n        else g.push(i);\n      }),\n    );\n    const byPredicate = Arr.groupBy(\n      all,\n      (tc) => `${tc.inverse === true ? 'in' : 'out'} ${tc.predicate}`,\n    );\n    const extra = MutableHashSet.fromIterable(shape.extra ?? []);\n\n    // Candidate triple constraints of every arc.\n    const choices: Array<Choice> = [];\n    const valueCache = MutableHashMap.empty<string, Outcome>();\n    const valueOutcome = (\n      tc: ShExJ.TripleConstraint,\n      valueExpr: ShExJ.ShapeExprOrRef,\n      arc: Arc,\n    ) => {\n      const ck = `${all.indexOf(tc)} ${arc.value.key}`;\n      return Option.getOrElse(MutableHashMap.get(valueCache, ck), () => {\n        const r = this.satisfies(arc.value, valueExpr, FULL, deps, Option.none());\n        MutableHashMap.set(valueCache, ck, r);\n        return r;\n      });\n    };\n    const arcFailure = Arr.findFirst(arcs, (arc): Outcome => {\n      const tcs = byPredicate[`${arc.dir} ${arc.predicate}`];\n      if (tcs === undefined) {\n        return arc.dir === 'out' && closed\n          ? Option.some(`closed shape does not allow ${arc.triple.key}`)\n          : success;\n      }\n      let firstReason: Outcome = Option.none();\n      const ok = Arr.filter(tcs, (tc) => {\n        if (tc.valueExpr === undefined) return true;\n        const r = valueOutcome(tc, tc.valueExpr, arc);\n        if (Option.isNone(r)) return true;\n        if (Option.isNone(firstReason)) firstReason = r;\n        return false;\n      });\n      if (Arr.isReadonlyArrayEmpty(ok)) {\n        return MutableHashSet.has(extra, arc.predicate)\n          ? success\n          : Option.some(\n              `${arc.triple.key} does not match its triple constraint: ${show(firstReason)}`,\n            );\n      }\n      choices.push({ arc, tcs: ok });\n      return success;\n    });\n    if (Option.isSome(arcFailure)) return arcFailure;\n\n    const hasTcSemActs = local.some((tc) => tc.semActs !== undefined);\n    const tried = MutableHashSet.empty<string>();\n    // Filled in order by `search`, so it is dense once every arc is assigned.\n    const assignment: Array<Assigned> = [];\n    let firstFailure: Outcome = Option.none();\n\n    const tryAssignment = (): Outcome => {\n      const counts = Array.from({ length: local.length }, () => 0);\n      const partitions: Array<Array<Arc>> = extensions.map(() => []);\n      const keyParts = Arr.filterMap(assignment, ({ arc, tc }) => {\n        const li = localIndex.get(tc);\n        if (li !== undefined) {\n          counts[li] = (counts[li] ?? 0) + 1;\n          return hasTcSemActs ? Result.succeed(`L${li}`) : Result.failVoid;\n        }\n        const groups = extGroupsOf.get(tc) ?? [];\n        groups.forEach((g) => partitions[g]?.push(arc));\n        return Result.succeed(`E${groups.join('.')}`);\n      });\n      const key = `${counts.join(',')}|${keyParts.join('-')}`;\n      if (MutableHashSet.has(tried, key)) return Option.some('duplicate partition');\n      MutableHashSet.add(tried, key);\n      // Local triple expression.\n      if (shape.expression !== undefined) {\n        if (!this.matchBag(shape.expression, counts, localIndex)) {\n          return Option.some(`the triples of ${n.key} do not match the triple expression`);\n        }\n      } else if (counts.some((c) => c > 0)) return Option.some('unexpected triples');\n      // Extensions.\n      const extFailure = Arr.findFirst(extensions, (x, i) =>\n        this.satisfies(\n          n,\n          x,\n          { arcs: Option.some(partitions[i] ?? []), target: ctx.target, partitionClosed: closed },\n          deps,\n          Option.none(),\n        ),\n      );\n      if (Option.isSome(extFailure)) return extFailure;\n      // Semantic actions.\n      const matched = Arr.map(assignment, ({ arc }) => arc.triple);\n      const tcFailure = Arr.findFirst(assignment, ({ arc, tc }) =>\n        localIndex.has(tc)\n          ? this.runSemActs(tc.semActs, { site: 'tripleConstraint', node: n, triple: arc.triple })\n          : success,\n      );\n      if (Option.isSome(tcFailure)) return tcFailure;\n      if (shape.expression !== undefined) {\n        const r = this.groupSemActs(shape.expression, counts, localIndex, n, matched);\n        if (Option.isSome(r)) return r;\n      }\n      return this.runSemActs(shape.semActs, { site: 'shape', node: n, triples: matched });\n    };\n\n    const search = (i: number): boolean => {\n      const choice = choices[i];\n      if (choice === undefined) {\n        const r = tryAssignment();\n        if (Option.isNone(r)) return true;\n        if (r.value !== 'duplicate partition' && Option.isNone(firstFailure)) firstFailure = r;\n        return false;\n      }\n      return Arr.some(choice.tcs, (tc) => {\n        assignment[i] = { arc: choice.arc, tc };\n        return search(i + 1);\n      });\n    };\n    if (search(0)) return success;\n    return Option.orElse(firstFailure, () => Option.some(`${n.key} does not match the shape`));\n  }\n\n  // ---------------------------------------------------------------------------\n  // Triple expression matching on bags\n  // ---------------------------------------------------------------------------\n\n  /** Whether the bag of triple constraint counts matches the triple expression. */\n  private matchBag(\n    te: ShExJ.TripleExprOrRef,\n    counts: ReadonlyArray<number>,\n    localIndex: LocalIndex,\n  ): boolean {\n    const zero = bagKey(counts.map(() => 0));\n    return this.step(te, counts, localIndex, 0).some((b) => bagKey(b) === zero);\n  }\n\n  private resolveTe(te: ShExJ.TripleExprOrRef): Option.Option<ShExJ.TripleExpr> {\n    return Predicate.isString(te)\n      ? Option.fromUndefinedOr(this.index.tripleExprs.get(te))\n      : Option.some(te);\n  }\n\n  /** All bags remaining after `te` (with its cardinality) consumes part of `bag`. */\n  private step(\n    te0: ShExJ.TripleExprOrRef,\n    bag: ReadonlyArray<number>,\n    localIndex: LocalIndex,\n    depth: number,\n  ): Array<ReadonlyArray<number>> {\n    const resolved = this.resolveTe(te0);\n    if (Option.isNone(resolved) || depth > 64) return [];\n    const te = resolved.value;\n    const { min, max } = cardinality(te);\n    if (te.type === 'TripleConstraint') {\n      const k = localIndex.get(te);\n      if (k === undefined) return min === 0 ? [bag] : [];\n      const avail = bag[k] ?? 0;\n      const hi = Math.min(max, avail);\n      return hi < min\n        ? []\n        : Arr.map(Arr.range(min, hi), (c) => {\n            const nb = bag.slice();\n            nb[k] = avail - c;\n            return nb;\n          });\n    }\n    const once = (b: ReadonlyArray<number>): Array<ReadonlyArray<number>> =>\n      te.type === 'OneOf'\n        ? dedupe(te.expressions.flatMap((x) => this.step(x, b, localIndex, depth + 1)))\n        : Arr.reduce(te.expressions, [b], (sets: Array<ReadonlyArray<number>>, x) =>\n            Arr.isReadonlyArrayEmpty(sets)\n              ? sets\n              : dedupe(sets.flatMap((s) => this.step(x, s, localIndex, depth + 1))),\n          );\n    const result = MutableHashMap.empty<string, ReadonlyArray<number>>();\n    if (min === 0) MutableHashMap.set(result, bagKey(bag), bag);\n    iterate({ i: 1, frontier: [bag] }, ({ i, frontier }) => {\n      if (i > max || Arr.isReadonlyArrayEmpty(frontier)) return Option.none();\n      const next = dedupe(frontier.flatMap(once));\n      if (i < min) return Option.some({ i: i + 1, frontier: next });\n      const fresh = Arr.filter(next, (b) => {\n        const k = bagKey(b);\n        if (MutableHashMap.has(result, k)) return false;\n        MutableHashMap.set(result, k, b);\n        return true;\n      });\n      return Option.some({ i: i + 1, frontier: fresh });\n    });\n    return Arr.fromIterable(MutableHashMap.values(result));\n  }\n\n  /** Runs the semantic actions of the groups (EachOf/OneOf) that took part in a match. */\n  private groupSemActs(\n    te0: ShExJ.TripleExprOrRef,\n    counts: ReadonlyArray<number>,\n    localIndex: LocalIndex,\n    n: Term.Term,\n    triples: ReadonlyArray<Term.Triple>,\n  ): Outcome {\n    const visit = (\n      node: ShExJ.TripleExprOrRef,\n      seen: MutableHashSet.MutableHashSet<string>,\n    ): Visit => {\n      if (Predicate.isString(node)) {\n        if (MutableHashSet.has(seen, node)) return unused;\n        MutableHashSet.add(seen, node);\n      }\n      const resolved = this.resolveTe(node);\n      if (Option.isNone(resolved)) return unused;\n      const te = resolved.value;\n      if (te.type === 'TripleConstraint') {\n        const k = localIndex.get(te);\n        return { used: k !== undefined && (counts[k] ?? 0) > 0, r: success };\n      }\n      let used = false;\n      const failed = Arr.findFirst(te.expressions, (x) => {\n        const v = visit(x, seen);\n        if (Option.isSome(v.r)) return Option.some(v);\n        used ||= v.used;\n        return Option.none();\n      });\n      if (Option.isSome(failed)) return failed.value;\n      if (used || cardinality(te).min > 0) {\n        const r = this.runSemActs(te.semActs, { site: 'tripleExpression', node: n, triples });\n        if (Option.isSome(r)) return { used, r };\n      }\n      return { used, r: success };\n    };\n    return visit(te0, MutableHashSet.empty()).r;\n  }\n}\n","/**\n * ShEx validation: checks node/shape associations of a shape map against an\n * RDF dataset per the ShEx 2.1 semantics (with the ShEx 2.2 `EXTENDS`,\n * `ABSTRACT` and `RESTRICTS` extensions).\n *\n * Recursive references are evaluated coinductively (the maximal typing) and\n * memoised; schemas are checked for the structural requirements, which\n * guarantee a stratification so that negation is well-defined. Imports are\n * loaded through the `SchemaLoader` service and semantic actions are\n * dispatched to the `SemAct.SemActHandler` service.\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as Context from 'effect/Context';\nimport * as Effect from 'effect/Effect';\nimport * as Layer from 'effect/Layer';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Schema from 'effect/Schema';\nimport type * as SchemaAST from 'effect/SchemaAST';\nimport * as SchemaIssue from 'effect/SchemaIssue';\nimport * as SchemaTransformation from 'effect/SchemaTransformation';\nimport * as Dataset from '../Dataset.ts';\nimport type * as Term from '../Term.ts';\nimport { Engine } from './internal/engine.ts';\nimport * as SemAct from './SemAct.ts';\nimport { ShExImportError, type ShExStructureError, ShExValidationError } from './ShExError.ts';\nimport type * as ShExJ from './ShExJ.ts';\nimport * as ShapeMap from './ShapeMap.ts';\nimport * as Structure from './Structure.ts';\n\n// -----------------------------------------------------------------------------\n// Services\n// -----------------------------------------------------------------------------\n\n/**\n * Loads imported schemas by IRI.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Loader {\n  readonly load: (iri: string) => Effect.Effect<ShExJ.Schema, ShExImportError>;\n}\n\n/**\n * The service used to resolve `IMPORT`s. The default loader fails for every\n * import.\n *\n * @since 0.1.0\n * @category services\n */\nexport const SchemaLoader: Context.Reference<Loader> = Context.Reference<Loader>(\n  '@thomasfosterau/effect-rdf/shex/SchemaLoader',\n  {\n    defaultValue: () => ({\n      load: (iri) =>\n        Effect.fail(new ShExImportError({ iri, message: 'no SchemaLoader is configured' })),\n    }),\n  },\n);\n\n/**\n * A layer providing a `SchemaLoader`.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const loaderLayer = (loader: Loader): Layer.Layer<never> =>\n  Layer.succeed(SchemaLoader, loader);\n\n/**\n * A loader serving schemas from a map of IRIs (useful for tests and bundled\n * schemas).\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const loaderFromRecord = (schemas: Readonly<Record<string, ShExJ.Schema>>): Loader => ({\n  load: (iri) => {\n    const s = schemas[iri];\n    return s === undefined\n      ? Effect.fail(new ShExImportError({ iri, message: 'unknown schema' }))\n      : Effect.succeed(s);\n  },\n});\n\n// -----------------------------------------------------------------------------\n// Models\n// -----------------------------------------------------------------------------\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Options {\n  /**\n   * Definitions for shapes declared `EXTERNAL`, given as a schema whose\n   * declarations share the external labels.\n   */\n  readonly externalShapes?: ShExJ.Schema | undefined;\n  /**\n   * Code for semantic actions written without code (`%<name>%`), matched by\n   * action name.\n   */\n  readonly externalSemActs?: ReadonlyArray<ShExJ.SemAct> | undefined;\n  /** The IRI of the schema itself, so that circular imports of it are ignored. */\n  readonly schemaIri?: string | undefined;\n}\n\n/**\n * The validation result of one node/shape association.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ShapeResult {\n  readonly node: Term.GroundTerm;\n  readonly shape: ShapeMap.ShapeSelector;\n  readonly status: 'conformant' | 'nonconformant';\n  /** Why the node does not conform. */\n  readonly reason?: string;\n}\n\n/**\n * A validation report: one result per association of the (fixed) shape map.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ValidationReport {\n  readonly results: ReadonlyArray<ShapeResult>;\n  /** Whether every association conforms. */\n  readonly conformant: boolean;\n}\n\n/**\n * A validator for one (import-resolved, structurally checked) schema.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Validator {\n  /** The schema with the declarations of its imports merged in. */\n  readonly schema: ShExJ.Schema;\n  readonly index: Structure.SchemaIndex;\n  /** Validates a fixed or query shape map against a dataset. */\n  readonly validate: (\n    dataset: Dataset.Dataset,\n    shapeMap: ShapeMap.QueryShapeMap,\n  ) => Effect.Effect<ValidationReport, ShExValidationError>;\n}\n\n// -----------------------------------------------------------------------------\n// Imports\n// -----------------------------------------------------------------------------\n\n/**\n * Loads the imports of a schema (transitively, each IRI once) and merges\n * their declarations into it. The importing schema's `start` and `startActs`\n * are kept.\n *\n * @since 0.1.0\n * @category imports\n */\nexport const resolveImports = Effect.fnUntraced(function* (\n  schema: ShExJ.Schema,\n  schemaIri?: string,\n) {\n  if (schema.imports === undefined || Arr.isReadonlyArrayEmpty(schema.imports)) return schema;\n  const loader = yield* SchemaLoader;\n  const seen = MutableHashSet.fromIterable(schemaIri === undefined ? [] : [schemaIri]);\n  const shapes: Array<ShExJ.ShapeDecl> = [...(schema.shapes ?? [])];\n  const labels = MutableHashSet.fromIterable(shapes.map((s) => s.id));\n  // Breadth first, each IRI once: the queue holds the imports still to load.\n  const load = (queue: ReadonlyArray<string>): Effect.Effect<void, ShExImportError> =>\n    Arr.match(queue, {\n      onEmpty: () => Effect.void,\n      onNonEmpty: ([iri, ...rest]) => {\n        if (MutableHashSet.has(seen, iri)) return load(rest);\n        MutableHashSet.add(seen, iri);\n        return Effect.flatMap(loader.load(iri), (imported) => {\n          imported.shapes?.forEach((d) => {\n            if (MutableHashSet.has(labels, d.id)) return;\n            MutableHashSet.add(labels, d.id);\n            shapes.push(d);\n          });\n          return load([...rest, ...(imported.imports ?? [])]);\n        });\n      },\n    });\n  yield* load(schema.imports);\n  const { imports: _, ...rest } = schema;\n  // SAFETY: dropping the optional `imports` (and re-adding `shapes` only when non-empty) leaves a\n  // valid `ShExJ.Schema`; the spread just loses the nominal type.\n  return Arr.isReadonlyArrayNonEmpty(shapes) ? { ...rest, shapes } : rest;\n});\n\n// -----------------------------------------------------------------------------\n// Validation\n// -----------------------------------------------------------------------------\n\nconst isFixedMap = (map: ShapeMap.QueryShapeMap): map is ShapeMap.FixedShapeMap =>\n  map.every((a) => !Predicate.isTagged(a.node, 'TriplePattern'));\n\n/**\n * Prepares a validator: loads imports through `SchemaLoader`, checks the\n * structural requirements and indexes the schema. Semantic actions are\n * dispatched to the `SemAct.SemActHandler` in scope when the validator is\n * made.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = Effect.fnUntraced(function* (schema: ShExJ.Schema, options: Options = {}) {\n  const resolved = yield* resolveImports(schema, options.schemaIri);\n  yield* Structure.check(resolved);\n  const index = Structure.makeIndex(resolved);\n  const baseHandler = yield* SemAct.SemActHandler;\n  const handler =\n    options.externalSemActs === undefined\n      ? baseHandler\n      : SemAct.withExternalCode(baseHandler, options.externalSemActs);\n  const externs = MutableHashMap.fromIterable(\n    Arr.map(options.externalShapes?.shapes ?? [], (d) => [d.id, d] as const),\n  );\n\n  const validate = (\n    dataset: Dataset.Dataset,\n    shapeMap: ShapeMap.QueryShapeMap,\n  ): Effect.Effect<ValidationReport, ShExValidationError> =>\n    Effect.suspend(() => {\n      const fixed = isFixedMap(shapeMap) ? shapeMap : ShapeMap.resolve(shapeMap, dataset);\n      const invalid = Arr.findFirst(fixed, (a) =>\n        ShapeMap.isStart(a.shape)\n          ? resolved.start === undefined\n            ? Option.some('the shape map uses START but the schema has no start')\n            : Option.none()\n          : index.shapes.has(a.shape)\n            ? Option.none()\n            : Option.some(`the schema does not declare shape ${a.shape}`),\n      );\n      if (Option.isSome(invalid)) {\n        return Effect.fail(new ShExValidationError({ message: invalid.value }));\n      }\n      const engine = new Engine(index, dataset, handler, externs);\n      const startFailure = engine.runSemActs(resolved.startActs, {\n        site: 'start',\n        node: undefined,\n      });\n      const results: Array<ShapeResult> = fixed.map((a) => {\n        const reason = Option.orElse(startFailure, () =>\n          ShapeMap.isStart(a.shape)\n            ? engine.validateStart(a.node, MutableHashSet.empty())\n            : engine.validateLabel(a.node, a.shape, MutableHashSet.empty()),\n        );\n        return Option.match(reason, {\n          onNone: (): ShapeResult => ({ node: a.node, shape: a.shape, status: 'conformant' }),\n          onSome: (why): ShapeResult => ({\n            node: a.node,\n            shape: a.shape,\n            status: 'nonconformant',\n            reason: why,\n          }),\n        });\n      });\n      const conformant = results.every((r) => r.status === 'conformant');\n      return Effect.as(\n        Effect.annotateCurrentSpan({\n          'shex.associations': results.length,\n          'shex.nonconformant': results.filter((r) => r.status === 'nonconformant').length,\n          'shex.conformant': conformant,\n        }),\n        { results, conformant },\n      );\n    }).pipe(Effect.withSpan('ShEx.validate'));\n\n  // SAFETY: `satisfies Validator` checks the literal; the assertion only widens it to the\n  // interface.\n  return { schema: resolved, index, validate } satisfies Validator;\n});\n\n/**\n * Validates a shape map against a dataset with a schema.\n *\n * @since 0.1.0\n * @category validation\n */\nexport const validate = (\n  dataset: Dataset.Dataset,\n  schema: ShExJ.Schema,\n  shapeMap: ShapeMap.QueryShapeMap,\n  options: Options = {},\n): Effect.Effect<ValidationReport, ShExValidationError | ShExImportError | ShExStructureError> =>\n  Effect.flatMap(make(schema, options), (v) => v.validate(dataset, shapeMap));\n\n/**\n * Validates a single node against a shape label (or `START`).\n *\n * @since 0.1.0\n * @category validation\n */\nexport const validateNode = (\n  dataset: Dataset.Dataset,\n  schema: ShExJ.Schema,\n  node: Term.GroundTerm,\n  shape: ShapeMap.ShapeSelector,\n  options: Options = {},\n): Effect.Effect<ShapeResult, ShExValidationError | ShExImportError | ShExStructureError> =>\n  // A one-association shape map yields exactly one result.\n  Effect.map(validate(dataset, schema, [{ node, shape }], options), (r) =>\n    Arr.getUnsafe(r.results, 0),\n  );\n\n// -----------------------------------------------------------------------------\n// Schema integration\n// -----------------------------------------------------------------------------\n\n/**\n * Formats a shape result on one line: `<node>@<shape>` and, when it does\n * not conform, why.\n *\n * @since 0.1.0\n * @category formatting\n */\nexport const formatResult = (result: ShapeResult): string => {\n  const label = ShapeMap.isStart(result.shape) ? 'START' : `<${result.shape}>`;\n  const association = `${result.node.key}@${label}`;\n  return result.reason === undefined\n    ? `${association}: ${result.status}`\n    : `${association}: ${result.reason}`;\n};\n\n// One `InvalidValue` per nonconformant association, annotated with its message and result.\nconst nonconformance = (\n  failing: Arr.NonEmptyReadonlyArray<ShapeResult>,\n  data: Dataset.Dataset,\n  options: SchemaAST.ParseOptions,\n): SchemaIssue.Issue => {\n  const issues = Arr.map(\n    failing,\n    (result) =>\n      new SchemaIssue.InvalidValue({ message: formatResult(result), result }, result, options),\n  );\n  return new SchemaIssue.Composite(Dataset.DatasetSchema.ast, issues, data);\n};\n\n/**\n * A `Schema` that accepts a `Dataset` only if every association of the\n * shape map (or the single `{ node, shape }`) conforms, so ShEx validation\n * fits into `Schema.decode` pipelines. It takes a prepared `Validator`\n * (`make`), so imports are resolved before the schema is built and decoding\n * needs no services.\n *\n * Decoding fails with a `SchemaIssue.Composite` holding one `InvalidValue`\n * issue per nonconformant association: its `message` annotation is the\n * formatted result (`formatResult`) and its `result` annotation the\n * `ShapeResult`. A shape map naming an undeclared shape fails with one\n * `InvalidValue`. Encoding is the identity.\n *\n * Compose it with a syntax codec to parse and validate in one decode:\n * `Turtle.codec.schema.pipe(Schema.decodeTo(Validator.schema(validator, map)))`.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const schema = (\n  validator: Validator,\n  shapeMap: ShapeMap.QueryShapeMap | ShapeMap.Association,\n): Schema.decodeTo<Schema.declare<Dataset.Dataset>, Schema.declare<Dataset.Dataset>> => {\n  const map: ShapeMap.QueryShapeMap = 'node' in shapeMap ? [shapeMap] : shapeMap;\n  return Dataset.DatasetSchema.pipe(\n    Schema.decodeTo(\n      Dataset.DatasetSchema,\n      SchemaTransformation.transformEffect({\n        decode: (data: Dataset.Dataset, options) =>\n          validator.validate(data, map).pipe(\n            Effect.mapError(\n              (e) => new SchemaIssue.InvalidValue({ message: e.message }, data, options),\n            ),\n            Effect.flatMap((report) => {\n              const failing = Arr.filter(report.results, (r) => r.status === 'nonconformant');\n              return Arr.isReadonlyArrayNonEmpty(failing)\n                ? Effect.fail(nonconformance(failing, data, options))\n                : Effect.succeed(data);\n            }),\n          ),\n        encode: (data: Dataset.Dataset) => Effect.succeed(data),\n      }),\n    ),\n  );\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgBA,MAAM,aACJ;AACF,MAAM,YAAY,GAAG,WAAW;;AAchC,MAAM,gBAAkC;CACtC,GAAG;EAAE,MAAM;EAAW,SAAS;CAAM;CACrC,GAAG;EAAE,MAAM;EAAW,SAAS;CAAK;CACpC,GAAG;EAAE,MAAM;EAA4B,SAAS;CAAM;CACtD,GAAG;EAAE,MAAM;EAA4B,SAAS;CAAK;CACrD,GAAG;EAAE,MAAM;EAAc,SAAS;CAAM;CACxC,GAAG;EAAE,MAAM;EAAc,SAAS;CAAK;CACvC,GAAG;EAAE,MAAM;EAAY,SAAS;CAAM;CACtC,GAAG;EAAE,MAAM;EAAY,SAAS;CAAK;CACrC,GAAG;EAAE,MAAM;EAAW,SAAS;CAAM;CACrC,GAAG;EAAE,MAAM;EAAW,SAAS;CAAK;AACtC;AAEA,MAAM,SAAwB;CAC5B,YAAY;CACZ,qBAAqB;CACrB,iBAAiB;CACjB,mBAAmB;CACnB,mBAAmB;CACnB,eAAe;CACf,OAAO;CACP,gBAAgB;CAChB,UAAU;CACV,QAAQ;CACR,QAAQ;CACR,sBAAsB;CACtB,UAAU;CACV,UAAU;AACZ;AAEA,MAAM,SAAS,eAAe,KAC5B,KACA,KACA,MACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,GACF;AAcA,MAAM,WAAiD,MAAM,IAC1D,GAAW,OAAmB,CACjC,CAAC,CAAC,KACA,MAAM,eAAuB,GAC7B,MAAM,KAAK,YAAY;CAAE,MAAM;CAAQ,MAAM;AAAM,EAAE,GACrD,MAAM,KAAK,YAAY;CAAE,MAAM;CAAQ,MAAM;AAAM,EAAE,GACrD,MAAM,KAAK,YAAY;CAAE,MAAM;CAAQ,MAAM;AAAM,EAAE,GACrD,MAAM,KAAK,MAAM,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,MAAM;CAE3C,OAAO;EAAE,MAAM;EAAS,GADd,EAAE,SAAS,MAAM,GACA;CAAE;AAC/B,CAAC,GACD,MAAM,QAAQ,GAAG,IAAI,MAAM;CACzB,MAAM,KAAK,cAAc;CACzB,IAAI,OAAO,KAAA,GAAW,OAAO;EAAE,MAAM;EAAS,GAAG;CAAG;CACpD,IAAI,QAAQ,KAAK,CAAC,GAAG,OAAO;EAAE,MAAM;EAAQ,MAAM,KAAK;CAAI;CAC3D,IAAI,MAAM,KAAK,OAAO;EAAE,MAAM;EAAQ,MAAM;CAAM;CAClD,IAAI,eAAe,IAAI,QAAQ,CAAC,GAAG,OAAO;EAAE,MAAM;EAAQ,MAAM,KAAK;CAAI;CACzE,OAAO,EAAE,KAAK,oBAAoB,GAAG;AACvC,CAAC,CACH;AAEA,IAAM,aAAN,MAAiB;CACf,IAAI;CACJ;CACA;CACA;CACA,YAAY,KAAa,QAAiB,UAAmB;EAC3D,KAAK,MAAM;EACX,KAAK,SAAS;EACd,KAAK,WAAW;CAClB;CAEA,KAAK,KAAoB;EACvB,MAAM,IAAI,YAAY,GAAG,IAAI,MAAM,KAAK,EAAE,OAAO,KAAK,IAAI,EAAE;CAC9D;;CAGA,SAAS,SAA6B;EACpC,IAAI,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,KAAK,YAAY;EACpD,MAAM,MAAM,KAAK,IAAI,QAAQ,KAAK,KAAK,CAAC;EACxC,IAAI,QAAQ,IAAI,KAAK,KAAK,8BAA8B;EACxD,MAAM,OAAO,KAAK,IAAI,MAAM,KAAK,IAAI,GAAG,GAAG;EAC3C,KAAK,IAAI,MAAM;EACf,IAAI,KAAK,WAAW,IAAI,GAAG;GACzB,MAAM,QAAQ,OAAO,KAAK,MAAM,CAAC;GACjC,IAAI,UAAU,KAAA,GAAW,KAAK,KAAK,qBAAqB,MAAM;GAC9D,OAAO;IAAE,MAAM;IAAO;GAAQ;EAChC;EACA,OAAO;GAAE,MAAM,OAAO,KAAK;GAAI;EAAQ;CACzC;;CAGA,SAAiB;EACf,MAAM,IAAI,KAAK,IAAI,KAAK;EACxB,IAAI,MAAM,KAAA,GAAW,KAAK,KAAK,oBAAoB;EACnD,OAAO,SAAS,GAAG,IAAI;CACzB;;CAGA,YAAoB;EAClB,MAAM,UAAU,KAAK,IAAI,KAAK,OAAO;EACrC,IAAI,SAAS,KAAK;EAClB,MAAM,QAAoB;GAAE,OAAO,CAAC;GAAG,aAAa,OAAO,KAAK;EAAE;EAClE,MAAM,MAAM,IAAI,OAAO,OAAO,UAC5B,OAAO,IAAI,KAAK,UAAU,OAAO,KAAK,IAAI,aAAa,CAAC,UAAU,KAAK,CAAU,CACnF,CAAC,CAAC,KAAK,EAAE;EAET,MAAM,OAAO,cAAc,GAAG;EAC9B,MAAM,EAAE,UAAU;EAClB,MAAM,MAAM,IAAI,qBAAqB,KAAK,IACtC,IAAI,UAAU,MAAM,KAAK,KAAK,KAC9B,KAAK,MAAM,SAAS,CAAC,GAAI,SAAS,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,GAAI,GAAG,KAAK,CAAC;EACzE,OAAO,OAAO,MAAM,MAAM,aAAa;GACrC,cAAc;GACd,SAAS,gBAAgB,SAAS,YAAY,GAAG,IAAI;EACvD,CAAC;CACH;;CAGA,MAAM,SAAkB,MAAqC;EAC3D,MAAM,QAAQ,MAAM,KAAK,KAAK,GAAG,EAAE;EACnC,OAAO,UAAU,SAAS,MAAM,cAAc;CAChD;;;;;CAMA,UAAU,OAAgB,OAA0C;EAClE,MAAM,IAAI,KAAK,IAAI,KAAK;EACxB,IAAI,MAAM,KAAA,GAAW,KAAK,KAAK,8BAA8B;EAC7D,IAAI,MAAM,OAAO,CAAC,OAAO;GACvB,KAAK;GACL,OAAO,OAAO,KAAK;EACrB;EACA,IAAI,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK;GAC7C,KAAK,KAAK;GACV,MAAM,cAAc,OAAO,KAAK,KAAK,UAAU,CAAC;GAChD,IAAI,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,KAAK,oCAAoC;GAC5E,KAAK;GACL,OAAO,OAAO,KAAK;EACrB;EACA,KAAK;EACL,IAAI,MAAM,MAAM;GACd,MAAM,IAAI,KAAK,OAAO;GACtB,IAAI,EAAE,SAAS,QAAQ,OAAO,OAAO,KAAK,EAAE,IAAI;GAChD,IAAI,CAAC,EAAE,SAAS,OAAO,OAAO,KAAK,EAAE,IAAI;GACzC,MAAM,MAAM,KAAK,KAAK,EAAE,KAAK,EAAE;GAC/B,OAAO,OAAO,KAAK,EAAE;EACvB;EACA,IAAI,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,KACtF,OAAO,OAAO,KAAK,KAAK,GAAG;EAE7B,OAAO,OAAO,KAAK,MAAM,MAAM,QAAQ,CAAC;CAC1C;;CAGA,OAAe;EACb,MAAM,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC;EAChC,IAAI,KAAK,YAAY,KAAK,KAAK,CAAC,GAAG;GACjC,KAAK;GACL,OAAO;EACT;EACA,IAAI,MAAM,MAAM;GACd,KAAK;GACL,MAAM,IAAI,KAAK,OAAO;GACtB,OAAO,EAAE,SAAS,SACd,EAAE,SAAS,QACT,MACA,EAAE,OACJ,IAAI,EAAE,UAAU,MAAM,KAAK,EAAE,KAAK;EACxC;EACA,IAAI,MAAM,KAAK;GACb,KAAK;GACL,OAAO,KAAK,UAAU;EACxB;EACA,IAAI,MAAM,KAAK;GACb,MAAM,IAAI,oBAAoB,KAAK,KAAK,IAAI,MAAM,KAAK,CAAC,CAAC;GACzD,IAAI,MAAM,MAAM;IACd,KAAK,KAAK,EAAE,EAAE,CAAC;IACf,OAAO,EAAE;GACX;GACA,KAAK;GACL,OAAO;EACT;EACA,KAAK;EACL,IAAI,MAAM,KAAK,OAAO,KAAK,SAAS,aAAa;EACjD,IAAI,MAAM,KAAK,OAAO;EACtB,IAAI,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK;EACxC,OAAO;CACT;CAEA,YAAoB;EAClB,OAAO,IAAI,OAAO,OAAO,MACvB,EAAE,IAAI,EAAE,IAAI,SAAS,OAAO,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAU,IAAI,OAAO,KAAK,CACzE,CAAC,CAAC,KAAK,EAAE;CACX;AACF;;;;;;AAOA,MAAM,iBAAiB,SAAyB;CAE9C,MAAM,QAAQ,KAAK,MAAM,UAAU,KAAK,CAAC;CACzC,MAAM,cAAc,MAAuB;EACzC,MAAM,IAAI,MAAM;EAChB,OAAO,MAAM,KAAA,KAAa,gBAAgB,CAAC;CAC7C;CACA,OAAO,IAAI,IAAI,QAAQ,GAAG,MACxB,MAAM,SAAS,WAAW,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,IAAI,MAAM,CAChE,CAAC,CAAC,KAAK,EAAE;AACX;AAEA,MAAM,aAAa;AAEnB,MAAM,mBAAmB,SAA0B,CAAC,gBAAgB,KAAK,IAAI,KAAK,SAAS;;;;;;;AAQ3F,MAAa,qBAAqB,SAAiB,UAA0B;CAC3E,IAAI,MAAM,SAAS,GAAG,GAAG;EACvB,MAAM,UAAU,QAAQ,QAAQ,yBAAyB,MAAM;EAC/D,OAAO,IAAI,OAAO,SAAS,IAAI,MAAM,SAAS,GAAG,IAAI,MAAM,IAAI;CACjE;CAEA,MAAM,SAAS,IADD,WAAW,SAAS,MAAM,SAAS,GAAG,GAAG,MAAM,SAAS,GAAG,CAC1D,CAAC,CAAC,UAAU;CAC3B,IAAI,UAAU;CACd,IAAI,MAAM,SAAS,GAAG,GAAG,WAAW;CACpC,IAAI,MAAM,SAAS,GAAG,GAAG,WAAW;CACpC,OAAO,IAAI,OAAO,QAAQ,OAAO;AACnC;;;;;;;;AC/QA,MAAM,MAAM;AACZ,MAAM,aAAa,GAAG,IAAI;AAC1B,MAAM,kBAAkB;AAExB,MAAM,iBAAiB,eAAe,aACpC;CACE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,MAAM,MAAM,CAAC,CACtB;;AAGA,MAAM,eAAe,MACnBA,UAAe,CAAC,KAAKC,YAAiB,CAAC,KAAKC,YAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE;;AAGhF,MAAM,mBAAmB,MACvB,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC,EAAE,UAAU;AAEpE,MAAM,aAAa,eAAe,MAA6C;;AAG/E,MAAM,YAAY,SAAiB,UAAiD;CAClF,MAAM,MAAM,GAAG,MAAM,GAAG;CACxB,OAAO,OAAO,UAAU,eAAe,IAAI,YAAY,GAAG,SAAS;EACjE,MAAM,KAAK,OAAO,IAAI;GACpB,WAAW,kBAAkB,SAAS,KAAK;GAE3C,QAAQ,MACN,UAAU,YAAY,GAAG,SAAS,KAAK,UAAU,SAAS,EAAE,OAAO,IAC/D,EAAE,UACF,OAAO,CAAC;EAChB,CAAC;EACD,eAAe,IAAI,YAAY,KAAK,EAAE;EACtC,OAAO;CACT,CAAC;AACH;AAUA,MAAM,gBAAgB,YAAiD;CACrE,MAAM,IAAI,6BAA6B,KAAK,QAAQ,KAAK,CAAC;CAC1D,IAAI,MAAM,SAAU,EAAE,MAAM,QAAQ,OAAO,EAAE,MAAM,QAAQ,IAAK,OAAO,OAAO,KAAK;CACnF,MAAM,OAAO,EAAE,MAAM,GAAA,CAAI,QAAQ,OAAO,EAAE;CAC1C,MAAM,QAAQ,EAAE,MAAM,GAAA,CAAI,QAAQ,OAAO,EAAE;CAC3C,OAAO,OAAO,KAAK;EAAE,UAAU,EAAE,OAAO,QAAQ,QAAQ,MAAM,SAAS;EAAK;EAAK;CAAK,CAAC;AACzF;AAEA,MAAM,uBAAuB,GAAiB,MAA4B;CACxE,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO,EAAE,WAAW,KAAK;CACxD,MAAM,OAAO,EAAE,WAAW,KAAK;CAC/B,IAAI,EAAE,IAAI,WAAW,EAAE,IAAI,QAAQ,OAAO,QAAQ,EAAE,IAAI,SAAS,EAAE,IAAI,SAAS,KAAK;CACrF,IAAI,EAAE,QAAQ,EAAE,KAAK,OAAO,QAAQ,EAAE,MAAM,EAAE,MAAM,KAAK;CACzD,MAAM,MAAM,KAAK,IAAI,EAAE,KAAK,QAAQ,EAAE,KAAK,MAAM;CACjD,MAAM,KAAK,EAAE,KAAK,OAAO,KAAK,GAAG;CACjC,MAAM,KAAK,EAAE,KAAK,OAAO,KAAK,GAAG;CACjC,IAAI,OAAO,IAAI,OAAO;CACtB,OAAO,QAAQ,KAAK,KAAK,KAAK;AAChC;AAEA,MAAM,wBAAwB,MAA2C;CACvE,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,OAAO,KAAK;CAC5C,MAAM,IAAI,OAAO,CAAC;CAClB,IAAI,KAAK,KAAK,CAAC,GAAG;EAEhB,MAAM,IAAI,qCAAqC,KAAK,CAAC;EACrD,IAAI,MAAM,MAAM,OAAO,OAAO,KAAK;EACnC,MAAM,UAAU,EAAE,MAAM,OAAO,EAAE,MAAM;EACvC,MAAM,MAAM,SAAS,EAAE,MAAM,IAAI,EAAE,KAAK,EAAE,MAAM,GAAA,CAAI;EACpD,MAAM,OACJ,OAAO,IACH,SAAS,IAAI,OAAO,GAAG,WAChB;GACL,MAAM,SAAS,OAAO,SAAS,CAAC,MAAM,GAAG,GAAG;GAC5C,OAAO,GAAG,OAAO,MAAM,GAAG,GAAG,EAAE,GAAG,OAAO,MAAM,GAAG;EACpD,EAAA,CAAG;EACT,OAAO,aAAa,EAAE,KAAK,IAAI;CACjC;CACA,OAAO,aAAa,CAAC;AACvB;AAOA,MAAM,gBAAgB,MAAyC;CAC7D,IAAI,CAACF,UAAe,CAAC,GAAG,OAAO,OAAO,KAAK;CAC3C,MAAM,KAAK,EAAE,SAAS;CACtB,IAAI,CAACG,kBAAsB,EAAE,KAAK,CAACC,eAAmB,IAAI,EAAE,KAAK,GAAG,OAAO,OAAO,KAAK;CACvF,IAAI,eAAe,IAAI,gBAAgB,EAAE,GACvC,OAAO,OAAO,IAAI,aAAa,EAAE,KAAK,IAAI,WAAoB;EAAE,MAAM;EAAW;CAAM,EAAE;CAE3F,MAAM,IAAI,EAAE,MAAM,KAAK;CACvB,MAAM,QACJ,MAAM,SAAS,MAAM,SACjB,WACA,MAAM,SACJ,YACA,MAAM,QACJ,MACA,OAAO,CAAC;CAClB,OAAO,OAAO,KAAK;EAAE,MAAM;EAAS;CAAM,CAAC;AAC7C;;AAGA,MAAM,eAAe,GAAY,UAA0B;CACzD,IAAI,EAAE,SAAS,WAAW;EACxB,MAAM,EAAE,UAAU;EAClB,OAAO,OAAO,MAAM,qBAAqB,KAAK,GAAG;GAC/C,cAAe,OAAO,MAAM,KAAK,IAAI,MAAM,UAAU,WAAW,KAAK;GACrE,SAAS,MAAM,oBAAoB,OAAO,CAAC;EAC7C,CAAC;CACH;CACA,IAAI,OAAO,MAAM,EAAE,KAAK,KAAK,OAAO,MAAM,KAAK,GAAG,OAAO;CACzD,OAAO,EAAE,QAAQ,QAAQ,KAAK,EAAE,QAAQ,QAAQ,IAAI;AACtD;AAEA,MAAM,WAAW,GAAW,MAAc,EAAE,YAAY,MAAM,EAAE,YAAY;;AAG5E,MAAM,mBAAmB,KAAa,UAA2B;CAC/D,IAAI,UAAU,MAAM,UAAU,KAAK,OAAO,QAAQ;CAClD,MAAM,IAAI,IAAI,YAAY;CAC1B,MAAM,IAAI,MAAM,YAAY;CAC5B,OAAO,MAAM,KAAK,EAAE,WAAW,GAAG,EAAE,EAAE;AACxC;AAEA,MAAM,iBAAiB,GAAiB,MAAoC;CAC1E,IAAI,EAAE,UAAU,EAAE,OAAO,OAAO;CAChC,IAAI,EAAE,aAAa,KAAA,GAAW,OAAO,EAAE,aAAa,MAAM,QAAQ,EAAE,UAAU,EAAE,QAAQ;CACxF,IAAI,EAAE,aAAa,IAAI,OAAO;CAC9B,OAAO,EAAE,SAAS,WAAW,EAAE,QAAQ;AACzC;;;;;AAMA,MAAM,eAAe,OAAe,WACjC,CAAC,UAAU,SAAS,MAAM,IAAI,KAAK,MAAM,WAAW,MAAM,IAAI,MAC/D,CAAC,MAAM,WAAW,MAAM,MAAO,UAAU,SAAS,CAAC,IAAI,UAAU,IAAI,MAAM,WAAW,EAAE,IAAI,CAAE;AAGhG,MAAM,mBAGS,MAAM,IAClB,GAAoD,OAAkB,CACzE,CAAC,CAAC,KACA,MAAM,eAAwB,GAC9B,MAAM,KAAK,EAAE,MAAM,UAAU,IAAI,GAAG,IAAI,MAAMH,YAAiB,CAAC,KAAK,EAAE,MAAM,WAAW,EAAE,IAAI,CAAC,GAC/F,MAAM,KACJ,EAAE,MAAM,eAAe,IACtB,GAAG,IAAI,MAAMA,YAAiB,CAAC,KAAK,YAAY,EAAE,OAAO,CAAC,CAC7D,GACA,MAAM,KACJ,EAAE,MAAM,cAAc,IACrB,GAAG,IAAI,MAAMD,UAAe,CAAC,KAAK,EAAE,MAAM,WAAW,EAAE,IAAI,CAC9D,GACA,MAAM,KACJ,EAAE,MAAM,mBAAmB,IAC1B,GAAG,IAAI,MAAMA,UAAe,CAAC,KAAK,YAAY,EAAE,OAAO,CAAC,CAC3D,GACA,MAAM,KACJ,EAAE,MAAM,WAAW,IAClB,GAAG,IAAI,MAAMA,UAAe,CAAC,KAAK,EAAE,aAAa,MAAM,QAAQ,EAAE,UAAU,EAAE,WAAW,CAC3F,GACA,MAAM,KACJ,EAAE,MAAM,eAAe,IACtB,GAAG,IAAI,MAAMA,UAAe,CAAC,KAAK,EAAE,aAAa,MAAM,gBAAgB,EAAE,UAAU,EAAE,IAAI,CAC5F,GACA,MAAM,KAAK,EAAE,MAAM,oBAAoB,IAAI,GAAG,IAAI,MAAM;CACtD,IAAI,CAACA,UAAe,CAAC,KAAK,EAAE,aAAa,IAAI,OAAO;CACpD,IAAI,UAAU,SAAS,EAAE,IAAI,KAAK,CAAC,gBAAgB,EAAE,UAAU,EAAE,IAAI,GAAG,OAAO;CAC/E,OAAO,CAAC,EAAE,WAAW,MAAM,MACzB,UAAU,SAAS,CAAC,IAAI,QAAQ,EAAE,UAAU,CAAC,IAAI,gBAAgB,EAAE,UAAU,EAAE,IAAI,CACrF;AACF,CAAC,GACD,MAAM,aAAa,KAAK,CAC1B;;;;;;AAOA,MAAa,gBAAgB,GAAc,MAAoC;CAC7E,IAAI,UAAU,SAAS,CAAC,GAAG,OAAOC,YAAiB,CAAC,KAAK,EAAE,UAAU;CAErE,IAAI,EAAE,UAAU,MAAM,WAAW,GAAG,OAAOD,UAAe,CAAC,KAAK,cAAc,GAAG,CAAC;CAClF,OAAO,iBAAiB,GAAG,CAAC;AAC9B;AAEA,MAAM,WAAW,MAAe,YAC9B,OAAO,OAAO,KAAK,QAAQ,CAAC,IAAI,OAAO,KAAK;AAG9C,MAAM,kBAAkB,MAAM,IAAI,IAA0B,OAAkB,GAAG,QAAQ,CAAC,CAAC,KACzF,MAAM,eAAsC,GAC5C,MAAM,KAAK,QAAQ,OAAO,KAAK,MAC7B,QAAQ,CAACC,YAAiB,CAAC,SAAS,GAAG,EAAE,IAAI,eAAe,CAC9D,GACA,MAAM,KAAK,UAAU,OAAO,KAAK,MAC/B,QAAQ,CAACC,YAAiB,CAAC,SAAS,GAAG,EAAE,IAAI,qBAAqB,CACpE,GACA,MAAM,KAAK,YAAY,OAAO,KAAK,MACjC,QAAQ,CAACF,UAAe,CAAC,SAAS,GAAG,EAAE,IAAI,kBAAkB,CAC/D,GACA,MAAM,KAAK,eAAe,OAAO,KAAK,MACpC,QAAQ,CAACK,WAAgB,CAAC,SAAS,GAAG,EAAE,IAAI,6BAA6B,CAC3E,GACA,MAAM,aAAa,OAAO,KAAK,CAAC,CAClC;;AAGA,MAAM,gBAMF;CACF;EAAC;GAAiB,OAAO,OAAO,gBAAgB,GAAG,YAAY;GAAI,MAAM,KAAK;CAAC;CAC/E;EAAC;GAAiB,OAAO,OAAO,gBAAgB,GAAG,YAAY;GAAI,MAAM,IAAI;CAAC;CAC9E;EAAC;GAAiB,OAAO,OAAO,gBAAgB,GAAG,YAAY;GAAI,MAAM,KAAK;CAAC;CAC/E;EAAC;GAAiB,OAAO,OAAO,gBAAgB,GAAG,YAAY;GAAI,MAAM,IAAI;CAAC;AAChF;;AAGA,MAAM,mBAAmB,GAAc,aAA4C;CACjF,IAAI,CAACL,UAAe,CAAC,GAAG,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,iCAAiC,SAAS,EAAE;CAEhG,KADe,EAAE,aAAa,KAAK,kBAAkB,EAAE,SAAS,WACjD,YAAY,EAAE,EAAE,aAAa,MAAM,EAAE,SAAS,UAAU,WACrE,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,2BAA2B,SAAS,EAAE;CACpE,OAAO,QACL,EAAE,aAAa,OACZ,CAACI,eAAmB,UAAU,EAAE,KAAK,MAClC,aAAa,GAAG,IAAI,UAAU,aAAa,GAAG,IAAI,YAAY,EAAE,UAAU,eAC1E,GAAG,EAAE,IAAI,mBAAmB,SAAS,EAC7C;AACF;;AAGA,MAAM,sBAAsB,GAAc,OAAoD;CAC5F,MAAM,MAAM,YAAY,CAAC;CACzB,MAAM,MAAM,gBAAgB,GAAG;CAC/B,IAAI,GAAG,WAAW,KAAA,KAAa,QAAQ,GAAG,QACxC,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,cAAc,IAAI,aAAa,GAAG,QAAQ;CACxE,IAAI,GAAG,cAAc,KAAA,KAAa,MAAM,GAAG,WACzC,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,cAAc,IAAI,sBAAsB,GAAG,WAAW;CACpF,IAAI,GAAG,cAAc,KAAA,KAAa,MAAM,GAAG,WACzC,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,cAAc,IAAI,qBAAqB,GAAG,WAAW;CACnF,IAAI,GAAG,YAAY,KAAA,GAAW,OAAO,OAAO,KAAK;CACjD,MAAM,WAAW,SAAS,GAAG,SAAS,GAAG,SAAS,EAAE;CACpD,IAAI,OAAO,UAAU,QAAQ,GAC3B,OAAO,OAAO,KAAK,oBAAoB,GAAG,QAAQ,KAAK,SAAS,SAAS;CAC3E,MAAM,KAAK,SAAS;CACpB,GAAG,YAAY;CACf,OAAO,QAAQ,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,EAAE,IAAI,mBAAmB,GAAG,QAAQ,GAAG,GAAG,SAAS,IAAI;AAChG;;AAGA,MAAM,uBAAuB,GAAc,OACzC,IAAI,UAAU,gBAAgB,CAAC,OAAO,SAAS,QAC7C,OAAO,QAAQ,QAAQ,EAAE,IAAI,UAC3B,OAAO,MAAM,aAAa,CAAC,GAAG;CAC5B,cAAc,OAAO,KAAK,GAAG,EAAE,IAAI,mBAAmB,MAAM,EAAE;CAC9D,SAAS,MACP,QAAQ,CAAC,GAAG,YAAY,GAAG,KAAK,CAAC,SAAS,GAAG,EAAE,IAAI,YAAY,MAAM,GAAG,OAAO;AACnF,CAAC,CACH,CACF;;AAGF,MAAM,iBAAiB,GAAc,OAAoD;CACvF,MAAM,QACJJ,UAAe,CAAC,KAChB,eAAe,IAAI,gBAAgB,EAAE,SAAS,KAAK,KACnDI,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK,IACxC,aAAa,EAAE,KAAK,IACpB,OAAO,KAAK;CAClB,OAAO,OAAO,MAAM,OAAO;EACzB,cAAc,OAAO,KAAK,GAAG,EAAE,IAAI,6BAA6B;EAChE,SAAS,EAAE,KAAK,WAAW;GACzB,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI,SAAS,KAAK,MAAM;GAClD,IAAI,GAAG,gBAAgB,KAAA,KAAa,QAAQ,GAAG,aAC7C,OAAO,OAAO,KAAK,GAAG,EAAE,IAAI,OAAO,MAAM,4BAA4B,GAAG,aAAa;GACvF,OAAO,QACL,GAAG,mBAAmB,KAAA,KAAa,KAAK,SAAS,GAAG,sBAC9C,GAAG,EAAE,IAAI,OAAO,KAAK,OAAO,qCAAqC,GAAG,gBAC5E;EACF;CACF,CAAC;AACH;;;;;;;AAQA,MAAa,uBACX,GACA,OAC0B;CAC1B,MAAM,cAAc,gBAAgB,IAAI,CAAC;CACzC,IAAI,OAAO,OAAO,WAAW,GAAG,OAAO;CACvC,IAAI,GAAG,aAAa,KAAA,GAAW;EAC7B,MAAM,IAAI,gBAAgB,GAAG,GAAG,QAAQ;EACxC,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;CAC/B;CACA,IACE,GAAG,WAAW,KAAA,KACd,GAAG,cAAc,KAAA,KACjB,GAAG,cAAc,KAAA,KACjB,GAAG,YAAY,KAAA,GACf;EACA,MAAM,IAAI,mBAAmB,GAAG,EAAE;EAClC,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;CAC/B;CACA,MAAM,UAAU,oBAAoB,GAAG,EAAE;CACzC,IAAI,OAAO,OAAO,OAAO,GAAG,OAAO;CACnC,IAAI,GAAG,gBAAgB,KAAA,KAAa,GAAG,mBAAmB,KAAA,GAAW;EACnE,MAAM,IAAI,cAAc,GAAG,EAAE;EAC7B,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;CAC/B;CACA,OAAO,QACL,GAAG,WAAW,KAAA,KAAa,CAAC,GAAG,OAAO,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,SAC9D,GAAG,EAAE,IAAI,yBACjB;AACF;;;;;;;;;;;AChUA,MAAM,OAAY;CAAE,MAAM,OAAO,KAAK;CAAG,QAAQ,OAAO,KAAK;CAAG,iBAAiB;AAAM;AAKvF,MAAM,UAAmB,OAAO,KAAK;AAWrC,MAAM,SAAgB;CAAE,MAAM;CAAO,GAAG;AAAQ;;AAkBhD,MAAM,QAAQ,MAAuB,OAAO,UAAU,SAAS,WAAW;AAE1E,MAAM,UAAU,QAAuC,IAAI,KAAK,GAAG;AAEnE,MAAM,UAAU,SACd,IAAI,aACF,eAAe,OAAO,eAAe,aAAa,IAAI,IAAI,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACzF;;AAGF,MAAM,eACJ,GACA,QACA,GACA,KACA,SACY;CAGZ,IAAI,QAAiB,OAAO,KAAK;CACjC,IAAI,SAAS;CAYb,OAXsB,IAAI,KAAK,EAAE,aAAa,MAAM;EAClD,MAAM,SAAS,OAAO,MAAM,IAAI,QAAQ;GAAE,cAAc;GAAG,SAAS,MAAM,EAAE;EAAM,CAAC;EACnF,MAAM,IAAI,OAAO,UAAU,GAAG,GAAG,KAAK,MAAM,OAAO,KAAK,CAAC;EACzD,IAAI,OAAO,OAAO,CAAC,GAAG;GACpB,IAAI,OAAO,MAAM,IAAI,QAAQ;IAAE,cAAc;IAAM,SAAS,MAAM,EAAE,QAAQ;GAAO,CAAC,GAClF,OAAO;GAET,SAAS;EACX,OAAO,IAAI,OAAO,OAAO,KAAK,GAAG,QAAQ;EACzC,OAAO;CACT,CACmB,KAAK,SACpB,UACA,OAAO,KAAK,GAAG,EAAE,IAAI,qCAAqC,KAAK,KAAK,EAAE,EAAE;AAC9E;AAGA,MAAM,gBAOS,MAAM,IAEjB,GACA,SACA,IACA,MACA,OACA,eACG,CACP,CAAC,CAAC,KACA,MAAM,eAAwB,GAC9B,MAAM,KAAK,EAAE,MAAM,WAAW,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,SACvD,IAAI,UAAU,EAAE,aAAa,MAAM,OAAO,UAAU,GAAG,GAAG,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC,CACrF,GACA,MAAM,KAAK,EAAE,MAAM,UAAU,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,SACtD,YAAY,GAAG,QAAQ,GAAG,KAAK,IAAI,CACrC,GACA,MAAM,KAAK,EAAE,MAAM,WAAW,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,SACvD,OAAO,OAAO,OAAO,UAAU,GAAG,EAAE,WAAW,KAAK,MAAM,OAAO,KAAK,CAAC,CAAC,IACpE,OAAO,KAAK,GAAG,EAAE,IAAI,oCAAoC,IACzD,OACN,GACA,MAAM,KAAK,EAAE,MAAM,iBAAiB,IAAI,GAAG,IAAI,QAAQ,MAAM;CAC3D,MAAM,IAAI,oBAAoB,GAAG,CAAC;CAClC,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;CAC7B,OAAO,OAAO,WAAW,EAAE,SAAS;EAAE,MAAM;EAAkB,MAAM;CAAE,CAAC;AACzE,CAAC,GACD,MAAM,KAAK,EAAE,MAAM,gBAAgB,IAAI,IAAI,QAAQ,QAAQ,GAAG,KAAK,MAAM,cACvE,OAAO,MACL,OAAO,QAAQ,YAAY,MAAM,eAAe,IAAI,OAAO,SAAS,CAAC,CAAC,GACtE;CACE,cACE,OAAO,KACL,8CAA8C,OAAO,UAAU,iBAAiB,WAAW,GAC7F;CACF,SAAS,QAAQ,OAAO,UAAU,GAAG,IAAI,WAAW,KAAK,MAAM,OAAO,KAAK,CAAC;AAC9E,CACF,CACF,GACA,MAAM,KAAK,EAAE,MAAM,QAAQ,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,SACpD,OAAO,aAAa,GAAG,GAAG,KAAK,IAAI,CACrC,GACA,MAAM,UACR;;AAGA,MAAM,UACJ,KACA,QAEA,IAAI,SAAS,OAAO;CAClB,IAAI,CAAC,IAAI,SAAS,EAAE,GAAG,IAAI,KAAK,EAAE;AACpC,CAAC;AAGH,MAAM,iBAKM,MAAM,IAEd,GACA,SACA,MACA,UACG,CACP,CAAC,CAAC,KACA,MAAM,KAAK,EAAE,MAAM,QAAQ,IAAI,GAAG,IAAI,QAAQ,KAAK,SAAS;CAC1D,OAAO,KAAK,OAAO,SAAS,CAAC,CAAC;CAC9B,EAAE,SAAS,SAAS,MAAM,OAAO,aAAa,GAAG,KAAK,IAAI,CAAC;AAC7D,CAAC,GACD,MAAM,KAAK,EAAE,MAAM,MAAM,GAAG,YAAY,SAAS,EAAE,IAAI,GAAG,IAAI,QAAQ,KAAK,SAAS;CAClF,EAAE,WAAW,SAAS,MAAM,OAAO,aAAa,GAAG,KAAK,IAAI,CAAC;AAC/D,CAAC,GACD,MAAM,KAAK,EAAE,MAAM,WAAW,IAAI,GAAG,IAAI,QAAQ,KAAK,SAAS;CAC7D,OAAO,aAAa,EAAE,WAAW,KAAK,IAAI;AAC5C,CAAC,GACD,MAAM,aAAa,KAAA,CAAS,CAC9B;;AAGA,MAAM,UACJ,OACA,KACA,YACe;CACf,MAAM,OAAO,eAAe,MAAc;CAC1C,OAAO,IAAI,UAAU,IAAI,aAAa,KAAK,IAAI,MAAM;EACnD,MAAM,IAAIE,OAAY,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM;EACtD,IAAI,eAAe,IAAI,MAAM,EAAE,GAAG,GAAG,OAAO,OAAO;EACnD,eAAe,IAAI,MAAM,EAAE,GAAG;EAC9B,OAAO,OAAO,QAAQ;GAAE,QAAQ;GAAG;GAAK,WAAW,EAAE,UAAU;GAAO,OAAO,QAAQ,CAAC;EAAE,CAAC;CAC3F,CAAC;AACH;AAEA,IAAa,SAAb,MAAoB;CAClB,QAAyB,eAAe,MAAuB;CAC/D,aAA8B,eAAe,MAAc;CAC3D,iBAAkC,eAAe,MAAkC;CACnF,2BAA4B,IAAI,QAAuD;CAEvF;CACA;CACA;CACA;CACA,YACE,OACA,SACA,SACA,SACA;EACA,KAAK,QAAQ;EACb,KAAK,UAAU;EACf,KAAK,UAAU;EACf,KAAK,UAAU;CACjB;CAMA,cAAc,GAAkC;EAC9C,OAAO,OAAO,UAAU,eAAe,IAAI,KAAK,gBAAgB,EAAE,GAAG,SAAS;GAC5E,MAAM,OAAO,CACX,GAAIC,WAAgB,CAAC,KAAKC,SAAc,CAAC,IACrC,OAAOC,MAAc,KAAK,SAAS,EAAE,SAAS,EAAE,CAAC,GAAG,QAAQ,MAAM,EAAE,MAAM,IAC1E,CAAC,GACL,GAAI,CAACC,WAAgB,CAAC,KAAK,CAACC,eAAoB,CAAC,IAC7C,OAAOF,MAAc,KAAK,SAAS,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO,MAAM,EAAE,OAAO,IACzE,CAAC,CACP;GACA,eAAe,IAAI,KAAK,gBAAgB,EAAE,KAAK,IAAI;GACnD,OAAO;EACT,CAAC;CACH;CAMA,WAAW,OAAoC,CAAC,GAAG,SAAwC;EACzF,OAAO,IAAI,UAAU,OAAO,QAAQ;GAClC,MAAM,IAAI,KAAK,QAAQ,KAAK,OAAO;GACnC,OAAO,OAAO,OAAO,CAAC,KAAK,CAAC,EAAE,QAC1B,OAAO,KAAK,oBAAoB,IAAI,KAAK,SAAS,IAClD,OAAO,KAAK;EAClB,CAAC;CACH;;CAOA,cAAc,GAAc,OAAe,MAAqB;EAC9D,OAAO,KAAK,SAAS,GAAG,EAAE,IAAI,QAAQ,SAAS,OAAO,UACpD,KAAK,oBAAoB,GAAG,OAAO,KAAK,CAC1C;CACF;;CAGA,cAAc,GAAc,MAAqB;EAC/C,MAAM,QAAQ,KAAK,MAAM,OAAO;EAChC,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,KAAK,+BAA+B;EAC3E,OAAO,KAAK,SAAS,GAAG,EAAE,IAAI,oBAAoB,OAAO,UACvD,KAAK,UAAU,GAAG,OAAO,MAAM,OAAO,OAAO,KAAK,CAAC,CACrD;CACF;;;;;;;CAQA,SAAiB,KAAa,MAAY,OAA0C;EAClF,MAAM,SAAS,eAAe,IAAI,KAAK,OAAO,GAAG;EACjD,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,OAAO;EACzC,IAAI,eAAe,IAAI,KAAK,YAAY,GAAG,GAAG;GAC5C,eAAe,IAAI,MAAM,GAAG;GAC5B,OAAO;EACT;EACA,eAAe,IAAI,KAAK,YAAY,GAAG;EACvC,MAAM,QAAQ,eAAe,MAAc;EAC3C,MAAM,SAAS,OAAO,UAAU,MAAM,KAAK,CAAC;EAC5C,eAAe,OAAO,KAAK,YAAY,GAAG;EAC1C,IAAI,OAAO,UAAU,MAAM,GAAG,MAAM,OAAO;EAC3C,MAAM,IAAI,OAAO;EACjB,eAAe,OAAO,OAAO,GAAG;EAChC,IAAI,OAAO,OAAO,CAAC,KAAK,eAAe,KAAK,KAAK,MAAM,GACrD,eAAe,IAAI,KAAK,OAAO,KAAK,CAAC;EACvC,SAAS,QAAQ,QAAQ,MAAM,eAAe,IAAI,MAAM,CAAC,CAAC;EAC1D,OAAO;CACT;CAEA,oBAA4B,GAAc,OAAe,MAAqB;EAE5E,IADa,KAAK,MAAM,OAAO,IAAI,KAC5B,MAAM,KAAA,GAAW,OAAO,OAAO,KAAK,iBAAiB,OAAO;EACnE,MAAM,aAAa,CAAC,OAAO,GAAI,KAAK,MAAM,YAAY,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,CAAC,QACtE,MAAM,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,EAAE,aAAa,IAChD;EACA,IAAI,IAAI,qBAAqB,UAAU,GACrC,OAAO,OAAO,KAAK,GAAG,MAAM,2CAA2C;EACzE,IAAI,QAAiB,OAAO,KAAK;EAqBjC,OApBc,IAAI,KAAK,aAAa,MAAM;GACxC,MAAM,SACJ,MAAM,QAAQ,OAAO,KAAK,IAAI,OAAO,KAAK;IAAE;IAAO,OAAO;GAAE,CAAC;GAC/D,MAAM,IAAI,KAAK,cACb,GACA,GACA;IAAE,MAAM,OAAO,KAAK;IAAG;IAAQ,iBAAiB;GAAM,GACtD,IACF;GACA,IACE,OAAO,OAAO,CAAC,KACf,OAAO,MAAM,QAAQ;IAAE,cAAc;IAAM,SAAS,MAAM,EAAE,QAAQ;GAAE,CAAC,GAEvE,OAAO;GACT,IAAI,OAAO,OAAO,KAAK,GACrB,QAAQ,OAAO,OAAO,SACpB,OAAO,KAAK,GAAG,EAAE,IAAI,WAAW,EAAE,mBAAmB,OAAO,CAC9D;GACF,OAAO;EACT,CACW,IAAI,UAAU;CAC3B;CAEA,cAAsB,GAAc,OAAe,KAAU,MAAqB;EAChF,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,KAAK;EACxC,IAAI,SAAS,KAAA,GAAW,OAAO,OAAO,KAAK,iBAAiB,OAAO;EACnE,OAAO,IAAI,UAAU,CAAC,GAAI,KAAK,aAAa,CAAC,GAAI,KAAK,SAAS,IAAI,MACjE,KAAK,UAAU,GAAG,GAAG,KAAK,MAAM,OAAO,KAAK,KAAK,CAAC,CACpD;CACF;CAMA,UACE,GACA,GACA,KACA,MACA,WACS;EACT,IAAI,UAAU,SAAS,CAAC,GAAG;GACzB,IAAI,OAAO,OAAO,IAAI,IAAI,GAAG,OAAO,KAAK,cAAc,GAAG,GAAG,IAAI;GACjE,MAAM,IAAI,KAAK,cAAc,GAAG,GAAG,KAAK,IAAI;GAC5C,IAAI,OAAO,OAAO,CAAC,KAAK,OAAO,OAAO,IAAI,MAAM,KAAK,IAAI,OAAO,MAAM,UAAU,GAC9E,IAAI,OAAO,MAAM;GACnB,OAAO;EACT;EACA,OAAO,cAAc,GAAG,MAAM,GAAG,KAAK,MAAM,SAAS;CACvD;;CAOA,MACE,IACA,KACA,MACM;EACN,IAAI,UAAU,SAAS,EAAE,GAAG;GAC1B,IAAI,eAAe,IAAI,MAAM,EAAE,GAAG;GAClC,eAAe,IAAI,MAAM,EAAE;GAC3B,MAAM,WAAW,KAAK,MAAM,YAAY,IAAI,EAAE;GAC9C,IAAI,aAAa,KAAA,GAAW,KAAK,MAAM,UAAU,KAAK,IAAI;GAC1D;EACF;EACA,IAAI,GAAG,SAAS,oBACV;OAAA,CAAC,IAAI,SAAS,EAAE,GAAG,IAAI,KAAK,EAAE;EAAA,OAC7B,GAAG,YAAY,SAAS,MAAM,KAAK,MAAM,GAAG,KAAK,IAAI,CAAC;CAC/D;CAEA,SAAS,OAA2D;EAClE,MAAM,SAAS,KAAK,SAAS,IAAI,KAAK;EACtC,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,MAAM,MAAqC,CAAC;EAC5C,IAAI,MAAM,eAAe,KAAA,GAAW,KAAK,MAAM,MAAM,YAAY,KAAK,eAAe,MAAM,CAAC;EAC5F,KAAK,SAAS,IAAI,OAAO,GAAG;EAC5B,OAAO;CACT;;CAGA,aACE,GACA,KACA,MACM;EACN,IAAI,UAAU,SAAS,CAAC,GAAG;GACzB,IAAI,eAAe,IAAI,MAAM,CAAC,GAAG;GACjC,eAAe,IAAI,MAAM,CAAC;GAC1B,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,CAAC;GACpC,IAAI,SAAS,KAAA,GAAW;IACtB,KAAK,WAAW,SAAS,MAAM,KAAK,aAAa,GAAG,KAAK,IAAI,CAAC;IAC9D,KAAK,aAAa,KAAK,WAAW,KAAK,IAAI;GAC7C;GACA;EACF;EACA,eAAe,GAAG,MAAM,KAAK,IAAI;CACnC;CAEA,aAAa,GAAc,OAAoB,KAAU,MAAqB;EAC5E,MAAM,OAAO,OAAO,UAAU,IAAI,YAAY,KAAK,cAAc,CAAC,CAAC;EACnE,MAAM,SAAS,MAAM,WAAW,QAAQ,IAAI;EAC5C,MAAM,QAAQ,KAAK,SAAS,KAAK;EACjC,MAAM,aAAa,MAAM,WAAW,CAAC;EACrC,MAAM,SAAS,IAAI,IAAI,aAAa,MAAM;GACxC,MAAM,MAAqC,CAAC;GAC5C,KAAK,aAAa,GAAG,KAAK,eAAe,MAAM,CAAC;GAChD,OAAO;EACT,CAAC;EACD,MAAM,MAAM,IAAI,WAAW,CAAC,GAAG,OAAO,GAAG,IAAI,QAAQ,MAAM,CAAC,IAAI,GAAG,MAAM,MAAM,CAAC;EAChF,MAAM,aAAyB,IAAI,QAAQ,IAAI,IAAI,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,CAAU,CAAC;EACtF,MAAM,8BAAc,IAAI,QAA+C;EACvE,OAAO,SAAS,OAAO,MACrB,MAAM,SAAS,OAAO;GACpB,IAAI,WAAW,IAAI,EAAE,GAAG;GACxB,MAAM,IAAI,YAAY,IAAI,EAAE;GAC5B,IAAI,MAAM,KAAA,GAAW,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC;QACvC,EAAE,KAAK,CAAC;EACf,CAAC,CACH;EACA,MAAM,cAAc,IAAI,QACtB,MACC,OAAO,GAAG,GAAG,YAAY,OAAO,OAAO,MAAM,GAAG,GAAG,WACtD;EACA,MAAM,QAAQ,eAAe,aAAa,MAAM,SAAS,CAAC,CAAC;EAG3D,MAAM,UAAyB,CAAC;EAChC,MAAM,aAAa,eAAe,MAAuB;EACzD,MAAM,gBACJ,IACA,WACA,QACG;GACH,MAAM,KAAK,GAAG,IAAI,QAAQ,EAAE,EAAE,GAAG,IAAI,MAAM;GAC3C,OAAO,OAAO,UAAU,eAAe,IAAI,YAAY,EAAE,SAAS;IAChE,MAAM,IAAI,KAAK,UAAU,IAAI,OAAO,WAAW,MAAM,MAAM,OAAO,KAAK,CAAC;IACxE,eAAe,IAAI,YAAY,IAAI,CAAC;IACpC,OAAO;GACT,CAAC;EACH;EACA,MAAM,aAAa,IAAI,UAAU,OAAO,QAAiB;GACvD,MAAM,MAAM,YAAY,GAAG,IAAI,IAAI,GAAG,IAAI;GAC1C,IAAI,QAAQ,KAAA,GACV,OAAO,IAAI,QAAQ,SAAS,SACxB,OAAO,KAAK,+BAA+B,IAAI,OAAO,KAAK,IAC3D;GAEN,IAAI,cAAuB,OAAO,KAAK;GACvC,MAAM,KAAK,IAAI,OAAO,MAAM,OAAO;IACjC,IAAI,GAAG,cAAc,KAAA,GAAW,OAAO;IACvC,MAAM,IAAI,aAAa,IAAI,GAAG,WAAW,GAAG;IAC5C,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;IAC7B,IAAI,OAAO,OAAO,WAAW,GAAG,cAAc;IAC9C,OAAO;GACT,CAAC;GACD,IAAI,IAAI,qBAAqB,EAAE,GAC7B,OAAO,eAAe,IAAI,OAAO,IAAI,SAAS,IAC1C,UACA,OAAO,KACL,GAAG,IAAI,OAAO,IAAI,yCAAyC,KAAK,WAAW,GAC7E;GAEN,QAAQ,KAAK;IAAE;IAAK,KAAK;GAAG,CAAC;GAC7B,OAAO;EACT,CAAC;EACD,IAAI,OAAO,OAAO,UAAU,GAAG,OAAO;EAEtC,MAAM,eAAe,MAAM,MAAM,OAAO,GAAG,YAAY,KAAA,CAAS;EAChE,MAAM,QAAQ,eAAe,MAAc;EAE3C,MAAM,aAA8B,CAAC;EACrC,IAAI,eAAwB,OAAO,KAAK;EAExC,MAAM,sBAA+B;GACnC,MAAM,SAAS,MAAM,KAAK,EAAE,QAAQ,MAAM,OAAO,SAAS,CAAC;GAC3D,MAAM,aAAgC,WAAW,UAAU,CAAC,CAAC;GAC7D,MAAM,WAAW,IAAI,UAAU,aAAa,EAAE,KAAK,SAAS;IAC1D,MAAM,KAAK,WAAW,IAAI,EAAE;IAC5B,IAAI,OAAO,KAAA,GAAW;KACpB,OAAO,OAAO,OAAO,OAAO,KAAK;KACjC,OAAO,eAAe,OAAO,QAAQ,IAAI,IAAI,IAAI,OAAO;IAC1D;IACA,MAAM,SAAS,YAAY,IAAI,EAAE,KAAK,CAAC;IACvC,OAAO,SAAS,MAAM,WAAW,EAAE,EAAE,KAAK,GAAG,CAAC;IAC9C,OAAO,OAAO,QAAQ,IAAI,OAAO,KAAK,GAAG,GAAG;GAC9C,CAAC;GACD,MAAM,MAAM,GAAG,OAAO,KAAK,GAAG,EAAE,GAAG,SAAS,KAAK,GAAG;GACpD,IAAI,eAAe,IAAI,OAAO,GAAG,GAAG,OAAO,OAAO,KAAK,qBAAqB;GAC5E,eAAe,IAAI,OAAO,GAAG;GAE7B,IAAI,MAAM,eAAe,KAAA,GACnB;QAAA,CAAC,KAAK,SAAS,MAAM,YAAY,QAAQ,UAAU,GACrD,OAAO,OAAO,KAAK,kBAAkB,EAAE,IAAI,oCAAoC;GAAA,OAE5E,IAAI,OAAO,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,OAAO,KAAK,oBAAoB;GAE7E,MAAM,aAAa,IAAI,UAAU,aAAa,GAAG,MAC/C,KAAK,UACH,GACA,GACA;IAAE,MAAM,OAAO,KAAK,WAAW,MAAM,CAAC,CAAC;IAAG,QAAQ,IAAI;IAAQ,iBAAiB;GAAO,GACtF,MACA,OAAO,KAAK,CACd,CACF;GACA,IAAI,OAAO,OAAO,UAAU,GAAG,OAAO;GAEtC,MAAM,UAAU,IAAI,IAAI,aAAa,EAAE,UAAU,IAAI,MAAM;GAC3D,MAAM,YAAY,IAAI,UAAU,aAAa,EAAE,KAAK,SAClD,WAAW,IAAI,EAAE,IACb,KAAK,WAAW,GAAG,SAAS;IAAE,MAAM;IAAoB,MAAM;IAAG,QAAQ,IAAI;GAAO,CAAC,IACrF,OACN;GACA,IAAI,OAAO,OAAO,SAAS,GAAG,OAAO;GACrC,IAAI,MAAM,eAAe,KAAA,GAAW;IAClC,MAAM,IAAI,KAAK,aAAa,MAAM,YAAY,QAAQ,YAAY,GAAG,OAAO;IAC5E,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;GAC/B;GACA,OAAO,KAAK,WAAW,MAAM,SAAS;IAAE,MAAM;IAAS,MAAM;IAAG,SAAS;GAAQ,CAAC;EACpF;EAEA,MAAM,UAAU,MAAuB;GACrC,MAAM,SAAS,QAAQ;GACvB,IAAI,WAAW,KAAA,GAAW;IACxB,MAAM,IAAI,cAAc;IACxB,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;IAC7B,IAAI,EAAE,UAAU,yBAAyB,OAAO,OAAO,YAAY,GAAG,eAAe;IACrF,OAAO;GACT;GACA,OAAO,IAAI,KAAK,OAAO,MAAM,OAAO;IAClC,WAAW,KAAK;KAAE,KAAK,OAAO;KAAK;IAAG;IACtC,OAAO,OAAO,IAAI,CAAC;GACrB,CAAC;EACH;EACA,IAAI,OAAO,CAAC,GAAG,OAAO;EACtB,OAAO,OAAO,OAAO,oBAAoB,OAAO,KAAK,GAAG,EAAE,IAAI,0BAA0B,CAAC;CAC3F;;CAOA,SACE,IACA,QACA,YACS;EACT,MAAM,OAAO,OAAO,OAAO,UAAU,CAAC,CAAC;EACvC,OAAO,KAAK,KAAK,IAAI,QAAQ,YAAY,CAAC,CAAC,CAAC,MAAM,MAAM,OAAO,CAAC,MAAM,IAAI;CAC5E;CAEA,UAAkB,IAA4D;EAC5E,OAAO,UAAU,SAAS,EAAE,IACxB,OAAO,gBAAgB,KAAK,MAAM,YAAY,IAAI,EAAE,CAAC,IACrD,OAAO,KAAK,EAAE;CACpB;;CAGA,KACE,KACA,KACA,YACA,OAC8B;EAC9B,MAAM,WAAW,KAAK,UAAU,GAAG;EACnC,IAAI,OAAO,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,CAAC;EACnD,MAAM,KAAK,SAAS;EACpB,MAAM,EAAE,KAAK,QAAQ,YAAY,EAAE;EACnC,IAAI,GAAG,SAAS,oBAAoB;GAClC,MAAM,IAAI,WAAW,IAAI,EAAE;GAC3B,IAAI,MAAM,KAAA,GAAW,OAAO,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC;GACjD,MAAM,QAAQ,IAAI,MAAM;GACxB,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK;GAC9B,OAAO,KAAK,MACR,CAAC,IACD,IAAI,IAAI,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;IACjC,MAAM,KAAK,IAAI,MAAM;IACrB,GAAG,KAAK,QAAQ;IAChB,OAAO;GACT,CAAC;EACP;EACA,MAAM,QAAQ,MACZ,GAAG,SAAS,UACR,OAAO,GAAG,YAAY,SAAS,MAAM,KAAK,KAAK,GAAG,GAAG,YAAY,QAAQ,CAAC,CAAC,CAAC,IAC5E,IAAI,OAAO,GAAG,aAAa,CAAC,CAAC,IAAI,MAAoC,MACnE,IAAI,qBAAqB,IAAI,IACzB,OACA,OAAO,KAAK,SAAS,MAAM,KAAK,KAAK,GAAG,GAAG,YAAY,QAAQ,CAAC,CAAC,CAAC,CACxE;EACN,MAAM,SAAS,eAAe,MAAqC;EACnE,IAAI,QAAQ,GAAG,eAAe,IAAI,QAAQ,OAAO,GAAG,GAAG,GAAG;EAC1D,QAAQ;GAAE,GAAG;GAAG,UAAU,CAAC,GAAG;EAAE,IAAI,EAAE,GAAG,eAAe;GACtD,IAAI,IAAI,OAAO,IAAI,qBAAqB,QAAQ,GAAG,OAAO,OAAO,KAAK;GACtE,MAAM,OAAO,OAAO,SAAS,QAAQ,IAAI,CAAC;GAC1C,IAAI,IAAI,KAAK,OAAO,OAAO,KAAK;IAAE,GAAG,IAAI;IAAG,UAAU;GAAK,CAAC;GAC5D,MAAM,QAAQ,IAAI,OAAO,OAAO,MAAM;IACpC,MAAM,IAAI,OAAO,CAAC;IAClB,IAAI,eAAe,IAAI,QAAQ,CAAC,GAAG,OAAO;IAC1C,eAAe,IAAI,QAAQ,GAAG,CAAC;IAC/B,OAAO;GACT,CAAC;GACD,OAAO,OAAO,KAAK;IAAE,GAAG,IAAI;IAAG,UAAU;GAAM,CAAC;EAClD,CAAC;EACD,OAAO,IAAI,aAAa,eAAe,OAAO,MAAM,CAAC;CACvD;;CAGA,aACE,KACA,QACA,YACA,GACA,SACS;EACT,MAAM,SACJ,MACA,SACU;GACV,IAAI,UAAU,SAAS,IAAI,GAAG;IAC5B,IAAI,eAAe,IAAI,MAAM,IAAI,GAAG,OAAO;IAC3C,eAAe,IAAI,MAAM,IAAI;GAC/B;GACA,MAAM,WAAW,KAAK,UAAU,IAAI;GACpC,IAAI,OAAO,OAAO,QAAQ,GAAG,OAAO;GACpC,MAAM,KAAK,SAAS;GACpB,IAAI,GAAG,SAAS,oBAAoB;IAClC,MAAM,IAAI,WAAW,IAAI,EAAE;IAC3B,OAAO;KAAE,MAAM,MAAM,KAAA,MAAc,OAAO,MAAM,KAAK;KAAG,GAAG;IAAQ;GACrE;GACA,IAAI,OAAO;GACX,MAAM,SAAS,IAAI,UAAU,GAAG,cAAc,MAAM;IAClD,MAAM,IAAI,MAAM,GAAG,IAAI;IACvB,IAAI,OAAO,OAAO,EAAE,CAAC,GAAG,OAAO,OAAO,KAAK,CAAC;IAC5C,SAAS,EAAE;IACX,OAAO,OAAO,KAAK;GACrB,CAAC;GACD,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,OAAO;GACzC,IAAI,QAAQ,YAAY,EAAE,CAAC,CAAC,MAAM,GAAG;IACnC,MAAM,IAAI,KAAK,WAAW,GAAG,SAAS;KAAE,MAAM;KAAoB,MAAM;KAAG;IAAQ,CAAC;IACpF,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO;KAAE;KAAM;IAAE;GACzC;GACA,OAAO;IAAE;IAAM,GAAG;GAAQ;EAC5B;EACA,OAAO,MAAM,KAAK,eAAe,MAAM,CAAC,CAAC,CAAC;CAC5C;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClnBA,MAAa,eAA0C,QAAQ,UAC7D,gDACA,EACE,qBAAqB,EACnB,OAAO,QACL,OAAO,KAAK,IAAI,gBAAgB;CAAE;CAAK,SAAS;AAAgC,CAAC,CAAC,EACtF,GACF,CACF;;;;;;;AAQA,MAAa,eAAe,WAC1B,MAAM,QAAQ,cAAc,MAAM;;;;;;;;AASpC,MAAa,oBAAoB,aAA6D,EAC5F,OAAO,QAAQ;CACb,MAAM,IAAI,QAAQ;CAClB,OAAO,MAAM,KAAA,IACT,OAAO,KAAK,IAAI,gBAAgB;EAAE;EAAK,SAAS;CAAiB,CAAC,CAAC,IACnE,OAAO,QAAQ,CAAC;AACtB,EACF;;;;;;;;;AAgFA,MAAa,iBAAiB,OAAO,WAAW,WAC9C,QACA,WACA;CACA,IAAI,OAAO,YAAY,KAAA,KAAa,IAAI,qBAAqB,OAAO,OAAO,GAAG,OAAO;CACrF,MAAM,SAAS,OAAO;CACtB,MAAM,OAAO,eAAe,aAAa,cAAc,KAAA,IAAY,CAAC,IAAI,CAAC,SAAS,CAAC;CACnF,MAAM,SAAiC,CAAC,GAAI,OAAO,UAAU,CAAC,CAAE;CAChE,MAAM,SAAS,eAAe,aAAa,OAAO,KAAK,MAAM,EAAE,EAAE,CAAC;CAElE,MAAM,QAAQ,UACZ,IAAI,MAAM,OAAO;EACf,eAAe,OAAO;EACtB,aAAa,CAAC,KAAK,GAAG,UAAU;GAC9B,IAAI,eAAe,IAAI,MAAM,GAAG,GAAG,OAAO,KAAK,IAAI;GACnD,eAAe,IAAI,MAAM,GAAG;GAC5B,OAAO,OAAO,QAAQ,OAAO,KAAK,GAAG,IAAI,aAAa;IACpD,SAAS,QAAQ,SAAS,MAAM;KAC9B,IAAI,eAAe,IAAI,QAAQ,EAAE,EAAE,GAAG;KACtC,eAAe,IAAI,QAAQ,EAAE,EAAE;KAC/B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,MAAM,GAAI,SAAS,WAAW,CAAC,CAAE,CAAC;GACpD,CAAC;EACH;CACF,CAAC;CACH,OAAO,KAAK,OAAO,OAAO;CAC1B,MAAM,EAAE,SAAS,GAAG,GAAG,SAAS;CAGhC,OAAO,IAAI,wBAAwB,MAAM,IAAI;EAAE,GAAG;EAAM;CAAO,IAAI;AACrE,CAAC;AAMD,MAAM,cAAc,QAClB,IAAI,OAAO,MAAM,CAAC,UAAU,SAAS,EAAE,MAAM,eAAe,CAAC;;;;;;;;;;AAW/D,MAAa,OAAO,OAAO,WAAW,WAAW,QAAsB,UAAmB,CAAC,GAAG;CAC5F,MAAM,WAAW,OAAO,eAAe,QAAQ,QAAQ,SAAS;CAChE,OAAOG,MAAgB,QAAQ;CAC/B,MAAM,QAAQC,UAAoB,QAAQ;CAC1C,MAAM,cAAc,OAAOC;CAC3B,MAAM,UACJ,QAAQ,oBAAoB,KAAA,IACxB,cACAC,iBAAwB,aAAa,QAAQ,eAAe;CAClE,MAAM,UAAU,eAAe,aAC7B,IAAI,IAAI,QAAQ,gBAAgB,UAAU,CAAC,IAAI,MAAM,CAAC,EAAE,IAAI,CAAC,CAAU,CACzE;CAEA,MAAM,YACJ,SACA,aAEA,OAAO,cAAc;EACnB,MAAM,QAAQ,WAAW,QAAQ,IAAI,WAAWC,QAAiB,UAAU,OAAO;EAClF,MAAM,UAAU,IAAI,UAAU,QAAQ,MACpCC,QAAiB,EAAE,KAAK,IACpB,SAAS,UAAU,KAAA,IACjB,OAAO,KAAK,sDAAsD,IAClE,OAAO,KAAK,IACd,MAAM,OAAO,IAAI,EAAE,KAAK,IACtB,OAAO,KAAK,IACZ,OAAO,KAAK,qCAAqC,EAAE,OAAO,CAClE;EACA,IAAI,OAAO,OAAO,OAAO,GACvB,OAAO,OAAO,KAAK,IAAI,oBAAoB,EAAE,SAAS,QAAQ,MAAM,CAAC,CAAC;EAExE,MAAM,SAAS,IAAI,OAAO,OAAO,SAAS,SAAS,OAAO;EAC1D,MAAM,eAAe,OAAO,WAAW,SAAS,WAAW;GACzD,MAAM;GACN,MAAM,KAAA;EACR,CAAC;EACD,MAAM,UAA8B,MAAM,KAAK,MAAM;GACnD,MAAM,SAAS,OAAO,OAAO,oBAC3BA,QAAiB,EAAE,KAAK,IACpB,OAAO,cAAc,EAAE,MAAM,eAAe,MAAM,CAAC,IACnD,OAAO,cAAc,EAAE,MAAM,EAAE,OAAO,eAAe,MAAM,CAAC,CAClE;GACA,OAAO,OAAO,MAAM,QAAQ;IAC1B,eAA4B;KAAE,MAAM,EAAE;KAAM,OAAO,EAAE;KAAO,QAAQ;IAAa;IACjF,SAAS,SAAsB;KAC7B,MAAM,EAAE;KACR,OAAO,EAAE;KACT,QAAQ;KACR,QAAQ;IACV;GACF,CAAC;EACH,CAAC;EACD,MAAM,aAAa,QAAQ,OAAO,MAAM,EAAE,WAAW,YAAY;EACjE,OAAO,OAAO,GACZ,OAAO,oBAAoB;GACzB,qBAAqB,QAAQ;GAC7B,sBAAsB,QAAQ,QAAQ,MAAM,EAAE,WAAW,eAAe,CAAC,CAAC;GAC1E,mBAAmB;EACrB,CAAC,GACD;GAAE;GAAS;EAAW,CACxB;CACF,CAAC,CAAC,CAAC,KAAK,OAAO,SAAS,eAAe,CAAC;CAI1C,OAAO;EAAE,QAAQ;EAAU;EAAO;CAAS;AAC7C,CAAC;;;;;;;AAQD,MAAa,YACX,SACA,QACA,UACA,UAAmB,CAAC,MAEpB,OAAO,QAAQ,KAAK,QAAQ,OAAO,IAAI,MAAM,EAAE,SAAS,SAAS,QAAQ,CAAC;;;;;;;AAQ5E,MAAa,gBACX,SACA,QACA,MACA,OACA,UAAmB,CAAC,MAGpB,OAAO,IAAI,SAAS,SAAS,QAAQ,CAAC;CAAE;CAAM;AAAM,CAAC,GAAG,OAAO,IAAI,MACjE,IAAI,UAAU,EAAE,SAAS,CAAC,CAC5B;;;;;;;;AAaF,MAAa,gBAAgB,WAAgC;CAC3D,MAAM,QAAQA,QAAiB,OAAO,KAAK,IAAI,UAAU,IAAI,OAAO,MAAM;CAC1E,MAAM,cAAc,GAAG,OAAO,KAAK,IAAI,GAAG;CAC1C,OAAO,OAAO,WAAW,KAAA,IACrB,GAAG,YAAY,IAAI,OAAO,WAC1B,GAAG,YAAY,IAAI,OAAO;AAChC;AAGA,MAAM,kBACJ,SACA,MACA,YACsB;CACtB,MAAM,SAAS,IAAI,IACjB,UACC,WACC,IAAI,YAAY,aAAa;EAAE,SAAS,aAAa,MAAM;EAAG;CAAO,GAAG,QAAQ,OAAO,CAC3F;CACA,OAAO,IAAI,YAAY,UAAA,cAAgC,KAAK,QAAQ,IAAI;AAC1E;;;;;;;;;;;;;;;;;;;;AAqBA,MAAa,UACX,WACA,aACsF;CACtF,MAAM,MAA8B,UAAU,WAAW,CAAC,QAAQ,IAAI;CACtE,OAAA,cAA6B,KAC3B,OAAO,SACLC,eACA,qBAAqB,gBAAgB;EACnC,SAAS,MAAuB,YAC9B,UAAU,SAAS,MAAM,GAAG,CAAC,CAAC,KAC5B,OAAO,UACJ,MAAM,IAAI,YAAY,aAAa,EAAE,SAAS,EAAE,QAAQ,GAAG,MAAM,OAAO,CAC3E,GACA,OAAO,SAAS,WAAW;GACzB,MAAM,UAAU,IAAI,OAAO,OAAO,UAAU,MAAM,EAAE,WAAW,eAAe;GAC9E,OAAO,IAAI,wBAAwB,OAAO,IACtC,OAAO,KAAK,eAAe,SAAS,MAAM,OAAO,CAAC,IAClD,OAAO,QAAQ,IAAI;EACzB,CAAC,CACH;EACF,SAAS,SAA0B,OAAO,QAAQ,IAAI;CACxD,CAAC,CACH,CACF;AACF"}

package/dist/Validator-Dl8cih5V.d.mts

@@ -0,0 +1,207 @@
+import { d as NamedNode, s as GroundTerm } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+import "./index-Cms2TYfC.mjs";
+import { c as ShapeId, l as ShapesGraph, u as ShapesGraphError } from "./Shapes-BQFDFc4Q.mjs";
+import { r as SparqlEvaluationError } from "./Sparql-DecpWTPh.mjs";
+import { i as ValidationReport } from "./ValidationReport-Dx3WxY0h.mjs";
+import * as Schema from "effect/Schema";
+import * as Effect from "effect/Effect";
+import * as Context from "effect/Context";
+import * as Layer from "effect/Layer";
+declare namespace Validator_d_exports {
+  export { ConformanceError, RecursiveShapeError, SchemaOptions, UnsupportedFeatureError, ValidateOptions, ValidationError, Validator, assertConforms, conforms, layer, make, schema, severities, validate, validateNode };
+}
+declare const RecursiveShapeError_base: Schema.Class<RecursiveShapeError, Schema.TaggedStruct<"RecursiveShapeError", {
+  readonly message: Schema.String;
+  readonly shape: Schema.String;
+  readonly focusNode: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * Validation reached a shape again for the same focus node while still
+ * validating it (a recursive shape). The SHACL specification leaves the
+ * validation of recursive shapes undefined.
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class RecursiveShapeError extends RecursiveShapeError_base {}
+declare const UnsupportedFeatureError_base: Schema.Class<UnsupportedFeatureError, Schema.TaggedStruct<"UnsupportedFeatureError", {
+  readonly message: Schema.String;
+  readonly feature: Schema.String;
+  readonly shape: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * The shapes graph uses a feature this validator cannot evaluate (currently:
+ * SHACL-SPARQL constraints and targets when no
+ * `Sparql.SparqlConstraintEvaluator` is provided).
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class UnsupportedFeatureError extends UnsupportedFeatureError_base {}
+declare const ConformanceError_base: Schema.Class<ConformanceError, Schema.TaggedStruct<"ConformanceError", {
+  readonly message: Schema.String;
+  readonly report: Schema.declare<ValidationReport, ValidationReport>;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * The data graph does not conform to the shapes graph (raised by
+ * `Validator.check` and `assertConforms`).
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class ConformanceError extends ConformanceError_base {}
+/**
+ * The errors that can prevent validation from producing a report (SHACL
+ * "failures").
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+type ValidationError = ShapesGraphError | RecursiveShapeError | UnsupportedFeatureError | SparqlEvaluationError;
+/**
+ * Validation options.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ValidateOptions {
+  /**
+   * Validate the union of the data graph and the shapes graph (useful when
+   * the data graph declares `sh:shapesGraph`, or the shapes and data live in
+   * the same document). Default `false`.
+   */
+  readonly includeShapesGraph?: boolean | undefined;
+  /**
+   * What to do with SHACL-SPARQL constraints and targets when no
+   * `Sparql.SparqlConstraintEvaluator` is provided: `"fail"` (default) fails
+   * with an `UnsupportedFeatureError`, `"ignore"` skips them.
+   */
+  readonly sparql?: 'fail' | 'ignore' | undefined;
+  /**
+   * What to do when a shape is (directly or indirectly) validated against a
+   * focus node while it is already being validated against the same node:
+   * `"fail"` (default) fails with a `RecursiveShapeError`, `"ignore"` treats
+   * the recursive reference as conforming.
+   */
+  readonly recursion?: 'fail' | 'ignore' | undefined;
+  /**
+   * Attach the nested results that caused `sh:node`, `sh:not`, `sh:and`,
+   * `sh:or`, `sh:xone` and qualified value shape results as `sh:detail`.
+   * Default `false`.
+   */
+  readonly details?: boolean | undefined;
+}
+/**
+ * Validates a data graph against a shapes graph (either an RDF dataset, which
+ * is parsed first, or a pre-parsed `Shapes.ShapesGraph`).
+ *
+ * SPARQL-based constraints and targets are delegated to a
+ * `Sparql.SparqlConstraintEvaluator` when one is present in the context.
+ *
+ * @since 0.1.0
+ * @category validation
+ */
+declare const validate: (dataGraph: Dataset, shapesGraph: Dataset | ShapesGraph, options?: ValidateOptions) => Effect.Effect<ValidationReport, ValidationError>;
+/**
+ * Validates a single focus node against one shape of a shapes graph,
+ * ignoring targets.
+ *
+ * @since 0.1.0
+ * @category validation
+ */
+declare const validateNode: (dataGraph: Dataset, shapesGraph: Dataset | ShapesGraph, shape: ShapeId, focusNode: GroundTerm, options?: ValidateOptions) => Effect.Effect<ValidationReport, ValidationError>;
+/**
+ * Whether a data graph conforms to a shapes graph.
+ *
+ * @since 0.1.0
+ * @category validation
+ */
+declare const conforms: (dataGraph: Dataset, shapesGraph: Dataset | ShapesGraph, options?: ValidateOptions) => Effect.Effect<boolean, ValidationError>;
+/**
+ * Validates and fails with a `ConformanceError` (carrying the report) when
+ * the data graph does not conform; succeeds with the data graph otherwise.
+ *
+ * @since 0.1.0
+ * @category validation
+ */
+declare const assertConforms: (dataGraph: Dataset, shapesGraph: Dataset | ShapesGraph, options?: ValidateOptions) => Effect.Effect<Dataset, ValidationError | ConformanceError>;
+declare const Validator_base: Context.ServiceClass<Validator, "@thomasfosterau/effect-rdf/shacl/Validator", {
+  /** The compiled shapes graph. */
+  readonly shapesGraph: ShapesGraph;
+  /** Validates a data graph, producing a report. */
+  readonly validate: (dataGraph: Dataset, options?: ValidateOptions) => Effect.Effect<ValidationReport, ValidationError>;
+  /** Whether a data graph conforms. */
+  readonly conforms: (dataGraph: Dataset, options?: ValidateOptions) => Effect.Effect<boolean, ValidationError>;
+  /** Succeeds with the data graph if it conforms, failing with a `ConformanceError` otherwise. */
+  readonly check: (dataGraph: Dataset, options?: ValidateOptions) => Effect.Effect<Dataset, ValidationError | ConformanceError>;
+}>;
+/**
+ * A validator bound to a pre-compiled shapes graph.
+ *
+ * @since 0.1.0
+ * @category services
+ */
+declare class Validator extends Validator_base {}
+/**
+ * Compiles a shapes graph into a `Validator` service implementation. The
+ * given options are defaults that individual calls may override.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const make: (shapesGraph: Dataset | ShapesGraph, defaults?: ValidateOptions) => Effect.Effect<Validator['Service'], ShapesGraphError>;
+/**
+ * A layer providing a `Validator` for the given shapes graph.
+ *
+ * @since 0.1.0
+ * @category layers
+ */
+declare const layer: (shapesGraph: Dataset | ShapesGraph, defaults?: ValidateOptions) => Layer.Layer<Validator, ShapesGraphError>;
+/**
+ * Options for `schema`: validation options plus the severity that fails
+ * decoding.
+ *
+ * @since 0.1.0
+ * @category schemas
+ */
+interface SchemaOptions extends ValidateOptions {
+  /**
+   * The least severe result that fails decoding: `"violation"` (default)
+   * accepts data whose results are only `sh:Warning` or `sh:Info`,
+   * `"warning"` also fails on warnings, and `"info"` on any result (the
+   * report's own `conforms`, which is false whenever there is any result).
+   * Results with a custom severity count as violations.
+   */
+  readonly failOn?: 'violation' | 'warning' | 'info' | undefined;
+}
+/**
+ * A `Schema` that accepts a `Dataset` only if it conforms to the given shapes
+ * graph. Decoding fails with a `SchemaIssue.Composite` holding one
+ * `InvalidValue` issue per failing result: its `message` annotation is the
+ * formatted result (`ValidationReport.formatResult`) and its `result`
+ * annotation the `ValidationResult` itself, for consumers that inspect
+ * failures (focus node, path, constraint component, severity, messages). By
+ * default only `sh:Violation` results fail (see `SchemaOptions.failOn`).
+ * Encoding is the identity.
+ *
+ * Compose it with a syntax codec to parse and validate in one decode:
+ * `Turtle.codec.schema.pipe(Schema.decodeTo(Validator.schema(shapes)))`.
+ *
+ * @since 0.1.0
+ * @category schemas
+ */
+declare const schema: (shapesGraph: ShapesGraph, options?: SchemaOptions) => Schema.decodeTo<Schema.declare<Dataset>, Schema.declare<Dataset>>;
+/**
+ * The SHACL `sh:Violation`, `sh:Warning` and `sh:Info` severities.
+ *
+ * @since 0.1.0
+ * @category constants
+ */
+declare const severities: {
+  readonly Violation: NamedNode<"http://www.w3.org/ns/shacl#Violation">;
+  readonly Warning: NamedNode<"http://www.w3.org/ns/shacl#Warning">;
+  readonly Info: NamedNode<"http://www.w3.org/ns/shacl#Info">;
+};
+export { ValidateOptions as a, Validator_d_exports as c, layer as d, make as f, validateNode as g, validate as h, UnsupportedFeatureError as i, assertConforms as l, severities as m, RecursiveShapeError as n, ValidationError as o, schema as p, SchemaOptions as r, Validator as s, ConformanceError as t, conforms as u };
+//# sourceMappingURL=Validator-Dl8cih5V.d.mts.map