@faubulous/mentor-rdf 0.2.49 → 0.2.50

package/out/ontologies/src.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"src.js","sourceRoot":"","sources":["../../src/ontologies/src.ts"],"names":[],"mappings":";;;AAAa,QAAA,GAAG,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAuiBb,CAAC;AAEM,QAAA,GAAG,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA0JlB,CAAC;AAEW,QAAA,IAAI,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAoGnB,CAAC;AAEW,QAAA,IAAI,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA6GnB,CAAC;AAEW,QAAA,EAAE,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAioDjB,CAAC;AAEW,QAAA,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAqEtB,CAAC;AAEW,QAAA,IAAI,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4CAqRwB,CAAC;AAEhC,QAAA,GAAG,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;uKA+EoJ,CAAC"}

package/out/ontologies/xsd.js

@@ -1,108 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.xsd = exports._xsd = exports.XSD = exports._XSD = void 0;
-const tslib_1 = require("tslib");
-const n3 = tslib_1.__importStar(require("n3"));
-/** Namespace URI of the XSD vocabulary. */
-exports._XSD = 'http://www.w3.org/2001/XMLSchema#';
-exports.XSD = {
-    /** anyURI represents an Internationalized Resource Identifier Reference (IRI).  An anyURI value can be absolute or relative, and may have an optional fragment identifier (i.e., it may be an IRI Reference).  This type should be used when the value fulfills the role of an IRI, as defined in [RFC 3987] or its successor(s) in the IETF Standards Track. */
-    'anyURI': 'http://www.w3.org/2001/XMLSchema#anyURI',
-    /** base64Binary represents arbitrary Base64-encoded binary data.  For base64Binary data the entire binary stream is encoded using the Base64 Encoding defined in [RFC 3548], which is derived from the encoding described in [RFC 2045]. */
-    'base64Binary': 'http://www.w3.org/2001/XMLSchema#base64Binary',
-    /** boolean represents the values of two-valued logic. */
-    'boolean': 'http://www.w3.org/2001/XMLSchema#boolean',
-    /** byte is ·derived· from short by setting the value of ·maxInclusive· to be 127 and ·minInclusive· to be -128. The ·base type· of byte is short. */
-    'byte': 'http://www.w3.org/2001/XMLSchema#byte',
-    /** date represents top-open intervals of exactly one day in length on the timelines of dateTime, beginning on the beginning moment of each day, up to but not including the beginning moment of the next day).  For non-timezoned values, the top-open intervals disjointly cover the non-timezoned timeline, one per day.  For timezoned values, the intervals begin at every minute and therefore overlap. */
-    'date': 'http://www.w3.org/2001/XMLSchema#date',
-    /** dateTime represents instants of time, optionally marked with a particular time zone offset.  Values representing the same instant but having different time zone offsets are equal but not identical. */
-    'dateTime': 'http://www.w3.org/2001/XMLSchema#dateTime',
-    /** decimal represents a subset of the real numbers, which can be represented by decimal numerals. The ·value space· of decimal is the set of numbers that can be obtained by dividing an integer by a non-negative power of ten, i.e., expressible as i / 10n where i and n are integers and n ≥ 0. Precision is not reflected in this value space; the number 2.0 is not distinct from the number 2.00. The order relation on decimal is the order relation on real numbers, restricted to this subset. */
-    'decimal': 'http://www.w3.org/2001/XMLSchema#decimal',
-    /** The double datatype is patterned after the IEEE double-precision 64-bit floating point datatype [IEEE 754-2008].  Each floating point datatype has a value space that is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
-    'double': 'http://www.w3.org/2001/XMLSchema#double',
-    /** duration is a datatype that represents durations of time.  The concept of duration being captured is drawn from those of [ISO 8601], specifically durations without fixed endpoints. */
-    'duration': 'http://www.w3.org/2001/XMLSchema#duration',
-    /** The float datatype is patterned after the IEEE single-precision 32-bit floating point datatype [IEEE 754-2008].  Its value space is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
-    'float': 'http://www.w3.org/2001/XMLSchema#float',
-    /** int is ·derived· from long by setting the value of ·maxInclusive· to be 2147483647 and ·minInclusive· to be -2147483648.  The ·base type· of int is long. */
-    'int': 'http://www.w3.org/2001/XMLSchema#int',
-    /** integer is ·derived· from decimal by fixing the value of ·fractionDigits· to be 0 and disallowing the trailing decimal point.  This results in the standard mathematical concept of the integer numbers.  The ·value space· of integer is the infinite set {...,-2,-1,0,1,2,...}.  The ·base type· of integer is decimal. */
-    'integer': 'http://www.w3.org/2001/XMLSchema#integer',
-    /** long is ·derived· from integer by setting the value of ·maxInclusive· to be 9223372036854775807 and ·minInclusive· to be -9223372036854775808. The ·base type· of long is integer. */
-    'long': 'http://www.w3.org/2001/XMLSchema#long',
-    /** negativeInteger is ·derived· from nonPositiveInteger by setting the value of ·maxInclusive· to be -1.  This results in the standard mathematical concept of the negative integers.  The ·value space· of negativeInteger is the infinite set {...,-2,-1}.  The ·base type· of negativeInteger is nonPositiveInteger. */
-    'negativeInteger': 'http://www.w3.org/2001/XMLSchema#negativeInteger',
-    'nonNegativeInteger': 'http://www.w3.org/2001/XMLSchema#nonNegativeInteger',
-    /** nonPositiveInteger is ·derived· from integer by setting the value of ·maxInclusive· to be 0.  This results in the standard mathematical concept of the non-positive integers. The ·value space· of nonPositiveInteger is the infinite set {...,-2,-1,0}.  The ·base type· of nonPositiveInteger is integer. */
-    'nonPositiveInteger': 'http://www.w3.org/2001/XMLSchema#nonPositiveInteger',
-    /** nonNegativeInteger is ·derived· from integer by setting the value of ·minInclusive· to be 0.  This results in the standard mathematical concept of the non-negative integers. The ·value space· of nonNegativeInteger is the infinite set {0,1,2,...}.  The ·base type· of nonNegativeInteger is integer. */
-    'positiveInteger': 'http://www.w3.org/2001/XMLSchema#positiveInteger',
-    /** short is ·derived· from int by setting the value of ·maxInclusive· to be 32767 and ·minInclusive· to be -32768.  The ·base type· of short is int. */
-    'short': 'http://www.w3.org/2001/XMLSchema#short',
-    /** The string datatype represents character strings in XML. */
-    'string': 'http://www.w3.org/2001/XMLSchema#string',
-    /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */
-    'time': 'http://www.w3.org/2001/XMLSchema#time',
-    /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */
-    'unsignedInt': 'http://www.w3.org/2001/XMLSchema#unsignedInt',
-    /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */
-    'unsignedShort': 'http://www.w3.org/2001/XMLSchema#unsignedShort',
-    /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */
-    'unsingedLong': 'http://www.w3.org/2001/XMLSchema#unsingedLong',
-    /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */
-    'usignedByte': 'http://www.w3.org/2001/XMLSchema#usignedByte',
-};
-/** Namespace URI of the xsd vocabulary. */
-exports._xsd = new n3.NamedNode('http://www.w3.org/2001/XMLSchema#');
-exports.xsd = {
-    /** anyURI represents an Internationalized Resource Identifier Reference (IRI).  An anyURI value can be absolute or relative, and may have an optional fragment identifier (i.e., it may be an IRI Reference).  This type should be used when the value fulfills the role of an IRI, as defined in [RFC 3987] or its successor(s) in the IETF Standards Track. */
-    'anyURI': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#anyURI'),
-    /** base64Binary represents arbitrary Base64-encoded binary data.  For base64Binary data the entire binary stream is encoded using the Base64 Encoding defined in [RFC 3548], which is derived from the encoding described in [RFC 2045]. */
-    'base64Binary': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#base64Binary'),
-    /** boolean represents the values of two-valued logic. */
-    'boolean': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#boolean'),
-    /** byte is ·derived· from short by setting the value of ·maxInclusive· to be 127 and ·minInclusive· to be -128. The ·base type· of byte is short. */
-    'byte': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#byte'),
-    /** date represents top-open intervals of exactly one day in length on the timelines of dateTime, beginning on the beginning moment of each day, up to but not including the beginning moment of the next day).  For non-timezoned values, the top-open intervals disjointly cover the non-timezoned timeline, one per day.  For timezoned values, the intervals begin at every minute and therefore overlap. */
-    'date': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#date'),
-    /** dateTime represents instants of time, optionally marked with a particular time zone offset.  Values representing the same instant but having different time zone offsets are equal but not identical. */
-    'dateTime': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#dateTime'),
-    /** decimal represents a subset of the real numbers, which can be represented by decimal numerals. The ·value space· of decimal is the set of numbers that can be obtained by dividing an integer by a non-negative power of ten, i.e., expressible as i / 10n where i and n are integers and n ≥ 0. Precision is not reflected in this value space; the number 2.0 is not distinct from the number 2.00. The order relation on decimal is the order relation on real numbers, restricted to this subset. */
-    'decimal': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#decimal'),
-    /** The double datatype is patterned after the IEEE double-precision 64-bit floating point datatype [IEEE 754-2008].  Each floating point datatype has a value space that is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
-    'double': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#double'),
-    /** duration is a datatype that represents durations of time.  The concept of duration being captured is drawn from those of [ISO 8601], specifically durations without fixed endpoints. */
-    'duration': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#duration'),
-    /** The float datatype is patterned after the IEEE single-precision 32-bit floating point datatype [IEEE 754-2008].  Its value space is a subset of the rational numbers.  Floating point numbers are often used to approximate arbitrary real numbers. */
-    'float': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#float'),
-    /** int is ·derived· from long by setting the value of ·maxInclusive· to be 2147483647 and ·minInclusive· to be -2147483648.  The ·base type· of int is long. */
-    'int': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#int'),
-    /** integer is ·derived· from decimal by fixing the value of ·fractionDigits· to be 0 and disallowing the trailing decimal point.  This results in the standard mathematical concept of the integer numbers.  The ·value space· of integer is the infinite set {...,-2,-1,0,1,2,...}.  The ·base type· of integer is decimal. */
-    'integer': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#integer'),
-    /** long is ·derived· from integer by setting the value of ·maxInclusive· to be 9223372036854775807 and ·minInclusive· to be -9223372036854775808. The ·base type· of long is integer. */
-    'long': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#long'),
-    /** negativeInteger is ·derived· from nonPositiveInteger by setting the value of ·maxInclusive· to be -1.  This results in the standard mathematical concept of the negative integers.  The ·value space· of negativeInteger is the infinite set {...,-2,-1}.  The ·base type· of negativeInteger is nonPositiveInteger. */
-    'negativeInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#negativeInteger'),
-    'nonNegativeInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#nonNegativeInteger'),
-    /** nonPositiveInteger is ·derived· from integer by setting the value of ·maxInclusive· to be 0.  This results in the standard mathematical concept of the non-positive integers. The ·value space· of nonPositiveInteger is the infinite set {...,-2,-1,0}.  The ·base type· of nonPositiveInteger is integer. */
-    'nonPositiveInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#nonPositiveInteger'),
-    /** nonNegativeInteger is ·derived· from integer by setting the value of ·minInclusive· to be 0.  This results in the standard mathematical concept of the non-negative integers. The ·value space· of nonNegativeInteger is the infinite set {0,1,2,...}.  The ·base type· of nonNegativeInteger is integer. */
-    'positiveInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#positiveInteger'),
-    /** short is ·derived· from int by setting the value of ·maxInclusive· to be 32767 and ·minInclusive· to be -32768.  The ·base type· of short is int. */
-    'short': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#short'),
-    /** The string datatype represents character strings in XML. */
-    'string': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#string'),
-    /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */
-    'time': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#time'),
-    /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */
-    'unsignedInt': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsignedInt'),
-    /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */
-    'unsignedShort': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsignedShort'),
-    /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */
-    'unsingedLong': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsingedLong'),
-    /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */
-    'usignedByte': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#usignedByte'),
-};
-//# sourceMappingURL=xsd.js.map

