@thomasfosterau/effect-rdf 0.0.0-stage → 0.1.0

package/dist/Reasoner-Cw90zrjv.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Reasoner-Cw90zrjv.mjs","names":["Term.literal","Model.isGround","Guards.isLiteral","Xsd.isIntegerDatatype","Xsd.canonicalDouble","Model.isCollection","Xsd.isNumericDatatype","Guards.isNamedNode","Model.Collection","Model.isFormula","Model.emptyFormula","Guards.isBlankNode","noGoals","goalsOf","Model.Formula","Term.namedNode","Model.substitute","Term.literal","Model.isFormula","Guards.isBlankNode","Model.isCollection","Term.Variable","Model.Collection","Model.Statement","Guards.isNamedNode","Model.Formula","Guards.isVariable","Model.substitute","Model.isGround","Isomorphism.isomorphic","Builtins.builtinFor","Model.variables","Term.BlankNode"],"sources":["../src/n3/internal/builtins.ts","../src/n3/Reasoner.ts"],"sourcesContent":["/**\n * A small library of N3 builtins (`math:`, `string:`, `list:`, `log:`).\n *\n * A builtin receives its subject and object with the current bindings\n * applied and returns the extended bindings for each solution, or\n * `undefined` when it cannot be evaluated yet (an input is still unbound).\n *\n * @internal\n */\nimport * as Arr from 'effect/Array';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as Option from 'effect/Option';\nimport * as Record from 'effect/Record';\nimport * as Result from 'effect/Result';\nimport * as Term from '../../Term.ts';\nimport { xsd } from '../../Vocab.ts';\nimport * as Xsd from '../../Xsd.ts';\nimport * as Model from '../Model.ts';\nimport { list, log, math, string } from '../Vocab.ts';\nimport * as Guards from './guards.ts';\n\n/** @internal */\nexport type Bindings = ReadonlyMap<string, Model.N3Term>;\n\n/** @internal */\nexport interface Context {\n  readonly unify: (pattern: Model.N3Term, term: Model.N3Term, b: Bindings) => Array<Bindings>;\n  /** Solves `goals` against the statements of `scope`. */\n  readonly query: (\n    scope: Model.Formula,\n    goals: ReadonlyArray<Model.Statement>,\n    b: Bindings,\n    builtins: boolean,\n  ) => Array<Bindings>;\n  /** The formula of the document being reasoned over (the default scope). */\n  readonly document: () => Model.Formula;\n  /** The deductive closure of a formula (for `log:conclusion`). */\n  readonly conclusion: (formula: Model.Formula) => Model.Formula;\n}\n\n/**\n * The solutions of a builtin, or `None` when it cannot be evaluated yet (an\n * input is still unbound).\n *\n * @internal\n */\nexport type Answer = Option.Option<Array<Bindings>>;\n\n/** @internal */\nexport type Builtin = (\n  subject: Model.N3Term,\n  object: Model.N3Term,\n  b: Bindings,\n  ctx: Context,\n) => Answer;\n\nconst notReady: Answer = Option.none();\n\n/** The builtin's solutions. */\nconst solutions = (bs: Array<Bindings>): Answer => Option.some(bs);\n\n/** No solutions once `t` is ground, not ready while it is not. */\nconst noneOnceReady = (t: Model.N3Term): Answer => (ready(t) ? solutions([]) : notReady);\n\nconst TRUE = Term.literal('true', xsd.boolean);\n\n/** Whether a term contains no variables (blank nodes count as ground). */\nconst ground = (t: Model.N3Term): boolean => Model.isGround(t);\n\n// -----------------------------------------------------------------------------\n// Numbers\n// -----------------------------------------------------------------------------\n\ntype Num =\n  | { readonly kind: 'integer'; readonly value: bigint }\n  | { readonly kind: 'decimal' | 'double'; readonly value: number };\n\nconst NUMERIC = /^[+-]?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?$/;\n\nconst toNum = (t: Model.N3Term): Option.Option<Num> => {\n  if (!Guards.isLiteral(t)) return Option.none();\n  const v = t.value.trim();\n  const dt = t.datatype.value;\n  if ((dt === xsd.double.value || dt === xsd.float.value) && /^(?:[+-]?INF|NaN)$/.test(v)) {\n    return Option.some({\n      kind: 'double',\n      value: v === 'NaN' ? NaN : v.startsWith('-') ? -Infinity : Infinity,\n    });\n  }\n  if (!NUMERIC.test(v)) return Option.none();\n  if (Xsd.isIntegerDatatype(dt) || (dt === Term.XSD_STRING && /^[+-]?\\d+$/.test(v))) {\n    return Option.some({ kind: 'integer', value: BigInt(v) });\n  }\n  if (dt === xsd.double.value || dt === xsd.float.value || /[eE]/.test(v)) {\n    return Option.some({ kind: 'double', value: Number(v) });\n  }\n  if (dt === xsd.decimal.value || dt === Term.XSD_STRING) {\n    return Option.some({ kind: 'decimal', value: Number(v) });\n  }\n  return Option.none();\n};\n\nconst asNumber = (n: Num): number => (n.kind === 'integer' ? Number(n.value) : n.value);\n\n/** The literal of an arithmetic result. */\nconst fromNum = (n: Num): Term.Literal => {\n  if (n.kind === 'integer') return Term.literal(n.value.toString(), xsd.integer);\n  if (n.kind === 'double') return Term.literal(Xsd.canonicalDouble(n.value), xsd.double);\n  const s = String(Number(n.value.toPrecision(15)));\n  return Number.isFinite(n.value) && !/e/i.test(s)\n    ? Term.literal(s.includes('.') ? s : `${s}.0`, xsd.decimal)\n    : Term.literal(Xsd.canonicalDouble(n.value), xsd.double);\n};\n\nconst numEquals = (a: Num, b: Num): boolean => {\n  if (a.kind === 'integer' && b.kind === 'integer') return a.value === b.value;\n  const x = asNumber(a);\n  const y = asNumber(b);\n  if (x === y) return true;\n  if (!Number.isFinite(x) || !Number.isFinite(y)) return false;\n  return Math.abs(x - y) <= 1e-12 * Math.max(Math.abs(x), Math.abs(y));\n};\n\nconst resultKind = (ns: ReadonlyArray<Num>): Num['kind'] =>\n  ns.some((n) => n.kind === 'double')\n    ? 'double'\n    : ns.some((n) => n.kind === 'decimal')\n      ? 'decimal'\n      : 'integer';\n\nconst numbersOf = (t: Model.N3Term): Option.Option<Array<Num>> =>\n  Model.isCollection(t) ? Option.all(t.items.map(toNum)) : Option.none();\n\n/** Unifies the object with a computed value (or checks it). */\nconst output = (\n  object: Model.N3Term,\n  value: Option.Option<Model.N3Term>,\n  b: Bindings,\n  ctx: Context,\n): Answer => {\n  if (Option.isNone(value)) return solutions([]);\n  if (ground(object)) {\n    const on = toNum(object);\n    const vn = toNum(value.value);\n    if (Option.isSome(on) && Option.isSome(vn)) {\n      return solutions(numEquals(on.value, vn.value) ? [b] : []);\n    }\n  }\n  return solutions(ctx.unify(object, value.value, b));\n};\n\nconst ready = (t: Model.N3Term): boolean => ground(t);\n\nconst listFunction =\n  (f: (ns: Array<Num>) => Option.Option<Num>, arity = -1): Builtin =>\n  (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    const ns = numbersOf(s);\n    if (Option.isNone(ns) || (arity >= 0 && ns.value.length !== arity)) return solutions([]);\n    const r = f(ns.value);\n    return Option.isNone(r) ? solutions([]) : output(o, Option.some(fromNum(r.value)), b, ctx);\n  };\n\nconst unaryFunction =\n  (f: (n: Num) => Num, inverse?: (n: Num) => Num): Builtin =>\n  (s, o, b, ctx) => {\n    if (!ready(s)) {\n      if (inverse === undefined || !ready(o)) return notReady;\n      const n = toNum(o);\n      return solutions(Option.isNone(n) ? [] : ctx.unify(s, fromNum(inverse(n.value)), b));\n    }\n    const n = toNum(s);\n    return Option.isNone(n) ? solutions([]) : output(o, Option.some(fromNum(f(n.value))), b, ctx);\n  };\n\nconst real =\n  (f: (x: number) => number) =>\n  (n: Num): Num => ({ kind: 'double', value: f(asNumber(n)) });\n\nconst comparison =\n  (test: (c: number) => boolean): Builtin =>\n  (s, o, b) => {\n    if (!ready(s) || !ready(o)) return notReady;\n    const xs = toNum(s);\n    const ys = toNum(o);\n    if (Option.isNone(xs) || Option.isNone(ys)) return solutions([]);\n    const x = xs.value;\n    const y = ys.value;\n    // NaN is unordered: only `notEqualTo` holds.\n    const c =\n      Number.isNaN(asNumber(x)) || Number.isNaN(asNumber(y))\n        ? NaN\n        : numEquals(x, y)\n          ? 0\n          : asNumber(x) < asNumber(y)\n            ? -1\n            : 1;\n    return solutions(test(c) ? [b] : []);\n  };\n\n/** Folds the numbers as integers when they all are, else as reals. */\nconst fold =\n  (\n    int: (a: bigint, n: bigint) => bigint,\n    int0: bigint,\n    float: (a: number, n: number) => number,\n    float0: number,\n  ) =>\n  (ns: Array<Num>): Option.Option<Num> => {\n    const kind = resultKind(ns);\n    // `kind === 'integer'` means every value is a `bigint`.\n    return Option.some(\n      kind === 'integer'\n        ? { kind, value: ns.reduce((a, n) => (n.kind === 'integer' ? int(a, n.value) : a), int0) }\n        : { kind, value: ns.reduce((a, n) => float(a, asNumber(n)), float0) },\n    );\n  };\n\nconst sum = fold(\n  (a, n) => a + n,\n  0n,\n  (a, n) => a + n,\n  0,\n);\n\nconst product = fold(\n  (a, n) => a * n,\n  1n,\n  (a, n) => a * n,\n  1,\n);\n\nconst noInteger = (): Option.Option<bigint> => Option.none();\n\nconst binary =\n  (\n    int: (a: bigint, b: bigint) => Option.Option<bigint>,\n    float: (a: number, b: number) => number,\n    forceReal = false,\n  ) =>\n  (ns: Array<Num>): Option.Option<Num> => {\n    // `binary` is only used as `listFunction(binary(…), 2)`, which passes exactly two numbers.\n    const [a, c] = ns;\n    if (a === undefined || c === undefined) return Option.none();\n    const kind = resultKind(ns);\n    let outKind: Num['kind'] = kind === 'integer' ? 'decimal' : kind;\n    if (a.kind === 'integer' && c.kind === 'integer' && !forceReal) {\n      const r = int(a.value, c.value);\n      if (Option.isSome(r)) return Option.some({ kind: 'integer', value: r.value });\n      outKind = 'double';\n    }\n    const r = float(asNumber(a), asNumber(c));\n    if (outKind !== 'double' && !Number.isFinite(r)) return Option.none();\n    return Option.some({ kind: outKind, value: r });\n  };\n\nconst mathBuiltins = {\n  sum: listFunction(sum),\n  product: listFunction(product),\n  difference: listFunction(\n    binary(\n      (a, b) => Option.some(a - b),\n      (a, b) => a - b,\n    ),\n    2,\n  ),\n  quotient: listFunction(\n    binary(noInteger, (a, b) => a / b, true),\n    2,\n  ),\n  integerQuotient: listFunction((ns) => {\n    // `listFunction(f, 2)` only calls `f` with two numbers.\n    const [a, b] = ns.map(asNumber);\n    return a === undefined || b === undefined || b === 0\n      ? Option.none()\n      : Option.some({ kind: 'integer', value: BigInt(Math.trunc(a / b)) });\n  }, 2),\n  remainder: listFunction((ns) => {\n    // `listFunction(f, 2)` only calls `f` with two numbers.\n    const [a, b] = ns;\n    if (a?.kind !== 'integer' || b?.kind !== 'integer' || b.value === 0n) return Option.none();\n    // The result has the sign of the divisor (floored division).\n    return Option.some({ kind: 'integer', value: ((a.value % b.value) + b.value) % b.value });\n  }, 2),\n  exponentiation: listFunction(\n    binary(\n      (a, b) => (b >= 0n ? Option.some(a ** b) : Option.none()),\n      (a, b) => a ** b,\n    ),\n    2,\n  ),\n  negation: unaryFunction(\n    (n) =>\n      n.kind === 'integer' ? { kind: n.kind, value: -n.value } : { kind: n.kind, value: -n.value },\n    (n) =>\n      n.kind === 'integer' ? { kind: n.kind, value: -n.value } : { kind: n.kind, value: -n.value },\n  ),\n  absoluteValue: unaryFunction((n) =>\n    n.kind === 'integer'\n      ? { kind: n.kind, value: n.value < 0n ? -n.value : n.value }\n      : { kind: n.kind, value: Math.abs(n.value) },\n  ),\n  rounded: unaryFunction((n) =>\n    n.kind === 'integer' ? n : { kind: n.kind, value: Math.round(n.value) },\n  ),\n  floor: unaryFunction((n) => ({ kind: 'integer', value: BigInt(Math.floor(asNumber(n))) })),\n  ceiling: unaryFunction((n) => ({ kind: 'integer', value: BigInt(Math.ceil(asNumber(n))) })),\n  sin: unaryFunction(real(Math.sin), real(Math.asin)),\n  cos: unaryFunction(real(Math.cos), real(Math.acos)),\n  tan: unaryFunction(real(Math.tan), real(Math.atan)),\n  asin: unaryFunction(real(Math.asin), real(Math.sin)),\n  acos: unaryFunction(real(Math.acos), real(Math.cos)),\n  atan: unaryFunction(real(Math.atan), real(Math.tan)),\n  sinh: unaryFunction(real(Math.sinh), real(Math.asinh)),\n  cosh: unaryFunction(real(Math.cosh)),\n  tanh: unaryFunction(real(Math.tanh), real(Math.atanh)),\n  degrees: unaryFunction(\n    real((x) => (x * 180) / Math.PI),\n    real((x) => (x * Math.PI) / 180),\n  ),\n  greaterThan: comparison((c) => c > 0),\n  lessThan: comparison((c) => c < 0),\n  notGreaterThan: comparison((c) => c <= 0),\n  notLessThan: comparison((c) => c >= 0),\n  equalTo: comparison((c) => c === 0),\n  notEqualTo: comparison((c) => !(c === 0)),\n} satisfies Record.ReadonlyRecord<string, Builtin>;\n\n// -----------------------------------------------------------------------------\n// Strings\n// -----------------------------------------------------------------------------\n\n/** The XPath string value of a literal (numbers and booleans in canonical form). */\nconst literalString = (t: Term.Literal): string => {\n  const dt = t.datatype.value;\n  if (dt === xsd.boolean.value) return t.value === '1' || t.value === 'true' ? 'true' : 'false';\n  if (dt !== Term.XSD_STRING && Xsd.isNumericDatatype(dt)) {\n    const num = toNum(t);\n    if (Option.isSome(num)) {\n      const n = num.value;\n      if (n.kind === 'integer') return n.value.toString();\n      if (Number.isNaN(n.value)) return 'NaN';\n      if (!Number.isFinite(n.value)) return n.value > 0 ? 'INF' : '-INF';\n      return String(n.value);\n    }\n  }\n  return t.value;\n};\n\n/** The XPath string value of a term: of a literal or an IRI. */\nconst str = (t: Model.N3Term): Option.Option<string> =>\n  Guards.isLiteral(t)\n    ? Option.some(literalString(t))\n    : Guards.isNamedNode(t)\n      ? Option.some(t.value)\n      : Option.none();\n\nconst stringTest =\n  (test: (a: string, b: string) => boolean): Builtin =>\n  (s, o, b) => {\n    if (!ready(s) || !ready(o)) return notReady;\n    const x = str(s);\n    const y = str(o);\n    return solutions(Option.isSome(x) && Option.isSome(y) && test(x.value, y.value) ? [b] : []);\n  };\n\nconst stringsOf = (t: Model.N3Term): Option.Option<Array<string>> =>\n  Model.isCollection(t) ? Option.all(t.items.map(str)) : Option.none();\n\nconst stringFunction =\n  (f: (args: Array<string>) => Option.Option<string>): Builtin =>\n  (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    const r = Option.flatMap(stringsOf(s), f);\n    return solutions(Option.isNone(r) ? [] : ctx.unify(o, Term.literal(r.value), b));\n  };\n\nconst regex = (pattern: string, flags = ''): Option.Option<RegExp> =>\n  Result.getSuccess(Result.try(() => new RegExp(pattern, flags)));\n\nconst stringBuiltins = {\n  concatenation: stringFunction((args) => Option.some(args.join(''))),\n  contains: stringTest((a, b) => a.includes(b)),\n  containsIgnoringCase: stringTest((a, b) => a.toLowerCase().includes(b.toLowerCase())),\n  startsWith: stringTest((a, b) => a.startsWith(b)),\n  endsWith: stringTest((a, b) => a.endsWith(b)),\n  equalIgnoringCase: stringTest((a, b) => a.toLowerCase() === b.toLowerCase()),\n  notEqualIgnoringCase: stringTest((a, b) => a.toLowerCase() !== b.toLowerCase()),\n  greaterThan: stringTest((a, b) => a > b),\n  lessThan: stringTest((a, b) => a < b),\n  notGreaterThan: stringTest((a, b) => a <= b),\n  notLessThan: stringTest((a, b) => a >= b),\n  matches: stringTest((a, b) => Option.exists(regex(b), (re) => re.test(a))),\n  notMatches: stringTest(\n    (a, b) => !Option.match(regex(b), { onNone: () => true, onSome: (re) => re.test(a) }),\n  ),\n  replace: stringFunction(([s, p, r]) => {\n    if (s === undefined || p === undefined || r === undefined) return Option.none();\n    return Option.map(regex(p, 'g'), (re) => s.replace(re, r.replace(/\\\\(\\d)/g, '$$$1')));\n  }),\n  scrape: stringFunction(([s, p]) => {\n    if (s === undefined || p === undefined) return Option.none();\n    return Option.flatMap(regex(p), (re) => Option.fromUndefinedOr(re.exec(s)?.[1]));\n  }),\n  format: stringFunction(([fmt, ...args]) => {\n    if (fmt === undefined) return Option.none();\n    let i = 0;\n    return Option.some(fmt.replace(/%s/g, () => args[i++] ?? ''));\n  }),\n} satisfies Record.ReadonlyRecord<string, Builtin>;\n\n// -----------------------------------------------------------------------------\n// Lists\n// -----------------------------------------------------------------------------\n\n/** The two items of a two-item collection. */\nconst pairOf = (t: Model.N3Term): Option.Option<readonly [Model.N3Term, Model.N3Term]> => {\n  if (!Model.isCollection(t)) return Option.none();\n  const [x, y] = t.items;\n  return t.items.length === 2 && x !== undefined && y !== undefined\n    ? Option.some([x, y])\n    : Option.none();\n};\n\n/** The three items of a three-item collection. */\nconst tripleOf = (\n  t: Model.N3Term,\n): Option.Option<readonly [Model.N3Term, Model.N3Term, Model.N3Term]> => {\n  if (!Model.isCollection(t)) return Option.none();\n  const [x, y, z] = t.items;\n  return t.items.length === 3 && x !== undefined && y !== undefined && z !== undefined\n    ? Option.some([x, y, z])\n    : Option.none();\n};\n\nconst noSolutions = (): Array<Bindings> => [];\n\nconst integerLiteral = (n: number): Term.Literal => Term.literal(String(n), xsd.integer);\n\nconst listBuiltins = {\n  in: (s, o, b, ctx) => {\n    if (!Model.isCollection(o)) return noneOnceReady(o);\n    return solutions(o.items.flatMap((item) => ctx.unify(s, item, b)));\n  },\n  member: (s, o, b, ctx) => {\n    if (!Model.isCollection(s)) return noneOnceReady(s);\n    return solutions(s.items.flatMap((item) => ctx.unify(o, item, b)));\n  },\n  length: (s, o, b, ctx) =>\n    !Model.isCollection(s)\n      ? noneOnceReady(s)\n      : output(o, Option.some(integerLiteral(s.items.length)), b, ctx),\n  first: (s, o, b, ctx) =>\n    !Model.isCollection(s)\n      ? noneOnceReady(s)\n      : output(o, Option.fromUndefinedOr(s.items[0]), b, ctx),\n  last: (s, o, b, ctx) =>\n    !Model.isCollection(s)\n      ? noneOnceReady(s)\n      : output(o, Option.fromUndefinedOr(s.items.at(-1)), b, ctx),\n  rest: (s, o, b, ctx) =>\n    !Model.isCollection(s) || Arr.isReadonlyArrayEmpty(s.items)\n      ? noneOnceReady(s)\n      : solutions(ctx.unify(o, new Model.Collection(s.items.slice(1)), b)),\n  append: (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    if (!Model.isCollection(s) || !s.items.every(Model.isCollection)) return solutions([]);\n    return solutions(\n      ctx.unify(\n        o,\n        new Model.Collection(s.items.flatMap((l) => (Model.isCollection(l) ? l.items : []))),\n        b,\n      ),\n    );\n  },\n  iterate: (s, o, b, ctx) => {\n    if (!Model.isCollection(s)) return noneOnceReady(s);\n    return solutions(\n      s.items.flatMap((item, i) =>\n        ctx.unify(o, new Model.Collection([integerLiteral(i), item]), b),\n      ),\n    );\n  },\n  memberAt: (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    const found = Option.flatMap(pairOf(s), ([l, idx]) =>\n      Model.isCollection(l)\n        ? Option.map(toNum(idx), (n) => Option.fromUndefinedOr(l.items[asNumber(n)]))\n        : Option.none(),\n    );\n    return Option.isNone(found) ? solutions([]) : output(o, found.value, b, ctx);\n  },\n  remove: (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    return solutions(\n      Option.match(pairOf(s), {\n        onNone: noSolutions,\n        onSome: ([l, x]) =>\n          Model.isCollection(l)\n            ? ctx.unify(o, new Model.Collection(l.items.filter((i) => i.key !== x.key)), b)\n            : [],\n      }),\n    );\n  },\n} satisfies Record.ReadonlyRecord<string, Builtin>;\n\n// -----------------------------------------------------------------------------\n// Log\n// -----------------------------------------------------------------------------\n\nconst scopeOf = (t: Model.N3Term, ctx: Context): Option.Option<Model.Formula> =>\n  Model.isFormula(t)\n    ? Option.some(t)\n    : Guards.isLiteral(t) && t.key === TRUE.key\n      ? Option.some(Model.emptyFormula)\n      : Guards.isBlankNode(t)\n        ? Option.some(ctx.document())\n        : Option.none();\n\nconst noGoals: ReadonlyArray<Model.Statement> = [];\n\nconst goalsOf = (t: Model.N3Term): Option.Option<ReadonlyArray<Model.Statement>> =>\n  Model.isFormula(t)\n    ? Option.some(t.statements)\n    : t.key === TRUE.key\n      ? Option.some(noGoals)\n      : Option.none();\n\n/**\n * `log:includes` / `log:notIncludes`: queries the subject formula for the\n * object's statements and maps the solutions with `answer`. An unbound or\n * non-formula operand gives no solutions once the subject is ground, and is\n * not ready otherwise.\n */\nconst included = (\n  s: Model.N3Term,\n  o: Model.N3Term,\n  b: Bindings,\n  ctx: Context,\n  answer: (found: Array<Bindings>) => Array<Bindings>,\n): Answer => {\n  const scope = scopeOf(s, ctx);\n  const goals = goalsOf(o);\n  if (Option.isNone(scope) || Option.isNone(goals)) return noneOnceReady(s);\n  return solutions(answer(ctx.query(scope.value, goals.value, b, false)));\n};\n\nconst logBuiltins = {\n  equalTo: (s, o, b, ctx) => solutions(ctx.unify(s, o, b)),\n  notEqualTo: (s, o, b) =>\n    !ready(s) || !ready(o) ? notReady : solutions(s.key !== o.key ? [b] : []),\n  includes: (s, o, b, ctx) => included(s, o, b, ctx, (found) => found),\n  notIncludes: (s, o, b, ctx) =>\n    included(s, o, b, ctx, (found) => (Arr.isReadonlyArrayEmpty(found) ? [b] : [])),\n  conjunction: (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    if (!Model.isCollection(s)) return solutions([]);\n    const parts = Option.all(s.items.map(goalsOf));\n    if (Option.isNone(parts)) return solutions([]);\n    return solutions(ctx.unify(o, new Model.Formula(parts.value.flat()), b));\n  },\n  conclusion: (s, o, b, ctx) => {\n    const f = s.key === TRUE.key ? Model.emptyFormula : s;\n    if (!Model.isFormula(f)) return noneOnceReady(s);\n    return solutions(ctx.unify(o, ctx.conclusion(f), b));\n  },\n  uri: (s, o, b, ctx) => {\n    if (Guards.isNamedNode(s)) return solutions(ctx.unify(o, Term.literal(s.value), b));\n    if (Guards.isLiteral(o)) return solutions(ctx.unify(s, Term.namedNode(o.value), b));\n    return noneOnceReady(s);\n  },\n  dtlit: (s, o, b, ctx) => {\n    const pair = pairOf(s);\n    if (Option.isSome(pair) && ready(s)) {\n      const [lex, dt] = pair.value;\n      if (!Guards.isLiteral(lex) || !Guards.isNamedNode(dt)) return solutions([]);\n      return solutions(ctx.unify(o, Term.literal(lex.value, dt), b));\n    }\n    if (Guards.isLiteral(o)) {\n      return solutions(ctx.unify(s, new Model.Collection([Term.literal(o.value), o.datatype]), b));\n    }\n    return notReady;\n  },\n  langlit: (s, o, b, ctx) => {\n    const pair = pairOf(s);\n    if (Option.isSome(pair) && ready(s)) {\n      const [lex, lang] = pair.value;\n      if (!Guards.isLiteral(lex) || !Guards.isLiteral(lang)) return solutions([]);\n      return solutions(ctx.unify(o, Term.literal(lex.value, lang.value), b));\n    }\n    if (Guards.isLiteral(o) && o.language !== '') {\n      return solutions(\n        ctx.unify(s, new Model.Collection([Term.literal(o.value), Term.literal(o.language)]), b),\n      );\n    }\n    return notReady;\n  },\n  rawType: (s, o, b, ctx) => {\n    if (!ready(s)) return notReady;\n    const type = Model.isFormula(s)\n      ? log.Formula\n      : Guards.isLiteral(s)\n        ? log.Literal\n        : Model.isCollection(s)\n          ? log.List\n          : log.Other;\n    return solutions(ctx.unify(o, type, b));\n  },\n  collectAllIn: (s, o, b, ctx) =>\n    solutions(\n      Option.match(\n        Option.flatMap(tripleOf(s), ([template, where, result]) =>\n          Option.map(Option.all([scopeOf(o, ctx), goalsOf(where)]), ([scope, goals]) => ({\n            template,\n            result,\n            scope,\n            goals,\n          })),\n        ),\n        {\n          onNone: noSolutions,\n          onSome: ({ template, result, scope, goals }) => {\n            const values = ctx\n              .query(scope, goals, b, true)\n              .map((sol) => Model.substitute(template, sol));\n            return ctx.unify(result, new Model.Collection(values), b);\n          },\n        },\n      ),\n    ),\n  forAllIn: (s, o, b, ctx) =>\n    solutions(\n      Option.match(\n        Option.flatMap(pairOf(s), ([w, t]) => {\n          const where = goalsOf(w);\n          const then = goalsOf(t);\n          return Option.all([scopeOf(o, ctx), where, then]);\n        }),\n        {\n          onNone: noSolutions,\n          onSome: ([scope, where, then]) =>\n            ctx\n              .query(scope, where, b, true)\n              .every((sol) => Arr.isReadonlyArrayNonEmpty(ctx.query(scope, then, sol, true)))\n              ? [b]\n              : [],\n        },\n      ),\n    ),\n} satisfies Record.ReadonlyRecord<string, Builtin>;\n\nconst table = MutableHashMap.empty<string, Builtin>();\nconst namespaces: ReadonlyArray<readonly [string, Record.ReadonlyRecord<string, Builtin>]> = [\n  [math.base, mathBuiltins],\n  [string.base, stringBuiltins],\n  [list.base, listBuiltins],\n  [log.base, logBuiltins],\n];\nnamespaces.forEach(([ns, builtins]) => {\n  Record.toEntries(builtins).forEach(([name, f]) => MutableHashMap.set(table, ns + name, f));\n});\n\n/** @internal */\nexport const builtinFor = (predicate: Model.N3Term): Option.Option<Builtin> =>\n  Guards.isNamedNode(predicate) ? MutableHashMap.get(table, predicate.value) : Option.none();\n\n/** The IRIs of all supported builtins. @internal */\nexport const builtinIris: ReadonlyArray<string> = Arr.fromIterable(MutableHashMap.keys(table));\n","/**\n * A simple forward-chaining N3 reasoner.\n *\n * Rules are the top-level statements `{ premise } => { conclusion }` (and\n * `{ conclusion } <= { premise }`). The reasoner repeatedly matches every\n * rule premise against the current statements — joining triple patterns with\n * backtracking and evaluating builtins — and adds the instantiated\n * conclusions, until a fixpoint is reached.\n *\n * - Variables (`?x`) and blank nodes in a premise are matched like query\n *   variables; blank nodes that occur only in a conclusion are instantiated\n *   with fresh blank nodes for each distinct set of bindings (so the closure\n *   is finite whenever the rules do not keep inventing new terms).\n * - Rules inferred by other rules are applied too.\n * - A conclusion `false` signals an inconsistency and fails with\n *   `ReasonerError`.\n * - Builtins: a pragmatic subset of `math:` (arithmetic, comparisons,\n *   trigonometry), `string:` (concatenation, comparisons, regular\n *   expressions), `list:` (`in`, `member`, `length`, `first`, `last`, `rest`,\n *   `append`, `iterate`, `memberAt`, `remove`) and `log:` (`equalTo`,\n *   `notEqualTo`, `includes`, `notIncludes`, `conjunction`, `uri`, `dtlit`,\n *   `langlit`, `rawType`, `collectAllIn`, `forAllIn`). Builtins whose inputs\n *   are not yet bound are deferred until the other premise statements have\n *   been matched.\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as Effect from 'effect/Effect';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Order from 'effect/Order';\nimport * as Schema from 'effect/Schema';\nimport * as Term from '../Term.ts';\nimport { rdf, xsd } from '../Vocab.ts';\nimport * as Builtins from './internal/builtins.ts';\nimport * as Guards from './internal/guards.ts';\nimport { loop } from './internal/loop.ts';\nimport * as Isomorphism from './Isomorphism.ts';\nimport * as Model from './Model.ts';\nimport { log } from './Vocab.ts';\n\n/**\n * Reasoning failed: an inconsistency was derived or a limit was exceeded.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class ReasonerError extends Schema.TaggedError<ReasonerError>()('N3ReasonerError', {\n  message: Schema.String,\n}) {}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport interface Options {\n  /** Maximum number of forward-chaining rounds (default 1000). */\n  readonly maxRounds?: number | undefined;\n  /** Maximum number of statements in the closure (default 1 000 000). */\n  readonly maxStatements?: number | undefined;\n  /** Whether to evaluate builtins (default `true`). */\n  readonly builtins?: boolean | undefined;\n}\n\n/**\n * A rule extracted from a formula.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Rule {\n  readonly premise: ReadonlyArray<Model.Statement>;\n  readonly conclusion: Model.N3Term;\n  /** The statement the rule was read from. */\n  readonly source: Model.Statement;\n}\n\n/**\n * The result of reasoning.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Result {\n  /** The input statements together with everything inferred. */\n  readonly closure: Model.Formula;\n  /** Only the newly inferred statements. */\n  readonly inferred: Model.Formula;\n  /** The number of rounds until the fixpoint was reached. */\n  readonly rounds: number;\n}\n\nconst TRUE_KEY = Term.literal('true', xsd.boolean).key;\nconst FALSE_KEY = Term.literal('false', xsd.boolean).key;\n\nconst noGoals: ReadonlyArray<Model.Statement> = [];\n\nconst goalsOf = (t: Model.N3Term): Option.Option<ReadonlyArray<Model.Statement>> =>\n  Model.isFormula(t)\n    ? Option.some(t.statements)\n    : t.key === TRUE_KEY\n      ? Option.some(noGoals)\n      : Option.none();\n\n/** Premise blank nodes become rule-local variables. */\nconst BLANK_VAR = '\\u0000b:';\n\n/** Blank nodes at the top level of statements (not inside nested formulas). */\nconst topBlanks = (\n  statements: ReadonlyArray<Model.Statement>,\n): MutableHashSet.MutableHashSet<string> => {\n  const out = MutableHashSet.empty<string>();\n  const go = (t: Model.N3Term) => {\n    if (Guards.isBlankNode(t)) MutableHashSet.add(out, t.value);\n    else if (Model.isCollection(t)) t.items.forEach(go);\n  };\n  statements.forEach((s) => {\n    go(s.subject);\n    go(s.predicate);\n    go(s.object);\n  });\n  return out;\n};\n\n/** Replaces the given blank nodes (outside nested formulas) by variables. */\nconst blanksToVariables = (\n  t: Model.N3Term,\n  blanks: MutableHashSet.MutableHashSet<string>,\n): Model.N3Term =>\n  Guards.isBlankNode(t) && MutableHashSet.has(blanks, t.value)\n    ? new Term.Variable(BLANK_VAR + t.value)\n    : Model.isCollection(t)\n      ? new Model.Collection(t.items.map((x) => blanksToVariables(x, blanks)))\n      : t;\n\nconst statementBlanksToVariables = (\n  s: Model.Statement,\n  blanks: MutableHashSet.MutableHashSet<string>,\n) =>\n  new Model.Statement(\n    blanksToVariables(s.subject, blanks),\n    blanksToVariables(s.predicate, blanks),\n    blanksToVariables(s.object, blanks),\n  );\n\n/**\n * Extracts the rules (`=>` and `<=` statements between formulas) of a\n * formula's top level.\n *\n * @since 0.1.0\n * @category rules\n */\nexport const rules = (formula: Model.Formula): ReadonlyArray<Rule> =>\n  Arr.getSomes(\n    formula.statements.map((s): Option.Option<Rule> => {\n      if (!Guards.isNamedNode(s.predicate)) return Option.none();\n      const forward = s.predicate.value === log.implies.value;\n      const backward = s.predicate.value === log.isImpliedBy.value;\n      if (!forward && !backward) return Option.none();\n      const premiseTerm = forward ? s.subject : s.object;\n      const conclusion = forward ? s.object : s.subject;\n      return Option.map(goalsOf(premiseTerm), (premise): Rule => {\n        // Blank nodes of the premise are query variables, also in the conclusion.\n        const blanks = topBlanks(premise);\n        return {\n          premise: premise.map((p) => statementBlanksToVariables(p, blanks)),\n          conclusion: Model.isFormula(conclusion)\n            ? new Model.Formula(\n                conclusion.statements.map((c) => statementBlanksToVariables(c, blanks)),\n              )\n            : conclusion,\n          source: s,\n        };\n      });\n    }),\n  );\n\n// -----------------------------------------------------------------------------\n// Matching\n// -----------------------------------------------------------------------------\n\ntype Bindings = Builtins.Bindings;\n\n/** The bindings that bind nothing. */\nconst noBindings: Bindings = MutableHashMap.empty<string, Model.N3Term>().backing;\n\n/** `b` with `name` bound to `value` (a copy: bindings are shared between solutions). */\nconst extend = (b: Bindings, name: string, value: Model.N3Term): Bindings => {\n  const next = MutableHashMap.fromIterable(b);\n  MutableHashMap.set(next, name, value);\n  return next.backing;\n};\n\nconst noStatements: ReadonlyArray<Model.Statement> = [];\n\nclass Store {\n  readonly all: Array<Model.Statement> = [];\n  readonly keys = MutableHashSet.empty<string>();\n  readonly byPredicate = MutableHashMap.empty<string, Array<Model.Statement>>();\n  constructor(statements: Iterable<Model.Statement> = []) {\n    Arr.fromIterable(statements).forEach((s) => this.add(s));\n  }\n  has(s: Model.Statement): boolean {\n    return MutableHashSet.has(this.keys, s.key);\n  }\n  add(s: Model.Statement): boolean {\n    if (this.has(s)) return false;\n    MutableHashSet.add(this.keys, s.key);\n    this.all.push(s);\n    const k = s.predicate.key;\n    const l = this.byPredicate.backing.get(k);\n    if (l === undefined) MutableHashMap.set(this.byPredicate, k, [s]);\n    else l.push(s);\n    return true;\n  }\n  /** The statements with the predicate `key`. */\n  withPredicate(key: string): ReadonlyArray<Model.Statement> {\n    return this.byPredicate.backing.get(key) ?? noStatements;\n  }\n}\n\n/** The term a variable is bound to, through chains of variables (it recurses once per link). */\nconst walk = (t: Model.N3Term, b: Bindings): Model.N3Term => {\n  if (!Guards.isVariable(t)) return t;\n  const next = b.get(t.value);\n  return next === undefined ? t : walk(next, b);\n};\n\nconst resolve = (t: Model.N3Term, b: Bindings): Model.N3Term =>\n  b.size === 0 ? t : Model.substitute(t, b);\n\nconst unify = (pattern: Model.N3Term, term: Model.N3Term, b: Bindings): Array<Bindings> => {\n  const p = walk(pattern, b);\n  if (Guards.isVariable(p)) {\n    if (Guards.isVariable(term) && term.value === p.value) return [b];\n    return [extend(b, p.value, term)];\n  }\n  const t = Guards.isVariable(term) ? walk(term, b) : term;\n  if (p instanceof Model.Collection) {\n    if (!(t instanceof Model.Collection) || t.items.length !== p.items.length) return [];\n    return p.items.reduce<Array<Bindings>>(\n      (results, item, i) => {\n        const other = t.items[i];\n        return other === undefined ? [] : results.flatMap((r) => unify(item, other, r));\n      },\n      [b],\n    );\n  }\n  if (p instanceof Model.Formula) {\n    if (!(t instanceof Model.Formula) || t.statements.length !== p.statements.length) return [];\n    if (Model.isGround(p)) return p.key === t.key || Isomorphism.isomorphic(p, t) ? [b] : [];\n    return matchFormula(p.statements, t.statements, b);\n  }\n  return p.key === t.key ? [b] : [];\n};\n\n/** Matches each pattern statement to a distinct statement of `target`. */\nconst matchFormula = (\n  patterns: ReadonlyArray<Model.Statement>,\n  target: ReadonlyArray<Model.Statement>,\n  b: Bindings,\n): Array<Bindings> => {\n  const out: Array<Bindings> = [];\n  const used = new Uint8Array(target.length);\n  const go = (i: number, cur: Bindings) => {\n    const p = patterns[i];\n    if (p === undefined) {\n      out.push(cur);\n      return;\n    }\n    target.forEach((s, j) => {\n      if (used[j] === 1) return;\n      used[j] = 1;\n      unifyStatement(p, s, cur).forEach((r) => go(i + 1, r));\n      used[j] = 0;\n    });\n  };\n  go(0, b);\n  return out;\n};\n\nconst unifyStatement = (p: Model.Statement, s: Model.Statement, b: Bindings): Array<Bindings> =>\n  unify(p.predicate, s.predicate, b)\n    .flatMap((r) => unify(p.subject, s.subject, r))\n    .flatMap((r) => unify(p.object, s.object, r));\n\ninterface Engine {\n  readonly builtins: boolean;\n  readonly document: () => Model.Formula;\n  readonly conclusion: (formula: Model.Formula) => Model.Formula;\n}\n\nconst solve = (\n  store: Store,\n  goals: ReadonlyArray<Model.Statement>,\n  b: Bindings,\n  engine: Engine,\n): Array<Bindings> => {\n  const out: Array<Bindings> = [];\n  const ctx: Builtins.Context = {\n    unify,\n    query: (scope, scopeGoals, bindings, builtins) => {\n      const blanks = topBlanks(scopeGoals);\n      return solve(\n        new Store(scope.statements),\n        scopeGoals.map((g) => statementBlanksToVariables(g, blanks)),\n        bindings,\n        { ...engine, builtins: engine.builtins && builtins },\n      );\n    },\n    document: engine.document,\n    conclusion: engine.conclusion,\n  };\n  const go = (remaining: ReadonlyArray<Model.Statement>, cur: Bindings, deferred: number) => {\n    if (!Arr.isReadonlyArrayNonEmpty(remaining)) {\n      out.push(cur);\n      return;\n    }\n    const [goal, ...rest] = remaining;\n    const builtin = engine.builtins\n      ? Builtins.builtinFor(walk(goal.predicate, cur))\n      : Option.none<Builtins.Builtin>();\n    if (Option.isSome(builtin)) {\n      const results = builtin.value(\n        resolve(goal.subject, cur),\n        resolve(goal.object, cur),\n        cur,\n        ctx,\n      );\n      if (Option.isNone(results)) {\n        // Not ready: try the other goals first (once around the remaining goals).\n        if (deferred < remaining.length) go([...rest, goal], cur, deferred + 1);\n        return;\n      }\n      results.value.forEach((r) => go(rest, r, 0));\n      return;\n    }\n    const predicate = walk(goal.predicate, cur);\n    const subject = walk(goal.subject, cur);\n    const listPredicate = predicate.key === rdf.first.key || predicate.key === rdf.rest.key;\n    if (listPredicate && Guards.isVariable(subject) && deferred < remaining.length) {\n      // The subject may become bound to a collection by a later goal.\n      go([...rest, goal], cur, deferred + 1);\n      return;\n    }\n    if (\n      listPredicate &&\n      subject instanceof Model.Collection &&\n      Arr.isReadonlyArrayNonEmpty(subject.items)\n    ) {\n      // Collections are lists: answer rdf:first / rdf:rest structurally.\n      const value =\n        predicate.key === rdf.first.key\n          ? subject.items[0]\n          : subject.items.length === 1\n            ? rdf.nil\n            : new Model.Collection(subject.items.slice(1));\n      unify(goal.object, value, cur).forEach((r) => go(rest, r, 0));\n      return;\n    }\n    const candidates = Guards.isVariable(predicate)\n      ? store.all\n      : store.withPredicate(predicate.key);\n    candidates.forEach((s) => {\n      unifyStatement(goal, s, cur).forEach((r) => go(rest, r, 0));\n    });\n  };\n  go(goals, b, 0);\n  return out;\n};\n\n// -----------------------------------------------------------------------------\n// Forward chaining\n// -----------------------------------------------------------------------------\n\nconst hash = (s: string): string => {\n  let h1 = 0x811c9dc5;\n  let h2 = 0x01000193;\n  loop((i) => {\n    if (i >= s.length) return false;\n    const c = s.charCodeAt(i);\n    h1 = Math.imul(h1 ^ c, 0x01000193);\n    h2 = Math.imul(h2 ^ c, 0x5bd1e995);\n    return true;\n  });\n  return (h1 >>> 0).toString(36) + (h2 >>> 0).toString(36);\n};\n\nclass Inconsistency {\n  readonly rule: Model.Statement;\n  constructor(rule: Model.Statement) {\n    this.rule = rule;\n  }\n}\n\nconst instantiate = (rule: Rule, b: Bindings): ReadonlyArray<Model.Statement> => {\n  const conclusion = walk(rule.conclusion, b);\n  if (conclusion.key === FALSE_KEY) throw new Inconsistency(rule.source);\n  // A conclusion bound through a variable is asserted as it is.\n  if (conclusion !== rule.conclusion) {\n    return Option.getOrElse(goalsOf(resolve(conclusion, b)), () => noGoals);\n  }\n  const goals = goalsOf(conclusion);\n  if (Option.isNone(goals)) return noGoals;\n  // Fresh blank nodes depend only on the bindings used by the conclusion.\n  const used = MutableHashSet.fromIterable(Model.variables(conclusion).map((v) => v.value));\n  const entries = Arr.fromIterable(b)\n    .filter(([k]) => MutableHashSet.has(used, k))\n    .map(([k, v]) => `${k}=${resolve(v, b).key}`);\n  const signature = Arr.sort(entries, Order.String).join('|');\n  const fresh = MutableHashMap.empty<string, Term.BlankNode>();\n  const skolem = (label: string): Term.BlankNode => {\n    const known = fresh.backing.get(label);\n    if (known !== undefined) return known;\n    const node = new Term.BlankNode(`sk${hash(`${rule.source.key}|${signature}|${label}`)}`);\n    MutableHashMap.set(fresh, label, node);\n    return node;\n  };\n  // Blank nodes at the top level of the conclusion are instantiated per\n  // firing (before the bindings are applied).\n  const top = (t: Model.N3Term): Model.N3Term =>\n    Guards.isBlankNode(t)\n      ? skolem(t.value)\n      : Model.isCollection(t)\n        ? new Model.Collection(t.items.map(top))\n        : t;\n  return goals.value.map(\n    (s) =>\n      new Model.Statement(\n        resolve(top(s.subject), b),\n        resolve(top(s.predicate), b),\n        resolve(top(s.object), b),\n      ),\n  );\n};\n\nclass LimitExceeded {\n  readonly message: string;\n  constructor(message: string) {\n    this.message = message;\n  }\n}\n\n/** Forward chaining to a fixpoint; throws `Inconsistency` / `LimitExceeded`. */\nconst closureOf = (input: Model.Formula, options?: Options, depth = 0): Result => {\n  const maxRounds = options?.maxRounds ?? 1000;\n  const maxStatements = options?.maxStatements ?? 1_000_000;\n  const store = new Store(input.statements);\n  const inferred: Array<Model.Statement> = [];\n  // The formula of the store as it stood at the start of the round, made on first use\n  let snapshot = Option.none<Model.Formula>();\n  const engine: Engine = {\n    builtins: options?.builtins ?? true,\n    document: () => {\n      if (Option.isSome(snapshot)) return snapshot.value;\n      const f = new Model.Formula(store.all);\n      snapshot = Option.some(f);\n      return f;\n    },\n    conclusion: (f) => {\n      if (depth > 8) throw new LimitExceeded('log:conclusion nested too deeply');\n      return closureOf(f, options, depth + 1).closure;\n    },\n  };\n  let result = Option.none<Result>();\n  loop((i) => {\n    const round = i + 1;\n    if (round > maxRounds) return false;\n    snapshot = Option.none();\n    const fresh: Array<Model.Statement> = [];\n    rules(new Model.Formula(store.all)).forEach((rule) => {\n      solve(store, rule.premise, noBindings, engine).forEach((b) => {\n        instantiate(rule, b).forEach((s) => {\n          if (!store.has(s)) fresh.push(s);\n        });\n      });\n    });\n    let added = 0;\n    fresh.forEach((s) => {\n      if (store.add(s)) {\n        inferred.push(s);\n        added++;\n      }\n    });\n    if (store.all.length > maxStatements) {\n      throw new LimitExceeded(`Closure exceeds ${maxStatements} statements`);\n    }\n    if (added > 0) return true;\n    result = Option.some({\n      closure: new Model.Formula(store.all),\n      inferred: new Model.Formula(inferred),\n      rounds: round,\n    });\n    return false;\n  });\n  if (Option.isSome(result)) return result.value;\n  throw new LimitExceeded(`No fixpoint after ${maxRounds} rounds`);\n};\n\n/**\n * Computes the deductive closure of a formula under its rules.\n *\n * @example\n * ```ts\n * import { Effect } from 'effect'\n * import { N3, Reasoner } from '@thomasfosterau/effect-rdf/n3'\n *\n * const program = Effect.gen(function* () {\n *   const doc = yield* N3.parse(`@prefix : <http://example.org/> .\n *     :socrates a :Man .\n *     { ?x a :Man } => { ?x a :Mortal } .`)\n *   const { inferred } = yield* Reasoner.reason(doc.formula)\n *   return N3.serializeDocument(inferred) // :socrates a :Mortal .\n * })\n * ```\n *\n * @since 0.1.0\n * @category reasoning\n */\nexport const reason = (\n  formula: Model.Formula | Model.Document,\n  options?: Options,\n): Effect.Effect<Result, ReasonerError> =>\n  Effect.sync(() => closureOf(Model.isFormula(formula) ? formula : formula.formula, options)).pipe(\n    Effect.catchDefect((e) =>\n      e instanceof Inconsistency\n        ? Effect.fail(new ReasonerError({ message: `Inconsistency derived by rule ${e.rule.key}` }))\n        : e instanceof LimitExceeded\n          ? Effect.fail(new ReasonerError({ message: e.message }))\n          : Effect.die(e),\n    ),\n    Effect.tap((result) => Effect.annotateCurrentSpan('n3.statements', result.closure.size)),\n    Effect.withSpan('Reasoner.reason', {\n      attributes: {\n        'n3.input.statements': (Model.isFormula(formula) ? formula : formula.formula).size,\n      },\n    }),\n  );\n\n/**\n * Answers a query: all bindings of the variables (and blank nodes) of\n * `pattern` under which every statement of `pattern` holds in `formula`\n * (builtins are evaluated).\n *\n * @since 0.1.0\n * @category reasoning\n */\nexport const query = (\n  formula: Model.Formula,\n  pattern: Model.Formula,\n): ReadonlyArray<ReadonlyMap<string, Model.N3Term>> => {\n  const store = new Store(formula.statements);\n  const blanks = topBlanks(pattern.statements);\n  const goals = pattern.statements.map((s) => statementBlanksToVariables(s, blanks));\n  return solve(store, goals, noBindings, {\n    builtins: true,\n    document: () => formula,\n    conclusion: (f) => closureOf(f).closure,\n  }).map((b) => {\n    const answer = MutableHashMap.empty<string, Model.N3Term>();\n    b.forEach((v, k) => {\n      if (!k.startsWith(BLANK_VAR)) MutableHashMap.set(answer, k, resolve(v, b));\n    });\n    return answer.backing;\n  });\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAwDA,MAAM,WAAmB,OAAO,KAAK;;AAGrC,MAAM,aAAa,OAAgC,OAAO,KAAK,EAAE;;AAGjE,MAAM,iBAAiB,MAA6B,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI;AAE/E,MAAM,OAAOA,QAAa,QAAQ,IAAI,OAAO;;AAG7C,MAAM,UAAU,MAA6BC,SAAe,CAAC;AAU7D,MAAM,UAAU;AAEhB,MAAM,SAAS,MAAwC;CACrD,IAAI,CAACC,UAAiB,CAAC,GAAG,OAAO,OAAO,KAAK;CAC7C,MAAM,IAAI,EAAE,MAAM,KAAK;CACvB,MAAM,KAAK,EAAE,SAAS;CACtB,KAAK,OAAO,IAAI,OAAO,SAAS,OAAO,IAAI,MAAM,UAAU,qBAAqB,KAAK,CAAC,GACpF,OAAO,OAAO,KAAK;EACjB,MAAM;EACN,OAAO,MAAM,QAAQ,MAAM,EAAE,WAAW,GAAG,IAAI,YAAY;CAC7D,CAAC;CAEH,IAAI,CAAC,QAAQ,KAAK,CAAC,GAAG,OAAO,OAAO,KAAK;CACzC,IAAIC,kBAAsB,EAAE,KAAM,OAAO,6CAAmB,aAAa,KAAK,CAAC,GAC7E,OAAO,OAAO,KAAK;EAAE,MAAM;EAAW,OAAO,OAAO,CAAC;CAAE,CAAC;CAE1D,IAAI,OAAO,IAAI,OAAO,SAAS,OAAO,IAAI,MAAM,SAAS,OAAO,KAAK,CAAC,GACpE,OAAO,OAAO,KAAK;EAAE,MAAM;EAAU,OAAO,OAAO,CAAC;CAAE,CAAC;CAEzD,IAAI,OAAO,IAAI,QAAQ,SAAS,OAAO,2CACrC,OAAO,OAAO,KAAK;EAAE,MAAM;EAAW,OAAO,OAAO,CAAC;CAAE,CAAC;CAE1D,OAAO,OAAO,KAAK;AACrB;AAEA,MAAM,YAAY,MAAoB,EAAE,SAAS,YAAY,OAAO,EAAE,KAAK,IAAI,EAAE;;AAGjF,MAAM,WAAW,MAAyB;CACxC,IAAI,EAAE,SAAS,WAAW,OAAOH,QAAa,EAAE,MAAM,SAAS,GAAG,IAAI,OAAO;CAC7E,IAAI,EAAE,SAAS,UAAU,OAAOA,QAAaI,gBAAoB,EAAE,KAAK,GAAG,IAAI,MAAM;CACrF,MAAM,IAAI,OAAO,OAAO,EAAE,MAAM,YAAY,EAAE,CAAC,CAAC;CAChD,OAAO,OAAO,SAAS,EAAE,KAAK,KAAK,CAAC,KAAK,KAAK,CAAC,IAC3CJ,QAAa,EAAE,SAAS,GAAG,IAAI,IAAI,GAAG,EAAE,KAAK,IAAI,OAAO,IACxDA,QAAaI,gBAAoB,EAAE,KAAK,GAAG,IAAI,MAAM;AAC3D;AAEA,MAAM,aAAa,GAAQ,MAAoB;CAC7C,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WAAW,OAAO,EAAE,UAAU,EAAE;CACvE,MAAM,IAAI,SAAS,CAAC;CACpB,MAAM,IAAI,SAAS,CAAC;CACpB,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO;CACvD,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,QAAQ,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AACrE;AAEA,MAAM,cAAc,OAClB,GAAG,MAAM,MAAM,EAAE,SAAS,QAAQ,IAC9B,WACA,GAAG,MAAM,MAAM,EAAE,SAAS,SAAS,IACjC,YACA;AAER,MAAM,aAAa,MACjBC,aAAmB,CAAC,IAAI,OAAO,IAAI,EAAE,MAAM,IAAI,KAAK,CAAC,IAAI,OAAO,KAAK;;AAGvE,MAAM,UACJ,QACA,OACA,GACA,QACW;CACX,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,UAAU,CAAC,CAAC;CAC7C,IAAI,OAAO,MAAM,GAAG;EAClB,MAAM,KAAK,MAAM,MAAM;EACvB,MAAM,KAAK,MAAM,MAAM,KAAK;EAC5B,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GACvC,OAAO,UAAU,UAAU,GAAG,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;CAE7D;CACA,OAAO,UAAU,IAAI,MAAM,QAAQ,MAAM,OAAO,CAAC,CAAC;AACpD;AAEA,MAAM,SAAS,MAA6B,OAAO,CAAC;AAEpD,MAAM,gBACH,GAA2C,QAAQ,QACnD,GAAG,GAAG,GAAG,QAAQ;CAChB,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;CACtB,MAAM,KAAK,UAAU,CAAC;CACtB,IAAI,OAAO,OAAO,EAAE,KAAM,SAAS,KAAK,GAAG,MAAM,WAAW,OAAQ,OAAO,UAAU,CAAC,CAAC;CACvF,MAAM,IAAI,EAAE,GAAG,KAAK;CACpB,OAAO,OAAO,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,OAAO,GAAG,OAAO,KAAK,QAAQ,EAAE,KAAK,CAAC,GAAG,GAAG,GAAG;AAC3F;AAEF,MAAM,iBACH,GAAoB,aACpB,GAAG,GAAG,GAAG,QAAQ;CAChB,IAAI,CAAC,MAAM,CAAC,GAAG;EACb,IAAI,YAAY,KAAA,KAAa,CAAC,MAAM,CAAC,GAAG,OAAO;EAC/C,MAAM,IAAI,MAAM,CAAC;EACjB,OAAO,UAAU,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,GAAG,QAAQ,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;CACrF;CACA,MAAM,IAAI,MAAM,CAAC;CACjB,OAAO,OAAO,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,OAAO,GAAG,OAAO,KAAK,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC,GAAG,GAAG,GAAG;AAC9F;AAEF,MAAM,QACH,OACA,OAAiB;CAAE,MAAM;CAAU,OAAO,EAAE,SAAS,CAAC,CAAC;AAAE;AAE5D,MAAM,cACH,UACA,GAAG,GAAG,MAAM;CACX,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,OAAO;CACnC,MAAM,KAAK,MAAM,CAAC;CAClB,MAAM,KAAK,MAAM,CAAC;CAClB,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG,OAAO,UAAU,CAAC,CAAC;CAC/D,MAAM,IAAI,GAAG;CACb,MAAM,IAAI,GAAG;CAEb,MAAM,IACJ,OAAO,MAAM,SAAS,CAAC,CAAC,KAAK,OAAO,MAAM,SAAS,CAAC,CAAC,IACjD,MACA,UAAU,GAAG,CAAC,IACZ,IACA,SAAS,CAAC,IAAI,SAAS,CAAC,IACtB,KACA;CACV,OAAO,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AACrC;;AAGF,MAAM,QAEF,KACA,MACA,OACA,YAED,OAAuC;CACtC,MAAM,OAAO,WAAW,EAAE;CAE1B,OAAO,OAAO,KACZ,SAAS,YACL;EAAE;EAAM,OAAO,GAAG,QAAQ,GAAG,MAAO,EAAE,SAAS,YAAY,IAAI,GAAG,EAAE,KAAK,IAAI,GAAI,IAAI;CAAE,IACvF;EAAE;EAAM,OAAO,GAAG,QAAQ,GAAG,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,GAAG,MAAM;CAAE,CACxE;AACF;AAEF,MAAM,MAAM,MACT,GAAG,MAAM,IAAI,GACd,KACC,GAAG,MAAM,IAAI,GACd,CACF;AAEA,MAAM,UAAU,MACb,GAAG,MAAM,IAAI,GACd,KACC,GAAG,MAAM,IAAI,GACd,CACF;AAEA,MAAM,kBAAyC,OAAO,KAAK;AAE3D,MAAM,UAEF,KACA,OACA,YAAY,WAEb,OAAuC;CAEtC,MAAM,CAAC,GAAG,KAAK;CACf,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW,OAAO,OAAO,KAAK;CAC3D,MAAM,OAAO,WAAW,EAAE;CAC1B,IAAI,UAAuB,SAAS,YAAY,YAAY;CAC5D,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,aAAa,CAAC,WAAW;EAC9D,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,KAAK;EAC9B,IAAI,OAAO,OAAO,CAAC,GAAG,OAAO,OAAO,KAAK;GAAE,MAAM;GAAW,OAAO,EAAE;EAAM,CAAC;EAC5E,UAAU;CACZ;CACA,MAAM,IAAI,MAAM,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;CACxC,IAAI,YAAY,YAAY,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,OAAO,KAAK;CACpE,OAAO,OAAO,KAAK;EAAE,MAAM;EAAS,OAAO;CAAE,CAAC;AAChD;AAEF,MAAM,eAAe;CACnB,KAAK,aAAa,GAAG;CACrB,SAAS,aAAa,OAAO;CAC7B,YAAY,aACV,QACG,GAAG,MAAM,OAAO,KAAK,IAAI,CAAC,IAC1B,GAAG,MAAM,IAAI,CAChB,GACA,CACF;CACA,UAAU,aACR,OAAO,YAAY,GAAG,MAAM,IAAI,GAAG,IAAI,GACvC,CACF;CACA,iBAAiB,cAAc,OAAO;EAEpC,MAAM,CAAC,GAAG,KAAK,GAAG,IAAI,QAAQ;EAC9B,OAAO,MAAM,KAAA,KAAa,MAAM,KAAA,KAAa,MAAM,IAC/C,OAAO,KAAK,IACZ,OAAO,KAAK;GAAE,MAAM;GAAW,OAAO,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC;EAAE,CAAC;CACvE,GAAG,CAAC;CACJ,WAAW,cAAc,OAAO;EAE9B,MAAM,CAAC,GAAG,KAAK;EACf,IAAI,GAAG,SAAS,aAAa,GAAG,SAAS,aAAa,EAAE,UAAU,IAAI,OAAO,OAAO,KAAK;EAEzF,OAAO,OAAO,KAAK;GAAE,MAAM;GAAW,QAAS,EAAE,QAAQ,EAAE,QAAS,EAAE,SAAS,EAAE;EAAM,CAAC;CAC1F,GAAG,CAAC;CACJ,gBAAgB,aACd,QACG,GAAG,MAAO,KAAK,KAAK,OAAO,KAAK,KAAK,CAAC,IAAI,OAAO,KAAK,IACtD,GAAG,MAAM,KAAK,CACjB,GACA,CACF;CACA,UAAU,eACP,MACC,EAAE,SAAS,YAAY;EAAE,MAAM,EAAE;EAAM,OAAO,CAAC,EAAE;CAAM,IAAI;EAAE,MAAM,EAAE;EAAM,OAAO,CAAC,EAAE;CAAM,IAC5F,MACC,EAAE,SAAS,YAAY;EAAE,MAAM,EAAE;EAAM,OAAO,CAAC,EAAE;CAAM,IAAI;EAAE,MAAM,EAAE;EAAM,OAAO,CAAC,EAAE;CAAM,CAC/F;CACA,eAAe,eAAe,MAC5B,EAAE,SAAS,YACP;EAAE,MAAM,EAAE;EAAM,OAAO,EAAE,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE;CAAM,IACzD;EAAE,MAAM,EAAE;EAAM,OAAO,KAAK,IAAI,EAAE,KAAK;CAAE,CAC/C;CACA,SAAS,eAAe,MACtB,EAAE,SAAS,YAAY,IAAI;EAAE,MAAM,EAAE;EAAM,OAAO,KAAK,MAAM,EAAE,KAAK;CAAE,CACxE;CACA,OAAO,eAAe,OAAO;EAAE,MAAM;EAAW,OAAO,OAAO,KAAK,MAAM,SAAS,CAAC,CAAC,CAAC;CAAE,EAAE;CACzF,SAAS,eAAe,OAAO;EAAE,MAAM;EAAW,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC;CAAE,EAAE;CAC1F,KAAK,cAAc,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,IAAI,CAAC;CAClD,KAAK,cAAc,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,IAAI,CAAC;CAClD,KAAK,cAAc,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,IAAI,CAAC;CAClD,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,GAAG,CAAC;CACnD,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,GAAG,CAAC;CACnD,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,GAAG,CAAC;CACnD,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CACrD,MAAM,cAAc,KAAK,KAAK,IAAI,CAAC;CACnC,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CACrD,SAAS,cACP,MAAM,MAAO,IAAI,MAAO,KAAK,EAAE,GAC/B,MAAM,MAAO,IAAI,KAAK,KAAM,GAAG,CACjC;CACA,aAAa,YAAY,MAAM,IAAI,CAAC;CACpC,UAAU,YAAY,MAAM,IAAI,CAAC;CACjC,gBAAgB,YAAY,MAAM,KAAK,CAAC;CACxC,aAAa,YAAY,MAAM,KAAK,CAAC;CACrC,SAAS,YAAY,MAAM,MAAM,CAAC;CAClC,YAAY,YAAY,MAAM,EAAE,MAAM,EAAE;AAC1C;;AAOA,MAAM,iBAAiB,MAA4B;CACjD,MAAM,KAAK,EAAE,SAAS;CACtB,IAAI,OAAO,IAAI,QAAQ,OAAO,OAAO,EAAE,UAAU,OAAO,EAAE,UAAU,SAAS,SAAS;CACtF,IAAI,OAAO,6CAAmBC,kBAAsB,EAAE,GAAG;EACvD,MAAM,MAAM,MAAM,CAAC;EACnB,IAAI,OAAO,OAAO,GAAG,GAAG;GACtB,MAAM,IAAI,IAAI;GACd,IAAI,EAAE,SAAS,WAAW,OAAO,EAAE,MAAM,SAAS;GAClD,IAAI,OAAO,MAAM,EAAE,KAAK,GAAG,OAAO;GAClC,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG,OAAO,EAAE,QAAQ,IAAI,QAAQ;GAC5D,OAAO,OAAO,EAAE,KAAK;EACvB;CACF;CACA,OAAO,EAAE;AACX;;AAGA,MAAM,OAAO,MACXJ,UAAiB,CAAC,IACd,OAAO,KAAK,cAAc,CAAC,CAAC,IAC5BK,YAAmB,CAAC,IAClB,OAAO,KAAK,EAAE,KAAK,IACnB,OAAO,KAAK;AAEpB,MAAM,cACH,UACA,GAAG,GAAG,MAAM;CACX,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,OAAO;CACnC,MAAM,IAAI,IAAI,CAAC;CACf,MAAM,IAAI,IAAI,CAAC;CACf,OAAO,UAAU,OAAO,OAAO,CAAC,KAAK,OAAO,OAAO,CAAC,KAAK,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5F;AAEF,MAAM,aAAa,MACjBF,aAAmB,CAAC,IAAI,OAAO,IAAI,EAAE,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,KAAK;AAErE,MAAM,kBACH,OACA,GAAG,GAAG,GAAG,QAAQ;CAChB,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;CACtB,MAAM,IAAI,OAAO,QAAQ,UAAU,CAAC,GAAG,CAAC;CACxC,OAAO,UAAU,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,MAAM,GAAGL,QAAa,EAAE,KAAK,GAAG,CAAC,CAAC;AACjF;AAEF,MAAM,SAAS,SAAiB,QAAQ,OACtC,OAAO,WAAW,OAAO,UAAU,IAAI,OAAO,SAAS,KAAK,CAAC,CAAC;AAEhE,MAAM,iBAAiB;CACrB,eAAe,gBAAgB,SAAS,OAAO,KAAK,KAAK,KAAK,EAAE,CAAC,CAAC;CAClE,UAAU,YAAY,GAAG,MAAM,EAAE,SAAS,CAAC,CAAC;CAC5C,sBAAsB,YAAY,GAAG,MAAM,EAAE,YAAY,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;CACpF,YAAY,YAAY,GAAG,MAAM,EAAE,WAAW,CAAC,CAAC;CAChD,UAAU,YAAY,GAAG,MAAM,EAAE,SAAS,CAAC,CAAC;CAC5C,mBAAmB,YAAY,GAAG,MAAM,EAAE,YAAY,MAAM,EAAE,YAAY,CAAC;CAC3E,sBAAsB,YAAY,GAAG,MAAM,EAAE,YAAY,MAAM,EAAE,YAAY,CAAC;CAC9E,aAAa,YAAY,GAAG,MAAM,IAAI,CAAC;CACvC,UAAU,YAAY,GAAG,MAAM,IAAI,CAAC;CACpC,gBAAgB,YAAY,GAAG,MAAM,KAAK,CAAC;CAC3C,aAAa,YAAY,GAAG,MAAM,KAAK,CAAC;CACxC,SAAS,YAAY,GAAG,MAAM,OAAO,OAAO,MAAM,CAAC,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC;CACzE,YAAY,YACT,GAAG,MAAM,CAAC,OAAO,MAAM,MAAM,CAAC,GAAG;EAAE,cAAc;EAAM,SAAS,OAAO,GAAG,KAAK,CAAC;CAAE,CAAC,CACtF;CACA,SAAS,gBAAgB,CAAC,GAAG,GAAG,OAAO;EACrC,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW,OAAO,OAAO,KAAK;EAC9E,OAAO,OAAO,IAAI,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,QAAQ,IAAI,EAAE,QAAQ,WAAW,MAAM,CAAC,CAAC;CACtF,CAAC;CACD,QAAQ,gBAAgB,CAAC,GAAG,OAAO;EACjC,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW,OAAO,OAAO,KAAK;EAC3D,OAAO,OAAO,QAAQ,MAAM,CAAC,IAAI,OAAO,OAAO,gBAAgB,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;CACjF,CAAC;CACD,QAAQ,gBAAgB,CAAC,KAAK,GAAG,UAAU;EACzC,IAAI,QAAQ,KAAA,GAAW,OAAO,OAAO,KAAK;EAC1C,IAAI,IAAI;EACR,OAAO,OAAO,KAAK,IAAI,QAAQ,aAAa,KAAK,QAAQ,EAAE,CAAC;CAC9D,CAAC;AACH;;AAOA,MAAM,UAAU,MAA0E;CACxF,IAAI,CAACK,aAAmB,CAAC,GAAG,OAAO,OAAO,KAAK;CAC/C,MAAM,CAAC,GAAG,KAAK,EAAE;CACjB,OAAO,EAAE,MAAM,WAAW,KAAK,MAAM,KAAA,KAAa,MAAM,KAAA,IACpD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAClB,OAAO,KAAK;AAClB;;AAGA,MAAM,YACJ,MACuE;CACvE,IAAI,CAACA,aAAmB,CAAC,GAAG,OAAO,OAAO,KAAK;CAC/C,MAAM,CAAC,GAAG,GAAG,KAAK,EAAE;CACpB,OAAO,EAAE,MAAM,WAAW,KAAK,MAAM,KAAA,KAAa,MAAM,KAAA,KAAa,MAAM,KAAA,IACvE,OAAO,KAAK;EAAC;EAAG;EAAG;CAAC,CAAC,IACrB,OAAO,KAAK;AAClB;AAEA,MAAM,oBAAqC,CAAC;AAE5C,MAAM,kBAAkB,MAA4BL,QAAa,OAAO,CAAC,GAAG,IAAI,OAAO;AAEvF,MAAM,eAAe;CACnB,KAAK,GAAG,GAAG,GAAG,QAAQ;EACpB,IAAI,CAACK,aAAmB,CAAC,GAAG,OAAO,cAAc,CAAC;EAClD,OAAO,UAAU,EAAE,MAAM,SAAS,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;CACnE;CACA,SAAS,GAAG,GAAG,GAAG,QAAQ;EACxB,IAAI,CAACA,aAAmB,CAAC,GAAG,OAAO,cAAc,CAAC;EAClD,OAAO,UAAU,EAAE,MAAM,SAAS,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;CACnE;CACA,SAAS,GAAG,GAAG,GAAG,QAChB,CAACA,aAAmB,CAAC,IACjB,cAAc,CAAC,IACf,OAAO,GAAG,OAAO,KAAK,eAAe,EAAE,MAAM,MAAM,CAAC,GAAG,GAAG,GAAG;CACnE,QAAQ,GAAG,GAAG,GAAG,QACf,CAACA,aAAmB,CAAC,IACjB,cAAc,CAAC,IACf,OAAO,GAAG,OAAO,gBAAgB,EAAE,MAAM,EAAE,GAAG,GAAG,GAAG;CAC1D,OAAO,GAAG,GAAG,GAAG,QACd,CAACA,aAAmB,CAAC,IACjB,cAAc,CAAC,IACf,OAAO,GAAG,OAAO,gBAAgB,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG;CAC9D,OAAO,GAAG,GAAG,GAAG,QACd,CAACA,aAAmB,CAAC,KAAK,IAAI,qBAAqB,EAAE,KAAK,IACtD,cAAc,CAAC,IACf,UAAU,IAAI,MAAM,GAAG,IAAIG,WAAiB,EAAE,MAAM,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;CACvE,SAAS,GAAG,GAAG,GAAG,QAAQ;EACxB,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;EACtB,IAAI,CAACH,aAAmB,CAAC,KAAK,CAAC,EAAE,MAAM,MAAMA,YAAkB,GAAG,OAAO,UAAU,CAAC,CAAC;EACrF,OAAO,UACL,IAAI,MACF,GACA,IAAIG,WAAiB,EAAE,MAAM,SAAS,MAAOH,aAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAE,CAAC,GACnF,CACF,CACF;CACF;CACA,UAAU,GAAG,GAAG,GAAG,QAAQ;EACzB,IAAI,CAACA,aAAmB,CAAC,GAAG,OAAO,cAAc,CAAC;EAClD,OAAO,UACL,EAAE,MAAM,SAAS,MAAM,MACrB,IAAI,MAAM,GAAG,IAAIG,WAAiB,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CACjE,CACF;CACF;CACA,WAAW,GAAG,GAAG,GAAG,QAAQ;EAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;EACtB,MAAM,QAAQ,OAAO,QAAQ,OAAO,CAAC,IAAI,CAAC,GAAG,SAC3CH,aAAmB,CAAC,IAChB,OAAO,IAAI,MAAM,GAAG,IAAI,MAAM,OAAO,gBAAgB,EAAE,MAAM,SAAS,CAAC,EAAE,CAAC,IAC1E,OAAO,KAAK,CAClB;EACA,OAAO,OAAO,OAAO,KAAK,IAAI,UAAU,CAAC,CAAC,IAAI,OAAO,GAAG,MAAM,OAAO,GAAG,GAAG;CAC7E;CACA,SAAS,GAAG,GAAG,GAAG,QAAQ;EACxB,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;EACtB,OAAO,UACL,OAAO,MAAM,OAAO,CAAC,GAAG;GACtB,QAAQ;GACR,SAAS,CAAC,GAAG,OACXA,aAAmB,CAAC,IAChB,IAAI,MAAM,GAAG,IAAIG,WAAiB,EAAE,MAAM,QAAQ,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,IAC5E,CAAC;EACT,CAAC,CACH;CACF;AACF;AAMA,MAAM,WAAW,GAAiB,QAChCC,UAAgB,CAAC,IACb,OAAO,KAAK,CAAC,IACbP,UAAiB,CAAC,KAAK,EAAE,QAAQ,KAAK,MACpC,OAAO,KAAKQ,YAAkB,IAC9BC,YAAmB,CAAC,IAClB,OAAO,KAAK,IAAI,SAAS,CAAC,IAC1B,OAAO,KAAK;AAEtB,MAAMC,YAA0C,CAAC;AAEjD,MAAMC,aAAW,MACfJ,UAAgB,CAAC,IACb,OAAO,KAAK,EAAE,UAAU,IACxB,EAAE,QAAQ,KAAK,MACb,OAAO,KAAKG,SAAO,IACnB,OAAO,KAAK;;;;;;;AAQpB,MAAM,YACJ,GACA,GACA,GACA,KACA,WACW;CACX,MAAM,QAAQ,QAAQ,GAAG,GAAG;CAC5B,MAAM,QAAQC,UAAQ,CAAC;CACvB,IAAI,OAAO,OAAO,KAAK,KAAK,OAAO,OAAO,KAAK,GAAG,OAAO,cAAc,CAAC;CACxE,OAAO,UAAU,OAAO,IAAI,MAAM,MAAM,OAAO,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC;AACxE;AAEA,MAAM,cAAc;CAClB,UAAU,GAAG,GAAG,GAAG,QAAQ,UAAU,IAAI,MAAM,GAAG,GAAG,CAAC,CAAC;CACvD,aAAa,GAAG,GAAG,MACjB,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,WAAW,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;CAC1E,WAAW,GAAG,GAAG,GAAG,QAAQ,SAAS,GAAG,GAAG,GAAG,MAAM,UAAU,KAAK;CACnE,cAAc,GAAG,GAAG,GAAG,QACrB,SAAS,GAAG,GAAG,GAAG,MAAM,UAAW,IAAI,qBAAqB,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAE;CAChF,cAAc,GAAG,GAAG,GAAG,QAAQ;EAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;EACtB,IAAI,CAACR,aAAmB,CAAC,GAAG,OAAO,UAAU,CAAC,CAAC;EAC/C,MAAM,QAAQ,OAAO,IAAI,EAAE,MAAM,IAAIQ,SAAO,CAAC;EAC7C,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,UAAU,CAAC,CAAC;EAC7C,OAAO,UAAU,IAAI,MAAM,GAAG,IAAIC,QAAc,MAAM,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;CACzE;CACA,aAAa,GAAG,GAAG,GAAG,QAAQ;EAC5B,MAAM,IAAI,EAAE,QAAQ,KAAK,MAAMJ,eAAqB;EACpD,IAAI,CAACD,UAAgB,CAAC,GAAG,OAAO,cAAc,CAAC;EAC/C,OAAO,UAAU,IAAI,MAAM,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;CACrD;CACA,MAAM,GAAG,GAAG,GAAG,QAAQ;EACrB,IAAIF,YAAmB,CAAC,GAAG,OAAO,UAAU,IAAI,MAAM,GAAGP,QAAa,EAAE,KAAK,GAAG,CAAC,CAAC;EAClF,IAAIE,UAAiB,CAAC,GAAG,OAAO,UAAU,IAAI,MAAM,GAAGa,UAAe,EAAE,KAAK,GAAG,CAAC,CAAC;EAClF,OAAO,cAAc,CAAC;CACxB;CACA,QAAQ,GAAG,GAAG,GAAG,QAAQ;EACvB,MAAM,OAAO,OAAO,CAAC;EACrB,IAAI,OAAO,OAAO,IAAI,KAAK,MAAM,CAAC,GAAG;GACnC,MAAM,CAAC,KAAK,MAAM,KAAK;GACvB,IAAI,CAACb,UAAiB,GAAG,KAAK,CAACK,YAAmB,EAAE,GAAG,OAAO,UAAU,CAAC,CAAC;GAC1E,OAAO,UAAU,IAAI,MAAM,GAAGP,QAAa,IAAI,OAAO,EAAE,GAAG,CAAC,CAAC;EAC/D;EACA,IAAIE,UAAiB,CAAC,GACpB,OAAO,UAAU,IAAI,MAAM,GAAG,IAAIM,WAAiB,CAACR,QAAa,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;EAE7F,OAAO;CACT;CACA,UAAU,GAAG,GAAG,GAAG,QAAQ;EACzB,MAAM,OAAO,OAAO,CAAC;EACrB,IAAI,OAAO,OAAO,IAAI,KAAK,MAAM,CAAC,GAAG;GACnC,MAAM,CAAC,KAAK,QAAQ,KAAK;GACzB,IAAI,CAACE,UAAiB,GAAG,KAAK,CAACA,UAAiB,IAAI,GAAG,OAAO,UAAU,CAAC,CAAC;GAC1E,OAAO,UAAU,IAAI,MAAM,GAAGF,QAAa,IAAI,OAAO,KAAK,KAAK,GAAG,CAAC,CAAC;EACvE;EACA,IAAIE,UAAiB,CAAC,KAAK,EAAE,aAAa,IACxC,OAAO,UACL,IAAI,MAAM,GAAG,IAAIM,WAAiB,CAACR,QAAa,EAAE,KAAK,GAAGA,QAAa,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CACzF;EAEF,OAAO;CACT;CACA,UAAU,GAAG,GAAG,GAAG,QAAQ;EACzB,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;EACtB,MAAM,OAAOS,UAAgB,CAAC,IAC1B,IAAI,UACJP,UAAiB,CAAC,IAChB,IAAI,UACJG,aAAmB,CAAC,IAClB,IAAI,OACJ,IAAI;EACZ,OAAO,UAAU,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC;CACxC;CACA,eAAe,GAAG,GAAG,GAAG,QACtB,UACE,OAAO,MACL,OAAO,QAAQ,SAAS,CAAC,IAAI,CAAC,UAAU,OAAO,YAC7C,OAAO,IAAI,OAAO,IAAI,CAAC,QAAQ,GAAG,GAAG,GAAGQ,UAAQ,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,YAAY;EAC7E;EACA;EACA;EACA;CACF,EAAE,CACJ,GACA;EACE,QAAQ;EACR,SAAS,EAAE,UAAU,QAAQ,OAAO,YAAY;GAC9C,MAAM,SAAS,IACZ,MAAM,OAAO,OAAO,GAAG,IAAI,CAAC,CAC5B,KAAK,QAAQG,WAAiB,UAAU,GAAG,CAAC;GAC/C,OAAO,IAAI,MAAM,QAAQ,IAAIR,WAAiB,MAAM,GAAG,CAAC;EAC1D;CACF,CACF,CACF;CACF,WAAW,GAAG,GAAG,GAAG,QAClB,UACE,OAAO,MACL,OAAO,QAAQ,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO;EACpC,MAAM,QAAQK,UAAQ,CAAC;EACvB,MAAM,OAAOA,UAAQ,CAAC;EACtB,OAAO,OAAO,IAAI;GAAC,QAAQ,GAAG,GAAG;GAAG;GAAO;EAAI,CAAC;CAClD,CAAC,GACD;EACE,QAAQ;EACR,SAAS,CAAC,OAAO,OAAO,UACtB,IACG,MAAM,OAAO,OAAO,GAAG,IAAI,CAAC,CAC5B,OAAO,QAAQ,IAAI,wBAAwB,IAAI,MAAM,OAAO,MAAM,KAAK,IAAI,CAAC,CAAC,IAC5E,CAAC,CAAC,IACF,CAAC;CACT,CACF,CACF;AACJ;AAEA,MAAM,QAAQ,eAAe,MAAuB;AAOpD;CALE,CAAC,KAAK,MAAM,YAAY;CACxB,CAAC,OAAO,MAAM,cAAc;CAC5B,CAAC,KAAK,MAAM,YAAY;CACxB,CAAC,IAAI,MAAM,WAAW;AAEf,CAAC,CAAC,SAAS,CAAC,IAAI,cAAc;CACrC,OAAO,UAAU,QAAQ,CAAC,CAAC,SAAS,CAAC,MAAM,OAAO,eAAe,IAAI,OAAO,KAAK,MAAM,CAAC,CAAC;AAC3F,CAAC;;AAGD,MAAa,cAAc,cACzBN,YAAmB,SAAS,IAAI,eAAe,IAAI,OAAO,UAAU,KAAK,IAAI,OAAO,KAAK;AAGzC,IAAI,aAAa,eAAe,KAAK,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1mB7F,IAAa,gBAAb,cAAmC,OAAO,YAA2B,CAAC,CAAC,mBAAmB,EACxF,SAAS,OAAO,OAClB,CAAC,CAAC,CAAC,CAAC;AA2CJ,MAAM,WAAWU,QAAa,QAAQ,IAAI,OAAO,CAAC,CAAC;AACnD,MAAM,YAAYA,QAAa,SAAS,IAAI,OAAO,CAAC,CAAC;AAErD,MAAM,UAA0C,CAAC;AAEjD,MAAM,WAAW,MACfC,UAAgB,CAAC,IACb,OAAO,KAAK,EAAE,UAAU,IACxB,EAAE,QAAQ,WACR,OAAO,KAAK,OAAO,IACnB,OAAO,KAAK;;AAGpB,MAAM,YAAY;;AAGlB,MAAM,aACJ,eAC0C;CAC1C,MAAM,MAAM,eAAe,MAAc;CACzC,MAAM,MAAM,MAAoB;EAC9B,IAAIC,YAAmB,CAAC,GAAG,eAAe,IAAI,KAAK,EAAE,KAAK;OACrD,IAAIC,aAAmB,CAAC,GAAG,EAAE,MAAM,QAAQ,EAAE;CACpD;CACA,WAAW,SAAS,MAAM;EACxB,GAAG,EAAE,OAAO;EACZ,GAAG,EAAE,SAAS;EACd,GAAG,EAAE,MAAM;CACb,CAAC;CACD,OAAO;AACT;;AAGA,MAAM,qBACJ,GACA,WAEAD,YAAmB,CAAC,KAAK,eAAe,IAAI,QAAQ,EAAE,KAAK,IACvD,IAAIE,SAAc,YAAY,EAAE,KAAK,IACrCD,aAAmB,CAAC,IAClB,IAAIE,WAAiB,EAAE,MAAM,KAAK,MAAM,kBAAkB,GAAG,MAAM,CAAC,CAAC,IACrE;AAER,MAAM,8BACJ,GACA,WAEA,IAAIC,UACF,kBAAkB,EAAE,SAAS,MAAM,GACnC,kBAAkB,EAAE,WAAW,MAAM,GACrC,kBAAkB,EAAE,QAAQ,MAAM,CACpC;;;;;;;;AASF,MAAa,SAAS,YACpB,IAAI,SACF,QAAQ,WAAW,KAAK,MAA2B;CACjD,IAAI,CAACC,YAAmB,EAAE,SAAS,GAAG,OAAO,OAAO,KAAK;CACzD,MAAM,UAAU,EAAE,UAAU,UAAU,IAAI,QAAQ;CAClD,MAAM,WAAW,EAAE,UAAU,UAAU,IAAI,YAAY;CACvD,IAAI,CAAC,WAAW,CAAC,UAAU,OAAO,OAAO,KAAK;CAC9C,MAAM,cAAc,UAAU,EAAE,UAAU,EAAE;CAC5C,MAAM,aAAa,UAAU,EAAE,SAAS,EAAE;CAC1C,OAAO,OAAO,IAAI,QAAQ,WAAW,IAAI,YAAkB;EAEzD,MAAM,SAAS,UAAU,OAAO;EAChC,OAAO;GACL,SAAS,QAAQ,KAAK,MAAM,2BAA2B,GAAG,MAAM,CAAC;GACjE,YAAYN,UAAgB,UAAU,IAClC,IAAIO,QACF,WAAW,WAAW,KAAK,MAAM,2BAA2B,GAAG,MAAM,CAAC,CACxE,IACA;GACJ,QAAQ;EACV;CACF,CAAC;AACH,CAAC,CACH;;AASF,MAAM,aAAuB,eAAe,MAA4B,CAAC,CAAC;;AAG1E,MAAM,UAAU,GAAa,MAAc,UAAkC;CAC3E,MAAM,OAAO,eAAe,aAAa,CAAC;CAC1C,eAAe,IAAI,MAAM,MAAM,KAAK;CACpC,OAAO,KAAK;AACd;AAEA,MAAM,eAA+C,CAAC;AAEtD,IAAM,QAAN,MAAY;CACV,MAAuC,CAAC;CACxC,OAAgB,eAAe,MAAc;CAC7C,cAAuB,eAAe,MAAsC;CAC5E,YAAY,aAAwC,CAAC,GAAG;EACtD,IAAI,aAAa,UAAU,CAAC,CAAC,SAAS,MAAM,KAAK,IAAI,CAAC,CAAC;CACzD;CACA,IAAI,GAA6B;EAC/B,OAAO,eAAe,IAAI,KAAK,MAAM,EAAE,GAAG;CAC5C;CACA,IAAI,GAA6B;EAC/B,IAAI,KAAK,IAAI,CAAC,GAAG,OAAO;EACxB,eAAe,IAAI,KAAK,MAAM,EAAE,GAAG;EACnC,KAAK,IAAI,KAAK,CAAC;EACf,MAAM,IAAI,EAAE,UAAU;EACtB,MAAM,IAAI,KAAK,YAAY,QAAQ,IAAI,CAAC;EACxC,IAAI,MAAM,KAAA,GAAW,eAAe,IAAI,KAAK,aAAa,GAAG,CAAC,CAAC,CAAC;OAC3D,EAAE,KAAK,CAAC;EACb,OAAO;CACT;;CAEA,cAAc,KAA6C;EACzD,OAAO,KAAK,YAAY,QAAQ,IAAI,GAAG,KAAK;CAC9C;AACF;;AAGA,MAAM,QAAQ,GAAiB,MAA8B;CAC3D,IAAI,CAACC,WAAkB,CAAC,GAAG,OAAO;CAClC,MAAM,OAAO,EAAE,IAAI,EAAE,KAAK;CAC1B,OAAO,SAAS,KAAA,IAAY,IAAI,KAAK,MAAM,CAAC;AAC9C;AAEA,MAAM,WAAW,GAAiB,MAChC,EAAE,SAAS,IAAI,IAAIC,WAAiB,GAAG,CAAC;AAE1C,MAAM,SAAS,SAAuB,MAAoB,MAAiC;CACzF,MAAM,IAAI,KAAK,SAAS,CAAC;CACzB,IAAID,WAAkB,CAAC,GAAG;EACxB,IAAIA,WAAkB,IAAI,KAAK,KAAK,UAAU,EAAE,OAAO,OAAO,CAAC,CAAC;EAChE,OAAO,CAAC,OAAO,GAAG,EAAE,OAAO,IAAI,CAAC;CAClC;CACA,MAAM,IAAIA,WAAkB,IAAI,IAAI,KAAK,MAAM,CAAC,IAAI;CACpD,IAAI,aAAaJ,YAAkB;EACjC,IAAI,EAAE,aAAaA,eAAqB,EAAE,MAAM,WAAW,EAAE,MAAM,QAAQ,OAAO,CAAC;EACnF,OAAO,EAAE,MAAM,QACZ,SAAS,MAAM,MAAM;GACpB,MAAM,QAAQ,EAAE,MAAM;GACtB,OAAO,UAAU,KAAA,IAAY,CAAC,IAAI,QAAQ,SAAS,MAAM,MAAM,MAAM,OAAO,CAAC,CAAC;EAChF,GACA,CAAC,CAAC,CACJ;CACF;CACA,IAAI,aAAaG,SAAe;EAC9B,IAAI,EAAE,aAAaA,YAAkB,EAAE,WAAW,WAAW,EAAE,WAAW,QAAQ,OAAO,CAAC;EAC1F,IAAIG,SAAe,CAAC,GAAG,OAAO,EAAE,QAAQ,EAAE,OAAOC,WAAuB,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EACvF,OAAO,aAAa,EAAE,YAAY,EAAE,YAAY,CAAC;CACnD;CACA,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC;AAClC;;AAGA,MAAM,gBACJ,UACA,QACA,MACoB;CACpB,MAAM,MAAuB,CAAC;CAC9B,MAAM,OAAO,IAAI,WAAW,OAAO,MAAM;CACzC,MAAM,MAAM,GAAW,QAAkB;EACvC,MAAM,IAAI,SAAS;EACnB,IAAI,MAAM,KAAA,GAAW;GACnB,IAAI,KAAK,GAAG;GACZ;EACF;EACA,OAAO,SAAS,GAAG,MAAM;GACvB,IAAI,KAAK,OAAO,GAAG;GACnB,KAAK,KAAK;GACV,eAAe,GAAG,GAAG,GAAG,CAAC,CAAC,SAAS,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;GACrD,KAAK,KAAK;EACZ,CAAC;CACH;CACA,GAAG,GAAG,CAAC;CACP,OAAO;AACT;AAEA,MAAM,kBAAkB,GAAoB,GAAoB,MAC9D,MAAM,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAC/B,SAAS,MAAM,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAC9C,SAAS,MAAM,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAQhD,MAAM,SACJ,OACA,OACA,GACA,WACoB;CACpB,MAAM,MAAuB,CAAC;CAC9B,MAAM,MAAwB;EAC5B;EACA,QAAQ,OAAO,YAAY,UAAU,aAAa;GAChD,MAAM,SAAS,UAAU,UAAU;GACnC,OAAO,MACL,IAAI,MAAM,MAAM,UAAU,GAC1B,WAAW,KAAK,MAAM,2BAA2B,GAAG,MAAM,CAAC,GAC3D,UACA;IAAE,GAAG;IAAQ,UAAU,OAAO,YAAY;GAAS,CACrD;EACF;EACA,UAAU,OAAO;EACjB,YAAY,OAAO;CACrB;CACA,MAAM,MAAM,WAA2C,KAAe,aAAqB;EACzF,IAAI,CAAC,IAAI,wBAAwB,SAAS,GAAG;GAC3C,IAAI,KAAK,GAAG;GACZ;EACF;EACA,MAAM,CAAC,MAAM,GAAG,QAAQ;EACxB,MAAM,UAAU,OAAO,WACnBC,WAAoB,KAAK,KAAK,WAAW,GAAG,CAAC,IAC7C,OAAO,KAAuB;EAClC,IAAI,OAAO,OAAO,OAAO,GAAG;GAC1B,MAAM,UAAU,QAAQ,MACtB,QAAQ,KAAK,SAAS,GAAG,GACzB,QAAQ,KAAK,QAAQ,GAAG,GACxB,KACA,GACF;GACA,IAAI,OAAO,OAAO,OAAO,GAAG;IAE1B,IAAI,WAAW,UAAU,QAAQ,GAAG,CAAC,GAAG,MAAM,IAAI,GAAG,KAAK,WAAW,CAAC;IACtE;GACF;GACA,QAAQ,MAAM,SAAS,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;GAC3C;EACF;EACA,MAAM,YAAY,KAAK,KAAK,WAAW,GAAG;EAC1C,MAAM,UAAU,KAAK,KAAK,SAAS,GAAG;EACtC,MAAM,gBAAgB,UAAU,QAAQ,IAAI,MAAM,OAAO,UAAU,QAAQ,IAAI,KAAK;EACpF,IAAI,iBAAiBJ,WAAkB,OAAO,KAAK,WAAW,UAAU,QAAQ;GAE9E,GAAG,CAAC,GAAG,MAAM,IAAI,GAAG,KAAK,WAAW,CAAC;GACrC;EACF;EACA,IACE,iBACA,mBAAmBJ,cACnB,IAAI,wBAAwB,QAAQ,KAAK,GACzC;GAEA,MAAM,QACJ,UAAU,QAAQ,IAAI,MAAM,MACxB,QAAQ,MAAM,KACd,QAAQ,MAAM,WAAW,IACvB,IAAI,MACJ,IAAIA,WAAiB,QAAQ,MAAM,MAAM,CAAC,CAAC;GACnD,MAAM,KAAK,QAAQ,OAAO,GAAG,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;GAC5D;EACF;EAIA,CAHmBI,WAAkB,SAAS,IAC1C,MAAM,MACN,MAAM,cAAc,UAAU,GAAG,EAAA,CAC1B,SAAS,MAAM;GACxB,eAAe,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;EAC5D,CAAC;CACH;CACA,GAAG,OAAO,GAAG,CAAC;CACd,OAAO;AACT;AAMA,MAAM,QAAQ,MAAsB;CAClC,IAAI,KAAK;CACT,IAAI,KAAK;CACT,MAAM,MAAM;EACV,IAAI,KAAK,EAAE,QAAQ,OAAO;EAC1B,MAAM,IAAI,EAAE,WAAW,CAAC;EACxB,KAAK,KAAK,KAAK,KAAK,GAAG,QAAU;EACjC,KAAK,KAAK,KAAK,KAAK,GAAG,UAAU;EACjC,OAAO;CACT,CAAC;CACD,QAAQ,OAAO,EAAA,CAAG,SAAS,EAAE,KAAK,OAAO,EAAA,CAAG,SAAS,EAAE;AACzD;AAEA,IAAM,gBAAN,MAAoB;CAClB;CACA,YAAY,MAAuB;EACjC,KAAK,OAAO;CACd;AACF;AAEA,MAAM,eAAe,MAAY,MAAgD;CAC/E,MAAM,aAAa,KAAK,KAAK,YAAY,CAAC;CAC1C,IAAI,WAAW,QAAQ,WAAW,MAAM,IAAI,cAAc,KAAK,MAAM;CAErE,IAAI,eAAe,KAAK,YACtB,OAAO,OAAO,UAAU,QAAQ,QAAQ,YAAY,CAAC,CAAC,SAAS,OAAO;CAExE,MAAM,QAAQ,QAAQ,UAAU;CAChC,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO;CAEjC,MAAM,OAAO,eAAe,aAAaK,UAAgB,UAAU,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK,CAAC;CACxF,MAAM,UAAU,IAAI,aAAa,CAAC,CAAC,CAChC,QAAQ,CAAC,OAAO,eAAe,IAAI,MAAM,CAAC,CAAC,CAAC,CAC5C,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,KAAK;CAC9C,MAAM,YAAY,IAAI,KAAK,SAAS,MAAM,MAAM,CAAC,CAAC,KAAK,GAAG;CAC1D,MAAM,QAAQ,eAAe,MAA8B;CAC3D,MAAM,UAAU,UAAkC;EAChD,MAAM,QAAQ,MAAM,QAAQ,IAAI,KAAK;EACrC,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,MAAM,OAAO,IAAIC,UAAe,KAAK,KAAK,GAAG,KAAK,OAAO,IAAI,GAAG,UAAU,GAAG,OAAO,GAAG;EACvF,eAAe,IAAI,OAAO,OAAO,IAAI;EACrC,OAAO;CACT;CAGA,MAAM,OAAO,MACXb,YAAmB,CAAC,IAChB,OAAO,EAAE,KAAK,IACdC,aAAmB,CAAC,IAClB,IAAIE,WAAiB,EAAE,MAAM,IAAI,GAAG,CAAC,IACrC;CACR,OAAO,MAAM,MAAM,KAChB,MACC,IAAIC,UACF,QAAQ,IAAI,EAAE,OAAO,GAAG,CAAC,GACzB,QAAQ,IAAI,EAAE,SAAS,GAAG,CAAC,GAC3B,QAAQ,IAAI,EAAE,MAAM,GAAG,CAAC,CAC1B,CACJ;AACF;AAEA,IAAM,gBAAN,MAAoB;CAClB;CACA,YAAY,SAAiB;EAC3B,KAAK,UAAU;CACjB;AACF;;AAGA,MAAM,aAAa,OAAsB,SAAmB,QAAQ,MAAc;CAChF,MAAM,YAAY,SAAS,aAAa;CACxC,MAAM,gBAAgB,SAAS,iBAAiB;CAChD,MAAM,QAAQ,IAAI,MAAM,MAAM,UAAU;CACxC,MAAM,WAAmC,CAAC;CAE1C,IAAI,WAAW,OAAO,KAAoB;CAC1C,MAAM,SAAiB;EACrB,UAAU,SAAS,YAAY;EAC/B,gBAAgB;GACd,IAAI,OAAO,OAAO,QAAQ,GAAG,OAAO,SAAS;GAC7C,MAAM,IAAI,IAAIE,QAAc,MAAM,GAAG;GACrC,WAAW,OAAO,KAAK,CAAC;GACxB,OAAO;EACT;EACA,aAAa,MAAM;GACjB,IAAI,QAAQ,GAAG,MAAM,IAAI,cAAc,kCAAkC;GACzE,OAAO,UAAU,GAAG,SAAS,QAAQ,CAAC,CAAC,CAAC;EAC1C;CACF;CACA,IAAI,SAAS,OAAO,KAAa;CACjC,MAAM,MAAM;EACV,MAAM,QAAQ,IAAI;EAClB,IAAI,QAAQ,WAAW,OAAO;EAC9B,WAAW,OAAO,KAAK;EACvB,MAAM,QAAgC,CAAC;EACvC,MAAM,IAAIA,QAAc,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,SAAS;GACpD,MAAM,OAAO,KAAK,SAAS,YAAY,MAAM,CAAC,CAAC,SAAS,MAAM;IAC5D,YAAY,MAAM,CAAC,CAAC,CAAC,SAAS,MAAM;KAClC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,CAAC;IACjC,CAAC;GACH,CAAC;EACH,CAAC;EACD,IAAI,QAAQ;EACZ,MAAM,SAAS,MAAM;GACnB,IAAI,MAAM,IAAI,CAAC,GAAG;IAChB,SAAS,KAAK,CAAC;IACf;GACF;EACF,CAAC;EACD,IAAI,MAAM,IAAI,SAAS,eACrB,MAAM,IAAI,cAAc,mBAAmB,cAAc,YAAY;EAEvE,IAAI,QAAQ,GAAG,OAAO;EACtB,SAAS,OAAO,KAAK;GACnB,SAAS,IAAIA,QAAc,MAAM,GAAG;GACpC,UAAU,IAAIA,QAAc,QAAQ;GACpC,QAAQ;EACV,CAAC;EACD,OAAO;CACT,CAAC;CACD,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,OAAO;CACzC,MAAM,IAAI,cAAc,qBAAqB,UAAU,QAAQ;AACjE;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAa,UACX,SACA,YAEA,OAAO,WAAW,UAAUP,UAAgB,OAAO,IAAI,UAAU,QAAQ,SAAS,OAAO,CAAC,CAAC,CAAC,KAC1F,OAAO,aAAa,MAClB,aAAa,gBACT,OAAO,KAAK,IAAI,cAAc,EAAE,SAAS,iCAAiC,EAAE,KAAK,MAAM,CAAC,CAAC,IACzF,aAAa,gBACX,OAAO,KAAK,IAAI,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,IACrD,OAAO,IAAI,CAAC,CACpB,GACA,OAAO,KAAK,WAAW,OAAO,oBAAoB,iBAAiB,OAAO,QAAQ,IAAI,CAAC,GACvF,OAAO,SAAS,mBAAmB,EACjC,YAAY,EACV,wBAAwBA,UAAgB,OAAO,IAAI,UAAU,QAAQ,QAAA,CAAS,KAChF,EACF,CAAC,CACH;;;;;;;;;AAUF,MAAa,SACX,SACA,YACqD;CACrD,MAAM,QAAQ,IAAI,MAAM,QAAQ,UAAU;CAC1C,MAAM,SAAS,UAAU,QAAQ,UAAU;CAC3C,MAAM,QAAQ,QAAQ,WAAW,KAAK,MAAM,2BAA2B,GAAG,MAAM,CAAC;CACjF,OAAO,MAAM,OAAO,OAAO,YAAY;EACrC,UAAU;EACV,gBAAgB;EAChB,aAAa,MAAM,UAAU,CAAC,CAAC,CAAC;CAClC,CAAC,CAAC,CAAC,KAAK,MAAM;EACZ,MAAM,SAAS,eAAe,MAA4B;EAC1D,EAAE,SAAS,GAAG,MAAM;GAClB,IAAI,CAAC,EAAE,WAAW,SAAS,GAAG,eAAe,IAAI,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAC;EAC3E,CAAC;EACD,OAAO,OAAO;CAChB,CAAC;AACH"}

