@thomasfosterau/effect-rdf 0.0.0 → 0.1.0

package/dist/Validator-DmUfMbpL.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Validator-DmUfMbpL.mjs","names":["isString","Xsd.toValue","Term.isLiteral","Vocab","ValidationReport.ValidationReportSchema","Term.isNamedNode","Term.isBlankNode","Term.isLiteral","Xsd.isWellFormed","Term.literal","Message.display","Term.namedNode","Message.localName","Path.toSparql","Message.substitute","Dataset.objectsOf","Dataset.match","objectsOf","Shapes.get","Path.evaluate","evaluate","Shapes.componentOf","ValidationReport.makeResult","Path.predicate","Shapes.isShapesGraph","Shapes.parse","Dataset.union","Sparql.SparqlConstraintEvaluator","ValidationReport.make","ValidationReport.format","Dataset.DatasetSchema","ValidationReport.formatResult"],"sources":["../src/shacl/internal/compare.ts","../src/shacl/Validator.ts"],"sourcesContent":["/**\n * Ordering of RDF terms following the SPARQL `<` operator, as required by the\n * SHACL value range and property pair constraint components.\n *\n * @internal\n */\nimport { Term, Xsd } from '../../index.ts';\nimport * as BigDecimal from 'effect/BigDecimal';\nimport * as Match from 'effect/Match';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\n\nconst XSD_STRING = 'http://www.w3.org/2001/XMLSchema#string';\n\ntype Sign = -1 | 0 | 1;\n\ntype Num =\n  | { readonly kind: 'integer'; readonly value: bigint }\n  | { readonly kind: 'decimal'; readonly value: BigDecimal.BigDecimal }\n  | { readonly kind: 'float'; readonly value: number };\n\n// Built once: `toNum` runs for every numeric comparison.\nconst toNum: (v: Xsd.Value) => Option.Option<Num> = Match.type<Xsd.Value>().pipe(\n  Match.tag('Integer', (v) => Option.some<Num>({ kind: 'integer', value: v.value })),\n  Match.tag('Decimal', (v) => Option.some<Num>({ kind: 'decimal', value: v.value })),\n  Match.tag('Float', 'Double', (v) => Option.some<Num>({ kind: 'float', value: v.value })),\n  Match.orElse(() => Option.none<Num>()),\n);\n\nconst sign = (n: number): Sign => (n < 0 ? -1 : n > 0 ? 1 : 0);\n\nconst toFloat = (n: Num): number =>\n  n.kind === 'float'\n    ? n.value\n    : Number(n.kind === 'integer' ? n.value : BigDecimal.format(n.value));\n\nconst toDecimal = (n: Exclude<Num, { readonly kind: 'float' }>): BigDecimal.BigDecimal =>\n  n.kind === 'integer' ? BigDecimal.fromBigInt(n.value) : n.value;\n\nconst compareNum = (a: Num, b: Num): Option.Option<Sign> => {\n  if (a.kind === 'float' || b.kind === 'float') {\n    const x = toFloat(a);\n    const y = toFloat(b);\n    if (Number.isNaN(x) || Number.isNaN(y)) return Option.none();\n    return Option.some(sign(x - y) || (x < y ? -1 : x > y ? 1 : 0));\n  }\n  if (a.kind === 'integer' && b.kind === 'integer')\n    return Option.some(a.value < b.value ? -1 : a.value > b.value ? 1 : 0);\n  return Option.some(BigDecimal.Order(toDecimal(a), toDecimal(b)));\n};\n\nconst FOURTEEN_HOURS = 14 * 60 * 60 * 1000;\n\nconst order = <A>(x: A, y: A): Sign => (x < y ? -1 : x > y ? 1 : 0);\n\nconst isString = Predicate.isTagged('String');\nconst isBoolean = Predicate.isTagged('Boolean');\nconst isDateTime = Predicate.isTagged('DateTime');\nconst isDuration = Predicate.isTagged('Duration');\nconst isOther = Predicate.isTagged('Other');\n\n/** Simple literals / xsd:string are ordered; language-tagged strings only when they share a tag. */\nconst stringsComparable = (a: Term.Literal, b: Term.Literal): boolean =>\n  a.language !== '' || b.language !== ''\n    ? a.language.toLowerCase() === b.language.toLowerCase()\n    : a.datatype.value === XSD_STRING && b.datatype.value === XSD_STRING;\n\nconst none = Option.none<Sign>();\n\nconst compareDateTimes = (\n  x: Extract<Xsd.Value, { readonly _tag: 'DateTime' }>,\n  y: Extract<Xsd.Value, { readonly _tag: 'DateTime' }>,\n): Option.Option<Sign> => {\n  if (x.kind !== y.kind) return none;\n  const d = x.epochMillis - y.epochMillis;\n  // One value has a timezone and the other does not: the result is only\n  // determinate when they are more than 14 hours apart.\n  return Predicate.isUndefined(x.timezone) === Predicate.isUndefined(y.timezone) ||\n    Math.abs(d) > FOURTEEN_HOURS\n    ? Option.some(sign(d))\n    : none;\n};\n\nconst compareDurations = (\n  x: Extract<Xsd.Value, { readonly _tag: 'Duration' }>,\n  y: Extract<Xsd.Value, { readonly _tag: 'Duration' }>,\n): Option.Option<Sign> => {\n  const m = sign(x.months - y.months);\n  const s = sign(x.seconds - y.seconds);\n  if (m === 0) return Option.some(s);\n  return s === 0 || s === m ? Option.some(m) : none;\n};\n\n// Plain guards rather than a `Match`: this runs for every value of every\n// range and property pair constraint. The right value must be of the same kind.\nconst compareValues = (\n  va: Xsd.Value,\n  vb: Xsd.Value,\n  a: Term.Literal,\n  b: Term.Literal,\n): Option.Option<Sign> => {\n  if (isString(va))\n    return isString(vb) && stringsComparable(a, b) ? Option.some(order(va.value, vb.value)) : none;\n  if (isBoolean(va))\n    return isBoolean(vb) ? Option.some(va.value === vb.value ? 0 : va.value ? 1 : -1) : none;\n  if (isDateTime(va)) return isDateTime(vb) ? compareDateTimes(va, vb) : none;\n  if (isDuration(va)) return isDuration(vb) ? compareDurations(va, vb) : none;\n  return isOther(va) && isOther(vb) && a.key === b.key ? Option.some(0) : none;\n};\n\nconst compareLiterals = (a: Term.Literal, b: Term.Literal): Option.Option<Sign> => {\n  const va = Xsd.toValue(a);\n  const vb = Xsd.toValue(b);\n  const na = toNum(va);\n  const nb = toNum(vb);\n  if (Option.isSome(na) && Option.isSome(nb)) return compareNum(na.value, nb.value);\n  if (Option.isSome(na) || Option.isSome(nb)) return Option.none();\n  return compareValues(va, vb, a, b);\n};\n\n/**\n * Compares two terms. Returns `None` when they are not comparable (in which\n * case every SPARQL comparison yields an error, i.e. false).\n *\n * @internal\n */\nexport const compareTerms = (a: Term.Term, b: Term.Term): Option.Option<Sign> =>\n  Term.isLiteral(a) && Term.isLiteral(b) ? compareLiterals(a, b) : Option.none();\n","/**\n * SHACL Core validation (§3–§4): validates a data graph against a shapes\n * graph and produces a `ValidationReport`.\n *\n * ```ts\n * import { Effect } from \"effect\"\n * import { Validator, ValidationReport } from \"@thomasfosterau/effect-rdf/shacl\"\n *\n * const program = Effect.gen(function* () {\n *   const report = yield* Validator.validate(dataGraph, shapesGraph)\n *   console.log(ValidationReport.format(report))\n * })\n * ```\n *\n * The `Validator` service pre-compiles a shapes graph once and validates many\n * data graphs against it:\n *\n * ```ts\n * const program = Effect.gen(function* () {\n *   const validator = yield* Validator.Validator\n *   const ok = yield* validator.conforms(dataGraph)\n * }).pipe(Effect.provide(Validator.layer(shapesGraph)))\n * ```\n *\n * @since 0.1.0\n */\nimport { Dataset, Term, Vocab, Xsd } from '../index.ts';\nimport * as Arr from 'effect/Array';\nimport * as Context from 'effect/Context';\nimport * as Effect from 'effect/Effect';\nimport { constVoid, identity, pipe } from 'effect/Function';\nimport * as Iterable from 'effect/Iterable';\nimport * as Layer from 'effect/Layer';\nimport * as Match from 'effect/Match';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Predicate from 'effect/Predicate';\nimport * as Record from 'effect/Record';\nimport * as Schema from 'effect/Schema';\nimport * as SchemaIssue from 'effect/SchemaIssue';\nimport * as SchemaTransformation from 'effect/SchemaTransformation';\nimport { compareTerms } from './internal/compare.ts';\nimport * as Message from './Message.ts';\nimport * as Path from './Path.ts';\nimport * as Shapes from './Shapes.ts';\nimport * as Sparql from './Sparql.ts';\nimport * as ValidationReport from './ValidationReport.ts';\nimport { SH, sh } from './Vocabulary.ts';\n\n/** A string as a JSON string literal, for messages. */\nconst quote = Schema.encodeSync(Schema.fromJsonString(Schema.String));\n\nconst { rdf, rdfs, xsd } = Vocab;\n\n// -----------------------------------------------------------------------------\n// Errors\n// -----------------------------------------------------------------------------\n\n/**\n * Validation reached a shape again for the same focus node while still\n * validating it (a recursive shape). The SHACL specification leaves the\n * validation of recursive shapes undefined.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class RecursiveShapeError extends Schema.TaggedError<RecursiveShapeError>()(\n  'RecursiveShapeError',\n  {\n    message: Schema.String,\n    shape: Schema.String,\n    focusNode: Schema.String,\n  },\n) {}\n\n/**\n * The shapes graph uses a feature this validator cannot evaluate (currently:\n * SHACL-SPARQL constraints and targets when no\n * `Sparql.SparqlConstraintEvaluator` is provided).\n *\n * @since 0.1.0\n * @category errors\n */\nexport class UnsupportedFeatureError extends Schema.TaggedError<UnsupportedFeatureError>()(\n  'UnsupportedFeatureError',\n  {\n    message: Schema.String,\n    feature: Schema.String,\n    shape: Schema.String,\n  },\n) {}\n\n/**\n * The data graph does not conform to the shapes graph (raised by\n * `Validator.check` and `assertConforms`).\n *\n * @since 0.1.0\n * @category errors\n */\nexport class ConformanceError extends Schema.TaggedError<ConformanceError>()('ConformanceError', {\n  message: Schema.String,\n  report: ValidationReport.ValidationReportSchema,\n}) {}\n\n/**\n * The errors that can prevent validation from producing a report (SHACL\n * \"failures\").\n *\n * @since 0.1.0\n * @category errors\n */\nexport type ValidationError =\n  | Shapes.ShapesGraphError\n  | RecursiveShapeError\n  | UnsupportedFeatureError\n  | Sparql.SparqlEvaluationError;\n\n// -----------------------------------------------------------------------------\n// Options\n// -----------------------------------------------------------------------------\n\n/**\n * Validation options.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ValidateOptions {\n  /**\n   * Validate the union of the data graph and the shapes graph (useful when\n   * the data graph declares `sh:shapesGraph`, or the shapes and data live in\n   * the same document). Default `false`.\n   */\n  readonly includeShapesGraph?: boolean | undefined;\n  /**\n   * What to do with SHACL-SPARQL constraints and targets when no\n   * `Sparql.SparqlConstraintEvaluator` is provided: `\"fail\"` (default) fails\n   * with an `UnsupportedFeatureError`, `\"ignore\"` skips them.\n   */\n  readonly sparql?: 'fail' | 'ignore' | undefined;\n  /**\n   * What to do when a shape is (directly or indirectly) validated against a\n   * focus node while it is already being validated against the same node:\n   * `\"fail\"` (default) fails with a `RecursiveShapeError`, `\"ignore\"` treats\n   * the recursive reference as conforming.\n   */\n  readonly recursion?: 'fail' | 'ignore' | undefined;\n  /**\n   * Attach the nested results that caused `sh:node`, `sh:not`, `sh:and`,\n   * `sh:or`, `sh:xone` and qualified value shape results as `sh:detail`.\n   * Default `false`.\n   */\n  readonly details?: boolean | undefined;\n}\n\n// -----------------------------------------------------------------------------\n// Engine\n// -----------------------------------------------------------------------------\n\ntype EngineError = RecursiveShapeError | UnsupportedFeatureError | Sparql.SparqlEvaluationError;\ntype Results = ReadonlyArray<ValidationReport.ValidationResult>;\n\nconst langMatches = (tag: string, range: string): boolean => {\n  if (tag === '') return false;\n  if (range === '*') return true;\n  const t = tag.toLowerCase();\n  const r = range.toLowerCase();\n  return t === r || t.startsWith(`${r}-`);\n};\n\ntype BasicNodeKind = 'IRI' | 'BlankNode' | 'Literal';\n\nconst IRI = Option.some<BasicNodeKind>('IRI');\nconst BLANK_NODE = Option.some<BasicNodeKind>('BlankNode');\nconst LITERAL = Option.some<BasicNodeKind>('Literal');\n\nconst nodeKindOf = (t: Term.Term): Option.Option<BasicNodeKind> =>\n  Term.isNamedNode(t)\n    ? IRI\n    : Term.isBlankNode(t)\n      ? BLANK_NODE\n      : Term.isLiteral(t)\n        ? LITERAL\n        : Option.none();\n\nconst matchesNodeKind = (t: Term.Term, kind: Shapes.NodeKind): boolean =>\n  Option.exists(nodeKindOf(t), (k) => kind.includes(k));\n\nconst hasDatatype = (v: Term.Term, datatype: Term.NamedNode): boolean => {\n  if (!Term.isLiteral(v) || v.datatype.value !== datatype.value) return false;\n  if (datatype.value === rdf.langString.value || datatype.value === rdf.dirLangString.value)\n    return v.language !== '';\n  if (v.language !== '') return false;\n  return Xsd.isWellFormed(v);\n};\n\nconst stringValue = (v: Term.Term): Option.Option<string> =>\n  Term.isNamedNode(v) || Term.isLiteral(v) ? Option.some(v.value) : Option.none();\n\n/** Whether a value node has no string value, or one that fails `ok`. */\nconst failsString = (v: Term.Term, ok: (s: string) => boolean): boolean =>\n  !Option.exists(stringValue(v), ok);\n\nconst show = (t: Term.Term) => t.key;\n\n/** A high surrogate and the code unit after it: one code point. */\nconst surrogatePair = /[\\uD800-\\uDBFF][\\s\\S]/g;\n\n/** The length of a string in Unicode code points (as XPath `fn:string-length`). */\nconst codePointLength = (s: string): number => s.replace(surrogatePair, '_').length;\n\ntype Sign = -1 | 0 | 1;\n\n/** Whether `a` and `b` are comparable and their order satisfies `ok`. */\nconst ordered = (a: Term.Term, b: Term.Term, ok: (sign: Sign) => boolean): boolean =>\n  Option.exists(compareTerms(a, b), ok);\n\nconst defaultMessage = (constraint: Shapes.Constraint, value: Option.Option<Term.Term>): string => {\n  const v = Option.match(value, { onNone: () => 'Value', onSome: (t) => `Value ${show(t)}` });\n  return Match.value(constraint)\n    .pipe(\n      Match.tag('Class', (c) => `${v} is not an instance of ${show(c.class)}`),\n      Match.tag('Datatype', (c) => `${v} does not have datatype ${show(c.datatype)}`),\n      Match.tag('NodeKind', (c) => `${v} does not have node kind sh:${c.nodeKind}`),\n      Match.tag('MinCount', (c) => `Less than ${c.minCount} values`),\n      Match.tag('MaxCount', (c) => `More than ${c.maxCount} values`),\n      Match.tag('MinExclusive', (c) => `${v} is not greater than ${show(c.value)}`),\n      Match.tag('MinInclusive', (c) => `${v} is not greater than or equal to ${show(c.value)}`),\n      Match.tag('MaxExclusive', (c) => `${v} is not less than ${show(c.value)}`),\n      Match.tag('MaxInclusive', (c) => `${v} is not less than or equal to ${show(c.value)}`),\n      Match.tag('MinLength', (c) => `${v} is shorter than ${c.minLength} characters`),\n      Match.tag('MaxLength', (c) => `${v} is longer than ${c.maxLength} characters`),\n      Match.tag('Pattern', (c) => `${v} does not match pattern ${quote(c.pattern)}`),\n      Match.tag(\n        'LanguageIn',\n        (c) => `${v} does not have a language tag in [${c.languages.join(', ')}]`,\n      ),\n      Match.tag('UniqueLang', () => 'Language tag used by more than one value'),\n      Match.tag('Equals', (c) => `${v} is not equal to the values of ${show(c.predicate)}`),\n      Match.tag('Disjoint', (c) => `${v} is also a value of ${show(c.predicate)}`),\n      Match.tag('LessThan', (c) => `${v} is not less than the values of ${show(c.predicate)}`),\n      Match.tag(\n        'LessThanOrEquals',\n        (c) => `${v} is not less than or equal to the values of ${show(c.predicate)}`,\n      ),\n    )\n    .pipe(\n      Match.tag('Not', (c) => `${v} conforms to the negated shape ${show(c.shape)}`),\n      Match.tag('And', () => `${v} does not conform to all of the shapes`),\n      Match.tag('Or', () => `${v} does not conform to any of the shapes`),\n      Match.tag('Xone', () => `${v} does not conform to exactly one of the shapes`),\n      Match.tag('Node', (c) => `${v} does not conform to shape ${show(c.shape)}`),\n      Match.tag('Property', (c) => `${v} does not conform to property shape ${show(c.shape)}`),\n      Match.tag(\n        'QualifiedMinCount',\n        (c) => `Less than ${c.count} values conform to shape ${show(c.shape)}`,\n      ),\n      Match.tag(\n        'QualifiedMaxCount',\n        (c) => `More than ${c.count} values conform to shape ${show(c.shape)}`,\n      ),\n      Match.tag(\n        'Closed',\n        () =>\n          `Predicate is not allowed by the closed shape (value ${Option.match(value, { onNone: () => '', onSome: show })})`,\n      ),\n      Match.tag('HasValue', (c) => `Missing expected value ${show(c.value)}`),\n      Match.tag('In', () => `${v} is not one of the allowed values`),\n      Match.tag('Sparql', 'Component', () => `${v} violates a SPARQL-based constraint`),\n      Match.exhaustive,\n    );\n};\n\nconst integer = (n: number) => Term.literal(String(n), xsd.integer);\nconst boolean = (b: boolean) => Term.literal(String(b), xsd.boolean);\nconst listText = (terms: ReadonlyArray<Term.Term>) =>\n  Term.literal(terms.map(Message.display).join(', '));\n\n/** The parameter values of a core constraint by parameter name (for message templates). */\nconst coreParameters = (\n  constraint: Shapes.Constraint,\n): ReadonlyArray<readonly [string, Term.Term]> => {\n  return Match.value(constraint)\n    .pipe(\n      Match.withReturnType<ReadonlyArray<readonly [string, Term.Term]>>(),\n      Match.tag('Class', (c) => [['class', c.class]]),\n      Match.tag('Datatype', (c) => [['datatype', c.datatype]]),\n      Match.tag('NodeKind', (c) => [['nodeKind', Term.namedNode(SH + c.nodeKind)]]),\n      Match.tag('MinCount', (c) => [['minCount', integer(c.minCount)]]),\n      Match.tag('MaxCount', (c) => [['maxCount', integer(c.maxCount)]]),\n      Match.tag('MinExclusive', (c) => [['minExclusive', c.value]]),\n      Match.tag('MinInclusive', (c) => [['minInclusive', c.value]]),\n      Match.tag('MaxExclusive', (c) => [['maxExclusive', c.value]]),\n      Match.tag('MaxInclusive', (c) => [['maxInclusive', c.value]]),\n      Match.tag('MinLength', (c) => [['minLength', integer(c.minLength)]]),\n      Match.tag('MaxLength', (c) => [['maxLength', integer(c.maxLength)]]),\n      Match.tag('Pattern', (c) => [\n        ['pattern', Term.literal(c.pattern)],\n        ['flags', Term.literal(c.flags)],\n      ]),\n      Match.tag('LanguageIn', (c) => [['languageIn', Term.literal(c.languages.join(', '))]]),\n      Match.tag('UniqueLang', () => [['uniqueLang', boolean(true)]]),\n      Match.tag('Equals', (c) => [['equals', c.predicate]]),\n      Match.tag('Disjoint', (c) => [['disjoint', c.predicate]]),\n      Match.tag('LessThan', (c) => [['lessThan', c.predicate]]),\n      Match.tag('LessThanOrEquals', (c) => [['lessThanOrEquals', c.predicate]]),\n    )\n    .pipe(\n      Match.tag('Not', (c) => [['not', c.shape]]),\n      Match.tag('And', (c) => [['and', listText(c.shapes)]]),\n      Match.tag('Or', (c) => [['or', listText(c.shapes)]]),\n      Match.tag('Xone', (c) => [['xone', listText(c.shapes)]]),\n      Match.tag('Node', (c) => [['node', c.shape]]),\n      Match.tag('Property', (c) => [['property', c.shape]]),\n      Match.tag('QualifiedMinCount', (c) => [\n        ['qualifiedValueShape', c.shape],\n        ['qualifiedMinCount', integer(c.count)],\n        ['qualifiedValueShapesDisjoint', boolean(c.disjoint)],\n      ]),\n      Match.tag('QualifiedMaxCount', (c) => [\n        ['qualifiedValueShape', c.shape],\n        ['qualifiedMaxCount', integer(c.count)],\n        ['qualifiedValueShapesDisjoint', boolean(c.disjoint)],\n      ]),\n      Match.tag('Closed', (c) => [\n        ['closed', boolean(true)],\n        ['ignoredProperties', listText(c.ignoredProperties)],\n      ]),\n      Match.tag('HasValue', (c) => [['hasValue', c.value]]),\n      Match.tag('In', (c) => [['in', listText(c.values)]]),\n      Match.tag('Sparql', () => []),\n      Match.tag('Component', (c) =>\n        c.parameters.map((p) => [Message.localName(p.path), p.value] as const),\n      ),\n      Match.exhaustive,\n    );\n};\n\n/** The `path` variable of message templates: the predicate, or the path in SPARQL syntax. */\nconst pathTerm = (path: Path.Path): Term.Term =>\n  Predicate.isTagged(path, 'PredicatePath') ? path.predicate : Term.literal(Path.toSparql(path));\n\n/** Substitutes `{?var}` / `{$var}` placeholders of result messages. */\nconst substituteMessages = (\n  messages: ReadonlyArray<Term.Literal>,\n  lookup: (name: string) => Option.Option<Term.Term>,\n): ReadonlyArray<Term.Literal> =>\n  messages.map((m) => Message.substitute(m, (name) => Option.getOrUndefined(lookup(name))));\n\n/** The value of the last parameter of that name. */\nconst parameterNamed = (\n  parameters: ReadonlyArray<readonly [string, Term.Term]>,\n  name: string,\n): Option.Option<Term.Term> =>\n  Option.map(\n    Arr.findLast(parameters, ([n]) => n === name),\n    ([, t]) => t,\n  );\n\n/** The built-in template variables `this`, `value` and `path`. */\nconst builtinVariable = (\n  name: string,\n  focus: Term.Term,\n  value: Option.Option<Term.Term>,\n  resultPath: Option.Option<Path.Path>,\n): Option.Option<Option.Option<Term.Term>> =>\n  Match.value(name).pipe(\n    Match.withReturnType<Option.Option<Option.Option<Term.Term>>>(),\n    Match.when('this', () => Option.some(Option.some(focus))),\n    Match.when('value', () => Option.some(value)),\n    Match.when('path', () => Option.some(Option.map(resultPath, pathTerm))),\n    Match.orElse(() => Option.none()),\n  );\n\ninterface Engine {\n  readonly validateShape: (\n    shape: Shapes.Shape,\n    focus: Term.GroundTerm,\n  ) => Effect.Effect<Results, EngineError>;\n  readonly focusNodes: (\n    shape: Shapes.Shape,\n  ) => Effect.Effect<ReadonlyArray<Term.GroundTerm>, EngineError>;\n}\n\nconst noValue = Option.none<Term.GroundTerm>();\n\ntype Keys = MutableHashSet.MutableHashSet<string>;\n\nconst keysOf = (terms: ReadonlyArray<Term.Term>): Keys =>\n  MutableHashSet.fromIterable(Arr.map(terms, (t) => t.key));\n\n/** Ground terms by their N-Triples form, in insertion order. */\ntype Nodes = MutableHashMap.MutableHashMap<string, Term.GroundTerm>;\n\nconst addNew = (out: Nodes) => (t: Term.GroundTerm) => {\n  if (!MutableHashMap.has(out, t.key)) MutableHashMap.set(out, t.key, t);\n};\n\nconst valuesOf = (nodes: Nodes): ReadonlyArray<Term.GroundTerm> =>\n  Arr.fromIterable(MutableHashMap.values(nodes));\n\n/** Number of value nodes conforming to each member shape, for `sh:and` / `sh:or` / `sh:xone`. */\ntype LogicalTest = (conforming: number, members: number) => boolean;\n\nconst andFails: LogicalTest = (conforming, members) => conforming < members;\nconst orFails: LogicalTest = (conforming) => conforming === 0;\nconst xoneFails: LogicalTest = (conforming) => conforming !== 1;\n\nconst makeEngine = (\n  data: Dataset.Dataset,\n  shapes: Shapes.ShapesGraph,\n  options: ValidateOptions,\n  evaluator: Option.Option<Sparql.SparqlConstraintEvaluator['Service']>,\n): Engine => {\n  const memo = MutableHashMap.empty<string, Results>();\n  const active: Keys = MutableHashSet.empty();\n  const superClassCache = MutableHashMap.empty<string, Keys>();\n  const withDetails = options.details === true;\n\n  // -- RDFS reasoning (SHACL instances / SHACL types, §1.5) ------------------\n  const computeSuperClasses = (cls: Term.GroundTerm): Keys => {\n    const seen: Keys = MutableHashSet.make(cls.key);\n    const unseen = (sup: Term.GroundTerm): boolean => {\n      if (MutableHashSet.has(seen, sup.key)) return false;\n      MutableHashSet.add(seen, sup.key);\n      return true;\n    };\n    const nextLevel = (\n      frontier: ReadonlyArray<Term.GroundTerm>,\n    ): Option.Option<readonly [void, ReadonlyArray<Term.GroundTerm>]> =>\n      Arr.isReadonlyArrayEmpty(frontier)\n        ? Option.none()\n        : Option.some([\n            undefined,\n            Arr.flatMap(frontier, (c) =>\n              Term.isLiteral(c)\n                ? []\n                : Arr.filter(Dataset.objectsOf(data, c, rdfs.subClassOf), unseen),\n            ),\n          ]);\n    Iterable.forEach(\n      Iterable.unfold<ReadonlyArray<Term.GroundTerm>, void>([cls], nextLevel),\n      constVoid,\n    );\n    MutableHashMap.set(superClassCache, cls.key, seen);\n    return seen;\n  };\n  const superClassesOf = (cls: Term.GroundTerm): Keys =>\n    Option.getOrElse(MutableHashMap.get(superClassCache, cls.key), () => computeSuperClasses(cls));\n  const isInstanceOf = (node: Term.GroundTerm, cls: Term.Term): boolean =>\n    !Term.isLiteral(node) &&\n    Dataset.objectsOf(data, node, rdf.type).some((t) =>\n      MutableHashSet.has(superClassesOf(t), cls.key),\n    );\n  const instancesOf = (cls: Term.Resource): ReadonlyArray<Term.GroundTerm> => {\n    const out: Nodes = MutableHashMap.empty();\n    Arr.forEach(Dataset.match(data, { predicate: rdf.type }), (q) => {\n      if (\n        !MutableHashMap.has(out, q.subject.key) &&\n        MutableHashSet.has(superClassesOf(q.object), cls.key)\n      )\n        MutableHashMap.set(out, q.subject.key, q.subject);\n    });\n    return valuesOf(out);\n  };\n\n  const objectsOf = (s: Term.GroundTerm, p: Term.NamedNode): ReadonlyArray<Term.GroundTerm> =>\n    Term.isLiteral(s) ? [] : Dataset.objectsOf(data, s, p);\n\n  const shapeById = (id: Shapes.ShapeId): Shapes.Shape =>\n    Option.getOrElse(Shapes.get(shapes, id), (): Shapes.Shape => ({\n      _tag: 'NodeShape',\n      id,\n      targets: [],\n      constraints: [],\n      severity: sh.Violation,\n      messages: [],\n      deactivated: false,\n    }));\n\n  const unsupported = (\n    shape: Shapes.Shape,\n    feature: string,\n  ): Effect.Effect<Results, EngineError> =>\n    options.sparql === 'ignore'\n      ? Effect.succeed([])\n      : Effect.fail(\n          new UnsupportedFeatureError({\n            message: `${feature} used by shape ${shape.id.key} requires a SparqlConstraintEvaluator`,\n            feature,\n            shape: shape.id.key,\n          }),\n        );\n\n  const recursive = (\n    shape: Shapes.Shape,\n    focus: Term.GroundTerm,\n  ): Effect.Effect<Results, EngineError> =>\n    options.recursion === 'ignore'\n      ? Effect.succeed([])\n      : Effect.fail(\n          new RecursiveShapeError({\n            message: `shape ${shape.id.key} is recursive for focus node ${focus.key}`,\n            shape: shape.id.key,\n            focusNode: focus.key,\n          }),\n        );\n\n  const validateShape = (\n    shape: Shapes.Shape,\n    focus: Term.GroundTerm,\n  ): Effect.Effect<Results, EngineError> =>\n    Effect.suspend(() => {\n      if (shape.deactivated) return Effect.succeed([]);\n      const key = `${shape.id.key} ${focus.key}`;\n      const cached = MutableHashMap.get(memo, key);\n      if (Option.isSome(cached)) return Effect.succeed(cached.value);\n      if (MutableHashSet.has(active, key)) return recursive(shape, focus);\n      MutableHashSet.add(active, key);\n      const valueNodes = Predicate.isTagged(shape, 'PropertyShape')\n        ? Path.evaluate(data, focus, shape.path)\n        : [focus];\n      return Effect.forEach(shape.constraints, (c) => evaluate(shape, focus, valueNodes, c), {\n        concurrency: 1,\n      }).pipe(\n        Effect.map((rs) => {\n          const results = rs.flat();\n          MutableHashSet.remove(active, key);\n          MutableHashMap.set(memo, key, results);\n          return results;\n        }),\n      );\n    });\n\n  const conforms = (\n    id: Shapes.ShapeId,\n    node: Term.GroundTerm,\n  ): Effect.Effect<boolean, EngineError> =>\n    Effect.map(validateShape(shapeById(id), node), (rs) => Arr.isReadonlyArrayEmpty(rs));\n\n  const nestedResults = (id: Shapes.ShapeId, v: Term.GroundTerm) => validateShape(shapeById(id), v);\n\n  const evaluate = Effect.fnUntraced(function* (\n    shape: Shapes.Shape,\n    focus: Term.GroundTerm,\n    valueNodes: ReadonlyArray<Term.GroundTerm>,\n    constraint: Shapes.Constraint,\n  ): Effect.fn.Return<Results, EngineError> {\n    const component = Shapes.componentOf(constraint);\n    const shapePath = Predicate.isTagged(shape, 'PropertyShape')\n      ? Option.some(shape.path)\n      : Option.none<Path.Path>();\n    const parameters = coreParameters(constraint);\n    const result = (\n      value: Option.Option<Term.GroundTerm>,\n      extra: { readonly path?: Path.Path; readonly details?: Results } = {},\n    ) => {\n      const resultPath = extra.path === undefined ? shapePath : Option.some(extra.path);\n      return ValidationReport.makeResult({\n        focusNode: focus,\n        sourceShape: shape.id,\n        sourceConstraintComponent: component,\n        severity: shape.severity,\n        resultPath,\n        value,\n        messages: Arr.isReadonlyArrayNonEmpty(shape.messages)\n          ? substituteMessages(shape.messages, (name) =>\n              Option.getOrElse(builtinVariable(name, focus, value, resultPath), () =>\n                parameterNamed(parameters, name),\n              ),\n            )\n          : [Term.literal(defaultMessage(constraint, value))],\n        details: withDetails ? (extra.details ?? []) : [],\n      });\n    };\n    const each = (failed: (v: Term.GroundTerm) => boolean): Results =>\n      valueNodes.filter(failed).map((v) => result(Option.some(v)));\n    const logical = (members: ReadonlyArray<Shapes.ShapeId>, fails: LogicalTest) =>\n      Effect.map(\n        Effect.forEach(\n          valueNodes,\n          (v) =>\n            Effect.map(\n              Effect.forEach(members, (s) => nestedResults(s, v), { concurrency: 1 }),\n              (nested) => {\n                const conforming = nested.filter((rs) => Arr.isReadonlyArrayEmpty(rs)).length;\n                return fails(conforming, members.length)\n                  ? [result(Option.some(v), { details: nested.flat() })]\n                  : [];\n              },\n            ),\n          { concurrency: 1 },\n        ),\n        (perNode) => perNode.flat(),\n      );\n    // A value node counts when it conforms to the qualified shape and, with\n    // `sh:qualifiedValueShapesDisjoint`, to none of the sibling shapes.\n    const qualifiedCount = (c: {\n      readonly shape: Shapes.ShapeId;\n      readonly disjoint: boolean;\n      readonly siblings: ReadonlyArray<Shapes.ShapeId>;\n    }) =>\n      Effect.map(\n        Effect.filter(valueNodes, (v) =>\n          Effect.flatMap(conforms(c.shape, v), (ok) =>\n            !ok || !c.disjoint\n              ? Effect.succeed(ok)\n              : Effect.map(\n                  Effect.findFirst(c.siblings, (s) => conforms(s, v)),\n                  Option.isNone,\n                ),\n          ),\n        ),\n        (counted) => counted.length,\n      );\n    const lessThan = (predicate: Term.NamedNode, ok: (sign: Sign) => boolean) =>\n      Effect.sync(() => {\n        const others = objectsOf(focus, predicate);\n        return Arr.flatMap(valueNodes, (v) =>\n          Arr.map(\n            Arr.filter(others, (o) => !ordered(v, o, ok)),\n            () => result(Option.some(v)),\n          ),\n        );\n      });\n\n    return yield* Match.value(constraint)\n      .pipe(\n        Match.tag('Class', (c) => Effect.sync(() => each((v) => !isInstanceOf(v, c.class)))),\n        Match.tag('Datatype', (c) => Effect.sync(() => each((v) => !hasDatatype(v, c.datatype)))),\n        Match.tag('NodeKind', (c) =>\n          Effect.sync(() => each((v) => !matchesNodeKind(v, c.nodeKind))),\n        ),\n        Match.tag('MinCount', (c) =>\n          Effect.sync(() => (valueNodes.length < c.minCount ? [result(noValue)] : [])),\n        ),\n        Match.tag('MaxCount', (c) =>\n          Effect.sync(() => (valueNodes.length > c.maxCount ? [result(noValue)] : [])),\n        ),\n        Match.tag('MinExclusive', (c) =>\n          Effect.sync(() => each((v) => !ordered(v, c.value, (s) => s === 1))),\n        ),\n        Match.tag('MinInclusive', (c) =>\n          Effect.sync(() => each((v) => !ordered(v, c.value, (s) => s !== -1))),\n        ),\n        Match.tag('MaxExclusive', (c) =>\n          Effect.sync(() => each((v) => !ordered(v, c.value, (s) => s === -1))),\n        ),\n        Match.tag('MaxInclusive', (c) =>\n          Effect.sync(() => each((v) => !ordered(v, c.value, (s) => s !== 1))),\n        ),\n        Match.tag('MinLength', (c) =>\n          Effect.sync(() => each((v) => failsString(v, (s) => codePointLength(s) >= c.minLength))),\n        ),\n        Match.tag('MaxLength', (c) =>\n          Effect.sync(() => each((v) => failsString(v, (s) => codePointLength(s) <= c.maxLength))),\n        ),\n        Match.tag('Pattern', (c) =>\n          Effect.sync(() => each((v) => failsString(v, (s) => c.regex.test(s)))),\n        ),\n        Match.tag('LanguageIn', (c) =>\n          Effect.sync(() =>\n            each(\n              (v) =>\n                !Term.isLiteral(v) || !c.languages.some((range) => langMatches(v.language, range)),\n            ),\n          ),\n        ),\n        Match.tag('UniqueLang', () =>\n          Effect.sync(() => {\n            const languages = Arr.flatMap(valueNodes, (v) =>\n              Term.isLiteral(v) && v.language !== '' ? [v.language.toLowerCase()] : [],\n            );\n            return Arr.map(\n              Arr.filter(Record.values(Arr.groupBy(languages, identity)), (g) => g.length > 1),\n              () => result(noValue),\n            );\n          }),\n        ),\n        Match.tag('Equals', (c) =>\n          Effect.sync(() => {\n            const others = objectsOf(focus, c.predicate);\n            const otherKeys = keysOf(others);\n            const valueKeys = keysOf(valueNodes);\n            return [\n              ...valueNodes\n                .filter((v) => !MutableHashSet.has(otherKeys, v.key))\n                .map((v) => result(Option.some(v))),\n              ...others\n                .filter((o) => !MutableHashSet.has(valueKeys, o.key))\n                .map((o) => result(Option.some(o))),\n            ];\n          }),\n        ),\n        Match.tag('Disjoint', (c) =>\n          Effect.sync(() => {\n            const otherKeys = keysOf(objectsOf(focus, c.predicate));\n            return each((v) => MutableHashSet.has(otherKeys, v.key));\n          }),\n        ),\n        Match.tag('LessThan', (c) => lessThan(c.predicate, (s) => s === -1)),\n        Match.tag('LessThanOrEquals', (c) => lessThan(c.predicate, (s) => s !== 1)),\n        Match.tag('Not', (c) =>\n          Effect.gen(function* () {\n            const conforming = yield* Effect.filter(valueNodes, (v) => conforms(c.shape, v));\n            return conforming.map((v) => result(Option.some(v)));\n          }),\n        ),\n      )\n      .pipe(\n        Match.tag('And', (c) => logical(c.shapes, andFails)),\n        Match.tag('Or', (c) => logical(c.shapes, orFails)),\n        Match.tag('Xone', (c) => logical(c.shapes, xoneFails)),\n        Match.tag('Node', (c) =>\n          Effect.gen(function* () {\n            const nested = c.shape;\n            const perNode = yield* Effect.forEach(\n              valueNodes,\n              (v) =>\n                Effect.map(nestedResults(nested, v), (rs) =>\n                  Arr.isReadonlyArrayNonEmpty(rs) ? [result(Option.some(v), { details: rs })] : [],\n                ),\n              { concurrency: 1 },\n            );\n            return perNode.flat();\n          }),\n        ),\n        Match.tag('Property', (c) =>\n          Effect.gen(function* () {\n            const property = shapeById(c.shape);\n            const perNode = yield* Effect.forEach(valueNodes, (v) => validateShape(property, v), {\n              concurrency: 1,\n            });\n            return perNode.flat();\n          }),\n        ),\n        Match.tag('QualifiedMinCount', (c) =>\n          Effect.map(qualifiedCount(c), (count) => (count < c.count ? [result(noValue)] : [])),\n        ),\n        Match.tag('QualifiedMaxCount', (c) =>\n          Effect.map(qualifiedCount(c), (count) => (count > c.count ? [result(noValue)] : [])),\n        ),\n        Match.tag('Closed', (c) =>\n          Effect.sync(() => {\n            const allowed = keysOf(c.allowedProperties);\n            return Arr.flatMap(valueNodes, (v) =>\n              Term.isLiteral(v)\n                ? []\n                : Arr.flatMap(Dataset.match(data, { subject: v }), (q) =>\n                    MutableHashSet.has(allowed, q.predicate.key)\n                      ? []\n                      : [result(Option.some(q.object), { path: Path.predicate(q.predicate) })],\n                  ),\n            );\n          }),\n        ),\n        Match.tag('HasValue', (c) =>\n          Effect.sync(() =>\n            valueNodes.some((v) => v.key === c.value.key) ? [] : [result(noValue)],\n          ),\n        ),\n        Match.tag('In', (c) =>\n          Effect.sync(() => {\n            const allowed = keysOf(c.values);\n            return each((v) => !MutableHashSet.has(allowed, v.key));\n          }),\n        ),\n        Match.tag('Sparql', 'Component', (c) =>\n          Effect.gen(function* () {\n            if (Option.isNone(evaluator)) {\n              return yield* unsupported(\n                shape,\n                Predicate.isTagged(c, 'Sparql')\n                  ? 'sh:sparql'\n                  : `constraint component ${c.component.key}`,\n              );\n            }\n            const violations = yield* evaluator.value.evaluateConstraint({\n              dataGraph: data,\n              shapesGraph: shapes,\n              shape,\n              constraint: c,\n              focusNode: focus,\n              valueNodes,\n            });\n            return violations.map((violation) => {\n              const focusNode = violation.focusNode ?? focus;\n              const value = Option.fromNullishOr(violation.value);\n              const resultPath =\n                violation.path !== undefined ? Option.some(violation.path) : shapePath;\n              const lookup = (name: string): Option.Option<Term.Term> =>\n                pipe(\n                  Option.fromNullishOr(violation.bindings?.get(name)),\n                  Option.orElse(() => parameterNamed(parameters, name)),\n                  Option.orElse(() =>\n                    Option.flatten(builtinVariable(name, focusNode, value, resultPath)),\n                  ),\n                );\n              const templates =\n                violation.messages !== undefined && Arr.isReadonlyArrayNonEmpty(violation.messages)\n                  ? violation.messages\n                  : shape.messages;\n              return ValidationReport.makeResult({\n                focusNode,\n                sourceShape: shape.id,\n                sourceConstraintComponent: component,\n                sourceConstraint: Predicate.isTagged(c, 'Sparql')\n                  ? Option.some(c.node)\n                  : Option.none(),\n                severity: violation.severity ?? shape.severity,\n                resultPath,\n                value,\n                messages: Arr.isReadonlyArrayNonEmpty(templates)\n                  ? substituteMessages(templates, lookup)\n                  : [Term.literal(defaultMessage(c, value))],\n              });\n            });\n          }),\n        ),\n        Match.exhaustive,\n      );\n  });\n\n  const focusNodes = Effect.fnUntraced(function* (\n    shape: Shapes.Shape,\n  ): Effect.fn.Return<ReadonlyArray<Term.GroundTerm>, EngineError> {\n    const out: Nodes = MutableHashMap.empty();\n    const add = addNew(out);\n    yield* Effect.forEach(\n      shape.targets,\n      Effect.fnUntraced(function* (target) {\n        yield* Match.value(target).pipe(\n          Match.tag('TargetNode', (t) => Effect.sync(() => add(t.node))),\n          Match.tag('TargetClass', (t) =>\n            Effect.sync(() => Arr.forEach(instancesOf(t.class), add)),\n          ),\n          Match.tag('TargetSubjectsOf', (t) =>\n            Effect.sync(() =>\n              Arr.forEach(Dataset.match(data, { predicate: t.predicate }), (q) => add(q.subject)),\n            ),\n          ),\n          Match.tag('TargetObjectsOf', (t) =>\n            Effect.sync(() =>\n              Arr.forEach(Dataset.match(data, { predicate: t.predicate }), (q) => add(q.object)),\n            ),\n          ),\n          Match.tag('SparqlTarget', (t) =>\n            Option.match(evaluator, {\n              onNone: () => unsupported(shape, 'sh:target'),\n              onSome: (ev) =>\n                Effect.map(\n                  ev.selectTargets({ dataGraph: data, shapesGraph: shapes, shape, target: t.node }),\n                  (nodes) => Arr.forEach(nodes, add),\n                ),\n            }),\n          ),\n          Match.exhaustive,\n        );\n      }),\n      { concurrency: 1, discard: true },\n    );\n    return valuesOf(out);\n  });\n\n  return { validateShape, focusNodes };\n};\n\nconst resolveShapes = (\n  shapes: Dataset.Dataset | Shapes.ShapesGraph,\n): Effect.Effect<Shapes.ShapesGraph, Shapes.ShapesGraphError> =>\n  Shapes.isShapesGraph(shapes) ? Effect.succeed(shapes) : Shapes.parse(shapes);\n\n// -----------------------------------------------------------------------------\n// API\n// -----------------------------------------------------------------------------\n\n/** Parses the shapes graph (if needed) and builds the engine over the data graph. */\nconst prepare = Effect.fnUntraced(function* (\n  dataGraph: Dataset.Dataset,\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  options: ValidateOptions,\n) {\n  const shapes = yield* resolveShapes(shapesGraph);\n  const data =\n    options.includeShapesGraph === true ? Dataset.union(dataGraph, shapes.dataset) : dataGraph;\n  const evaluator = yield* Effect.serviceOption(Sparql.SparqlConstraintEvaluator);\n  return { shapes, engine: makeEngine(data, shapes, options, evaluator) };\n});\n\n/**\n * Validates a data graph against a shapes graph (either an RDF dataset, which\n * is parsed first, or a pre-parsed `Shapes.ShapesGraph`).\n *\n * SPARQL-based constraints and targets are delegated to a\n * `Sparql.SparqlConstraintEvaluator` when one is present in the context.\n *\n * @since 0.1.0\n * @category validation\n */\nexport const validate: (\n  dataGraph: Dataset.Dataset,\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  options?: ValidateOptions,\n) => Effect.Effect<ValidationReport.ValidationReport, ValidationError> = Effect.fn(\n  'Shacl.validate',\n)(function* (dataGraph, shapesGraph, options = {}) {\n  const { shapes, engine } = yield* prepare(dataGraph, shapesGraph, options);\n  yield* Effect.annotateCurrentSpan({\n    'shacl.shapes': shapes.shapes.length,\n    'rdf.quads': dataGraph.size,\n  });\n  const perShape = yield* Effect.forEach(\n    shapes.shapes,\n    (shape) =>\n      shape.deactivated || Arr.isReadonlyArrayEmpty(shape.targets)\n        ? Effect.succeed<ReadonlyArray<ValidationReport.ValidationResult>>([])\n        : Effect.flatMap(engine.focusNodes(shape), (foci) =>\n            Effect.map(\n              Effect.forEach(foci, (focus) => engine.validateShape(shape, focus), {\n                concurrency: 1,\n              }),\n              (rs) => rs.flat(),\n            ),\n          ),\n    { concurrency: 1 },\n  );\n  const report = ValidationReport.make(perShape.flat());\n  yield* Effect.annotateCurrentSpan({\n    'shacl.results': report.results.length,\n    'shacl.conforms': report.conforms,\n  });\n  return report;\n});\n\n/**\n * Validates a single focus node against one shape of a shapes graph,\n * ignoring targets.\n *\n * @since 0.1.0\n * @category validation\n */\nexport const validateNode: (\n  dataGraph: Dataset.Dataset,\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  shape: Shapes.ShapeId,\n  focusNode: Term.GroundTerm,\n  options?: ValidateOptions,\n) => Effect.Effect<ValidationReport.ValidationReport, ValidationError> = Effect.fnUntraced(\n  function* (dataGraph, shapesGraph, shapeId, focusNode, options = {}) {\n    const { shapes, engine } = yield* prepare(dataGraph, shapesGraph, options);\n    const shape = Option.getOrUndefined(Shapes.get(shapes, shapeId));\n    if (shape === undefined) return ValidationReport.make([]);\n    return ValidationReport.make(yield* engine.validateShape(shape, focusNode));\n  },\n);\n\n/**\n * Whether a data graph conforms to a shapes graph.\n *\n * @since 0.1.0\n * @category validation\n */\nexport const conforms = (\n  dataGraph: Dataset.Dataset,\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  options?: ValidateOptions,\n): Effect.Effect<boolean, ValidationError> =>\n  Effect.map(validate(dataGraph, shapesGraph, options), (r) => r.conforms);\n\n/**\n * Validates and fails with a `ConformanceError` (carrying the report) when\n * the data graph does not conform; succeeds with the data graph otherwise.\n *\n * @since 0.1.0\n * @category validation\n */\nexport const assertConforms = (\n  dataGraph: Dataset.Dataset,\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  options?: ValidateOptions,\n): Effect.Effect<Dataset.Dataset, ValidationError | ConformanceError> =>\n  Effect.flatMap(validate(dataGraph, shapesGraph, options), (report) =>\n    report.conforms\n      ? Effect.succeed(dataGraph)\n      : Effect.fail(new ConformanceError({ message: ValidationReport.format(report), report })),\n  );\n\n// -----------------------------------------------------------------------------\n// Service\n// -----------------------------------------------------------------------------\n\n/**\n * A validator bound to a pre-compiled shapes graph.\n *\n * @since 0.1.0\n * @category services\n */\nexport class Validator extends Context.Service<\n  Validator,\n  {\n    /** The compiled shapes graph. */\n    readonly shapesGraph: Shapes.ShapesGraph;\n    /** Validates a data graph, producing a report. */\n    readonly validate: (\n      dataGraph: Dataset.Dataset,\n      options?: ValidateOptions,\n    ) => Effect.Effect<ValidationReport.ValidationReport, ValidationError>;\n    /** Whether a data graph conforms. */\n    readonly conforms: (\n      dataGraph: Dataset.Dataset,\n      options?: ValidateOptions,\n    ) => Effect.Effect<boolean, ValidationError>;\n    /** Succeeds with the data graph if it conforms, failing with a `ConformanceError` otherwise. */\n    readonly check: (\n      dataGraph: Dataset.Dataset,\n      options?: ValidateOptions,\n    ) => Effect.Effect<Dataset.Dataset, ValidationError | ConformanceError>;\n  }\n>()('@thomasfosterau/effect-rdf/shacl/Validator') {}\n\n/**\n * Compiles a shapes graph into a `Validator` service implementation. The\n * given options are defaults that individual calls may override.\n *\n * @since 0.1.0\n * @category constructors\n */\nexport const make: (\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  defaults?: ValidateOptions,\n) => Effect.Effect<Validator['Service'], Shapes.ShapesGraphError> = Effect.fnUntraced(function* (\n  shapesGraph,\n  defaults = {},\n) {\n  const compiled = yield* resolveShapes(shapesGraph);\n  const merge = (options?: ValidateOptions) => ({ ...defaults, ...options });\n  return Validator.of({\n    shapesGraph: compiled,\n    validate: (data, options) => validate(data, compiled, merge(options)),\n    conforms: (data, options) => conforms(data, compiled, merge(options)),\n    check: (data, options) => assertConforms(data, compiled, merge(options)),\n  });\n});\n\n/**\n * A layer providing a `Validator` for the given shapes graph.\n *\n * @since 0.1.0\n * @category layers\n */\nexport const layer = (\n  shapesGraph: Dataset.Dataset | Shapes.ShapesGraph,\n  defaults?: ValidateOptions,\n): Layer.Layer<Validator, Shapes.ShapesGraphError> =>\n  Layer.effect(Validator, make(shapesGraph, defaults));\n\n// -----------------------------------------------------------------------------\n// Schema integration\n// -----------------------------------------------------------------------------\n\n/**\n * Options for `schema`: validation options plus the severity that fails\n * decoding.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport interface SchemaOptions extends ValidateOptions {\n  /**\n   * The least severe result that fails decoding: `\"violation\"` (default)\n   * accepts data whose results are only `sh:Warning` or `sh:Info`,\n   * `\"warning\"` also fails on warnings, and `\"info\"` on any result (the\n   * report's own `conforms`, which is false whenever there is any result).\n   * Results with a custom severity count as violations.\n   */\n  readonly failOn?: 'violation' | 'warning' | 'info' | undefined;\n}\n\nconst severityRank = (severity: Term.NamedNode): number =>\n  severity.value === sh.Info.value ? 0 : severity.value === sh.Warning.value ? 1 : 2;\n\nconst thresholdRank = { info: 0, warning: 1, violation: 2 } as const;\n\n/**\n * A `Schema` that accepts a `Dataset` only if it conforms to the given shapes\n * graph. Decoding fails with a `SchemaIssue.Composite` holding one\n * `InvalidValue` issue per failing result: its `message` annotation is the\n * formatted result (`ValidationReport.formatResult`) and its `result`\n * annotation the `ValidationResult` itself, for consumers that inspect\n * failures (focus node, path, constraint component, severity, messages). By\n * default only `sh:Violation` results fail (see `SchemaOptions.failOn`).\n * Encoding is the identity.\n *\n * Compose it with a syntax codec to parse and validate in one decode:\n * `Turtle.codec.schema.pipe(Schema.decodeTo(Validator.schema(shapes)))`.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const schema = (\n  shapesGraph: Shapes.ShapesGraph,\n  options?: SchemaOptions,\n): Schema.decodeTo<Schema.declare<Dataset.Dataset>, Schema.declare<Dataset.Dataset>> => {\n  const threshold = thresholdRank[options?.failOn ?? 'violation'];\n  return Dataset.DatasetSchema.pipe(\n    Schema.decodeTo(\n      Dataset.DatasetSchema,\n      SchemaTransformation.transformEffect({\n        decode: (data: Dataset.Dataset, parseOptions) =>\n          validate(data, shapesGraph, options).pipe(\n            Effect.mapError(\n              (e) => new SchemaIssue.InvalidValue({ message: e.message }, data, parseOptions),\n            ),\n            Effect.flatMap((report) =>\n              Arr.match(\n                Arr.filter(report.results, (r) => severityRank(r.severity) >= threshold),\n                {\n                  onEmpty: () => Effect.succeed(data),\n                  onNonEmpty: (failing) =>\n                    Effect.fail(\n                      new SchemaIssue.Composite(\n                        Dataset.DatasetSchema.ast,\n                        Arr.map(\n                          failing,\n                          (r) =>\n                            new SchemaIssue.InvalidValue(\n                              { message: ValidationReport.formatResult(r), result: r },\n                              r,\n                              parseOptions,\n                            ),\n                        ),\n                        data,\n                      ),\n                    ),\n                },\n              ),\n            ),\n          ),\n        encode: (data: Dataset.Dataset) => Effect.succeed(data),\n      }),\n    ),\n  );\n};\n\n/**\n * The SHACL `sh:Violation`, `sh:Warning` and `sh:Info` severities.\n *\n * @since 0.1.0\n * @category constants\n */\nexport const severities = {\n  Violation: sh.Violation,\n  Warning: sh.Warning,\n  Info: sh.Info,\n} as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAYA,MAAM,aAAa;AAUnB,MAAM,QAA8C,MAAM,KAAgB,CAAC,CAAC,KAC1E,MAAM,IAAI,YAAY,MAAM,OAAO,KAAU;CAAE,MAAM;CAAW,OAAO,EAAE;AAAM,CAAC,CAAC,GACjF,MAAM,IAAI,YAAY,MAAM,OAAO,KAAU;CAAE,MAAM;CAAW,OAAO,EAAE;AAAM,CAAC,CAAC,GACjF,MAAM,IAAI,SAAS,WAAW,MAAM,OAAO,KAAU;CAAE,MAAM;CAAS,OAAO,EAAE;AAAM,CAAC,CAAC,GACvF,MAAM,aAAa,OAAO,KAAU,CAAC,CACvC;AAEA,MAAM,QAAQ,MAAqB,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAE5D,MAAM,WAAW,MACf,EAAE,SAAS,UACP,EAAE,QACF,OAAO,EAAE,SAAS,YAAY,EAAE,QAAQ,WAAW,OAAO,EAAE,KAAK,CAAC;AAExE,MAAM,aAAa,MACjB,EAAE,SAAS,YAAY,WAAW,WAAW,EAAE,KAAK,IAAI,EAAE;AAE5D,MAAM,cAAc,GAAQ,MAAgC;CAC1D,IAAI,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS;EAC5C,MAAM,IAAI,QAAQ,CAAC;EACnB,MAAM,IAAI,QAAQ,CAAC;EACnB,IAAI,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,GAAG,OAAO,OAAO,KAAK;EAC3D,OAAO,OAAO,KAAK,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE;CAChE;CACA,IAAI,EAAE,SAAS,aAAa,EAAE,SAAS,WACrC,OAAO,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,KAAK,EAAE,QAAQ,EAAE,QAAQ,IAAI,CAAC;CACvE,OAAO,OAAO,KAAK,WAAW,MAAM,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;AACjE;AAEA,MAAM,iBAAiB;AAEvB,MAAM,SAAY,GAAM,MAAgB,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAEjE,MAAMA,aAAW,UAAU,SAAS,QAAQ;AAC5C,MAAM,YAAY,UAAU,SAAS,SAAS;AAC9C,MAAM,aAAa,UAAU,SAAS,UAAU;AAChD,MAAM,aAAa,UAAU,SAAS,UAAU;AAChD,MAAM,UAAU,UAAU,SAAS,OAAO;;AAG1C,MAAM,qBAAqB,GAAiB,MAC1C,EAAE,aAAa,MAAM,EAAE,aAAa,KAChC,EAAE,SAAS,YAAY,MAAM,EAAE,SAAS,YAAY,IACpD,EAAE,SAAS,UAAU,cAAc,EAAE,SAAS,UAAU;AAE9D,MAAM,OAAO,OAAO,KAAW;AAE/B,MAAM,oBACJ,GACA,MACwB;CACxB,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;CAC9B,MAAM,IAAI,EAAE,cAAc,EAAE;CAG5B,OAAO,UAAU,YAAY,EAAE,QAAQ,MAAM,UAAU,YAAY,EAAE,QAAQ,KAC3E,KAAK,IAAI,CAAC,IAAI,iBACZ,OAAO,KAAK,KAAK,CAAC,CAAC,IACnB;AACN;AAEA,MAAM,oBACJ,GACA,MACwB;CACxB,MAAM,IAAI,KAAK,EAAE,SAAS,EAAE,MAAM;CAClC,MAAM,IAAI,KAAK,EAAE,UAAU,EAAE,OAAO;CACpC,IAAI,MAAM,GAAG,OAAO,OAAO,KAAK,CAAC;CACjC,OAAO,MAAM,KAAK,MAAM,IAAI,OAAO,KAAK,CAAC,IAAI;AAC/C;AAIA,MAAM,iBACJ,IACA,IACA,GACA,MACwB;CACxB,IAAIA,WAAS,EAAE,GACb,OAAOA,WAAS,EAAE,KAAK,kBAAkB,GAAG,CAAC,IAAI,OAAO,KAAK,MAAM,GAAG,OAAO,GAAG,KAAK,CAAC,IAAI;CAC5F,IAAI,UAAU,EAAE,GACd,OAAO,UAAU,EAAE,IAAI,OAAO,KAAK,GAAG,UAAU,GAAG,QAAQ,IAAI,GAAG,QAAQ,IAAI,EAAE,IAAI;CACtF,IAAI,WAAW,EAAE,GAAG,OAAO,WAAW,EAAE,IAAI,iBAAiB,IAAI,EAAE,IAAI;CACvE,IAAI,WAAW,EAAE,GAAG,OAAO,WAAW,EAAE,IAAI,iBAAiB,IAAI,EAAE,IAAI;CACvE,OAAO,QAAQ,EAAE,KAAK,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,OAAO,KAAK,CAAC,IAAI;AAC1E;AAEA,MAAM,mBAAmB,GAAiB,MAAyC;CACjF,MAAM,KAAKC,QAAY,CAAC;CACxB,MAAM,KAAKA,QAAY,CAAC;CACxB,MAAM,KAAK,MAAM,EAAE;CACnB,MAAM,KAAK,MAAM,EAAE;CACnB,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG,OAAO,WAAW,GAAG,OAAO,GAAG,KAAK;CAChF,IAAI,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,KAAK;CAC/D,OAAO,cAAc,IAAI,IAAI,GAAG,CAAC;AACnC;;;;;;;AAQA,MAAa,gBAAgB,GAAc,MACzCC,UAAe,CAAC,KAAKA,UAAe,CAAC,IAAI,gBAAgB,GAAG,CAAC,IAAI,OAAO,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5E/E,MAAM,QAAQ,OAAO,WAAW,OAAO,eAAe,OAAO,MAAM,CAAC;AAEpE,MAAM,EAAE,KAAK,MAAM,QAAQC;;;;;;;;;AAc3B,IAAa,sBAAb,cAAyC,OAAO,YAAiC,CAAC,CAChF,uBACA;CACE,SAAS,OAAO;CAChB,OAAO,OAAO;CACd,WAAW,OAAO;AACpB,CACF,CAAC,CAAC,CAAC;;;;;;;;;AAUH,IAAa,0BAAb,cAA6C,OAAO,YAAqC,CAAC,CACxF,2BACA;CACE,SAAS,OAAO;CAChB,SAAS,OAAO;CAChB,OAAO,OAAO;AAChB,CACF,CAAC,CAAC,CAAC;;;;;;;;AASH,IAAa,mBAAb,cAAsC,OAAO,YAA8B,CAAC,CAAC,oBAAoB;CAC/F,SAAS,OAAO;CAChB,QAAQC;AACV,CAAC,CAAC,CAAC,CAAC;AA4DJ,MAAM,eAAe,KAAa,UAA2B;CAC3D,IAAI,QAAQ,IAAI,OAAO;CACvB,IAAI,UAAU,KAAK,OAAO;CAC1B,MAAM,IAAI,IAAI,YAAY;CAC1B,MAAM,IAAI,MAAM,YAAY;CAC5B,OAAO,MAAM,KAAK,EAAE,WAAW,GAAG,EAAE,EAAE;AACxC;AAIA,MAAM,MAAM,OAAO,KAAoB,KAAK;AAC5C,MAAM,aAAa,OAAO,KAAoB,WAAW;AACzD,MAAM,UAAU,OAAO,KAAoB,SAAS;AAEpD,MAAM,cAAc,MAClBC,YAAiB,CAAC,IACd,MACAC,YAAiB,CAAC,IAChB,aACAC,UAAe,CAAC,IACd,UACA,OAAO,KAAK;AAEtB,MAAM,mBAAmB,GAAc,SACrC,OAAO,OAAO,WAAW,CAAC,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC;AAEtD,MAAM,eAAe,GAAc,aAAsC;CACvE,IAAI,CAACA,UAAe,CAAC,KAAK,EAAE,SAAS,UAAU,SAAS,OAAO,OAAO;CACtE,IAAI,SAAS,UAAU,IAAI,WAAW,SAAS,SAAS,UAAU,IAAI,cAAc,OAClF,OAAO,EAAE,aAAa;CACxB,IAAI,EAAE,aAAa,IAAI,OAAO;CAC9B,OAAOC,aAAiB,CAAC;AAC3B;AAEA,MAAM,eAAe,MACnBH,YAAiB,CAAC,KAAKE,UAAe,CAAC,IAAI,OAAO,KAAK,EAAE,KAAK,IAAI,OAAO,KAAK;;AAGhF,MAAM,eAAe,GAAc,OACjC,CAAC,OAAO,OAAO,YAAY,CAAC,GAAG,EAAE;AAEnC,MAAM,QAAQ,MAAiB,EAAE;;AAGjC,MAAM,gBAAgB;;AAGtB,MAAM,mBAAmB,MAAsB,EAAE,QAAQ,eAAe,GAAG,CAAC,CAAC;;AAK7E,MAAM,WAAW,GAAc,GAAc,OAC3C,OAAO,OAAO,aAAa,GAAG,CAAC,GAAG,EAAE;AAEtC,MAAM,kBAAkB,YAA+B,UAA4C;CACjG,MAAM,IAAI,OAAO,MAAM,OAAO;EAAE,cAAc;EAAS,SAAS,MAAM,SAAS,KAAK,CAAC;CAAI,CAAC;CAC1F,OAAO,MAAM,MAAM,UAAU,CAAC,CAC3B,KACC,MAAM,IAAI,UAAU,MAAM,GAAG,EAAE,yBAAyB,KAAK,EAAE,KAAK,GAAG,GACvE,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,0BAA0B,KAAK,EAAE,QAAQ,GAAG,GAC9E,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,8BAA8B,EAAE,UAAU,GAC5E,MAAM,IAAI,aAAa,MAAM,aAAa,EAAE,SAAS,QAAQ,GAC7D,MAAM,IAAI,aAAa,MAAM,aAAa,EAAE,SAAS,QAAQ,GAC7D,MAAM,IAAI,iBAAiB,MAAM,GAAG,EAAE,uBAAuB,KAAK,EAAE,KAAK,GAAG,GAC5E,MAAM,IAAI,iBAAiB,MAAM,GAAG,EAAE,mCAAmC,KAAK,EAAE,KAAK,GAAG,GACxF,MAAM,IAAI,iBAAiB,MAAM,GAAG,EAAE,oBAAoB,KAAK,EAAE,KAAK,GAAG,GACzE,MAAM,IAAI,iBAAiB,MAAM,GAAG,EAAE,gCAAgC,KAAK,EAAE,KAAK,GAAG,GACrF,MAAM,IAAI,cAAc,MAAM,GAAG,EAAE,mBAAmB,EAAE,UAAU,YAAY,GAC9E,MAAM,IAAI,cAAc,MAAM,GAAG,EAAE,kBAAkB,EAAE,UAAU,YAAY,GAC7E,MAAM,IAAI,YAAY,MAAM,GAAG,EAAE,0BAA0B,MAAM,EAAE,OAAO,GAAG,GAC7E,MAAM,IACJ,eACC,MAAM,GAAG,EAAE,oCAAoC,EAAE,UAAU,KAAK,IAAI,EAAE,EACzE,GACA,MAAM,IAAI,oBAAoB,0CAA0C,GACxE,MAAM,IAAI,WAAW,MAAM,GAAG,EAAE,iCAAiC,KAAK,EAAE,SAAS,GAAG,GACpF,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,sBAAsB,KAAK,EAAE,SAAS,GAAG,GAC3E,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,kCAAkC,KAAK,EAAE,SAAS,GAAG,GACvF,MAAM,IACJ,qBACC,MAAM,GAAG,EAAE,8CAA8C,KAAK,EAAE,SAAS,GAC5E,CACF,CAAC,CACA,KACC,MAAM,IAAI,QAAQ,MAAM,GAAG,EAAE,iCAAiC,KAAK,EAAE,KAAK,GAAG,GAC7E,MAAM,IAAI,aAAa,GAAG,EAAE,uCAAuC,GACnE,MAAM,IAAI,YAAY,GAAG,EAAE,uCAAuC,GAClE,MAAM,IAAI,cAAc,GAAG,EAAE,+CAA+C,GAC5E,MAAM,IAAI,SAAS,MAAM,GAAG,EAAE,6BAA6B,KAAK,EAAE,KAAK,GAAG,GAC1E,MAAM,IAAI,aAAa,MAAM,GAAG,EAAE,sCAAsC,KAAK,EAAE,KAAK,GAAG,GACvF,MAAM,IACJ,sBACC,MAAM,aAAa,EAAE,MAAM,2BAA2B,KAAK,EAAE,KAAK,GACrE,GACA,MAAM,IACJ,sBACC,MAAM,aAAa,EAAE,MAAM,2BAA2B,KAAK,EAAE,KAAK,GACrE,GACA,MAAM,IACJ,gBAEE,uDAAuD,OAAO,MAAM,OAAO;EAAE,cAAc;EAAI,QAAQ;CAAK,CAAC,EAAE,EACnH,GACA,MAAM,IAAI,aAAa,MAAM,0BAA0B,KAAK,EAAE,KAAK,GAAG,GACtE,MAAM,IAAI,YAAY,GAAG,EAAE,kCAAkC,GAC7D,MAAM,IAAI,UAAU,mBAAmB,GAAG,EAAE,oCAAoC,GAChF,MAAM,UACR;AACJ;AAEA,MAAM,WAAW,MAAcE,QAAa,OAAO,CAAC,GAAG,IAAI,OAAO;AAClE,MAAM,WAAW,MAAeA,QAAa,OAAO,CAAC,GAAG,IAAI,OAAO;AACnE,MAAM,YAAY,UAChBA,QAAa,MAAM,IAAIC,OAAe,CAAC,CAAC,KAAK,IAAI,CAAC;;AAGpD,MAAM,kBACJ,eACgD;CAChD,OAAO,MAAM,MAAM,UAAU,CAAC,CAC3B,KACC,MAAM,eAA4D,GAClE,MAAM,IAAI,UAAU,MAAM,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,GAC9C,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,GACvD,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAYC,UAAe,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAC5E,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAChE,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAChE,MAAM,IAAI,iBAAiB,MAAM,CAAC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,GAC5D,MAAM,IAAI,iBAAiB,MAAM,CAAC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,GAC5D,MAAM,IAAI,iBAAiB,MAAM,CAAC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,GAC5D,MAAM,IAAI,iBAAiB,MAAM,CAAC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,GAC5D,MAAM,IAAI,cAAc,MAAM,CAAC,CAAC,aAAa,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,GACnE,MAAM,IAAI,cAAc,MAAM,CAAC,CAAC,aAAa,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,GACnE,MAAM,IAAI,YAAY,MAAM,CAC1B,CAAC,WAAWF,QAAa,EAAE,OAAO,CAAC,GACnC,CAAC,SAASA,QAAa,EAAE,KAAK,CAAC,CACjC,CAAC,GACD,MAAM,IAAI,eAAe,MAAM,CAAC,CAAC,cAAcA,QAAa,EAAE,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GACrF,MAAM,IAAI,oBAAoB,CAAC,CAAC,cAAc,QAAQ,IAAI,CAAC,CAAC,CAAC,GAC7D,MAAM,IAAI,WAAW,MAAM,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,GACpD,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,GACxD,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,GACxD,MAAM,IAAI,qBAAqB,MAAM,CAAC,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAC,CAC1E,CAAC,CACA,KACC,MAAM,IAAI,QAAQ,MAAM,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,GAC1C,MAAM,IAAI,QAAQ,MAAM,CAAC,CAAC,OAAO,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GACrD,MAAM,IAAI,OAAO,MAAM,CAAC,CAAC,MAAM,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GACnD,MAAM,IAAI,SAAS,MAAM,CAAC,CAAC,QAAQ,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GACvD,MAAM,IAAI,SAAS,MAAM,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAC5C,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,GACpD,MAAM,IAAI,sBAAsB,MAAM;EACpC,CAAC,uBAAuB,EAAE,KAAK;EAC/B,CAAC,qBAAqB,QAAQ,EAAE,KAAK,CAAC;EACtC,CAAC,gCAAgC,QAAQ,EAAE,QAAQ,CAAC;CACtD,CAAC,GACD,MAAM,IAAI,sBAAsB,MAAM;EACpC,CAAC,uBAAuB,EAAE,KAAK;EAC/B,CAAC,qBAAqB,QAAQ,EAAE,KAAK,CAAC;EACtC,CAAC,gCAAgC,QAAQ,EAAE,QAAQ,CAAC;CACtD,CAAC,GACD,MAAM,IAAI,WAAW,MAAM,CACzB,CAAC,UAAU,QAAQ,IAAI,CAAC,GACxB,CAAC,qBAAqB,SAAS,EAAE,iBAAiB,CAAC,CACrD,CAAC,GACD,MAAM,IAAI,aAAa,MAAM,CAAC,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,GACpD,MAAM,IAAI,OAAO,MAAM,CAAC,CAAC,MAAM,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,GACnD,MAAM,IAAI,gBAAgB,CAAC,CAAC,GAC5B,MAAM,IAAI,cAAc,MACtB,EAAE,WAAW,KAAK,MAAM,CAACG,UAAkB,EAAE,IAAI,GAAG,EAAE,KAAK,CAAU,CACvE,GACA,MAAM,UACR;AACJ;;AAGA,MAAM,YAAY,SAChB,UAAU,SAAS,MAAM,eAAe,IAAI,KAAK,YAAYH,QAAaI,SAAc,IAAI,CAAC;;AAG/F,MAAM,sBACJ,UACA,WAEA,SAAS,KAAK,MAAMC,WAAmB,IAAI,SAAS,OAAO,eAAe,OAAO,IAAI,CAAC,CAAC,CAAC;;AAG1F,MAAM,kBACJ,YACA,SAEA,OAAO,IACL,IAAI,SAAS,aAAa,CAAC,OAAO,MAAM,IAAI,IAC3C,GAAG,OAAO,CACb;;AAGF,MAAM,mBACJ,MACA,OACA,OACA,eAEA,MAAM,MAAM,IAAI,CAAC,CAAC,KAChB,MAAM,eAAwD,GAC9D,MAAM,KAAK,cAAc,OAAO,KAAK,OAAO,KAAK,KAAK,CAAC,CAAC,GACxD,MAAM,KAAK,eAAe,OAAO,KAAK,KAAK,CAAC,GAC5C,MAAM,KAAK,cAAc,OAAO,KAAK,OAAO,IAAI,YAAY,QAAQ,CAAC,CAAC,GACtE,MAAM,aAAa,OAAO,KAAK,CAAC,CAClC;AAYF,MAAM,UAAU,OAAO,KAAsB;AAI7C,MAAM,UAAU,UACd,eAAe,aAAa,IAAI,IAAI,QAAQ,MAAM,EAAE,GAAG,CAAC;AAK1D,MAAM,UAAU,SAAgB,MAAuB;CACrD,IAAI,CAAC,eAAe,IAAI,KAAK,EAAE,GAAG,GAAG,eAAe,IAAI,KAAK,EAAE,KAAK,CAAC;AACvE;AAEA,MAAM,YAAY,UAChB,IAAI,aAAa,eAAe,OAAO,KAAK,CAAC;AAK/C,MAAM,YAAyB,YAAY,YAAY,aAAa;AACpE,MAAM,WAAwB,eAAe,eAAe;AAC5D,MAAM,aAA0B,eAAe,eAAe;AAE9D,MAAM,cACJ,MACA,QACA,SACA,cACW;CACX,MAAM,OAAO,eAAe,MAAuB;CACnD,MAAM,SAAe,eAAe,MAAM;CAC1C,MAAM,kBAAkB,eAAe,MAAoB;CAC3D,MAAM,cAAc,QAAQ,YAAY;CAGxC,MAAM,uBAAuB,QAA+B;EAC1D,MAAM,OAAa,eAAe,KAAK,IAAI,GAAG;EAC9C,MAAM,UAAU,QAAkC;GAChD,IAAI,eAAe,IAAI,MAAM,IAAI,GAAG,GAAG,OAAO;GAC9C,eAAe,IAAI,MAAM,IAAI,GAAG;GAChC,OAAO;EACT;EACA,MAAM,aACJ,aAEA,IAAI,qBAAqB,QAAQ,IAC7B,OAAO,KAAK,IACZ,OAAO,KAAK,CACV,KAAA,GACA,IAAI,QAAQ,WAAW,MACrBP,UAAe,CAAC,IACZ,CAAC,IACD,IAAI,OAAOQ,UAAkB,MAAM,GAAG,KAAK,UAAU,GAAG,MAAM,CACpE,CACF,CAAC;EACP,SAAS,QACP,SAAS,OAA6C,CAAC,GAAG,GAAG,SAAS,GACtE,SACF;EACA,eAAe,IAAI,iBAAiB,IAAI,KAAK,IAAI;EACjD,OAAO;CACT;CACA,MAAM,kBAAkB,QACtB,OAAO,UAAU,eAAe,IAAI,iBAAiB,IAAI,GAAG,SAAS,oBAAoB,GAAG,CAAC;CAC/F,MAAM,gBAAgB,MAAuB,QAC3C,CAACR,UAAe,IAAI,KACpBQ,UAAkB,MAAM,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,MAC5C,eAAe,IAAI,eAAe,CAAC,GAAG,IAAI,GAAG,CAC/C;CACF,MAAM,eAAe,QAAuD;EAC1E,MAAM,MAAa,eAAe,MAAM;EACxC,IAAI,QAAQC,MAAc,MAAM,EAAE,WAAW,IAAI,KAAK,CAAC,IAAI,MAAM;GAC/D,IACE,CAAC,eAAe,IAAI,KAAK,EAAE,QAAQ,GAAG,KACtC,eAAe,IAAI,eAAe,EAAE,MAAM,GAAG,IAAI,GAAG,GAEpD,eAAe,IAAI,KAAK,EAAE,QAAQ,KAAK,EAAE,OAAO;EACpD,CAAC;EACD,OAAO,SAAS,GAAG;CACrB;CAEA,MAAMC,eAAa,GAAoB,MACrCV,UAAe,CAAC,IAAI,CAAC,IAAIQ,UAAkB,MAAM,GAAG,CAAC;CAEvD,MAAM,aAAa,OACjB,OAAO,UAAUG,IAAW,QAAQ,EAAE,UAAwB;EAC5D,MAAM;EACN;EACA,SAAS,CAAC;EACV,aAAa,CAAC;EACd,UAAU,GAAG;EACb,UAAU,CAAC;EACX,aAAa;CACf,EAAE;CAEJ,MAAM,eACJ,OACA,YAEA,QAAQ,WAAW,WACf,OAAO,QAAQ,CAAC,CAAC,IACjB,OAAO,KACL,IAAI,wBAAwB;EAC1B,SAAS,GAAG,QAAQ,iBAAiB,MAAM,GAAG,IAAI;EAClD;EACA,OAAO,MAAM,GAAG;CAClB,CAAC,CACH;CAEN,MAAM,aACJ,OACA,UAEA,QAAQ,cAAc,WAClB,OAAO,QAAQ,CAAC,CAAC,IACjB,OAAO,KACL,IAAI,oBAAoB;EACtB,SAAS,SAAS,MAAM,GAAG,IAAI,+BAA+B,MAAM;EACpE,OAAO,MAAM,GAAG;EAChB,WAAW,MAAM;CACnB,CAAC,CACH;CAEN,MAAM,iBACJ,OACA,UAEA,OAAO,cAAc;EACnB,IAAI,MAAM,aAAa,OAAO,OAAO,QAAQ,CAAC,CAAC;EAC/C,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM;EACrC,MAAM,SAAS,eAAe,IAAI,MAAM,GAAG;EAC3C,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,OAAO,QAAQ,OAAO,KAAK;EAC7D,IAAI,eAAe,IAAI,QAAQ,GAAG,GAAG,OAAO,UAAU,OAAO,KAAK;EAClE,eAAe,IAAI,QAAQ,GAAG;EAC9B,MAAM,aAAa,UAAU,SAAS,OAAO,eAAe,IACxDC,SAAc,MAAM,OAAO,MAAM,IAAI,IACrC,CAAC,KAAK;EACV,OAAO,OAAO,QAAQ,MAAM,cAAc,MAAMC,WAAS,OAAO,OAAO,YAAY,CAAC,GAAG,EACrF,aAAa,EACf,CAAC,CAAC,CAAC,KACD,OAAO,KAAK,OAAO;GACjB,MAAM,UAAU,GAAG,KAAK;GACxB,eAAe,OAAO,QAAQ,GAAG;GACjC,eAAe,IAAI,MAAM,KAAK,OAAO;GACrC,OAAO;EACT,CAAC,CACH;CACF,CAAC;CAEH,MAAM,YACJ,IACA,SAEA,OAAO,IAAI,cAAc,UAAU,EAAE,GAAG,IAAI,IAAI,OAAO,IAAI,qBAAqB,EAAE,CAAC;CAErF,MAAM,iBAAiB,IAAoB,MAAuB,cAAc,UAAU,EAAE,GAAG,CAAC;CAEhG,MAAMA,aAAW,OAAO,WAAW,WACjC,OACA,OACA,YACA,YACwC;EACxC,MAAM,YAAYC,YAAmB,UAAU;EAC/C,MAAM,YAAY,UAAU,SAAS,OAAO,eAAe,IACvD,OAAO,KAAK,MAAM,IAAI,IACtB,OAAO,KAAgB;EAC3B,MAAM,aAAa,eAAe,UAAU;EAC5C,MAAM,UACJ,OACA,QAAmE,CAAC,MACjE;GACH,MAAM,aAAa,MAAM,SAAS,KAAA,IAAY,YAAY,OAAO,KAAK,MAAM,IAAI;GAChF,OAAOC,WAA4B;IACjC,WAAW;IACX,aAAa,MAAM;IACnB,2BAA2B;IAC3B,UAAU,MAAM;IAChB;IACA;IACA,UAAU,IAAI,wBAAwB,MAAM,QAAQ,IAChD,mBAAmB,MAAM,WAAW,SAClC,OAAO,UAAU,gBAAgB,MAAM,OAAO,OAAO,UAAU,SAC7D,eAAe,YAAY,IAAI,CACjC,CACF,IACA,CAACb,QAAa,eAAe,YAAY,KAAK,CAAC,CAAC;IACpD,SAAS,cAAe,MAAM,WAAW,CAAC,IAAK,CAAC;GAClD,CAAC;EACH;EACA,MAAM,QAAQ,WACZ,WAAW,OAAO,MAAM,CAAC,CAAC,KAAK,MAAM,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC;EAC7D,MAAM,WAAW,SAAwC,UACvD,OAAO,IACL,OAAO,QACL,aACC,MACC,OAAO,IACL,OAAO,QAAQ,UAAU,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,aAAa,EAAE,CAAC,IACrE,WAAW;GACV,MAAM,aAAa,OAAO,QAAQ,OAAO,IAAI,qBAAqB,EAAE,CAAC,CAAC,CAAC;GACvE,OAAO,MAAM,YAAY,QAAQ,MAAM,IACnC,CAAC,OAAO,OAAO,KAAK,CAAC,GAAG,EAAE,SAAS,OAAO,KAAK,EAAE,CAAC,CAAC,IACnD,CAAC;EACP,CACF,GACF,EAAE,aAAa,EAAE,CACnB,IACC,YAAY,QAAQ,KAAK,CAC5B;EAGF,MAAM,kBAAkB,MAKtB,OAAO,IACL,OAAO,OAAO,aAAa,MACzB,OAAO,QAAQ,SAAS,EAAE,OAAO,CAAC,IAAI,OACpC,CAAC,MAAM,CAAC,EAAE,WACN,OAAO,QAAQ,EAAE,IACjB,OAAO,IACL,OAAO,UAAU,EAAE,WAAW,MAAM,SAAS,GAAG,CAAC,CAAC,GAClD,OAAO,MACT,CACN,CACF,IACC,YAAY,QAAQ,MACvB;EACF,MAAM,YAAY,WAA2B,OAC3C,OAAO,WAAW;GAChB,MAAM,SAASQ,YAAU,OAAO,SAAS;GACzC,OAAO,IAAI,QAAQ,aAAa,MAC9B,IAAI,IACF,IAAI,OAAO,SAAS,MAAM,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC,SACtC,OAAO,OAAO,KAAK,CAAC,CAAC,CAC7B,CACF;EACF,CAAC;EAEH,OAAO,OAAO,MAAM,MAAM,UAAU,CAAC,CAClC,KACC,MAAM,IAAI,UAAU,MAAM,OAAO,WAAW,MAAM,MAAM,CAAC,aAAa,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GACnF,MAAM,IAAI,aAAa,MAAM,OAAO,WAAW,MAAM,MAAM,CAAC,YAAY,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,GACxF,MAAM,IAAI,aAAa,MACrB,OAAO,WAAW,MAAM,MAAM,CAAC,gBAAgB,GAAG,EAAE,QAAQ,CAAC,CAAC,CAChE,GACA,MAAM,IAAI,aAAa,MACrB,OAAO,WAAY,WAAW,SAAS,EAAE,WAAW,CAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAE,CAC7E,GACA,MAAM,IAAI,aAAa,MACrB,OAAO,WAAY,WAAW,SAAS,EAAE,WAAW,CAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAE,CAC7E,GACA,MAAM,IAAI,iBAAiB,MACzB,OAAO,WAAW,MAAM,MAAM,CAAC,QAAQ,GAAG,EAAE,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC,CACrE,GACA,MAAM,IAAI,iBAAiB,MACzB,OAAO,WAAW,MAAM,MAAM,CAAC,QAAQ,GAAG,EAAE,QAAQ,MAAM,MAAM,EAAE,CAAC,CAAC,CACtE,GACA,MAAM,IAAI,iBAAiB,MACzB,OAAO,WAAW,MAAM,MAAM,CAAC,QAAQ,GAAG,EAAE,QAAQ,MAAM,MAAM,EAAE,CAAC,CAAC,CACtE,GACA,MAAM,IAAI,iBAAiB,MACzB,OAAO,WAAW,MAAM,MAAM,CAAC,QAAQ,GAAG,EAAE,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC,CACrE,GACA,MAAM,IAAI,cAAc,MACtB,OAAO,WAAW,MAAM,MAAM,YAAY,IAAI,MAAM,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CACzF,GACA,MAAM,IAAI,cAAc,MACtB,OAAO,WAAW,MAAM,MAAM,YAAY,IAAI,MAAM,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CACzF,GACA,MAAM,IAAI,YAAY,MACpB,OAAO,WAAW,MAAM,MAAM,YAAY,IAAI,MAAM,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CACvE,GACA,MAAM,IAAI,eAAe,MACvB,OAAO,WACL,MACG,MACC,CAACV,UAAe,CAAC,KAAK,CAAC,EAAE,UAAU,MAAM,UAAU,YAAY,EAAE,UAAU,KAAK,CAAC,CACrF,CACF,CACF,GACA,MAAM,IAAI,oBACR,OAAO,WAAW;GAChB,MAAM,YAAY,IAAI,QAAQ,aAAa,MACzCA,UAAe,CAAC,KAAK,EAAE,aAAa,KAAK,CAAC,EAAE,SAAS,YAAY,CAAC,IAAI,CAAC,CACzE;GACA,OAAO,IAAI,IACT,IAAI,OAAO,OAAO,OAAO,IAAI,QAAQ,WAAW,QAAQ,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,SACzE,OAAO,OAAO,CACtB;EACF,CAAC,CACH,GACA,MAAM,IAAI,WAAW,MACnB,OAAO,WAAW;GAChB,MAAM,SAASU,YAAU,OAAO,EAAE,SAAS;GAC3C,MAAM,YAAY,OAAO,MAAM;GAC/B,MAAM,YAAY,OAAO,UAAU;GACnC,OAAO,CACL,GAAG,WACA,QAAQ,MAAM,CAAC,eAAe,IAAI,WAAW,EAAE,GAAG,CAAC,CAAC,CACpD,KAAK,MAAM,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,GACpC,GAAG,OACA,QAAQ,MAAM,CAAC,eAAe,IAAI,WAAW,EAAE,GAAG,CAAC,CAAC,CACpD,KAAK,MAAM,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CACtC;EACF,CAAC,CACH,GACA,MAAM,IAAI,aAAa,MACrB,OAAO,WAAW;GAChB,MAAM,YAAY,OAAOA,YAAU,OAAO,EAAE,SAAS,CAAC;GACtD,OAAO,MAAM,MAAM,eAAe,IAAI,WAAW,EAAE,GAAG,CAAC;EACzD,CAAC,CACH,GACA,MAAM,IAAI,aAAa,MAAM,SAAS,EAAE,YAAY,MAAM,MAAM,EAAE,CAAC,GACnE,MAAM,IAAI,qBAAqB,MAAM,SAAS,EAAE,YAAY,MAAM,MAAM,CAAC,CAAC,GAC1E,MAAM,IAAI,QAAQ,MAChB,OAAO,IAAI,aAAa;GAEtB,QAAO,OADmB,OAAO,OAAO,aAAa,MAAM,SAAS,EAAE,OAAO,CAAC,CAAC,EAAA,CAC7D,KAAK,MAAM,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC;EACrD,CAAC,CACH,CACF,CAAC,CACA,KACC,MAAM,IAAI,QAAQ,MAAM,QAAQ,EAAE,QAAQ,QAAQ,CAAC,GACnD,MAAM,IAAI,OAAO,MAAM,QAAQ,EAAE,QAAQ,OAAO,CAAC,GACjD,MAAM,IAAI,SAAS,MAAM,QAAQ,EAAE,QAAQ,SAAS,CAAC,GACrD,MAAM,IAAI,SAAS,MACjB,OAAO,IAAI,aAAa;GACtB,MAAM,SAAS,EAAE;GASjB,QAAO,OARgB,OAAO,QAC5B,aACC,MACC,OAAO,IAAI,cAAc,QAAQ,CAAC,IAAI,OACpC,IAAI,wBAAwB,EAAE,IAAI,CAAC,OAAO,OAAO,KAAK,CAAC,GAAG,EAAE,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CACjF,GACF,EAAE,aAAa,EAAE,CACnB,EAAA,CACe,KAAK;EACtB,CAAC,CACH,GACA,MAAM,IAAI,aAAa,MACrB,OAAO,IAAI,aAAa;GACtB,MAAM,WAAW,UAAU,EAAE,KAAK;GAIlC,QAAO,OAHgB,OAAO,QAAQ,aAAa,MAAM,cAAc,UAAU,CAAC,GAAG,EACnF,aAAa,EACf,CAAC,EAAA,CACc,KAAK;EACtB,CAAC,CACH,GACA,MAAM,IAAI,sBAAsB,MAC9B,OAAO,IAAI,eAAe,CAAC,IAAI,UAAW,QAAQ,EAAE,QAAQ,CAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAE,CACrF,GACA,MAAM,IAAI,sBAAsB,MAC9B,OAAO,IAAI,eAAe,CAAC,IAAI,UAAW,QAAQ,EAAE,QAAQ,CAAC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAE,CACrF,GACA,MAAM,IAAI,WAAW,MACnB,OAAO,WAAW;GAChB,MAAM,UAAU,OAAO,EAAE,iBAAiB;GAC1C,OAAO,IAAI,QAAQ,aAAa,MAC9BV,UAAe,CAAC,IACZ,CAAC,IACD,IAAI,QAAQS,MAAc,MAAM,EAAE,SAAS,EAAE,CAAC,IAAI,MAChD,eAAe,IAAI,SAAS,EAAE,UAAU,GAAG,IACvC,CAAC,IACD,CAAC,OAAO,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,MAAMO,UAAe,EAAE,SAAS,EAAE,CAAC,CAAC,CAC3E,CACN;EACF,CAAC,CACH,GACA,MAAM,IAAI,aAAa,MACrB,OAAO,WACL,WAAW,MAAM,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,CACvE,CACF,GACA,MAAM,IAAI,OAAO,MACf,OAAO,WAAW;GAChB,MAAM,UAAU,OAAO,EAAE,MAAM;GAC/B,OAAO,MAAM,MAAM,CAAC,eAAe,IAAI,SAAS,EAAE,GAAG,CAAC;EACxD,CAAC,CACH,GACA,MAAM,IAAI,UAAU,cAAc,MAChC,OAAO,IAAI,aAAa;GACtB,IAAI,OAAO,OAAO,SAAS,GACzB,OAAO,OAAO,YACZ,OACA,UAAU,SAAS,GAAG,QAAQ,IAC1B,cACA,wBAAwB,EAAE,UAAU,KAC1C;GAUF,QAAO,OARmB,UAAU,MAAM,mBAAmB;IAC3D,WAAW;IACX,aAAa;IACb;IACA,YAAY;IACZ,WAAW;IACX;GACF,CAAC,EAAA,CACiB,KAAK,cAAc;IACnC,MAAM,YAAY,UAAU,aAAa;IACzC,MAAM,QAAQ,OAAO,cAAc,UAAU,KAAK;IAClD,MAAM,aACJ,UAAU,SAAS,KAAA,IAAY,OAAO,KAAK,UAAU,IAAI,IAAI;IAC/D,MAAM,UAAU,SACd,KACE,OAAO,cAAc,UAAU,UAAU,IAAI,IAAI,CAAC,GAClD,OAAO,aAAa,eAAe,YAAY,IAAI,CAAC,GACpD,OAAO,aACL,OAAO,QAAQ,gBAAgB,MAAM,WAAW,OAAO,UAAU,CAAC,CACpE,CACF;IACF,MAAM,YACJ,UAAU,aAAa,KAAA,KAAa,IAAI,wBAAwB,UAAU,QAAQ,IAC9E,UAAU,WACV,MAAM;IACZ,OAAOD,WAA4B;KACjC;KACA,aAAa,MAAM;KACnB,2BAA2B;KAC3B,kBAAkB,UAAU,SAAS,GAAG,QAAQ,IAC5C,OAAO,KAAK,EAAE,IAAI,IAClB,OAAO,KAAK;KAChB,UAAU,UAAU,YAAY,MAAM;KACtC;KACA;KACA,UAAU,IAAI,wBAAwB,SAAS,IAC3C,mBAAmB,WAAW,MAAM,IACpC,CAACb,QAAa,eAAe,GAAG,KAAK,CAAC,CAAC;IAC7C,CAAC;GACH,CAAC;EACH,CAAC,CACH,GACA,MAAM,UACR;CACJ,CAAC;CA2CD,OAAO;EAAE;EAAe,YAzCL,OAAO,WAAW,WACnC,OAC+D;GAC/D,MAAM,MAAa,eAAe,MAAM;GACxC,MAAM,MAAM,OAAO,GAAG;GACtB,OAAO,OAAO,QACZ,MAAM,SACN,OAAO,WAAW,WAAW,QAAQ;IACnC,OAAO,MAAM,MAAM,MAAM,CAAC,CAAC,KACzB,MAAM,IAAI,eAAe,MAAM,OAAO,WAAW,IAAI,EAAE,IAAI,CAAC,CAAC,GAC7D,MAAM,IAAI,gBAAgB,MACxB,OAAO,WAAW,IAAI,QAAQ,YAAY,EAAE,KAAK,GAAG,GAAG,CAAC,CAC1D,GACA,MAAM,IAAI,qBAAqB,MAC7B,OAAO,WACL,IAAI,QAAQO,MAAc,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,IAAI,MAAM,IAAI,EAAE,OAAO,CAAC,CACpF,CACF,GACA,MAAM,IAAI,oBAAoB,MAC5B,OAAO,WACL,IAAI,QAAQA,MAAc,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,IAAI,MAAM,IAAI,EAAE,MAAM,CAAC,CACnF,CACF,GACA,MAAM,IAAI,iBAAiB,MACzB,OAAO,MAAM,WAAW;KACtB,cAAc,YAAY,OAAO,WAAW;KAC5C,SAAS,OACP,OAAO,IACL,GAAG,cAAc;MAAE,WAAW;MAAM,aAAa;MAAQ;MAAO,QAAQ,EAAE;KAAK,CAAC,IAC/E,UAAU,IAAI,QAAQ,OAAO,GAAG,CACnC;IACJ,CAAC,CACH,GACA,MAAM,UACR;GACF,CAAC,GACD;IAAE,aAAa;IAAG,SAAS;GAAK,CAClC;GACA,OAAO,SAAS,GAAG;EACrB,CAEiC;CAAE;AACrC;AAEA,MAAM,iBACJ,WAEAQ,cAAqB,MAAM,IAAI,OAAO,QAAQ,MAAM,IAAIC,MAAa,MAAM;;AAO7E,MAAM,UAAU,OAAO,WAAW,WAChC,WACA,aACA,SACA;CACA,MAAM,SAAS,OAAO,cAAc,WAAW;CAC/C,MAAM,OACJ,QAAQ,uBAAuB,OAAOC,MAAc,WAAW,OAAO,OAAO,IAAI;CACnF,MAAM,YAAY,OAAO,OAAO,cAAcC,yBAAgC;CAC9E,OAAO;EAAE;EAAQ,QAAQ,WAAW,MAAM,QAAQ,SAAS,SAAS;CAAE;AACxE,CAAC;;;;;;;;;;;AAYD,MAAa,WAI4D,OAAO,GAC9E,gBACF,CAAC,CAAC,WAAW,WAAW,aAAa,UAAU,CAAC,GAAG;CACjD,MAAM,EAAE,QAAQ,WAAW,OAAO,QAAQ,WAAW,aAAa,OAAO;CACzE,OAAO,OAAO,oBAAoB;EAChC,gBAAgB,OAAO,OAAO;EAC9B,aAAa,UAAU;CACzB,CAAC;CACD,MAAM,WAAW,OAAO,OAAO,QAC7B,OAAO,SACN,UACC,MAAM,eAAe,IAAI,qBAAqB,MAAM,OAAO,IACvD,OAAO,QAA0D,CAAC,CAAC,IACnE,OAAO,QAAQ,OAAO,WAAW,KAAK,IAAI,SACxC,OAAO,IACL,OAAO,QAAQ,OAAO,UAAU,OAAO,cAAc,OAAO,KAAK,GAAG,EAClE,aAAa,EACf,CAAC,IACA,OAAO,GAAG,KAAK,CAClB,CACF,GACN,EAAE,aAAa,EAAE,CACnB;CACA,MAAM,SAASC,OAAsB,SAAS,KAAK,CAAC;CACpD,OAAO,OAAO,oBAAoB;EAChC,iBAAiB,OAAO,QAAQ;EAChC,kBAAkB,OAAO;CAC3B,CAAC;CACD,OAAO;AACT,CAAC;;;;;;;;AASD,MAAa,eAM4D,OAAO,WAC9E,WAAW,WAAW,aAAa,SAAS,WAAW,UAAU,CAAC,GAAG;CACnE,MAAM,EAAE,QAAQ,WAAW,OAAO,QAAQ,WAAW,aAAa,OAAO;CACzE,MAAM,QAAQ,OAAO,eAAeV,IAAW,QAAQ,OAAO,CAAC;CAC/D,IAAI,UAAU,KAAA,GAAW,OAAOU,OAAsB,CAAC,CAAC;CACxD,OAAOA,OAAsB,OAAO,OAAO,cAAc,OAAO,SAAS,CAAC;AAC5E,CACF;;;;;;;AAQA,MAAa,YACX,WACA,aACA,YAEA,OAAO,IAAI,SAAS,WAAW,aAAa,OAAO,IAAI,MAAM,EAAE,QAAQ;;;;;;;;AASzE,MAAa,kBACX,WACA,aACA,YAEA,OAAO,QAAQ,SAAS,WAAW,aAAa,OAAO,IAAI,WACzD,OAAO,WACH,OAAO,QAAQ,SAAS,IACxB,OAAO,KAAK,IAAI,iBAAiB;CAAE,SAASC,OAAwB,MAAM;CAAG;AAAO,CAAC,CAAC,CAC5F;;;;;;;AAYF,IAAa,YAAb,cAA+B,QAAQ,QAqBrC,CAAC,CAAC,4CAA4C,CAAC,CAAC,CAAC;;;;;;;;AASnD,MAAa,OAGuD,OAAO,WAAW,WACpF,aACA,WAAW,CAAC,GACZ;CACA,MAAM,WAAW,OAAO,cAAc,WAAW;CACjD,MAAM,SAAS,aAA+B;EAAE,GAAG;EAAU,GAAG;CAAQ;CACxE,OAAO,UAAU,GAAG;EAClB,aAAa;EACb,WAAW,MAAM,YAAY,SAAS,MAAM,UAAU,MAAM,OAAO,CAAC;EACpE,WAAW,MAAM,YAAY,SAAS,MAAM,UAAU,MAAM,OAAO,CAAC;EACpE,QAAQ,MAAM,YAAY,eAAe,MAAM,UAAU,MAAM,OAAO,CAAC;CACzE,CAAC;AACH,CAAC;;;;;;;AAQD,MAAa,SACX,aACA,aAEA,MAAM,OAAO,WAAW,KAAK,aAAa,QAAQ,CAAC;AAwBrD,MAAM,gBAAgB,aACpB,SAAS,UAAU,GAAG,KAAK,QAAQ,IAAI,SAAS,UAAU,GAAG,QAAQ,QAAQ,IAAI;AAEnF,MAAM,gBAAgB;CAAE,MAAM;CAAG,SAAS;CAAG,WAAW;AAAE;;;;;;;;;;;;;;;;;AAkB1D,MAAa,UACX,aACA,YACsF;CACtF,MAAM,YAAY,cAAc,SAAS,UAAU;CACnD,OAAA,cAA6B,KAC3B,OAAO,SACLC,eACA,qBAAqB,gBAAgB;EACnC,SAAS,MAAuB,iBAC9B,SAAS,MAAM,aAAa,OAAO,CAAC,CAAC,KACnC,OAAO,UACJ,MAAM,IAAI,YAAY,aAAa,EAAE,SAAS,EAAE,QAAQ,GAAG,MAAM,YAAY,CAChF,GACA,OAAO,SAAS,WACd,IAAI,MACF,IAAI,OAAO,OAAO,UAAU,MAAM,aAAa,EAAE,QAAQ,KAAK,SAAS,GACvE;GACE,eAAe,OAAO,QAAQ,IAAI;GAClC,aAAa,YACX,OAAO,KACL,IAAI,YAAY,UAAA,cACQ,KACtB,IAAI,IACF,UACC,MACC,IAAI,YAAY,aACd;IAAE,SAASC,aAA8B,CAAC;IAAG,QAAQ;GAAE,GACvD,GACA,YACF,CACJ,GACA,IACF,CACF;EACJ,CACF,CACF,CACF;EACF,SAAS,SAA0B,OAAO,QAAQ,IAAI;CACxD,CAAC,CACH,CACF;AACF;;;;;;;AAQA,MAAa,aAAa;CACxB,WAAW,GAAG;CACd,SAAS,GAAG;CACZ,MAAM,GAAG;AACX"}

