@faubulous/mentor-rdf 0.2.16 → 0.2.18

package/out/ontologies/skos.d.ts

@@ -15,7 +15,7 @@ export declare const SKOS: {
     broadMatch: string;
     /** Relates a concept to a concept that is more general in meaning. */
     broader: string;
-    /** skos:broaderTransitive is a transitive superproperty of skos:broader. */
+    /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     broaderTransitive: string;
     /** A note about a modification to a concept. */
     changeNote: string;
@@ -47,7 +47,7 @@ export declare const SKOS: {
     narrowMatch: string;
     /** Relates a concept to a concept that is more specific in meaning. */
     narrower: string;
-    /** skos:narrowerTransitive is a transitive superproperty of skos:narrower. */
+    /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     narrowerTransitive: string;
     /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
     notation: string;
@@ -82,7 +82,7 @@ export declare const skos: {
     broadMatch: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#broadMatch">;
     /** Relates a concept to a concept that is more general in meaning. */
     broader: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#broader">;
-    /** skos:broaderTransitive is a transitive superproperty of skos:broader. */
+    /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     broaderTransitive: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#broaderTransitive">;
     /** A note about a modification to a concept. */
     changeNote: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#changeNote">;
@@ -114,7 +114,7 @@ export declare const skos: {
     narrowMatch: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#narrowMatch">;
     /** Relates a concept to a concept that is more specific in meaning. */
     narrower: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#narrower">;
-    /** skos:narrowerTransitive is a transitive superproperty of skos:narrower. */
+    /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     narrowerTransitive: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#narrowerTransitive">;
     /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
     notation: n3.NamedNode<"http://www.w3.org/2004/02/skos/core#notation">;

package/out/ontologies/skos.js

@@ -19,7 +19,7 @@ exports.SKOS = {
     'broadMatch': 'http://www.w3.org/2004/02/skos/core#broadMatch',
     /** Relates a concept to a concept that is more general in meaning. */
     'broader': 'http://www.w3.org/2004/02/skos/core#broader',
-    /** skos:broaderTransitive is a transitive superproperty of skos:broader. */
+    /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     'broaderTransitive': 'http://www.w3.org/2004/02/skos/core#broaderTransitive',
     /** A note about a modification to a concept. */
     'changeNote': 'http://www.w3.org/2004/02/skos/core#changeNote',
@@ -51,7 +51,7 @@ exports.SKOS = {
     'narrowMatch': 'http://www.w3.org/2004/02/skos/core#narrowMatch',
     /** Relates a concept to a concept that is more specific in meaning. */
     'narrower': 'http://www.w3.org/2004/02/skos/core#narrower',
-    /** skos:narrowerTransitive is a transitive superproperty of skos:narrower. */
+    /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     'narrowerTransitive': 'http://www.w3.org/2004/02/skos/core#narrowerTransitive',
     /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
     'notation': 'http://www.w3.org/2004/02/skos/core#notation',
@@ -86,7 +86,7 @@ exports.skos = {
     'broadMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broadMatch'),
     /** Relates a concept to a concept that is more general in meaning. */
     'broader': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broader'),
-    /** skos:broaderTransitive is a transitive superproperty of skos:broader. */
+    /** By convention, skos:broaderTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     'broaderTransitive': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broaderTransitive'),
     /** A note about a modification to a concept. */
     'changeNote': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#changeNote'),
@@ -118,7 +118,7 @@ exports.skos = {
     'narrowMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrowMatch'),
     /** Relates a concept to a concept that is more specific in meaning. */
     'narrower': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrower'),
-    /** skos:narrowerTransitive is a transitive superproperty of skos:narrower. */
+    /** By convention, skos:narrowerTransitive is not used to make assertions. Rather, the properties can be used to draw inferences about the transitive closure of the hierarchical relation, which is useful e.g. when implementing a simple query expansion algorithm in a search application. */
     'narrowerTransitive': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrowerTransitive'),
     /** A notation, also known as classification code, is a string of characters such as "T58.5" or "303.4833" used to uniquely identify a concept within the scope of a given concept scheme. */
     'notation': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#notation'),

package/out/ontologies/skos.js.map

@@ -1 +1 @@
-{"version":3,"file":"skos.js","sourceRoot":"","sources":["../../src/ontologies/skos.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEZ,QAAA,IAAI,GAAG;IACnB,MAAM,EAAE,qCAAqC;IAC7C,2CAA2C;IAC3C,YAAY,EAAE,gDAAgD;IAC9D,4CAA4C;IAC5C,SAAS,EAAE,6CAA6C;IACxD,8GAA8G;IAC9G,eAAe,EAAE,mDAAmD;IACpE,kGAAkG;IAClG,mBAAmB,EAAE,uDAAuD;IAC5E,mDAAmD;IACnD,UAAU,EAAE,8CAA8C;IAC1D,kIAAkI;IAClI,YAAY,EAAE,gDAAgD;IAC9D,sEAAsE;IACtE,SAAS,EAAE,6CAA6C;IACxD,4EAA4E;IAC5E,mBAAmB,EAAE,uDAAuD;IAC5E,gDAAgD;IAChD,YAAY,EAAE,gDAAgD;IAC9D,qVAAqV;IACrV,YAAY,EAAE,gDAAgD;IAC9D,qEAAqE;IACrE,YAAY,EAAE,gDAAgD;IAC9D,wEAAwE;IACxE,eAAe,EAAE,mDAAmD;IACpE,wRAAwR;IACxR,YAAY,EAAE,gDAAgD;IAC9D,0CAA0C;IAC1C,SAAS,EAAE,6CAA6C;IACxD,yLAAyL;IACzL,eAAe,EAAE,mDAAmD;IACpE,2KAA2K;IAC3K,aAAa,EAAE,iDAAiD;IAChE,4DAA4D;IAC5D,aAAa,EAAE,iDAAiD;IAChE,8FAA8F;IAC9F,UAAU,EAAE,8CAA8C;IAC1D,4GAA4G;IAC5G,iBAAiB,EAAE,qDAAqD;IACxE,kDAAkD;IAClD,QAAQ,EAAE,4CAA4C;IACtD,4EAA4E;IAC5E,YAAY,EAAE,gDAAgD;IAC9D,mIAAmI;IACnI,aAAa,EAAE,iDAAiD;IAChE,uEAAuE;IACvE,UAAU,EAAE,8CAA8C;IAC1D,8EAA8E;IAC9E,oBAAoB,EAAE,wDAAwD;IAC9E,6LAA6L;IAC7L,UAAU,EAAE,8CAA8C;IAC1D,uCAAuC;IACvC,MAAM,EAAE,0CAA0C;IAClD,uEAAuE;IACvE,WAAW,EAAE,+CAA+C;IAC5D,+FAA+F;IAC/F,SAAS,EAAE,6CAA6C;IACxD,oIAAoI;IACpI,cAAc,EAAE,kDAAkD;IAClE,4EAA4E;IAC5E,WAAW,EAAE,+CAA+C;IAC5D,uDAAuD;IACvD,kBAAkB,EAAE,sDAAsD;IAC1E,iFAAiF;IACjF,cAAc,EAAE,kDAAkD;CAClE,CAAA;AAEY,QAAA,IAAI,GAAG;IACnB,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qCAAqC,CAAC;IAC/D,2CAA2C;IAC3C,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,4CAA4C;IAC5C,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,8GAA8G;IAC9G,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,kGAAkG;IAClG,mBAAmB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uDAAuD,CAAC;IAC9F,mDAAmD;IACnD,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,kIAAkI;IAClI,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,sEAAsE;IACtE,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,4EAA4E;IAC5E,mBAAmB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uDAAuD,CAAC;IAC9F,gDAAgD;IAChD,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,qVAAqV;IACrV,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,qEAAqE;IACrE,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,wEAAwE;IACxE,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,wRAAwR;IACxR,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,0CAA0C;IAC1C,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,yLAAyL;IACzL,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,2KAA2K;IAC3K,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,4DAA4D;IAC5D,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,8FAA8F;IAC9F,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,4GAA4G;IAC5G,iBAAiB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qDAAqD,CAAC;IAC1F,kDAAkD;IAClD,QAAQ,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,4CAA4C,CAAC;IACxE,4EAA4E;IAC5E,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,mIAAmI;IACnI,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,uEAAuE;IACvE,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,8EAA8E;IAC9E,oBAAoB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,wDAAwD,CAAC;IAChG,6LAA6L;IAC7L,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,uCAAuC;IACvC,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,0CAA0C,CAAC;IACpE,uEAAuE;IACvE,WAAW,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IAC9E,+FAA+F;IAC/F,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,oIAAoI;IACpI,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;IACpF,4EAA4E;IAC5E,WAAW,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IAC9E,uDAAuD;IACvD,kBAAkB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,sDAAsD,CAAC;IAC5F,iFAAiF;IACjF,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;CACpF,CAAA"}
+{"version":3,"file":"skos.js","sourceRoot":"","sources":["../../src/ontologies/skos.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEZ,QAAA,IAAI,GAAG;IACnB,MAAM,EAAE,qCAAqC;IAC7C,2CAA2C;IAC3C,YAAY,EAAE,gDAAgD;IAC9D,4CAA4C;IAC5C,SAAS,EAAE,6CAA6C;IACxD,8GAA8G;IAC9G,eAAe,EAAE,mDAAmD;IACpE,kGAAkG;IAClG,mBAAmB,EAAE,uDAAuD;IAC5E,mDAAmD;IACnD,UAAU,EAAE,8CAA8C;IAC1D,kIAAkI;IAClI,YAAY,EAAE,gDAAgD;IAC9D,sEAAsE;IACtE,SAAS,EAAE,6CAA6C;IACxD,gSAAgS;IAChS,mBAAmB,EAAE,uDAAuD;IAC5E,gDAAgD;IAChD,YAAY,EAAE,gDAAgD;IAC9D,qVAAqV;IACrV,YAAY,EAAE,gDAAgD;IAC9D,qEAAqE;IACrE,YAAY,EAAE,gDAAgD;IAC9D,wEAAwE;IACxE,eAAe,EAAE,mDAAmD;IACpE,wRAAwR;IACxR,YAAY,EAAE,gDAAgD;IAC9D,0CAA0C;IAC1C,SAAS,EAAE,6CAA6C;IACxD,yLAAyL;IACzL,eAAe,EAAE,mDAAmD;IACpE,2KAA2K;IAC3K,aAAa,EAAE,iDAAiD;IAChE,4DAA4D;IAC5D,aAAa,EAAE,iDAAiD;IAChE,8FAA8F;IAC9F,UAAU,EAAE,8CAA8C;IAC1D,4GAA4G;IAC5G,iBAAiB,EAAE,qDAAqD;IACxE,kDAAkD;IAClD,QAAQ,EAAE,4CAA4C;IACtD,4EAA4E;IAC5E,YAAY,EAAE,gDAAgD;IAC9D,mIAAmI;IACnI,aAAa,EAAE,iDAAiD;IAChE,uEAAuE;IACvE,UAAU,EAAE,8CAA8C;IAC1D,iSAAiS;IACjS,oBAAoB,EAAE,wDAAwD;IAC9E,6LAA6L;IAC7L,UAAU,EAAE,8CAA8C;IAC1D,uCAAuC;IACvC,MAAM,EAAE,0CAA0C;IAClD,uEAAuE;IACvE,WAAW,EAAE,+CAA+C;IAC5D,+FAA+F;IAC/F,SAAS,EAAE,6CAA6C;IACxD,oIAAoI;IACpI,cAAc,EAAE,kDAAkD;IAClE,4EAA4E;IAC5E,WAAW,EAAE,+CAA+C;IAC5D,uDAAuD;IACvD,kBAAkB,EAAE,sDAAsD;IAC1E,iFAAiF;IACjF,cAAc,EAAE,kDAAkD;CAClE,CAAA;AAEY,QAAA,IAAI,GAAG;IACnB,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qCAAqC,CAAC;IAC/D,2CAA2C;IAC3C,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,4CAA4C;IAC5C,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,8GAA8G;IAC9G,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,kGAAkG;IAClG,mBAAmB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uDAAuD,CAAC;IAC9F,mDAAmD;IACnD,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,kIAAkI;IAClI,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,sEAAsE;IACtE,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,gSAAgS;IAChS,mBAAmB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uDAAuD,CAAC;IAC9F,gDAAgD;IAChD,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,qVAAqV;IACrV,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,qEAAqE;IACrE,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,wEAAwE;IACxE,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,wRAAwR;IACxR,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,0CAA0C;IAC1C,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,yLAAyL;IACzL,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,mDAAmD,CAAC;IACtF,2KAA2K;IAC3K,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,4DAA4D;IAC5D,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,8FAA8F;IAC9F,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,4GAA4G;IAC5G,iBAAiB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qDAAqD,CAAC;IAC1F,kDAAkD;IAClD,QAAQ,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,4CAA4C,CAAC;IACxE,4EAA4E;IAC5E,YAAY,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IAChF,mIAAmI;IACnI,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,iDAAiD,CAAC;IAClF,uEAAuE;IACvE,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,iSAAiS;IACjS,oBAAoB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,wDAAwD,CAAC;IAChG,6LAA6L;IAC7L,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC5E,uCAAuC;IACvC,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,0CAA0C,CAAC;IACpE,uEAAuE;IACvE,WAAW,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IAC9E,+FAA+F;IAC/F,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,6CAA6C,CAAC;IAC1E,oIAAoI;IACpI,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;IACpF,4EAA4E;IAC5E,WAAW,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IAC9E,uDAAuD;IACvD,kBAAkB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,sDAAsD,CAAC;IAC5F,iFAAiF;IACjF,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;CACpF,CAAA"}

package/out/rdf/class-repository.d.ts

@@ -1,6 +1,10 @@
 import { Store } from "./store";
-import { ResourceRepository } from "./resource-repository";
-interface ClassRetrievalOptions {
+import { ConceptRepository } from "./concept-repository";
+import { DefinitionQueryOptions, QueryOptions } from "./resource-repository";
+/**
+ * Common options for class retrieval.
+ */
+interface ClassQueryOptions extends DefinitionQueryOptions {
     /**
      * Indicate if classes what are not defined in the ontology should be included when retrieving classes (default true).
      */
@@ -9,20 +13,30 @@ interface ClassRetrievalOptions {
 /**
  * A repository for retrieving classes from graphs.
  */
-export declare class ClassRepository extends ResourceRepository {
+export declare class ClassRepository extends ConceptRepository {
     constructor(store: Store);
-    private _skip;
+    private _skipClass;
     /**
      * Get all classes 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 classes in the repository.
      */
-    getClasses(graphUris: string | string[] | undefined, options?: ClassRetrievalOptions): string[];
+    getClasses(graphUris: string | string[] | undefined, options?: ClassQueryOptions): string[];
     /**
      * Get the super classes of a given class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
+     * @param options Optional query parameters.
      * @returns An array of super classes of the given class, an empty array if the class has no super classes.
      */
-    getSuperClasses(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassRetrievalOptions): string[];
+    getSuperClasses(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassQueryOptions): string[];
+    /**
+     * Get the first discovered path from a given class to a root class.
+     * @param subjectUri URI of a class.
+     * @returns A string array containing the first path that is found from the given class to a root class.
+     */
+    getRootClassPath(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassQueryOptions): string[];
     /**
      * Recursively find the first path from a given class to a root class.
      * @param subjectUri URI of a class.
@@ -31,34 +45,30 @@ export declare class ClassRepository extends ResourceRepository {
      * @returns The first path that is found from the given class to a root class.
      */
     private _getRootClassPath;
-    /**
-     * Get the first discovered path from a given class to a root class.
-     * @param subjectUri URI of a class.
-     * @returns A string array containing the first path that is found from the given class to a root class.
-     */
-    getRootClassPath(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassRetrievalOptions): string[];
     /**
      * Indicate if there are sub classes of a given class.
      * @param subjectUri URI of a class.
      * @returns true if the class has sub classes, false otherwise.
      */
-    hasSubClasses(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassRetrievalOptions): boolean;
+    hasSubClasses(graphUris: string | string[] | undefined, subjectUri: string, options?: ClassQueryOptions): boolean;
     /**
      * Get the sub classes of a given class or all root classes.
      * @param subjectUri URI of a class or undefined to get all root classes.
      * @returns An array of sub classes of the given class, an empty array if the class has no sub classes.
      */
-    getSubClasses(graphUris: string | string[] | undefined, subjectUri?: string, options?: ClassRetrievalOptions): string[];
+    getSubClasses(graphUris: string | string[] | undefined, subjectUri?: string, options?: ClassQueryOptions): string[];
     /**
      * Indicate if a given class is direct or indirect (inferred) sub class of another class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @param classUri URI of a class.
+     * @param options Optional query parameters.
      * @returns true if the class is a sub class of the other class, false otherwise.
      */
-    isSubClassOf(graphUris: string | string[] | undefined, subjectUri: string, classUri: string): boolean;
+    isSubClassOf(graphUris: string | string[] | undefined, subjectUri: string, classUri: string, options?: ClassQueryOptions): boolean;
     /**
      * Indicate if a given class is the intersection of classes.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @returns `true` if the class is the intersection of classes, `false` otherwise.
      */
@@ -66,36 +76,34 @@ export declare class ClassRepository extends ResourceRepository {
     private _isIntersectionOfClasses;
     /**
      * Indicate if a given class is a (disjoint) union of classes.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @returns `true` if the class is a (disjoint) union of classes, `false` otherwise.
      */
     isUnionOfClasses(graphUris: string | string[] | undefined, subjectUri: string): boolean;
     private _isUnionOfClasses;
-    /**
-     * Indicate if a given class has property restrictions.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
-     * @param subjectUri URI of a class.
-     * @returns `true` if the class has property restrictions, `false` otherwise.
-     */
-    hasRestrictions(graphUris: string | string[] | undefined, subjectUri: string): boolean;
     /**
      * Get all classes from the repository that have no super classes.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+     * @param options Optional query parameters.
      * @returns An array of root classes in the repository.
      */
-    getRootClasses(graphUris: string | string[] | undefined, options?: ClassRetrievalOptions): string[];
+    getRootClasses(graphUris: string | string[] | undefined, options?: ClassQueryOptions): string[];
     /**
      * Indicate if there is an equivalent class of a given class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
+     * @param options Optional query parameters.
      * @returns `true` if the class has an equivalent class, `false` otherwise.
      */
-    hasEquivalentClass(graphUris: string | string[] | undefined, subjectUri: string): boolean;
+    hasEquivalentClass(graphUris: string | string[] | undefined, subjectUri: string, options?: QueryOptions): boolean;
     /**
      * Indicate if a given class has at least one individual defined for it or for one of its sub classes.
      * @param graphUris Graph URIs to search in, undefined for the default graph.
      * @param classUri URI of a class.
+     * @param options Optional query parameters.
      * @returns `true` if the class has individuals, `false` otherwise.
      */
-    hasIndividuals(graphUris: string | string[] | undefined, classUri: string): boolean;
+    hasIndividuals(graphUris: string | string[] | undefined, classUri: string, options?: ClassQueryOptions): boolean;
 }
 export {};

package/out/rdf/class-repository.js

@@ -4,16 +4,19 @@ exports.ClassRepository = void 0;
 const tslib_1 = require("tslib");
 const n3 = tslib_1.__importStar(require("n3"));
 const ontologies_1 = require("../ontologies");
-const resource_repository_1 = require("./resource-repository");
+const concept_repository_1 = require("./concept-repository");
 /**
  * A repository for retrieving classes from graphs.
  */
-class ClassRepository extends resource_repository_1.ResourceRepository {
+class ClassRepository extends concept_repository_1.ConceptRepository {
     constructor(store) { super(store); }
-    _skip(graphUris, node, options) {
+    _skipClass(graphUris, node, options) {
         if (node.termType != "NamedNode") {
             return true;
         }
+        if ((options === null || options === void 0 ? void 0 : options.definedBy) !== undefined) {
+            return !this.isDefinedBy(graphUris, node, options.definedBy);
+        }
         if ((options === null || options === void 0 ? void 0 : options.includeReferencedClasses) === false && !this.hasSubject(graphUris, node.value)) {
             return true;
         }
@@ -21,36 +24,46 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     /**
      * Get all classes 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 classes in the repository.
      */
     getClasses(graphUris, options) {
         const result = new Set();
-        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.rdfs.Class)) {
+        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.rdfs.Class, options === null || options === void 0 ? void 0 : options.includeInferred)) {
             const s = q.subject;
-            if (this._skip(graphUris, s, options)) {
-                continue;
+            if (!this._skipClass(graphUris, s, options)) {
+                result.add(s.value);
             }
-            result.add(s.value);
         }
         return Array.from(result);
     }
     /**
      * Get the super classes of a given class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
+     * @param options Optional query parameters.
      * @returns An array of super classes of the given class, an empty array if the class has no super classes.
      */
     getSuperClasses(graphUris, subjectUri, options) {
         const result = new Set();
         const s = n3.DataFactory.namedNode(subjectUri);
-        for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.subClassOf, null)) {
+        for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.subClassOf, null, options === null || options === void 0 ? void 0 : options.includeInferred)) {
             const o = q.object;
-            if (this._skip(graphUris, o, options)) {
-                continue;
+            if (!this._skipClass(graphUris, o, options)) {
+                result.add(o.value);
             }
-            result.add(o.value);
         }
         return Array.from(result);
     }
+    /**
+     * Get the first discovered path from a given class to a root class.
+     * @param subjectUri URI of a class.
+     * @returns A string array containing the first path that is found from the given class to a root class.
+     */
+    getRootClassPath(graphUris, subjectUri, options) {
+        return this._getRootClassPath(graphUris, subjectUri, [], new Set(), options);
+    }
     /**
      * Recursively find the first path from a given class to a root class.
      * @param subjectUri URI of a class.
@@ -65,14 +78,6 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
         }
         return path;
     }
-    /**
-     * Get the first discovered path from a given class to a root class.
-     * @param subjectUri URI of a class.
-     * @returns A string array containing the first path that is found from the given class to a root class.
-     */
-    getRootClassPath(graphUris, subjectUri, options) {
-        return this._getRootClassPath(graphUris, subjectUri, [], new Set(), options);
-    }
     /**
      * Indicate if there are sub classes of a given class.
      * @param subjectUri URI of a class.
@@ -81,10 +86,7 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     hasSubClasses(graphUris, subjectUri, options) {
         const o = n3.DataFactory.namedNode(subjectUri);
         for (let _q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, o)) {
-            if (this._skip(graphUris, _q.subject, options)) {
-                continue;
-            }
-            else {
+            if (!this._skipClass(graphUris, _q.subject, options)) {
                 return true;
             }
         }
@@ -99,12 +101,11 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
         if (subjectUri) {
             const result = new Set();
             const o = n3.DataFactory.namedNode(subjectUri);
-            for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, o)) {
+            for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, o, options === null || options === void 0 ? void 0 : options.includeInferred)) {
                 const s = q.subject;
-                if (this._skip(graphUris, s, options)) {
-                    continue;
+                if (!this._skipClass(graphUris, s, options)) {
+                    result.add(s.value);
                 }
-                result.add(s.value);
             }
             return Array.from(result);
         }
@@ -114,16 +115,18 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     /**
      * Indicate if a given class is direct or indirect (inferred) sub class of another class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @param classUri URI of a class.
+     * @param options Optional query parameters.
      * @returns true if the class is a sub class of the other class, false otherwise.
      */
-    isSubClassOf(graphUris, subjectUri, classUri) {
-        return this.getRootClassPath(graphUris, subjectUri).includes(classUri);
+    isSubClassOf(graphUris, subjectUri, classUri, options) {
+        return this.getRootClassPath(graphUris, subjectUri, options).includes(classUri);
     }
     /**
      * Indicate if a given class is the intersection of classes.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @returns `true` if the class is the intersection of classes, `false` otherwise.
      */
@@ -132,7 +135,8 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
         if (this._isIntersectionOfClasses(graphUris, s)) {
             return true;
         }
-        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass)) {
+        // Note: The intersection must be defined in the original graphs, so inference is not required.
+        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, false)) {
             if (this._isIntersectionOfClasses(graphUris, q.object)) {
                 return true;
             }
@@ -141,7 +145,7 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     _isIntersectionOfClasses(graphUris, subject) {
         if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {
-            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.intersectionOf)) {
+            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.intersectionOf, null, false)) {
                 return true;
             }
         }
@@ -149,7 +153,7 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     /**
      * Indicate if a given class is a (disjoint) union of classes.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
      * @returns `true` if the class is a (disjoint) union of classes, `false` otherwise.
      */
@@ -158,7 +162,8 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
         if (this._isUnionOfClasses(graphUris, s)) {
             return true;
         }
-        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass)) {
+        // Note: The union must be defined in the original graphs, so inference is not required.
+        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, false)) {
             if (this._isUnionOfClasses(graphUris, q.object)) {
                 return true;
             }
@@ -167,41 +172,19 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     _isUnionOfClasses(graphUris, subject) {
         if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {
-            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.unionOf)) {
+            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.unionOf, null, false)) {
                 return true;
             }
-            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.disjointUnionOf)) {
+            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.disjointUnionOf, null, false)) {
                 return true;
             }
         }
         return false;
     }
-    /**
-     * Indicate if a given class has property restrictions.
-     * @param graphUris Graph URIs to search in, undefined for the default graph.
-     * @param subjectUri URI of a class.
-     * @returns `true` if the class has property restrictions, `false` otherwise.
-     */
-    hasRestrictions(graphUris, subjectUri) {
-        const s = n3.DataFactory.namedNode(subjectUri);
-        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass)) {
-            if (q.object instanceof n3.BlankNode || q.object instanceof n3.NamedNode) {
-                for (let _ of this.store.match(graphUris, q.object, ontologies_1.rdf.type, ontologies_1.owl.Restriction)) {
-                    return true;
-                }
-            }
-        }
-        for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.subClassOf)) {
-            if (q.object instanceof n3.BlankNode || q.object instanceof n3.NamedNode) {
-                for (let _ of this.store.match(graphUris, q.object, ontologies_1.rdf.type, ontologies_1.owl.Restriction)) {
-                    return true;
-                }
-            }
-        }
-        return false;
-    }
     /**
      * Get all classes from the repository that have no super classes.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
+     * @param options Optional query parameters.
      * @returns An array of root classes in the repository.
      */
     getRootClasses(graphUris, options) {
@@ -210,16 +193,15 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
         // 1. Get all classes that are defined in the ontology.
         for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.rdfs.Class)) {
             const s = q.subject;
-            if (this._skip(graphUris, s, options)) {
-                continue;
+            if (!this._skipClass(graphUris, s, options)) {
+                classes.add(s.value);
             }
-            classes.add(s.value);
         }
         // 2. Get all classes that have a sub class relationship.
         for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, null)) {
             const s = q.subject;
             const o = q.object;
-            if (this._skip(graphUris, s, options) || this._skip(graphUris, o, options)) {
+            if (this._skipClass(graphUris, s, options) || this._skipClass(graphUris, o, options)) {
                 continue;
             }
             classes.add(s.value);
@@ -230,13 +212,15 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
     }
     /**
      * Indicate if there is an equivalent class of a given class.
+     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
      * @param subjectUri URI of a class.
+     * @param options Optional query parameters.
      * @returns `true` if the class has an equivalent class, `false` otherwise.
      */
-    hasEquivalentClass(graphUris, subjectUri) {
+    hasEquivalentClass(graphUris, subjectUri, options) {
         const s = n3.DataFactory.namedNode(subjectUri);
         // The OWL resoner will assert the equivalent class relationship in both directions.
-        for (let _ of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null)) {
+        for (let _ of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, options === null || options === void 0 ? void 0 : options.includeInferred)) {
             return true;
         }
         return false;
@@ -245,16 +229,17 @@ class ClassRepository extends resource_repository_1.ResourceRepository {
      * Indicate if a given class has at least one individual defined for it or for one of its sub classes.
      * @param graphUris Graph URIs to search in, undefined for the default graph.
      * @param classUri URI of a class.
+     * @param options Optional query parameters.
      * @returns `true` if the class has individuals, `false` otherwise.
      */
-    hasIndividuals(graphUris, classUri) {
+    hasIndividuals(graphUris, classUri, options) {
         const s = n3.DataFactory.namedNode(classUri);
-        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, s)) {
+        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, s, options === null || options === void 0 ? void 0 : options.includeInferred)) {
             if (q.subject.termType == "NamedNode") {
                 return true;
             }
         }
-        for (let c of this.getSubClasses(graphUris, classUri)) {
+        for (let c of this.getSubClasses(graphUris, classUri, options)) {
             if (this.hasIndividuals(graphUris, c)) {
                 return true;
             }

package/out/rdf/class-repository.js.map

@@ -1 +1 @@
-{"version":3,"file":"class-repository.js","sourceRoot":"","sources":["../../src/rdf/class-repository.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEzB,8CAA+C;AAE/C,+DAA2D;AAS3D;;GAEG;AACH,MAAa,eAAgB,SAAQ,wCAAkB;IACnD,YAAY,KAAY,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEnC,KAAK,CAAC,SAAwC,EAAE,IAAwC,EAAE,OAA+B;QAC7H,IAAI,IAAI,CAAC,QAAQ,IAAI,WAAW,EAAE;YAC9B,OAAO,IAAI,CAAC;SACf;QAED,IAAI,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,wBAAwB,MAAK,KAAK,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YACxF,OAAO,IAAI,CAAC;SACf;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,SAAwC,EAAE,OAA+B;QAChF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,iBAAI,CAAC,KAAK,CAAC,EAAE;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAEpB,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACnC,SAAS;aACZ;YAED,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SACvB;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA+B;QACzG,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,iBAAI,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE;YACjE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAEnB,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACnC,SAAS;aACZ;YAED,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SACvB;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,SAAwC,EAAE,UAAkB,EAAE,IAAc,EAAE,SAAsB,EAAE,OAA+B;QAC3J,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;QAE1E,KAAK,IAAI,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;YACvD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;SACjF;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA+B;QAC1G,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,GAAG,EAAU,EAAE,OAAO,CAAC,CAAC;IACzF,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA+B;QACvG,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,KAAK,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE;YAClE,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE;gBAC5C,SAAS;aACZ;iBAAM;gBACH,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAmB,EAAE,OAA+B;QACxG,IAAI,UAAU,EAAE;YACZ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE;gBACjE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBAEpB,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;oBACnC,SAAS;iBACZ;gBAED,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACvB;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC7B;aAAM;YACH,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;SAClD;IACL,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,SAAwC,EAAE,UAAkB,EAAE,QAAgB;QACvF,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC3E,CAAC;IAED;;;;;OAKG;IACH,uBAAuB,CAAC,SAAwC,EAAE,UAAkB;QAChF,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,IAAI,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;YAC7C,OAAO,IAAI,CAAC;SACf;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,CAAC,EAAE;YAC/D,IAAI,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;gBACpD,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,wBAAwB,CAAC,SAAwC,EAAE,OAAY;QACnF,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,EAAE;YACpE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,cAAc,CAAC,EAAE;gBACpE,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB;QACzE,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;YACtC,OAAO,IAAI,CAAC;SACf;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,CAAC,EAAE;YAC/D,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;gBAC7C,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,iBAAiB,CAAC,SAAwC,EAAE,OAAY;QAC5E,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,EAAE;YACpE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,OAAO,CAAC,EAAE;gBAC7D,OAAO,IAAI,CAAC;aACf;YAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,eAAe,CAAC,EAAE;gBACrE,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,SAAwC,EAAE,UAAkB;QACxE,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,CAAC,EAAE;YAC/D,IAAI,CAAC,CAAC,MAAM,YAAY,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,EAAE,CAAC,SAAS,EAAE;gBACtE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,gBAAG,CAAC,IAAI,EAAE,gBAAG,CAAC,WAAW,CAAC,EAAE;oBAC5E,OAAO,IAAI,CAAC;iBACf;aACJ;SACJ;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,iBAAI,CAAC,UAAU,CAAC,EAAE;YAC3D,IAAI,CAAC,CAAC,MAAM,YAAY,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,EAAE,CAAC,SAAS,EAAE;gBACtE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,gBAAG,CAAC,IAAI,EAAE,gBAAG,CAAC,WAAW,CAAC,EAAE;oBAC5E,OAAO,IAAI,CAAC;iBACf;aACJ;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,SAAwC,EAAE,OAA+B;QAC3F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,uDAAuD;QACvD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,iBAAI,CAAC,KAAK,CAAC,EAAE;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAEpB,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACnC,SAAS;aACZ;YAED,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SACxB;QAED,yDAAyD;QACzD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE;YACpE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAEnB,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACxE,SAAS;aACZ;YAED,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAErB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SAC3B;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,SAAwC,EAAE,UAAkB;QAClF,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,oFAAoF;QACpF,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,CAAC,EAAE;YACrE,OAAO,IAAI,CAAC;SACf;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,SAAwC,EAAE,QAAgB;QAC5E,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAE7C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;YAC1D,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,IAAI,WAAW,EAAE;gBACnC,OAAO,IAAI,CAAC;aACf;SACJ;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE;YACnD,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;gBACnC,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AAvTD,0CAuTC"}
+{"version":3,"file":"class-repository.js","sourceRoot":"","sources":["../../src/rdf/class-repository.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEzB,8CAA+C;AAE/C,6DAAyD;AAazD;;GAEG;AACH,MAAa,eAAgB,SAAQ,sCAAiB;IAClD,YAAY,KAAY,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEnC,UAAU,CAAC,SAAwC,EAAE,IAAwC,EAAE,OAA2B;QAC9H,IAAI,IAAI,CAAC,QAAQ,IAAI,WAAW,EAAE;YAC9B,OAAO,IAAI,CAAC;SACf;QAED,IAAI,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,SAAS,MAAK,SAAS,EAAE;YAClC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,IAA4B,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;SACxF;QAED,IAAI,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,wBAAwB,MAAK,KAAK,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YACxF,OAAO,IAAI,CAAC;SACf;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,SAAwC,EAAE,OAA2B;QAC5E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,iBAAI,CAAC,KAAK,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE;YAC7F,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAEpB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACzC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACvB;SACJ;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA2B;QACrG,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,iBAAI,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE;YAC3F,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAEnB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACzC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACvB;SACJ;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA2B;QACtG,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,GAAG,EAAU,EAAE,OAAO,CAAC,CAAC;IACzF,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,SAAwC,EAAE,UAAkB,EAAE,IAAc,EAAE,SAAsB,EAAE,OAA2B;QACvJ,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;QAE1E,KAAK,IAAI,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;YACvD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;SACjF;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAA2B;QACnG,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,KAAK,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE;YAClE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE;gBAClD,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAmB,EAAE,OAA2B;QACpG,IAAI,UAAU,EAAE;YACZ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE;gBAC3F,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBAEpB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;oBACzC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;iBACvB;aACJ;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC7B;aAAM;YACH,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;SAClD;IACL,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,SAAwC,EAAE,UAAkB,EAAE,QAAgB,EAAE,OAA2B;QACpH,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACpF,CAAC;IAED;;;;;OAKG;IACH,uBAAuB,CAAC,SAAwC,EAAE,UAAkB;QAChF,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,IAAI,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;YAC7C,OAAO,IAAI,CAAC;SACf;QAED,+FAA+F;QAC/F,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;YAC5E,IAAI,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;gBACpD,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,wBAAwB,CAAC,SAAwC,EAAE,OAAY;QACnF,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,EAAE;YACpE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;gBACjF,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB;QACzE,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;YACtC,OAAO,IAAI,CAAC;SACf;QAED,wFAAwF;QACxF,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;YAC5E,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;gBAC7C,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,iBAAiB,CAAC,SAAwC,EAAE,OAAY;QAC5E,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,IAAI,OAAO,YAAY,EAAE,CAAC,SAAS,EAAE;YACpE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;gBAC1E,OAAO,IAAI,CAAC;aACf;YAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;gBAClF,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,SAAwC,EAAE,OAA2B;QACvF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,uDAAuD;QACvD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,iBAAI,CAAC,KAAK,CAAC,EAAE;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YAEpB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBACzC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACxB;SACJ;QAED,yDAAyD;QACzD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE;YACpE,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAEnB,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;gBAClF,SAAS;aACZ;YAED,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAErB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SAC3B;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACI,kBAAkB,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAAsB;QAC1G,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAE/C,oFAAoF;QACpF,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE;YAC/F,OAAO,IAAI,CAAC;SACf;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,cAAc,CAAC,SAAwC,EAAE,QAAgB,EAAE,OAA2B;QACzG,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAE7C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE;YACpF,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,IAAI,WAAW,EAAE;gBACnC,OAAO,IAAI,CAAC;aACf;SACJ;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE;YAC5D,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE;gBACnC,OAAO,IAAI,CAAC;aACf;SACJ;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AAjSD,0CAiSC"}

package/out/rdf/concept-repository.d.ts

@@ -0,0 +1,66 @@
+import { ResourceRepository } from "./resource-repository";
+export declare class ConceptRepository extends ResourceRepository {
+    /**
+     * Get all concepts.
+     * @param graphUris URIs of the graphs to search for concepts.
+     */
+    getConcepts(graphUris: string | string[] | undefined): string[];
+    /**
+     * Get all concept schemes.
+     * @param graphUris URIs of the graphs to search for concepts.
+     */
+    getConceptSchemes(graphUris: string | string[] | undefined): string[];
+    /**
+     * Get all broader concepts of a concept scheme.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept scheme.
+     */
+    getBroaderConcepts(graphUris: string | string[] | undefined, subjectUri: string): string[];
+    /**
+     * Indicates whether a concept has broader concepts.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept.
+     */
+    hasBroaderConcepts(graphUris: string | string[] | undefined, subjectUri: string): boolean;
+    /**
+     * Get all narrower concepts of a concept or top concepts of a concept scheme.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept or concept scheme.
+     */
+    getNarrowerConcepts(graphUris: string | string[] | undefined, subjectUri?: string): string[];
+    /**
+     * Indicates whether a concept has narrower concepts.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept.
+     */
+    hasNarrowerConcepts(graphUris: string | string[] | undefined, subjectUri: string): boolean;
+    /**
+     * Indicates whether a concept is a narrower concept of another concept.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept.
+     * @param broaderUri URI of a broader concept.
+     * @returns `true` if the concept is a narrower concept of the broader concept, `false` otherwise.
+     */
+    isNarrowerConceptOf(graphUris: string | string[] | undefined, subjectUri: string, broaderUri: string): boolean;
+    /**
+     * Indicates whether a subject is a concept scheme.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a subject.
+     * @returns `true` if the subject is a concept scheme, `false` otherwise.
+     */
+    isConceptScheme(graphUris: string | string[] | undefined, subjectUri: string): boolean;
+    /**
+     * Get all broader concepts up to and including a concept scheme.
+     * @param graphUris URIs of the graphs to search for concepts.
+     * @param subjectUri URI of a concept.
+     */
+    getConceptSchemePath(graphUris: string | string[] | undefined, subjectUri: string): string[];
+    /**
+     * Recursively find the first path from a given class to a root class.
+     * @param subjectUri URI of a class.
+     * @param path The current class path.
+     * @param backtrack Set of URIs that have already been visited.
+     * @returns The first path that is found from the given class to a root class.
+     */
+    private _getConceptSchemePath;
+}