@thomasfosterau/effect-rdf 0.0.0-stage → 0.1.0

package/dist/Functions-AvjNcId_.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Functions-AvjNcId_.mjs","names":["Term.namedNode","Term.Literal","Term.isLiteral","Xsd.isNumericDatatype","Xsd.isValidLexical","Xsd.toValue","Xsd.canonicalDecimal","Xsd.canonicalDouble","StringMap.setOf","Xsd.isKnownDatatype","Term.isTriple","Xsd.isWellFormed","Term.isBlankNode","Term.isNamedNode","V.fail","StringMap.fromEntries","Term.isLiteral","V.isStringLiteral","V.isSimpleString","Term.Literal","V.requireNum","V.numLiteral","StringMap.empty","Xsd.isValidLexical","V.simple","V.stringLike","Term.isNamedNode","Term.namedNode","Iri.resolve","V.bool","V.toNumber","Hash.md5","Hash.sha1","Hash.sha256","Hash.sha384","Hash.sha512","Term.literal","Term.isBlankNode","V.isNumeric","Term.isTriple","Term.triple","V.XSD","StringMap.setOf","Xsd.canonicalDouble","numeric","V.numeric","Xsd.canonicalDecimal","V.ebv","V.toDecimal","Term.XSD_STRING"],"sources":["../src/sparql/internal/hash.ts","../src/sparql/internal/values.ts","../src/sparql/Functions.ts"],"sourcesContent":["/**\n * Pure, synchronous implementations of MD5, SHA-1, SHA-256, SHA-384 and\n * SHA-512 over UTF-8 strings, returning lower-case hex digests.\n *\n * @internal\n */\n\nconst utf8 = (s: string): Uint8Array => new TextEncoder().encode(s);\n\nconst hex = (bytes: Uint8Array): string =>\n  Array.from(bytes, (b) => b.toString(16).padStart(2, '0')).join('');\n\n/** `0 … n - 1`. */\nconst range = (n: number): ReadonlyArray<number> => Array.from({ length: n }, (_, i) => i);\n\n/** The offsets of the `blockSize`-byte blocks of a padded message. */\nconst blocks = (m: Uint8Array, blockSize: number): ReadonlyArray<number> =>\n  range(m.length / blockSize).map((b) => b * blockSize);\n\nconst pad = (msg: Uint8Array, blockSize: number, lengthBytes: number, littleEndian: boolean) => {\n  const bitLen = BigInt(msg.length) * 8n;\n  const total = Math.ceil((msg.length + 1 + lengthBytes) / blockSize) * blockSize;\n  const out = new Uint8Array(total);\n  out.set(msg);\n  out[msg.length] = 0x80;\n  range(lengthBytes).forEach((i) => {\n    const byte = Number((bitLen >> BigInt(8 * i)) & 0xffn);\n    if (littleEndian) out[total - lengthBytes + i] = byte;\n    else out[total - 1 - i] = byte;\n  });\n  return out;\n};\n\nconst rotl = (x: number, n: number) => (x << n) | (x >>> (32 - n));\nconst rotr = (x: number, n: number) => (x >>> n) | (x << (32 - n));\n\n/** Big-endian 32-bit words of a digest, as hex. */\nconst hexWords = (words: ReadonlyArray<number>): string =>\n  words.map((x) => (x >>> 0).toString(16).padStart(8, '0')).join('');\n\n// --- MD5 ---------------------------------------------------------------------\n\nconst MD5_S = [\n  7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14,\n  20, 5, 9, 14, 20, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6,\n  10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,\n];\n\n/** One MD5 step: its index, constant, shift and message word. */\ninterface Md5Step {\n  readonly i: number;\n  readonly k: number;\n  readonly s: number;\n  readonly g: number;\n}\n\nconst MD5_STEPS: ReadonlyArray<Md5Step> = MD5_S.map((s, i) => ({\n  i,\n  k: Math.floor(Math.abs(Math.sin(i + 1)) * 2 ** 32) | 0,\n  s,\n  g: i < 16 ? i : i < 32 ? (5 * i + 1) % 16 : i < 48 ? (3 * i + 5) % 16 : (7 * i) % 16,\n}));\n\nexport const md5 = (input: string): string => {\n  const m = pad(utf8(input), 64, 8, true);\n  let a0 = 0x67452301;\n  let b0 = 0xefcdab89 | 0;\n  let c0 = 0x98badcfe | 0;\n  let d0 = 0x10325476;\n  const view = new DataView(m.buffer);\n  blocks(m, 64).forEach((off) => {\n    let a = a0;\n    let b = b0;\n    let c = c0;\n    let d = d0;\n    MD5_STEPS.forEach(({ i, k, s, g }) => {\n      const f =\n        i < 16\n          ? (b & c) | (~b & d)\n          : i < 32\n            ? (d & b) | (~d & c)\n            : i < 48\n              ? b ^ c ^ d\n              : c ^ (b | ~d);\n      const tmp = d;\n      d = c;\n      c = b;\n      b = (b + rotl((a + f + k + (view.getUint32(off + g * 4, true) | 0)) | 0, s)) | 0;\n      a = tmp;\n    });\n    a0 = (a0 + a) | 0;\n    b0 = (b0 + b) | 0;\n    c0 = (c0 + c) | 0;\n    d0 = (d0 + d) | 0;\n  });\n  const out = new DataView(new ArrayBuffer(16));\n  [a0, b0, c0, d0].forEach((x, i) => out.setUint32(i * 4, x >>> 0, true));\n  return hex(new Uint8Array(out.buffer));\n};\n\n// --- SHA-1 -------------------------------------------------------------------\n\nconst ROUNDS_16 = range(16);\nconst SCHEDULE_80 = range(80).slice(16);\nconst SCHEDULE_64 = range(64).slice(16);\nconst SHA1_ROUNDS = range(80);\n\nexport const sha1 = (input: string): string => {\n  const m = pad(utf8(input), 64, 8, false);\n  let h0 = 0x67452301;\n  let h1 = 0xefcdab89 | 0;\n  let h2 = 0x98badcfe | 0;\n  let h3 = 0x10325476;\n  let h4 = 0xc3d2e1f0 | 0;\n  const view = new DataView(m.buffer);\n  // The message schedule, 80 words.\n  const w = new DataView(new ArrayBuffer(80 * 4));\n  const word = (i: number) => w.getInt32(i * 4);\n  blocks(m, 64).forEach((off) => {\n    ROUNDS_16.forEach((i) => w.setInt32(i * 4, view.getUint32(off + i * 4) | 0));\n    SCHEDULE_80.forEach((i) =>\n      w.setInt32(i * 4, rotl(word(i - 3) ^ word(i - 8) ^ word(i - 14) ^ word(i - 16), 1)),\n    );\n    let a = h0;\n    let b = h1;\n    let c = h2;\n    let d = h3;\n    let e = h4;\n    SHA1_ROUNDS.forEach((i) => {\n      const f =\n        i < 20\n          ? (b & c) | (~b & d)\n          : i < 40\n            ? b ^ c ^ d\n            : i < 60\n              ? (b & c) | (b & d) | (c & d)\n              : b ^ c ^ d;\n      const k =\n        i < 20 ? 0x5a827999 : i < 40 ? 0x6ed9eba1 : i < 60 ? 0x8f1bbcdc | 0 : 0xca62c1d6 | 0;\n      const t = (rotl(a, 5) + f + e + k + word(i)) | 0;\n      e = d;\n      d = c;\n      c = rotl(b, 30);\n      b = a;\n      a = t;\n    });\n    h0 = (h0 + a) | 0;\n    h1 = (h1 + b) | 0;\n    h2 = (h2 + c) | 0;\n    h3 = (h3 + d) | 0;\n    h4 = (h4 + e) | 0;\n  });\n  return hexWords([h0, h1, h2, h3, h4]);\n};\n\n// --- SHA-256 -----------------------------------------------------------------\n\nconst K256 = [\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n].map((x) => x | 0);\n\nexport const sha256 = (input: string): string => {\n  const m = pad(utf8(input), 64, 8, false);\n  let h0 = 0x6a09e667;\n  let h1 = 0xbb67ae85 | 0;\n  let h2 = 0x3c6ef372;\n  let h3 = 0xa54ff53a | 0;\n  let h4 = 0x510e527f;\n  let h5 = 0x9b05688c | 0;\n  let h6 = 0x1f83d9ab;\n  let h7 = 0x5be0cd19;\n  const view = new DataView(m.buffer);\n  // The message schedule, 64 words.\n  const w = new DataView(new ArrayBuffer(64 * 4));\n  const word = (i: number) => w.getInt32(i * 4);\n  blocks(m, 64).forEach((off) => {\n    ROUNDS_16.forEach((i) => w.setInt32(i * 4, view.getUint32(off + i * 4) | 0));\n    SCHEDULE_64.forEach((i) => {\n      const x = word(i - 15);\n      const y = word(i - 2);\n      const s0 = rotr(x, 7) ^ rotr(x, 18) ^ (x >>> 3);\n      const s1 = rotr(y, 17) ^ rotr(y, 19) ^ (y >>> 10);\n      w.setInt32(i * 4, (word(i - 16) + s0 + word(i - 7) + s1) | 0);\n    });\n    let a = h0;\n    let b = h1;\n    let c = h2;\n    let d = h3;\n    let e = h4;\n    let f = h5;\n    let g = h6;\n    let hh = h7;\n    K256.forEach((k, i) => {\n      const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);\n      const ch = (e & f) ^ (~e & g);\n      const t1 = (hh + S1 + ch + k + word(i)) | 0;\n      const S0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);\n      const maj = (a & b) ^ (a & c) ^ (b & c);\n      const t2 = (S0 + maj) | 0;\n      hh = g;\n      g = f;\n      f = e;\n      e = (d + t1) | 0;\n      d = c;\n      c = b;\n      b = a;\n      a = (t1 + t2) | 0;\n    });\n    h0 = (h0 + a) | 0;\n    h1 = (h1 + b) | 0;\n    h2 = (h2 + c) | 0;\n    h3 = (h3 + d) | 0;\n    h4 = (h4 + e) | 0;\n    h5 = (h5 + f) | 0;\n    h6 = (h6 + g) | 0;\n    h7 = (h7 + hh) | 0;\n  });\n  return hexWords([h0, h1, h2, h3, h4, h5, h6, h7]);\n};\n\n// --- SHA-512 / SHA-384 (BigInt based) -------------------------------------------\n\nconst K512 = [\n  '428a2f98d728ae22',\n  '7137449123ef65cd',\n  'b5c0fbcfec4d3b2f',\n  'e9b5dba58189dbbc',\n  '3956c25bf348b538',\n  '59f111f1b605d019',\n  '923f82a4af194f9b',\n  'ab1c5ed5da6d8118',\n  'd807aa98a3030242',\n  '12835b0145706fbe',\n  '243185be4ee4b28c',\n  '550c7dc3d5ffb4e2',\n  '72be5d74f27b896f',\n  '80deb1fe3b1696b1',\n  '9bdc06a725c71235',\n  'c19bf174cf692694',\n  'e49b69c19ef14ad2',\n  'efbe4786384f25e3',\n  '0fc19dc68b8cd5b5',\n  '240ca1cc77ac9c65',\n  '2de92c6f592b0275',\n  '4a7484aa6ea6e483',\n  '5cb0a9dcbd41fbd4',\n  '76f988da831153b5',\n  '983e5152ee66dfab',\n  'a831c66d2db43210',\n  'b00327c898fb213f',\n  'bf597fc7beef0ee4',\n  'c6e00bf33da88fc2',\n  'd5a79147930aa725',\n  '06ca6351e003826f',\n  '142929670a0e6e70',\n  '27b70a8546d22ffc',\n  '2e1b21385c26c926',\n  '4d2c6dfc5ac42aed',\n  '53380d139d95b3df',\n  '650a73548baf63de',\n  '766a0abb3c77b2a8',\n  '81c2c92e47edaee6',\n  '92722c851482353b',\n  'a2bfe8a14cf10364',\n  'a81a664bbc423001',\n  'c24b8b70d0f89791',\n  'c76c51a30654be30',\n  'd192e819d6ef5218',\n  'd69906245565a910',\n  'f40e35855771202a',\n  '106aa07032bbd1b8',\n  '19a4c116b8d2d0c8',\n  '1e376c085141ab53',\n  '2748774cdf8eeb99',\n  '34b0bcb5e19b48a8',\n  '391c0cb3c5c95a63',\n  '4ed8aa4ae3418acb',\n  '5b9cca4f7763e373',\n  '682e6ff3d6b2b8a3',\n  '748f82ee5defb2fc',\n  '78a5636f43172f60',\n  '84c87814a1f0ab72',\n  '8cc702081a6439ec',\n  '90befffa23631e28',\n  'a4506cebde82bde9',\n  'bef9a3f7b2c67915',\n  'c67178f2e372532b',\n  'ca273eceea26619c',\n  'd186b8c721c0c207',\n  'eada7dd6cde0eb1e',\n  'f57d4f7fee6ed178',\n  '06f067aa72176fba',\n  '0a637dc5a2c898a6',\n  '113f9804bef90dae',\n  '1b710b35131c471b',\n  '28db77f523047d84',\n  '32caab7b40c72493',\n  '3c9ebe0a15c9bebc',\n  '431d67c49c100d4c',\n  '4cc5d4becb3e42b6',\n  '597f299cfc657e2a',\n  '5fcb6fab3ad6faec',\n  '6c44198c4a475817',\n].map((h) => BigInt(`0x${h}`));\n\nconst MASK64 = (1n << 64n) - 1n;\nconst rotr64 = (x: bigint, n: bigint) => ((x >> n) | (x << (64n - n))) & MASK64;\n\nconst SCHEDULE_512 = range(80).slice(16);\n\n/** The eight 64-bit words of a SHA-512 state. */\ntype State512 = readonly [bigint, bigint, bigint, bigint, bigint, bigint, bigint, bigint];\n\nconst sha512core = (input: string, init: State512, outWords: number): string => {\n  const m = pad(utf8(input), 128, 16, false);\n  let h = init;\n  const view = new DataView(m.buffer);\n  // The message schedule, 80 words.\n  const w = new DataView(new ArrayBuffer(80 * 8));\n  const word = (i: number) => w.getBigUint64(i * 8);\n  blocks(m, 128).forEach((off) => {\n    ROUNDS_16.forEach((i) => w.setBigUint64(i * 8, view.getBigUint64(off + i * 8)));\n    SCHEDULE_512.forEach((i) => {\n      const x = word(i - 15);\n      const y = word(i - 2);\n      const s0 = rotr64(x, 1n) ^ rotr64(x, 8n) ^ (x >> 7n);\n      const s1 = rotr64(y, 19n) ^ rotr64(y, 61n) ^ (y >> 6n);\n      w.setBigUint64(i * 8, (word(i - 16) + s0 + word(i - 7) + s1) & MASK64);\n    });\n    let [a, b, c, d, e, f, g, hh] = h;\n    K512.forEach((k, i) => {\n      const S1 = rotr64(e, 14n) ^ rotr64(e, 18n) ^ rotr64(e, 41n);\n      const ch = (e & f) ^ (~e & MASK64 & g);\n      const t1 = (hh + S1 + ch + k + word(i)) & MASK64;\n      const S0 = rotr64(a, 28n) ^ rotr64(a, 34n) ^ rotr64(a, 39n);\n      const maj = (a & b) ^ (a & c) ^ (b & c);\n      const t2 = (S0 + maj) & MASK64;\n      hh = g;\n      g = f;\n      f = e;\n      e = (d + t1) & MASK64;\n      d = c;\n      c = b;\n      b = a;\n      a = (t1 + t2) & MASK64;\n    });\n    const [h0, h1, h2, h3, h4, h5, h6, h7] = h;\n    h = [\n      (h0 + a) & MASK64,\n      (h1 + b) & MASK64,\n      (h2 + c) & MASK64,\n      (h3 + d) & MASK64,\n      (h4 + e) & MASK64,\n      (h5 + f) & MASK64,\n      (h6 + g) & MASK64,\n      (h7 + hh) & MASK64,\n    ];\n  });\n  return h\n    .slice(0, outWords)\n    .map((x) => x.toString(16).padStart(16, '0'))\n    .join('');\n};\n\nconst big = (x: string): bigint => BigInt(`0x${x}`);\n\n/** A SHA-512 initial state, from its hex words. */\nconst state512 = (\n  ...[a, b, c, d, e, f, g, h]: readonly [\n    string,\n    string,\n    string,\n    string,\n    string,\n    string,\n    string,\n    string,\n  ]\n): State512 => [big(a), big(b), big(c), big(d), big(e), big(f), big(g), big(h)];\n\nexport const sha512 = (input: string): string =>\n  sha512core(\n    input,\n    state512(\n      '6a09e667f3bcc908',\n      'bb67ae8584caa73b',\n      '3c6ef372fe94f82b',\n      'a54ff53a5f1d36f1',\n      '510e527fade682d1',\n      '9b05688c2b3e6c1f',\n      '1f83d9abfb41bd6b',\n      '5be0cd19137e2179',\n    ),\n    8,\n  );\n\nexport const sha384 = (input: string): string =>\n  sha512core(\n    input,\n    state512(\n      'cbbb9d5dc1059ed8',\n      '629a292a367cd507',\n      '9159015a3070dd17',\n      '152fecd8f70e5939',\n      '67332667ffc00b31',\n      '8eb44a8768581511',\n      'db0c2e0d64f98fa7',\n      '47b5481dbefa4fa4',\n    ),\n    6,\n  );\n","/**\n * Value-level helpers for expression evaluation: numeric type promotion and\n * arithmetic, comparisons, effective boolean value and the ORDER BY term\n * ordering.\n *\n * Errors are signalled by throwing `EvalFailure` (a cheap, stack-less\n * object); the public API converts them to `ExpressionError`s.\n *\n * @internal\n */\nimport * as BigDecimal from 'effect/BigDecimal';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Result from 'effect/Result';\nimport * as Str from 'effect/String';\nimport * as Term from '../../Term.ts';\nimport * as Xsd from '../../Xsd.ts';\nimport { loop } from './loop.ts';\nimport * as StringMap from './stringMap.ts';\n\nexport const XSD = 'http://www.w3.org/2001/XMLSchema#';\nexport const RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\n\n/** A thrown expression evaluation error. */\nexport class EvalFailure {\n  readonly message: string;\n  constructor(message: string) {\n    this.message = message;\n  }\n}\n\n/**\n * Runs `f`, returning a thrown `EvalFailure` (an expression error) as the\n * failure; any other exception is a defect and propagates.\n */\nexport const catchEvalFailure = <A>(f: () => A): Result.Result<A, EvalFailure> =>\n  Result.try({\n    try: f,\n    catch: (cause) => {\n      if (cause instanceof EvalFailure) return cause;\n      throw cause;\n    },\n  });\n\nexport const fail = (message: string): never => {\n  throw new EvalFailure(message);\n};\n\nexport const dt = {\n  string: Term.namedNode(`${XSD}string`),\n  boolean: Term.namedNode(`${XSD}boolean`),\n  integer: Term.namedNode(`${XSD}integer`),\n  decimal: Term.namedNode(`${XSD}decimal`),\n  float: Term.namedNode(`${XSD}float`),\n  double: Term.namedNode(`${XSD}double`),\n  dateTime: Term.namedNode(`${XSD}dateTime`),\n  dayTimeDuration: Term.namedNode(`${XSD}dayTimeDuration`),\n  langString: Term.namedNode(`${RDF}langString`),\n  dirLangString: Term.namedNode(`${RDF}dirLangString`),\n} as const;\n\nexport const TRUE = new Term.Literal('true', dt.boolean);\nexport const FALSE = new Term.Literal('false', dt.boolean);\nexport const bool = (b: boolean): Term.Literal => (b ? TRUE : FALSE);\n\n// -----------------------------------------------------------------------------\n// Literal kinds\n// -----------------------------------------------------------------------------\n\nexport const isLiteral = (t: Term.Term): t is Term.Literal => Term.isLiteral(t);\n\n/** A simple literal or `xsd:string` (no language tag). */\nexport const isSimpleString = (t: Term.Term): t is Term.Literal =>\n  Term.isLiteral(t) && t.language === '' && t.datatype.value === Term.XSD_STRING;\n\n/** A string literal: simple, `xsd:string` or language-tagged. */\nexport const isStringLiteral = (t: Term.Term): t is Term.Literal =>\n  Term.isLiteral(t) && (t.language !== '' || t.datatype.value === Term.XSD_STRING);\n\nexport const stringLike = (value: string, like: Term.Literal): Term.Literal =>\n  like.language === ''\n    ? new Term.Literal(value, dt.string)\n    : like.direction === undefined\n      ? new Term.Literal(value, dt.langString, like.language)\n      : new Term.Literal(value, dt.dirLangString, like.language, like.direction);\n\nexport const simple = (value: string): Term.Literal => new Term.Literal(value, dt.string);\n\n// -----------------------------------------------------------------------------\n// Numerics\n// -----------------------------------------------------------------------------\n\nexport type Num =\n  | { readonly kind: 0; readonly v: bigint }\n  | { readonly kind: 1; readonly v: BigDecimal.BigDecimal }\n  | { readonly kind: 2; readonly v: number }\n  | { readonly kind: 3; readonly v: number };\n\nexport const INTEGER = 0;\nexport const DECIMAL = 1;\nexport const FLOAT = 2;\nexport const DOUBLE = 3;\n\n/** The numeric value of each literal met, `None` for a non-numeric one. */\nconst numCache = new WeakMap<Term.Literal, Option.Option<Num>>();\n\nconst numOfValue = (v: Xsd.Value): Option.Option<Num> =>\n  Predicate.isTagged(v, 'Integer')\n    ? Option.some({ kind: 0, v: v.value })\n    : Predicate.isTagged(v, 'Decimal')\n      ? Option.some({ kind: 1, v: v.value })\n      : Predicate.isTagged(v, 'Float')\n        ? Option.some({ kind: 2, v: v.value })\n        : Predicate.isTagged(v, 'Double')\n          ? Option.some({ kind: 3, v: v.value })\n          : Option.none();\n\n/** The numeric value of a literal, `None` if it is not a valid numeric literal. */\nexport const numeric = (t: Term.Term): Option.Option<Num> => {\n  if (!Term.isLiteral(t) || t.language !== '') return Option.none();\n  const cached = numCache.get(t);\n  if (cached !== undefined) return cached;\n  const d = t.datatype.value;\n  const result =\n    Xsd.isNumericDatatype(d) && Xsd.isValidLexical(d, t.value)\n      ? numOfValue(Xsd.toValue(t))\n      : Option.none();\n  numCache.set(t, result);\n  return result;\n};\n\nexport const isNumeric = (t: Term.Term): boolean => Option.isSome(numeric(t));\n\nexport const toNumber = (n: Num): number =>\n  n.kind === 0 ? Number(n.v) : n.kind === 1 ? BigDecimal.toNumberUnsafe(n.v) : n.v;\n\nexport const toDecimal = (n: Num): BigDecimal.BigDecimal =>\n  n.kind === 0 ? BigDecimal.fromBigInt(n.v) : n.kind === 1 ? n.v : fail('Not a decimal');\n\n/** Promotes a numeric value to (at least) the given kind. */\nexport const promote = (n: Num, kind: number): Num => {\n  if (n.kind >= kind) return n;\n  return kind === DECIMAL\n    ? { kind: 1, v: toDecimal(n) }\n    : kind === FLOAT\n      ? { kind: 2, v: Math.fround(toNumber(n)) }\n      : { kind: 3, v: toNumber(n) };\n};\n\nexport const numLiteral = (n: Num): Term.Literal =>\n  n.kind === 0\n    ? new Term.Literal(n.v.toString(), dt.integer)\n    : n.kind === 1\n      ? new Term.Literal(Xsd.canonicalDecimal(n.v), dt.decimal)\n      : n.kind === 2\n        ? new Term.Literal(Xsd.canonicalDouble(Math.fround(n.v)), dt.float)\n        : new Term.Literal(Xsd.canonicalDouble(n.v), dt.double);\n\n/** The numeric value of a literal; an evaluation error if it has none. */\nexport const requireNum = (t: Term.Term): Num => {\n  const n = numeric(t);\n  return Option.isSome(n) ? n.value : fail('Expected a numeric literal');\n};\n\nconst DIVISION_SCALE = 18;\n\n/** `op` on two values already promoted to the common `kind`. */\nconst arithmeticAt = (kind: number, op: '+' | '-' | '*' | '/', px: Num, py: Num): Term.Literal => {\n  if (px.kind === 0 && py.kind === 0) {\n    const u = px.v;\n    const v = py.v;\n    return numLiteral({ kind: 0, v: op === '+' ? u + v : op === '-' ? u - v : u * v });\n  }\n  if (px.kind === 1 && py.kind === 1) {\n    const u = px.v;\n    const v = py.v;\n    if (op === '/') {\n      if (BigDecimal.isZero(v)) return fail('Division by zero');\n      return numLiteral({ kind: 1, v: divideDecimal(u, v) });\n    }\n    return numLiteral({\n      kind: 1,\n      v:\n        op === '+'\n          ? BigDecimal.sum(u, v)\n          : op === '-'\n            ? BigDecimal.subtract(u, v)\n            : BigDecimal.multiply(u, v),\n    });\n  }\n  // The remaining kinds (float, double) carry a JS `number`.\n  const u = toNumber(px);\n  const v = toNumber(py);\n  const r = op === '+' ? u + v : op === '-' ? u - v : op === '*' ? u * v : u / v;\n  return numLiteral(kind === FLOAT ? { kind: 2, v: Math.fround(r) } : { kind: 3, v: r });\n};\n\nexport const arithmetic = (op: '+' | '-' | '*' | '/', a: Term.Term, b: Term.Term): Term.Literal => {\n  const x = requireNum(a);\n  const y = requireNum(b);\n  let kind = Math.max(x.kind, y.kind);\n  if (op === '/' && kind === INTEGER) kind = DECIMAL;\n  const px = promote(x, kind);\n  const py = promote(y, kind);\n  return arithmeticAt(kind, op, px, py);\n};\n\n/** Decimal division with a fixed number of fractional digits (rounded half-even). */\nexport const divideDecimal = (\n  u: BigDecimal.BigDecimal,\n  v: BigDecimal.BigDecimal,\n): BigDecimal.BigDecimal => {\n  const exact = BigDecimal.divide(u, v);\n  const scaled = BigDecimal.round(\n    Option.getOrElse(exact, () => BigDecimal.fromBigInt(0n)),\n    {\n      scale: DIVISION_SCALE,\n      mode: 'half-even',\n    },\n  );\n  return BigDecimal.normalize(scaled);\n};\n\nexport const negate = (a: Term.Term): Term.Literal => {\n  return negateNum(requireNum(a));\n};\n\nconst negateNum = (x: Num): Term.Literal =>\n  numLiteral(\n    x.kind === 0\n      ? { kind: 0, v: -x.v }\n      : x.kind === 1\n        ? { kind: 1, v: BigDecimal.negate(x.v) }\n        : x.kind === 2\n          ? { kind: 2, v: -x.v }\n          : { kind: 3, v: -x.v },\n  );\n\n/** Compares two numerics; returns NaN when unordered (NaN operands). */\nexport const compareNum = (x: Num, y: Num): number => {\n  const kind = Math.max(x.kind, y.kind);\n  if (kind <= DECIMAL) {\n    if (x.kind === 0 && y.kind === 0) {\n      const u = x.v;\n      const v = y.v;\n      return u < v ? -1 : u > v ? 1 : 0;\n    }\n    const u = toDecimal(x);\n    const v = toDecimal(y);\n    return BigDecimal.isLessThan(u, v) ? -1 : BigDecimal.isGreaterThan(u, v) ? 1 : 0;\n  }\n  const u = toNumber(promote(x, kind));\n  const v = toNumber(promote(y, kind));\n  if (Number.isNaN(u) || Number.isNaN(v)) return NaN;\n  return u < v ? -1 : u > v ? 1 : 0;\n};\n\n// -----------------------------------------------------------------------------\n// Date/time and durations\n// -----------------------------------------------------------------------------\n\nconst DATE_KINDS: ReadonlyMap<string, true> = StringMap.setOf([\n  'dateTime',\n  'dateTimeStamp',\n  'date',\n  'time',\n  'gYear',\n  'gYearMonth',\n  'gMonth',\n  'gMonthDay',\n  'gDay',\n]);\n\ninterface DateValue {\n  readonly kind: string;\n  readonly millis: number;\n  /** Whether the value has a timezone. */\n  readonly zoned: boolean;\n}\n\nexport const dateValue = (t: Term.Term): Option.Option<DateValue> => {\n  if (!Term.isLiteral(t) || !t.datatype.value.startsWith(XSD)) return Option.none();\n  const local = t.datatype.value.slice(XSD.length);\n  if (!DATE_KINDS.has(local) || !Xsd.isValidLexical(t.datatype.value, t.value)) {\n    return Option.none();\n  }\n  const v = Xsd.toValue(t);\n  if (!Predicate.isTagged(v, 'DateTime')) return Option.none();\n  return Option.some({\n    kind: local === 'dateTimeStamp' ? 'dateTime' : local,\n    millis: v.epochMillis,\n    zoned: v.timezone !== undefined,\n  });\n};\n\nconst FOURTEEN_HOURS = 14 * 3600 * 1000;\n\nconst BEFORE = Option.some(-1);\nconst SAME = Option.some(0);\nconst AFTER = Option.some(1);\n\n/** Compares two date/time values of the same kind; `None` if indeterminate. */\nexport const compareDates = (a: DateValue, b: DateValue): Option.Option<number> => {\n  if (a.kind !== b.kind) return Option.none();\n  if (a.zoned !== b.zoned) {\n    const diff = a.millis - b.millis;\n    if (Math.abs(diff) <= FOURTEEN_HOURS) return Option.none();\n    return diff < 0 ? BEFORE : AFTER;\n  }\n  return a.millis < b.millis ? BEFORE : a.millis > b.millis ? AFTER : SAME;\n};\n\ninterface DurationValue {\n  readonly kind: string;\n  readonly months: number;\n  readonly seconds: number;\n}\n\nexport const durationValue = (t: Term.Term): Option.Option<DurationValue> => {\n  if (!Term.isLiteral(t)) return Option.none();\n  const d = t.datatype.value;\n  if (d !== `${XSD}duration` && d !== `${XSD}dayTimeDuration` && d !== `${XSD}yearMonthDuration`) {\n    return Option.none();\n  }\n  if (!Xsd.isValidLexical(d, t.value)) return Option.none();\n  const v = Xsd.toValue(t);\n  return Predicate.isTagged(v, 'Duration')\n    ? Option.some({ kind: d.slice(XSD.length), months: v.months, seconds: v.seconds })\n    : Option.none();\n};\n\n// -----------------------------------------------------------------------------\n// Strings\n// -----------------------------------------------------------------------------\n\n/** Compares strings by Unicode code points. */\nexport const compareCodepoints = (a: string, b: string): number => {\n  if (a === b) return 0;\n  const n = Math.min(a.length, b.length);\n  // The first offset where the strings differ (`n` if one is a prefix of the other).\n  let i = 0;\n  loop(() => {\n    if (i >= n || a.charCodeAt(i) !== b.charCodeAt(i)) return false;\n    i++;\n    return true;\n  });\n  if (i < n) {\n    const x = a.charCodeAt(i);\n    const y = b.charCodeAt(i);\n    const xs = x >= 0xd800 && x <= 0xdfff;\n    const ys = y >= 0xd800 && y <= 0xdfff;\n    if (xs !== ys) return xs ? 1 : -1;\n    return x < y ? -1 : 1;\n  }\n  return a.length < b.length ? -1 : a.length > b.length ? 1 : 0;\n};\n\n// -----------------------------------------------------------------------------\n// Equality and ordering\n// -----------------------------------------------------------------------------\n\nconst isBooleanLiteral = (t: Term.Term): t is Term.Literal =>\n  Term.isLiteral(t) &&\n  t.datatype.value === `${XSD}boolean` &&\n  Xsd.isValidLexical(t.datatype.value, t.value);\n\nconst booleanValue = (t: Term.Literal): boolean => t.value === 'true' || t.value === '1';\n\n/**\n * Compares two literals by value (for `<`, `>`, …). Returns a number (NaN for\n * unordered) or throws if they are not comparable.\n */\nexport const compareLiterals = (a: Term.Term, b: Term.Term): number => {\n  const x = numeric(a);\n  const y = numeric(b);\n  if (Option.isSome(x) && Option.isSome(y)) return compareNum(x.value, y.value);\n  if (isSimpleString(a) && isSimpleString(b)) return compareCodepoints(a.value, b.value);\n  if (\n    Term.isLiteral(a) &&\n    Term.isLiteral(b) &&\n    a.language !== '' &&\n    a.language === b.language &&\n    a.direction === b.direction\n  ) {\n    return compareCodepoints(a.value, b.value);\n  }\n  if (isBooleanLiteral(a) && isBooleanLiteral(b)) {\n    return Number(booleanValue(a)) - Number(booleanValue(b));\n  }\n  const da = dateValue(a);\n  const db = dateValue(b);\n  if (Option.isSome(da) && Option.isSome(db)) {\n    const c = compareDates(da.value, db.value);\n    if (Option.isSome(c)) return c.value;\n    return fail('Indeterminate date comparison');\n  }\n  const ua = durationValue(a);\n  const ub = durationValue(b);\n  if (Option.isSome(ua) && Option.isSome(ub)) {\n    const u = ua.value;\n    const v = ub.value;\n    if (u.months === v.months) return Math.sign(u.seconds - v.seconds);\n    if (u.seconds === v.seconds) return Math.sign(u.months - v.months);\n    return fail('Indeterminate duration comparison');\n  }\n  return fail('Incomparable values');\n};\n\nconst isKnownLiteral = (t: Term.Literal): boolean =>\n  t.language !== '' || Xsd.isKnownDatatype(t.datatype.value);\n\n/** RDF term equality with value semantics (`=`). Throws on type errors. */\nexport const equals = (a: Term.Term, b: Term.Term): boolean => {\n  const ta = Term.isTriple(a);\n  const tb = Term.isTriple(b);\n  if (ta || tb) {\n    if (!ta || !tb) return false;\n    return (\n      equals(a.subject, b.subject) && equals(a.predicate, b.predicate) && equals(a.object, b.object)\n    );\n  }\n  if (!Term.isLiteral(a) || !Term.isLiteral(b)) return a.key === b.key;\n  const x = numeric(a);\n  const y = numeric(b);\n  if (Option.isSome(x) && Option.isSome(y)) return compareNum(x.value, y.value) === 0;\n  if (a.key === b.key) return true;\n  if (isSimpleString(a) && isSimpleString(b)) return a.value === b.value;\n  if (isBooleanLiteral(a) && isBooleanLiteral(b)) return booleanValue(a) === booleanValue(b);\n  const da = dateValue(a);\n  const db = dateValue(b);\n  if (Option.isSome(da) && Option.isSome(db)) {\n    if (da.value.kind !== db.value.kind) return false;\n    const c = compareDates(da.value, db.value);\n    if (Option.isNone(c)) return fail('Indeterminate date comparison');\n    return c.value === 0;\n  }\n  const ua = durationValue(a);\n  const ub = durationValue(b);\n  if (Option.isSome(ua) && Option.isSome(ub)) {\n    return ua.value.months === ub.value.months && ua.value.seconds === ub.value.seconds;\n  }\n  if (a.language !== '' || b.language !== '') {\n    // Language-tagged strings are equal only when they are the same term.\n    return false;\n  }\n  // Both literals with known, value-disjoint datatypes are unequal; anything\n  // else (unknown datatypes, ill-formed values) is a type error.\n  if (\n    isKnownLiteral(a) &&\n    isKnownLiteral(b) &&\n    Xsd.isWellFormed(a) &&\n    Xsd.isWellFormed(b) &&\n    a.datatype.value !== b.datatype.value\n  ) {\n    return false;\n  }\n  return fail('Cannot compare literals');\n};\n\n/** Effective boolean value. */\nconst numEbv = (n: Num): boolean =>\n  n.kind === 0\n    ? n.v !== 0n\n    : n.kind === 1\n      ? !BigDecimal.isZero(n.v)\n      : !(n.v === 0 || Number.isNaN(n.v));\n\nexport const ebv = (t: Term.Term): boolean => {\n  if (!Term.isLiteral(t)) return fail('EBV of a non-literal');\n  const d = t.datatype.value;\n  if (d === `${XSD}boolean`) {\n    if (!Xsd.isValidLexical(d, t.value)) return fail('Invalid boolean');\n    return booleanValue(t);\n  }\n  if (t.language === '' && d === Term.XSD_STRING) return Str.isNonEmpty(t.value);\n  if (Xsd.isNumericDatatype(d)) {\n    const n = numeric(t);\n    return Option.isSome(n) && numEbv(n.value);\n  }\n  return fail('EBV is not defined for this literal');\n};\n\n/** The `ORDER BY` rank of a bound term: blank nodes < IRIs < literals < triple terms. */\nconst termRank = (t: Term.Term): number =>\n  Term.isBlankNode(t)\n    ? 1\n    : Term.isNamedNode(t)\n      ? 2\n      : Term.isLiteral(t)\n        ? 3\n        : Term.isTriple(t)\n          ? 4\n          : 5;\n\n/** Orders two literals: by value where comparable, else syntactically. */\nconst compareLiteralOrder = (a: Term.Literal, l: Term.Literal): number => {\n  // Where the values cannot be compared, fall through to the syntactic\n  // ordering.\n  const compared = Result.try(() => compareLiterals(a, l));\n  if (Result.isSuccess(compared)) {\n    const c = compared.success;\n    if (!Number.isNaN(c) && c !== 0) return c;\n    if (c === 0 && a.key === l.key) return 0;\n  }\n  // Simple literals before language-tagged before other typed literals.\n  const ka = a.language !== '' ? 1 : a.datatype.value === Term.XSD_STRING ? 0 : 2;\n  const kb = l.language !== '' ? 1 : l.datatype.value === Term.XSD_STRING ? 0 : 2;\n  if (ka !== kb) return ka - kb;\n  return (\n    compareCodepoints(a.datatype.value, l.datatype.value) ||\n    compareCodepoints(a.language, l.language) ||\n    compareCodepoints(a.value, l.value)\n  );\n};\n\n/**\n * The total ordering used by `ORDER BY` on bound terms: blank nodes < IRIs <\n * literals < triple terms; literals are ordered by value where comparable\n * and otherwise by datatype, language and lexical form.\n */\nexport const compareTerms = (a: Term.Term, b: Term.Term): number => {\n  const ra = termRank(a);\n  const rb = termRank(b);\n  if (ra !== rb) return ra - rb;\n  if (Term.isLiteral(a) && Term.isLiteral(b)) return compareLiteralOrder(a, b);\n  if (Term.isTriple(a) && Term.isTriple(b)) {\n    return (\n      compareTerms(a.subject, b.subject) ||\n      compareTerms(a.predicate, b.predicate) ||\n      compareTerms(a.object, b.object)\n    );\n  }\n  if (\n    (Term.isBlankNode(a) || Term.isNamedNode(a)) &&\n    (Term.isBlankNode(b) || Term.isNamedNode(b))\n  ) {\n    return compareCodepoints(a.value, b.value);\n  }\n  return 0;\n};\n\n/** `compareTerms` on possibly unbound terms (`None`), with unbound first. */\nexport const orderCompare = (a: Option.Option<Term.Term>, b: Option.Option<Term.Term>): number =>\n  Option.isNone(a)\n    ? Option.isNone(b)\n      ? 0\n      : -1\n    : Option.isNone(b)\n      ? 1\n      : compareTerms(a.value, b.value);\n","/**\n * SPARQL built-in functions, XSD casts and the registry of extension\n * functions.\n *\n * Extension functions are plain synchronous functions from argument terms\n * to a term, registered by IRI and passed to the engine (see\n * `Engine.EngineOptions.functions`). They signal type errors by throwing\n * `ExpressionError` (or calling `Functions.error`).\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as BigDecimal from 'effect/BigDecimal';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\nimport * as Result from 'effect/Result';\nimport * as Schema from 'effect/Schema';\nimport * as Iri from '../Iri.ts';\nimport * as Term from '../Term.ts';\nimport * as Xsd from '../Xsd.ts';\nimport type * as Ast from './Ast.ts';\nimport type { Bindings } from './Bindings.ts';\nimport * as Hash from './internal/hash.ts';\nimport * as StringMap from './internal/stringMap.ts';\nimport * as V from './internal/values.ts';\n\n/**\n * An expression evaluation error (a SPARQL \"type error\"): unbound\n * variables, wrong argument types, division by zero, …\n *\n * @since 0.1.0\n * @category errors\n */\nexport class ExpressionError extends Schema.TaggedError<ExpressionError>()('ExpressionError', {\n  message: Schema.String,\n}) {}\n\n/**\n * Signals an expression error from inside a function implementation.\n *\n * @since 0.1.0\n * @category errors\n */\nexport const error = (message: string): never => V.fail(message);\n\n/**\n * The per-query context of expression evaluation.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface FunctionContext {\n  /** The value of `NOW()`: constant for the whole query. */\n  readonly now: Date;\n  /** The base IRI used by `IRI()` / `URI()`. */\n  readonly baseIri?: string | undefined;\n  /** A random number generator in [0, 1). */\n  readonly random: () => number;\n  /** Returns the blank node for `BNODE(label)` within the current solution. */\n  readonly blankNode: (label: string | undefined, solution: Bindings) => Term.BlankNode;\n}\n\n/**\n * An extension function: receives the evaluated arguments.\n *\n * @since 0.1.0\n * @category models\n */\nexport type ExtensionFunction = (\n  args: ReadonlyArray<Term.GroundTerm>,\n  context: FunctionContext,\n) => Term.GroundTerm;\n\n/**\n * A registry of extension functions keyed by IRI.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Registry = ReadonlyMap<string, ExtensionFunction>;\n\n/**\n * Creates a registry from a record of IRI → function.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const registry = (functions: Readonly<Record<string, ExtensionFunction>>): Registry =>\n  StringMap.fromEntries(Record.toEntries(functions));\n\n// -----------------------------------------------------------------------------\n// Helpers\n// -----------------------------------------------------------------------------\n\nconst literalArg = (t: Term.Term): Term.Literal =>\n  Term.isLiteral(t) ? t : V.fail('Expected a literal');\n\nconst stringArg = (t: Term.Term): Term.Literal =>\n  V.isStringLiteral(t) ? t : V.fail('Expected a string literal');\n\nconst simpleArg = (t: Term.Term): Term.Literal =>\n  V.isSimpleString(t) ? t : V.fail('Expected a simple literal');\n\n/** Argument compatibility (SPARQL 1.1 §17.4.3.1.2). */\nconst compatible = (a: Term.Literal, b: Term.Literal): boolean =>\n  b.language === '' || (a.language === b.language && a.direction === b.direction);\n\nconst codepoints = (s: string): Array<string> => Array.from(s);\n\nconst intLiteral = (n: number | bigint): Term.Literal =>\n  new Term.Literal(BigInt(n).toString(), V.dt.integer);\n\nconst numArg = V.requireNum;\n\nconst roundNum = (\n  t: Term.Term,\n  mode: 'ceil' | 'floor' | 'half-ceil',\n  fn: (x: number) => number,\n): Term.Literal => {\n  const n = numArg(t);\n  return V.numLiteral(\n    n.kind === 0\n      ? n\n      : n.kind === 1\n        ? { kind: 1, v: BigDecimal.round(n.v, { scale: 0, mode }) }\n        : n.kind === 2\n          ? { kind: 2, v: fn(n.v) }\n          : { kind: 3, v: fn(n.v) },\n  );\n};\n\nconst xpathRound = (x: number): number => {\n  if (!Number.isFinite(x) || Object.is(x, -0)) return x;\n  const r = Math.floor(x + 0.5);\n  return r === 0 && x < 0 ? -0 : r;\n};\n\n/** Compiled regular expressions by flags and pattern (read on every `REGEX` / `REPLACE` call). */\nconst regexCache = StringMap.empty<RegExp>();\n\n/** Compiles an XPath regular expression with XPath flags to a JS RegExp. */\nexport const compileRegex = (pattern: string, flags: string, global = false): RegExp => {\n  const key = `${global ? 'g' : ''}${flags}/${pattern}`;\n  const cached = regexCache.get(key);\n  if (cached !== undefined) return cached;\n  let source = pattern;\n  let jsFlags = global ? 'g' : '';\n  Array.from(flags).forEach((flag) => {\n    if (flag === 'i' || flag === 's' || flag === 'm') {\n      if (!jsFlags.includes(flag)) jsFlags += flag;\n    } else if (flag === 'x') source = source.replace(/[\\t\\n\\r ]/g, '');\n    else if (flag === 'q') source = source.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n    else V.fail(`Invalid regex flag '${flag}'`);\n  });\n  // Unicode mode first; patterns it rejects may still compile without it.\n  const compiled = Result.try(() => new RegExp(source, `${jsFlags}u`)).pipe(\n    Result.orElse(() => Result.try(() => new RegExp(source, jsFlags))),\n  );\n  if (Result.isFailure(compiled)) return V.fail('Invalid regular expression');\n  const re = compiled.success;\n  if (regexCache.size > 1000) regexCache.clear();\n  regexCache.set(key, re);\n  return re;\n};\n\n/** The flags argument of `REGEX` / `REPLACE`, absent beyond the arguments given. */\nconst regexFlags = (args: BuiltInArgs, i: number): string => {\n  const t = Option.fromUndefinedOr(args[i]);\n  return Option.isSome(t) ? simpleArg(t.value).value : '';\n};\n\nconst parseDateParts = (t: Term.Term) => {\n  const lit = literalArg(t);\n  const d = lit.datatype.value;\n  if (\n    !(\n      d === `${V.XSD}dateTime` ||\n      d === `${V.XSD}date` ||\n      d === `${V.XSD}time` ||\n      d === `${V.XSD}dateTimeStamp`\n    ) ||\n    !Xsd.isValidLexical(d, lit.value)\n  ) {\n    return V.fail('Expected an xsd:dateTime');\n  }\n  const m =\n    /^(?:(-?\\d{4,})-(\\d\\d)-(\\d\\d))?T?(?:(\\d\\d):(\\d\\d):(\\d\\d(?:\\.\\d+)?))?(Z|[+-]\\d\\d:\\d\\d)?$/.exec(\n      lit.value,\n    );\n  if (m === null) return V.fail('Invalid date/time');\n  return {\n    year: m[1],\n    month: m[2],\n    day: m[3],\n    hours: m[4],\n    minutes: m[5],\n    seconds: m[6],\n    tz: m[7],\n  };\n};\n\nconst timezoneDuration = (tz: string): string => {\n  if (tz === 'Z') return 'PT0S';\n  const sign = tz.startsWith('-') ? '-' : '';\n  const h = Number(tz.slice(1, 3));\n  const mi = Number(tz.slice(4, 6));\n  if (h === 0 && mi === 0) return 'PT0S';\n  return `${sign}PT${h > 0 ? `${h}H` : ''}${mi > 0 ? `${mi}M` : ''}`;\n};\n\nconst encodeForUri = (s: string): string =>\n  encodeURIComponent(s).replace(\n    /[!'()*]/g,\n    (c) => `%${c.charCodeAt(0).toString(16).toUpperCase()}`,\n  );\n\nconst uuid = (random: () => number): string => {\n  // Version 4 (byte 6) and the RFC 4122 variant (byte 8).\n  const bytes = Array.from({ length: 16 }, (_, i) => {\n    const b = Math.floor(random() * 256);\n    return i === 6 ? (b & 0x0f) | 0x40 : i === 8 ? (b & 0x3f) | 0x80 : b;\n  });\n  const h = bytes.map((b) => b.toString(16).padStart(2, '0')).join('');\n  return `${h.slice(0, 8)}-${h.slice(8, 12)}-${h.slice(12, 16)}-${h.slice(16, 20)}-${h.slice(20)}`;\n};\n\nconst LANG_TAG = /^[a-zA-Z]{1,8}(?:-[a-zA-Z0-9]{1,8})*$/;\n\n// -----------------------------------------------------------------------------\n// Built-in functions (strict: all arguments evaluated, errors propagate)\n// -----------------------------------------------------------------------------\n\n/**\n * The evaluated arguments of a built-in function. Positions beyond the\n * function's arity are `undefined` at runtime; the type assumes the\n * required positions are present (checked by the parser).\n *\n * @since 0.1.0\n * @category models\n */\nexport type BuiltInArgs = ReadonlyArray<Term.GroundTerm> & {\n  readonly 0: Term.GroundTerm;\n  readonly 1: Term.GroundTerm;\n  readonly 2: Term.GroundTerm;\n};\n\n/**\n * Implementation of a strict built-in function.\n *\n * @since 0.1.0\n * @category models\n */\nexport type BuiltIn = (\n  args: BuiltInArgs,\n  context: FunctionContext,\n  solution: Bindings,\n) => Term.GroundTerm;\n\n/** The two string arguments of a string function, which must be compatible (§17.4.3.1.2). */\nconst compatibleStrings = ([a, b]: BuiltInArgs): readonly [Term.Literal, Term.Literal] => {\n  const x = stringArg(a);\n  const y = stringArg(b);\n  return compatible(x, y) ? [x, y] : V.fail('Incompatible arguments');\n};\n\n/**\n * `STRBEFORE` / `STRAFTER`: `part` of the first string around the first\n * occurrence of the second, or the empty simple literal if there is none.\n */\nconst around = (\n  args: BuiltInArgs,\n  part: (value: string, search: string, index: number) => string,\n): Term.Literal => {\n  const [x, y] = compatibleStrings(args);\n  const i = x.value.indexOf(y.value);\n  return i === -1 ? V.simple('') : V.stringLike(part(x.value, y.value, i), x);\n};\n\nconst iriFn: BuiltIn = ([a], ctx) => {\n  if (Term.isNamedNode(a)) return a;\n  const s = simpleArg(a).value;\n  return Term.namedNode(ctx.baseIri !== undefined ? Iri.resolve(s, ctx.baseIri) : s);\n};\n\nconst hashFn =\n  (f: (s: string) => string): BuiltIn =>\n  ([a]) =>\n    V.simple(f(simpleArg(a).value));\n\n/**\n * The strict built-in functions, keyed by canonical name. Functional forms\n * (`BOUND`, `IF`, `COALESCE`, `&&`, `||`, `IN`, `EXISTS`) are handled by the\n * expression evaluator.\n *\n * @since 0.1.0\n * @category built-ins\n */\nexport const builtIns: Partial<Record<Ast.BuiltInName, BuiltIn>> = {\n  STR: ([a]) =>\n    Term.isNamedNode(a) || Term.isLiteral(a)\n      ? V.simple(a.value)\n      : V.fail('STR of a blank node or triple term'),\n  LANG: ([a]) => V.simple(literalArg(a).language),\n  LANGDIR: ([a]) => V.simple(literalArg(a).direction ?? ''),\n  LANGMATCHES: ([tag, range]) => {\n    const t = simpleArg(tag).value.toLowerCase();\n    const r = simpleArg(range).value.toLowerCase();\n    if (r === '*') return V.bool(t !== '');\n    return V.bool(t === r || t.startsWith(`${r}-`));\n  },\n  DATATYPE: ([a]) => literalArg(a).datatype,\n  IRI: iriFn,\n  URI: iriFn,\n  BNODE: (args, ctx, sol) =>\n    ctx.blankNode(Arr.isReadonlyArrayEmpty(args) ? undefined : simpleArg(args[0]).value, sol),\n  RAND: (_, ctx) => V.numLiteral({ kind: 3, v: ctx.random() }),\n  ABS: ([a]) => {\n    const n = numArg(a);\n    return V.numLiteral(\n      n.kind === 0\n        ? { kind: 0, v: n.v < 0n ? -n.v : n.v }\n        : n.kind === 1\n          ? { kind: 1, v: BigDecimal.abs(n.v) }\n          : n.kind === 2\n            ? { kind: 2, v: Math.abs(n.v) }\n            : { kind: 3, v: Math.abs(n.v) },\n    );\n  },\n  CEIL: ([a]) => roundNum(a, 'ceil', Math.ceil),\n  FLOOR: ([a]) => roundNum(a, 'floor', Math.floor),\n  ROUND: ([a]) => roundNum(a, 'half-ceil', xpathRound),\n  CONCAT: (args) => {\n    const lits = args.map(stringArg);\n    const first = lits[0];\n    const sameLang =\n      first !== undefined &&\n      first.language !== '' &&\n      lits.every((l) => l.language === first.language && l.direction === first.direction);\n    const value = lits.map((l) => l.value).join('');\n    return sameLang ? V.stringLike(value, first) : V.simple(value);\n  },\n  SUBSTR: ([s, start, len]) => {\n    const str = stringArg(s);\n    const chars = codepoints(str.value);\n    const st = V.toNumber(numArg(start));\n    const from = xpathRound(st);\n    let to = Infinity;\n    if (len !== undefined) to = from + xpathRound(V.toNumber(numArg(len)));\n    if (Number.isNaN(from) || Number.isNaN(to)) return V.stringLike('', str);\n    const out = chars.filter((_, i) => i + 1 >= from && i + 1 < to).join('');\n    return V.stringLike(out, str);\n  },\n  STRLEN: ([a]) => intLiteral(codepoints(stringArg(a).value).length),\n  REPLACE: (args) => {\n    const [s, pattern, replacement] = args;\n    const str = stringArg(s);\n    const re = compileRegex(simpleArg(pattern).value, regexFlags(args, 3), true);\n    if (re.test('')) {\n      re.lastIndex = 0;\n      return V.fail('REPLACE pattern matches the empty string');\n    }\n    re.lastIndex = 0;\n    const repl = simpleArg(replacement).value.replace(/\\\\(\\$|\\\\)|\\$/g, (m, esc) =>\n      esc === '$' ? '$$' : esc === '\\\\' ? '\\\\' : m,\n    );\n    return V.stringLike(str.value.replace(re, repl), str);\n  },\n  UCASE: ([a]) => {\n    const s = stringArg(a);\n    return V.stringLike(s.value.toUpperCase(), s);\n  },\n  LCASE: ([a]) => {\n    const s = stringArg(a);\n    return V.stringLike(s.value.toLowerCase(), s);\n  },\n  ENCODE_FOR_URI: ([a]) => V.simple(encodeForUri(stringArg(a).value)),\n  CONTAINS: (args) => {\n    const [x, y] = compatibleStrings(args);\n    return V.bool(x.value.includes(y.value));\n  },\n  STRSTARTS: (args) => {\n    const [x, y] = compatibleStrings(args);\n    return V.bool(x.value.startsWith(y.value));\n  },\n  STRENDS: (args) => {\n    const [x, y] = compatibleStrings(args);\n    return V.bool(x.value.endsWith(y.value));\n  },\n  STRBEFORE: (args) => around(args, (x, _y, i) => x.slice(0, i)),\n  STRAFTER: (args) => around(args, (x, y, i) => x.slice(i + y.length)),\n  YEAR: ([a]) => {\n    const p = parseDateParts(a);\n    return p.year !== undefined ? intLiteral(BigInt(p.year)) : V.fail('No year');\n  },\n  MONTH: ([a]) => {\n    const p = parseDateParts(a);\n    return p.month !== undefined ? intLiteral(Number(p.month)) : V.fail('No month');\n  },\n  DAY: ([a]) => {\n    const p = parseDateParts(a);\n    return p.day !== undefined ? intLiteral(Number(p.day)) : V.fail('No day');\n  },\n  HOURS: ([a]) => {\n    const p = parseDateParts(a);\n    return p.hours !== undefined ? intLiteral(Number(p.hours)) : V.fail('No hours');\n  },\n  MINUTES: ([a]) => {\n    const p = parseDateParts(a);\n    return p.minutes !== undefined ? intLiteral(Number(p.minutes)) : V.fail('No minutes');\n  },\n  SECONDS: ([a]) => {\n    const p = parseDateParts(a);\n    if (p.seconds === undefined) return V.fail('No seconds');\n    return V.numLiteral({ kind: 1, v: BigDecimal.fromStringUnsafe(p.seconds) });\n  },\n  TIMEZONE: ([a]) => {\n    const p = parseDateParts(a);\n    if (p.tz === undefined) return V.fail('No timezone');\n    return new Term.Literal(timezoneDuration(p.tz), V.dt.dayTimeDuration);\n  },\n  TZ: ([a]) => V.simple(parseDateParts(a).tz ?? ''),\n  NOW: (_, ctx) => new Term.Literal(ctx.now.toISOString(), V.dt.dateTime),\n  UUID: (_, ctx) => Term.namedNode(`urn:uuid:${uuid(ctx.random)}`),\n  STRUUID: (_, ctx) => V.simple(uuid(ctx.random)),\n  MD5: hashFn(Hash.md5),\n  SHA1: hashFn(Hash.sha1),\n  SHA256: hashFn(Hash.sha256),\n  SHA384: hashFn(Hash.sha384),\n  SHA512: hashFn(Hash.sha512),\n  STRLANG: ([s, lang]) => {\n    const lex = simpleArg(s).value;\n    const tag = simpleArg(lang).value;\n    if (!LANG_TAG.test(tag)) return V.fail('Invalid language tag');\n    return Term.literal(lex, tag);\n  },\n  STRLANGDIR: ([s, lang, dir]) => {\n    const lex = simpleArg(s).value;\n    const tag = simpleArg(lang).value;\n    const d = simpleArg(dir).value;\n    if (!LANG_TAG.test(tag)) return V.fail('Invalid language tag');\n    if (d !== 'ltr' && d !== 'rtl') return V.fail('Invalid base direction');\n    return Term.literal(lex, { language: tag, direction: d });\n  },\n  STRDT: ([s, datatype]) => {\n    const lex = simpleArg(s).value;\n    if (!Term.isNamedNode(datatype)) return V.fail('STRDT requires an IRI');\n    if (datatype.value === V.dt.langString.value || datatype.value === V.dt.dirLangString.value) {\n      return V.fail('STRDT cannot create language-tagged strings');\n    }\n    return new Term.Literal(lex, datatype);\n  },\n  SAMETERM: ([a, b]) => V.bool(a.key === b.key),\n  ISIRI: ([a]) => V.bool(Term.isNamedNode(a)),\n  ISURI: ([a]) => V.bool(Term.isNamedNode(a)),\n  ISBLANK: ([a]) => V.bool(Term.isBlankNode(a)),\n  ISLITERAL: ([a]) => V.bool(Term.isLiteral(a)),\n  ISNUMERIC: ([a]) => V.bool(V.isNumeric(a)),\n  HASLANG: ([a]) => V.bool(Term.isLiteral(a) && a.language !== ''),\n  HASLANGDIR: ([a]) => V.bool(Term.isLiteral(a) && a.direction !== undefined),\n  REGEX: (args) => {\n    const [s, pattern] = args;\n    const str = stringArg(s);\n    const re = compileRegex(simpleArg(pattern).value, regexFlags(args, 2));\n    return V.bool(re.test(str.value));\n  },\n  ISTRIPLE: ([a]) => V.bool(Term.isTriple(a)),\n  TRIPLE: ([s, p, o]) => {\n    if (!Term.isNamedNode(s) && !Term.isBlankNode(s)) {\n      return V.fail('TRIPLE subject must be an IRI or blank node');\n    }\n    if (!Term.isNamedNode(p)) return V.fail('TRIPLE predicate must be an IRI');\n    return Term.triple(s, p, o);\n  },\n  SUBJECT: ([a]) => (Term.isTriple(a) ? a.subject : V.fail('Not a triple term')),\n  PREDICATE: ([a]) => (Term.isTriple(a) ? a.predicate : V.fail('Not a triple term')),\n  OBJECT: ([a]) => (Term.isTriple(a) ? a.object : V.fail('Not a triple term')),\n};\n\n// -----------------------------------------------------------------------------\n// Casts\n// -----------------------------------------------------------------------------\n\nconst XSD_INTEGER_TYPE_NAMES: ReadonlyArray<string> = [\n  'integer',\n  'long',\n  'int',\n  'short',\n  'byte',\n  'nonNegativeInteger',\n  'positiveInteger',\n  'nonPositiveInteger',\n  'negativeInteger',\n  'unsignedLong',\n  'unsignedInt',\n  'unsignedShort',\n  'unsignedByte',\n].map((t) => V.XSD + t);\nconst XSD_INTEGER_TYPES = StringMap.setOf(XSD_INTEGER_TYPE_NAMES);\n\n/** The XPath string form of a float/double (`fn:string`). */\nconst xpathDoubleString = (v: number): string => {\n  if (Number.isNaN(v)) return 'NaN';\n  if (!Number.isFinite(v)) return v > 0 ? 'INF' : '-INF';\n  const abs = Math.abs(v);\n  if (abs === 0) return Object.is(v, -0) ? '-0' : '0';\n  if (abs >= 1e-6 && abs < 1e6) return String(v);\n  return Xsd.canonicalDouble(v);\n};\n\nconst castString = (a: Term.Term): string => {\n  if (Term.isNamedNode(a)) return a.value;\n  const l = literalArg(a);\n  const numeric = V.numeric(l);\n  if (Option.isSome(numeric)) {\n    const n = numeric.value;\n    if (n.kind === 0) return n.v.toString();\n    if (n.kind === 1) {\n      const s = Xsd.canonicalDecimal(n.v);\n      return s.endsWith('.0') ? s.slice(0, -2) : s;\n    }\n    return xpathDoubleString(n.v);\n  }\n  if (l.datatype.value === V.dt.boolean.value && Xsd.isValidLexical(l.datatype.value, l.value)) {\n    return l.value === 'true' || l.value === '1' ? 'true' : 'false';\n  }\n  return l.value;\n};\n\n/** A literal being cast, with the readings of it the casts share. */\ninterface CastSource {\n  readonly target: string;\n  readonly dtNode: Term.NamedNode;\n  readonly l: Term.Literal;\n  readonly numeric: Option.Option<V.Num>;\n  /** Whether it is a valid `xsd:boolean`, and if so its value. */\n  readonly isBool: boolean;\n  readonly boolValue: boolean;\n  /** Whether it is a simple literal, and its trimmed lexical form. */\n  readonly fromString: boolean;\n  readonly lexical: string;\n}\n\nconst castBoolean = ({ l, numeric, isBool, boolValue, fromString, lexical }: CastSource) => {\n  if (isBool) return V.bool(boolValue);\n  if (Option.isSome(numeric)) return V.bool(V.ebv(l));\n  if (fromString && /^(true|false|1|0)$/.test(lexical)) {\n    return V.bool(lexical === 'true' || lexical === '1');\n  }\n  return V.fail('Invalid boolean cast');\n};\n\nconst integerOf = (n: V.Num): bigint => {\n  if (n.kind === 0) return n.v;\n  if (n.kind === 1) return BigInt(BigDecimal.format(BigDecimal.truncate(n.v)).split('.')[0] ?? '0');\n  if (!Number.isFinite(n.v)) return V.fail('Cannot cast NaN/INF to integer');\n  return BigInt(Math.trunc(n.v));\n};\n\nconst castInteger = (source: CastSource): Term.Literal => {\n  const { target, dtNode, numeric, isBool, boolValue, fromString, lexical } = source;\n  const value: bigint = isBool\n    ? boolValue\n      ? 1n\n      : 0n\n    : Option.isSome(numeric)\n      ? integerOf(numeric.value)\n      : fromString && /^[+-]?\\d+$/.test(lexical)\n        ? BigInt(lexical)\n        : V.fail('Invalid integer cast');\n  const lit = new Term.Literal(value.toString(), dtNode);\n  return Xsd.isValidLexical(target, lit.value) ? lit : V.fail('Integer out of range');\n};\n\nconst castDecimal = ({ numeric, isBool, boolValue, fromString, lexical }: CastSource) => {\n  if (isBool) return V.numLiteral({ kind: 1, v: BigDecimal.fromBigInt(boolValue ? 1n : 0n) });\n  if (Option.isSome(numeric)) {\n    const n = numeric.value;\n    if (n.kind === 0 || n.kind === 1) return V.numLiteral({ kind: 1, v: V.toDecimal(n) });\n    if (!Number.isFinite(n.v)) return V.fail('Cannot cast NaN/INF to decimal');\n    return V.numLiteral({ kind: 1, v: BigDecimal.fromNumberUnsafe(n.v) });\n  }\n  if (fromString && /^[+-]?(\\d+(\\.\\d*)?|\\.\\d+)$/.test(lexical)) {\n    return V.numLiteral({ kind: 1, v: BigDecimal.fromStringUnsafe(lexical.replace(/\\.$/, '')) });\n  }\n  return V.fail('Invalid decimal cast');\n};\n\nconst floatingOf = (lexical: string): number =>\n  lexical === 'INF' || lexical === '+INF'\n    ? Infinity\n    : lexical === '-INF'\n      ? -Infinity\n      : Number(lexical);\n\nconst castFloating = (source: CastSource): Term.Literal => {\n  const { target, numeric, isBool, boolValue, fromString, lexical } = source;\n  const kind = target === V.dt.double.value ? 3 : 2;\n  const value = isBool\n    ? boolValue\n      ? 1\n      : 0\n    : Option.isSome(numeric)\n      ? V.toNumber(numeric.value)\n      : fromString && Xsd.isValidLexical(target, lexical)\n        ? floatingOf(lexical)\n        : V.fail('Invalid floating point cast');\n  return V.numLiteral({ kind, v: kind === 2 ? Math.fround(value) : value });\n};\n\nconst castDateTime = ({ target, dtNode, l, fromString, lexical }: CastSource): Term.Literal => {\n  if (l.datatype.value === target && Xsd.isValidLexical(target, l.value)) return l;\n  if (l.datatype.value === `${V.XSD}date` && Xsd.isValidLexical(l.datatype.value, l.value)) {\n    // A valid `xsd:date` always matches.\n    const m = /^(-?\\d+-\\d\\d-\\d\\d)(.*)$/.exec(l.value);\n    if (m === null) return V.fail('Invalid date');\n    return new Term.Literal(`${m[1]}T00:00:00${m[2]}`, dtNode);\n  }\n  if (fromString && Xsd.isValidLexical(target, lexical)) return new Term.Literal(lexical, dtNode);\n  return V.fail('Invalid dateTime cast');\n};\n\n/** Other XSD types: from strings with a valid lexical form, or the same type. */\nconst castOther = ({ target, dtNode, l, fromString, lexical }: CastSource): Term.Literal => {\n  if (l.datatype.value === target) return l;\n  if (fromString && Xsd.isValidLexical(target, lexical)) return new Term.Literal(lexical, dtNode);\n  return V.fail(`Invalid cast to ${target}`);\n};\n\nconst castTo = (target: string, a: Term.Term): Term.Literal => {\n  if (target === Term.XSD_STRING) {\n    if (Term.isLiteral(a) && a.language !== '')\n      return V.fail('Cannot cast a language-tagged string');\n    return V.simple(castString(a));\n  }\n  const l = literalArg(a);\n  if (l.language !== '') return V.fail('Cannot cast a language-tagged string');\n  const isBool =\n    l.datatype.value === V.dt.boolean.value && Xsd.isValidLexical(l.datatype.value, l.value);\n  const source: CastSource = {\n    target,\n    dtNode: Term.namedNode(target),\n    l,\n    numeric: V.numeric(l),\n    isBool,\n    boolValue: isBool && (l.value === 'true' || l.value === '1'),\n    fromString: V.isSimpleString(l),\n    lexical: l.value.trim(),\n  };\n  if (target === V.dt.boolean.value) return castBoolean(source);\n  if (XSD_INTEGER_TYPES.has(target)) return castInteger(source);\n  if (target === V.dt.decimal.value) return castDecimal(source);\n  if (target === V.dt.double.value || target === V.dt.float.value) return castFloating(source);\n  if (target === V.dt.dateTime.value) return castDateTime(source);\n  return castOther(source);\n};\n\nconst CASTABLE: ReadonlyMap<string, true> = StringMap.setOf([\n  Term.XSD_STRING,\n  `${V.XSD}boolean`,\n  `${V.XSD}decimal`,\n  `${V.XSD}float`,\n  `${V.XSD}double`,\n  `${V.XSD}dateTime`,\n  `${V.XSD}date`,\n  `${V.XSD}time`,\n  ...XSD_INTEGER_TYPE_NAMES,\n]);\n\n/**\n * Whether an IRI is an XSD constructor function (cast) supported by this\n * implementation.\n *\n * @since 0.1.0\n * @category casts\n */\nexport const isCast = (iri: string): boolean => CASTABLE.has(iri);\n\n/**\n * Casts a term to an XSD datatype (`xsd:integer(?x)` etc.). Throws an\n * expression error when the cast is not possible.\n *\n * @since 0.1.0\n * @category casts\n */\nexport const cast = (datatype: string, term: Term.GroundTerm): Term.Literal => {\n  if (Term.isBlankNode(term) || Term.isTriple(term)) return V.fail('Cannot cast');\n  if (Term.isNamedNode(term) && datatype !== Term.XSD_STRING) return V.fail('Cannot cast an IRI');\n  return castTo(datatype, term);\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAOA,MAAM,QAAQ,MAA0B,IAAI,YAAY,CAAC,CAAC,OAAO,CAAC;AAElE,MAAM,OAAO,UACX,MAAM,KAAK,QAAQ,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;;AAGnE,MAAM,SAAS,MAAqC,MAAM,KAAK,EAAE,QAAQ,EAAE,IAAI,GAAG,MAAM,CAAC;;AAGzF,MAAM,UAAU,GAAe,cAC7B,MAAM,EAAE,SAAS,SAAS,CAAC,CAAC,KAAK,MAAM,IAAI,SAAS;AAEtD,MAAM,OAAO,KAAiB,WAAmB,aAAqB,iBAA0B;CAC9F,MAAM,SAAS,OAAO,IAAI,MAAM,IAAI;CACpC,MAAM,QAAQ,KAAK,MAAM,IAAI,SAAS,IAAI,eAAe,SAAS,IAAI;CACtE,MAAM,MAAM,IAAI,WAAW,KAAK;CAChC,IAAI,IAAI,GAAG;CACX,IAAI,IAAI,UAAU;CAClB,MAAM,WAAW,CAAC,CAAC,SAAS,MAAM;EAChC,MAAM,OAAO,OAAQ,UAAU,OAAO,IAAI,CAAC,IAAK,IAAK;EACrD,IAAI,cAAc,IAAI,QAAQ,cAAc,KAAK;OAC5C,IAAI,QAAQ,IAAI,KAAK;CAC5B,CAAC;CACD,OAAO;AACT;AAEA,MAAM,QAAQ,GAAW,MAAe,KAAK,IAAM,MAAO,KAAK;AAC/D,MAAM,QAAQ,GAAW,MAAe,MAAM,IAAM,KAAM,KAAK;;AAG/D,MAAM,YAAY,UAChB,MAAM,KAAK,OAAO,MAAM,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;AAkBnE,MAAM,YAAoC;CAbxC;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAG;CAAI;CAAI;CAAG;CAAG;CAAI;CAAI;CAAG;CAAG;CAC9F;CAAI;CAAG;CAAG;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAC7F;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;AAWM,CAAC,CAAC,KAAK,GAAG,OAAO;CAC7D;CACA,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI;CACrD;CACA,GAAG,IAAI,KAAK,IAAI,IAAI,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI,MAAM,IAAI,IAAI,KAAK,KAAM,IAAI,IAAK;AACpF,EAAE;AAEF,MAAa,OAAO,UAA0B;CAC5C,MAAM,IAAI,IAAI,KAAK,KAAK,GAAG,IAAI,GAAG,IAAI;CACtC,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,MAAM,OAAO,IAAI,SAAS,EAAE,MAAM;CAClC,OAAO,GAAG,EAAE,CAAC,CAAC,SAAS,QAAQ;EAC7B,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,UAAU,SAAS,EAAE,GAAG,GAAG,GAAG,QAAQ;GACpC,MAAM,IACJ,IAAI,KACC,IAAI,IAAM,CAAC,IAAI,IAChB,IAAI,KACD,IAAI,IAAM,CAAC,IAAI,IAChB,IAAI,KACF,IAAI,IAAI,IACR,KAAK,IAAI,CAAC;GACpB,MAAM,MAAM;GACZ,IAAI;GACJ,IAAI;GACJ,IAAK,IAAI,KAAM,IAAI,IAAI,KAAK,KAAK,UAAU,MAAM,IAAI,GAAG,IAAI,IAAI,KAAM,GAAG,CAAC,IAAK;GAC/E,IAAI;EACN,CAAC;EACD,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;CAClB,CAAC;CACD,MAAM,sBAAM,IAAI,yBAAS,IAAI,YAAY,EAAE,CAAC;CAC5C;EAAC;EAAI;EAAI;EAAI;CAAE,CAAC,CAAC,SAAS,GAAG,MAAM,IAAI,UAAU,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;CACtE,OAAO,IAAI,IAAI,WAAW,IAAI,MAAM,CAAC;AACvC;AAIA,MAAM,YAAY,MAAM,EAAE;AAC1B,MAAM,cAAc,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;AACtC,MAAM,cAAc,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;AACtC,MAAM,cAAc,MAAM,EAAE;AAE5B,MAAa,QAAQ,UAA0B;CAC7C,MAAM,IAAI,IAAI,KAAK,KAAK,GAAG,IAAI,GAAG,KAAK;CACvC,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,MAAM,OAAO,IAAI,SAAS,EAAE,MAAM;CAElC,MAAM,oBAAI,IAAI,yBAAS,IAAI,YAAY,GAAM,CAAC;CAC9C,MAAM,QAAQ,MAAc,EAAE,SAAS,IAAI,CAAC;CAC5C,OAAO,GAAG,EAAE,CAAC,CAAC,SAAS,QAAQ;EAC7B,UAAU,SAAS,MAAM,EAAE,SAAS,IAAI,GAAG,KAAK,UAAU,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;EAC3E,YAAY,SAAS,MACnB,EAAE,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,CACpF;EACA,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,YAAY,SAAS,MAAM;GACzB,MAAM,IACJ,IAAI,KACC,IAAI,IAAM,CAAC,IAAI,IAChB,IAAI,KACF,IAAI,IAAI,IACR,IAAI,KACD,IAAI,IAAM,IAAI,IAAM,IAAI,IACzB,IAAI,IAAI;GAClB,MAAM,IACJ,IAAI,KAAK,aAAa,IAAI,KAAK,aAAa,IAAI,KAAK,cAAiB;GACxE,MAAM,IAAK,KAAK,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,IAAK;GAC/C,IAAI;GACJ,IAAI;GACJ,IAAI,KAAK,GAAG,EAAE;GACd,IAAI;GACJ,IAAI;EACN,CAAC;EACD,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;CAClB,CAAC;CACD,OAAO,SAAS;EAAC;EAAI;EAAI;EAAI;EAAI;CAAE,CAAC;AACtC;AAIA,MAAM,OAAO;CACX;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CACpF;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;CAAY;AACtF,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC;AAElB,MAAa,UAAU,UAA0B;CAC/C,MAAM,IAAI,IAAI,KAAK,KAAK,GAAG,IAAI,GAAG,KAAK;CACvC,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,IAAI,KAAK;CACT,MAAM,OAAO,IAAI,SAAS,EAAE,MAAM;CAElC,MAAM,oBAAI,IAAI,yBAAS,IAAI,YAAY,GAAM,CAAC;CAC9C,MAAM,QAAQ,MAAc,EAAE,SAAS,IAAI,CAAC;CAC5C,OAAO,GAAG,EAAE,CAAC,CAAC,SAAS,QAAQ;EAC7B,UAAU,SAAS,MAAM,EAAE,SAAS,IAAI,GAAG,KAAK,UAAU,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;EAC3E,YAAY,SAAS,MAAM;GACzB,MAAM,IAAI,KAAK,IAAI,EAAE;GACrB,MAAM,IAAI,KAAK,IAAI,CAAC;GACpB,MAAM,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAK,MAAM;GAC7C,MAAM,KAAK,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,IAAK,MAAM;GAC9C,EAAE,SAAS,IAAI,GAAI,KAAK,IAAI,EAAE,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAM,CAAC;EAC9D,CAAC;EACD,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,KAAK;EACT,KAAK,SAAS,GAAG,MAAM;GACrB,MAAM,KAAK,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;GAChD,MAAM,KAAM,IAAI,IAAM,CAAC,IAAI;GAC3B,MAAM,KAAM,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,IAAK;GAG1C,MAAM,MAFK,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,MACnC,IAAI,IAAM,IAAI,IAAM,IAAI,KACb;GACxB,KAAK;GACL,IAAI;GACJ,IAAI;GACJ,IAAK,IAAI,KAAM;GACf,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAK,KAAK,KAAM;EAClB,CAAC;EACD,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,IAAK;EAChB,KAAM,KAAK,KAAM;CACnB,CAAC;CACD,OAAO,SAAS;EAAC;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;CAAE,CAAC;AAClD;AAIA,MAAM,OAAO;CACX;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,MAAM,OAAO,KAAK,GAAG,CAAC;AAE7B,MAAM,UAAU,MAAM,OAAO;AAC7B,MAAM,UAAU,GAAW,OAAgB,KAAK,IAAM,KAAM,MAAM,KAAO;AAEzE,MAAM,eAAe,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;AAKvC,MAAM,cAAc,OAAe,MAAgB,aAA6B;CAC9E,MAAM,IAAI,IAAI,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK;CACzC,IAAI,IAAI;CACR,MAAM,OAAO,IAAI,SAAS,EAAE,MAAM;CAElC,MAAM,oBAAI,IAAI,yBAAS,IAAI,YAAY,GAAM,CAAC;CAC9C,MAAM,QAAQ,MAAc,EAAE,aAAa,IAAI,CAAC;CAChD,OAAO,GAAG,GAAG,CAAC,CAAC,SAAS,QAAQ;EAC9B,UAAU,SAAS,MAAM,EAAE,aAAa,IAAI,GAAG,KAAK,aAAa,MAAM,IAAI,CAAC,CAAC,CAAC;EAC9E,aAAa,SAAS,MAAM;GAC1B,MAAM,IAAI,KAAK,IAAI,EAAE;GACrB,MAAM,IAAI,KAAK,IAAI,CAAC;GACpB,MAAM,KAAK,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,EAAE,IAAK,KAAK;GACjD,MAAM,KAAK,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG,IAAK,KAAK;GACnD,EAAE,aAAa,IAAI,GAAI,KAAK,IAAI,EAAE,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAM,MAAM;EACvE,CAAC;EACD,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM;EAChC,KAAK,SAAS,GAAG,MAAM;GACrB,MAAM,KAAK,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG;GAC1D,MAAM,KAAM,IAAI,IAAM,CAAC,IAAI,SAAS;GACpC,MAAM,KAAM,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,IAAK;GAG1C,MAAM,MAFK,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG,IAAI,OAAO,GAAG,GAAG,MAC7C,IAAI,IAAM,IAAI,IAAM,IAAI,KACb;GACxB,KAAK;GACL,IAAI;GACJ,IAAI;GACJ,IAAK,IAAI,KAAM;GACf,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAK,KAAK,KAAM;EAClB,CAAC;EACD,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM;EACzC,IAAI;GACD,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,IAAK;GACV,KAAK,KAAM;EACd;CACF,CAAC;CACD,OAAO,EACJ,MAAM,GAAG,QAAQ,CAAC,CAClB,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,CAAC,CAC5C,KAAK,EAAE;AACZ;AAEA,MAAM,OAAO,MAAsB,OAAO,KAAK,GAAG;;AAGlD,MAAM,YACJ,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,OAUZ;CAAC,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;CAAG,IAAI,CAAC;AAAC;AAE9E,MAAa,UAAU,UACrB,WACE,OACA,SACE,oBACA,oBACA,oBACA,oBACA,oBACA,oBACA,oBACA,kBACF,GACA,CACF;AAEF,MAAa,UAAU,UACrB,WACE,OACA,SACE,oBACA,oBACA,oBACA,oBACA,oBACA,oBACA,oBACA,kBACF,GACA,CACF;;;;;;;;;;;;AC7YF,MAAa,MAAM;AACnB,MAAa,MAAM;;AAGnB,IAAa,cAAb,MAAyB;CACvB;CACA,YAAY,SAAiB;EAC3B,KAAK,UAAU;CACjB;AACF;;;;;AAMA,MAAa,oBAAuB,MAClC,OAAO,IAAI;CACT,KAAK;CACL,QAAQ,UAAU;EAChB,IAAI,iBAAiB,aAAa,OAAO;EACzC,MAAM;CACR;AACF,CAAC;AAEH,MAAa,QAAQ,YAA2B;CAC9C,MAAM,IAAI,YAAY,OAAO;AAC/B;AAEA,MAAa,KAAK;CAChB,QAAQA,UAAe,GAAG,IAAI,OAAO;CACrC,SAASA,UAAe,GAAG,IAAI,QAAQ;CACvC,SAASA,UAAe,GAAG,IAAI,QAAQ;CACvC,SAASA,UAAe,GAAG,IAAI,QAAQ;CACvC,OAAOA,UAAe,GAAG,IAAI,MAAM;CACnC,QAAQA,UAAe,GAAG,IAAI,OAAO;CACrC,UAAUA,UAAe,GAAG,IAAI,SAAS;CACzC,iBAAiBA,UAAe,GAAG,IAAI,gBAAgB;CACvD,YAAYA,UAAe,GAAG,IAAI,WAAW;CAC7C,eAAeA,UAAe,GAAG,IAAI,cAAc;AACrD;AAEA,MAAa,OAAO,IAAIC,QAAa,QAAQ,GAAG,OAAO;AACvD,MAAa,QAAQ,IAAIA,QAAa,SAAS,GAAG,OAAO;AACzD,MAAa,QAAQ,MAA8B,IAAI,OAAO;;AAS9D,MAAa,kBAAkB,MAC7BC,UAAe,CAAC,KAAK,EAAE,aAAa,MAAM,EAAE,SAAS,UAAU;;AAGjE,MAAa,mBAAmB,MAC9BA,UAAe,CAAC,MAAM,EAAE,aAAa,MAAM,EAAE,SAAS,UAAU;AAElE,MAAa,cAAc,OAAe,SACxC,KAAK,aAAa,KACd,IAAID,QAAa,OAAO,GAAG,MAAM,IACjC,KAAK,cAAc,KAAA,IACjB,IAAIA,QAAa,OAAO,GAAG,YAAY,KAAK,QAAQ,IACpD,IAAIA,QAAa,OAAO,GAAG,eAAe,KAAK,UAAU,KAAK,SAAS;AAE/E,MAAa,UAAU,UAAgC,IAAIA,QAAa,OAAO,GAAG,MAAM;;AAkBxF,MAAM,2BAAW,IAAI,QAA0C;AAE/D,MAAM,cAAc,MAClB,UAAU,SAAS,GAAG,SAAS,IAC3B,OAAO,KAAK;CAAE,MAAM;CAAG,GAAG,EAAE;AAAM,CAAC,IACnC,UAAU,SAAS,GAAG,SAAS,IAC7B,OAAO,KAAK;CAAE,MAAM;CAAG,GAAG,EAAE;AAAM,CAAC,IACnC,UAAU,SAAS,GAAG,OAAO,IAC3B,OAAO,KAAK;CAAE,MAAM;CAAG,GAAG,EAAE;AAAM,CAAC,IACnC,UAAU,SAAS,GAAG,QAAQ,IAC5B,OAAO,KAAK;CAAE,MAAM;CAAG,GAAG,EAAE;AAAM,CAAC,IACnC,OAAO,KAAK;;AAGxB,MAAa,WAAW,MAAqC;CAC3D,IAAI,CAACC,UAAe,CAAC,KAAK,EAAE,aAAa,IAAI,OAAO,OAAO,KAAK;CAChE,MAAM,SAAS,SAAS,IAAI,CAAC;CAC7B,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,MAAM,IAAI,EAAE,SAAS;CACrB,MAAM,SACJC,kBAAsB,CAAC,KAAKC,eAAmB,GAAG,EAAE,KAAK,IACrD,WAAWC,QAAY,CAAC,CAAC,IACzB,OAAO,KAAK;CAClB,SAAS,IAAI,GAAG,MAAM;CACtB,OAAO;AACT;AAEA,MAAa,aAAa,MAA0B,OAAO,OAAO,QAAQ,CAAC,CAAC;AAE5E,MAAa,YAAY,MACvB,EAAE,SAAS,IAAI,OAAO,EAAE,CAAC,IAAI,EAAE,SAAS,IAAI,WAAW,eAAe,EAAE,CAAC,IAAI,EAAE;AAEjF,MAAa,aAAa,MACxB,EAAE,SAAS,IAAI,WAAW,WAAW,EAAE,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,IAAI,KAAK,eAAe;;AAGvF,MAAa,WAAW,GAAQ,SAAsB;CACpD,IAAI,EAAE,QAAQ,MAAM,OAAO;CAC3B,OAAO,SAAA,IACH;EAAE,MAAM;EAAG,GAAG,UAAU,CAAC;CAAE,IAC3B,SAAA,IACE;EAAE,MAAM;EAAG,GAAG,KAAK,OAAO,SAAS,CAAC,CAAC;CAAE,IACvC;EAAE,MAAM;EAAG,GAAG,SAAS,CAAC;CAAE;AAClC;AAEA,MAAa,cAAc,MACzB,EAAE,SAAS,IACP,IAAIJ,QAAa,EAAE,EAAE,SAAS,GAAG,GAAG,OAAO,IAC3C,EAAE,SAAS,IACT,IAAIA,QAAaK,iBAAqB,EAAE,CAAC,GAAG,GAAG,OAAO,IACtD,EAAE,SAAS,IACT,IAAIL,QAAaM,gBAAoB,KAAK,OAAO,EAAE,CAAC,CAAC,GAAG,GAAG,KAAK,IAChE,IAAIN,QAAaM,gBAAoB,EAAE,CAAC,GAAG,GAAG,MAAM;;AAG9D,MAAa,cAAc,MAAsB;CAC/C,MAAM,IAAI,QAAQ,CAAC;CACnB,OAAO,OAAO,OAAO,CAAC,IAAI,EAAE,QAAQ,KAAK,4BAA4B;AACvE;AAEA,MAAM,iBAAiB;;AAGvB,MAAM,gBAAgB,MAAc,IAA2B,IAAS,OAA0B;CAChG,IAAI,GAAG,SAAS,KAAK,GAAG,SAAS,GAAG;EAClC,MAAM,IAAI,GAAG;EACb,MAAM,IAAI,GAAG;EACb,OAAO,WAAW;GAAE,MAAM;GAAG,GAAG,OAAO,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,IAAI;EAAE,CAAC;CACnF;CACA,IAAI,GAAG,SAAS,KAAK,GAAG,SAAS,GAAG;EAClC,MAAM,IAAI,GAAG;EACb,MAAM,IAAI,GAAG;EACb,IAAI,OAAO,KAAK;GACd,IAAI,WAAW,OAAO,CAAC,GAAG,OAAO,KAAK,kBAAkB;GACxD,OAAO,WAAW;IAAE,MAAM;IAAG,GAAG,cAAc,GAAG,CAAC;GAAE,CAAC;EACvD;EACA,OAAO,WAAW;GAChB,MAAM;GACN,GACE,OAAO,MACH,WAAW,IAAI,GAAG,CAAC,IACnB,OAAO,MACL,WAAW,SAAS,GAAG,CAAC,IACxB,WAAW,SAAS,GAAG,CAAC;EAClC,CAAC;CACH;CAEA,MAAM,IAAI,SAAS,EAAE;CACrB,MAAM,IAAI,SAAS,EAAE;CACrB,MAAM,IAAI,OAAO,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,IAAI;CAC7E,OAAO,WAAW,SAAA,IAAiB;EAAE,MAAM;EAAG,GAAG,KAAK,OAAO,CAAC;CAAE,IAAI;EAAE,MAAM;EAAG,GAAG;CAAE,CAAC;AACvF;AAEA,MAAa,cAAc,IAA2B,GAAc,MAA+B;CACjG,MAAM,IAAI,WAAW,CAAC;CACtB,MAAM,IAAI,WAAW,CAAC;CACtB,IAAI,OAAO,KAAK,IAAI,EAAE,MAAM,EAAE,IAAI;CAClC,IAAI,OAAO,OAAO,SAAA,GAAkB,OAAA;CACpC,MAAM,KAAK,QAAQ,GAAG,IAAI;CAC1B,MAAM,KAAK,QAAQ,GAAG,IAAI;CAC1B,OAAO,aAAa,MAAM,IAAI,IAAI,EAAE;AACtC;;AAGA,MAAa,iBACX,GACA,MAC0B;CAC1B,MAAM,QAAQ,WAAW,OAAO,GAAG,CAAC;CACpC,MAAM,SAAS,WAAW,MACxB,OAAO,UAAU,aAAa,WAAW,WAAW,EAAE,CAAC,GACvD;EACE,OAAO;EACP,MAAM;CACR,CACF;CACA,OAAO,WAAW,UAAU,MAAM;AACpC;AAEA,MAAa,UAAU,MAA+B;CACpD,OAAO,UAAU,WAAW,CAAC,CAAC;AAChC;AAEA,MAAM,aAAa,MACjB,WACE,EAAE,SAAS,IACP;CAAE,MAAM;CAAG,GAAG,CAAC,EAAE;AAAE,IACnB,EAAE,SAAS,IACT;CAAE,MAAM;CAAG,GAAG,WAAW,OAAO,EAAE,CAAC;AAAE,IACrC,EAAE,SAAS,IACT;CAAE,MAAM;CAAG,GAAG,CAAC,EAAE;AAAE,IACnB;CAAE,MAAM;CAAG,GAAG,CAAC,EAAE;AAAE,CAC7B;;AAGF,MAAa,cAAc,GAAQ,MAAmB;CACpD,MAAM,OAAO,KAAK,IAAI,EAAE,MAAM,EAAE,IAAI;CACpC,IAAI,QAAA,GAAiB;EACnB,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG;GAChC,MAAM,IAAI,EAAE;GACZ,MAAM,IAAI,EAAE;GACZ,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;EAClC;EACA,MAAM,IAAI,UAAU,CAAC;EACrB,MAAM,IAAI,UAAU,CAAC;EACrB,OAAO,WAAW,WAAW,GAAG,CAAC,IAAI,KAAK,WAAW,cAAc,GAAG,CAAC,IAAI,IAAI;CACjF;CACA,MAAM,IAAI,SAAS,QAAQ,GAAG,IAAI,CAAC;CACnC,MAAM,IAAI,SAAS,QAAQ,GAAG,IAAI,CAAC;CACnC,IAAI,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,GAAG,OAAO;CAC/C,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAMA,MAAM,aAAwCC,MAAgB;CAC5D;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AASD,MAAa,aAAa,MAA2C;CACnE,IAAI,CAACN,UAAe,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,WAAA,mCAAc,GAAG,OAAO,OAAO,KAAK;CAChF,MAAM,QAAQ,EAAE,SAAS,MAAM,MAAM,EAAU;CAC/C,IAAI,CAAC,WAAW,IAAI,KAAK,KAAK,CAACE,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK,GACzE,OAAO,OAAO,KAAK;CAErB,MAAM,IAAIC,QAAY,CAAC;CACvB,IAAI,CAAC,UAAU,SAAS,GAAG,UAAU,GAAG,OAAO,OAAO,KAAK;CAC3D,OAAO,OAAO,KAAK;EACjB,MAAM,UAAU,kBAAkB,aAAa;EAC/C,QAAQ,EAAE;EACV,OAAO,EAAE,aAAa,KAAA;CACxB,CAAC;AACH;AAEA,MAAM,iBAAiB;AAEvB,MAAM,SAAS,OAAO,KAAK,EAAE;AAC7B,MAAM,OAAO,OAAO,KAAK,CAAC;AAC1B,MAAM,QAAQ,OAAO,KAAK,CAAC;;AAG3B,MAAa,gBAAgB,GAAc,MAAwC;CACjF,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO,OAAO,KAAK;CAC1C,IAAI,EAAE,UAAU,EAAE,OAAO;EACvB,MAAM,OAAO,EAAE,SAAS,EAAE;EAC1B,IAAI,KAAK,IAAI,IAAI,KAAK,gBAAgB,OAAO,OAAO,KAAK;EACzD,OAAO,OAAO,IAAI,SAAS;CAC7B;CACA,OAAO,EAAE,SAAS,EAAE,SAAS,SAAS,EAAE,SAAS,EAAE,SAAS,QAAQ;AACtE;AAQA,MAAa,iBAAiB,MAA+C;CAC3E,IAAI,CAACH,UAAe,CAAC,GAAG,OAAO,OAAO,KAAK;CAC3C,MAAM,IAAI,EAAE,SAAS;CACrB,IAAI,MAAM,+CAAoB,MAAM,sDAA2B,MAAM,sDACnE,OAAO,OAAO,KAAK;CAErB,IAAI,CAACE,eAAmB,GAAG,EAAE,KAAK,GAAG,OAAO,OAAO,KAAK;CACxD,MAAM,IAAIC,QAAY,CAAC;CACvB,OAAO,UAAU,SAAS,GAAG,UAAU,IACnC,OAAO,KAAK;EAAE,MAAM,EAAE,MAAM,EAAU;EAAG,QAAQ,EAAE;EAAQ,SAAS,EAAE;CAAQ,CAAC,IAC/E,OAAO,KAAK;AAClB;;AAOA,MAAa,qBAAqB,GAAW,MAAsB;CACjE,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CAErC,IAAI,IAAI;CACR,WAAW;EACT,IAAI,KAAK,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,OAAO;EAC1D;EACA,OAAO;CACT,CAAC;CACD,IAAI,IAAI,GAAG;EACT,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,MAAM,KAAK,KAAK,SAAU,KAAK;EAE/B,IAAI,QADO,KAAK,SAAU,KAAK,QAChB,OAAO,KAAK,IAAI;EAC/B,OAAO,IAAI,IAAI,KAAK;CACtB;CACA,OAAO,EAAE,SAAS,EAAE,SAAS,KAAK,EAAE,SAAS,EAAE,SAAS,IAAI;AAC9D;AAMA,MAAM,oBAAoB,MACxBH,UAAe,CAAC,KAChB,EAAE,SAAS,UAAU,8CACrBE,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK;AAE9C,MAAM,gBAAgB,MAA6B,EAAE,UAAU,UAAU,EAAE,UAAU;;;;;AAMrF,MAAa,mBAAmB,GAAc,MAAyB;CACrE,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,QAAQ,CAAC;CACnB,IAAI,OAAO,OAAO,CAAC,KAAK,OAAO,OAAO,CAAC,GAAG,OAAO,WAAW,EAAE,OAAO,EAAE,KAAK;CAC5E,IAAI,eAAe,CAAC,KAAK,eAAe,CAAC,GAAG,OAAO,kBAAkB,EAAE,OAAO,EAAE,KAAK;CACrF,IACEF,UAAe,CAAC,KAChBA,UAAe,CAAC,KAChB,EAAE,aAAa,MACf,EAAE,aAAa,EAAE,YACjB,EAAE,cAAc,EAAE,WAElB,OAAO,kBAAkB,EAAE,OAAO,EAAE,KAAK;CAE3C,IAAI,iBAAiB,CAAC,KAAK,iBAAiB,CAAC,GAC3C,OAAO,OAAO,aAAa,CAAC,CAAC,IAAI,OAAO,aAAa,CAAC,CAAC;CAEzD,MAAM,KAAK,UAAU,CAAC;CACtB,MAAM,KAAK,UAAU,CAAC;CACtB,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG;EAC1C,MAAM,IAAI,aAAa,GAAG,OAAO,GAAG,KAAK;EACzC,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO,EAAE;EAC/B,OAAO,KAAK,+BAA+B;CAC7C;CACA,MAAM,KAAK,cAAc,CAAC;CAC1B,MAAM,KAAK,cAAc,CAAC;CAC1B,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG;EAC1C,MAAM,IAAI,GAAG;EACb,MAAM,IAAI,GAAG;EACb,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO,KAAK,KAAK,EAAE,UAAU,EAAE,OAAO;EACjE,IAAI,EAAE,YAAY,EAAE,SAAS,OAAO,KAAK,KAAK,EAAE,SAAS,EAAE,MAAM;EACjE,OAAO,KAAK,mCAAmC;CACjD;CACA,OAAO,KAAK,qBAAqB;AACnC;AAEA,MAAM,kBAAkB,MACtB,EAAE,aAAa,MAAMO,gBAAoB,EAAE,SAAS,KAAK;;AAG3D,MAAa,UAAU,GAAc,MAA0B;CAC7D,MAAM,KAAKC,SAAc,CAAC;CAC1B,MAAM,KAAKA,SAAc,CAAC;CAC1B,IAAI,MAAM,IAAI;EACZ,IAAI,CAAC,MAAM,CAAC,IAAI,OAAO;EACvB,OACE,OAAO,EAAE,SAAS,EAAE,OAAO,KAAK,OAAO,EAAE,WAAW,EAAE,SAAS,KAAK,OAAO,EAAE,QAAQ,EAAE,MAAM;CAEjG;CACA,IAAI,CAACR,UAAe,CAAC,KAAK,CAACA,UAAe,CAAC,GAAG,OAAO,EAAE,QAAQ,EAAE;CACjE,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,QAAQ,CAAC;CACnB,IAAI,OAAO,OAAO,CAAC,KAAK,OAAO,OAAO,CAAC,GAAG,OAAO,WAAW,EAAE,OAAO,EAAE,KAAK,MAAM;CAClF,IAAI,EAAE,QAAQ,EAAE,KAAK,OAAO;CAC5B,IAAI,eAAe,CAAC,KAAK,eAAe,CAAC,GAAG,OAAO,EAAE,UAAU,EAAE;CACjE,IAAI,iBAAiB,CAAC,KAAK,iBAAiB,CAAC,GAAG,OAAO,aAAa,CAAC,MAAM,aAAa,CAAC;CACzF,MAAM,KAAK,UAAU,CAAC;CACtB,MAAM,KAAK,UAAU,CAAC;CACtB,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG;EAC1C,IAAI,GAAG,MAAM,SAAS,GAAG,MAAM,MAAM,OAAO;EAC5C,MAAM,IAAI,aAAa,GAAG,OAAO,GAAG,KAAK;EACzC,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO,KAAK,+BAA+B;EACjE,OAAO,EAAE,UAAU;CACrB;CACA,MAAM,KAAK,cAAc,CAAC;CAC1B,MAAM,KAAK,cAAc,CAAC;CAC1B,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GACvC,OAAO,GAAG,MAAM,WAAW,GAAG,MAAM,UAAU,GAAG,MAAM,YAAY,GAAG,MAAM;CAE9E,IAAI,EAAE,aAAa,MAAM,EAAE,aAAa,IAEtC,OAAO;CAIT,IACE,eAAe,CAAC,KAChB,eAAe,CAAC,KAChBS,aAAiB,CAAC,KAClBA,aAAiB,CAAC,KAClB,EAAE,SAAS,UAAU,EAAE,SAAS,OAEhC,OAAO;CAET,OAAO,KAAK,yBAAyB;AACvC;;AAGA,MAAM,UAAU,MACd,EAAE,SAAS,IACP,EAAE,MAAM,KACR,EAAE,SAAS,IACT,CAAC,WAAW,OAAO,EAAE,CAAC,IACtB,EAAE,EAAE,MAAM,KAAK,OAAO,MAAM,EAAE,CAAC;AAEvC,MAAa,OAAO,MAA0B;CAC5C,IAAI,CAACT,UAAe,CAAC,GAAG,OAAO,KAAK,sBAAsB;CAC1D,MAAM,IAAI,EAAE,SAAS;CACrB,IAAI,MAAM,4CAAiB;EACzB,IAAI,CAACE,eAAmB,GAAG,EAAE,KAAK,GAAG,OAAO,KAAK,iBAAiB;EAClE,OAAO,aAAa,CAAC;CACvB;CACA,IAAI,EAAE,aAAa,MAAM,MAAM,2CAAiB,OAAO,IAAI,WAAW,EAAE,KAAK;CAC7E,IAAID,kBAAsB,CAAC,GAAG;EAC5B,MAAM,IAAI,QAAQ,CAAC;EACnB,OAAO,OAAO,OAAO,CAAC,KAAK,OAAO,EAAE,KAAK;CAC3C;CACA,OAAO,KAAK,qCAAqC;AACnD;;AAGA,MAAM,YAAY,MAChBS,YAAiB,CAAC,IACd,IACAC,YAAiB,CAAC,IAChB,IACAX,UAAe,CAAC,IACd,IACAQ,SAAc,CAAC,IACb,IACA;;AAGZ,MAAM,uBAAuB,GAAiB,MAA4B;CAGxE,MAAM,WAAW,OAAO,UAAU,gBAAgB,GAAG,CAAC,CAAC;CACvD,IAAI,OAAO,UAAU,QAAQ,GAAG;EAC9B,MAAM,IAAI,SAAS;EACnB,IAAI,CAAC,OAAO,MAAM,CAAC,KAAK,MAAM,GAAG,OAAO;EACxC,IAAI,MAAM,KAAK,EAAE,QAAQ,EAAE,KAAK,OAAO;CACzC;CAEA,MAAM,KAAK,EAAE,aAAa,KAAK,IAAI,EAAE,SAAS,UAAU,4CAAkB,IAAI;CAC9E,MAAM,KAAK,EAAE,aAAa,KAAK,IAAI,EAAE,SAAS,UAAU,4CAAkB,IAAI;CAC9E,IAAI,OAAO,IAAI,OAAO,KAAK;CAC3B,OACE,kBAAkB,EAAE,SAAS,OAAO,EAAE,SAAS,KAAK,KACpD,kBAAkB,EAAE,UAAU,EAAE,QAAQ,KACxC,kBAAkB,EAAE,OAAO,EAAE,KAAK;AAEtC;;;;;;AAOA,MAAa,gBAAgB,GAAc,MAAyB;CAClE,MAAM,KAAK,SAAS,CAAC;CACrB,MAAM,KAAK,SAAS,CAAC;CACrB,IAAI,OAAO,IAAI,OAAO,KAAK;CAC3B,IAAIR,UAAe,CAAC,KAAKA,UAAe,CAAC,GAAG,OAAO,oBAAoB,GAAG,CAAC;CAC3E,IAAIQ,SAAc,CAAC,KAAKA,SAAc,CAAC,GACrC,OACE,aAAa,EAAE,SAAS,EAAE,OAAO,KACjC,aAAa,EAAE,WAAW,EAAE,SAAS,KACrC,aAAa,EAAE,QAAQ,EAAE,MAAM;CAGnC,KACGE,YAAiB,CAAC,KAAKC,YAAiB,CAAC,OACzCD,YAAiB,CAAC,KAAKC,YAAiB,CAAC,IAE1C,OAAO,kBAAkB,EAAE,OAAO,EAAE,KAAK;CAE3C,OAAO;AACT;;AAGA,MAAa,gBAAgB,GAA6B,MACxD,OAAO,OAAO,CAAC,IACX,OAAO,OAAO,CAAC,IACb,IACA,KACF,OAAO,OAAO,CAAC,IACb,IACA,aAAa,EAAE,OAAO,EAAE,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpgBrC,IAAa,kBAAb,cAAqC,OAAO,YAA6B,CAAC,CAAC,mBAAmB,EAC5F,SAAS,OAAO,OAClB,CAAC,CAAC,CAAC,CAAC;;;;;;;AAQJ,MAAa,SAAS,YAA2BC,KAAO,OAAO;;;;;;;AA4C/D,MAAa,YAAY,cACvBC,YAAsB,OAAO,UAAU,SAAS,CAAC;AAMnD,MAAM,cAAc,MAClBC,UAAe,CAAC,IAAI,IAAIF,KAAO,oBAAoB;AAErD,MAAM,aAAa,MACjBG,gBAAkB,CAAC,IAAI,IAAIH,KAAO,2BAA2B;AAE/D,MAAM,aAAa,MACjBI,eAAiB,CAAC,IAAI,IAAIJ,KAAO,2BAA2B;;AAG9D,MAAM,cAAc,GAAiB,MACnC,EAAE,aAAa,MAAO,EAAE,aAAa,EAAE,YAAY,EAAE,cAAc,EAAE;AAEvE,MAAM,cAAc,MAA6B,MAAM,KAAK,CAAC;AAE7D,MAAM,cAAc,MAClB,IAAIK,QAAa,OAAO,CAAC,CAAC,CAAC,SAAS,GAAA,GAAQ,OAAO;AAErD,MAAM,SAASC;AAEf,MAAM,YACJ,GACA,MACA,OACiB;CACjB,MAAM,IAAI,OAAO,CAAC;CAClB,OAAOC,WACL,EAAE,SAAS,IACP,IACA,EAAE,SAAS,IACT;EAAE,MAAM;EAAG,GAAG,WAAW,MAAM,EAAE,GAAG;GAAE,OAAO;GAAG;EAAK,CAAC;CAAE,IACxD,EAAE,SAAS,IACT;EAAE,MAAM;EAAG,GAAG,GAAG,EAAE,CAAC;CAAE,IACtB;EAAE,MAAM;EAAG,GAAG,GAAG,EAAE,CAAC;CAAE,CAChC;AACF;AAEA,MAAM,cAAc,MAAsB;CACxC,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,OAAO,GAAG,GAAG,EAAE,GAAG,OAAO;CACpD,MAAM,IAAI,KAAK,MAAM,IAAI,EAAG;CAC5B,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK;AACjC;;AAGA,MAAM,aAAaC,MAAwB;;AAG3C,MAAa,gBAAgB,SAAiB,OAAe,SAAS,UAAkB;CACtF,MAAM,MAAM,GAAG,SAAS,MAAM,KAAK,MAAM,GAAG;CAC5C,MAAM,SAAS,WAAW,IAAI,GAAG;CACjC,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,IAAI,SAAS;CACb,IAAI,UAAU,SAAS,MAAM;CAC7B,MAAM,KAAK,KAAK,CAAC,CAAC,SAAS,SAAS;EAClC,IAAI,SAAS,OAAO,SAAS,OAAO,SAAS,KACvC;OAAA,CAAC,QAAQ,SAAS,IAAI,GAAG,WAAW;EAAA,OACnC,IAAI,SAAS,KAAK,SAAS,OAAO,QAAQ,cAAc,EAAE;OAC5D,IAAI,SAAS,KAAK,SAAS,OAAO,QAAQ,uBAAuB,MAAM;OACvE,KAAO,uBAAuB,KAAK,EAAE;CAC5C,CAAC;CAED,MAAM,WAAW,OAAO,UAAU,IAAI,OAAO,QAAQ,GAAG,QAAQ,EAAE,CAAC,CAAC,CAAC,KACnE,OAAO,aAAa,OAAO,UAAU,IAAI,OAAO,QAAQ,OAAO,CAAC,CAAC,CACnE;CACA,IAAI,OAAO,UAAU,QAAQ,GAAG,OAAOR,KAAO,4BAA4B;CAC1E,MAAM,KAAK,SAAS;CACpB,IAAI,WAAW,OAAO,KAAM,WAAW,MAAM;CAC7C,WAAW,IAAI,KAAK,EAAE;CACtB,OAAO;AACT;;AAGA,MAAM,cAAc,MAAmB,MAAsB;CAC3D,MAAM,IAAI,OAAO,gBAAgB,KAAK,EAAE;CACxC,OAAO,OAAO,OAAO,CAAC,IAAI,UAAU,EAAE,KAAK,CAAC,CAAC,QAAQ;AACvD;AAEA,MAAM,kBAAkB,MAAiB;CACvC,MAAM,MAAM,WAAW,CAAC;CACxB,MAAM,IAAI,IAAI,SAAS;CACvB,IACE,EACE,MAAM,+CACN,MAAM,2CACN,MAAM,2CACN,MAAM,qDAER,CAACS,eAAmB,GAAG,IAAI,KAAK,GAEhC,OAAOT,KAAO,0BAA0B;CAE1C,MAAM,IACJ,yFAAyF,KACvF,IAAI,KACN;CACF,IAAI,MAAM,MAAM,OAAOA,KAAO,mBAAmB;CACjD,OAAO;EACL,MAAM,EAAE;EACR,OAAO,EAAE;EACT,KAAK,EAAE;EACP,OAAO,EAAE;EACT,SAAS,EAAE;EACX,SAAS,EAAE;EACX,IAAI,EAAE;CACR;AACF;AAEA,MAAM,oBAAoB,OAAuB;CAC/C,IAAI,OAAO,KAAK,OAAO;CACvB,MAAM,OAAO,GAAG,WAAW,GAAG,IAAI,MAAM;CACxC,MAAM,IAAI,OAAO,GAAG,MAAM,GAAG,CAAC,CAAC;CAC/B,MAAM,KAAK,OAAO,GAAG,MAAM,GAAG,CAAC,CAAC;CAChC,IAAI,MAAM,KAAK,OAAO,GAAG,OAAO;CAChC,OAAO,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,EAAE,KAAK,KAAK,KAAK,IAAI,GAAG,GAAG,KAAK;AAChE;AAEA,MAAM,gBAAgB,MACpB,mBAAmB,CAAC,CAAC,CAAC,QACpB,aACC,MAAM,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,GACtD;AAEF,MAAM,QAAQ,WAAiC;CAM7C,MAAM,IAJQ,MAAM,KAAK,EAAE,QAAQ,GAAG,IAAI,GAAG,MAAM;EACjD,MAAM,IAAI,KAAK,MAAM,OAAO,IAAI,GAAG;EACnC,OAAO,MAAM,IAAK,IAAI,KAAQ,KAAO,MAAM,IAAK,IAAI,KAAQ,MAAO;CACrE,CACc,CAAC,CAAC,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;CACnE,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,IAAI,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE;AAC/F;AAEA,MAAM,WAAW;;AAiCjB,MAAM,qBAAqB,CAAC,GAAG,OAA2D;CACxF,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,UAAU,CAAC;CACrB,OAAO,WAAW,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAIA,KAAO,wBAAwB;AACpE;;;;;AAMA,MAAM,UACJ,MACA,SACiB;CACjB,MAAM,CAAC,GAAG,KAAK,kBAAkB,IAAI;CACrC,MAAM,IAAI,EAAE,MAAM,QAAQ,EAAE,KAAK;CACjC,OAAO,MAAM,KAAKU,OAAS,EAAE,IAAIC,WAAa,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC;AAC5E;AAEA,MAAM,SAAkB,CAAC,IAAI,QAAQ;CACnC,IAAIC,YAAiB,CAAC,GAAG,OAAO;CAChC,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC;CACvB,OAAOC,UAAe,IAAI,YAAY,KAAA,IAAYC,QAAY,GAAG,IAAI,OAAO,IAAI,CAAC;AACnF;AAEA,MAAM,UACH,OACA,CAAC,OACAJ,OAAS,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC;;;;;;;;;AAUlC,MAAa,WAAsD;CACjE,MAAM,CAAC,OACLE,YAAiB,CAAC,KAAKV,UAAe,CAAC,IACnCQ,OAAS,EAAE,KAAK,IAChBV,KAAO,oCAAoC;CACjD,OAAO,CAAC,OAAOU,OAAS,WAAW,CAAC,CAAC,CAAC,QAAQ;CAC9C,UAAU,CAAC,OAAOA,OAAS,WAAW,CAAC,CAAC,CAAC,aAAa,EAAE;CACxD,cAAc,CAAC,KAAK,WAAW;EAC7B,MAAM,IAAI,UAAU,GAAG,CAAC,CAAC,MAAM,YAAY;EAC3C,MAAM,IAAI,UAAU,KAAK,CAAC,CAAC,MAAM,YAAY;EAC7C,IAAI,MAAM,KAAK,OAAOK,KAAO,MAAM,EAAE;EACrC,OAAOA,KAAO,MAAM,KAAK,EAAE,WAAW,GAAG,EAAE,EAAE,CAAC;CAChD;CACA,WAAW,CAAC,OAAO,WAAW,CAAC,CAAC,CAAC;CACjC,KAAK;CACL,KAAK;CACL,QAAQ,MAAM,KAAK,QACjB,IAAI,UAAU,IAAI,qBAAqB,IAAI,IAAI,KAAA,IAAY,UAAU,KAAK,EAAE,CAAC,CAAC,OAAO,GAAG;CAC1F,OAAO,GAAG,QAAQR,WAAa;EAAE,MAAM;EAAG,GAAG,IAAI,OAAO;CAAE,CAAC;CAC3D,MAAM,CAAC,OAAO;EACZ,MAAM,IAAI,OAAO,CAAC;EAClB,OAAOA,WACL,EAAE,SAAS,IACP;GAAE,MAAM;GAAG,GAAG,EAAE,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE;EAAE,IACpC,EAAE,SAAS,IACT;GAAE,MAAM;GAAG,GAAG,WAAW,IAAI,EAAE,CAAC;EAAE,IAClC,EAAE,SAAS,IACT;GAAE,MAAM;GAAG,GAAG,KAAK,IAAI,EAAE,CAAC;EAAE,IAC5B;GAAE,MAAM;GAAG,GAAG,KAAK,IAAI,EAAE,CAAC;EAAE,CACtC;CACF;CACA,OAAO,CAAC,OAAO,SAAS,GAAG,QAAQ,KAAK,IAAI;CAC5C,QAAQ,CAAC,OAAO,SAAS,GAAG,SAAS,KAAK,KAAK;CAC/C,QAAQ,CAAC,OAAO,SAAS,GAAG,aAAa,UAAU;CACnD,SAAS,SAAS;EAChB,MAAM,OAAO,KAAK,IAAI,SAAS;EAC/B,MAAM,QAAQ,KAAK;EACnB,MAAM,WACJ,UAAU,KAAA,KACV,MAAM,aAAa,MACnB,KAAK,OAAO,MAAM,EAAE,aAAa,MAAM,YAAY,EAAE,cAAc,MAAM,SAAS;EACpF,MAAM,QAAQ,KAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE;EAC9C,OAAO,WAAWI,WAAa,OAAO,KAAK,IAAID,OAAS,KAAK;CAC/D;CACA,SAAS,CAAC,GAAG,OAAO,SAAS;EAC3B,MAAM,MAAM,UAAU,CAAC;EACvB,MAAM,QAAQ,WAAW,IAAI,KAAK;EAClC,MAAM,KAAKM,SAAW,OAAO,KAAK,CAAC;EACnC,MAAM,OAAO,WAAW,EAAE;EAC1B,IAAI,KAAK;EACT,IAAI,QAAQ,KAAA,GAAW,KAAK,OAAO,WAAWA,SAAW,OAAO,GAAG,CAAC,CAAC;EACrE,IAAI,OAAO,MAAM,IAAI,KAAK,OAAO,MAAM,EAAE,GAAG,OAAOL,WAAa,IAAI,GAAG;EACvE,MAAM,MAAM,MAAM,QAAQ,GAAG,MAAM,IAAI,KAAK,QAAQ,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE;EACvE,OAAOA,WAAa,KAAK,GAAG;CAC9B;CACA,SAAS,CAAC,OAAO,WAAW,WAAW,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM;CACjE,UAAU,SAAS;EACjB,MAAM,CAAC,GAAG,SAAS,eAAe;EAClC,MAAM,MAAM,UAAU,CAAC;EACvB,MAAM,KAAK,aAAa,UAAU,OAAO,CAAC,CAAC,OAAO,WAAW,MAAM,CAAC,GAAG,IAAI;EAC3E,IAAI,GAAG,KAAK,EAAE,GAAG;GACf,GAAG,YAAY;GACf,OAAOX,KAAO,0CAA0C;EAC1D;EACA,GAAG,YAAY;EACf,MAAM,OAAO,UAAU,WAAW,CAAC,CAAC,MAAM,QAAQ,kBAAkB,GAAG,QACrE,QAAQ,MAAM,OAAO,QAAQ,OAAO,OAAO,CAC7C;EACA,OAAOW,WAAa,IAAI,MAAM,QAAQ,IAAI,IAAI,GAAG,GAAG;CACtD;CACA,QAAQ,CAAC,OAAO;EACd,MAAM,IAAI,UAAU,CAAC;EACrB,OAAOA,WAAa,EAAE,MAAM,YAAY,GAAG,CAAC;CAC9C;CACA,QAAQ,CAAC,OAAO;EACd,MAAM,IAAI,UAAU,CAAC;EACrB,OAAOA,WAAa,EAAE,MAAM,YAAY,GAAG,CAAC;CAC9C;CACA,iBAAiB,CAAC,OAAOD,OAAS,aAAa,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC;CAClE,WAAW,SAAS;EAClB,MAAM,CAAC,GAAG,KAAK,kBAAkB,IAAI;EACrC,OAAOK,KAAO,EAAE,MAAM,SAAS,EAAE,KAAK,CAAC;CACzC;CACA,YAAY,SAAS;EACnB,MAAM,CAAC,GAAG,KAAK,kBAAkB,IAAI;EACrC,OAAOA,KAAO,EAAE,MAAM,WAAW,EAAE,KAAK,CAAC;CAC3C;CACA,UAAU,SAAS;EACjB,MAAM,CAAC,GAAG,KAAK,kBAAkB,IAAI;EACrC,OAAOA,KAAO,EAAE,MAAM,SAAS,EAAE,KAAK,CAAC;CACzC;CACA,YAAY,SAAS,OAAO,OAAO,GAAG,IAAI,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC;CAC7D,WAAW,SAAS,OAAO,OAAO,GAAG,GAAG,MAAM,EAAE,MAAM,IAAI,EAAE,MAAM,CAAC;CACnE,OAAO,CAAC,OAAO;EACb,MAAM,IAAI,eAAe,CAAC;EAC1B,OAAO,EAAE,SAAS,KAAA,IAAY,WAAW,OAAO,EAAE,IAAI,CAAC,IAAIf,KAAO,SAAS;CAC7E;CACA,QAAQ,CAAC,OAAO;EACd,MAAM,IAAI,eAAe,CAAC;EAC1B,OAAO,EAAE,UAAU,KAAA,IAAY,WAAW,OAAO,EAAE,KAAK,CAAC,IAAIA,KAAO,UAAU;CAChF;CACA,MAAM,CAAC,OAAO;EACZ,MAAM,IAAI,eAAe,CAAC;EAC1B,OAAO,EAAE,QAAQ,KAAA,IAAY,WAAW,OAAO,EAAE,GAAG,CAAC,IAAIA,KAAO,QAAQ;CAC1E;CACA,QAAQ,CAAC,OAAO;EACd,MAAM,IAAI,eAAe,CAAC;EAC1B,OAAO,EAAE,UAAU,KAAA,IAAY,WAAW,OAAO,EAAE,KAAK,CAAC,IAAIA,KAAO,UAAU;CAChF;CACA,UAAU,CAAC,OAAO;EAChB,MAAM,IAAI,eAAe,CAAC;EAC1B,OAAO,EAAE,YAAY,KAAA,IAAY,WAAW,OAAO,EAAE,OAAO,CAAC,IAAIA,KAAO,YAAY;CACtF;CACA,UAAU,CAAC,OAAO;EAChB,MAAM,IAAI,eAAe,CAAC;EAC1B,IAAI,EAAE,YAAY,KAAA,GAAW,OAAOA,KAAO,YAAY;EACvD,OAAOO,WAAa;GAAE,MAAM;GAAG,GAAG,WAAW,iBAAiB,EAAE,OAAO;EAAE,CAAC;CAC5E;CACA,WAAW,CAAC,OAAO;EACjB,MAAM,IAAI,eAAe,CAAC;EAC1B,IAAI,EAAE,OAAO,KAAA,GAAW,OAAOP,KAAO,aAAa;EACnD,OAAO,IAAIK,QAAa,iBAAiB,EAAE,EAAE,GAAA,GAAQ,eAAe;CACtE;CACA,KAAK,CAAC,OAAOK,OAAS,eAAe,CAAC,CAAC,CAAC,MAAM,EAAE;CAChD,MAAM,GAAG,QAAQ,IAAIL,QAAa,IAAI,IAAI,YAAY,GAAA,GAAQ,QAAQ;CACtE,OAAO,GAAG,QAAQQ,UAAe,YAAY,KAAK,IAAI,MAAM,GAAG;CAC/D,UAAU,GAAG,QAAQH,OAAS,KAAK,IAAI,MAAM,CAAC;CAC9C,KAAK,OAAOO,GAAQ;CACpB,MAAM,OAAOC,IAAS;CACtB,QAAQ,OAAOC,MAAW;CAC1B,QAAQ,OAAOC,MAAW;CAC1B,QAAQ,OAAOC,MAAW;CAC1B,UAAU,CAAC,GAAG,UAAU;EACtB,MAAM,MAAM,UAAU,CAAC,CAAC,CAAC;EACzB,MAAM,MAAM,UAAU,IAAI,CAAC,CAAC;EAC5B,IAAI,CAAC,SAAS,KAAK,GAAG,GAAG,OAAOrB,KAAO,sBAAsB;EAC7D,OAAOsB,QAAa,KAAK,GAAG;CAC9B;CACA,aAAa,CAAC,GAAG,MAAM,SAAS;EAC9B,MAAM,MAAM,UAAU,CAAC,CAAC,CAAC;EACzB,MAAM,MAAM,UAAU,IAAI,CAAC,CAAC;EAC5B,MAAM,IAAI,UAAU,GAAG,CAAC,CAAC;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG,GAAG,OAAOtB,KAAO,sBAAsB;EAC7D,IAAI,MAAM,SAAS,MAAM,OAAO,OAAOA,KAAO,wBAAwB;EACtE,OAAOsB,QAAa,KAAK;GAAE,UAAU;GAAK,WAAW;EAAE,CAAC;CAC1D;CACA,QAAQ,CAAC,GAAG,cAAc;EACxB,MAAM,MAAM,UAAU,CAAC,CAAC,CAAC;EACzB,IAAI,CAACV,YAAiB,QAAQ,GAAG,OAAOZ,KAAO,uBAAuB;EACtE,IAAI,SAAS,UAAA,GAAe,WAAW,SAAS,SAAS,UAAA,GAAe,cAAc,OACpF,OAAOA,KAAO,6CAA6C;EAE7D,OAAO,IAAIK,QAAa,KAAK,QAAQ;CACvC;CACA,WAAW,CAAC,GAAG,OAAOU,KAAO,EAAE,QAAQ,EAAE,GAAG;CAC5C,QAAQ,CAAC,OAAOA,KAAOH,YAAiB,CAAC,CAAC;CAC1C,QAAQ,CAAC,OAAOG,KAAOH,YAAiB,CAAC,CAAC;CAC1C,UAAU,CAAC,OAAOG,KAAOQ,YAAiB,CAAC,CAAC;CAC5C,YAAY,CAAC,OAAOR,KAAOb,UAAe,CAAC,CAAC;CAC5C,YAAY,CAAC,OAAOa,KAAOS,UAAY,CAAC,CAAC;CACzC,UAAU,CAAC,OAAOT,KAAOb,UAAe,CAAC,KAAK,EAAE,aAAa,EAAE;CAC/D,aAAa,CAAC,OAAOa,KAAOb,UAAe,CAAC,KAAK,EAAE,cAAc,KAAA,CAAS;CAC1E,QAAQ,SAAS;EACf,MAAM,CAAC,GAAG,WAAW;EACrB,MAAM,MAAM,UAAU,CAAC;EACvB,MAAM,KAAK,aAAa,UAAU,OAAO,CAAC,CAAC,OAAO,WAAW,MAAM,CAAC,CAAC;EACrE,OAAOa,KAAO,GAAG,KAAK,IAAI,KAAK,CAAC;CAClC;CACA,WAAW,CAAC,OAAOA,KAAOU,SAAc,CAAC,CAAC;CAC1C,SAAS,CAAC,GAAG,GAAG,OAAO;EACrB,IAAI,CAACb,YAAiB,CAAC,KAAK,CAACW,YAAiB,CAAC,GAC7C,OAAOvB,KAAO,6CAA6C;EAE7D,IAAI,CAACY,YAAiB,CAAC,GAAG,OAAOZ,KAAO,iCAAiC;EACzE,OAAO0B,OAAY,GAAG,GAAG,CAAC;CAC5B;CACA,UAAU,CAAC,OAAQD,SAAc,CAAC,IAAI,EAAE,UAAUzB,KAAO,mBAAmB;CAC5E,YAAY,CAAC,OAAQyB,SAAc,CAAC,IAAI,EAAE,YAAYzB,KAAO,mBAAmB;CAChF,SAAS,CAAC,OAAQyB,SAAc,CAAC,IAAI,EAAE,SAASzB,KAAO,mBAAmB;AAC5E;AAMA,MAAM,yBAAgD;CACpD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,MAAM2B,MAAQ,CAAC;AACtB,MAAM,oBAAoBC,MAAgB,sBAAsB;;AAGhE,MAAM,qBAAqB,MAAsB;CAC/C,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO;CAC5B,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,IAAI,IAAI,QAAQ;CAChD,MAAM,MAAM,KAAK,IAAI,CAAC;CACtB,IAAI,QAAQ,GAAG,OAAO,OAAO,GAAG,GAAG,EAAE,IAAI,OAAO;CAChD,IAAI,OAAO,QAAQ,MAAM,KAAK,OAAO,OAAO,CAAC;CAC7C,OAAOC,gBAAoB,CAAC;AAC9B;AAEA,MAAM,cAAc,MAAyB;CAC3C,IAAIjB,YAAiB,CAAC,GAAG,OAAO,EAAE;CAClC,MAAM,IAAI,WAAW,CAAC;CACtB,MAAMkB,YAAUC,QAAU,CAAC;CAC3B,IAAI,OAAO,OAAOD,SAAO,GAAG;EAC1B,MAAM,IAAIA,UAAQ;EAClB,IAAI,EAAE,SAAS,GAAG,OAAO,EAAE,EAAE,SAAS;EACtC,IAAI,EAAE,SAAS,GAAG;GAChB,MAAM,IAAIE,iBAAqB,EAAE,CAAC;GAClC,OAAO,EAAE,SAAS,IAAI,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI;EAC7C;EACA,OAAO,kBAAkB,EAAE,CAAC;CAC9B;CACA,IAAI,EAAE,SAAS,UAAA,GAAe,QAAQ,SAASvB,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK,GACzF,OAAO,EAAE,UAAU,UAAU,EAAE,UAAU,MAAM,SAAS;CAE1D,OAAO,EAAE;AACX;AAgBA,MAAM,eAAe,EAAE,GAAG,SAAS,QAAQ,WAAW,YAAY,cAA0B;CAC1F,IAAI,QAAQ,OAAOM,KAAO,SAAS;CACnC,IAAI,OAAO,OAAO,OAAO,GAAG,OAAOA,KAAOkB,IAAM,CAAC,CAAC;CAClD,IAAI,cAAc,qBAAqB,KAAK,OAAO,GACjD,OAAOlB,KAAO,YAAY,UAAU,YAAY,GAAG;CAErD,OAAOf,KAAO,sBAAsB;AACtC;AAEA,MAAM,aAAa,MAAqB;CACtC,IAAI,EAAE,SAAS,GAAG,OAAO,EAAE;CAC3B,IAAI,EAAE,SAAS,GAAG,OAAO,OAAO,WAAW,OAAO,WAAW,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG;CAChG,IAAI,CAAC,OAAO,SAAS,EAAE,CAAC,GAAG,OAAOA,KAAO,gCAAgC;CACzE,OAAO,OAAO,KAAK,MAAM,EAAE,CAAC,CAAC;AAC/B;AAEA,MAAM,eAAe,WAAqC;CACxD,MAAM,EAAE,QAAQ,QAAQ,SAAS,QAAQ,WAAW,YAAY,YAAY;CAC5E,MAAM,QAAgB,SAClB,YACE,KACA,KACF,OAAO,OAAO,OAAO,IACnB,UAAU,QAAQ,KAAK,IACvB,cAAc,aAAa,KAAK,OAAO,IACrC,OAAO,OAAO,IACdA,KAAO,sBAAsB;CACrC,MAAM,MAAM,IAAIK,QAAa,MAAM,SAAS,GAAG,MAAM;CACrD,OAAOI,eAAmB,QAAQ,IAAI,KAAK,IAAI,MAAMT,KAAO,sBAAsB;AACpF;AAEA,MAAM,eAAe,EAAE,SAAS,QAAQ,WAAW,YAAY,cAA0B;CACvF,IAAI,QAAQ,OAAOO,WAAa;EAAE,MAAM;EAAG,GAAG,WAAW,WAAW,YAAY,KAAK,EAAE;CAAE,CAAC;CAC1F,IAAI,OAAO,OAAO,OAAO,GAAG;EAC1B,MAAM,IAAI,QAAQ;EAClB,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG,OAAOA,WAAa;GAAE,MAAM;GAAG,GAAG2B,UAAY,CAAC;EAAE,CAAC;EACpF,IAAI,CAAC,OAAO,SAAS,EAAE,CAAC,GAAG,OAAOlC,KAAO,gCAAgC;EACzE,OAAOO,WAAa;GAAE,MAAM;GAAG,GAAG,WAAW,iBAAiB,EAAE,CAAC;EAAE,CAAC;CACtE;CACA,IAAI,cAAc,6BAA6B,KAAK,OAAO,GACzD,OAAOA,WAAa;EAAE,MAAM;EAAG,GAAG,WAAW,iBAAiB,QAAQ,QAAQ,OAAO,EAAE,CAAC;CAAE,CAAC;CAE7F,OAAOP,KAAO,sBAAsB;AACtC;AAEA,MAAM,cAAc,YAClB,YAAY,SAAS,YAAY,SAC7B,WACA,YAAY,SACV,YACA,OAAO,OAAO;AAEtB,MAAM,gBAAgB,WAAqC;CACzD,MAAM,EAAE,QAAQ,SAAS,QAAQ,WAAW,YAAY,YAAY;CACpE,MAAM,OAAO,WAAA,GAAgB,OAAO,QAAQ,IAAI;CAChD,MAAM,QAAQ,SACV,YACE,IACA,IACF,OAAO,OAAO,OAAO,IACnBgB,SAAW,QAAQ,KAAK,IACxB,cAAcP,eAAmB,QAAQ,OAAO,IAC9C,WAAW,OAAO,IAClBT,KAAO,6BAA6B;CAC5C,OAAOO,WAAa;EAAE;EAAM,GAAG,SAAS,IAAI,KAAK,OAAO,KAAK,IAAI;CAAM,CAAC;AAC1E;AAEA,MAAM,gBAAgB,EAAE,QAAQ,QAAQ,GAAG,YAAY,cAAwC;CAC7F,IAAI,EAAE,SAAS,UAAU,UAAUE,eAAmB,QAAQ,EAAE,KAAK,GAAG,OAAO;CAC/E,IAAI,EAAE,SAAS,UAAU,2CAAkBA,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK,GAAG;EAExF,MAAM,IAAI,0BAA0B,KAAK,EAAE,KAAK;EAChD,IAAI,MAAM,MAAM,OAAOT,KAAO,cAAc;EAC5C,OAAO,IAAIK,QAAa,GAAG,EAAE,GAAG,WAAW,EAAE,MAAM,MAAM;CAC3D;CACA,IAAI,cAAcI,eAAmB,QAAQ,OAAO,GAAG,OAAO,IAAIJ,QAAa,SAAS,MAAM;CAC9F,OAAOL,KAAO,uBAAuB;AACvC;;AAGA,MAAM,aAAa,EAAE,QAAQ,QAAQ,GAAG,YAAY,cAAwC;CAC1F,IAAI,EAAE,SAAS,UAAU,QAAQ,OAAO;CACxC,IAAI,cAAcS,eAAmB,QAAQ,OAAO,GAAG,OAAO,IAAIJ,QAAa,SAAS,MAAM;CAC9F,OAAOL,KAAO,mBAAmB,QAAQ;AAC3C;AAEA,MAAM,UAAU,QAAgB,MAA+B;CAC7D,IAAI,WAAW,2CAAiB;EAC9B,IAAIE,UAAe,CAAC,KAAK,EAAE,aAAa,IACtC,OAAOF,KAAO,sCAAsC;EACtD,OAAOU,OAAS,WAAW,CAAC,CAAC;CAC/B;CACA,MAAM,IAAI,WAAW,CAAC;CACtB,IAAI,EAAE,aAAa,IAAI,OAAOV,KAAO,sCAAsC;CAC3E,MAAM,SACJ,EAAE,SAAS,UAAA,GAAe,QAAQ,SAASS,eAAmB,EAAE,SAAS,OAAO,EAAE,KAAK;CACzF,MAAM,SAAqB;EACzB;EACA,QAAQI,UAAe,MAAM;EAC7B;EACA,SAASkB,QAAU,CAAC;EACpB;EACA,WAAW,WAAW,EAAE,UAAU,UAAU,EAAE,UAAU;EACxD,YAAY3B,eAAiB,CAAC;EAC9B,SAAS,EAAE,MAAM,KAAK;CACxB;CACA,IAAI,WAAA,GAAgB,QAAQ,OAAO,OAAO,YAAY,MAAM;CAC5D,IAAI,kBAAkB,IAAI,MAAM,GAAG,OAAO,YAAY,MAAM;CAC5D,IAAI,WAAA,GAAgB,QAAQ,OAAO,OAAO,YAAY,MAAM;CAC5D,IAAI,WAAA,GAAgB,OAAO,SAAS,WAAA,GAAgB,MAAM,OAAO,OAAO,aAAa,MAAM;CAC3F,IAAI,WAAA,GAAgB,SAAS,OAAO,OAAO,aAAa,MAAM;CAC9D,OAAO,UAAU,MAAM;AACzB;AAEA,MAAM,WAAsCwB,MAAgB;CAC1DO;CACA,GAAGR,IAAM;CACT,GAAGA,IAAM;CACT,GAAGA,IAAM;CACT,GAAGA,IAAM;CACT,GAAGA,IAAM;CACT,GAAGA,IAAM;CACT,GAAGA,IAAM;CACT,GAAG;AACL,CAAC;;;;;;;;AASD,MAAa,UAAU,QAAyB,SAAS,IAAI,GAAG;;;;;;;;AAShE,MAAa,QAAQ,UAAkB,SAAwC;CAC7E,IAAIJ,YAAiB,IAAI,KAAKE,SAAc,IAAI,GAAG,OAAOzB,KAAO,aAAa;CAC9E,IAAIY,YAAiB,IAAI,KAAK,aAAa,2CAAiB,OAAOZ,KAAO,oBAAoB;CAC9F,OAAO,OAAO,UAAU,IAAI;AAC9B"}