package/dist/Vocab-DceKywpq.mjs

@@ -0,0 +1,168 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { r as vocabulary } from "./Namespace-DHFIsORd.mjs";
+// src/Vocab.ts
+/**
+* Standard vocabularies: RDF, RDFS, XSD and OWL.
+*
+* @since 0.1.0
+*/
+var Vocab_exports = /* @__PURE__ */ __exportAll({
+	commonPrefixes: () => commonPrefixes,
+	owl: () => owl,
+	rdf: () => rdf,
+	rdfs: () => rdfs,
+	xsd: () => xsd
+});
+/**
+* The RDF 1.2 vocabulary.
+*
+* @since 0.1.0
+* @category vocabularies
+*/
+const rdf = vocabulary("http://www.w3.org/1999/02/22-rdf-syntax-ns#", [
+	"type",
+	"Property",
+	"Statement",
+	"subject",
+	"predicate",
+	"object",
+	"reifies",
+	"Bag",
+	"Seq",
+	"Alt",
+	"value",
+	"List",
+	"first",
+	"rest",
+	"nil",
+	"XMLLiteral",
+	"HTML",
+	"JSON",
+	"langString",
+	"dirLangString",
+	"CompoundLiteral",
+	"language",
+	"direction",
+	"PlainLiteral"
+]);
+/**
+* The RDF Schema vocabulary.
+*
+* @since 0.1.0
+* @category vocabularies
+*/
+const rdfs = vocabulary("http://www.w3.org/2000/01/rdf-schema#", [
+	"Resource",
+	"Class",
+	"subClassOf",
+	"subPropertyOf",
+	"comment",
+	"label",
+	"domain",
+	"range",
+	"seeAlso",
+	"isDefinedBy",
+	"Literal",
+	"Container",
+	"ContainerMembershipProperty",
+	"member",
+	"Datatype"
+]);
+/**
+* The XML Schema datatypes used by RDF.
+*
+* @since 0.1.0
+* @category vocabularies
+*/
+const xsd = vocabulary("http://www.w3.org/2001/XMLSchema#", [
+	"string",
+	"boolean",
+	"decimal",
+	"integer",
+	"double",
+	"float",
+	"date",
+	"time",
+	"dateTime",
+	"dateTimeStamp",
+	"gYear",
+	"gMonth",
+	"gDay",
+	"gYearMonth",
+	"gMonthDay",
+	"duration",
+	"yearMonthDuration",
+	"dayTimeDuration",
+	"byte",
+	"short",
+	"int",
+	"long",
+	"unsignedByte",
+	"unsignedShort",
+	"unsignedInt",
+	"unsignedLong",
+	"positiveInteger",
+	"nonNegativeInteger",
+	"negativeInteger",
+	"nonPositiveInteger",
+	"hexBinary",
+	"base64Binary",
+	"anyURI",
+	"language",
+	"normalizedString",
+	"token",
+	"NMTOKEN",
+	"Name",
+	"NCName"
+]);
+/**
+* The OWL 2 vocabulary (commonly used terms).
+*
+* @since 0.1.0
+* @category vocabularies
+*/
+const owl = vocabulary("http://www.w3.org/2002/07/owl#", [
+	"Class",
+	"Thing",
+	"Nothing",
+	"Ontology",
+	"ObjectProperty",
+	"DatatypeProperty",
+	"AnnotationProperty",
+	"FunctionalProperty",
+	"InverseFunctionalProperty",
+	"TransitiveProperty",
+	"SymmetricProperty",
+	"equivalentClass",
+	"equivalentProperty",
+	"sameAs",
+	"differentFrom",
+	"inverseOf",
+	"imports",
+	"versionIRI",
+	"Restriction",
+	"onProperty",
+	"someValuesFrom",
+	"allValuesFrom",
+	"hasValue",
+	"unionOf",
+	"intersectionOf",
+	"complementOf",
+	"oneOf",
+	"NamedIndividual"
+]);
+/**
+* Well-known prefixes, suitable for seeding a `PrefixMap`.
+*
+* @since 0.1.0
+* @category prefixes
+*/
+const commonPrefixes = {
+	rdf: rdf.base,
+	rdfs: rdfs.base,
+	xsd: xsd.base,
+	owl: owl.base
+};
+export { rdfs as a, rdf as i, commonPrefixes as n, xsd as o, owl as r, Vocab_exports as t };
+
+//# sourceMappingURL=Vocab-DceKywpq.mjs.map

