@thomasfosterau/effect-rdf 0.0.0-stage → 0.1.0

package/dist/Shapes-18GjfyBV.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Shapes-18GjfyBV.mjs","names":["Vocab","Term.namedNode","Term.literal","Term.isResource","Term.isNamedNode","Term.isLiteral","Xsd.isIntegerDatatype","Xsd.isWellFormed","Dataset.objectsOf","list","Term.isObject","Dataset.list","Rdfs.instancesOf","Dataset.match","Term.isTriple","Term.compare","Regex.compile","Dataset.subjectsOf","Path.fromRdf"],"sources":["../src/shacl/internal/regex.ts","../src/shacl/Shapes.ts"],"sourcesContent":["/**\n * Translation of XPath/XML Schema regular expressions (as used by\n * `sh:pattern` and `sh:flags`) to JavaScript `RegExp`s.\n *\n * @internal\n */\nimport * as Arr from 'effect/Array';\nimport * as Option from 'effect/Option';\nimport * as Result from 'effect/Result';\nimport * as Schema from 'effect/Schema';\n\n/** A string as a JSON string literal, for messages. */\nconst quote = Schema.encodeSync(Schema.fromJsonString(Schema.String));\n\nconst escapeAll = (s: string) => s.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n\n/** Removes whitespace outside character classes (the XPath `x` flag). */\nconst stripWhitespace = (s: string): string => {\n  let inClass = false;\n  return s.replace(/\\\\[\\s\\S]?|[[\\]]|[\\t\\n\\r ]/g, (token) => {\n    if (token === '[') inClass = true;\n    else if (token === ']') inClass = false;\n    else if (WHITESPACE.test(token)) return inClass ? token : '';\n    return token;\n  });\n};\n\nconst WHITESPACE = /^[\\t\\n\\r ]$/;\n\n/**\n * Compiles an XPath regular expression with optional XPath flags\n * (`s`, `m`, `i`, `x`, `q`). Fails with an error message for invalid input.\n *\n * @internal\n */\nexport const compile = (pattern: string, flags: string): Result.Result<RegExp, string> => {\n  const chars = Arr.fromIterable(flags);\n  const unsupported = Arr.findFirst(chars, (f) => !'smixq'.includes(f));\n  if (Option.isSome(unsupported))\n    return Result.fail(`unsupported regular expression flag '${unsupported.value}'`);\n  const jsFlags = Arr.join(Arr.dedupe(Arr.filter(chars, (f) => 'smi'.includes(f))), '');\n  const source = flags.includes('q')\n    ? escapeAll(pattern)\n    : flags.includes('x')\n      ? stripWhitespace(pattern)\n      : pattern;\n  // Unicode mode first (XPath character classes need it), then the legacy\n  // syntax that accepts the escapes Unicode mode rejects.\n  return Result.mapError(\n    Result.orElse(\n      Result.try(() => new RegExp(source, `${jsFlags}u`)),\n      () => Result.try(() => new RegExp(source, jsFlags)),\n    ),\n    (failure) => `invalid regular expression ${quote(pattern)}: ${String(failure)}`,\n  );\n};\n","/**\n * Shapes graphs: parsing an RDF shapes graph into a typed, validated model of\n * node shapes and property shapes with their targets and constraints\n * (SHACL Core §2–§4, plus the SHACL-SPARQL constructs needed to delegate to a\n * `Sparql.SparqlConstraintEvaluator`).\n *\n * ```ts\n * import { Effect } from \"effect\"\n * import { Shapes } from \"@thomasfosterau/effect-rdf/shacl\"\n *\n * const program = Effect.gen(function* () {\n *   const shapes = yield* Shapes.parse(shapesDataset)\n *   for (const shape of shapes.shapes) console.log(shape._tag, shape.id.key)\n * })\n * ```\n *\n * @since 0.1.0\n */\nimport { Dataset, Rdfs, Term, Vocab, Xsd } from '../index.ts';\nimport * as Arr from 'effect/Array';\nimport * as Effect from 'effect/Effect';\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 Result from 'effect/Result';\nimport * as Schema from 'effect/Schema';\nimport * as Regex from './internal/regex.ts';\nimport * as Path from './Path.ts';\nimport { SH, sh } from './Vocabulary.ts';\n\nconst { rdfs, xsd } = Vocab;\n\n// -----------------------------------------------------------------------------\n// Errors\n// -----------------------------------------------------------------------------\n\n/**\n * The shapes graph is ill-formed (§3.4.1 \"ill-formed shapes graph\"), so it\n * cannot be used for validation.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class ShapesGraphError extends Schema.TaggedError<ShapesGraphError>()('ShapesGraphError', {\n  message: Schema.String,\n  /** The N-Triples form of the offending node, when known. */\n  node: Schema.optional(Schema.String),\n}) {}\n\n// -----------------------------------------------------------------------------\n// Models\n// -----------------------------------------------------------------------------\n\n/**\n * The identifier of a shape: an IRI or a blank node of the shapes graph.\n *\n * @since 0.1.0\n * @category models\n */\nexport type ShapeId = Term.NamedNode | Term.BlankNode;\n\n/**\n * A target declaration (§2.1.3).\n *\n * @since 0.1.0\n * @category models\n */\nexport type Target =\n  | { readonly _tag: 'TargetNode'; readonly node: Term.GroundTerm }\n  | { readonly _tag: 'TargetClass'; readonly class: Term.Resource; readonly implicit: boolean }\n  | { readonly _tag: 'TargetSubjectsOf'; readonly predicate: Term.NamedNode }\n  | { readonly _tag: 'TargetObjectsOf'; readonly predicate: Term.NamedNode }\n  | {\n      /** A SPARQL-based target or custom target type (`sh:target`). */\n      readonly _tag: 'SparqlTarget';\n      readonly node: Term.GroundTerm;\n    };\n\n/**\n * The node kinds of `sh:nodeKind`.\n *\n * @since 0.1.0\n * @category models\n */\nexport type NodeKind =\n  | 'BlankNode'\n  | 'IRI'\n  | 'Literal'\n  | 'BlankNodeOrIRI'\n  | 'BlankNodeOrLiteral'\n  | 'IRIOrLiteral';\n\n/**\n * A constraint on a value node set, i.e. an instance of a constraint\n * component with its parameter values (§2.2, §4).\n *\n * @since 0.1.0\n * @category models\n */\nexport type Constraint =\n  | { readonly _tag: 'Class'; readonly class: Term.Resource }\n  | { readonly _tag: 'Datatype'; readonly datatype: Term.NamedNode }\n  | { readonly _tag: 'NodeKind'; readonly nodeKind: NodeKind }\n  | { readonly _tag: 'MinCount'; readonly minCount: number }\n  | { readonly _tag: 'MaxCount'; readonly maxCount: number }\n  | { readonly _tag: 'MinExclusive'; readonly value: Term.GroundTerm }\n  | { readonly _tag: 'MinInclusive'; readonly value: Term.GroundTerm }\n  | { readonly _tag: 'MaxExclusive'; readonly value: Term.GroundTerm }\n  | { readonly _tag: 'MaxInclusive'; readonly value: Term.GroundTerm }\n  | { readonly _tag: 'MinLength'; readonly minLength: number }\n  | { readonly _tag: 'MaxLength'; readonly maxLength: number }\n  | {\n      readonly _tag: 'Pattern';\n      readonly pattern: string;\n      readonly flags: string;\n      readonly regex: RegExp;\n    }\n  | { readonly _tag: 'LanguageIn'; readonly languages: ReadonlyArray<string> }\n  | { readonly _tag: 'UniqueLang' }\n  | { readonly _tag: 'Equals'; readonly predicate: Term.NamedNode }\n  | { readonly _tag: 'Disjoint'; readonly predicate: Term.NamedNode }\n  | { readonly _tag: 'LessThan'; readonly predicate: Term.NamedNode }\n  | { readonly _tag: 'LessThanOrEquals'; readonly predicate: Term.NamedNode }\n  | { readonly _tag: 'Not'; readonly shape: ShapeId }\n  | { readonly _tag: 'And'; readonly shapes: ReadonlyArray<ShapeId> }\n  | { readonly _tag: 'Or'; readonly shapes: ReadonlyArray<ShapeId> }\n  | { readonly _tag: 'Xone'; readonly shapes: ReadonlyArray<ShapeId> }\n  | { readonly _tag: 'Node'; readonly shape: ShapeId }\n  | { readonly _tag: 'Property'; readonly shape: ShapeId }\n  | {\n      readonly _tag: 'QualifiedMinCount';\n      readonly shape: ShapeId;\n      readonly count: number;\n      readonly disjoint: boolean;\n      /** Sibling qualified value shapes (only used when `disjoint`). */\n      readonly siblings: ReadonlyArray<ShapeId>;\n    }\n  | {\n      readonly _tag: 'QualifiedMaxCount';\n      readonly shape: ShapeId;\n      readonly count: number;\n      readonly disjoint: boolean;\n      readonly siblings: ReadonlyArray<ShapeId>;\n    }\n  | {\n      readonly _tag: 'Closed';\n      readonly ignoredProperties: ReadonlyArray<Term.NamedNode>;\n      /** Predicates allowed by `sh:property` predicate paths and `sh:ignoredProperties`. */\n      readonly allowedProperties: ReadonlyArray<Term.NamedNode>;\n    }\n  | { readonly _tag: 'HasValue'; readonly value: Term.GroundTerm }\n  | { readonly _tag: 'In'; readonly values: ReadonlyArray<Term.GroundTerm> }\n  | SparqlConstraint\n  | ComponentConstraint;\n\n/**\n * A SHACL-SPARQL constraint (`sh:sparql`), evaluated by a\n * `Sparql.SparqlConstraintEvaluator`.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface SparqlConstraint {\n  readonly _tag: 'Sparql';\n  /** The `sh:SPARQLConstraint` node in the shapes graph. */\n  readonly node: Term.NamedNode | Term.BlankNode;\n}\n\n/**\n * An instance of a custom (SPARQL-based) constraint component declared in the\n * shapes graph, evaluated by a `Sparql.SparqlConstraintEvaluator`.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ComponentConstraint {\n  readonly _tag: 'Component';\n  readonly component: Term.NamedNode | Term.BlankNode;\n  /** The parameter bindings of this constraint, keyed by parameter path. */\n  readonly parameters: ReadonlyArray<{\n    readonly path: Term.NamedNode;\n    readonly value: Term.GroundTerm;\n  }>;\n}\n\n/**\n * The tags of all constraint kinds.\n *\n * @since 0.1.0\n * @category models\n */\nexport type ConstraintTag = Constraint['_tag'];\n\ninterface ShapeBase {\n  readonly id: ShapeId;\n  readonly targets: ReadonlyArray<Target>;\n  readonly constraints: ReadonlyArray<Constraint>;\n  /** `sh:severity`, defaulting to `sh:Violation`. */\n  readonly severity: Term.NamedNode;\n  /** `sh:message` values. */\n  readonly messages: ReadonlyArray<Term.Literal>;\n  /** `sh:deactivated true`. */\n  readonly deactivated: boolean;\n}\n\n/**\n * A node shape (§2.2): its constraints apply to the focus node itself.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface NodeShape extends ShapeBase {\n  readonly _tag: 'NodeShape';\n}\n\n/**\n * A property shape (§2.3): its constraints apply to the values reachable\n * from the focus node via `path`.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface PropertyShape extends ShapeBase {\n  readonly _tag: 'PropertyShape';\n  readonly path: Path.Path;\n}\n\n/**\n * @since 0.1.0\n * @category models\n */\nexport type Shape = NodeShape | PropertyShape;\n\n/**\n * A parsed shapes graph.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ShapesGraph {\n  readonly _tag: 'ShapesGraph';\n  /** The RDF shapes graph this model was parsed from. */\n  readonly dataset: Dataset.Dataset;\n  /** Every shape of the shapes graph, in a deterministic order. */\n  readonly shapes: ReadonlyArray<Shape>;\n  /** Shapes indexed by the N-Triples form of their identifier. */\n  readonly index: ReadonlyMap<string, Shape>;\n}\n\n// -----------------------------------------------------------------------------\n// Accessors\n// -----------------------------------------------------------------------------\n\n/**\n * @since 0.1.0\n * @category guards\n */\nexport const isShapesGraph = (u: unknown): u is ShapesGraph => Predicate.isTagged(u, 'ShapesGraph');\n\n/**\n * Looks up a shape by its identifier.\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const get = (self: ShapesGraph, id: Term.Term): Option.Option<Shape> =>\n  Option.fromNullishOr(self.index.get(id.key));\n\n/**\n * The shapes that declare at least one target and are not deactivated.\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const targetedShapes = (self: ShapesGraph): ReadonlyArray<Shape> =>\n  self.shapes.filter((s) => !s.deactivated && Arr.isReadonlyArrayNonEmpty(s.targets));\n\n/**\n * Whether the shapes graph uses SHACL-SPARQL features (SPARQL constraints,\n * SPARQL-based constraint components or SPARQL-based targets).\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const usesSparql = (self: ShapesGraph): boolean =>\n  self.shapes.some(\n    (s) =>\n      s.targets.some(Predicate.isTagged('SparqlTarget')) ||\n      s.constraints.some(\n        (c) => Predicate.isTagged(c, 'Sparql') || Predicate.isTagged(c, 'Component'),\n      ),\n  );\n\nconst componentNames: Record.ReadonlyRecord<\n  Exclude<ConstraintTag, 'Sparql' | 'Component'>,\n  string\n> = {\n  Class: 'ClassConstraintComponent',\n  Datatype: 'DatatypeConstraintComponent',\n  NodeKind: 'NodeKindConstraintComponent',\n  MinCount: 'MinCountConstraintComponent',\n  MaxCount: 'MaxCountConstraintComponent',\n  MinExclusive: 'MinExclusiveConstraintComponent',\n  MinInclusive: 'MinInclusiveConstraintComponent',\n  MaxExclusive: 'MaxExclusiveConstraintComponent',\n  MaxInclusive: 'MaxInclusiveConstraintComponent',\n  MinLength: 'MinLengthConstraintComponent',\n  MaxLength: 'MaxLengthConstraintComponent',\n  Pattern: 'PatternConstraintComponent',\n  LanguageIn: 'LanguageInConstraintComponent',\n  UniqueLang: 'UniqueLangConstraintComponent',\n  Equals: 'EqualsConstraintComponent',\n  Disjoint: 'DisjointConstraintComponent',\n  LessThan: 'LessThanConstraintComponent',\n  LessThanOrEquals: 'LessThanOrEqualsConstraintComponent',\n  Not: 'NotConstraintComponent',\n  And: 'AndConstraintComponent',\n  Or: 'OrConstraintComponent',\n  Xone: 'XoneConstraintComponent',\n  Node: 'NodeConstraintComponent',\n  Property: 'PropertyConstraintComponent',\n  QualifiedMinCount: 'QualifiedMinCountConstraintComponent',\n  QualifiedMaxCount: 'QualifiedMaxCountConstraintComponent',\n  Closed: 'ClosedConstraintComponent',\n  HasValue: 'HasValueConstraintComponent',\n  In: 'InConstraintComponent',\n};\n\n/**\n * The constraint component IRI of a constraint (e.g.\n * `sh:MinCountConstraintComponent`).\n *\n * @since 0.1.0\n * @category accessors\n */\nexport const componentOf = (constraint: Constraint): Term.NamedNode | Term.BlankNode => {\n  return Match.value(constraint).pipe(\n    Match.tag('Sparql', () => sh.SPARQLConstraintComponent),\n    Match.tag('Component', (custom) => custom.component),\n    Match.orElse((core) => Term.namedNode(SH + componentNames[core._tag])),\n  );\n};\n\n// -----------------------------------------------------------------------------\n// Parsing\n// -----------------------------------------------------------------------------\n\nclass ParseFailure {\n  readonly message: string;\n  readonly node: Option.Option<Term.Term>;\n  constructor(message: string, node: Option.Option<Term.Term>) {\n    this.message = message;\n    this.node = node;\n  }\n}\n\nconst TRUE = Term.literal('true', xsd.boolean).key;\n\nconst nodeKinds: Record.ReadonlyRecord<string, NodeKind> = Record.fromEntries(\n  Arr.map(\n    [\n      'BlankNode',\n      'IRI',\n      'Literal',\n      'BlankNodeOrIRI',\n      'BlankNodeOrLiteral',\n      'IRIOrLiteral',\n    ] as const,\n    (k) => [SH + k, k] as const,\n  ),\n);\n\n/** Parameters of the core constraint components (§4). */\nconst coreParameters: ReadonlyArray<Term.NamedNode> = [\n  sh.class,\n  sh.datatype,\n  sh.nodeKind,\n  sh.minCount,\n  sh.maxCount,\n  sh.minExclusive,\n  sh.minInclusive,\n  sh.maxExclusive,\n  sh.maxInclusive,\n  sh.minLength,\n  sh.maxLength,\n  sh.pattern,\n  sh.flags,\n  sh.languageIn,\n  sh.uniqueLang,\n  sh.equals,\n  sh.disjoint,\n  sh.lessThan,\n  sh.lessThanOrEquals,\n  sh.not,\n  sh.and,\n  sh.or,\n  sh.xone,\n  sh.node,\n  sh.property,\n  sh.qualifiedValueShape,\n  sh.qualifiedValueShapesDisjoint,\n  sh.qualifiedMinCount,\n  sh.qualifiedMaxCount,\n  sh.closed,\n  sh.ignoredProperties,\n  sh.hasValue,\n  sh.in,\n  sh.sparql,\n];\n\nconst targetPredicates: ReadonlyArray<Term.NamedNode> = [\n  sh.targetNode,\n  sh.targetClass,\n  sh.targetSubjectsOf,\n  sh.targetObjectsOf,\n  sh.target,\n];\n\nconst rangeParameters = [\n  [sh.minExclusive, 'MinExclusive'],\n  [sh.minInclusive, 'MinInclusive'],\n  [sh.maxExclusive, 'MaxExclusive'],\n  [sh.maxInclusive, 'MaxInclusive'],\n] as const;\n\nconst pairParameters = [\n  [sh.equals, 'Equals'],\n  [sh.disjoint, 'Disjoint'],\n  [sh.lessThan, 'LessThan'],\n  [sh.lessThanOrEquals, 'LessThanOrEquals'],\n] as const;\n\nconst logicalParameters = [\n  [sh.and, 'And'],\n  [sh.or, 'Or'],\n  [sh.xone, 'Xone'],\n] as const;\n\ninterface ComponentDeclaration {\n  readonly component: Term.NamedNode | Term.BlankNode;\n  readonly mandatory: ReadonlyArray<Term.NamedNode>;\n  readonly optional: ReadonlyArray<Term.NamedNode>;\n}\n\ntype ComponentParameter = ComponentConstraint['parameters'][number];\n\nconst isShapeId: (t: Term.Term) => t is ShapeId = Term.isResource;\n\n/**\n * Parses a shapes graph synchronously, returning a `Result`.\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parseResult = (\n  dataset: Dataset.Dataset,\n): Result.Result<ShapesGraph, ShapesGraphError> =>\n  Result.try({\n    try: () => parseUnsafe(dataset),\n    catch: (e) => {\n      if (e instanceof ParseFailure) {\n        return new ShapesGraphError(\n          Option.match(e.node, {\n            onNone: () => ({ message: e.message }),\n            onSome: (node) => ({ message: e.message, node: node.key }),\n          }),\n        );\n      }\n      throw e;\n    },\n  });\n\n/**\n * Parses a shapes graph into a typed model. Fails with a `ShapesGraphError`\n * when the shapes graph is ill-formed (e.g. malformed paths or lists,\n * parameters with values of the wrong kind, or invalid regular expressions).\n *\n * @since 0.1.0\n * @category parsing\n */\nexport const parse = (dataset: Dataset.Dataset): Effect.Effect<ShapesGraph, ShapesGraphError> =>\n  Effect.suspend(() => {\n    const result = parseResult(dataset);\n    return Result.isSuccess(result) ? Effect.succeed(result.success) : Effect.fail(result.failure);\n  });\n\nconst failShapes = (message: string, node?: Term.Term): never => {\n  throw new ParseFailure(message, Option.fromUndefinedOr(node));\n};\n\nconst isTrue = (t: Term.Term): boolean => t.key === TRUE;\n\nconst isTrueOption = (t: Option.Option<Term.Term>): boolean => Option.exists(t, isTrue);\n\nconst shapeRef = (owner: Term.Term, p: Term.NamedNode, t: Term.Term): ShapeId =>\n  isShapeId(t)\n    ? t\n    : failShapes(`the value of ${p.key} on ${owner.key} must be an IRI or blank node`, owner);\n\nconst resourceOf = (owner: Term.Term, t: Term.Term, message: string): Term.Resource =>\n  Term.isResource(t) ? t : failShapes(message, owner);\n\nconst iriOf = (owner: Term.Term, p: Term.NamedNode, t: Term.Term): Term.NamedNode =>\n  Term.isNamedNode(t)\n    ? t\n    : failShapes(`the value of ${p.key} on ${owner.key} must be an IRI`, owner);\n\nconst nonNegativeInteger = (owner: Term.Term, p: Term.NamedNode, t: Term.Term): number => {\n  if (Term.isLiteral(t) && Xsd.isIntegerDatatype(t.datatype.value) && Xsd.isWellFormed(t)) {\n    const n = Number(t.value);\n    if (n >= 0) return n;\n  }\n  return failShapes(\n    `the value of ${p.key} on ${owner.key} must be a non-negative xsd:integer`,\n    owner,\n  );\n};\n\n/** Reads values from the shapes graph, failing on ill-formed lists and repeated values. */\ninterface Reader {\n  readonly g: Dataset.Dataset;\n  readonly objects: (s: Term.Term, p: Term.NamedNode) => ReadonlyArray<Term.GroundTerm>;\n  readonly list: (\n    owner: Term.Term,\n    head: Term.Term,\n    p: Term.NamedNode,\n  ) => ReadonlyArray<Term.GroundTerm>;\n  readonly single: (s: Term.Term, p: Term.NamedNode) => Option.Option<Term.GroundTerm>;\n}\n\nconst makeReader = (g: Dataset.Dataset): Reader => {\n  const objects = (s: Term.Term, p: Term.NamedNode): ReadonlyArray<Term.GroundTerm> =>\n    isShapeId(s) ? Dataset.objectsOf(g, s, p) : [];\n  const list = (\n    owner: Term.Term,\n    head: Term.Term,\n    p: Term.NamedNode,\n  ): ReadonlyArray<Term.GroundTerm> => {\n    const items = Term.isObject(head) ? Dataset.list(g, head) : Option.none();\n    if (Option.isNone(items))\n      return failShapes(\n        `the value of ${p.key} on ${owner.key} must be a well-formed RDF list`,\n        owner,\n      );\n    return items.value;\n  };\n  const single = (s: Term.Term, p: Term.NamedNode): Option.Option<Term.GroundTerm> => {\n    const vs = objects(s, p);\n    if (vs.length > 1) failShapes(`${s.key} has more than one value for ${p.key}`, s);\n    return Arr.head(vs);\n  };\n  return { g, objects, list, single };\n};\n\n// --- Custom constraint components -------------------------------------------\n\nconst parameterPath = (r: Reader, c: Term.Term, param: Term.GroundTerm): Term.NamedNode =>\n  Option.getOrElse(Option.filter(r.single(param, sh.path), Term.isNamedNode), () =>\n    failShapes(`parameter ${param.key} of ${c.key} must have an IRI sh:path`, param),\n  );\n\nconst componentDeclarations = (r: Reader): ReadonlyArray<ComponentDeclaration> =>\n  Arr.flatMap(Rdfs.instancesOf(r.g, sh.ConstraintComponent), (c) => {\n    if (!isShapeId(c) || (Term.isNamedNode(c) && c.value.startsWith(SH))) return [];\n    const parameters = Arr.map(r.objects(c, sh.parameter), (param) => {\n      const path = parameterPath(r, c, param);\n      return { path, optional: isTrueOption(r.single(param, sh.optional)) };\n    });\n    const mandatory = Arr.map(\n      Arr.filter(parameters, (p) => !p.optional),\n      (p) => p.path,\n    );\n    const optional = Arr.map(\n      Arr.filter(parameters, (p) => p.optional),\n      (p) => p.path,\n    );\n    return Arr.isReadonlyArrayNonEmpty(mandatory) ? [{ component: c, mandatory, optional }] : [];\n  });\n\n// --- Collect shapes (§2.1) --------------------------------------------------\n\nconst collectCandidates = (\n  r: Reader,\n  components: ReadonlyArray<ComponentDeclaration>,\n): ReadonlyArray<ShapeId> => {\n  const candidates = MutableHashMap.empty<string, ShapeId>();\n  const addCandidate = (t: Term.Term, reason: string) => {\n    if (!isShapeId(t)) failShapes(`${t.key} cannot be a shape (${reason})`, t);\n    else if (!MutableHashMap.has(candidates, t.key)) MutableHashMap.set(candidates, t.key, t);\n  };\n  Arr.forEach([sh.NodeShape, sh.PropertyShape], (cls) =>\n    Arr.forEach(Rdfs.instancesOf(r.g, cls), (s) => addCandidate(s, `instance of ${cls.key}`)),\n  );\n  const subjectTriggers = [\n    ...targetPredicates,\n    ...coreParameters,\n    ...components.flatMap((c) => c.mandatory),\n  ];\n  Arr.forEach(subjectTriggers, (p) =>\n    Arr.forEach(Dataset.match(r.g, { predicate: p }), (q) => {\n      if (!Term.isTriple(q.subject)) addCandidate(q.subject, `subject of ${p.key}`);\n    }),\n  );\n  Arr.forEach([sh.node, sh.property, sh.qualifiedValueShape, sh.not], (p) =>\n    Arr.forEach(Dataset.match(r.g, { predicate: p }), (q) =>\n      addCandidate(q.object, `value of ${p.key}`),\n    ),\n  );\n  Arr.forEach([sh.and, sh.or, sh.xone], (p) =>\n    Arr.forEach(Dataset.match(r.g, { predicate: p }), (q) =>\n      Arr.forEach(r.list(q.subject, q.object, p), (member) =>\n        addCandidate(member, `member of ${p.key}`),\n      ),\n    ),\n  );\n  return Arr.sort(MutableHashMap.values(candidates), Term.compare);\n};\n\n// --- Parse each shape -------------------------------------------------------\n\nconst parseTargets = (\n  r: Reader,\n  id: ShapeId,\n  classInstances: MutableHashSet.MutableHashSet<string>,\n): ReadonlyArray<Target> => [\n  ...Arr.map(objects(r, id, sh.targetNode), (node): Target => ({ _tag: 'TargetNode', node })),\n  ...Arr.map(objects(r, id, sh.targetClass), (c): Target => ({\n    _tag: 'TargetClass',\n    class: resourceOf(id, c, `the value of sh:targetClass on ${id.key} must be an IRI`),\n    implicit: false,\n  })),\n  ...(Term.isNamedNode(id) && MutableHashSet.has(classInstances, id.key)\n    ? [{ _tag: 'TargetClass', class: id, implicit: true } satisfies Target]\n    : []),\n  ...Arr.map(objects(r, id, sh.targetSubjectsOf), (p): Target => ({\n    _tag: 'TargetSubjectsOf',\n    predicate: iriOf(id, sh.targetSubjectsOf, p),\n  })),\n  ...Arr.map(objects(r, id, sh.targetObjectsOf), (p): Target => ({\n    _tag: 'TargetObjectsOf',\n    predicate: iriOf(id, sh.targetObjectsOf, p),\n  })),\n  ...Arr.map(objects(r, id, sh.target), (node): Target => ({ _tag: 'SparqlTarget', node })),\n];\n\nconst objects = (r: Reader, s: Term.Term, p: Term.NamedNode) => r.objects(s, p);\n\nconst valueConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> => [\n  ...Arr.map(objects(r, id, sh.class), (c): Constraint => ({\n    _tag: 'Class',\n    class: resourceOf(id, c, `the value of sh:class on ${id.key} must be an IRI`),\n  })),\n  ...Arr.map(objects(r, id, sh.datatype), (d): Constraint => ({\n    _tag: 'Datatype',\n    datatype: iriOf(id, sh.datatype, d),\n  })),\n  ...Arr.map(objects(r, id, sh.nodeKind), (k): Constraint => ({\n    _tag: 'NodeKind',\n    nodeKind: Option.getOrElse(Record.get(nodeKinds, Term.isNamedNode(k) ? k.value : ''), () =>\n      failShapes(`${k.key} is not a valid sh:nodeKind`, id),\n    ),\n  })),\n  ...Arr.map(objects(r, id, sh.minCount), (n): Constraint => ({\n    _tag: 'MinCount',\n    minCount: nonNegativeInteger(id, sh.minCount, n),\n  })),\n  ...Arr.map(objects(r, id, sh.maxCount), (n): Constraint => ({\n    _tag: 'MaxCount',\n    maxCount: nonNegativeInteger(id, sh.maxCount, n),\n  })),\n  ...Arr.flatMap(rangeParameters, ([p, tag]) =>\n    Arr.map(objects(r, id, p), (v): Constraint =>\n      Term.isLiteral(v)\n        ? { _tag: tag, value: v }\n        : failShapes(`the value of ${p.key} on ${id.key} must be a literal`, id),\n    ),\n  ),\n  ...Arr.map(objects(r, id, sh.minLength), (n): Constraint => ({\n    _tag: 'MinLength',\n    minLength: nonNegativeInteger(id, sh.minLength, n),\n  })),\n  ...Arr.map(objects(r, id, sh.maxLength), (n): Constraint => ({\n    _tag: 'MaxLength',\n    maxLength: nonNegativeInteger(id, sh.maxLength, n),\n  })),\n  ...patternConstraints(r, id),\n  ...Arr.map(objects(r, id, sh.languageIn), (l): Constraint => ({\n    _tag: 'LanguageIn',\n    languages: Arr.map(r.list(id, l, sh.languageIn), (t) =>\n      Term.isLiteral(t)\n        ? t.value\n        : failShapes(`sh:languageIn members of ${id.key} must be literals`, id),\n    ),\n  })),\n  ...Arr.flatMap(objects(r, id, sh.uniqueLang), (u): ReadonlyArray<Constraint> =>\n    isTrue(u) ? [{ _tag: 'UniqueLang' }] : [],\n  ),\n  ...Arr.flatMap(pairParameters, ([p, tag]) =>\n    Arr.map(objects(r, id, p), (v): Constraint => ({ _tag: tag, predicate: iriOf(id, p, v) })),\n  ),\n];\n\nconst patternConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> => {\n  const patterns = objects(r, id, sh.pattern);\n  if (Arr.isReadonlyArrayEmpty(patterns)) return [];\n  const flags = Option.match(r.single(id, sh.flags), {\n    onNone: () => '',\n    onSome: (f) =>\n      Term.isLiteral(f)\n        ? f.value\n        : failShapes(`the value of sh:flags on ${id.key} must be a literal`, id),\n  });\n  return Arr.map(patterns, (p): Constraint => {\n    if (!Term.isLiteral(p))\n      return failShapes(`the value of sh:pattern on ${id.key} must be a literal`, id);\n    return Result.match(Regex.compile(p.value, flags), {\n      onFailure: (error) => failShapes(`${error} (sh:pattern on ${id.key})`, id),\n      onSuccess: (regex) => ({ _tag: 'Pattern', pattern: p.value, flags, regex }),\n    });\n  });\n};\n\nconst shapeConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> => [\n  ...Arr.map(objects(r, id, sh.not), (s): Constraint => ({\n    _tag: 'Not',\n    shape: shapeRef(id, sh.not, s),\n  })),\n  ...Arr.flatMap(logicalParameters, ([p, tag]) =>\n    Arr.map(objects(r, id, p), (l): Constraint => ({\n      _tag: tag,\n      shapes: r.list(id, l, p).map((m) => shapeRef(id, p, m)),\n    })),\n  ),\n  ...Arr.map(objects(r, id, sh.node), (s): Constraint => ({\n    _tag: 'Node',\n    shape: shapeRef(id, sh.node, s),\n  })),\n  ...Arr.map(objects(r, id, sh.property), (s): Constraint => ({\n    _tag: 'Property',\n    shape: shapeRef(id, sh.property, s),\n  })),\n];\n\n/** The other qualified value shapes of the property shapes beside `id`. */\nconst siblingShapes = (r: Reader, id: ShapeId, q: ShapeId): ReadonlyArray<ShapeId> => {\n  const siblings = MutableHashMap.empty<string, ShapeId>();\n  Arr.forEach(Dataset.subjectsOf(r.g, sh.property, id), (parent) =>\n    Arr.forEach(objects(r, parent, sh.property), (sibling) =>\n      Arr.forEach(objects(r, sibling, sh.qualifiedValueShape), (sq) => {\n        if (sq.key !== q.key && isShapeId(sq)) MutableHashMap.set(siblings, sq.key, sq);\n      }),\n    ),\n  );\n  return Arr.fromIterable(MutableHashMap.values(siblings));\n};\n\nconst qualifiedConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> => {\n  const qualifiedShapes = objects(r, id, sh.qualifiedValueShape);\n  if (Arr.isReadonlyArrayEmpty(qualifiedShapes)) return [];\n  const minNode = r.single(id, sh.qualifiedMinCount);\n  const maxNode = r.single(id, sh.qualifiedMaxCount);\n  const disjoint = isTrueOption(r.single(id, sh.qualifiedValueShapesDisjoint));\n  return Arr.flatMap(qualifiedShapes, (qNode) => {\n    const q = shapeRef(id, sh.qualifiedValueShape, qNode);\n    const common = { shape: q, disjoint, siblings: disjoint ? siblingShapes(r, id, q) : [] };\n    return [\n      ...Option.toArray(\n        Option.map(minNode, (n): Constraint => ({\n          _tag: 'QualifiedMinCount',\n          count: nonNegativeInteger(id, sh.qualifiedMinCount, n),\n          ...common,\n        })),\n      ),\n      ...Option.toArray(\n        Option.map(maxNode, (n): Constraint => ({\n          _tag: 'QualifiedMaxCount',\n          count: nonNegativeInteger(id, sh.qualifiedMaxCount, n),\n          ...common,\n        })),\n      ),\n    ];\n  });\n};\n\nconst closedConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> => {\n  if (!isTrueOption(r.single(id, sh.closed))) return [];\n  const ignoredProperties = Option.match(r.single(id, sh.ignoredProperties), {\n    onNone: (): ReadonlyArray<Term.NamedNode> => [],\n    onSome: (node) =>\n      Arr.map(r.list(id, node, sh.ignoredProperties), (t) => iriOf(id, sh.ignoredProperties, t)),\n  });\n  const allowed = MutableHashMap.empty<string, Term.NamedNode>();\n  Arr.forEach(objects(r, id, sh.property), (p) =>\n    Arr.forEach(objects(r, p, sh.path), (path) => {\n      if (Term.isNamedNode(path)) MutableHashMap.set(allowed, path.key, path);\n    }),\n  );\n  Arr.forEach(ignoredProperties, (p) => {\n    MutableHashMap.set(allowed, p.key, p);\n  });\n  return [\n    {\n      _tag: 'Closed',\n      ignoredProperties,\n      allowedProperties: Arr.fromIterable(MutableHashMap.values(allowed)),\n    },\n  ];\n};\n\nconst sparqlConstraints = (r: Reader, id: ShapeId): ReadonlyArray<Constraint> =>\n  Arr.flatMap(objects(r, id, sh.sparql), (s): ReadonlyArray<Constraint> => {\n    if (!isShapeId(s))\n      return failShapes(`the value of sh:sparql on ${id.key} must be an IRI or blank node`, id);\n    return isTrueOption(r.single(s, sh.deactivated)) ? [] : [{ _tag: 'Sparql', node: s }];\n  });\n\nconst noParameters: ReadonlyArray<ReadonlyArray<ComponentParameter>> = [[]];\n\nconst componentConstraints = (\n  r: Reader,\n  id: ShapeId,\n  components: ReadonlyArray<ComponentDeclaration>,\n): ReadonlyArray<Constraint> =>\n  Arr.flatMap(components, (decl): ReadonlyArray<Constraint> => {\n    const bindings = Arr.map(\n      [...decl.mandatory, ...decl.optional],\n      (p) => [p, objects(r, id, p)] as const,\n    );\n    if (decl.mandatory.some((p) => Arr.isReadonlyArrayEmpty(objects(r, id, p)))) return [];\n    // One constraint per combination of parameter values.\n    const combos = Arr.reduce(bindings, noParameters, (acc, [path, values]) =>\n      Arr.isReadonlyArrayEmpty(values)\n        ? acc\n        : Arr.flatMap(acc, (combo) => values.map((value) => Arr.append(combo, { path, value }))),\n    );\n    return Arr.map(combos, (parameters): Constraint => ({\n      _tag: 'Component',\n      component: decl.component,\n      parameters,\n    }));\n  });\n\nconst parseShape = (\n  r: Reader,\n  components: ReadonlyArray<ComponentDeclaration>,\n  classInstances: MutableHashSet.MutableHashSet<string>,\n  id: ShapeId,\n): Shape => {\n  const targets = parseTargets(r, id, classInstances);\n\n  // Shape characteristics\n  const severity = Option.match(r.single(id, sh.severity), {\n    onNone: () => sh.Violation,\n    onSome: (node) => iriOf(id, sh.severity, node),\n  });\n  const messages = objects(r, id, sh.message).filter(Term.isLiteral);\n  const deactivated = isTrueOption(r.single(id, sh.deactivated));\n\n  const constraints: ReadonlyArray<Constraint> = [\n    ...valueConstraints(r, id),\n    ...shapeConstraints(r, id),\n    ...qualifiedConstraints(r, id),\n    ...closedConstraints(r, id),\n    ...Arr.map(objects(r, id, sh.hasValue), (v): Constraint => ({ _tag: 'HasValue', value: v })),\n    ...Arr.map(objects(r, id, sh.in), (l): Constraint => ({\n      _tag: 'In',\n      values: r.list(id, l, sh.in),\n    })),\n    ...sparqlConstraints(r, id),\n    ...componentConstraints(r, id, components),\n  ];\n\n  // Property shape?\n  return Option.match(r.single(id, sh.path), {\n    onNone: (): Shape => ({\n      _tag: 'NodeShape',\n      id,\n      targets,\n      constraints,\n      severity,\n      messages,\n      deactivated,\n    }),\n    onSome: (pathNode): Shape => ({\n      _tag: 'PropertyShape',\n      id,\n      path: Result.getOrElse(Path.fromRdf(r.g, pathNode), (failure) =>\n        failShapes(`ill-formed sh:path of ${id.key}: ${failure.message}`, id),\n      ),\n      targets,\n      constraints,\n      severity,\n      messages,\n      deactivated,\n    }),\n  });\n};\n\nconst parseUnsafe = (g: Dataset.Dataset): ShapesGraph => {\n  const r = makeReader(g);\n  const components = componentDeclarations(r);\n  const candidates = collectCandidates(r, components);\n  const classInstances = MutableHashSet.fromIterable(\n    Arr.map(Rdfs.instancesOf(g, rdfs.Class), (c) => c.key),\n  );\n  const shapes = Arr.map(candidates, (id) => parseShape(r, components, classInstances, id));\n  // The public `index` is a `ReadonlyMap`.\n  const index = new Map(shapes.map((s) => [s.id.key, s]));\n  return { _tag: 'ShapesGraph', dataset: g, shapes, index };\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAYA,MAAM,QAAQ,OAAO,WAAW,OAAO,eAAe,OAAO,MAAM,CAAC;AAEpE,MAAM,aAAa,MAAc,EAAE,QAAQ,uBAAuB,MAAM;;AAGxE,MAAM,mBAAmB,MAAsB;CAC7C,IAAI,UAAU;CACd,OAAO,EAAE,QAAQ,+BAA+B,UAAU;EACxD,IAAI,UAAU,KAAK,UAAU;OACxB,IAAI,UAAU,KAAK,UAAU;OAC7B,IAAI,WAAW,KAAK,KAAK,GAAG,OAAO,UAAU,QAAQ;EAC1D,OAAO;CACT,CAAC;AACH;AAEA,MAAM,aAAa;;;;;;;AAQnB,MAAa,WAAW,SAAiB,UAAiD;CACxF,MAAM,QAAQ,IAAI,aAAa,KAAK;CACpC,MAAM,cAAc,IAAI,UAAU,QAAQ,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;CACpE,IAAI,OAAO,OAAO,WAAW,GAC3B,OAAO,OAAO,KAAK,wCAAwC,YAAY,MAAM,EAAE;CACjF,MAAM,UAAU,IAAI,KAAK,IAAI,OAAO,IAAI,OAAO,QAAQ,MAAM,MAAM,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE;CACpF,MAAM,SAAS,MAAM,SAAS,GAAG,IAC7B,UAAU,OAAO,IACjB,MAAM,SAAS,GAAG,IAChB,gBAAgB,OAAO,IACvB;CAGN,OAAO,OAAO,SACZ,OAAO,OACL,OAAO,UAAU,IAAI,OAAO,QAAQ,GAAG,QAAQ,EAAE,CAAC,SAC5C,OAAO,UAAU,IAAI,OAAO,QAAQ,OAAO,CAAC,CACpD,IACC,YAAY,8BAA8B,MAAM,OAAO,EAAE,IAAI,OAAO,OAAO,GAC9E;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtBA,MAAM,EAAE,MAAM,QAAQA;;;;;;;;AAatB,IAAa,mBAAb,cAAsC,OAAO,YAA8B,CAAC,CAAC,oBAAoB;CAC/F,SAAS,OAAO;;CAEhB,MAAM,OAAO,SAAS,OAAO,MAAM;AACrC,CAAC,CAAC,CAAC,CAAC;;;;;AAkNJ,MAAa,iBAAiB,MAAiC,UAAU,SAAS,GAAG,aAAa;;;;;;;AAQlG,MAAa,OAAO,MAAmB,OACrC,OAAO,cAAc,KAAK,MAAM,IAAI,GAAG,GAAG,CAAC;;;;;;;AAQ7C,MAAa,kBAAkB,SAC7B,KAAK,OAAO,QAAQ,MAAM,CAAC,EAAE,eAAe,IAAI,wBAAwB,EAAE,OAAO,CAAC;;;;;;;;AASpF,MAAa,cAAc,SACzB,KAAK,OAAO,MACT,MACC,EAAE,QAAQ,KAAK,UAAU,SAAS,cAAc,CAAC,KACjD,EAAE,YAAY,MACX,MAAM,UAAU,SAAS,GAAG,QAAQ,KAAK,UAAU,SAAS,GAAG,WAAW,CAC7E,CACJ;AAEF,MAAM,iBAGF;CACF,OAAO;CACP,UAAU;CACV,UAAU;CACV,UAAU;CACV,UAAU;CACV,cAAc;CACd,cAAc;CACd,cAAc;CACd,cAAc;CACd,WAAW;CACX,WAAW;CACX,SAAS;CACT,YAAY;CACZ,YAAY;CACZ,QAAQ;CACR,UAAU;CACV,UAAU;CACV,kBAAkB;CAClB,KAAK;CACL,KAAK;CACL,IAAI;CACJ,MAAM;CACN,MAAM;CACN,UAAU;CACV,mBAAmB;CACnB,mBAAmB;CACnB,QAAQ;CACR,UAAU;CACV,IAAI;AACN;;;;;;;;AASA,MAAa,eAAe,eAA4D;CACtF,OAAO,MAAM,MAAM,UAAU,CAAC,CAAC,KAC7B,MAAM,IAAI,gBAAgB,GAAG,yBAAyB,GACtD,MAAM,IAAI,cAAc,WAAW,OAAO,SAAS,GACnD,MAAM,QAAQ,SAASC,UAAe,KAAK,eAAe,KAAK,KAAK,CAAC,CACvE;AACF;AAMA,IAAM,eAAN,MAAmB;CACjB;CACA;CACA,YAAY,SAAiB,MAAgC;EAC3D,KAAK,UAAU;EACf,KAAK,OAAO;CACd;AACF;AAEA,MAAM,OAAOC,QAAa,QAAQ,IAAI,OAAO,CAAC,CAAC;AAE/C,MAAM,YAAqD,OAAO,YAChE,IAAI,IACF;CACE;CACA;CACA;CACA;CACA;CACA;AACF,IACC,MAAM,CAAC,KAAK,GAAG,CAAC,CACnB,CACF;;AAGA,MAAM,iBAAgD;CACpD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;AACL;AAEA,MAAM,mBAAkD;CACtD,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;AACL;AAEA,MAAM,kBAAkB;CACtB,CAAC,GAAG,cAAc,cAAc;CAChC,CAAC,GAAG,cAAc,cAAc;CAChC,CAAC,GAAG,cAAc,cAAc;CAChC,CAAC,GAAG,cAAc,cAAc;AAClC;AAEA,MAAM,iBAAiB;CACrB,CAAC,GAAG,QAAQ,QAAQ;CACpB,CAAC,GAAG,UAAU,UAAU;CACxB,CAAC,GAAG,UAAU,UAAU;CACxB,CAAC,GAAG,kBAAkB,kBAAkB;AAC1C;AAEA,MAAM,oBAAoB;CACxB,CAAC,GAAG,KAAK,KAAK;CACd,CAAC,GAAG,IAAI,IAAI;CACZ,CAAC,GAAG,MAAM,MAAM;AAClB;AAUA,MAAM,YAA4CC;;;;;;;AAQlD,MAAa,eACX,YAEA,OAAO,IAAI;CACT,WAAW,YAAY,OAAO;CAC9B,QAAQ,MAAM;EACZ,IAAI,aAAa,cACf,OAAO,IAAI,iBACT,OAAO,MAAM,EAAE,MAAM;GACnB,eAAe,EAAE,SAAS,EAAE,QAAQ;GACpC,SAAS,UAAU;IAAE,SAAS,EAAE;IAAS,MAAM,KAAK;GAAI;EAC1D,CAAC,CACH;EAEF,MAAM;CACR;AACF,CAAC;;;;;;;;;AAUH,MAAa,SAAS,YACpB,OAAO,cAAc;CACnB,MAAM,SAAS,YAAY,OAAO;CAClC,OAAO,OAAO,UAAU,MAAM,IAAI,OAAO,QAAQ,OAAO,OAAO,IAAI,OAAO,KAAK,OAAO,OAAO;AAC/F,CAAC;AAEH,MAAM,cAAc,SAAiB,SAA4B;CAC/D,MAAM,IAAI,aAAa,SAAS,OAAO,gBAAgB,IAAI,CAAC;AAC9D;AAEA,MAAM,UAAU,MAA0B,EAAE,QAAQ;AAEpD,MAAM,gBAAgB,MAAyC,OAAO,OAAO,GAAG,MAAM;AAEtF,MAAM,YAAY,OAAkB,GAAmB,MACrD,UAAU,CAAC,IACP,IACA,WAAW,gBAAgB,EAAE,IAAI,MAAM,MAAM,IAAI,gCAAgC,KAAK;AAE5F,MAAM,cAAc,OAAkB,GAAc,YAClDA,WAAgB,CAAC,IAAI,IAAI,WAAW,SAAS,KAAK;AAEpD,MAAM,SAAS,OAAkB,GAAmB,MAClDC,YAAiB,CAAC,IACd,IACA,WAAW,gBAAgB,EAAE,IAAI,MAAM,MAAM,IAAI,kBAAkB,KAAK;AAE9E,MAAM,sBAAsB,OAAkB,GAAmB,MAAyB;CACxF,IAAIC,UAAe,CAAC,KAAKC,kBAAsB,EAAE,SAAS,KAAK,KAAKC,aAAiB,CAAC,GAAG;EACvF,MAAM,IAAI,OAAO,EAAE,KAAK;EACxB,IAAI,KAAK,GAAG,OAAO;CACrB;CACA,OAAO,WACL,gBAAgB,EAAE,IAAI,MAAM,MAAM,IAAI,sCACtC,KACF;AACF;AAcA,MAAM,cAAc,MAA+B;CACjD,MAAM,WAAW,GAAc,MAC7B,UAAU,CAAC,IAAIC,UAAkB,GAAG,GAAG,CAAC,IAAI,CAAC;CAC/C,MAAMC,UACJ,OACA,MACA,MACmC;EACnC,MAAM,QAAQC,SAAc,IAAI,IAAIC,KAAa,GAAG,IAAI,IAAI,OAAO,KAAK;EACxE,IAAI,OAAO,OAAO,KAAK,GACrB,OAAO,WACL,gBAAgB,EAAE,IAAI,MAAM,MAAM,IAAI,kCACtC,KACF;EACF,OAAO,MAAM;CACf;CACA,MAAM,UAAU,GAAc,MAAsD;EAClF,MAAM,KAAK,QAAQ,GAAG,CAAC;EACvB,IAAI,GAAG,SAAS,GAAG,WAAW,GAAG,EAAE,IAAI,+BAA+B,EAAE,OAAO,CAAC;EAChF,OAAO,IAAI,KAAK,EAAE;CACpB;CACA,OAAO;EAAE;EAAG;EAAS,MAAA;EAAM;CAAO;AACpC;AAIA,MAAM,iBAAiB,GAAW,GAAc,UAC9C,OAAO,UAAU,OAAO,OAAO,EAAE,OAAO,OAAO,GAAG,IAAI,GAAGP,WAAgB,SACvE,WAAW,aAAa,MAAM,IAAI,MAAM,EAAE,IAAI,4BAA4B,KAAK,CACjF;AAEF,MAAM,yBAAyB,MAC7B,IAAI,QAAQQ,YAAiB,EAAE,GAAG,GAAG,mBAAmB,IAAI,MAAM;CAChE,IAAI,CAAC,UAAU,CAAC,KAAMR,YAAiB,CAAC,KAAK,EAAE,MAAM,WAAA,6BAAa,GAAI,OAAO,CAAC;CAC9E,MAAM,aAAa,IAAI,IAAI,EAAE,QAAQ,GAAG,GAAG,SAAS,IAAI,UAAU;EAEhE,OAAO;GAAE,MADI,cAAc,GAAG,GAAG,KACrB;GAAG,UAAU,aAAa,EAAE,OAAO,OAAO,GAAG,QAAQ,CAAC;EAAE;CACtE,CAAC;CACD,MAAM,YAAY,IAAI,IACpB,IAAI,OAAO,aAAa,MAAM,CAAC,EAAE,QAAQ,IACxC,MAAM,EAAE,IACX;CACA,MAAM,WAAW,IAAI,IACnB,IAAI,OAAO,aAAa,MAAM,EAAE,QAAQ,IACvC,MAAM,EAAE,IACX;CACA,OAAO,IAAI,wBAAwB,SAAS,IAAI,CAAC;EAAE,WAAW;EAAG;EAAW;CAAS,CAAC,IAAI,CAAC;AAC7F,CAAC;AAIH,MAAM,qBACJ,GACA,eAC2B;CAC3B,MAAM,aAAa,eAAe,MAAuB;CACzD,MAAM,gBAAgB,GAAc,WAAmB;EACrD,IAAI,CAAC,UAAU,CAAC,GAAG,WAAW,GAAG,EAAE,IAAI,sBAAsB,OAAO,IAAI,CAAC;OACpE,IAAI,CAAC,eAAe,IAAI,YAAY,EAAE,GAAG,GAAG,eAAe,IAAI,YAAY,EAAE,KAAK,CAAC;CAC1F;CACA,IAAI,QAAQ,CAAC,GAAG,WAAW,GAAG,aAAa,IAAI,QAC7C,IAAI,QAAQQ,YAAiB,EAAE,GAAG,GAAG,IAAI,MAAM,aAAa,GAAG,eAAe,IAAI,KAAK,CAAC,CAC1F;CACA,MAAM,kBAAkB;EACtB,GAAG;EACH,GAAG;EACH,GAAG,WAAW,SAAS,MAAM,EAAE,SAAS;CAC1C;CACA,IAAI,QAAQ,kBAAkB,MAC5B,IAAI,QAAQC,MAAc,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,IAAI,MAAM;EACvD,IAAI,CAACC,SAAc,EAAE,OAAO,GAAG,aAAa,EAAE,SAAS,cAAc,EAAE,KAAK;CAC9E,CAAC,CACH;CACA,IAAI,QAAQ;EAAC,GAAG;EAAM,GAAG;EAAU,GAAG;EAAqB,GAAG;CAAG,IAAI,MACnE,IAAI,QAAQD,MAAc,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,IAAI,MACjD,aAAa,EAAE,QAAQ,YAAY,EAAE,KAAK,CAC5C,CACF;CACA,IAAI,QAAQ;EAAC,GAAG;EAAK,GAAG;EAAI,GAAG;CAAI,IAAI,MACrC,IAAI,QAAQA,MAAc,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,IAAI,MACjD,IAAI,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,IAAI,WAC3C,aAAa,QAAQ,aAAa,EAAE,KAAK,CAC3C,CACF,CACF;CACA,OAAO,IAAI,KAAK,eAAe,OAAO,UAAU,GAAGE,OAAY;AACjE;AAIA,MAAM,gBACJ,GACA,IACA,mBAC0B;CAC1B,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,UAAU,IAAI,UAAkB;EAAE,MAAM;EAAc;CAAK,EAAE;CAC1F,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,WAAW,IAAI,OAAe;EACzD,MAAM;EACN,OAAO,WAAW,IAAI,GAAG,kCAAkC,GAAG,IAAI,gBAAgB;EAClF,UAAU;CACZ,EAAE;CACF,GAAIX,YAAiB,EAAE,KAAK,eAAe,IAAI,gBAAgB,GAAG,GAAG,IACjE,CAAC;EAAE,MAAM;EAAe,OAAO;EAAI,UAAU;CAAK,CAAkB,IACpE,CAAC;CACL,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,gBAAgB,IAAI,OAAe;EAC9D,MAAM;EACN,WAAW,MAAM,IAAI,GAAG,kBAAkB,CAAC;CAC7C,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,eAAe,IAAI,OAAe;EAC7D,MAAM;EACN,WAAW,MAAM,IAAI,GAAG,iBAAiB,CAAC;CAC5C,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,MAAM,IAAI,UAAkB;EAAE,MAAM;EAAgB;CAAK,EAAE;AAC1F;AAEA,MAAM,WAAW,GAAW,GAAc,MAAsB,EAAE,QAAQ,GAAG,CAAC;AAE9E,MAAM,oBAAoB,GAAW,OAA2C;CAC9E,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,KAAK,IAAI,OAAmB;EACvD,MAAM;EACN,OAAO,WAAW,IAAI,GAAG,4BAA4B,GAAG,IAAI,gBAAgB;CAC9E,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;EAC1D,MAAM;EACN,UAAU,MAAM,IAAI,GAAG,UAAU,CAAC;CACpC,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;EAC1D,MAAM;EACN,UAAU,OAAO,UAAU,OAAO,IAAI,WAAWA,YAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,SACjF,WAAW,GAAG,EAAE,IAAI,8BAA8B,EAAE,CACtD;CACF,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;EAC1D,MAAM;EACN,UAAU,mBAAmB,IAAI,GAAG,UAAU,CAAC;CACjD,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;EAC1D,MAAM;EACN,UAAU,mBAAmB,IAAI,GAAG,UAAU,CAAC;CACjD,EAAE;CACF,GAAG,IAAI,QAAQ,kBAAkB,CAAC,GAAG,SACnC,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,MAC1BC,UAAe,CAAC,IACZ;EAAE,MAAM;EAAK,OAAO;CAAE,IACtB,WAAW,gBAAgB,EAAE,IAAI,MAAM,GAAG,IAAI,qBAAqB,EAAE,CAC3E,CACF;CACA,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,SAAS,IAAI,OAAmB;EAC3D,MAAM;EACN,WAAW,mBAAmB,IAAI,GAAG,WAAW,CAAC;CACnD,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,SAAS,IAAI,OAAmB;EAC3D,MAAM;EACN,WAAW,mBAAmB,IAAI,GAAG,WAAW,CAAC;CACnD,EAAE;CACF,GAAG,mBAAmB,GAAG,EAAE;CAC3B,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,UAAU,IAAI,OAAmB;EAC5D,MAAM;EACN,WAAW,IAAI,IAAI,EAAE,KAAK,IAAI,GAAG,GAAG,UAAU,IAAI,MAChDA,UAAe,CAAC,IACZ,EAAE,QACF,WAAW,4BAA4B,GAAG,IAAI,oBAAoB,EAAE,CAC1E;CACF,EAAE;CACF,GAAG,IAAI,QAAQ,QAAQ,GAAG,IAAI,GAAG,UAAU,IAAI,MAC7C,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,aAAa,CAAC,IAAI,CAAC,CAC1C;CACA,GAAG,IAAI,QAAQ,iBAAiB,CAAC,GAAG,SAClC,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,OAAmB;EAAE,MAAM;EAAK,WAAW,MAAM,IAAI,GAAG,CAAC;CAAE,EAAE,CAC3F;AACF;AAEA,MAAM,sBAAsB,GAAW,OAA2C;CAChF,MAAM,WAAW,QAAQ,GAAG,IAAI,GAAG,OAAO;CAC1C,IAAI,IAAI,qBAAqB,QAAQ,GAAG,OAAO,CAAC;CAChD,MAAM,QAAQ,OAAO,MAAM,EAAE,OAAO,IAAI,GAAG,KAAK,GAAG;EACjD,cAAc;EACd,SAAS,MACPA,UAAe,CAAC,IACZ,EAAE,QACF,WAAW,4BAA4B,GAAG,IAAI,qBAAqB,EAAE;CAC7E,CAAC;CACD,OAAO,IAAI,IAAI,WAAW,MAAkB;EAC1C,IAAI,CAACA,UAAe,CAAC,GACnB,OAAO,WAAW,8BAA8B,GAAG,IAAI,qBAAqB,EAAE;EAChF,OAAO,OAAO,MAAMW,QAAc,EAAE,OAAO,KAAK,GAAG;GACjD,YAAY,UAAU,WAAW,GAAG,MAAM,kBAAkB,GAAG,IAAI,IAAI,EAAE;GACzE,YAAY,WAAW;IAAE,MAAM;IAAW,SAAS,EAAE;IAAO;IAAO;GAAM;EAC3E,CAAC;CACH,CAAC;AACH;AAEA,MAAM,oBAAoB,GAAW,OAA2C;CAC9E,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,GAAG,IAAI,OAAmB;EACrD,MAAM;EACN,OAAO,SAAS,IAAI,GAAG,KAAK,CAAC;CAC/B,EAAE;CACF,GAAG,IAAI,QAAQ,oBAAoB,CAAC,GAAG,SACrC,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,OAAmB;EAC7C,MAAM;EACN,QAAQ,EAAE,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,CAAC;CACxD,EAAE,CACJ;CACA,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,IAAI,IAAI,OAAmB;EACtD,MAAM;EACN,OAAO,SAAS,IAAI,GAAG,MAAM,CAAC;CAChC,EAAE;CACF,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;EAC1D,MAAM;EACN,OAAO,SAAS,IAAI,GAAG,UAAU,CAAC;CACpC,EAAE;AACJ;;AAGA,MAAM,iBAAiB,GAAW,IAAa,MAAuC;CACpF,MAAM,WAAW,eAAe,MAAuB;CACvD,IAAI,QAAQC,WAAmB,EAAE,GAAG,GAAG,UAAU,EAAE,IAAI,WACrD,IAAI,QAAQ,QAAQ,GAAG,QAAQ,GAAG,QAAQ,IAAI,YAC5C,IAAI,QAAQ,QAAQ,GAAG,SAAS,GAAG,mBAAmB,IAAI,OAAO;EAC/D,IAAI,GAAG,QAAQ,EAAE,OAAO,UAAU,EAAE,GAAG,eAAe,IAAI,UAAU,GAAG,KAAK,EAAE;CAChF,CAAC,CACH,CACF;CACA,OAAO,IAAI,aAAa,eAAe,OAAO,QAAQ,CAAC;AACzD;AAEA,MAAM,wBAAwB,GAAW,OAA2C;CAClF,MAAM,kBAAkB,QAAQ,GAAG,IAAI,GAAG,mBAAmB;CAC7D,IAAI,IAAI,qBAAqB,eAAe,GAAG,OAAO,CAAC;CACvD,MAAM,UAAU,EAAE,OAAO,IAAI,GAAG,iBAAiB;CACjD,MAAM,UAAU,EAAE,OAAO,IAAI,GAAG,iBAAiB;CACjD,MAAM,WAAW,aAAa,EAAE,OAAO,IAAI,GAAG,4BAA4B,CAAC;CAC3E,OAAO,IAAI,QAAQ,kBAAkB,UAAU;EAC7C,MAAM,IAAI,SAAS,IAAI,GAAG,qBAAqB,KAAK;EACpD,MAAM,SAAS;GAAE,OAAO;GAAG;GAAU,UAAU,WAAW,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC;EAAE;EACvF,OAAO,CACL,GAAG,OAAO,QACR,OAAO,IAAI,UAAU,OAAmB;GACtC,MAAM;GACN,OAAO,mBAAmB,IAAI,GAAG,mBAAmB,CAAC;GACrD,GAAG;EACL,EAAE,CACJ,GACA,GAAG,OAAO,QACR,OAAO,IAAI,UAAU,OAAmB;GACtC,MAAM;GACN,OAAO,mBAAmB,IAAI,GAAG,mBAAmB,CAAC;GACrD,GAAG;EACL,EAAE,CACJ,CACF;CACF,CAAC;AACH;AAEA,MAAM,qBAAqB,GAAW,OAA2C;CAC/E,IAAI,CAAC,aAAa,EAAE,OAAO,IAAI,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC;CACpD,MAAM,oBAAoB,OAAO,MAAM,EAAE,OAAO,IAAI,GAAG,iBAAiB,GAAG;EACzE,cAA6C,CAAC;EAC9C,SAAS,SACP,IAAI,IAAI,EAAE,KAAK,IAAI,MAAM,GAAG,iBAAiB,IAAI,MAAM,MAAM,IAAI,GAAG,mBAAmB,CAAC,CAAC;CAC7F,CAAC;CACD,MAAM,UAAU,eAAe,MAA8B;CAC7D,IAAI,QAAQ,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,MACxC,IAAI,QAAQ,QAAQ,GAAG,GAAG,GAAG,IAAI,IAAI,SAAS;EAC5C,IAAIb,YAAiB,IAAI,GAAG,eAAe,IAAI,SAAS,KAAK,KAAK,IAAI;CACxE,CAAC,CACH;CACA,IAAI,QAAQ,oBAAoB,MAAM;EACpC,eAAe,IAAI,SAAS,EAAE,KAAK,CAAC;CACtC,CAAC;CACD,OAAO,CACL;EACE,MAAM;EACN;EACA,mBAAmB,IAAI,aAAa,eAAe,OAAO,OAAO,CAAC;CACpE,CACF;AACF;AAEA,MAAM,qBAAqB,GAAW,OACpC,IAAI,QAAQ,QAAQ,GAAG,IAAI,GAAG,MAAM,IAAI,MAAiC;CACvE,IAAI,CAAC,UAAU,CAAC,GACd,OAAO,WAAW,6BAA6B,GAAG,IAAI,gCAAgC,EAAE;CAC1F,OAAO,aAAa,EAAE,OAAO,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;EAAE,MAAM;EAAU,MAAM;CAAE,CAAC;AACtF,CAAC;AAEH,MAAM,eAAiE,CAAC,CAAC,CAAC;AAE1E,MAAM,wBACJ,GACA,IACA,eAEA,IAAI,QAAQ,aAAa,SAAoC;CAC3D,MAAM,WAAW,IAAI,IACnB,CAAC,GAAG,KAAK,WAAW,GAAG,KAAK,QAAQ,IACnC,MAAM,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAC9B;CACA,IAAI,KAAK,UAAU,MAAM,MAAM,IAAI,qBAAqB,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;CAErF,MAAM,SAAS,IAAI,OAAO,UAAU,eAAe,KAAK,CAAC,MAAM,YAC7D,IAAI,qBAAqB,MAAM,IAC3B,MACA,IAAI,QAAQ,MAAM,UAAU,OAAO,KAAK,UAAU,IAAI,OAAO,OAAO;EAAE;EAAM;CAAM,CAAC,CAAC,CAAC,CAC3F;CACA,OAAO,IAAI,IAAI,SAAS,gBAA4B;EAClD,MAAM;EACN,WAAW,KAAK;EAChB;CACF,EAAE;AACJ,CAAC;AAEH,MAAM,cACJ,GACA,YACA,gBACA,OACU;CACV,MAAM,UAAU,aAAa,GAAG,IAAI,cAAc;CAGlD,MAAM,WAAW,OAAO,MAAM,EAAE,OAAO,IAAI,GAAG,QAAQ,GAAG;EACvD,cAAc,GAAG;EACjB,SAAS,SAAS,MAAM,IAAI,GAAG,UAAU,IAAI;CAC/C,CAAC;CACD,MAAM,WAAW,QAAQ,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,OAAOC,SAAc;CACjE,MAAM,cAAc,aAAa,EAAE,OAAO,IAAI,GAAG,WAAW,CAAC;CAE7D,MAAM,cAAyC;EAC7C,GAAG,iBAAiB,GAAG,EAAE;EACzB,GAAG,iBAAiB,GAAG,EAAE;EACzB,GAAG,qBAAqB,GAAG,EAAE;EAC7B,GAAG,kBAAkB,GAAG,EAAE;EAC1B,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,QAAQ,IAAI,OAAmB;GAAE,MAAM;GAAY,OAAO;EAAE,EAAE;EAC3F,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,EAAE,IAAI,OAAmB;GACpD,MAAM;GACN,QAAQ,EAAE,KAAK,IAAI,GAAG,GAAG,EAAE;EAC7B,EAAE;EACF,GAAG,kBAAkB,GAAG,EAAE;EAC1B,GAAG,qBAAqB,GAAG,IAAI,UAAU;CAC3C;CAGA,OAAO,OAAO,MAAM,EAAE,OAAO,IAAI,GAAG,IAAI,GAAG;EACzC,eAAsB;GACpB,MAAM;GACN;GACA;GACA;GACA;GACA;GACA;EACF;EACA,SAAS,cAAqB;GAC5B,MAAM;GACN;GACA,MAAM,OAAO,UAAUa,QAAa,EAAE,GAAG,QAAQ,IAAI,YACnD,WAAW,yBAAyB,GAAG,IAAI,IAAI,QAAQ,WAAW,EAAE,CACtE;GACA;GACA;GACA;GACA;GACA;EACF;CACF,CAAC;AACH;AAEA,MAAM,eAAe,MAAoC;CACvD,MAAM,IAAI,WAAW,CAAC;CACtB,MAAM,aAAa,sBAAsB,CAAC;CAC1C,MAAM,aAAa,kBAAkB,GAAG,UAAU;CAClD,MAAM,iBAAiB,eAAe,aACpC,IAAI,IAAIN,YAAiB,GAAG,KAAK,KAAK,IAAI,MAAM,EAAE,GAAG,CACvD;CACA,MAAM,SAAS,IAAI,IAAI,aAAa,OAAO,WAAW,GAAG,YAAY,gBAAgB,EAAE,CAAC;CAGxF,OAAO;EAAE,MAAM;EAAe,SAAS;EAAG;EAAQ,OAAA,IADhC,IAAI,OAAO,KAAK,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CACC;CAAE;AAC1D"}

package/dist/Shapes-BQFDFc4Q.d.mts

@@ -0,0 +1,306 @@
+import { C as Resource, T as Term, d as NamedNode, l as Literal, s as GroundTerm, t as BlankNode } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+import "./index-Cms2TYfC.mjs";
+import { i as Path } from "./Path-DRB8e-Zn.mjs";
+import * as Option from "effect/Option";
+import * as Schema from "effect/Schema";
+import * as Effect from "effect/Effect";
+import * as Result from "effect/Result";
+declare namespace Shapes_d_exports {
+  export { ComponentConstraint, Constraint, ConstraintTag, NodeKind, NodeShape, PropertyShape, Shape, ShapeId, ShapesGraph, ShapesGraphError, SparqlConstraint, Target, componentOf, get, isShapesGraph, parse, parseResult, targetedShapes, usesSparql };
+}
+declare const ShapesGraphError_base: Schema.Class<ShapesGraphError, Schema.TaggedStruct<"ShapesGraphError", {
+  readonly message: Schema.String;
+  /** The N-Triples form of the offending node, when known. */
+  readonly node: Schema.optional<Schema.String>;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * The shapes graph is ill-formed (§3.4.1 "ill-formed shapes graph"), so it
+ * cannot be used for validation.
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class ShapesGraphError extends ShapesGraphError_base {}
+/**
+ * The identifier of a shape: an IRI or a blank node of the shapes graph.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type ShapeId = NamedNode | BlankNode;
+/**
+ * A target declaration (§2.1.3).
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type Target = {
+  readonly _tag: 'TargetNode';
+  readonly node: GroundTerm;
+} | {
+  readonly _tag: 'TargetClass';
+  readonly class: Resource;
+  readonly implicit: boolean;
+} | {
+  readonly _tag: 'TargetSubjectsOf';
+  readonly predicate: NamedNode;
+} | {
+  readonly _tag: 'TargetObjectsOf';
+  readonly predicate: NamedNode;
+} | {
+  /** A SPARQL-based target or custom target type (`sh:target`). */
+  readonly _tag: 'SparqlTarget';
+  readonly node: GroundTerm;
+};
+/**
+ * The node kinds of `sh:nodeKind`.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type NodeKind = 'BlankNode' | 'IRI' | 'Literal' | 'BlankNodeOrIRI' | 'BlankNodeOrLiteral' | 'IRIOrLiteral';
+/**
+ * A constraint on a value node set, i.e. an instance of a constraint
+ * component with its parameter values (§2.2, §4).
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type Constraint = {
+  readonly _tag: 'Class';
+  readonly class: Resource;
+} | {
+  readonly _tag: 'Datatype';
+  readonly datatype: NamedNode;
+} | {
+  readonly _tag: 'NodeKind';
+  readonly nodeKind: NodeKind;
+} | {
+  readonly _tag: 'MinCount';
+  readonly minCount: number;
+} | {
+  readonly _tag: 'MaxCount';
+  readonly maxCount: number;
+} | {
+  readonly _tag: 'MinExclusive';
+  readonly value: GroundTerm;
+} | {
+  readonly _tag: 'MinInclusive';
+  readonly value: GroundTerm;
+} | {
+  readonly _tag: 'MaxExclusive';
+  readonly value: GroundTerm;
+} | {
+  readonly _tag: 'MaxInclusive';
+  readonly value: GroundTerm;
+} | {
+  readonly _tag: 'MinLength';
+  readonly minLength: number;
+} | {
+  readonly _tag: 'MaxLength';
+  readonly maxLength: number;
+} | {
+  readonly _tag: 'Pattern';
+  readonly pattern: string;
+  readonly flags: string;
+  readonly regex: RegExp;
+} | {
+  readonly _tag: 'LanguageIn';
+  readonly languages: ReadonlyArray<string>;
+} | {
+  readonly _tag: 'UniqueLang';
+} | {
+  readonly _tag: 'Equals';
+  readonly predicate: NamedNode;
+} | {
+  readonly _tag: 'Disjoint';
+  readonly predicate: NamedNode;
+} | {
+  readonly _tag: 'LessThan';
+  readonly predicate: NamedNode;
+} | {
+  readonly _tag: 'LessThanOrEquals';
+  readonly predicate: NamedNode;
+} | {
+  readonly _tag: 'Not';
+  readonly shape: ShapeId;
+} | {
+  readonly _tag: 'And';
+  readonly shapes: ReadonlyArray<ShapeId>;
+} | {
+  readonly _tag: 'Or';
+  readonly shapes: ReadonlyArray<ShapeId>;
+} | {
+  readonly _tag: 'Xone';
+  readonly shapes: ReadonlyArray<ShapeId>;
+} | {
+  readonly _tag: 'Node';
+  readonly shape: ShapeId;
+} | {
+  readonly _tag: 'Property';
+  readonly shape: ShapeId;
+} | {
+  readonly _tag: 'QualifiedMinCount';
+  readonly shape: ShapeId;
+  readonly count: number;
+  readonly disjoint: boolean;
+  /** Sibling qualified value shapes (only used when `disjoint`). */
+  readonly siblings: ReadonlyArray<ShapeId>;
+} | {
+  readonly _tag: 'QualifiedMaxCount';
+  readonly shape: ShapeId;
+  readonly count: number;
+  readonly disjoint: boolean;
+  readonly siblings: ReadonlyArray<ShapeId>;
+} | {
+  readonly _tag: 'Closed';
+  readonly ignoredProperties: ReadonlyArray<NamedNode>;
+  /** Predicates allowed by `sh:property` predicate paths and `sh:ignoredProperties`. */
+  readonly allowedProperties: ReadonlyArray<NamedNode>;
+} | {
+  readonly _tag: 'HasValue';
+  readonly value: GroundTerm;
+} | {
+  readonly _tag: 'In';
+  readonly values: ReadonlyArray<GroundTerm>;
+} | SparqlConstraint | ComponentConstraint;
+/**
+ * A SHACL-SPARQL constraint (`sh:sparql`), evaluated by a
+ * `Sparql.SparqlConstraintEvaluator`.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface SparqlConstraint {
+  readonly _tag: 'Sparql';
+  /** The `sh:SPARQLConstraint` node in the shapes graph. */
+  readonly node: NamedNode | BlankNode;
+}
+/**
+ * An instance of a custom (SPARQL-based) constraint component declared in the
+ * shapes graph, evaluated by a `Sparql.SparqlConstraintEvaluator`.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ComponentConstraint {
+  readonly _tag: 'Component';
+  readonly component: NamedNode | BlankNode;
+  /** The parameter bindings of this constraint, keyed by parameter path. */
+  readonly parameters: ReadonlyArray<{
+    readonly path: NamedNode;
+    readonly value: GroundTerm;
+  }>;
+}
+/**
+ * The tags of all constraint kinds.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+type ConstraintTag = Constraint['_tag'];
+interface ShapeBase {
+  readonly id: ShapeId;
+  readonly targets: ReadonlyArray<Target>;
+  readonly constraints: ReadonlyArray<Constraint>;
+  /** `sh:severity`, defaulting to `sh:Violation`. */
+  readonly severity: NamedNode;
+  /** `sh:message` values. */
+  readonly messages: ReadonlyArray<Literal>;
+  /** `sh:deactivated true`. */
+  readonly deactivated: boolean;
+}
+/**
+ * A node shape (§2.2): its constraints apply to the focus node itself.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface NodeShape extends ShapeBase {
+  readonly _tag: 'NodeShape';
+}
+/**
+ * A property shape (§2.3): its constraints apply to the values reachable
+ * from the focus node via `path`.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface PropertyShape extends ShapeBase {
+  readonly _tag: 'PropertyShape';
+  readonly path: Path;
+}
+/**
+ * @since 0.1.0
+ * @category models
+ */
+type Shape = NodeShape | PropertyShape;
+/**
+ * A parsed shapes graph.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ShapesGraph {
+  readonly _tag: 'ShapesGraph';
+  /** The RDF shapes graph this model was parsed from. */
+  readonly dataset: Dataset;
+  /** Every shape of the shapes graph, in a deterministic order. */
+  readonly shapes: ReadonlyArray<Shape>;
+  /** Shapes indexed by the N-Triples form of their identifier. */
+  readonly index: ReadonlyMap<string, Shape>;
+}
+/**
+ * @since 0.1.0
+ * @category guards
+ */
+declare const isShapesGraph: (u: unknown) => u is ShapesGraph;
+/**
+ * Looks up a shape by its identifier.
+ *
+ * @since 0.1.0
+ * @category accessors
+ */
+declare const get: (self: ShapesGraph, id: Term) => Option.Option<Shape>;
+/**
+ * The shapes that declare at least one target and are not deactivated.
+ *
+ * @since 0.1.0
+ * @category accessors
+ */
+declare const targetedShapes: (self: ShapesGraph) => ReadonlyArray<Shape>;
+/**
+ * Whether the shapes graph uses SHACL-SPARQL features (SPARQL constraints,
+ * SPARQL-based constraint components or SPARQL-based targets).
+ *
+ * @since 0.1.0
+ * @category accessors
+ */
+declare const usesSparql: (self: ShapesGraph) => boolean;
+/**
+ * The constraint component IRI of a constraint (e.g.
+ * `sh:MinCountConstraintComponent`).
+ *
+ * @since 0.1.0
+ * @category accessors
+ */
+declare const componentOf: (constraint: Constraint) => NamedNode | BlankNode;
+/**
+ * Parses a shapes graph synchronously, returning a `Result`.
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parseResult: (dataset: Dataset) => Result.Result<ShapesGraph, ShapesGraphError>;
+/**
+ * Parses a shapes graph into a typed model. Fails with a `ShapesGraphError`
+ * when the shapes graph is ill-formed (e.g. malformed paths or lists,
+ * parameters with values of the wrong kind, or invalid regular expressions).
+ *
+ * @since 0.1.0
+ * @category parsing
+ */
+declare const parse: (dataset: Dataset) => Effect.Effect<ShapesGraph, ShapesGraphError>;
+export { parse as _, NodeShape as a, usesSparql as b, ShapeId as c, Shapes_d_exports as d, SparqlConstraint as f, isShapesGraph as g, get as h, NodeKind as i, ShapesGraph as l, componentOf as m, Constraint as n, PropertyShape as o, Target as p, ConstraintTag as r, Shape as s, ComponentConstraint as t, ShapesGraphError as u, parseResult as v, targetedShapes as y };
+//# sourceMappingURL=Shapes-BQFDFc4Q.d.mts.map

