@faubulous/mentor-rdf 1.3.0 → 1.3.1

package/dist/index.js

@@ -3168,6 +3168,9 @@ var IndividualRepository = class extends PropertyRepository {
         if (p.object.equals(owl.NamedIndividual)) {
           continue;
         }
+        if (p.object.termType !== "NamedNode") {
+          continue;
+        }
         if (!yielded.has(p.object.value)) {
           yielded.add(p.object.value);
           yield p.object.value;
@@ -3892,260 +3895,562 @@ var OwlReasoner = class extends ShaclReasoner {
   }
 };
 
-// src/rdf/store.ts
-import * as n3 from "n3";
-
-// src/ontologies/src.ts
-var owl2 = `@prefix dc: <http://purl.org/dc/elements/1.1/> .
-@prefix grddl: <http://www.w3.org/2003/g/data-view#> .
-@prefix owl: <http://www.w3.org/2002/07/owl#> .
-@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
-@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
-@prefix xml: <http://www.w3.org/XML/1998/namespace> .
-@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
-
-<http://www.w3.org/2002/07/owl#> a owl:Ontology ;
-     dc:title "The OWL 2 Schema vocabulary (OWL 2)" ;
-     rdfs:comment """
-  This ontology partially describes the built-in classes and
-  properties that together form the basis of the RDF/XML syntax of OWL 2.
-  The content of this ontology is based on Tables 6.1 and 6.2
-  in Section 6.4 of the OWL 2 RDF-Based Semantics specification,
-  available at http://www.w3.org/TR/owl2-rdf-based-semantics/.
-  Please note that those tables do not include the different annotations
-  (labels, comments and rdfs:isDefinedBy links) used in this file.
-  Also note that the descriptions provided in this ontology do not
-  provide a complete and correct formal description of either the syntax
-  or the semantics of the introduced terms (please see the OWL 2
-  recommendations for the complete and normative specifications).
-  Furthermore, the information provided by this ontology may be
-  misleading if not used with care. This ontology SHOULD NOT be imported
-  into OWL ontologies. Importing this file into an OWL 2 DL ontology
-  will cause it to become an OWL 2 Full ontology and may have other,
-  unexpected, consequences.
-   """ ;
-     rdfs:isDefinedBy
-          <http://www.w3.org/TR/owl2-mapping-to-rdf/>,
-          <http://www.w3.org/TR/owl2-rdf-based-semantics/>,
-          <http://www.w3.org/TR/owl2-syntax/> ;
-     rdfs:seeAlso   <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-classes>,
-                    <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-properties> ;
-     owl:imports <http://www.w3.org/2000/01/rdf-schema> ;
-     owl:versionIRI <http://www.w3.org/2002/07/owl> ;
-     owl:versionInfo "$Date: 2009/11/15 10:54:12 $" ;
-     grddl:namespaceTransformation <http://dev.w3.org/cvsweb/2009/owl-grddl/owx2rdf.xsl> . 
-
-
-owl:AllDifferent a rdfs:Class ;
-     rdfs:label "AllDifferent" ;
-     rdfs:comment "The class of collections of pairwise different individuals." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:AllDisjointClasses a rdfs:Class ;
-     rdfs:label "AllDisjointClasses" ;
-     rdfs:comment "The class of collections of pairwise disjoint classes." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:AllDisjointProperties a rdfs:Class ;
-     rdfs:label "AllDisjointProperties" ;
-     rdfs:comment "The class of collections of pairwise disjoint properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:Annotation a rdfs:Class ;
-     rdfs:label "Annotation" ;
-     rdfs:comment "The class of annotated annotations for which the RDF serialization consists of an annotated subject, predicate and object." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:AnnotationProperty a rdfs:Class ;
-     rdfs:label "AnnotationProperty" ;
-     rdfs:comment "The class of annotation properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property .
-
-owl:AsymmetricProperty a rdfs:Class ;
-     rdfs:label "AsymmetricProperty" ;
-     rdfs:comment "The class of asymmetric properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:Axiom a rdfs:Class ;
-     rdfs:label "Axiom" ;
-     rdfs:comment "The class of annotated axioms for which the RDF serialization consists of an annotated subject, predicate and object." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:Class a rdfs:Class ;
-     rdfs:label "Class" ;
-     rdfs:comment "The class of OWL classes." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Class . 
-
-owl:DataRange a rdfs:Class ;
-     rdfs:label "DataRange" ;
-     rdfs:comment "The class of OWL data ranges, which are special kinds of datatypes. Note: The use of the IRI owl:DataRange has been deprecated as of OWL 2. The IRI rdfs:Datatype SHOULD be used instead." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Datatype . 
-
-owl:DatatypeProperty a rdfs:Class ;
-     rdfs:label "DatatypeProperty" ;
-     rdfs:comment "The class of data properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property . 
-
-owl:DeprecatedClass a rdfs:Class ;
-     rdfs:label "DeprecatedClass" ;
-     rdfs:comment "The class of deprecated classes." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Class . 
-
-owl:DeprecatedProperty a rdfs:Class ;
-     rdfs:label "DeprecatedProperty" ;
-     rdfs:comment "The class of deprecated properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property . 
-
-owl:FunctionalProperty a rdfs:Class ;
-     rdfs:label "FunctionalProperty" ;
-     rdfs:comment "The class of functional properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property . 
-
-owl:InverseFunctionalProperty a rdfs:Class ;
-     rdfs:label "InverseFunctionalProperty" ;
-     rdfs:comment "The class of inverse-functional properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:IrreflexiveProperty a rdfs:Class ;
-     rdfs:label "IrreflexiveProperty" ;
-     rdfs:comment "The class of irreflexive properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:NamedIndividual a rdfs:Class ;
-     rdfs:label "NamedIndividual" ;
-     rdfs:comment "The class of named individuals." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:Thing . 
-
-owl:NegativePropertyAssertion a rdfs:Class ;
-     rdfs:label "NegativePropertyAssertion" ;
-     rdfs:comment "The class of negative property assertions." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:Nothing a owl:Class ;
-     rdfs:label "Nothing" ;
-     rdfs:comment "This is the empty class." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:Thing . 
-
-owl:ObjectProperty a rdfs:Class ;
-     rdfs:label "ObjectProperty" ;
-     rdfs:comment "The class of object properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property . 
-
-owl:Ontology a rdfs:Class ;
-     rdfs:label "Ontology" ;
-     rdfs:comment "The class of ontologies." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdfs:Resource . 
-
-owl:OntologyProperty a rdfs:Class ;
-     rdfs:label "OntologyProperty" ;
-     rdfs:comment "The class of ontology properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf rdf:Property . 
-
-owl:ReflexiveProperty a rdfs:Class ;
-     rdfs:label "ReflexiveProperty" ;
-     rdfs:comment "The class of reflexive properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:Restriction a rdfs:Class ;
-     rdfs:label "Restriction" ;
-     rdfs:comment "The class of property restrictions." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:Class . 
-
-owl:SymmetricProperty a rdfs:Class ;
-     rdfs:label "SymmetricProperty" ;
-     rdfs:comment "The class of symmetric properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:TransitiveProperty a rdfs:Class ;
-     rdfs:label "TransitiveProperty" ;
-     rdfs:comment "The class of transitive properties." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:subClassOf owl:ObjectProperty . 
-
-owl:Thing a owl:Class ;
-     rdfs:label "Thing" ;
-     rdfs:comment "The class of OWL individuals." ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> .
-     
-owl:allValuesFrom a rdf:Property ;
-     rdfs:label "allValuesFrom" ;
-     rdfs:comment "The property that determines the class that a universal property restriction refers to." ;
-     rdfs:domain owl:Restriction ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdfs:Class . 
-
-owl:annotatedProperty a rdf:Property ;
-     rdfs:label "annotatedProperty" ;
-     rdfs:comment "The property that determines the predicate of an annotated axiom or annotated annotation." ;
-     rdfs:domain rdfs:Resource ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdfs:Resource . 
-
-owl:annotatedSource a rdf:Property ;
-     rdfs:label "annotatedSource" ;
-     rdfs:comment "The property that determines the subject of an annotated axiom or annotated annotation." ;
-     rdfs:domain rdfs:Resource ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdfs:Resource . 
-
-owl:annotatedTarget a rdf:Property ;
-     rdfs:label "annotatedTarget" ;
-     rdfs:comment "The property that determines the object of an annotated axiom or annotated annotation." ;
-     rdfs:domain rdfs:Resource ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdfs:Resource . 
-
-owl:assertionProperty a rdf:Property ;
-     rdfs:label "assertionProperty" ;
-     rdfs:comment "The property that determines the predicate of a negative property assertion." ;
-     rdfs:domain owl:NegativePropertyAssertion ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdf:Property . 
-
-owl:backwardCompatibleWith a owl:AnnotationProperty, owl:OntologyProperty ;
-     rdfs:label "backwardCompatibleWith" ;
-     rdfs:comment "The annotation property that indicates that a given ontology is backward compatible with another ontology." ;
-     rdfs:domain owl:Ontology ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range owl:Ontology . 
-
-owl:bottomDataProperty a owl:DatatypeProperty ;
-     rdfs:label "bottomDataProperty" ;
-     rdfs:comment "The data property that does not relate any individual to any data value." ;
-     rdfs:domain owl:Thing ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range rdfs:Literal . 
-
-owl:bottomObjectProperty a owl:ObjectProperty ;
-     rdfs:label "bottomObjectProperty" ;
-     rdfs:comment "The object property that does not relate any two individuals." ;
-     rdfs:domain owl:Thing ;
-     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
-     rdfs:range owl:Thing . 
+// src/rdf/shape-repository.ts
+var { namedNode: namedNode6 } = dataFactory;
+var ShapeRepository = class extends IndividualRepository {
+  constructor(store) {
+    super(store);
+  }
+  /**
+   * Get all shapes in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns An iterable of all shapes in the repository.
+   */
+  *getShapes(graphUris, subjectUri, options) {
+    const yielded = /* @__PURE__ */ new Set();
+    if (!subjectUri) {
+      for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.Shape, options?.includeInferred)) {
+        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
+          yielded.add(q.subject.value);
+          yield q.subject.value;
+        }
+      }
+    } else {
+      const s = namedNode6(subjectUri);
+      for (let q of this.store.matchAll(graphUris, s, rdf.type, sh.Shape, options?.includeInferred)) {
+        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
+          yielded.add(q.subject.value);
+          yield q.subject.value;
+        }
+      }
+      for (let q of this.store.matchAll(graphUris, null, sh.targetClass, s, options?.includeInferred)) {
+        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
+          yielded.add(q.subject.value);
+          yield q.subject.value;
+        }
+      }
+      for (let q of this.store.matchAll(graphUris, null, sh.path, s, options?.includeInferred)) {
+        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
+          yielded.add(q.subject.value);
+          yield q.subject.value;
+        }
+      }
+    }
+  }
+  /**
+   * Get all shape types in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns A list of all shape types in the repository.
+   */
+  *getShapeTypes(graphUris, options) {
+    for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.NodeShape)) {
+      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
+        yield SH.NodeShape;
+        break;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.PropertyShape)) {
+      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
+        yield SH.PropertyShape;
+        break;
+      }
+    }
+  }
+  /**
+   * Get all validator types in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns An iterable of all shape types in the repository.
+   */
+  *getValidatorTypes(graphUris, options) {
+    if (this.store.any(graphUris, null, rdf.type, sh.Validator, options?.includeInferred)) {
+      yield SH.Validator;
+    }
+    if (this.store.any(graphUris, null, rdf.type, sh.JSValidator, false)) {
+      yield SH.JSValidator;
+    }
+    if (this.store.any(graphUris, null, rdf.type, sh.SPARQLAskValidator, false)) {
+      yield SH.SPARQLAskValidator;
+    }
+    if (this.store.any(graphUris, null, rdf.type, sh.SPARQLSelectValidator, false)) {
+      yield SH.SPARQLSelectValidator;
+    }
+  }
+  /**
+   * Get all target classes, nodes or properties of a given shape in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param shape The URI or blank id of the shape.
+   * @param options Optional query parameters.
+   * @returns An iterable of all targeted resources in the repository.
+   */
+  *getShapeTargets(graphUris, shape, options) {
+    const yielded = /* @__PURE__ */ new Set();
+    for (let q of this.store.matchAll(graphUris, shape, rdf.type, rdfs.Class, true)) {
+      if (!yielded.has(q.subject.value)) {
+        yielded.add(q.subject.value);
+        yield q.subject.value;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, shape, sh.targetClass, null, options?.includeInferred)) {
+      if (!yielded.has(q.object.value)) {
+        yielded.add(q.object.value);
+        yield q.object.value;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, shape, sh.targetNode, null, options?.includeInferred)) {
+      if (!yielded.has(q.object.value)) {
+        yielded.add(q.object.value);
+        yield q.object.value;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, shape, sh.path, null, options?.includeInferred)) {
+      if (!yielded.has(q.object.value)) {
+        yielded.add(q.object.value);
+        yield q.object.value;
+      }
+    }
+  }
+  /**
+   * Indicate if there are shapes for a subject in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param subjectUri The URI of the subject.
+   * @param options Optional query parameters.
+   * @returns `true` if there are shapes for the subject, `false` otherwise.
+   */
+  hasShapes(graphUris, subjectUri, options) {
+    const s = namedNode6(subjectUri);
+    for (let q of this.store.matchAll(graphUris, s, rdf.type, sh.Shape)) {
+      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
+        return true;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, null, sh.targetClass, s)) {
+      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
+        return true;
+      }
+    }
+    for (let q of this.store.matchAll(graphUris, null, sh.path, s)) {
+      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
+        return true;
+      }
+    }
+    return false;
+  }
+  /**
+   * Indicate if there validators defined in the vocabulary.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns A list of all validators in the repository.
+   */
+  hasValidators(graphUris, options) {
+    return this.hasSubjectsOfType(graphUris, SH.Validator, options);
+  }
+  /**
+   * Get all validators in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns A list of all validators in the repository.
+   */
+  *getValidators(graphUris, options) {
+    yield* this.getSubjectsOfType(graphUris, SH.Validator, options);
+  }
+  /**
+   * Indicate if there are rules in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param subjectUri The URI of the subject.
+   * @param options Optional query parameters.
+   * @returns `true` if there are rules for the subject, `false` otherwise.
+   */
+  hasRules(graphUris, options) {
+    return this.hasSubjectsOfType(graphUris, SH.Rule, options);
+  }
+  /**
+   * Get all rules in the repository.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param options Optional query parameters.
+   * @returns A list of all rules in the repository.
+   */
+  *getRules(graphUris, options) {
+    yield* this.getSubjectsOfType(graphUris, SH.Rule, options);
+  }
+  /**
+   * Get the SHACL datatype of a given property.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param subjectUri The URI of the subject.
+   * @param options Optional query parameters.
+   * @returns A datatype URI on success, `xsd:anyURI` otherwise.
+   */
+  getDatatype(graphUris, subjectUri, options) {
+    for (let q of this.store.matchAll(graphUris, null, sh.path, namedNode6(subjectUri), options?.includeInferred)) {
+      for (let x of this.store.matchAll(graphUris, q.subject, sh.datatype, null, options?.includeInferred)) {
+        return x.object.value;
+      }
+    }
+  }
+  /**
+   * Get the SHACL cardinality constraints of a given property.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param subjectUri The URI of the subject.
+   * @param options Optional query parameters.
+   * @returns An object with the minimum and maximum cardinalities; values are `-1` if not found.
+   */
+  getCardinalites(graphUris, subjectUri, options) {
+    let minCount = -1;
+    let maxCount = -1;
+    for (let q of this.store.matchAll(graphUris, null, sh.path, namedNode6(subjectUri), options?.includeInferred)) {
+      for (let x of this.store.matchAll(graphUris, q.subject, sh.minCount, null, options?.includeInferred)) {
+        minCount = parseInt(x.object.value);
+        break;
+      }
+      for (let x of this.store.matchAll(graphUris, q.subject, sh.maxCount, null, options?.includeInferred)) {
+        maxCount = parseInt(x.object.value);
+        break;
+      }
+    }
+    return { minCount, maxCount };
+  }
+  /**
+   * Get the RDF property path representation of the given SHACL property path. This method parses the SHACL property path and 
+   * returns the RDF property path as a combination of nodes and strings.
+   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+   * @param subject The URI or blank id of the node referred to by sh:path.
+   * @param options Optional query parameters.
+   * @returns A flattened list of all path components, either as URIs or as strings.
+   */
+  getPropertyPathTokens(graphUris, subject) {
+    const visitedNodes = /* @__PURE__ */ new Set();
+    const parse = (subject2, level, separator = "/", i = 0) => {
+      if (visitedNodes.has(subject2.value)) {
+        return [];
+      }
+      visitedNodes.add(subject2.value);
+      if (subject2.termType === "NamedNode") {
+        return [subject2];
+      } else {
+        const first = this.store.matchAll(graphUris, subject2, rdf.first, null, false).next().value;
+        if (first) {
+          const path = parse(first.object, level + 1);
+          const rest = this.store.matchAll(graphUris, subject2, rdf.rest, null, false).next().value;
+          if (rest && rest.object.value !== rdf.nil.value) {
+            const tail = parse(rest.object, level, separator, i + 1);
+            if (tail.length === 0) {
+              return path;
+            }
+            if (i === 0 && level > 0) {
+              return ["(", ...path, separator, ...tail, ")"];
+            } else {
+              return [...path, separator, ...tail];
+            }
+          }
+          return path;
+        } else {
+          for (let q of this.store.matchAll(graphUris, subject2, null, null, false)) {
+            switch (q.predicate.value) {
+              case sh.inversePath.value: {
+                return ["^", ...parse(q.object, level)];
+              }
+              case sh.zeroOrOnePath.value: {
+                return [...parse(q.object, level), "?"];
+              }
+              case sh.zeroOrMorePath.value: {
+                return [...parse(q.object, level), "*"];
+              }
+              case sh.oneOrMorePath.value: {
+                return [...parse(q.object, level), "+"];
+              }
+              case sh.alternativePath.value: {
+                return parse(q.object, level, "|");
+              }
+              default:
+                throw new Error(`Unsupported path predicate: ${q.predicate.value}`);
+            }
+          }
+          throw new Error(`Unsupported path subject: ${subject2}`);
+        }
+      }
+    };
+    return parse(subject, 0);
+  }
+  /**
+   * Get the first discovered path from a given shape class to the sh:Shape root.
+   * @param graphUris URIs of the graphs to search (should include the SHACL ontology graph).
+   * @param subjectUri URI of a shape class.
+   * @param options Optional query parameters.
+   * @returns An iterator containing the path from the given class up to sh:Shape.
+   */
+  *getRootShapePath(graphUris, subjectUri, options) {
+    yield* this._getRootShapePath(graphUris, subjectUri, [], /* @__PURE__ */ new Set(), options);
+  }
+  _getRootShapePath(graphUris, subjectUri, path, backtrack, options) {
+    for (let o of this.getSuperClasses(graphUris, subjectUri, options)) {
+      if (o === SH.Shape) {
+        return path;
+      }
+      if (!backtrack.has(o)) {
+        backtrack.add(o);
+        return this._getRootShapePath(graphUris, o, [...path, o], backtrack, options);
+      }
+    }
+    return path;
+  }
+};
+
+// src/rdf/store.ts
+import * as n3 from "n3";
+
+// src/ontologies/src.ts
+var owl2 = `@prefix dc: <http://purl.org/dc/elements/1.1/> .
+@prefix grddl: <http://www.w3.org/2003/g/data-view#> .
+@prefix owl: <http://www.w3.org/2002/07/owl#> .
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
+@prefix xml: <http://www.w3.org/XML/1998/namespace> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+
+<http://www.w3.org/2002/07/owl#> a owl:Ontology ;
+     dc:title "The OWL 2 Schema vocabulary (OWL 2)" ;
+     rdfs:comment """
+  This ontology partially describes the built-in classes and
+  properties that together form the basis of the RDF/XML syntax of OWL 2.
+  The content of this ontology is based on Tables 6.1 and 6.2
+  in Section 6.4 of the OWL 2 RDF-Based Semantics specification,
+  available at http://www.w3.org/TR/owl2-rdf-based-semantics/.
+  Please note that those tables do not include the different annotations
+  (labels, comments and rdfs:isDefinedBy links) used in this file.
+  Also note that the descriptions provided in this ontology do not
+  provide a complete and correct formal description of either the syntax
+  or the semantics of the introduced terms (please see the OWL 2
+  recommendations for the complete and normative specifications).
+  Furthermore, the information provided by this ontology may be
+  misleading if not used with care. This ontology SHOULD NOT be imported
+  into OWL ontologies. Importing this file into an OWL 2 DL ontology
+  will cause it to become an OWL 2 Full ontology and may have other,
+  unexpected, consequences.
+   """ ;
+     rdfs:isDefinedBy
+          <http://www.w3.org/TR/owl2-mapping-to-rdf/>,
+          <http://www.w3.org/TR/owl2-rdf-based-semantics/>,
+          <http://www.w3.org/TR/owl2-syntax/> ;
+     rdfs:seeAlso   <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-classes>,
+                    <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-properties> ;
+     owl:imports <http://www.w3.org/2000/01/rdf-schema> ;
+     owl:versionIRI <http://www.w3.org/2002/07/owl> ;
+     owl:versionInfo "$Date: 2009/11/15 10:54:12 $" ;
+     grddl:namespaceTransformation <http://dev.w3.org/cvsweb/2009/owl-grddl/owx2rdf.xsl> . 
+
+
+owl:AllDifferent a rdfs:Class ;
+     rdfs:label "AllDifferent" ;
+     rdfs:comment "The class of collections of pairwise different individuals." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:AllDisjointClasses a rdfs:Class ;
+     rdfs:label "AllDisjointClasses" ;
+     rdfs:comment "The class of collections of pairwise disjoint classes." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:AllDisjointProperties a rdfs:Class ;
+     rdfs:label "AllDisjointProperties" ;
+     rdfs:comment "The class of collections of pairwise disjoint properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:Annotation a rdfs:Class ;
+     rdfs:label "Annotation" ;
+     rdfs:comment "The class of annotated annotations for which the RDF serialization consists of an annotated subject, predicate and object." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:AnnotationProperty a rdfs:Class ;
+     rdfs:label "AnnotationProperty" ;
+     rdfs:comment "The class of annotation properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property .
+
+owl:AsymmetricProperty a rdfs:Class ;
+     rdfs:label "AsymmetricProperty" ;
+     rdfs:comment "The class of asymmetric properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:Axiom a rdfs:Class ;
+     rdfs:label "Axiom" ;
+     rdfs:comment "The class of annotated axioms for which the RDF serialization consists of an annotated subject, predicate and object." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:Class a rdfs:Class ;
+     rdfs:label "Class" ;
+     rdfs:comment "The class of OWL classes." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Class . 
+
+owl:DataRange a rdfs:Class ;
+     rdfs:label "DataRange" ;
+     rdfs:comment "The class of OWL data ranges, which are special kinds of datatypes. Note: The use of the IRI owl:DataRange has been deprecated as of OWL 2. The IRI rdfs:Datatype SHOULD be used instead." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Datatype . 
+
+owl:DatatypeProperty a rdfs:Class ;
+     rdfs:label "DatatypeProperty" ;
+     rdfs:comment "The class of data properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property . 
+
+owl:DeprecatedClass a rdfs:Class ;
+     rdfs:label "DeprecatedClass" ;
+     rdfs:comment "The class of deprecated classes." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Class . 
+
+owl:DeprecatedProperty a rdfs:Class ;
+     rdfs:label "DeprecatedProperty" ;
+     rdfs:comment "The class of deprecated properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property . 
+
+owl:FunctionalProperty a rdfs:Class ;
+     rdfs:label "FunctionalProperty" ;
+     rdfs:comment "The class of functional properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property . 
+
+owl:InverseFunctionalProperty a rdfs:Class ;
+     rdfs:label "InverseFunctionalProperty" ;
+     rdfs:comment "The class of inverse-functional properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:IrreflexiveProperty a rdfs:Class ;
+     rdfs:label "IrreflexiveProperty" ;
+     rdfs:comment "The class of irreflexive properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:NamedIndividual a rdfs:Class ;
+     rdfs:label "NamedIndividual" ;
+     rdfs:comment "The class of named individuals." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:Thing . 
+
+owl:NegativePropertyAssertion a rdfs:Class ;
+     rdfs:label "NegativePropertyAssertion" ;
+     rdfs:comment "The class of negative property assertions." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:Nothing a owl:Class ;
+     rdfs:label "Nothing" ;
+     rdfs:comment "This is the empty class." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:Thing . 
+
+owl:ObjectProperty a rdfs:Class ;
+     rdfs:label "ObjectProperty" ;
+     rdfs:comment "The class of object properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property . 
+
+owl:Ontology a rdfs:Class ;
+     rdfs:label "Ontology" ;
+     rdfs:comment "The class of ontologies." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdfs:Resource . 
+
+owl:OntologyProperty a rdfs:Class ;
+     rdfs:label "OntologyProperty" ;
+     rdfs:comment "The class of ontology properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf rdf:Property . 
+
+owl:ReflexiveProperty a rdfs:Class ;
+     rdfs:label "ReflexiveProperty" ;
+     rdfs:comment "The class of reflexive properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:Restriction a rdfs:Class ;
+     rdfs:label "Restriction" ;
+     rdfs:comment "The class of property restrictions." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:Class . 
+
+owl:SymmetricProperty a rdfs:Class ;
+     rdfs:label "SymmetricProperty" ;
+     rdfs:comment "The class of symmetric properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:TransitiveProperty a rdfs:Class ;
+     rdfs:label "TransitiveProperty" ;
+     rdfs:comment "The class of transitive properties." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:subClassOf owl:ObjectProperty . 
+
+owl:Thing a owl:Class ;
+     rdfs:label "Thing" ;
+     rdfs:comment "The class of OWL individuals." ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> .
+     
+owl:allValuesFrom a rdf:Property ;
+     rdfs:label "allValuesFrom" ;
+     rdfs:comment "The property that determines the class that a universal property restriction refers to." ;
+     rdfs:domain owl:Restriction ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdfs:Class . 
+
+owl:annotatedProperty a rdf:Property ;
+     rdfs:label "annotatedProperty" ;
+     rdfs:comment "The property that determines the predicate of an annotated axiom or annotated annotation." ;
+     rdfs:domain rdfs:Resource ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdfs:Resource . 
+
+owl:annotatedSource a rdf:Property ;
+     rdfs:label "annotatedSource" ;
+     rdfs:comment "The property that determines the subject of an annotated axiom or annotated annotation." ;
+     rdfs:domain rdfs:Resource ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdfs:Resource . 
+
+owl:annotatedTarget a rdf:Property ;
+     rdfs:label "annotatedTarget" ;
+     rdfs:comment "The property that determines the object of an annotated axiom or annotated annotation." ;
+     rdfs:domain rdfs:Resource ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdfs:Resource . 
+
+owl:assertionProperty a rdf:Property ;
+     rdfs:label "assertionProperty" ;
+     rdfs:comment "The property that determines the predicate of a negative property assertion." ;
+     rdfs:domain owl:NegativePropertyAssertion ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdf:Property . 
+
+owl:backwardCompatibleWith a owl:AnnotationProperty, owl:OntologyProperty ;
+     rdfs:label "backwardCompatibleWith" ;
+     rdfs:comment "The annotation property that indicates that a given ontology is backward compatible with another ontology." ;
+     rdfs:domain owl:Ontology ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range owl:Ontology . 
+
+owl:bottomDataProperty a owl:DatatypeProperty ;
+     rdfs:label "bottomDataProperty" ;
+     rdfs:comment "The data property that does not relate any individual to any data value." ;
+     rdfs:domain owl:Thing ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range rdfs:Literal . 
+
+owl:bottomObjectProperty a owl:ObjectProperty ;
+     rdfs:label "bottomObjectProperty" ;
+     rdfs:comment "The object property that does not relate any two individuals." ;
+     rdfs:domain owl:Thing ;
+     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;
+     rdfs:range owl:Thing . 
 
 owl:cardinality a rdf:Property ;
      rdfs:label "cardinality" ;
@@ -7074,444 +7379,155 @@ var Store = class {
     });
   }
   /**
-   * Indicates if the store contains triples in a given graph.
-   * @param graphUri A graph URI.
-   * @returns `true` if the store contains triples in the graph URI, `false` otherwise.
-   */
-  hasGraph(graphUri) {
-    const uri = typeof graphUri === "string" ? this.dataFactory.namedNode(graphUri) : graphUri;
-    for (const _ of this._ds.match(null, null, null, uri)) {
-      return true;
-    }
-    return false;
-  }
-  /**
-   * Apply inference to the given graph and store the triples in the associated inference graph.
-   * @param graphUri A graph URI.
-   */
-  executeInference(graphUri) {
-    if (this.reasoner) {
-      this.reasoner.expand(this._ds, graphUri);
-    }
-  }
-  /**
-   * Delete named graphs from the store.
-   * @param graphUris URIs of the graphs to be deleted.
-   */
-  deleteGraphs(graphUris) {
-    for (const graphUri of graphUris) {
-      const graph2 = this.dataFactory.namedNode(graphUri);
-      for (const quad5 of this._ds.match(null, null, null, graph2)) {
-        this._ds.delete(quad5);
-      }
-    }
-  }
-  /**
-   * Get the URIs of ordered list members in the store.
-   * @param graphUris Optional graph URI or array of graph URIs to query.
-   * @param listUri URI of the list to get the items from.
-   * @returns An array of URIs of the items in the list.
-   */
-  getListItems(graphUris, listUri) {
-    const list = listUri.includes(":") ? this.dataFactory.namedNode(listUri) : this.dataFactory.blankNode(listUri);
-    return this._getListItems(graphUris, list).map((t) => t.value);
-  }
-  _getListItems(graphUris, subject) {
-    const first = Array.from(this.matchAll(graphUris, subject, rdf.first, null));
-    if (!first.length) {
-      return [];
-    }
-    const rest = Array.from(this.matchAll(graphUris, subject, rdf.rest, null));
-    const firstItem = first[0].object;
-    const restList = rest[0]?.object;
-    if (restList.value === RDF.nil) {
-      return [firstItem];
-    } else {
-      const restItems = this._getListItems(graphUris, restList);
-      return [firstItem, ...restItems];
-    }
-  }
-  /**
-   * Returns the exact cardinality of the quads matching the pattern.
-   * @param subject The optional subject.
-   * @param predicate The optional predicate.
-   * @param object The optional object.
-   * @param graph The optional graph.
-   */
-  countQuads(subject, predicate, object, graph2) {
-    return this._store.countQuads(subject, predicate, object, graph2);
-  }
-  /**
-   * Returns a stream of quads matching the given pattern.
-   * @param subject The optional subject.
-   * @param predicate The optional predicate.
-   * @param object The optional object.
-   * @param graph The optional graph.
-   * @returns A stream of matching quads.
-   */
-  match(subject, predicate, object, graph2) {
-    return this._store.match(subject, predicate, object, graph2);
-  }
-  /**
-   * Query the store for triples matching the given pattern supporting multiple graphs.
-   * @param graphUris Optional graph URI or array of graph URIs to query.
-   * @param subject A subject URI or null to match any subject.
-   * @param predicate A predicate URI or null to match any predicate.
-   * @param object An object URI or null to match any object.
-   */
-  *matchAll(graphUris, subject, predicate, object, includeInferred) {
-    if (includeInferred && !this.reasoner) {
-      throw new Error("Reasoner is not available to include inferred triples.");
-    }
-    const s = subject;
-    const p = predicate;
-    const o = object;
-    if (graphUris !== void 0) {
-      const graphs = Array.isArray(graphUris) ? graphUris : [graphUris];
-      for (const graph2 of graphs.map((g) => this.dataFactory.namedNode(g))) {
-        for (const q of this._ds.match(s, p, o, graph2)) {
-          yield q;
-        }
-        if (includeInferred !== false && this.reasoner) {
-          const inferenceGraphUri = this.reasoner.targetUriGenerator.getGraphUri(graph2.value);
-          const inferenceGraph = this.dataFactory.namedNode(inferenceGraphUri);
-          for (let q of this._ds.match(s, p, o, inferenceGraph)) {
-            yield q;
-          }
-        }
-      }
-    } else {
-      yield* this._ds.match(s, p, o);
-    }
-  }
-  /**
-   * Indicate if there are triples matching the given pattern in the store.
-   * @param graphUris Optional graph URI or array of graph URIs to query.
-   * @param subject A subject URI or null to match any subject.
-   * @param predicate A predicate URI or null to match any predicate.
-   * @param object An object URI or null to match any object.
-   * @returns `true` if there are triples matching the pattern, `false` otherwise.
-   */
-  any(graphUris, subject, predicate, object, includeInferred) {
-    return this.matchAll(graphUris, subject, predicate, object, includeInferred).next().done === false;
-  }
-  /**
-   * Get the first triple matching the given pattern in the store.
-   * @param graphUris Optional graph URI or array of graph URIs to query.
-   * @param subject A subject URI or null to match any subject.
-   * @param predicate A predicate URI or null to match any predicate.
-   * @param object An object URI or null to match any object.
-   * @returns The first triple that matches the pattern.
-   * @throws {TripleNotFoundError} If no triple is found matching the pattern.
-   */
-  first(graphUris, subject, predicate, object, includeInferred) {
-    const result = this.matchAll(graphUris, subject, predicate, object, includeInferred).next().value;
-    if (!result) {
-      throw new TripleNotFoundError(subject, predicate, object);
-    }
-    return result;
-  }
-};
-
-// src/rdf/shape-repository.ts
-var { namedNode: namedNode7 } = dataFactory;
-var ShapeRepository = class extends IndividualRepository {
-  constructor(store) {
-    super(store);
-  }
-  /**
-   * Get all shapes in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns An iterable of all shapes in the repository.
-   */
-  *getShapes(graphUris, subjectUri, options) {
-    const yielded = /* @__PURE__ */ new Set();
-    if (!subjectUri) {
-      for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.Shape, options?.includeInferred)) {
-        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
-          yielded.add(q.subject.value);
-          yield q.subject.value;
-        }
-      }
-    } else {
-      const s = namedNode7(subjectUri);
-      for (let q of this.store.matchAll(graphUris, s, rdf.type, sh.Shape, options?.includeInferred)) {
-        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
-          yielded.add(q.subject.value);
-          yield q.subject.value;
-        }
-      }
-      for (let q of this.store.matchAll(graphUris, null, sh.targetClass, s, options?.includeInferred)) {
-        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
-          yielded.add(q.subject.value);
-          yield q.subject.value;
-        }
-      }
-      for (let q of this.store.matchAll(graphUris, null, sh.path, s, options?.includeInferred)) {
-        if (!yielded.has(q.subject.value) && !this.skip(graphUris, q.subject, options)) {
-          yielded.add(q.subject.value);
-          yield q.subject.value;
-        }
-      }
-    }
-  }
-  /**
-   * Get all shape types in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns A list of all shape types in the repository.
-   */
-  *getShapeTypes(graphUris, options) {
-    for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.NodeShape)) {
-      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
-        yield SH.NodeShape;
-        break;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, null, rdf.type, sh.PropertyShape)) {
-      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
-        yield SH.PropertyShape;
-        break;
-      }
-    }
-  }
-  /**
-   * Get all validator types in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns An iterable of all shape types in the repository.
-   */
-  *getValidatorTypes(graphUris, options) {
-    if (this.store.any(graphUris, null, rdf.type, sh.Validator, options?.includeInferred)) {
-      yield SH.Validator;
-    }
-    if (this.store.any(graphUris, null, rdf.type, sh.JSValidator, false)) {
-      yield SH.JSValidator;
-    }
-    if (this.store.any(graphUris, null, rdf.type, sh.SPARQLAskValidator, false)) {
-      yield SH.SPARQLAskValidator;
-    }
-    if (this.store.any(graphUris, null, rdf.type, sh.SPARQLSelectValidator, false)) {
-      yield SH.SPARQLSelectValidator;
-    }
-  }
-  /**
-   * Get all target classes, nodes or properties of a given shape in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param shape The URI or blank id of the shape.
-   * @param options Optional query parameters.
-   * @returns An iterable of all targeted resources in the repository.
-   */
-  *getShapeTargets(graphUris, shape, options) {
-    const yielded = /* @__PURE__ */ new Set();
-    for (let q of this.store.matchAll(graphUris, shape, rdf.type, rdfs.Class, true)) {
-      if (!yielded.has(q.subject.value)) {
-        yielded.add(q.subject.value);
-        yield q.subject.value;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, shape, sh.targetClass, null, options?.includeInferred)) {
-      if (!yielded.has(q.object.value)) {
-        yielded.add(q.object.value);
-        yield q.object.value;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, shape, sh.targetNode, null, options?.includeInferred)) {
-      if (!yielded.has(q.object.value)) {
-        yielded.add(q.object.value);
-        yield q.object.value;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, shape, sh.path, null, options?.includeInferred)) {
-      if (!yielded.has(q.object.value)) {
-        yielded.add(q.object.value);
-        yield q.object.value;
-      }
-    }
-  }
-  /**
-   * Indicate if there are shapes for a subject in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param subjectUri The URI of the subject.
-   * @param options Optional query parameters.
-   * @returns `true` if there are shapes for the subject, `false` otherwise.
+   * Indicates if the store contains triples in a given graph.
+   * @param graphUri A graph URI.
+   * @returns `true` if the store contains triples in the graph URI, `false` otherwise.
    */