package/dist/Vocab-DceKywpq.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Vocab-DceKywpq.mjs","names":["Namespace.vocabulary"],"sources":["../src/Vocab.ts"],"sourcesContent":["/**\n * Standard vocabularies: RDF, RDFS, XSD and OWL.\n *\n * @since 0.1.0\n */\nimport * as Namespace from './Namespace.ts';\n\n/**\n * The RDF 1.2 vocabulary.\n *\n * @since 0.1.0\n * @category vocabularies\n */\nexport const rdf = Namespace.vocabulary('http://www.w3.org/1999/02/22-rdf-syntax-ns#', [\n  'type',\n  'Property',\n  'Statement',\n  'subject',\n  'predicate',\n  'object',\n  'reifies',\n  'Bag',\n  'Seq',\n  'Alt',\n  'value',\n  'List',\n  'first',\n  'rest',\n  'nil',\n  'XMLLiteral',\n  'HTML',\n  'JSON',\n  'langString',\n  'dirLangString',\n  'CompoundLiteral',\n  'language',\n  'direction',\n  'PlainLiteral',\n]);\n\n/**\n * The RDF Schema vocabulary.\n *\n * @since 0.1.0\n * @category vocabularies\n */\nexport const rdfs = Namespace.vocabulary('http://www.w3.org/2000/01/rdf-schema#', [\n  'Resource',\n  'Class',\n  'subClassOf',\n  'subPropertyOf',\n  'comment',\n  'label',\n  'domain',\n  'range',\n  'seeAlso',\n  'isDefinedBy',\n  'Literal',\n  'Container',\n  'ContainerMembershipProperty',\n  'member',\n  'Datatype',\n]);\n\n/**\n * The XML Schema datatypes used by RDF.\n *\n * @since 0.1.0\n * @category vocabularies\n */\nexport const xsd = Namespace.vocabulary('http://www.w3.org/2001/XMLSchema#', [\n  'string',\n  'boolean',\n  'decimal',\n  'integer',\n  'double',\n  'float',\n  'date',\n  'time',\n  'dateTime',\n  'dateTimeStamp',\n  'gYear',\n  'gMonth',\n  'gDay',\n  'gYearMonth',\n  'gMonthDay',\n  'duration',\n  'yearMonthDuration',\n  'dayTimeDuration',\n  'byte',\n  'short',\n  'int',\n  'long',\n  'unsignedByte',\n  'unsignedShort',\n  'unsignedInt',\n  'unsignedLong',\n  'positiveInteger',\n  'nonNegativeInteger',\n  'negativeInteger',\n  'nonPositiveInteger',\n  'hexBinary',\n  'base64Binary',\n  'anyURI',\n  'language',\n  'normalizedString',\n  'token',\n  'NMTOKEN',\n  'Name',\n  'NCName',\n]);\n\n/**\n * The OWL 2 vocabulary (commonly used terms).\n *\n * @since 0.1.0\n * @category vocabularies\n */\nexport const owl = Namespace.vocabulary('http://www.w3.org/2002/07/owl#', [\n  'Class',\n  'Thing',\n  'Nothing',\n  'Ontology',\n  'ObjectProperty',\n  'DatatypeProperty',\n  'AnnotationProperty',\n  'FunctionalProperty',\n  'InverseFunctionalProperty',\n  'TransitiveProperty',\n  'SymmetricProperty',\n  'equivalentClass',\n  'equivalentProperty',\n  'sameAs',\n  'differentFrom',\n  'inverseOf',\n  'imports',\n  'versionIRI',\n  'Restriction',\n  'onProperty',\n  'someValuesFrom',\n  'allValuesFrom',\n  'hasValue',\n  'unionOf',\n  'intersectionOf',\n  'complementOf',\n  'oneOf',\n  'NamedIndividual',\n]);\n\n/**\n * Well-known prefixes, suitable for seeding a `PrefixMap`.\n *\n * @since 0.1.0\n * @category prefixes\n */\nexport const commonPrefixes = {\n  rdf: rdf.base,\n  rdfs: rdfs.base,\n  xsd: xsd.base,\n  owl: owl.base,\n} as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAaA,MAAa,MAAMA,WAAqB,+CAA+C;CACrF;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;;;;;;;AAQD,MAAa,OAAOA,WAAqB,yCAAyC;CAChF;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;;AAQD,MAAa,MAAMA,WAAqB,qCAAqC;CAC3E;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;;;;;;;AAQD,MAAa,MAAMA,WAAqB,kCAAkC;CACxE;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;;;;;;;AAQD,MAAa,iBAAiB;CAC5B,KAAK,IAAI;CACT,MAAM,KAAK;CACX,KAAK,IAAI;CACT,KAAK,IAAI;AACX"}