package/out/ontologies/xsd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"xsd.js","sourceRoot":"","sources":["../../src/ontologies/xsd.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEzB,2CAA2C;AAC9B,QAAA,IAAI,GAAG,mCAAmC,CAAC;AAE3C,QAAA,GAAG,GAAG;IAClB,iWAAiW;IACjW,QAAQ,EAAE,yCAAyC;IACnD,4OAA4O;IAC5O,cAAc,EAAE,+CAA+C;IAC/D,yDAAyD;IACzD,SAAS,EAAE,0CAA0C;IACrD,qJAAqJ;IACrJ,MAAM,EAAE,uCAAuC;IAC/C,gZAAgZ;IAChZ,MAAM,EAAE,uCAAuC;IAC/C,4MAA4M;IAC5M,UAAU,EAAE,2CAA2C;IACvD,4eAA4e;IAC5e,SAAS,EAAE,0CAA0C;IACrD,+RAA+R;IAC/R,QAAQ,EAAE,yCAAyC;IACnD,2LAA2L;IAC3L,UAAU,EAAE,2CAA2C;IACvD,0PAA0P;IAC1P,OAAO,EAAE,wCAAwC;IACjD,gKAAgK;IAChK,KAAK,EAAE,sCAAsC;IAC7C,gUAAgU;IAChU,SAAS,EAAE,0CAA0C;IACrD,yLAAyL;IACzL,MAAM,EAAE,uCAAuC;IAC/C,2TAA2T;IAC3T,iBAAiB,EAAE,kDAAkD;IACrE,oBAAoB,EAAE,qDAAqD;IAC3E,kTAAkT;IAClT,oBAAoB,EAAE,qDAAqD;IAC3E,gTAAgT;IAChT,iBAAiB,EAAE,kDAAkD;IACrE,wJAAwJ;IACxJ,OAAO,EAAE,wCAAwC;IACjD,+DAA+D;IAC/D,QAAQ,EAAE,yCAAyC;IACnD,wIAAwI;IACxI,MAAM,EAAE,uCAAuC;IAC/C,2JAA2J;IAC3J,aAAa,EAAE,8CAA8C;IAC7D,wJAAwJ;IACxJ,eAAe,EAAE,gDAAgD;IACjE,mLAAmL;IACnL,cAAc,EAAE,+CAA+C;IAC/D,wJAAwJ;IACxJ,aAAa,EAAE,8CAA8C;CAC7D,CAAA;AAED,2CAA2C;AAC9B,QAAA,IAAI,GAAG,IAAI,EAAE,CAAC,SAAS,CAAC,mCAAmC,CAAC,CAAC;AAE7D,QAAA,GAAG,GAAG;IAClB,iWAAiW;IACjW,QAAQ,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,yCAAyC,CAAC;IACrE,4OAA4O;IAC5O,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IACjF,yDAAyD;IACzD,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,0CAA0C,CAAC;IACvE,qJAAqJ;IACrJ,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uCAAuC,CAAC;IACjE,gZAAgZ;IAChZ,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uCAAuC,CAAC;IACjE,4MAA4M;IAC5M,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,2CAA2C,CAAC;IACzE,4eAA4e;IAC5e,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,0CAA0C,CAAC;IACvE,+RAA+R;IAC/R,QAAQ,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,yCAAyC,CAAC;IACrE,2LAA2L;IAC3L,UAAU,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,2CAA2C,CAAC;IACzE,0PAA0P;IAC1P,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,wCAAwC,CAAC;IACnE,gKAAgK;IAChK,KAAK,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,sCAAsC,CAAC;IAC/D,gUAAgU;IAChU,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,0CAA0C,CAAC;IACvE,yLAAyL;IACzL,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uCAAuC,CAAC;IACjE,2TAA2T;IAC3T,iBAAiB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;IACvF,oBAAoB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qDAAqD,CAAC;IAC7F,kTAAkT;IAClT,oBAAoB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,qDAAqD,CAAC;IAC7F,gTAAgT;IAChT,iBAAiB,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,kDAAkD,CAAC;IACvF,wJAAwJ;IACxJ,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,wCAAwC,CAAC;IACnE,+DAA+D;IAC/D,QAAQ,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,yCAAyC,CAAC;IACrE,wIAAwI;IACxI,MAAM,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,uCAAuC,CAAC;IACjE,2JAA2J;IAC3J,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;IAC/E,wJAAwJ;IACxJ,eAAe,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,gDAAgD,CAAC;IACnF,mLAAmL;IACnL,cAAc,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,+CAA+C,CAAC;IACjF,wJAAwJ;IACxJ,aAAa,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,8CAA8C,CAAC;CAC/E,CAAA"}