package/dist/Sparql-BiYFMSpl.mjs

@@ -0,0 +1,29 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import * as Schema from "effect/Schema";
+import * as Context from "effect/Context";
+// src/shacl/Sparql.ts
+var Sparql_exports = /* @__PURE__ */ __exportAll({
+	SparqlConstraintEvaluator: () => SparqlConstraintEvaluator,
+	SparqlEvaluationError: () => SparqlEvaluationError
+});
+/**
+* A failure while evaluating a SPARQL-based constraint or target.
+*
+* @since 0.1.0
+* @category errors
+*/
+var SparqlEvaluationError = class extends Schema.TaggedError()("SparqlEvaluationError", {
+	message: Schema.String,
+	cause: Schema.optional(Schema.Defect())
+}) {};
+/**
+* A service able to evaluate SHACL-SPARQL constraints and targets, provided
+* by a SPARQL engine integration.
+*
+* @since 0.1.0
+* @category services
+*/
+var SparqlConstraintEvaluator = class extends Context.Service()("@thomasfosterau/effect-rdf/shacl/Sparql/SparqlConstraintEvaluator") {};
+export { SparqlEvaluationError as n, Sparql_exports as r, SparqlConstraintEvaluator as t };
+
+//# sourceMappingURL=Sparql-BiYFMSpl.mjs.map