package/dist/Vocab-Df-L-IwZ.d.mts

@@ -0,0 +1,46 @@
+import { r as Vocabulary } from "./Namespace-ClTUO_ya.mjs";
+declare namespace Vocab_d_exports {
+  export { commonPrefixes, owl, rdf, rdfs, xsd };
+}
+/**
+ * The RDF 1.2 vocabulary.
+ *
+ * @since 0.1.0
+ * @category vocabularies
+ */
+declare const rdf: Vocabulary<"http://www.w3.org/1999/02/22-rdf-syntax-ns#", "object" | "Bag" | "Seq" | "Alt" | "type" | "value" | "Statement" | "List" | "Property" | "subject" | "predicate" | "reifies" | "first" | "rest" | "nil" | "XMLLiteral" | "HTML" | "JSON" | "langString" | "dirLangString" | "CompoundLiteral" | "language" | "direction" | "PlainLiteral">;
+/**
+ * The RDF Schema vocabulary.
+ *
+ * @since 0.1.0
+ * @category vocabularies
+ */
+declare const rdfs: Vocabulary<"http://www.w3.org/2000/01/rdf-schema#", "Literal" | "label" | "Resource" | "Class" | "subClassOf" | "subPropertyOf" | "comment" | "domain" | "range" | "seeAlso" | "isDefinedBy" | "Container" | "ContainerMembershipProperty" | "member" | "Datatype">;
+/**
+ * The XML Schema datatypes used by RDF.
+ *
+ * @since 0.1.0
+ * @category vocabularies
+ */
+declare const xsd: Vocabulary<"http://www.w3.org/2001/XMLSchema#", "string" | "boolean" | "integer" | "decimal" | "double" | "short" | "language" | "float" | "date" | "time" | "dateTime" | "dateTimeStamp" | "gYear" | "gMonth" | "gDay" | "gYearMonth" | "gMonthDay" | "duration" | "yearMonthDuration" | "dayTimeDuration" | "byte" | "int" | "long" | "unsignedByte" | "unsignedShort" | "unsignedInt" | "unsignedLong" | "positiveInteger" | "nonNegativeInteger" | "negativeInteger" | "nonPositiveInteger" | "hexBinary" | "base64Binary" | "anyURI" | "normalizedString" | "token" | "NMTOKEN" | "Name" | "NCName">;
+/**
+ * The OWL 2 vocabulary (commonly used terms).
+ *
+ * @since 0.1.0
+ * @category vocabularies
+ */
+declare const owl: Vocabulary<"http://www.w3.org/2002/07/owl#", "sameAs" | "Class" | "Thing" | "Nothing" | "Ontology" | "ObjectProperty" | "DatatypeProperty" | "AnnotationProperty" | "FunctionalProperty" | "InverseFunctionalProperty" | "TransitiveProperty" | "SymmetricProperty" | "equivalentClass" | "equivalentProperty" | "differentFrom" | "inverseOf" | "imports" | "versionIRI" | "Restriction" | "onProperty" | "someValuesFrom" | "allValuesFrom" | "hasValue" | "unionOf" | "intersectionOf" | "complementOf" | "oneOf" | "NamedIndividual">;
+/**
+ * Well-known prefixes, suitable for seeding a `PrefixMap`.
+ *
+ * @since 0.1.0
+ * @category prefixes
+ */
+declare const commonPrefixes: {
+  readonly rdf: "http://www.w3.org/1999/02/22-rdf-syntax-ns#";
+  readonly rdfs: "http://www.w3.org/2000/01/rdf-schema#";
+  readonly xsd: "http://www.w3.org/2001/XMLSchema#";
+  readonly owl: "http://www.w3.org/2002/07/owl#";
+};
+export { rdfs as a, rdf as i, commonPrefixes as n, xsd as o, owl as r, Vocab_d_exports as t };
+//# sourceMappingURL=Vocab-Df-L-IwZ.d.mts.map