package/dist/Reification-BmN4EfnM.d.mts

@@ -0,0 +1,40 @@
+import { C as Resource, O as Triple, _ as Quad, g as Predicate, o as Graph, p as Object$1, w as Subject } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+declare namespace Reification_d_exports {
+  export { annotate, annotations, reifiers, toStandardReification };
+}
+/**
+ * Builds the quads for an annotated (asserted and reified) triple.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const annotate: (triple: Triple, annotations: ReadonlyArray<readonly [Predicate, Object$1]>, options?: {
+  readonly reifier?: Resource;
+  readonly graph?: Graph;
+}) => ReadonlyArray<Quad>;
+/**
+ * The reifiers of a triple term in a dataset.
+ *
+ * @since 0.1.0
+ * @category queries
+ */
+declare const reifiers: (self: Dataset, triple: Triple, graph?: Graph) => ReadonlyArray<Subject>;
+/**
+ * The annotations (predicate/object pairs on all reifiers) of a triple.
+ *
+ * @since 0.1.0
+ * @category queries
+ */
+declare const annotations: (self: Dataset, triple: Triple, graph?: Graph) => ReadonlyArray<readonly [Predicate, Object$1]>;
+/**
+ * Replaces every triple term with a blank node described using classic RDF
+ * reification (`rdf:Statement`, `rdf:subject`, `rdf:predicate`,
+ * `rdf:object`). Nested triple terms are converted recursively.
+ *
+ * @since 0.1.0
+ * @category conversions
+ */
+declare const toStandardReification: (self: Dataset) => Dataset;
+export { toStandardReification as a, reifiers as i, annotate as n, annotations as r, Reification_d_exports as t };
+//# sourceMappingURL=Reification-BmN4EfnM.d.mts.map