package/dist/Sparql-BiYFMSpl.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sparql-BiYFMSpl.mjs","names":[],"sources":["../src/shacl/Sparql.ts"],"sourcesContent":["/**\n * The extension point for SHACL-SPARQL (§5–§6 of the SHACL specification).\n *\n * The core validator does not execute SPARQL itself. When a shapes graph\n * contains SPARQL-based constraints (`sh:sparql`), SPARQL-based constraint\n * components or SPARQL-based targets (`sh:target`), the validator delegates\n * them to the `SparqlConstraintEvaluator` service if one is provided. When no\n * evaluator is available the validator either fails with an\n * `UnsupportedFeatureError` or ignores those constructs, depending on the\n * `sparql` validation option.\n *\n * A SPARQL engine integration implements this service:\n *\n * ```ts\n * import { Effect, Layer } from \"effect\"\n * import { Sparql } from \"@thomasfosterau/effect-rdf/shacl\"\n *\n * const EvaluatorLive = Layer.succeed(Sparql.SparqlConstraintEvaluator, {\n *   evaluateConstraint: (input) => Effect.succeed([]),\n *   selectTargets: (input) => Effect.succeed([]),\n * })\n * ```\n *\n * @since 0.1.0\n */\nimport type { Dataset, Term } from '../index.ts';\nimport * as Context from 'effect/Context';\nimport type * as Effect from 'effect/Effect';\nimport * as Schema from 'effect/Schema';\nimport type * as Path from './Path.ts';\nimport type * as Shapes from './Shapes.ts';\n\n/**\n * A failure while evaluating a SPARQL-based constraint or target.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class SparqlEvaluationError extends Schema.TaggedError<SparqlEvaluationError>()(\n  'SparqlEvaluationError',\n  {\n    message: Schema.String,\n    cause: Schema.optional(Schema.Defect()),\n  },\n) {}\n\n/**\n * The input to the evaluation of a SPARQL-based constraint for one focus\n * node.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface ConstraintInput {\n  /** The data graph (with the shapes graph merged in when requested). */\n  readonly dataGraph: Dataset.Dataset;\n  /** The parsed shapes graph; its `dataset` is the `$shapesGraph`. */\n  readonly shapesGraph: Shapes.ShapesGraph;\n  /** The shape (`$currentShape`) that holds the constraint. */\n  readonly shape: Shapes.Shape;\n  /** The SPARQL constraint or custom component instance. */\n  readonly constraint: Shapes.SparqlConstraint | Shapes.ComponentConstraint;\n  /** The focus node (`$this`). */\n  readonly focusNode: Term.GroundTerm;\n  /** The value nodes of the focus node for this shape. */\n  readonly valueNodes: ReadonlyArray<Term.GroundTerm>;\n}\n\n/**\n * One solution reported by a SPARQL-based constraint. Omitted fields take the\n * defaults defined by the SHACL-SPARQL specification: the focus node, the\n * shape's path, the shape's severity and messages.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Violation {\n  readonly focusNode?: Term.GroundTerm | undefined;\n  readonly value?: Term.GroundTerm | undefined;\n  readonly path?: Path.Path | undefined;\n  /**\n   * The result messages, possibly containing `{?var}` / `{$var}`\n   * placeholders, which the validator substitutes from `bindings`.\n   */\n  readonly messages?: ReadonlyArray<Term.Literal> | undefined;\n  readonly severity?: Term.NamedNode | undefined;\n  /**\n   * The variables available to message templates: the solution of the\n   * query and, for SPARQL-based constraint components, the parameter values\n   * by parameter name.\n   */\n  readonly bindings?: ReadonlyMap<string, Term.GroundTerm> | undefined;\n}\n\n/**\n * The input to the evaluation of a SPARQL-based or custom target.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface TargetInput {\n  readonly dataGraph: Dataset.Dataset;\n  readonly shapesGraph: Shapes.ShapesGraph;\n  readonly shape: Shapes.Shape;\n  /** The value of `sh:target`. */\n  readonly target: Term.GroundTerm;\n}\n\n/**\n * A service able to evaluate SHACL-SPARQL constraints and targets, provided\n * by a SPARQL engine integration.\n *\n * @since 0.1.0\n * @category services\n */\nexport class SparqlConstraintEvaluator extends Context.Service<\n  SparqlConstraintEvaluator,\n  {\n    /** Evaluates a SPARQL constraint for one focus node, returning its violations. */\n    readonly evaluateConstraint: (\n      input: ConstraintInput,\n    ) => Effect.Effect<ReadonlyArray<Violation>, SparqlEvaluationError>;\n    /** Computes the focus nodes of a SPARQL-based or custom target. */\n    readonly selectTargets: (\n      input: TargetInput,\n    ) => Effect.Effect<ReadonlyArray<Term.GroundTerm>, SparqlEvaluationError>;\n  }\n>()('@thomasfosterau/effect-rdf/shacl/Sparql/SparqlConstraintEvaluator') {}\n"],"mappings":";;;;;;;;;;;;;;AAsCA,IAAa,wBAAb,cAA2C,OAAO,YAAmC,CAAC,CACpF,yBACA;CACE,SAAS,OAAO;CAChB,OAAO,OAAO,SAAS,OAAO,OAAO,CAAC;AACxC,CACF,CAAC,CAAC,CAAC;;;;;;;;AAuEH,IAAa,4BAAb,cAA+C,QAAQ,QAYrD,CAAC,CAAC,mEAAmE,CAAC,CAAC,CAAC"}