package/dist/Vocab-Do56UgBX.d.mts

@@ -0,0 +1,81 @@
+import { d as NamedNode } from "./Term-B_4ezyXq.mjs";
+import { r as Vocabulary, t as Namespace } from "./Namespace-ClTUO_ya.mjs";
+declare namespace Vocab_d_exports {
+  export { crypto, i18n, list, log, math, prefixes, sameAs, string, time };
+}
+/**
+ * The `log:` namespace (`http://www.w3.org/2000/10/swap/log#`). `=>` is
+ * `log:implies` and `<=` is `log:isImpliedBy`.
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const log: Vocabulary<"http://www.w3.org/2000/10/swap/log#", "Literal" | "includes" | "Formula" | "implies" | "isImpliedBy" | "equalTo" | "notEqualTo" | "notIncludes" | "semantics" | "conclusion" | "conjunction" | "collectAllIn" | "forAllIn" | "uri" | "rawType" | "dtlit" | "langlit" | "Other" | "List">;
+/**
+ * The `math:` namespace (`http://www.w3.org/2000/10/swap/math#`).
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const math: Namespace<"http://www.w3.org/2000/10/swap/math#">;
+/**
+ * The `string:` namespace (`http://www.w3.org/2000/10/swap/string#`).
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const string: Namespace<"http://www.w3.org/2000/10/swap/string#">;
+/**
+ * The `list:` namespace (`http://www.w3.org/2000/10/swap/list#`).
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const list: Namespace<"http://www.w3.org/2000/10/swap/list#">;
+/**
+ * The `time:` namespace (`http://www.w3.org/2000/10/swap/time#`).
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const time: Namespace<"http://www.w3.org/2000/10/swap/time#">;
+/**
+ * The `crypto:` namespace (`http://www.w3.org/2000/10/swap/crypto#`).
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const crypto: Namespace<"http://www.w3.org/2000/10/swap/crypto#">;
+/**
+ * The `i18n:` namespace (`https://www.w3.org/ns/i18n#`). A literal typed
+ * `i18n:{language}_{direction}` (e.g. `"…"^^i18n:ar-eg_rtl`) is parsed as a
+ * directional language-tagged string, and directional language-tagged
+ * strings are serialised that way.
+ *
+ * @since 0.1.0
+ * @category namespaces
+ */
+declare const i18n: Namespace<"https://www.w3.org/ns/i18n#">;
+/**
+ * `owl:sameAs`, written `=` in N3.
+ *
+ * @since 0.1.0
+ * @category terms
+ */
+declare const sameAs: NamedNode<"http://www.w3.org/2002/07/owl#sameAs">;
+/**
+ * Prefixes for the N3 builtin namespaces.
+ *
+ * @since 0.1.0
+ * @category prefixes
+ */
+declare const prefixes: {
+  readonly log: "http://www.w3.org/2000/10/swap/log#";
+  readonly math: "http://www.w3.org/2000/10/swap/math#";
+  readonly string: "http://www.w3.org/2000/10/swap/string#";
+  readonly list: "http://www.w3.org/2000/10/swap/list#";
+  readonly time: "http://www.w3.org/2000/10/swap/time#";
+  readonly crypto: "http://www.w3.org/2000/10/swap/crypto#";
+};
+export { log as a, sameAs as c, list as i, string as l, crypto as n, math as o, i18n as r, prefixes as s, Vocab_d_exports as t, time as u };
+//# sourceMappingURL=Vocab-Do56UgBX.d.mts.map