package/dist/Functions-OQJZP-F6.d.mts

@@ -0,0 +1,111 @@
+import { l as Literal, s as GroundTerm, t as BlankNode } from "./Term-B_4ezyXq.mjs";
+import { s as BuiltInName } from "./Ast-vcw2W-lf.mjs";
+import { t as Bindings } from "./Bindings-DiKpBd7f.mjs";
+import * as Schema from "effect/Schema";
+declare namespace Functions_d_exports {
+  export { BuiltIn, BuiltInArgs, ExpressionError, ExtensionFunction, FunctionContext, Registry, builtIns, cast, compileRegex, error, isCast, registry };
+}
+declare const ExpressionError_base: Schema.Class<ExpressionError, Schema.TaggedStruct<"ExpressionError", {
+  readonly message: Schema.String;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * An expression evaluation error (a SPARQL "type error"): unbound
+ * variables, wrong argument types, division by zero, …
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class ExpressionError extends ExpressionError_base {}
+/**
+ * Signals an expression error from inside a function implementation.
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare const error: (message: string) => never;
+/**
+ * The per-query context of expression evaluation.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface FunctionContext {
+  /** The value of `NOW()`: constant for the whole query. */
+  readonly now: Date;
+  /** The base IRI used by `IRI()` / `URI()`. */
+  readonly baseIri?: string | undefined;
+  /** A random number generator in [0, 1). */
+  readonly random: () => number;
+  /** Returns the blank node for `BNODE(label)` within the current solution. */
+  readonly blankNode: (label: string | undefined, solution: Bindings) => BlankNode;
+}
+/**
+ * An extension function: receives the evaluated arguments.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type ExtensionFunction = (args: ReadonlyArray<GroundTerm>, context: FunctionContext) => GroundTerm;
+/**
+ * A registry of extension functions keyed by IRI.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type Registry = ReadonlyMap<string, ExtensionFunction>;
+/**
+ * Creates a registry from a record of IRI → function.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const registry: (functions: Readonly<Record<string, ExtensionFunction>>) => Registry;
+/** Compiles an XPath regular expression with XPath flags to a JS RegExp. */
+declare const compileRegex: (pattern: string, flags: string, global?: boolean) => RegExp;
+/**
+ * The evaluated arguments of a built-in function. Positions beyond the
+ * function's arity are `undefined` at runtime; the type assumes the
+ * required positions are present (checked by the parser).
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type BuiltInArgs = ReadonlyArray<GroundTerm> & {
+  readonly 0: GroundTerm;
+  readonly 1: GroundTerm;
+  readonly 2: GroundTerm;
+};
+/**
+ * Implementation of a strict built-in function.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type BuiltIn = (args: BuiltInArgs, context: FunctionContext, solution: Bindings) => GroundTerm;
+/**
+ * The strict built-in functions, keyed by canonical name. Functional forms
+ * (`BOUND`, `IF`, `COALESCE`, `&&`, `||`, `IN`, `EXISTS`) are handled by the
+ * expression evaluator.
+ *
+ * @since 0.1.0
+ * @category built-ins
+ */
+declare const builtIns: Partial<Record<BuiltInName, BuiltIn>>;
+/**
+ * Whether an IRI is an XSD constructor function (cast) supported by this
+ * implementation.
+ *
+ * @since 0.1.0
+ * @category casts
+ */
+declare const isCast: (iri: string) => boolean;
+/**
+ * Casts a term to an XSD datatype (`xsd:integer(?x)` etc.). Throws an
+ * expression error when the cast is not possible.
+ *
+ * @since 0.1.0
+ * @category casts
+ */
+declare const cast: (datatype: string, term: GroundTerm) => Literal;
+export { FunctionContext as a, builtIns as c, error as d, isCast as f, ExtensionFunction as i, cast as l, BuiltInArgs as n, Functions_d_exports as o, registry as p, ExpressionError as r, Registry as s, BuiltIn as t, compileRegex as u };
+//# sourceMappingURL=Functions-OQJZP-F6.d.mts.map