package/out/rdf/class-repository.js

@@ -1,324 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ClassRepository = void 0;
-const tslib_1 = require("tslib");
-const n3 = tslib_1.__importStar(require("n3"));
-const ontologies_1 = require("../ontologies");
-const concept_repository_1 = require("./concept-repository");
-/**
- * A repository for retrieving classes from graphs.
- */
-class ClassRepository extends concept_repository_1.ConceptRepository {
-    constructor(store) { super(store); }
-    /**
-     * 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, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-            if (!this.skip(graphUris, q.subject, options)) {
-                result.add(q.subject.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, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-            if (!this.skip(graphUris, q.object, options)) {
-                result.add(q.object.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.
-     * @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.
-     */
-    _getRootClassPath(graphUris, subjectUri, path, backtrack, options) {
-        const superClasses = this.getSuperClasses(graphUris, subjectUri, options);
-        for (let o of superClasses.filter(o => !backtrack.has(o))) {
-            return this._getRootClassPath(graphUris, o, [...path, o], backtrack, options);
-        }
-        return path;
-    }
-    /**
-     * 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, 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)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * 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, subjectUri, options) {
-        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, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-                if (!this.skip(graphUris, q.subject, options)) {
-                    result.add(q.subject.value);
-                }
-            }
-            return Array.from(result);
-        }
-        else {
-            return this.getRootClasses(graphUris, options);
-        }
-    }
-    /**
-     * Recursively traverse all sub classes of a given class and invoke a callback.
-     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-     * @param superClass The super class to start the traversal from.
-     * @param callback A function to call for each sub class. If the function returns `false`, the traversal stops.
-     * @param options Optional query parameters.
-     * @param visited A set of visited URIs.
-     * @returns `true` if the traversal was completed, `false` if it was stopped by the callback.
-     */
-    _traverseSubClasses(graphUris, superClass, callback, options, visited = new Set()) {
-        // Enumerate all sub classes of the given super class.
-        for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, superClass, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-            // If it is not skipped and has not been visited yet, we call the callback function.
-            if (!this.skip(graphUris, q.subject, options) && !visited.has(q.subject.value)) {
-                visited.add(q.subject.value);
-                // If the callback returns false, we stop the traversal.
-                if (callback(q.subject)) {
-                    this._traverseSubClasses(graphUris, q.subject, callback, options, visited);
-                }
-                else {
-                    return false;
-                }
-            }
-        }
-        return true;
-    }
-    /**
-     * Get all sub classes of a given class, including indirect sub classes.
-     * @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 all sub classes of the given class.
-     */
-    getAllSubClasses(graphUris, subjectUri, options) {
-        const result = new Set();
-        this._traverseSubClasses(graphUris, n3.DataFactory.namedNode(subjectUri), s => { result.add(s.value); return true; }, options);
-        return Array.from(result);
-    }
-    /**
-     * Indicate if there are instances of a given class or any of its sub classes.
-     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-     * @param typeUri URI of the class.
-     * @param options Optional query parameters.
-     * @returns `true` if the class has instances, `false` otherwise.
-     */
-    hasSubjectsOfType(graphUris, typeUri, options) {
-        // TODO: Optimize implementation.
-        return this.getSubjectsOfType(graphUris, typeUri, options).length > 0;
-    }
-    /**
-     * Get all subjects of a given class in the repository.
-     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.
-     * @param typeUri URI of the class.
-     * @param options Optional query parameters.
-     * @returns A list of all shapes in the repository.
-     */
-    getSubjectsOfType(graphUris, typeUri, options) {
-        const result = new Set();
-        if ((options === null || options === void 0 ? void 0 : options.includeSubTypes) === false) {
-            // 1. Get all subclasses of the given type from the repository -> ClassRepository.
-            const subclasses = new Set(this.getAllSubClasses(graphUris, typeUri));
-            // 2. Then get all triples that have a rdf:type predicate.
-            //  a) if the object matches the given type, add it to the result.
-            //  b) if the object is a subclass of the given type, remove it from the result.
-            const filtered = new Set();
-            for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, null, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-                if (q.object.value == typeUri && !this.skip(graphUris, q.subject, options)) {
-                    result.add(q.subject.value);
-                }
-                else if (subclasses.has(q.object.value)) {
-                    filtered.add(q.subject.value);
-                }
-            }
-            return Array.from(result).filter(x => !filtered.has(x));
-        }
-        else {
-            // TODO: This does not explicitly check the sub classes. Implement a unit test.
-            for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, new n3.NamedNode(typeUri), options === null || options === void 0 ? void 0 : options.includeInferred)) {
-                if (!this.skip(graphUris, q.subject, options)) {
-                    result.add(q.subject.value);
-                }
-            }
-            return Array.from(result);
-        }
-    }
-    /**
-     * 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 the sub class.
-     * @param classUri URI of the super 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, options) {
-        return this.getRootClassPath(graphUris, subjectUri, options).includes(classUri);
-    }
-    /**
-     * Indicate if a given class is the intersection of classes.
-     * @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.
-     */
-    isIntersectionOfClasses(graphUris, subjectUri) {
-        const s = n3.DataFactory.namedNode(subjectUri);
-        if (this._isIntersectionOfClasses(graphUris, s)) {
-            return true;
-        }
-        // 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;
-            }
-        }
-        return false;
-    }
-    _isIntersectionOfClasses(graphUris, subject) {
-        if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {
-            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.intersectionOf, null, false)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Indicate if a given class is a (disjoint) union of classes.
-     * @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, subjectUri) {
-        const s = n3.DataFactory.namedNode(subjectUri);
-        if (this._isUnionOfClasses(graphUris, s)) {
-            return true;
-        }
-        // 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;
-            }
-        }
-        return false;
-    }
-    _isUnionOfClasses(graphUris, subject) {
-        if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {
-            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, null, false)) {
-                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) {
-        var _a;
-        const result = new Set();
-        const classes = new Set(this.getClasses(graphUris, options));
-        for (let c of classes) {
-            let hasSuperClass = false;
-            for (let q of this.store.match(graphUris, new n3.NamedNode(c), ontologies_1.rdfs.subClassOf, null, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-                const includeReferenced = (_a = options === null || options === void 0 ? void 0 : options.includeReferenced) !== null && _a !== void 0 ? _a : false;
-                const skip = this.skip(graphUris, q.object, options);
-                // Do not skip the super property if it is only referenced and the includeReferenced option is set.
-                if (q.object.termType != "NamedNode" || skip && (!includeReferenced || includeReferenced && this.hasSubject(graphUris, q.object.value))) {
-                    continue;
-                }
-                hasSuperClass = true;
-                // If we have a super property that is not in the list of properties and not excluded by the options, we add it to the result.
-                if (!classes.has(q.object.value)) {
-                    result.add(q.object.value);
-                }
-                break;
-            }
-            if (!hasSuperClass) {
-                result.add(c);
-            }
-        }
-        return Array.from(result);
-    }
-    /**
-     * 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, 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, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-            return true;
-        }
-        return false;
-    }
-    /**
-     * 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, options) {
-        const s = n3.DataFactory.namedNode(classUri);
-        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, s, options === null || options === void 0 ? void 0 : options.includeInferred)) {
-            if (!this.skip(graphUris, q.subject, options)) {
-                return true;
-            }
-        }
-        for (let c of this.getSubClasses(graphUris, classUri, options)) {
-            if (this.hasIndividuals(graphUris, c)) {
-                return true;
-            }
-        }
-        return false;
-    }
-}
-exports.ClassRepository = ClassRepository;
-//# sourceMappingURL=class-repository.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"class-repository.js","sourceRoot":"","sources":["../../src/rdf/class-repository.ts"],"names":[],"mappings":";;;;AAAA,+CAAyB;AAEzB,8CAA+C;AAG/C,6DAAyD;AAEzD;;GAEG;AACH,MAAa,eAAgB,SAAQ,sCAAiB;IAClD,YAAY,KAAY,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE3C;;;;;OAKG;IACH,UAAU,CAAC,SAAwC,EAAE,OAAgC;QACjF,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,CAAC;YAC9F,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAAgC;QAC1G,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,CAAC;YAC5F,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAAgC;QAC3G,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,OAAgC;QAC5J,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,CAAC;YACxD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAClF,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAAgC;QACxG,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,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC;YAClE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC5C,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,SAAwC,EAAE,UAAmB,EAAE,OAAgC;QACzG,IAAI,UAAU,EAAE,CAAC;YACb,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,CAAC;gBAC5F,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;oBAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACnD,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACK,mBAAmB,CAAC,SAAwC,EAAE,UAAwB,EAAE,QAAsC,EAAE,OAAgC,EAAE,UAAuB,IAAI,GAAG,EAAU;QAC9M,sDAAsD;QACtD,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,iBAAI,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE,CAAC;YACrG,oFAAoF;YACpF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7E,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAE7B,wDAAwD;gBACxD,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;oBACtB,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC/E,CAAC;qBAAM,CAAC;oBACJ,OAAO,KAAK,CAAC;gBACjB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,gBAAgB,CAAC,SAAwC,EAAE,UAAkB,EAAE,OAAgC;QAC3G,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;QAE9H,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,iBAAiB,CAAC,SAAwC,EAAE,OAAe,EAAE,OAA4D;QACrI,iCAAiC;QACjC,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1E,CAAC;IAED;;;;;;OAMG;IACH,iBAAiB,CAAC,SAAwC,EAAE,OAAe,EAAE,OAA4D;QACrI,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,IAAI,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,MAAK,KAAK,EAAE,CAAC;YACrC,kFAAkF;YAClF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YAE9E,0DAA0D;YAC1D,kEAAkE;YAClE,gFAAgF;YAChF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YAEnC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE,CAAC;gBACxF,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;oBACzE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;qBAAM,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;gBACjC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACJ,+EAA+E;YAC/E,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAG,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE,CAAC;gBAC7G,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;oBAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,SAAwC,EAAE,UAAkB,EAAE,QAAgB,EAAE,OAAgC;QACzH,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,CAAC;YAC9C,OAAO,IAAI,CAAC;QAChB,CAAC;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,CAAC;YAC7E,IAAI,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrD,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;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,CAAC;YACrE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAClF,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;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,CAAC;YACvC,OAAO,IAAI,CAAC;QAChB,CAAC;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,CAAC;YAC7E,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;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,CAAC;YACrE,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3E,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,gBAAG,CAAC,eAAe,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACnF,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,SAAwC,EAAE,OAAgC;;QAC5F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;QAErE,KAAK,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YACpB,IAAI,aAAa,GAAG,KAAK,CAAC;YAE1B,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAI,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,eAAe,CAAC,EAAE,CAAC;gBAC9G,MAAM,iBAAiB,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,iBAAiB,mCAAI,KAAK,CAAC;gBAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAErD,mGAAmG;gBACnG,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,IAAI,WAAW,IAAI,IAAI,IAAI,CAAC,CAAC,iBAAiB,IAAI,iBAAiB,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtI,SAAS;gBACb,CAAC;gBAED,aAAa,GAAG,IAAI,CAAC;gBAErB,8HAA8H;gBAC9H,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC/B,CAAC;gBAED,MAAM;YACV,CAAC;YAED,IAAI,CAAC,aAAa,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,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,CAAC;YAChG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,cAAc,CAAC,SAAwC,EAAE,QAAgB,EAAE,OAAgC;QAC9G,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,CAAC;YACrF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC5C,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;YAC7D,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpC,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AA7WD,0CA6WC"}