package/dist/Reification-dpqQvjDE.mjs

@@ -0,0 +1,82 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { K as isTriple, O as defaultGraph, T as blankNode, d as Quad } from "./Term-CFLG1qu4.mjs";
+import { E as match, L as subjectsOf, T as map, a as addAll } from "./Dataset-BlmlcI7J.mjs";
+import { i as rdf } from "./Vocab-DceKywpq.mjs";
+import * as MutableHashMap from "effect/MutableHashMap";
+import * as Option from "effect/Option";
+// src/Reification.ts
+/**
+* RDF 1.2 / RDF-star reification helpers.
+*
+* RDF 1.2 relates a *reifier* to a triple term with `rdf:reifies`; the
+* Turtle annotation syntax `:s :p :o {| :source :x |}` is shorthand for
+* asserting `:s :p :o` and `_:r rdf:reifies <<( :s :p :o )>> . _:r :source :x`.
+*
+* This module provides helpers for building and reading such reifications,
+* and for converting triple terms to and from classic RDF reification
+* (`rdf:Statement`) for consumers that do not support triple terms.
+*
+* @since 0.1.0
+*/
+var Reification_exports = /* @__PURE__ */ __exportAll({
+	annotate: () => annotate,
+	annotations: () => annotations,
+	reifiers: () => reifiers,
+	toStandardReification: () => toStandardReification
+});
+/**
+* Builds the quads for an annotated (asserted and reified) triple.
+*
+* @since 0.1.0
+* @category constructors
+*/
+const annotate = (triple, annotations, options = {}) => {
+	const graph = options.graph ?? defaultGraph;
+	const reifier = options.reifier ?? blankNode();
+	return [
+		new Quad(triple.subject, triple.predicate, triple.object, graph),
+		new Quad(reifier, rdf.reifies, triple, graph),
+		...annotations.map(([p, o]) => new Quad(reifier, p, o, graph))
+	];
+};
+/**
+* The reifiers of a triple term in a dataset.
+*
+* @since 0.1.0
+* @category queries
+*/
+const reifiers = (self, triple, graph) => subjectsOf(self, rdf.reifies, triple, graph);
+/**
+* The annotations (predicate/object pairs on all reifiers) of a triple.
+*
+* @since 0.1.0
+* @category queries
+*/
+const annotations = (self, triple, graph) => reifiers(self, triple, graph).flatMap((r) => match(self, {
+	subject: r,
+	graph
+}).filter((q) => q.predicate.value !== rdf.reifies.value).map((q) => [q.predicate, q.object]));
+/**
+* Replaces every triple term with a blank node described using classic RDF
+* reification (`rdf:Statement`, `rdf:subject`, `rdf:predicate`,
+* `rdf:object`). Nested triple terms are converted recursively.
+*
+* @since 0.1.0
+* @category conversions
+*/
+const toStandardReification = (self) => {
+	const nodes = MutableHashMap.empty();
+	const extra = [];
+	const convert = (t, graph) => isTriple(t) ? Option.getOrElse(MutableHashMap.get(nodes, t.key + graph.key), () => describe(t, graph)) : t;
+	const describe = (t, graph) => {
+		const node = blankNode();
+		MutableHashMap.set(nodes, t.key + graph.key, node);
+		extra.push(new Quad(node, rdf.type, rdf.Statement, graph), new Quad(node, rdf.subject, convert(t.subject, graph), graph), new Quad(node, rdf.predicate, t.predicate, graph), new Quad(node, rdf.object, convert(t.object, graph), graph));
+		return node;
+	};
+	const converted = map(self, (q) => new Quad(convert(q.subject, q.graph), q.predicate, convert(q.object, q.graph), q.graph));
+	return addAll(converted, extra);
+};
+export { toStandardReification as a, reifiers as i, annotate as n, annotations as r, Reification_exports as t };
+
+//# sourceMappingURL=Reification-dpqQvjDE.mjs.map