package/dist/Generator-C52mmq01.d.mts

@@ -0,0 +1,50 @@
+import { T as Term } from "./Term-B_4ezyXq.mjs";
+import { U as Pattern, _ as Expression, nt as Update, q as Query } from "./Ast-vcw2W-lf.mjs";
+declare namespace Generator_d_exports {
+  export { GenerateOptions, print, printExpression, printPattern, printTerm };
+}
+/**
+ * @since 0.1.0
+ * @category models
+ */
+interface GenerateOptions {
+  /**
+   * Prefixes used to compact IRIs. Defaults to the prologue of the query or
+   * update. Pass an empty object to always print full IRIs.
+   */
+  readonly prefixes?: Readonly<Record<string, string>> | undefined;
+  /** Whether to print the prologue (`BASE` / `PREFIX`). Defaults to `true`. */
+  readonly prologue?: boolean | undefined;
+  /** Indentation unit. Defaults to two spaces. */
+  readonly indent?: string | undefined;
+}
+/**
+ * Generates SPARQL text for a query or update.
+ *
+ * @since 0.1.0
+ * @category printing
+ */
+declare const print: (ast: Query | Update, options?: GenerateOptions) => string;
+/**
+ * Generates SPARQL text for an expression.
+ *
+ * @since 0.1.0
+ * @category printing
+ */
+declare const printExpression: (expression: Expression, prefixes?: Readonly<Record<string, string>>) => string;
+/**
+ * Generates SPARQL text for a graph pattern.
+ *
+ * @since 0.1.0
+ * @category printing
+ */
+declare const printPattern: (pattern: Pattern, prefixes?: Readonly<Record<string, string>>) => string;
+/**
+ * Generates SPARQL syntax for a term (IRIs are compacted with `prefixes`).
+ *
+ * @since 0.1.0
+ * @category printing
+ */
+declare const printTerm: (term: Term, prefixes?: Readonly<Record<string, string>>) => string;
+export { printPattern as a, printExpression as i, Generator_d_exports as n, printTerm as o, print as r, GenerateOptions as t };
+//# sourceMappingURL=Generator-C52mmq01.d.mts.map