package/dist/Vocab-TfpWG1Ne.mjs

@@ -0,0 +1,118 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { n as make, r as vocabulary } from "./Namespace-DHFIsORd.mjs";
+// src/n3/Vocab.ts
+/**
+* Namespaces used by Notation3: the SWAP builtin namespaces (`log:`,
+* `math:`, `string:`, `list:`, `time:`, `crypto:`) and the `i18n:`
+* namespace for directional language-tagged strings.
+*
+* @since 0.1.0
+*/
+var Vocab_exports = /* @__PURE__ */ __exportAll({
+	crypto: () => crypto,
+	i18n: () => i18n,
+	list: () => list,
+	log: () => log,
+	math: () => math,
+	prefixes: () => prefixes,
+	sameAs: () => sameAs,
+	string: () => string,
+	time: () => time
+});
+/**
+* The `log:` namespace (`http://www.w3.org/2000/10/swap/log#`). `=>` is
+* `log:implies` and `<=` is `log:isImpliedBy`.
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const log = vocabulary("http://www.w3.org/2000/10/swap/log#", [
+	"implies",
+	"isImpliedBy",
+	"equalTo",
+	"notEqualTo",
+	"includes",
+	"notIncludes",
+	"semantics",
+	"conclusion",
+	"conjunction",
+	"collectAllIn",
+	"forAllIn",
+	"uri",
+	"rawType",
+	"dtlit",
+	"langlit",
+	"Formula",
+	"Literal",
+	"Other",
+	"List"
+]);
+/**
+* The `math:` namespace (`http://www.w3.org/2000/10/swap/math#`).
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const math = make("http://www.w3.org/2000/10/swap/math#");
+/**
+* The `string:` namespace (`http://www.w3.org/2000/10/swap/string#`).
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const string = make("http://www.w3.org/2000/10/swap/string#");
+/**
+* The `list:` namespace (`http://www.w3.org/2000/10/swap/list#`).
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const list = make("http://www.w3.org/2000/10/swap/list#");
+/**
+* The `time:` namespace (`http://www.w3.org/2000/10/swap/time#`).
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const time = make("http://www.w3.org/2000/10/swap/time#");
+/**
+* The `crypto:` namespace (`http://www.w3.org/2000/10/swap/crypto#`).
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const crypto = make("http://www.w3.org/2000/10/swap/crypto#");
+/**
+* The `i18n:` namespace (`https://www.w3.org/ns/i18n#`). A literal typed
+* `i18n:{language}_{direction}` (e.g. `"…"^^i18n:ar-eg_rtl`) is parsed as a
+* directional language-tagged string, and directional language-tagged
+* strings are serialised that way.
+*
+* @since 0.1.0
+* @category namespaces
+*/
+const i18n = make("https://www.w3.org/ns/i18n#");
+/**
+* `owl:sameAs`, written `=` in N3.
+*
+* @since 0.1.0
+* @category terms
+*/
+const sameAs = make("http://www.w3.org/2002/07/owl#")("sameAs");
+/**
+* Prefixes for the N3 builtin namespaces.
+*
+* @since 0.1.0
+* @category prefixes
+*/
+const prefixes = {
+	log: log.base,
+	math: math.base,
+	string: string.base,
+	list: list.base,
+	time: time.base,
+	crypto: crypto.base
+};
+export { log as a, sameAs as c, list as i, string as l, crypto as n, math as o, i18n as r, prefixes as s, Vocab_exports as t, time as u };
+
+//# sourceMappingURL=Vocab-TfpWG1Ne.mjs.map