package/dist/Reification-dpqQvjDE.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Reification-dpqQvjDE.mjs","names":["Term.defaultGraph","Term.blankNode","Term.Quad","Dataset.subjectsOf","Dataset.match","Term.isTriple","Dataset.map","Dataset.addAll"],"sources":["../src/Reification.ts"],"sourcesContent":["/**\n * RDF 1.2 / RDF-star reification helpers.\n *\n * RDF 1.2 relates a *reifier* to a triple term with `rdf:reifies`; the\n * Turtle annotation syntax `:s :p :o {| :source :x |}` is shorthand for\n * asserting `:s :p :o` and `_:r rdf:reifies <<( :s :p :o )>> . _:r :source :x`.\n *\n * This module provides helpers for building and reading such reifications,\n * and for converting triple terms to and from classic RDF reification\n * (`rdf:Statement`) for consumers that do not support triple terms.\n *\n * @since 0.1.0\n */\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as Option from 'effect/Option';\nimport * as Dataset from './Dataset.ts';\nimport * as Term from './Term.ts';\nimport { rdf } from './Vocab.ts';\n\n/**\n * Builds the quads for an annotated (asserted and reified) triple.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const annotate = (\n  triple: Term.Triple,\n  annotations: ReadonlyArray<readonly [Term.Predicate, Term.Object]>,\n  options: { readonly reifier?: Term.Resource; readonly graph?: Term.Graph } = {},\n): ReadonlyArray<Term.Quad> => {\n  const graph = options.graph ?? Term.defaultGraph;\n  const reifier = options.reifier ?? Term.blankNode();\n  return [\n    new Term.Quad(triple.subject, triple.predicate, triple.object, graph),\n    new Term.Quad(reifier, rdf.reifies, triple, graph),\n    ...annotations.map(([p, o]) => new Term.Quad(reifier, p, o, graph)),\n  ];\n};\n\n/**\n * The reifiers of a triple term in a dataset.\n *\n * @since 0.1.0\n * @category queries\n */\nexport const reifiers = (\n  self: Dataset.Dataset,\n  triple: Term.Triple,\n  graph?: Term.Graph,\n): ReadonlyArray<Term.Subject> => Dataset.subjectsOf(self, rdf.reifies, triple, graph);\n\n/**\n * The annotations (predicate/object pairs on all reifiers) of a triple.\n *\n * @since 0.1.0\n * @category queries\n */\nexport const annotations = (\n  self: Dataset.Dataset,\n  triple: Term.Triple,\n  graph?: Term.Graph,\n): ReadonlyArray<readonly [Term.Predicate, Term.Object]> =>\n  reifiers(self, triple, graph).flatMap((r) =>\n    Dataset.match(self, { subject: r, graph })\n      .filter((q) => q.predicate.value !== rdf.reifies.value)\n      .map((q) => [q.predicate, q.object] as const),\n  );\n\n/**\n * Replaces every triple term with a blank node described using classic RDF\n * reification (`rdf:Statement`, `rdf:subject`, `rdf:predicate`,\n * `rdf:object`). Nested triple terms are converted recursively.\n *\n * @since 0.1.0\n * @category conversions\n */\nexport const toStandardReification = (self: Dataset.Dataset): Dataset.Dataset => {\n  const nodes = MutableHashMap.empty<string, Term.BlankNode>();\n  const extra: Array<Term.Quad> = [];\n  const convert = <T extends Term.Term>(t: T, graph: Term.Graph): T | Term.BlankNode =>\n    Term.isTriple(t)\n      ? Option.getOrElse(MutableHashMap.get(nodes, t.key + graph.key), () => describe(t, graph))\n      : t;\n  const describe = (t: Term.Triple, graph: Term.Graph): Term.BlankNode => {\n    const node = Term.blankNode();\n    MutableHashMap.set(nodes, t.key + graph.key, node);\n    // SAFETY: conversion maps a subject to a subject and an object to an object.\n    extra.push(\n      new Term.Quad(node, rdf.type, rdf.Statement, graph),\n      new Term.Quad(node, rdf.subject, convert(t.subject, graph), graph),\n      new Term.Quad(node, rdf.predicate, t.predicate, graph),\n      new Term.Quad(node, rdf.object, convert(t.object, graph), graph),\n    );\n    return node;\n  };\n  // SAFETY: conversion maps a subject to a subject and an object to an object.\n  const converted = Dataset.map(\n    self,\n    (q) =>\n      new Term.Quad(convert(q.subject, q.graph), q.predicate, convert(q.object, q.graph), q.graph),\n  );\n  return Dataset.addAll(converted, extra);\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,MAAa,YACX,QACA,aACA,UAA6E,CAAC,MACjD;CAC7B,MAAM,QAAQ,QAAQ,SAASA;CAC/B,MAAM,UAAU,QAAQ,WAAWC,UAAe;CAClD,OAAO;EACL,IAAIC,KAAU,OAAO,SAAS,OAAO,WAAW,OAAO,QAAQ,KAAK;EACpE,IAAIA,KAAU,SAAS,IAAI,SAAS,QAAQ,KAAK;EACjD,GAAG,YAAY,KAAK,CAAC,GAAG,OAAO,IAAIA,KAAU,SAAS,GAAG,GAAG,KAAK,CAAC;CACpE;AACF;;;;;;;AAQA,MAAa,YACX,MACA,QACA,UACgCC,WAAmB,MAAM,IAAI,SAAS,QAAQ,KAAK;;;;;;;AAQrF,MAAa,eACX,MACA,QACA,UAEA,SAAS,MAAM,QAAQ,KAAK,CAAC,CAAC,SAAS,MACrCC,MAAc,MAAM;CAAE,SAAS;CAAG;AAAM,CAAC,CAAC,CACvC,QAAQ,MAAM,EAAE,UAAU,UAAU,IAAI,QAAQ,KAAK,CAAC,CACtD,KAAK,MAAM,CAAC,EAAE,WAAW,EAAE,MAAM,CAAU,CAChD;;;;;;;;;AAUF,MAAa,yBAAyB,SAA2C;CAC/E,MAAM,QAAQ,eAAe,MAA8B;CAC3D,MAAM,QAA0B,CAAC;CACjC,MAAM,WAAgC,GAAM,UAC1CC,SAAc,CAAC,IACX,OAAO,UAAU,eAAe,IAAI,OAAO,EAAE,MAAM,MAAM,GAAG,SAAS,SAAS,GAAG,KAAK,CAAC,IACvF;CACN,MAAM,YAAY,GAAgB,UAAsC;EACtE,MAAM,OAAOJ,UAAe;EAC5B,eAAe,IAAI,OAAO,EAAE,MAAM,MAAM,KAAK,IAAI;EAEjD,MAAM,KACJ,IAAIC,KAAU,MAAM,IAAI,MAAM,IAAI,WAAW,KAAK,GAClD,IAAIA,KAAU,MAAM,IAAI,SAAS,QAAQ,EAAE,SAAS,KAAK,GAAG,KAAK,GACjE,IAAIA,KAAU,MAAM,IAAI,WAAW,EAAE,WAAW,KAAK,GACrD,IAAIA,KAAU,MAAM,IAAI,QAAQ,QAAQ,EAAE,QAAQ,KAAK,GAAG,KAAK,CACjE;EACA,OAAO;CACT;CAEA,MAAM,YAAYI,IAChB,OACC,MACC,IAAIJ,KAAU,QAAQ,EAAE,SAAS,EAAE,KAAK,GAAG,EAAE,WAAW,QAAQ,EAAE,QAAQ,EAAE,KAAK,GAAG,EAAE,KAAK,CAC/F;CACA,OAAOK,OAAe,WAAW,KAAK;AACxC"}

package/dist/Reification.d.mts

@@ -0,0 +1,2 @@
+import { a as toStandardReification, i as reifiers, n as annotate, r as annotations } from "./Reification-BmN4EfnM.mjs";
+export { annotate, annotations, reifiers, toStandardReification };

package/dist/Reification.mjs

@@ -0,0 +1 @@
+export { n as annotate, r as annotations, i as reifiers, a as toStandardReification } from "./Reification-dpqQvjDE.mjs";

package/dist/Report-XHs8htzK.mjs

@@ -0,0 +1,121 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import * as Arr from "effect/Array";
+import * as Schema from "effect/Schema";
+// src/csvw/Report.ts
+/**
+* The validation report of CSVW processing: the errors and warnings raised
+* while reading metadata, checking it against the tabular data, parsing
+* cells and checking primary and foreign keys, each with its position.
+*
+* @since 0.1.0
+*/
+var Report_exports = /* @__PURE__ */ __exportAll({
+	Issue: () => Issue,
+	Level: () => Level,
+	Report: () => Report,
+	combine: () => combine,
+	empty: () => empty,
+	error: () => error,
+	errors: () => errors,
+	isValid: () => isValid,
+	make: () => make,
+	warning: () => warning,
+	warnings: () => warnings
+});
+/**
+* How serious an issue is: an `error` makes the input invalid, a `warning`
+* does not.
+*
+* @since 0.1.0
+* @category models
+*/
+const Level = Schema.Literals(["error", "warning"]);
+/**
+* One error or warning, positioned where it applies: the table URL, the
+* source row number and the source column number (all 1-based, absent when
+* the issue concerns the whole table or metadata).
+*
+* @since 0.1.0
+* @category models
+*/
+const Issue = Schema.Struct({
+	level: Level,
+	message: Schema.String,
+	table: Schema.optional(Schema.String),
+	row: Schema.optional(Schema.Int),
+	column: Schema.optional(Schema.Int)
+});
+/**
+* A validation report: every issue raised, in the order raised.
+*
+* @since 0.1.0
+* @category models
+*/
+const Report = Schema.Struct({ issues: Schema.Array(Issue) });
+/**
+* The empty report.
+*
+* @since 0.1.0
+* @category constructors
+*/
+const empty = { issues: [] };
+/**
+* A report of the given issues.
+*
+* @since 0.1.0
+* @category constructors
+*/
+const make = (issues) => ({ issues });
+/**
+* An error issue.
+*
+* @since 0.1.0
+* @category constructors
+*/
+const error = (message, position = {}) => ({
+	level: "error",
+	message,
+	...position
+});
+/**
+* A warning issue.
+*
+* @since 0.1.0
+* @category constructors
+*/
+const warning = (message, position = {}) => ({
+	level: "warning",
+	message,
+	...position
+});
+/**
+* The errors of a report.
+*
+* @since 0.1.0
+* @category getters
+*/
+const errors = (self) => Arr.filter(self.issues, (i) => i.level === "error");
+/**
+* The warnings of a report.
+*
+* @since 0.1.0
+* @category getters
+*/
+const warnings = (self) => Arr.filter(self.issues, (i) => i.level === "warning");
+/**
+* Whether a report has no errors (warnings are allowed).
+*
+* @since 0.1.0
+* @category predicates
+*/
+const isValid = (self) => !Arr.isReadonlyArrayNonEmpty(errors(self));
+/**
+* Two reports in one.
+*
+* @since 0.1.0
+* @category combinators
+*/
+const combine = (self, that) => ({ issues: Arr.appendAll(self.issues, that.issues) });
+export { combine as a, errors as c, warning as d, warnings as f, Report_exports as i, isValid as l, Level as n, empty as o, Report as r, error as s, Issue as t, make as u };
+
+//# sourceMappingURL=Report-XHs8htzK.mjs.map

package/dist/Report-XHs8htzK.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Report-XHs8htzK.mjs","names":[],"sources":["../src/csvw/Report.ts"],"sourcesContent":["/**\n * The validation report of CSVW processing: the errors and warnings raised\n * while reading metadata, checking it against the tabular data, parsing\n * cells and checking primary and foreign keys, each with its position.\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as Schema from 'effect/Schema';\n\n/**\n * How serious an issue is: an `error` makes the input invalid, a `warning`\n * does not.\n *\n * @since 0.1.0\n * @category models\n */\nexport const Level = Schema.Literals(['error', 'warning']);\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport type Level = typeof Level.Type;\n\n/**\n * One error or warning, positioned where it applies: the table URL, the\n * source row number and the source column number (all 1-based, absent when\n * the issue concerns the whole table or metadata).\n *\n * @since 0.1.0\n * @category models\n */\nexport const Issue = Schema.Struct({\n  level: Level,\n  message: Schema.String,\n  table: Schema.optional(Schema.String),\n  row: Schema.optional(Schema.Int),\n  column: Schema.optional(Schema.Int),\n});\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport type Issue = typeof Issue.Type;\n\n/**\n * A validation report: every issue raised, in the order raised.\n *\n * @since 0.1.0\n * @category models\n */\nexport const Report = Schema.Struct({ issues: Schema.Array(Issue) });\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport type Report = typeof Report.Type;\n\n/**\n * The empty report.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const empty: Report = { issues: [] };\n\n/**\n * A report of the given issues.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make = (issues: ReadonlyArray<Issue>): Report => ({ issues });\n\n/**\n * An error issue.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const error = (message: string, position: Omit<Issue, 'level' | 'message'> = {}): Issue => ({\n  level: 'error',\n  message,\n  ...position,\n});\n\n/**\n * A warning issue.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const warning = (\n  message: string,\n  position: Omit<Issue, 'level' | 'message'> = {},\n): Issue => ({ level: 'warning', message, ...position });\n\n/**\n * The errors of a report.\n *\n * @since 0.1.0\n * @category getters\n */\nexport const errors = (self: Report): ReadonlyArray<Issue> =>\n  Arr.filter(self.issues, (i) => i.level === 'error');\n\n/**\n * The warnings of a report.\n *\n * @since 0.1.0\n * @category getters\n */\nexport const warnings = (self: Report): ReadonlyArray<Issue> =>\n  Arr.filter(self.issues, (i) => i.level === 'warning');\n\n/**\n * Whether a report has no errors (warnings are allowed).\n *\n * @since 0.1.0\n * @category predicates\n */\nexport const isValid = (self: Report): boolean => !Arr.isReadonlyArrayNonEmpty(errors(self));\n\n/**\n * Two reports in one.\n *\n * @since 0.1.0\n * @category combinators\n */\nexport const combine = (self: Report, that: Report): Report => ({\n  issues: Arr.appendAll(self.issues, that.issues),\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiBA,MAAa,QAAQ,OAAO,SAAS,CAAC,SAAS,SAAS,CAAC;;;;;;;;;AAgBzD,MAAa,QAAQ,OAAO,OAAO;CACjC,OAAO;CACP,SAAS,OAAO;CAChB,OAAO,OAAO,SAAS,OAAO,MAAM;CACpC,KAAK,OAAO,SAAS,OAAO,GAAG;CAC/B,QAAQ,OAAO,SAAS,OAAO,GAAG;AACpC,CAAC;;;;;;;AAcD,MAAa,SAAS,OAAO,OAAO,EAAE,QAAQ,OAAO,MAAM,KAAK,EAAE,CAAC;;;;;;;AAcnE,MAAa,QAAgB,EAAE,QAAQ,CAAC,EAAE;;;;;;;AAQ1C,MAAa,QAAQ,YAA0C,EAAE,OAAO;;;;;;;AAQxE,MAAa,SAAS,SAAiB,WAA6C,CAAC,OAAc;CACjG,OAAO;CACP;CACA,GAAG;AACL;;;;;;;AAQA,MAAa,WACX,SACA,WAA6C,CAAC,OACnC;CAAE,OAAO;CAAW;CAAS,GAAG;AAAS;;;;;;;AAQtD,MAAa,UAAU,SACrB,IAAI,OAAO,KAAK,SAAS,MAAM,EAAE,UAAU,OAAO;;;;;;;AAQpD,MAAa,YAAY,SACvB,IAAI,OAAO,KAAK,SAAS,MAAM,EAAE,UAAU,SAAS;;;;;;;AAQtD,MAAa,WAAW,SAA0B,CAAC,IAAI,wBAAwB,OAAO,IAAI,CAAC;;;;;;;AAQ3F,MAAa,WAAW,MAAc,UAA0B,EAC9D,QAAQ,IAAI,UAAU,KAAK,QAAQ,KAAK,MAAM,EAChD"}

package/dist/Report-hcXsc_19.d.mts

@@ -0,0 +1,115 @@
+import * as Schema from "effect/Schema";
+declare namespace Report_d_exports {
+  export { Issue, Level, Report, combine, empty, error, errors, isValid, make, warning, warnings };
+}
+/**
+ * How serious an issue is: an `error` makes the input invalid, a `warning`
+ * does not.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+declare const Level: Schema.Literals<readonly ["error", "warning"]>;
+/**
+ * @since 0.1.0
+ * @category models
+ */
+type Level = typeof Level.Type;
+/**
+ * One error or warning, positioned where it applies: the table URL, the
+ * source row number and the source column number (all 1-based, absent when
+ * the issue concerns the whole table or metadata).
+ *
+ * @since 0.1.0
+ * @category models
+ */
+declare const Issue: Schema.Struct<{
+  readonly level: Schema.Literals<readonly ["error", "warning"]>;
+  readonly message: Schema.String;
+  readonly table: Schema.optional<Schema.String>;
+  readonly row: Schema.optional<Schema.Int>;
+  readonly column: Schema.optional<Schema.Int>;
+}>;
+/**
+ * @since 0.1.0
+ * @category models
+ */
+type Issue = typeof Issue.Type;
+/**
+ * A validation report: every issue raised, in the order raised.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+declare const Report: Schema.Struct<{
+  readonly issues: Schema.$Array<Schema.Struct<{
+    readonly level: Schema.Literals<readonly ["error", "warning"]>;
+    readonly message: Schema.String;
+    readonly table: Schema.optional<Schema.String>;
+    readonly row: Schema.optional<Schema.Int>;
+    readonly column: Schema.optional<Schema.Int>;
+  }>>;
+}>;
+/**
+ * @since 0.1.0
+ * @category models
+ */
+type Report = typeof Report.Type;
+/**
+ * The empty report.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const empty: Report;
+/**
+ * A report of the given issues.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const make: (issues: ReadonlyArray<Issue>) => Report;
+/**
+ * An error issue.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const error: (message: string, position?: Omit<Issue, "level" | "message">) => Issue;
+/**
+ * A warning issue.
+ *
+ * @since 0.1.0
+ * @category constructors
+ */
+declare const warning: (message: string, position?: Omit<Issue, "level" | "message">) => Issue;
+/**
+ * The errors of a report.
+ *
+ * @since 0.1.0
+ * @category getters
+ */
+declare const errors: (self: Report) => ReadonlyArray<Issue>;
+/**
+ * The warnings of a report.
+ *
+ * @since 0.1.0
+ * @category getters
+ */
+declare const warnings: (self: Report) => ReadonlyArray<Issue>;
+/**
+ * Whether a report has no errors (warnings are allowed).
+ *
+ * @since 0.1.0
+ * @category predicates
+ */
+declare const isValid: (self: Report) => boolean;
+/**
+ * Two reports in one.
+ *
+ * @since 0.1.0
+ * @category combinators
+ */
+declare const combine: (self: Report, that: Report) => Report;
+export { combine as a, errors as c, warning as d, warnings as f, Report_d_exports as i, isValid as l, Level as n, empty as o, Report as r, error as s, Issue as t, make as u };
+//# sourceMappingURL=Report-hcXsc_19.d.mts.map