package/dist/Sparql-DecpWTPh.d.mts

@@ -0,0 +1,97 @@
+import { d as NamedNode, l as Literal, s as GroundTerm } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+import "./index-Cms2TYfC.mjs";
+import { i as Path } from "./Path-DRB8e-Zn.mjs";
+import { f as SparqlConstraint, l as ShapesGraph, s as Shape, t as ComponentConstraint } from "./Shapes-BQFDFc4Q.mjs";
+import * as Schema from "effect/Schema";
+import * as Effect from "effect/Effect";
+import * as Context from "effect/Context";
+declare namespace Sparql_d_exports {
+  export { ConstraintInput, SparqlConstraintEvaluator, SparqlEvaluationError, TargetInput, Violation };
+}
+declare const SparqlEvaluationError_base: Schema.Class<SparqlEvaluationError, Schema.TaggedStruct<"SparqlEvaluationError", {
+  readonly message: Schema.String;
+  readonly cause: Schema.optional<Schema.Defect>;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A failure while evaluating a SPARQL-based constraint or target.
+ *
+ * @since 0.1.0
+ * @category errors
+ */
+declare class SparqlEvaluationError extends SparqlEvaluationError_base {}
+/**
+ * The input to the evaluation of a SPARQL-based constraint for one focus
+ * node.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface ConstraintInput {
+  /** The data graph (with the shapes graph merged in when requested). */
+  readonly dataGraph: Dataset;
+  /** The parsed shapes graph; its `dataset` is the `$shapesGraph`. */
+  readonly shapesGraph: ShapesGraph;
+  /** The shape (`$currentShape`) that holds the constraint. */
+  readonly shape: Shape;
+  /** The SPARQL constraint or custom component instance. */
+  readonly constraint: SparqlConstraint | ComponentConstraint;
+  /** The focus node (`$this`). */
+  readonly focusNode: GroundTerm;
+  /** The value nodes of the focus node for this shape. */
+  readonly valueNodes: ReadonlyArray<GroundTerm>;
+}
+/**
+ * One solution reported by a SPARQL-based constraint. Omitted fields take the
+ * defaults defined by the SHACL-SPARQL specification: the focus node, the
+ * shape's path, the shape's severity and messages.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface Violation {
+  readonly focusNode?: GroundTerm | undefined;
+  readonly value?: GroundTerm | undefined;
+  readonly path?: Path | undefined;
+  /**
+   * The result messages, possibly containing `{?var}` / `{$var}`
+   * placeholders, which the validator substitutes from `bindings`.
+   */
+  readonly messages?: ReadonlyArray<Literal> | undefined;
+  readonly severity?: NamedNode | undefined;
+  /**
+   * The variables available to message templates: the solution of the
+   * query and, for SPARQL-based constraint components, the parameter values
+   * by parameter name.
+   */
+  readonly bindings?: ReadonlyMap<string, GroundTerm> | undefined;
+}
+/**
+ * The input to the evaluation of a SPARQL-based or custom target.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+interface TargetInput {
+  readonly dataGraph: Dataset;
+  readonly shapesGraph: ShapesGraph;
+  readonly shape: Shape;
+  /** The value of `sh:target`. */
+  readonly target: GroundTerm;
+}
+declare const SparqlConstraintEvaluator_base: Context.ServiceClass<SparqlConstraintEvaluator, "@thomasfosterau/effect-rdf/shacl/Sparql/SparqlConstraintEvaluator", {
+  /** Evaluates a SPARQL constraint for one focus node, returning its violations. */
+  readonly evaluateConstraint: (input: ConstraintInput) => Effect.Effect<ReadonlyArray<Violation>, SparqlEvaluationError>;
+  /** Computes the focus nodes of a SPARQL-based or custom target. */
+  readonly selectTargets: (input: TargetInput) => Effect.Effect<ReadonlyArray<GroundTerm>, SparqlEvaluationError>;
+}>;
+/**
+ * A service able to evaluate SHACL-SPARQL constraints and targets, provided
+ * by a SPARQL engine integration.
+ *
+ * @since 0.1.0
+ * @category services
+ */
+declare class SparqlConstraintEvaluator extends SparqlConstraintEvaluator_base {}
+export { TargetInput as a, Sparql_d_exports as i, SparqlConstraintEvaluator as n, Violation as o, SparqlEvaluationError as r, ConstraintInput as t };
+//# sourceMappingURL=Sparql-DecpWTPh.d.mts.map