package/dist/Vocab-TfpWG1Ne.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Vocab-TfpWG1Ne.mjs","names":["Namespace.vocabulary","Namespace.make"],"sources":["../src/n3/Vocab.ts"],"sourcesContent":["/**\n * Namespaces used by Notation3: the SWAP builtin namespaces (`log:`,\n * `math:`, `string:`, `list:`, `time:`, `crypto:`) and the `i18n:`\n * namespace for directional language-tagged strings.\n *\n * @since 0.1.0\n */\nimport * as Namespace from '../Namespace.ts';\n\n/**\n * The `log:` namespace (`http://www.w3.org/2000/10/swap/log#`). `=>` is\n * `log:implies` and `<=` is `log:isImpliedBy`.\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const log = Namespace.vocabulary('http://www.w3.org/2000/10/swap/log#', [\n  'implies',\n  'isImpliedBy',\n  'equalTo',\n  'notEqualTo',\n  'includes',\n  'notIncludes',\n  'semantics',\n  'conclusion',\n  'conjunction',\n  'collectAllIn',\n  'forAllIn',\n  'uri',\n  'rawType',\n  'dtlit',\n  'langlit',\n  'Formula',\n  'Literal',\n  'Other',\n  'List',\n]);\n\n/**\n * The `math:` namespace (`http://www.w3.org/2000/10/swap/math#`).\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const math = Namespace.make('http://www.w3.org/2000/10/swap/math#');\n\n/**\n * The `string:` namespace (`http://www.w3.org/2000/10/swap/string#`).\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const string = Namespace.make('http://www.w3.org/2000/10/swap/string#');\n\n/**\n * The `list:` namespace (`http://www.w3.org/2000/10/swap/list#`).\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const list = Namespace.make('http://www.w3.org/2000/10/swap/list#');\n\n/**\n * The `time:` namespace (`http://www.w3.org/2000/10/swap/time#`).\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const time = Namespace.make('http://www.w3.org/2000/10/swap/time#');\n\n/**\n * The `crypto:` namespace (`http://www.w3.org/2000/10/swap/crypto#`).\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const crypto = Namespace.make('http://www.w3.org/2000/10/swap/crypto#');\n\n/**\n * The `i18n:` namespace (`https://www.w3.org/ns/i18n#`). A literal typed\n * `i18n:{language}_{direction}` (e.g. `\"…\"^^i18n:ar-eg_rtl`) is parsed as a\n * directional language-tagged string, and directional language-tagged\n * strings are serialised that way.\n *\n * @since 0.1.0\n * @category namespaces\n */\nexport const i18n = Namespace.make('https://www.w3.org/ns/i18n#');\n\n/**\n * `owl:sameAs`, written `=` in N3.\n *\n * @since 0.1.0\n * @category terms\n */\nexport const sameAs = Namespace.make('http://www.w3.org/2002/07/owl#')('sameAs');\n\n/**\n * Prefixes for the N3 builtin namespaces.\n *\n * @since 0.1.0\n * @category prefixes\n */\nexport const prefixes = {\n  log: log.base,\n  math: math.base,\n  string: string.base,\n  list: list.base,\n  time: time.base,\n  crypto: crypto.base,\n} as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgBA,MAAa,MAAMA,WAAqB,uCAAuC;CAC7E;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;;AAQD,MAAa,OAAOC,KAAe,sCAAsC;;;;;;;AAQzE,MAAa,SAASA,KAAe,wCAAwC;;;;;;;AAQ7E,MAAa,OAAOA,KAAe,sCAAsC;;;;;;;AAQzE,MAAa,OAAOA,KAAe,sCAAsC;;;;;;;AAQzE,MAAa,SAASA,KAAe,wCAAwC;;;;;;;;;;AAW7E,MAAa,OAAOA,KAAe,6BAA6B;;;;;;;AAQhE,MAAa,SAASA,KAAe,gCAAgC,CAAC,CAAC,QAAQ;;;;;;;AAQ/E,MAAa,WAAW;CACtB,KAAK,IAAI;CACT,MAAM,KAAK;CACX,QAAQ,OAAO;CACf,MAAM,KAAK;CACX,MAAM,KAAK;CACX,QAAQ,OAAO;AACjB"}

package/dist/Vocab.d.mts

@@ -0,0 +1,2 @@
+import { a as rdfs, i as rdf, n as commonPrefixes, o as xsd, r as owl } from "./Vocab-Df-L-IwZ.mjs";
+export { commonPrefixes, owl, rdf, rdfs, xsd };

package/dist/Vocab.mjs

@@ -0,0 +1 @@
+export { n as commonPrefixes, r as owl, i as rdf, a as rdfs, o as xsd } from "./Vocab-DceKywpq.mjs";