-  hasShapes(graphUris, subjectUri, options) {
-    const s = namedNode7(subjectUri);
-    for (let q of this.store.matchAll(graphUris, s, rdf.type, sh.Shape)) {
-      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
-        return true;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, null, sh.targetClass, s)) {
-      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
-        return true;
-      }
-    }
-    for (let q of this.store.matchAll(graphUris, null, sh.path, s)) {
-      if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {
-        return true;
-      }
+  hasGraph(graphUri) {
+    const uri = typeof graphUri === "string" ? this.dataFactory.namedNode(graphUri) : graphUri;
+    for (const _ of this._ds.match(null, null, null, uri)) {
+      return true;
     }
     return false;
   }
   /**
-   * Indicate if there validators defined in the vocabulary.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns A list of all validators in the repository.
+   * Apply inference to the given graph and store the triples in the associated inference graph.
+   * @param graphUri A graph URI.
    */
-  hasValidators(graphUris, options) {
-    return this.hasSubjectsOfType(graphUris, SH.Validator, options);
+  executeInference(graphUri) {
+    if (this.reasoner) {
+      this.reasoner.expand(this._ds, graphUri);
+    }
   }
   /**
-   * Get all validators in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns A list of all validators in the repository.
+   * Delete named graphs from the store.
+   * @param graphUris URIs of the graphs to be deleted.
    */
-  *getValidators(graphUris, options) {
-    yield* this.getSubjectsOfType(graphUris, SH.Validator, options);
+  deleteGraphs(graphUris) {
+    for (const graphUri of graphUris) {
+      const graph2 = this.dataFactory.namedNode(graphUri);
+      for (const quad5 of this._ds.match(null, null, null, graph2)) {
+        this._ds.delete(quad5);
+      }
+    }
   }
   /**
-   * Indicate if there are rules in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param subjectUri The URI of the subject.
-   * @param options Optional query parameters.
-   * @returns `true` if there are rules for the subject, `false` otherwise.
+   * Get the URIs of ordered list members in the store.
+   * @param graphUris Optional graph URI or array of graph URIs to query.
+   * @param listUri URI of the list to get the items from.
+   * @returns An array of URIs of the items in the list.
    */
-  hasRules(graphUris, options) {
-    return this.hasSubjectsOfType(graphUris, SH.Rule, options);
+  getListItems(graphUris, listUri) {
+    const list = listUri.includes(":") ? this.dataFactory.namedNode(listUri) : this.dataFactory.blankNode(listUri);
+    return this._getListItems(graphUris, list).map((t) => t.value);
+  }
+  _getListItems(graphUris, subject) {
+    const first = Array.from(this.matchAll(graphUris, subject, rdf.first, null));
+    if (!first.length) {
+      return [];
+    }
+    const rest = Array.from(this.matchAll(graphUris, subject, rdf.rest, null));
+    const firstItem = first[0].object;
+    const restList = rest[0]?.object;
+    if (restList.value === RDF.nil) {
+      return [firstItem];
+    } else {
+      const restItems = this._getListItems(graphUris, restList);
+      return [firstItem, ...restItems];
+    }
   }
   /**
-   * Get all rules in the repository.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param options Optional query parameters.
-   * @returns A list of all rules in the repository.
+   * Returns the exact cardinality of the quads matching the pattern.
+   * @param subject The optional subject.
+   * @param predicate The optional predicate.
+   * @param object The optional object.
+   * @param graph The optional graph.
    */
-  *getRules(graphUris, options) {
-    yield* this.getSubjectsOfType(graphUris, SH.Rule, options);
+  countQuads(subject, predicate, object, graph2) {
+    return this._store.countQuads(subject, predicate, object, graph2);
   }
   /**
-   * Get the SHACL datatype of a given property.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param subjectUri The URI of the subject.
-   * @param options Optional query parameters.
-   * @returns A datatype URI on success, `xsd:anyURI` otherwise.
+   * Returns a stream of quads matching the given pattern.
+   * @param subject The optional subject.
+   * @param predicate The optional predicate.
+   * @param object The optional object.
+   * @param graph The optional graph.
+   * @returns A stream of matching quads.
    */
-  getDatatype(graphUris, subjectUri, options) {
-    for (let q of this.store.matchAll(graphUris, null, sh.path, namedNode7(subjectUri), options?.includeInferred)) {
-      for (let x of this.store.matchAll(graphUris, q.subject, sh.datatype, null, options?.includeInferred)) {
-        return x.object.value;
-      }
-    }
+  match(subject, predicate, object, graph2) {
+    return this._store.match(subject, predicate, object, graph2);
   }
   /**
-   * Get the SHACL cardinality constraints of a given property.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param subjectUri The URI of the subject.
-   * @param options Optional query parameters.
-   * @returns An object with the minimum and maximum cardinalities; values are `-1` if not found.
+   * Query the store for triples matching the given pattern supporting multiple graphs.
+   * @param graphUris Optional graph URI or array of graph URIs to query.
+   * @param subject A subject URI or null to match any subject.
+   * @param predicate A predicate URI or null to match any predicate.
+   * @param object An object URI or null to match any object.
    */
-  getCardinalites(graphUris, subjectUri, options) {
-    let minCount = -1;
-    let maxCount = -1;
-    for (let q of this.store.matchAll(graphUris, null, sh.path, namedNode7(subjectUri), options?.includeInferred)) {
-      for (let x of this.store.matchAll(graphUris, q.subject, sh.minCount, null, options?.includeInferred)) {
-        minCount = parseInt(x.object.value);
-        break;
-      }
-      for (let x of this.store.matchAll(graphUris, q.subject, sh.maxCount, null, options?.includeInferred)) {
-        maxCount = parseInt(x.object.value);
-        break;
+  *matchAll(graphUris, subject, predicate, object, includeInferred) {
+    if (includeInferred && !this.reasoner) {
+      throw new Error("Reasoner is not available to include inferred triples.");
+    }
+    const s = subject;
+    const p = predicate;
+    const o = object;
+    if (graphUris !== void 0) {
+      const graphs = Array.isArray(graphUris) ? graphUris : [graphUris];
+      for (const graph2 of graphs.map((g) => this.dataFactory.namedNode(g))) {
+        for (const q of this._ds.match(s, p, o, graph2)) {
+          yield q;
+        }
+        if (includeInferred !== false && this.reasoner) {
+          const inferenceGraphUri = this.reasoner.targetUriGenerator.getGraphUri(graph2.value);
+          const inferenceGraph = this.dataFactory.namedNode(inferenceGraphUri);
+          for (let q of this._ds.match(s, p, o, inferenceGraph)) {
+            yield q;
+          }
+        }
       }
+    } else {
+      yield* this._ds.match(s, p, o);
     }
-    return { minCount, maxCount };
   }
   /**
-   * Get the RDF property path representation of the given SHACL property path. This method parses the SHACL property path and 
-   * returns the RDF property path as a combination of nodes and strings.
-   * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-   * @param subject The URI or blank id of the node referred to by sh:path.
-   * @param options Optional query parameters.
-   * @returns A flattened list of all path components, either as URIs or as strings.
+   * Indicate if there are triples matching the given pattern in the store.
+   * @param graphUris Optional graph URI or array of graph URIs to query.
+   * @param subject A subject URI or null to match any subject.
+   * @param predicate A predicate URI or null to match any predicate.
+   * @param object An object URI or null to match any object.
+   * @returns `true` if there are triples matching the pattern, `false` otherwise.
    */
-  getPropertyPathTokens(graphUris, subject) {
-    const visitedNodes = /* @__PURE__ */ new Set();
-    const parse = (subject2, level, separator = "/", i = 0) => {
-      if (visitedNodes.has(subject2.value)) {
-        return [];
-      }
-      visitedNodes.add(subject2.value);
-      if (subject2.termType === "NamedNode") {
-        return [subject2];
-      } else {
-        const first = this.store.matchAll(graphUris, subject2, rdf.first, null, false).next().value;
-        if (first) {
-          const path = parse(first.object, level + 1);
-          const rest = this.store.matchAll(graphUris, subject2, rdf.rest, null, false).next().value;
-          if (rest && rest.object.value !== rdf.nil.value) {
-            const tail = parse(rest.object, level, separator, i + 1);
-            if (tail.length === 0) {
-              return path;
-            }
-            if (i === 0 && level > 0) {
-              return ["(", ...path, separator, ...tail, ")"];
-            } else {
-              return [...path, separator, ...tail];
-            }
-          }
-          return path;
-        } else {
-          for (let q of this.store.matchAll(graphUris, subject2, null, null, false)) {
-            switch (q.predicate.value) {
-              case sh.inversePath.value: {
-                return ["^", ...parse(q.object, level)];
-              }
-              case sh.zeroOrOnePath.value: {
-                return [...parse(q.object, level), "?"];
-              }
-              case sh.zeroOrMorePath.value: {
-                return [...parse(q.object, level), "*"];
-              }
-              case sh.oneOrMorePath.value: {
-                return [...parse(q.object, level), "+"];
-              }
-              case sh.alternativePath.value: {
-                return parse(q.object, level, "|");
-              }
-              default:
-                throw new Error(`Unsupported path predicate: ${q.predicate.value}`);
-            }
-          }
-          throw new Error(`Unsupported path subject: ${subject2}`);
-        }
-      }
-    };
-    return parse(subject, 0);
+  any(graphUris, subject, predicate, object, includeInferred) {
+    return this.matchAll(graphUris, subject, predicate, object, includeInferred).next().done === false;
   }
   /**
-   * Get the first discovered path from a given shape class to the sh:Shape root.
-   * @param graphUris URIs of the graphs to search (should include the SHACL ontology graph).
-   * @param subjectUri URI of a shape class.
-   * @param options Optional query parameters.
-   * @returns An iterator containing the path from the given class up to sh:Shape.
+   * Get a new DatasetCore containing all quads from the specified graphs.
+   * @param graphUris Optional graph URI or array of graph URIs. If undefined, all quads are included.
+   * @param includeInferred Whether to include inferred triples. Defaults to false.
+   * @returns A new DatasetCore instance with the matching quads.
    */
-  *getRootShapePath(graphUris, subjectUri, options) {
-    yield* this._getRootShapePath(graphUris, subjectUri, [], /* @__PURE__ */ new Set(), options);
+  getDataset(graphUris, includeInferred) {
+    const dataset = RdfStore2.createDefault().asDataset();
+    for (const q of this.matchAll(graphUris, null, null, null, includeInferred)) {
+      dataset.add(q);
+    }
+    return dataset;
   }
-  _getRootShapePath(graphUris, subjectUri, path, backtrack, options) {
-    for (let o of this.getSuperClasses(graphUris, subjectUri, options)) {
-      if (o === SH.Shape) {
-        return path;
-      }
-      if (!backtrack.has(o)) {
-        backtrack.add(o);
-        return this._getRootShapePath(graphUris, o, [...path, o], backtrack, options);
-      }
+  /**
+   * Get the first triple matching the given pattern in the store.
+   * @param graphUris Optional graph URI or array of graph URIs to query.
+   * @param subject A subject URI or null to match any subject.
+   * @param predicate A predicate URI or null to match any predicate.
+   * @param object An object URI or null to match any object.
+   * @returns The first triple that matches the pattern.
+   * @throws {TripleNotFoundError} If no triple is found matching the pattern.
+   */
+  first(graphUris, subject, predicate, object, includeInferred) {
+    const result = this.matchAll(graphUris, subject, predicate, object, includeInferred).next().value;
+    if (!result) {
+      throw new TripleNotFoundError(subject, predicate, object);
     }
-    return path;
+    return result;
   }
 };
 
@@ -7653,6 +7669,7 @@ export {
   SH,
   SKOS,
   SKOS_XL,
+  ShapeRepository,
   Store,
   TripleNotFoundError,
   Uri,