package/dist/Generator-D3utCJC7.mjs

@@ -0,0 +1,205 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { A as escapeString, B as isNamedNode, P as isDefaultGraph, k as escapeIri, q as isVariable } from "./Term-CFLG1qu4.mjs";
+import { r as compact, s as make } from "./PrefixMap-BHFPDLO-.mjs";
+import * as Arr from "effect/Array";
+import * as Option from "effect/Option";
+import * as Predicate from "effect/Predicate";
+import * as Match from "effect/Match";
+import * as Record from "effect/Record";
+// src/sparql/Generator.ts
+/**
+* Generates SPARQL text from the AST.
+*
+* The output is designed to round-trip: parsing the generated text yields
+* an AST that generates the same text again. Expressions and property paths
+* are fully parenthesised, IRIs are compacted with the prologue's prefixes
+* where possible, and numeric/boolean literals use the short syntax when
+* their lexical form allows it.
+*
+* @since 0.1.0
+*/
+var Generator_exports = /* @__PURE__ */ __exportAll({
+	print: () => print,
+	printExpression: () => printExpression,
+	printPattern: () => printPattern,
+	printTerm: () => printTerm
+});
+const XSD = "http://www.w3.org/2001/XMLSchema#";
+const RDF_TYPE = "http://www.w3.org/1999/02/22-rdf-syntax-ns#type";
+var Printer = class {
+	prefixMap;
+	unit;
+	constructor(prefixes, indent) {
+		this.prefixMap = make(prefixes);
+		this.unit = indent;
+	}
+	iri(node) {
+		const c = compact(this.prefixMap, node);
+		if (Option.isSome(c)) {
+			const [prefix, local] = c.value;
+			return `${prefix}:${local}`;
+		}
+		return `<${escapeIri(node.value)}>`;
+	}
+	literal(lit) {
+		const dt = lit.datatype.value;
+		const v = lit.value;
+		if (lit.language === "") {
+			if (dt === `${XSD}integer` && /^[+-]?[0-9]+$/.test(v)) return v;
+			if (dt === `${XSD}decimal` && /^[+-]?[0-9]*\.[0-9]+$/.test(v)) return v;
+			if (dt === `${XSD}double` && /^[+-]?(?:[0-9]+(?:\.[0-9]*)?|\.[0-9]+)[eE][+-]?[0-9]+$/.test(v)) return v;
+			if (dt === `${XSD}boolean` && (v === "true" || v === "false")) return v;
+		}
+		const lexical = `"${escapeString(v)}"`;
+		if (lit.language !== "") return lit.direction === void 0 ? `${lexical}@${lit.language}` : `${lexical}@${lit.language}--${lit.direction}`;
+		if (dt === "http://www.w3.org/2001/XMLSchema#string") return lexical;
+		return `${lexical}^^${this.iri(lit.datatype)}`;
+	}
+	term(t) {
+		return Match.value(t).pipe(Match.tag("NamedNode", (n) => this.iri(n)), Match.tag("BlankNode", (b) => `_:${b.value}`), Match.tag("Literal", (l) => this.literal(l)), Match.tag("Variable", (v) => `?${v.value}`), Match.tag("DefaultGraph", () => "DEFAULT"), Match.tag("Triple", (x) => `<<( ${this.term(x.subject)} ${this.verb(x.predicate)} ${this.term(x.object)} )>>`), Match.exhaustive);
+	}
+	verb(t) {
+		return isNamedNode(t) && t.value === RDF_TYPE ? "a" : this.term(t);
+	}
+	path(p) {
+		return Match.value(p).pipe(Match.tag("PathLink", (l) => this.verb(l.iri)), Match.tag("PathInverse", (i) => `^(${this.path(i.path)})`), Match.tag("PathSequence", (s) => `(${s.paths.map((x) => this.path(x)).join(" / ")})`), Match.tag("PathAlternative", (a) => `(${a.paths.map((x) => this.path(x)).join(" | ")})`), Match.tag("PathZeroOrMore", (z) => `(${this.path(z.path)})*`), Match.tag("PathOneOrMore", (o) => `(${this.path(o.path)})+`), Match.tag("PathZeroOrOne", (z) => `(${this.path(z.path)})?`), Match.tag("PathNegated", (n) => {
+			return `!(${[...n.iris.map((i) => this.verb(i)), ...n.inverse.map((i) => `^${this.verb(i)}`)].join(" | ")})`;
+		}), Match.exhaustive);
+	}
+	expression(e) {
+		return Match.value(e).pipe(Match.tag("Variable", "NamedNode", "Literal", "BlankNode", "Triple", (t) => this.term(t)), Match.tag("FunctionCall", (c) => `${this.iri(c.function)}(${c.distinct ? "DISTINCT " : ""}${c.args.map((a) => this.expression(a)).join(", ")})`), Match.tag("Aggregate", (a) => {
+			const arg = a.expression === "*" ? "*" : this.expression(a.expression);
+			const sep = a.separator !== void 0 ? `; SEPARATOR = "${escapeString(a.separator)}"` : "";
+			return `${a.name}(${a.distinct ? "DISTINCT " : ""}${arg}${sep})`;
+		}), Match.tag("Exists", (x) => `${x.negated ? "NOT EXISTS" : "EXISTS"} ${this.group(x.pattern, 1)}`), Match.tag("Operation", (o) => this.operation(o)), Match.exhaustive);
+	}
+	operation(e) {
+		const args = e.args.map((a) => this.expression(a));
+		return Match.value(e.operator).pipe(Match.when(Match.is("||", "&&", "=", "!=", "<", ">", "<=", ">=", "+", "-", "*", "/"), (operator) => `(${args.join(` ${operator} `)})`), Match.when("!", () => `!(${args[0]})`), Match.when("UPLUS", () => `+(${args[0]})`), Match.when("UMINUS", () => `-(${args[0]})`), Match.when(Match.is("IN", "NOT IN"), (operator) => `(${args[0]} ${operator} (${args.slice(1).join(", ")}))`), Match.when("SAMETERM", () => `sameTerm(${args.join(", ")})`), Match.orElse((operator) => `${operator}(${args.join(", ")})`));
+	}
+	pad(level) {
+		return this.unit.repeat(level);
+	}
+	triple(t) {
+		const p = Predicate.isTagged(t, "PathPattern") ? this.path(t.path) : this.verb(t.predicate);
+		return `${this.term(t.subject)} ${p} ${this.term(t.object)} .`;
+	}
+	group(g, level) {
+		const [only, ...rest] = g.patterns;
+		if (only === void 0) return "{}";
+		if (Arr.isReadonlyArrayEmpty(rest) && Predicate.isTagged(only, "SubSelect")) return `{\n${this.pad(level + 1)}${this.select(only.query, level + 1)}\n${this.pad(level)}}`;
+		return `{\n${g.patterns.flatMap((p) => this.pattern(p, level + 1)).map((l) => this.pad(level + 1) + l).join("\n")}\n${this.pad(level)}}`;
+	}
+	pattern(p, level) {
+		return Match.value(p).pipe(Match.tag("Bgp", (b) => b.triples.map((t) => this.triple(t))), Match.tag("Group", (g) => [this.group(g, level)]), Match.tag("Optional", (o) => [`OPTIONAL ${this.group(o.pattern, level)}`]), Match.tag("Minus", (m) => [`MINUS ${this.group(m.pattern, level)}`]), Match.tag("Union", (u) => [u.patterns.map((x) => this.group(x, level)).join(" UNION ")]), Match.tag("Graph", (g) => [`GRAPH ${this.term(g.name)} ${this.group(g.pattern, level)}`]), Match.tag("Service", (s) => [`SERVICE ${s.silent ? "SILENT " : ""}${this.term(s.name)} ${this.group(s.pattern, level)}`]), Match.tag("Filter", (f) => [`FILTER(${this.expression(f.expression)})`]), Match.tag("Bind", (b) => [`BIND(${this.expression(b.expression)} AS ${this.term(b.variable)})`]), Match.tag("Values", (v) => [this.values(v)]), Match.tag("SubSelect", (s) => [`{\n${this.pad(level + 1)}${this.select(s.query, level + 1)}\n${this.pad(level)}}`]), Match.exhaustive);
+	}
+	values(v) {
+		return `VALUES (${v.variables.map((x) => this.term(x)).join(" ")}) { ${v.rows.map((r) => `(${r.map((t) => t === void 0 ? "UNDEF" : this.term(t)).join(" ")})`).join(" ")} }`;
+	}
+	/** A dataset clause (`FROM` / `USING`), if the query or update has one. */
+	dataset(clause, keyword) {
+		return Option.match(clause, {
+			onNone: () => "",
+			onSome: (d) => [...d.default.map((g) => `${keyword} ${this.iri(g)}\n`), ...d.named.map((g) => `${keyword} NAMED ${this.iri(g)}\n`)].join("")
+		});
+	}
+	modifiers(q) {
+		let out = "";
+		if (Arr.isReadonlyArrayNonEmpty(q.groupBy)) out += `\nGROUP BY ${q.groupBy.map((g) => g.variable !== void 0 ? `(${this.expression(g.expression)} AS ${this.term(g.variable)})` : g.expression._tag === "Variable" ? this.term(g.expression) : `(${this.expression(g.expression)})`).join(" ")}`;
+		if (Arr.isReadonlyArrayNonEmpty(q.having)) out += `\nHAVING ${q.having.map((h) => `(${this.expression(h)})`).join(" ")}`;
+		if (Arr.isReadonlyArrayNonEmpty(q.orderBy)) out += `\nORDER BY ${q.orderBy.map((o) => `${o.descending ? "DESC" : "ASC"}(${this.expression(o.expression)})`).join(" ")}`;
+		if (q.limit !== void 0) out += `\nLIMIT ${q.limit}`;
+		if (q.offset !== void 0) out += `\nOFFSET ${q.offset}`;
+		return out;
+	}
+	select(q, level) {
+		const projection = q.projection === "*" ? "*" : q.projection.map((p) => isVariable(p) ? this.term(p) : `(${this.expression(p.expression)} AS ${this.term(p.variable)})`).join(" ");
+		const head = `SELECT ${q.distinct ? "DISTINCT " : q.reduced ? "REDUCED " : ""}${projection}`;
+		const values = q.values !== void 0 ? `\n${this.values(q.values)}` : "";
+		return `${head}\n${this.dataset(Option.fromUndefinedOr(q.dataset), "FROM")}WHERE ${this.group(q.where, level)}${this.modifiers(q)}${values}`;
+	}
+	query(q) {
+		const values = q.values !== void 0 ? `\n${this.values(q.values)}` : "";
+		return Match.value(q).pipe(Match.tag("Select", (s) => this.select(s, 0)), Match.tag("Ask", (a) => `ASK\n${this.dataset(Option.fromUndefinedOr(a.dataset), "FROM")}WHERE ${this.group(a.where, 0)}${this.modifiers(a)}${values}`), Match.tag("Construct", (c) => {
+			const template = c.template.map((t) => `${this.unit}${this.triple(t)}`).join("\n");
+			return `CONSTRUCT {\n${template}${template === "" ? "" : "\n"}}\n${this.dataset(Option.fromUndefinedOr(c.dataset), "FROM")}WHERE ${this.group(c.where, 0)}${this.modifiers(c)}${values}`;
+		}), Match.tag("Describe", (d) => {
+			return `DESCRIBE ${d.terms === "*" ? "*" : d.terms.map((t) => this.term(t)).join(" ")}\n${this.dataset(Option.fromUndefinedOr(d.dataset), "FROM")}WHERE ${this.group(d.where, 0)}${this.modifiers(d)}${values}`;
+		}), Match.exhaustive);
+	}
+	quads(quads) {
+		const runs = [];
+		quads.forEach((q) => {
+			const last = runs[runs.length - 1];
+			if (last !== void 0 && last.graph.key === q.graph.key) last.quads.push(q);
+			else runs.push({
+				graph: q.graph,
+				quads: [q]
+			});
+		});
+		const lines = runs.flatMap(({ graph: g, quads: run }) => {
+			const triples = run.map((q) => `${this.term(q.subject)} ${this.verb(q.predicate)} ${this.term(q.object)} .`);
+			return isDefaultGraph(g) ? triples.map((t) => this.unit + t) : [`${this.unit}GRAPH ${this.term(g)} {`].concat(triples.map((t) => this.unit + this.unit + t), [`${this.unit}}`]);
+		});
+		return Arr.isReadonlyArrayEmpty(lines) ? "{}" : `{\n${lines.join("\n")}\n}`;
+	}
+	graphTarget(t) {
+		return isNamedNode(t) ? `GRAPH ${this.iri(t)}` : t._tag.toUpperCase();
+	}
+	graphOrDefault(g) {
+		return isDefaultGraph(g) ? "DEFAULT" : `GRAPH ${this.iri(g)}`;
+	}
+	operationText(op) {
+		return Match.value(op).pipe(Match.tag("InsertData", (o) => `INSERT DATA ${this.quads(o.quads)}`), Match.tag("DeleteData", (o) => `DELETE DATA ${this.quads(o.quads)}`), Match.tag("DeleteWhere", (o) => `DELETE WHERE ${this.quads(o.patterns)}`), Match.tag("Modify", (o) => {
+			let out = o.with !== void 0 ? `WITH ${this.iri(o.with)}\n` : "";
+			if (Arr.isReadonlyArrayNonEmpty(o.delete) || Arr.isReadonlyArrayEmpty(o.insert)) out += `DELETE ${this.quads(o.delete)}\n`;
+			if (Arr.isReadonlyArrayNonEmpty(o.insert)) out += `INSERT ${this.quads(o.insert)}\n`;
+			out += this.dataset(Option.fromUndefinedOr(o.using), "USING");
+			return `${out}WHERE ${this.group(o.where, 0)}`;
+		}), Match.tag("Load", (o) => `LOAD ${o.silent ? "SILENT " : ""}${this.iri(o.source)}${o.destination !== void 0 ? ` INTO GRAPH ${this.iri(o.destination)}` : ""}`), Match.tag("Clear", "Drop", (o) => `${o._tag.toUpperCase()} ${o.silent ? "SILENT " : ""}${this.graphTarget(o.target)}`), Match.tag("Create", (o) => `CREATE ${o.silent ? "SILENT " : ""}GRAPH ${this.iri(o.graph)}`), Match.tag("Add", "Move", "Copy", (o) => `${o._tag.toUpperCase()} ${o.silent ? "SILENT " : ""}${this.graphOrDefault(o.source)} TO ${this.graphOrDefault(o.destination)}`), Match.exhaustive);
+	}
+};
+const prologueText = (prologue) => [
+	prologue.version !== void 0 ? `VERSION "${escapeString(prologue.version)}"\n` : "",
+	prologue.base !== void 0 ? `BASE <${escapeIri(prologue.base)}>\n` : "",
+	...Record.toEntries(prologue.prefixes).map(([prefix, ns]) => `PREFIX ${prefix}: <${escapeIri(ns)}>\n`)
+].join("");
+/**
+* Generates SPARQL text for a query or update.
+*
+* @since 0.1.0
+* @category printing
+*/
+const print = (ast, options) => {
+	const printer = new Printer(options?.prefixes ?? ast.prologue.prefixes, options?.indent ?? "  ");
+	const prologue = options?.prologue === false ? "" : prologueText(options?.prefixes !== void 0 ? {
+		...ast.prologue,
+		prefixes: options.prefixes
+	} : ast.prologue);
+	if (Predicate.isTagged(ast, "Update")) return prologue + ast.operations.map((op) => printer.operationText(op)).join(" ;\n");
+	return prologue + printer.query(ast);
+};
+/**
+* Generates SPARQL text for an expression.
+*
+* @since 0.1.0
+* @category printing
+*/
+const printExpression = (expression, prefixes = {}) => new Printer(prefixes, "  ").expression(expression);
+/**
+* Generates SPARQL text for a graph pattern.
+*
+* @since 0.1.0
+* @category printing
+*/
+const printPattern = (pattern, prefixes = {}) => new Printer(prefixes, "  ").pattern(pattern, 0).join("\n");
+/**
+* Generates SPARQL syntax for a term (IRIs are compacted with `prefixes`).
+*
+* @since 0.1.0
+* @category printing
+*/
+const printTerm = (term, prefixes = {}) => new Printer(prefixes, "  ").term(term);
+export { printTerm as a, printPattern as i, print as n, printExpression as r, Generator_exports as t };
+
+//# sourceMappingURL=Generator-D3utCJC7.mjs.map