@faubulous/mentor-rdf 0.2.46 → 0.2.47

package/out/index.js

@@ -1,6 +1,925 @@
+/*
+ * ATTENTION: The "eval" devtool has been used (maybe by default in mode: "development").
+ * This devtool is neither made for production nor for readable output files.
+ * It uses "eval()" calls to create a separate source file in the browser devtools.
+ * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)
+ * or disable the default devtool with "devtool: false".
+ * If you are looking for production-ready output files, see mode: "production" (https://webpack.js.org/configuration/mode/).
+ */
+/******/ (() => { // webpackBootstrap
+/******/ 	var __webpack_modules__ = ({
+
+/***/ "./node_modules/abort-controller/browser.js":
+/*!**************************************************!*\
+  !*** ./node_modules/abort-controller/browser.js ***!
+  \**************************************************/
+/***/ ((module) => {
+
 "use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-tslib_1.__exportStar(require("./ontologies"), exports);
-tslib_1.__exportStar(require("./rdf"), exports);
-//# sourceMappingURL=index.js.map
+eval("/*globals self, window */\n\n\n/*eslint-disable @mysticatea/prettier */\nconst { AbortController, AbortSignal } =\n    typeof self !== \"undefined\" ? self :\n    typeof window !== \"undefined\" ? window :\n    /* otherwise */ undefined\n/*eslint-enable @mysticatea/prettier */\n\nmodule.exports = AbortController\nmodule.exports.AbortSignal = AbortSignal\nmodule.exports[\"default\"] = AbortController\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/abort-controller/browser.js?");
+
+/***/ }),
+
+/***/ "./node_modules/base64-js/index.js":
+/*!*****************************************!*\
+  !*** ./node_modules/base64-js/index.js ***!
+  \*****************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+eval("\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/base64-js/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/buffer/index.js":
+/*!**************************************!*\
+  !*** ./node_modules/buffer/index.js ***!
+  \**************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n\n\nconst base64 = __webpack_require__(/*! base64-js */ \"./node_modules/base64-js/index.js\")\nconst ieee754 = __webpack_require__(/*! ieee754 */ \"./node_modules/ieee754/index.js\")\nconst customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    const arr = new Uint8Array(1)\n    const proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  const buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  const valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  const b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  const length = byteLength(string, encoding) | 0\n  let buf = createBuffer(length)\n\n  const actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0\n  const buf = createBuffer(length)\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  let buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0\n    const buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  let x = a.length\n  let y = b.length\n\n  for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  let i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  const buffer = Buffer.allocUnsafe(length)\n  let pos = 0\n  for (i = 0; i < list.length; ++i) {\n    let buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n        buf.copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  const len = string.length\n  const mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  let loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  const i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  const len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (let i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  const len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (let i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  const len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (let i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  const length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  let str = ''\n  const max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  let x = thisEnd - thisStart\n  let y = end - start\n  const len = Math.min(x, y)\n\n  const thisCopy = this.slice(thisStart, thisEnd)\n  const targetCopy = target.slice(start, end)\n\n  for (let i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1\n  let arrLength = arr.length\n  let valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  let i\n  if (dir) {\n    let foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  const remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  const strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  let i\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  const remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  let loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  const res = []\n\n  let i = start\n  while (i < end) {\n    const firstByte = buf[i]\n    let codePoint = null\n    let bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  const len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = ''\n  let i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  let ret = ''\n  end = Math.min(buf.length, end)\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  const len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  let out = ''\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  const bytes = buf.slice(start, end)\n  let res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  const len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  const newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  let val = this[offset + --byteLength]\n  let mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const lo = first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24\n\n  const hi = this[++offset] +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    last * 2 ** 24\n\n  return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const hi = first * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  const lo = this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last\n\n  return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let val = this[offset]\n  let mul = 1\n  let i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  let i = byteLength\n  let mul = 1\n  let val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  const val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = this[offset + 4] +\n    this[offset + 5] * 2 ** 8 +\n    this[offset + 6] * 2 ** 16 +\n    (last << 24) // Overflow\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(first +\n    this[++offset] * 2 ** 8 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n  offset = offset >>> 0\n  validateNumber(offset, 'offset')\n  const first = this[offset]\n  const last = this[offset + 7]\n  if (first === undefined || last === undefined) {\n    boundsError(offset, this.length - 8)\n  }\n\n  const val = (first << 24) + // Overflow\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    this[++offset]\n\n  return (BigInt(val) << BigInt(32)) +\n    BigInt(this[++offset] * 2 ** 24 +\n    this[++offset] * 2 ** 16 +\n    this[++offset] * 2 ** 8 +\n    last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let mul = 1\n  let i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    const maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  lo = lo >> 8\n  buf[offset++] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  hi = hi >> 8\n  buf[offset++] = hi\n  return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7)\n\n  let lo = Number(value & BigInt(0xffffffff))\n  buf[offset + 7] = lo\n  lo = lo >> 8\n  buf[offset + 6] = lo\n  lo = lo >> 8\n  buf[offset + 5] = lo\n  lo = lo >> 8\n  buf[offset + 4] = lo\n  let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n  buf[offset + 3] = hi\n  hi = hi >> 8\n  buf[offset + 2] = hi\n  hi = hi >> 8\n  buf[offset + 1] = hi\n  hi = hi >> 8\n  buf[offset] = hi\n  return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = 0\n  let mul = 1\n  let sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    const limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  let i = byteLength - 1\n  let mul = 1\n  let sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n  return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n  return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  const len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      const code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  let i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    const bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    const len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor () {\n      super()\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      })\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name\n    }\n\n    get code () {\n      return sym\n    }\n\n    set code (value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      })\n    }\n\n    toString () {\n      return `${this.name} [${sym}]: ${this.message}`\n    }\n  }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`\n    }\n\n    return 'Attempt to access memory outside buffer bounds'\n  }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n  }, TypeError)\nE('ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`\n    let received = input\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    }\n    msg += ` It must be ${range}. Received ${received}`\n    return msg\n  }, RangeError)\n\nfunction addNumericalSeparator (val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n  validateNumber(offset, 'offset')\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1))\n  }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : ''\n    let range\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n      } else {\n        range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n                `${(byteLength + 1) * 8 - 1}${n}`\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n  }\n  checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n}\n\nfunction boundsError (value, length, type) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type)\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n                                    `>= ${type ? 1 : 0} and <= ${length}`,\n                                    value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  let codePoint\n  const length = string.length\n  let leadSurrogate = null\n  const bytes = []\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  let c, hi, lo\n  const byteArray = []\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  let i\n  for (i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef'\n  const table = new Array(256)\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n  return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n  throw new Error('BigInt not supported')\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/buffer/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/events/events.js":
+/*!***************************************!*\
+  !*** ./node_modules/events/events.js ***!
+  \***************************************/
+/***/ ((module) => {
+
+"use strict";
+eval("// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/events/events.js?");
+
+/***/ }),
+
+/***/ "./node_modules/ieee754/index.js":
+/*!***************************************!*\
+  !*** ./node_modules/ieee754/index.js ***!
+  \***************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+eval("/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/ieee754/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/millan/dist/millan.js":
+/*!********************************************!*\
+  !*** ./node_modules/millan/dist/millan.js ***!
+  \********************************************/
+/***/ (function(module) {
+
+eval("!function(t,e){ true?module.exports=e():0}(\"undefined\"!=typeof self?self:this,function(){return function(t){var e={};function n(r){if(e[r])return e[r].exports;var i=e[r]={i:r,l:!1,exports:{}};return t[r].call(i.exports,i,i.exports,n),i.l=!0,i.exports}return n.m=t,n.c=e,n.d=function(t,e,r){n.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:r})},n.r=function(t){\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(t,\"__esModule\",{value:!0})},n.t=function(t,e){if(1&e&&(t=n(t)),8&e)return t;if(4&e&&\"object\"==typeof t&&t&&t.__esModule)return t;var r=Object.create(null);if(n.r(r),Object.defineProperty(r,\"default\",{enumerable:!0,value:t}),2&e&&\"string\"!=typeof t)for(var i in t)n.d(r,i,function(e){return t[e]}.bind(null,i));return r},n.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return n.d(e,\"a\",e),e},n.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},n.p=\"\",n(n.s=72)}([function(t,e,n){\"use strict\";n.r(e);var r=n(1),i=function(){return(i=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},o=function(t,e){var n={};for(var r in t)Object.prototype.hasOwnProperty.call(t,r)&&e.indexOf(r)<0&&(n[r]=t[r]);if(null!=t&&\"function\"==typeof Object.getOwnPropertySymbols){var i=0;for(r=Object.getOwnPropertySymbols(t);i<r.length;i++)e.indexOf(r[i])<0&&(n[r[i]]=t[r[i]])}return n};n.d(e,\"createKeyword\",function(){return s}),n.d(e,\"keywords\",function(){return l});var a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=function(t,e){var n={};for(var r in t)Object.prototype.hasOwnProperty.call(t,r)&&e.indexOf(r)<0&&(n[r]=t[r]);if(null!=t&&\"function\"==typeof Object.getOwnPropertySymbols){var i=0;for(r=Object.getOwnPropertySymbols(t);i<r.length;i++)e.indexOf(r[i])<0&&(n[r[i]]=t[r[i]])}return n},s=function(t){var e=t.longer_alt,n=void 0===e?c:e,s=u(t,[\"longer_alt\"]);return function(t){var e=t.name,n=t.pattern,a=o(t,[\"name\",\"pattern\"]);return Object(r.createToken)(i({name:e,pattern:n||new RegExp(e,\"i\")},a))}(a({longer_alt:n},s))},c=Object(r.createToken)({name:\"UNKNOWN\",pattern:/\\w+/i}),l={SELECT:s({name:\"SELECT\"}),CONSTRUCT:s({name:\"CONSTRUCT\"}),DISTINCT:s({name:\"DISTINCT\"}),START:s({name:\"START\"}),END:s({name:\"END\"}),VIA:s({name:\"VIA\"}),PATHS:s({name:\"PATHS\"}),PATHS_ALL:s({name:\"PATHS_ALL\",pattern:/PATHS ALL/i}),PATHS_SHORTEST:s({name:\"PATHS_SHORTEST\",pattern:/PATHS SHORTEST/i}),CYCLIC:s({name:\"CYCLIC\"}),AS:s({name:\"AS\"}),WHERE:s({name:\"WHERE\"}),A:s({name:\"A\",pattern:/a/}),GROUP_BY:s({name:\"GROUP_BY\",pattern:/GROUP BY/i}),ORDER_BY:s({name:\"ORDER_BY\",pattern:/ORDER BY/i}),BY:s({name:\"BY\"}),BASE:s({name:\"BASE\"}),PREFIX:s({name:\"PREFIX\"}),DESCRIBE:s({name:\"DESCRIBE\"}),ASK:s({name:\"ASK\"}),FROM:s({name:\"FROM\"}),REDUCED:s({name:\"REDUCED\"}),NAMED:s({name:\"NAMED\"}),HAVING:s({name:\"HAVING\"}),ASC:s({name:\"ASC\"}),DESC:s({name:\"DESC\"}),OFFSET:s({name:\"OFFSET\"}),LIMIT:s({name:\"LIMIT\"}),VALUES:s({name:\"VALUES\"}),LOAD:s({name:\"LOAD\"}),SILENT:s({name:\"SILENT\"}),INTO:s({name:\"INTO\"}),CLEAR:s({name:\"CLEAR\"}),DROP:s({name:\"DROP\"}),CREATE:s({name:\"CREATE\"}),ADD:s({name:\"ADD\"}),TO:s({name:\"TO\"}),MOVE:s({name:\"MOVE\"}),COPY:s({name:\"COPY\"}),INSERT_DATA:s({name:\"INSERT_DATA\",pattern:/INSERT +DATA/i}),DELETE_DATA:s({name:\"DELETE_DATA\",pattern:/DELETE +DATA/i}),DELETE_WHERE:s({name:\"DELETE_WHERE\",pattern:/DELETE +WHERE/i}),WITH:s({name:\"WITH\"}),DELETE:s({name:\"DELETE\"}),INSERT:s({name:\"INSERT\"}),USING:s({name:\"USING\"}),DEFAULT:s({name:\"DEFAULT\"}),GRAPH:s({name:\"GRAPH\"}),ALL:s({name:\"ALL\"}),OPTIONAL:s({name:\"OPTIONAL\"}),SERVICE:s({name:\"SERVICE\"}),BIND:s({name:\"BIND\"}),UNNEST:s({name:\"UNNEST\"}),UNDEF:s({name:\"UNDEF\"}),MINUS:s({name:\"MINUS\"}),UNION:s({name:\"UNION\"}),FILTER:s({name:\"FILTER\"}),STR:s({name:\"STR\"}),LANG:s({name:\"LANG\"}),LANGMATCHES:s({name:\"LANGMATCHES\"}),DATATYPE:s({name:\"DATATYPE\"}),BOUND:s({name:\"BOUND\"}),IRI:s({name:\"IRI\"}),URI:s({name:\"URI\"}),BNODE:s({name:\"BNODE\"}),RAND:s({name:\"RAND\"}),ABS:s({name:\"ABS\"}),CEIL:s({name:\"CEIL\"}),FLOOR:s({name:\"FLOOR\"}),ROUND:s({name:\"ROUND\"}),CONCAT:s({name:\"CONCAT\"}),STRLEN:s({name:\"STRLEN\"}),UCASE:s({name:\"UCASE\"}),LCASE:s({name:\"LCASE\"}),ENCODE_FOR_URI:s({name:\"ENCODE_FOR_URI\"}),CONTAINS:s({name:\"CONTAINS\"}),STRSTARTS:s({name:\"STRSTARTS\"}),STRENDS:s({name:\"STRENDS\"}),STRBEFORE:s({name:\"STRBEFORE\"}),STRAFTER:s({name:\"STRAFTER\"}),YEAR:s({name:\"YEAR\"}),MONTH:s({name:\"MONTH\"}),DAY:s({name:\"DAY\"}),HOURS:s({name:\"HOURS\"}),MINUTES:s({name:\"MINUTES\"}),SECONDS:s({name:\"SECONDS\"}),TIMEZONE:s({name:\"TIMEZONE\"}),TZ:s({name:\"TZ\"}),NOW:s({name:\"NOW\"}),UUID:s({name:\"UUID\"}),STRUUID:s({name:\"STRUUID\"}),MD5:s({name:\"MD5\"}),SHA1:s({name:\"SHA1\"}),SHA256:s({name:\"SHA256\"}),SHA384:s({name:\"SHA384\"}),SHA512:s({name:\"SHA512\"}),COALESCE:s({name:\"COALESCE\"}),IF:s({name:\"IF\"}),STRLANG:s({name:\"STRLANG\"}),STRDT:s({name:\"STRDT\"}),sameTerm:s({name:\"sameTerm\"}),isIRI:s({name:\"isIRI\"}),isURI:s({name:\"isURI\"}),isBLANK:s({name:\"isBLANK\"}),isLITERAL:s({name:\"isLITERAL\"}),isNUMERIC:s({name:\"isNUMERIC\"}),REGEX:s({name:\"REGEX\"}),SUBSTR:s({name:\"SUBSTR\"}),REPLACE:s({name:\"REPLACE\"}),EXISTS:s({name:\"EXISTS\"}),NOT_EXISTS:s({name:\"NOT_EXISTS\",pattern:/NOT EXISTS/i}),COUNT:s({name:\"COUNT\"}),SUM:s({name:\"SUM\"}),MIN:s({name:\"MIN\"}),AVG:s({name:\"AVG\"}),SAMPLE:s({name:\"SAMPLE\"}),GROUP_CONCAT:s({name:\"GROUP_CONCAT\"}),SEPARATOR:s({name:\"SEPARATOR\"}),TRUE:s({name:\"TRUE\"}),FALSE:s({name:\"FALSE\"}),IN:s({name:\"IN\"}),NOT_IN:s({name:\"NOT_IN\",pattern:/NOT IN/i}),MAX_LENGTH:s({name:\"MAX_LENGTH\",pattern:/MAX LENGTH/i}),MAX:s({name:\"MAX\"}),VALIDATE:s({name:\"VALIDATE\"}),SHAPES:s({name:\"SHAPES\"}),SHAPE:s({name:\"SHAPE\"}),PER:s({name:\"PER\"}),UNKNOWN:c}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(8),i=n(23),o=n(7),a=n(13),u=n(25),s=n(17),c=n(50),l=n(11),E=n(6),p=n(33),f=n(51),L=n(29),S={};S.VERSION=u.VERSION,S.Parser=r.Parser,S.CstParser=r.CstParser,S.EmbeddedActionsParser=r.EmbeddedActionsParser;S.ParserDefinitionErrorType=r.ParserDefinitionErrorType,S.Lexer=i.Lexer,S.LexerDefinitionErrorType=i.LexerDefinitionErrorType,S.EOF=o.EOF,S.tokenName=o.tokenName,S.tokenLabel=o.tokenLabel,S.tokenMatcher=o.tokenMatcher,S.createToken=o.createToken,S.createTokenInstance=o.createTokenInstance,S.EMPTY_ALT=r.EMPTY_ALT,S.defaultParserErrorProvider=s.defaultParserErrorProvider,S.isRecognitionException=a.isRecognitionException,S.EarlyExitException=a.EarlyExitException,S.MismatchedTokenException=a.MismatchedTokenException,S.NotAllInputParsedException=a.NotAllInputParsedException,S.NoViableAltException=a.NoViableAltException,S.defaultLexerErrorProvider=L.defaultLexerErrorProvider,S.Flat=E.Flat,S.Repetition=E.Repetition,S.RepetitionWithSeparator=E.RepetitionWithSeparator,S.RepetitionMandatory=E.RepetitionMandatory,S.RepetitionMandatoryWithSeparator=E.RepetitionMandatoryWithSeparator,S.Option=E.Option,S.Alternation=E.Alternation,S.NonTerminal=E.NonTerminal,S.Terminal=E.Terminal,S.Rule=E.Rule,S.GAstVisitor=l.GAstVisitor,S.serializeGrammar=E.serializeGrammar,S.serializeProduction=E.serializeProduction,S.resolveGrammar=p.resolveGrammar,S.defaultGrammarResolverErrorProvider=s.defaultGrammarResolverErrorProvider,S.validateGrammar=p.validateGrammar,S.defaultGrammarValidatorErrorProvider=s.defaultGrammarValidatorErrorProvider,S.assignOccurrenceIndices=p.assignOccurrenceIndices,S.clearCache=function(){console.warn(\"The clearCache function was 'soft' removed from the Chevrotain API.\\n\\t It performs no action other than printing this message.\\n\\t Please avoid using it as it will be completely removed in the future\")},S.createSyntaxDiagramsCode=c.createSyntaxDiagramsCode,S.generateParserFactory=f.generateParserFactory,S.generateParserModule=f.generateParserModule,t.exports=S},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return r});var r={or:function(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return new RegExp(t.map(function(t){return\"(\"+t.source+\")\"}).join(\"|\"))},and:function(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return new RegExp(t.map(function(t){return\"(\"+t.source+\")\"}).join(\"\"))},option:function(t){return new RegExp(\"(\"+t.source+\")?\")},many:function(t){return new RegExp(\"(\"+t.source+\")*\")}}},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"CATCH_ALL\",function(){return i}),n.d(e,\"CATCH_ALL_AT_LEAST_ONE\",function(){return o}),n.d(e,\"IRIREF\",function(){return a}),n.d(e,\"PN_CHARS_BASE\",function(){return u}),n.d(e,\"LANGTAG\",function(){return s}),n.d(e,\"INTEGER\",function(){return c}),n.d(e,\"DECIMAL\",function(){return l}),n.d(e,\"EXPONENT\",function(){return E}),n.d(e,\"ECHAR\",function(){return p}),n.d(e,\"WS\",function(){return f}),n.d(e,\"HEX\",function(){return L}),n.d(e,\"PN_LOCAL_ESC\",function(){return S}),n.d(e,\"PN_CHARS_U\",function(){return h}),n.d(e,\"PN_CHARS\",function(){return T}),n.d(e,\"PN_PREFIX\",function(){return U}),n.d(e,\"PERCENT\",function(){return R}),n.d(e,\"PLX\",function(){return d}),n.d(e,\"PN_LOCAL\",function(){return O}),n.d(e,\"VARNAME\",function(){return N}),n.d(e,\"ANON\",function(){return A}),n.d(e,\"NIL\",function(){return m}),n.d(e,\"STRING_LITERAL1\",function(){return C}),n.d(e,\"STRING_LITERAL2\",function(){return I}),n.d(e,\"STRING_LITERAL_LONG1\",function(){return y}),n.d(e,\"STRING_LITERAL_LONG2\",function(){return _}),n.d(e,\"DOUBLE\",function(){return P}),n.d(e,\"INTEGER_POSITIVE\",function(){return v}),n.d(e,\"DECIMAL_POSITIVE\",function(){return M}),n.d(e,\"DOUBLE_POSITIVE\",function(){return g}),n.d(e,\"INTEGER_NEGATIVE\",function(){return B}),n.d(e,\"DECIMAL_NEGATIVE\",function(){return k}),n.d(e,\"DOUBLE_NEGATIVE\",function(){return D}),n.d(e,\"VAR1\",function(){return b}),n.d(e,\"VAR2\",function(){return x}),n.d(e,\"BLANK_NODE_LABEL\",function(){return F}),n.d(e,\"PNAME_NS\",function(){return G}),n.d(e,\"PNAME_LN\",function(){return w});var r=n(2),i=/[\\s\\S]*/,o=/[\\s\\S]+/,a=/<[^<>\\\\{}|\\^`\\u0000-\\u0020]*>/,u=/[A-Za-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD]|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/,s=/@[a-zA-Z]+(-[a-zA-Z0-9]+)*/,c=/\\d+/,l=/(\\d*\\.\\d+)|(\\d+\\.\\d*)/,E=/[eE][+-]?\\d+/,p=/\\\\[tbnrf\"'\\\\]/,f=/[\\u0020\\u0009\\u000d\\u000a]/,L=/[0-9A-Fa-f]/,S=/\\\\[_~.\\-!\\$&'()*+,=\\/?#@%;]/,h=r.a.or(u,/_/),T=r.a.or(h,/-/,/\\d/,/\\u00b7/,/[\\u0300-\\u036f]/,/[\\u203f-\\u2040]/),U=r.a.and(u,r.a.option(r.a.and(r.a.many(r.a.or(T,/\\./)),T))),R=r.a.and(/%/,L,L),d=r.a.or(R,S),O=r.a.and(r.a.or(h,/:/,/\\d/,d),r.a.option(r.a.and(r.a.many(r.a.or(T,/\\./,/:/,d)),r.a.or(T,/:/,d)))),N=r.a.and(r.a.or(h,/\\d/),r.a.many(r.a.or(h,/\\d/,/\\u00b7/,/[\\u0300-\\u036f]/,/[\\u203f-\\u2040]/))),A=r.a.and(/\\[/,r.a.many(f),/\\]/),m=r.a.and(/\\(/,r.a.many(f),/\\)/),C=r.a.and(/'/,r.a.many(r.a.or(/[^\\u0027\\u005C\\u000A\\u000D]/,p)),/'/),I=r.a.and(/\"/,r.a.many(r.a.or(/[^\\u0022\\u005C\\u000A\\u000D]/,p)),/\"/),y=r.a.and(/'''/,r.a.many(r.a.and(r.a.option(r.a.or(/'/,/''/)),r.a.or(/[^'\\\\]/,p))),/'''/),_=r.a.and(/\"\"\"/,r.a.many(r.a.and(r.a.option(r.a.or(/\"/,/\"\"/)),r.a.or(/[^\"\\\\]/,p))),/\"\"\"/),P=r.a.or(r.a.and(/\\d+\\.\\d*/,E),r.a.and(/\\.\\d+/,E),r.a.and(/\\d+/,E)),v=r.a.and(/\\+/,c),M=r.a.and(/\\+/,l),g=r.a.and(/\\+/,P),B=r.a.and(/-/,c),k=r.a.and(/-/,l),D=r.a.and(/-/,P),b=r.a.and(/\\?/,N),x=r.a.and(/\\$/,N),F=r.a.and(/_:/,r.a.or(h,/\\d/),r.a.option(r.a.and(r.a.many(r.a.or(T,/\\./)),T))),G=r.a.and(r.a.option(U),/:/),w=r.a.and(G,O)},function(t,e,n){\"use strict\";function r(t){return t&&0===t.length}function i(t){return null==t?[]:Object.keys(t)}function o(t){for(var e=[],n=Object.keys(t),r=0;r<n.length;r++)e.push(t[n[r]]);return e}function a(t,e){for(var n=[],r=i(t),o=0;o<r.length;o++){var a=r[o];n.push(e.call(null,t[a],a))}return n}function u(t,e){for(var n=[],r=0;r<t.length;r++)n.push(e.call(null,t[r],r));return n}function s(t){for(var e=[],n=0;n<t.length;n++){var r=t[n];Array.isArray(r)?e=e.concat(s(r)):e.push(r)}return e}function c(t){return r(t)?void 0:t[0]}function l(t){var e=t&&t.length;return e?t[e-1]:void 0}function E(t,e){if(Array.isArray(t))for(var n=0;n<t.length;n++)e.call(null,t[n],n);else{if(!g(t))throw Error(\"non exhaustive match\");var r=i(t);for(n=0;n<r.length;n++){var o=r[n],a=t[o];e.call(null,a,o)}}}function p(t){return\"string\"==typeof t}function f(t){return void 0===t}function L(t){return t instanceof Function}function S(t,e){return void 0===e&&(e=1),t.slice(e,t.length)}function h(t,e){return void 0===e&&(e=1),t.slice(0,t.length-e)}function T(t,e){var n=[];if(Array.isArray(t))for(var r=0;r<t.length;r++){var i=t[r];e.call(null,i)&&n.push(i)}return n}function U(t,e){return T(t,function(t){return!e(t)})}function R(t,e){for(var n=Object.keys(t),r={},i=0;i<n.length;i++){var o=n[i],a=t[o];e(a)&&(r[o]=a)}return r}function d(t,e){return!!g(t)&&t.hasOwnProperty(e)}function O(t,e){return void 0!==m(t,function(t){return t===e})}function N(t){for(var e=[],n=0;n<t.length;n++)e.push(t[n]);return e}function A(t){var e={};for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&(e[n]=t[n]);return e}function m(t,e){for(var n=0;n<t.length;n++){var r=t[n];if(e.call(null,r))return r}}function C(t,e){for(var n=[],r=0;r<t.length;r++){var i=t[r];e.call(null,i)&&n.push(i)}return n}function I(t,e,n){for(var r=Array.isArray(t),a=r?t:o(t),u=r?[]:i(t),s=n,c=0;c<a.length;c++)s=e.call(null,s,a[c],r?c:u[c]);return s}function y(t){return U(t,function(t){return null==t})}function _(t,e){void 0===e&&(e=function(t){return t});var n=[];return I(t,function(t,r){var i=e(r);return O(n,i)?t:(n.push(i),t.concat(r))},[])}function P(t){for(var e=[],n=1;n<arguments.length;n++)e[n-1]=arguments[n];var r=[null].concat(e);return Function.bind.apply(t,r)}function v(t){return Array.isArray(t)}function M(t){return t instanceof RegExp}function g(t){return t instanceof Object}function B(t,e){for(var n=0;n<t.length;n++)if(!e(t[n],n))return!1;return!0}function k(t,e){return U(t,function(t){return O(e,t)})}function D(t,e){for(var n=0;n<t.length;n++)if(e(t[n]))return!0;return!1}function b(t,e){for(var n=0;n<t.length;n++)if(t[n]===e)return n;return-1}function x(t,e){var n=N(t);return n.sort(function(t,n){return e(t)-e(n)}),n}function F(t,e){if(t.length!==e.length)throw Error(\"can't zipObject with different number of keys and values!\");for(var n={},r=0;r<t.length;r++)n[t[r]]=e[r];return n}function G(t){for(var e=[],n=1;n<arguments.length;n++)e[n-1]=arguments[n];for(var r=0;r<e.length;r++)for(var o=e[r],a=i(o),u=0;u<a.length;u++){var s=a[u];t[s]=o[s]}return t}function w(t){for(var e=[],n=1;n<arguments.length;n++)e[n-1]=arguments[n];for(var r=0;r<e.length;r++){var o=e[r];if(!f(o))for(var a=i(o),u=0;u<a.length;u++){var s=a[u];d(t,s)||(t[s]=o[s])}}return t}function j(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return w.apply(null,[{}].concat(t))}function V(t,e){var n={};return E(t,function(t){var r=e(t),i=n[r];i?i.push(t):n[r]=[t]}),n}function H(t,e){for(var n=A(t),r=i(e),o=0;o<r.length;o++){var a=r[o],u=e[a];n[a]=u}return n}function W(){}function Y(t){return t}function K(t){for(var e=[],n=0;n<t.length;n++){var r=t[n];e.push(void 0!==r?r:void 0)}return e}function X(t){console&&console.error&&console.error(\"Error: \"+t)}function q(t){console&&console.warn&&console.warn(\"Warning: \"+t)}function z(){return\"function\"==typeof Map}function Q(t,e){e.forEach(function(e){var n=e.prototype;Object.getOwnPropertyNames(n).forEach(function(r){if(\"constructor\"!==r){var i=Object.getOwnPropertyDescriptor(n,r);i&&(i.get||i.set)?Object.defineProperty(t.prototype,r,i):t.prototype[r]=e.prototype[r]}})})}function $(t){function e(){}e.prototype=t;var n=new e;function r(){return typeof n.bar}return r(),r(),t}Object.defineProperty(e,\"__esModule\",{value:!0}),e.isEmpty=r,e.keys=i,e.values=o,e.mapValues=a,e.map=u,e.flatten=s,e.first=c,e.last=l,e.forEach=E,e.isString=p,e.isUndefined=f,e.isFunction=L,e.drop=S,e.dropRight=h,e.filter=T,e.reject=U,e.pick=R,e.has=d,e.contains=O,e.cloneArr=N,e.cloneObj=A,e.find=m,e.findAll=C,e.reduce=I,e.compact=y,e.uniq=_,e.partial=P,e.isArray=v,e.isRegExp=M,e.isObject=g,e.every=B,e.difference=k,e.some=D,e.indexOf=b,e.sortBy=x,e.zipObject=F,e.assign=G,e.assignNoOverwrite=w,e.defaults=j,e.groupBy=V,e.merge=H,e.NOOP=W,e.IDENTITY=Y,e.packArray=K,e.PRINT_ERROR=X,e.PRINT_WARNING=q,e.isES2015MapSupported=z,e.applyMixins=Q,e.toFastProperties=$},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"terminals\",function(){return s});var r=n(1),i=n(3),o=Object(r.createToken)({name:\"STRING_LITERAL_LONG1\",pattern:i.STRING_LITERAL_LONG1}),a=Object(r.createToken)({name:\"STRING_LITERAL_LONG2\",pattern:i.STRING_LITERAL_LONG2}),u=Object(r.createToken)({name:\"PNAME_LN\",pattern:i.PNAME_LN}),s={IRIREF:Object(r.createToken)({name:\"IRIREF\",pattern:i.IRIREF,label:\"<http://example.com>\"}),LANGTAG:Object(r.createToken)({name:\"LANGTAG\",pattern:i.LANGTAG}),INTEGER:Object(r.createToken)({name:\"INTEGER\",pattern:i.INTEGER}),DECIMAL:Object(r.createToken)({name:\"DECIMAL\",pattern:i.DECIMAL}),DOUBLE:Object(r.createToken)({name:\"DOUBLE\",pattern:i.DOUBLE}),INTEGER_POSITIVE:Object(r.createToken)({name:\"INTEGER_POSITIVE\",pattern:i.INTEGER_POSITIVE}),DECIMAL_POSITIVE:Object(r.createToken)({name:\"DECIMAL_POSITIVE\",pattern:i.DECIMAL_POSITIVE}),DOUBLE_POSITIVE:Object(r.createToken)({name:\"DOUBLE_POSITIVE\",pattern:i.DOUBLE_POSITIVE}),INTEGER_NEGATIVE:Object(r.createToken)({name:\"INTEGER_NEGATIVE\",pattern:i.INTEGER_NEGATIVE}),DECIMAL_NEGATIVE:Object(r.createToken)({name:\"DECIMAL_NEGATIVE\",pattern:i.DECIMAL_NEGATIVE}),DOUBLE_NEGATIVE:Object(r.createToken)({name:\"DOUBLE_NEGATIVE\",pattern:i.DOUBLE_NEGATIVE}),STRING_LITERAL_LONG1:o,STRING_LITERAL_LONG2:a,STRING_LITERAL1:Object(r.createToken)({name:\"STRING_LITERAL1\",pattern:i.STRING_LITERAL1,longer_alt:o}),STRING_LITERAL2:Object(r.createToken)({name:\"STRING_LITERAL2\",pattern:i.STRING_LITERAL2,longer_alt:a}),NIL:Object(r.createToken)({name:\"NIL\",pattern:i.NIL,label:\"()\"}),ANON:Object(r.createToken)({name:\"ANON\",pattern:i.ANON,label:\"[]\"}),PNAME_LN:u,PNAME_NS:Object(r.createToken)({name:\"PNAME_NS\",pattern:i.PNAME_NS,longer_alt:u}),BLANK_NODE_LABEL:Object(r.createToken)({name:\"BLANK_NODE_LABEL\",pattern:i.BLANK_NODE_LABEL}),VAR1:Object(r.createToken)({name:\"VAR1\",pattern:i.VAR1,label:\"?foo\"}),VAR2:Object(r.createToken)({name:\"VAR2\",pattern:i.VAR2,label:\"?bar\"}),PERCENT:Object(r.createToken)({name:\"PERCENT\",pattern:i.PERCENT})}},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(4),a=n(7),u=function(){function t(t){this.definition=t}return t.prototype.accept=function(t){t.visit(this),o.forEach(this.definition,function(e){e.accept(t)})},t}();e.AbstractProduction=u;var s=function(t){function e(e){var n=t.call(this,[])||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),Object.defineProperty(e.prototype,\"definition\",{get:function(){return void 0!==this.referencedRule?this.referencedRule.definition:[]},set:function(t){},enumerable:!0,configurable:!0}),e.prototype.accept=function(t){t.visit(this)},e}(u);e.NonTerminal=s;var c=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.orgText=\"\",o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.Rule=c;var l=function(t){function e(e){var n=t.call(this,e.definition)||this;return o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.Flat=l;var E=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.Option=E;var p=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.RepetitionMandatory=p;var f=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.RepetitionMandatoryWithSeparator=f;var L=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.Repetition=L;var S=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.RepetitionWithSeparator=S;var h=function(t){function e(e){var n=t.call(this,e.definition)||this;return n.idx=1,o.assign(n,o.pick(e,function(t){return void 0!==t})),n}return i(e,t),e}(u);e.Alternation=h;var T=function(){function t(t){this.idx=1,o.assign(this,o.pick(t,function(t){return void 0!==t}))}return t.prototype.accept=function(t){t.visit(this)},t}();function U(t){function e(t){return o.map(t,U)}if(t instanceof s)return{type:\"NonTerminal\",name:t.nonTerminalName,idx:t.idx};if(t instanceof l)return{type:\"Flat\",definition:e(t.definition)};if(t instanceof E)return{type:\"Option\",idx:t.idx,definition:e(t.definition)};if(t instanceof p)return{type:\"RepetitionMandatory\",name:t.name,idx:t.idx,definition:e(t.definition)};if(t instanceof f)return{type:\"RepetitionMandatoryWithSeparator\",name:t.name,idx:t.idx,separator:U(new T({terminalType:t.separator})),definition:e(t.definition)};if(t instanceof S)return{type:\"RepetitionWithSeparator\",name:t.name,idx:t.idx,separator:U(new T({terminalType:t.separator})),definition:e(t.definition)};if(t instanceof L)return{type:\"Repetition\",name:t.name,idx:t.idx,definition:e(t.definition)};if(t instanceof h)return{type:\"Alternation\",name:t.name,idx:t.idx,definition:e(t.definition)};if(t instanceof T){var n={type:\"Terminal\",name:a.tokenName(t.terminalType),label:a.tokenLabel(t.terminalType),idx:t.idx},r=t.terminalType.PATTERN;return t.terminalType.PATTERN&&(n.pattern=o.isRegExp(r)?r.source:r),n}if(t instanceof c)return{type:\"Rule\",name:t.name,orgText:t.orgText,definition:e(t.definition)};throw Error(\"non exhaustive match\")}e.Terminal=T,e.serializeGrammar=function(t){return o.map(t,U)},e.serializeProduction=U},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(10),o=n(23),a=n(14);function u(t){return r.isString(t.LABEL)&&\"\"!==t.LABEL}function s(t){return r.isObject(t)&&t.hasOwnProperty(\"tokenName\")&&r.isString(t.tokenName)?t.tokenName:i.functionName(t)}e.tokenLabel=function(t){return u(t)?t.LABEL:s(t)},e.hasTokenLabel=u,e.tokenName=s;var c=\"parent\",l=\"categories\",E=\"label\",p=\"group\",f=\"push_mode\",L=\"pop_mode\",S=\"longer_alt\",h=\"line_breaks\",T=\"start_chars_hint\";function U(t){return function(t){var e=t.name,n=t.pattern,o={};i.defineNameProp(o,e)||(o.tokenName=e);r.isUndefined(n)||(o.PATTERN=n);if(r.has(t,c))throw\"The parent property is no longer supported.\\nSee: https://github.com/SAP/chevrotain/issues/564#issuecomment-349062346 for details.\";r.has(t,l)&&(o.CATEGORIES=t[l]);a.augmentTokenTypes([o]),r.has(t,E)&&(o.LABEL=t[E]);r.has(t,p)&&(o.GROUP=t[p]);r.has(t,L)&&(o.POP_MODE=t[L]);r.has(t,f)&&(o.PUSH_MODE=t[f]);r.has(t,S)&&(o.LONGER_ALT=t[S]);r.has(t,h)&&(o.LINE_BREAKS=t[h]);r.has(t,T)&&(o.START_CHARS_HINT=t[T]);return o}(t)}e.createToken=U,e.EOF=U({name:\"EOF\",pattern:o.Lexer.NA}),a.augmentTokenTypes([e.EOF]),e.createTokenInstance=function(t,e,n,r,i,o,a,u){return{image:e,startOffset:n,endOffset:r,startLine:i,endLine:o,startColumn:a,endColumn:u,tokenTypeIdx:t.tokenTypeIdx,tokenType:t}},e.tokenMatcher=function(t,e){return a.tokenStructuredMatcher(t,e)}},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(10),a=n(4),u=n(37),s=n(7),c=n(32),l=n(24),E=n(17),p=n(33),f=n(34),L=n(42),S=n(43),h=n(45),T=n(46),U=n(47),R=n(48),d=n(49);e.END_OF_FILE=s.createTokenInstance(s.EOF,\"\",NaN,NaN,NaN,NaN,NaN,NaN),Object.freeze(e.END_OF_FILE),e.DEFAULT_PARSER_CONFIG=Object.freeze({recoveryEnabled:!1,maxLookahead:4,ignoredIssues:{},dynamicTokensEnabled:!1,outputCst:!0,errorMessageProvider:E.defaultParserErrorProvider,serializedGrammar:null,nodeLocationTracking:\"none\"}),e.DEFAULT_RULE_CONFIG=Object.freeze({recoveryValueFunc:function(){},resyncEnabled:!0}),function(t){t[t.INVALID_RULE_NAME=0]=\"INVALID_RULE_NAME\",t[t.DUPLICATE_RULE_NAME=1]=\"DUPLICATE_RULE_NAME\",t[t.INVALID_RULE_OVERRIDE=2]=\"INVALID_RULE_OVERRIDE\",t[t.DUPLICATE_PRODUCTIONS=3]=\"DUPLICATE_PRODUCTIONS\",t[t.UNRESOLVED_SUBRULE_REF=4]=\"UNRESOLVED_SUBRULE_REF\",t[t.LEFT_RECURSION=5]=\"LEFT_RECURSION\",t[t.NONE_LAST_EMPTY_ALT=6]=\"NONE_LAST_EMPTY_ALT\",t[t.AMBIGUOUS_ALTS=7]=\"AMBIGUOUS_ALTS\",t[t.CONFLICT_TOKENS_RULES_NAMESPACE=8]=\"CONFLICT_TOKENS_RULES_NAMESPACE\",t[t.INVALID_TOKEN_NAME=9]=\"INVALID_TOKEN_NAME\",t[t.INVALID_NESTED_RULE_NAME=10]=\"INVALID_NESTED_RULE_NAME\",t[t.DUPLICATE_NESTED_NAME=11]=\"DUPLICATE_NESTED_NAME\",t[t.NO_NON_EMPTY_LOOKAHEAD=12]=\"NO_NON_EMPTY_LOOKAHEAD\",t[t.AMBIGUOUS_PREFIX_ALTS=13]=\"AMBIGUOUS_PREFIX_ALTS\",t[t.TOO_MANY_ALTS=14]=\"TOO_MANY_ALTS\"}(e.ParserDefinitionErrorType||(e.ParserDefinitionErrorType={})),e.EMPTY_ALT=function(t){return void 0===t&&(t=void 0),function(){return t}};var Parser=function(){function Parser(t,n){void 0===n&&(n=e.DEFAULT_PARSER_CONFIG),this.ignoredIssues=e.DEFAULT_PARSER_CONFIG.ignoredIssues,this.definitionErrors=[],this.selfAnalysisDone=!1;this.initErrorHandler(n),this.initLexerAdapter(),this.initLooksAhead(n),this.initRecognizerEngine(t,n),this.initRecoverable(n),this.initTreeBuilder(n),this.initContentAssist(),this.ignoredIssues=a.has(n,\"ignoredIssues\")?n.ignoredIssues:e.DEFAULT_PARSER_CONFIG.ignoredIssues,a.toFastProperties(this)}return Parser.performSelfAnalysis=function(t){t.performSelfAnalysis()},Parser.prototype.performSelfAnalysis=function(){var t,e=this;this.selfAnalysisDone=!0;var n=o.classNameFromInstance(this),r=this.gastProductionsCache;if(this.serializedGrammar){var i=c.deserializeGrammar(this.serializedGrammar,this.tokensMap);a.forEach(i,function(t){e.gastProductionsCache.put(t.name,t)})}var s=p.resolveGrammar({rules:r.values()});if(this.definitionErrors.push.apply(this.definitionErrors,s),a.isEmpty(s)){var f=p.validateGrammar({rules:r.values(),maxLookahead:this.maxLookahead,tokenTypes:a.values(this.tokensMap),ignoredIssues:this.ignoredIssues,errMsgProvider:E.defaultGrammarValidatorErrorProvider,grammarName:n});this.definitionErrors.push.apply(this.definitionErrors,f)}if(a.isEmpty(this.definitionErrors)){var L=u.computeAllProdsFollows(r.values());this.resyncFollows=L}var S=l.analyzeCst(r.values(),this.fullRuleNameToShort);if(this.allRuleNames=S.allRuleNames,!Parser.DEFER_DEFINITION_ERRORS_HANDLING&&!a.isEmpty(this.definitionErrors))throw t=a.map(this.definitionErrors,function(t){return t.message}),new Error(\"Parser Definition Errors detected:\\n \"+t.join(\"\\n-------------------------------\\n\"))},Parser.DEFER_DEFINITION_ERRORS_HANDLING=!1,Parser}();e.Parser=Parser,a.applyMixins(Parser,[f.Recoverable,L.LooksAhead,S.TreeBuilder,h.LexerAdapter,U.RecognizerEngine,T.RecognizerApi,R.ErrorHandler,d.ContentAssist]);var O=function(t){function n(n,r){void 0===r&&(r=e.DEFAULT_PARSER_CONFIG);var i=a.cloneObj(r);return i.outputCst=!0,t.call(this,n,i)||this}return i(n,t),n}(Parser);e.CstParser=O;var N=function(t){function n(n,r){void 0===r&&(r=e.DEFAULT_PARSER_CONFIG);var i=a.cloneObj(r);return i.outputCst=!1,t.call(this,n,i)||this}return i(n,t),n}(Parser);e.EmbeddedActionsParser=N},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"sparqlTokenMap\",function(){return a}),n.d(e,\"baseTokens\",function(){return u}),n.d(e,\"pathsTokens\",function(){return s}),n.d(e,\"nonStandardTokens\",function(){return c}),n.d(e,\"stardogSparqlTokens\",function(){return E}),n.d(e,\"sparqlTokenTypes\",function(){return p});var r=n(1),i=n(5),o=n(0),a={IRIREF:i.terminals.IRIREF,LANGTAG:i.terminals.LANGTAG,INTEGER:i.terminals.INTEGER,DECIMAL:i.terminals.DECIMAL,DOUBLE:i.terminals.DOUBLE,INTEGER_POSITIVE:i.terminals.INTEGER_POSITIVE,DECIMAL_POSITIVE:i.terminals.DECIMAL_POSITIVE,DOUBLE_POSITIVE:i.terminals.DOUBLE_POSITIVE,INTEGER_NEGATIVE:i.terminals.INTEGER_NEGATIVE,DECIMAL_NEGATIVE:i.terminals.DECIMAL_NEGATIVE,DOUBLE_NEGATIVE:i.terminals.DOUBLE_NEGATIVE,STRING_LITERAL1:i.terminals.STRING_LITERAL1,STRING_LITERAL2:i.terminals.STRING_LITERAL2,STRING_LITERAL_LONG1:i.terminals.STRING_LITERAL_LONG1,STRING_LITERAL_LONG2:i.terminals.STRING_LITERAL_LONG2,NIL:i.terminals.NIL,ANON:i.terminals.ANON,PNAME_NS:i.terminals.PNAME_NS,PNAME_LN:i.terminals.PNAME_LN,BLANK_NODE_LABEL:i.terminals.BLANK_NODE_LABEL,VAR1:i.terminals.VAR1,VAR2:i.terminals.VAR2,PERCENT:i.terminals.PERCENT,Comment:Object(r.createToken)({name:\"Comment\",pattern:/#[^\\n]*/,group:\"comments\"}),LCurly:Object(r.createToken)({name:\"LCurly\",pattern:\"{\"}),RCurly:Object(r.createToken)({name:\"RCurly\",pattern:\"}\"}),LParen:Object(r.createToken)({name:\"LParen\",pattern:\"(\"}),RParen:Object(r.createToken)({name:\"RParen\",pattern:\")\"}),WhiteSpace:Object(r.createToken)({name:\"WhiteSpace\",pattern:/\\s+/,group:r.Lexer.SKIPPED,line_breaks:!0}),Star:Object(r.createToken)({name:\"Star\",pattern:\"*\"}),UNKNOWN:o.keywords.UNKNOWN,Period:Object(r.createToken)({name:\"Period\",pattern:\".\"}),QuestionMark:Object(r.createToken)({name:\"QuestionMark\",pattern:\"?\"}),Plus:Object(r.createToken)({name:\"Plus\",pattern:\"+\"}),Minus:Object(r.createToken)({name:\"Minus\",pattern:\"-\"}),LBracket:Object(r.createToken)({name:\"LBracket\",pattern:\"[\"}),RBracket:Object(r.createToken)({name:\"RBracket\",pattern:\"]\"}),Semicolon:Object(r.createToken)({name:\"Semicolon\",pattern:\";\"}),Comma:Object(r.createToken)({name:\"Comma\",pattern:\",\"}),Pipe:Object(r.createToken)({name:\"Pipe\",pattern:\"|\"}),ForwardSlash:Object(r.createToken)({name:\"ForwardSlash\",pattern:\"/\"}),Caret:Object(r.createToken)({name:\"Caret\",pattern:\"^\"}),DoubleCaret:Object(r.createToken)({name:\"DoubleCaret\",pattern:\"^^\"}),Bang:Object(r.createToken)({name:\"Bang\",pattern:\"!\"}),LogicalOr:Object(r.createToken)({name:\"LogicalOr\",pattern:\"||\"}),LogicalAnd:Object(r.createToken)({name:\"LogicalAnd\",pattern:\"&&\"}),Equals:Object(r.createToken)({name:\"Equals\",pattern:\"=\"}),NotEquals:Object(r.createToken)({name:\"NotEquals\",pattern:\"!=\"}),LessThan:Object(r.createToken)({name:\"LessThan\",pattern:\"<\"}),GreaterThan:Object(r.createToken)({name:\"GreaterThan\",pattern:\">\"}),LessThanEquals:Object(r.createToken)({name:\"LessThanEquals\",pattern:\"<=\"}),GreaterThanEquals:Object(r.createToken)({name:\"GreaterThanEquals\",pattern:\">=\"}),LEmbed:Object(r.createToken)({name:\"LEmbed\",pattern:\"<<\"}),REmbed:Object(r.createToken)({name:\"REmbed\",pattern:\">>\"}),SELECT:o.keywords.SELECT,CONSTRUCT:o.keywords.CONSTRUCT,DISTINCT:o.keywords.DISTINCT,START:o.keywords.START,END:o.keywords.END,VIA:o.keywords.VIA,CYCLIC:o.keywords.CYCLIC,PATHS_SHORTEST:o.keywords.PATHS_SHORTEST,PATHS_ALL:o.keywords.PATHS_ALL,PATHS:o.keywords.PATHS,AS:o.keywords.AS,WHERE:o.keywords.WHERE,A:o.keywords.A,GROUP_BY:o.keywords.GROUP_BY,ORDER_BY:o.keywords.ORDER_BY,BY:o.keywords.BY,BASE:o.keywords.BASE,PREFIX:o.keywords.PREFIX,DESCRIBE:o.keywords.DESCRIBE,ASK:o.keywords.ASK,FROM:o.keywords.FROM,REDUCED:o.keywords.REDUCED,NAMED:o.keywords.NAMED,HAVING:o.keywords.HAVING,ASC:o.keywords.ASC,DESC:o.keywords.DESC,OFFSET:o.keywords.OFFSET,LIMIT:o.keywords.LIMIT,VALUES:o.keywords.VALUES,LOAD:o.keywords.LOAD,SILENT:o.keywords.SILENT,INTO:o.keywords.INTO,CLEAR:o.keywords.CLEAR,DROP:o.keywords.DROP,CREATE:o.keywords.CREATE,ADD:o.keywords.ADD,TO:o.keywords.TO,MOVE:o.keywords.MOVE,COPY:o.keywords.COPY,INSERT_DATA:o.keywords.INSERT_DATA,DELETE_DATA:o.keywords.DELETE_DATA,DELETE_WHERE:o.keywords.DELETE_WHERE,WITH:o.keywords.WITH,DELETE:o.keywords.DELETE,INSERT:o.keywords.INSERT,USING:o.keywords.USING,DEFAULT:o.keywords.DEFAULT,GRAPH:o.keywords.GRAPH,ALL:o.keywords.ALL,OPTIONAL:o.keywords.OPTIONAL,SERVICE:o.keywords.SERVICE,BIND:o.keywords.BIND,UNNEST:o.keywords.UNNEST,UNDEF:o.keywords.UNDEF,MINUS:o.keywords.MINUS,UNION:o.keywords.UNION,FILTER:o.keywords.FILTER,STR:o.keywords.STR,LANG:o.keywords.LANG,LANGMATCHES:o.keywords.LANGMATCHES,DATATYPE:o.keywords.DATATYPE,BOUND:o.keywords.BOUND,IRI:o.keywords.IRI,URI:o.keywords.URI,BNODE:o.keywords.BNODE,RAND:o.keywords.RAND,ABS:o.keywords.ABS,CEIL:o.keywords.CEIL,FLOOR:o.keywords.FLOOR,ROUND:o.keywords.ROUND,CONCAT:o.keywords.CONCAT,STRLEN:o.keywords.STRLEN,UCASE:o.keywords.UCASE,LCASE:o.keywords.LCASE,ENCODE_FOR_URI:o.keywords.ENCODE_FOR_URI,CONTAINS:o.keywords.CONTAINS,STRSTARTS:o.keywords.STRSTARTS,STRENDS:o.keywords.STRENDS,STRBEFORE:o.keywords.STRBEFORE,STRAFTER:o.keywords.STRAFTER,YEAR:o.keywords.YEAR,MONTH:o.keywords.MONTH,DAY:o.keywords.DAY,HOURS:o.keywords.HOURS,MINUTES:o.keywords.MINUTES,SECONDS:o.keywords.SECONDS,TIMEZONE:o.keywords.TIMEZONE,TZ:o.keywords.TZ,NOW:o.keywords.NOW,UUID:o.keywords.UUID,STRUUID:o.keywords.STRUUID,MD5:o.keywords.MD5,SHA1:o.keywords.SHA1,SHA256:o.keywords.SHA256,SHA384:o.keywords.SHA384,SHA512:o.keywords.SHA512,COALESCE:o.keywords.COALESCE,IF:o.keywords.IF,STRLANG:o.keywords.STRLANG,STRDT:o.keywords.STRDT,sameTerm:o.keywords.sameTerm,isIRI:o.keywords.isIRI,isURI:o.keywords.isURI,isBLANK:o.keywords.isBLANK,isLITERAL:o.keywords.isLITERAL,isNUMERIC:o.keywords.isNUMERIC,REGEX:o.keywords.REGEX,SUBSTR:o.keywords.SUBSTR,REPLACE:o.keywords.REPLACE,EXISTS:o.keywords.EXISTS,NOT_EXISTS:o.keywords.NOT_EXISTS,COUNT:o.keywords.COUNT,SUM:o.keywords.SUM,MIN:o.keywords.MIN,AVG:o.keywords.AVG,SAMPLE:o.keywords.SAMPLE,GROUP_CONCAT:o.keywords.GROUP_CONCAT,SEPARATOR:o.keywords.SEPARATOR,TRUE:o.keywords.TRUE,FALSE:o.keywords.FALSE,IN:o.keywords.IN,NOT_IN:o.keywords.NOT_IN,MAX_LENGTH:o.keywords.MAX_LENGTH,MAX:o.keywords.MAX,VALIDATE:o.keywords.VALIDATE,SHAPES:o.keywords.SHAPES,SHAPE:o.keywords.SHAPE,PER:o.keywords.PER},u=[a.NIL,a.ANON,a.LCurly,a.RCurly,a.LParen,a.RParen,a.WhiteSpace,a.IRIREF,a.LANGTAG,a.DOUBLE,a.DECIMAL,a.INTEGER,a.DOUBLE_POSITIVE,a.DECIMAL_POSITIVE,a.INTEGER_POSITIVE,a.DOUBLE_NEGATIVE,a.DECIMAL_NEGATIVE,a.INTEGER_NEGATIVE,a.STRING_LITERAL1,a.STRING_LITERAL2,a.STRING_LITERAL_LONG1,a.STRING_LITERAL_LONG2,a.PNAME_NS,a.PNAME_LN,a.BLANK_NODE_LABEL,a.VAR1,a.VAR2,a.Comment,a.SELECT,a.CONSTRUCT,a.DISTINCT,a.Star,a.WHERE,a.GROUP_BY,a.ORDER_BY,a.BY,a.Period,a.QuestionMark,a.Plus,a.Minus,a.LBracket,a.RBracket,a.PERCENT,a.BASE,a.PREFIX,a.DESCRIBE,a.ASK,a.FROM,a.REDUCED,a.NAMED,a.HAVING,a.ASC,a.DESC,a.OFFSET,a.LIMIT,a.VALUES,a.LOAD,a.SILENT,a.INTO,a.AS,a.CLEAR,a.DROP,a.CREATE,a.ADD,a.TO,a.MOVE,a.COPY,a.INSERT_DATA,a.DELETE_DATA,a.DELETE_WHERE,a.WITH,a.DELETE,a.INSERT,a.USING,a.DEFAULT,a.GRAPH,a.ALL,a.OPTIONAL,a.SERVICE,a.BIND,a.UNDEF,a.MINUS,a.UNION,a.FILTER,a.LANGMATCHES,a.LANG,a.DATATYPE,a.BOUND,a.IRI,a.URI,a.BNODE,a.RAND,a.ABS,a.CEIL,a.FLOOR,a.ROUND,a.CONCAT,a.STRLEN,a.UCASE,a.LCASE,a.ENCODE_FOR_URI,a.CONTAINS,a.STRSTARTS,a.STRENDS,a.STRBEFORE,a.STRAFTER,a.YEAR,a.MONTH,a.DAY,a.HOURS,a.MINUTES,a.SECONDS,a.TIMEZONE,a.TZ,a.NOW,a.UUID,a.STRUUID,a.MD5,a.SHA1,a.SHA256,a.SHA384,a.SHA512,a.COALESCE,a.IF,a.STRLANG,a.STRDT,a.STR,a.sameTerm,a.isIRI,a.isURI,a.isBLANK,a.isLITERAL,a.isNUMERIC,a.REGEX,a.SUBSTR,a.REPLACE,a.EXISTS,a.NOT_EXISTS,a.COUNT,a.SUM,a.MIN,a.MAX_LENGTH,a.MAX,a.AVG,a.SAMPLE,a.GROUP_CONCAT,a.SEPARATOR,a.TRUE,a.FALSE,a.Semicolon,a.Comma,a.ForwardSlash,a.DoubleCaret,a.Caret,a.LogicalOr,a.Pipe,a.LogicalAnd,a.NotEquals,a.Bang,a.Equals,a.LessThanEquals,a.GreaterThanEquals,a.LEmbed,a.REmbed,a.LessThan,a.GreaterThan,a.IN,a.NOT_IN,a.A,a.UNKNOWN],s=[a.START,a.END,a.VIA,a.CYCLIC,a.PATHS_SHORTEST,a.PATHS_ALL,a.PATHS],c=s.concat([a.UNNEST,a.VALIDATE,a.SHAPES,a.SHAPE,a.PER]),l=u.indexOf(a.SELECT),E=u.slice(0,l).concat(c,u.slice(l)),p=u.concat(c)},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4);e.classNameFromInstance=function(t){return a(t.constructor)};var i=/^\\s*function\\s*(\\S*)\\s*\\(/,o=\"name\";function a(t){var e=t.name;return e||t.toString().match(i)[1]}e.functionName=a,e.defineNameProp=function(t,e){var n=Object.getOwnPropertyDescriptor(t,o);return!(!r.isUndefined(n)&&!n.configurable||(Object.defineProperty(t,o,{enumerable:!1,configurable:!0,writable:!1,value:e}),0))};var u=function(){function t(){this._state={}}return t.prototype.keys=function(){return r.keys(this._state)},t.prototype.values=function(){return r.values(this._state)},t.prototype.put=function(t,e){this._state[t]=e},t.prototype.putAll=function(t){this._state=r.assign(this._state,t._state)},t.prototype.get=function(t){return this._state[t]},t.prototype.containsKey=function(t){return r.has(this._state,t)},t.prototype.clear=function(){this._state={}},t}();e.HashTable=u},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(6),i=function(){function t(){}return t.prototype.visit=function(t){if(t instanceof r.NonTerminal)return this.visitNonTerminal(t);if(t instanceof r.Flat)return this.visitFlat(t);if(t instanceof r.Option)return this.visitOption(t);if(t instanceof r.RepetitionMandatory)return this.visitRepetitionMandatory(t);if(t instanceof r.RepetitionMandatoryWithSeparator)return this.visitRepetitionMandatoryWithSeparator(t);if(t instanceof r.RepetitionWithSeparator)return this.visitRepetitionWithSeparator(t);if(t instanceof r.Repetition)return this.visitRepetition(t);if(t instanceof r.Alternation)return this.visitAlternation(t);if(t instanceof r.Terminal)return this.visitTerminal(t);if(t instanceof r.Rule)return this.visitRule(t);throw Error(\"non exhaustive match\")},t.prototype.visitNonTerminal=function(t){},t.prototype.visitFlat=function(t){},t.prototype.visitOption=function(t){},t.prototype.visitRepetition=function(t){},t.prototype.visitRepetitionMandatory=function(t){},t.prototype.visitRepetitionMandatoryWithSeparator=function(t){},t.prototype.visitRepetitionWithSeparator=function(t){},t.prototype.visitAlternation=function(t){},t.prototype.visitTerminal=function(t){},t.prototype.visitRule=function(t){},t}();e.GAstVisitor=i},function(t,e,n){\"use strict\";n.d(e,\"d\",function(){return i}),n.d(e,\"e\",function(){return o}),n.d(e,\"b\",function(){return a}),n.d(e,\"c\",function(){return u}),n.d(e,\"a\",function(){return s});var r=function(){return(r=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},i=function(t,e){l(t,null,e)},o=function(t,e){l(t,null,e,!1)};function a(t){return Boolean(t&&\"name\"in t)}function u(t){return Boolean(t&&\"tokenType\"in t)}function s(t,e){if(!t||!t.length)return e;for(var n=e,r=0,i=t;r<i.length;r++){var o=i[r];if(!a(n)||!n.children[o])return;n=n.children[o][0]}return n}var c=function(){return function(t){var e=t.node,n=t.parentCtx;this.node=r({},e),this.parentCtx=r({},n)}}(),l=function(t,e,n,i){if(void 0===e&&(e=new c({node:t})),void 0===i&&(i=!0),!a(t))return n(i?r({},e):e);var o=t.children;Object.keys(o).forEach(function(t){var r=o[t];r.length&&r.forEach(function(t){var r=i?new c({node:t,parentCtx:e}):{node:t,parentCtx:e};n(r,function(e){var o=r;e&&(o=i?new c({node:e.node,parentCtx:e.parentCtx}):{node:e.node,parentCtx:e.parentCtx}),l(t,o,n,i)})})})}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=\"MismatchedTokenException\",o=\"NoViableAltException\",a=\"EarlyExitException\",u=\"NotAllInputParsedException\",s=[i,o,a,u];function c(t,e,n){this.name=i,this.message=t,this.token=e,this.previousToken=n,this.resyncedTokens=[]}function l(t,e,n){this.name=o,this.message=t,this.token=e,this.previousToken=n,this.resyncedTokens=[]}function E(t,e){this.name=u,this.message=t,this.token=e,this.resyncedTokens=[]}function p(t,e,n){this.name=a,this.message=t,this.token=e,this.previousToken=n,this.resyncedTokens=[]}Object.freeze(s),e.isRecognitionException=function(t){return r.contains(s,t.name)},e.MismatchedTokenException=c,c.prototype=Error.prototype,e.NoViableAltException=l,l.prototype=Error.prototype,e.NotAllInputParsedException=E,E.prototype=Error.prototype,e.EarlyExitException=p,p.prototype=Error.prototype},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(10),o=n(7);function a(t){for(var e=r.cloneArr(t),n=t,i=!0;i;){n=r.compact(r.flatten(r.map(n,function(t){return t.CATEGORIES})));var o=r.difference(n,e);e=e.concat(o),r.isEmpty(o)?i=!1:n=o}return e}function u(t){r.forEach(t,function(t){E(t)||(e.tokenIdxToClass.put(e.tokenShortNameIdx,t),t.tokenTypeIdx=e.tokenShortNameIdx++),p(t)&&!r.isArray(t.CATEGORIES)&&(t.CATEGORIES=[t.CATEGORIES]),p(t)||(t.CATEGORIES=[]),f(t)||(t.categoryMatches=[]),L(t)||(t.categoryMatchesMap={}),S(t)||(t.tokenName=o.tokenName(t))})}function s(t){r.forEach(t,function(t){t.categoryMatches=[],r.forEach(t.categoryMatchesMap,function(n,r){t.categoryMatches.push(e.tokenIdxToClass.get(r).tokenTypeIdx)})})}function c(t){r.forEach(t,function(t){l([],t)})}function l(t,e){r.forEach(t,function(t){e.categoryMatchesMap[t.tokenTypeIdx]=!0}),r.forEach(e.CATEGORIES,function(n){var i=t.concat(e);r.contains(i,n)||l(i,n)})}function E(t){return r.has(t,\"tokenTypeIdx\")}function p(t){return r.has(t,\"CATEGORIES\")}function f(t){return r.has(t,\"categoryMatches\")}function L(t){return r.has(t,\"categoryMatchesMap\")}function S(t){return r.has(t,\"tokenName\")}e.tokenStructuredMatcher=function(t,e){var n=t.tokenTypeIdx;return n===e.tokenTypeIdx||!0===e.isParent&&!0===e.categoryMatchesMap[n]},e.tokenStructuredMatcherNoCategories=function(t,e){return t.tokenTypeIdx===e.tokenTypeIdx},e.tokenShortNameIdx=1,e.tokenIdxToClass=new i.HashTable,e.augmentTokenTypes=function(t){var e=a(t);u(e),c(e),s(e),r.forEach(e,function(t){t.isParent=t.categoryMatches.length>0})},e.expandCategories=a,e.assignTokenDefaultProps=u,e.assignCategoriesTokensProp=s,e.assignCategoriesMapProp=c,e.singleAssignCategoriesToksMap=l,e.hasShortKeyProperty=E,e.hasCategoriesProperty=p,e.hasExtendingTokensTypesProperty=f,e.hasExtendingTokensTypesMapProperty=L,e.hasTokenNameProperty=S,e.isTokenType=function(t){return r.has(t,\"tokenTypeIdx\")}},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(4),a=n(6),u=n(11),s=n(7);e.isSequenceProd=function(t){return t instanceof a.Flat||t instanceof a.Option||t instanceof a.Repetition||t instanceof a.RepetitionMandatory||t instanceof a.RepetitionMandatoryWithSeparator||t instanceof a.RepetitionWithSeparator||t instanceof a.Terminal||t instanceof a.Rule},e.isOptionalProd=function t(e,n){return void 0===n&&(n=[]),!!(e instanceof a.Option||e instanceof a.Repetition||e instanceof a.RepetitionWithSeparator)||(e instanceof a.Alternation?o.some(e.definition,function(e){return t(e,n)}):!(e instanceof a.NonTerminal&&o.contains(n,e))&&e instanceof a.AbstractProduction&&(e instanceof a.NonTerminal&&n.push(e),o.every(e.definition,function(e){return t(e,n)})))},e.isBranchingProd=function(t){return t instanceof a.Alternation},e.getProductionDslName=function(t){if(t instanceof a.NonTerminal)return\"SUBRULE\";if(t instanceof a.Option)return\"OPTION\";if(t instanceof a.Alternation)return\"OR\";if(t instanceof a.RepetitionMandatory)return\"AT_LEAST_ONE\";if(t instanceof a.RepetitionMandatoryWithSeparator)return\"AT_LEAST_ONE_SEP\";if(t instanceof a.RepetitionWithSeparator)return\"MANY_SEP\";if(t instanceof a.Repetition)return\"MANY\";if(t instanceof a.Terminal)return\"CONSUME\";throw Error(\"non exhaustive match\")};var c=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.separator=\"-\",e.dslMethods={option:[],alternation:[],repetition:[],repetitionWithSeparator:[],repetitionMandatory:[],repetitionMandatoryWithSeparator:[]},e}return i(e,t),e.prototype.visitTerminal=function(t){var e=s.tokenName(t.terminalType)+this.separator+\"Terminal\";o.has(this.dslMethods,e)||(this.dslMethods[e]=[]),this.dslMethods[e].push(t)},e.prototype.visitNonTerminal=function(t){var e=t.nonTerminalName+this.separator+\"Terminal\";o.has(this.dslMethods,e)||(this.dslMethods[e]=[]),this.dslMethods[e].push(t)},e.prototype.visitOption=function(t){this.dslMethods.option.push(t)},e.prototype.visitRepetitionWithSeparator=function(t){this.dslMethods.repetitionWithSeparator.push(t)},e.prototype.visitRepetitionMandatory=function(t){this.dslMethods.repetitionMandatory.push(t)},e.prototype.visitRepetitionMandatoryWithSeparator=function(t){this.dslMethods.repetitionMandatoryWithSeparator.push(t)},e.prototype.visitRepetition=function(t){this.dslMethods.repetition.push(t)},e.prototype.visitAlternation=function(t){this.dslMethods.alternation.push(t)},e}(u.GAstVisitor);e.DslMethodsCollectorVisitor=c},function(t,e,n){\"use strict\";function r(t,e,n){return n|e|t}Object.defineProperty(e,\"__esModule\",{value:!0}),e.BITS_FOR_METHOD_IDX=4,e.BITS_FOR_OCCURRENCE_IDX=4,e.BITS_FOR_RULE_IDX=24,e.BITS_FOR_ALT_IDX=8,e.OR_IDX=1<<e.BITS_FOR_METHOD_IDX,e.OPTION_IDX=2<<e.BITS_FOR_METHOD_IDX,e.MANY_IDX=3<<e.BITS_FOR_METHOD_IDX,e.AT_LEAST_ONE_IDX=4<<e.BITS_FOR_METHOD_IDX,e.MANY_SEP_IDX=5<<e.BITS_FOR_METHOD_IDX,e.AT_LEAST_ONE_SEP_IDX=6<<e.BITS_FOR_METHOD_IDX,e.getKeyForAutomaticLookahead=r;var i=32-e.BITS_FOR_ALT_IDX;e.getKeyForAltIndex=function(t,e,n,o){var a=o+1<<i;return r(t,e,n)|a}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(7),i=n(4),o=n(4),a=n(6),u=n(15),s=n(18),c=n(25),l=n(8);e.defaultParserErrorProvider={buildMismatchTokenMessage:function(t){var e=t.expected,n=t.actual;t.previous,t.ruleName;return\"Expecting \"+(r.hasTokenLabel(e)?\"--\\x3e \"+r.tokenLabel(e)+\" <--\":\"token of type --\\x3e \"+r.tokenName(e)+\" <--\")+\" but found --\\x3e '\"+n.image+\"' <--\"},buildNotAllInputParsedMessage:function(t){var e=t.firstRedundant;t.ruleName;return\"Redundant input, expecting EOF but found: \"+e.image},buildNoViableAltMessage:function(t){var e=t.expectedPathsPerAlt,n=t.actual,i=(t.previous,t.customUserDescription),a=(t.ruleName,\"\\nbut found: '\"+o.first(n).image+\"'\");if(i)return\"Expecting: \"+i+a;var u=o.reduce(e,function(t,e){return t.concat(e)},[]),s=o.map(u,function(t){return\"[\"+o.map(t,function(t){return r.tokenLabel(t)}).join(\", \")+\"]\"});return\"Expecting: \"+(\"one of these possible Token sequences:\\n\"+o.map(s,function(t,e){return\"  \"+(e+1)+\". \"+t}).join(\"\\n\"))+a},buildEarlyExitMessage:function(t){var e=t.expectedIterationPaths,n=t.actual,i=t.customUserDescription,a=(t.ruleName,\"\\nbut found: '\"+o.first(n).image+\"'\");return i?\"Expecting: \"+i+a:\"Expecting: \"+(\"expecting at least one iteration which starts with one of these possible Token sequences::\\n  <\"+o.map(e,function(t){return\"[\"+o.map(t,function(t){return r.tokenLabel(t)}).join(\",\")+\"]\"}).join(\" ,\")+\">\")+a}},Object.freeze(e.defaultParserErrorProvider),e.defaultGrammarResolverErrorProvider={buildRuleNotFoundError:function(t,e){return\"Invalid grammar, reference to a rule which is not defined: ->\"+e.nonTerminalName+\"<-\\ninside top level rule: ->\"+t.name+\"<-\"}},e.defaultGrammarValidatorErrorProvider={buildDuplicateFoundError:function(t,e){var n,i=t.name,s=o.first(e),c=s.idx,l=u.getProductionDslName(s),E=(n=s)instanceof a.Terminal?r.tokenName(n.terminalType):n instanceof a.NonTerminal?n.nonTerminalName:\"\",p=\"->\"+l+\"<- with numerical suffix: ->\"+c+\"<-\\n                  \"+(E?\"and argument: ->\"+E+\"<-\":\"\")+\"\\n                  appears more than once (\"+e.length+\" times) in the top level rule: ->\"+i+\"<-.\\n                  \"+(0===c?\"Also note that numerical suffix 0 means \"+l+\" without any suffix.\":\"\")+\"\\n                  To fix this make sure each usage of \"+l+\" \"+(E?\"with the argument: ->\"+E+\"<-\":\"\")+\"\\n                  in the rule ->\"+i+\"<- has a different occurrence index (0-5), as that combination acts as a unique\\n                  position key in the grammar, which is needed by the parsing engine.\\n                  \\n                  For further details see: https://sap.github.io/chevrotain/docs/FAQ.html#NUMERICAL_SUFFIXES \\n                  \";return p=(p=p.replace(/[ \\t]+/g,\" \")).replace(/\\s\\s+/g,\"\\n\")},buildInvalidNestedRuleNameError:function(t,e){return\"Invalid nested rule name: ->\"+e.name+\"<- inside rule: ->\"+t.name+\"<-\\nit must match the pattern: ->\"+s.validNestedRuleName.toString()+\"<-.\\nNote that this means a nested rule name must start with the '$'(dollar) sign.\"},buildDuplicateNestedRuleNameError:function(t,e){return\"Duplicate nested rule name: ->\"+o.first(e).name+\"<- inside rule: ->\"+t.name+\"<-\\nA nested name must be unique in the scope of a top level grammar rule.\"},buildNamespaceConflictError:function(t){return\"Namespace conflict found in grammar.\\nThe grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <\"+t.name+\">.\\nTo resolve this make sure each Terminal and Non-Terminal names are unique\\nThis is easy to accomplish by using the convention that Terminal names start with an uppercase letter\\nand Non-Terminal names start with a lower case letter.\"},buildAlternationPrefixAmbiguityError:function(t){var e=o.map(t.prefixPath,function(t){return r.tokenLabel(t)}).join(\", \"),n=0===t.alternation.idx?\"\":t.alternation.idx;return\"Ambiguous alternatives: <\"+t.ambiguityIndices.join(\" ,\")+\"> due to common lookahead prefix\\nin <OR\"+n+\"> inside <\"+t.topLevelRule.name+\"> Rule,\\n<\"+e+\"> may appears as a prefix path in all these alternatives.\\nhttps://sap.github.io/chevrotain/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX\\nFor Further details.\"},buildAlternationAmbiguityError:function(t){var e=o.map(t.prefixPath,function(t){return r.tokenLabel(t)}).join(\", \"),n=0===t.alternation.idx?\"\":t.alternation.idx,i=\"Ambiguous alternatives: <\"+t.ambiguityIndices.join(\" ,\")+\"> in <OR\"+n+\"> inside <\"+t.topLevelRule.name+\"> Rule,\\n<\"+e+\"> may appears as a prefix path in all these alternatives.\\n\",a=c.VERSION.replace(/\\./g,\"_\");return i=i+\"To Resolve this, try one of of the following: \\n1. Refactor your grammar to be LL(K) for the current value of k (by default k=\"+l.DEFAULT_PARSER_CONFIG.maxLookahead+\"})\\n2. Increase the value of K for your grammar by providing a larger 'maxLookahead' value in the parser's config\\n3. This issue can be ignored (if you know what you are doing...), see https://sap.github.io/chevrotain/documentation/\"+a+\"/interfaces/iparserconfig.html#ignoredissues for more details\\n\"},buildEmptyRepetitionError:function(t){var e=u.getProductionDslName(t.repetition);return 0!==t.repetition.idx&&(e+=t.repetition.idx),\"The repetition <\"+e+\"> within Rule <\"+t.topLevelRule.name+\"> can never consume any tokens.\\nThis could lead to an infinite loop.\"},buildTokenNameError:function(t){return\"Invalid Grammar Token name: ->\"+r.tokenName(t.tokenType)+\"<- it must match the pattern: ->\"+t.expectedPattern.toString()+\"<-\"},buildEmptyAlternationError:function(t){return\"Ambiguous empty alternative: <\"+(t.emptyChoiceIdx+1)+\"> in <OR\"+t.alternation.idx+\"> inside <\"+t.topLevelRule.name+\"> Rule.\\nOnly the last alternative may be an empty alternative.\"},buildTooManyAlternativesError:function(t){return\"An Alternation cannot have more than 256 alternatives:\\n<OR\"+t.alternation.idx+\"> inside <\"+t.topLevelRule.name+\"> Rule.\\n has \"+(t.alternation.definition.length+1)+\" alternatives.\"},buildLeftRecursionError:function(t){var e=t.topLevelRule.name;return\"Left Recursion found in grammar.\\nrule: <\"+e+\"> can be invoked from itself (directly or indirectly)\\nwithout consuming any Tokens. The grammar path that causes this is: \\n \"+(e+\" --\\x3e \"+i.map(t.leftRecursionPath,function(t){return t.name}).concat([e]).join(\" --\\x3e \"))+\"\\n To fix this refactor your grammar to remove the left recursion.\\nsee: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.\"},buildInvalidRuleNameError:function(t){return\"Invalid grammar rule name: ->\"+t.topLevelRule.name+\"<- it must match the pattern: ->\"+t.expectedPattern.toString()+\"<-\"},buildDuplicateRuleNameError:function(t){return\"Duplicate definition, rule: ->\"+(t.topLevelRule instanceof a.Rule?t.topLevelRule.name:t.topLevelRule)+\"<- is already defined in the grammar: ->\"+t.grammarName+\"<-\"}}},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(4),a=n(4),u=n(8),s=n(15),c=n(7),l=n(19),E=n(24),p=n(20),f=n(6),L=n(11);function S(t){return s.getProductionDslName(t)+\"_#_\"+t.idx+\"_#_\"+h(t)}function h(t){return t instanceof f.Terminal?c.tokenName(t.terminalType):t instanceof f.NonTerminal?t.nonTerminalName:\"\"}e.validateGrammar=function(t,e,n,r,i,l){var p=o.map(t,function(t){return function(t,e){var n=new T;t.accept(n);var r=n.allProductions,i=o.groupBy(r,S),a=o.pick(i,function(t){return t.length>1});return o.map(o.values(a),function(n){var r=o.first(n),i=e.buildDuplicateFoundError(t,n),a=s.getProductionDslName(r),c={message:i,type:u.ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,ruleName:t.name,dslName:a,occurrence:r.idx},l=h(r);return l&&(c.parameter=l),c})}(t,i)}),f=o.map(t,function(t){return N(t,t,i)}),L=[],A=[],m=[];a.every(f,a.isEmpty)&&(L=a.map(t,function(t){return C(t,i)}),A=a.map(t,function(t){return I(t,e,r,i)}),m=P(t,e,i));var y=function(t,e,n){var r=[],i=a.map(e,function(t){return c.tokenName(t)});return a.forEach(t,function(t){var e=t.name;if(a.contains(i,e)){var o=n.buildNamespaceConflictError(t);r.push({message:o,type:u.ParserDefinitionErrorType.CONFLICT_TOKENS_RULES_NAMESPACE,ruleName:e})}}),r}(t,n,i),v=o.map(n,function(t){return d(t,i)}),M=function(t,e){var n=[];return a.forEach(t,function(t){var r=new E.NamedDSLMethodsCollectorVisitor(\"\");t.accept(r);var i=a.map(r.result,function(t){return t.orgProd});n.push(a.map(i,function(n){return R(t,n,e)}))}),a.flatten(n)}(t,i),g=function(t,e){var n=[];return a.forEach(t,function(t){var r=new E.NamedDSLMethodsCollectorVisitor(\"\");t.accept(r);var i=a.groupBy(r.result,function(t){return t.name}),o=a.pick(i,function(t){return t.length>1});a.forEach(a.values(o),function(r){var i=a.map(r,function(t){return t.orgProd}),o=e.buildDuplicateNestedRuleNameError(t,i);n.push({message:o,type:u.ParserDefinitionErrorType.DUPLICATE_NESTED_NAME,ruleName:t.name})})}),n}(t,i),B=a.map(t,function(t){return _(t,i)}),k=a.map(t,function(t){return U(t,i)}),D=a.map(t,function(e){return O(e,t,l,i)});return o.flatten(p.concat(v,M,g,m,f,L,A,y,B,k,D))},e.identifyProductionForDuplicates=S;var T=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.allProductions=[],e}return i(e,t),e.prototype.visitNonTerminal=function(t){this.allProductions.push(t)},e.prototype.visitOption=function(t){this.allProductions.push(t)},e.prototype.visitRepetitionWithSeparator=function(t){this.allProductions.push(t)},e.prototype.visitRepetitionMandatory=function(t){this.allProductions.push(t)},e.prototype.visitRepetitionMandatoryWithSeparator=function(t){this.allProductions.push(t)},e.prototype.visitRepetition=function(t){this.allProductions.push(t)},e.prototype.visitAlternation=function(t){this.allProductions.push(t)},e.prototype.visitTerminal=function(t){this.allProductions.push(t)},e}(L.GAstVisitor);function U(t,n){var r=[],i=t.name;return i.match(e.validTermsPattern)||r.push({message:n.buildInvalidRuleNameError({topLevelRule:t,expectedPattern:e.validTermsPattern}),type:u.ParserDefinitionErrorType.INVALID_RULE_NAME,ruleName:i}),r}function R(t,n,r){var i,o=[];return n.name.match(e.validNestedRuleName)||(i=r.buildInvalidNestedRuleNameError(t,n),o.push({message:i,type:u.ParserDefinitionErrorType.INVALID_NESTED_RULE_NAME,ruleName:t.name})),o}function d(t,n){var r=[];return c.tokenName(t).match(e.validTermsPattern)||r.push({message:n.buildTokenNameError({tokenType:t,expectedPattern:e.validTermsPattern}),type:u.ParserDefinitionErrorType.INVALID_TOKEN_NAME}),r}function O(t,e,n,r){var i=[];if(a.reduce(e,function(e,n){return n.name===t.name?e+1:e},0)>1){var o=r.buildDuplicateRuleNameError({topLevelRule:t,grammarName:n});i.push({message:o,type:u.ParserDefinitionErrorType.DUPLICATE_RULE_NAME,ruleName:t.name})}return i}function N(t,e,n,r){void 0===r&&(r=[]);var i=[],a=A(e.definition);if(o.isEmpty(a))return[];var s=t.name;o.contains(a,t)&&i.push({message:n.buildLeftRecursionError({topLevelRule:t,leftRecursionPath:r}),type:u.ParserDefinitionErrorType.LEFT_RECURSION,ruleName:s});var c=o.difference(a,r.concat([t])),l=o.map(c,function(e){var i=o.cloneArr(r);return i.push(e),N(t,e,n,i)});return i.concat(o.flatten(l))}function A(t){var e=[];if(o.isEmpty(t))return e;var n=o.first(t);if(n instanceof f.NonTerminal)e.push(n.referencedRule);else if(n instanceof f.Flat||n instanceof f.Option||n instanceof f.RepetitionMandatory||n instanceof f.RepetitionMandatoryWithSeparator||n instanceof f.RepetitionWithSeparator||n instanceof f.Repetition)e=e.concat(A(n.definition));else if(n instanceof f.Alternation)e=o.flatten(o.map(n.definition,function(t){return A(t.definition)}));else if(!(n instanceof f.Terminal))throw Error(\"non exhaustive match\");var r=s.isOptionalProd(n),i=t.length>1;if(r&&i){var a=o.drop(t);return e.concat(A(a))}return e}e.OccurrenceValidationCollector=T,e.validTermsPattern=/^[a-zA-Z_]\\w*$/,e.validNestedRuleName=new RegExp(e.validTermsPattern.source.replace(\"^\",\"^\\\\$\")),e.validateRuleName=U,e.validateNestedRuleName=R,e.validateTokenName=d,e.validateRuleDoesNotAlreadyExist=O,e.validateRuleIsOverridden=function(t,e,n){var r,i=[];return o.contains(e,t)||(r=\"Invalid rule override, rule: ->\"+t+\"<- cannot be overridden in the grammar: ->\"+n+\"<-as it is not defined in any of the super grammars \",i.push({message:r,type:u.ParserDefinitionErrorType.INVALID_RULE_OVERRIDE,ruleName:t})),i},e.validateNoLeftRecursion=N,e.getFirstNoneTerminal=A;var m=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.alternations=[],e}return i(e,t),e.prototype.visitAlternation=function(t){this.alternations.push(t)},e}(L.GAstVisitor);function C(t,e){var n=new m;t.accept(n);var r=n.alternations;return o.reduce(r,function(n,r){var i=o.dropRight(r.definition),a=o.map(i,function(n,i){var a=p.nextPossibleTokensAfter([n],[],null,1);return o.isEmpty(a)?{message:e.buildEmptyAlternationError({topLevelRule:t,alternation:r,emptyChoiceIdx:i}),type:u.ParserDefinitionErrorType.NONE_LAST_EMPTY_ALT,ruleName:t.name,occurrence:r.idx,alternative:i+1}:null});return n.concat(o.compact(a))},[])}function I(t,e,n,r){var i=new m;t.accept(i);var c=i.alternations,E=n[t.name];return E&&(c=a.reject(c,function(t){return E[s.getProductionDslName(t)+(0===t.idx?\"\":t.idx)]})),o.reduce(c,function(n,i){var s=i.idx,c=l.getLookaheadPathsForOr(s,t,e),E=function(t,e,n,r){var i=[],s=a.reduce(t,function(e,n,r){return a.forEach(n,function(n){var o=[r];a.forEach(t,function(t,e){r!==e&&l.containsPath(t,n)&&o.push(e)}),o.length>1&&!l.containsPath(i,n)&&(i.push(n),e.push({alts:o,path:n}))}),e},[]);return o.map(s,function(t){var i=a.map(t.alts,function(t){return t+1}),o=r.buildAlternationAmbiguityError({topLevelRule:n,alternation:e,ambiguityIndices:i,prefixPath:t.path});return{message:o,type:u.ParserDefinitionErrorType.AMBIGUOUS_ALTS,ruleName:n.name,occurrence:e.idx,alternatives:[t.alts]}})}(c,i,t,r),p=v(c,i,t,r);return n.concat(E,p)},[])}e.validateEmptyOrAlternative=C,e.validateAmbiguousAlternationAlternatives=I;var y=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.allProductions=[],e}return i(e,t),e.prototype.visitRepetitionWithSeparator=function(t){this.allProductions.push(t)},e.prototype.visitRepetitionMandatory=function(t){this.allProductions.push(t)},e.prototype.visitRepetitionMandatoryWithSeparator=function(t){this.allProductions.push(t)},e.prototype.visitRepetition=function(t){this.allProductions.push(t)},e}(L.GAstVisitor);function _(t,e){var n=new m;t.accept(n);var r=n.alternations;return o.reduce(r,function(n,r){return r.definition.length>255&&n.push({message:e.buildTooManyAlternativesError({topLevelRule:t,alternation:r}),type:u.ParserDefinitionErrorType.TOO_MANY_ALTS,ruleName:t.name,occurrence:r.idx}),n},[])}function P(t,e,n){var r=[];return a.forEach(t,function(t){var i=new y;t.accept(i);var o=i.allProductions;a.forEach(o,function(i){var o=l.getProdType(i),s=i.idx,c=l.getLookaheadPathsForOptionalProd(s,t,o,e)[0];if(a.isEmpty(a.flatten(c))){var E=n.buildEmptyRepetitionError({topLevelRule:t,repetition:i});r.push({message:E,type:u.ParserDefinitionErrorType.NO_NON_EMPTY_LOOKAHEAD,ruleName:t.name})}})}),r}function v(t,e,n,r){var i=[],o=a.reduce(t,function(t,e,n){var r=a.map(e,function(t){return{idx:n,path:t}});return t.concat(r)},[]);return a.forEach(o,function(t){var s=t.idx,c=t.path,E=a.findAll(o,function(t){return t.idx<s&&l.isStrictPrefixOfPath(t.path,c)}),p=a.map(E,function(t){var i=[t.idx+1,s+1],o=0===e.idx?\"\":e.idx;return{message:r.buildAlternationPrefixAmbiguityError({topLevelRule:n,alternation:e,ambiguityIndices:i,prefixPath:t.path}),type:u.ParserDefinitionErrorType.AMBIGUOUS_PREFIX_ALTS,ruleName:n.name,occurrence:o,alternatives:i}});i=i.concat(p)}),i}e.RepetionCollector=y,e.validateTooManyAlts=_,e.validateSomeNonEmptyLookaheadPath=P,e.checkPrefixAlternativesAmbiguities=v},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o,a=n(4),u=n(20),s=n(22),c=n(14),l=n(6),E=n(11);!function(t){t[t.OPTION=0]=\"OPTION\",t[t.REPETITION=1]=\"REPETITION\",t[t.REPETITION_MANDATORY=2]=\"REPETITION_MANDATORY\",t[t.REPETITION_MANDATORY_WITH_SEPARATOR=3]=\"REPETITION_MANDATORY_WITH_SEPARATOR\",t[t.REPETITION_WITH_SEPARATOR=4]=\"REPETITION_WITH_SEPARATOR\",t[t.ALTERNATION=5]=\"ALTERNATION\"}(o=e.PROD_TYPE||(e.PROD_TYPE={})),e.getProdType=function(t){if(t instanceof l.Option)return o.OPTION;if(t instanceof l.Repetition)return o.REPETITION;if(t instanceof l.RepetitionMandatory)return o.REPETITION_MANDATORY;if(t instanceof l.RepetitionMandatoryWithSeparator)return o.REPETITION_MANDATORY_WITH_SEPARATOR;if(t instanceof l.RepetitionWithSeparator)return o.REPETITION_WITH_SEPARATOR;if(t instanceof l.Alternation)return o.ALTERNATION;throw Error(\"non exhaustive match\")},e.buildLookaheadFuncForOr=function(t,e,n,r,i,o){var a=S(t,e,n);return o(a,r,U(a)?c.tokenStructuredMatcherNoCategories:c.tokenStructuredMatcher,i)},e.buildLookaheadFuncForOptionalProd=function(t,e,n,r,i,o){var a=h(t,e,i,n),u=U(a)?c.tokenStructuredMatcherNoCategories:c.tokenStructuredMatcher;return o(a[0],u,r)},e.buildAlternativesLookAheadFunc=function(t,e,n,r){var i=t.length,o=a.every(t,function(t){return a.every(t,function(t){return 1===t.length})});if(e)return function(e){for(var r=a.map(e,function(t){return t.GATE}),o=0;o<i;o++){var u=t[o],s=u.length,c=r[o];if(void 0===c||!1!==c.call(this))t:for(var l=0;l<s;l++){for(var E=u[l],p=E.length,f=0;f<p;f++){var L=this.LA(f+1);if(!1===n(L,E[f]))continue t}return o}}};if(o&&!r){var u=a.map(t,function(t){return a.flatten(t)}),s=a.reduce(u,function(t,e,n){return a.forEach(e,function(e){a.has(t,e.tokenTypeIdx)||(t[e.tokenTypeIdx]=n),a.forEach(e.categoryMatches,function(e){a.has(t,e)||(t[e]=n)})}),t},[]);return function(){var t=this.LA(1);return s[t.tokenTypeIdx]}}return function(){for(var e=0;e<i;e++){var r=t[e],o=r.length;t:for(var a=0;a<o;a++){for(var u=r[a],s=u.length,c=0;c<s;c++){var l=this.LA(c+1);if(!1===n(l,u[c]))continue t}return e}}}},e.buildSingleAlternativeLookaheadFunction=function(t,e,n){var r=a.every(t,function(t){return 1===t.length}),i=t.length;if(r&&!n){var o=a.flatten(t);if(1===o.length&&a.isEmpty(o[0].categoryMatches)){var u=o[0].tokenTypeIdx;return function(){return this.LA(1).tokenTypeIdx===u}}var s=a.reduce(o,function(t,e,n){return t[e.tokenTypeIdx]=!0,a.forEach(e.categoryMatches,function(e){t[e]=!0}),t},[]);return function(){var t=this.LA(1);return!0===s[t.tokenTypeIdx]}}return function(){t:for(var n=0;n<i;n++){for(var r=t[n],o=r.length,a=0;a<o;a++){var u=this.LA(a+1);if(!1===e(u,r[a]))continue t}return!0}return!1}};var p=function(t){function e(e,n,r){var i=t.call(this)||this;return i.topProd=e,i.targetOccurrence=n,i.targetProdType=r,i}return i(e,t),e.prototype.startWalking=function(){return this.walk(this.topProd),this.restDef},e.prototype.checkIsTarget=function(t,e,n,r){return t.idx===this.targetOccurrence&&this.targetProdType===e&&(this.restDef=n.concat(r),!0)},e.prototype.walkOption=function(e,n,r){this.checkIsTarget(e,o.OPTION,n,r)||t.prototype.walkOption.call(this,e,n,r)},e.prototype.walkAtLeastOne=function(e,n,r){this.checkIsTarget(e,o.REPETITION_MANDATORY,n,r)||t.prototype.walkOption.call(this,e,n,r)},e.prototype.walkAtLeastOneSep=function(e,n,r){this.checkIsTarget(e,o.REPETITION_MANDATORY_WITH_SEPARATOR,n,r)||t.prototype.walkOption.call(this,e,n,r)},e.prototype.walkMany=function(e,n,r){this.checkIsTarget(e,o.REPETITION,n,r)||t.prototype.walkOption.call(this,e,n,r)},e.prototype.walkManySep=function(e,n,r){this.checkIsTarget(e,o.REPETITION_WITH_SEPARATOR,n,r)||t.prototype.walkOption.call(this,e,n,r)},e}(s.RestWalker),f=function(t){function e(e,n){var r=t.call(this)||this;return r.targetOccurrence=e,r.targetProdType=n,r.result=[],r}return i(e,t),e.prototype.checkIsTarget=function(t,e){t.idx===this.targetOccurrence&&this.targetProdType===e&&(this.result=t.definition)},e.prototype.visitOption=function(t){this.checkIsTarget(t,o.OPTION)},e.prototype.visitRepetition=function(t){this.checkIsTarget(t,o.REPETITION)},e.prototype.visitRepetitionMandatory=function(t){this.checkIsTarget(t,o.REPETITION_MANDATORY)},e.prototype.visitRepetitionMandatoryWithSeparator=function(t){this.checkIsTarget(t,o.REPETITION_MANDATORY_WITH_SEPARATOR)},e.prototype.visitRepetitionWithSeparator=function(t){this.checkIsTarget(t,o.REPETITION_WITH_SEPARATOR)},e.prototype.visitAlternation=function(t){this.checkIsTarget(t,o.ALTERNATION)},e}(E.GAstVisitor);function L(t,e){function n(t,e){return a.reduce(t,function(t,n,r){if(r!==e){var i=a.map(n,function(t){return t.partialPath});return t.concat(i)}return t},[])}function r(t,e){return void 0===a.find(t,function(t){return a.every(e,function(e,n){return r=e,i=t[n],r===i||r&&i&&(r.categoryMatchesMap[i.tokenTypeIdx]||i.categoryMatchesMap[r.tokenTypeIdx]);var r,i})})}function i(t){for(var e=[],n=0;n<t;n++)e.push([]);return e}for(var o=a.map(t,function(t){return u.possiblePathsFrom([t],1)}),s=i(o.length),c=o,l=1;l<=e;l++){var E=c;c=i(E.length);for(var p=0;p<E.length;p++)for(var f=E[p],L=n(E,p),S=0;S<f.length;S++){var h=f[S].partialPath,U=f[S].suffixDef;if(r(L,h)||a.isEmpty(U)||h.length===e){var R=s[p];T(R,h)||R.push(h)}else{var d=u.possiblePathsFrom(U,l+1,h);c[p]=c[p].concat(d)}}}return s}function S(t,e,n){var r=new f(t,o.ALTERNATION);return e.accept(r),L(r.result,n)}function h(t,e,n,r){var i=new f(t,n);e.accept(i);var o=i.result,a=new p(e,t,n).startWalking();return L([new l.Flat({definition:o}),new l.Flat({definition:a})],r)}function T(t,e){return void 0!==a.find(t,function(t){return e.length===t.length&&a.every(e,function(e,n){return e===t[n]||t[n].categoryMatchesMap[e.tokenTypeIdx]})})}function U(t){return a.every(t,function(t){return a.every(t,function(t){return a.every(t,function(t){return a.isEmpty(t.categoryMatches)})})})}e.lookAheadSequenceFromAlternatives=L,e.getLookaheadPathsForOr=S,e.getLookaheadPathsForOptionalProd=h,e.containsPath=T,e.isStrictPrefixOfPath=function(t,e){return t.length<e.length&&a.every(t,function(t,n){var r=e[n];return t===r||r.categoryMatchesMap[t.tokenTypeIdx]})},e.areTokenCategoriesNotUsed=U},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(22),a=n(4),u=n(7),s=n(30),c=n(6),l=function(t){function e(e,n){var r=t.call(this)||this;return r.topProd=e,r.path=n,r.possibleTokTypes=[],r.nextProductionName=\"\",r.nextProductionOccurrence=0,r.found=!1,r.isAtEndOfPath=!1,r}return i(e,t),e.prototype.startWalking=function(){if(this.found=!1,this.path.ruleStack[0]!==this.topProd.name)throw Error(\"The path does not start with the walker's top Rule!\");return this.ruleStack=a.cloneArr(this.path.ruleStack).reverse(),this.occurrenceStack=a.cloneArr(this.path.occurrenceStack).reverse(),this.ruleStack.pop(),this.occurrenceStack.pop(),this.updateExpectedNext(),this.walk(this.topProd),this.possibleTokTypes},e.prototype.walk=function(e,n){void 0===n&&(n=[]),this.found||t.prototype.walk.call(this,e,n)},e.prototype.walkProdRef=function(t,e,n){if(t.referencedRule.name===this.nextProductionName&&t.idx===this.nextProductionOccurrence){var r=e.concat(n);this.updateExpectedNext(),this.walk(t.referencedRule,r)}},e.prototype.updateExpectedNext=function(){a.isEmpty(this.ruleStack)?(this.nextProductionName=\"\",this.nextProductionOccurrence=0,this.isAtEndOfPath=!0):(this.nextProductionName=this.ruleStack.pop(),this.nextProductionOccurrence=this.occurrenceStack.pop())},e}(o.RestWalker);e.AbstractNextPossibleTokensWalker=l;var E=function(t){function e(e,n){var r=t.call(this,e,n)||this;return r.path=n,r.nextTerminalName=\"\",r.nextTerminalOccurrence=0,r.nextTerminalName=u.tokenName(r.path.lastTok),r.nextTerminalOccurrence=r.path.lastTokOccurrence,r}return i(e,t),e.prototype.walkTerminal=function(t,e,n){if(this.isAtEndOfPath&&u.tokenName(t.terminalType)===this.nextTerminalName&&t.idx===this.nextTerminalOccurrence&&!this.found){var r=e.concat(n),i=new c.Flat({definition:r});this.possibleTokTypes=s.first(i),this.found=!0}},e}(l);e.NextAfterTokenWalker=E;var p=function(t){function e(e,n){var r=t.call(this)||this;return r.topRule=e,r.occurrence=n,r.result={token:void 0,occurrence:void 0,isEndOfRule:void 0},r}return i(e,t),e.prototype.startWalking=function(){return this.walk(this.topRule),this.result},e}(o.RestWalker);e.AbstractNextTerminalAfterProductionWalker=p;var f=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return i(e,t),e.prototype.walkMany=function(e,n,r){if(e.idx===this.occurrence){var i=a.first(n.concat(r));this.result.isEndOfRule=void 0===i,i instanceof c.Terminal&&(this.result.token=i.terminalType,this.result.occurrence=i.idx)}else t.prototype.walkMany.call(this,e,n,r)},e}(p);e.NextTerminalAfterManyWalker=f;var L=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return i(e,t),e.prototype.walkManySep=function(e,n,r){if(e.idx===this.occurrence){var i=a.first(n.concat(r));this.result.isEndOfRule=void 0===i,i instanceof c.Terminal&&(this.result.token=i.terminalType,this.result.occurrence=i.idx)}else t.prototype.walkManySep.call(this,e,n,r)},e}(p);e.NextTerminalAfterManySepWalker=L;var S=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return i(e,t),e.prototype.walkAtLeastOne=function(e,n,r){if(e.idx===this.occurrence){var i=a.first(n.concat(r));this.result.isEndOfRule=void 0===i,i instanceof c.Terminal&&(this.result.token=i.terminalType,this.result.occurrence=i.idx)}else t.prototype.walkAtLeastOne.call(this,e,n,r)},e}(p);e.NextTerminalAfterAtLeastOneWalker=S;var h=function(t){function e(){return null!==t&&t.apply(this,arguments)||this}return i(e,t),e.prototype.walkAtLeastOneSep=function(e,n,r){if(e.idx===this.occurrence){var i=a.first(n.concat(r));this.result.isEndOfRule=void 0===i,i instanceof c.Terminal&&(this.result.token=i.terminalType,this.result.occurrence=i.idx)}else t.prototype.walkAtLeastOneSep.call(this,e,n,r)},e}(p);function T(t,e,n,r){var i=a.cloneArr(n);i.push(t.name);var o=a.cloneArr(r);return o.push(1),{idx:e,def:t.definition,ruleStack:i,occurrenceStack:o}}e.NextTerminalAfterAtLeastOneSepWalker=h,e.possiblePathsFrom=function t(e,n,r){void 0===r&&(r=[]),r=a.cloneArr(r);var i=[],o=0;function u(u){var s=t(u.concat(a.drop(e,o+1)),n,r);return i.concat(s)}for(;r.length<n&&o<e.length;){var s=e[o];if(s instanceof c.Flat)return u(s.definition);if(s instanceof c.NonTerminal)return u(s.definition);if(s instanceof c.Option)i=u(s.definition);else{if(s instanceof c.RepetitionMandatory)return u(l=s.definition.concat([new c.Repetition({definition:s.definition})]));if(s instanceof c.RepetitionMandatoryWithSeparator)return u(l=[new c.Flat({definition:s.definition}),new c.Repetition({definition:[new c.Terminal({terminalType:s.separator})].concat(s.definition)})]);if(s instanceof c.RepetitionWithSeparator){var l=s.definition.concat([new c.Repetition({definition:[new c.Terminal({terminalType:s.separator})].concat(s.definition)})]);i=u(l)}else if(s instanceof c.Repetition)l=s.definition.concat([new c.Repetition({definition:s.definition})]),i=u(l);else{if(s instanceof c.Alternation)return a.forEach(s.definition,function(t){i=u(t.definition)}),i;if(!(s instanceof c.Terminal))throw Error(\"non exhaustive match\");r.push(s.terminalType)}}o++}return i.push({partialPath:r,suffixDef:a.drop(e,o)}),i},e.nextPossibleTokensAfter=function(t,e,n,r){var i=[\"EXIT_NONE_TERMINAL\"],o=!1,u=e.length,s=u-r-1,l=[],E=[];for(E.push({idx:-1,def:t,ruleStack:[],occurrenceStack:[]});!a.isEmpty(E);){var p=E.pop();if(\"EXIT_ALTERNATIVE\"!==p){var f=p.def,L=p.idx,S=p.ruleStack,h=p.occurrenceStack;if(!a.isEmpty(f)){var U=f[0];if(\"EXIT_NONE_TERMINAL\"===U){var R={idx:L,def:a.drop(f),ruleStack:a.dropRight(S),occurrenceStack:a.dropRight(h)};E.push(R)}else if(U instanceof c.Terminal)if(L<u-1){var d=L+1;n(e[d],U.terminalType)&&(R={idx:d,def:a.drop(f),ruleStack:S,occurrenceStack:h},E.push(R))}else{if(L!==u-1)throw Error(\"non exhaustive match\");l.push({nextTokenType:U.terminalType,nextTokenOccurrence:U.idx,ruleStack:S,occurrenceStack:h}),o=!0}else if(U instanceof c.NonTerminal){var O=a.cloneArr(S);O.push(U.nonTerminalName);var N=a.cloneArr(h);N.push(U.idx),R={idx:L,def:U.definition.concat(i,a.drop(f)),ruleStack:O,occurrenceStack:N},E.push(R)}else if(U instanceof c.Option){var A={idx:L,def:a.drop(f),ruleStack:S,occurrenceStack:h};E.push(A),E.push(\"EXIT_ALTERNATIVE\");var m={idx:L,def:U.definition.concat(a.drop(f)),ruleStack:S,occurrenceStack:h};E.push(m)}else if(U instanceof c.RepetitionMandatory){var C=new c.Repetition({definition:U.definition,idx:U.idx});R={idx:L,def:U.definition.concat([C],a.drop(f)),ruleStack:S,occurrenceStack:h},E.push(R)}else if(U instanceof c.RepetitionMandatoryWithSeparator){var I=new c.Terminal({terminalType:U.separator});C=new c.Repetition({definition:[I].concat(U.definition),idx:U.idx}),R={idx:L,def:U.definition.concat([C],a.drop(f)),ruleStack:S,occurrenceStack:h},E.push(R)}else if(U instanceof c.RepetitionWithSeparator){A={idx:L,def:a.drop(f),ruleStack:S,occurrenceStack:h},E.push(A),E.push(\"EXIT_ALTERNATIVE\"),I=new c.Terminal({terminalType:U.separator});var y=new c.Repetition({definition:[I].concat(U.definition),idx:U.idx});m={idx:L,def:U.definition.concat([y],a.drop(f)),ruleStack:S,occurrenceStack:h},E.push(m)}else if(U instanceof c.Repetition)A={idx:L,def:a.drop(f),ruleStack:S,occurrenceStack:h},E.push(A),E.push(\"EXIT_ALTERNATIVE\"),y=new c.Repetition({definition:U.definition,idx:U.idx}),m={idx:L,def:U.definition.concat([y],a.drop(f)),ruleStack:S,occurrenceStack:h},E.push(m);else if(U instanceof c.Alternation)for(var _=U.definition.length-1;_>=0;_--){var P={idx:L,def:U.definition[_].definition.concat(a.drop(f)),ruleStack:S,occurrenceStack:h};E.push(P),E.push(\"EXIT_ALTERNATIVE\")}else if(U instanceof c.Flat)E.push({idx:L,def:U.definition.concat(a.drop(f)),ruleStack:S,occurrenceStack:h});else{if(!(U instanceof c.Rule))throw Error(\"non exhaustive match\");E.push(T(U,L,S,h))}}}else o&&a.last(E).idx<=s&&E.pop()}return l}},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return BaseSparqlParser});var r,i=n(1),o=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=n(9).sparqlTokenMap;function s(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e]}var BaseSparqlParser=function(t){function BaseSparqlParser(e,n){void 0===e&&(e={});var r=t.call(this,n,a({recoveryEnabled:!0,outputCst:!0},e.config))||this;return r.tokenize=function(t){return r.lexer.tokenize(t).tokens},r.parse=function(t,e){void 0===e&&(e=r.SparqlDoc);var n=r.lexer.tokenize(t);r.input=n.tokens;var i=n.groups.comments||[],o=e.call(r);return{errors:r.errors,comments:i,cst:o}},r.parseGroupGraphPattern=function(t){return r.parse(t,r.GroupGraphPattern)},r.parseTriplesBlock=function(t){return r.parse(t,r.TriplesBlock)},r.SparqlDoc=r.RULE(\"SparqlDoc\",function(){s(\"SparqlDoc\"),r.MANY(function(){return r.OR([{ALT:function(){return r.SUBRULE(r.Prologue)}},{ALT:function(){return r.SUBRULE(r.QueryUnit)}},{ALT:function(){return r.SUBRULE(r.UpdateUnit)}}])})}),r.QueryUnit=r.RULE(\"QueryUnit\",function(){s(\"QueryUnit\"),r.SUBRULE(r.Query)}),r.Query=r.RULE(\"Query\",function(){s(\"Query\"),r.OR([{ALT:function(){return r.SUBRULE(r.SelectQuery)}},{ALT:function(){return r.SUBRULE(r.ConstructQuery)}},{ALT:function(){return r.SUBRULE(r.DescribeQuery)}},{ALT:function(){return r.SUBRULE(r.AskQuery)}}]),r.SUBRULE(r.ValuesClause)}),r.Constant=r.RULE(\"Constant\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.SUBRULE(r.RDFLiteral)}},{ALT:function(){return r.SUBRULE(r.NumericLiteral)}},{ALT:function(){return r.SUBRULE(r.BooleanLiteral)}}])}),r.MaxLength=r.RULE(\"MaxLength\",function(){r.CONSUME(u.MAX_LENGTH),r.CONSUME(u.INTEGER)}),r.UpdateUnit=r.RULE(\"UpdateUnit\",function(){s(\"UpdateUnit\"),r.SUBRULE(r.Update)}),r.Prologue=r.RULE(\"Prologue\",function(){s(\"Prologue\"),r.AT_LEAST_ONE(function(){return r.OR([{ALT:function(){return r.SUBRULE(r.BaseDecl)}},{ALT:function(){return r.SUBRULE(r.PrefixDecl)}}])})}),r.BaseDecl=r.RULE(\"BaseDecl\",function(){s(\"BaseDecl\"),r.CONSUME(u.BASE),r.CONSUME(u.IRIREF)}),r.PrefixDecl=r.RULE(\"PrefixDecl\",function(){s(\"PrefixDecl\"),r.CONSUME(u.PREFIX),r.CONSUME(u.PNAME_NS),r.CONSUME(u.IRIREF)}),r.SelectQuery=r.RULE(\"SelectQuery\",function(){s(\"SelectQuery\"),r.SUBRULE(r.SelectClause),r.MANY(function(){return r.SUBRULE(r.DatasetClause)}),r.SUBRULE(r.WhereClause),r.SUBRULE(r.SolutionModifier)}),r.SubSelect=r.RULE(\"SubSelect\",function(){s(\"SubSelect\"),r.SUBRULE(r.SelectClause),r.SUBRULE(r.WhereClause),r.SUBRULE(r.SolutionModifier),r.SUBRULE(r.ValuesClause)}),r.SelectClause=r.RULE(\"SelectClause\",function(){s(\"SelectClause\"),r.CONSUME(u.SELECT),r.OPTION(function(){return r.OR([{ALT:function(){return r.CONSUME(u.DISTINCT)}},{ALT:function(){return r.CONSUME(u.REDUCED)}}])}),r.OR1([{ALT:function(){r.AT_LEAST_ONE(function(){return r.OR2([{ALT:function(){return r.SUBRULE(r.Var)}},{ALT:function(){r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.AS),r.SUBRULE1(r.Var),r.CONSUME(u.RParen)}}])})}},{ALT:function(){return r.CONSUME(u.Star)}}])}),r.ConstructQuery=r.RULE(\"ConstructQuery\",function(){r.CONSUME(u.CONSTRUCT),r.OR([{ALT:function(){r.SUBRULE(r.ConstructTemplate),r.MANY(function(){return r.SUBRULE(r.DatasetClause)}),r.SUBRULE(r.WhereClause)}},{ALT:function(){r.MANY1(function(){return r.SUBRULE1(r.DatasetClause)}),r.CONSUME(u.WHERE),r.CONSUME(u.LCurly),r.OPTION(function(){return r.SUBRULE(r.TriplesTemplate)}),r.CONSUME(u.RCurly)}}]),r.SUBRULE(r.SolutionModifier)}),r.DescribeQuery=r.RULE(\"DescribeQuery\",function(){s(\"DescribeQuery\"),r.CONSUME(u.DESCRIBE),r.OR([{ALT:function(){r.AT_LEAST_ONE(function(){return r.SUBRULE(r.VarOrIri)})}},{ALT:function(){return r.CONSUME(u.Star)}}]),r.MANY(function(){return r.SUBRULE(r.DatasetClause)}),r.OPTION(function(){return r.SUBRULE(r.WhereClause)}),r.SUBRULE(r.SolutionModifier)}),r.AskQuery=r.RULE(\"AskQuery\",function(){s(\"AskQuery\"),r.CONSUME(u.ASK),r.MANY(function(){return r.SUBRULE(r.DatasetClause)}),r.SUBRULE(r.WhereClause),r.SUBRULE(r.SolutionModifier)}),r.DatasetClause=r.RULE(\"DatasetClause\",function(){s(\"DatasetClause\"),r.CONSUME(u.FROM),r.OR([{ALT:function(){return r.SUBRULE(r.DefaultGraphClause)}},{ALT:function(){return r.SUBRULE(r.NamedGraphClause)}}])}),r.DefaultGraphClause=r.RULE(\"DefaultGraphClause\",function(){s(\"DefaultGraphClause\"),r.SUBRULE(r.SourceSelector)}),r.NamedGraphClause=r.RULE(\"NamedGraphClause\",function(){s(\"NamedGraphClause\"),r.CONSUME(u.NAMED),r.SUBRULE(r.SourceSelector)}),r.SourceSelector=r.RULE(\"SourceSelector\",function(){s(\"SourceSelector\"),r.SUBRULE(r.iri)}),r.WhereClause=r.RULE(\"WhereClause\",function(){s(\"WhereClause\"),r.OPTION(function(){return r.CONSUME(u.WHERE)}),r.SUBRULE(r.GroupGraphPattern)}),r.SolutionModifier=r.RULE(\"SolutionModifier\",function(){s(\"SolutionModifier\"),r.OPTION(function(){return r.SUBRULE(r.GroupClause)}),r.OPTION1(function(){return r.SUBRULE(r.HavingClause)}),r.OPTION2(function(){return r.SUBRULE(r.OrderClause)}),r.OPTION3(function(){return r.SUBRULE(r.LimitOffsetClause)})}),r.GroupClause=r.RULE(\"GroupClause\",function(){s(\"GroupClause\"),r.CONSUME(u.GROUP_BY),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.GroupCondition)})}),r.GroupCondition=r.RULE(\"GroupCondition\",function(){s(\"GroupCondition\"),r.OR([{ALT:function(){return r.SUBRULE(r.BuiltInCall)}},{ALT:function(){return r.SUBRULE(r.FunctionCall)}},{ALT:function(){r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.OPTION(function(){r.CONSUME(u.AS),r.SUBRULE(r.Var)}),r.CONSUME(u.RParen)}},{ALT:function(){return r.SUBRULE1(r.Var)}}])}),r.HavingClause=r.RULE(\"HavingClause\",function(){s(\"HavingClause\"),r.CONSUME(u.HAVING),r.SUBRULE(r.HavingCondition)}),r.HavingCondition=r.RULE(\"HavingCondition\",function(){s(\"HavingCondition\"),r.SUBRULE(r.Constraint)}),r.OrderClause=r.RULE(\"OrderClause\",function(){s(\"OrderClause\"),r.CONSUME(u.ORDER_BY),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.OrderCondition)})}),r.OrderCondition=r.RULE(\"OrderCondition\",function(){s(\"OrderCondition\"),r.OR([{ALT:function(){r.OR1([{ALT:function(){return r.CONSUME(u.ASC)}},{ALT:function(){return r.CONSUME(u.DESC)}}]),r.SUBRULE(r.BrackettedExpression)}},{ALT:function(){return r.SUBRULE(r.Constraint)}},{ALT:function(){return r.SUBRULE(r.Var)}}])}),r.LimitOffsetClause=r.RULE(\"LimitOffsetClause\",function(){s(\"LimitOffsetClause\"),r.OR([{ALT:function(){r.SUBRULE(r.LimitClause),r.OPTION(function(){return r.SUBRULE(r.OffsetClause)})}},{ALT:function(){r.SUBRULE1(r.OffsetClause),r.OPTION1(function(){return r.SUBRULE1(r.LimitClause)})}}])}),r.OffsetClause=r.RULE(\"OffsetClause\",function(){s(\"OffsetClause\"),r.CONSUME(u.OFFSET),r.CONSUME(u.INTEGER)}),r.LimitClause=r.RULE(\"LimitClause\",function(){s(\"LimitClause\"),r.CONSUME(u.LIMIT),r.CONSUME(u.INTEGER)}),r.ValuesClause=r.RULE(\"ValuesClause\",function(){s(\"ValuesClause\"),r.OPTION(function(){r.CONSUME(u.VALUES),r.SUBRULE(r.DataBlock)})}),r.Update=r.RULE(\"Update\",function(){s(\"Update\"),r.SUBRULE(r.Update1),r.OPTION(function(){r.CONSUME(u.Semicolon),r.SUBRULE(r.Update)})}),r.Update1=r.RULE(\"Update1\",function(){s(\"Update1\"),r.OR([{ALT:function(){return r.SUBRULE(r.Load)}},{ALT:function(){return r.SUBRULE(r.Clear)}},{ALT:function(){return r.SUBRULE(r.Drop)}},{ALT:function(){return r.SUBRULE(r.Add)}},{ALT:function(){return r.SUBRULE(r.Move)}},{ALT:function(){return r.SUBRULE(r.Copy)}},{ALT:function(){return r.SUBRULE(r.Create)}},{ALT:function(){return r.SUBRULE(r.InsertData)}},{ALT:function(){return r.SUBRULE(r.DeleteData)}},{ALT:function(){return r.SUBRULE(r.DeleteWhere)}},{ALT:function(){return r.SUBRULE(r.Modify)}}])}),r.Load=r.RULE(\"Load\",function(){s(\"Load\"),r.CONSUME(u.LOAD),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.iri),r.OPTION1(function(){r.CONSUME(u.INTO),r.SUBRULE(r.GraphRef)})}),r.Clear=r.RULE(\"Clear\",function(){s(\"Clear\"),r.CONSUME(u.CLEAR),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphRefAll)}),r.Drop=r.RULE(\"Drop\",function(){s(\"Drop\"),r.CONSUME(u.DROP),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphRefAll)}),r.Create=r.RULE(\"Create\",function(){s(\"Create\"),r.CONSUME(u.CREATE),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphRefAll)}),r.Add=r.RULE(\"Add\",function(){s(\"Add\"),r.CONSUME(u.ADD),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphOrDefault),r.CONSUME(u.TO),r.SUBRULE1(r.GraphOrDefault)}),r.Move=r.RULE(\"Move\",function(){s(\"Move\"),r.CONSUME(u.MOVE),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphOrDefault),r.CONSUME(u.TO),r.SUBRULE1(r.GraphOrDefault)}),r.Copy=r.RULE(\"Copy\",function(){s(\"Copy\"),r.CONSUME(u.COPY),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.GraphOrDefault),r.CONSUME(u.TO),r.SUBRULE1(r.GraphOrDefault)}),r.InsertData=r.RULE(\"InsertData\",function(){s(\"InsertData\"),r.CONSUME(u.INSERT_DATA),r.SUBRULE(r.QuadData)}),r.DeleteData=r.RULE(\"DeleteData\",function(){s(\"DeleteData\"),r.CONSUME(u.DELETE_DATA),r.SUBRULE(r.QuadData)}),r.DeleteWhere=r.RULE(\"DeleteWhere\",function(){s(\"DeleteWhere\"),r.CONSUME(u.DELETE_WHERE),r.SUBRULE(r.QuadPattern)}),r.Modify=r.RULE(\"Modify\",function(){s(\"Modify\"),r.OPTION(function(){r.CONSUME(u.WITH),r.SUBRULE(r.iri)}),r.OR([{ALT:function(){r.SUBRULE(r.DeleteClause),r.OPTION1(function(){return r.SUBRULE(r.InsertClause)})}},{ALT:function(){return r.SUBRULE1(r.InsertClause)}}]),r.MANY(function(){return r.SUBRULE(r.UsingClause)}),r.CONSUME(u.WHERE),r.SUBRULE(r.GroupGraphPattern)}),r.DeleteClause=r.RULE(\"DeleteClause\",function(){s(\"DeleteClause\"),r.CONSUME(u.DELETE),r.SUBRULE(r.QuadPattern)}),r.InsertClause=r.RULE(\"InsertClause\",function(){s(\"InsertClause\"),r.CONSUME(u.INSERT),r.SUBRULE(r.QuadPattern)}),r.UsingClause=r.RULE(\"UsingClause\",function(){s(\"UsingClause\"),r.CONSUME(u.USING),r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){r.CONSUME(u.NAMED),r.SUBRULE1(r.iri)}}])}),r.GraphOrDefault=r.RULE(\"GraphOrDefault\",function(){s(\"GraphOrDefault\"),r.OR([{ALT:function(){return r.CONSUME(u.DEFAULT)}},{ALT:function(){r.OPTION(function(){return r.CONSUME(u.GRAPH)}),r.SUBRULE(r.iri)}}])}),r.GraphRef=r.RULE(\"GraphRef\",function(){s(\"GraphRef\"),r.CONSUME(u.GRAPH),r.SUBRULE(r.iri)}),r.GraphRefAll=r.RULE(\"GraphRefAll\",function(){s(\"GraphRefAll\"),r.OR([{ALT:function(){return r.SUBRULE(r.GraphRef)}},{ALT:function(){return r.CONSUME(u.DEFAULT)}},{ALT:function(){return r.CONSUME(u.NAMED)}},{ALT:function(){return r.CONSUME(u.ALL)}}])}),r.QuadPattern=r.RULE(\"QuadPattern\",function(){s(\"QuadPattern\"),r.CONSUME(u.LCurly),r.SUBRULE(r.Quads),r.CONSUME(u.RCurly)}),r.QuadData=r.RULE(\"QuadData\",function(){s(\"QuadData\"),r.CONSUME(u.LCurly),r.SUBRULE(r.Quads),r.CONSUME(u.RCurly)}),r.Quads=r.RULE(\"Quads\",function(){s(\"Quads\"),r.OPTION(function(){return r.SUBRULE(r.TriplesTemplate)}),r.MANY(function(){r.SUBRULE(r.QuadsNotTriples),r.OPTION1(function(){return r.CONSUME(u.Period)}),r.OPTION2(function(){return r.SUBRULE1(r.TriplesTemplate)})})}),r.QuadsNotTriples=r.RULE(\"QuadsNotTriples\",function(){s(\"QuadsNotTriples\"),r.CONSUME(u.GRAPH),r.SUBRULE(r.VarOrIri),r.CONSUME(u.LCurly),r.OPTION(function(){return r.SUBRULE(r.TriplesTemplate)}),r.CONSUME(u.RCurly)}),r.TriplesTemplate=r.RULE(\"TriplesTemplate\",function(){s(\"TriplesTemplate\"),r.SUBRULE(r.TriplesSameSubject),r.OPTION(function(){r.CONSUME(u.Period),r.OPTION1(function(){return r.SUBRULE(r.TriplesTemplate)})})}),r.GroupGraphPattern=r.RULE(\"GroupGraphPattern\",function(){s(\"GroupGraphPattern\"),r.CONSUME(u.LCurly),r.OR([{ALT:function(){return r.SUBRULE(r.SubSelect)}},{ALT:function(){return r.SUBRULE(r.GroupGraphPatternSub)}}]),r.CONSUME(u.RCurly)}),r.GroupGraphPatternSub=r.RULE(\"GroupGraphPatternSub\",function(){s(\"GroupGraphPatternSub\"),r.OPTION(function(){return r.SUBRULE(r.TriplesBlock)}),r.MANY(function(){r.SUBRULE(r.GraphPatternNotTriples),r.OPTION1(function(){return r.CONSUME(u.Period)}),r.OPTION2(function(){return r.SUBRULE1(r.TriplesBlock)})})}),r.TriplesBlock=r.RULE(\"TriplesBlock\",function(){s(\"TriplesBlock\"),r.SUBRULE(r.TriplesSameSubjectPath),r.OPTION(function(){r.CONSUME(u.Period),r.OPTION1(function(){return r.SUBRULE(r.TriplesBlock)})})}),r.GraphPatternNotTriples=r.RULE(\"GraphPatternNotTriples\",function(){s(\"GraphPatternNotTriples\"),r.OR([{ALT:function(){return r.SUBRULE(r.GroupOrUnionGraphPattern)}},{ALT:function(){return r.SUBRULE(r.OptionalGraphPattern)}},{ALT:function(){return r.SUBRULE(r.MinusGraphPattern)}},{ALT:function(){return r.SUBRULE(r.GraphGraphPattern)}},{ALT:function(){return r.SUBRULE(r.ServiceGraphPattern)}},{ALT:function(){return r.SUBRULE(r.Filter)}},{ALT:function(){return r.SUBRULE(r.Bind)}},{ALT:function(){return r.SUBRULE(r.InlineData)}}])}),r.OptionalGraphPattern=r.RULE(\"OptionalGraphPattern\",function(){s(\"OptionalGraphPattern\"),r.CONSUME(u.OPTIONAL),r.SUBRULE(r.GroupGraphPattern)}),r.GraphGraphPattern=r.RULE(\"GraphGraphPattern\",function(){s(\"GraphGraphPattern\"),r.CONSUME(u.GRAPH),r.SUBRULE(r.VarOrIri),r.SUBRULE(r.GroupGraphPattern)}),r.ServiceGraphPattern=r.RULE(\"ServiceGraphPattern\",function(){s(\"ServiceGraphPattern\"),r.CONSUME(u.SERVICE),r.OPTION(function(){return r.CONSUME(u.SILENT)}),r.SUBRULE(r.VarOrIri),r.SUBRULE(r.GroupGraphPattern)}),r.Bind=r.RULE(\"Bind\",function(){s(\"Bind\"),r.CONSUME(u.BIND),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.AS),r.SUBRULE(r.Var),r.CONSUME(u.RParen)}),r.InlineData=r.RULE(\"InlineData\",function(){s(\"InlineData\"),r.CONSUME(u.VALUES),r.SUBRULE(r.DataBlock)}),r.DataBlock=r.RULE(\"DataBlock\",function(){s(\"DataBlock\"),r.OR([{ALT:function(){return r.SUBRULE(r.InlineDataOneVar)}},{ALT:function(){return r.SUBRULE(r.InlineDataFull)}}])}),r.InlineDataOneVar=r.RULE(\"InlineDataOneVar\",function(){s(\"InlineDataOneVar\"),r.SUBRULE(r.Var),r.CONSUME(u.LCurly),r.MANY(function(){return r.SUBRULE(r.DataBlockValue)}),r.CONSUME(u.RCurly)}),r.InlineDataFull=r.RULE(\"InlineDataFull\",function(){s(\"InlineDataFull\"),r.OR([{ALT:function(){return r.CONSUME(u.NIL)}},{ALT:function(){r.CONSUME(u.LParen),r.MANY(function(){return r.SUBRULE(r.Var)}),r.CONSUME(u.RParen)}}]),r.CONSUME(u.LCurly),r.MANY1(function(){return r.OR1([{ALT:function(){r.CONSUME1(u.LParen),r.MANY2(function(){return r.SUBRULE(r.DataBlockValue)}),r.CONSUME1(u.RParen)}},{ALT:function(){return r.CONSUME1(u.NIL)}}])}),r.CONSUME(u.RCurly)}),r.DataBlockValue=r.RULE(\"DataBlockValue\",function(){s(\"DataBlockValue\"),r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.SUBRULE(r.RDFLiteral)}},{ALT:function(){return r.SUBRULE(r.NumericLiteral)}},{ALT:function(){return r.SUBRULE(r.BooleanLiteral)}},{ALT:function(){return r.CONSUME(u.UNDEF)}}])}),r.MinusGraphPattern=r.RULE(\"MinusGraphPattern\",function(){s(\"MinusGraphPattern\"),r.CONSUME(u.MINUS),r.SUBRULE(r.GroupGraphPattern)}),r.GroupOrUnionGraphPattern=r.RULE(\"GroupOrUnionGraphPattern\",function(){s(\"GroupOrUnionGraphPattern\"),r.SUBRULE(r.GroupGraphPattern),r.MANY(function(){r.CONSUME(u.UNION),r.SUBRULE1(r.GroupGraphPattern)})}),r.Filter=r.RULE(\"Filter\",function(){s(\"Filter\"),r.CONSUME(u.FILTER),r.SUBRULE(r.Constraint)}),r.Constraint=r.RULE(\"Constraint\",function(){s(\"Constraint\"),r.OR([{ALT:function(){return r.SUBRULE(r.BrackettedExpression)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall)}},{ALT:function(){return r.SUBRULE(r.FunctionCall)}}])}),r.FunctionCall=r.RULE(\"FunctionCall\",function(){s(\"FunctionCall\"),r.SUBRULE(r.iri),r.SUBRULE(r.ArgList)}),r.ArgList=r.RULE(\"ArgList\",function(){s(\"ArgList\"),r.OR([{ALT:function(){return r.CONSUME(u.NIL)}},{ALT:function(){r.CONSUME(u.LParen),r.OPTION(function(){return r.CONSUME(u.DISTINCT)}),r.SUBRULE(r.Expression),r.MANY(function(){r.CONSUME(u.Comma),r.SUBRULE1(r.Expression)}),r.CONSUME(u.RParen)}}])}),r.ExpressionList=r.RULE(\"ExpressionList\",function(){s(\"ExpressionList\"),r.OR([{ALT:function(){return r.CONSUME(u.NIL)}},{ALT:function(){r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.MANY(function(){r.CONSUME(u.Comma),r.SUBRULE1(r.Expression)}),r.CONSUME(u.RParen)}}])}),r.ConstructTemplate=r.RULE(\"ConstructTemplate\",function(){s(\"ConstructTemplate\"),r.CONSUME(u.LCurly),r.OPTION(function(){return r.SUBRULE(r.ConstructTriples)}),r.CONSUME(u.RCurly)}),r.ConstructTriples=r.RULE(\"ConstructTriples\",function(){s(\"ConstructTriples\"),r.SUBRULE(r.TriplesSameSubject),r.OPTION(function(){r.CONSUME(u.Period),r.OPTION1(function(){return r.SUBRULE(r.ConstructTriples)})})}),r.TriplesSameSubject=r.RULE(\"TriplesSameSubject\",function(){s(\"TriplesSameSubject\"),r.OR([{ALT:function(){r.SUBRULE(r.VarOrTerm),r.SUBRULE(r.PropertyListNotEmpty)}},{ALT:function(){r.SUBRULE(r.TriplesNode),r.SUBRULE(r.PropertyList)}}])}),r.PropertyList=r.RULE(\"PropertyList\",function(){s(\"PropertyList\"),r.OPTION(function(){return r.SUBRULE(r.PropertyListNotEmpty)})}),r.PropertyListNotEmpty=r.RULE(\"PropertyListNotEmpty\",function(){s(\"PropertyListNotEmpty\"),r.SUBRULE(r.Verb),r.SUBRULE(r.ObjectList),r.MANY(function(){r.CONSUME(u.Semicolon),r.OPTION(function(){r.SUBRULE1(r.Verb),r.SUBRULE1(r.ObjectList)})})}),r.Verb=r.RULE(\"Verb\",function(){s(\"Verb\"),r.OR([{ALT:function(){return r.SUBRULE(r.VarOrIri)}},{ALT:function(){return r.CONSUME(u.A)}}])}),r.ObjectList=r.RULE(\"ObjectList\",function(){s(\"ObjectList\"),r.AT_LEAST_ONE_SEP({SEP:u.Comma,DEF:function(){return r.SUBRULE(r.Object)}})}),r.Object=r.RULE(\"Object\",function(){s(\"Object\"),r.SUBRULE(r.GraphNode)}),r.TriplesSameSubjectPath=r.RULE(\"TriplesSameSubjectPath\",function(){s(\"TriplesSameSubjectPath\"),r.OR([{ALT:function(){r.SUBRULE(r.VarOrTerm),r.SUBRULE(r.PropertyListPathNotEmpty)}},{ALT:function(){r.SUBRULE(r.TriplesNodePath),r.SUBRULE(r.PropertyListPath)}}])}),r.PropertyListPath=r.RULE(\"PropertyListPath\",function(){s(\"PropertyListPath\"),r.OPTION(function(){return r.SUBRULE(r.PropertyListPathNotEmpty)})}),r.PropertyListPathNotEmpty=r.RULE(\"PropertyListPathNotEmpty\",function(){s(\"PropertyListPathNotEmpty\"),r.OR([{ALT:function(){return r.SUBRULE(r.VerbPath)}},{ALT:function(){return r.SUBRULE(r.VerbSimple)}}]),r.SUBRULE(r.ObjectListPath),r.MANY(function(){r.CONSUME(u.Semicolon),r.OPTION(function(){r.OR1([{ALT:function(){return r.SUBRULE1(r.VerbPath)}},{ALT:function(){return r.SUBRULE1(r.VerbSimple)}}]),r.SUBRULE1(r.ObjectListPath)})})}),r.VerbPath=r.RULE(\"VerbPath\",function(){s(\"VerbPath\"),r.SUBRULE(r.Path)}),r.VerbSimple=r.RULE(\"VerbSimple\",function(){s(\"VerbSimple\"),r.SUBRULE(r.Var)}),r.ObjectListPath=r.RULE(\"ObjectListPath\",function(){s(\"ObjectListPath\"),r.AT_LEAST_ONE_SEP({SEP:u.Comma,DEF:function(){return r.SUBRULE(r.ObjectPath)}})}),r.ObjectPath=r.RULE(\"ObjectPath\",function(){s(\"ObjectPath\"),r.SUBRULE(r.GraphNodePath)}),r.Path=r.RULE(\"Path\",function(){s(\"Path\"),r.SUBRULE(r.PathAlternative)}),r.PathAlternative=r.RULE(\"PathAlternative\",function(){s(\"PathAlternative\"),r.AT_LEAST_ONE_SEP({SEP:u.Pipe,DEF:function(){return r.SUBRULE(r.PathSequence)}})}),r.PathSequence=r.RULE(\"PathSequence\",function(){s(\"PathSequence\"),r.AT_LEAST_ONE_SEP({SEP:u.ForwardSlash,DEF:function(){return r.SUBRULE(r.PathEltOrInverse)}})}),r.PathElt=r.RULE(\"PathElt\",function(){s(\"PathElt\"),r.SUBRULE(r.PathPrimary),r.OPTION(function(){return r.SUBRULE(r.PathMod)})}),r.PathEltOrInverse=r.RULE(\"PathEltOrInverse\",function(){s(\"PathEltOrInverse\"),r.OPTION(function(){return r.CONSUME(u.Caret)}),r.SUBRULE(r.PathElt)}),r.PathMod=r.RULE(\"PathMod\",function(){s(\"PathMod\"),r.OR([{ALT:function(){return r.CONSUME(u.QuestionMark)}},{ALT:function(){return r.CONSUME(u.Star)}},{ALT:function(){return r.CONSUME(u.Plus)}}])}),r.PathPrimary=r.RULE(\"PathPrimary\",function(){s(\"PathPrimary\"),r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.CONSUME(u.A)}},{ALT:function(){r.CONSUME(u.Bang),r.SUBRULE(r.PathNegatedPropertySet)}},{ALT:function(){r.CONSUME(u.LParen),r.SUBRULE(r.Path),r.CONSUME(u.RParen)}}])}),r.PathNegatedPropertySet=r.RULE(\"PathNegatedPropertySet\",function(){s(\"PathNegatedPropertySet\"),r.OR([{ALT:function(){return r.SUBRULE(r.PathOneInPropertySet)}},{ALT:function(){r.CONSUME(u.LParen),r.MANY_SEP({SEP:u.Pipe,DEF:function(){return r.SUBRULE1(r.PathOneInPropertySet)}}),r.CONSUME(u.RParen)}}])}),r.PathOneInPropertySet=r.RULE(\"PathOneInPropertySet\",function(){s(\"PathOneInPropertySet\"),r.OPTION(function(){return r.CONSUME(u.Caret)}),r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.CONSUME(u.A)}}])}),r.Integer=r.RULE(\"Integer\",function(){s(\"Integer\"),r.CONSUME(u.INTEGER)}),r.TriplesNode=r.RULE(\"TriplesNode\",function(){s(\"TriplesNode\"),r.OR([{ALT:function(){return r.SUBRULE(r.Collection)}},{ALT:function(){return r.SUBRULE(r.BlankNodePropertyList)}}])}),r.BlankNodePropertyList=r.RULE(\"BlankNodePropertyList\",function(){s(\"BlankNodePropertyList\"),r.CONSUME(u.LBracket),r.SUBRULE(r.PropertyListNotEmpty),r.CONSUME(u.RBracket)}),r.TriplesNodePath=r.RULE(\"TriplesNodePath\",function(){s(\"TriplesNodePath\"),r.OR([{ALT:function(){return r.SUBRULE(r.CollectionPath)}},{ALT:function(){return r.SUBRULE(r.BlankNodePropertyListPath)}}])}),r.BlankNodePropertyListPath=r.RULE(\"BlankNodePropertyListPath\",function(){s(\"BlankNodePropertyListPath\"),r.CONSUME(u.LBracket),r.SUBRULE(r.PropertyListPathNotEmpty),r.CONSUME(u.RBracket)}),r.Collection=r.RULE(\"Collection\",function(){s(\"Collection\"),r.CONSUME(u.LParen),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.GraphNode)}),r.CONSUME(u.RParen)}),r.CollectionPath=r.RULE(\"CollectionPath\",function(){s(\"CollectionPath\"),r.CONSUME(u.LParen),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.GraphNodePath)}),r.CONSUME(u.RParen)}),r.GraphNode=r.RULE(\"GraphNode\",function(){s(\"GraphNode\"),r.OR([{ALT:function(){return r.SUBRULE(r.VarOrTerm)}},{ALT:function(){return r.SUBRULE(r.TriplesNode)}}])}),r.GraphNodePath=r.RULE(\"GraphNodePath\",function(){s(\"GraphNodePath\"),r.OR([{ALT:function(){return r.SUBRULE(r.VarOrTerm)}},{ALT:function(){return r.SUBRULE(r.TriplesNodePath)}}])}),r.VarOrTerm=r.RULE(\"VarOrTerm\",function(){s(\"VarOrTerm\"),r.OR([{ALT:function(){return r.SUBRULE(r.Var)}},{ALT:function(){return r.SUBRULE(r.GraphTerm)}}])}),r.VarOrIri=r.RULE(\"VarOrIri\",function(){s(\"VarOrIri\"),r.OR([{ALT:function(){return r.SUBRULE(r.Var)}},{ALT:function(){return r.SUBRULE(r.iri)}}])}),r.Var=r.RULE(\"Var\",function(){s(\"Var\"),r.OR([{ALT:function(){return r.CONSUME(u.VAR1)}},{ALT:function(){return r.CONSUME(u.VAR2)}}])}),r.GraphTerm=r.RULE(\"GraphTerm\",function(){s(\"GraphTerm\"),r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.SUBRULE(r.RDFLiteral)}},{ALT:function(){return r.SUBRULE(r.NumericLiteral)}},{ALT:function(){return r.SUBRULE(r.BooleanLiteral)}},{ALT:function(){return r.SUBRULE(r.BlankNode)}},{ALT:function(){return r.CONSUME(u.NIL)}}])}),r.Expression=r.RULE(\"Expression\",function(){s(\"Expression\"),r.SUBRULE(r.ConditionalOrExpression)}),r.ConditionalOrExpression=r.RULE(\"ConditionalOrExpression\",function(){s(\"ConditionalOrExpression\"),r.AT_LEAST_ONE_SEP({SEP:u.LogicalOr,DEF:function(){return r.SUBRULE(r.ConditionalAndExpression)}})}),r.ConditionalAndExpression=r.RULE(\"ConditionalAndExpression\",function(){s(\"ConditionalAndExpression\"),r.AT_LEAST_ONE_SEP({SEP:u.LogicalAnd,DEF:function(){return r.SUBRULE(r.ValueLogical)}})}),r.ValueLogical=r.RULE(\"ValueLogical\",function(){s(\"ValueLogical\"),r.SUBRULE(r.RelationalExpression)}),r.RelationalExpression=r.RULE(\"RelationalExpression\",function(){s(\"RelationalExpression\"),r.SUBRULE(r.NumericExpression),r.OPTION(function(){return r.OR([{ALT:function(){r.OR1([{ALT:function(){return r.CONSUME(u.Equals)}},{ALT:function(){return r.CONSUME(u.NotEquals)}},{ALT:function(){return r.CONSUME(u.LessThan)}},{ALT:function(){return r.CONSUME(u.GreaterThan)}},{ALT:function(){return r.CONSUME(u.LessThanEquals)}},{ALT:function(){return r.CONSUME(u.GreaterThanEquals)}}]),r.SUBRULE1(r.NumericExpression)}},{ALT:function(){r.CONSUME(u.IN),r.SUBRULE(r.ExpressionList)}},{ALT:function(){r.CONSUME(u.NOT_IN),r.SUBRULE1(r.ExpressionList)}}])})}),r.NumericExpression=r.RULE(\"NumericExpression\",function(){s(\"NumericExpression\"),r.SUBRULE(r.AdditiveExpression)}),r.AdditiveExpression=r.RULE(\"AdditiveExpression\",function(){s(\"AdditiveExpression\"),r.SUBRULE(r.MultiplicativeExpression),r.MANY(function(){return r.OR([{ALT:function(){r.OR1([{ALT:function(){return r.CONSUME(u.Plus)}},{ALT:function(){return r.CONSUME(u.Minus)}}]),r.SUBRULE1(r.MultiplicativeExpression)}},{ALT:function(){r.OR2([{ALT:function(){return r.SUBRULE(r.NumericLiteralPositive)}},{ALT:function(){return r.SUBRULE(r.NumericLiteralNegative)}}]),r.MANY1(function(){return r.OR3([{ALT:function(){r.OR4([{ALT:function(){return r.CONSUME(u.Star)}},{ALT:function(){return r.CONSUME(u.ForwardSlash)}}]),r.SUBRULE1(r.UnaryExpression)}}])})}}])})}),r.MultiplicativeExpression=r.RULE(\"MultiplicativeExpression\",function(){s(\"MultiplicativeExpression\"),r.SUBRULE(r.UnaryExpression),r.MANY(function(){return r.OR([{ALT:function(){r.CONSUME(u.Star),r.SUBRULE1(r.UnaryExpression)}},{ALT:function(){r.CONSUME(u.ForwardSlash),r.SUBRULE2(r.UnaryExpression)}}])})}),r.UnaryExpression=r.RULE(\"UnaryExpression\",function(){s(\"UnaryExpression\"),r.OR([{ALT:function(){r.CONSUME(u.Bang),r.SUBRULE(r.PrimaryExpression)}},{ALT:function(){r.CONSUME(u.Plus),r.SUBRULE1(r.PrimaryExpression)}},{ALT:function(){r.CONSUME(u.Minus),r.SUBRULE2(r.PrimaryExpression)}},{ALT:function(){return r.SUBRULE3(r.PrimaryExpression)}}])}),r.PrimaryExpression=r.RULE(\"PrimaryExpression\",function(){s(\"PrimaryExpression\"),r.OR([{ALT:function(){return r.SUBRULE(r.BrackettedExpression)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall)}},{ALT:function(){return r.SUBRULE(r.iriOrFunction)}},{ALT:function(){return r.SUBRULE(r.RDFLiteral)}},{ALT:function(){return r.SUBRULE(r.NumericLiteral)}},{ALT:function(){return r.SUBRULE(r.BooleanLiteral)}},{ALT:function(){return r.SUBRULE(r.Var)}}])}),r.BrackettedExpression=r.RULE(\"BrackettedExpression\",function(){s(\"BrackettedExpression\"),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STR=r.RULE(\"BuiltInCall_STR\",function(){s(\"BuiltInCall_STR\"),r.CONSUME(u.STR),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_LANG=r.RULE(\"BuiltInCall_LANG\",function(){s(\"BuiltInCall_LANG\"),r.CONSUME(u.LANG),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_LANGMATCHES=r.RULE(\"BuiltInCall_LANGMATCHES\",function(){s(\"BuiltInCall_LANGMATCHES\"),r.CONSUME(u.LANGMATCHES),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_DATATYPE=r.RULE(\"BuiltInCall_DATATYPE\",function(){s(\"BuiltInCall_DATATYPE\"),r.CONSUME(u.DATATYPE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_BOUND=r.RULE(\"BuiltInCall_BOUND\",function(){s(\"BuiltInCall_BOUND\"),r.CONSUME(u.BOUND),r.CONSUME(u.LParen),r.SUBRULE(r.Var),r.CONSUME(u.RParen)}),r.BuiltInCall_IRI=r.RULE(\"BuiltInCall_IRI\",function(){s(\"BuiltInCall_IRI\"),r.CONSUME(u.IRI),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_URI=r.RULE(\"BuiltInCall_URI\",function(){s(\"BuiltInCall_URI\"),r.CONSUME(u.URI),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_BNODE=r.RULE(\"BuiltInCall_BNODE\",function(){s(\"BuiltInCall_BNODE\"),r.CONSUME(u.BNODE),r.OR([{ALT:function(){r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}},{ALT:function(){return r.CONSUME(u.NIL)}}])}),r.BuiltInCall_RAND=r.RULE(\"BuiltInCall_RAND\",function(){s(\"BuiltInCall_RAND\"),r.CONSUME(u.RAND),r.CONSUME(u.NIL)}),r.BuiltInCall_ABS=r.RULE(\"BuiltInCall_ABS\",function(){s(\"BuiltInCall_ABS\"),r.CONSUME(u.ABS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_CEIL=r.RULE(\"BuiltInCall_CEIL\",function(){s(\"BuiltInCall_CEIL\"),r.CONSUME(u.CEIL),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_FLOOR=r.RULE(\"BuiltInCall_FLOOR\",function(){s(\"BuiltInCall_FLOOR\"),r.CONSUME(u.FLOOR),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_ROUND=r.RULE(\"BuiltInCall_ROUND\",function(){s(\"BuiltInCall_ROUND\"),r.CONSUME(u.ROUND),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_CONCAT=r.RULE(\"BuiltInCall_CONCAT\",function(){s(\"BuiltInCall_CONCAT\"),r.CONSUME(u.CONCAT),r.SUBRULE(r.ExpressionList)}),r.BuiltInCall_STRLEN=r.RULE(\"BuiltInCall_STRLEN\",function(){s(\"BuiltInCall_STRLEN\"),r.CONSUME(u.STRLEN),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_UCASE=r.RULE(\"BuiltInCall_UCASE\",function(){s(\"BuiltInCall_UCASE\"),r.CONSUME(u.UCASE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_LCASE=r.RULE(\"BuiltInCall_LCASE\",function(){s(\"BuiltInCall_LCASE\"),r.CONSUME(u.LCASE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_ENCODE_FOR_URI=r.RULE(\"BuiltInCall_ENCODE_FOR_URI\",function(){s(\"BuiltInCall_ENCODE_FOR_URI\"),r.CONSUME(u.ENCODE_FOR_URI),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_CONTAINS=r.RULE(\"BuiltInCall_CONTAINS\",function(){s(\"BuiltInCall_CONTAINS\"),r.CONSUME(u.CONTAINS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRSTARTS=r.RULE(\"BuiltInCall_STRSTARTS\",function(){s(\"BuiltInCall_STRSTARTS\"),r.CONSUME(u.STRSTARTS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRENDS=r.RULE(\"BuiltInCall_STRENDS\",function(){s(\"BuiltInCall_STRENDS\"),r.CONSUME(u.STRENDS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRBEFORE=r.RULE(\"BuiltInCall_STRBEFORE\",function(){s(\"BuiltInCall_STRBEFORE\"),r.CONSUME(u.STRBEFORE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRAFTER=r.RULE(\"BuiltInCall_STRAFTER\",function(){s(\"BuiltInCall_STRAFTER\"),r.CONSUME(u.STRAFTER),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_YEAR=r.RULE(\"BuiltInCall_YEAR\",function(){s(\"BuiltInCall_YEAR\"),r.CONSUME(u.YEAR),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_MONTH=r.RULE(\"BuiltInCall_MONTH\",function(){s(\"BuiltInCall_MONTH\"),r.CONSUME(u.MONTH),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_DAY=r.RULE(\"BuiltInCall_DAY\",function(){s(\"BuiltInCall_DAY\"),r.CONSUME(u.DAY),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_HOURS=r.RULE(\"BuiltInCall_HOURS\",function(){s(\"BuiltInCall_HOURS\"),r.CONSUME(u.HOURS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_MINUTES=r.RULE(\"BuiltInCall_MINUTES\",function(){s(\"BuiltInCall_MINUTES\"),r.CONSUME(u.MINUTES),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_SECONDS=r.RULE(\"BuiltInCall_SECONDS\",function(){s(\"BuiltInCall_SECONDS\"),r.CONSUME(u.SECONDS),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_TIMEZONE=r.RULE(\"BuiltInCall_TIMEZONE\",function(){s(\"BuiltInCall_TIMEZONE\"),r.CONSUME(u.TIMEZONE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_TZ=r.RULE(\"BuiltInCall_TZ\",function(){s(\"BuiltInCall_TZ\"),r.CONSUME(u.TZ),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_NOW=r.RULE(\"BuiltInCall_NOW\",function(){s(\"BuiltInCall_NOW\"),r.CONSUME(u.NOW),r.CONSUME(u.NIL)}),r.BuiltInCall_UUID=r.RULE(\"BuiltInCall_UUID\",function(){s(\"BuiltInCall_UUID\"),r.CONSUME(u.UUID),r.CONSUME(u.NIL)}),r.BuiltInCall_STRUUID=r.RULE(\"BuiltInCall_STRUUID\",function(){s(\"BuiltInCall_STRUUID\"),r.CONSUME(u.STRUUID),r.CONSUME(u.NIL)}),r.BuiltInCall_MD5=r.RULE(\"BuiltInCall_MD5\",function(){s(\"BuiltInCall_MD5\"),r.CONSUME(u.MD5),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_SHA1=r.RULE(\"BuiltInCall_SHA1\",function(){s(\"BuiltInCall_SHA1\"),r.CONSUME(u.SHA1),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_SHA256=r.RULE(\"BuiltInCall_SHA256\",function(){s(\"BuiltInCall_SHA256\"),r.CONSUME(u.SHA256),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_SHA384=r.RULE(\"BuiltInCall_SHA384\",function(){s(\"BuiltInCall_SHA384\"),r.CONSUME(u.SHA384),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_SHA512=r.RULE(\"BuiltInCall_SHA512\",function(){s(\"BuiltInCall_SHA512\"),r.CONSUME(u.SHA512),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_COALESCE=r.RULE(\"BuiltInCall_COALESCE\",function(){s(\"BuiltInCall_COALESCE\"),r.CONSUME(u.COALESCE),r.SUBRULE(r.ExpressionList)}),r.BuiltInCall_IF=r.RULE(\"BuiltInCall_IF\",function(){s(\"BuiltInCall_IF\"),r.CONSUME(u.IF),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME1(u.Comma),r.SUBRULE2(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRLANG=r.RULE(\"BuiltInCall_STRLANG\",function(){s(\"BuiltInCall_STRLANG\"),r.CONSUME(u.STRLANG),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_STRDT=r.RULE(\"BuiltInCall_STRDT\",function(){s(\"BuiltInCall_STRDT\"),r.CONSUME(u.STRDT),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_sameTerm=r.RULE(\"BuiltInCall_sameTerm\",function(){s(\"BuiltInCall_sameTerm\"),r.CONSUME(u.sameTerm),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_isIRI=r.RULE(\"BuiltInCall_isIRI\",function(){s(\"BuiltInCall_isIRI\"),r.CONSUME(u.isIRI),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_isURI=r.RULE(\"BuiltInCall_isURI\",function(){s(\"BuiltInCall_isURI\"),r.CONSUME(u.isURI),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_isBLANK=r.RULE(\"BuiltInCall_isBLANK\",function(){s(\"BuiltInCall_isBLANK\"),r.CONSUME(u.isBLANK),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_isLITERAL=r.RULE(\"BuiltInCall_isLITERAL\",function(){s(\"BuiltInCall_isLITERAL\"),r.CONSUME(u.isLITERAL),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall_isNUMERIC=r.RULE(\"BuiltInCall_isNUMERIC\",function(){s(\"BuiltInCall_isNUMERIC\"),r.CONSUME(u.isNUMERIC),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.BuiltInCall=r.RULE(\"BuiltInCall\",function(){s(\"BuiltInCall\"),r.OR([{ALT:function(){return r.SUBRULE(r.Aggregate)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STR)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_LANG)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_LANGMATCHES)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_DATATYPE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_BOUND)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_IRI)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_URI)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_BNODE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_RAND)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_ABS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_CEIL)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_FLOOR)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_ROUND)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_CONCAT)}},{ALT:function(){return r.SUBRULE(r.SubstringExpression)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRLEN)}},{ALT:function(){return r.SUBRULE(r.StrReplaceExpression)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_UCASE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_LCASE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_ENCODE_FOR_URI)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_CONTAINS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRSTARTS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRENDS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRBEFORE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRAFTER)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_YEAR)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_MONTH)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_DAY)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_HOURS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_MINUTES)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_SECONDS)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_TIMEZONE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_TZ)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_NOW)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_UUID)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRUUID)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_MD5)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_SHA1)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_SHA256)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_SHA384)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_SHA512)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_COALESCE)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_IF)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRLANG)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_STRDT)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_sameTerm)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_isIRI)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_isURI)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_isBLANK)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_isLITERAL)}},{ALT:function(){return r.SUBRULE(r.BuiltInCall_isNUMERIC)}},{ALT:function(){return r.SUBRULE(r.RegexExpression)}},{ALT:function(){return r.SUBRULE(r.ExistsFunction)}},{ALT:function(){return r.SUBRULE(r.NotExistsFunction)}}])}),r.RegexExpression=r.RULE(\"RegexExpression\",function(){s(\"RegexExpression\"),r.CONSUME(u.REGEX),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.OPTION(function(){r.CONSUME1(u.Comma),r.SUBRULE2(r.Expression)}),r.CONSUME(u.RParen)}),r.SubstringExpression=r.RULE(\"SubstringExpression\",function(){s(\"SubstringExpression\"),r.CONSUME(u.SUBSTR),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.OPTION(function(){r.CONSUME1(u.Comma),r.SUBRULE2(r.Expression)}),r.CONSUME(u.RParen)}),r.StrReplaceExpression=r.RULE(\"StrReplaceExpression\",function(){s(\"StrReplaceExpression\"),r.CONSUME(u.REPLACE),r.CONSUME(u.LParen),r.SUBRULE(r.Expression),r.CONSUME(u.Comma),r.SUBRULE1(r.Expression),r.CONSUME1(u.Comma),r.SUBRULE2(r.Expression),r.OPTION(function(){r.CONSUME2(u.Comma),r.SUBRULE3(r.Expression)}),r.CONSUME(u.RParen)}),r.ExistsFunction=r.RULE(\"ExistsFunction\",function(){s(\"ExistsFunction\"),r.CONSUME(u.EXISTS),r.SUBRULE(r.GroupGraphPattern)}),r.NotExistsFunction=r.RULE(\"NotExistsFunction\",function(){s(\"NotExistsFunction\"),r.CONSUME(u.NOT_EXISTS),r.SUBRULE(r.GroupGraphPattern)}),r.Count=r.RULE(\"Count\",function(){s(\"Count\"),r.CONSUME(u.COUNT),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.OR([{ALT:function(){return r.CONSUME3(u.Star)}},{ALT:function(){return r.SUBRULE(r.Expression)}}]),r.CONSUME(u.RParen)}),r.Sum=r.RULE(\"Sum\",function(){s(\"Sum\"),r.CONSUME(u.SUM),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.Min=r.RULE(\"Min\",function(){s(\"Min\"),r.CONSUME(u.MIN),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.Max=r.RULE(\"Max\",function(){s(\"Max\"),r.CONSUME(u.MAX),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.Avg=r.RULE(\"Avg\",function(){s(\"Avg\"),r.CONSUME(u.AVG),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.Sample=r.RULE(\"Sample\",function(){s(\"Sample\"),r.CONSUME(u.SAMPLE),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.CONSUME(u.RParen)}),r.GroupConcat=r.RULE(\"GroupConcat\",function(){s(\"GroupConcat\"),r.CONSUME(u.GROUP_CONCAT),r.CONSUME1(u.LParen),r.OPTION(function(){return r.CONSUME2(u.DISTINCT)}),r.SUBRULE(r.Expression),r.OPTION1(function(){r.CONSUME(u.Semicolon),r.CONSUME(u.SEPARATOR),r.CONSUME(u.Equals),r.SUBRULE(r.String)}),r.CONSUME(u.RParen)}),r.Aggregate=r.RULE(\"Aggregate\",function(){s(\"Aggregate\"),r.OR([{ALT:function(){return r.SUBRULE(r.Count)}},{ALT:function(){return r.SUBRULE(r.Sum)}},{ALT:function(){return r.SUBRULE(r.Min)}},{ALT:function(){return r.SUBRULE(r.Max)}},{ALT:function(){return r.SUBRULE(r.Avg)}},{ALT:function(){return r.SUBRULE(r.Sample)}},{ALT:function(){return r.SUBRULE(r.GroupConcat)}}])}),r.iriOrFunction=r.RULE(\"iriOrFunction\",function(){s(\"iriOrFunction\"),r.SUBRULE(r.iri),r.OPTION(function(){return r.SUBRULE(r.ArgList)})}),r.RDFLiteral=r.RULE(\"RDFLiteral\",function(){s(\"RDFLiteral\"),r.SUBRULE(r.String),r.OPTION(function(){return r.OR([{ALT:function(){return r.CONSUME(u.LANGTAG)}},{ALT:function(){r.CONSUME(u.DoubleCaret),r.SUBRULE(r.iri)}}])})}),r.NumericLiteral=r.RULE(\"NumericLiteral\",function(){s(\"NumericLiteral\"),r.OR([{ALT:function(){return r.SUBRULE(r.NumericLiteralUnsigned)}},{ALT:function(){return r.SUBRULE(r.NumericLiteralPositive)}},{ALT:function(){return r.SUBRULE(r.NumericLiteralNegative)}}])}),r.NumericLiteralUnsigned=r.RULE(\"NumericLiteralUnsigned\",function(){s(\"NumericLiteralUnsigned\"),r.OR([{ALT:function(){return r.CONSUME(u.INTEGER)}},{ALT:function(){return r.CONSUME(u.DECIMAL)}},{ALT:function(){return r.CONSUME(u.DOUBLE)}}])}),r.NumericLiteralPositive=r.RULE(\"NumericLiteralPositive\",function(){s(\"NumericLiteralPositive\"),r.OR([{ALT:function(){return r.CONSUME(u.INTEGER_POSITIVE)}},{ALT:function(){return r.CONSUME(u.DECIMAL_POSITIVE)}},{ALT:function(){return r.CONSUME(u.DOUBLE_POSITIVE)}}])}),r.NumericLiteralNegative=r.RULE(\"NumericLiteralNegative\",function(){s(\"NumericLiteralNegative\"),r.OR([{ALT:function(){return r.CONSUME(u.INTEGER_NEGATIVE)}},{ALT:function(){return r.CONSUME(u.DECIMAL_NEGATIVE)}},{ALT:function(){return r.CONSUME(u.DOUBLE_NEGATIVE)}}])}),r.BooleanLiteral=r.RULE(\"BooleanLiteral\",function(){s(\"BooleanLiteral\"),r.OR([{ALT:function(){return r.CONSUME(u.TRUE)}},{ALT:function(){return r.CONSUME(u.FALSE)}}])}),r.String=r.RULE(\"String\",function(){s(\"String\"),r.OR([{ALT:function(){return r.CONSUME(u.STRING_LITERAL1)}},{ALT:function(){return r.CONSUME(u.STRING_LITERAL2)}},{ALT:function(){return r.CONSUME(u.STRING_LITERAL_LONG1)}},{ALT:function(){return r.CONSUME(u.STRING_LITERAL_LONG2)}}])}),r.iri=r.RULE(\"iri\",function(){s(\"iri\"),r.OR([{ALT:function(){return r.CONSUME(u.IRIREF)}},{ALT:function(){return r.SUBRULE(r.PrefixedName)}}])}),r.PrefixedName=r.RULE(\"PrefixedName\",function(){s(\"PrefixedName\"),r.OR([{ALT:function(){return r.CONSUME(u.PNAME_LN)}},{ALT:function(){return r.CONSUME(u.PNAME_NS)}}])}),r.BlankNode=r.RULE(\"BlankNode\",function(){s(\"BlankNode\"),r.OR([{ALT:function(){return r.CONSUME(u.BLANK_NODE_LABEL)}},{ALT:function(){return r.CONSUME(u.ANON)}}])}),r.lexer=new i.Lexer(n),r}return o(BaseSparqlParser,t),BaseSparqlParser}(i.Parser)},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(6),o=function(){function t(){}return t.prototype.walk=function(t,e){var n=this;void 0===e&&(e=[]),r.forEach(t.definition,function(o,a){var u=r.drop(t.definition,a+1);if(o instanceof i.NonTerminal)n.walkProdRef(o,u,e);else if(o instanceof i.Terminal)n.walkTerminal(o,u,e);else if(o instanceof i.Flat)n.walkFlat(o,u,e);else if(o instanceof i.Option)n.walkOption(o,u,e);else if(o instanceof i.RepetitionMandatory)n.walkAtLeastOne(o,u,e);else if(o instanceof i.RepetitionMandatoryWithSeparator)n.walkAtLeastOneSep(o,u,e);else if(o instanceof i.RepetitionWithSeparator)n.walkManySep(o,u,e);else if(o instanceof i.Repetition)n.walkMany(o,u,e);else{if(!(o instanceof i.Alternation))throw Error(\"non exhaustive match\");n.walkOr(o,u,e)}})},t.prototype.walkTerminal=function(t,e,n){},t.prototype.walkProdRef=function(t,e,n){},t.prototype.walkFlat=function(t,e,n){var r=e.concat(n);this.walk(t,r)},t.prototype.walkOption=function(t,e,n){var r=e.concat(n);this.walk(t,r)},t.prototype.walkAtLeastOne=function(t,e,n){var r=[new i.Option({definition:t.definition})].concat(e,n);this.walk(t,r)},t.prototype.walkAtLeastOneSep=function(t,e,n){var r=a(t,e,n);this.walk(t,r)},t.prototype.walkMany=function(t,e,n){var r=[new i.Option({definition:t.definition})].concat(e,n);this.walk(t,r)},t.prototype.walkManySep=function(t,e,n){var r=a(t,e,n);this.walk(t,r)},t.prototype.walkOr=function(t,e,n){var o=this,a=e.concat(n);r.forEach(t.definition,function(t){var e=new i.Flat({definition:[t]});o.walk(e,a)})},t}();function a(t,e,n){return[new i.Option({definition:[new i.Terminal({terminalType:t.separator})].concat(t.definition)})].concat(e,n)}e.RestWalker=o},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(38),i=n(4),o=n(14),a=n(29);!function(t){t[t.MISSING_PATTERN=0]=\"MISSING_PATTERN\",t[t.INVALID_PATTERN=1]=\"INVALID_PATTERN\",t[t.EOI_ANCHOR_FOUND=2]=\"EOI_ANCHOR_FOUND\",t[t.UNSUPPORTED_FLAGS_FOUND=3]=\"UNSUPPORTED_FLAGS_FOUND\",t[t.DUPLICATE_PATTERNS_FOUND=4]=\"DUPLICATE_PATTERNS_FOUND\",t[t.INVALID_GROUP_TYPE_FOUND=5]=\"INVALID_GROUP_TYPE_FOUND\",t[t.PUSH_MODE_DOES_NOT_EXIST=6]=\"PUSH_MODE_DOES_NOT_EXIST\",t[t.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE=7]=\"MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE\",t[t.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY=8]=\"MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY\",t[t.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST=9]=\"MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST\",t[t.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED=10]=\"LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED\",t[t.SOI_ANCHOR_FOUND=11]=\"SOI_ANCHOR_FOUND\",t[t.EMPTY_MATCH_PATTERN=12]=\"EMPTY_MATCH_PATTERN\",t[t.NO_LINE_BREAKS_FLAGS=13]=\"NO_LINE_BREAKS_FLAGS\",t[t.UNREACHABLE_PATTERN=14]=\"UNREACHABLE_PATTERN\",t[t.IDENTIFY_TERMINATOR=15]=\"IDENTIFY_TERMINATOR\",t[t.CUSTOM_LINE_BREAK=16]=\"CUSTOM_LINE_BREAK\"}(e.LexerDefinitionErrorType||(e.LexerDefinitionErrorType={}));var u={deferDefinitionErrorsHandling:!1,positionTracking:\"full\",lineTerminatorsPattern:/\\n|\\r\\n?/g,lineTerminatorCharacters:[\"\\n\",\"\\r\"],ensureOptimizations:!1,safeMode:!1,errorMessageProvider:a.defaultLexerErrorProvider};Object.freeze(u);var s=function(){function t(t,e){var n=this;if(void 0===e&&(e=u),this.lexerDefinition=t,this.lexerDefinitionErrors=[],this.lexerDefinitionWarning=[],this.patternIdxToConfig={},this.charCodeToPatternIdxToConfig={},this.modes=[],this.emptyGroups={},this.config=void 0,this.trackStartLines=!0,this.trackEndLines=!0,this.hasCustom=!1,this.canModeBeOptimized={},\"boolean\"==typeof e)throw Error(\"The second argument to the Lexer constructor is now an ILexerConfig Object.\\na boolean 2nd argument is no longer supported\");if(this.config=i.merge(u,e),this.config.lineTerminatorsPattern===u.lineTerminatorsPattern)this.config.lineTerminatorsPattern=r.LineTerminatorOptimizedTester;else if(this.config.lineTerminatorCharacters===u.lineTerminatorCharacters)throw Error(\"Error: Missing <lineTerminatorCharacters> property on the Lexer config.\\n\\tFor details See: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS\");if(e.safeMode&&e.ensureOptimizations)throw Error('\"safeMode\" and \"ensureOptimizations\" flags are mutually exclusive.');this.trackStartLines=/full|onlyStart/i.test(this.config.positionTracking),this.trackEndLines=/full/i.test(this.config.positionTracking);var a,s=!0;i.isArray(t)?((a={modes:{}}).modes[r.DEFAULT_MODE]=i.cloneArr(t),a[r.DEFAULT_MODE]=r.DEFAULT_MODE):(s=!1,a=i.cloneObj(t)),this.lexerDefinitionErrors=this.lexerDefinitionErrors.concat(r.performRuntimeChecks(a,this.trackStartLines,this.config.lineTerminatorCharacters)),this.lexerDefinitionWarning=this.lexerDefinitionWarning.concat(r.performWarningRuntimeChecks(a,this.trackStartLines,this.config.lineTerminatorCharacters)),a.modes=a.modes?a.modes:{},i.forEach(a.modes,function(t,e){a.modes[e]=i.reject(t,function(t){return i.isUndefined(t)})});var c=i.keys(a.modes);if(i.forEach(a.modes,function(t,a){if(n.modes.push(a),n.lexerDefinitionErrors=n.lexerDefinitionErrors.concat(r.validatePatterns(t,c)),i.isEmpty(n.lexerDefinitionErrors)){o.augmentTokenTypes(t);var u=r.analyzeTokenTypes(t,{lineTerminatorCharacters:n.config.lineTerminatorCharacters,positionTracking:e.positionTracking,ensureOptimizations:e.ensureOptimizations,safeMode:e.safeMode});n.patternIdxToConfig[a]=u.patternIdxToConfig,n.charCodeToPatternIdxToConfig[a]=u.charCodeToPatternIdxToConfig,n.emptyGroups=i.merge(n.emptyGroups,u.emptyGroups),n.hasCustom=u.hasCustom||n.hasCustom,n.canModeBeOptimized[a]=u.canBeOptimized}}),this.defaultMode=a.defaultMode,!i.isEmpty(this.lexerDefinitionErrors)&&!this.config.deferDefinitionErrorsHandling){var l=i.map(this.lexerDefinitionErrors,function(t){return t.message}).join(\"-----------------------\\n\");throw new Error(\"Errors detected in definition of Lexer:\\n\"+l)}if(i.forEach(this.lexerDefinitionWarning,function(t){i.PRINT_WARNING(t.message)}),r.SUPPORT_STICKY?(this.chopInput=i.IDENTITY,this.match=this.matchWithTest):(this.updateLastIndex=i.NOOP,this.match=this.matchWithExec),s&&(this.handleModes=i.NOOP),!1===this.trackStartLines&&(this.computeNewColumn=i.IDENTITY),!1===this.trackEndLines&&(this.updateTokenEndLineColumnLocation=i.NOOP),/full/i.test(this.config.positionTracking))this.createTokenInstance=this.createFullToken;else if(/onlyStart/i.test(this.config.positionTracking))this.createTokenInstance=this.createStartOnlyToken;else{if(!/onlyOffset/i.test(this.config.positionTracking))throw Error('Invalid <positionTracking> config option: \"'+this.config.positionTracking+'\"');this.createTokenInstance=this.createOffsetOnlyToken}this.hasCustom?this.addToken=this.addTokenUsingPush:this.addToken=this.addTokenUsingMemberAccess;var E=i.reduce(this.canModeBeOptimized,function(t,e,n){return!1===e&&t.push(n),t},[]);if(e.ensureOptimizations&&!i.isEmpty(E))throw Error(\"Lexer Modes: < \"+E.join(\", \")+' > cannot be optimized.\\n\\t Disable the \"ensureOptimizations\" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.\\n\\t Or inspect the console log for details on how to resolve these issues.')}return t.prototype.tokenize=function(t,e){if(void 0===e&&(e=this.defaultMode),!i.isEmpty(this.lexerDefinitionErrors)){var n=i.map(this.lexerDefinitionErrors,function(t){return t.message}).join(\"-----------------------\\n\");throw new Error(\"Unable to Tokenize because Errors detected in definition of Lexer:\\n\"+n)}return this.tokenizeInternal(t,e)},t.prototype.tokenizeInternal=function(t,e){var n,o,a,u,s,c,l,E,p,f,L,S,h=this,T=t,U=T.length,R=0,d=0,O=this.hasCustom?0:Math.floor(t.length/10),N=new Array(O),A=[],m=this.trackStartLines?1:void 0,C=this.trackStartLines?1:void 0,I=r.cloneEmptyGroups(this.emptyGroups),y=this.trackStartLines,_=this.config.lineTerminatorsPattern,P=0,v=[],M=[],g=[],B=[];Object.freeze(B);var k,D=void 0,b=function(t){if(1===g.length&&void 0===t.tokenType.PUSH_MODE){var e=h.config.errorMessageProvider.buildUnableToPopLexerModeMessage(t);A.push({offset:t.startOffset,line:void 0!==t.startLine?t.startLine:void 0,column:void 0!==t.startColumn?t.startColumn:void 0,length:t.image.length,message:e})}else{g.pop();var n=i.last(g);v=h.patternIdxToConfig[n],M=h.charCodeToPatternIdxToConfig[n],P=v.length;var r=h.canModeBeOptimized[n]&&!1===h.config.safeMode;D=M&&r?function(t){var e=M[t];return void 0===e?B:e}:function(){return v}}};function x(t){g.push(t),M=this.charCodeToPatternIdxToConfig[t],v=this.patternIdxToConfig[t],P=v.length,P=v.length;var e=this.canModeBeOptimized[t]&&!1===this.config.safeMode;D=M&&e?function(t){var e=M[t];return void 0===e?B:e}:function(){return v}}for(x.call(this,e);R<U;){s=null;var F=T.charCodeAt(R),G=D(F),w=G.length;for(n=0;n<w;n++){var j=(k=G[n]).pattern;if(!1!==($=k.short)?F===$&&(s=j):!0===k.isCustom?s=null!==(S=j.exec(T,R,N,I))?S[0]:S:(this.updateLastIndex(j,R),s=this.match(j,t,R)),null!==s){if(void 0!==(u=k.longerAlt)){var V=v[u],H=V.pattern;!0===V.isCustom?a=null!==(S=H.exec(T,R,N,I))?S[0]:S:(this.updateLastIndex(H,R),a=this.match(H,t,R)),a&&a.length>s.length&&(s=a,k=V)}break}}if(null!==s){if(c=s.length,void 0!==(l=k.group)&&(E=k.tokenTypeIdx,p=this.createTokenInstance(s,R,E,k.tokenType,m,C,c),!1===l?d=this.addToken(N,d,p):I[l].push(p)),t=this.chopInput(t,c),R+=c,C=this.computeNewColumn(C,c),!0===y&&!0===k.canLineTerminator){var W=0,Y=void 0,K=void 0;_.lastIndex=0;do{!0===(Y=_.test(s))&&(K=_.lastIndex-1,W++)}while(Y);0!==W&&(m+=W,C=c-K,this.updateTokenEndLineColumnLocation(p,l,K,W,m,C,c))}this.handleModes(k,b,x,p)}else{for(var X=R,q=m,z=C,Q=!1;!Q&&R<U;)for(T.charCodeAt(R),t=this.chopInput(t,1),R++,o=0;o<P;o++){var $,Z=v[o];j=Z.pattern;if(!1!==($=Z.short)?T.charCodeAt(R)===$&&(Q=!0):!0===Z.isCustom?Q=null!==j.exec(T,R,N,I):(this.updateLastIndex(j,R),Q=null!==j.exec(t)),!0===Q)break}f=R-X,L=this.config.errorMessageProvider.buildUnexpectedCharactersMessage(T,X,f,q,z),A.push({offset:X,line:q,column:z,length:f,message:L})}}return this.hasCustom||(N.length=d),{tokens:N,groups:I,errors:A}},t.prototype.handleModes=function(t,e,n,r){if(!0===t.pop){var i=t.push;e(r),void 0!==i&&n.call(this,i)}else void 0!==t.push&&n.call(this,t.push)},t.prototype.chopInput=function(t,e){return t.substring(e)},t.prototype.updateLastIndex=function(t,e){t.lastIndex=e},t.prototype.updateTokenEndLineColumnLocation=function(t,e,n,r,i,o,a){var u,s;void 0!==e&&(s=(u=n===a-1)?-1:0,1===r&&!0===u||(t.endLine=i+s,t.endColumn=o-1-s))},t.prototype.computeNewColumn=function(t,e){return t+e},t.prototype.createTokenInstance=function(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return null},t.prototype.createOffsetOnlyToken=function(t,e,n,r){return{image:t,startOffset:e,tokenTypeIdx:n,tokenType:r}},t.prototype.createStartOnlyToken=function(t,e,n,r,i,o){return{image:t,startOffset:e,startLine:i,startColumn:o,tokenTypeIdx:n,tokenType:r}},t.prototype.createFullToken=function(t,e,n,r,i,o,a){return{image:t,startOffset:e,endOffset:e+a-1,startLine:i,endLine:i,startColumn:o,endColumn:o+a-1,tokenTypeIdx:n,tokenType:r}},t.prototype.addToken=function(t,e,n){return 666},t.prototype.addTokenUsingPush=function(t,e,n){return t.push(n),e},t.prototype.addTokenUsingMemberAccess=function(t,e,n){return t[e]=n,++e},t.prototype.match=function(t,e,n){return null},t.prototype.matchWithTest=function(t,e,n){return!0===t.test(e)?e.substring(n,t.lastIndex):null},t.prototype.matchWithExec=function(t,e){var n=t.exec(e);return null!==n?n[0]:n},t.SKIPPED=\"This marks a skipped Token pattern, this means each token identified by it willbe consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.\",t.NA=/NOT_APPLICABLE/,t}();e.Lexer=s},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(4),a=n(10),u=n(16),s=n(6),c=n(11);e.setNodeLocationOnlyOffset=function(t,e){!0===isNaN(t.startOffset)?(t.startOffset=e.startOffset,t.endOffset=e.endOffset):t.endOffset<e.endOffset==1&&(t.endOffset=e.endOffset)},e.setNodeLocationFull=function(t,e){!0===isNaN(t.startOffset)?(t.startOffset=e.startOffset,t.startColumn=e.startColumn,t.startLine=e.startLine,t.endOffset=e.endOffset,t.endColumn=e.endColumn,t.endLine=e.endLine):t.endOffset<e.endOffset==1&&(t.endOffset=e.endOffset,t.endColumn=e.endColumn,t.endLine=e.endLine)},e.addTerminalToCst=function(t,e,n){void 0===t.children[n]?t.children[n]=[e]:t.children[n].push(e)},e.addNoneTerminalToCst=function(t,e,n){void 0===t.children[e]?t.children[e]=[n]:t.children[e].push(n)};var l=function(t){function e(e){var n=t.call(this)||this;return n.result=[],n.ruleIdx=e,n}return i(e,t),e.prototype.collectNamedDSLMethod=function(t,e,n){if(!o.isUndefined(t.name)){var r=void 0;if(t instanceof s.Option||t instanceof s.Repetition||t instanceof s.RepetitionMandatory||t instanceof s.Alternation)r=new e({definition:t.definition,idx:t.idx});else{if(!(t instanceof s.RepetitionMandatoryWithSeparator||t instanceof s.RepetitionWithSeparator))throw Error(\"non exhaustive match\");r=new e({definition:t.definition,idx:t.idx,separator:t.separator})}var i=[r],a=u.getKeyForAutomaticLookahead(this.ruleIdx,n,t.idx);this.result.push({def:i,key:a,name:t.name,orgProd:t})}},e.prototype.visitOption=function(t){this.collectNamedDSLMethod(t,s.Option,u.OPTION_IDX)},e.prototype.visitRepetition=function(t){this.collectNamedDSLMethod(t,s.Repetition,u.MANY_IDX)},e.prototype.visitRepetitionMandatory=function(t){this.collectNamedDSLMethod(t,s.RepetitionMandatory,u.AT_LEAST_ONE_IDX)},e.prototype.visitRepetitionMandatoryWithSeparator=function(t){this.collectNamedDSLMethod(t,s.RepetitionMandatoryWithSeparator,u.AT_LEAST_ONE_SEP_IDX)},e.prototype.visitRepetitionWithSeparator=function(t){this.collectNamedDSLMethod(t,s.RepetitionWithSeparator,u.MANY_SEP_IDX)},e.prototype.visitAlternation=function(t){var e=this;this.collectNamedDSLMethod(t,s.Alternation,u.OR_IDX);var n=t.definition.length>1;o.forEach(t.definition,function(r,i){if(!o.isUndefined(r.name)){var a=r.definition;a=n?[new s.Option({definition:r.definition})]:r.definition;var c=u.getKeyForAltIndex(e.ruleIdx,u.OR_IDX,t.idx,i);e.result.push({def:a,key:c,name:r.name,orgProd:r})}})},e}(c.GAstVisitor);e.NamedDSLMethodsCollectorVisitor=l,e.analyzeCst=function(t,e){var n={dictDef:new a.HashTable,allRuleNames:[]};return o.forEach(t,function(t){var r=e.get(t.name);n.allRuleNames.push(t.name);var i=new l(r);t.accept(i),o.forEach(i.result,function(e){e.def,e.key;var r=e.name;n.allRuleNames.push(t.name+r)})}),n}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0}),e.VERSION=\"4.7.0\"},function(t,e,n){\"use strict\";n.d(e,\"d\",function(){return i});var r=n(1);n.d(e,\"b\",function(){return r.IToken}),n.d(e,\"a\",function(){return r.CstNode}),n.d(e,\"c\",function(){return r.TokenType});var i=function(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return t}},function(t,e,n){\"use strict\";n.r(e);var r=n(1),i=n(2),o=n(3),a=/\\\\u([a-fA-F0-9]{4})|\\\\U([a-fA-F0-9]{8})|\\\\[uU]|\\\\(.)/g,u={\"\\\\\":\"\\\\\",\"'\":\"'\",'\"':'\"',n:\"\\n\",r:\"\\r\",t:\"\\t\",f:\"\\f\",b:\"\\b\",_:\"_\",\"~\":\"~\",\".\":\".\",\"-\":\"-\",\"!\":\"!\",$:\"$\",\"&\":\"&\",\"(\":\"(\",\")\":\")\",\"*\":\"*\",\"+\":\"+\",\",\":\",\",\";\":\";\",\"=\":\"=\",\"/\":\"/\",\"?\":\"?\",\"#\":\"#\",\"@\":\"@\",\"%\":\"%\"},s=/^\"([^\"\\\\\\r\\n]+)\"/,c=/^'([^'\\\\\\r\\n]+)'/,l=/^\"((?:[^\"\\\\\\r\\n]|\\\\.)*)\"(?=[^\"])/,E=/^'((?:[^'\\\\\\r\\n]|\\\\.)*)'(?=[^'])/,p=/^\"\"\"([^\"\\\\]*(?:(?:\\\\.|\"(?!\"\"))[^\"\\\\]*)*)\"\"\"/,f=/^'''([^'\\\\]*(?:(?:\\\\.|'(?!''))[^'\\\\]*)*)'''/,L=/[\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]/,S=/^<((?:[^ <>{}\\\\]|\\\\[uU])+)>[ \\t]*/,h=/^<([^\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]*)>[ \\t]*/,T=function(t){try{return t.replace(a,function(t,e,n,r){if(e)return String.fromCharCode(parseInt(e,16));if(n){var i=parseInt(n,16);return i<=65535?String.fromCharCode(i):String.fromCharCode(55296+(i-=65536)/1024,56320+(1023&i))}var o=u[r];if(!o)throw new Error;return o})}catch(t){return null}};n.d(e,\"turtleTokenMap\",function(){return d}),n.d(e,\"turtleTokenTypes\",function(){return O});var U=n(9).sparqlTokenMap,R=/[\\0-\\uD7FF\\uE000-\\uFFFF]|[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/,d={Comment:Object(r.createToken)({name:\"Comment\",pattern:/#[^\\n]*/,group:\"comments\"}),LBracket:U.LBracket,RBracket:U.RBracket,LCurly:U.LCurly,RCurly:U.RCurly,LParen:U.LParen,RParen:U.RParen,Period:U.Period,WhiteSpace:U.WhiteSpace,TRUE:Object(r.createToken)({name:\"TRUE\",pattern:/true/}),FALSE:Object(r.createToken)({name:\"FALSE\",pattern:/false/}),DoubleCaret:U.DoubleCaret,LEmbed:U.LEmbed,REmbed:U.REmbed,Comma:U.Comma,Semicolon:U.Semicolon,A:U.A,PREFIX:U.PREFIX,BASE:U.BASE,PNAME_NS:U.PNAME_NS,PNAME_LN:U.PNAME_LN,BLANK_NODE_LABEL:U.BLANK_NODE_LABEL,TTL_BASE:Object(r.createToken)({name:\"TTL_BASE\",pattern:/@base/}),TTL_PREFIX:Object(r.createToken)({name:\"TTL_PREFIX\",pattern:/@prefix/}),LANGTAG:U.LANGTAG,INTEGER:Object(r.createToken)({name:\"INTEGER\",pattern:i.a.and(i.a.option(/[+-]/),/\\d+/)}),DECIMAL:Object(r.createToken)({name:\"DECIMAL\",pattern:i.a.and(i.a.option(/[+-]/),/(\\d*\\.\\d+)/)}),DOUBLE:Object(r.createToken)({name:\"DOUBLE\",pattern:i.a.and(i.a.option(/[+-]/),i.a.or(i.a.and(/\\d+\\.\\d*/,o.EXPONENT),i.a.and(/\\.\\d+/,o.EXPONENT),i.a.and(/\\d+/,o.EXPONENT)))}),EXPONENT:Object(r.createToken)({name:\"EXPONENT\",pattern:o.EXPONENT}),ECHAR:Object(r.createToken)({name:\"ECHAR\",pattern:o.ECHAR}),ANON:U.ANON,PLX:Object(r.createToken)({name:\"PLX\",pattern:o.PLX}),PERCENT:U.PERCENT,HEX:Object(r.createToken)({name:\"HEX\",pattern:o.HEX}),STRING_LITERAL_LONG_SINGLE_QUOTE:Object(r.createToken)({name:\"STRING_LITERAL_LONG_SINGLE_QUOTE\",pattern:function(t,e){void 0===e&&(e=0);var n=f.exec(t.slice(e));return n&&null!==T(n[1])?n:null},line_breaks:!0}),STRING_LITERAL_LONG_QUOTE:Object(r.createToken)({name:\"STRING_LITERAL_LONG_QUOTE\",pattern:function(t,e){void 0===e&&(e=0);var n=p.exec(t.slice(e));return n&&null!==T(n[1])?n:null},line_breaks:!0}),STRING_LITERAL_QUOTE:Object(r.createToken)({name:\"STRING_LITERAL_QUOTE\",pattern:function(t,e){void 0===e&&(e=0);var n=t.slice(e),r=s.exec(n);return r||((r=l.exec(n))?null===T(r[1])?null:r:null)},line_breaks:!1}),STRING_LITERAL_SINGLE_QUOTE:Object(r.createToken)({name:\"STRING_LITERAL_SINGLE_QUOTE\",pattern:function(t,e){void 0===e&&(e=0);var n=t.slice(e),r=c.exec(n);return r||((r=E.exec(n))?null===T(r[1])?null:r:null)},line_breaks:!1}),UCHAR:Object(r.createToken)({name:\"UCHAR\",pattern:function(t,e){return void 0===e&&(e=0),R.exec(t.slice(e))},line_breaks:!1}),IRIREF:Object(r.createToken)({name:\"IRIREF\",pattern:function(t,e){void 0===e&&(e=0);var n=t.slice(e),r=h.exec(n);if(r)return r;if(!(r=S.exec(n)))return null;var i=T(r[1]);return null===i||L.test(i)?null:r},line_breaks:!1}),PN_CHARS_BASE:Object(r.createToken)({name:\"PN_CHARS_BASE\",pattern:o.PN_CHARS_BASE}),PN_CHARS_U:Object(r.createToken)({name:\"PN_CHARS_U\",pattern:o.PN_CHARS_U}),PN_CHARS:Object(r.createToken)({name:\"PN_CHARS\",pattern:o.PN_CHARS}),PN_PREFIX:Object(r.createToken)({name:\"PN_PREFIX\",pattern:o.PN_PREFIX}),PN_LOCAL:Object(r.createToken)({name:\"PN_LOCAL\",pattern:o.PN_LOCAL}),PN_LOCAL_ESC:Object(r.createToken)({name:\"PN_LOCAL_ESC\",pattern:o.PN_LOCAL_ESC}),UNKNOWN:U.UNKNOWN},O=[d.Comment,U.ANON,U.LBracket,U.RBracket,U.LCurly,U.RCurly,U.LParen,U.RParen,U.WhiteSpace,d.TRUE,d.FALSE,U.Comma,U.Semicolon,U.PNAME_NS,U.A,U.PREFIX,U.BASE,U.PNAME_LN,U.BLANK_NODE_LABEL,d.TTL_BASE,d.TTL_PREFIX,U.LANGTAG,d.DOUBLE,d.DECIMAL,U.Period,U.DoubleCaret,d.LEmbed,d.REmbed,d.IRIREF,d.STRING_LITERAL_LONG_SINGLE_QUOTE,d.STRING_LITERAL_LONG_QUOTE,d.STRING_LITERAL_QUOTE,d.STRING_LITERAL_SINGLE_QUOTE,d.INTEGER,d.EXPONENT,d.PLX,U.PERCENT,d.HEX,d.PN_CHARS_BASE,d.PN_CHARS_U,d.PN_CHARS,d.PN_PREFIX,d.PN_LOCAL,d.PN_LOCAL_ESC,d.ECHAR,d.UCHAR,d.UNKNOWN]},function(t,e,n){var r,i,o;\"undefined\"!=typeof self&&self,i=[],void 0===(o=\"function\"==typeof(r=function(){function t(){}t.prototype.saveState=function(){return{idx:this.idx,input:this.input,groupIdx:this.groupIdx}},t.prototype.restoreState=function(t){this.idx=t.idx,this.input=t.input,this.groupIdx=t.groupIdx},t.prototype.pattern=function(t){this.idx=0,this.input=t,this.groupIdx=0,this.consumeChar(\"/\");var e=this.disjunction();this.consumeChar(\"/\");for(var n={type:\"Flags\",global:!1,ignoreCase:!1,multiLine:!1,unicode:!1,sticky:!1};this.isRegExpFlag();)switch(this.popChar()){case\"g\":u(n,\"global\");break;case\"i\":u(n,\"ignoreCase\");break;case\"m\":u(n,\"multiLine\");break;case\"u\":u(n,\"unicode\");break;case\"y\":u(n,\"sticky\")}if(this.idx!==this.input.length)throw Error(\"Redundant input: \"+this.input.substring(this.idx));return{type:\"Pattern\",flags:n,value:e}},t.prototype.disjunction=function(){var t=[];for(t.push(this.alternative());\"|\"===this.peekChar();)this.consumeChar(\"|\"),t.push(this.alternative());return{type:\"Disjunction\",value:t}},t.prototype.alternative=function(){for(var t=[];this.isTerm();)t.push(this.term());return{type:\"Alternative\",value:t}},t.prototype.term=function(){return this.isAssertion()?this.assertion():this.atom()},t.prototype.assertion=function(){switch(this.popChar()){case\"^\":return{type:\"StartAnchor\"};case\"$\":return{type:\"EndAnchor\"};case\"\\\\\":switch(this.popChar()){case\"b\":return{type:\"WordBoundary\"};case\"B\":return{type:\"NonWordBoundary\"}}throw Error(\"Invalid Assertion Escape\");case\"(\":var t;switch(this.consumeChar(\"?\"),this.popChar()){case\"=\":t=\"Lookahead\";break;case\"!\":t=\"NegativeLookahead\"}s(t);var e=this.disjunction();return this.consumeChar(\")\"),{type:t,value:e}}!function(){throw Error(\"Internal Error - Should never get here!\")}()},t.prototype.quantifier=function(t){var e;switch(this.popChar()){case\"*\":e={atLeast:0,atMost:1/0};break;case\"+\":e={atLeast:1,atMost:1/0};break;case\"?\":e={atLeast:0,atMost:1};break;case\"{\":var n=this.integerIncludingZero();switch(this.popChar()){case\"}\":e={atLeast:n,atMost:n};break;case\",\":var r;this.isDigit()?(r=this.integerIncludingZero(),e={atLeast:n,atMost:r}):e={atLeast:n,atMost:1/0},this.consumeChar(\"}\")}if(!0===t&&void 0===e)return;s(e)}if(!0!==t||void 0!==e)return s(e),\"?\"===this.peekChar(0)?(this.consumeChar(\"?\"),e.greedy=!1):e.greedy=!0,e.type=\"Quantifier\",e},t.prototype.atom=function(){var t;switch(this.peekChar()){case\".\":t=this.dotAll();break;case\"\\\\\":t=this.atomEscape();break;case\"[\":t=this.characterClass();break;case\"(\":t=this.group()}return void 0===t&&this.isPatternCharacter()&&(t=this.patternCharacter()),s(t),this.isQuantifier()&&(t.quantifier=this.quantifier()),t},t.prototype.dotAll=function(){return this.consumeChar(\".\"),{type:\"Set\",complement:!0,value:[o(\"\\n\"),o(\"\\r\"),o(\"\\u2028\"),o(\"\\u2029\")]}},t.prototype.atomEscape=function(){switch(this.consumeChar(\"\\\\\"),this.peekChar()){case\"1\":case\"2\":case\"3\":case\"4\":case\"5\":case\"6\":case\"7\":case\"8\":case\"9\":return this.decimalEscapeAtom();case\"d\":case\"D\":case\"s\":case\"S\":case\"w\":case\"W\":return this.characterClassEscape();case\"f\":case\"n\":case\"r\":case\"t\":case\"v\":return this.controlEscapeAtom();case\"c\":return this.controlLetterEscapeAtom();case\"0\":return this.nulCharacterAtom();case\"x\":return this.hexEscapeSequenceAtom();case\"u\":return this.regExpUnicodeEscapeSequenceAtom();default:return this.identityEscapeAtom()}},t.prototype.decimalEscapeAtom=function(){var t=this.positiveInteger();return{type:\"GroupBackReference\",value:t}},t.prototype.characterClassEscape=function(){var t,e=!1;switch(this.popChar()){case\"d\":t=c;break;case\"D\":t=c,e=!0;break;case\"s\":t=E;break;case\"S\":t=E,e=!0;break;case\"w\":t=l;break;case\"W\":t=l,e=!0}return s(t),{type:\"Set\",value:t,complement:e}},t.prototype.controlEscapeAtom=function(){var t;switch(this.popChar()){case\"f\":t=o(\"\\f\");break;case\"n\":t=o(\"\\n\");break;case\"r\":t=o(\"\\r\");break;case\"t\":t=o(\"\\t\");break;case\"v\":t=o(\"\\v\")}return s(t),{type:\"Character\",value:t}},t.prototype.controlLetterEscapeAtom=function(){this.consumeChar(\"c\");var t=this.popChar();if(!1===/[a-zA-Z]/.test(t))throw Error(\"Invalid \");var e=t.toUpperCase().charCodeAt(0)-64;return{type:\"Character\",value:e}},t.prototype.nulCharacterAtom=function(){return this.consumeChar(\"0\"),{type:\"Character\",value:o(\"\\0\")}},t.prototype.hexEscapeSequenceAtom=function(){return this.consumeChar(\"x\"),this.parseHexDigits(2)},t.prototype.regExpUnicodeEscapeSequenceAtom=function(){return this.consumeChar(\"u\"),this.parseHexDigits(4)},t.prototype.identityEscapeAtom=function(){var t=this.popChar();return{type:\"Character\",value:o(t)}},t.prototype.classPatternCharacterAtom=function(){switch(this.peekChar()){case\"\\n\":case\"\\r\":case\"\\u2028\":case\"\\u2029\":case\"\\\\\":case\"]\":throw Error(\"TBD\");default:var t=this.popChar();return{type:\"Character\",value:o(t)}}},t.prototype.characterClass=function(){var t=[],e=!1;for(this.consumeChar(\"[\"),\"^\"===this.peekChar(0)&&(this.consumeChar(\"^\"),e=!0);this.isClassAtom();){var n=this.classAtom(),r=\"Character\"===n.type;if(r&&this.isRangeDash()){this.consumeChar(\"-\");var i=this.classAtom(),u=\"Character\"===i.type;if(u){if(i.value<n.value)throw Error(\"Range out of order in character class\");t.push({from:n.value,to:i.value})}else a(n.value,t),t.push(o(\"-\")),a(i.value,t)}else a(n.value,t)}return this.consumeChar(\"]\"),{type:\"Set\",complement:e,value:t}},t.prototype.classAtom=function(){switch(this.peekChar()){case\"]\":case\"\\n\":case\"\\r\":case\"\\u2028\":case\"\\u2029\":throw Error(\"TBD\");case\"\\\\\":return this.classEscape();default:return this.classPatternCharacterAtom()}},t.prototype.classEscape=function(){switch(this.consumeChar(\"\\\\\"),this.peekChar()){case\"b\":return this.consumeChar(\"b\"),{type:\"Character\",value:o(\"\\b\")};case\"d\":case\"D\":case\"s\":case\"S\":case\"w\":case\"W\":return this.characterClassEscape();case\"f\":case\"n\":case\"r\":case\"t\":case\"v\":return this.controlEscapeAtom();case\"c\":return this.controlLetterEscapeAtom();case\"0\":return this.nulCharacterAtom();case\"x\":return this.hexEscapeSequenceAtom();case\"u\":return this.regExpUnicodeEscapeSequenceAtom();default:return this.identityEscapeAtom()}},t.prototype.group=function(){var t=!0;switch(this.consumeChar(\"(\"),this.peekChar(0)){case\"?\":this.consumeChar(\"?\"),this.consumeChar(\":\"),t=!1;break;default:this.groupIdx++}var e=this.disjunction();this.consumeChar(\")\");var n={type:\"Group\",capturing:t,value:e};return t&&(n.idx=this.groupIdx),n},t.prototype.positiveInteger=function(){var t=this.popChar();if(!1===i.test(t))throw Error(\"Expecting a positive integer\");for(;r.test(this.peekChar(0));)t+=this.popChar();return parseInt(t,10)},t.prototype.integerIncludingZero=function(){var t=this.popChar();if(!1===r.test(t))throw Error(\"Expecting an integer\");for(;r.test(this.peekChar(0));)t+=this.popChar();return parseInt(t,10)},t.prototype.patternCharacter=function(){var t=this.popChar();switch(t){case\"\\n\":case\"\\r\":case\"\\u2028\":case\"\\u2029\":case\"^\":case\"$\":case\"\\\\\":case\".\":case\"*\":case\"+\":case\"?\":case\"(\":case\")\":case\"[\":case\"|\":throw Error(\"TBD\");default:return{type:\"Character\",value:o(t)}}},t.prototype.isRegExpFlag=function(){switch(this.peekChar(0)){case\"g\":case\"i\":case\"m\":case\"u\":case\"y\":return!0;default:return!1}},t.prototype.isRangeDash=function(){return\"-\"===this.peekChar()&&this.isClassAtom(1)},t.prototype.isDigit=function(){return r.test(this.peekChar(0))},t.prototype.isClassAtom=function(t){switch(void 0===t&&(t=0),this.peekChar(t)){case\"]\":case\"\\n\":case\"\\r\":case\"\\u2028\":case\"\\u2029\":return!1;default:return!0}},t.prototype.isTerm=function(){return this.isAtom()||this.isAssertion()},t.prototype.isAtom=function(){if(this.isPatternCharacter())return!0;switch(this.peekChar(0)){case\".\":case\"\\\\\":case\"[\":case\"(\":return!0;default:return!1}},t.prototype.isAssertion=function(){switch(this.peekChar(0)){case\"^\":case\"$\":return!0;case\"\\\\\":switch(this.peekChar(1)){case\"b\":case\"B\":return!0;default:return!1}case\"(\":return\"?\"===this.peekChar(1)&&(\"=\"===this.peekChar(2)||\"!\"===this.peekChar(2));default:return!1}},t.prototype.isQuantifier=function(){var t=this.saveState();try{return void 0!==this.quantifier(!0)}catch(t){return!1}finally{this.restoreState(t)}},t.prototype.isPatternCharacter=function(){switch(this.peekChar()){case\"^\":case\"$\":case\"\\\\\":case\".\":case\"*\":case\"+\":case\"?\":case\"(\":case\")\":case\"[\":case\"|\":case\"/\":case\"\\n\":case\"\\r\":case\"\\u2028\":case\"\\u2029\":return!1;default:return!0}},t.prototype.parseHexDigits=function(t){for(var e=\"\",r=0;r<t;r++){var i=this.popChar();if(!1===n.test(i))throw Error(\"Expecting a HexDecimal digits\");e+=i}var o=parseInt(e,16);return{type:\"Character\",value:o}},t.prototype.peekChar=function(t){return void 0===t&&(t=0),this.input[this.idx+t]},t.prototype.popChar=function(){var t=this.peekChar(0);return this.consumeChar(),t},t.prototype.consumeChar=function(t){if(void 0!==t&&this.input[this.idx]!==t)throw Error(\"Expected: '\"+t+\"' but found: '\"+this.input[this.idx]+\"' at offset: \"+this.idx);if(this.idx>=this.input.length)throw Error(\"Unexpected end of input\");this.idx++};var e,n=/[0-9a-fA-F]/,r=/[0-9]/,i=/[1-9]/;function o(t){return t.charCodeAt(0)}function a(t,e){void 0!==t.length?t.forEach(function(t){e.push(t)}):e.push(t)}function u(t,e){if(!0===t[e])throw\"duplicate flag \"+e;t[e]=!0}function s(t){if(void 0===t)throw Error(\"Internal Error - Should never get here!\")}var c=[];for(e=o(\"0\");e<=o(\"9\");e++)c.push(e);var l=[o(\"_\")].concat(c);for(e=o(\"a\");e<=o(\"z\");e++)l.push(e);for(e=o(\"A\");e<=o(\"Z\");e++)l.push(e);var E=[o(\" \"),o(\"\\f\"),o(\"\\n\"),o(\"\\r\"),o(\"\\t\"),o(\"\\v\"),o(\"\\t\"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\" \"),o(\"\\u2028\"),o(\"\\u2029\"),o(\" \"),o(\" \"),o(\"　\"),o(\"\\ufeff\")];function p(){}return p.prototype.visitChildren=function(t){for(var e in t){var n=t[e];t.hasOwnProperty(e)&&(void 0!==n.type?this.visit(n):Array.isArray(n)&&n.forEach(function(t){this.visit(t)},this))}},p.prototype.visit=function(t){switch(t.type){case\"Pattern\":this.visitPattern(t);break;case\"Flags\":this.visitFlags(t);break;case\"Disjunction\":this.visitDisjunction(t);break;case\"Alternative\":this.visitAlternative(t);break;case\"StartAnchor\":this.visitStartAnchor(t);break;case\"EndAnchor\":this.visitEndAnchor(t);break;case\"WordBoundary\":this.visitWordBoundary(t);break;case\"NonWordBoundary\":this.visitNonWordBoundary(t);break;case\"Lookahead\":this.visitLookahead(t);break;case\"NegativeLookahead\":this.visitNegativeLookahead(t);break;case\"Character\":this.visitCharacter(t);break;case\"Set\":this.visitSet(t);break;case\"Group\":this.visitGroup(t);break;case\"GroupBackReference\":this.visitGroupBackReference(t);break;case\"Quantifier\":this.visitQuantifier(t)}this.visitChildren(t)},p.prototype.visitPattern=function(t){},p.prototype.visitFlags=function(t){},p.prototype.visitDisjunction=function(t){},p.prototype.visitAlternative=function(t){},p.prototype.visitStartAnchor=function(t){},p.prototype.visitEndAnchor=function(t){},p.prototype.visitWordBoundary=function(t){},p.prototype.visitNonWordBoundary=function(t){},p.prototype.visitLookahead=function(t){},p.prototype.visitNegativeLookahead=function(t){},p.prototype.visitCharacter=function(t){},p.prototype.visitSet=function(t){},p.prototype.visitGroup=function(t){},p.prototype.visitGroupBackReference=function(t){},p.prototype.visitQuantifier=function(t){},{RegExpParser:t,BaseRegExpVisitor:p,VERSION:\"0.4.0\"}})?r.apply(e,i):r)||(t.exports=o)},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0}),e.defaultLexerErrorProvider={buildUnableToPopLexerModeMessage:function(t){return\"Unable to pop Lexer Mode after encountering Token ->\"+t.image+\"<- The Mode Stack is empty\"},buildUnexpectedCharactersMessage:function(t,e,n,r,i){return\"unexpected character: ->\"+t.charAt(e)+\"<- at offset: \"+e+\", skipped \"+n+\" characters.\"}}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(6),o=n(15);function a(t){if(t instanceof i.NonTerminal)return a(t.referencedRule);if(t instanceof i.Terminal)return c(t);if(o.isSequenceProd(t))return u(t);if(o.isBranchingProd(t))return s(t);throw Error(\"non exhaustive match\")}function u(t){for(var e,n=[],i=t.definition,u=0,s=i.length>u,c=!0;s&&c;)e=i[u],c=o.isOptionalProd(e),n=n.concat(a(e)),u+=1,s=i.length>u;return r.uniq(n)}function s(t){var e=r.map(t.definition,function(t){return a(t)});return r.uniq(r.flatten(e))}function c(t){return[t.terminalType]}e.first=a,e.firstForSequence=u,e.firstForBranching=s,e.firstForTerminal=c},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0}),e.IN=\"_~IN~_\"},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r,i=n(40),o=n(4),a=n(6);!function(t){t[t.OPTION=0]=\"OPTION\",t[t.OR=1]=\"OR\",t[t.MANY=2]=\"MANY\",t[t.MANY_SEP=3]=\"MANY_SEP\",t[t.AT_LEAST_ONE=4]=\"AT_LEAST_ONE\",t[t.AT_LEAST_ONE_SEP=5]=\"AT_LEAST_ONE_SEP\",t[t.REF=6]=\"REF\",t[t.TERMINAL=7]=\"TERMINAL\",t[t.FLAT=8]=\"FLAT\"}(r=e.ProdType||(e.ProdType={}));var u=/(?:\\s*{\\s*NAME\\s*:\\s*[\"'`]([\\w$]*)[\"'`])?/,s=new RegExp(u.source.replace(\"{\",\"\").replace(\")?\",\"\\\\s*,)?\")),c=/\\.\\s*CONSUME(\\d+)?\\s*\\(\\s*(?:[a-zA-Z_$]\\w*\\s*\\.\\s*)*([a-zA-Z_$]\\w*)/,l=new RegExp(c.source,\"g\"),E=/\\.\\s*SUBRULE(\\d+)?\\s*\\(\\s*(?:[a-zA-Z_$]\\w*\\s*\\.\\s*)*([a-zA-Z_$]\\w*)/,p=new RegExp(E.source,\"g\"),f=/\\.\\s*OPTION(\\d+)?\\s*\\(/,L=new RegExp(f.source+u.source),S=new RegExp(f.source,\"g\"),h=/\\.\\s*MANY(\\d+)?\\s*\\(/,T=new RegExp(h.source+u.source),U=new RegExp(h.source,\"g\"),R=/\\s*SEP\\s*:\\s*(?:[a-zA-Z_$]\\w*\\s*\\.\\s*)*([a-zA-Z_$]\\w*)/,d=new RegExp(/\\.\\s*MANY_SEP(\\d+)?\\s*\\(\\s*{/.source+s.source+R.source),O=new RegExp(d.source,\"g\"),N=new RegExp(/\\.\\s*AT_LEAST_ONE_SEP(\\d+)?\\s*\\(\\s*{/.source+s.source+R.source),A=new RegExp(N.source,\"g\"),m=/\\.\\s*AT_LEAST_ONE(\\d+)?\\s*\\(/,C=new RegExp(m.source+u.source),I=new RegExp(m.source,\"g\"),y=/\\.\\s*OR(\\d+)?\\s*\\(/,_=new RegExp(y.source+u.source),P=new RegExp(y.source,\"g\"),v=new RegExp(s.source+/\\s*(ALT)\\s*:/.source),M=new RegExp(v.source,\"g\");function g(t,n,i){switch(t.type){case r.AT_LEAST_ONE:return function(t,e,n){return B(C,new a.RepetitionMandatory({definition:[]}),t,e,n)}(t,n,i);case r.AT_LEAST_ONE_SEP:return function(t,e,n){return k(t,e,a.RepetitionMandatoryWithSeparator,N,n)}(t,n,i);case r.MANY_SEP:return function(t,e,n){return k(t,e,a.RepetitionWithSeparator,d,n)}(t,n,i);case r.MANY:return function(t,e,n){return B(T,new a.Repetition({definition:[]}),t,e,n)}(t,n,i);case r.OPTION:return function(t,e,n){return B(L,new a.Option({definition:[]}),t,e,n)}(t,n,i);case r.OR:return function(t,e,n){return B(_,new a.Alternation({definition:[]}),t,e,n)}(t,n,i);case r.FLAT:return function(t,e,n){var r=new a.Flat({definition:[]}),i=v.exec(t.text)[1];o.isUndefined(i)||(r.name=i);return D(r,t.range,e,n)}(t,n,i);case r.REF:return function(t){var e=E.exec(t.text),n=void 0===e[1]?0:parseInt(e[1],10),r=e[2];return new a.NonTerminal({nonTerminalName:r,idx:n})}(t);case r.TERMINAL:return function(t,n){var r=c.exec(t.text),i=void 0===r[1]?0:parseInt(r[1],10),o=r[2],u=e.terminalNameToConstructor[o];if(!u)throw Error(\"Terminal Token name: <\"+o+\"> not found in rule: <\"+n+\">  \\n\\tSee: https://sap.github.io/chevrotain/docs/guide/resolving_grammar_errors.html#TERMINAL_NAME_NOT_FOUND\\n\\tFor Further details.\");return new a.Terminal({terminalType:u,idx:i})}(t,i);default:throw Error(\"non exhaustive match\")}}function B(t,e,n,r,i){var a=t.exec(n.text),u=void 0===a[1];e.idx=u?0:parseInt(a[1],10);var s=a[2];return o.isUndefined(s)||(e.name=s),D(e,n.range,r,i)}function k(t,n,r,i,a){var u=i.exec(t.text),s=void 0===u[1]?0:parseInt(u[1],10),c=u[3],l=e.terminalNameToConstructor[c];if(!l)throw Error(\"Separator Terminal Token name: \"+c+\" not found\");var E=new r({definition:[],separator:l,idx:s}),p=u[2];return o.isUndefined(p)||(E.name=p),D(E,t.range,n,a)}function D(t,e,n,r){var i=b(e,n),a=o.sortBy(i,function(t){return t.range.start}),u=[];return o.forEach(a,function(t){u.push(g(t,n,r))}),t.definition=u,t}function b(t,e){return o.filter(e,function(n){var r=t.strictlyContainsRange(n.range),i=o.every(e,function(e){var r=e.range.strictlyContainsRange(n.range),i=e.range.isStrictlyContainedInRange(t);return!(r&&i)});return r&&i})}e.terminalNameToConstructor={},e.buildTopProduction=function(t,n,r){e.terminalNameToConstructor=r;var o=W(H(j(\"  \"+t)));return function(t,e,n,r){return D(new a.Rule({name:t,definition:[],orgText:r}),e,n,t)}(n,new i.Range(0,t.length+2),o,t)},e.buildProdGast=g,e.getDirectlyContainedRanges=b;var x=/\\/\\/.*/g,F=/\\/\\*([^*]|[\\r\\n]|(\\*+([^*/]|[\\r\\n])))*\\*+\\//g,G=/(NAME\\s*:\\s*)?\"([^\\\\\"]|\\\\([bfnrtv\"\\\\/]|u[0-9a-fA-F]{4}))*\"/g,w=/(NAME\\s*:\\s*)?'([^\\\\']|\\\\([bfnrtv'\\\\/]|u[0-9a-fA-F]{4}))*'/g;function j(t){return t.replace(x,\"\").replace(F,\"\")}function V(t,e){return void 0!==e?t:\"\"}function H(t){return t.replace(G,V).replace(w,V)}function W(t){var e=Y(t),n=K(t),r=X(t),i=q(t),o=z(t),a=Q(t),u=$(t),s=Z(t);return[].concat(e,n,r,i,o,a,u,s)}function Y(t){return nt(t,r.TERMINAL,l)}function K(t){return nt(t,r.REF,p)}function X(t){return rt(t,r.AT_LEAST_ONE,I)}function q(t){return rt(t,r.AT_LEAST_ONE_SEP,A)}function z(t){return rt(t,r.MANY,U)}function Q(t){return rt(t,r.MANY_SEP,O)}function $(t){return rt(t,r.OPTION,S)}function Z(t){var e=rt(t,r.OR,P),n=et(e);return e.concat(n)}e.removeComments=j,e.removeStringLiterals=H,e.createRanges=W,e.createTerminalRanges=Y,e.createRefsRanges=K,e.createAtLeastOneRanges=X,e.createAtLeastOneSepRanges=q,e.createManyRanges=z,e.createManySepRanges=Q,e.createOptionRanges=$,e.createOrRanges=Z;var J=o.partial(ot,\"{\",\"}\"),tt=o.partial(ot,\"(\",\")\");function et(t){var e=[];return o.forEach(t,function(t){var n=it(t.text,r.FLAT,M,J),i=t.range.start;o.forEach(n,function(t){t.range.start+=i,t.range.end+=i}),e=e.concat(n)}),o.uniq(e,function(t){return t.type+\"~\"+t.range.start+\"~\"+t.range.end+\"~\"+t.text})}function nt(t,e,n){for(var r,o=[];r=n.exec(t);){var a=r.index,u=n.lastIndex,s=new i.Range(a,u),c=r[0];o.push({range:s,text:c,type:e})}return o}function rt(t,e,n){return it(t,e,n,tt)}function it(t,e,n,r){for(var o,a=[];o=n.exec(t);){var u=o.index,s=r(u+o[0].length,t),c=new i.Range(u,s),l=t.substr(u,s-u+1);a.push({range:c,text:l,type:e})}return a}function ot(t,e,n,r){for(var i=[1],a=-1;!o.isEmpty(i)&&a+n<r.length;){a++;var u=r.charAt(n+a);u===t?i.push(1):u===e&&i.pop()}if(o.isEmpty(i))return a+n;throw new Error(\"INVALID INPUT TEXT, UNTERMINATED PARENTHESIS\")}function at(t,e){return o.map(t,function(t){return ut(t,e)})}function ut(t,e){switch(t.type){case\"NonTerminal\":return new a.NonTerminal({nonTerminalName:t.name,idx:t.idx});case\"Flat\":return new a.Flat({name:t.name,definition:at(t.definition,e)});case\"Option\":return new a.Option({name:t.name,idx:t.idx,definition:at(t.definition,e)});case\"RepetitionMandatory\":return new a.RepetitionMandatory({name:t.name,idx:t.idx,definition:at(t.definition,e)});case\"RepetitionMandatoryWithSeparator\":return new a.RepetitionMandatoryWithSeparator({name:t.name,idx:t.idx,separator:e[t.separator.name],definition:at(t.definition,e)});case\"RepetitionWithSeparator\":return new a.RepetitionWithSeparator({name:t.name,idx:t.idx,separator:e[t.separator.name],definition:at(t.definition,e)});case\"Repetition\":return new a.Repetition({name:t.name,idx:t.idx,definition:at(t.definition,e)});case\"Alternation\":return new a.Alternation({name:t.name,idx:t.idx,definition:at(t.definition,e)});case\"Terminal\":return new a.Terminal({terminalType:e[t.name],idx:t.idx});case\"Rule\":return new a.Rule({name:t.name,orgText:t.orgText,definition:at(t.definition,e)});default:}}e.createOrPartRanges=et,e.findClosingOffset=ot,e.deserializeGrammar=at,e.deserializeProduction=ut},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(10),o=n(41),a=n(18),u=n(17),s=n(15);e.resolveGrammar=function(t){t=r.defaults(t,{errMsgProvider:u.defaultGrammarResolverErrorProvider});var e=new i.HashTable;return r.forEach(t.rules,function(t){e.put(t.name,t)}),o.resolveGrammar(e,t.errMsgProvider)},e.validateGrammar=function(t){return t=r.defaults(t,{errMsgProvider:u.defaultGrammarValidatorErrorProvider,ignoredIssues:{}}),a.validateGrammar(t.rules,t.maxLookahead,t.tokenTypes,t.ignoredIssues,t.errMsgProvider,t.grammarName)},e.assignOccurrenceIndices=function(t){r.forEach(t.rules,function(t){var e=new s.DslMethodsCollectorVisitor;t.accept(e),r.forEach(e.dslMethods,function(t){r.forEach(t,function(t,e){t.idx=e+1})})})}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(7),i=n(4),o=n(13),a=n(31),u=n(10),s=n(8);function c(t){this.name=e.IN_RULE_RECOVERY_EXCEPTION,this.message=t}e.EOF_FOLLOW_KEY={},e.IN_RULE_RECOVERY_EXCEPTION=\"InRuleRecoveryException\",e.InRuleRecoveryException=c,c.prototype=Error.prototype;var l=function(){function t(){}return t.prototype.initRecoverable=function(t){this.firstAfterRepMap=new u.HashTable,this.resyncFollows=new u.HashTable,this.recoveryEnabled=i.has(t,\"recoveryEnabled\")?t.recoveryEnabled:s.DEFAULT_PARSER_CONFIG.recoveryEnabled,this.recoveryEnabled&&(this.attemptInRepetitionRecovery=E)},t.prototype.getTokenToInsert=function(t){var e=r.createTokenInstance(t,\"\",NaN,NaN,NaN,NaN,NaN,NaN);return e.isInsertedInRecovery=!0,e},t.prototype.canTokenTypeBeInsertedInRecovery=function(t){return!0},t.prototype.tryInRepetitionRecovery=function(t,e,n,r){for(var a=this,u=this.findReSyncTokenType(),s=this.exportLexerState(),c=[],l=!1,E=this.LA(1),p=this.LA(1),f=function(){var t=a.LA(0),e=a.errorMessageProvider.buildMismatchTokenMessage({expected:r,actual:E,previous:t,ruleName:a.getCurrRuleFullName()}),n=new o.MismatchedTokenException(e,E,a.LA(0));n.resyncedTokens=i.dropRight(c),a.SAVE_ERROR(n)};!l;){if(this.tokenMatcher(p,r))return void f();if(n.call(this))return f(),void t.apply(this,e);this.tokenMatcher(p,u)?l=!0:(p=this.SKIP_TOKEN(),this.addToResyncTokens(p,c))}this.importLexerState(s)},t.prototype.shouldInRepetitionRecoveryBeTried=function(t,e){return void 0!==t&&void 0!==e&&(!this.tokenMatcher(this.LA(1),t)&&(!this.isBackTracking()&&!this.canPerformInRuleRecovery(t,this.getFollowsForInRuleRecovery(t,e))))},t.prototype.getFollowsForInRuleRecovery=function(t,e){var n=this.getCurrentGrammarPath(t,e);return this.getNextPossibleTokenTypes(n)},t.prototype.tryInRuleRecovery=function(t,e){if(this.canRecoverWithSingleTokenInsertion(t,e))return this.getTokenToInsert(t);if(this.canRecoverWithSingleTokenDeletion(t)){var n=this.SKIP_TOKEN();return this.consumeToken(),n}throw new c(\"sad sad panda\")},t.prototype.canPerformInRuleRecovery=function(t,e){return this.canRecoverWithSingleTokenInsertion(t,e)||this.canRecoverWithSingleTokenDeletion(t)},t.prototype.canRecoverWithSingleTokenInsertion=function(t,e){var n=this;if(!this.canTokenTypeBeInsertedInRecovery(t))return!1;if(i.isEmpty(e))return!1;var r=this.LA(1);return void 0!==i.find(e,function(t){return n.tokenMatcher(r,t)})},t.prototype.canRecoverWithSingleTokenDeletion=function(t){return this.tokenMatcher(this.LA(2),t)},t.prototype.isInCurrentRuleReSyncSet=function(t){var e=this.getCurrFollowKey(),n=this.getFollowSetFromFollowKey(e);return i.contains(n,t)},t.prototype.findReSyncTokenType=function(){for(var t=this.flattenFollowSet(),e=this.LA(1),n=2;;){var r=e.tokenType;if(i.contains(t,r))return r;e=this.LA(n),n++}},t.prototype.getCurrFollowKey=function(){if(1===this.RULE_STACK.length)return e.EOF_FOLLOW_KEY;var t=this.getLastExplicitRuleShortName(),n=this.getLastExplicitRuleOccurrenceIndex(),r=this.getPreviousExplicitRuleShortName();return{ruleName:this.shortRuleNameToFullName(t),idxInCallingRule:n,inRule:this.shortRuleNameToFullName(r)}},t.prototype.buildFullFollowKeyStack=function(){var t=this,n=this.RULE_STACK,r=this.RULE_OCCURRENCE_STACK;return i.isEmpty(this.LAST_EXPLICIT_RULE_STACK)||(n=i.map(this.LAST_EXPLICIT_RULE_STACK,function(e){return t.RULE_STACK[e]}),r=i.map(this.LAST_EXPLICIT_RULE_STACK,function(e){return t.RULE_OCCURRENCE_STACK[e]})),i.map(n,function(i,o){return 0===o?e.EOF_FOLLOW_KEY:{ruleName:t.shortRuleNameToFullName(i),idxInCallingRule:r[o],inRule:t.shortRuleNameToFullName(n[o-1])}})},t.prototype.flattenFollowSet=function(){var t=this,e=i.map(this.buildFullFollowKeyStack(),function(e){return t.getFollowSetFromFollowKey(e)});return i.flatten(e)},t.prototype.getFollowSetFromFollowKey=function(t){if(t===e.EOF_FOLLOW_KEY)return[r.EOF];var n=t.ruleName+t.idxInCallingRule+a.IN+t.inRule;return this.resyncFollows.get(n)},t.prototype.addToResyncTokens=function(t,e){return this.tokenMatcher(t,r.EOF)||e.push(t),e},t.prototype.reSyncTo=function(t){for(var e=[],n=this.LA(1);!1===this.tokenMatcher(n,t);)n=this.SKIP_TOKEN(),this.addToResyncTokens(n,e);return i.dropRight(e)},t.prototype.attemptInRepetitionRecovery=function(t,e,n,r,i,o){},t.prototype.getCurrentGrammarPath=function(t,e){return{ruleStack:this.getHumanReadableRuleStack(),occurrenceStack:i.cloneArr(this.RULE_OCCURRENCE_STACK),lastTok:t,lastTokOccurrence:e}},t.prototype.getHumanReadableRuleStack=function(){var t=this;return i.isEmpty(this.LAST_EXPLICIT_RULE_STACK)?i.map(this.RULE_STACK,function(e){return t.shortRuleNameToFullName(e)}):i.map(this.LAST_EXPLICIT_RULE_STACK,function(e){return t.shortRuleNameToFullName(t.RULE_STACK[e])})},t}();function E(t,e,n,i,o,a){var u=this.getKeyForAutomaticLookahead(i,o),s=this.firstAfterRepMap.get(u);if(void 0===s){var c=this.getCurrRuleFullName();s=new a(this.getGAstProductions().get(c),o).startWalking(),this.firstAfterRepMap.put(u,s)}var l=s.token,E=s.occurrence,p=s.isEndOfRule;1===this.RULE_STACK.length&&p&&void 0===l&&(l=r.EOF,E=1),this.shouldInRepetitionRecoveryBeTried(l,E)&&this.tryInRepetitionRecovery(t,e,n,l)}e.Recoverable=l,e.attemptInRepetitionRecovery=E},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return TurtleParser});var r,i=n(1),o=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=n(27),s=u.turtleTokenTypes,c=u.turtleTokenMap,TurtleParser=function(t){function TurtleParser(e,n,r,o){void 0===e&&(e={}),void 0===n&&(n=s),void 0===r&&(r=n),void 0===o&&(o=!0);var u=t.call(this,n,a({outputCst:!0,recoveryEnabled:!0},e))||this;return u.namespacesMap={},u.semanticErrors=[],u.resetManagedState=function(){u.namespacesMap={},u.semanticErrors=[]},u.tokenize=function(t){return u.lexer.tokenize(t).tokens},u.parse=function(t,e){void 0===e&&(e=\"standard\"),u.input=u.lexer.tokenize(t).tokens;var n=u.turtleDoc(0,[e]),r=u.errors.slice(),i=u.semanticErrors.slice();return u.resetManagedState(),{errors:r,semanticErrors:i,cst:n}},u.turtleDoc=u.RULE(\"turtleDoc\",function(t){var e=\"stardog\"===t;u.MANY(function(){return u.SUBRULE(u.statement,{ARGS:[e]})})}),u.statement=u.RULE(\"statement\",function(t){u.OR([{ALT:function(){return u.SUBRULE(u.directive)}},{ALT:function(){u.SUBRULE(u.triples,{ARGS:[t]}),u.CONSUME(c.Period)}}])}),u.directive=u.RULE(\"directive\",function(){u.OR([{ALT:function(){return u.SUBRULE(u.prefixID)}},{ALT:function(){return u.SUBRULE(u.base)}},{ALT:function(){return u.SUBRULE(u.sparqlPrefix)}},{ALT:function(){return u.SUBRULE(u.sparqlBase)}}])}),u.prefixID=u.RULE(\"prefixID\",function(){u.CONSUME(c.TTL_PREFIX);var t=u.CONSUME(c.PNAME_NS),e=u.CONSUME(c.IRIREF),n=t.image.slice(0,-1),r=e.image;u.namespacesMap[n]=r,u.CONSUME(c.Period)}),u.base=u.RULE(\"base\",function(){u.CONSUME(c.TTL_BASE),u.CONSUME(c.IRIREF),u.CONSUME(c.Period)}),u.sparqlBase=u.RULE(\"sparqlBase\",function(){u.CONSUME(c.BASE),u.CONSUME(c.IRIREF)}),u.sparqlPrefix=u.RULE(\"sparqlPrefix\",function(){u.CONSUME(c.PREFIX);var t=u.CONSUME(c.PNAME_NS),e=u.CONSUME(c.IRIREF),n=t.image.slice(0,-1),r=e.image;u.namespacesMap[n]=r}),u.triples=u.RULE(\"triples\",function(t){u.OR([{ALT:function(){u.SUBRULE(u.subject),u.SUBRULE1(u.predicateObjectList,{ARGS:[t]})}},{GATE:function(){return Boolean(t)},ALT:function(){u.SUBRULE(u.EmbeddedTriplePattern),u.SUBRULE(u.predicateObjectList)}},{ALT:function(){u.SUBRULE(u.blankNodePropertyList,{ARGS:[t]}),u.OPTION(function(){return u.SUBRULE2(u.predicateObjectList,{ARGS:[t]})})}}])}),u.EmbeddedTriplePattern=u.RULE(\"EmbeddedTriplePattern\",function(){u.CONSUME(c.LEmbed),u.SUBRULE(u.triples),u.CONSUME(c.REmbed)}),u.predicateObjectList=u.RULE(\"predicateObjectList\",function(t){u.SUBRULE(u.verb),u.OR([{ALT:function(){return u.SUBRULE(u.objectList,{ARGS:[t]})}},{GATE:function(){return Boolean(t)},ALT:function(){u.SUBRULE(u.EmbeddedPredicateObjectList),u.SUBRULE(u.object,{ARGS:[t]})}}]),u.MANY(function(){u.CONSUME(c.Semicolon),u.OPTION(function(){u.SUBRULE1(u.verb),u.OR1([{ALT:function(){return u.SUBRULE1(u.objectList,{ARGS:[t]})}},{GATE:function(){return Boolean(t)},ALT:function(){u.SUBRULE1(u.EmbeddedPredicateObjectList),u.SUBRULE1(u.object,{ARGS:[t]})}}])})})}),u.EmbeddedPredicateObjectList=u.RULE(\"EmbeddedPredicateObjectList\",function(){u.CONSUME(c.LCurly),u.SUBRULE(u.predicateObjectList),u.CONSUME(c.RCurly)}),u.subject=u.RULE(\"subject\",function(){u.OR([{ALT:function(){return u.SUBRULE(u.iri)}},{ALT:function(){return u.SUBRULE(u.BlankNode)}},{ALT:function(){return u.SUBRULE(u.collection)}}])}),u.predicate=u.RULE(\"predicate\",function(){u.SUBRULE(u.iri)}),u.objectList=u.RULE(\"objectList\",function(t){u.SUBRULE(u.object,{ARGS:[t]}),u.MANY(function(){u.CONSUME(c.Comma),u.SUBRULE1(u.object,{ARGS:[t]})})}),u.verb=u.RULE(\"verb\",function(){u.OR([{ALT:function(){return u.SUBRULE(u.predicate)}},{ALT:function(){return u.CONSUME(c.A)}}])}),u.literal=u.RULE(\"literal\",function(){u.OR([{ALT:function(){return u.SUBRULE(u.RDFLiteral)}},{ALT:function(){return u.SUBRULE(u.NumericLiteral)}},{ALT:function(){return u.SUBRULE(u.BooleanLiteral)}}])}),u.blankNodePropertyList=u.RULE(\"blankNodePropertyList\",function(t){u.CONSUME(c.LBracket),u.SUBRULE(u.predicateObjectList,{ARGS:[t]}),u.CONSUME(c.RBracket)}),u.object=u.RULE(\"object\",function(t){u.OR([{ALT:function(){return u.SUBRULE(u.iri)}},{ALT:function(){return u.SUBRULE(u.BlankNode)}},{ALT:function(){return u.SUBRULE(u.collection)}},{ALT:function(){return u.SUBRULE(u.blankNodePropertyList,{ARGS:[t]})}},{ALT:function(){return u.SUBRULE(u.literal)}}])}),u.collection=u.RULE(\"collection\",function(){u.CONSUME(c.LParen),u.MANY(function(){return u.SUBRULE(u.object)}),u.CONSUME(c.RParen)}),u.NumericLiteral=u.RULE(\"NumericLiteral\",function(){u.OR([{ALT:function(){return u.CONSUME(c.INTEGER)}},{ALT:function(){return u.CONSUME(c.DECIMAL)}},{ALT:function(){return u.CONSUME(c.DOUBLE)}}])}),u.RDFLiteral=u.RULE(\"RDFLiteral\",function(){u.SUBRULE(u.String),u.OPTION(function(){u.OR([{ALT:function(){return u.CONSUME(c.LANGTAG)}},{ALT:function(){u.CONSUME(c.DoubleCaret),u.SUBRULE(u.iri)}}])})}),u.BooleanLiteral=u.RULE(\"BooleanLiteral\",function(){u.OR([{ALT:function(){return u.CONSUME(c.TRUE)}},{ALT:function(){return u.CONSUME(c.FALSE)}}])}),u.String=u.RULE(\"String\",function(){u.OR([{ALT:function(){return u.CONSUME(c.STRING_LITERAL_QUOTE)}},{ALT:function(){return u.CONSUME(c.STRING_LITERAL_SINGLE_QUOTE)}},{ALT:function(){return u.CONSUME(c.STRING_LITERAL_LONG_SINGLE_QUOTE)}},{ALT:function(){return u.CONSUME(c.STRING_LITERAL_LONG_QUOTE)}}])}),u.iri=u.RULE(\"iri\",function(){u.OR([{ALT:function(){return u.CONSUME(c.IRIREF)}},{ALT:function(){return u.SUBRULE(u.PrefixedName)}}])}),u.PrefixedName=u.RULE(\"PrefixedName\",function(){var t=u.OR([{ALT:function(){return u.CONSUME(c.PNAME_LN)}},{ALT:function(){return u.CONSUME(c.PNAME_NS)}}]);t.image.slice(0,t.image.indexOf(\":\"))in u.namespacesMap||u.semanticErrors.push({name:\"NoNamespacePrefixError\",message:\"A prefix was used for which there was no namespace defined.\",token:t,context:{ruleStack:u.getHumanReadableRuleStack(),ruleOccurrenceStack:u.RULE_OCCURRENCE_STACK.slice()},resyncedTokens:[]})}),u.BlankNode=u.RULE(\"BlankNode\",function(){u.OR([{ALT:function(){return u.CONSUME(c.BLANK_NODE_LABEL)}},{ALT:function(){return u.CONSUME(c.ANON)}}])}),u.lexer=new i.Lexer(r),o&&i.Parser.performSelfAnalysis(u),u}return o(TurtleParser,t),TurtleParser}(i.Parser)},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return StardogSparqlParser});var r,i=n(21),o=n(1),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=n(9),s=u.sparqlTokenMap,c=u.stardogSparqlTokens,StardogSparqlParser=function(t){function StardogSparqlParser(e,n,r){void 0===n&&(n=c);var i=t.call(this,e,n)||this;return i.ValidateQuery=i.RULE(\"ValidateQuery\",function(){i.CONSUME(s.VALIDATE),i.OR([{ALT:function(){return i.CONSUME(s.ALL)}},{ALT:function(){return i.SUBRULE(i.MultiGraphRef)}},{ALT:function(){i.AT_LEAST_ONE(function(){return i.SUBRULE1(i.iri)}),i.OPTION(function(){return i.SUBRULE2(i.MultiGraphRef)})}}]),i.OPTION1(function(){return i.SUBRULE3(i.UsingShapesClause)}),i.OPTION2(function(){return i.SUBRULE4(i.LimitClause)}),i.OPTION3(function(){return i.SUBRULE5(i.LimitPerShapeClause)})}),i.MultiGraphRef=i.RULE(\"MultiGraphRef\",function(){i.CONSUME(s.GRAPH),i.AT_LEAST_ONE(function(){return i.SUBRULE(i.iri)})}),i.UsingShapesClause=i.RULE(\"UsingShapesClause\",function(){i.CONSUME(s.USING),i.CONSUME(s.SHAPES),i.OR([{ALT:function(){return i.AT_LEAST_ONE(function(){return i.SUBRULE(i.iri)})}},{ALT:function(){return i.SUBRULE1(i.MultiGraphRef)}},{ALT:function(){return i.SUBRULE2(i.QuadData)}}])}),i.LimitPerShapeClause=i.RULE(\"LimitPerShapeClause\",function(){i.CONSUME(s.LIMIT),i.CONSUME(s.PER),i.CONSUME(s.SHAPE),i.CONSUME(s.INTEGER)}),i.Query=i.OVERRIDE_RULE(\"Query\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.SelectQuery)}},{ALT:function(){return i.SUBRULE(i.ConstructQuery)}},{ALT:function(){return i.SUBRULE(i.DescribeQuery)}},{ALT:function(){return i.SUBRULE(i.AskQuery)}},{ALT:function(){return i.SUBRULE(i.PathQuery)}},{ALT:function(){return i.SUBRULE(i.ValidateQuery)}}]),i.SUBRULE(i.ValuesClause)}),i.PathQuery=i.RULE(\"PathQuery\",function(){i.SUBRULE(i.PathSpec),i.MANY(function(){return i.SUBRULE(i.DatasetClause)}),i.CONSUME(s.START),i.SUBRULE(i.PathTerminal),i.CONSUME(s.END),i.SUBRULE1(i.PathTerminal),i.SUBRULE(i.Via),i.OPTION(function(){return i.SUBRULE(i.MaxLength)}),i.SUBRULE(i.SolutionModifier)}),i.Via=i.RULE(\"Via\",function(){i.CONSUME(s.VIA),i.OR([{ALT:function(){return i.SUBRULE(i.GroupGraphPattern)}},{ALT:function(){return i.SUBRULE(i.Var)}},{ALT:function(){return i.SUBRULE(i.Path)}}])}),i.PathTerminal=i.RULE(\"PathTerminal\",function(){i.SUBRULE(i.Var),i.OPTION(function(){i.OR([{ALT:function(){i.CONSUME(s.Equals),i.SUBRULE(i.Constant)}},{ALT:function(){return i.SUBRULE(i.GroupGraphPattern)}}])})}),i.PathSpec=i.RULE(\"PathSpec\",function(){i.OR([{ALT:function(){return i.CONSUME(s.PATHS)}},{ALT:function(){return i.CONSUME(s.PATHS_SHORTEST)}},{ALT:function(){return i.CONSUME(s.PATHS_ALL)}}]),i.OPTION1(function(){return i.CONSUME(s.CYCLIC)})}),i.GraphPatternNotTriples=i.OVERRIDE_RULE(\"GraphPatternNotTriples\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.GroupOrUnionGraphPattern)}},{ALT:function(){return i.SUBRULE(i.OptionalGraphPattern)}},{ALT:function(){return i.SUBRULE(i.MinusGraphPattern)}},{ALT:function(){return i.SUBRULE(i.GraphGraphPattern)}},{ALT:function(){return i.SUBRULE(i.ServiceGraphPattern)}},{ALT:function(){return i.SUBRULE(i.Filter)}},{ALT:function(){return i.SUBRULE(i.Bind)}},{ALT:function(){return i.SUBRULE(i.Unnest)}},{ALT:function(){return i.SUBRULE(i.InlineData)}}])}),i.TriplesSameSubject=i.OVERRIDE_RULE(\"TriplesSameSubject\",function(){i.OR([{ALT:function(){i.SUBRULE(i.VarOrTerm),i.SUBRULE(i.PropertyListNotEmpty)}},{ALT:function(){i.SUBRULE(i.EmbeddedTriplePattern),i.SUBRULE1(i.PropertyListNotEmpty,{ARGS:[!0]})}},{ALT:function(){i.SUBRULE(i.TriplesNode),i.SUBRULE(i.PropertyList)}}])}),i.PropertyListNotEmpty=i.OVERRIDE_RULE(\"PropertyListNotEmpty\",function(t){i.SUBRULE(i.Verb),i.OR([{ALT:function(){i.SUBRULE(i.ObjectList)}},{GATE:function(){return!t},ALT:function(){i.SUBRULE(i.EmbeddedPropertyList),i.SUBRULE(i.Object)}}]),i.MANY(function(){i.CONSUME(s.Semicolon),i.OPTION(function(){i.SUBRULE1(i.Verb),i.OR1([{ALT:function(){i.SUBRULE1(i.ObjectList)}},{GATE:function(){return!t},ALT:function(){i.SUBRULE1(i.EmbeddedPropertyList),i.SUBRULE1(i.Object)}}])})})}),i.EmbeddedPropertyList=i.RULE(\"EmbeddedPropertyList\",function(){i.CONSUME(s.LCurly),i.SUBRULE(i.PropertyListNotEmpty,{ARGS:[!0]}),i.CONSUME(s.RCurly)}),i.Object=i.OVERRIDE_RULE(\"Object\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.GraphNode)}},{ALT:function(){return i.SUBRULE(i.EmbeddedTriplePattern)}}])}),i.TriplesSameSubjectPath=i.OVERRIDE_RULE(\"TriplesSameSubjectPath\",function(){i.OR([{ALT:function(){i.SUBRULE(i.VarOrTerm),i.SUBRULE(i.PropertyListPathNotEmpty)}},{ALT:function(){i.SUBRULE(i.EmbeddedTriplePattern),i.SUBRULE1(i.PropertyListPathNotEmpty,{ARGS:[!0]})}},{ALT:function(){i.SUBRULE(i.TriplesNodePath),i.SUBRULE(i.PropertyListPath)}}])}),i.PropertyListPathNotEmpty=i.OVERRIDE_RULE(\"PropertyListPathNotEmpty\",function(t){i.OR([{ALT:function(){i.OR1([{ALT:function(){return i.SUBRULE(i.VerbPath)}},{ALT:function(){return i.SUBRULE1(i.VerbSimple)}}]),i.SUBRULE(i.ObjectListPath)}},{GATE:function(){return!t},ALT:function(){i.SUBRULE(i.Verb),i.SUBRULE(i.EmbeddedPropertyListPath),i.SUBRULE(i.ObjectPath)}}]),i.MANY(function(){i.CONSUME(s.Semicolon),i.OPTION(function(){i.OR2([{ALT:function(){i.OR3([{ALT:function(){return i.SUBRULE1(i.VerbPath)}},{ALT:function(){return i.SUBRULE2(i.VerbSimple)}}]),i.SUBRULE1(i.ObjectListPath)}},{GATE:function(){return!t},ALT:function(){i.SUBRULE1(i.Verb),i.SUBRULE1(i.EmbeddedPropertyListPath),i.SUBRULE1(i.ObjectPath)}}])})})}),i.EmbeddedPropertyListPath=i.RULE(\"EmbeddedPropertyListPath\",function(){i.CONSUME(s.LCurly),i.SUBRULE(i.PropertyListPathNotEmpty,{ARGS:[!0]}),i.CONSUME(s.RCurly)}),i.GraphNodePath=i.OVERRIDE_RULE(\"GraphNodePath\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.VarOrTermOrEmbeddedTriplePattern)}},{ALT:function(){return i.SUBRULE(i.TriplesNodePath)}}])}),i.EmbeddedTriplePattern=i.RULE(\"EmbeddedTriplePattern\",function(){i.CONSUME(s.LEmbed),i.SUBRULE(i.VarOrBlankNodeOrIriOrLit),i.SUBRULE(i.Verb),i.SUBRULE1(i.VarOrBlankNodeOrIriOrLit),i.CONSUME(s.REmbed)}),i.VarOrTermOrEmbeddedTriplePattern=i.RULE(\"VarOrTermOrEmbeddedTriplePattern\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.Var)}},{ALT:function(){return i.SUBRULE(i.GraphTerm)}},{ALT:function(){return i.SUBRULE(i.EmbeddedTriplePattern)}}])}),i.Bind=i.OVERRIDE_RULE(\"Bind\",function(){i.CONSUME(s.BIND),i.CONSUME(s.LParen),i.SUBRULE(i.ExpressionOrEmbeddedTriplePattern),i.CONSUME(s.AS),i.SUBRULE(i.Var),i.CONSUME(s.RParen)}),i.ExpressionOrEmbeddedTriplePattern=i.RULE(\"ExpressionOrEmbeddedTriplePattern\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.Expression)}},{ALT:function(){return i.SUBRULE(i.EmbeddedTriplePattern)}}])}),i.VarOrBlankNodeOrIriOrLit=i.RULE(\"VarOrBlankNodeOrIriOrLit\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.Var)}},{ALT:function(){return i.SUBRULE(i.BlankNode)}},{ALT:function(){return i.SUBRULE(i.iri)}},{ALT:function(){return i.SUBRULE(i.RDFLiteral)}},{ALT:function(){return i.SUBRULE(i.NumericLiteral)}},{ALT:function(){return i.SUBRULE(i.BooleanLiteral)}}])}),i.Unnest=i.RULE(\"Unnest\",function(){i.CONSUME(s.UNNEST),i.CONSUME(s.LParen),i.SUBRULE(i.Expression),i.CONSUME(s.AS),i.SUBRULE(i.Var),i.CONSUME(s.RParen)}),i.BuiltInCall=i.OVERRIDE_RULE(\"BuiltInCall\",function(){i.OR([{ALT:function(){return i.SUBRULE(i.Aggregate)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STR)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_LANG)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_LANGMATCHES)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_DATATYPE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_BOUND)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_IRI)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_URI)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_BNODE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_RAND)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_ABS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_CEIL)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_FLOOR)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_ROUND)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_CONCAT)}},{ALT:function(){return i.SUBRULE(i.SubstringExpression)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRLEN)}},{ALT:function(){return i.SUBRULE(i.StrReplaceExpression)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_UCASE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_LCASE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_ENCODE_FOR_URI)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_CONTAINS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRSTARTS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRENDS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRBEFORE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRAFTER)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_YEAR)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_MONTH)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_DAY)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_HOURS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_MINUTES)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_SECONDS)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_TIMEZONE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_TZ)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_NOW)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_UUID)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRUUID)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_MD5)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_SHA1)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_SHA256)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_SHA384)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_SHA512)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_COALESCE)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_IF)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRLANG)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_STRDT)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_sameTerm)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_isIRI)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_isURI)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_isBLANK)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_isLITERAL)}},{ALT:function(){return i.SUBRULE(i.BuiltInCall_isNUMERIC)}},{ALT:function(){return i.SUBRULE(i.RegexExpression)}},{ALT:function(){return i.SUBRULE(i.ExistsFunction)}},{ALT:function(){return i.SUBRULE(i.NotExistsFunction)}},{ALT:function(){return i.SUBRULE(i.StardogOrCustomFunction)}}])}),i.StardogOrCustomFunction=i.RULE(\"StardogOrCustomFunction\",function(){i.CONSUME(s.UNKNOWN),i.SUBRULE(i.ExpressionList)}),i.ConstructTemplate=i.OVERRIDE_RULE(\"ConstructTemplate\",function(){i.CONSUME(s.LCurly),i.OPTION(function(){return i.SUBRULE(i.Quads)}),i.CONSUME(s.RCurly)}),r||o.Parser.performSelfAnalysis(i),i}return a(StardogSparqlParser,t),StardogSparqlParser}(i.a)},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(22),a=n(10),u=n(30),s=n(4),c=n(31),l=n(7),E=n(6),p=function(t){function e(e){var n=t.call(this)||this;return n.topProd=e,n.follows=new a.HashTable,n}return i(e,t),e.prototype.startWalking=function(){return this.walk(this.topProd),this.follows},e.prototype.walkTerminal=function(t,e,n){},e.prototype.walkProdRef=function(t,e,n){var r=f(t.referencedRule,t.idx)+this.topProd.name,i=e.concat(n),o=new E.Flat({definition:i}),a=u.first(o);this.follows.put(r,a)},e}(o.RestWalker);function f(t,e){return t.name+e+c.IN}e.ResyncFollowsWalker=p,e.computeAllProdsFollows=function(t){var e=new a.HashTable;return s.forEach(t,function(t){var n=new p(t).startWalking();e.putAll(n)}),e},e.buildBetweenProdsFollowPrefix=f,e.buildInProdFollowPrefix=function(t){return l.tokenName(t.terminalType)+t.idx+c.IN}},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(28),a=n(7),u=n(23),s=n(4),c=n(39),l=new o.RegExpParser,E=\"PATTERN\";function p(t){var e=s.filter(t,function(t){return!s.has(t,E)});return{errors:s.map(e,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- missing static 'PATTERN' property\",type:u.LexerDefinitionErrorType.MISSING_PATTERN,tokenTypes:[t]}}),valid:s.difference(t,e)}}function f(t){var e=s.filter(t,function(t){var e=t[E];return!(s.isRegExp(e)||s.isFunction(e)||s.has(e,\"exec\")||s.isString(e))});return{errors:s.map(e,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.\",type:u.LexerDefinitionErrorType.INVALID_PATTERN,tokenTypes:[t]}}),valid:s.difference(t,e)}}e.DEFAULT_MODE=\"defaultMode\",e.MODES=\"modes\",e.SUPPORT_STICKY=\"boolean\"==typeof new RegExp(\"(?:)\").sticky,e.disableSticky=function(){e.SUPPORT_STICKY=!1},e.enableSticky=function(){e.SUPPORT_STICKY=!0},e.analyzeTokenTypes=function(t,n){n=s.defaults(n,{useSticky:e.SUPPORT_STICKY,debug:!1,safeMode:!1,positionTracking:\"full\",lineTerminatorCharacters:[\"\\r\",\"\\n\"]});var r=s.reject(t,function(t){return t[E]===u.Lexer.NA}),i=!1,o=s.map(r,function(t){var e=t[E];if(s.isRegExp(e)){var r=e.source;return 1===r.length&&\"^\"!==r&&\"$\"!==r&&\".\"!==r?r:2!==r.length||\"\\\\\"!==r[0]||s.contains([\"d\",\"D\",\"s\",\"S\",\"t\",\"r\",\"n\",\"t\",\"0\",\"c\",\"b\",\"B\",\"f\",\"v\",\"w\",\"W\"],r[1])?n.useSticky?C(e):m(e):r[1]}if(s.isFunction(e))return i=!0,{exec:e};if(s.has(e,\"exec\"))return i=!0,e;if(\"string\"==typeof e){if(1===e.length)return e;var o=e.replace(/[\\\\^$.*+?()[\\]{}|]/g,\"\\\\$&\"),a=new RegExp(o);return n.useSticky?C(a):m(a)}throw Error(\"non exhaustive match\")}),l=s.map(r,function(t){return t.tokenTypeIdx}),p=s.map(r,function(t){var e=t.GROUP;if(e!==u.Lexer.SKIPPED){if(s.isString(e))return e;if(s.isUndefined(e))return!1;throw Error(\"non exhaustive match\")}}),f=s.map(r,function(t){var e=t.LONGER_ALT;if(e)return s.indexOf(r,e)}),L=s.map(r,function(t){return t.PUSH_MODE}),S=s.map(r,function(t){return s.has(t,\"POP_MODE\")}),h=v(n.lineTerminatorCharacters),T=s.map(r,function(t){return!1});\"onlyOffset\"!==n.positionTracking&&(T=s.map(r,function(t){return s.has(t,\"LINE_BREAKS\")?t.LINE_BREAKS:!1===_(t,h)?c.canMatchCharCode(h,t.PATTERN):void 0}));var U=s.map(r,I),R=s.map(o,y),d=s.reduce(r,function(t,e){var n=e.GROUP;return s.isString(n)&&n!==u.Lexer.SKIPPED&&(t[n]=[]),t},{}),O=s.map(o,function(t,e){return{pattern:o[e],longerAlt:f[e],canLineTerminator:T[e],isCustom:U[e],short:R[e],group:p[e],push:L[e],pop:S[e],tokenTypeIdx:l[e],tokenType:r[e]}});function N(t,e,n){void 0===t[e]&&(t[e]=[]),t[e].push(n)}var A=!0,P=[];return n.safeMode||(P=s.reduce(r,function(t,e,r){if(\"string\"==typeof e.PATTERN){var i=e.PATTERN.charCodeAt(0);N(t,i,O[r])}else if(s.isArray(e.START_CHARS_HINT))s.forEach(e.START_CHARS_HINT,function(e){var n=\"string\"==typeof e?e.charCodeAt(0):e;N(t,n,O[r])});else if(s.isRegExp(e.PATTERN))if(e.PATTERN.unicode)A=!1,n.ensureOptimizations&&s.PRINT_ERROR(c.failedOptimizationPrefixMsg+\"\\tUnable to analyze < \"+e.PATTERN.toString()+\" > pattern.\\n\\tThe regexp unicode flag is not currently supported by the regexp-to-ast library.\\n\\tThis will disable the lexer's first char optimizations.\\n\\tFor details See: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE\");else{var o=c.getStartCodes(e.PATTERN,n.ensureOptimizations);s.isEmpty(o)&&(A=!1),s.forEach(o,function(e){N(t,e,O[r])})}else n.ensureOptimizations&&s.PRINT_ERROR(c.failedOptimizationPrefixMsg+\"\\tTokenType: <\"+a.tokenName(e)+\"> is using a custom token pattern without providing <start_chars_hint> parameter.\\n\\tThis will disable the lexer's first char optimizations.\\n\\tFor details See: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE\"),A=!1;return t},[])),A&&P.length<65536&&(P=s.packArray(P)),{emptyGroups:d,patternIdxToConfig:O,charCodeToPatternIdxToConfig:P,hasCustom:i,canBeOptimized:A}},e.validatePatterns=function(t,e){var n=[],r=p(t);n=n.concat(r.errors);var i=f(r.valid),o=i.valid;return n=(n=(n=(n=(n=n.concat(i.errors)).concat(function(t){var e=[],n=s.filter(t,function(t){return s.isRegExp(t[E])});return e=(e=(e=(e=(e=e.concat(S(n))).concat(U(n))).concat(R(n))).concat(d(n))).concat(h(n))}(o))).concat(O(o))).concat(N(o,e))).concat(A(o))},e.findMissingPatterns=p,e.findInvalidPatterns=f;var L=/[^\\\\][\\$]/;function S(t){var e=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.found=!1,e}return i(e,t),e.prototype.visitEndAnchor=function(t){this.found=!0},e}(o.BaseRegExpVisitor),n=s.filter(t,function(t){var n=t[E];try{var r=l.pattern(n.toString()),i=new e;return i.visit(r),i.found}catch(t){return L.test(n.source)}});return s.map(n,function(t){return{message:\"Unexpected RegExp Anchor Error:\\n\\tToken Type: ->\"+a.tokenName(t)+\"<- static 'PATTERN' cannot contain end of input anchor '$'\\n\\tSee sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#ANCHORS\\tfor details.\",type:u.LexerDefinitionErrorType.EOI_ANCHOR_FOUND,tokenTypes:[t]}})}function h(t){var e=s.filter(t,function(t){return t[E].test(\"\")});return s.map(e,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- static 'PATTERN' must not match an empty string\",type:u.LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,tokenTypes:[t]}})}e.findEndOfInputAnchor=S,e.findEmptyMatchRegExps=h;var T=/[^\\\\[][\\^]|^\\^/;function U(t){var e=function(t){function e(){var e=null!==t&&t.apply(this,arguments)||this;return e.found=!1,e}return i(e,t),e.prototype.visitStartAnchor=function(t){this.found=!0},e}(o.BaseRegExpVisitor),n=s.filter(t,function(t){var n=t[E];try{var r=l.pattern(n.toString()),i=new e;return i.visit(r),i.found}catch(t){return T.test(n.source)}});return s.map(n,function(t){return{message:\"Unexpected RegExp Anchor Error:\\n\\tToken Type: ->\"+a.tokenName(t)+\"<- static 'PATTERN' cannot contain start of input anchor '^'\\n\\tSee https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#ANCHORS\\tfor details.\",type:u.LexerDefinitionErrorType.SOI_ANCHOR_FOUND,tokenTypes:[t]}})}function R(t){var e=s.filter(t,function(t){var e=t[E];return e instanceof RegExp&&(e.multiline||e.global)});return s.map(e,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- static 'PATTERN' may NOT contain global('g') or multiline('m')\",type:u.LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,tokenTypes:[t]}})}function d(t){var e=[],n=s.map(t,function(n){return s.reduce(t,function(t,r){return n.PATTERN.source!==r.PATTERN.source||s.contains(e,r)||r.PATTERN===u.Lexer.NA?t:(e.push(r),t.push(r),t)},[])});n=s.compact(n);var r=s.filter(n,function(t){return t.length>1});return s.map(r,function(t){var e=s.map(t,function(t){return a.tokenName(t)});return{message:\"The same RegExp pattern ->\"+s.first(t).PATTERN+\"<-has been used in all of the following Token Types: \"+e.join(\", \")+\" <-\",type:u.LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,tokenTypes:t}})}function O(t){var e=s.filter(t,function(t){if(!s.has(t,\"GROUP\"))return!1;var e=t.GROUP;return e!==u.Lexer.SKIPPED&&e!==u.Lexer.NA&&!s.isString(e)});return s.map(e,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String\",type:u.LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,tokenTypes:[t]}})}function N(t,e){var n=s.filter(t,function(t){return void 0!==t.PUSH_MODE&&!s.contains(e,t.PUSH_MODE)});return s.map(n,function(t){return{message:\"Token Type: ->\"+a.tokenName(t)+\"<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->\"+t.PUSH_MODE+\"<-which does not exist\",type:u.LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,tokenTypes:[t]}})}function A(t){var e=[],n=s.reduce(t,function(t,e,n){var r,i=e.PATTERN;return i===u.Lexer.NA?t:(s.isString(i)?t.push({str:i,idx:n,tokenType:e}):s.isRegExp(i)&&(r=i,void 0===s.find([\".\",\"\\\\\",\"[\",\"]\",\"|\",\"^\",\"$\",\"(\",\")\",\"?\",\"*\",\"+\",\"{\"],function(t){return-1!==r.source.indexOf(t)}))&&t.push({str:i.source,idx:n,tokenType:e}),t)},[]);return s.forEach(t,function(t,r){s.forEach(n,function(n){var i=n.str,o=n.idx,c=n.tokenType;if(r<o&&function(t,e){if(s.isRegExp(e)){var n=e.exec(t);return null!==n&&0===n.index}if(s.isFunction(e))return e(t,0,[],{});if(s.has(e,\"exec\"))return e.exec(t,0,[],{});if(\"string\"==typeof e)return e===t;throw Error(\"non exhaustive match\")}(i,t.PATTERN)){var l=\"Token: ->\"+a.tokenName(c)+\"<- can never be matched.\\nBecause it appears AFTER the Token Type ->\"+a.tokenName(t)+\"<-in the lexer's definition.\\nSee https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#UNREACHABLE\";e.push({message:l,type:u.LexerDefinitionErrorType.UNREACHABLE_PATTERN,tokenTypes:[t,c]})}})}),e}function m(t){var e=t.ignoreCase?\"i\":\"\";return new RegExp(\"^(?:\"+t.source+\")\",e)}function C(t){var e=t.ignoreCase?\"iy\":\"y\";return new RegExp(\"\"+t.source,e)}function I(t){var e=t.PATTERN;if(s.isRegExp(e))return!1;if(s.isFunction(e))return!0;if(s.has(e,\"exec\"))return!0;if(s.isString(e))return!1;throw Error(\"non exhaustive match\")}function y(t){return!(!s.isString(t)||1!==t.length)&&t.charCodeAt(0)}function _(t,e){if(s.has(t,\"LINE_BREAKS\"))return!1;if(s.isRegExp(t.PATTERN)){try{c.canMatchCharCode(e,t.PATTERN)}catch(t){return{issue:u.LexerDefinitionErrorType.IDENTIFY_TERMINATOR,errMsg:t.message}}return!1}if(s.isString(t.PATTERN))return!1;if(I(t))return{issue:u.LexerDefinitionErrorType.CUSTOM_LINE_BREAK};throw Error(\"non exhaustive match\")}function P(t,e){if(e.issue===u.LexerDefinitionErrorType.IDENTIFY_TERMINATOR)return\"Warning: unable to identify line terminator usage in pattern.\\n\\tThe problem is in the <\"+t.name+\"> Token Type\\n\\t Root cause: \"+e.errMsg+\".\\n\\tFor details See: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR\";if(e.issue===u.LexerDefinitionErrorType.CUSTOM_LINE_BREAK)return\"Warning: A Custom Token Pattern should specify the <line_breaks> option.\\n\\tThe problem is in the <\"+t.name+\"> Token Type\\n\\tFor details See: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK\";throw Error(\"non exhaustive match\")}function v(t){return s.map(t,function(t){return s.isString(t)&&t.length>0?t.charCodeAt(0):t})}e.findStartOfInputAnchor=U,e.findUnsupportedFlags=R,e.findDuplicatePatterns=d,e.findInvalidGroupType=O,e.findModesThatDoNotExist=N,e.findUnreachablePatterns=A,e.addStartOfInput=m,e.addStickyFlag=C,e.performRuntimeChecks=function(t,n,r){var i=[];return s.has(t,e.DEFAULT_MODE)||i.push({message:\"A MultiMode Lexer cannot be initialized without a <\"+e.DEFAULT_MODE+\"> property in its definition\\n\",type:u.LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE}),s.has(t,e.MODES)||i.push({message:\"A MultiMode Lexer cannot be initialized without a <\"+e.MODES+\"> property in its definition\\n\",type:u.LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY}),s.has(t,e.MODES)&&s.has(t,e.DEFAULT_MODE)&&!s.has(t.modes,t.defaultMode)&&i.push({message:\"A MultiMode Lexer cannot be initialized with a \"+e.DEFAULT_MODE+\": <\"+t.defaultMode+\">which does not exist\\n\",type:u.LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST}),s.has(t,e.MODES)&&s.forEach(t.modes,function(t,e){s.forEach(t,function(t,n){s.isUndefined(t)&&i.push({message:\"A Lexer cannot be initialized using an undefined Token Type. Mode:<\"+e+\"> at index: <\"+n+\">\\n\",type:u.LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED})})}),i},e.performWarningRuntimeChecks=function(t,e,n){var r=[],i=!1,o=s.compact(s.flatten(s.mapValues(t.modes,function(t){return t}))),a=s.reject(o,function(t){return t[E]===u.Lexer.NA}),l=v(n);return e&&s.forEach(a,function(t){var e=_(t,l);if(!1!==e){var n={message:P(t,e),type:e.issue,tokenType:t};r.push(n)}else s.has(t,\"LINE_BREAKS\")?!0===t.LINE_BREAKS&&(i=!0):c.canMatchCharCode(l,t.PATTERN)&&(i=!0)}),e&&!i&&r.push({message:\"Warning: No LINE_BREAKS Found.\\n\\tThis Lexer has been defined to track line and column information,\\n\\tBut none of the Token Types can be identified as matching a line terminator.\\n\\tSee https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \\n\\tfor details.\",type:u.LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS}),r},e.cloneEmptyGroups=function(t){var e={},n=s.keys(t);return s.forEach(n,function(n){var r=t[n];if(!s.isArray(r))throw Error(\"non exhaustive match\");e[n]=[]}),e},e.isCustomPattern=I,e.isShortPattern=y,e.LineTerminatorOptimizedTester={test:function(t){for(var e=t.length,n=this.lastIndex;n<e;n++){var r=t.charCodeAt(n);if(10===r)return this.lastIndex=n+1,!0;if(13===r)return 10===t.charCodeAt(n+1)?this.lastIndex=n+2:this.lastIndex=n+1,!0}return!1},lastIndex:0},e.buildLineBreakIssueMessage=P},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(28),a=n(4),u=new o.RegExpParser,s=\"Complement Sets are not supported for first char optimization\";function c(t){switch(t.type){case\"Disjunction\":return a.flatten(a.map(t.value,c));case\"Alternative\":for(var e=[],n=t.value,r=0;r<n.length;r++){var i=n[r];if(!a.contains([\"GroupBackReference\",\"Lookahead\",\"NegativeLookahead\",\"StartAnchor\",\"EndAnchor\",\"WordBoundary\",\"NonWordBoundary\"],i.type)){var o=i;switch(o.type){case\"Character\":e.push(o.value);break;case\"Set\":if(!0===o.complement)throw Error(s);a.forEach(o.value,function(t){if(\"number\"==typeof t)e.push(t);else for(var n=t,r=n.from;r<=n.to;r++)e.push(r)});break;case\"Group\":var u=c(o.value);a.forEach(u,function(t){return e.push(t)});break;default:throw Error(\"Non Exhaustive Match\")}var l=void 0!==o.quantifier&&0===o.quantifier.atLeast;if(\"Group\"===o.type&&!1===p(o)||\"Group\"!==o.type&&!1===l)break}}return e;default:throw Error(\"non exhaustive match!\")}}function l(t){var e=[];return a.forEach(t,function(t){e.push(t);var n=String.fromCharCode(t);n.toUpperCase()!==n?e.push(n.toUpperCase().charCodeAt(0)):n.toLowerCase()!==n&&e.push(n.toLowerCase().charCodeAt(0))}),e}function E(t,e){return a.find(t.value,function(t){if(\"number\"==typeof t)return a.contains(e,t);var n=t;return void 0!==a.find(e,function(t){return n.from<=t&&t<=n.to})})}function p(t){return!(!t.quantifier||0!==t.quantifier.atLeast)||!!t.value&&(a.isArray(t.value)?a.every(t.value,p):p(t.value))}e.failedOptimizationPrefixMsg='Unable to use \"first char\" lexer optimizations:\\n',e.getStartCodes=function(t,n){void 0===n&&(n=!1);try{var r=u.pattern(t.toString()),i=c(r.value);return r.flags.ignoreCase&&(i=l(i)),i}catch(r){if(r.message===s)n&&a.PRINT_WARNING(e.failedOptimizationPrefixMsg+\"\\tUnable to optimize: < \"+t.toString()+\" >\\n\\tComplement Sets cannot be automatically optimized.\\n\\tThis will disable the lexer's first char optimizations.\\n\\tSee: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.\");else{var E=\"\";n&&(E=\"\\n\\tThis will disable the lexer's first char optimizations.\\n\\tSee: https://sap.github.io/chevrotain/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.\"),a.PRINT_ERROR(e.failedOptimizationPrefixMsg+\"\\n\\tFailed parsing: < \"+t.toString()+\" >\\n\\tUsing the regexp-to-ast library version: \"+o.VERSION+\"\\n\\tPlease open an issue at: https://github.com/bd82/regexp-to-ast/issues\"+E)}}return[]},e.firstChar=c,e.applyIgnoreCase=l;var f=function(t){function e(e){var n=t.call(this)||this;return n.targetCharCodes=e,n.found=!1,n}return i(e,t),e.prototype.visitChildren=function(e){switch(e.type){case\"Lookahead\":return void this.visitLookahead(e);case\"NegativeLookahead\":return void this.visitNegativeLookahead(e)}t.prototype.visitChildren.call(this,e)},e.prototype.visitCharacter=function(t){a.contains(this.targetCharCodes,t.value)&&(this.found=!0)},e.prototype.visitSet=function(t){t.complement?void 0===E(t,this.targetCharCodes)&&(this.found=!0):void 0!==E(t,this.targetCharCodes)&&(this.found=!0)},e}(o.BaseRegExpVisitor);e.canMatchCharCode=function(t,e){if(e instanceof RegExp){var n=u.pattern(e.toString()),r=new f(t);return r.visit(n),r.found}return void 0!==a.find(e,function(e){return a.contains(t,e.charCodeAt(0))})}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=function(){function t(t,e){if(this.start=t,this.end=e,!i(t,e))throw new Error(\"INVALID RANGE\")}return t.prototype.contains=function(t){return this.start<=t&&this.end>=t},t.prototype.containsRange=function(t){return this.start<=t.start&&this.end>=t.end},t.prototype.isContainedInRange=function(t){return t.containsRange(this)},t.prototype.strictlyContainsRange=function(t){return this.start<t.start&&this.end>t.end},t.prototype.isStrictlyContainedInRange=function(t){return t.strictlyContainsRange(this)},t}();function i(t,e){return!(t<0||e<t)}e.Range=r,e.isValidRange=i},function(t,e,n){\"use strict\";var r,i=this&&this.__extends||(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)});Object.defineProperty(e,\"__esModule\",{value:!0});var o=n(8),a=n(4),u=n(11);e.resolveGrammar=function(t,e){var n=new s(t,e);return n.resolveRefs(),n.errors};var s=function(t){function e(e,n){var r=t.call(this)||this;return r.nameToTopRule=e,r.errMsgProvider=n,r.errors=[],r}return i(e,t),e.prototype.resolveRefs=function(){var t=this;a.forEach(this.nameToTopRule.values(),function(e){t.currTopLevel=e,e.accept(t)})},e.prototype.visitNonTerminal=function(t){var e=this.nameToTopRule.get(t.nonTerminalName);if(e)t.referencedRule=e;else{var n=this.errMsgProvider.buildRuleNotFoundError(this.currTopLevel,t);this.errors.push({message:n,type:o.ParserDefinitionErrorType.UNRESOLVED_SUBRULE_REF,ruleName:this.currTopLevel.name,unresolvedRefName:t.nonTerminalName})}},e}(u.GAstVisitor);e.GastRefResolverVisitor=s},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(19),i=n(4),o=n(8),a=n(16),u=function(){function t(){}return t.prototype.initLooksAhead=function(t){this.dynamicTokensEnabled=i.has(t,\"dynamicTokensEnabled\")?t.dynamicTokensEnabled:o.DEFAULT_PARSER_CONFIG.dynamicTokensEnabled,this.maxLookahead=i.has(t,\"maxLookahead\")?t.maxLookahead:o.DEFAULT_PARSER_CONFIG.maxLookahead,this.lookAheadFuncsCache=i.isES2015MapSupported()?new Map:[],i.isES2015MapSupported()?(this.getLaFuncFromCache=this.getLaFuncFromMap,this.setLaFuncCache=this.setLaFuncCacheUsingMap):(this.getLaFuncFromCache=this.getLaFuncFromObj,this.setLaFuncCache=this.setLaFuncUsingObj)},t.prototype.lookAheadBuilderForOptional=function(t,e,n){return r.buildSingleAlternativeLookaheadFunction(t,e,n)},t.prototype.lookAheadBuilderForAlternatives=function(t,e,n,i){return r.buildAlternativesLookAheadFunc(t,e,n,i)},t.prototype.getKeyForAutomaticLookahead=function(t,e){var n=this.getLastExplicitRuleShortName();return a.getKeyForAutomaticLookahead(n,t,e)},t.prototype.getLookaheadFuncForOr=function(t,e){var n=this.getKeyForAutomaticLookahead(a.OR_IDX,t),o=this.getLaFuncFromCache(n);if(void 0===o){var u=this.getCurrRuleFullName(),s=this.getGAstProductions().get(u),c=i.some(e,function(t){return i.isFunction(t.GATE)});return o=r.buildLookaheadFuncForOr(t,s,this.maxLookahead,c,this.dynamicTokensEnabled,this.lookAheadBuilderForAlternatives),this.setLaFuncCache(n,o),o}return o},t.prototype.getLookaheadFuncForOption=function(t,e){return this.getLookaheadFuncFor(t,e,this.maxLookahead,r.PROD_TYPE.OPTION)},t.prototype.getLookaheadFuncForMany=function(t,e){return this.getLookaheadFuncFor(t,e,this.maxLookahead,r.PROD_TYPE.REPETITION)},t.prototype.getLookaheadFuncForManySep=function(t,e){return this.getLookaheadFuncFor(t,e,this.maxLookahead,r.PROD_TYPE.REPETITION_WITH_SEPARATOR)},t.prototype.getLookaheadFuncForAtLeastOne=function(t,e){return this.getLookaheadFuncFor(t,e,this.maxLookahead,r.PROD_TYPE.REPETITION_MANDATORY)},t.prototype.getLookaheadFuncForAtLeastOneSep=function(t,e){return this.getLookaheadFuncFor(t,e,this.maxLookahead,r.PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR)},t.prototype.getLookaheadFuncFor=function(t,e,n,i){var o=this.getLaFuncFromCache(t);if(void 0===o){var a=this.getCurrRuleFullName(),u=this.getGAstProductions().get(a);return o=r.buildLookaheadFuncForOptionalProd(e,u,n,this.dynamicTokensEnabled,i,this.lookAheadBuilderForOptional),this.setLaFuncCache(t,o),o}return o},t.prototype.getLaFuncFromCache=function(t){},t.prototype.getLaFuncFromMap=function(t){return this.lookAheadFuncsCache.get(t)},t.prototype.getLaFuncFromObj=function(t){return this.lookAheadFuncsCache[t]},t.prototype.setLaFuncCache=function(t,e){},t.prototype.setLaFuncCacheUsingMap=function(t,e){this.lookAheadFuncsCache.set(t,e)},t.prototype.setLaFuncUsingObj=function(t,e){this.lookAheadFuncsCache[t]=e},t}();e.LooksAhead=u},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(24),i=n(4),o=n(44),a=n(16),u=n(8),s=function(){function t(){}return t.prototype.initTreeBuilder=function(t){if(this.LAST_EXPLICIT_RULE_STACK=[],this.CST_STACK=[],this.outputCst=i.has(t,\"outputCst\")?t.outputCst:u.DEFAULT_PARSER_CONFIG.outputCst,this.nodeLocationTracking=i.has(t,\"nodeLocationTracking\")?t.nodeLocationTracking:u.DEFAULT_PARSER_CONFIG.nodeLocationTracking,this.outputCst)if(/full/i.test(this.nodeLocationTracking))this.recoveryEnabled?(this.setNodeLocationFromToken=r.setNodeLocationFull,this.setNodeLocationFromNode=r.setNodeLocationFull,this.cstPostRule=i.NOOP,this.setInitialNodeLocation=this.setInitialNodeLocationFullRecovery):(this.setNodeLocationFromToken=i.NOOP,this.setNodeLocationFromNode=i.NOOP,this.cstPostRule=this.cstPostRuleFull,this.setInitialNodeLocation=this.setInitialNodeLocationFullRegular);else if(/onlyOffset/i.test(this.nodeLocationTracking))this.recoveryEnabled?(this.setNodeLocationFromToken=r.setNodeLocationOnlyOffset,this.setNodeLocationFromNode=r.setNodeLocationOnlyOffset,this.cstPostRule=i.NOOP,this.setInitialNodeLocation=this.setInitialNodeLocationOnlyOffsetRecovery):(this.setNodeLocationFromToken=i.NOOP,this.setNodeLocationFromNode=i.NOOP,this.cstPostRule=this.cstPostRuleOnlyOffset,this.setInitialNodeLocation=this.setInitialNodeLocationOnlyOffsetRegular);else{if(!/none/i.test(this.nodeLocationTracking))throw Error('Invalid <nodeLocationTracking> config option: \"'+t.nodeLocationTracking+'\"');this.setNodeLocationFromToken=i.NOOP,this.setNodeLocationFromNode=i.NOOP,this.cstPostRule=i.NOOP,this.setInitialNodeLocation=i.NOOP}else this.cstInvocationStateUpdate=i.NOOP,this.cstFinallyStateUpdate=i.NOOP,this.cstPostTerminal=i.NOOP,this.cstPostNonTerminal=i.NOOP,this.cstPostRule=i.NOOP,this.getLastExplicitRuleShortName=this.getLastExplicitRuleShortNameNoCst,this.getPreviousExplicitRuleShortName=this.getPreviousExplicitRuleShortNameNoCst,this.getLastExplicitRuleOccurrenceIndex=this.getLastExplicitRuleOccurrenceIndexNoCst,this.manyInternal=this.manyInternalNoCst,this.orInternal=this.orInternalNoCst,this.optionInternal=this.optionInternalNoCst,this.atLeastOneInternal=this.atLeastOneInternalNoCst,this.manySepFirstInternal=this.manySepFirstInternalNoCst,this.atLeastOneSepFirstInternal=this.atLeastOneSepFirstInternalNoCst},t.prototype.setInitialNodeLocationOnlyOffsetRecovery=function(t){t.location={startOffset:NaN,endOffset:NaN}},t.prototype.setInitialNodeLocationOnlyOffsetRegular=function(t){t.location={startOffset:this.LA(1).startOffset,endOffset:NaN}},t.prototype.setInitialNodeLocationFullRecovery=function(t){t.location={startOffset:NaN,startLine:NaN,startColumn:NaN,endOffset:NaN,endLine:NaN,endColumn:NaN}},t.prototype.setInitialNodeLocationFullRegular=function(t){var e=this.LA(1);t.location={startOffset:e.startOffset,startLine:e.startLine,startColumn:e.startColumn,endOffset:NaN,endLine:NaN,endColumn:NaN}},t.prototype.cstNestedInvocationStateUpdate=function(t,e){var n={name:t,fullName:this.shortRuleNameToFull.get(this.getLastExplicitRuleShortName())+t,children:{}};this.setInitialNodeLocation(n),this.CST_STACK.push(n)},t.prototype.cstInvocationStateUpdate=function(t,e){this.LAST_EXPLICIT_RULE_STACK.push(this.RULE_STACK.length-1);var n={name:t,children:{}};this.setInitialNodeLocation(n),this.CST_STACK.push(n)},t.prototype.cstFinallyStateUpdate=function(){this.LAST_EXPLICIT_RULE_STACK.pop(),this.CST_STACK.pop()},t.prototype.cstNestedFinallyStateUpdate=function(){var t=this.CST_STACK.pop();this.cstPostRule(t)},t.prototype.cstPostRuleFull=function(t){var e=this.LA(0),n=t.location;n.startOffset<=e.startOffset==!0?(n.endOffset=e.endOffset,n.endLine=e.endLine,n.endColumn=e.endColumn):(n.startOffset=NaN,n.startLine=NaN,n.startColumn=NaN)},t.prototype.cstPostRuleOnlyOffset=function(t){var e=this.LA(0),n=t.location;n.startOffset<=e.startOffset==!0?n.endOffset=e.endOffset:n.startOffset=NaN},t.prototype.cstPostTerminal=function(t,e){var n=this.CST_STACK[this.CST_STACK.length-1];r.addTerminalToCst(n,e,t),this.setNodeLocationFromToken(n.location,e)},t.prototype.cstPostNonTerminal=function(t,e){var n=this.CST_STACK[this.CST_STACK.length-1];r.addNoneTerminalToCst(n,e,t),this.setNodeLocationFromNode(n.location,t.location)},t.prototype.getBaseCstVisitorConstructor=function(){if(i.isUndefined(this.baseCstVisitorConstructor)){var t=o.createBaseSemanticVisitorConstructor(this.className,this.allRuleNames);return this.baseCstVisitorConstructor=t,t}return this.baseCstVisitorConstructor},t.prototype.getBaseCstVisitorConstructorWithDefaults=function(){if(i.isUndefined(this.baseCstVisitorWithDefaultsConstructor)){var t=o.createBaseVisitorConstructorWithDefaults(this.className,this.allRuleNames,this.getBaseCstVisitorConstructor());return this.baseCstVisitorWithDefaultsConstructor=t,t}return this.baseCstVisitorWithDefaultsConstructor},t.prototype.nestedRuleBeforeClause=function(t,e){var n;return void 0!==t.NAME?(n=t.NAME,this.nestedRuleInvocationStateUpdate(n,e),n):void 0},t.prototype.nestedAltBeforeClause=function(t,e,n,r){var i,o=this.getLastExplicitRuleShortName(),u=a.getKeyForAltIndex(o,n,e,r);return void 0!==t.NAME?(i=t.NAME,this.nestedRuleInvocationStateUpdate(i,u),{shortName:u,nestedName:i}):void 0},t.prototype.nestedRuleFinallyClause=function(t,e){var n=this.CST_STACK,i=n[n.length-1];this.nestedRuleFinallyStateUpdate();var o=n[n.length-1];r.addNoneTerminalToCst(o,e,i),this.setNodeLocationFromNode(o.location,i.location)},t.prototype.getLastExplicitRuleShortName=function(){var t=this.LAST_EXPLICIT_RULE_STACK[this.LAST_EXPLICIT_RULE_STACK.length-1];return this.RULE_STACK[t]},t.prototype.getLastExplicitRuleShortNameNoCst=function(){var t=this.RULE_STACK;return t[t.length-1]},t.prototype.getPreviousExplicitRuleShortName=function(){var t=this.LAST_EXPLICIT_RULE_STACK[this.LAST_EXPLICIT_RULE_STACK.length-2];return this.RULE_STACK[t]},t.prototype.getPreviousExplicitRuleShortNameNoCst=function(){var t=this.RULE_STACK;return t[t.length-2]},t.prototype.getLastExplicitRuleOccurrenceIndex=function(){var t=this.LAST_EXPLICIT_RULE_STACK[this.LAST_EXPLICIT_RULE_STACK.length-1];return this.RULE_OCCURRENCE_STACK[t]},t.prototype.getLastExplicitRuleOccurrenceIndexNoCst=function(){var t=this.RULE_OCCURRENCE_STACK;return t[t.length-1]},t.prototype.nestedRuleInvocationStateUpdate=function(t,e){this.RULE_OCCURRENCE_STACK.push(1),this.RULE_STACK.push(e),this.cstNestedInvocationStateUpdate(t,e)},t.prototype.nestedRuleFinallyStateUpdate=function(){this.RULE_STACK.pop(),this.RULE_OCCURRENCE_STACK.pop(),this.cstNestedFinallyStateUpdate()},t}();e.TreeBuilder=s},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r,i=n(4),o=n(10),a=n(18);function u(t,e){for(var n=i.keys(t),r=n.length,o=0;o<r;o++)for(var a=t[n[o]],u=a.length,s=0;s<u;s++){var c=a[s];void 0===c.tokenTypeIdx&&(void 0!==c.fullName?this[c.fullName](c.children,e):this[c.name](c.children,e))}}function s(t,e){var n=c(t,e),r=E(t,e);return n.concat(r)}function c(t,e){var n=i.map(e,function(e){if(!i.isFunction(t[e]))return{msg:\"Missing visitor method: <\"+e+\"> on \"+o.functionName(t.constructor)+\" CST Visitor.\",type:r.MISSING_METHOD,methodName:e}});return i.compact(n)}e.defaultVisit=u,e.createBaseSemanticVisitorConstructor=function(t,e){var n=function(){};return o.defineNameProp(n,t+\"BaseSemantics\"),(n.prototype={visit:function(t,e){if(i.isArray(t)&&(t=t[0]),!i.isUndefined(t))return void 0!==t.fullName?this[t.fullName](t.children,e):this[t.name](t.children,e)},validateVisitor:function(){var t=s(this,e);if(!i.isEmpty(t)){var n=i.map(t,function(t){return t.msg});throw Error(\"Errors Detected in CST Visitor <\"+o.functionName(this.constructor)+\">:\\n\\t\"+n.join(\"\\n\\n\").replace(/\\n/g,\"\\n\\t\"))}}}).constructor=n,n._RULE_NAMES=e,n},e.createBaseVisitorConstructorWithDefaults=function(t,e,n){var r=function(){};o.defineNameProp(r,t+\"BaseSemanticsWithDefaults\");var a=Object.create(n.prototype);return i.forEach(e,function(t){a[t]=u}),(r.prototype=a).constructor=r,r},function(t){t[t.REDUNDANT_METHOD=0]=\"REDUNDANT_METHOD\",t[t.MISSING_METHOD=1]=\"MISSING_METHOD\"}(r=e.CstVisitorDefinitionError||(e.CstVisitorDefinitionError={})),e.validateVisitor=s,e.validateMissingCstMethods=c;var l=[\"constructor\",\"visit\",\"validateVisitor\"];function E(t,e){var n=[];for(var u in t)a.validTermsPattern.test(u)&&i.isFunction(t[u])&&!i.contains(l,u)&&!i.contains(e,u)&&n.push({msg:\"Redundant visitor method: <\"+u+\"> on \"+o.functionName(t.constructor)+\" CST Visitor\\nThere is no Grammar Rule corresponding to this method's name.\\nFor utility methods on visitor classes use methods names that do not match /\"+a.validTermsPattern.source+\"/.\",type:r.REDUNDANT_METHOD,methodName:u});return n}e.validateRedundantMethods=E},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(8),i=function(){function t(){}return t.prototype.initLexerAdapter=function(){this.tokVector=[],this.tokVectorLength=0,this.currIdx=-1},Object.defineProperty(t.prototype,\"input\",{get:function(){return this.tokVector},set:function(t){this.reset(),this.tokVector=t,this.tokVectorLength=t.length},enumerable:!0,configurable:!0}),t.prototype.SKIP_TOKEN=function(){return this.currIdx<=this.tokVector.length-2?(this.consumeToken(),this.LA(1)):r.END_OF_FILE},t.prototype.LA=function(t){return this.currIdx+t<0||this.tokVectorLength<=this.currIdx+t?r.END_OF_FILE:this.tokVector[this.currIdx+t]},t.prototype.consumeToken=function(){this.currIdx++},t.prototype.exportLexerState=function(){return this.currIdx},t.prototype.importLexerState=function(t){this.currIdx=t},t.prototype.resetLexerState=function(){this.currIdx=-1},t.prototype.moveToTerminatedState=function(){this.currIdx=this.tokVector.length-1},t.prototype.getLexerPosition=function(){return this.exportLexerState()},t}();e.LexerAdapter=i},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(13),o=n(8),a=n(17),u=n(32),s=n(18),c=n(6),l=function(){function t(){}return t.prototype.CONSUME=function(t,e){return this.consumeInternal(t,0,e)},t.prototype.CONSUME1=function(t,e){return this.consumeInternal(t,1,e)},t.prototype.CONSUME2=function(t,e){return this.consumeInternal(t,2,e)},t.prototype.CONSUME3=function(t,e){return this.consumeInternal(t,3,e)},t.prototype.CONSUME4=function(t,e){return this.consumeInternal(t,4,e)},t.prototype.CONSUME5=function(t,e){return this.consumeInternal(t,5,e)},t.prototype.CONSUME6=function(t,e){return this.consumeInternal(t,6,e)},t.prototype.CONSUME7=function(t,e){return this.consumeInternal(t,7,e)},t.prototype.CONSUME8=function(t,e){return this.consumeInternal(t,8,e)},t.prototype.CONSUME9=function(t,e){return this.consumeInternal(t,9,e)},t.prototype.SUBRULE=function(t,e){return this.subruleInternal(t,0,e)},t.prototype.SUBRULE1=function(t,e){return this.subruleInternal(t,1,e)},t.prototype.SUBRULE2=function(t,e){return this.subruleInternal(t,2,e)},t.prototype.SUBRULE3=function(t,e){return this.subruleInternal(t,3,e)},t.prototype.SUBRULE4=function(t,e){return this.subruleInternal(t,4,e)},t.prototype.SUBRULE5=function(t,e){return this.subruleInternal(t,5,e)},t.prototype.SUBRULE6=function(t,e){return this.subruleInternal(t,6,e)},t.prototype.SUBRULE7=function(t,e){return this.subruleInternal(t,7,e)},t.prototype.SUBRULE8=function(t,e){return this.subruleInternal(t,8,e)},t.prototype.SUBRULE9=function(t,e){return this.subruleInternal(t,9,e)},t.prototype.OPTION=function(t){return this.optionInternal(t,0)},t.prototype.OPTION1=function(t){return this.optionInternal(t,1)},t.prototype.OPTION2=function(t){return this.optionInternal(t,2)},t.prototype.OPTION3=function(t){return this.optionInternal(t,3)},t.prototype.OPTION4=function(t){return this.optionInternal(t,4)},t.prototype.OPTION5=function(t){return this.optionInternal(t,5)},t.prototype.OPTION6=function(t){return this.optionInternal(t,6)},t.prototype.OPTION7=function(t){return this.optionInternal(t,7)},t.prototype.OPTION8=function(t){return this.optionInternal(t,8)},t.prototype.OPTION9=function(t){return this.optionInternal(t,9)},t.prototype.OR=function(t){return this.orInternal(t,0)},t.prototype.OR1=function(t){return this.orInternal(t,1)},t.prototype.OR2=function(t){return this.orInternal(t,2)},t.prototype.OR3=function(t){return this.orInternal(t,3)},t.prototype.OR4=function(t){return this.orInternal(t,4)},t.prototype.OR5=function(t){return this.orInternal(t,5)},t.prototype.OR6=function(t){return this.orInternal(t,6)},t.prototype.OR7=function(t){return this.orInternal(t,7)},t.prototype.OR8=function(t){return this.orInternal(t,8)},t.prototype.OR9=function(t){return this.orInternal(t,9)},t.prototype.MANY=function(t){this.manyInternal(0,t)},t.prototype.MANY1=function(t){this.manyInternal(1,t)},t.prototype.MANY2=function(t){this.manyInternal(2,t)},t.prototype.MANY3=function(t){this.manyInternal(3,t)},t.prototype.MANY4=function(t){this.manyInternal(4,t)},t.prototype.MANY5=function(t){this.manyInternal(5,t)},t.prototype.MANY6=function(t){this.manyInternal(6,t)},t.prototype.MANY7=function(t){this.manyInternal(7,t)},t.prototype.MANY8=function(t){this.manyInternal(8,t)},t.prototype.MANY9=function(t){this.manyInternal(9,t)},t.prototype.MANY_SEP=function(t){this.manySepFirstInternal(0,t)},t.prototype.MANY_SEP1=function(t){this.manySepFirstInternal(1,t)},t.prototype.MANY_SEP2=function(t){this.manySepFirstInternal(2,t)},t.prototype.MANY_SEP3=function(t){this.manySepFirstInternal(3,t)},t.prototype.MANY_SEP4=function(t){this.manySepFirstInternal(4,t)},t.prototype.MANY_SEP5=function(t){this.manySepFirstInternal(5,t)},t.prototype.MANY_SEP6=function(t){this.manySepFirstInternal(6,t)},t.prototype.MANY_SEP7=function(t){this.manySepFirstInternal(7,t)},t.prototype.MANY_SEP8=function(t){this.manySepFirstInternal(8,t)},t.prototype.MANY_SEP9=function(t){this.manySepFirstInternal(9,t)},t.prototype.AT_LEAST_ONE=function(t){this.atLeastOneInternal(0,t)},t.prototype.AT_LEAST_ONE1=function(t){return this.atLeastOneInternal(1,t)},t.prototype.AT_LEAST_ONE2=function(t){this.atLeastOneInternal(2,t)},t.prototype.AT_LEAST_ONE3=function(t){this.atLeastOneInternal(3,t)},t.prototype.AT_LEAST_ONE4=function(t){this.atLeastOneInternal(4,t)},t.prototype.AT_LEAST_ONE5=function(t){this.atLeastOneInternal(5,t)},t.prototype.AT_LEAST_ONE6=function(t){this.atLeastOneInternal(6,t)},t.prototype.AT_LEAST_ONE7=function(t){this.atLeastOneInternal(7,t)},t.prototype.AT_LEAST_ONE8=function(t){this.atLeastOneInternal(8,t)},t.prototype.AT_LEAST_ONE9=function(t){this.atLeastOneInternal(9,t)},t.prototype.AT_LEAST_ONE_SEP=function(t){this.atLeastOneSepFirstInternal(0,t)},t.prototype.AT_LEAST_ONE_SEP1=function(t){this.atLeastOneSepFirstInternal(1,t)},t.prototype.AT_LEAST_ONE_SEP2=function(t){this.atLeastOneSepFirstInternal(2,t)},t.prototype.AT_LEAST_ONE_SEP3=function(t){this.atLeastOneSepFirstInternal(3,t)},t.prototype.AT_LEAST_ONE_SEP4=function(t){this.atLeastOneSepFirstInternal(4,t)},t.prototype.AT_LEAST_ONE_SEP5=function(t){this.atLeastOneSepFirstInternal(5,t)},t.prototype.AT_LEAST_ONE_SEP6=function(t){this.atLeastOneSepFirstInternal(6,t)},t.prototype.AT_LEAST_ONE_SEP7=function(t){this.atLeastOneSepFirstInternal(7,t)},t.prototype.AT_LEAST_ONE_SEP8=function(t){this.atLeastOneSepFirstInternal(8,t)},t.prototype.AT_LEAST_ONE_SEP9=function(t){this.atLeastOneSepFirstInternal(9,t)},t.prototype.RULE=function(t,e,n){if(void 0===n&&(n=o.DEFAULT_RULE_CONFIG),r.contains(this.definedRulesNames,t)){var i={message:a.defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({topLevelRule:t,grammarName:this.className}),type:o.ParserDefinitionErrorType.DUPLICATE_RULE_NAME,ruleName:t};this.definitionErrors.push(i)}if(this.definedRulesNames.push(t),!this.gastProductionsCache.containsKey(t)&&!this.serializedGrammar){var s=u.buildTopProduction(e.toString(),t,this.tokensMap);this.gastProductionsCache.put(t,s)}var c=this.defineRule(t,e,n);return this[t]=c,c},t.prototype.OVERRIDE_RULE=function(t,e,n){void 0===n&&(n=o.DEFAULT_RULE_CONFIG);var r=[];if(r=r.concat(s.validateRuleIsOverridden(t,this.definedRulesNames,this.className)),this.definitionErrors.push.apply(this.definitionErrors,r),!this.serializedGrammar){var i=u.buildTopProduction(e.toString(),t,this.tokensMap);this.gastProductionsCache.put(t,i)}var a=this.defineRule(t,e,n);return this[t]=a,a},t.prototype.BACKTRACK=function(t,e){return function(){this.isBackTrackingStack.push(1);var n=this.saveRecogState();try{return t.apply(this,e),!0}catch(t){if(i.isRecognitionException(t))return!1;throw t}finally{this.reloadRecogState(n),this.isBackTrackingStack.pop()}}},t.prototype.getGAstProductions=function(){return this.gastProductionsCache},t.prototype.getSerializedGastProductions=function(){return c.serializeGrammar(this.gastProductionsCache.values())},t}();e.RecognizerApi=l},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(16),o=n(13),a=n(19),u=n(20),s=n(8),c=n(34),l=n(7),E=n(14),p=n(10),f=function(){function t(){}return t.prototype.initRecognizerEngine=function(t,e){if(this.className=p.classNameFromInstance(this),this.shortRuleNameToFull=new p.HashTable,this.fullRuleNameToShort=new p.HashTable,this.ruleShortNameIdx=256,this.tokenMatcher=E.tokenStructuredMatcherNoCategories,this.definedRulesNames=[],this.tokensMap={},this.allRuleNames=[],this.isBackTrackingStack=[],this.RULE_STACK=[],this.RULE_OCCURRENCE_STACK=[],this.gastProductionsCache=new p.HashTable,this.serializedGrammar=r.has(e,\"serializedGrammar\")?e.serializedGrammar:s.DEFAULT_PARSER_CONFIG.serializedGrammar,r.isArray(t)){if(r.isEmpty(t))throw Error(\"A Token Vocabulary cannot be empty.\\n\\tNote that the first argument for the parser constructor\\n\\tis no longer a Token vector (since v4.0).\");if(\"number\"==typeof t[0].startOffset)throw Error(\"The Parser constructor no longer accepts a token vector as the first argument.\\n\\tSee: https://sap.github.io/chevrotain/docs/changes/BREAKING_CHANGES.html#_4-0-0\\n\\tFor Further details.\")}if(r.isArray(t))this.tokensMap=r.reduce(t,function(t,e){return t[l.tokenName(e)]=e,t},{});else if(r.has(t,\"modes\")&&r.every(r.flatten(r.values(t.modes)),E.isTokenType)){var n=r.flatten(r.values(t.modes)),i=r.uniq(n);this.tokensMap=r.reduce(i,function(t,e){return t[l.tokenName(e)]=e,t},{})}else{if(!r.isObject(t))throw new Error(\"<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition\");this.tokensMap=r.cloneObj(t)}this.tokensMap.EOF=l.EOF;var o=r.every(r.values(t),function(t){return r.isEmpty(t.categoryMatches)});this.tokenMatcher=o?E.tokenStructuredMatcherNoCategories:E.tokenStructuredMatcher,E.augmentTokenTypes(r.values(this.tokensMap))},t.prototype.defineRule=function(t,e,n){if(this.selfAnalysisDone)throw Error(\"Grammar rule <\"+t+\"> may not be defined after the 'performSelfAnalysis' method has been called'\\nMake sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.\");var a,u=r.has(n,\"resyncEnabled\")?n.resyncEnabled:s.DEFAULT_RULE_CONFIG.resyncEnabled,c=r.has(n,\"recoveryValueFunc\")?n.recoveryValueFunc:s.DEFAULT_RULE_CONFIG.recoveryValueFunc,l=this.ruleShortNameIdx<<i.BITS_FOR_METHOD_IDX+i.BITS_FOR_OCCURRENCE_IDX;this.ruleShortNameIdx++,this.shortRuleNameToFull.put(l,t),this.fullRuleNameToShort.put(t,l);return(a=function(n,r){return void 0===n&&(n=0),this.ruleInvocationStateUpdate(l,t,n),function(t){try{if(!0===this.outputCst){e.apply(this,t);var n=this.CST_STACK[this.CST_STACK.length-1];return this.cstPostRule(n),n}return e.apply(this,t)}catch(t){var r=1===this.RULE_STACK.length,i=u&&!this.isBackTracking()&&this.recoveryEnabled;if(o.isRecognitionException(t)){if(i){var a,s=this.findReSyncTokenType();if(this.isInCurrentRuleReSyncSet(s))return t.resyncedTokens=this.reSyncTo(s),this.outputCst?((a=this.CST_STACK[this.CST_STACK.length-1]).recoveredNode=!0,a):c();throw this.outputCst&&((a=this.CST_STACK[this.CST_STACK.length-1]).recoveredNode=!0,t.partialCstResult=a),t}if(r)return this.moveToTerminatedState(),c();throw t}throw t}finally{this.ruleFinallyStateUpdate()}}.call(this,r)}).ruleName=t,a},t.prototype.optionInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.OPTION_IDX,e),r=this.nestedRuleBeforeClause(t,n);try{return this.optionInternalLogic(t,e,n)}finally{void 0!==r&&this.nestedRuleFinallyClause(n,r)}},t.prototype.optionInternalNoCst=function(t,e){var n=this.getKeyForAutomaticLookahead(i.OPTION_IDX,e);return this.optionInternalLogic(t,e,n)},t.prototype.optionInternalLogic=function(t,e,n){var r,i,o=this,a=this.getLookaheadFuncForOption(n,e);if(void 0!==t.DEF){if(r=t.DEF,void 0!==(i=t.GATE)){var u=a;a=function(){return i.call(o)&&u.call(o)}}}else r=t;if(!0===a.call(this))return r.call(this)},t.prototype.atLeastOneInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.AT_LEAST_ONE_IDX,t),r=this.nestedRuleBeforeClause(e,n);try{return this.atLeastOneInternalLogic(t,e,n)}finally{void 0!==r&&this.nestedRuleFinallyClause(n,r)}},t.prototype.atLeastOneInternalNoCst=function(t,e){var n=this.getKeyForAutomaticLookahead(i.AT_LEAST_ONE_IDX,t);this.atLeastOneInternalLogic(t,e,n)},t.prototype.atLeastOneInternalLogic=function(t,e,n){var r,o,s=this,c=this.getLookaheadFuncForAtLeastOne(n,t);if(void 0!==e.DEF){if(r=e.DEF,void 0!==(o=e.GATE)){var l=c;c=function(){return o.call(s)&&l.call(s)}}}else r=e;if(!0!==c.call(this))throw this.raiseEarlyExitException(t,a.PROD_TYPE.REPETITION_MANDATORY,e.ERR_MSG);for(var E=this.doSingleRepetition(r);!0===c.call(this)&&!0===E;)E=this.doSingleRepetition(r);this.attemptInRepetitionRecovery(this.atLeastOneInternal,[t,e],c,i.AT_LEAST_ONE_IDX,t,u.NextTerminalAfterAtLeastOneWalker)},t.prototype.atLeastOneSepFirstInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.AT_LEAST_ONE_SEP_IDX,t),r=this.nestedRuleBeforeClause(e,n);try{this.atLeastOneSepFirstInternalLogic(t,e,n)}finally{void 0!==r&&this.nestedRuleFinallyClause(n,r)}},t.prototype.atLeastOneSepFirstInternalNoCst=function(t,e){var n=this.getKeyForAutomaticLookahead(i.AT_LEAST_ONE_SEP_IDX,t);this.atLeastOneSepFirstInternalLogic(t,e,n)},t.prototype.atLeastOneSepFirstInternalLogic=function(t,e,n){var r=this,o=e.DEF,s=e.SEP;if(!0!==this.getLookaheadFuncForAtLeastOneSep(n,t).call(this))throw this.raiseEarlyExitException(t,a.PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR,e.ERR_MSG);o.call(this);for(var c=function(){return r.tokenMatcher(r.LA(1),s)};!0===this.tokenMatcher(this.LA(1),s);)this.CONSUME(s),o.call(this);this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal,[t,s,c,o,u.NextTerminalAfterAtLeastOneSepWalker],c,i.AT_LEAST_ONE_SEP_IDX,t,u.NextTerminalAfterAtLeastOneSepWalker)},t.prototype.manyInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.MANY_IDX,t),r=this.nestedRuleBeforeClause(e,n);try{return this.manyInternalLogic(t,e,n)}finally{void 0!==r&&this.nestedRuleFinallyClause(n,r)}},t.prototype.manyInternalNoCst=function(t,e){var n=this.getKeyForAutomaticLookahead(i.MANY_IDX,t);return this.manyInternalLogic(t,e,n)},t.prototype.manyInternalLogic=function(t,e,n){var r,o,a=this,s=this.getLookaheadFuncForMany(n,t);if(void 0!==e.DEF){if(r=e.DEF,void 0!==(o=e.GATE)){var c=s;s=function(){return o.call(a)&&c.call(a)}}}else r=e;for(var l=!0;!0===s.call(this)&&!0===l;)l=this.doSingleRepetition(r);this.attemptInRepetitionRecovery(this.manyInternal,[t,e],s,i.MANY_IDX,t,u.NextTerminalAfterManyWalker)},t.prototype.manySepFirstInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.MANY_SEP_IDX,t),r=this.nestedRuleBeforeClause(e,n);try{this.manySepFirstInternalLogic(t,e,n)}finally{void 0!==r&&this.nestedRuleFinallyClause(n,r)}},t.prototype.manySepFirstInternalNoCst=function(t,e){var n=this.getKeyForAutomaticLookahead(i.MANY_SEP_IDX,t);this.manySepFirstInternalLogic(t,e,n)},t.prototype.manySepFirstInternalLogic=function(t,e,n){var r=this,o=e.DEF,a=e.SEP;if(!0===this.getLookaheadFuncForManySep(n,t).call(this)){o.call(this);for(var s=function(){return r.tokenMatcher(r.LA(1),a)};!0===this.tokenMatcher(this.LA(1),a);)this.CONSUME(a),o.call(this);this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal,[t,a,s,o,u.NextTerminalAfterManySepWalker],s,i.MANY_SEP_IDX,t,u.NextTerminalAfterManySepWalker)}},t.prototype.repetitionSepSecondInternal=function(t,e,n,r,o){for(;n();)this.CONSUME(e),r.call(this);this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal,[t,e,n,r,o],n,i.AT_LEAST_ONE_SEP_IDX,t,o)},t.prototype.doSingleRepetition=function(t){var e=this.getLexerPosition();return t.call(this),this.getLexerPosition()>e},t.prototype.orInternalNoCst=function(t,e){var n=r.isArray(t)?t:t.DEF,i=this.getLookaheadFuncForOr(e,n).call(this,n);if(void 0!==i)return n[i].ALT.call(this);this.raiseNoAltException(e,t.ERR_MSG)},t.prototype.orInternal=function(t,e){var n=this.getKeyForAutomaticLookahead(i.OR_IDX,e),o=this.nestedRuleBeforeClause(t,n);try{var a=r.isArray(t)?t:t.DEF,u=this.getLookaheadFuncForOr(e,a).call(this,a);if(void 0!==u){var s=a[u],c=this.nestedAltBeforeClause(s,e,i.OR_IDX,u);try{return s.ALT.call(this)}finally{void 0!==c&&this.nestedRuleFinallyClause(c.shortName,c.nestedName)}}this.raiseNoAltException(e,t.ERR_MSG)}finally{void 0!==o&&this.nestedRuleFinallyClause(n,o)}},t.prototype.ruleFinallyStateUpdate=function(){if(this.RULE_STACK.pop(),this.RULE_OCCURRENCE_STACK.pop(),this.cstFinallyStateUpdate(),0===this.RULE_STACK.length&&!this.isAtEndOfInput()){var t=this.LA(1),e=this.errorMessageProvider.buildNotAllInputParsedMessage({firstRedundant:t,ruleName:this.getCurrRuleFullName()});this.SAVE_ERROR(new o.NotAllInputParsedException(e,t))}},t.prototype.subruleInternal=function(t,e,n){var r;try{var i=void 0!==n?n.ARGS:void 0;return r=t.call(this,e,i),this.cstPostNonTerminal(r,void 0!==n&&void 0!==n.LABEL?n.LABEL:t.ruleName),r}catch(e){throw o.isRecognitionException(e)&&void 0!==e.partialCstResult&&(this.cstPostNonTerminal(e.partialCstResult,void 0!==n&&void 0!==n.LABEL?n.LABEL:t.ruleName),delete e.partialCstResult),e}},t.prototype.consumeInternal=function(t,e,n){var r;try{var i=this.LA(1);if(!0!==this.tokenMatcher(i,t)){var a=void 0,u=this.LA(0);throw a=void 0!==n&&n.ERR_MSG?n.ERR_MSG:this.errorMessageProvider.buildMismatchTokenMessage({expected:t,actual:i,previous:u,ruleName:this.getCurrRuleFullName()}),this.SAVE_ERROR(new o.MismatchedTokenException(a,i,u))}this.consumeToken(),r=i}catch(n){if(!this.recoveryEnabled||\"MismatchedTokenException\"!==n.name||this.isBackTracking())throw n;var s=this.getFollowsForInRuleRecovery(t,e);try{r=this.tryInRuleRecovery(t,s)}catch(t){throw t.name===c.IN_RULE_RECOVERY_EXCEPTION?n:t}}return this.cstPostTerminal(void 0!==n&&void 0!==n.LABEL?n.LABEL:t.tokenName,r),r},t.prototype.saveRecogState=function(){var t=this.errors,e=r.cloneArr(this.RULE_STACK);return{errors:t,lexerState:this.exportLexerState(),RULE_STACK:e,CST_STACK:this.CST_STACK,LAST_EXPLICIT_RULE_STACK:this.LAST_EXPLICIT_RULE_STACK}},t.prototype.reloadRecogState=function(t){this.errors=t.errors,this.importLexerState(t.lexerState),this.RULE_STACK=t.RULE_STACK},t.prototype.ruleInvocationStateUpdate=function(t,e,n){this.RULE_OCCURRENCE_STACK.push(n),this.RULE_STACK.push(t),this.cstInvocationStateUpdate(e,t)},t.prototype.isBackTracking=function(){return!r.isEmpty(this.isBackTrackingStack)},t.prototype.getCurrRuleFullName=function(){var t=this.getLastExplicitRuleShortName();return this.shortRuleNameToFull.get(t)},t.prototype.shortRuleNameToFullName=function(t){return this.shortRuleNameToFull.get(t)},t.prototype.isAtEndOfInput=function(){return this.tokenMatcher(this.LA(1),l.EOF)},t.prototype.reset=function(){this.resetLexerState(),this.isBackTrackingStack=[],this.errors=[],this.RULE_STACK=[],this.LAST_EXPLICIT_RULE_STACK=[],this.CST_STACK=[],this.RULE_OCCURRENCE_STACK=[]},t}();e.RecognizerEngine=f},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(13),i=n(4),o=n(19),a=n(8),u=function(){function t(){}return t.prototype.initErrorHandler=function(t){this._errors=[],this.errorMessageProvider=i.defaults(t.errorMessageProvider,a.DEFAULT_PARSER_CONFIG.errorMessageProvider)},t.prototype.SAVE_ERROR=function(t){if(r.isRecognitionException(t))return t.context={ruleStack:this.getHumanReadableRuleStack(),ruleOccurrenceStack:i.cloneArr(this.RULE_OCCURRENCE_STACK)},this._errors.push(t),t;throw Error(\"Trying to save an Error which is not a RecognitionException\")},Object.defineProperty(t.prototype,\"errors\",{get:function(){return i.cloneArr(this._errors)},set:function(t){this._errors=t},enumerable:!0,configurable:!0}),t.prototype.raiseEarlyExitException=function(t,e,n){for(var i=this.getCurrRuleFullName(),a=this.getGAstProductions().get(i),u=o.getLookaheadPathsForOptionalProd(t,a,e,this.maxLookahead)[0],s=[],c=1;c<this.maxLookahead;c++)s.push(this.LA(c));var l=this.errorMessageProvider.buildEarlyExitMessage({expectedIterationPaths:u,actual:s,previous:this.LA(0),customUserDescription:n,ruleName:i});throw this.SAVE_ERROR(new r.EarlyExitException(l,this.LA(1),this.LA(0)))},t.prototype.raiseNoAltException=function(t,e){for(var n=this.getCurrRuleFullName(),i=this.getGAstProductions().get(n),a=o.getLookaheadPathsForOr(t,i,this.maxLookahead),u=[],s=1;s<=this.maxLookahead;s++)u.push(this.LA(s));var c=this.LA(0),l=this.errorMessageProvider.buildNoViableAltMessage({expectedPathsPerAlt:a,actual:u,previous:c,customUserDescription:e,ruleName:this.getCurrRuleFullName()});throw this.SAVE_ERROR(new r.NoViableAltException(l,this.LA(1),c))},t}();e.ErrorHandler=u},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(20),i=n(4),o=function(){function t(){}return t.prototype.initContentAssist=function(){},t.prototype.computeContentAssist=function(t,e){var n=this.gastProductionsCache.get(t);if(i.isUndefined(n))throw Error(\"Rule ->\"+t+\"<- does not exist in this grammar.\");return r.nextPossibleTokensAfter([n],e,this.tokenMatcher,this.maxLookahead)},t.prototype.getNextPossibleTokenTypes=function(t){var e=i.first(t.ruleStack),n=this.getGAstProductions().get(e);return new r.NextAfterTokenWalker(n,t).startWalking()},t}();e.ContentAssist=o},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(25);e.createSyntaxDiagramsCode=function(t,e){var n=void 0===e?{}:e,i=n.resourceBase,o=void 0===i?\"https://unpkg.com/chevrotain@\"+r.VERSION+\"/diagrams/\":i,a=n.css;return\"\\n\\x3c!-- This is a generated file --\\x3e\\n<!DOCTYPE html>\\n<meta charset=\\\"utf-8\\\">\\n<style>\\n  body {\\n    background-color: hsl(30, 20%, 95%)\\n  }\\n</style>\\n\\n\\n<link rel='stylesheet' href='\"+(void 0===a?\"https://unpkg.com/chevrotain@\"+r.VERSION+\"/diagrams/diagrams.css\":a)+\"'>\\n\\n<script src='\"+o+\"vendor/railroad-diagrams.js'><\\/script>\\n<script src='\"+o+\"src/diagrams_builder.js'><\\/script>\\n<script src='\"+o+\"src/diagrams_behavior.js'><\\/script>\\n<script src='\"+o+'src/main.js\\'><\\/script>\\n\\n<div id=\"diagrams\" align=\"center\"></div>    \\n\\n<script>\\n    window.serializedGrammar = '+JSON.stringify(t,null,\"  \")+';\\n<\\/script>\\n\\n<script>\\n    var diagramsDiv = document.getElementById(\"diagrams\");\\n    main.drawDiagramsFromSerializedGrammar(serializedGrammar, diagramsDiv);\\n<\\/script>\\n'}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(52);e.generateParserFactory=function(t){var e=r.genWrapperFunction({name:t.name,rules:t.rules}),i=new Function(\"tokenVocabulary\",\"config\",\"chevrotain\",e);return function(e){return i(t.tokenVocabulary,e,n(1))}},e.generateParserModule=function(t){return r.genUmdModule({name:t.name,rules:t.rules})}},function(t,e,n){\"use strict\";Object.defineProperty(e,\"__esModule\",{value:!0});var r=n(4),i=n(7),o=n(6),a=\"\\n\";function u(t){return\"\\nfunction \"+t.name+\"(tokenVocabulary, config) {\\n    // invoke super constructor\\n    // No support for embedded actions currently, so we can 'hardcode'\\n    // The use of CstParser.\\n    chevrotain.CstParser.call(this, tokenVocabulary, config)\\n\\n    const $ = this\\n\\n    \"+s(t.rules)+\"\\n\\n    // very important to call this after all the rules have been defined.\\n    // otherwise the parser may not work correctly as it will lack information\\n    // derived during the self analysis phase.\\n    this.performSelfAnalysis(this)\\n}\\n\\n// inheritance as implemented in javascript in the previous decade... :(\\n\"+t.name+\".prototype = Object.create(chevrotain.CstParser.prototype)\\n\"+t.name+\".prototype.constructor = \"+t.name+\"    \\n    \"}function s(t){return r.map(t,function(t){return c(t,1)}).join(\"\\n\")}function c(t,e){var n=T(e,'$.RULE(\"'+t.name+'\", function() {')+a;return n+=h(t.definition,e+1),n+=T(e+1,\"})\")+a}function l(t,e){var n=i.tokenName(t.terminalType);return T(e,\"$.CONSUME\"+t.idx+\"(this.tokensMap.\"+n+\")\"+a)}function E(t,e){return T(e,\"$.SUBRULE\"+t.idx+\"($.\"+t.nonTerminalName+\")\"+a)}function p(t,e){var n=T(e,\"$.OR\"+t.idx+\"([\")+a;return n+=r.map(t.definition,function(t){return f(t,e+1)}).join(\",\"+a),n+=a+T(e,\"])\"+a)}function f(t,e){var n=T(e,\"{\")+a;return t.name&&(n+=T(e+1,'NAME: \"'+t.name+'\",')+a),n+=T(e+1,\"ALT: function() {\")+a,n+=h(t.definition,e+1),n+=T(e+1,\"}\")+a,n+=T(e,\"}\")}function L(t,e,n){var r=T(n,\"$.\"+(t+e.idx)+\"(\");return e.name||e.separator?(r+=\"{\"+a,e.name&&(r+=T(n+1,'NAME: \"'+e.name+'\"')+\",\"+a),e.separator&&(r+=T(n+1,\"SEP: this.tokensMap.\"+i.tokenName(e.separator))+\",\"+a),r+=\"DEF: \"+S(e.definition,n+2)+a,r+=T(n,\"}\")+a):r+=S(e.definition,n+1),r+=T(n,\")\")+a}function S(t,e){var n=\"function() {\"+a;return n+=h(t,e),n+=T(e,\"}\")+a}function h(t,e){var n=\"\";return r.forEach(t,function(t){n+=function(t,e){if(t instanceof o.NonTerminal)return E(t,e);if(t instanceof o.Option)return L(\"OPTION\",t,e);if(t instanceof o.RepetitionMandatory)return L(\"AT_LEAST_ONE\",t,e);if(t instanceof o.RepetitionMandatoryWithSeparator)return L(\"AT_LEAST_ONE_SEP\",t,e);if(t instanceof o.RepetitionWithSeparator)return L(\"MANY_SEP\",t,e);if(t instanceof o.Repetition)return L(\"MANY\",t,e);if(t instanceof o.Alternation)return p(t,e);if(t instanceof o.Terminal)return l(t,e);if(t instanceof o.Flat)return h(t.definition,e);throw Error(\"non exhaustive match\")}(t,e+1)}),n}function T(t,e){return Array(4*t+1).join(\" \")+e}e.genUmdModule=function(t){return\"\\n(function (root, factory) {\\n    if (typeof define === 'function' && define.amd) {\\n        // AMD. Register as an anonymous module.\\n        define(['chevrotain'], factory);\\n    } else if (typeof module === 'object' && module.exports) {\\n        // Node. Does not work with strict CommonJS, but\\n        // only CommonJS-like environments that support module.exports,\\n        // like Node.\\n        module.exports = factory(require('chevrotain'));\\n    } else {\\n        // Browser globals (root is window)\\n        root.returnExports = factory(root.b);\\n    }\\n}(typeof self !== 'undefined' ? self : this, function (chevrotain) {\\n\\n\"+u(t)+\"\\n    \\nreturn {\\n    \"+t.name+\": \"+t.name+\" \\n}\\n}));\\n\"},e.genWrapperFunction=function(t){return\"    \\n\"+u(t)+\"\\nreturn new \"+t.name+\"(tokenVocabulary, config)    \\n\"},e.genClass=u,e.genAllRules=s,e.genRule=c,e.genTerminal=l,e.genNonTerminal=E,e.genAlternation=p,e.genSingleAlt=f},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return W3SpecSparqlParser});var r,i=n(21),o=n(1),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=n(9).baseTokens,W3SpecSparqlParser=function(t){function W3SpecSparqlParser(e){var n=t.call(this,e,u)||this;return o.Parser.performSelfAnalysis(n),n}return a(W3SpecSparqlParser,t),W3SpecSparqlParser}(i.a)},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return BaseGraphQlParser});var r,i=n(1),o=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=n(57).graphQlTokenMap,BaseGraphQlParser=function(t){function BaseGraphQlParser(e,n){void 0===e&&(e={});var r=t.call(this,n,a({recoveryEnabled:!0,outputCst:!0},e.config))||this;return r.tokenize=function(t){return r.lexer.tokenize(t).tokens},r.parse=function(t,e){void 0===e&&(e=r.Document),r.input=r.lexer.tokenize(t).tokens;var n=e.call(r);return{errors:r.errors,cst:n}},r.Document=r.RULE(\"Document\",function(){r.AT_LEAST_ONE(function(){return r.SUBRULE(r.Definition)})}),r.Definition=r.RULE(\"Definition\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.ExecutableDefinition)}},{ALT:function(){return r.SUBRULE(r.TypeSystemDefinition)}},{ALT:function(){return r.SUBRULE(r.TypeSystemExtension)}}])}),r.ExecutableDefinition=r.RULE(\"ExecutableDefinition\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.OperationDefinition)}},{ALT:function(){return r.SUBRULE(r.FragmentDefinition)}}])}),r.OperationDefinition=r.RULE(\"OperationDefinition\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.SelectionSet)}},{ALT:function(){r.SUBRULE(r.OperationType),r.OPTION(function(){return r.CONSUME(u.Name)}),r.OPTION1(function(){return r.SUBRULE(r.VariableDefinitions)}),r.OPTION2(function(){return r.SUBRULE(r.Directives)}),r.SUBRULE1(r.SelectionSet)}}])}),r.OperationType=r.RULE(\"OperationType\",function(){r.OR([{ALT:function(){return r.CONSUME(u.Query)}},{ALT:function(){return r.CONSUME(u.Mutation)}},{ALT:function(){return r.CONSUME(u.Subscription)}}])}),r.SelectionSet=r.RULE(\"SelectionSet\",function(){r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.Selection)}),r.CONSUME(u.RCurly)}),r.Selection=r.RULE(\"Selection\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.Field)}},{ALT:function(){return r.SUBRULE(r.InlineFragment)}},{ALT:function(){return r.SUBRULE(r.FragmentSpread)}}])}),r.Field=r.RULE(\"Field\",function(){r.OPTION(function(){return r.SUBRULE(r.Alias)}),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.Arguments,{ARGS:[!1]})}),r.OPTION2(function(){return r.SUBRULE(r.Directives)}),r.OPTION3(function(){return r.SUBRULE(r.SelectionSet)})}),r.Alias=r.RULE(\"Alias\",function(){r.CONSUME(u.Name),r.CONSUME(u.Colon)}),r.Arguments=r.RULE(\"Arguments\",function(t){r.CONSUME(u.LParen),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.Argument,{ARGS:[t]})}),r.CONSUME(u.RParen)}),r.Argument=r.RULE(\"Argument\",function(t){r.SUBRULE(r.Alias),r.SUBRULE(r.Value,{ARGS:[t]})}),r.FragmentSpread=r.RULE(\"FragmentSpread\",function(){r.CONSUME(u.Spread),r.CONSUME(u.FragmentName),r.OPTION(function(){return r.SUBRULE(r.Directives)})}),r.InlineFragment=r.RULE(\"InlineFragment\",function(){r.CONSUME(u.Spread),r.OPTION(function(){return r.SUBRULE(r.TypeCondition)}),r.OPTION1(function(){return r.SUBRULE(r.Directives)}),r.SUBRULE(r.SelectionSet)}),r.FragmentDefinition=r.RULE(\"FragmentDefinition\",function(){r.CONSUME(u.Fragment),r.CONSUME(u.FragmentName),r.SUBRULE(r.TypeCondition),r.OPTION(function(){return r.SUBRULE(r.Directives)}),r.SUBRULE(r.SelectionSet)}),r.TypeCondition=r.RULE(\"TypeCondition\",function(){r.CONSUME(u.On),r.SUBRULE(r.NamedType)}),r.Value=r.RULE(\"Value\",function(t){r.OR([{GATE:function(){return!t},ALT:function(){return r.SUBRULE(r.Variable)}},{ALT:function(){return r.SUBRULE(r.IntValue)}},{ALT:function(){return r.SUBRULE(r.FloatValue)}},{ALT:function(){return r.SUBRULE(r.StringValue)}},{ALT:function(){return r.SUBRULE(r.BooleanValue)}},{ALT:function(){return r.SUBRULE(r.NullValue)}},{ALT:function(){return r.SUBRULE(r.EnumValue)}},{ALT:function(){return r.SUBRULE(r.ListValue,{ARGS:[t]})}},{ALT:function(){return r.SUBRULE(r.ObjectValue,{ARGS:[t]})}}])}),r.IntValue=r.RULE(\"IntValue\",function(){r.CONSUME(u.IntValueToken)}),r.FloatValue=r.RULE(\"FloatValue\",function(){r.CONSUME(u.FloatValueToken)}),r.StringValue=r.RULE(\"StringValue\",function(){r.CONSUME(u.StringValueToken)}),r.BooleanValue=r.RULE(\"BooleanValue\",function(){r.CONSUME(u.BooleanValueToken)}),r.NullValue=r.RULE(\"NullValue\",function(){r.CONSUME(u.NullValueToken)}),r.EnumValue=r.RULE(\"EnumValue\",function(){r.CONSUME(u.EnumValueToken)}),r.ListValue=r.RULE(\"ListValue\",function(t){r.CONSUME(u.LBracket),r.MANY(function(){return r.SUBRULE(r.Value,{ARGS:[t]})}),r.CONSUME(u.RBracket)}),r.ObjectValue=r.RULE(\"ObjectValue\",function(t){r.CONSUME(u.LCurly),r.MANY(function(){return r.SUBRULE(r.ObjectField,{ARGS:[t]})}),r.CONSUME(u.RCurly)}),r.ObjectField=r.RULE(\"ObjectField\",function(t){r.SUBRULE(r.Alias),r.SUBRULE(r.Value,{ARGS:[t]})}),r.VariableDefinitions=r.RULE(\"VariableDefinitions\",function(){r.CONSUME(u.LParen),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.VariableDefinition)}),r.CONSUME(u.RParen)}),r.VariableDefinition=r.RULE(\"VariableDefinition\",function(){r.SUBRULE(r.Variable),r.CONSUME(u.Colon),r.SUBRULE(r.Type),r.OPTION(function(){return r.SUBRULE(r.DefaultValue)})}),r.Variable=r.RULE(\"Variable\",function(){r.CONSUME(u.Dollar),r.CONSUME(u.Name)}),r.DefaultValue=r.RULE(\"DefaultValue\",function(){r.CONSUME(u.Equals),r.SUBRULE(r.Value,{ARGS:[!0]})}),r.Type=r.RULE(\"Type\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.NamedType)}},{ALT:function(){return r.SUBRULE(r.ListType)}}]),r.OPTION(function(){return r.CONSUME(u.Bang)})}),r.NamedType=r.RULE(\"NamedType\",function(){r.CONSUME(u.Name)}),r.ListType=r.RULE(\"ListType\",function(){r.CONSUME(u.LBracket),r.SUBRULE(r.Type),r.CONSUME(u.RBracket)}),r.Directives=r.RULE(\"Directives\",function(t){r.AT_LEAST_ONE(function(){return r.SUBRULE(r.Directive,{ARGS:[t]})})}),r.Directive=r.RULE(\"Directive\",function(t){r.CONSUME(u.At),r.CONSUME(u.Name),r.OPTION(function(){return r.SUBRULE(r.Arguments,{ARGS:[t]})})}),r.TypeSystemDefinition=r.RULE(\"TypeSystemDefinition\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.SchemaDefinition)}},{ALT:function(){return r.SUBRULE(r.TypeDefinition)}},{ALT:function(){return r.SUBRULE(r.DirectiveDefinition)}}])}),r.TypeSystemExtension=r.RULE(\"TypeSystemExtension\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.SchemaExtension)}},{ALT:function(){return r.SUBRULE(r.TypeExtension)}}])}),r.SchemaDefinition=r.RULE(\"SchemaDefinition\",function(){r.CONSUME(u.Schema),r.OPTION(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.OperationTypeDefinition)}),r.CONSUME(u.RCurly)}),r.SchemaExtension=r.RULE(\"SchemaExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Schema),r.OR([{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION(function(){return r.SUBRULE1(r.OperationTypeDefinitionList)})}},{ALT:function(){return r.SUBRULE(r.OperationTypeDefinitionList)}}])}),r.OperationTypeDefinitionList=r.RULE(\"OperationTypeDefinitionList\",function(){r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.OperationTypeDefinition)}),r.CONSUME(u.RCurly)}),r.OperationTypeDefinition=r.RULE(\"OperationTypeDefinition\",function(){r.SUBRULE(r.OperationType),r.CONSUME(u.Colon),r.SUBRULE(r.NamedType)}),r.Description=r.RULE(\"Description\",function(){r.SUBRULE(r.StringValue)}),r.TypeDefinition=r.RULE(\"TypeDefinition\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.ScalarTypeDefinition)}},{ALT:function(){return r.SUBRULE(r.ObjectTypeDefinition)}},{ALT:function(){return r.SUBRULE(r.InterfaceTypeDefinition)}},{ALT:function(){return r.SUBRULE(r.UnionTypeDefinition)}},{ALT:function(){return r.SUBRULE(r.EnumTypeDefinition)}},{ALT:function(){return r.SUBRULE(r.InputObjectTypeDefinition)}}])}),r.TypeExtension=r.RULE(\"TypeExtension\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.ScalarTypeExtension)}},{ALT:function(){return r.SUBRULE(r.ObjectTypeExtension)}},{ALT:function(){return r.SUBRULE(r.InterfaceTypeExtension)}},{ALT:function(){return r.SUBRULE(r.UnionTypeExtension)}},{ALT:function(){return r.SUBRULE(r.EnumTypeExtension)}},{ALT:function(){return r.SUBRULE(r.InputObjectTypeExtension)}}])}),r.ScalarTypeDefinition=r.RULE(\"ScalarTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Scalar),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})})}),r.ScalarTypeExtension=r.RULE(\"ScalarTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Scalar),r.CONSUME(u.Name),r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.ObjectTypeDefinition=r.RULE(\"ObjectTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.TypeToken),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.ImplementsInterfaces)}),r.OPTION2(function(){return r.SUBRULE1(r.Directives,{ARGS:[!0]})}),r.OPTION3(function(){return r.SUBRULE(r.FieldsDefinition)})}),r.ObjectTypeExtension=r.RULE(\"ObjectTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.TypeToken),r.CONSUME(u.Name),r.OR([{ALT:function(){r.SUBRULE(r.ImplementsInterfaces),r.OPTION(function(){return r.SUBRULE1(r.Directives,{ARGS:[!0]})}),r.OPTION1(function(){return r.SUBRULE(r.FieldsDefinition)})}},{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION2(function(){return r.SUBRULE1(r.FieldsDefinition)})}},{ALT:function(){return r.SUBRULE2(r.FieldsDefinition)}}])}),r.ImplementsInterfaces=r.RULE(\"ImplementsInterfaces\",function(){r.CONSUME(u.Implements),r.OPTION(function(){return r.CONSUME(u.Amp)}),r.SUBRULE(r.NamedType),r.MANY(function(){r.CONSUME1(u.Amp),r.SUBRULE1(r.NamedType)})}),r.FieldsDefinition=r.RULE(\"FieldsDefinition\",function(){r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.FieldDefinition)}),r.CONSUME(u.RCurly)}),r.FieldDefinition=r.RULE(\"FieldDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.ArgumentsDefinition)}),r.CONSUME(u.Colon),r.SUBRULE(r.Type),r.OPTION2(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})})}),r.ArgumentsDefinition=r.RULE(\"ArgumentsDefinition\",function(){r.CONSUME(u.LParen),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.InputValueDefinition)}),r.CONSUME(u.RParen)}),r.InputValueDefinition=r.RULE(\"InputValueDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Name),r.CONSUME(u.Colon),r.SUBRULE(r.Type),r.OPTION1(function(){return r.SUBRULE(r.DefaultValue)}),r.OPTION2(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})})}),r.InterfaceTypeDefinition=r.RULE(\"InterfaceTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Interface),r.CONSUME(u.Name),r.OPTION2(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.OPTION3(function(){return r.SUBRULE(r.FieldsDefinition)})}),r.InterfaceTypeExtension=r.RULE(\"InterfaceTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Interface),r.CONSUME(u.Name),r.OR([{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION(function(){return r.SUBRULE(r.FieldsDefinition)})}},{ALT:function(){return r.SUBRULE1(r.FieldsDefinition)}}])}),r.UnionTypeDefinition=r.RULE(\"UnionTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Union),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.OPTION2(function(){return r.SUBRULE(r.UnionMemberTypes)})}),r.UnionMemberTypes=r.RULE(\"UnionMemberTypes\",function(){r.CONSUME(u.Equals),r.OPTION(function(){return r.CONSUME(u.Pipe)}),r.SUBRULE(r.NamedType),r.MANY(function(){r.CONSUME1(u.Pipe),r.SUBRULE1(r.NamedType)})}),r.UnionTypeExtension=r.RULE(\"UnionTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Union),r.CONSUME(u.Name),r.OR([{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION(function(){return r.SUBRULE(r.UnionMemberTypes)})}},{ALT:function(){return r.SUBRULE1(r.UnionMemberTypes)}}])}),r.EnumTypeDefinition=r.RULE(\"EnumTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Enum),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.OPTION2(function(){return r.SUBRULE(r.EnumValuesDefinition)})}),r.EnumValuesDefinition=r.RULE(\"EnumValuesDefinition\",function(){r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.EnumValueDefinition)}),r.CONSUME(u.RCurly)}),r.EnumValueDefinition=r.RULE(\"EnumValueDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.SUBRULE(r.EnumValue),r.OPTION1(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})})}),r.EnumTypeExtension=r.RULE(\"EnumTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Enum),r.CONSUME(u.Name),r.OR([{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION(function(){return r.SUBRULE(r.EnumValuesDefinition)})}},{ALT:function(){return r.SUBRULE1(r.EnumValuesDefinition)}}])}),r.InputObjectTypeDefinition=r.RULE(\"InputObjectTypeDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.Input),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.Directives,{ARGS:[!0]})}),r.OPTION2(function(){return r.SUBRULE(r.InputFieldsDefinition)})}),r.InputFieldsDefinition=r.RULE(\"InputFieldsDefinition\",function(){r.CONSUME(u.LCurly),r.AT_LEAST_ONE(function(){return r.SUBRULE(r.InputValueDefinition)}),r.CONSUME(u.RCurly)}),r.InputObjectTypeExtension=r.RULE(\"InputObjectTypeExtension\",function(){r.CONSUME(u.Extend),r.CONSUME(u.Input),r.CONSUME(u.Name),r.OR([{ALT:function(){r.SUBRULE(r.Directives,{ARGS:[!0]}),r.OPTION(function(){return r.SUBRULE1(r.InputFieldsDefinition)})}},{ALT:function(){return r.SUBRULE(r.InputFieldsDefinition)}}])}),r.DirectiveDefinition=r.RULE(\"DirectiveDefinition\",function(){r.OPTION(function(){return r.SUBRULE(r.Description)}),r.CONSUME(u.DirectiveToken),r.CONSUME(u.At),r.CONSUME(u.Name),r.OPTION1(function(){return r.SUBRULE(r.ArgumentsDefinition)}),r.CONSUME(u.On),r.SUBRULE(r.DirectiveLocations)}),r.DirectiveLocations=r.RULE(\"DirectiveLocations\",function(){r.OPTION(function(){return r.CONSUME(u.Pipe)}),r.SUBRULE(r.DirectiveLocation),r.MANY(function(){r.CONSUME1(u.Pipe),r.SUBRULE1(r.DirectiveLocation)})}),r.DirectiveLocation=r.RULE(\"DirectiveLocation\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.ExecutableDirectiveLocation)}},{ALT:function(){return r.SUBRULE(r.TypeSystemDirectiveLocation)}}])}),r.ExecutableDirectiveLocation=r.RULE(\"ExecutableDirectiveLocation\",function(){r.OR([{ALT:function(){return r.CONSUME(u.QUERY)}},{ALT:function(){return r.CONSUME(u.MUTATION)}},{ALT:function(){return r.CONSUME(u.SUBSCRIPTION)}},{ALT:function(){return r.CONSUME(u.FIELD)}},{ALT:function(){return r.CONSUME(u.FRAGMENT_DEFINITION)}},{ALT:function(){return r.CONSUME(u.FRAGMENT_SPREAD)}},{ALT:function(){return r.CONSUME(u.INLINE_FRAGMENT)}}])}),r.TypeSystemDirectiveLocation=r.RULE(\"TypeSystemDirectiveLocation\",function(){r.OR([{ALT:function(){return r.CONSUME(u.SCHEMA)}},{ALT:function(){return r.CONSUME(u.SCALAR)}},{ALT:function(){return r.CONSUME(u.OBJECT)}},{ALT:function(){return r.CONSUME(u.FIELD_DEFINITION)}},{ALT:function(){return r.CONSUME(u.ARGUMENT_DEFINITION)}},{ALT:function(){return r.CONSUME(u.INTERFACE)}},{ALT:function(){return r.CONSUME(u.UNION)}},{ALT:function(){return r.CONSUME(u.ENUM)}},{ALT:function(){return r.CONSUME(u.ENUM_VALUE)}},{ALT:function(){return r.CONSUME(u.INPUT_OBJECT)}},{ALT:function(){return r.CONSUME(u.INPUT_FIELD_DEFINITION)}}])}),r.lexer=new i.Lexer(n),r}return o(BaseGraphQlParser,t),BaseGraphQlParser}(i.Parser)},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return L});var r=n(1),i=n(12),o=n(57).stardogGraphQlTokenMap,a=o.ToArgumentToken,u=o.IfArgumentToken,s=o.AliasArgumentToken,c=o.GraphArgumentToken,l=o.BindDirectiveToken,E=o.ConfigDirectiveToken,p=[o.SkipDirectiveToken,o.IncludeDirectiveToken,o.FilterDirectiveToken],f=[l].concat(p);var L={getArgumentNodes:function(t){if(!t||!t.Arguments)return[];var e=t.Arguments[0];return Object(i.b)(e)&&e.children.Argument||[]},getArgumentTokenTypesForDirectiveNameToken:function(t){return Object(r.tokenMatcher)(t,l)?[a]:Object(r.tokenMatcher)(t,E)?[s,c]:p.some(function(e){return Object(r.tokenMatcher)(t,e)})?[u]:[]},isSparqlReceivingStardogDirective:function(t){return f.some(function(e){return Object(r.tokenMatcher)(t,e)})}}},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"sparqlTokens\",function(){return a}),n.d(e,\"keywords\",function(){return u}),n.d(e,\"terminals\",function(){return s});var r=n(21);n.d(e,\"BaseSparqlParser\",function(){return r.a});var i=n(53);n.d(e,\"W3SpecSparqlParser\",function(){return i.a});var o=n(36);n.d(e,\"StardogSparqlParser\",function(){return o.a});var a=n(9),u=n(0).keywords,s=n(5).terminals},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"graphQlTokenMap\",function(){return I}),n.d(e,\"graphQlTokens\",function(){return f}),n.d(e,\"stardogGraphQlTokenMap\",function(){return D}),n.d(e,\"stardogGraphQlTokens\",function(){return b});var r=n(1),i=n(2),o=n(3),a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=/\\-?(?:0|[1-9][0-9]*)/,s=/[eE][+-]?[0-9]+/,c=i.a.and(/\"/,i.a.many(i.a.or(/[\\u0009\\u0020\\u0021\\u0023-\\u005B\\u005D-\\uFFFF]/,/\\\\u[0-9A-Fa-f]{4}/,/\\\\[\"\\\\/bfnrt]/)),/\"/),l=/true|false/,E=/null/,p=/on/,f=[],L=function(t){var e=[T];return t.pattern!==l&&t.pattern!==E&&e.push(U),t.pattern!==p&&e.push(R),h({name:t.name,pattern:t.pattern,longer_alt:T,categories:e})},S=function(t){return h(a({},t,{categories:[O]}))},h=function(t){var e=Object(r.createToken)(t);return f.push(e),e},T=Object(r.createToken)({name:\"Name\",pattern:/[_A-Za-z][_0-9A-Za-z]*/}),U=Object(r.createToken)({name:\"EnumValueToken\",pattern:r.Lexer.NA}),R=Object(r.createToken)({name:\"FragmentName\",pattern:r.Lexer.NA}),d=Object(r.createToken)({name:\"StringValueToken\",pattern:r.Lexer.NA}),O=Object(r.createToken)({name:\"Punctuator\",pattern:r.Lexer.NA});T.CATEGORIES.push(U,R);var N={WhiteSpace:h({name:\"WhiteSpace\",pattern:/[ \\t]+/,group:r.Lexer.SKIPPED}),UnicodeBOM:h({name:\"UnicodeBOM\",pattern:\"\\\\uFFFE\",group:r.Lexer.SKIPPED}),LineTerminator:h({name:\"LineTerminator\",pattern:/\\n\\r|\\r|\\n/,group:r.Lexer.SKIPPED}),Comment:h({name:\"Comment\",pattern:/#[^\\n\\r]*/,group:r.Lexer.SKIPPED}),Comma:h({name:\"Comma\",pattern:\",\",group:r.Lexer.SKIPPED})},A={Bang:S({name:\"Bang\",pattern:\"!\"}),Dollar:S({name:\"Dollar\",pattern:\"$\"}),LParen:S({name:\"LParen\",pattern:\"(\"}),RParen:S({name:\"RParen\",pattern:\")\"}),Spread:S({name:\"Spread\",pattern:\"...\"}),Colon:S({name:\"Colon\",pattern:\":\"}),Equals:S({name:\"Equals\",pattern:\"=\"}),At:S({name:\"At\",pattern:\"@\"}),LBracket:S({name:\"LBracket\",pattern:\"[\"}),RBracket:S({name:\"RBracket\",pattern:\"]\"}),LCurly:S({name:\"LCurly\",pattern:\"{\"}),RCurly:S({name:\"RCurly\",pattern:\"}\"}),Pipe:S({name:\"Pipe\",pattern:\"|\"}),Amp:S({name:\"Amp\",pattern:\"&\"}),Punctuator:O},m={FloatValueToken:h({name:\"FloatValueToken\",pattern:i.a.and(u,i.a.or(i.a.and(/\\.[0-9]+/,i.a.option(s)),s))}),IntValueToken:h({name:\"IntValueToken\",pattern:u}),BlockStringToken:h({name:\"BlockStringToken\",pattern:o.STRING_LITERAL_LONG2,categories:[d]}),StringToken:h({name:\"StringToken\",pattern:c,categories:[d]}),BooleanValueToken:h({name:\"BooleanValueToken\",pattern:l,longer_alt:T}),NullValueToken:h({name:\"NullValueToken\",pattern:E,longer_alt:T}),EnumValueToken:U,FragmentName:R,Name:T,StringValueToken:d},C={Query:L({name:\"Query\",pattern:\"query\"}),Mutation:L({name:\"Mutation\",pattern:\"mutation\"}),Subscription:L({name:\"Subscription\",pattern:\"subscription\"}),Fragment:L({name:\"Fragment\",pattern:\"fragment\"}),On:L({name:\"On\",pattern:p}),Schema:L({name:\"Schema\",pattern:\"schema\"}),Extend:L({name:\"Extend\",pattern:\"extend\"}),Scalar:L({name:\"Scalar\",pattern:\"scalar\"}),TypeToken:L({name:\"TypeToken\",pattern:\"type\"}),Implements:L({name:\"Implements\",pattern:\"implements\"}),Interface:L({name:\"Interface\",pattern:\"interface\"}),Union:L({name:\"Union\",pattern:\"union\"}),Enum:L({name:\"Enum\",pattern:\"enum\"}),Input:L({name:\"Input\",pattern:\"input\"}),DirectiveToken:L({name:\"DirectiveToken\",pattern:\"directive\"}),QUERY:L({name:\"QUERY\",pattern:\"QUERY\"}),MUTATION:L({name:\"MUTATION\",pattern:\"MUTATION\"}),SUBSCRIPTION:L({name:\"SUBSCRIPTION\",pattern:\"SUBSCRIPTION\"}),FRAGMENT_DEFINITION:L({name:\"FRAGMENT_DEFINITION\",pattern:\"FRAGMENT_DEFINITION\"}),FRAGMENT_SPREAD:L({name:\"FRAGMENT_SPREAD\",pattern:\"FRAGMENT_SPREAD\"}),INLINE_FRAGMENT:L({name:\"INLINE_FRAGMENT\",pattern:\"INLINE_FRAGMENT\"}),SCHEMA:L({name:\"SCHEMA\",pattern:\"SCHEMA\"}),SCALAR:L({name:\"SCALAR\",pattern:\"SCALAR\"}),OBJECT:L({name:\"OBJECT\",pattern:\"OBJECT\"}),FIELD_DEFINITION:L({name:\"FIELD_DEFINITION\",pattern:\"FIELD_DEFINITION\"}),FIELD:L({name:\"FIELD\",pattern:\"FIELD\"}),ARGUMENT_DEFINITION:L({name:\"ARGUMENT_DEFINITION\",pattern:\"ARGUMENT_DEFINITION\"}),INTERFACE:L({name:\"INTERFACE\",pattern:\"INTERFACE\"}),UNION:L({name:\"UNION\",pattern:\"UNION\"}),ENUM_VALUE:L({name:\"ENUM_VALUE\",pattern:\"ENUM_VALUE\"}),ENUM:L({name:\"ENUM\",pattern:\"ENUM\"}),INPUT_OBJECT:L({name:\"INPUT_OBJECT\",pattern:\"INPUT_OBJECT\"}),INPUT_FIELD_DEFINITION:L({name:\"INPUT_FIELD_DEFINITION\",pattern:\"INPUT_FIELD_DEFINITION\"})},I=a({},N,A,m,C,{Name:T}),y=Object(r.createToken)({name:\"StardogDirective\",pattern:r.Lexer.NA}),_=Object(r.createToken)({name:\"SparqlReceivingStardogDirective\",pattern:r.Lexer.NA}),P=Object(r.createToken)({name:\"StardogArgument\",pattern:r.Lexer.NA}),v=Object(r.createToken)({name:\"TopLevel\",pattern:r.Lexer.NA}),M=[\"optional\",\"bind\",\"hide\",\"skip\",\"include\",\"filter\",\"prefix\",\"config\"].sort().reduce(function(t,e){var n,i=\"\"+e[0].toUpperCase()+e.slice(1)+\"DirectiveToken\",o=[T,U,R,y];[\"prefix\",\"config\"].includes(e)&&o.push(v),[\"bind\",\"skip\",\"include\",\"filter\"].includes(e)&&o.push(_);var u=Object(r.createToken)({name:i,pattern:e,categories:o,longer_alt:T});return a({},t,{tokenMap:a({},t.tokenMap,(n={},n[i]=u,n)),orderedTokens:t.orderedTokens.concat(u)})},{tokenMap:{},orderedTokens:[]}),g=[\"orderBy\",\"first\",\"to\",\"if\",\"alias\",\"graph\",\"offset\",\"limit\",\"iri\"].sort().reduce(function(t,e){var n,i=\"\"+e[0].toUpperCase()+e.slice(1)+\"ArgumentToken\",o=[T,U,R,P];[\"orderBy\",\"first\",\"limit\",\"offset\"].includes(e)&&o.push(v);var u=Object(r.createToken)({name:i,pattern:e,categories:o,longer_alt:T});return a({},t,{tokenMap:a({},t.tokenMap,(n={},n[i]=u,n)),orderedTokens:t.orderedTokens.concat(u)})},{tokenMap:{},orderedTokens:[]}),B=Object(r.createToken)({name:\"OrderByArgumentFieldPropertyToken\",pattern:\"field\",categories:[T,U,R],longer_alt:T}),k=Object(r.createToken)({name:\"OrderByArgumentDescPropertyToken\",pattern:\"desc\",categories:[T,U,R],longer_alt:T}),D=a({},I,M.tokenMap,g.tokenMap,{OrderByArgumentFieldPropertyToken:B,OrderByArgumentDescPropertyToken:k,StardogDirective:y,SparqlReceivingStardogDirective:_,StardogArgument:P,TopLevel:v}),b=f.concat(M.orderedTokens,g.orderedTokens,[B,k,y,_,P,v]),x=[R,U,T,d,O];f.push.apply(f,x),b.push.apply(b,x)},function(t,e,n){(function(t,n){var r=200,i=\"__lodash_hash_undefined__\",o=1,a=2,u=9007199254740991,s=\"[object Arguments]\",c=\"[object Array]\",l=\"[object AsyncFunction]\",E=\"[object Boolean]\",p=\"[object Date]\",f=\"[object Error]\",L=\"[object Function]\",S=\"[object GeneratorFunction]\",h=\"[object Map]\",T=\"[object Number]\",U=\"[object Null]\",R=\"[object Object]\",d=\"[object Proxy]\",O=\"[object RegExp]\",N=\"[object Set]\",A=\"[object String]\",m=\"[object Symbol]\",C=\"[object Undefined]\",I=\"[object ArrayBuffer]\",y=\"[object DataView]\",_=/^\\[object .+?Constructor\\]$/,P=/^(?:0|[1-9]\\d*)$/,v={};v[\"[object Float32Array]\"]=v[\"[object Float64Array]\"]=v[\"[object Int8Array]\"]=v[\"[object Int16Array]\"]=v[\"[object Int32Array]\"]=v[\"[object Uint8Array]\"]=v[\"[object Uint8ClampedArray]\"]=v[\"[object Uint16Array]\"]=v[\"[object Uint32Array]\"]=!0,v[s]=v[c]=v[I]=v[E]=v[y]=v[p]=v[f]=v[L]=v[h]=v[T]=v[R]=v[O]=v[N]=v[A]=v[\"[object WeakMap]\"]=!1;var M=\"object\"==typeof t&&t&&t.Object===Object&&t,g=\"object\"==typeof self&&self&&self.Object===Object&&self,B=M||g||Function(\"return this\")(),k=e&&!e.nodeType&&e,D=k&&\"object\"==typeof n&&n&&!n.nodeType&&n,b=D&&D.exports===k,x=b&&M.process,F=function(){try{return x&&x.binding&&x.binding(\"util\")}catch(t){}}(),G=F&&F.isTypedArray;function w(t,e){for(var n=-1,r=null==t?0:t.length;++n<r;)if(e(t[n],n,t))return!0;return!1}function j(t){var e=-1,n=Array(t.size);return t.forEach(function(t,r){n[++e]=[r,t]}),n}function V(t){var e=-1,n=Array(t.size);return t.forEach(function(t){n[++e]=t}),n}var H,W,Y,K=Array.prototype,X=Function.prototype,q=Object.prototype,z=B[\"__core-js_shared__\"],Q=X.toString,$=q.hasOwnProperty,Z=(H=/[^.]+$/.exec(z&&z.keys&&z.keys.IE_PROTO||\"\"))?\"Symbol(src)_1.\"+H:\"\",J=q.toString,tt=RegExp(\"^\"+Q.call($).replace(/[\\\\^$.*+?()[\\]{}|]/g,\"\\\\$&\").replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g,\"$1.*?\")+\"$\"),et=b?B.Buffer:void 0,nt=B.Symbol,rt=B.Uint8Array,it=q.propertyIsEnumerable,ot=K.splice,at=nt?nt.toStringTag:void 0,ut=Object.getOwnPropertySymbols,st=et?et.isBuffer:void 0,ct=(W=Object.keys,Y=Object,function(t){return W(Y(t))}),lt=Ft(B,\"DataView\"),Et=Ft(B,\"Map\"),pt=Ft(B,\"Promise\"),ft=Ft(B,\"Set\"),Lt=Ft(B,\"WeakMap\"),St=Ft(Object,\"create\"),ht=Vt(lt),Tt=Vt(Et),Ut=Vt(pt),Rt=Vt(ft),dt=Vt(Lt),Ot=nt?nt.prototype:void 0,Nt=Ot?Ot.valueOf:void 0;function At(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function mt(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function Ct(t){var e=-1,n=null==t?0:t.length;for(this.clear();++e<n;){var r=t[e];this.set(r[0],r[1])}}function It(t){var e=-1,n=null==t?0:t.length;for(this.__data__=new Ct;++e<n;)this.add(t[e])}function yt(t){var e=this.__data__=new mt(t);this.size=e.size}function _t(t,e){var n=Yt(t),r=!n&&Wt(t),i=!n&&!r&&Kt(t),o=!n&&!r&&!i&&$t(t),a=n||r||i||o,u=a?function(t,e){for(var n=-1,r=Array(t);++n<t;)r[n]=e(n);return r}(t.length,String):[],s=u.length;for(var c in t)!e&&!$.call(t,c)||a&&(\"length\"==c||i&&(\"offset\"==c||\"parent\"==c)||o&&(\"buffer\"==c||\"byteLength\"==c||\"byteOffset\"==c)||jt(c,s))||u.push(c);return u}function Pt(t,e){for(var n=t.length;n--;)if(Ht(t[n][0],e))return n;return-1}function vt(t){return null==t?void 0===t?C:U:at&&at in Object(t)?function(t){var e=$.call(t,at),n=t[at];try{t[at]=void 0;var r=!0}catch(t){}var i=J.call(t);r&&(e?t[at]=n:delete t[at]);return i}(t):function(t){return J.call(t)}(t)}function Mt(t){return Qt(t)&&vt(t)==s}function gt(t,e,n,r,i){return t===e||(null==t||null==e||!Qt(t)&&!Qt(e)?t!=t&&e!=e:function(t,e,n,r,i,u){var l=Yt(t),L=Yt(e),S=l?c:wt(t),U=L?c:wt(e),d=(S=S==s?R:S)==R,C=(U=U==s?R:U)==R,_=S==U;if(_&&Kt(t)){if(!Kt(e))return!1;l=!0,d=!1}if(_&&!d)return u||(u=new yt),l||$t(t)?Dt(t,e,n,r,i,u):function(t,e,n,r,i,u,s){switch(n){case y:if(t.byteLength!=e.byteLength||t.byteOffset!=e.byteOffset)return!1;t=t.buffer,e=e.buffer;case I:return!(t.byteLength!=e.byteLength||!u(new rt(t),new rt(e)));case E:case p:case T:return Ht(+t,+e);case f:return t.name==e.name&&t.message==e.message;case O:case A:return t==e+\"\";case h:var c=j;case N:var l=r&o;if(c||(c=V),t.size!=e.size&&!l)return!1;var L=s.get(t);if(L)return L==e;r|=a,s.set(t,e);var S=Dt(c(t),c(e),r,i,u,s);return s.delete(t),S;case m:if(Nt)return Nt.call(t)==Nt.call(e)}return!1}(t,e,S,n,r,i,u);if(!(n&o)){var P=d&&$.call(t,\"__wrapped__\"),v=C&&$.call(e,\"__wrapped__\");if(P||v){var M=P?t.value():t,g=v?e.value():e;return u||(u=new yt),i(M,g,n,r,u)}}if(!_)return!1;return u||(u=new yt),function(t,e,n,r,i,a){var u=n&o,s=bt(t),c=s.length,l=bt(e).length;if(c!=l&&!u)return!1;for(var E=c;E--;){var p=s[E];if(!(u?p in e:$.call(e,p)))return!1}var f=a.get(t);if(f&&a.get(e))return f==e;var L=!0;a.set(t,e),a.set(e,t);for(var S=u;++E<c;){p=s[E];var h=t[p],T=e[p];if(r)var U=u?r(T,h,p,e,t,a):r(h,T,p,t,e,a);if(!(void 0===U?h===T||i(h,T,n,r,a):U)){L=!1;break}S||(S=\"constructor\"==p)}if(L&&!S){var R=t.constructor,d=e.constructor;R!=d&&\"constructor\"in t&&\"constructor\"in e&&!(\"function\"==typeof R&&R instanceof R&&\"function\"==typeof d&&d instanceof d)&&(L=!1)}return a.delete(t),a.delete(e),L}(t,e,n,r,i,u)}(t,e,n,r,gt,i))}function Bt(t){return!(!zt(t)||(e=t,Z&&Z in e))&&(Xt(t)?tt:_).test(Vt(t));var e}function kt(t){if(n=(e=t)&&e.constructor,r=\"function\"==typeof n&&n.prototype||q,e!==r)return ct(t);var e,n,r,i=[];for(var o in Object(t))$.call(t,o)&&\"constructor\"!=o&&i.push(o);return i}function Dt(t,e,n,r,i,u){var s=n&o,c=t.length,l=e.length;if(c!=l&&!(s&&l>c))return!1;var E=u.get(t);if(E&&u.get(e))return E==e;var p=-1,f=!0,L=n&a?new It:void 0;for(u.set(t,e),u.set(e,t);++p<c;){var S=t[p],h=e[p];if(r)var T=s?r(h,S,p,e,t,u):r(S,h,p,t,e,u);if(void 0!==T){if(T)continue;f=!1;break}if(L){if(!w(e,function(t,e){if(o=e,!L.has(o)&&(S===t||i(S,t,n,r,u)))return L.push(e);var o})){f=!1;break}}else if(S!==h&&!i(S,h,n,r,u)){f=!1;break}}return u.delete(t),u.delete(e),f}function bt(t){return function(t,e,n){var r=e(t);return Yt(t)?r:function(t,e){for(var n=-1,r=e.length,i=t.length;++n<r;)t[i+n]=e[n];return t}(r,n(t))}(t,Zt,Gt)}function xt(t,e){var n,r,i=t.__data__;return(\"string\"==(r=typeof(n=e))||\"number\"==r||\"symbol\"==r||\"boolean\"==r?\"__proto__\"!==n:null===n)?i[\"string\"==typeof e?\"string\":\"hash\"]:i.map}function Ft(t,e){var n=function(t,e){return null==t?void 0:t[e]}(t,e);return Bt(n)?n:void 0}At.prototype.clear=function(){this.__data__=St?St(null):{},this.size=0},At.prototype.delete=function(t){var e=this.has(t)&&delete this.__data__[t];return this.size-=e?1:0,e},At.prototype.get=function(t){var e=this.__data__;if(St){var n=e[t];return n===i?void 0:n}return $.call(e,t)?e[t]:void 0},At.prototype.has=function(t){var e=this.__data__;return St?void 0!==e[t]:$.call(e,t)},At.prototype.set=function(t,e){var n=this.__data__;return this.size+=this.has(t)?0:1,n[t]=St&&void 0===e?i:e,this},mt.prototype.clear=function(){this.__data__=[],this.size=0},mt.prototype.delete=function(t){var e=this.__data__,n=Pt(e,t);return!(n<0||(n==e.length-1?e.pop():ot.call(e,n,1),--this.size,0))},mt.prototype.get=function(t){var e=this.__data__,n=Pt(e,t);return n<0?void 0:e[n][1]},mt.prototype.has=function(t){return Pt(this.__data__,t)>-1},mt.prototype.set=function(t,e){var n=this.__data__,r=Pt(n,t);return r<0?(++this.size,n.push([t,e])):n[r][1]=e,this},Ct.prototype.clear=function(){this.size=0,this.__data__={hash:new At,map:new(Et||mt),string:new At}},Ct.prototype.delete=function(t){var e=xt(this,t).delete(t);return this.size-=e?1:0,e},Ct.prototype.get=function(t){return xt(this,t).get(t)},Ct.prototype.has=function(t){return xt(this,t).has(t)},Ct.prototype.set=function(t,e){var n=xt(this,t),r=n.size;return n.set(t,e),this.size+=n.size==r?0:1,this},It.prototype.add=It.prototype.push=function(t){return this.__data__.set(t,i),this},It.prototype.has=function(t){return this.__data__.has(t)},yt.prototype.clear=function(){this.__data__=new mt,this.size=0},yt.prototype.delete=function(t){var e=this.__data__,n=e.delete(t);return this.size=e.size,n},yt.prototype.get=function(t){return this.__data__.get(t)},yt.prototype.has=function(t){return this.__data__.has(t)},yt.prototype.set=function(t,e){var n=this.__data__;if(n instanceof mt){var i=n.__data__;if(!Et||i.length<r-1)return i.push([t,e]),this.size=++n.size,this;n=this.__data__=new Ct(i)}return n.set(t,e),this.size=n.size,this};var Gt=ut?function(t){return null==t?[]:(t=Object(t),function(t,e){for(var n=-1,r=null==t?0:t.length,i=0,o=[];++n<r;){var a=t[n];e(a,n,t)&&(o[i++]=a)}return o}(ut(t),function(e){return it.call(t,e)}))}:function(){return[]},wt=vt;function jt(t,e){return!!(e=null==e?u:e)&&(\"number\"==typeof t||P.test(t))&&t>-1&&t%1==0&&t<e}function Vt(t){if(null!=t){try{return Q.call(t)}catch(t){}try{return t+\"\"}catch(t){}}return\"\"}function Ht(t,e){return t===e||t!=t&&e!=e}(lt&&wt(new lt(new ArrayBuffer(1)))!=y||Et&&wt(new Et)!=h||pt&&\"[object Promise]\"!=wt(pt.resolve())||ft&&wt(new ft)!=N||Lt&&\"[object WeakMap]\"!=wt(new Lt))&&(wt=function(t){var e=vt(t),n=e==R?t.constructor:void 0,r=n?Vt(n):\"\";if(r)switch(r){case ht:return y;case Tt:return h;case Ut:return\"[object Promise]\";case Rt:return N;case dt:return\"[object WeakMap]\"}return e});var Wt=Mt(function(){return arguments}())?Mt:function(t){return Qt(t)&&$.call(t,\"callee\")&&!it.call(t,\"callee\")},Yt=Array.isArray;var Kt=st||function(){return!1};function Xt(t){if(!zt(t))return!1;var e=vt(t);return e==L||e==S||e==l||e==d}function qt(t){return\"number\"==typeof t&&t>-1&&t%1==0&&t<=u}function zt(t){var e=typeof t;return null!=t&&(\"object\"==e||\"function\"==e)}function Qt(t){return null!=t&&\"object\"==typeof t}var $t=G?function(t){return function(e){return t(e)}}(G):function(t){return Qt(t)&&qt(t.length)&&!!v[vt(t)]};function Zt(t){return null!=(e=t)&&qt(e.length)&&!Xt(e)?_t(t):kt(t);var e}n.exports=function(t,e){return gt(t,e)}}).call(this,n(70),n(71)(t))},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"multiModeLexerDefinition\",function(){return U}),n.d(e,\"srsTokenMap\",function(){return R}),n.d(e,\"srsTokenTypes\",function(){return d});var r,i,o=n(1),a=n(3),u=n(27),s=u.turtleTokenTypes,c=u.turtleTokenMap,l=n(9).sparqlTokenMap;!function(t){t.TURTLE=\"turtle\",t.IFCLAUSE=\"ifclause\",t.THENCLAUSE=\"thenclause\"}(i||(i={}));var E=Object(o.createToken)({name:\"Rule\",pattern:/rule/i}),p=Object(o.createToken)({name:\"If\",pattern:/if/i,push_mode:i.IFCLAUSE}),f=Object(o.createToken)({name:\"Then\",pattern:/then/i,push_mode:i.THENCLAUSE}),L=Object(o.createToken)({name:\"EndThen\",pattern:\"}\",pop_mode:!0}),S=Object(o.createToken)({name:\"GroupGraphPattern\",pattern:function(t,e){if(void 0===e&&(e=0),\"{\"!==t[e])return null;var n,r=1;for(n=e+1;n<t.length&&r>0;n++)\"{\"===t[n]?r++:\"}\"===t[n]&&r--;return r>0?null:a.CATCH_ALL_AT_LEAST_ONE.exec(t.slice(e,n))},line_breaks:!0,pop_mode:!0}),h=Object(o.createToken)({name:\"TriplesBlock\",pattern:/[^{}]+/,line_breaks:!0}),T=s.indexOf(c.IRIREF),U={modes:(r={},r[i.TURTLE]=s.slice(0,T+1).concat([E,p,f],s.slice(T+1)),r[i.IFCLAUSE]=[c.WhiteSpace,S],r[i.THENCLAUSE]=[c.WhiteSpace,l.LCurly,L,h],r),defaultMode:i.TURTLE},R={Rule:E,If:p,Then:f,EndThen:L,GroupGraphPattern:S,TriplesBlock:h},d=[E,p,f,L,l.LCurly].concat(s,[S,h])},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return TrigParser});var r,i=n(1),o=n(35),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=n(61),s=u.trigTokenMap,c=u.trigTokenTypes,TrigParser=function(t){function TrigParser(e,n,r,o){void 0===n&&(n=c),void 0===r&&(r=c),void 0===o&&(o=!0);var a=t.call(this,e,n,r,!1)||this;return a.parse=function(t,e){void 0===e&&(e=\"standard\"),a.input=a.lexer.tokenize(t).tokens;var n=a.trigDoc(0,[e]),r=a.errors.slice(),i=a.semanticErrors.slice();return a.resetManagedState(),{errors:r,semanticErrors:i,cst:n}},a.trigDoc=a.RULE(\"trigDoc\",function(t){var e=\"stardog\"===t;a.MANY(function(){a.OR([{ALT:function(){return a.SUBRULE(a.directive)}},{ALT:function(){return a.SUBRULE(a.block,{ARGS:[e]})}}])})}),a.block=a.RULE(\"block\",function(t){a.OR([{ALT:function(){return a.SUBRULE(a.triplesOrGraph,{ARGS:[t]})}},{ALT:function(){return a.SUBRULE(a.wrappedGraph,{ARGS:[t]})}},{ALT:function(){return a.SUBRULE(a.triples2)}},{ALT:function(){a.CONSUME(s.GRAPH),a.SUBRULE(a.labelOrSubject),a.SUBRULE1(a.wrappedGraph,{ARGS:[t]})}}])}),a.triplesOrGraph=a.RULE(\"triplesOrGraph\",function(t){var e=!1;a.OR([{ALT:function(){return a.SUBRULE(a.labelOrSubject)}},{GATE:function(){return Boolean(t)},ALT:function(){var t=a.SUBRULE(a.EmbeddedTriplePattern);e=\"EmbeddedTriplePattern\"===t.name}}]),a.OR1([{GATE:function(){return!e},ALT:function(){return a.SUBRULE(a.wrappedGraph,{ARGS:[t]})}},{ALT:function(){a.SUBRULE(a.predicateObjectList),a.CONSUME(s.Period)}}])}),a.triples2=a.RULE(\"triples2\",function(){a.OR([{ALT:function(){a.SUBRULE(a.blankNodePropertyList),a.OPTION(function(){return a.SUBRULE(a.predicateObjectList)}),a.CONSUME(s.Period)}},{ALT:function(){a.SUBRULE(a.collection),a.SUBRULE1(a.predicateObjectList),a.CONSUME1(s.Period)}}])}),a.wrappedGraph=a.RULE(\"wrappedGraph\",function(t){a.CONSUME(s.LCurly),a.OPTION(function(){return a.SUBRULE(a.triplesBlock,{ARGS:[t]})}),a.CONSUME(s.RCurly)}),a.triplesBlock=a.RULE(\"triplesBlock\",function(t){a.SUBRULE(a.triples,{ARGS:[t]}),a.OPTION(function(){a.CONSUME(s.Period),a.OPTION1(function(){return a.SUBRULE(a.triplesBlock,{ARGS:[t]})})})}),a.labelOrSubject=a.RULE(\"labelOrSubject\",function(){a.OR([{ALT:function(){return a.SUBRULE(a.iri)}},{ALT:function(){return a.SUBRULE(a.BlankNode)}}])}),o&&i.Parser.performSelfAnalysis(a),a}return a(TrigParser,t),TrigParser}(o.a)},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"trigTokenMap\",function(){return u}),n.d(e,\"trigTokenTypes\",function(){return c});var r=n(27),i=n(9),o=function(){return(o=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},a=n(27).turtleTokenTypes,u=o({GRAPH:i.sparqlTokenMap.GRAPH},r.turtleTokenMap),s=a.indexOf(r.turtleTokenMap.PN_CHARS_BASE),c=a.slice(0,s).concat([i.sparqlTokenMap.GRAPH],a.slice(s))},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return SmsParser});var r,i=n(1),o=n(56),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=function(){return(u=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},s=n(63),c=s.smsTokenTypes,l=s.smsTokenMap,SmsParser=function(t){function SmsParser(e){var n=t.call(this,u({outputCst:!0,recoveryEnabled:!0},e),c,!0)||this;return n.parse=function(t){n.input=n.tokenize(t);var e=n.MappingDoc();return{errors:n.errors,cst:e}},n.MappingDoc=n.RULE(\"MappingDoc\",function(){n.MANY(function(){return n.SUBRULE(n.PrefixDecl)}),n.OPTION(function(){n.SUBRULE(n.MappingClause),n.MANY1(function(){n.CONSUME(l.Semicolon),n.SUBRULE1(n.MappingClause)})})}),n.MappingClause=n.RULE(\"MappingClause\",function(){n.SUBRULE(n.MappingDecl),n.SUBRULE(n.FromClause),n.SUBRULE(n.ToClause),n.SUBRULE(n.WhereClause)}),n.MappingDecl=n.RULE(\"MappingDecl\",function(){n.CONSUME(l.Mapping),n.OPTION(function(){return n.SUBRULE(n.iri)})}),n.FromClause=n.RULE(\"FromClause\",function(){n.CONSUME(l.FROM),n.OR([{ALT:function(){return n.SUBRULE(n.SqlClause)}},{ALT:function(){return n.SUBRULE(n.JsonClause)}},{ALT:function(){return n.SUBRULE(n.GraphQlClause)}},{ALT:function(){return n.SUBRULE(n.CsvClause)}}])}),n.JsonClause=n.RULE(\"JsonClause\",function(){n.CONSUME(l.Json),n.CONSUME(l.JsonBlock)}),n.GraphQlClause=n.RULE(\"GraphQlClause\",function(){n.CONSUME(l.GraphQl),n.CONSUME(l.LCurly),n.CONSUME(l.GraphQlBlock),n.CONSUME(l.RCurly)}),n.SqlClause=n.RULE(\"SqlClause\",function(){n.CONSUME(l.Sql),n.CONSUME(l.LCurly),n.CONSUME(l.SqlBlock),n.CONSUME(l.RCurly)}),n.CsvClause=n.RULE(\"CsvClause\",function(){n.CONSUME(l.Csv),n.OPTION(function(){n.CONSUME(l.LCurly),n.CONSUME(l.RCurly)})}),n.ToClause=n.RULE(\"ToClause\",function(){n.CONSUME(l.TO),n.SUBRULE(n.ConstructTemplate)}),n.WhereClause=n.OVERRIDE_RULE(\"WhereClause\",function(){n.CONSUME(l.WHERE),n.CONSUME(l.LCurly),n.MANY(function(){return n.SUBRULE(n.Bind)}),n.CONSUME(l.RCurly)}),n.Bind=n.OVERRIDE_RULE(\"Bind\",function(){n.CONSUME(l.BIND),n.CONSUME(l.LParen),n.SUBRULE(n.BindExpression),n.CONSUME(l.AS),n.SUBRULE(n.Var),n.CONSUME(l.RParen)}),n.BindExpression=n.RULE(\"BindExpression\",function(){n.OR([{ALT:function(){return n.SUBRULE(n.TemplateFunc)}},{ALT:function(){return n.SUBRULE(n.Expression)}}])}),n.TemplateFunc=n.RULE(\"TemplateFunc\",function(){n.CONSUME(l.Template),n.CONSUME(l.LParen),n.SUBRULE(n.String),n.CONSUME(l.RParen)}),n.Object=n.OVERRIDE_RULE(\"Object\",function(){n.SUBRULE(n.GraphNode)}),i.Parser.performSelfAnalysis(n),n}return a(SmsParser,t),SmsParser}(o.StardogSparqlParser)},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"smsTokenMap\",function(){return p}),n.d(e,\"smsTokenTypes\",function(){return f});var r=n(1),i=n(0),o=function(){return(o=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},a=n(9),u=a.sparqlTokenMap,s=a.stardogSparqlTokens,c=/^\\s*to\\s*{/i,l=/((?:.|\\s)*?)to\\s*{/i,E=function(t,e,n){for(var r=0;r<t.length;r++)if(t[r]!==e);else{var i=t.slice(r+1);if(n.exec(i))return[t.slice(0,r)]}return null},p=o({},u,{Template:Object(i.createKeyword)({name:\"Template\"}),Sql:Object(i.createKeyword)({name:\"Sql\"}),GraphQl:Object(i.createKeyword)({name:\"GraphQl\"}),Json:Object(i.createKeyword)({name:\"Json\"}),Csv:Object(i.createKeyword)({name:\"Csv\"}),Mapping:Object(i.createKeyword)({name:\"Mapping\"}),SqlBlock:Object(r.createToken)({name:\"SqlBlock\",pattern:function(t,e,n){void 0===e&&(e=0);var r=n.slice(-2),i=r[0],o=r[1];if(!i||!o||i.tokenType.tokenName!==p.Sql.tokenName||o.tokenType.tokenName!==p.LCurly.tokenName)return null;var a=t.slice(e);return E(a,\"}\",c)},line_breaks:!0}),JsonBlock:Object(r.createToken)({name:\"JsonBlock\",pattern:function(t,e,n){void 0===e&&(e=0);var r=n.slice(-1)[0];if(!r||r.tokenType.tokenName!==p.Json.tokenName)return null;var i=t.slice(e),o=l.exec(i);return o?o.slice(1):null},line_breaks:!0}),GraphQlBlock:Object(r.createToken)({name:\"GraphQlBlock\",pattern:function(t,e,n){void 0===e&&(e=0);var r=n.slice(-2),i=r[0],o=r[1];if(!i||!o||i.tokenType.tokenName!==p.GraphQl.tokenName||o.tokenType.tokenName!==p.LCurly.tokenName)return null;var a=t.slice(e);return E(a,\"}\",c)},line_breaks:!0})}),f=[p.Template,p.Sql,p.GraphQl,p.Json,p.Csv,p.Mapping,p.SqlBlock,p.JsonBlock,p.GraphQlBlock].concat(s)},function(t,e,n){\"use strict\";n.d(e,\"a\",function(){return StandardGraphQlParser});var r,i=n(54),o=n(1),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=n(57).graphQlTokens,StandardGraphQlParser=function(t){function StandardGraphQlParser(e){var n=t.call(this,e,u)||this;return o.Parser.performSelfAnalysis(n),n}return a(StandardGraphQlParser,t),StandardGraphQlParser}(i.a)},function(t,e,n){\"use strict\";var r,i=n(1),TurtleParser=n(35),o=n(12),a=function(){return(a=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},u=Object.freeze([\"\",\"rdf\",\"rdfs\",\"xsd\",\"owl\",\"stardog\"].reduce(function(t,e){var n;return a({},t,((n={})[e]=!0,n))},{})),s=n(56),c=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),l=function(t){return new(function(t){function e(){var e=t.call(this)||this;return e.groupGraphPatterns=[],e.triplesBlocks=[],e.IfClause=function(t,n){var r=t.GroupGraphPattern;e.$storePlaceholderTokenReplacement({tokenStore:e.groupGraphPatterns,originalTokenContext:r,subParserRule:e.sparqlParser.parseGroupGraphPattern.bind(e.sparqlParser),cstInputTokens:n})},e.ThenClause=function(t,n){var r=t.TriplesBlock;e.$storePlaceholderTokenReplacement({tokenStore:e.triplesBlocks,originalTokenContext:r,subParserRule:e.sparqlParser.parseTriplesBlock.bind(e.sparqlParser),cstInputTokens:n})},e.$storePlaceholderTokenReplacement=function(t){var n=t.tokenStore,r=t.originalTokenContext,i=void 0===r?[]:r,o=t.subParserRule,a=t.cstInputTokens,u=t.stripWrappers,s=i[0];if(s&&\"string\"==typeof s.image){var c=e.$getPlaceholderTokenReplacement(s,o,a,u);n.push({parseResult:c,originalToken:s})}},e.$getPlaceholderTokenReplacement=function(t,e,n,r){void 0===r&&(r=!1);for(var i=t.image,o=\"\",a=0,u=0,s=0;s<n.length;s++){var c=n[s];if(s>0){var l=c.startLine-u,E=c.startOffset-1-a-l;l>0?(o+=\"\\n\".repeat(l-1),o+=\" \".repeat(Math.max(E,0))+\"\\n\"):o+=\" \".repeat(Math.max(E,0))}if(c===t)break;c.image.split(\"\\n\").forEach(function(t,e){e>0&&(o+=\"\\n\"),o+=\" \".repeat(t.length)}),a=c.endOffset,u=c.endLine}var p=r?\" \"+i.slice(1,-1)+\" \":i;return e(\"\"+o+p)},e.$getGroupGraphPatterns=function(){return e.groupGraphPatterns},e.$getTriplesBlocks=function(){return e.triplesBlocks},e.$resetState=function(){e.groupGraphPatterns=[],e.triplesBlocks=[]},e.sparqlParser=new s.StardogSparqlParser,e.validateVisitor(),e}return c(e,t),e}(t))};function E(t,e){return t.concat(e.parseResult.errors)}function p(t,e,n,r){var i=n.find(function(e){return e.originalToken===t});return i&&(e.children[r]=[i.parseResult.cst]),i}var f,L=n(9),S=/(?:[A-Z]+Expression|ValueLogical)$/i,h=function(){return!1},T=((f={})[L.sparqlTokenMap.EXISTS.tokenName]=\"ExistsFunction\",f[L.sparqlTokenMap.NOT_EXISTS.tokenName]=\"NotExistsFunction\",f[L.sparqlTokenMap.NOW.tokenName]=\"BuiltInCall_NOW\",f[L.sparqlTokenMap.LEmbed.tokenName]=\"LeftEmbed\",f[L.sparqlTokenMap.REmbed.tokenName]=\"RightEmbed\",f),U=Object.keys(T),R=[L.sparqlTokenMap.DOUBLE,L.sparqlTokenMap.DECIMAL,L.sparqlTokenMap.INTEGER,L.sparqlTokenMap.DOUBLE_POSITIVE,L.sparqlTokenMap.DECIMAL_POSITIVE,L.sparqlTokenMap.INTEGER_POSITIVE,L.sparqlTokenMap.DOUBLE_NEGATIVE,L.sparqlTokenMap.DECIMAL_NEGATIVE,L.sparqlTokenMap.INTEGER_NEGATIVE,L.sparqlTokenMap.STRING_LITERAL1,L.sparqlTokenMap.STRING_LITERAL2,L.sparqlTokenMap.STRING_LITERAL_LONG1,L.sparqlTokenMap.STRING_LITERAL_LONG2].map(function(t){return t.tokenName}),d=function(t){return Boolean(t&&t.node)};function O(t,e,n,r,i){if(void 0===i&&(i=h),!t)return[];for(var a=[],u=t;Object(o.b)(u.node)&&!n.includes(u.node.name);){if(i(u))return[];u=u.parentCtx}for(;Object(o.b)(u.node);){if(a.unshift(u.node.name),i(u))return[];u=u.parentCtx}for(\"string\"==typeof r&&a.unshift(r),u=e;u;){if(Object(o.b)(u.node)&&(a.unshift(u.node.name),i(u)))return[];u=u.parentCtx}return[\"SrsDoc\"].concat(a)}var N=function(t){return{name:t.name,message:t.message,token:t.node,context:{ruleStack:t.ruleStack,ruleOccurrenceStack:[]},resyncedTokens:[]}},A=function(t,e,n,r){return N({name:\"NoNamespacePrefixError\",message:'A prefix (\"'+t.image+'\") was used for which there was no namespace defined.',node:t,ruleStack:O(e,n,[\"PrefixedName\"],r)})},m=function(t,e,n,r){return void 0===r&&(r=\"GroupGraphPattern\"),N({name:\"DisallowedTokenError\",message:\"Token \"+t.tokenType.tokenName+\" cannot be used in Stardog Rules.\",node:t,ruleStack:O(e,n,[T[t.tokenType.tokenName]],r)})},C=function(t,e,n,r){var i=null,o=!1,a=null,u=O(e,n,[\"Expression\",\"TriplesSameSubjectPath\"],r,function(t){var e=t.node,n=t.parentCtx,r=e.name;if(\"PropertyListPathNotEmpty\"===r)return i=t,!1;if(!o&&S.test(r))return o=n.node.children[r].length>1,!1;var u=\"Expression\"===r,s=\"TriplesSameSubjectPath\"===r;if(!u&&!s)return!1;var c=u&&!o&&function(t){if(!d(t))return!1;var e=t.node.name;return\"Bind\"===e||\"ExpressionOrEmbeddedTriplePattern\"===e&&d(t.parentCtx)&&\"Bind\"===t.parentCtx.node.name}(n),l=s&&(!i||\"TriplesSameSubjectPath\"!==i.parentCtx.node.name);return!c&&!l||(a=c?\"Bind\":\"TriplesBlock\",!1)});if(0!==u.length)return N({name:\"DisallowedLiteralError\",message:\"Token \"+t.tokenType.tokenName+\" (\"+t.image+\") cannot be used as a subject inside of a \"+a+\" in Stardog Rules Syntax.\",node:t,ruleStack:u})};n.d(e,\"a\",function(){return B});var I=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(e,n)};return function(e,n){function r(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(r.prototype=n.prototype,new r)}}(),y=function(){return(y=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},_=n(9).sparqlTokenMap,P=n(59),v=P.srsTokenMap,M=P.srsTokenTypes,g=P.multiModeLexerDefinition,B=function(t){function SrsParser(e){var n=t.call(this,y({outputCst:!0,recoveryEnabled:!0},e),M,g,!1)||this;return n.baseNamespacesMap=Object.freeze(y({},u)),n.namespacesMap={},n.visitCst=function(t){if(n.sparqlSrsVisitor)n.sparqlSrsVisitor.$resetState();else{var e=n.getBaseCstVisitorConstructorWithDefaults();n.sparqlSrsVisitor=l(e)}n.sparqlSrsVisitor.visit(t,n.input)},n.getSparqlRulesFromVisitor=function(t){return n.visitCst(t),{groupGraphPatterns:n.sparqlSrsVisitor.$getGroupGraphPatterns(),triplesBlocks:n.sparqlSrsVisitor.$getTriplesBlocks()}},n.resetManagedState=function(){n.namespacesMap=y({},u),n.semanticErrors=[]},n.setBaseNamespaces=function(t){n.baseNamespacesMap=y({},t)},n.tokenize=function(t){return n.lexer.tokenize(t).tokens},n.parse=function(t,e){void 0===e&&(e=\"standard\"),n.resetManagedState(),n.input=n.lexer.tokenize(t).tokens;var r=n.SrsDoc(0,[e]),i=n.getSparqlRulesFromVisitor(r),a=i.groupGraphPatterns,u=i.triplesBlocks,s=n.errors.concat(a.reduce(E,[]),u.reduce(E,[])),c=n.semanticErrors.slice();return Object(o.e)(r,function(t,e){var r=t.node,i=t.parentCtx;if(Object(o.b)(r))return e();var l=r.tokenType.tokenName;if(\"GroupGraphPattern\"===l||\"TriplesBlock\"===l){var E=i.node;if(\"IfClause\"===E.name)(f=p(r,E,a,\"GroupGraphPattern\"))&&function(t){var e=t.cst,n=t.namespacesMap,r=t.fullCtx,i=t.errors,a=t.semanticErrors;Object(o.d)(e,function(t,e){var u=t.node,s=t.parentCtx;if(Object(o.b)(u))return e();var c=u.tokenType.tokenName;if(U.some(function(t){return t===c})&&i.push(m(u,s,r)),R.some(function(t){return t===u.tokenType.tokenName})){var l=C(u,s,r,\"GroupGraphPattern\");l&&i.push(l)}if(\"PNAME_NS\"===c||\"PNAME_LN\"===c){var E=u.image.split(\":\").shift();n[E]||a.push(A(u,s,r,\"GroupGraphPattern\"))}})}({fullCtx:t,namespacesMap:y({},n.baseNamespacesMap,n.namespacesMap),cst:f.parseResult.cst,errors:s,semanticErrors:c});else if(\"ThenClause\"===E.name){var f;(f=p(r,E,u,\"TriplesBlock\"))&&function(t){var e=t.cst,n=t.namespacesMap,r=t.errors,i=t.semanticErrors,a=t.fullCtx;Object(o.d)(e,function(t,e){var u=t.node,s=t.parentCtx;if(Object(o.b)(u))return e();var c=u.tokenType.tokenName;if(R.some(function(t){return t===u.tokenType.tokenName})){var l=C(u,s,a,\"GroupGraphPattern\");l&&r.push(l)}if(c!==L.sparqlTokenMap.LEmbed.name&&c!==L.sparqlTokenMap.REmbed.name||r.push(m(u,s,a,\"TriplesBlock\")),\"PNAME_NS\"===c||\"PNAME_LN\"===c){var E=u.image.split(\":\").shift();n[E]||i.push(A(u,s,a,\"TriplesBlock\"))}})}({fullCtx:t,namespacesMap:y({},n.baseNamespacesMap,n.namespacesMap),cst:f.parseResult.cst,errors:s,semanticErrors:c})}}}),{semanticErrors:c,errors:s,cst:r}},n.SrsDoc=n.RULE(\"SrsDoc\",function(t){var e=\"stardog\"===t;n.SUBRULE(n.turtleDoc,{ARGS:[t]}),n.MANY(function(){n.SUBRULE(n.RuleDoc),n.MANY1(function(){n.SUBRULE(n.triples,{ARGS:[e]}),n.CONSUME(_.Period)})})}),n.RuleDoc=n.RULE(\"RuleDoc\",function(){n.OPTION(function(){return n.SUBRULE(n.RuleClause)}),n.SUBRULE(n.IfClause),n.SUBRULE(n.ThenClause)}),n.RuleClause=n.RULE(\"RuleClause\",function(){n.CONSUME(v.Rule),n.SUBRULE(n.iri)}),n.IfClause=n.RULE(\"IfClause\",function(){n.CONSUME(v.If),n.CONSUME(v.GroupGraphPattern)}),n.ThenClause=n.RULE(\"ThenClause\",function(){n.CONSUME(v.Then),n.CONSUME(_.LCurly),n.CONSUME(v.TriplesBlock),n.CONSUME(v.EndThen)}),n.lexer=new i.Lexer(g),i.Parser.performSelfAnalysis(n),n}return I(SrsParser,t),SrsParser}(TurtleParser.a)},function(t,e,n){\"use strict\";var r,TurtleParser=n(35),i=n(1),o=n(69),a=n.n(o),u=n(12),s=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),c=function(t){return new RegExp(\"(?:shacl#|\"+a()(t)+\":)(\\\\S+?)>?$\")},l=function(t){for(var e=t;e.children;){var n=Object.keys(e.children)[0];e=e.children[n][0]}return e},E=function(t,e){var n=e.exec(t);if(n)return n[1]},p=function(t,e){e.forEach(function(e){var n=e.children[Object.keys(e.children)[0]][0];switch(n.name){case\"shaclVerbShape\":var r=l(n).image.toLowerCase();if(!(\"a\"===r||\"rdf:type\"===r||\"<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>\"===r))return;Object.keys(n.children).forEach(function(e){if(\"shaclShapeType\"===e){var r=n.children[e][0];r.children.SHACL_NodeShape?t.types.push({type:\"NodeShape\",token:l(r)}):r.children.SHACL_PropertyShape&&t.types.push({type:\"PropertyShape\",token:l(r)})}});break;case\"shaclPredicateIRI\":n.children.SingleIriTakingPredicate?t.predicates.push({type:\"SingleIriTakingPredicate\",token:l(n.children.SingleIriTakingPredicate[0])}):n.children.ManyIriTakingPredicate&&t.predicates.push({type:\"ManyIriTakingPredicate\",token:l(n.children.ManyIriTakingPredicate[0])});break;case\"shaclNodeKind\":t.predicates.push({type:\"nodeKind\",token:n.children.SHACL_nodeKind[0]});break;case\"shaclTargetNode\":t.predicates.push({type:\"targetNode\",token:n.children.SHACL_targetNode[0]});break;case\"shaclPropertyPath\":t.predicates.push({type:\"path\",token:n.children.SHACL_path[0]});break;case\"shaclLiteralConstraint\":t.predicates.push({type:\"LiteralConstraint\",token:l(n)});break;case\"shaclListTakingConstraint\":t.predicates.push({type:\"ListTakingConstraint\",token:l(n)});break;case\"shaclShapeExpectingConstraint\":t.predicates.push({type:\"ShapeExpectingPredicate\",token:n.children.ShapeExpectingPredicate[0]});break;case\"shaclHasValueConstraint\":t.predicates.push({type:\"hasValue\",token:n.children.SHACL_hasValue[0]});break;default:console.log(\"SHACL predicateObjectList with name \"+n.name+\" not recognized.\")}})},f=function(t){var e=t.blankNodePropertyList[0],n=e.children.predicateObjectList[0],r=t.predicateObjectList?t.predicateObjectList[0]:null;if(Object(u.b)(n)||Object(u.b)(r)){var i=r&&r.children&&r.children.shaclRulePredicateObjectList?(n.children.shaclRulePredicateObjectList||[]).concat(r.children.shaclRulePredicateObjectList):n.children.shaclRulePredicateObjectList;if(i){var o={subject:{type:\"blankNodePropertyList\",token:l(e)},types:[],predicates:[]};return p(o,i),o}}},L=function(t){return new(function(t){function e(){var e=t.call(this)||this;return e.triples=function(t){if(t.subject){var n=t.predicateObjectList[0];if(!Object(u.b)(n))return;var r=n.children.shaclRulePredicateObjectList;if(!r)return;var i={subject:{type:\"collection\"===Object.keys(t.subject[0].children)[0]?\"collection\":\"subject\",token:l(t.subject[0])},types:[],predicates:[]};p(i,r),e.shapes.push(i),e.visit(t.subject),e.visit(n)}else{if(!(i=f(t)))return;e.shapes.push(i),e.visit(t.blankNodePropertyList),t.predicateObjectList&&e.visit(t.predicateObjectList)}},e.shaclShape=function(t){if(t.blankNodePropertyList){var n=f(t);n&&(e.shapes.push(n),e.visit(t.blankNodePropertyList))}},e.$resetState=function(){e.shapes=[]},e.$validateShapes=function(t){var n=t.shacl,r=[],i=c(n),o=0,a=e.shapes.reduce(function(t,e){var n=e.subject.token.image,r=\"[\"===n?\"bnode\"+ ++o:n;if(t[r]){var i=t[r];t[r]={subjects:i.subjects.concat([e.subject]),types:i.types.concat(e.types),predicates:i.predicates.concat(e.predicates)}}else t[r]={subjects:[e.subject],types:e.types,predicates:e.predicates};return t},{});return Object.keys(a).forEach(function(t){var e,o=a[t],u=o.subjects,s=o.types,c=o.predicates;s.forEach(function(t){var n=t.type;e&&n!==e?r.push({name:\"ShapeTypeError\",message:\"A SHACL shape can be at most one of NodeShape or PropertyShape.\",token:u[0].token}):e||(e=n)});var l=[],p={};c.forEach(function(t){var e=t.token.image,r=E(e,i),o=r?n+\":\"+r:e;o===n+\":path\"?l.push(t):(p[o]||(p[o]=[]),p[o].push(t))}),l.length>0&&(\"NodeShape\"===e?r.push({name:\"ShapePropertyError\",message:\"SHACL instances of `NodeShape` cannot have a value for the `path` property.\",token:l[0].token}):e=\"PropertyShape\",l.length>1&&r.push({name:\"ShapePropertyError\",message:\"A shape can have at most one value for sh:path.\",token:l[1].token})),\"NodeShape\"===e?[\"minCount\",\"maxCount\",\"uniqueLang\",\"lessThan\",\"lessThanOrEquals\",\"qualifiedValueShape\"].forEach(function(t){var e=n+\":\"+t;p[e]&&r.push({name:\"ShapePropertyError\",message:\"A NodeShape cannot have any value for \"+e+\".\",token:p[e][0].token})}):[\"deactivated\",\"severity\",\"datatype\",\"nodeKind\",\"minCount\",\"maxCount\",\"minExclusive\",\"minInclusive\",\"maxExclusive\",\"maxInclusive\",\"minLength\",\"maxLength\",\"languageIn\",\"uniqueLang\",\"in\"].forEach(function(t){var e=n+\":\"+t;p[e]&&p[e].length>1&&r.push({name:\"ShapePropertyError\",message:\"A shape can have at most one value for \"+e+\".\",token:p[e][1].token})})}),{validationErrors:r}},e.validateVisitor(),e.shapes=[],e}return s(e,t),e}(t))};n.d(e,\"a\",function(){return N});var S=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(e,n)};return function(e,n){function r(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(r.prototype=n.prototype,new r)}}(),h=function(){return(h=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},T=n(67),U=T.getShaclTokenTypes,R=T.getShaclTokenMap,d=T.categoryTokenMap,O=n(27).turtleTokenMap,N=function(t){function e(e,n){void 0===n&&(n={shacl:\"sh\",xsd:\"xsd\"});var r=t.call(this,h({outputCst:!0,recoveryEnabled:!0},e),U(n),U(n),!1)||this;return r.validateWithVisitor=function(t){if(r.shaclVisitor)r.shaclVisitor.$resetState();else{var e=r.getBaseCstVisitorConstructorWithDefaults();r.shaclVisitor=L(e)}return r.shaclVisitor.visit(t),r.shaclVisitor.$validateShapes(r.prefixes)},r.tokenize=function(t){return r.lexer.tokenize(t).tokens},r.parse=function(t){r.input=r.tokenize(t);var e=r.turtleDoc(),n=r.validateWithVisitor(e).validationErrors;return{errors:r.errors.slice(),semanticErrors:r.semanticErrors.concat(n),cst:e}},r.predicateObjectList=r.OVERRIDE_RULE(\"predicateObjectList\",function(){r.OR([{ALT:function(){r.SUBRULE(r.shaclRulePredicateObjectList)}},{ALT:function(){r.SUBRULE(r.verb),r.SUBRULE(r.objectList)}}]),r.MANY(function(){r.CONSUME(O.Semicolon),r.OPTION(function(){r.OR1([{ALT:function(){r.SUBRULE1(r.shaclRulePredicateObjectList)}},{ALT:function(){r.SUBRULE1(r.verb),r.SUBRULE1(r.objectList)}}])})})}),r.shaclRulePredicateObjectList=r.RULE(\"shaclRulePredicateObjectList\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.shaclPredicateIRI)}},{ALT:function(){return r.SUBRULE(r.shaclNodeKind)}},{ALT:function(){return r.SUBRULE(r.shaclTargetNode)}},{ALT:function(){return r.SUBRULE(r.shaclPropertyPath)}},{ALT:function(){return r.SUBRULE(r.shaclLiteralConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclListTakingConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclShapeExpectingConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclHasValueConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclVerbShape)}}])}),r.shaclPredicateIRI=r.RULE(\"shaclPredicateIRI\",function(){r.OR([{ALT:function(){r.CONSUME(d.SingleIriTakingPredicate),r.SUBRULE(r.iri)}},{ALT:function(){r.CONSUME(d.ManyIriTakingPredicate),r.SUBRULE1(r.iri),r.MANY(function(){r.CONSUME(O.Comma),r.SUBRULE2(r.iri)})}}])}),r.shaclNodeKind=r.RULE(\"shaclNodeKind\",function(){r.CONSUME(r.shaclTokenMap.SHACL_nodeKind),r.CONSUME(d.NodeKindIRI)}),r.shaclTargetNode=r.RULE(\"shaclTargetNode\",function(){r.CONSUME(r.shaclTokenMap.SHACL_targetNode),r.SUBRULE(r.shaclIRIOrLiteral),r.MANY(function(){r.CONSUME(O.Comma),r.SUBRULE1(r.shaclIRIOrLiteral)})}),r.shaclVerbShape=r.RULE(\"shaclVerbShape\",function(){r.SUBRULE(r.verb),r.SUBRULE(r.shaclShapeType),r.MANY(function(){r.CONSUME(O.Comma),r.SUBRULE1(r.shaclShapeType)})}),r.shaclShapeType=r.RULE(\"shaclShapeType\",function(){r.OR([{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_Shape)}},{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_NodeShape)}},{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_PropertyShape)}}])}),r.shaclPropertyPath=r.RULE(\"shaclPropertyPath\",function(){r.CONSUME(r.shaclTokenMap.SHACL_path),r.SUBRULE(r.shaclPropertyPathPath)}),r.shaclPropertyPathPath=r.RULE(\"shaclPropertyPathPath\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.shaclPredicatePath)}},{ALT:function(){return r.SUBRULE(r.shaclSequencePath)}},{ALT:function(){return r.SUBRULE(r.shaclAlternativePath)}},{ALT:function(){return r.SUBRULE(r.shaclInversePath)}},{ALT:function(){return r.SUBRULE(r.shaclZeroOrMorePath)}},{ALT:function(){return r.SUBRULE(r.shaclOneOrMorePath)}},{ALT:function(){return r.SUBRULE(r.shaclZeroOrOnePath)}}])}),r.shaclPredicatePath=r.RULE(\"shaclPredicatePath\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){r.CONSUME(O.LParen),r.SUBRULE1(r.iri),r.CONSUME(O.RParen)}}])}),r.shaclSequencePath=r.RULE(\"shaclSequencePath\",function(){r.CONSUME(O.LParen),r.SUBRULE(r.shaclPropertyPathPath),r.AT_LEAST_ONE(function(){return r.SUBRULE1(r.shaclPropertyPathPath)}),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RParen)}),r.shaclAlternativePath=r.RULE(\"shaclAlternativePath\",function(){r.CONSUME(O.LBracket),r.CONSUME(r.shaclTokenMap.SHACL_alternativePath),r.SUBRULE(r.shaclPropertyPathPath),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RBracket)}),r.shaclInversePath=r.RULE(\"shaclInversePath\",function(){r.CONSUME(O.LBracket),r.CONSUME(r.shaclTokenMap.SHACL_inversePath),r.SUBRULE(r.shaclPropertyPathPath),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RBracket)}),r.shaclZeroOrMorePath=r.RULE(\"shaclZeroOrMorePath\",function(){r.CONSUME(O.LBracket),r.CONSUME(r.shaclTokenMap.SHACL_zeroOrMorePath),r.SUBRULE(r.shaclPropertyPathPath),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RBracket)}),r.shaclOneOrMorePath=r.RULE(\"shaclOneOrMorePath\",function(){r.CONSUME(O.LBracket),r.CONSUME(r.shaclTokenMap.SHACL_oneOrMorePath),r.SUBRULE(r.shaclPropertyPathPath),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RBracket)}),r.shaclZeroOrOnePath=r.RULE(\"shaclZeroOrOnePath\",function(){r.CONSUME(O.LBracket),r.CONSUME(r.shaclTokenMap.SHACL_zeroOrOnePath),r.SUBRULE(r.shaclPropertyPathPath),r.OPTION(function(){return r.CONSUME(O.Semicolon)}),r.CONSUME(O.RBracket)}),r.shaclLiteralConstraint=r.RULE(\"shaclLiteralConstraint\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.shaclIntConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclStringConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclStringLiteralQuoteConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclLangStringConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclBooleanConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclAnyLiteralConstraint)}}])}),r.shaclIntConstraint=r.RULE(\"shaclIntConstraint\",function(){r.CONSUME(d.IntTakingPredicate),r.OR([{ALT:function(){return r.CONSUME(O.INTEGER)}},{ALT:function(){return r.SUBRULE(r.shaclXsdInteger)}}])}),r.shaclStringConstraint=r.RULE(\"shaclStringConstraint\",function(){r.OR([{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_select)}},{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_ask)}}]),r.SUBRULE(r.String)}),r.shaclStringLiteralQuoteConstraint=r.RULE(\"shaclStringLiteralQuoteConstraint\",function(){r.CONSUME(d.StringLiteralQuoteTakingPredicate),r.CONSUME(O.STRING_LITERAL_QUOTE),r.OPTION(function(){r.OR([{ALT:function(){return r.CONSUME(O.LANGTAG)}},{ALT:function(){r.CONSUME(O.DoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_string)}},{ALT:function(){r.CONSUME1(O.DoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_anyURI)}}])})}),r.shaclLangStringConstraint=r.RULE(\"shaclLangStringConstraint\",function(){r.CONSUME(d.LangStringTakingPredicate),r.SUBRULE(r.String),r.OPTION(function(){r.OR([{ALT:function(){return r.CONSUME(O.LANGTAG)}},{ALT:function(){r.CONSUME(O.DoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_string)}}])})}),r.shaclBooleanConstraint=r.RULE(\"shaclBooleanConstraint\",function(){r.CONSUME(d.BooleanTakingPredicate),r.OR([{ALT:function(){return r.CONSUME(O.TRUE)}},{ALT:function(){return r.CONSUME(O.FALSE)}},{ALT:function(){return r.SUBRULE(r.shaclXsdBoolean)}}])}),r.shaclAnyLiteralConstraint=r.RULE(\"shaclAnyLiteralConstraint\",function(){r.CONSUME(d.AnyLiteralTakingPredicate),r.SUBRULE(r.literal)}),r.shaclListTakingConstraint=r.RULE(\"shaclListTakingConstraint\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.shaclLanguageInConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclShapeListTakingConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclIRIListTakingConstraint)}},{ALT:function(){return r.SUBRULE(r.shaclShapeOrLiteralListTakingConstraint)}}])}),r.shaclLanguageInConstraint=r.RULE(\"shaclLanguageInConstraint\",function(){r.CONSUME(r.shaclTokenMap.SHACL_languageIn),r.SUBRULE(r.shaclStringCollection)}),r.shaclStringCollection=r.RULE(\"shaclStringCollection\",function(){r.CONSUME(O.LParen),r.MANY(function(){r.CONSUME(O.STRING_LITERAL_QUOTE)}),r.CONSUME(O.RParen)}),r.shaclShapeListTakingConstraint=r.RULE(\"shaclShapeListTakingConstraint\",function(){r.OR([{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_and)}},{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_or)}},{ALT:function(){return r.CONSUME(r.shaclTokenMap.SHACL_xone)}}]),r.SUBRULE(r.shaclShapeCollection)}),r.shaclShapeCollection=r.RULE(\"shaclShapeCollection\",function(){r.CONSUME(O.LParen),r.MANY(function(){r.SUBRULE(r.shaclShape)}),r.CONSUME(O.RParen)}),r.shaclIRIListTakingConstraint=r.RULE(\"shaclIRIListTakingConstraint\",function(){r.CONSUME(r.shaclTokenMap.SHACL_ignoredProperties),r.SUBRULE(r.shaclIRICollection)}),r.shaclIRICollection=r.RULE(\"shaclIRICollection\",function(){r.CONSUME(O.LParen),r.MANY(function(){r.SUBRULE(r.iri)}),r.CONSUME(O.RParen)}),r.shaclShapeOrLiteralListTakingConstraint=r.RULE(\"shaclShapeOrLiteralListTakingConstraint\",function(){r.CONSUME(r.shaclTokenMap.SHACL_in),r.SUBRULE(r.shaclShapeOrLiteralCollection)}),r.shaclShapeOrLiteralCollection=r.RULE(\"shaclShapeOrLiteralCollection\",function(){r.CONSUME(O.LParen),r.MANY(function(){r.SUBRULE(r.shaclShapeOrLiteral)}),r.CONSUME(O.RParen)}),r.shaclShapeExpectingConstraint=r.RULE(\"shaclShapeExpectingConstraint\",function(){r.CONSUME(d.ShapeExpectingPredicate),r.SUBRULE(r.shaclShape)}),r.shaclHasValueConstraint=r.RULE(\"shaclHasValueConstraint\",function(){r.CONSUME(r.shaclTokenMap.SHACL_hasValue),r.SUBRULE(r.shaclShapeOrLiteral)}),r.shaclShape=r.RULE(\"shaclShape\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.SUBRULE(r.blankNodePropertyList)}},{ALT:function(){return r.SUBRULE(r.BlankNode)}}])}),r.shaclShapeOrLiteral=r.RULE(\"shaclShapeOrLiteral\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.shaclShape)}},{ALT:function(){return r.SUBRULE(r.literal)}}])}),r.shaclIRIOrLiteral=r.RULE(\"shaclIRIOrLiteral\",function(){r.OR([{ALT:function(){return r.SUBRULE(r.iri)}},{ALT:function(){return r.SUBRULE(r.literal)}}])}),r.shaclXsdBoolean=r.RULE(\"shaclXsdBoolean\",function(){r.SUBRULE(r.shaclStringWithDoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_boolean)}),r.shaclXsdString=r.RULE(\"shaclXsdString\",function(){r.SUBRULE(r.shaclStringWithDoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_string)}),r.shaclXsdInteger=r.RULE(\"shaclXsdInteger\",function(){r.SUBRULE(r.shaclStringWithDoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_integer)}),r.shaclXsdDate=r.RULE(\"shaclXsdDate\",function(){r.SUBRULE(r.shaclStringWithDoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_date)}),r.shaclXsdAnyURI=r.RULE(\"shaclXsdAnyURI\",function(){r.SUBRULE(r.shaclStringWithDoubleCaret),r.CONSUME(r.shaclTokenMap.SHACL_xsd_anyURI)}),r.shaclStringWithDoubleCaret=r.RULE(\"shaclStringWithDoubleCaret\",function(){r.SUBRULE(r.String),r.CONSUME(O.DoubleCaret)}),r.prefixes=n,r.lexer=new i.Lexer(U(n)),r.shaclTokenMap=R(n),i.Parser.performSelfAnalysis(r),r}return S(e,t),e}(TurtleParser.a)},function(t,e,n){\"use strict\";n.r(e);var r=n(1),i=function(t,e){return t.length===e.length&&t.every(function(t,n){return r=t,i=e[n],r===i;var r,i})};var o=function(t,e){var n;void 0===e&&(e=i);var r,o=[],a=!1;return function(){for(var i=arguments.length,u=new Array(i),s=0;s<i;s++)u[s]=arguments[s];return a&&n===this&&e(u,o)?r:(r=t.apply(this,u),a=!0,n=this,o=u,r)}},a=n(26),u=n(58),s=n.n(u);n.d(e,\"categoryTokenMap\",function(){return L}),n.d(e,\"categoryTokens\",function(){return S}),n.d(e,\"getShaclTokenMap\",function(){return A}),n.d(e,\"getShaclTokenTypes\",function(){return y});var c=function(){return(c=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},l=n(27),E=l.turtleTokenTypes,p=l.turtleTokenMap,f=n(9).sparqlTokenMap,L={ManyIriTakingPredicate:Object(r.createToken)({name:\"ManyIriTakingPredicate\",pattern:r.Lexer.NA}),SingleIriTakingPredicate:Object(r.createToken)({name:\"SingleIriTakingPredicate\",pattern:r.Lexer.NA}),NodeKindIRI:Object(r.createToken)({name:\"NodeKindIRI\",pattern:r.Lexer.NA}),IntTakingPredicate:Object(r.createToken)({name:\"IntTakingPredicate\",pattern:r.Lexer.NA}),StringLiteralQuoteTakingPredicate:Object(r.createToken)({name:\"StringLiteralQuoteTakingPredicate\",pattern:r.Lexer.NA}),LangStringTakingPredicate:Object(r.createToken)({name:\"LangStringTakingPredicate\",pattern:r.Lexer.NA}),BooleanTakingPredicate:Object(r.createToken)({name:\"BooleanTakingPredicate\",pattern:r.Lexer.NA}),ShapeExpectingPredicate:Object(r.createToken)({name:\"ShapeExpectingPredicate\",pattern:r.Lexer.NA}),AnyLiteralTakingPredicate:Object(r.createToken)({name:\"AnyLiteralTakingPredicate\",pattern:r.Lexer.NA})},S=Object.keys(L).map(function(t){return L[t]}),h={ManyIriTakingPredicate:Object(a.d)(\"equals\",\"disjoint\",\"lessThan\",\"lessThanOrEquals\",\"targetClass\",\"targetSubjectsOf\",\"targetObjectsOf\"),SingleIriTakingPredicate:Object(a.d)(\"class\",\"datatype\",\"severity\"),NodeKindIRI:Object(a.d)(\"IRI\",\"BlankNode\",\"Literal\",\"BlankNodeOrIRI\",\"BlankNodeOrLiteral\",\"IRIOrLiteral\"),IntTakingPredicate:Object(a.d)(\"minCount\",\"maxCount\",\"minLength\",\"maxLength\",\"qualifiedMinCount\",\"qualifiedMaxCount\"),StringLiteralQuoteTakingPredicate:Object(a.d)(\"pattern\",\"flags\",\"prefix\",\"namespace\"),LangStringTakingPredicate:Object(a.d)(\"message\",\"labelTemplate\"),BooleanTakingPredicate:Object(a.d)(\"uniqueLang\",\"qualifiedValueShapesDisjoint\",\"closed\",\"deactivated\",\"optional\"),ShapeExpectingPredicate:Object(a.d)(\"not\",\"node\",\"property\",\"qualifiedValueShape\",\"sparql\",\"declare\",\"prefixes\",\"parameter\",\"nodeValidator\",\"propertyValidator\",\"validator\"),AnyLiteralTakingPredicate:Object(a.d)(\"minExclusive\",\"minInclusive\",\"maxExclusive\",\"maxInclusive\"),other:Object(a.d)(\"Shape\",\"NodeShape\",\"PropertyShape\",\"targetNode\",\"message\",\"path\",\"alternativePath\",\"inversePath\",\"zeroOrMorePath\",\"oneOrMorePath\",\"zeroOrOnePath\",\"nodeKind\",\"languageIn\",\"and\",\"or\",\"xone\",\"ignoredProperties\",\"hasValue\",\"in\",\"select\",\"ask\")},T=Object(a.d)(\"boolean\",\"integer\",\"string\",\"date\",\"dateTime\",\"anyURI\"),U=Object.keys(h).reduce(function(t,e){return h[e].forEach(function(n){return t[n]=e}),t},{}),R=Object.keys(U),d=T.reduce(function(t,e){var n,i=\"SHACL_xsd_\"+e,o=i+\"_IRI\",a=Object(r.createToken)({name:i,pattern:r.Lexer.NA});return c({},t,((n={})[i]=a,n[o]=Object(r.createToken)({name:o,pattern:\"<http://www.w3.org/2001/XMLSchema#\"+e,categories:[a,p.IRIREF]}),n))},{}),O=R.reduce(function(t,e){var n,i=U[e],o=L[i],a=\"SHACL_\"+e,u=a+\"_IRI\",s=Object(r.createToken)({name:a,pattern:r.Lexer.NA,categories:o?[o]:[]});return c({},t,((n={})[a]=s,n[u]=Object(r.createToken)({name:u,pattern:\"<http://www.w3.org/ns/shacl#\"+e+\">\",categories:[s,p.IRIREF]}),n))},d),N=function(t){return function(e){return t+\":\"+e}},A=o(function(t){var e=N(t.shacl),n=N(t.xsd),i=R.reduce(function(t,n){var i,o=\"SHACL_\"+n,a=o+\"_prefixed\";return c({},t,((i={})[a]=Object(r.createToken)({name:a,pattern:e(n),categories:[t[o],p.PNAME_LN]}),i))},O);return T.reduce(function(t,e){var i,o=\"SHACL_xsd_\"+e,a=o+\"_prefixed\";return c({},t,((i={})[a]=Object(r.createToken)({name:a,pattern:\"\"+n(e),categories:[t[o],p.PNAME_LN]}),i))},i)},s.a),m=E.indexOf(f.PNAME_NS),C=E.indexOf(p.IRIREF),I=function(t,e){var n=t.split(\"_\"),r=(n[0],n[1]),i=n.slice(2),o=e.split(\"_\"),a=(o[0],o[1]),u=o.slice(2),s=(\"xsd\"===r?i[0]:r).toLowerCase(),c=(\"xsd\"===a?u[0]:a).toLowerCase();if(s===c){var l=\"xsd\"===r?i[1]:i[0],E=\"xsd\"===a?u[1]:u[0];return l&&E?0:l?1:-1}return s<c?1:c<s?-1:0},y=o(function(t){var e=A(t),n=Object.keys(e).sort(I).reduce(function(t,n){return n.endsWith(\"_IRI\")?(C<m&&t.iriTokens.push(e[n.slice(0,-4)]),t.iriTokens.push(e[n])):n.endsWith(\"_prefixed\")&&(m<C&&t.pnameTokens.push(e[n.slice(0,-9)]),t.pnameTokens.push(e[n])),t},{pnameTokens:[],iriTokens:[]}),r=n.pnameTokens,i=n.iriTokens;return m<C?E.slice(0,m).concat(S,r,E.slice(m,C),i,E.slice(C)):E.slice(0,C).concat(S,i,E.slice(C,m),r,E.slice(m))},s.a)},function(t,e,n){\"use strict\";var r,BaseGraphQlParser=n(54),StardogSparqlParser=n(36),i=n(12),o=n(55),a=(r=function(t,e){return(r=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(t,e)},function(t,e){function n(){this.constructor=t}r(t,e),t.prototype=null===e?Object.create(e):(n.prototype=e.prototype,new n)}),u=function(){return(u=Object.assign||function(t){for(var e,n=1,r=arguments.length;n<r;n++)for(var i in e=arguments[n])Object.prototype.hasOwnProperty.call(e,i)&&(t[i]=e[i]);return t}).apply(this,arguments)},s=o.a.getArgumentNodes,c=o.a.getArgumentTokenTypesForDirectiveNameToken,l=o.a.isSparqlReceivingStardogDirective;function E(t){var e=t.allowedArgumentTokenTypes,n=t.directiveImage,r=t.errorAccumulator,i=t.numMinimumArguments,o=t.suppliedArgumentNodes.length,a=e.length,u=\"valid arguments: \"+e.map(function(t){return\"`\"+t.PATTERN+\"`\"}).join(\", \");if(o<i){var s=\"requires \"+i+\" argument\"+(i>1?\"s\":\"\");r.stardogGraphQlErrors.push({name:\"ArgumentArityError\",message:\"The \"+n+\" directive \"+s+\" (\"+u+\")\"})}else o>a&&r.stardogGraphQlErrors.push({name:\"ArgumentArityError\",message:\"Too many arguments provided to \"+n+\" directive (\"+u+\")\"})}function p(t){var e=t.allowedArgumentTokenTypes,n=t.directiveImage,r=t.errorAccumulator,o=t.sparqlParser,a=t.suppliedArgumentNodes,s=\"valid arguments: \"+e.map(function(t){return\"`\"+t.PATTERN+\"`\"}).join(\", \");a.forEach(function(t){var a,c=Object(i.a)([\"Alias\",\"Name\"],t);if(Object(i.c)(c)){var l,E,p,f=c.tokenType.name;if(e.some(function(t){return t.name===f})){var L=Object(i.a)([\"Value\",\"StringValue\",\"StringValueToken\"],t);if(!Object(i.c)(L))return;var S=(l=L,E=o,p=l.image.slice(1,-1),E.parse(p,E.Expression)).errors;S.length>0&&(a=r.sparqlErrors).push.apply(a,function(t,e,n){void 0===n&&(n=0);var r=e.startOffset,i=e.endOffset,o=e.startColumn,a=e.endColumn;return t.map(function(t){var s=t.token,c=s.startOffset,l=s.endOffset,E=s.startColumn,p=s.endColumn;return u({},t,{token:u({},s,{startOffset:r+(c||0)+n,endOffset:i+(l||0)+n,startColumn:o+(E||0)+n,endColumn:a+(p||0)+n,startLine:e.startLine,endLine:e.endLine})})})}(S,L,1))}else r.stardogGraphQlErrors.push({name:\"InvalidArgumentError\",message:\"Invalid argument `\"+c.image+\"` for \"+n+\" directive (\"+s+\")\"})}})}var f=function(t,e){var n=new StardogSparqlParser.a;return new(function(t){function r(){var r=t.call(this)||this;return r.sparqlErrors=[],r.stardogGraphQlErrors=[],r.visit=function(){for(var e=[],n=0;n<arguments.length;n++)e[n]=arguments[n];return t.prototype.visit.apply(r,e),{sparqlErrors:r.sparqlErrors,stardogGraphQlErrors:r.stardogGraphQlErrors}},r.Directive=function(t){var i,o;if(t.Name&&t.Name[0]){var a=t.Name[0];if(l(a)){var f=function(t,e,n){var r,i,o={stardogGraphQlErrors:[],sparqlErrors:[]},a=c(e),u=e.tokenType.PATTERN;return i=(r={validatorOptions:{allowedArgumentTokenTypes:a,directiveImage:u,errorAccumulator:o,numMinimumArguments:1,sparqlParser:n,suppliedArgumentNodes:t},validators:[E,p]}).validatorOptions,r.validators.forEach(function(t){return t(i)}),o}(s(t),a,n);if(f.stardogGraphQlErrors.length>0){var L=e.getHumanReadableRuleStack(),S=e.RULE_OCCURRENCE_STACK;(i=r.stardogGraphQlErrors).push.apply(i,f.stardogGraphQlErrors.map(function(t){return u({},t,{token:a,context:{ruleStack:L,ruleOccurrenceStack:S},resyncedTokens:[]})}))}(o=r.sparqlErrors).push.apply(o,f.sparqlErrors.map(function(t){return u({},t,{name:\"SPARQL Error: \"+t.name})}))}}},r.$resetState=function(){r.stardogGraphQlErrors=[],r.sparqlErrors=[]},r.validateVisitor(),r}return a(r,t),r}(t))};n.d(e,\"a\",function(){return h});var L=function(){var t=function(e,n){return(t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var n in e)e.hasOwnProperty(n)&&(t[n]=e[n])})(e,n)};return function(e,n){function r(){this.constructor=e}t(e,n),e.prototype=null===n?Object.create(n):(r.prototype=n.prototype,new r)}}(),S=n(57).stardogGraphQlTokens,h=function(t){function StardogGraphQlParser(e){var n=t.call(this,e,S)||this;return n.visitCst=function(t){if(n.stardogGraphQlVisitor)n.stardogGraphQlVisitor.$resetState();else{var e=n.getBaseCstVisitorConstructorWithDefaults();n.stardogGraphQlVisitor=f(e,n)}return n.stardogGraphQlVisitor.visit(t,n.input)},n.parse=function(t,e){void 0===e&&(e=n.Document),n.input=n.tokenize(t);var r=e.call(n),i=n.visitCst(r),o=i.sparqlErrors,a=i.stardogGraphQlErrors;return{errors:n.errors.concat(a,o),cst:r}},n.performSelfAnalysis(),n}return L(StardogGraphQlParser,t),StardogGraphQlParser}(BaseGraphQlParser.a)},function(t,e,n){\"use strict\";const r=/[|\\\\{}()[\\]^$+*?.-]/g;t.exports=(t=>{if(\"string\"!=typeof t)throw new TypeError(\"Expected a string\");return t.replace(r,\"\\\\$&\")})},function(t,e){var n;n=function(){return this}();try{n=n||new Function(\"return this\")()}catch(t){\"object\"==typeof window&&(n=window)}t.exports=n},function(t,e){t.exports=function(t){return t.webpackPolyfill||(t.deprecate=function(){},t.paths=[],t.children||(t.children=[]),Object.defineProperty(t,\"loaded\",{enumerable:!0,get:function(){return t.l}}),Object.defineProperty(t,\"id\",{enumerable:!0,get:function(){return t.i}}),t.webpackPolyfill=1),t}},function(t,e,n){\"use strict\";n.r(e),n.d(e,\"sparqlTokens\",function(){return d}),n.d(e,\"turtleTokens\",function(){return O}),n.d(e,\"srsTokens\",function(){return N}),n.d(e,\"trigTokens\",function(){return A}),n.d(e,\"smsTokens\",function(){return m}),n.d(e,\"shaclTokens\",function(){return C}),n.d(e,\"graphQlTokens\",function(){return I});var r=n(21);n.d(e,\"BaseSparqlParser\",function(){return r.a});var i=n(36);n.d(e,\"StardogSparqlParser\",function(){return i.a});var o=n(53);n.d(e,\"W3SpecSparqlParser\",function(){return o.a});var a=n(35);n.d(e,\"TurtleParser\",function(){return a.a});var u=n(65);n.d(e,\"SrsParser\",function(){return u.a});var s=n(60);n.d(e,\"TrigParser\",function(){return s.a});var c=n(62);n.d(e,\"SmsParser\",function(){return c.a});var l=n(66);n.d(e,\"ShaclParser\",function(){return l.a});var E=n(54);n.d(e,\"BaseGraphQlParser\",function(){return E.a});var p=n(64);n.d(e,\"StandardGraphQlParser\",function(){return p.a});var f=n(68);n.d(e,\"StardogGraphQlParser\",function(){return f.a});var L=n(55);n.d(e,\"graphQlUtils\",function(){return L.a});var S=n(12);n.d(e,\"traverse\",function(){return S.d}),n.d(e,\"unsafeTraverse\",function(){return S.e}),n.d(e,\"isCstNode\",function(){return S.b}),n.d(e,\"isIToken\",function(){return S.c}),n.d(e,\"getFirstChildCstElementByRuleStack\",function(){return S.a});var h=n(26);n.d(e,\"getAsTypedTuple\",function(){return h.d}),n.d(e,\"IToken\",function(){return h.b}),n.d(e,\"CstNode\",function(){return h.a}),n.d(e,\"TokenType\",function(){return h.c});var T=n(0);n.d(e,\"sparqlKeywords\",function(){return T.keywords});var U=n(5);n.d(e,\"sparqlTerminals\",function(){return U.terminals});var R=n(3);n.d(e,\"matchers\",function(){return R});var d=n(9),O=n(27),N=n(59),A=n(61),m=n(63),C=n(67),I=n(57)}])});\n//# sourceMappingURL=millan.js.map\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/millan/dist/millan.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/IRIs.js":
+/*!*************************************!*\
+  !*** ./node_modules/n3/src/IRIs.js ***!
+  \*************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\nconst RDF  = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',\n    XSD  = 'http://www.w3.org/2001/XMLSchema#',\n    SWAP = 'http://www.w3.org/2000/10/swap/';\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = ({\n  xsd: {\n    decimal: `${XSD}decimal`,\n    boolean: `${XSD}boolean`,\n    double:  `${XSD}double`,\n    integer: `${XSD}integer`,\n    string:  `${XSD}string`,\n  },\n  rdf: {\n    type:       `${RDF}type`,\n    nil:        `${RDF}nil`,\n    first:      `${RDF}first`,\n    rest:       `${RDF}rest`,\n    langString: `${RDF}langString`,\n  },\n  owl: {\n    sameAs: 'http://www.w3.org/2002/07/owl#sameAs',\n  },\n  r: {\n    forSome: `${SWAP}reify#forSome`,\n    forAll:  `${SWAP}reify#forAll`,\n  },\n  log: {\n    implies: `${SWAP}log#implies`,\n  },\n});\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/IRIs.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3DataFactory.js":
+/*!**********************************************!*\
+  !*** ./node_modules/n3/src/N3DataFactory.js ***!
+  \**********************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   BlankNode: () => (/* binding */ BlankNode),\n/* harmony export */   DefaultGraph: () => (/* binding */ DefaultGraph),\n/* harmony export */   Literal: () => (/* binding */ Literal),\n/* harmony export */   NamedNode: () => (/* binding */ NamedNode),\n/* harmony export */   Quad: () => (/* binding */ Quad),\n/* harmony export */   Term: () => (/* binding */ Term),\n/* harmony export */   Triple: () => (/* binding */ Quad),\n/* harmony export */   Variable: () => (/* binding */ Variable),\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__),\n/* harmony export */   escapeQuotes: () => (/* binding */ escapeQuotes),\n/* harmony export */   termFromId: () => (/* binding */ termFromId),\n/* harmony export */   termToId: () => (/* binding */ termToId),\n/* harmony export */   unescapeQuotes: () => (/* binding */ unescapeQuotes)\n/* harmony export */ });\n/* harmony import */ var _IRIs__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./IRIs */ \"./node_modules/n3/src/IRIs.js\");\n/* harmony import */ var _N3Util__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./N3Util */ \"./node_modules/n3/src/N3Util.js\");\n// N3.js implementations of the RDF/JS core data types\n// See https://github.com/rdfjs/representation-task-force/blob/master/interface-spec.md\n\n\n\nconst { rdf, xsd } = _IRIs__WEBPACK_IMPORTED_MODULE_0__[\"default\"];\n\n// eslint-disable-next-line prefer-const\nlet DEFAULTGRAPH;\nlet _blankNodeCounter = 0;\n\nconst escapedLiteral = /^\"(.*\".*)(?=\"[^\"]*$)/;\nconst quadId = /^<<(\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) (\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) (\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+) ?(\"(?:\"\"|[^\"])*\"[^ ]*|[^ ]+)?>>$/;\n\n// ## DataFactory singleton\nconst DataFactory = {\n  namedNode,\n  blankNode,\n  variable,\n  literal,\n  defaultGraph,\n  quad,\n  triple: quad,\n};\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (DataFactory);\n\n// ## Term constructor\nclass Term {\n  constructor(id) {\n    this.id = id;\n  }\n\n  // ### The value of this term\n  get value() {\n    return this.id;\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both terms were created by this library,\n    // equality can be computed through ids\n    if (other instanceof Term)\n      return this.id === other.id;\n    // Otherwise, compare term type and value\n    return !!other && this.termType === other.termType &&\n                      this.value    === other.value;\n  }\n\n  // ### Implement hashCode for Immutable.js, since we implement `equals`\n  // https://immutable-js.com/docs/v4.0.0/ValueObject/#hashCode()\n  hashCode() {\n    return 0;\n  }\n\n  // ### Returns a plain object representation of this term\n  toJSON() {\n    return {\n      termType: this.termType,\n      value:    this.value,\n    };\n  }\n}\n\n\n// ## NamedNode constructor\nclass NamedNode extends Term {\n  // ### The term type of this term\n  get termType() {\n    return 'NamedNode';\n  }\n}\n\n// ## Literal constructor\nclass Literal extends Term {\n  // ### The term type of this term\n  get termType() {\n    return 'Literal';\n  }\n\n  // ### The text value of this literal\n  get value() {\n    return this.id.substring(1, this.id.lastIndexOf('\"'));\n  }\n\n  // ### The language of this literal\n  get language() {\n    // Find the last quotation mark (e.g., '\"abc\"@en-us')\n    const id = this.id;\n    let atPos = id.lastIndexOf('\"') + 1;\n    // If \"@\" it follows, return the remaining substring; empty otherwise\n    return atPos < id.length && id[atPos++] === '@' ? id.substr(atPos).toLowerCase() : '';\n  }\n\n  // ### The datatype IRI of this literal\n  get datatype() {\n    return new NamedNode(this.datatypeString);\n  }\n\n  // ### The datatype string of this literal\n  get datatypeString() {\n    // Find the last quotation mark (e.g., '\"abc\"^^http://ex.org/types#t')\n    const id = this.id, dtPos = id.lastIndexOf('\"') + 1;\n    const char = dtPos < id.length ? id[dtPos] : '';\n    // If \"^\" it follows, return the remaining substring\n    return char === '^' ? id.substr(dtPos + 2) :\n           // If \"@\" follows, return rdf:langString; xsd:string otherwise\n           (char !== '@' ? xsd.string : rdf.langString);\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both literals were created by this library,\n    // equality can be computed through ids\n    if (other instanceof Literal)\n      return this.id === other.id;\n    // Otherwise, compare term type, value, language, and datatype\n    return !!other && !!other.datatype &&\n                      this.termType === other.termType &&\n                      this.value    === other.value    &&\n                      this.language === other.language &&\n                      this.datatype.value === other.datatype.value;\n  }\n\n  toJSON() {\n    return {\n      termType: this.termType,\n      value:    this.value,\n      language: this.language,\n      datatype: { termType: 'NamedNode', value: this.datatypeString },\n    };\n  }\n}\n\n// ## BlankNode constructor\nclass BlankNode extends Term {\n  constructor(name) {\n    super(`_:${name}`);\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'BlankNode';\n  }\n\n  // ### The name of this blank node\n  get value() {\n    return this.id.substr(2);\n  }\n}\n\nclass Variable extends Term {\n  constructor(name) {\n    super(`?${name}`);\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'Variable';\n  }\n\n  // ### The name of this variable\n  get value() {\n    return this.id.substr(1);\n  }\n}\n\n// ## DefaultGraph constructor\nclass DefaultGraph extends Term {\n  constructor() {\n    super('');\n    return DEFAULTGRAPH || this;\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'DefaultGraph';\n  }\n\n  // ### Returns whether this object represents the same term as the other\n  equals(other) {\n    // If both terms were created by this library,\n    // equality can be computed through strict equality;\n    // otherwise, compare term types.\n    return (this === other) || (!!other && (this.termType === other.termType));\n  }\n}\n\n// ## DefaultGraph singleton\nDEFAULTGRAPH = new DefaultGraph();\n\n\n// ### Constructs a term from the given internal string ID\nfunction termFromId(id, factory) {\n  factory = factory || DataFactory;\n\n  // Falsy value or empty string indicate the default graph\n  if (!id)\n    return factory.defaultGraph();\n\n  // Identify the term type based on the first character\n  switch (id[0]) {\n  case '?':\n    return factory.variable(id.substr(1));\n  case '_':\n    return factory.blankNode(id.substr(2));\n  case '\"':\n    // Shortcut for internal literals\n    if (factory === DataFactory)\n      return new Literal(id);\n    // Literal without datatype or language\n    if (id[id.length - 1] === '\"')\n      return factory.literal(id.substr(1, id.length - 2));\n    // Literal with datatype or language\n    const endPos = id.lastIndexOf('\"', id.length - 1);\n    return factory.literal(id.substr(1, endPos - 1),\n            id[endPos + 1] === '@' ? id.substr(endPos + 2)\n                                   : factory.namedNode(id.substr(endPos + 3)));\n  case '<':\n    const components = quadId.exec(id);\n    return factory.quad(\n      termFromId(unescapeQuotes(components[1]), factory),\n      termFromId(unescapeQuotes(components[2]), factory),\n      termFromId(unescapeQuotes(components[3]), factory),\n      components[4] && termFromId(unescapeQuotes(components[4]), factory)\n    );\n  default:\n    return factory.namedNode(id);\n  }\n}\n\n// ### Constructs an internal string ID from the given term or ID string\nfunction termToId(term) {\n  if (typeof term === 'string')\n    return term;\n  if (term instanceof Term && term.termType !== 'Quad')\n    return term.id;\n  if (!term)\n    return DEFAULTGRAPH.id;\n\n  // Term instantiated with another library\n  switch (term.termType) {\n  case 'NamedNode':    return term.value;\n  case 'BlankNode':    return `_:${term.value}`;\n  case 'Variable':     return `?${term.value}`;\n  case 'DefaultGraph': return '';\n  case 'Literal':      return `\"${term.value}\"${\n    term.language ? `@${term.language}` :\n      (term.datatype && term.datatype.value !== xsd.string ? `^^${term.datatype.value}` : '')}`;\n  case 'Quad':\n    // To identify RDF* quad components, we escape quotes by doubling them.\n    // This avoids the overhead of backslash parsing of Turtle-like syntaxes.\n    return `<<${\n        escapeQuotes(termToId(term.subject))\n      } ${\n        escapeQuotes(termToId(term.predicate))\n      } ${\n        escapeQuotes(termToId(term.object))\n      }${\n        ((0,_N3Util__WEBPACK_IMPORTED_MODULE_1__.isDefaultGraph)(term.graph)) ? '' : ` ${termToId(term.graph)}`\n      }>>`;\n  default: throw new Error(`Unexpected termType: ${term.termType}`);\n  }\n}\n\n\n// ## Quad constructor\nclass Quad extends Term {\n  constructor(subject, predicate, object, graph) {\n    super('');\n    this._subject   = subject;\n    this._predicate = predicate;\n    this._object    = object;\n    this._graph     = graph || DEFAULTGRAPH;\n  }\n\n  // ### The term type of this term\n  get termType() {\n    return 'Quad';\n  }\n\n  get subject() {\n    return this._subject;\n  }\n\n  get predicate() {\n    return this._predicate;\n  }\n\n  get object() {\n    return this._object;\n  }\n\n  get graph() {\n    return this._graph;\n  }\n\n  // ### Returns a plain object representation of this quad\n  toJSON() {\n    return {\n      termType:  this.termType,\n      subject:   this._subject.toJSON(),\n      predicate: this._predicate.toJSON(),\n      object:    this._object.toJSON(),\n      graph:     this._graph.toJSON(),\n    };\n  }\n\n  // ### Returns whether this object represents the same quad as the other\n  equals(other) {\n    return !!other && this._subject.equals(other.subject)     &&\n                      this._predicate.equals(other.predicate) &&\n                      this._object.equals(other.object)       &&\n                      this._graph.equals(other.graph);\n  }\n}\n\n\n// ### Escapes the quotes within the given literal\nfunction escapeQuotes(id) {\n  return id.replace(escapedLiteral, (_, quoted) => `\"${quoted.replace(/\"/g, '\"\"')}`);\n}\n\n// ### Unescapes the quotes within the given literal\nfunction unescapeQuotes(id) {\n  return id.replace(escapedLiteral, (_, quoted) => `\"${quoted.replace(/\"\"/g, '\"')}`);\n}\n\n// ### Creates an IRI\nfunction namedNode(iri) {\n  return new NamedNode(iri);\n}\n\n// ### Creates a blank node\nfunction blankNode(name) {\n  return new BlankNode(name || `n3-${_blankNodeCounter++}`);\n}\n\n// ### Creates a literal\nfunction literal(value, languageOrDataType) {\n  // Create a language-tagged string\n  if (typeof languageOrDataType === 'string')\n    return new Literal(`\"${value}\"@${languageOrDataType.toLowerCase()}`);\n\n  // Automatically determine datatype for booleans and numbers\n  let datatype = languageOrDataType ? languageOrDataType.value : '';\n  if (datatype === '') {\n    // Convert a boolean\n    if (typeof value === 'boolean')\n      datatype = xsd.boolean;\n    // Convert an integer or double\n    else if (typeof value === 'number') {\n      if (Number.isFinite(value))\n        datatype = Number.isInteger(value) ? xsd.integer : xsd.double;\n      else {\n        datatype = xsd.double;\n        if (!Number.isNaN(value))\n          value = value > 0 ? 'INF' : '-INF';\n      }\n    }\n  }\n\n  // Create a datatyped literal\n  return (datatype === '' || datatype === xsd.string) ?\n    new Literal(`\"${value}\"`) :\n    new Literal(`\"${value}\"^^${datatype}`);\n}\n\n// ### Creates a variable\nfunction variable(name) {\n  return new Variable(name);\n}\n\n// ### Returns the default graph\nfunction defaultGraph() {\n  return DEFAULTGRAPH;\n}\n\n// ### Creates a quad\nfunction quad(subject, predicate, object, graph) {\n  return new Quad(subject, predicate, object, graph);\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3DataFactory.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3Lexer.js":
+/*!****************************************!*\
+  !*** ./node_modules/n3/src/N3Lexer.js ***!
+  \****************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3Lexer)\n/* harmony export */ });\n/* harmony import */ var _IRIs__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./IRIs */ \"./node_modules/n3/src/IRIs.js\");\n/* harmony import */ var queue_microtask__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! queue-microtask */ \"./node_modules/queue-microtask/index.js\");\n/* harmony import */ var queue_microtask__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(queue_microtask__WEBPACK_IMPORTED_MODULE_0__);\n// **N3Lexer** tokenizes N3 documents.\n\n\n\nconst { xsd } = _IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"];\n\n// Regular expression and replacement string to escape N3 strings\nconst escapeSequence = /\\\\u([a-fA-F0-9]{4})|\\\\U([a-fA-F0-9]{8})|\\\\([^])/g;\nconst escapeReplacements = {\n  '\\\\': '\\\\', \"'\": \"'\", '\"': '\"',\n  'n': '\\n', 'r': '\\r', 't': '\\t', 'f': '\\f', 'b': '\\b',\n  '_': '_', '~': '~', '.': '.', '-': '-', '!': '!', '$': '$', '&': '&',\n  '(': '(', ')': ')', '*': '*', '+': '+', ',': ',', ';': ';', '=': '=',\n  '/': '/', '?': '?', '#': '#', '@': '@', '%': '%',\n};\nconst illegalIriChars = /[\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]/;\n\nconst lineModeRegExps = {\n  _iri: true,\n  _unescapedIri: true,\n  _simpleQuotedString: true,\n  _langcode: true,\n  _blank: true,\n  _newline: true,\n  _comment: true,\n  _whitespace: true,\n  _endOfFile: true,\n};\nconst invalidRegExp = /$0^/;\n\n// ## Constructor\nclass N3Lexer {\n  constructor(options) {\n    // ## Regular expressions\n    // It's slightly faster to have these as properties than as in-scope variables\n    this._iri = /^<((?:[^ <>{}\\\\]|\\\\[uU])+)>[ \\t]*/; // IRI with escape sequences; needs sanity check after unescaping\n    this._unescapedIri = /^<([^\\x00-\\x20<>\\\\\"\\{\\}\\|\\^\\`]*)>[ \\t]*/; // IRI without escape sequences; no unescaping\n    this._simpleQuotedString = /^\"([^\"\\\\\\r\\n]*)\"(?=[^\"])/; // string without escape sequences\n    this._simpleApostropheString = /^'([^'\\\\\\r\\n]*)'(?=[^'])/;\n    this._langcode = /^@([a-z]+(?:-[a-z0-9]+)*)(?=[^a-z0-9\\-])/i;\n    this._prefix = /^((?:[A-Za-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)?:(?=[#\\s<])/;\n    this._prefixed = /^((?:[A-Za-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)?:((?:(?:[0-:A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~])(?:(?:[\\.\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~])*(?:[\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff]|%[0-9a-fA-F]{2}|\\\\[!#-\\/;=?\\-@_~]))?)?)(?:[ \\t]+|(?=\\.?[,;!\\^\\s#()\\[\\]\\{\\}\"'<>]))/;\n    this._variable = /^\\?(?:(?:[A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:[\\-0-:A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)(?=[.,;!\\^\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._blank = /^_:((?:[0-9A-Z_a-z\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02ff\\u0370-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])(?:\\.?[\\-0-9A-Z_a-z\\xb7\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u037d\\u037f-\\u1fff\\u200c\\u200d\\u203f\\u2040\\u2070-\\u218f\\u2c00-\\u2fef\\u3001-\\ud7ff\\uf900-\\ufdcf\\ufdf0-\\ufffd]|[\\ud800-\\udb7f][\\udc00-\\udfff])*)(?:[ \\t]+|(?=\\.?[,;:\\s#()\\[\\]\\{\\}\"'<>]))/;\n    this._number = /^[\\-+]?(?:(\\d+\\.\\d*|\\.?\\d+)[eE][\\-+]?|\\d*(\\.)?)\\d+(?=\\.?[,;:\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._boolean = /^(?:true|false)(?=[.,;\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._keyword = /^@[a-z]+(?=[\\s#<:])/i;\n    this._sparqlKeyword = /^(?:PREFIX|BASE|GRAPH)(?=[\\s#<])/i;\n    this._shortPredicates = /^a(?=[\\s#()\\[\\]\\{\\}\"'<>])/;\n    this._newline = /^[ \\t]*(?:#[^\\n\\r]*)?(?:\\r\\n|\\n|\\r)[ \\t]*/;\n    this._comment = /#([^\\n\\r]*)/;\n    this._whitespace = /^[ \\t]+/;\n    this._endOfFile = /^(?:#[^\\n\\r]*)?$/;\n    options = options || {};\n\n    // In line mode (N-Triples or N-Quads), only simple features may be parsed\n    if (this._lineMode = !!options.lineMode) {\n      this._n3Mode = false;\n      // Don't tokenize special literals\n      for (const key in this) {\n        if (!(key in lineModeRegExps) && this[key] instanceof RegExp)\n          this[key] = invalidRegExp;\n      }\n    }\n    // When not in line mode, enable N3 functionality by default\n    else {\n      this._n3Mode = options.n3 !== false;\n    }\n    // Don't output comment tokens by default\n    this._comments = !!options.comments;\n    // Cache the last tested closing position of long literals\n    this._literalClosingPos = 0;\n  }\n\n  // ## Private methods\n\n  // ### `_tokenizeToEnd` tokenizes as for as possible, emitting tokens through the callback\n  _tokenizeToEnd(callback, inputFinished) {\n    // Continue parsing as far as possible; the loop will return eventually\n    let input = this._input;\n    let currentLineLength = input.length;\n    while (true) {\n      // Count and skip whitespace lines\n      let whiteSpaceMatch, comment;\n      while (whiteSpaceMatch = this._newline.exec(input)) {\n        // Try to find a comment\n        if (this._comments && (comment = this._comment.exec(whiteSpaceMatch[0])))\n          emitToken('comment', comment[1], '', this._line, whiteSpaceMatch[0].length);\n        // Advance the input\n        input = input.substr(whiteSpaceMatch[0].length, input.length);\n        currentLineLength = input.length;\n        this._line++;\n      }\n      // Skip whitespace on current line\n      if (!whiteSpaceMatch && (whiteSpaceMatch = this._whitespace.exec(input)))\n        input = input.substr(whiteSpaceMatch[0].length, input.length);\n\n      // Stop for now if we're at the end\n      if (this._endOfFile.test(input)) {\n        // If the input is finished, emit EOF\n        if (inputFinished) {\n          // Try to find a final comment\n          if (this._comments && (comment = this._comment.exec(input)))\n            emitToken('comment', comment[1], '', this._line, input.length);\n          input = null;\n          emitToken('eof', '', '', this._line, 0);\n        }\n        return this._input = input;\n      }\n\n      // Look for specific token types based on the first character\n      const line = this._line, firstChar = input[0];\n      let type = '', value = '', prefix = '',\n          match = null, matchLength = 0, inconclusive = false;\n      switch (firstChar) {\n      case '^':\n        // We need at least 3 tokens lookahead to distinguish ^^<IRI> and ^^pre:fixed\n        if (input.length < 3)\n          break;\n        // Try to match a type\n        else if (input[1] === '^') {\n          this._previousMarker = '^^';\n          // Move to type IRI or prefixed name\n          input = input.substr(2);\n          if (input[0] !== '<') {\n            inconclusive = true;\n            break;\n          }\n        }\n        // If no type, it must be a path expression\n        else {\n          if (this._n3Mode) {\n            matchLength = 1;\n            type = '^';\n          }\n          break;\n        }\n        // Fall through in case the type is an IRI\n      case '<':\n        // Try to find a full IRI without escape sequences\n        if (match = this._unescapedIri.exec(input))\n          type = 'IRI', value = match[1];\n        // Try to find a full IRI with escape sequences\n        else if (match = this._iri.exec(input)) {\n          value = this._unescape(match[1]);\n          if (value === null || illegalIriChars.test(value))\n            return reportSyntaxError(this);\n          type = 'IRI';\n        }\n        // Try to find a nested triple\n        else if (input.length > 1 && input[1] === '<')\n          type = '<<', matchLength = 2;\n        // Try to find a backwards implication arrow\n        else if (this._n3Mode && input.length > 1 && input[1] === '=')\n          type = 'inverse', matchLength = 2, value = '>';\n        break;\n\n      case '>':\n        if (input.length > 1 && input[1] === '>')\n          type = '>>', matchLength = 2;\n        break;\n\n      case '_':\n        // Try to find a blank node. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a blank node.\n        // Therefore, try inserting a space if we're at the end of the input.\n        if ((match = this._blank.exec(input)) ||\n            inputFinished && (match = this._blank.exec(`${input} `)))\n          type = 'blank', prefix = '_', value = match[1];\n        break;\n\n      case '\"':\n        // Try to find a literal without escape sequences\n        if (match = this._simpleQuotedString.exec(input))\n          value = match[1];\n        // Try to find a literal wrapped in three pairs of quotes\n        else {\n          ({ value, matchLength } = this._parseLiteral(input));\n          if (value === null)\n            return reportSyntaxError(this);\n        }\n        if (match !== null || matchLength !== 0) {\n          type = 'literal';\n          this._literalClosingPos = 0;\n        }\n        break;\n\n      case \"'\":\n        if (!this._lineMode) {\n          // Try to find a literal without escape sequences\n          if (match = this._simpleApostropheString.exec(input))\n            value = match[1];\n          // Try to find a literal wrapped in three pairs of quotes\n          else {\n            ({ value, matchLength } = this._parseLiteral(input));\n            if (value === null)\n              return reportSyntaxError(this);\n          }\n          if (match !== null || matchLength !== 0) {\n            type = 'literal';\n            this._literalClosingPos = 0;\n          }\n        }\n        break;\n\n      case '?':\n        // Try to find a variable\n        if (this._n3Mode && (match = this._variable.exec(input)))\n          type = 'var', value = match[0];\n        break;\n\n      case '@':\n        // Try to find a language code\n        if (this._previousMarker === 'literal' && (match = this._langcode.exec(input)))\n          type = 'langcode', value = match[1];\n        // Try to find a keyword\n        else if (match = this._keyword.exec(input))\n          type = match[0];\n        break;\n\n      case '.':\n        // Try to find a dot as punctuation\n        if (input.length === 1 ? inputFinished : (input[1] < '0' || input[1] > '9')) {\n          type = '.';\n          matchLength = 1;\n          break;\n        }\n        // Fall through to numerical case (could be a decimal dot)\n\n      case '0':\n      case '1':\n      case '2':\n      case '3':\n      case '4':\n      case '5':\n      case '6':\n      case '7':\n      case '8':\n      case '9':\n      case '+':\n      case '-':\n        // Try to find a number. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a number.\n        // Therefore, try inserting a space if we're at the end of the input.\n        if (match = this._number.exec(input) ||\n            inputFinished && (match = this._number.exec(`${input} `))) {\n          type = 'literal', value = match[0];\n          prefix = (typeof match[1] === 'string' ? xsd.double :\n                    (typeof match[2] === 'string' ? xsd.decimal : xsd.integer));\n        }\n        break;\n\n      case 'B':\n      case 'b':\n      case 'p':\n      case 'P':\n      case 'G':\n      case 'g':\n        // Try to find a SPARQL-style keyword\n        if (match = this._sparqlKeyword.exec(input))\n          type = match[0].toUpperCase();\n        else\n          inconclusive = true;\n        break;\n\n      case 'f':\n      case 't':\n        // Try to match a boolean\n        if (match = this._boolean.exec(input))\n          type = 'literal', value = match[0], prefix = xsd.boolean;\n        else\n          inconclusive = true;\n        break;\n\n      case 'a':\n        // Try to find an abbreviated predicate\n        if (match = this._shortPredicates.exec(input))\n          type = 'abbreviation', value = 'a';\n        else\n          inconclusive = true;\n        break;\n\n      case '=':\n        // Try to find an implication arrow or equals sign\n        if (this._n3Mode && input.length > 1) {\n          type = 'abbreviation';\n          if (input[1] !== '>')\n            matchLength = 1, value = '=';\n          else\n            matchLength = 2, value = '>';\n        }\n        break;\n\n      case '!':\n        if (!this._n3Mode)\n          break;\n      case ',':\n      case ';':\n      case '[':\n      case ']':\n      case '(':\n      case ')':\n      case '}':\n        if (!this._lineMode) {\n          matchLength = 1;\n          type = firstChar;\n        }\n        break;\n      case '{':\n        // We need at least 2 tokens lookahead to distinguish \"{|\" and \"{ \"\n        if (!this._lineMode && input.length >= 2) {\n          // Try to find a quoted triple annotation start\n          if (input[1] === '|')\n            type = '{|', matchLength = 2;\n          else\n            type = firstChar, matchLength = 1;\n        }\n        break;\n      case '|':\n        // We need 2 tokens lookahead to parse \"|}\"\n        // Try to find a quoted triple annotation end\n        if (input.length >= 2 && input[1] === '}')\n          type = '|}', matchLength = 2;\n        break;\n\n      default:\n        inconclusive = true;\n      }\n\n      // Some first characters do not allow an immediate decision, so inspect more\n      if (inconclusive) {\n        // Try to find a prefix\n        if ((this._previousMarker === '@prefix' || this._previousMarker === 'PREFIX') &&\n            (match = this._prefix.exec(input)))\n          type = 'prefix', value = match[1] || '';\n        // Try to find a prefixed name. Since it can contain (but not end with) a dot,\n        // we always need a non-dot character before deciding it is a prefixed name.\n        // Therefore, try inserting a space if we're at the end of the input.\n        else if ((match = this._prefixed.exec(input)) ||\n                 inputFinished && (match = this._prefixed.exec(`${input} `)))\n          type = 'prefixed', prefix = match[1] || '', value = this._unescape(match[2]);\n      }\n\n      // A type token is special: it can only be emitted after an IRI or prefixed name is read\n      if (this._previousMarker === '^^') {\n        switch (type) {\n        case 'prefixed': type = 'type';    break;\n        case 'IRI':      type = 'typeIRI'; break;\n        default:         type = '';\n        }\n      }\n\n      // What if nothing of the above was found?\n      if (!type) {\n        // We could be in streaming mode, and then we just wait for more input to arrive.\n        // Otherwise, a syntax error has occurred in the input.\n        // One exception: error on an unaccounted linebreak (= not inside a triple-quoted literal).\n        if (inputFinished || (!/^'''|^\"\"\"/.test(input) && /\\n|\\r/.test(input)))\n          return reportSyntaxError(this);\n        else\n          return this._input = input;\n      }\n\n      // Emit the parsed token\n      const length = matchLength || match[0].length;\n      const token = emitToken(type, value, prefix, line, length);\n      this.previousToken = token;\n      this._previousMarker = type;\n\n      // Advance to next part to tokenize\n      input = input.substr(length, input.length);\n    }\n\n    // Emits the token through the callback\n    function emitToken(type, value, prefix, line, length) {\n      const start = input ? currentLineLength - input.length : currentLineLength;\n      const end = start + length;\n      const token = { type, value, prefix, line, start, end };\n      callback(null, token);\n      return token;\n    }\n    // Signals the syntax error through the callback\n    function reportSyntaxError(self) { callback(self._syntaxError(/^\\S*/.exec(input)[0])); }\n  }\n\n  // ### `_unescape` replaces N3 escape codes by their corresponding characters\n  _unescape(item) {\n    let invalid = false;\n    const replaced = item.replace(escapeSequence, (sequence, unicode4, unicode8, escapedChar) => {\n      // 4-digit unicode character\n      if (typeof unicode4 === 'string')\n        return String.fromCharCode(Number.parseInt(unicode4, 16));\n      // 8-digit unicode character\n      if (typeof unicode8 === 'string') {\n        let charCode = Number.parseInt(unicode8, 16);\n        return charCode <= 0xFFFF ? String.fromCharCode(Number.parseInt(unicode8, 16)) :\n          String.fromCharCode(0xD800 + ((charCode -= 0x10000) >> 10), 0xDC00 + (charCode & 0x3FF));\n      }\n      // fixed escape sequence\n      if (escapedChar in escapeReplacements)\n        return escapeReplacements[escapedChar];\n      // invalid escape sequence\n      invalid = true;\n      return '';\n    });\n    return invalid ? null : replaced;\n  }\n\n  // ### `_parseLiteral` parses a literal into an unescaped value\n  _parseLiteral(input) {\n    // Ensure we have enough lookahead to identify triple-quoted strings\n    if (input.length >= 3) {\n      // Identify the opening quote(s)\n      const opening = input.match(/^(?:\"\"\"|\"|'''|'|)/)[0];\n      const openingLength = opening.length;\n\n      // Find the next candidate closing quotes\n      let closingPos = Math.max(this._literalClosingPos, openingLength);\n      while ((closingPos = input.indexOf(opening, closingPos)) > 0) {\n        // Count backslashes right before the closing quotes\n        let backslashCount = 0;\n        while (input[closingPos - backslashCount - 1] === '\\\\')\n          backslashCount++;\n\n        // An even number of backslashes (in particular 0)\n        // means these are actual, non-escaped closing quotes\n        if (backslashCount % 2 === 0) {\n          // Extract and unescape the value\n          const raw = input.substring(openingLength, closingPos);\n          const lines = raw.split(/\\r\\n|\\r|\\n/).length - 1;\n          const matchLength = closingPos + openingLength;\n          // Only triple-quoted strings can be multi-line\n          if (openingLength === 1 && lines !== 0 ||\n              openingLength === 3 && this._lineMode)\n            break;\n          this._line += lines;\n          return { value: this._unescape(raw), matchLength };\n        }\n        closingPos++;\n      }\n      this._literalClosingPos = input.length - openingLength + 1;\n    }\n    return { value: '', matchLength: 0 };\n  }\n\n  // ### `_syntaxError` creates a syntax error for the given issue\n  _syntaxError(issue) {\n    this._input = null;\n    const err = new Error(`Unexpected \"${issue}\" on line ${this._line}.`);\n    err.context = {\n      token: undefined,\n      line: this._line,\n      previousToken: this.previousToken,\n    };\n    return err;\n  }\n\n  // ### Strips off any starting UTF BOM mark.\n  _readStartingBom(input) {\n    return input.startsWith('\\ufeff') ? input.substr(1) : input;\n  }\n\n  // ## Public methods\n\n  // ### `tokenize` starts the transformation of an N3 document into an array of tokens.\n  // The input can be a string or a stream.\n  tokenize(input, callback) {\n    this._line = 1;\n\n    // If the input is a string, continuously emit tokens through the callback until the end\n    if (typeof input === 'string') {\n      this._input = this._readStartingBom(input);\n      // If a callback was passed, asynchronously call it\n      if (typeof callback === 'function')\n        queue_microtask__WEBPACK_IMPORTED_MODULE_0___default()(() => this._tokenizeToEnd(callback, true));\n      // If no callback was passed, tokenize synchronously and return\n      else {\n        const tokens = [];\n        let error;\n        this._tokenizeToEnd((e, t) => e ? (error = e) : tokens.push(t), true);\n        if (error) throw error;\n        return tokens;\n      }\n    }\n    // Otherwise, the input must be a stream\n    else {\n      this._pendingBuffer = null;\n      if (typeof input.setEncoding === 'function')\n        input.setEncoding('utf8');\n      // Adds the data chunk to the buffer and parses as far as possible\n      input.on('data', data => {\n        if (this._input !== null && data.length !== 0) {\n          // Prepend any previous pending writes\n          if (this._pendingBuffer) {\n            data = Buffer.concat([this._pendingBuffer, data]);\n            this._pendingBuffer = null;\n          }\n          // Hold if the buffer ends in an incomplete unicode sequence\n          if (data[data.length - 1] & 0x80) {\n            this._pendingBuffer = data;\n          }\n          // Otherwise, tokenize as far as possible\n          else {\n            // Only read a BOM at the start\n            if (typeof this._input === 'undefined')\n              this._input = this._readStartingBom(typeof data === 'string' ? data : data.toString());\n            else\n              this._input += data;\n            this._tokenizeToEnd(callback, false);\n          }\n        }\n      });\n      // Parses until the end\n      input.on('end', () => {\n        if (typeof this._input === 'string')\n          this._tokenizeToEnd(callback, true);\n      });\n      input.on('error', callback);\n    }\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3Lexer.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3Parser.js":
+/*!*****************************************!*\
+  !*** ./node_modules/n3/src/N3Parser.js ***!
+  \*****************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3Parser)\n/* harmony export */ });\n/* harmony import */ var _N3Lexer__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./N3Lexer */ \"./node_modules/n3/src/N3Lexer.js\");\n/* harmony import */ var _N3DataFactory__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./N3DataFactory */ \"./node_modules/n3/src/N3DataFactory.js\");\n/* harmony import */ var _IRIs__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./IRIs */ \"./node_modules/n3/src/IRIs.js\");\n// **N3Parser** parses N3 documents.\n\n\n\n\nlet blankNodePrefix = 0;\n\n// ## Constructor\nclass N3Parser {\n  constructor(options) {\n    this._contextStack = [];\n    this._graph = null;\n\n    // Set the document IRI\n    options = options || {};\n    this._setBase(options.baseIRI);\n    options.factory && initDataFactory(this, options.factory);\n\n    // Set supported features depending on the format\n    const format = (typeof options.format === 'string') ?\n                 options.format.match(/\\w*$/)[0].toLowerCase() : '',\n        isTurtle = /turtle/.test(format), isTriG = /trig/.test(format),\n        isNTriples = /triple/.test(format), isNQuads = /quad/.test(format),\n        isN3 = this._n3Mode = /n3/.test(format),\n        isLineMode = isNTriples || isNQuads;\n    if (!(this._supportsNamedGraphs = !(isTurtle || isN3)))\n      this._readPredicateOrNamedGraph = this._readPredicate;\n    // Support triples in other graphs\n    this._supportsQuads = !(isTurtle || isTriG || isNTriples || isN3);\n    // Support nesting of triples\n    this._supportsRDFStar = format === '' || /star|\\*$/.test(format);\n    // Disable relative IRIs in N-Triples or N-Quads mode\n    if (isLineMode)\n      this._resolveRelativeIRI = iri => { return null; };\n    this._blankNodePrefix = typeof options.blankNodePrefix !== 'string' ? '' :\n                              options.blankNodePrefix.replace(/^(?!_:)/, '_:');\n    this._lexer = options.lexer || new _N3Lexer__WEBPACK_IMPORTED_MODULE_0__[\"default\"]({ lineMode: isLineMode, n3: isN3 });\n    // Disable explicit quantifiers by default\n    this._explicitQuantifiers = !!options.explicitQuantifiers;\n  }\n\n  // ## Static class methods\n\n  // ### `_resetBlankNodePrefix` restarts blank node prefix identification\n  static _resetBlankNodePrefix() {\n    blankNodePrefix = 0;\n  }\n\n  // ## Private methods\n\n  // ### `_setBase` sets the base IRI to resolve relative IRIs\n  _setBase(baseIRI) {\n    if (!baseIRI) {\n      this._base = '';\n      this._basePath = '';\n    }\n    else {\n      // Remove fragment if present\n      const fragmentPos = baseIRI.indexOf('#');\n      if (fragmentPos >= 0)\n        baseIRI = baseIRI.substr(0, fragmentPos);\n      // Set base IRI and its components\n      this._base = baseIRI;\n      this._basePath   = baseIRI.indexOf('/') < 0 ? baseIRI :\n                         baseIRI.replace(/[^\\/?]*(?:\\?.*)?$/, '');\n      baseIRI = baseIRI.match(/^(?:([a-z][a-z0-9+.-]*:))?(?:\\/\\/[^\\/]*)?/i);\n      this._baseRoot   = baseIRI[0];\n      this._baseScheme = baseIRI[1];\n    }\n  }\n\n  // ### `_saveContext` stores the current parsing context\n  // when entering a new scope (list, blank node, formula)\n  _saveContext(type, graph, subject, predicate, object) {\n    const n3Mode = this._n3Mode;\n    this._contextStack.push({\n      type,\n      subject, predicate, object, graph,\n      inverse: n3Mode ? this._inversePredicate : false,\n      blankPrefix: n3Mode ? this._prefixes._ : '',\n      quantified: n3Mode ? this._quantified : null,\n    });\n    // The settings below only apply to N3 streams\n    if (n3Mode) {\n      // Every new scope resets the predicate direction\n      this._inversePredicate = false;\n      // In N3, blank nodes are scoped to a formula\n      // (using a dot as separator, as a blank node label cannot start with it)\n      this._prefixes._ = (this._graph ? `${this._graph.value}.` : '.');\n      // Quantifiers are scoped to a formula\n      this._quantified = Object.create(this._quantified);\n    }\n  }\n\n  // ### `_restoreContext` restores the parent context\n  // when leaving a scope (list, blank node, formula)\n  _restoreContext(type, token) {\n    // Obtain the previous context\n    const context = this._contextStack.pop();\n    if (!context || context.type !== type)\n      return this._error(`Unexpected ${token.type}`, token);\n\n    // Restore the quad of the previous context\n    this._subject   = context.subject;\n    this._predicate = context.predicate;\n    this._object    = context.object;\n    this._graph     = context.graph;\n\n    // Restore N3 context settings\n    if (this._n3Mode) {\n      this._inversePredicate = context.inverse;\n      this._prefixes._ = context.blankPrefix;\n      this._quantified = context.quantified;\n    }\n  }\n\n  // ### `_readInTopContext` reads a token when in the top context\n  _readInTopContext(token) {\n    switch (token.type) {\n    // If an EOF token arrives in the top context, signal that we're done\n    case 'eof':\n      if (this._graph !== null)\n        return this._error('Unclosed graph', token);\n      delete this._prefixes._;\n      return this._callback(null, null, this._prefixes);\n    // It could be a prefix declaration\n    case 'PREFIX':\n      this._sparqlStyle = true;\n    case '@prefix':\n      return this._readPrefix;\n    // It could be a base declaration\n    case 'BASE':\n      this._sparqlStyle = true;\n    case '@base':\n      return this._readBaseIRI;\n    // It could be a graph\n    case '{':\n      if (this._supportsNamedGraphs) {\n        this._graph = '';\n        this._subject = null;\n        return this._readSubject;\n      }\n    case 'GRAPH':\n      if (this._supportsNamedGraphs)\n        return this._readNamedGraphLabel;\n    // Otherwise, the next token must be a subject\n    default:\n      return this._readSubject(token);\n    }\n  }\n\n  // ### `_readEntity` reads an IRI, prefixed name, blank node, or variable\n  _readEntity(token, quantifier) {\n    let value;\n    switch (token.type) {\n    // Read a relative or absolute IRI\n    case 'IRI':\n    case 'typeIRI':\n      const iri = this._resolveIRI(token.value);\n      if (iri === null)\n        return this._error('Invalid IRI', token);\n      value = this._namedNode(iri);\n      break;\n    // Read a prefixed name\n    case 'type':\n    case 'prefixed':\n      const prefix = this._prefixes[token.prefix];\n      if (prefix === undefined)\n        return this._error(`Undefined prefix \"${token.prefix}:\"`, token);\n      value = this._namedNode(prefix + token.value);\n      break;\n    // Read a blank node\n    case 'blank':\n      value = this._blankNode(this._prefixes[token.prefix] + token.value);\n      break;\n    // Read a variable\n    case 'var':\n      value = this._variable(token.value.substr(1));\n      break;\n    // Everything else is not an entity\n    default:\n      return this._error(`Expected entity but got ${token.type}`, token);\n    }\n    // In N3 mode, replace the entity if it is quantified\n    if (!quantifier && this._n3Mode && (value.id in this._quantified))\n      value = this._quantified[value.id];\n    return value;\n  }\n\n  // ### `_readSubject` reads a quad's subject\n  _readSubject(token) {\n    this._predicate = null;\n    switch (token.type) {\n    case '[':\n      // Start a new quad with a new blank node as subject\n      this._saveContext('blank', this._graph,\n                        this._subject = this._blankNode(), null, null);\n      return this._readBlankNodeHead;\n    case '(':\n      // Start a new list\n      this._saveContext('list', this._graph, this.RDF_NIL, null, null);\n      this._subject = null;\n      return this._readListItem;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph,\n                        this._graph = this._blankNode(), null, null);\n      return this._readSubject;\n    case '}':\n       // No subject; the graph in which we are reading is closed instead\n      return this._readPunctuation(token);\n    case '@forSome':\n      if (!this._n3Mode)\n        return this._error('Unexpected \"@forSome\"', token);\n      this._subject = null;\n      this._predicate = this.N3_FORSOME;\n      this._quantifier = this._blankNode;\n      return this._readQuantifierList;\n    case '@forAll':\n      if (!this._n3Mode)\n        return this._error('Unexpected \"@forAll\"', token);\n      this._subject = null;\n      this._predicate = this.N3_FORALL;\n      this._quantifier = this._variable;\n      return this._readQuantifierList;\n    case 'literal':\n      if (!this._n3Mode)\n        return this._error('Unexpected literal', token);\n\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        return this._completeSubjectLiteral;\n      }\n      else\n        this._subject = this._literal(token.value, this._namedNode(token.prefix));\n\n      break;\n    case '<<':\n      if (!this._supportsRDFStar)\n        return this._error('Unexpected RDF* syntax', token);\n      this._saveContext('<<', this._graph, null, null, null);\n      this._graph = null;\n      return this._readSubject;\n    default:\n      // Read the subject entity\n      if ((this._subject = this._readEntity(token)) === undefined)\n        return;\n      // In N3 mode, the subject might be a path\n      if (this._n3Mode)\n        return this._getPathReader(this._readPredicateOrNamedGraph);\n    }\n\n    // The next token must be a predicate,\n    // or, if the subject was actually a graph IRI, a named graph\n    return this._readPredicateOrNamedGraph;\n  }\n\n  // ### `_readPredicate` reads a quad's predicate\n  _readPredicate(token) {\n    const type = token.type;\n    switch (type) {\n    case 'inverse':\n      this._inversePredicate = true;\n    case 'abbreviation':\n      this._predicate = this.ABBREVIATIONS[token.value];\n      break;\n    case '.':\n    case ']':\n    case '}':\n      // Expected predicate didn't come, must have been trailing semicolon\n      if (this._predicate === null)\n        return this._error(`Unexpected ${type}`, token);\n      this._subject = null;\n      return type === ']' ? this._readBlankNodeTail(token) : this._readPunctuation(token);\n    case ';':\n      // Additional semicolons can be safely ignored\n      return this._predicate !== null ? this._readPredicate :\n             this._error('Expected predicate but got ;', token);\n    case '[':\n      if (this._n3Mode) {\n        // Start a new quad with a new blank node as subject\n        this._saveContext('blank', this._graph, this._subject,\n                          this._subject = this._blankNode(), null);\n        return this._readBlankNodeHead;\n      }\n    case 'blank':\n      if (!this._n3Mode)\n        return this._error('Disallowed blank node as predicate', token);\n    default:\n      if ((this._predicate = this._readEntity(token)) === undefined)\n        return;\n    }\n    // The next token must be an object\n    return this._readObject;\n  }\n\n  // ### `_readObject` reads a quad's object\n  _readObject(token) {\n    switch (token.type) {\n    case 'literal':\n      // Regular literal, can still get a datatype or language\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        return this._readDataTypeOrLang;\n      }\n      // Pre-datatyped string literal (prefix stores the datatype)\n      else\n        this._object = this._literal(token.value, this._namedNode(token.prefix));\n      break;\n    case '[':\n      // Start a new quad with a new blank node as subject\n      this._saveContext('blank', this._graph, this._subject, this._predicate,\n                        this._subject = this._blankNode());\n      return this._readBlankNodeHead;\n    case '(':\n      // Start a new list\n      this._saveContext('list', this._graph, this._subject, this._predicate, this.RDF_NIL);\n      this._subject = null;\n      return this._readListItem;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph, this._subject, this._predicate,\n                        this._graph = this._blankNode());\n      return this._readSubject;\n    case '<<':\n      if (!this._supportsRDFStar)\n        return this._error('Unexpected RDF* syntax', token);\n      this._saveContext('<<', this._graph, this._subject, this._predicate, null);\n      this._graph = null;\n      return this._readSubject;\n    default:\n      // Read the object entity\n      if ((this._object = this._readEntity(token)) === undefined)\n        return;\n      // In N3 mode, the object might be a path\n      if (this._n3Mode)\n        return this._getPathReader(this._getContextEndReader());\n    }\n    return this._getContextEndReader();\n  }\n\n  // ### `_readPredicateOrNamedGraph` reads a quad's predicate, or a named graph\n  _readPredicateOrNamedGraph(token) {\n    return token.type === '{' ? this._readGraph(token) : this._readPredicate(token);\n  }\n\n  // ### `_readGraph` reads a graph\n  _readGraph(token) {\n    if (token.type !== '{')\n      return this._error(`Expected graph but got ${token.type}`, token);\n    // The \"subject\" we read is actually the GRAPH's label\n    this._graph = this._subject, this._subject = null;\n    return this._readSubject;\n  }\n\n  // ### `_readBlankNodeHead` reads the head of a blank node\n  _readBlankNodeHead(token) {\n    if (token.type === ']') {\n      this._subject = null;\n      return this._readBlankNodeTail(token);\n    }\n    else {\n      this._predicate = null;\n      return this._readPredicate(token);\n    }\n  }\n\n  // ### `_readBlankNodeTail` reads the end of a blank node\n  _readBlankNodeTail(token) {\n    if (token.type !== ']')\n      return this._readBlankNodePunctuation(token);\n\n    // Store blank node quad\n    if (this._subject !== null)\n      this._emit(this._subject, this._predicate, this._object, this._graph);\n\n    // Restore the parent context containing this blank node\n    const empty = this._predicate === null;\n    this._restoreContext('blank', token);\n    // If the blank node was the object, restore previous context and read punctuation\n    if (this._object !== null)\n      return this._getContextEndReader();\n    // If the blank node was the predicate, continue reading the object\n    else if (this._predicate !== null)\n      return this._readObject;\n    // If the blank node was the subject, continue reading the predicate\n    else\n      // If the blank node was empty, it could be a named graph label\n      return empty ? this._readPredicateOrNamedGraph : this._readPredicateAfterBlank;\n  }\n\n  // ### `_readPredicateAfterBlank` reads a predicate after an anonymous blank node\n  _readPredicateAfterBlank(token) {\n    switch (token.type) {\n    case '.':\n    case '}':\n      // No predicate is coming if the triple is terminated here\n      this._subject = null;\n      return this._readPunctuation(token);\n    default:\n      return this._readPredicate(token);\n    }\n  }\n\n  // ### `_readListItem` reads items from a list\n  _readListItem(token) {\n    let item = null,                      // The item of the list\n        list = null,                      // The list itself\n        next = this._readListItem;        // The next function to execute\n    const previousList = this._subject,   // The previous list that contains this list\n        stack = this._contextStack,       // The stack of parent contexts\n        parent = stack[stack.length - 1]; // The parent containing the current list\n\n    switch (token.type) {\n    case '[':\n      // Stack the current list quad and start a new quad with a blank node as subject\n      this._saveContext('blank', this._graph,\n                        list = this._blankNode(), this.RDF_FIRST,\n                        this._subject = item = this._blankNode());\n      next = this._readBlankNodeHead;\n      break;\n    case '(':\n      // Stack the current list quad and start a new list\n      this._saveContext('list', this._graph,\n                        list = this._blankNode(), this.RDF_FIRST, this.RDF_NIL);\n      this._subject = null;\n      break;\n    case ')':\n      // Closing the list; restore the parent context\n      this._restoreContext('list', token);\n      // If this list is contained within a parent list, return the membership quad here.\n      // This will be `<parent list element> rdf:first <this list>.`.\n      if (stack.length !== 0 && stack[stack.length - 1].type === 'list')\n        this._emit(this._subject, this._predicate, this._object, this._graph);\n      // Was this list the parent's subject?\n      if (this._predicate === null) {\n        // The next token is the predicate\n        next = this._readPredicate;\n        // No list tail if this was an empty list\n        if (this._subject === this.RDF_NIL)\n          return next;\n      }\n      // The list was in the parent context's object\n      else {\n        next = this._getContextEndReader();\n        // No list tail if this was an empty list\n        if (this._object === this.RDF_NIL)\n          return next;\n      }\n      // Close the list by making the head nil\n      list = this.RDF_NIL;\n      break;\n    case 'literal':\n      // Regular literal, can still get a datatype or language\n      if (token.prefix.length === 0) {\n        this._literalValue = token.value;\n        next = this._readListItemDataTypeOrLang;\n      }\n      // Pre-datatyped string literal (prefix stores the datatype)\n      else {\n        item = this._literal(token.value, this._namedNode(token.prefix));\n        next = this._getContextEndReader();\n      }\n      break;\n    case '{':\n      // Start a new formula\n      if (!this._n3Mode)\n        return this._error('Unexpected graph', token);\n      this._saveContext('formula', this._graph, this._subject, this._predicate,\n                        this._graph = this._blankNode());\n      return this._readSubject;\n    default:\n      if ((item = this._readEntity(token)) === undefined)\n        return;\n    }\n\n     // Create a new blank node if no item head was assigned yet\n    if (list === null)\n      this._subject = list = this._blankNode();\n\n    // Is this the first element of the list?\n    if (previousList === null) {\n      // This list is either the subject or the object of its parent\n      if (parent.predicate === null)\n        parent.subject = list;\n      else\n        parent.object = list;\n    }\n    else {\n      // Continue the previous list with the current list\n      this._emit(previousList, this.RDF_REST, list, this._graph);\n    }\n    // If an item was read, add it to the list\n    if (item !== null) {\n      // In N3 mode, the item might be a path\n      if (this._n3Mode && (token.type === 'IRI' || token.type === 'prefixed')) {\n        // Create a new context to add the item's path\n        this._saveContext('item', this._graph, list, this.RDF_FIRST, item);\n        this._subject = item, this._predicate = null;\n        // _readPath will restore the context and output the item\n        return this._getPathReader(this._readListItem);\n      }\n      // Output the item\n      this._emit(list, this.RDF_FIRST, item, this._graph);\n    }\n    return next;\n  }\n\n  // ### `_readDataTypeOrLang` reads an _optional_ datatype or language\n  _readDataTypeOrLang(token) {\n    return this._completeObjectLiteral(token, false);\n  }\n\n\n  // ### `_readListItemDataTypeOrLang` reads an _optional_ datatype or language in a list\n  _readListItemDataTypeOrLang(token) {\n    return this._completeObjectLiteral(token, true);\n  }\n\n  // ### `_completeLiteral` completes a literal with an optional datatype or language\n  _completeLiteral(token) {\n    // Create a simple string literal by default\n    let literal = this._literal(this._literalValue);\n\n    switch (token.type) {\n    // Create a datatyped literal\n    case 'type':\n    case 'typeIRI':\n      const datatype = this._readEntity(token);\n      if (datatype === undefined) return; // No datatype means an error occurred\n      literal = this._literal(this._literalValue, datatype);\n      token = null;\n      break;\n    // Create a language-tagged string\n    case 'langcode':\n      literal = this._literal(this._literalValue, token.value);\n      token = null;\n      break;\n    }\n\n    return { token, literal };\n  }\n\n  // Completes a literal in subject position\n  _completeSubjectLiteral(token) {\n    this._subject = this._completeLiteral(token).literal;\n    return this._readPredicateOrNamedGraph;\n  }\n\n  // Completes a literal in object position\n  _completeObjectLiteral(token, listItem) {\n    const completed = this._completeLiteral(token);\n    if (!completed)\n      return;\n    this._object = completed.literal;\n\n    // If this literal was part of a list, write the item\n    // (we could also check the context stack, but passing in a flag is faster)\n    if (listItem)\n      this._emit(this._subject, this.RDF_FIRST, this._object, this._graph);\n    // If the token was consumed, continue with the rest of the input\n    if (completed.token === null)\n      return this._getContextEndReader();\n    // Otherwise, consume the token now\n    else {\n      this._readCallback = this._getContextEndReader();\n      return this._readCallback(completed.token);\n    }\n  }\n\n  // ### `_readFormulaTail` reads the end of a formula\n  _readFormulaTail(token) {\n    if (token.type !== '}')\n      return this._readPunctuation(token);\n\n    // Store the last quad of the formula\n    if (this._subject !== null)\n      this._emit(this._subject, this._predicate, this._object, this._graph);\n\n    // Restore the parent context containing this formula\n    this._restoreContext('formula', token);\n    // If the formula was the subject, continue reading the predicate.\n    // If the formula was the object, read punctuation.\n    return this._object === null ? this._readPredicate : this._getContextEndReader();\n  }\n\n  // ### `_readPunctuation` reads punctuation between quads or quad parts\n  _readPunctuation(token) {\n    let next, graph = this._graph;\n    const subject = this._subject, inversePredicate = this._inversePredicate;\n    switch (token.type) {\n    // A closing brace ends a graph\n    case '}':\n      if (this._graph === null)\n        return this._error('Unexpected graph closing', token);\n      if (this._n3Mode)\n        return this._readFormulaTail(token);\n      this._graph = null;\n    // A dot just ends the statement, without sharing anything with the next\n    case '.':\n      this._subject = null;\n      next = this._contextStack.length ? this._readSubject : this._readInTopContext;\n      if (inversePredicate) this._inversePredicate = false;\n      break;\n    // Semicolon means the subject is shared; predicate and object are different\n    case ';':\n      next = this._readPredicate;\n      break;\n    // Comma means both the subject and predicate are shared; the object is different\n    case ',':\n      next = this._readObject;\n      break;\n    // {| means that the current triple is annotated with predicate-object pairs.\n    case '{|':\n      if (!this._supportsRDFStar)\n        return this._error('Unexpected RDF* syntax', token);\n      // Continue using the last triple as quoted triple subject for the predicate-object pairs.\n      const predicate = this._predicate, object = this._object;\n      this._subject = this._quad(subject, predicate, object, this.DEFAULTGRAPH);\n      next = this._readPredicate;\n      break;\n    // |} means that the current quoted triple in annotation syntax is finalized.\n    case '|}':\n      if (this._subject.termType !== 'Quad')\n        return this._error('Unexpected asserted triple closing', token);\n      this._subject = null;\n      next = this._readPunctuation;\n      break;\n    default:\n      // An entity means this is a quad (only allowed if not already inside a graph)\n      if (this._supportsQuads && this._graph === null && (graph = this._readEntity(token)) !== undefined) {\n        next = this._readQuadPunctuation;\n        break;\n      }\n      return this._error(`Expected punctuation to follow \"${this._object.id}\"`, token);\n    }\n    // A quad has been completed now, so return it\n    if (subject !== null) {\n      const predicate = this._predicate, object = this._object;\n      if (!inversePredicate)\n        this._emit(subject, predicate, object,  graph);\n      else\n        this._emit(object,  predicate, subject, graph);\n    }\n    return next;\n  }\n\n    // ### `_readBlankNodePunctuation` reads punctuation in a blank node\n  _readBlankNodePunctuation(token) {\n    let next;\n    switch (token.type) {\n    // Semicolon means the subject is shared; predicate and object are different\n    case ';':\n      next = this._readPredicate;\n      break;\n    // Comma means both the subject and predicate are shared; the object is different\n    case ',':\n      next = this._readObject;\n      break;\n    default:\n      return this._error(`Expected punctuation to follow \"${this._object.id}\"`, token);\n    }\n    // A quad has been completed now, so return it\n    this._emit(this._subject, this._predicate, this._object, this._graph);\n    return next;\n  }\n\n  // ### `_readQuadPunctuation` reads punctuation after a quad\n  _readQuadPunctuation(token) {\n    if (token.type !== '.')\n      return this._error('Expected dot to follow quad', token);\n    return this._readInTopContext;\n  }\n\n  // ### `_readPrefix` reads the prefix of a prefix declaration\n  _readPrefix(token) {\n    if (token.type !== 'prefix')\n      return this._error('Expected prefix to follow @prefix', token);\n    this._prefix = token.value;\n    return this._readPrefixIRI;\n  }\n\n  // ### `_readPrefixIRI` reads the IRI of a prefix declaration\n  _readPrefixIRI(token) {\n    if (token.type !== 'IRI')\n      return this._error(`Expected IRI to follow prefix \"${this._prefix}:\"`, token);\n    const prefixNode = this._readEntity(token);\n    this._prefixes[this._prefix] = prefixNode.value;\n    this._prefixCallback(this._prefix, prefixNode);\n    return this._readDeclarationPunctuation;\n  }\n\n  // ### `_readBaseIRI` reads the IRI of a base declaration\n  _readBaseIRI(token) {\n    const iri = token.type === 'IRI' && this._resolveIRI(token.value);\n    if (!iri)\n      return this._error('Expected valid IRI to follow base declaration', token);\n    this._setBase(iri);\n    return this._readDeclarationPunctuation;\n  }\n\n  // ### `_readNamedGraphLabel` reads the label of a named graph\n  _readNamedGraphLabel(token) {\n    switch (token.type) {\n    case 'IRI':\n    case 'blank':\n    case 'prefixed':\n      return this._readSubject(token), this._readGraph;\n    case '[':\n      return this._readNamedGraphBlankLabel;\n    default:\n      return this._error('Invalid graph label', token);\n    }\n  }\n\n  // ### `_readNamedGraphLabel` reads a blank node label of a named graph\n  _readNamedGraphBlankLabel(token) {\n    if (token.type !== ']')\n      return this._error('Invalid graph label', token);\n    this._subject = this._blankNode();\n    return this._readGraph;\n  }\n\n  // ### `_readDeclarationPunctuation` reads the punctuation of a declaration\n  _readDeclarationPunctuation(token) {\n    // SPARQL-style declarations don't have punctuation\n    if (this._sparqlStyle) {\n      this._sparqlStyle = false;\n      return this._readInTopContext(token);\n    }\n\n    if (token.type !== '.')\n      return this._error('Expected declaration to end with a dot', token);\n    return this._readInTopContext;\n  }\n\n  // Reads a list of quantified symbols from a @forSome or @forAll statement\n  _readQuantifierList(token) {\n    let entity;\n    switch (token.type) {\n    case 'IRI':\n    case 'prefixed':\n      if ((entity = this._readEntity(token, true)) !== undefined)\n        break;\n    default:\n      return this._error(`Unexpected ${token.type}`, token);\n    }\n    // Without explicit quantifiers, map entities to a quantified entity\n    if (!this._explicitQuantifiers)\n      this._quantified[entity.id] = this._quantifier(this._blankNode().value);\n    // With explicit quantifiers, output the reified quantifier\n    else {\n      // If this is the first item, start a new quantifier list\n      if (this._subject === null)\n        this._emit(this._graph || this.DEFAULTGRAPH, this._predicate,\n                   this._subject = this._blankNode(), this.QUANTIFIERS_GRAPH);\n      // Otherwise, continue the previous list\n      else\n        this._emit(this._subject, this.RDF_REST,\n                   this._subject = this._blankNode(), this.QUANTIFIERS_GRAPH);\n      // Output the list item\n      this._emit(this._subject, this.RDF_FIRST, entity, this.QUANTIFIERS_GRAPH);\n    }\n    return this._readQuantifierPunctuation;\n  }\n\n  // Reads punctuation from a @forSome or @forAll statement\n  _readQuantifierPunctuation(token) {\n    // Read more quantifiers\n    if (token.type === ',')\n      return this._readQuantifierList;\n    // End of the quantifier list\n    else {\n      // With explicit quantifiers, close the quantifier list\n      if (this._explicitQuantifiers) {\n        this._emit(this._subject, this.RDF_REST, this.RDF_NIL, this.QUANTIFIERS_GRAPH);\n        this._subject = null;\n      }\n      // Read a dot\n      this._readCallback = this._getContextEndReader();\n      return this._readCallback(token);\n    }\n  }\n\n  // ### `_getPathReader` reads a potential path and then resumes with the given function\n  _getPathReader(afterPath) {\n    this._afterPath = afterPath;\n    return this._readPath;\n  }\n\n  // ### `_readPath` reads a potential path\n  _readPath(token) {\n    switch (token.type) {\n    // Forward path\n    case '!': return this._readForwardPath;\n    // Backward path\n    case '^': return this._readBackwardPath;\n    // Not a path; resume reading where we left off\n    default:\n      const stack = this._contextStack, parent = stack.length && stack[stack.length - 1];\n      // If we were reading a list item, we still need to output it\n      if (parent && parent.type === 'item') {\n        // The list item is the remaining subejct after reading the path\n        const item = this._subject;\n        // Switch back to the context of the list\n        this._restoreContext('item', token);\n        // Output the list item\n        this._emit(this._subject, this.RDF_FIRST, item, this._graph);\n      }\n      return this._afterPath(token);\n    }\n  }\n\n  // ### `_readForwardPath` reads a '!' path\n  _readForwardPath(token) {\n    let subject, predicate;\n    const object = this._blankNode();\n    // The next token is the predicate\n    if ((predicate = this._readEntity(token)) === undefined)\n      return;\n    // If we were reading a subject, replace the subject by the path's object\n    if (this._predicate === null)\n      subject = this._subject, this._subject = object;\n    // If we were reading an object, replace the subject by the path's object\n    else\n      subject = this._object,  this._object  = object;\n    // Emit the path's current quad and read its next section\n    this._emit(subject, predicate, object, this._graph);\n    return this._readPath;\n  }\n\n  // ### `_readBackwardPath` reads a '^' path\n  _readBackwardPath(token) {\n    const subject = this._blankNode();\n    let predicate, object;\n    // The next token is the predicate\n    if ((predicate = this._readEntity(token)) === undefined)\n      return;\n    // If we were reading a subject, replace the subject by the path's subject\n    if (this._predicate === null)\n      object = this._subject, this._subject = subject;\n    // If we were reading an object, replace the subject by the path's subject\n    else\n      object = this._object,  this._object  = subject;\n    // Emit the path's current quad and read its next section\n    this._emit(subject, predicate, object, this._graph);\n    return this._readPath;\n  }\n\n  // ### `_readRDFStarTailOrGraph` reads the graph of a nested RDF* quad or the end of a nested RDF* triple\n  _readRDFStarTailOrGraph(token) {\n    if (token.type !== '>>') {\n      // An entity means this is a quad (only allowed if not already inside a graph)\n      if (this._supportsQuads && this._graph === null && (this._graph = this._readEntity(token)) !== undefined)\n        return this._readRDFStarTail;\n      return this._error(`Expected >> to follow \"${this._object.id}\"`, token);\n    }\n    return this._readRDFStarTail(token);\n  }\n\n  // ### `_readRDFStarTail` reads the end of a nested RDF* triple\n  _readRDFStarTail(token) {\n    if (token.type !== '>>')\n      return this._error(`Expected >> but got ${token.type}`, token);\n    // Read the quad and restore the previous context\n    const quad = this._quad(this._subject, this._predicate, this._object,\n      this._graph || this.DEFAULTGRAPH);\n    this._restoreContext('<<', token);\n    // If the triple was the subject, continue by reading the predicate.\n    if (this._subject === null) {\n      this._subject = quad;\n      return this._readPredicate;\n    }\n    // If the triple was the object, read context end.\n    else {\n      this._object = quad;\n      return this._getContextEndReader();\n    }\n  }\n\n  // ### `_getContextEndReader` gets the next reader function at the end of a context\n  _getContextEndReader() {\n    const contextStack = this._contextStack;\n    if (!contextStack.length)\n      return this._readPunctuation;\n\n    switch (contextStack[contextStack.length - 1].type) {\n    case 'blank':\n      return this._readBlankNodeTail;\n    case 'list':\n      return this._readListItem;\n    case 'formula':\n      return this._readFormulaTail;\n    case '<<':\n      return this._readRDFStarTailOrGraph;\n    }\n  }\n\n  // ### `_emit` sends a quad through the callback\n  _emit(subject, predicate, object, graph) {\n    this._callback(null, this._quad(subject, predicate, object, graph || this.DEFAULTGRAPH));\n  }\n\n  // ### `_error` emits an error message through the callback\n  _error(message, token) {\n    const err = new Error(`${message} on line ${token.line}.`);\n    err.context = {\n      token: token,\n      line: token.line,\n      previousToken: this._lexer.previousToken,\n    };\n    this._callback(err);\n    this._callback = noop;\n  }\n\n  // ### `_resolveIRI` resolves an IRI against the base path\n  _resolveIRI(iri) {\n    return /^[a-z][a-z0-9+.-]*:/i.test(iri) ? iri : this._resolveRelativeIRI(iri);\n  }\n\n  // ### `_resolveRelativeIRI` resolves an IRI against the base path,\n  // assuming that a base path has been set and that the IRI is indeed relative\n  _resolveRelativeIRI(iri) {\n    // An empty relative IRI indicates the base IRI\n    if (!iri.length)\n      return this._base;\n    // Decide resolving strategy based in the first character\n    switch (iri[0]) {\n    // Resolve relative fragment IRIs against the base IRI\n    case '#': return this._base + iri;\n    // Resolve relative query string IRIs by replacing the query string\n    case '?': return this._base.replace(/(?:\\?.*)?$/, iri);\n    // Resolve root-relative IRIs at the root of the base IRI\n    case '/':\n      // Resolve scheme-relative IRIs to the scheme\n      return (iri[1] === '/' ? this._baseScheme : this._baseRoot) + this._removeDotSegments(iri);\n    // Resolve all other IRIs at the base IRI's path\n    default:\n      // Relative IRIs cannot contain a colon in the first path segment\n      return (/^[^/:]*:/.test(iri)) ? null : this._removeDotSegments(this._basePath + iri);\n    }\n  }\n\n  // ### `_removeDotSegments` resolves './' and '../' path segments in an IRI as per RFC3986\n  _removeDotSegments(iri) {\n    // Don't modify the IRI if it does not contain any dot segments\n    if (!/(^|\\/)\\.\\.?($|[/#?])/.test(iri))\n      return iri;\n\n    // Start with an imaginary slash before the IRI in order to resolve trailing './' and '../'\n    const length = iri.length;\n    let result = '', i = -1, pathStart = -1, segmentStart = 0, next = '/';\n\n    while (i < length) {\n      switch (next) {\n      // The path starts with the first slash after the authority\n      case ':':\n        if (pathStart < 0) {\n          // Skip two slashes before the authority\n          if (iri[++i] === '/' && iri[++i] === '/')\n            // Skip to slash after the authority\n            while ((pathStart = i + 1) < length && iri[pathStart] !== '/')\n              i = pathStart;\n        }\n        break;\n      // Don't modify a query string or fragment\n      case '?':\n      case '#':\n        i = length;\n        break;\n      // Handle '/.' or '/..' path segments\n      case '/':\n        if (iri[i + 1] === '.') {\n          next = iri[++i + 1];\n          switch (next) {\n          // Remove a '/.' segment\n          case '/':\n            result += iri.substring(segmentStart, i - 1);\n            segmentStart = i + 1;\n            break;\n          // Remove a trailing '/.' segment\n          case undefined:\n          case '?':\n          case '#':\n            return result + iri.substring(segmentStart, i) + iri.substr(i + 1);\n          // Remove a '/..' segment\n          case '.':\n            next = iri[++i + 1];\n            if (next === undefined || next === '/' || next === '?' || next === '#') {\n              result += iri.substring(segmentStart, i - 2);\n              // Try to remove the parent path from result\n              if ((segmentStart = result.lastIndexOf('/')) >= pathStart)\n                result = result.substr(0, segmentStart);\n              // Remove a trailing '/..' segment\n              if (next !== '/')\n                return `${result}/${iri.substr(i + 1)}`;\n              segmentStart = i + 1;\n            }\n          }\n        }\n      }\n      next = iri[++i];\n    }\n    return result + iri.substring(segmentStart);\n  }\n\n  // ## Public methods\n\n  // ### `parse` parses the N3 input and emits each parsed quad through the callback\n  parse(input, quadCallback, prefixCallback) {\n    // The read callback is the next function to be executed when a token arrives.\n    // We start reading in the top context.\n    this._readCallback = this._readInTopContext;\n    this._sparqlStyle = false;\n    this._prefixes = Object.create(null);\n    this._prefixes._ = this._blankNodePrefix ? this._blankNodePrefix.substr(2)\n                                             : `b${blankNodePrefix++}_`;\n    this._prefixCallback = prefixCallback || noop;\n    this._inversePredicate = false;\n    this._quantified = Object.create(null);\n\n    // Parse synchronously if no quad callback is given\n    if (!quadCallback) {\n      const quads = [];\n      let error;\n      this._callback = (e, t) => { e ? (error = e) : t && quads.push(t); };\n      this._lexer.tokenize(input).every(token => {\n        return this._readCallback = this._readCallback(token);\n      });\n      if (error) throw error;\n      return quads;\n    }\n\n    // Parse asynchronously otherwise, executing the read callback when a token arrives\n    this._callback = quadCallback;\n    this._lexer.tokenize(input, (error, token) => {\n      if (error !== null)\n        this._callback(error), this._callback = noop;\n      else if (this._readCallback)\n        this._readCallback = this._readCallback(token);\n    });\n  }\n}\n\n// The empty function\nfunction noop() {}\n\n// Initializes the parser with the given data factory\nfunction initDataFactory(parser, factory) {\n  // Set factory methods\n  const namedNode = factory.namedNode;\n  parser._namedNode   = namedNode;\n  parser._blankNode   = factory.blankNode;\n  parser._literal     = factory.literal;\n  parser._variable    = factory.variable;\n  parser._quad        = factory.quad;\n  parser.DEFAULTGRAPH = factory.defaultGraph();\n\n  // Set common named nodes\n  parser.RDF_FIRST  = namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].rdf.first);\n  parser.RDF_REST   = namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].rdf.rest);\n  parser.RDF_NIL    = namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].rdf.nil);\n  parser.N3_FORALL  = namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].r.forAll);\n  parser.N3_FORSOME = namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].r.forSome);\n  parser.ABBREVIATIONS = {\n    'a': namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].rdf.type),\n    '=': namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].owl.sameAs),\n    '>': namedNode(_IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"].log.implies),\n  };\n  parser.QUANTIFIERS_GRAPH = namedNode('urn:n3:quantifiers');\n}\ninitDataFactory(N3Parser.prototype, _N3DataFactory__WEBPACK_IMPORTED_MODULE_2__[\"default\"]);\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3Parser.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3Store.js":
+/*!****************************************!*\
+  !*** ./node_modules/n3/src/N3Store.js ***!
+  \****************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3Store)\n/* harmony export */ });\n/* harmony import */ var _N3DataFactory__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./N3DataFactory */ \"./node_modules/n3/src/N3DataFactory.js\");\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! readable-stream */ \"./node_modules/readable-stream/lib/ours/browser.js\");\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(readable_stream__WEBPACK_IMPORTED_MODULE_0__);\n/* harmony import */ var _IRIs__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./IRIs */ \"./node_modules/n3/src/IRIs.js\");\n// **N3Store** objects store N3 quads by graph in memory.\n\n\n\n\n// ## Constructor\nclass N3Store {\n  constructor(quads, options) {\n    // The number of quads is initially zero\n    this._size = 0;\n    // `_graphs` contains subject, predicate, and object indexes per graph\n    this._graphs = Object.create(null);\n    // `_ids` maps entities such as `http://xmlns.com/foaf/0.1/name` to numbers,\n    // saving memory by using only numbers as keys in `_graphs`\n    this._id = 0;\n    this._ids = Object.create(null);\n    this._ids['><'] = 0; // dummy entry, so the first actual key is non-zero\n    this._entities = Object.create(null); // inverse of `_ids`\n    // `_blankNodeIndex` is the index of the last automatically named blank node\n    this._blankNodeIndex = 0;\n\n    // Shift parameters if `quads` is not given\n    if (!options && quads && !quads[0])\n      options = quads, quads = null;\n    options = options || {};\n    this._factory = options.factory || _N3DataFactory__WEBPACK_IMPORTED_MODULE_1__[\"default\"];\n\n    // Add quads if passed\n    if (quads)\n      this.addQuads(quads);\n  }\n\n  // ## Public properties\n\n  // ### `size` returns the number of quads in the store\n  get size() {\n    // Return the quad count if if was cached\n    let size = this._size;\n    if (size !== null)\n      return size;\n\n    // Calculate the number of quads by counting to the deepest level\n    size = 0;\n    const graphs = this._graphs;\n    let subjects, subject;\n    for (const graphKey in graphs)\n      for (const subjectKey in (subjects = graphs[graphKey].subjects))\n        for (const predicateKey in (subject = subjects[subjectKey]))\n          size += Object.keys(subject[predicateKey]).length;\n    return this._size = size;\n  }\n\n  // ## Private methods\n\n  // ### `_addToIndex` adds a quad to a three-layered index.\n  // Returns if the index has changed, if the entry did not already exist.\n  _addToIndex(index0, key0, key1, key2) {\n    // Create layers as necessary\n    const index1 = index0[key0] || (index0[key0] = {});\n    const index2 = index1[key1] || (index1[key1] = {});\n    // Setting the key to _any_ value signals the presence of the quad\n    const existed = key2 in index2;\n    if (!existed)\n      index2[key2] = null;\n    return !existed;\n  }\n\n  // ### `_removeFromIndex` removes a quad from a three-layered index\n  _removeFromIndex(index0, key0, key1, key2) {\n    // Remove the quad from the index\n    const index1 = index0[key0], index2 = index1[key1];\n    delete index2[key2];\n\n    // Remove intermediary index layers if they are empty\n    for (const key in index2) return;\n    delete index1[key1];\n    for (const key in index1) return;\n    delete index0[key0];\n  }\n\n  // ### `_findInIndex` finds a set of quads in a three-layered index.\n  // The index base is `index0` and the keys at each level are `key0`, `key1`, and `key2`.\n  // Any of these keys can be undefined, which is interpreted as a wildcard.\n  // `name0`, `name1`, and `name2` are the names of the keys at each level,\n  // used when reconstructing the resulting quad\n  // (for instance: _subject_, _predicate_, and _object_).\n  // Finally, `graphId` will be the graph of the created quads.\n  *_findInIndex(index0, key0, key1, key2, name0, name1, name2, graphId) {\n    let tmp, index1, index2;\n    const entityKeys = this._entities;\n    const graph = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termFromId)(graphId, this._factory);\n    const parts = { subject: null, predicate: null, object: null };\n\n    // If a key is specified, use only that part of index 0.\n    if (key0) (tmp = index0, index0 = {})[key0] = tmp[key0];\n    for (const value0 in index0) {\n      if (index1 = index0[value0]) {\n        parts[name0] = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termFromId)(entityKeys[value0], this._factory);\n        // If a key is specified, use only that part of index 1.\n        if (key1) (tmp = index1, index1 = {})[key1] = tmp[key1];\n        for (const value1 in index1) {\n          if (index2 = index1[value1]) {\n            parts[name1] = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termFromId)(entityKeys[value1], this._factory);\n            // If a key is specified, use only that part of index 2, if it exists.\n            const values = key2 ? (key2 in index2 ? [key2] : []) : Object.keys(index2);\n            // Create quads for all items found in index 2.\n            for (let l = 0; l < values.length; l++) {\n              parts[name2] = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termFromId)(entityKeys[values[l]], this._factory);\n              yield this._factory.quad(parts.subject, parts.predicate, parts.object, graph);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // ### `_loop` executes the callback on all keys of index 0\n  _loop(index0, callback) {\n    for (const key0 in index0)\n      callback(key0);\n  }\n\n  // ### `_loopByKey0` executes the callback on all keys of a certain entry in index 0\n  _loopByKey0(index0, key0, callback) {\n    let index1, key1;\n    if (index1 = index0[key0]) {\n      for (key1 in index1)\n        callback(key1);\n    }\n  }\n\n  // ### `_loopByKey1` executes the callback on given keys of all entries in index 0\n  _loopByKey1(index0, key1, callback) {\n    let key0, index1;\n    for (key0 in index0) {\n      index1 = index0[key0];\n      if (index1[key1])\n        callback(key0);\n    }\n  }\n\n  // ### `_loopBy2Keys` executes the callback on given keys of certain entries in index 2\n  _loopBy2Keys(index0, key0, key1, callback) {\n    let index1, index2, key2;\n    if ((index1 = index0[key0]) && (index2 = index1[key1])) {\n      for (key2 in index2)\n        callback(key2);\n    }\n  }\n\n  // ### `_countInIndex` counts matching quads in a three-layered index.\n  // The index base is `index0` and the keys at each level are `key0`, `key1`, and `key2`.\n  // Any of these keys can be undefined, which is interpreted as a wildcard.\n  _countInIndex(index0, key0, key1, key2) {\n    let count = 0, tmp, index1, index2;\n\n    // If a key is specified, count only that part of index 0\n    if (key0) (tmp = index0, index0 = {})[key0] = tmp[key0];\n    for (const value0 in index0) {\n      if (index1 = index0[value0]) {\n        // If a key is specified, count only that part of index 1\n        if (key1) (tmp = index1, index1 = {})[key1] = tmp[key1];\n        for (const value1 in index1) {\n          if (index2 = index1[value1]) {\n            // If a key is specified, count the quad if it exists\n            if (key2) (key2 in index2) && count++;\n            // Otherwise, count all quads\n            else count += Object.keys(index2).length;\n          }\n        }\n      }\n    }\n    return count;\n  }\n\n  // ### `_getGraphs` returns an array with the given graph,\n  // or all graphs if the argument is null or undefined.\n  _getGraphs(graph) {\n    if (!isString(graph))\n      return this._graphs;\n    const graphs = {};\n    graphs[graph] = this._graphs[graph];\n    return graphs;\n  }\n\n  // ### `_uniqueEntities` returns a function that accepts an entity ID\n  // and passes the corresponding entity to callback if it hasn't occurred before.\n  _uniqueEntities(callback) {\n    const uniqueIds = Object.create(null);\n    return id => {\n      if (!(id in uniqueIds)) {\n        uniqueIds[id] = true;\n        callback((0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termFromId)(this._entities[id], this._factory));\n      }\n    };\n  }\n\n  // ## Public methods\n\n  // ### `add` adds the specified quad to the dataset.\n  // Returns the dataset instance it was called on.\n  // Existing quads, as defined in Quad.equals, will be ignored.\n  add(quad) {\n    this.addQuad(quad);\n    return this;\n  }\n\n  // ### `addQuad` adds a new quad to the store.\n  // Returns if the quad index has changed, if the quad did not already exist.\n  addQuad(subject, predicate, object, graph) {\n    // Shift arguments if a quad object is given instead of components\n    if (!predicate)\n      graph = subject.graph, object = subject.object,\n        predicate = subject.predicate, subject = subject.subject;\n\n    // Convert terms to internal string representation\n    subject = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    predicate = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    object = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    // Find the graph that will contain the triple\n    let graphItem = this._graphs[graph];\n    // Create the graph if it doesn't exist yet\n    if (!graphItem) {\n      graphItem = this._graphs[graph] = { subjects: {}, predicates: {}, objects: {} };\n      // Freezing a graph helps subsequent `add` performance,\n      // and properties will never be modified anyway\n      Object.freeze(graphItem);\n    }\n\n    // Since entities can often be long IRIs, we avoid storing them in every index.\n    // Instead, we have a separate index that maps entities to numbers,\n    // which are then used as keys in the other indexes.\n    const ids = this._ids;\n    const entities = this._entities;\n    subject   = ids[subject]   || (ids[entities[++this._id] = subject]   = this._id);\n    predicate = ids[predicate] || (ids[entities[++this._id] = predicate] = this._id);\n    object    = ids[object]    || (ids[entities[++this._id] = object]    = this._id);\n\n    const changed = this._addToIndex(graphItem.subjects,   subject,   predicate, object);\n    this._addToIndex(graphItem.predicates, predicate, object,    subject);\n    this._addToIndex(graphItem.objects,    object,    subject,   predicate);\n\n    // The cached quad count is now invalid\n    this._size = null;\n    return changed;\n  }\n\n  // ### `addQuads` adds multiple quads to the store\n  addQuads(quads) {\n    for (let i = 0; i < quads.length; i++)\n      this.addQuad(quads[i]);\n  }\n\n  // ### `delete` removes the specified quad from the dataset.\n  // Returns the dataset instance it was called on.\n  delete(quad) {\n    this.removeQuad(quad);\n    return this;\n  }\n\n  // ### `has` determines whether a dataset includes a certain quad or quad pattern.\n  has(subjectOrQuad, predicate, object, graph) {\n    if (subjectOrQuad && subjectOrQuad.subject)\n      ({ subject: subjectOrQuad, predicate, object, graph } = subjectOrQuad);\n    return !this.readQuads(subjectOrQuad, predicate, object, graph).next().done;\n  }\n\n  // ### `import` adds a stream of quads to the store\n  import(stream) {\n    stream.on('data', quad => { this.addQuad(quad); });\n    return stream;\n  }\n\n  // ### `removeQuad` removes a quad from the store if it exists\n  removeQuad(subject, predicate, object, graph) {\n    // Shift arguments if a quad object is given instead of components\n    if (!predicate)\n      graph = subject.graph, object = subject.object,\n        predicate = subject.predicate, subject = subject.subject;\n\n    // Convert terms to internal string representation\n    subject = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    predicate = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    object = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    // Find internal identifiers for all components\n    // and verify the quad exists.\n    const ids = this._ids, graphs = this._graphs;\n    let graphItem, subjects, predicates;\n    if (!(subject    = ids[subject]) || !(predicate = ids[predicate]) ||\n        !(object     = ids[object])  || !(graphItem = graphs[graph])  ||\n        !(subjects   = graphItem.subjects[subject]) ||\n        !(predicates = subjects[predicate]) ||\n        !(object in predicates))\n      return false;\n\n    // Remove it from all indexes\n    this._removeFromIndex(graphItem.subjects,   subject,   predicate, object);\n    this._removeFromIndex(graphItem.predicates, predicate, object,    subject);\n    this._removeFromIndex(graphItem.objects,    object,    subject,   predicate);\n    if (this._size !== null) this._size--;\n\n    // Remove the graph if it is empty\n    for (subject in graphItem.subjects) return true;\n    delete graphs[graph];\n    return true;\n  }\n\n  // ### `removeQuads` removes multiple quads from the store\n  removeQuads(quads) {\n    for (let i = 0; i < quads.length; i++)\n      this.removeQuad(quads[i]);\n  }\n\n  // ### `remove` removes a stream of quads from the store\n  remove(stream) {\n    stream.on('data', quad => { this.removeQuad(quad); });\n    return stream;\n  }\n\n  // ### `removeMatches` removes all matching quads from the store\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  removeMatches(subject, predicate, object, graph) {\n    const stream = new readable_stream__WEBPACK_IMPORTED_MODULE_0__.Readable({ objectMode: true });\n\n    stream._read = () => {\n      for (const quad of this.readQuads(subject, predicate, object, graph))\n        stream.push(quad);\n      stream.push(null);\n    };\n\n    return this.remove(stream);\n  }\n\n  // ### `deleteGraph` removes all triples with the given graph from the store\n  deleteGraph(graph) {\n    return this.removeMatches(null, null, null, graph);\n  }\n\n  // ### `getQuads` returns an array of quads matching a pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  getQuads(subject, predicate, object, graph) {\n    return [...this.readQuads(subject, predicate, object, graph)];\n  }\n\n  // ### `readQuads` returns an generator of quads matching a pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  *readQuads(subject, predicate, object, graph) {\n    // Convert terms to internal string representation\n    subject = subject && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    predicate = predicate && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    object = object && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = graph && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    const graphs = this._getGraphs(graph), ids = this._ids;\n    let content, subjectId, predicateId, objectId;\n\n    // Translate IRIs to internal index keys.\n    if (isString(subject)   && !(subjectId   = ids[subject])   ||\n        isString(predicate) && !(predicateId = ids[predicate]) ||\n        isString(object)    && !(objectId    = ids[object]))\n      return;\n\n    for (const graphId in graphs) {\n      // Only if the specified graph contains triples, there can be results\n      if (content = graphs[graphId]) {\n        // Choose the optimal index, based on what fields are present\n        if (subjectId) {\n          if (objectId)\n            // If subject and object are given, the object index will be the fastest\n            yield* this._findInIndex(content.objects, objectId, subjectId, predicateId,\n                              'object', 'subject', 'predicate', graphId);\n          else\n            // If only subject and possibly predicate are given, the subject index will be the fastest\n            yield* this._findInIndex(content.subjects, subjectId, predicateId, null,\n                              'subject', 'predicate', 'object', graphId);\n        }\n        else if (predicateId)\n          // If only predicate and possibly object are given, the predicate index will be the fastest\n          yield* this._findInIndex(content.predicates, predicateId, objectId, null,\n                            'predicate', 'object', 'subject', graphId);\n        else if (objectId)\n          // If only object is given, the object index will be the fastest\n          yield* this._findInIndex(content.objects, objectId, null, null,\n                            'object', 'subject', 'predicate', graphId);\n        else\n          // If nothing is given, iterate subjects and predicates first\n          yield* this._findInIndex(content.subjects, null, null, null,\n                            'subject', 'predicate', 'object', graphId);\n      }\n    }\n  }\n\n  // ### `match` returns a new dataset that is comprised of all quads in the current instance matching the given arguments.\n  // The logic described in Quad Matching is applied for each quad in this dataset to check if it should be included in the output dataset.\n  // Note: This method always returns a new DatasetCore, even if that dataset contains no quads.\n  // Note: Since a DatasetCore is an unordered set, the order of the quads within the returned sequence is arbitrary.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  // For backwards compatibility, the object return also implements the Readable stream interface.\n  match(subject, predicate, object, graph) {\n    return new DatasetCoreAndReadableStream(this, subject, predicate, object, graph);\n  }\n\n  // ### `countQuads` returns the number of quads matching a pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  countQuads(subject, predicate, object, graph) {\n    // Convert terms to internal string representation\n    subject = subject && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    predicate = predicate && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    object = object && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = graph && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    const graphs = this._getGraphs(graph), ids = this._ids;\n    let count = 0, content, subjectId, predicateId, objectId;\n\n    // Translate IRIs to internal index keys.\n    if (isString(subject)   && !(subjectId   = ids[subject])   ||\n        isString(predicate) && !(predicateId = ids[predicate]) ||\n        isString(object)    && !(objectId    = ids[object]))\n      return 0;\n\n    for (const graphId in graphs) {\n      // Only if the specified graph contains triples, there can be results\n      if (content = graphs[graphId]) {\n        // Choose the optimal index, based on what fields are present\n        if (subject) {\n          if (object)\n            // If subject and object are given, the object index will be the fastest\n            count += this._countInIndex(content.objects, objectId, subjectId, predicateId);\n          else\n            // If only subject and possibly predicate are given, the subject index will be the fastest\n            count += this._countInIndex(content.subjects, subjectId, predicateId, objectId);\n        }\n        else if (predicate) {\n          // If only predicate and possibly object are given, the predicate index will be the fastest\n          count += this._countInIndex(content.predicates, predicateId, objectId, subjectId);\n        }\n        else {\n          // If only object is possibly given, the object index will be the fastest\n          count += this._countInIndex(content.objects, objectId, subjectId, predicateId);\n        }\n      }\n    }\n    return count;\n  }\n\n  // ### `forEach` executes the callback on all quads.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  forEach(callback, subject, predicate, object, graph) {\n    this.some(quad => {\n      callback(quad);\n      return false;\n    }, subject, predicate, object, graph);\n  }\n\n  // ### `every` executes the callback on all quads,\n  // and returns `true` if it returns truthy for all them.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  every(callback, subject, predicate, object, graph) {\n    let some = false;\n    const every = !this.some(quad => {\n      some = true;\n      return !callback(quad);\n    }, subject, predicate, object, graph);\n    return some && every;\n  }\n\n  // ### `some` executes the callback on all quads,\n  // and returns `true` if it returns truthy for any of them.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  some(callback, subject, predicate, object, graph) {\n    for (const quad of this.readQuads(subject, predicate, object, graph))\n      if (callback(quad))\n        return true;\n    return false;\n  }\n\n  // ### `getSubjects` returns all subjects that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  getSubjects(predicate, object, graph) {\n    const results = [];\n    this.forSubjects(s => { results.push(s); }, predicate, object, graph);\n    return results;\n  }\n\n  // ### `forSubjects` executes the callback on all subjects that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  forSubjects(callback, predicate, object, graph) {\n    // Convert terms to internal string representation\n    predicate = predicate && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    object = object && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = graph && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    const ids = this._ids, graphs = this._getGraphs(graph);\n    let content, predicateId, objectId;\n    callback = this._uniqueEntities(callback);\n\n    // Translate IRIs to internal index keys.\n    if (isString(predicate) && !(predicateId = ids[predicate]) ||\n        isString(object)    && !(objectId    = ids[object]))\n      return;\n\n    for (graph in graphs) {\n      // Only if the specified graph contains triples, there can be results\n      if (content = graphs[graph]) {\n        // Choose optimal index based on which fields are wildcards\n        if (predicateId) {\n          if (objectId)\n            // If predicate and object are given, the POS index is best.\n            this._loopBy2Keys(content.predicates, predicateId, objectId, callback);\n          else\n            // If only predicate is given, the SPO index is best.\n            this._loopByKey1(content.subjects, predicateId, callback);\n        }\n        else if (objectId)\n          // If only object is given, the OSP index is best.\n          this._loopByKey0(content.objects, objectId, callback);\n        else\n          // If no params given, iterate all the subjects\n          this._loop(content.subjects, callback);\n      }\n    }\n  }\n\n  // ### `getPredicates` returns all predicates that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  getPredicates(subject, object, graph) {\n    const results = [];\n    this.forPredicates(p => { results.push(p); }, subject, object, graph);\n    return results;\n  }\n\n  // ### `forPredicates` executes the callback on all predicates that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  forPredicates(callback, subject, object, graph) {\n    // Convert terms to internal string representation\n    subject = subject && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    object = object && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(object);\n    graph = graph && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    const ids = this._ids, graphs = this._getGraphs(graph);\n    let content, subjectId, objectId;\n    callback = this._uniqueEntities(callback);\n\n    // Translate IRIs to internal index keys.\n    if (isString(subject) && !(subjectId = ids[subject]) ||\n        isString(object)  && !(objectId  = ids[object]))\n      return;\n\n    for (graph in graphs) {\n      // Only if the specified graph contains triples, there can be results\n      if (content = graphs[graph]) {\n        // Choose optimal index based on which fields are wildcards\n        if (subjectId) {\n          if (objectId)\n            // If subject and object are given, the OSP index is best.\n            this._loopBy2Keys(content.objects, objectId, subjectId, callback);\n          else\n            // If only subject is given, the SPO index is best.\n            this._loopByKey0(content.subjects, subjectId, callback);\n        }\n        else if (objectId)\n          // If only object is given, the POS index is best.\n          this._loopByKey1(content.predicates, objectId, callback);\n        else\n          // If no params given, iterate all the predicates.\n          this._loop(content.predicates, callback);\n      }\n    }\n  }\n\n  // ### `getObjects` returns all objects that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  getObjects(subject, predicate, graph) {\n    const results = [];\n    this.forObjects(o => { results.push(o); }, subject, predicate, graph);\n    return results;\n  }\n\n  // ### `forObjects` executes the callback on all objects that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  forObjects(callback, subject, predicate, graph) {\n    // Convert terms to internal string representation\n    subject = subject && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(subject);\n    predicate = predicate && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(predicate);\n    graph = graph && (0,_N3DataFactory__WEBPACK_IMPORTED_MODULE_1__.termToId)(graph);\n\n    const ids = this._ids, graphs = this._getGraphs(graph);\n    let content, subjectId, predicateId;\n    callback = this._uniqueEntities(callback);\n\n    // Translate IRIs to internal index keys.\n    if (isString(subject)   && !(subjectId   = ids[subject]) ||\n        isString(predicate) && !(predicateId = ids[predicate]))\n      return;\n\n    for (graph in graphs) {\n      // Only if the specified graph contains triples, there can be results\n      if (content = graphs[graph]) {\n        // Choose optimal index based on which fields are wildcards\n        if (subjectId) {\n          if (predicateId)\n            // If subject and predicate are given, the SPO index is best.\n            this._loopBy2Keys(content.subjects, subjectId, predicateId, callback);\n          else\n            // If only subject is given, the OSP index is best.\n            this._loopByKey1(content.objects, subjectId, callback);\n        }\n        else if (predicateId)\n          // If only predicate is given, the POS index is best.\n          this._loopByKey0(content.predicates, predicateId, callback);\n        else\n          // If no params given, iterate all the objects.\n          this._loop(content.objects, callback);\n      }\n    }\n  }\n\n  // ### `getGraphs` returns all graphs that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  getGraphs(subject, predicate, object) {\n    const results = [];\n    this.forGraphs(g => { results.push(g); }, subject, predicate, object);\n    return results;\n  }\n\n  // ### `forGraphs` executes the callback on all graphs that match the pattern.\n  // Setting any field to `undefined` or `null` indicates a wildcard.\n  forGraphs(callback, subject, predicate, object) {\n    for (const graph in this._graphs) {\n      this.some(quad => {\n        callback(quad.graph);\n        return true; // Halt iteration of some()\n      }, subject, predicate, object, graph);\n    }\n  }\n\n  // ### `createBlankNode` creates a new blank node, returning its name\n  createBlankNode(suggestedName) {\n    let name, index;\n    // Generate a name based on the suggested name\n    if (suggestedName) {\n      name = suggestedName = `_:${suggestedName}`, index = 1;\n      while (this._ids[name])\n        name = suggestedName + index++;\n    }\n    // Generate a generic blank node name\n    else {\n      do { name = `_:b${this._blankNodeIndex++}`; }\n      while (this._ids[name]);\n    }\n    // Add the blank node to the entities, avoiding the generation of duplicates\n    this._ids[name] = ++this._id;\n    this._entities[this._id] = name;\n    return this._factory.blankNode(name.substr(2));\n  }\n\n  // ### `extractLists` finds and removes all list triples\n  // and returns the items per list.\n  extractLists({ remove = false, ignoreErrors = false } = {}) {\n    const lists = {}; // has scalar keys so could be a simple Object\n    const onError = ignoreErrors ? (() => true) :\n                  ((node, message) => { throw new Error(`${node.value} ${message}`); });\n\n    // Traverse each list from its tail\n    const tails = this.getQuads(null, _IRIs__WEBPACK_IMPORTED_MODULE_2__[\"default\"].rdf.rest, _IRIs__WEBPACK_IMPORTED_MODULE_2__[\"default\"].rdf.nil, null);\n    const toRemove = remove ? [...tails] : [];\n    tails.forEach(tailQuad => {\n      const items = [];             // the members found as objects of rdf:first quads\n      let malformed = false;      // signals whether the current list is malformed\n      let head;                   // the head of the list (_:b1 in above example)\n      let headPos;                // set to subject or object when head is set\n      const graph = tailQuad.graph; // make sure list is in exactly one graph\n\n      // Traverse the list from tail to end\n      let current = tailQuad.subject;\n      while (current && !malformed) {\n        const objectQuads = this.getQuads(null, null, current, null);\n        const subjectQuads = this.getQuads(current, null, null, null);\n        let quad, first = null, rest = null, parent = null;\n\n        // Find the first and rest of this list node\n        for (let i = 0; i < subjectQuads.length && !malformed; i++) {\n          quad = subjectQuads[i];\n          if (!quad.graph.equals(graph))\n            malformed = onError(current, 'not confined to single graph');\n          else if (head)\n            malformed = onError(current, 'has non-list arcs out');\n\n          // one rdf:first\n          else if (quad.predicate.value === _IRIs__WEBPACK_IMPORTED_MODULE_2__[\"default\"].rdf.first) {\n            if (first)\n              malformed = onError(current, 'has multiple rdf:first arcs');\n            else\n              toRemove.push(first = quad);\n          }\n\n          // one rdf:rest\n          else if (quad.predicate.value === _IRIs__WEBPACK_IMPORTED_MODULE_2__[\"default\"].rdf.rest) {\n            if (rest)\n              malformed = onError(current, 'has multiple rdf:rest arcs');\n            else\n              toRemove.push(rest = quad);\n          }\n\n          // alien triple\n          else if (objectQuads.length)\n            malformed = onError(current, 'can\\'t be subject and object');\n          else {\n            head = quad; // e.g. { (1 2 3) :p :o }\n            headPos = 'subject';\n          }\n        }\n\n        // { :s :p (1 2) } arrives here with no head\n        // { (1 2) :p :o } arrives here with head set to the list.\n        for (let i = 0; i < objectQuads.length && !malformed; ++i) {\n          quad = objectQuads[i];\n          if (head)\n            malformed = onError(current, 'can\\'t have coreferences');\n          // one rdf:rest\n          else if (quad.predicate.value === _IRIs__WEBPACK_IMPORTED_MODULE_2__[\"default\"].rdf.rest) {\n            if (parent)\n              malformed = onError(current, 'has incoming rdf:rest arcs');\n            else\n              parent = quad;\n          }\n          else {\n            head = quad; // e.g. { :s :p (1 2) }\n            headPos = 'object';\n          }\n        }\n\n        // Store the list item and continue with parent\n        if (!first)\n          malformed = onError(current, 'has no list head');\n        else\n          items.unshift(first.object);\n        current = parent && parent.subject;\n      }\n\n      // Don't remove any quads if the list is malformed\n      if (malformed)\n        remove = false;\n      // Store the list under the value of its head\n      else if (head)\n        lists[head[headPos].value] = items;\n    });\n\n    // Remove list quads if requested\n    if (remove)\n      this.removeQuads(toRemove);\n    return lists;\n  }\n\n  // ### Store is an iterable.\n  // Can be used where iterables are expected: for...of loops, array spread operator,\n  // `yield*`, and destructuring assignment (order is not guaranteed).\n  *[Symbol.iterator]() {\n    yield* this.readQuads();\n  }\n}\n\n// Determines whether the argument is a string\nfunction isString(s) {\n  return typeof s === 'string' || s instanceof String;\n}\n\n/**\n * A class that implements both DatasetCore and Readable.\n */\nclass DatasetCoreAndReadableStream extends readable_stream__WEBPACK_IMPORTED_MODULE_0__.Readable {\n  constructor(n3Store, subject, predicate, object, graph) {\n    super({ objectMode: true });\n    Object.assign(this, { n3Store, subject, predicate, object, graph });\n  }\n\n  get filtered() {\n    if (!this._filtered) {\n      const { n3Store, graph, object, predicate, subject } = this;\n      const newStore = this._filtered = new N3Store({ factory: n3Store._factory });\n      for (const quad of n3Store.readQuads(subject, predicate, object, graph))\n        newStore.addQuad(quad);\n    }\n    return this._filtered;\n  }\n\n  get size() {\n    return this.filtered.size;\n  }\n\n  _read() {\n    for (const quad of this)\n      this.push(quad);\n    this.push(null);\n  }\n\n  add(quad) {\n    return this.filtered.add(quad);\n  }\n\n  delete(quad) {\n    return this.filtered.delete(quad);\n  }\n\n  has(quad) {\n    return this.filtered.has(quad);\n  }\n\n  match(subject, predicate, object, graph) {\n    return new DatasetCoreAndReadableStream(this.filtered, subject, predicate, object, graph);\n  }\n\n  *[Symbol.iterator]() {\n    yield* this._filtered || this.n3Store.readQuads(this.subject, this.predicate, this.object, this.graph);\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3Store.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3StreamParser.js":
+/*!***********************************************!*\
+  !*** ./node_modules/n3/src/N3StreamParser.js ***!
+  \***********************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3StreamParser)\n/* harmony export */ });\n/* harmony import */ var _N3Parser__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./N3Parser */ \"./node_modules/n3/src/N3Parser.js\");\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! readable-stream */ \"./node_modules/readable-stream/lib/ours/browser.js\");\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(readable_stream__WEBPACK_IMPORTED_MODULE_0__);\n// **N3StreamParser** parses a text stream into a quad stream.\n\n\n\n// ## Constructor\nclass N3StreamParser extends readable_stream__WEBPACK_IMPORTED_MODULE_0__.Transform {\n  constructor(options) {\n    super({ decodeStrings: true });\n    this._readableState.objectMode = true;\n\n    // Set up parser with dummy stream to obtain `data` and `end` callbacks\n    const parser = new _N3Parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"](options);\n    let onData, onEnd;\n    parser.parse({\n      on: (event, callback) => {\n        switch (event) {\n        case 'data': onData = callback; break;\n        case 'end':   onEnd = callback; break;\n        }\n      },\n    },\n      // Handle quads by pushing them down the pipeline\n      (error, quad) => { error && this.emit('error', error) || quad && this.push(quad); },\n      // Emit prefixes through the `prefix` event\n      (prefix, uri) => { this.emit('prefix', prefix, uri); }\n    );\n\n    // Implement Transform methods through parser callbacks\n    this._transform = (chunk, encoding, done) => { onData(chunk); done(); };\n    this._flush = done => { onEnd(); done(); };\n  }\n\n  // ### Parses a stream of strings\n  import(stream) {\n    stream.on('data',  chunk => { this.write(chunk); });\n    stream.on('end',   ()      => { this.end(); });\n    stream.on('error', error => { this.emit('error', error); });\n    return this;\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3StreamParser.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3StreamWriter.js":
+/*!***********************************************!*\
+  !*** ./node_modules/n3/src/N3StreamWriter.js ***!
+  \***********************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3StreamWriter)\n/* harmony export */ });\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! readable-stream */ \"./node_modules/readable-stream/lib/ours/browser.js\");\n/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(readable_stream__WEBPACK_IMPORTED_MODULE_0__);\n/* harmony import */ var _N3Writer__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./N3Writer */ \"./node_modules/n3/src/N3Writer.js\");\n// **N3StreamWriter** serializes a quad stream into a text stream.\n\n\n\n// ## Constructor\nclass N3StreamWriter extends readable_stream__WEBPACK_IMPORTED_MODULE_0__.Transform {\n  constructor(options) {\n    super({ encoding: 'utf8', writableObjectMode: true });\n\n    // Set up writer with a dummy stream object\n    const writer = this._writer = new _N3Writer__WEBPACK_IMPORTED_MODULE_1__[\"default\"]({\n      write: (quad, encoding, callback) => { this.push(quad); callback && callback(); },\n      end: callback => { this.push(null); callback && callback(); },\n    }, options);\n\n    // Implement Transform methods on top of writer\n    this._transform = (quad, encoding, done) => { writer.addQuad(quad, done); };\n    this._flush = done => { writer.end(done); };\n  }\n\n// ### Serializes a stream of quads\n  import(stream) {\n    stream.on('data',   quad => { this.write(quad); });\n    stream.on('end',    () => { this.end(); });\n    stream.on('error',  error => { this.emit('error', error); });\n    stream.on('prefix', (prefix, iri) => { this._writer.addPrefix(prefix, iri); });\n    return this;\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3StreamWriter.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3Util.js":
+/*!***************************************!*\
+  !*** ./node_modules/n3/src/N3Util.js ***!
+  \***************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   inDefaultGraph: () => (/* binding */ inDefaultGraph),\n/* harmony export */   isBlankNode: () => (/* binding */ isBlankNode),\n/* harmony export */   isDefaultGraph: () => (/* binding */ isDefaultGraph),\n/* harmony export */   isLiteral: () => (/* binding */ isLiteral),\n/* harmony export */   isNamedNode: () => (/* binding */ isNamedNode),\n/* harmony export */   isVariable: () => (/* binding */ isVariable),\n/* harmony export */   prefix: () => (/* binding */ prefix),\n/* harmony export */   prefixes: () => (/* binding */ prefixes)\n/* harmony export */ });\n/* harmony import */ var _N3DataFactory__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./N3DataFactory */ \"./node_modules/n3/src/N3DataFactory.js\");\n// **N3Util** provides N3 utility functions.\n\n\n\n// Tests whether the given term represents an IRI\nfunction isNamedNode(term) {\n  return !!term && term.termType === 'NamedNode';\n}\n\n// Tests whether the given term represents a blank node\nfunction isBlankNode(term) {\n  return !!term && term.termType === 'BlankNode';\n}\n\n// Tests whether the given term represents a literal\nfunction isLiteral(term) {\n  return !!term && term.termType === 'Literal';\n}\n\n// Tests whether the given term represents a variable\nfunction isVariable(term) {\n  return !!term && term.termType === 'Variable';\n}\n\n// Tests whether the given term represents the default graph\nfunction isDefaultGraph(term) {\n  return !!term && term.termType === 'DefaultGraph';\n}\n\n// Tests whether the given quad is in the default graph\nfunction inDefaultGraph(quad) {\n  return isDefaultGraph(quad.graph);\n}\n\n// Creates a function that prepends the given IRI to a local name\nfunction prefix(iri, factory) {\n  return prefixes({ '': iri.value || iri }, factory)('');\n}\n\n// Creates a function that allows registering and expanding prefixes\nfunction prefixes(defaultPrefixes, factory) {\n  // Add all of the default prefixes\n  const prefixes = Object.create(null);\n  for (const prefix in defaultPrefixes)\n    processPrefix(prefix, defaultPrefixes[prefix]);\n  // Set the default factory if none was specified\n  factory = factory || _N3DataFactory__WEBPACK_IMPORTED_MODULE_0__[\"default\"];\n\n  // Registers a new prefix (if an IRI was specified)\n  // or retrieves a function that expands an existing prefix (if no IRI was specified)\n  function processPrefix(prefix, iri) {\n    // Create a new prefix if an IRI is specified or the prefix doesn't exist\n    if (typeof iri === 'string') {\n      // Create a function that expands the prefix\n      const cache = Object.create(null);\n      prefixes[prefix] = local => {\n        return cache[local] || (cache[local] = factory.namedNode(iri + local));\n      };\n    }\n    else if (!(prefix in prefixes)) {\n      throw new Error(`Unknown prefix: ${prefix}`);\n    }\n    return prefixes[prefix];\n  }\n  return processPrefix;\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3Util.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/N3Writer.js":
+/*!*****************************************!*\
+  !*** ./node_modules/n3/src/N3Writer.js ***!
+  \*****************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (/* binding */ N3Writer)\n/* harmony export */ });\n/* harmony import */ var _IRIs__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./IRIs */ \"./node_modules/n3/src/IRIs.js\");\n/* harmony import */ var _N3DataFactory__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./N3DataFactory */ \"./node_modules/n3/src/N3DataFactory.js\");\n/* harmony import */ var _N3Util__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./N3Util */ \"./node_modules/n3/src/N3Util.js\");\n// **N3Writer** writes N3 documents.\n\n\n\n\nconst DEFAULTGRAPH = _N3DataFactory__WEBPACK_IMPORTED_MODULE_0__[\"default\"].defaultGraph();\n\nconst { rdf, xsd } = _IRIs__WEBPACK_IMPORTED_MODULE_1__[\"default\"];\n\n// Characters in literals that require escaping\nconst escape    = /[\"\\\\\\t\\n\\r\\b\\f\\u0000-\\u0019\\ud800-\\udbff]/,\n    escapeAll = /[\"\\\\\\t\\n\\r\\b\\f\\u0000-\\u0019]|[\\ud800-\\udbff][\\udc00-\\udfff]/g,\n    escapedCharacters = {\n      '\\\\': '\\\\\\\\', '\"': '\\\\\"', '\\t': '\\\\t',\n      '\\n': '\\\\n', '\\r': '\\\\r', '\\b': '\\\\b', '\\f': '\\\\f',\n    };\n\n// ## Placeholder class to represent already pretty-printed terms\nclass SerializedTerm extends _N3DataFactory__WEBPACK_IMPORTED_MODULE_0__.Term {\n  // Pretty-printed nodes are not equal to any other node\n  // (e.g., [] does not equal [])\n  equals(other) {\n    return other === this;\n  }\n}\n\n// ## Constructor\nclass N3Writer {\n  constructor(outputStream, options) {\n    // ### `_prefixRegex` matches a prefixed name or IRI that begins with one of the added prefixes\n    this._prefixRegex = /$0^/;\n\n    // Shift arguments if the first argument is not a stream\n    if (outputStream && typeof outputStream.write !== 'function')\n      options = outputStream, outputStream = null;\n    options = options || {};\n    this._lists = options.lists;\n\n    // If no output stream given, send the output as string through the end callback\n    if (!outputStream) {\n      let output = '';\n      this._outputStream = {\n        write(chunk, encoding, done) { output += chunk; done && done(); },\n        end: done => { done && done(null, output); },\n      };\n      this._endStream = true;\n    }\n    else {\n      this._outputStream = outputStream;\n      this._endStream = options.end === undefined ? true : !!options.end;\n    }\n\n    // Initialize writer, depending on the format\n    this._subject = null;\n    if (!(/triple|quad/i).test(options.format)) {\n      this._lineMode = false;\n      this._graph = DEFAULTGRAPH;\n      this._prefixIRIs = Object.create(null);\n      options.prefixes && this.addPrefixes(options.prefixes);\n      if (options.baseIRI) {\n        this._baseMatcher = new RegExp(`^${escapeRegex(options.baseIRI)\n            }${options.baseIRI.endsWith('/') ? '' : '[#?]'}`);\n        this._baseLength = options.baseIRI.length;\n      }\n    }\n    else {\n      this._lineMode = true;\n      this._writeQuad = this._writeQuadLine;\n    }\n  }\n\n  // ## Private methods\n\n  // ### Whether the current graph is the default graph\n  get _inDefaultGraph() {\n    return DEFAULTGRAPH.equals(this._graph);\n  }\n\n  // ### `_write` writes the argument to the output stream\n  _write(string, callback) {\n    this._outputStream.write(string, 'utf8', callback);\n  }\n\n  // ### `_writeQuad` writes the quad to the output stream\n  _writeQuad(subject, predicate, object, graph, done) {\n    try {\n      // Write the graph's label if it has changed\n      if (!graph.equals(this._graph)) {\n        // Close the previous graph and start the new one\n        this._write((this._subject === null ? '' : (this._inDefaultGraph ? '.\\n' : '\\n}\\n')) +\n                    (DEFAULTGRAPH.equals(graph) ? '' : `${this._encodeIriOrBlank(graph)} {\\n`));\n        this._graph = graph;\n        this._subject = null;\n      }\n      // Don't repeat the subject if it's the same\n      if (subject.equals(this._subject)) {\n        // Don't repeat the predicate if it's the same\n        if (predicate.equals(this._predicate))\n          this._write(`, ${this._encodeObject(object)}`, done);\n        // Same subject, different predicate\n        else\n          this._write(`;\\n    ${\n                      this._encodePredicate(this._predicate = predicate)} ${\n                      this._encodeObject(object)}`, done);\n      }\n      // Different subject; write the whole quad\n      else\n        this._write(`${(this._subject === null ? '' : '.\\n') +\n                    this._encodeSubject(this._subject = subject)} ${\n                    this._encodePredicate(this._predicate = predicate)} ${\n                    this._encodeObject(object)}`, done);\n    }\n    catch (error) { done && done(error); }\n  }\n\n  // ### `_writeQuadLine` writes the quad to the output stream as a single line\n  _writeQuadLine(subject, predicate, object, graph, done) {\n    // Write the quad without prefixes\n    delete this._prefixMatch;\n    this._write(this.quadToString(subject, predicate, object, graph), done);\n  }\n\n  // ### `quadToString` serializes a quad as a string\n  quadToString(subject, predicate, object, graph) {\n    return  `${this._encodeSubject(subject)} ${\n            this._encodeIriOrBlank(predicate)} ${\n            this._encodeObject(object)\n            }${graph && graph.value ? ` ${this._encodeIriOrBlank(graph)} .\\n` : ' .\\n'}`;\n  }\n\n  // ### `quadsToString` serializes an array of quads as a string\n  quadsToString(quads) {\n    return quads.map(t => {\n      return this.quadToString(t.subject, t.predicate, t.object, t.graph);\n    }).join('');\n  }\n\n  // ### `_encodeSubject` represents a subject\n  _encodeSubject(entity) {\n    return entity.termType === 'Quad' ?\n      this._encodeQuad(entity) : this._encodeIriOrBlank(entity);\n  }\n\n  // ### `_encodeIriOrBlank` represents an IRI or blank node\n  _encodeIriOrBlank(entity) {\n    // A blank node or list is represented as-is\n    if (entity.termType !== 'NamedNode') {\n      // If it is a list head, pretty-print it\n      if (this._lists && (entity.value in this._lists))\n        entity = this.list(this._lists[entity.value]);\n      return 'id' in entity ? entity.id : `_:${entity.value}`;\n    }\n    let iri = entity.value;\n    // Use relative IRIs if requested and possible\n    if (this._baseMatcher && this._baseMatcher.test(iri))\n      iri = iri.substr(this._baseLength);\n    // Escape special characters\n    if (escape.test(iri))\n      iri = iri.replace(escapeAll, characterReplacer);\n    // Try to represent the IRI as prefixed name\n    const prefixMatch = this._prefixRegex.exec(iri);\n    return !prefixMatch ? `<${iri}>` :\n           (!prefixMatch[1] ? iri : this._prefixIRIs[prefixMatch[1]] + prefixMatch[2]);\n  }\n\n  // ### `_encodeLiteral` represents a literal\n  _encodeLiteral(literal) {\n    // Escape special characters\n    let value = literal.value;\n    if (escape.test(value))\n      value = value.replace(escapeAll, characterReplacer);\n\n    // Write a language-tagged literal\n    if (literal.language)\n      return `\"${value}\"@${literal.language}`;\n\n    // Write dedicated literals per data type\n    if (this._lineMode) {\n      // Only abbreviate strings in N-Triples or N-Quads\n      if (literal.datatype.value === xsd.string)\n        return `\"${value}\"`;\n    }\n    else {\n      // Use common datatype abbreviations in Turtle or TriG\n      switch (literal.datatype.value) {\n      case xsd.string:\n        return `\"${value}\"`;\n      case xsd.boolean:\n        if (value === 'true' || value === 'false')\n          return value;\n        break;\n      case xsd.integer:\n        if (/^[+-]?\\d+$/.test(value))\n          return value;\n        break;\n      case xsd.decimal:\n        if (/^[+-]?\\d*\\.\\d+$/.test(value))\n          return value;\n        break;\n      case xsd.double:\n        if (/^[+-]?(?:\\d+\\.\\d*|\\.?\\d+)[eE][+-]?\\d+$/.test(value))\n          return value;\n        break;\n      }\n    }\n\n    // Write a regular datatyped literal\n    return `\"${value}\"^^${this._encodeIriOrBlank(literal.datatype)}`;\n  }\n\n  // ### `_encodePredicate` represents a predicate\n  _encodePredicate(predicate) {\n    return predicate.value === rdf.type ? 'a' : this._encodeIriOrBlank(predicate);\n  }\n\n  // ### `_encodeObject` represents an object\n  _encodeObject(object) {\n    switch (object.termType) {\n    case 'Quad':\n      return this._encodeQuad(object);\n    case 'Literal':\n      return this._encodeLiteral(object);\n    default:\n      return this._encodeIriOrBlank(object);\n    }\n  }\n\n  // ### `_encodeQuad` encodes an RDF* quad\n  _encodeQuad({ subject, predicate, object, graph }) {\n    return `<<${\n      this._encodeSubject(subject)} ${\n      this._encodePredicate(predicate)} ${\n      this._encodeObject(object)}${\n      (0,_N3Util__WEBPACK_IMPORTED_MODULE_2__.isDefaultGraph)(graph) ? '' : ` ${this._encodeIriOrBlank(graph)}`}>>`;\n  }\n\n  // ### `_blockedWrite` replaces `_write` after the writer has been closed\n  _blockedWrite() {\n    throw new Error('Cannot write because the writer has been closed.');\n  }\n\n  // ### `addQuad` adds the quad to the output stream\n  addQuad(subject, predicate, object, graph, done) {\n    // The quad was given as an object, so shift parameters\n    if (object === undefined)\n      this._writeQuad(subject.subject, subject.predicate, subject.object, subject.graph, predicate);\n    // The optional `graph` parameter was not provided\n    else if (typeof graph === 'function')\n      this._writeQuad(subject, predicate, object, DEFAULTGRAPH, graph);\n    // The `graph` parameter was provided\n    else\n      this._writeQuad(subject, predicate, object, graph || DEFAULTGRAPH, done);\n  }\n\n  // ### `addQuads` adds the quads to the output stream\n  addQuads(quads) {\n    for (let i = 0; i < quads.length; i++)\n      this.addQuad(quads[i]);\n  }\n\n  // ### `addPrefix` adds the prefix to the output stream\n  addPrefix(prefix, iri, done) {\n    const prefixes = {};\n    prefixes[prefix] = iri;\n    this.addPrefixes(prefixes, done);\n  }\n\n  // ### `addPrefixes` adds the prefixes to the output stream\n  addPrefixes(prefixes, done) {\n    // Ignore prefixes if not supported by the serialization\n    if (!this._prefixIRIs)\n      return done && done();\n\n    // Write all new prefixes\n    let hasPrefixes = false;\n    for (let prefix in prefixes) {\n      let iri = prefixes[prefix];\n      if (typeof iri !== 'string')\n        iri = iri.value;\n      hasPrefixes = true;\n      // Finish a possible pending quad\n      if (this._subject !== null) {\n        this._write(this._inDefaultGraph ? '.\\n' : '\\n}\\n');\n        this._subject = null, this._graph = '';\n      }\n      // Store and write the prefix\n      this._prefixIRIs[iri] = (prefix += ':');\n      this._write(`@prefix ${prefix} <${iri}>.\\n`);\n    }\n    // Recreate the prefix matcher\n    if (hasPrefixes) {\n      let IRIlist = '', prefixList = '';\n      for (const prefixIRI in this._prefixIRIs) {\n        IRIlist += IRIlist ? `|${prefixIRI}` : prefixIRI;\n        prefixList += (prefixList ? '|' : '') + this._prefixIRIs[prefixIRI];\n      }\n      IRIlist = escapeRegex(IRIlist, /[\\]\\/\\(\\)\\*\\+\\?\\.\\\\\\$]/g, '\\\\$&');\n      this._prefixRegex = new RegExp(`^(?:${prefixList})[^\\/]*$|` +\n                                     `^(${IRIlist})([_a-zA-Z][\\\\-_a-zA-Z0-9]*)$`);\n    }\n    // End a prefix block with a newline\n    this._write(hasPrefixes ? '\\n' : '', done);\n  }\n\n  // ### `blank` creates a blank node with the given content\n  blank(predicate, object) {\n    let children = predicate, child, length;\n    // Empty blank node\n    if (predicate === undefined)\n      children = [];\n    // Blank node passed as blank(Term(\"predicate\"), Term(\"object\"))\n    else if (predicate.termType)\n      children = [{ predicate: predicate, object: object }];\n    // Blank node passed as blank({ predicate: predicate, object: object })\n    else if (!('length' in predicate))\n      children = [predicate];\n\n    switch (length = children.length) {\n    // Generate an empty blank node\n    case 0:\n      return new SerializedTerm('[]');\n    // Generate a non-nested one-triple blank node\n    case 1:\n      child = children[0];\n      if (!(child.object instanceof SerializedTerm))\n        return new SerializedTerm(`[ ${this._encodePredicate(child.predicate)} ${\n                                  this._encodeObject(child.object)} ]`);\n    // Generate a multi-triple or nested blank node\n    default:\n      let contents = '[';\n      // Write all triples in order\n      for (let i = 0; i < length; i++) {\n        child = children[i];\n        // Write only the object is the predicate is the same as the previous\n        if (child.predicate.equals(predicate))\n          contents += `, ${this._encodeObject(child.object)}`;\n        // Otherwise, write the predicate and the object\n        else {\n          contents += `${(i ? ';\\n  ' : '\\n  ') +\n                      this._encodePredicate(child.predicate)} ${\n                      this._encodeObject(child.object)}`;\n          predicate = child.predicate;\n        }\n      }\n      return new SerializedTerm(`${contents}\\n]`);\n    }\n  }\n\n  // ### `list` creates a list node with the given content\n  list(elements) {\n    const length = elements && elements.length || 0, contents = new Array(length);\n    for (let i = 0; i < length; i++)\n      contents[i] = this._encodeObject(elements[i]);\n    return new SerializedTerm(`(${contents.join(' ')})`);\n  }\n\n  // ### `end` signals the end of the output stream\n  end(done) {\n    // Finish a possible pending quad\n    if (this._subject !== null) {\n      this._write(this._inDefaultGraph ? '.\\n' : '\\n}\\n');\n      this._subject = null;\n    }\n    // Disallow further writing\n    this._write = this._blockedWrite;\n\n    // Try to end the underlying stream, ensuring done is called exactly one time\n    let singleDone = done && ((error, result) => { singleDone = null, done(error, result); });\n    if (this._endStream) {\n      try { return this._outputStream.end(singleDone); }\n      catch (error) { /* error closing stream */ }\n    }\n    singleDone && singleDone();\n  }\n}\n\n// Replaces a character by its escaped version\nfunction characterReplacer(character) {\n  // Replace a single character by its escaped version\n  let result = escapedCharacters[character];\n  if (result === undefined) {\n    // Replace a single character with its 4-bit unicode escape sequence\n    if (character.length === 1) {\n      result = character.charCodeAt(0).toString(16);\n      result = '\\\\u0000'.substr(0, 6 - result.length) + result;\n    }\n    // Replace a surrogate pair with its 8-bit unicode escape sequence\n    else {\n      result = ((character.charCodeAt(0) - 0xD800) * 0x400 +\n                 character.charCodeAt(1) + 0x2400).toString(16);\n      result = '\\\\U00000000'.substr(0, 10 - result.length) + result;\n    }\n  }\n  return result;\n}\n\nfunction escapeRegex(regex) {\n  return regex.replace(/[\\]\\/\\(\\)\\*\\+\\?\\.\\\\\\$]/g, '\\\\$&');\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/N3Writer.js?");
+
+/***/ }),
+
+/***/ "./node_modules/n3/src/index.js":
+/*!**************************************!*\
+  !*** ./node_modules/n3/src/index.js ***!
+  \**************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   BlankNode: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.BlankNode),\n/* harmony export */   DataFactory: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"]),\n/* harmony export */   DefaultGraph: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.DefaultGraph),\n/* harmony export */   Lexer: () => (/* reexport safe */ _N3Lexer__WEBPACK_IMPORTED_MODULE_0__[\"default\"]),\n/* harmony export */   Literal: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Literal),\n/* harmony export */   NamedNode: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.NamedNode),\n/* harmony export */   Parser: () => (/* reexport safe */ _N3Parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"]),\n/* harmony export */   Quad: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Quad),\n/* harmony export */   Store: () => (/* reexport safe */ _N3Store__WEBPACK_IMPORTED_MODULE_3__[\"default\"]),\n/* harmony export */   StreamParser: () => (/* reexport safe */ _N3StreamParser__WEBPACK_IMPORTED_MODULE_4__[\"default\"]),\n/* harmony export */   StreamWriter: () => (/* reexport safe */ _N3StreamWriter__WEBPACK_IMPORTED_MODULE_5__[\"default\"]),\n/* harmony export */   Term: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Term),\n/* harmony export */   Triple: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Triple),\n/* harmony export */   Util: () => (/* reexport module object */ _N3Util__WEBPACK_IMPORTED_MODULE_6__),\n/* harmony export */   Variable: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Variable),\n/* harmony export */   Writer: () => (/* reexport safe */ _N3Writer__WEBPACK_IMPORTED_MODULE_2__[\"default\"]),\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__),\n/* harmony export */   termFromId: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.termFromId),\n/* harmony export */   termToId: () => (/* reexport safe */ _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.termToId)\n/* harmony export */ });\n/* harmony import */ var _N3Lexer__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./N3Lexer */ \"./node_modules/n3/src/N3Lexer.js\");\n/* harmony import */ var _N3Parser__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./N3Parser */ \"./node_modules/n3/src/N3Parser.js\");\n/* harmony import */ var _N3Writer__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./N3Writer */ \"./node_modules/n3/src/N3Writer.js\");\n/* harmony import */ var _N3Store__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./N3Store */ \"./node_modules/n3/src/N3Store.js\");\n/* harmony import */ var _N3StreamParser__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./N3StreamParser */ \"./node_modules/n3/src/N3StreamParser.js\");\n/* harmony import */ var _N3StreamWriter__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./N3StreamWriter */ \"./node_modules/n3/src/N3StreamWriter.js\");\n/* harmony import */ var _N3Util__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./N3Util */ \"./node_modules/n3/src/N3Util.js\");\n/* harmony import */ var _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./N3DataFactory */ \"./node_modules/n3/src/N3DataFactory.js\");\n\n\n\n\n\n\n\n\n\n\n// Named exports\n\n\n// Export all named exports as a default object for backward compatibility\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = ({\n  Lexer: _N3Lexer__WEBPACK_IMPORTED_MODULE_0__[\"default\"],\n  Parser: _N3Parser__WEBPACK_IMPORTED_MODULE_1__[\"default\"],\n  Writer: _N3Writer__WEBPACK_IMPORTED_MODULE_2__[\"default\"],\n  Store: _N3Store__WEBPACK_IMPORTED_MODULE_3__[\"default\"],\n  StreamParser: _N3StreamParser__WEBPACK_IMPORTED_MODULE_4__[\"default\"],\n  StreamWriter: _N3StreamWriter__WEBPACK_IMPORTED_MODULE_5__[\"default\"],\n  Util: _N3Util__WEBPACK_IMPORTED_MODULE_6__,\n\n  DataFactory: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__[\"default\"],\n\n  Term: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Term,\n  NamedNode: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.NamedNode,\n  Literal: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Literal,\n  BlankNode: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.BlankNode,\n  Variable: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Variable,\n  DefaultGraph: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.DefaultGraph,\n  Quad: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Quad,\n  Triple: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.Triple,\n\n  termFromId: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.termFromId,\n  termToId: _N3DataFactory__WEBPACK_IMPORTED_MODULE_7__.termToId,\n});\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/n3/src/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/process/browser.js":
+/*!*****************************************!*\
+  !*** ./node_modules/process/browser.js ***!
+  \*****************************************/
+/***/ ((module) => {
+
+eval("// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/process/browser.js?");
+
+/***/ }),
+
+/***/ "./node_modules/queue-microtask/index.js":
+/*!***********************************************!*\
+  !*** ./node_modules/queue-microtask/index.js ***!
+  \***********************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n  ? queueMicrotask.bind(typeof window !== 'undefined' ? window : __webpack_require__.g)\n  // reuse resolved promise, and allocate it lazily\n  : cb => (promise || (promise = Promise.resolve()))\n    .then(cb)\n    .catch(err => setTimeout(() => { throw err }, 0))\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/queue-microtask/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js":
+/*!*******************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js ***!
+  \*******************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { AbortError, codes } = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { isNodeStream, isWebStream, kControllerErrorFunction } = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst eos = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nconst { ERR_INVALID_ARG_TYPE } = codes\n\n// This method is inlined here for readable-stream\n// It also does not allow for signal to not exist on the stream\n// https://github.com/nodejs/node/pull/36061#discussion_r533718029\nconst validateAbortSignal = (signal, name) => {\n  if (typeof signal !== 'object' || !('aborted' in signal)) {\n    throw new ERR_INVALID_ARG_TYPE(name, 'AbortSignal', signal)\n  }\n}\nmodule.exports.addAbortSignal = function addAbortSignal(signal, stream) {\n  validateAbortSignal(signal, 'signal')\n  if (!isNodeStream(stream) && !isWebStream(stream)) {\n    throw new ERR_INVALID_ARG_TYPE('stream', ['ReadableStream', 'WritableStream', 'Stream'], stream)\n  }\n  return module.exports.addAbortSignalNoValidate(signal, stream)\n}\nmodule.exports.addAbortSignalNoValidate = function (signal, stream) {\n  if (typeof signal !== 'object' || !('aborted' in signal)) {\n    return stream\n  }\n  const onAbort = isNodeStream(stream)\n    ? () => {\n        stream.destroy(\n          new AbortError(undefined, {\n            cause: signal.reason\n          })\n        )\n      }\n    : () => {\n        stream[kControllerErrorFunction](\n          new AbortError(undefined, {\n            cause: signal.reason\n          })\n        )\n      }\n  if (signal.aborted) {\n    onAbort()\n  } else {\n    signal.addEventListener('abort', onAbort)\n    eos(stream, () => signal.removeEventListener('abort', onAbort))\n  }\n  return stream\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/buffer_list.js":
+/*!**************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/buffer_list.js ***!
+  \**************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { StringPrototypeSlice, SymbolIterator, TypedArrayPrototypeSet, Uint8Array } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { Buffer } = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst { inspect } = __webpack_require__(/*! ../../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nmodule.exports = class BufferList {\n  constructor() {\n    this.head = null\n    this.tail = null\n    this.length = 0\n  }\n  push(v) {\n    const entry = {\n      data: v,\n      next: null\n    }\n    if (this.length > 0) this.tail.next = entry\n    else this.head = entry\n    this.tail = entry\n    ++this.length\n  }\n  unshift(v) {\n    const entry = {\n      data: v,\n      next: this.head\n    }\n    if (this.length === 0) this.tail = entry\n    this.head = entry\n    ++this.length\n  }\n  shift() {\n    if (this.length === 0) return\n    const ret = this.head.data\n    if (this.length === 1) this.head = this.tail = null\n    else this.head = this.head.next\n    --this.length\n    return ret\n  }\n  clear() {\n    this.head = this.tail = null\n    this.length = 0\n  }\n  join(s) {\n    if (this.length === 0) return ''\n    let p = this.head\n    let ret = '' + p.data\n    while ((p = p.next) !== null) ret += s + p.data\n    return ret\n  }\n  concat(n) {\n    if (this.length === 0) return Buffer.alloc(0)\n    const ret = Buffer.allocUnsafe(n >>> 0)\n    let p = this.head\n    let i = 0\n    while (p) {\n      TypedArrayPrototypeSet(ret, p.data, i)\n      i += p.data.length\n      p = p.next\n    }\n    return ret\n  }\n\n  // Consumes a specified amount of bytes or characters from the buffered data.\n  consume(n, hasStrings) {\n    const data = this.head.data\n    if (n < data.length) {\n      // `slice` is the same for buffers and strings.\n      const slice = data.slice(0, n)\n      this.head.data = data.slice(n)\n      return slice\n    }\n    if (n === data.length) {\n      // First chunk is a perfect match.\n      return this.shift()\n    }\n    // Result spans more than one buffer.\n    return hasStrings ? this._getString(n) : this._getBuffer(n)\n  }\n  first() {\n    return this.head.data\n  }\n  *[SymbolIterator]() {\n    for (let p = this.head; p; p = p.next) {\n      yield p.data\n    }\n  }\n\n  // Consumes a specified amount of characters from the buffered data.\n  _getString(n) {\n    let ret = ''\n    let p = this.head\n    let c = 0\n    do {\n      const str = p.data\n      if (n > str.length) {\n        ret += str\n        n -= str.length\n      } else {\n        if (n === str.length) {\n          ret += str\n          ++c\n          if (p.next) this.head = p.next\n          else this.head = this.tail = null\n        } else {\n          ret += StringPrototypeSlice(str, 0, n)\n          this.head = p\n          p.data = StringPrototypeSlice(str, n)\n        }\n        break\n      }\n      ++c\n    } while ((p = p.next) !== null)\n    this.length -= c\n    return ret\n  }\n\n  // Consumes a specified amount of bytes from the buffered data.\n  _getBuffer(n) {\n    const ret = Buffer.allocUnsafe(n)\n    const retLen = n\n    let p = this.head\n    let c = 0\n    do {\n      const buf = p.data\n      if (n > buf.length) {\n        TypedArrayPrototypeSet(ret, buf, retLen - n)\n        n -= buf.length\n      } else {\n        if (n === buf.length) {\n          TypedArrayPrototypeSet(ret, buf, retLen - n)\n          ++c\n          if (p.next) this.head = p.next\n          else this.head = this.tail = null\n        } else {\n          TypedArrayPrototypeSet(ret, new Uint8Array(buf.buffer, buf.byteOffset, n), retLen - n)\n          this.head = p\n          p.data = buf.slice(n)\n        }\n        break\n      }\n      ++c\n    } while ((p = p.next) !== null)\n    this.length -= c\n    return ret\n  }\n\n  // Make sure the linked list only shows the minimal necessary information.\n  [Symbol.for('nodejs.util.inspect.custom')](_, options) {\n    return inspect(this, {\n      ...options,\n      // Only inspect one level.\n      depth: 0,\n      // It should not recurse.\n      customInspect: false\n    })\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/buffer_list.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/compose.js":
+/*!**********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/compose.js ***!
+  \**********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { pipeline } = __webpack_require__(/*! ./pipeline */ \"./node_modules/readable-stream/lib/internal/streams/pipeline.js\")\nconst Duplex = __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\nconst { destroyer } = __webpack_require__(/*! ./destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst {\n  isNodeStream,\n  isReadable,\n  isWritable,\n  isWebStream,\n  isTransformStream,\n  isWritableStream,\n  isReadableStream\n} = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst {\n  AbortError,\n  codes: { ERR_INVALID_ARG_VALUE, ERR_MISSING_ARGS }\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst eos = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nmodule.exports = function compose(...streams) {\n  if (streams.length === 0) {\n    throw new ERR_MISSING_ARGS('streams')\n  }\n  if (streams.length === 1) {\n    return Duplex.from(streams[0])\n  }\n  const orgStreams = [...streams]\n  if (typeof streams[0] === 'function') {\n    streams[0] = Duplex.from(streams[0])\n  }\n  if (typeof streams[streams.length - 1] === 'function') {\n    const idx = streams.length - 1\n    streams[idx] = Duplex.from(streams[idx])\n  }\n  for (let n = 0; n < streams.length; ++n) {\n    if (!isNodeStream(streams[n]) && !isWebStream(streams[n])) {\n      // TODO(ronag): Add checks for non streams.\n      continue\n    }\n    if (\n      n < streams.length - 1 &&\n      !(isReadable(streams[n]) || isReadableStream(streams[n]) || isTransformStream(streams[n]))\n    ) {\n      throw new ERR_INVALID_ARG_VALUE(`streams[${n}]`, orgStreams[n], 'must be readable')\n    }\n    if (n > 0 && !(isWritable(streams[n]) || isWritableStream(streams[n]) || isTransformStream(streams[n]))) {\n      throw new ERR_INVALID_ARG_VALUE(`streams[${n}]`, orgStreams[n], 'must be writable')\n    }\n  }\n  let ondrain\n  let onfinish\n  let onreadable\n  let onclose\n  let d\n  function onfinished(err) {\n    const cb = onclose\n    onclose = null\n    if (cb) {\n      cb(err)\n    } else if (err) {\n      d.destroy(err)\n    } else if (!readable && !writable) {\n      d.destroy()\n    }\n  }\n  const head = streams[0]\n  const tail = pipeline(streams, onfinished)\n  const writable = !!(isWritable(head) || isWritableStream(head) || isTransformStream(head))\n  const readable = !!(isReadable(tail) || isReadableStream(tail) || isTransformStream(tail))\n\n  // TODO(ronag): Avoid double buffering.\n  // Implement Writable/Readable/Duplex traits.\n  // See, https://github.com/nodejs/node/pull/33515.\n  d = new Duplex({\n    // TODO (ronag): highWaterMark?\n    writableObjectMode: !!(head !== null && head !== undefined && head.writableObjectMode),\n    readableObjectMode: !!(tail !== null && tail !== undefined && tail.writableObjectMode),\n    writable,\n    readable\n  })\n  if (writable) {\n    if (isNodeStream(head)) {\n      d._write = function (chunk, encoding, callback) {\n        if (head.write(chunk, encoding)) {\n          callback()\n        } else {\n          ondrain = callback\n        }\n      }\n      d._final = function (callback) {\n        head.end()\n        onfinish = callback\n      }\n      head.on('drain', function () {\n        if (ondrain) {\n          const cb = ondrain\n          ondrain = null\n          cb()\n        }\n      })\n    } else if (isWebStream(head)) {\n      const writable = isTransformStream(head) ? head.writable : head\n      const writer = writable.getWriter()\n      d._write = async function (chunk, encoding, callback) {\n        try {\n          await writer.ready\n          writer.write(chunk).catch(() => {})\n          callback()\n        } catch (err) {\n          callback(err)\n        }\n      }\n      d._final = async function (callback) {\n        try {\n          await writer.ready\n          writer.close().catch(() => {})\n          onfinish = callback\n        } catch (err) {\n          callback(err)\n        }\n      }\n    }\n    const toRead = isTransformStream(tail) ? tail.readable : tail\n    eos(toRead, () => {\n      if (onfinish) {\n        const cb = onfinish\n        onfinish = null\n        cb()\n      }\n    })\n  }\n  if (readable) {\n    if (isNodeStream(tail)) {\n      tail.on('readable', function () {\n        if (onreadable) {\n          const cb = onreadable\n          onreadable = null\n          cb()\n        }\n      })\n      tail.on('end', function () {\n        d.push(null)\n      })\n      d._read = function () {\n        while (true) {\n          const buf = tail.read()\n          if (buf === null) {\n            onreadable = d._read\n            return\n          }\n          if (!d.push(buf)) {\n            return\n          }\n        }\n      }\n    } else if (isWebStream(tail)) {\n      const readable = isTransformStream(tail) ? tail.readable : tail\n      const reader = readable.getReader()\n      d._read = async function () {\n        while (true) {\n          try {\n            const { value, done } = await reader.read()\n            if (!d.push(value)) {\n              return\n            }\n            if (done) {\n              d.push(null)\n              return\n            }\n          } catch {\n            return\n          }\n        }\n      }\n    }\n  }\n  d._destroy = function (err, callback) {\n    if (!err && onclose !== null) {\n      err = new AbortError()\n    }\n    onreadable = null\n    ondrain = null\n    onfinish = null\n    if (onclose === null) {\n      callback(err)\n    } else {\n      onclose = callback\n      if (isNodeStream(tail)) {\n        destroyer(tail, err)\n      }\n    }\n  }\n  return d\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/compose.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/destroy.js":
+/*!**********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/destroy.js ***!
+  \**********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\n/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n\nconst {\n  aggregateTwoErrors,\n  codes: { ERR_MULTIPLE_CALLBACK },\n  AbortError\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { Symbol } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { kDestroyed, isDestroyed, isFinished, isServerRequest } = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst kDestroy = Symbol('kDestroy')\nconst kConstruct = Symbol('kConstruct')\nfunction checkError(err, w, r) {\n  if (err) {\n    // Avoid V8 leak, https://github.com/nodejs/node/pull/34103#issuecomment-652002364\n    err.stack // eslint-disable-line no-unused-expressions\n\n    if (w && !w.errored) {\n      w.errored = err\n    }\n    if (r && !r.errored) {\n      r.errored = err\n    }\n  }\n}\n\n// Backwards compat. cb() is undocumented and unused in core but\n// unfortunately might be used by modules.\nfunction destroy(err, cb) {\n  const r = this._readableState\n  const w = this._writableState\n  // With duplex streams we use the writable side for state.\n  const s = w || r\n  if ((w !== null && w !== undefined && w.destroyed) || (r !== null && r !== undefined && r.destroyed)) {\n    if (typeof cb === 'function') {\n      cb()\n    }\n    return this\n  }\n\n  // We set destroyed to true before firing error callbacks in order\n  // to make it re-entrance safe in case destroy() is called within callbacks\n  checkError(err, w, r)\n  if (w) {\n    w.destroyed = true\n  }\n  if (r) {\n    r.destroyed = true\n  }\n\n  // If still constructing then defer calling _destroy.\n  if (!s.constructed) {\n    this.once(kDestroy, function (er) {\n      _destroy(this, aggregateTwoErrors(er, err), cb)\n    })\n  } else {\n    _destroy(this, err, cb)\n  }\n  return this\n}\nfunction _destroy(self, err, cb) {\n  let called = false\n  function onDestroy(err) {\n    if (called) {\n      return\n    }\n    called = true\n    const r = self._readableState\n    const w = self._writableState\n    checkError(err, w, r)\n    if (w) {\n      w.closed = true\n    }\n    if (r) {\n      r.closed = true\n    }\n    if (typeof cb === 'function') {\n      cb(err)\n    }\n    if (err) {\n      process.nextTick(emitErrorCloseNT, self, err)\n    } else {\n      process.nextTick(emitCloseNT, self)\n    }\n  }\n  try {\n    self._destroy(err || null, onDestroy)\n  } catch (err) {\n    onDestroy(err)\n  }\n}\nfunction emitErrorCloseNT(self, err) {\n  emitErrorNT(self, err)\n  emitCloseNT(self)\n}\nfunction emitCloseNT(self) {\n  const r = self._readableState\n  const w = self._writableState\n  if (w) {\n    w.closeEmitted = true\n  }\n  if (r) {\n    r.closeEmitted = true\n  }\n  if ((w !== null && w !== undefined && w.emitClose) || (r !== null && r !== undefined && r.emitClose)) {\n    self.emit('close')\n  }\n}\nfunction emitErrorNT(self, err) {\n  const r = self._readableState\n  const w = self._writableState\n  if ((w !== null && w !== undefined && w.errorEmitted) || (r !== null && r !== undefined && r.errorEmitted)) {\n    return\n  }\n  if (w) {\n    w.errorEmitted = true\n  }\n  if (r) {\n    r.errorEmitted = true\n  }\n  self.emit('error', err)\n}\nfunction undestroy() {\n  const r = this._readableState\n  const w = this._writableState\n  if (r) {\n    r.constructed = true\n    r.closed = false\n    r.closeEmitted = false\n    r.destroyed = false\n    r.errored = null\n    r.errorEmitted = false\n    r.reading = false\n    r.ended = r.readable === false\n    r.endEmitted = r.readable === false\n  }\n  if (w) {\n    w.constructed = true\n    w.destroyed = false\n    w.closed = false\n    w.closeEmitted = false\n    w.errored = null\n    w.errorEmitted = false\n    w.finalCalled = false\n    w.prefinished = false\n    w.ended = w.writable === false\n    w.ending = w.writable === false\n    w.finished = w.writable === false\n  }\n}\nfunction errorOrDestroy(stream, err, sync) {\n  // We have tests that rely on errors being emitted\n  // in the same tick, so changing this is semver major.\n  // For now when you opt-in to autoDestroy we allow\n  // the error to be emitted nextTick. In a future\n  // semver major update we should change the default to this.\n\n  const r = stream._readableState\n  const w = stream._writableState\n  if ((w !== null && w !== undefined && w.destroyed) || (r !== null && r !== undefined && r.destroyed)) {\n    return this\n  }\n  if ((r !== null && r !== undefined && r.autoDestroy) || (w !== null && w !== undefined && w.autoDestroy))\n    stream.destroy(err)\n  else if (err) {\n    // Avoid V8 leak, https://github.com/nodejs/node/pull/34103#issuecomment-652002364\n    err.stack // eslint-disable-line no-unused-expressions\n\n    if (w && !w.errored) {\n      w.errored = err\n    }\n    if (r && !r.errored) {\n      r.errored = err\n    }\n    if (sync) {\n      process.nextTick(emitErrorNT, stream, err)\n    } else {\n      emitErrorNT(stream, err)\n    }\n  }\n}\nfunction construct(stream, cb) {\n  if (typeof stream._construct !== 'function') {\n    return\n  }\n  const r = stream._readableState\n  const w = stream._writableState\n  if (r) {\n    r.constructed = false\n  }\n  if (w) {\n    w.constructed = false\n  }\n  stream.once(kConstruct, cb)\n  if (stream.listenerCount(kConstruct) > 1) {\n    // Duplex\n    return\n  }\n  process.nextTick(constructNT, stream)\n}\nfunction constructNT(stream) {\n  let called = false\n  function onConstruct(err) {\n    if (called) {\n      errorOrDestroy(stream, err !== null && err !== undefined ? err : new ERR_MULTIPLE_CALLBACK())\n      return\n    }\n    called = true\n    const r = stream._readableState\n    const w = stream._writableState\n    const s = w || r\n    if (r) {\n      r.constructed = true\n    }\n    if (w) {\n      w.constructed = true\n    }\n    if (s.destroyed) {\n      stream.emit(kDestroy, err)\n    } else if (err) {\n      errorOrDestroy(stream, err, true)\n    } else {\n      process.nextTick(emitConstructNT, stream)\n    }\n  }\n  try {\n    stream._construct((err) => {\n      process.nextTick(onConstruct, err)\n    })\n  } catch (err) {\n    process.nextTick(onConstruct, err)\n  }\n}\nfunction emitConstructNT(stream) {\n  stream.emit(kConstruct)\n}\nfunction isRequest(stream) {\n  return (stream === null || stream === undefined ? undefined : stream.setHeader) && typeof stream.abort === 'function'\n}\nfunction emitCloseLegacy(stream) {\n  stream.emit('close')\n}\nfunction emitErrorCloseLegacy(stream, err) {\n  stream.emit('error', err)\n  process.nextTick(emitCloseLegacy, stream)\n}\n\n// Normalize destroy for legacy.\nfunction destroyer(stream, err) {\n  if (!stream || isDestroyed(stream)) {\n    return\n  }\n  if (!err && !isFinished(stream)) {\n    err = new AbortError()\n  }\n\n  // TODO: Remove isRequest branches.\n  if (isServerRequest(stream)) {\n    stream.socket = null\n    stream.destroy(err)\n  } else if (isRequest(stream)) {\n    stream.abort()\n  } else if (isRequest(stream.req)) {\n    stream.req.abort()\n  } else if (typeof stream.destroy === 'function') {\n    stream.destroy(err)\n  } else if (typeof stream.close === 'function') {\n    // TODO: Don't lose err?\n    stream.close()\n  } else if (err) {\n    process.nextTick(emitErrorCloseLegacy, stream, err)\n  } else {\n    process.nextTick(emitCloseLegacy, stream)\n  }\n  if (!stream.destroyed) {\n    stream[kDestroyed] = true\n  }\n}\nmodule.exports = {\n  construct,\n  destroyer,\n  destroy,\n  undestroy,\n  errorOrDestroy\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/destroy.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/duplex.js":
+/*!*********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/duplex.js ***!
+  \*********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototype inheritance, this class\n// prototypically inherits from Readable, and then parasitically from\n// Writable.\n\n\n\nconst {\n  ObjectDefineProperties,\n  ObjectGetOwnPropertyDescriptor,\n  ObjectKeys,\n  ObjectSetPrototypeOf\n} = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nmodule.exports = Duplex\nconst Readable = __webpack_require__(/*! ./readable */ \"./node_modules/readable-stream/lib/internal/streams/readable.js\")\nconst Writable = __webpack_require__(/*! ./writable */ \"./node_modules/readable-stream/lib/internal/streams/writable.js\")\nObjectSetPrototypeOf(Duplex.prototype, Readable.prototype)\nObjectSetPrototypeOf(Duplex, Readable)\n{\n  const keys = ObjectKeys(Writable.prototype)\n  // Allow the keys array to be GC'ed.\n  for (let i = 0; i < keys.length; i++) {\n    const method = keys[i]\n    if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method]\n  }\n}\nfunction Duplex(options) {\n  if (!(this instanceof Duplex)) return new Duplex(options)\n  Readable.call(this, options)\n  Writable.call(this, options)\n  if (options) {\n    this.allowHalfOpen = options.allowHalfOpen !== false\n    if (options.readable === false) {\n      this._readableState.readable = false\n      this._readableState.ended = true\n      this._readableState.endEmitted = true\n    }\n    if (options.writable === false) {\n      this._writableState.writable = false\n      this._writableState.ending = true\n      this._writableState.ended = true\n      this._writableState.finished = true\n    }\n  } else {\n    this.allowHalfOpen = true\n  }\n}\nObjectDefineProperties(Duplex.prototype, {\n  writable: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writable')\n  },\n  writableHighWaterMark: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableHighWaterMark')\n  },\n  writableObjectMode: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableObjectMode')\n  },\n  writableBuffer: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableBuffer')\n  },\n  writableLength: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableLength')\n  },\n  writableFinished: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableFinished')\n  },\n  writableCorked: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableCorked')\n  },\n  writableEnded: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableEnded')\n  },\n  writableNeedDrain: {\n    __proto__: null,\n    ...ObjectGetOwnPropertyDescriptor(Writable.prototype, 'writableNeedDrain')\n  },\n  destroyed: {\n    __proto__: null,\n    get() {\n      if (this._readableState === undefined || this._writableState === undefined) {\n        return false\n      }\n      return this._readableState.destroyed && this._writableState.destroyed\n    },\n    set(value) {\n      // Backward compatibility, the user is explicitly\n      // managing destroyed.\n      if (this._readableState && this._writableState) {\n        this._readableState.destroyed = value\n        this._writableState.destroyed = value\n      }\n    }\n  }\n})\nlet webStreamsAdapters\n\n// Lazy to avoid circular references\nfunction lazyWebStreams() {\n  if (webStreamsAdapters === undefined) webStreamsAdapters = {}\n  return webStreamsAdapters\n}\nDuplex.fromWeb = function (pair, options) {\n  return lazyWebStreams().newStreamDuplexFromReadableWritablePair(pair, options)\n}\nDuplex.toWeb = function (duplex) {\n  return lazyWebStreams().newReadableWritablePairFromDuplex(duplex)\n}\nlet duplexify\nDuplex.from = function (body) {\n  if (!duplexify) {\n    duplexify = __webpack_require__(/*! ./duplexify */ \"./node_modules/readable-stream/lib/internal/streams/duplexify.js\")\n  }\n  return duplexify(body, 'body')\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/duplex.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/duplexify.js":
+/*!************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/duplexify.js ***!
+  \************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n\n;('use strict')\nconst bufferModule = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst {\n  isReadable,\n  isWritable,\n  isIterable,\n  isNodeStream,\n  isReadableNodeStream,\n  isWritableNodeStream,\n  isDuplexNodeStream\n} = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst eos = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nconst {\n  AbortError,\n  codes: { ERR_INVALID_ARG_TYPE, ERR_INVALID_RETURN_VALUE }\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { destroyer } = __webpack_require__(/*! ./destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst Duplex = __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\nconst Readable = __webpack_require__(/*! ./readable */ \"./node_modules/readable-stream/lib/internal/streams/readable.js\")\nconst { createDeferredPromise } = __webpack_require__(/*! ../../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nconst from = __webpack_require__(/*! ./from */ \"./node_modules/readable-stream/lib/internal/streams/from.js\")\nconst Blob = globalThis.Blob || bufferModule.Blob\nconst isBlob =\n  typeof Blob !== 'undefined'\n    ? function isBlob(b) {\n        return b instanceof Blob\n      }\n    : function isBlob(b) {\n        return false\n      }\nconst AbortController = globalThis.AbortController || (__webpack_require__(/*! abort-controller */ \"./node_modules/abort-controller/browser.js\").AbortController)\nconst { FunctionPrototypeCall } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\n\n// This is needed for pre node 17.\nclass Duplexify extends Duplex {\n  constructor(options) {\n    super(options)\n\n    // https://github.com/nodejs/node/pull/34385\n\n    if ((options === null || options === undefined ? undefined : options.readable) === false) {\n      this._readableState.readable = false\n      this._readableState.ended = true\n      this._readableState.endEmitted = true\n    }\n    if ((options === null || options === undefined ? undefined : options.writable) === false) {\n      this._writableState.writable = false\n      this._writableState.ending = true\n      this._writableState.ended = true\n      this._writableState.finished = true\n    }\n  }\n}\nmodule.exports = function duplexify(body, name) {\n  if (isDuplexNodeStream(body)) {\n    return body\n  }\n  if (isReadableNodeStream(body)) {\n    return _duplexify({\n      readable: body\n    })\n  }\n  if (isWritableNodeStream(body)) {\n    return _duplexify({\n      writable: body\n    })\n  }\n  if (isNodeStream(body)) {\n    return _duplexify({\n      writable: false,\n      readable: false\n    })\n  }\n\n  // TODO: Webstreams\n  // if (isReadableStream(body)) {\n  //   return _duplexify({ readable: Readable.fromWeb(body) });\n  // }\n\n  // TODO: Webstreams\n  // if (isWritableStream(body)) {\n  //   return _duplexify({ writable: Writable.fromWeb(body) });\n  // }\n\n  if (typeof body === 'function') {\n    const { value, write, final, destroy } = fromAsyncGen(body)\n    if (isIterable(value)) {\n      return from(Duplexify, value, {\n        // TODO (ronag): highWaterMark?\n        objectMode: true,\n        write,\n        final,\n        destroy\n      })\n    }\n    const then = value === null || value === undefined ? undefined : value.then\n    if (typeof then === 'function') {\n      let d\n      const promise = FunctionPrototypeCall(\n        then,\n        value,\n        (val) => {\n          if (val != null) {\n            throw new ERR_INVALID_RETURN_VALUE('nully', 'body', val)\n          }\n        },\n        (err) => {\n          destroyer(d, err)\n        }\n      )\n      return (d = new Duplexify({\n        // TODO (ronag): highWaterMark?\n        objectMode: true,\n        readable: false,\n        write,\n        final(cb) {\n          final(async () => {\n            try {\n              await promise\n              process.nextTick(cb, null)\n            } catch (err) {\n              process.nextTick(cb, err)\n            }\n          })\n        },\n        destroy\n      }))\n    }\n    throw new ERR_INVALID_RETURN_VALUE('Iterable, AsyncIterable or AsyncFunction', name, value)\n  }\n  if (isBlob(body)) {\n    return duplexify(body.arrayBuffer())\n  }\n  if (isIterable(body)) {\n    return from(Duplexify, body, {\n      // TODO (ronag): highWaterMark?\n      objectMode: true,\n      writable: false\n    })\n  }\n\n  // TODO: Webstreams.\n  // if (\n  //   isReadableStream(body?.readable) &&\n  //   isWritableStream(body?.writable)\n  // ) {\n  //   return Duplexify.fromWeb(body);\n  // }\n\n  if (\n    typeof (body === null || body === undefined ? undefined : body.writable) === 'object' ||\n    typeof (body === null || body === undefined ? undefined : body.readable) === 'object'\n  ) {\n    const readable =\n      body !== null && body !== undefined && body.readable\n        ? isReadableNodeStream(body === null || body === undefined ? undefined : body.readable)\n          ? body === null || body === undefined\n            ? undefined\n            : body.readable\n          : duplexify(body.readable)\n        : undefined\n    const writable =\n      body !== null && body !== undefined && body.writable\n        ? isWritableNodeStream(body === null || body === undefined ? undefined : body.writable)\n          ? body === null || body === undefined\n            ? undefined\n            : body.writable\n          : duplexify(body.writable)\n        : undefined\n    return _duplexify({\n      readable,\n      writable\n    })\n  }\n  const then = body === null || body === undefined ? undefined : body.then\n  if (typeof then === 'function') {\n    let d\n    FunctionPrototypeCall(\n      then,\n      body,\n      (val) => {\n        if (val != null) {\n          d.push(val)\n        }\n        d.push(null)\n      },\n      (err) => {\n        destroyer(d, err)\n      }\n    )\n    return (d = new Duplexify({\n      objectMode: true,\n      writable: false,\n      read() {}\n    }))\n  }\n  throw new ERR_INVALID_ARG_TYPE(\n    name,\n    [\n      'Blob',\n      'ReadableStream',\n      'WritableStream',\n      'Stream',\n      'Iterable',\n      'AsyncIterable',\n      'Function',\n      '{ readable, writable } pair',\n      'Promise'\n    ],\n    body\n  )\n}\nfunction fromAsyncGen(fn) {\n  let { promise, resolve } = createDeferredPromise()\n  const ac = new AbortController()\n  const signal = ac.signal\n  const value = fn(\n    (async function* () {\n      while (true) {\n        const _promise = promise\n        promise = null\n        const { chunk, done, cb } = await _promise\n        process.nextTick(cb)\n        if (done) return\n        if (signal.aborted)\n          throw new AbortError(undefined, {\n            cause: signal.reason\n          })\n        ;({ promise, resolve } = createDeferredPromise())\n        yield chunk\n      }\n    })(),\n    {\n      signal\n    }\n  )\n  return {\n    value,\n    write(chunk, encoding, cb) {\n      const _resolve = resolve\n      resolve = null\n      _resolve({\n        chunk,\n        done: false,\n        cb\n      })\n    },\n    final(cb) {\n      const _resolve = resolve\n      resolve = null\n      _resolve({\n        done: true,\n        cb\n      })\n    },\n    destroy(err, cb) {\n      ac.abort()\n      cb(err)\n    }\n  }\n}\nfunction _duplexify(pair) {\n  const r = pair.readable && typeof pair.readable.read !== 'function' ? Readable.wrap(pair.readable) : pair.readable\n  const w = pair.writable\n  let readable = !!isReadable(r)\n  let writable = !!isWritable(w)\n  let ondrain\n  let onfinish\n  let onreadable\n  let onclose\n  let d\n  function onfinished(err) {\n    const cb = onclose\n    onclose = null\n    if (cb) {\n      cb(err)\n    } else if (err) {\n      d.destroy(err)\n    }\n  }\n\n  // TODO(ronag): Avoid double buffering.\n  // Implement Writable/Readable/Duplex traits.\n  // See, https://github.com/nodejs/node/pull/33515.\n  d = new Duplexify({\n    // TODO (ronag): highWaterMark?\n    readableObjectMode: !!(r !== null && r !== undefined && r.readableObjectMode),\n    writableObjectMode: !!(w !== null && w !== undefined && w.writableObjectMode),\n    readable,\n    writable\n  })\n  if (writable) {\n    eos(w, (err) => {\n      writable = false\n      if (err) {\n        destroyer(r, err)\n      }\n      onfinished(err)\n    })\n    d._write = function (chunk, encoding, callback) {\n      if (w.write(chunk, encoding)) {\n        callback()\n      } else {\n        ondrain = callback\n      }\n    }\n    d._final = function (callback) {\n      w.end()\n      onfinish = callback\n    }\n    w.on('drain', function () {\n      if (ondrain) {\n        const cb = ondrain\n        ondrain = null\n        cb()\n      }\n    })\n    w.on('finish', function () {\n      if (onfinish) {\n        const cb = onfinish\n        onfinish = null\n        cb()\n      }\n    })\n  }\n  if (readable) {\n    eos(r, (err) => {\n      readable = false\n      if (err) {\n        destroyer(r, err)\n      }\n      onfinished(err)\n    })\n    r.on('readable', function () {\n      if (onreadable) {\n        const cb = onreadable\n        onreadable = null\n        cb()\n      }\n    })\n    r.on('end', function () {\n      d.push(null)\n    })\n    d._read = function () {\n      while (true) {\n        const buf = r.read()\n        if (buf === null) {\n          onreadable = d._read\n          return\n        }\n        if (!d.push(buf)) {\n          return\n        }\n      }\n    }\n  }\n  d._destroy = function (err, callback) {\n    if (!err && onclose !== null) {\n      err = new AbortError()\n    }\n    onreadable = null\n    ondrain = null\n    onfinish = null\n    if (onclose === null) {\n      callback(err)\n    } else {\n      onclose = callback\n      destroyer(w, err)\n      destroyer(r, err)\n    }\n  }\n  return d\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/duplexify.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js":
+/*!****************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/end-of-stream.js ***!
+  \****************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n\n;('use strict')\nconst { AbortError, codes } = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { ERR_INVALID_ARG_TYPE, ERR_STREAM_PREMATURE_CLOSE } = codes\nconst { kEmptyObject, once } = __webpack_require__(/*! ../../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nconst { validateAbortSignal, validateFunction, validateObject, validateBoolean } = __webpack_require__(/*! ../validators */ \"./node_modules/readable-stream/lib/internal/validators.js\")\nconst { Promise, PromisePrototypeThen } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst {\n  isClosed,\n  isReadable,\n  isReadableNodeStream,\n  isReadableStream,\n  isReadableFinished,\n  isReadableErrored,\n  isWritable,\n  isWritableNodeStream,\n  isWritableStream,\n  isWritableFinished,\n  isWritableErrored,\n  isNodeStream,\n  willEmitClose: _willEmitClose,\n  kIsClosedPromise\n} = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function'\n}\nconst nop = () => {}\nfunction eos(stream, options, callback) {\n  var _options$readable, _options$writable\n  if (arguments.length === 2) {\n    callback = options\n    options = kEmptyObject\n  } else if (options == null) {\n    options = kEmptyObject\n  } else {\n    validateObject(options, 'options')\n  }\n  validateFunction(callback, 'callback')\n  validateAbortSignal(options.signal, 'options.signal')\n  callback = once(callback)\n  if (isReadableStream(stream) || isWritableStream(stream)) {\n    return eosWeb(stream, options, callback)\n  }\n  if (!isNodeStream(stream)) {\n    throw new ERR_INVALID_ARG_TYPE('stream', ['ReadableStream', 'WritableStream', 'Stream'], stream)\n  }\n  const readable =\n    (_options$readable = options.readable) !== null && _options$readable !== undefined\n      ? _options$readable\n      : isReadableNodeStream(stream)\n  const writable =\n    (_options$writable = options.writable) !== null && _options$writable !== undefined\n      ? _options$writable\n      : isWritableNodeStream(stream)\n  const wState = stream._writableState\n  const rState = stream._readableState\n  const onlegacyfinish = () => {\n    if (!stream.writable) {\n      onfinish()\n    }\n  }\n\n  // TODO (ronag): Improve soft detection to include core modules and\n  // common ecosystem modules that do properly emit 'close' but fail\n  // this generic check.\n  let willEmitClose =\n    _willEmitClose(stream) && isReadableNodeStream(stream) === readable && isWritableNodeStream(stream) === writable\n  let writableFinished = isWritableFinished(stream, false)\n  const onfinish = () => {\n    writableFinished = true\n    // Stream should not be destroyed here. If it is that\n    // means that user space is doing something differently and\n    // we cannot trust willEmitClose.\n    if (stream.destroyed) {\n      willEmitClose = false\n    }\n    if (willEmitClose && (!stream.readable || readable)) {\n      return\n    }\n    if (!readable || readableFinished) {\n      callback.call(stream)\n    }\n  }\n  let readableFinished = isReadableFinished(stream, false)\n  const onend = () => {\n    readableFinished = true\n    // Stream should not be destroyed here. If it is that\n    // means that user space is doing something differently and\n    // we cannot trust willEmitClose.\n    if (stream.destroyed) {\n      willEmitClose = false\n    }\n    if (willEmitClose && (!stream.writable || writable)) {\n      return\n    }\n    if (!writable || writableFinished) {\n      callback.call(stream)\n    }\n  }\n  const onerror = (err) => {\n    callback.call(stream, err)\n  }\n  let closed = isClosed(stream)\n  const onclose = () => {\n    closed = true\n    const errored = isWritableErrored(stream) || isReadableErrored(stream)\n    if (errored && typeof errored !== 'boolean') {\n      return callback.call(stream, errored)\n    }\n    if (readable && !readableFinished && isReadableNodeStream(stream, true)) {\n      if (!isReadableFinished(stream, false)) return callback.call(stream, new ERR_STREAM_PREMATURE_CLOSE())\n    }\n    if (writable && !writableFinished) {\n      if (!isWritableFinished(stream, false)) return callback.call(stream, new ERR_STREAM_PREMATURE_CLOSE())\n    }\n    callback.call(stream)\n  }\n  const onclosed = () => {\n    closed = true\n    const errored = isWritableErrored(stream) || isReadableErrored(stream)\n    if (errored && typeof errored !== 'boolean') {\n      return callback.call(stream, errored)\n    }\n    callback.call(stream)\n  }\n  const onrequest = () => {\n    stream.req.on('finish', onfinish)\n  }\n  if (isRequest(stream)) {\n    stream.on('complete', onfinish)\n    if (!willEmitClose) {\n      stream.on('abort', onclose)\n    }\n    if (stream.req) {\n      onrequest()\n    } else {\n      stream.on('request', onrequest)\n    }\n  } else if (writable && !wState) {\n    // legacy streams\n    stream.on('end', onlegacyfinish)\n    stream.on('close', onlegacyfinish)\n  }\n\n  // Not all streams will emit 'close' after 'aborted'.\n  if (!willEmitClose && typeof stream.aborted === 'boolean') {\n    stream.on('aborted', onclose)\n  }\n  stream.on('end', onend)\n  stream.on('finish', onfinish)\n  if (options.error !== false) {\n    stream.on('error', onerror)\n  }\n  stream.on('close', onclose)\n  if (closed) {\n    process.nextTick(onclose)\n  } else if (\n    (wState !== null && wState !== undefined && wState.errorEmitted) ||\n    (rState !== null && rState !== undefined && rState.errorEmitted)\n  ) {\n    if (!willEmitClose) {\n      process.nextTick(onclosed)\n    }\n  } else if (\n    !readable &&\n    (!willEmitClose || isReadable(stream)) &&\n    (writableFinished || isWritable(stream) === false)\n  ) {\n    process.nextTick(onclosed)\n  } else if (\n    !writable &&\n    (!willEmitClose || isWritable(stream)) &&\n    (readableFinished || isReadable(stream) === false)\n  ) {\n    process.nextTick(onclosed)\n  } else if (rState && stream.req && stream.aborted) {\n    process.nextTick(onclosed)\n  }\n  const cleanup = () => {\n    callback = nop\n    stream.removeListener('aborted', onclose)\n    stream.removeListener('complete', onfinish)\n    stream.removeListener('abort', onclose)\n    stream.removeListener('request', onrequest)\n    if (stream.req) stream.req.removeListener('finish', onfinish)\n    stream.removeListener('end', onlegacyfinish)\n    stream.removeListener('close', onlegacyfinish)\n    stream.removeListener('finish', onfinish)\n    stream.removeListener('end', onend)\n    stream.removeListener('error', onerror)\n    stream.removeListener('close', onclose)\n  }\n  if (options.signal && !closed) {\n    const abort = () => {\n      // Keep it because cleanup removes it.\n      const endCallback = callback\n      cleanup()\n      endCallback.call(\n        stream,\n        new AbortError(undefined, {\n          cause: options.signal.reason\n        })\n      )\n    }\n    if (options.signal.aborted) {\n      process.nextTick(abort)\n    } else {\n      const originalCallback = callback\n      callback = once((...args) => {\n        options.signal.removeEventListener('abort', abort)\n        originalCallback.apply(stream, args)\n      })\n      options.signal.addEventListener('abort', abort)\n    }\n  }\n  return cleanup\n}\nfunction eosWeb(stream, options, callback) {\n  let isAborted = false\n  let abort = nop\n  if (options.signal) {\n    abort = () => {\n      isAborted = true\n      callback.call(\n        stream,\n        new AbortError(undefined, {\n          cause: options.signal.reason\n        })\n      )\n    }\n    if (options.signal.aborted) {\n      process.nextTick(abort)\n    } else {\n      const originalCallback = callback\n      callback = once((...args) => {\n        options.signal.removeEventListener('abort', abort)\n        originalCallback.apply(stream, args)\n      })\n      options.signal.addEventListener('abort', abort)\n    }\n  }\n  const resolverFn = (...args) => {\n    if (!isAborted) {\n      process.nextTick(() => callback.apply(stream, args))\n    }\n  }\n  PromisePrototypeThen(stream[kIsClosedPromise].promise, resolverFn, resolverFn)\n  return nop\n}\nfunction finished(stream, opts) {\n  var _opts\n  let autoCleanup = false\n  if (opts === null) {\n    opts = kEmptyObject\n  }\n  if ((_opts = opts) !== null && _opts !== undefined && _opts.cleanup) {\n    validateBoolean(opts.cleanup, 'cleanup')\n    autoCleanup = opts.cleanup\n  }\n  return new Promise((resolve, reject) => {\n    const cleanup = eos(stream, opts, (err) => {\n      if (autoCleanup) {\n        cleanup()\n      }\n      if (err) {\n        reject(err)\n      } else {\n        resolve()\n      }\n    })\n  })\n}\nmodule.exports = eos\nmodule.exports.finished = finished\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/end-of-stream.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/from.js":
+/*!*******************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/from.js ***!
+  \*******************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\n/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n\nconst { PromisePrototypeThen, SymbolAsyncIterator, SymbolIterator } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { Buffer } = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst { ERR_INVALID_ARG_TYPE, ERR_STREAM_NULL_VALUES } = (__webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\").codes)\nfunction from(Readable, iterable, opts) {\n  let iterator\n  if (typeof iterable === 'string' || iterable instanceof Buffer) {\n    return new Readable({\n      objectMode: true,\n      ...opts,\n      read() {\n        this.push(iterable)\n        this.push(null)\n      }\n    })\n  }\n  let isAsync\n  if (iterable && iterable[SymbolAsyncIterator]) {\n    isAsync = true\n    iterator = iterable[SymbolAsyncIterator]()\n  } else if (iterable && iterable[SymbolIterator]) {\n    isAsync = false\n    iterator = iterable[SymbolIterator]()\n  } else {\n    throw new ERR_INVALID_ARG_TYPE('iterable', ['Iterable'], iterable)\n  }\n  const readable = new Readable({\n    objectMode: true,\n    highWaterMark: 1,\n    // TODO(ronag): What options should be allowed?\n    ...opts\n  })\n\n  // Flag to protect against _read\n  // being called before last iteration completion.\n  let reading = false\n  readable._read = function () {\n    if (!reading) {\n      reading = true\n      next()\n    }\n  }\n  readable._destroy = function (error, cb) {\n    PromisePrototypeThen(\n      close(error),\n      () => process.nextTick(cb, error),\n      // nextTick is here in case cb throws\n      (e) => process.nextTick(cb, e || error)\n    )\n  }\n  async function close(error) {\n    const hadError = error !== undefined && error !== null\n    const hasThrow = typeof iterator.throw === 'function'\n    if (hadError && hasThrow) {\n      const { value, done } = await iterator.throw(error)\n      await value\n      if (done) {\n        return\n      }\n    }\n    if (typeof iterator.return === 'function') {\n      const { value } = await iterator.return()\n      await value\n    }\n  }\n  async function next() {\n    for (;;) {\n      try {\n        const { value, done } = isAsync ? await iterator.next() : iterator.next()\n        if (done) {\n          readable.push(null)\n        } else {\n          const res = value && typeof value.then === 'function' ? await value : value\n          if (res === null) {\n            reading = false\n            throw new ERR_STREAM_NULL_VALUES()\n          } else if (readable.push(res)) {\n            continue\n          } else {\n            reading = false\n          }\n        }\n      } catch (err) {\n        readable.destroy(err)\n      }\n      break\n    }\n  }\n  return readable\n}\nmodule.exports = from\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/from.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/legacy.js":
+/*!*********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/legacy.js ***!
+  \*********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { ArrayIsArray, ObjectSetPrototypeOf } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { EventEmitter: EE } = __webpack_require__(/*! events */ \"./node_modules/events/events.js\")\nfunction Stream(opts) {\n  EE.call(this, opts)\n}\nObjectSetPrototypeOf(Stream.prototype, EE.prototype)\nObjectSetPrototypeOf(Stream, EE)\nStream.prototype.pipe = function (dest, options) {\n  const source = this\n  function ondata(chunk) {\n    if (dest.writable && dest.write(chunk) === false && source.pause) {\n      source.pause()\n    }\n  }\n  source.on('data', ondata)\n  function ondrain() {\n    if (source.readable && source.resume) {\n      source.resume()\n    }\n  }\n  dest.on('drain', ondrain)\n\n  // If the 'end' option is not supplied, dest.end() will be called when\n  // source gets the 'end' or 'close' events.  Only dest.end() once.\n  if (!dest._isStdio && (!options || options.end !== false)) {\n    source.on('end', onend)\n    source.on('close', onclose)\n  }\n  let didOnEnd = false\n  function onend() {\n    if (didOnEnd) return\n    didOnEnd = true\n    dest.end()\n  }\n  function onclose() {\n    if (didOnEnd) return\n    didOnEnd = true\n    if (typeof dest.destroy === 'function') dest.destroy()\n  }\n\n  // Don't leave dangling pipes when there are errors.\n  function onerror(er) {\n    cleanup()\n    if (EE.listenerCount(this, 'error') === 0) {\n      this.emit('error', er)\n    }\n  }\n  prependListener(source, 'error', onerror)\n  prependListener(dest, 'error', onerror)\n\n  // Remove all the event listeners that were added.\n  function cleanup() {\n    source.removeListener('data', ondata)\n    dest.removeListener('drain', ondrain)\n    source.removeListener('end', onend)\n    source.removeListener('close', onclose)\n    source.removeListener('error', onerror)\n    dest.removeListener('error', onerror)\n    source.removeListener('end', cleanup)\n    source.removeListener('close', cleanup)\n    dest.removeListener('close', cleanup)\n  }\n  source.on('end', cleanup)\n  source.on('close', cleanup)\n  dest.on('close', cleanup)\n  dest.emit('pipe', source)\n\n  // Allow for unix-like usage: A.pipe(B).pipe(C)\n  return dest\n}\nfunction prependListener(emitter, event, fn) {\n  // Sadly this is not cacheable as some libraries bundle their own\n  // event emitter implementation with them.\n  if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn)\n\n  // This is a hack to make sure that our error handler is attached before any\n  // userland ones.  NEVER DO THIS. This is here only because this code needs\n  // to continue to work with older versions of Node.js that do not include\n  // the prependListener() method. The goal is to eventually remove this hack.\n  if (!emitter._events || !emitter._events[event]) emitter.on(event, fn)\n  else if (ArrayIsArray(emitter._events[event])) emitter._events[event].unshift(fn)\n  else emitter._events[event] = [fn, emitter._events[event]]\n}\nmodule.exports = {\n  Stream,\n  prependListener\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/legacy.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/operators.js":
+/*!************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/operators.js ***!
+  \************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst AbortController = globalThis.AbortController || (__webpack_require__(/*! abort-controller */ \"./node_modules/abort-controller/browser.js\").AbortController)\nconst {\n  codes: { ERR_INVALID_ARG_VALUE, ERR_INVALID_ARG_TYPE, ERR_MISSING_ARGS, ERR_OUT_OF_RANGE },\n  AbortError\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { validateAbortSignal, validateInteger, validateObject } = __webpack_require__(/*! ../validators */ \"./node_modules/readable-stream/lib/internal/validators.js\")\nconst kWeakHandler = (__webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\").Symbol)('kWeak')\nconst { finished } = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nconst staticCompose = __webpack_require__(/*! ./compose */ \"./node_modules/readable-stream/lib/internal/streams/compose.js\")\nconst { addAbortSignalNoValidate } = __webpack_require__(/*! ./add-abort-signal */ \"./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js\")\nconst { isWritable, isNodeStream } = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst {\n  ArrayPrototypePush,\n  MathFloor,\n  Number,\n  NumberIsNaN,\n  Promise,\n  PromiseReject,\n  PromisePrototypeThen,\n  Symbol\n} = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst kEmpty = Symbol('kEmpty')\nconst kEof = Symbol('kEof')\nfunction compose(stream, options) {\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  if (isNodeStream(stream) && !isWritable(stream)) {\n    throw new ERR_INVALID_ARG_VALUE('stream', stream, 'must be writable')\n  }\n  const composedStream = staticCompose(this, stream)\n  if (options !== null && options !== undefined && options.signal) {\n    // Not validating as we already validated before\n    addAbortSignalNoValidate(options.signal, composedStream)\n  }\n  return composedStream\n}\nfunction map(fn, options) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', ['Function', 'AsyncFunction'], fn)\n  }\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  let concurrency = 1\n  if ((options === null || options === undefined ? undefined : options.concurrency) != null) {\n    concurrency = MathFloor(options.concurrency)\n  }\n  validateInteger(concurrency, 'concurrency', 1)\n  return async function* map() {\n    var _options$signal, _options$signal2\n    const ac = new AbortController()\n    const stream = this\n    const queue = []\n    const signal = ac.signal\n    const signalOpt = {\n      signal\n    }\n    const abort = () => ac.abort()\n    if (\n      options !== null &&\n      options !== undefined &&\n      (_options$signal = options.signal) !== null &&\n      _options$signal !== undefined &&\n      _options$signal.aborted\n    ) {\n      abort()\n    }\n    options === null || options === undefined\n      ? undefined\n      : (_options$signal2 = options.signal) === null || _options$signal2 === undefined\n      ? undefined\n      : _options$signal2.addEventListener('abort', abort)\n    let next\n    let resume\n    let done = false\n    function onDone() {\n      done = true\n    }\n    async function pump() {\n      try {\n        for await (let val of stream) {\n          var _val\n          if (done) {\n            return\n          }\n          if (signal.aborted) {\n            throw new AbortError()\n          }\n          try {\n            val = fn(val, signalOpt)\n          } catch (err) {\n            val = PromiseReject(err)\n          }\n          if (val === kEmpty) {\n            continue\n          }\n          if (typeof ((_val = val) === null || _val === undefined ? undefined : _val.catch) === 'function') {\n            val.catch(onDone)\n          }\n          queue.push(val)\n          if (next) {\n            next()\n            next = null\n          }\n          if (!done && queue.length && queue.length >= concurrency) {\n            await new Promise((resolve) => {\n              resume = resolve\n            })\n          }\n        }\n        queue.push(kEof)\n      } catch (err) {\n        const val = PromiseReject(err)\n        PromisePrototypeThen(val, undefined, onDone)\n        queue.push(val)\n      } finally {\n        var _options$signal3\n        done = true\n        if (next) {\n          next()\n          next = null\n        }\n        options === null || options === undefined\n          ? undefined\n          : (_options$signal3 = options.signal) === null || _options$signal3 === undefined\n          ? undefined\n          : _options$signal3.removeEventListener('abort', abort)\n      }\n    }\n    pump()\n    try {\n      while (true) {\n        while (queue.length > 0) {\n          const val = await queue[0]\n          if (val === kEof) {\n            return\n          }\n          if (signal.aborted) {\n            throw new AbortError()\n          }\n          if (val !== kEmpty) {\n            yield val\n          }\n          queue.shift()\n          if (resume) {\n            resume()\n            resume = null\n          }\n        }\n        await new Promise((resolve) => {\n          next = resolve\n        })\n      }\n    } finally {\n      ac.abort()\n      done = true\n      if (resume) {\n        resume()\n        resume = null\n      }\n    }\n  }.call(this)\n}\nfunction asIndexedPairs(options = undefined) {\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  return async function* asIndexedPairs() {\n    let index = 0\n    for await (const val of this) {\n      var _options$signal4\n      if (\n        options !== null &&\n        options !== undefined &&\n        (_options$signal4 = options.signal) !== null &&\n        _options$signal4 !== undefined &&\n        _options$signal4.aborted\n      ) {\n        throw new AbortError({\n          cause: options.signal.reason\n        })\n      }\n      yield [index++, val]\n    }\n  }.call(this)\n}\nasync function some(fn, options = undefined) {\n  for await (const unused of filter.call(this, fn, options)) {\n    return true\n  }\n  return false\n}\nasync function every(fn, options = undefined) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', ['Function', 'AsyncFunction'], fn)\n  }\n  // https://en.wikipedia.org/wiki/De_Morgan%27s_laws\n  return !(await some.call(\n    this,\n    async (...args) => {\n      return !(await fn(...args))\n    },\n    options\n  ))\n}\nasync function find(fn, options) {\n  for await (const result of filter.call(this, fn, options)) {\n    return result\n  }\n  return undefined\n}\nasync function forEach(fn, options) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', ['Function', 'AsyncFunction'], fn)\n  }\n  async function forEachFn(value, options) {\n    await fn(value, options)\n    return kEmpty\n  }\n  // eslint-disable-next-line no-unused-vars\n  for await (const unused of map.call(this, forEachFn, options));\n}\nfunction filter(fn, options) {\n  if (typeof fn !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('fn', ['Function', 'AsyncFunction'], fn)\n  }\n  async function filterFn(value, options) {\n    if (await fn(value, options)) {\n      return value\n    }\n    return kEmpty\n  }\n  return map.call(this, filterFn, options)\n}\n\n// Specific to provide better error to reduce since the argument is only\n// missing if the stream has no items in it - but the code is still appropriate\nclass ReduceAwareErrMissingArgs extends ERR_MISSING_ARGS {\n  constructor() {\n    super('reduce')\n    this.message = 'Reduce of an empty stream requires an initial value'\n  }\n}\nasync function reduce(reducer, initialValue, options) {\n  var _options$signal5\n  if (typeof reducer !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE('reducer', ['Function', 'AsyncFunction'], reducer)\n  }\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  let hasInitialValue = arguments.length > 1\n  if (\n    options !== null &&\n    options !== undefined &&\n    (_options$signal5 = options.signal) !== null &&\n    _options$signal5 !== undefined &&\n    _options$signal5.aborted\n  ) {\n    const err = new AbortError(undefined, {\n      cause: options.signal.reason\n    })\n    this.once('error', () => {}) // The error is already propagated\n    await finished(this.destroy(err))\n    throw err\n  }\n  const ac = new AbortController()\n  const signal = ac.signal\n  if (options !== null && options !== undefined && options.signal) {\n    const opts = {\n      once: true,\n      [kWeakHandler]: this\n    }\n    options.signal.addEventListener('abort', () => ac.abort(), opts)\n  }\n  let gotAnyItemFromStream = false\n  try {\n    for await (const value of this) {\n      var _options$signal6\n      gotAnyItemFromStream = true\n      if (\n        options !== null &&\n        options !== undefined &&\n        (_options$signal6 = options.signal) !== null &&\n        _options$signal6 !== undefined &&\n        _options$signal6.aborted\n      ) {\n        throw new AbortError()\n      }\n      if (!hasInitialValue) {\n        initialValue = value\n        hasInitialValue = true\n      } else {\n        initialValue = await reducer(initialValue, value, {\n          signal\n        })\n      }\n    }\n    if (!gotAnyItemFromStream && !hasInitialValue) {\n      throw new ReduceAwareErrMissingArgs()\n    }\n  } finally {\n    ac.abort()\n  }\n  return initialValue\n}\nasync function toArray(options) {\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  const result = []\n  for await (const val of this) {\n    var _options$signal7\n    if (\n      options !== null &&\n      options !== undefined &&\n      (_options$signal7 = options.signal) !== null &&\n      _options$signal7 !== undefined &&\n      _options$signal7.aborted\n    ) {\n      throw new AbortError(undefined, {\n        cause: options.signal.reason\n      })\n    }\n    ArrayPrototypePush(result, val)\n  }\n  return result\n}\nfunction flatMap(fn, options) {\n  const values = map.call(this, fn, options)\n  return async function* flatMap() {\n    for await (const val of values) {\n      yield* val\n    }\n  }.call(this)\n}\nfunction toIntegerOrInfinity(number) {\n  // We coerce here to align with the spec\n  // https://github.com/tc39/proposal-iterator-helpers/issues/169\n  number = Number(number)\n  if (NumberIsNaN(number)) {\n    return 0\n  }\n  if (number < 0) {\n    throw new ERR_OUT_OF_RANGE('number', '>= 0', number)\n  }\n  return number\n}\nfunction drop(number, options = undefined) {\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  number = toIntegerOrInfinity(number)\n  return async function* drop() {\n    var _options$signal8\n    if (\n      options !== null &&\n      options !== undefined &&\n      (_options$signal8 = options.signal) !== null &&\n      _options$signal8 !== undefined &&\n      _options$signal8.aborted\n    ) {\n      throw new AbortError()\n    }\n    for await (const val of this) {\n      var _options$signal9\n      if (\n        options !== null &&\n        options !== undefined &&\n        (_options$signal9 = options.signal) !== null &&\n        _options$signal9 !== undefined &&\n        _options$signal9.aborted\n      ) {\n        throw new AbortError()\n      }\n      if (number-- <= 0) {\n        yield val\n      }\n    }\n  }.call(this)\n}\nfunction take(number, options = undefined) {\n  if (options != null) {\n    validateObject(options, 'options')\n  }\n  if ((options === null || options === undefined ? undefined : options.signal) != null) {\n    validateAbortSignal(options.signal, 'options.signal')\n  }\n  number = toIntegerOrInfinity(number)\n  return async function* take() {\n    var _options$signal10\n    if (\n      options !== null &&\n      options !== undefined &&\n      (_options$signal10 = options.signal) !== null &&\n      _options$signal10 !== undefined &&\n      _options$signal10.aborted\n    ) {\n      throw new AbortError()\n    }\n    for await (const val of this) {\n      var _options$signal11\n      if (\n        options !== null &&\n        options !== undefined &&\n        (_options$signal11 = options.signal) !== null &&\n        _options$signal11 !== undefined &&\n        _options$signal11.aborted\n      ) {\n        throw new AbortError()\n      }\n      if (number-- > 0) {\n        yield val\n      } else {\n        return\n      }\n    }\n  }.call(this)\n}\nmodule.exports.streamReturningOperators = {\n  asIndexedPairs,\n  drop,\n  filter,\n  flatMap,\n  map,\n  take,\n  compose\n}\nmodule.exports.promiseReturningOperators = {\n  every,\n  forEach,\n  reduce,\n  toArray,\n  some,\n  find\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/operators.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/passthrough.js":
+/*!**************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/passthrough.js ***!
+  \**************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n\n\n\nconst { ObjectSetPrototypeOf } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nmodule.exports = PassThrough\nconst Transform = __webpack_require__(/*! ./transform */ \"./node_modules/readable-stream/lib/internal/streams/transform.js\")\nObjectSetPrototypeOf(PassThrough.prototype, Transform.prototype)\nObjectSetPrototypeOf(PassThrough, Transform)\nfunction PassThrough(options) {\n  if (!(this instanceof PassThrough)) return new PassThrough(options)\n  Transform.call(this, options)\n}\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n  cb(null, chunk)\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/passthrough.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/pipeline.js":
+/*!***********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/pipeline.js ***!
+  \***********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n\n;('use strict')\nconst { ArrayIsArray, Promise, SymbolAsyncIterator } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst eos = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nconst { once } = __webpack_require__(/*! ../../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nconst destroyImpl = __webpack_require__(/*! ./destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst Duplex = __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\nconst {\n  aggregateTwoErrors,\n  codes: {\n    ERR_INVALID_ARG_TYPE,\n    ERR_INVALID_RETURN_VALUE,\n    ERR_MISSING_ARGS,\n    ERR_STREAM_DESTROYED,\n    ERR_STREAM_PREMATURE_CLOSE\n  },\n  AbortError\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { validateFunction, validateAbortSignal } = __webpack_require__(/*! ../validators */ \"./node_modules/readable-stream/lib/internal/validators.js\")\nconst {\n  isIterable,\n  isReadable,\n  isReadableNodeStream,\n  isNodeStream,\n  isTransformStream,\n  isWebStream,\n  isReadableStream,\n  isReadableEnded\n} = __webpack_require__(/*! ./utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst AbortController = globalThis.AbortController || (__webpack_require__(/*! abort-controller */ \"./node_modules/abort-controller/browser.js\").AbortController)\nlet PassThrough\nlet Readable\nfunction destroyer(stream, reading, writing) {\n  let finished = false\n  stream.on('close', () => {\n    finished = true\n  })\n  const cleanup = eos(\n    stream,\n    {\n      readable: reading,\n      writable: writing\n    },\n    (err) => {\n      finished = !err\n    }\n  )\n  return {\n    destroy: (err) => {\n      if (finished) return\n      finished = true\n      destroyImpl.destroyer(stream, err || new ERR_STREAM_DESTROYED('pipe'))\n    },\n    cleanup\n  }\n}\nfunction popCallback(streams) {\n  // Streams should never be an empty array. It should always contain at least\n  // a single stream. Therefore optimize for the average case instead of\n  // checking for length === 0 as well.\n  validateFunction(streams[streams.length - 1], 'streams[stream.length - 1]')\n  return streams.pop()\n}\nfunction makeAsyncIterable(val) {\n  if (isIterable(val)) {\n    return val\n  } else if (isReadableNodeStream(val)) {\n    // Legacy streams are not Iterable.\n    return fromReadable(val)\n  }\n  throw new ERR_INVALID_ARG_TYPE('val', ['Readable', 'Iterable', 'AsyncIterable'], val)\n}\nasync function* fromReadable(val) {\n  if (!Readable) {\n    Readable = __webpack_require__(/*! ./readable */ \"./node_modules/readable-stream/lib/internal/streams/readable.js\")\n  }\n  yield* Readable.prototype[SymbolAsyncIterator].call(val)\n}\nasync function pumpToNode(iterable, writable, finish, { end }) {\n  let error\n  let onresolve = null\n  const resume = (err) => {\n    if (err) {\n      error = err\n    }\n    if (onresolve) {\n      const callback = onresolve\n      onresolve = null\n      callback()\n    }\n  }\n  const wait = () =>\n    new Promise((resolve, reject) => {\n      if (error) {\n        reject(error)\n      } else {\n        onresolve = () => {\n          if (error) {\n            reject(error)\n          } else {\n            resolve()\n          }\n        }\n      }\n    })\n  writable.on('drain', resume)\n  const cleanup = eos(\n    writable,\n    {\n      readable: false\n    },\n    resume\n  )\n  try {\n    if (writable.writableNeedDrain) {\n      await wait()\n    }\n    for await (const chunk of iterable) {\n      if (!writable.write(chunk)) {\n        await wait()\n      }\n    }\n    if (end) {\n      writable.end()\n    }\n    await wait()\n    finish()\n  } catch (err) {\n    finish(error !== err ? aggregateTwoErrors(error, err) : err)\n  } finally {\n    cleanup()\n    writable.off('drain', resume)\n  }\n}\nasync function pumpToWeb(readable, writable, finish, { end }) {\n  if (isTransformStream(writable)) {\n    writable = writable.writable\n  }\n  // https://streams.spec.whatwg.org/#example-manual-write-with-backpressure\n  const writer = writable.getWriter()\n  try {\n    for await (const chunk of readable) {\n      await writer.ready\n      writer.write(chunk).catch(() => {})\n    }\n    await writer.ready\n    if (end) {\n      await writer.close()\n    }\n    finish()\n  } catch (err) {\n    try {\n      await writer.abort(err)\n      finish(err)\n    } catch (err) {\n      finish(err)\n    }\n  }\n}\nfunction pipeline(...streams) {\n  return pipelineImpl(streams, once(popCallback(streams)))\n}\nfunction pipelineImpl(streams, callback, opts) {\n  if (streams.length === 1 && ArrayIsArray(streams[0])) {\n    streams = streams[0]\n  }\n  if (streams.length < 2) {\n    throw new ERR_MISSING_ARGS('streams')\n  }\n  const ac = new AbortController()\n  const signal = ac.signal\n  const outerSignal = opts === null || opts === undefined ? undefined : opts.signal\n\n  // Need to cleanup event listeners if last stream is readable\n  // https://github.com/nodejs/node/issues/35452\n  const lastStreamCleanup = []\n  validateAbortSignal(outerSignal, 'options.signal')\n  function abort() {\n    finishImpl(new AbortError())\n  }\n  outerSignal === null || outerSignal === undefined ? undefined : outerSignal.addEventListener('abort', abort)\n  let error\n  let value\n  const destroys = []\n  let finishCount = 0\n  function finish(err) {\n    finishImpl(err, --finishCount === 0)\n  }\n  function finishImpl(err, final) {\n    if (err && (!error || error.code === 'ERR_STREAM_PREMATURE_CLOSE')) {\n      error = err\n    }\n    if (!error && !final) {\n      return\n    }\n    while (destroys.length) {\n      destroys.shift()(error)\n    }\n    outerSignal === null || outerSignal === undefined ? undefined : outerSignal.removeEventListener('abort', abort)\n    ac.abort()\n    if (final) {\n      if (!error) {\n        lastStreamCleanup.forEach((fn) => fn())\n      }\n      process.nextTick(callback, error, value)\n    }\n  }\n  let ret\n  for (let i = 0; i < streams.length; i++) {\n    const stream = streams[i]\n    const reading = i < streams.length - 1\n    const writing = i > 0\n    const end = reading || (opts === null || opts === undefined ? undefined : opts.end) !== false\n    const isLastStream = i === streams.length - 1\n    if (isNodeStream(stream)) {\n      if (end) {\n        const { destroy, cleanup } = destroyer(stream, reading, writing)\n        destroys.push(destroy)\n        if (isReadable(stream) && isLastStream) {\n          lastStreamCleanup.push(cleanup)\n        }\n      }\n\n      // Catch stream errors that occur after pipe/pump has completed.\n      function onError(err) {\n        if (err && err.name !== 'AbortError' && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n          finish(err)\n        }\n      }\n      stream.on('error', onError)\n      if (isReadable(stream) && isLastStream) {\n        lastStreamCleanup.push(() => {\n          stream.removeListener('error', onError)\n        })\n      }\n    }\n    if (i === 0) {\n      if (typeof stream === 'function') {\n        ret = stream({\n          signal\n        })\n        if (!isIterable(ret)) {\n          throw new ERR_INVALID_RETURN_VALUE('Iterable, AsyncIterable or Stream', 'source', ret)\n        }\n      } else if (isIterable(stream) || isReadableNodeStream(stream) || isTransformStream(stream)) {\n        ret = stream\n      } else {\n        ret = Duplex.from(stream)\n      }\n    } else if (typeof stream === 'function') {\n      if (isTransformStream(ret)) {\n        var _ret\n        ret = makeAsyncIterable((_ret = ret) === null || _ret === undefined ? undefined : _ret.readable)\n      } else {\n        ret = makeAsyncIterable(ret)\n      }\n      ret = stream(ret, {\n        signal\n      })\n      if (reading) {\n        if (!isIterable(ret, true)) {\n          throw new ERR_INVALID_RETURN_VALUE('AsyncIterable', `transform[${i - 1}]`, ret)\n        }\n      } else {\n        var _ret2\n        if (!PassThrough) {\n          PassThrough = __webpack_require__(/*! ./passthrough */ \"./node_modules/readable-stream/lib/internal/streams/passthrough.js\")\n        }\n\n        // If the last argument to pipeline is not a stream\n        // we must create a proxy stream so that pipeline(...)\n        // always returns a stream which can be further\n        // composed through `.pipe(stream)`.\n\n        const pt = new PassThrough({\n          objectMode: true\n        })\n\n        // Handle Promises/A+ spec, `then` could be a getter that throws on\n        // second use.\n        const then = (_ret2 = ret) === null || _ret2 === undefined ? undefined : _ret2.then\n        if (typeof then === 'function') {\n          finishCount++\n          then.call(\n            ret,\n            (val) => {\n              value = val\n              if (val != null) {\n                pt.write(val)\n              }\n              if (end) {\n                pt.end()\n              }\n              process.nextTick(finish)\n            },\n            (err) => {\n              pt.destroy(err)\n              process.nextTick(finish, err)\n            }\n          )\n        } else if (isIterable(ret, true)) {\n          finishCount++\n          pumpToNode(ret, pt, finish, {\n            end\n          })\n        } else if (isReadableStream(ret) || isTransformStream(ret)) {\n          const toRead = ret.readable || ret\n          finishCount++\n          pumpToNode(toRead, pt, finish, {\n            end\n          })\n        } else {\n          throw new ERR_INVALID_RETURN_VALUE('AsyncIterable or Promise', 'destination', ret)\n        }\n        ret = pt\n        const { destroy, cleanup } = destroyer(ret, false, true)\n        destroys.push(destroy)\n        if (isLastStream) {\n          lastStreamCleanup.push(cleanup)\n        }\n      }\n    } else if (isNodeStream(stream)) {\n      if (isReadableNodeStream(ret)) {\n        finishCount += 2\n        const cleanup = pipe(ret, stream, finish, {\n          end\n        })\n        if (isReadable(stream) && isLastStream) {\n          lastStreamCleanup.push(cleanup)\n        }\n      } else if (isTransformStream(ret) || isReadableStream(ret)) {\n        const toRead = ret.readable || ret\n        finishCount++\n        pumpToNode(toRead, stream, finish, {\n          end\n        })\n      } else if (isIterable(ret)) {\n        finishCount++\n        pumpToNode(ret, stream, finish, {\n          end\n        })\n      } else {\n        throw new ERR_INVALID_ARG_TYPE(\n          'val',\n          ['Readable', 'Iterable', 'AsyncIterable', 'ReadableStream', 'TransformStream'],\n          ret\n        )\n      }\n      ret = stream\n    } else if (isWebStream(stream)) {\n      if (isReadableNodeStream(ret)) {\n        finishCount++\n        pumpToWeb(makeAsyncIterable(ret), stream, finish, {\n          end\n        })\n      } else if (isReadableStream(ret) || isIterable(ret)) {\n        finishCount++\n        pumpToWeb(ret, stream, finish, {\n          end\n        })\n      } else if (isTransformStream(ret)) {\n        finishCount++\n        pumpToWeb(ret.readable, stream, finish, {\n          end\n        })\n      } else {\n        throw new ERR_INVALID_ARG_TYPE(\n          'val',\n          ['Readable', 'Iterable', 'AsyncIterable', 'ReadableStream', 'TransformStream'],\n          ret\n        )\n      }\n      ret = stream\n    } else {\n      ret = Duplex.from(stream)\n    }\n  }\n  if (\n    (signal !== null && signal !== undefined && signal.aborted) ||\n    (outerSignal !== null && outerSignal !== undefined && outerSignal.aborted)\n  ) {\n    process.nextTick(abort)\n  }\n  return ret\n}\nfunction pipe(src, dst, finish, { end }) {\n  let ended = false\n  dst.on('close', () => {\n    if (!ended) {\n      // Finish if the destination closes before the source has completed.\n      finish(new ERR_STREAM_PREMATURE_CLOSE())\n    }\n  })\n  src.pipe(dst, {\n    end: false\n  }) // If end is true we already will have a listener to end dst.\n\n  if (end) {\n    // Compat. Before node v10.12.0 stdio used to throw an error so\n    // pipe() did/does not end() stdio destinations.\n    // Now they allow it but \"secretly\" don't close the underlying fd.\n\n    function endFn() {\n      ended = true\n      dst.end()\n    }\n    if (isReadableEnded(src)) {\n      // End the destination if the source has already ended.\n      process.nextTick(endFn)\n    } else {\n      src.once('end', endFn)\n    }\n  } else {\n    finish()\n  }\n  eos(\n    src,\n    {\n      readable: true,\n      writable: false\n    },\n    (err) => {\n      const rState = src._readableState\n      if (\n        err &&\n        err.code === 'ERR_STREAM_PREMATURE_CLOSE' &&\n        rState &&\n        rState.ended &&\n        !rState.errored &&\n        !rState.errorEmitted\n      ) {\n        // Some readable streams will emit 'close' before 'end'. However, since\n        // this is on the readable side 'end' should still be emitted if the\n        // stream has been ended and no error emitted. This should be allowed in\n        // favor of backwards compatibility. Since the stream is piped to a\n        // destination this should not result in any observable difference.\n        // We don't need to check if this is a writable premature close since\n        // eos will only fail with premature close on the reading side for\n        // duplex streams.\n        src.once('end', finish).once('error', finish)\n      } else {\n        finish(err)\n      }\n    }\n  )\n  return eos(\n    dst,\n    {\n      readable: false,\n      writable: true\n    },\n    finish\n  )\n}\nmodule.exports = {\n  pipelineImpl,\n  pipeline\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/pipeline.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/readable.js":
+/*!***********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/readable.js ***!
+  \***********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n;('use strict')\nconst {\n  ArrayPrototypeIndexOf,\n  NumberIsInteger,\n  NumberIsNaN,\n  NumberParseInt,\n  ObjectDefineProperties,\n  ObjectKeys,\n  ObjectSetPrototypeOf,\n  Promise,\n  SafeSet,\n  SymbolAsyncIterator,\n  Symbol\n} = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nmodule.exports = Readable\nReadable.ReadableState = ReadableState\nconst { EventEmitter: EE } = __webpack_require__(/*! events */ \"./node_modules/events/events.js\")\nconst { Stream, prependListener } = __webpack_require__(/*! ./legacy */ \"./node_modules/readable-stream/lib/internal/streams/legacy.js\")\nconst { Buffer } = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst { addAbortSignal } = __webpack_require__(/*! ./add-abort-signal */ \"./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js\")\nconst eos = __webpack_require__(/*! ./end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nlet debug = (__webpack_require__(/*! ../../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\").debuglog)('stream', (fn) => {\n  debug = fn\n})\nconst BufferList = __webpack_require__(/*! ./buffer_list */ \"./node_modules/readable-stream/lib/internal/streams/buffer_list.js\")\nconst destroyImpl = __webpack_require__(/*! ./destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst { getHighWaterMark, getDefaultHighWaterMark } = __webpack_require__(/*! ./state */ \"./node_modules/readable-stream/lib/internal/streams/state.js\")\nconst {\n  aggregateTwoErrors,\n  codes: {\n    ERR_INVALID_ARG_TYPE,\n    ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_OUT_OF_RANGE,\n    ERR_STREAM_PUSH_AFTER_EOF,\n    ERR_STREAM_UNSHIFT_AFTER_END_EVENT\n  }\n} = __webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { validateObject } = __webpack_require__(/*! ../validators */ \"./node_modules/readable-stream/lib/internal/validators.js\")\nconst kPaused = Symbol('kPaused')\nconst { StringDecoder } = __webpack_require__(/*! string_decoder */ \"./node_modules/string_decoder/lib/string_decoder.js\")\nconst from = __webpack_require__(/*! ./from */ \"./node_modules/readable-stream/lib/internal/streams/from.js\")\nObjectSetPrototypeOf(Readable.prototype, Stream.prototype)\nObjectSetPrototypeOf(Readable, Stream)\nconst nop = () => {}\nconst { errorOrDestroy } = destroyImpl\nfunction ReadableState(options, stream, isDuplex) {\n  // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream.\n  // These options can be provided separately as readableXXX and writableXXX.\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\n\n  // Object stream flag. Used to make read(n) ignore n and to\n  // make all the buffer merging and length checks go away.\n  this.objectMode = !!(options && options.objectMode)\n  if (isDuplex) this.objectMode = this.objectMode || !!(options && options.readableObjectMode)\n\n  // The point at which it stops calling _read() to fill the buffer\n  // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n  this.highWaterMark = options\n    ? getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex)\n    : getDefaultHighWaterMark(false)\n\n  // A linked list is used to store data chunks instead of an array because the\n  // linked list can remove elements from the beginning faster than\n  // array.shift().\n  this.buffer = new BufferList()\n  this.length = 0\n  this.pipes = []\n  this.flowing = null\n  this.ended = false\n  this.endEmitted = false\n  this.reading = false\n\n  // Stream is still being constructed and cannot be\n  // destroyed until construction finished or failed.\n  // Async construction is opt in, therefore we start as\n  // constructed.\n  this.constructed = true\n\n  // A flag to be able to tell if the event 'readable'/'data' is emitted\n  // immediately, or on a later tick.  We set this to true at first, because\n  // any actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first read call.\n  this.sync = true\n\n  // Whenever we return null, then we set a flag to say\n  // that we're awaiting a 'readable' event emission.\n  this.needReadable = false\n  this.emittedReadable = false\n  this.readableListening = false\n  this.resumeScheduled = false\n  this[kPaused] = null\n\n  // True if the error was already emitted and should not be thrown again.\n  this.errorEmitted = false\n\n  // Should close be emitted on destroy. Defaults to true.\n  this.emitClose = !options || options.emitClose !== false\n\n  // Should .destroy() be called after 'end' (and potentially 'finish').\n  this.autoDestroy = !options || options.autoDestroy !== false\n\n  // Has it been destroyed.\n  this.destroyed = false\n\n  // Indicates whether the stream has errored. When true no further\n  // _read calls, 'data' or 'readable' events should occur. This is needed\n  // since when autoDestroy is disabled we need a way to tell whether the\n  // stream has failed.\n  this.errored = null\n\n  // Indicates whether the stream has finished destroying.\n  this.closed = false\n\n  // True if close has been emitted or would have been emitted\n  // depending on emitClose.\n  this.closeEmitted = false\n\n  // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n  this.defaultEncoding = (options && options.defaultEncoding) || 'utf8'\n\n  // Ref the piped dest which we need a drain event on it\n  // type: null | Writable | Set<Writable>.\n  this.awaitDrainWriters = null\n  this.multiAwaitDrain = false\n\n  // If true, a maybeReadMore has been scheduled.\n  this.readingMore = false\n  this.dataEmitted = false\n  this.decoder = null\n  this.encoding = null\n  if (options && options.encoding) {\n    this.decoder = new StringDecoder(options.encoding)\n    this.encoding = options.encoding\n  }\n}\nfunction Readable(options) {\n  if (!(this instanceof Readable)) return new Readable(options)\n\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the ReadableState constructor, at least with V8 6.5.\n  const isDuplex = this instanceof __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\n  this._readableState = new ReadableState(options, this, isDuplex)\n  if (options) {\n    if (typeof options.read === 'function') this._read = options.read\n    if (typeof options.destroy === 'function') this._destroy = options.destroy\n    if (typeof options.construct === 'function') this._construct = options.construct\n    if (options.signal && !isDuplex) addAbortSignal(options.signal, this)\n  }\n  Stream.call(this, options)\n  destroyImpl.construct(this, () => {\n    if (this._readableState.needReadable) {\n      maybeReadMore(this, this._readableState)\n    }\n  })\n}\nReadable.prototype.destroy = destroyImpl.destroy\nReadable.prototype._undestroy = destroyImpl.undestroy\nReadable.prototype._destroy = function (err, cb) {\n  cb(err)\n}\nReadable.prototype[EE.captureRejectionSymbol] = function (err) {\n  this.destroy(err)\n}\n\n// Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\nReadable.prototype.push = function (chunk, encoding) {\n  return readableAddChunk(this, chunk, encoding, false)\n}\n\n// Unshift should *always* be something directly out of read().\nReadable.prototype.unshift = function (chunk, encoding) {\n  return readableAddChunk(this, chunk, encoding, true)\n}\nfunction readableAddChunk(stream, chunk, encoding, addToFront) {\n  debug('readableAddChunk', chunk)\n  const state = stream._readableState\n  let err\n  if (!state.objectMode) {\n    if (typeof chunk === 'string') {\n      encoding = encoding || state.defaultEncoding\n      if (state.encoding !== encoding) {\n        if (addToFront && state.encoding) {\n          // When unshifting, if state.encoding is set, we have to save\n          // the string in the BufferList with the state encoding.\n          chunk = Buffer.from(chunk, encoding).toString(state.encoding)\n        } else {\n          chunk = Buffer.from(chunk, encoding)\n          encoding = ''\n        }\n      }\n    } else if (chunk instanceof Buffer) {\n      encoding = ''\n    } else if (Stream._isUint8Array(chunk)) {\n      chunk = Stream._uint8ArrayToBuffer(chunk)\n      encoding = ''\n    } else if (chunk != null) {\n      err = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk)\n    }\n  }\n  if (err) {\n    errorOrDestroy(stream, err)\n  } else if (chunk === null) {\n    state.reading = false\n    onEofChunk(stream, state)\n  } else if (state.objectMode || (chunk && chunk.length > 0)) {\n    if (addToFront) {\n      if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT())\n      else if (state.destroyed || state.errored) return false\n      else addChunk(stream, state, chunk, true)\n    } else if (state.ended) {\n      errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF())\n    } else if (state.destroyed || state.errored) {\n      return false\n    } else {\n      state.reading = false\n      if (state.decoder && !encoding) {\n        chunk = state.decoder.write(chunk)\n        if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false)\n        else maybeReadMore(stream, state)\n      } else {\n        addChunk(stream, state, chunk, false)\n      }\n    }\n  } else if (!addToFront) {\n    state.reading = false\n    maybeReadMore(stream, state)\n  }\n\n  // We can push more data if we are below the highWaterMark.\n  // Also, if we have no data yet, we can stand some more bytes.\n  // This is to work around cases where hwm=0, such as the repl.\n  return !state.ended && (state.length < state.highWaterMark || state.length === 0)\n}\nfunction addChunk(stream, state, chunk, addToFront) {\n  if (state.flowing && state.length === 0 && !state.sync && stream.listenerCount('data') > 0) {\n    // Use the guard to avoid creating `Set()` repeatedly\n    // when we have multiple pipes.\n    if (state.multiAwaitDrain) {\n      state.awaitDrainWriters.clear()\n    } else {\n      state.awaitDrainWriters = null\n    }\n    state.dataEmitted = true\n    stream.emit('data', chunk)\n  } else {\n    // Update the buffer info.\n    state.length += state.objectMode ? 1 : chunk.length\n    if (addToFront) state.buffer.unshift(chunk)\n    else state.buffer.push(chunk)\n    if (state.needReadable) emitReadable(stream)\n  }\n  maybeReadMore(stream, state)\n}\nReadable.prototype.isPaused = function () {\n  const state = this._readableState\n  return state[kPaused] === true || state.flowing === false\n}\n\n// Backwards compatibility.\nReadable.prototype.setEncoding = function (enc) {\n  const decoder = new StringDecoder(enc)\n  this._readableState.decoder = decoder\n  // If setEncoding(null), decoder.encoding equals utf8.\n  this._readableState.encoding = this._readableState.decoder.encoding\n  const buffer = this._readableState.buffer\n  // Iterate over current buffer to convert already stored Buffers:\n  let content = ''\n  for (const data of buffer) {\n    content += decoder.write(data)\n  }\n  buffer.clear()\n  if (content !== '') buffer.push(content)\n  this._readableState.length = content.length\n  return this\n}\n\n// Don't raise the hwm > 1GB.\nconst MAX_HWM = 0x40000000\nfunction computeNewHighWaterMark(n) {\n  if (n > MAX_HWM) {\n    throw new ERR_OUT_OF_RANGE('size', '<= 1GiB', n)\n  } else {\n    // Get the next highest power of 2 to prevent increasing hwm excessively in\n    // tiny amounts.\n    n--\n    n |= n >>> 1\n    n |= n >>> 2\n    n |= n >>> 4\n    n |= n >>> 8\n    n |= n >>> 16\n    n++\n  }\n  return n\n}\n\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction howMuchToRead(n, state) {\n  if (n <= 0 || (state.length === 0 && state.ended)) return 0\n  if (state.objectMode) return 1\n  if (NumberIsNaN(n)) {\n    // Only flow one buffer at a time.\n    if (state.flowing && state.length) return state.buffer.first().length\n    return state.length\n  }\n  if (n <= state.length) return n\n  return state.ended ? state.length : 0\n}\n\n// You can override either this method, or the async _read(n) below.\nReadable.prototype.read = function (n) {\n  debug('read', n)\n  // Same as parseInt(undefined, 10), however V8 7.3 performance regressed\n  // in this scenario, so we are doing it manually.\n  if (n === undefined) {\n    n = NaN\n  } else if (!NumberIsInteger(n)) {\n    n = NumberParseInt(n, 10)\n  }\n  const state = this._readableState\n  const nOrig = n\n\n  // If we're asking for more than the current hwm, then raise the hwm.\n  if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n)\n  if (n !== 0) state.emittedReadable = false\n\n  // If we're doing read(0) to trigger a readable event, but we\n  // already have a bunch of data in the buffer, then just trigger\n  // the 'readable' event and move on.\n  if (\n    n === 0 &&\n    state.needReadable &&\n    ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)\n  ) {\n    debug('read: emitReadable', state.length, state.ended)\n    if (state.length === 0 && state.ended) endReadable(this)\n    else emitReadable(this)\n    return null\n  }\n  n = howMuchToRead(n, state)\n\n  // If we've ended, and we're now clear, then finish it up.\n  if (n === 0 && state.ended) {\n    if (state.length === 0) endReadable(this)\n    return null\n  }\n\n  // All the actual chunk generation logic needs to be\n  // *below* the call to _read.  The reason is that in certain\n  // synthetic stream cases, such as passthrough streams, _read\n  // may be a completely synchronous operation which may change\n  // the state of the read buffer, providing enough data when\n  // before there was *not* enough.\n  //\n  // So, the steps are:\n  // 1. Figure out what the state of things will be after we do\n  // a read from the buffer.\n  //\n  // 2. If that resulting state will trigger a _read, then call _read.\n  // Note that this may be asynchronous, or synchronous.  Yes, it is\n  // deeply ugly to write APIs this way, but that still doesn't mean\n  // that the Readable class should behave improperly, as streams are\n  // designed to be sync/async agnostic.\n  // Take note if the _read call is sync or async (ie, if the read call\n  // has returned yet), so that we know whether or not it's safe to emit\n  // 'readable' etc.\n  //\n  // 3. Actually pull the requested chunks out of the buffer and return.\n\n  // if we need a readable event, then we need to do some reading.\n  let doRead = state.needReadable\n  debug('need readable', doRead)\n\n  // If we currently have less than the highWaterMark, then also read some.\n  if (state.length === 0 || state.length - n < state.highWaterMark) {\n    doRead = true\n    debug('length less than watermark', doRead)\n  }\n\n  // However, if we've ended, then there's no point, if we're already\n  // reading, then it's unnecessary, if we're constructing we have to wait,\n  // and if we're destroyed or errored, then it's not allowed,\n  if (state.ended || state.reading || state.destroyed || state.errored || !state.constructed) {\n    doRead = false\n    debug('reading, ended or constructing', doRead)\n  } else if (doRead) {\n    debug('do read')\n    state.reading = true\n    state.sync = true\n    // If the length is currently zero, then we *need* a readable event.\n    if (state.length === 0) state.needReadable = true\n\n    // Call internal read method\n    try {\n      this._read(state.highWaterMark)\n    } catch (err) {\n      errorOrDestroy(this, err)\n    }\n    state.sync = false\n    // If _read pushed data synchronously, then `reading` will be false,\n    // and we need to re-evaluate how much data we can return to the user.\n    if (!state.reading) n = howMuchToRead(nOrig, state)\n  }\n  let ret\n  if (n > 0) ret = fromList(n, state)\n  else ret = null\n  if (ret === null) {\n    state.needReadable = state.length <= state.highWaterMark\n    n = 0\n  } else {\n    state.length -= n\n    if (state.multiAwaitDrain) {\n      state.awaitDrainWriters.clear()\n    } else {\n      state.awaitDrainWriters = null\n    }\n  }\n  if (state.length === 0) {\n    // If we have nothing in the buffer, then we want to know\n    // as soon as we *do* get something into the buffer.\n    if (!state.ended) state.needReadable = true\n\n    // If we tried to read() past the EOF, then emit end on the next tick.\n    if (nOrig !== n && state.ended) endReadable(this)\n  }\n  if (ret !== null && !state.errorEmitted && !state.closeEmitted) {\n    state.dataEmitted = true\n    this.emit('data', ret)\n  }\n  return ret\n}\nfunction onEofChunk(stream, state) {\n  debug('onEofChunk')\n  if (state.ended) return\n  if (state.decoder) {\n    const chunk = state.decoder.end()\n    if (chunk && chunk.length) {\n      state.buffer.push(chunk)\n      state.length += state.objectMode ? 1 : chunk.length\n    }\n  }\n  state.ended = true\n  if (state.sync) {\n    // If we are sync, wait until next tick to emit the data.\n    // Otherwise we risk emitting data in the flow()\n    // the readable code triggers during a read() call.\n    emitReadable(stream)\n  } else {\n    // Emit 'readable' now to make sure it gets picked up.\n    state.needReadable = false\n    state.emittedReadable = true\n    // We have to emit readable now that we are EOF. Modules\n    // in the ecosystem (e.g. dicer) rely on this event being sync.\n    emitReadable_(stream)\n  }\n}\n\n// Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow.  This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\nfunction emitReadable(stream) {\n  const state = stream._readableState\n  debug('emitReadable', state.needReadable, state.emittedReadable)\n  state.needReadable = false\n  if (!state.emittedReadable) {\n    debug('emitReadable', state.flowing)\n    state.emittedReadable = true\n    process.nextTick(emitReadable_, stream)\n  }\n}\nfunction emitReadable_(stream) {\n  const state = stream._readableState\n  debug('emitReadable_', state.destroyed, state.length, state.ended)\n  if (!state.destroyed && !state.errored && (state.length || state.ended)) {\n    stream.emit('readable')\n    state.emittedReadable = false\n  }\n\n  // The stream needs another readable event if:\n  // 1. It is not flowing, as the flow mechanism will take\n  //    care of it.\n  // 2. It is not ended.\n  // 3. It is below the highWaterMark, so we can schedule\n  //    another readable later.\n  state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark\n  flow(stream)\n}\n\n// At this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data.  that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\nfunction maybeReadMore(stream, state) {\n  if (!state.readingMore && state.constructed) {\n    state.readingMore = true\n    process.nextTick(maybeReadMore_, stream, state)\n  }\n}\nfunction maybeReadMore_(stream, state) {\n  // Attempt to read more data if we should.\n  //\n  // The conditions for reading more data are (one of):\n  // - Not enough data buffered (state.length < state.highWaterMark). The loop\n  //   is responsible for filling the buffer with enough data if such data\n  //   is available. If highWaterMark is 0 and we are not in the flowing mode\n  //   we should _not_ attempt to buffer any extra data. We'll get more data\n  //   when the stream consumer calls read() instead.\n  // - No data in the buffer, and the stream is in flowing mode. In this mode\n  //   the loop below is responsible for ensuring read() is called. Failing to\n  //   call read here would abort the flow and there's no other mechanism for\n  //   continuing the flow if the stream consumer has just subscribed to the\n  //   'data' event.\n  //\n  // In addition to the above conditions to keep reading data, the following\n  // conditions prevent the data from being read:\n  // - The stream has ended (state.ended).\n  // - There is already a pending 'read' operation (state.reading). This is a\n  //   case where the stream has called the implementation defined _read()\n  //   method, but they are processing the call asynchronously and have _not_\n  //   called push() with new data. In this case we skip performing more\n  //   read()s. The execution ends in this method again after the _read() ends\n  //   up calling push() with more data.\n  while (\n    !state.reading &&\n    !state.ended &&\n    (state.length < state.highWaterMark || (state.flowing && state.length === 0))\n  ) {\n    const len = state.length\n    debug('maybeReadMore read 0')\n    stream.read(0)\n    if (len === state.length)\n      // Didn't get any data, stop spinning.\n      break\n  }\n  state.readingMore = false\n}\n\n// Abstract method.  to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\nReadable.prototype._read = function (n) {\n  throw new ERR_METHOD_NOT_IMPLEMENTED('_read()')\n}\nReadable.prototype.pipe = function (dest, pipeOpts) {\n  const src = this\n  const state = this._readableState\n  if (state.pipes.length === 1) {\n    if (!state.multiAwaitDrain) {\n      state.multiAwaitDrain = true\n      state.awaitDrainWriters = new SafeSet(state.awaitDrainWriters ? [state.awaitDrainWriters] : [])\n    }\n  }\n  state.pipes.push(dest)\n  debug('pipe count=%d opts=%j', state.pipes.length, pipeOpts)\n  const doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr\n  const endFn = doEnd ? onend : unpipe\n  if (state.endEmitted) process.nextTick(endFn)\n  else src.once('end', endFn)\n  dest.on('unpipe', onunpipe)\n  function onunpipe(readable, unpipeInfo) {\n    debug('onunpipe')\n    if (readable === src) {\n      if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n        unpipeInfo.hasUnpiped = true\n        cleanup()\n      }\n    }\n  }\n  function onend() {\n    debug('onend')\n    dest.end()\n  }\n  let ondrain\n  let cleanedUp = false\n  function cleanup() {\n    debug('cleanup')\n    // Cleanup event handlers once the pipe is broken.\n    dest.removeListener('close', onclose)\n    dest.removeListener('finish', onfinish)\n    if (ondrain) {\n      dest.removeListener('drain', ondrain)\n    }\n    dest.removeListener('error', onerror)\n    dest.removeListener('unpipe', onunpipe)\n    src.removeListener('end', onend)\n    src.removeListener('end', unpipe)\n    src.removeListener('data', ondata)\n    cleanedUp = true\n\n    // If the reader is waiting for a drain event from this\n    // specific writer, then it would cause it to never start\n    // flowing again.\n    // So, if this is awaiting a drain, then we just call it now.\n    // If we don't know, then assume that we are waiting for one.\n    if (ondrain && state.awaitDrainWriters && (!dest._writableState || dest._writableState.needDrain)) ondrain()\n  }\n  function pause() {\n    // If the user unpiped during `dest.write()`, it is possible\n    // to get stuck in a permanently paused state if that write\n    // also returned false.\n    // => Check whether `dest` is still a piping destination.\n    if (!cleanedUp) {\n      if (state.pipes.length === 1 && state.pipes[0] === dest) {\n        debug('false write response, pause', 0)\n        state.awaitDrainWriters = dest\n        state.multiAwaitDrain = false\n      } else if (state.pipes.length > 1 && state.pipes.includes(dest)) {\n        debug('false write response, pause', state.awaitDrainWriters.size)\n        state.awaitDrainWriters.add(dest)\n      }\n      src.pause()\n    }\n    if (!ondrain) {\n      // When the dest drains, it reduces the awaitDrain counter\n      // on the source.  This would be more elegant with a .once()\n      // handler in flow(), but adding and removing repeatedly is\n      // too slow.\n      ondrain = pipeOnDrain(src, dest)\n      dest.on('drain', ondrain)\n    }\n  }\n  src.on('data', ondata)\n  function ondata(chunk) {\n    debug('ondata')\n    const ret = dest.write(chunk)\n    debug('dest.write', ret)\n    if (ret === false) {\n      pause()\n    }\n  }\n\n  // If the dest has an error, then stop piping into it.\n  // However, don't suppress the throwing behavior for this.\n  function onerror(er) {\n    debug('onerror', er)\n    unpipe()\n    dest.removeListener('error', onerror)\n    if (dest.listenerCount('error') === 0) {\n      const s = dest._writableState || dest._readableState\n      if (s && !s.errorEmitted) {\n        // User incorrectly emitted 'error' directly on the stream.\n        errorOrDestroy(dest, er)\n      } else {\n        dest.emit('error', er)\n      }\n    }\n  }\n\n  // Make sure our error handler is attached before userland ones.\n  prependListener(dest, 'error', onerror)\n\n  // Both close and finish should trigger unpipe, but only once.\n  function onclose() {\n    dest.removeListener('finish', onfinish)\n    unpipe()\n  }\n  dest.once('close', onclose)\n  function onfinish() {\n    debug('onfinish')\n    dest.removeListener('close', onclose)\n    unpipe()\n  }\n  dest.once('finish', onfinish)\n  function unpipe() {\n    debug('unpipe')\n    src.unpipe(dest)\n  }\n\n  // Tell the dest that it's being piped to.\n  dest.emit('pipe', src)\n\n  // Start the flow if it hasn't been started already.\n\n  if (dest.writableNeedDrain === true) {\n    if (state.flowing) {\n      pause()\n    }\n  } else if (!state.flowing) {\n    debug('pipe resume')\n    src.resume()\n  }\n  return dest\n}\nfunction pipeOnDrain(src, dest) {\n  return function pipeOnDrainFunctionResult() {\n    const state = src._readableState\n\n    // `ondrain` will call directly,\n    // `this` maybe not a reference to dest,\n    // so we use the real dest here.\n    if (state.awaitDrainWriters === dest) {\n      debug('pipeOnDrain', 1)\n      state.awaitDrainWriters = null\n    } else if (state.multiAwaitDrain) {\n      debug('pipeOnDrain', state.awaitDrainWriters.size)\n      state.awaitDrainWriters.delete(dest)\n    }\n    if ((!state.awaitDrainWriters || state.awaitDrainWriters.size === 0) && src.listenerCount('data')) {\n      src.resume()\n    }\n  }\n}\nReadable.prototype.unpipe = function (dest) {\n  const state = this._readableState\n  const unpipeInfo = {\n    hasUnpiped: false\n  }\n\n  // If we're not piping anywhere, then do nothing.\n  if (state.pipes.length === 0) return this\n  if (!dest) {\n    // remove all.\n    const dests = state.pipes\n    state.pipes = []\n    this.pause()\n    for (let i = 0; i < dests.length; i++)\n      dests[i].emit('unpipe', this, {\n        hasUnpiped: false\n      })\n    return this\n  }\n\n  // Try to find the right one.\n  const index = ArrayPrototypeIndexOf(state.pipes, dest)\n  if (index === -1) return this\n  state.pipes.splice(index, 1)\n  if (state.pipes.length === 0) this.pause()\n  dest.emit('unpipe', this, unpipeInfo)\n  return this\n}\n\n// Set up data events if they are asked for\n// Ensure readable listeners eventually get something.\nReadable.prototype.on = function (ev, fn) {\n  const res = Stream.prototype.on.call(this, ev, fn)\n  const state = this._readableState\n  if (ev === 'data') {\n    // Update readableListening so that resume() may be a no-op\n    // a few lines down. This is needed to support once('readable').\n    state.readableListening = this.listenerCount('readable') > 0\n\n    // Try start flowing on next tick if stream isn't explicitly paused.\n    if (state.flowing !== false) this.resume()\n  } else if (ev === 'readable') {\n    if (!state.endEmitted && !state.readableListening) {\n      state.readableListening = state.needReadable = true\n      state.flowing = false\n      state.emittedReadable = false\n      debug('on readable', state.length, state.reading)\n      if (state.length) {\n        emitReadable(this)\n      } else if (!state.reading) {\n        process.nextTick(nReadingNextTick, this)\n      }\n    }\n  }\n  return res\n}\nReadable.prototype.addListener = Readable.prototype.on\nReadable.prototype.removeListener = function (ev, fn) {\n  const res = Stream.prototype.removeListener.call(this, ev, fn)\n  if (ev === 'readable') {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this)\n  }\n  return res\n}\nReadable.prototype.off = Readable.prototype.removeListener\nReadable.prototype.removeAllListeners = function (ev) {\n  const res = Stream.prototype.removeAllListeners.apply(this, arguments)\n  if (ev === 'readable' || ev === undefined) {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this)\n  }\n  return res\n}\nfunction updateReadableListening(self) {\n  const state = self._readableState\n  state.readableListening = self.listenerCount('readable') > 0\n  if (state.resumeScheduled && state[kPaused] === false) {\n    // Flowing needs to be set to true now, otherwise\n    // the upcoming resume will not flow.\n    state.flowing = true\n\n    // Crude way to check if we should resume.\n  } else if (self.listenerCount('data') > 0) {\n    self.resume()\n  } else if (!state.readableListening) {\n    state.flowing = null\n  }\n}\nfunction nReadingNextTick(self) {\n  debug('readable nexttick read 0')\n  self.read(0)\n}\n\n// pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\nReadable.prototype.resume = function () {\n  const state = this._readableState\n  if (!state.flowing) {\n    debug('resume')\n    // We flow only if there is no one listening\n    // for readable, but we still have to call\n    // resume().\n    state.flowing = !state.readableListening\n    resume(this, state)\n  }\n  state[kPaused] = false\n  return this\n}\nfunction resume(stream, state) {\n  if (!state.resumeScheduled) {\n    state.resumeScheduled = true\n    process.nextTick(resume_, stream, state)\n  }\n}\nfunction resume_(stream, state) {\n  debug('resume', state.reading)\n  if (!state.reading) {\n    stream.read(0)\n  }\n  state.resumeScheduled = false\n  stream.emit('resume')\n  flow(stream)\n  if (state.flowing && !state.reading) stream.read(0)\n}\nReadable.prototype.pause = function () {\n  debug('call pause flowing=%j', this._readableState.flowing)\n  if (this._readableState.flowing !== false) {\n    debug('pause')\n    this._readableState.flowing = false\n    this.emit('pause')\n  }\n  this._readableState[kPaused] = true\n  return this\n}\nfunction flow(stream) {\n  const state = stream._readableState\n  debug('flow', state.flowing)\n  while (state.flowing && stream.read() !== null);\n}\n\n// Wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\nReadable.prototype.wrap = function (stream) {\n  let paused = false\n\n  // TODO (ronag): Should this.destroy(err) emit\n  // 'error' on the wrapped stream? Would require\n  // a static factory method, e.g. Readable.wrap(stream).\n\n  stream.on('data', (chunk) => {\n    if (!this.push(chunk) && stream.pause) {\n      paused = true\n      stream.pause()\n    }\n  })\n  stream.on('end', () => {\n    this.push(null)\n  })\n  stream.on('error', (err) => {\n    errorOrDestroy(this, err)\n  })\n  stream.on('close', () => {\n    this.destroy()\n  })\n  stream.on('destroy', () => {\n    this.destroy()\n  })\n  this._read = () => {\n    if (paused && stream.resume) {\n      paused = false\n      stream.resume()\n    }\n  }\n\n  // Proxy all the other methods. Important when wrapping filters and duplexes.\n  const streamKeys = ObjectKeys(stream)\n  for (let j = 1; j < streamKeys.length; j++) {\n    const i = streamKeys[j]\n    if (this[i] === undefined && typeof stream[i] === 'function') {\n      this[i] = stream[i].bind(stream)\n    }\n  }\n  return this\n}\nReadable.prototype[SymbolAsyncIterator] = function () {\n  return streamToAsyncIterator(this)\n}\nReadable.prototype.iterator = function (options) {\n  if (options !== undefined) {\n    validateObject(options, 'options')\n  }\n  return streamToAsyncIterator(this, options)\n}\nfunction streamToAsyncIterator(stream, options) {\n  if (typeof stream.read !== 'function') {\n    stream = Readable.wrap(stream, {\n      objectMode: true\n    })\n  }\n  const iter = createAsyncIterator(stream, options)\n  iter.stream = stream\n  return iter\n}\nasync function* createAsyncIterator(stream, options) {\n  let callback = nop\n  function next(resolve) {\n    if (this === stream) {\n      callback()\n      callback = nop\n    } else {\n      callback = resolve\n    }\n  }\n  stream.on('readable', next)\n  let error\n  const cleanup = eos(\n    stream,\n    {\n      writable: false\n    },\n    (err) => {\n      error = err ? aggregateTwoErrors(error, err) : null\n      callback()\n      callback = nop\n    }\n  )\n  try {\n    while (true) {\n      const chunk = stream.destroyed ? null : stream.read()\n      if (chunk !== null) {\n        yield chunk\n      } else if (error) {\n        throw error\n      } else if (error === null) {\n        return\n      } else {\n        await new Promise(next)\n      }\n    }\n  } catch (err) {\n    error = aggregateTwoErrors(error, err)\n    throw error\n  } finally {\n    if (\n      (error || (options === null || options === undefined ? undefined : options.destroyOnReturn) !== false) &&\n      (error === undefined || stream._readableState.autoDestroy)\n    ) {\n      destroyImpl.destroyer(stream, null)\n    } else {\n      stream.off('readable', next)\n      cleanup()\n    }\n  }\n}\n\n// Making it explicit these properties are not enumerable\n// because otherwise some prototype manipulation in\n// userland will fail.\nObjectDefineProperties(Readable.prototype, {\n  readable: {\n    __proto__: null,\n    get() {\n      const r = this._readableState\n      // r.readable === false means that this is part of a Duplex stream\n      // where the readable side was disabled upon construction.\n      // Compat. The user might manually disable readable side through\n      // deprecated setter.\n      return !!r && r.readable !== false && !r.destroyed && !r.errorEmitted && !r.endEmitted\n    },\n    set(val) {\n      // Backwards compat.\n      if (this._readableState) {\n        this._readableState.readable = !!val\n      }\n    }\n  },\n  readableDidRead: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return this._readableState.dataEmitted\n    }\n  },\n  readableAborted: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return !!(\n        this._readableState.readable !== false &&\n        (this._readableState.destroyed || this._readableState.errored) &&\n        !this._readableState.endEmitted\n      )\n    }\n  },\n  readableHighWaterMark: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return this._readableState.highWaterMark\n    }\n  },\n  readableBuffer: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return this._readableState && this._readableState.buffer\n    }\n  },\n  readableFlowing: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return this._readableState.flowing\n    },\n    set: function (state) {\n      if (this._readableState) {\n        this._readableState.flowing = state\n      }\n    }\n  },\n  readableLength: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState.length\n    }\n  },\n  readableObjectMode: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState ? this._readableState.objectMode : false\n    }\n  },\n  readableEncoding: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState ? this._readableState.encoding : null\n    }\n  },\n  errored: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState ? this._readableState.errored : null\n    }\n  },\n  closed: {\n    __proto__: null,\n    get() {\n      return this._readableState ? this._readableState.closed : false\n    }\n  },\n  destroyed: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState ? this._readableState.destroyed : false\n    },\n    set(value) {\n      // We ignore the value if the stream\n      // has not been initialized yet.\n      if (!this._readableState) {\n        return\n      }\n\n      // Backward compatibility, the user is explicitly\n      // managing destroyed.\n      this._readableState.destroyed = value\n    }\n  },\n  readableEnded: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._readableState ? this._readableState.endEmitted : false\n    }\n  }\n})\nObjectDefineProperties(ReadableState.prototype, {\n  // Legacy getter for `pipesCount`.\n  pipesCount: {\n    __proto__: null,\n    get() {\n      return this.pipes.length\n    }\n  },\n  // Legacy property for `paused`.\n  paused: {\n    __proto__: null,\n    get() {\n      return this[kPaused] !== false\n    },\n    set(value) {\n      this[kPaused] = !!value\n    }\n  }\n})\n\n// Exposed for testing purposes only.\nReadable._fromList = fromList\n\n// Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\nfunction fromList(n, state) {\n  // nothing buffered.\n  if (state.length === 0) return null\n  let ret\n  if (state.objectMode) ret = state.buffer.shift()\n  else if (!n || n >= state.length) {\n    // Read it all, truncate the list.\n    if (state.decoder) ret = state.buffer.join('')\n    else if (state.buffer.length === 1) ret = state.buffer.first()\n    else ret = state.buffer.concat(state.length)\n    state.buffer.clear()\n  } else {\n    // read part of list.\n    ret = state.buffer.consume(n, state.decoder)\n  }\n  return ret\n}\nfunction endReadable(stream) {\n  const state = stream._readableState\n  debug('endReadable', state.endEmitted)\n  if (!state.endEmitted) {\n    state.ended = true\n    process.nextTick(endReadableNT, state, stream)\n  }\n}\nfunction endReadableNT(state, stream) {\n  debug('endReadableNT', state.endEmitted, state.length)\n\n  // Check that we didn't get one last unshift.\n  if (!state.errored && !state.closeEmitted && !state.endEmitted && state.length === 0) {\n    state.endEmitted = true\n    stream.emit('end')\n    if (stream.writable && stream.allowHalfOpen === false) {\n      process.nextTick(endWritableNT, stream)\n    } else if (state.autoDestroy) {\n      // In case of duplex streams we need a way to detect\n      // if the writable side is ready for autoDestroy as well.\n      const wState = stream._writableState\n      const autoDestroy =\n        !wState ||\n        (wState.autoDestroy &&\n          // We don't expect the writable to ever 'finish'\n          // if writable is explicitly set to false.\n          (wState.finished || wState.writable === false))\n      if (autoDestroy) {\n        stream.destroy()\n      }\n    }\n  }\n}\nfunction endWritableNT(stream) {\n  const writable = stream.writable && !stream.writableEnded && !stream.destroyed\n  if (writable) {\n    stream.end()\n  }\n}\nReadable.from = function (iterable, opts) {\n  return from(Readable, iterable, opts)\n}\nlet webStreamsAdapters\n\n// Lazy to avoid circular references\nfunction lazyWebStreams() {\n  if (webStreamsAdapters === undefined) webStreamsAdapters = {}\n  return webStreamsAdapters\n}\nReadable.fromWeb = function (readableStream, options) {\n  return lazyWebStreams().newStreamReadableFromReadableStream(readableStream, options)\n}\nReadable.toWeb = function (streamReadable, options) {\n  return lazyWebStreams().newReadableStreamFromStreamReadable(streamReadable, options)\n}\nReadable.wrap = function (src, options) {\n  var _ref, _src$readableObjectMo\n  return new Readable({\n    objectMode:\n      (_ref =\n        (_src$readableObjectMo = src.readableObjectMode) !== null && _src$readableObjectMo !== undefined\n          ? _src$readableObjectMo\n          : src.objectMode) !== null && _ref !== undefined\n        ? _ref\n        : true,\n    ...options,\n    destroy(err, callback) {\n      destroyImpl.destroyer(src, err)\n      callback(err)\n    }\n  }).wrap(src)\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/readable.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/state.js":
+/*!********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/state.js ***!
+  \********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { MathFloor, NumberIsInteger } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { ERR_INVALID_ARG_VALUE } = (__webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\").codes)\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n  return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null\n}\nfunction getDefaultHighWaterMark(objectMode) {\n  return objectMode ? 16 : 16 * 1024\n}\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n  const hwm = highWaterMarkFrom(options, isDuplex, duplexKey)\n  if (hwm != null) {\n    if (!NumberIsInteger(hwm) || hwm < 0) {\n      const name = isDuplex ? `options.${duplexKey}` : 'options.highWaterMark'\n      throw new ERR_INVALID_ARG_VALUE(name, hwm)\n    }\n    return MathFloor(hwm)\n  }\n\n  // Default value\n  return getDefaultHighWaterMark(state.objectMode)\n}\nmodule.exports = {\n  getHighWaterMark,\n  getDefaultHighWaterMark\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/state.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/transform.js":
+/*!************************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/transform.js ***!
+  \************************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// a transform stream is a readable/writable stream where you do\n// something with the data.  Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored.  (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation.  For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes.  When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up.  When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer.  When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks.  If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk.  However,\n// a pathological inflate type of transform can cause excessive buffering\n// here.  For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output.  Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output.  In this case, you could write a very small\n// amount of input, and end up with a very large amount of output.  In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform.  A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n\n\n\nconst { ObjectSetPrototypeOf, Symbol } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nmodule.exports = Transform\nconst { ERR_METHOD_NOT_IMPLEMENTED } = (__webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\").codes)\nconst Duplex = __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\nconst { getHighWaterMark } = __webpack_require__(/*! ./state */ \"./node_modules/readable-stream/lib/internal/streams/state.js\")\nObjectSetPrototypeOf(Transform.prototype, Duplex.prototype)\nObjectSetPrototypeOf(Transform, Duplex)\nconst kCallback = Symbol('kCallback')\nfunction Transform(options) {\n  if (!(this instanceof Transform)) return new Transform(options)\n\n  // TODO (ronag): This should preferably always be\n  // applied but would be semver-major. Or even better;\n  // make Transform a Readable with the Writable interface.\n  const readableHighWaterMark = options ? getHighWaterMark(this, options, 'readableHighWaterMark', true) : null\n  if (readableHighWaterMark === 0) {\n    // A Duplex will buffer both on the writable and readable side while\n    // a Transform just wants to buffer hwm number of elements. To avoid\n    // buffering twice we disable buffering on the writable side.\n    options = {\n      ...options,\n      highWaterMark: null,\n      readableHighWaterMark,\n      // TODO (ronag): 0 is not optimal since we have\n      // a \"bug\" where we check needDrain before calling _write and not after.\n      // Refs: https://github.com/nodejs/node/pull/32887\n      // Refs: https://github.com/nodejs/node/pull/35941\n      writableHighWaterMark: options.writableHighWaterMark || 0\n    }\n  }\n  Duplex.call(this, options)\n\n  // We have implemented the _read method, and done the other things\n  // that Readable wants before the first _read call, so unset the\n  // sync guard flag.\n  this._readableState.sync = false\n  this[kCallback] = null\n  if (options) {\n    if (typeof options.transform === 'function') this._transform = options.transform\n    if (typeof options.flush === 'function') this._flush = options.flush\n  }\n\n  // When the writable side finishes, then flush out anything remaining.\n  // Backwards compat. Some Transform streams incorrectly implement _final\n  // instead of or in addition to _flush. By using 'prefinish' instead of\n  // implementing _final we continue supporting this unfortunate use case.\n  this.on('prefinish', prefinish)\n}\nfunction final(cb) {\n  if (typeof this._flush === 'function' && !this.destroyed) {\n    this._flush((er, data) => {\n      if (er) {\n        if (cb) {\n          cb(er)\n        } else {\n          this.destroy(er)\n        }\n        return\n      }\n      if (data != null) {\n        this.push(data)\n      }\n      this.push(null)\n      if (cb) {\n        cb()\n      }\n    })\n  } else {\n    this.push(null)\n    if (cb) {\n      cb()\n    }\n  }\n}\nfunction prefinish() {\n  if (this._final !== final) {\n    final.call(this)\n  }\n}\nTransform.prototype._final = final\nTransform.prototype._transform = function (chunk, encoding, callback) {\n  throw new ERR_METHOD_NOT_IMPLEMENTED('_transform()')\n}\nTransform.prototype._write = function (chunk, encoding, callback) {\n  const rState = this._readableState\n  const wState = this._writableState\n  const length = rState.length\n  this._transform(chunk, encoding, (err, val) => {\n    if (err) {\n      callback(err)\n      return\n    }\n    if (val != null) {\n      this.push(val)\n    }\n    if (\n      wState.ended ||\n      // Backwards compat.\n      length === rState.length ||\n      // Backwards compat.\n      rState.length < rState.highWaterMark\n    ) {\n      callback()\n    } else {\n      this[kCallback] = callback\n    }\n  })\n}\nTransform.prototype._read = function () {\n  if (this[kCallback]) {\n    const callback = this[kCallback]\n    this[kCallback] = null\n    callback()\n  }\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/transform.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/utils.js":
+/*!********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/utils.js ***!
+  \********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { Symbol, SymbolAsyncIterator, SymbolIterator, SymbolFor } = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst kDestroyed = Symbol('kDestroyed')\nconst kIsErrored = Symbol('kIsErrored')\nconst kIsReadable = Symbol('kIsReadable')\nconst kIsDisturbed = Symbol('kIsDisturbed')\nconst kIsClosedPromise = SymbolFor('nodejs.webstream.isClosedPromise')\nconst kControllerErrorFunction = SymbolFor('nodejs.webstream.controllerErrorFunction')\nfunction isReadableNodeStream(obj, strict = false) {\n  var _obj$_readableState\n  return !!(\n    (\n      obj &&\n      typeof obj.pipe === 'function' &&\n      typeof obj.on === 'function' &&\n      (!strict || (typeof obj.pause === 'function' && typeof obj.resume === 'function')) &&\n      (!obj._writableState ||\n        ((_obj$_readableState = obj._readableState) === null || _obj$_readableState === undefined\n          ? undefined\n          : _obj$_readableState.readable) !== false) &&\n      // Duplex\n      (!obj._writableState || obj._readableState)\n    ) // Writable has .pipe.\n  )\n}\n\nfunction isWritableNodeStream(obj) {\n  var _obj$_writableState\n  return !!(\n    (\n      obj &&\n      typeof obj.write === 'function' &&\n      typeof obj.on === 'function' &&\n      (!obj._readableState ||\n        ((_obj$_writableState = obj._writableState) === null || _obj$_writableState === undefined\n          ? undefined\n          : _obj$_writableState.writable) !== false)\n    ) // Duplex\n  )\n}\n\nfunction isDuplexNodeStream(obj) {\n  return !!(\n    obj &&\n    typeof obj.pipe === 'function' &&\n    obj._readableState &&\n    typeof obj.on === 'function' &&\n    typeof obj.write === 'function'\n  )\n}\nfunction isNodeStream(obj) {\n  return (\n    obj &&\n    (obj._readableState ||\n      obj._writableState ||\n      (typeof obj.write === 'function' && typeof obj.on === 'function') ||\n      (typeof obj.pipe === 'function' && typeof obj.on === 'function'))\n  )\n}\nfunction isReadableStream(obj) {\n  return !!(\n    obj &&\n    !isNodeStream(obj) &&\n    typeof obj.pipeThrough === 'function' &&\n    typeof obj.getReader === 'function' &&\n    typeof obj.cancel === 'function'\n  )\n}\nfunction isWritableStream(obj) {\n  return !!(obj && !isNodeStream(obj) && typeof obj.getWriter === 'function' && typeof obj.abort === 'function')\n}\nfunction isTransformStream(obj) {\n  return !!(obj && !isNodeStream(obj) && typeof obj.readable === 'object' && typeof obj.writable === 'object')\n}\nfunction isWebStream(obj) {\n  return isReadableStream(obj) || isWritableStream(obj) || isTransformStream(obj)\n}\nfunction isIterable(obj, isAsync) {\n  if (obj == null) return false\n  if (isAsync === true) return typeof obj[SymbolAsyncIterator] === 'function'\n  if (isAsync === false) return typeof obj[SymbolIterator] === 'function'\n  return typeof obj[SymbolAsyncIterator] === 'function' || typeof obj[SymbolIterator] === 'function'\n}\nfunction isDestroyed(stream) {\n  if (!isNodeStream(stream)) return null\n  const wState = stream._writableState\n  const rState = stream._readableState\n  const state = wState || rState\n  return !!(stream.destroyed || stream[kDestroyed] || (state !== null && state !== undefined && state.destroyed))\n}\n\n// Have been end():d.\nfunction isWritableEnded(stream) {\n  if (!isWritableNodeStream(stream)) return null\n  if (stream.writableEnded === true) return true\n  const wState = stream._writableState\n  if (wState !== null && wState !== undefined && wState.errored) return false\n  if (typeof (wState === null || wState === undefined ? undefined : wState.ended) !== 'boolean') return null\n  return wState.ended\n}\n\n// Have emitted 'finish'.\nfunction isWritableFinished(stream, strict) {\n  if (!isWritableNodeStream(stream)) return null\n  if (stream.writableFinished === true) return true\n  const wState = stream._writableState\n  if (wState !== null && wState !== undefined && wState.errored) return false\n  if (typeof (wState === null || wState === undefined ? undefined : wState.finished) !== 'boolean') return null\n  return !!(wState.finished || (strict === false && wState.ended === true && wState.length === 0))\n}\n\n// Have been push(null):d.\nfunction isReadableEnded(stream) {\n  if (!isReadableNodeStream(stream)) return null\n  if (stream.readableEnded === true) return true\n  const rState = stream._readableState\n  if (!rState || rState.errored) return false\n  if (typeof (rState === null || rState === undefined ? undefined : rState.ended) !== 'boolean') return null\n  return rState.ended\n}\n\n// Have emitted 'end'.\nfunction isReadableFinished(stream, strict) {\n  if (!isReadableNodeStream(stream)) return null\n  const rState = stream._readableState\n  if (rState !== null && rState !== undefined && rState.errored) return false\n  if (typeof (rState === null || rState === undefined ? undefined : rState.endEmitted) !== 'boolean') return null\n  return !!(rState.endEmitted || (strict === false && rState.ended === true && rState.length === 0))\n}\nfunction isReadable(stream) {\n  if (stream && stream[kIsReadable] != null) return stream[kIsReadable]\n  if (typeof (stream === null || stream === undefined ? undefined : stream.readable) !== 'boolean') return null\n  if (isDestroyed(stream)) return false\n  return isReadableNodeStream(stream) && stream.readable && !isReadableFinished(stream)\n}\nfunction isWritable(stream) {\n  if (typeof (stream === null || stream === undefined ? undefined : stream.writable) !== 'boolean') return null\n  if (isDestroyed(stream)) return false\n  return isWritableNodeStream(stream) && stream.writable && !isWritableEnded(stream)\n}\nfunction isFinished(stream, opts) {\n  if (!isNodeStream(stream)) {\n    return null\n  }\n  if (isDestroyed(stream)) {\n    return true\n  }\n  if ((opts === null || opts === undefined ? undefined : opts.readable) !== false && isReadable(stream)) {\n    return false\n  }\n  if ((opts === null || opts === undefined ? undefined : opts.writable) !== false && isWritable(stream)) {\n    return false\n  }\n  return true\n}\nfunction isWritableErrored(stream) {\n  var _stream$_writableStat, _stream$_writableStat2\n  if (!isNodeStream(stream)) {\n    return null\n  }\n  if (stream.writableErrored) {\n    return stream.writableErrored\n  }\n  return (_stream$_writableStat =\n    (_stream$_writableStat2 = stream._writableState) === null || _stream$_writableStat2 === undefined\n      ? undefined\n      : _stream$_writableStat2.errored) !== null && _stream$_writableStat !== undefined\n    ? _stream$_writableStat\n    : null\n}\nfunction isReadableErrored(stream) {\n  var _stream$_readableStat, _stream$_readableStat2\n  if (!isNodeStream(stream)) {\n    return null\n  }\n  if (stream.readableErrored) {\n    return stream.readableErrored\n  }\n  return (_stream$_readableStat =\n    (_stream$_readableStat2 = stream._readableState) === null || _stream$_readableStat2 === undefined\n      ? undefined\n      : _stream$_readableStat2.errored) !== null && _stream$_readableStat !== undefined\n    ? _stream$_readableStat\n    : null\n}\nfunction isClosed(stream) {\n  if (!isNodeStream(stream)) {\n    return null\n  }\n  if (typeof stream.closed === 'boolean') {\n    return stream.closed\n  }\n  const wState = stream._writableState\n  const rState = stream._readableState\n  if (\n    typeof (wState === null || wState === undefined ? undefined : wState.closed) === 'boolean' ||\n    typeof (rState === null || rState === undefined ? undefined : rState.closed) === 'boolean'\n  ) {\n    return (\n      (wState === null || wState === undefined ? undefined : wState.closed) ||\n      (rState === null || rState === undefined ? undefined : rState.closed)\n    )\n  }\n  if (typeof stream._closed === 'boolean' && isOutgoingMessage(stream)) {\n    return stream._closed\n  }\n  return null\n}\nfunction isOutgoingMessage(stream) {\n  return (\n    typeof stream._closed === 'boolean' &&\n    typeof stream._defaultKeepAlive === 'boolean' &&\n    typeof stream._removedConnection === 'boolean' &&\n    typeof stream._removedContLen === 'boolean'\n  )\n}\nfunction isServerResponse(stream) {\n  return typeof stream._sent100 === 'boolean' && isOutgoingMessage(stream)\n}\nfunction isServerRequest(stream) {\n  var _stream$req\n  return (\n    typeof stream._consuming === 'boolean' &&\n    typeof stream._dumped === 'boolean' &&\n    ((_stream$req = stream.req) === null || _stream$req === undefined ? undefined : _stream$req.upgradeOrConnect) ===\n      undefined\n  )\n}\nfunction willEmitClose(stream) {\n  if (!isNodeStream(stream)) return null\n  const wState = stream._writableState\n  const rState = stream._readableState\n  const state = wState || rState\n  return (\n    (!state && isServerResponse(stream)) || !!(state && state.autoDestroy && state.emitClose && state.closed === false)\n  )\n}\nfunction isDisturbed(stream) {\n  var _stream$kIsDisturbed\n  return !!(\n    stream &&\n    ((_stream$kIsDisturbed = stream[kIsDisturbed]) !== null && _stream$kIsDisturbed !== undefined\n      ? _stream$kIsDisturbed\n      : stream.readableDidRead || stream.readableAborted)\n  )\n}\nfunction isErrored(stream) {\n  var _ref,\n    _ref2,\n    _ref3,\n    _ref4,\n    _ref5,\n    _stream$kIsErrored,\n    _stream$_readableStat3,\n    _stream$_writableStat3,\n    _stream$_readableStat4,\n    _stream$_writableStat4\n  return !!(\n    stream &&\n    ((_ref =\n      (_ref2 =\n        (_ref3 =\n          (_ref4 =\n            (_ref5 =\n              (_stream$kIsErrored = stream[kIsErrored]) !== null && _stream$kIsErrored !== undefined\n                ? _stream$kIsErrored\n                : stream.readableErrored) !== null && _ref5 !== undefined\n              ? _ref5\n              : stream.writableErrored) !== null && _ref4 !== undefined\n            ? _ref4\n            : (_stream$_readableStat3 = stream._readableState) === null || _stream$_readableStat3 === undefined\n            ? undefined\n            : _stream$_readableStat3.errorEmitted) !== null && _ref3 !== undefined\n          ? _ref3\n          : (_stream$_writableStat3 = stream._writableState) === null || _stream$_writableStat3 === undefined\n          ? undefined\n          : _stream$_writableStat3.errorEmitted) !== null && _ref2 !== undefined\n        ? _ref2\n        : (_stream$_readableStat4 = stream._readableState) === null || _stream$_readableStat4 === undefined\n        ? undefined\n        : _stream$_readableStat4.errored) !== null && _ref !== undefined\n      ? _ref\n      : (_stream$_writableStat4 = stream._writableState) === null || _stream$_writableStat4 === undefined\n      ? undefined\n      : _stream$_writableStat4.errored)\n  )\n}\nmodule.exports = {\n  kDestroyed,\n  isDisturbed,\n  kIsDisturbed,\n  isErrored,\n  kIsErrored,\n  isReadable,\n  kIsReadable,\n  kIsClosedPromise,\n  kControllerErrorFunction,\n  isClosed,\n  isDestroyed,\n  isDuplexNodeStream,\n  isFinished,\n  isIterable,\n  isReadableNodeStream,\n  isReadableStream,\n  isReadableEnded,\n  isReadableFinished,\n  isReadableErrored,\n  isNodeStream,\n  isWebStream,\n  isWritable,\n  isWritableNodeStream,\n  isWritableStream,\n  isWritableEnded,\n  isWritableFinished,\n  isWritableErrored,\n  isServerRequest,\n  isServerResponse,\n  willEmitClose,\n  isTransformStream\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/utils.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/streams/writable.js":
+/*!***********************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/streams/writable.js ***!
+  \***********************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst process = __webpack_require__(/*! process/ */ \"./node_modules/process/browser.js\")\n\n/* replacement end */\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n\n;('use strict')\nconst {\n  ArrayPrototypeSlice,\n  Error,\n  FunctionPrototypeSymbolHasInstance,\n  ObjectDefineProperty,\n  ObjectDefineProperties,\n  ObjectSetPrototypeOf,\n  StringPrototypeToLowerCase,\n  Symbol,\n  SymbolHasInstance\n} = __webpack_require__(/*! ../../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nmodule.exports = Writable\nWritable.WritableState = WritableState\nconst { EventEmitter: EE } = __webpack_require__(/*! events */ \"./node_modules/events/events.js\")\nconst Stream = (__webpack_require__(/*! ./legacy */ \"./node_modules/readable-stream/lib/internal/streams/legacy.js\").Stream)\nconst { Buffer } = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst destroyImpl = __webpack_require__(/*! ./destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst { addAbortSignal } = __webpack_require__(/*! ./add-abort-signal */ \"./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js\")\nconst { getHighWaterMark, getDefaultHighWaterMark } = __webpack_require__(/*! ./state */ \"./node_modules/readable-stream/lib/internal/streams/state.js\")\nconst {\n  ERR_INVALID_ARG_TYPE,\n  ERR_METHOD_NOT_IMPLEMENTED,\n  ERR_MULTIPLE_CALLBACK,\n  ERR_STREAM_CANNOT_PIPE,\n  ERR_STREAM_DESTROYED,\n  ERR_STREAM_ALREADY_FINISHED,\n  ERR_STREAM_NULL_VALUES,\n  ERR_STREAM_WRITE_AFTER_END,\n  ERR_UNKNOWN_ENCODING\n} = (__webpack_require__(/*! ../../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\").codes)\nconst { errorOrDestroy } = destroyImpl\nObjectSetPrototypeOf(Writable.prototype, Stream.prototype)\nObjectSetPrototypeOf(Writable, Stream)\nfunction nop() {}\nconst kOnFinished = Symbol('kOnFinished')\nfunction WritableState(options, stream, isDuplex) {\n  // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream,\n  // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\n\n  // Object stream flag to indicate whether or not this stream\n  // contains buffers or objects.\n  this.objectMode = !!(options && options.objectMode)\n  if (isDuplex) this.objectMode = this.objectMode || !!(options && options.writableObjectMode)\n\n  // The point at which write() starts returning false\n  // Note: 0 is a valid value, means that we always return false if\n  // the entire buffer is not flushed immediately on write().\n  this.highWaterMark = options\n    ? getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex)\n    : getDefaultHighWaterMark(false)\n\n  // if _final has been called.\n  this.finalCalled = false\n\n  // drain event flag.\n  this.needDrain = false\n  // At the start of calling end()\n  this.ending = false\n  // When end() has been called, and returned.\n  this.ended = false\n  // When 'finish' is emitted.\n  this.finished = false\n\n  // Has it been destroyed\n  this.destroyed = false\n\n  // Should we decode strings into buffers before passing to _write?\n  // this is here so that some node-core streams can optimize string\n  // handling at a lower level.\n  const noDecode = !!(options && options.decodeStrings === false)\n  this.decodeStrings = !noDecode\n\n  // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n  this.defaultEncoding = (options && options.defaultEncoding) || 'utf8'\n\n  // Not an actual buffer we keep track of, but a measurement\n  // of how much we're waiting to get pushed to some underlying\n  // socket or file.\n  this.length = 0\n\n  // A flag to see when we're in the middle of a write.\n  this.writing = false\n\n  // When true all writes will be buffered until .uncork() call.\n  this.corked = 0\n\n  // A flag to be able to tell if the onwrite cb is called immediately,\n  // or on a later tick.  We set this to true at first, because any\n  // actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first write call.\n  this.sync = true\n\n  // A flag to know if we're processing previously buffered items, which\n  // may call the _write() callback in the same tick, so that we don't\n  // end up in an overlapped onwrite situation.\n  this.bufferProcessing = false\n\n  // The callback that's passed to _write(chunk, cb).\n  this.onwrite = onwrite.bind(undefined, stream)\n\n  // The callback that the user supplies to write(chunk, encoding, cb).\n  this.writecb = null\n\n  // The amount that is being written when _write is called.\n  this.writelen = 0\n\n  // Storage for data passed to the afterWrite() callback in case of\n  // synchronous _write() completion.\n  this.afterWriteTickInfo = null\n  resetBuffer(this)\n\n  // Number of pending user-supplied write callbacks\n  // this must be 0 before 'finish' can be emitted.\n  this.pendingcb = 0\n\n  // Stream is still being constructed and cannot be\n  // destroyed until construction finished or failed.\n  // Async construction is opt in, therefore we start as\n  // constructed.\n  this.constructed = true\n\n  // Emit prefinish if the only thing we're waiting for is _write cbs\n  // This is relevant for synchronous Transform streams.\n  this.prefinished = false\n\n  // True if the error was already emitted and should not be thrown again.\n  this.errorEmitted = false\n\n  // Should close be emitted on destroy. Defaults to true.\n  this.emitClose = !options || options.emitClose !== false\n\n  // Should .destroy() be called after 'finish' (and potentially 'end').\n  this.autoDestroy = !options || options.autoDestroy !== false\n\n  // Indicates whether the stream has errored. When true all write() calls\n  // should return false. This is needed since when autoDestroy\n  // is disabled we need a way to tell whether the stream has failed.\n  this.errored = null\n\n  // Indicates whether the stream has finished destroying.\n  this.closed = false\n\n  // True if close has been emitted or would have been emitted\n  // depending on emitClose.\n  this.closeEmitted = false\n  this[kOnFinished] = []\n}\nfunction resetBuffer(state) {\n  state.buffered = []\n  state.bufferedIndex = 0\n  state.allBuffers = true\n  state.allNoop = true\n}\nWritableState.prototype.getBuffer = function getBuffer() {\n  return ArrayPrototypeSlice(this.buffered, this.bufferedIndex)\n}\nObjectDefineProperty(WritableState.prototype, 'bufferedRequestCount', {\n  __proto__: null,\n  get() {\n    return this.buffered.length - this.bufferedIndex\n  }\n})\nfunction Writable(options) {\n  // Writable ctor is applied to Duplexes, too.\n  // `realHasInstance` is necessary because using plain `instanceof`\n  // would return false, as no `_writableState` property is attached.\n\n  // Trying to use the custom `instanceof` for Writable here will also break the\n  // Node.js LazyTransform implementation, which has a non-trivial getter for\n  // `_writableState` that would lead to infinite recursion.\n\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the WritableState constructor, at least with V8 6.5.\n  const isDuplex = this instanceof __webpack_require__(/*! ./duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\n  if (!isDuplex && !FunctionPrototypeSymbolHasInstance(Writable, this)) return new Writable(options)\n  this._writableState = new WritableState(options, this, isDuplex)\n  if (options) {\n    if (typeof options.write === 'function') this._write = options.write\n    if (typeof options.writev === 'function') this._writev = options.writev\n    if (typeof options.destroy === 'function') this._destroy = options.destroy\n    if (typeof options.final === 'function') this._final = options.final\n    if (typeof options.construct === 'function') this._construct = options.construct\n    if (options.signal) addAbortSignal(options.signal, this)\n  }\n  Stream.call(this, options)\n  destroyImpl.construct(this, () => {\n    const state = this._writableState\n    if (!state.writing) {\n      clearBuffer(this, state)\n    }\n    finishMaybe(this, state)\n  })\n}\nObjectDefineProperty(Writable, SymbolHasInstance, {\n  __proto__: null,\n  value: function (object) {\n    if (FunctionPrototypeSymbolHasInstance(this, object)) return true\n    if (this !== Writable) return false\n    return object && object._writableState instanceof WritableState\n  }\n})\n\n// Otherwise people can pipe Writable streams, which is just wrong.\nWritable.prototype.pipe = function () {\n  errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE())\n}\nfunction _write(stream, chunk, encoding, cb) {\n  const state = stream._writableState\n  if (typeof encoding === 'function') {\n    cb = encoding\n    encoding = state.defaultEncoding\n  } else {\n    if (!encoding) encoding = state.defaultEncoding\n    else if (encoding !== 'buffer' && !Buffer.isEncoding(encoding)) throw new ERR_UNKNOWN_ENCODING(encoding)\n    if (typeof cb !== 'function') cb = nop\n  }\n  if (chunk === null) {\n    throw new ERR_STREAM_NULL_VALUES()\n  } else if (!state.objectMode) {\n    if (typeof chunk === 'string') {\n      if (state.decodeStrings !== false) {\n        chunk = Buffer.from(chunk, encoding)\n        encoding = 'buffer'\n      }\n    } else if (chunk instanceof Buffer) {\n      encoding = 'buffer'\n    } else if (Stream._isUint8Array(chunk)) {\n      chunk = Stream._uint8ArrayToBuffer(chunk)\n      encoding = 'buffer'\n    } else {\n      throw new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk)\n    }\n  }\n  let err\n  if (state.ending) {\n    err = new ERR_STREAM_WRITE_AFTER_END()\n  } else if (state.destroyed) {\n    err = new ERR_STREAM_DESTROYED('write')\n  }\n  if (err) {\n    process.nextTick(cb, err)\n    errorOrDestroy(stream, err, true)\n    return err\n  }\n  state.pendingcb++\n  return writeOrBuffer(stream, state, chunk, encoding, cb)\n}\nWritable.prototype.write = function (chunk, encoding, cb) {\n  return _write(this, chunk, encoding, cb) === true\n}\nWritable.prototype.cork = function () {\n  this._writableState.corked++\n}\nWritable.prototype.uncork = function () {\n  const state = this._writableState\n  if (state.corked) {\n    state.corked--\n    if (!state.writing) clearBuffer(this, state)\n  }\n}\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n  // node::ParseEncoding() requires lower case.\n  if (typeof encoding === 'string') encoding = StringPrototypeToLowerCase(encoding)\n  if (!Buffer.isEncoding(encoding)) throw new ERR_UNKNOWN_ENCODING(encoding)\n  this._writableState.defaultEncoding = encoding\n  return this\n}\n\n// If we're already writing something, then just put this\n// in the queue, and wait our turn.  Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\nfunction writeOrBuffer(stream, state, chunk, encoding, callback) {\n  const len = state.objectMode ? 1 : chunk.length\n  state.length += len\n\n  // stream._write resets state.length\n  const ret = state.length < state.highWaterMark\n  // We must ensure that previous needDrain will not be reset to false.\n  if (!ret) state.needDrain = true\n  if (state.writing || state.corked || state.errored || !state.constructed) {\n    state.buffered.push({\n      chunk,\n      encoding,\n      callback\n    })\n    if (state.allBuffers && encoding !== 'buffer') {\n      state.allBuffers = false\n    }\n    if (state.allNoop && callback !== nop) {\n      state.allNoop = false\n    }\n  } else {\n    state.writelen = len\n    state.writecb = callback\n    state.writing = true\n    state.sync = true\n    stream._write(chunk, encoding, state.onwrite)\n    state.sync = false\n  }\n\n  // Return false if errored or destroyed in order to break\n  // any synchronous while(stream.write(data)) loops.\n  return ret && !state.errored && !state.destroyed\n}\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n  state.writelen = len\n  state.writecb = cb\n  state.writing = true\n  state.sync = true\n  if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'))\n  else if (writev) stream._writev(chunk, state.onwrite)\n  else stream._write(chunk, encoding, state.onwrite)\n  state.sync = false\n}\nfunction onwriteError(stream, state, er, cb) {\n  --state.pendingcb\n  cb(er)\n  // Ensure callbacks are invoked even when autoDestroy is\n  // not enabled. Passing `er` here doesn't make sense since\n  // it's related to one specific write, not to the buffered\n  // writes.\n  errorBuffer(state)\n  // This can emit error, but error must always follow cb.\n  errorOrDestroy(stream, er)\n}\nfunction onwrite(stream, er) {\n  const state = stream._writableState\n  const sync = state.sync\n  const cb = state.writecb\n  if (typeof cb !== 'function') {\n    errorOrDestroy(stream, new ERR_MULTIPLE_CALLBACK())\n    return\n  }\n  state.writing = false\n  state.writecb = null\n  state.length -= state.writelen\n  state.writelen = 0\n  if (er) {\n    // Avoid V8 leak, https://github.com/nodejs/node/pull/34103#issuecomment-652002364\n    er.stack // eslint-disable-line no-unused-expressions\n\n    if (!state.errored) {\n      state.errored = er\n    }\n\n    // In case of duplex streams we need to notify the readable side of the\n    // error.\n    if (stream._readableState && !stream._readableState.errored) {\n      stream._readableState.errored = er\n    }\n    if (sync) {\n      process.nextTick(onwriteError, stream, state, er, cb)\n    } else {\n      onwriteError(stream, state, er, cb)\n    }\n  } else {\n    if (state.buffered.length > state.bufferedIndex) {\n      clearBuffer(stream, state)\n    }\n    if (sync) {\n      // It is a common case that the callback passed to .write() is always\n      // the same. In that case, we do not schedule a new nextTick(), but\n      // rather just increase a counter, to improve performance and avoid\n      // memory allocations.\n      if (state.afterWriteTickInfo !== null && state.afterWriteTickInfo.cb === cb) {\n        state.afterWriteTickInfo.count++\n      } else {\n        state.afterWriteTickInfo = {\n          count: 1,\n          cb,\n          stream,\n          state\n        }\n        process.nextTick(afterWriteTick, state.afterWriteTickInfo)\n      }\n    } else {\n      afterWrite(stream, state, 1, cb)\n    }\n  }\n}\nfunction afterWriteTick({ stream, state, count, cb }) {\n  state.afterWriteTickInfo = null\n  return afterWrite(stream, state, count, cb)\n}\nfunction afterWrite(stream, state, count, cb) {\n  const needDrain = !state.ending && !stream.destroyed && state.length === 0 && state.needDrain\n  if (needDrain) {\n    state.needDrain = false\n    stream.emit('drain')\n  }\n  while (count-- > 0) {\n    state.pendingcb--\n    cb()\n  }\n  if (state.destroyed) {\n    errorBuffer(state)\n  }\n  finishMaybe(stream, state)\n}\n\n// If there's something in the buffer waiting, then invoke callbacks.\nfunction errorBuffer(state) {\n  if (state.writing) {\n    return\n  }\n  for (let n = state.bufferedIndex; n < state.buffered.length; ++n) {\n    var _state$errored\n    const { chunk, callback } = state.buffered[n]\n    const len = state.objectMode ? 1 : chunk.length\n    state.length -= len\n    callback(\n      (_state$errored = state.errored) !== null && _state$errored !== undefined\n        ? _state$errored\n        : new ERR_STREAM_DESTROYED('write')\n    )\n  }\n  const onfinishCallbacks = state[kOnFinished].splice(0)\n  for (let i = 0; i < onfinishCallbacks.length; i++) {\n    var _state$errored2\n    onfinishCallbacks[i](\n      (_state$errored2 = state.errored) !== null && _state$errored2 !== undefined\n        ? _state$errored2\n        : new ERR_STREAM_DESTROYED('end')\n    )\n  }\n  resetBuffer(state)\n}\n\n// If there's something in the buffer waiting, then process it.\nfunction clearBuffer(stream, state) {\n  if (state.corked || state.bufferProcessing || state.destroyed || !state.constructed) {\n    return\n  }\n  const { buffered, bufferedIndex, objectMode } = state\n  const bufferedLength = buffered.length - bufferedIndex\n  if (!bufferedLength) {\n    return\n  }\n  let i = bufferedIndex\n  state.bufferProcessing = true\n  if (bufferedLength > 1 && stream._writev) {\n    state.pendingcb -= bufferedLength - 1\n    const callback = state.allNoop\n      ? nop\n      : (err) => {\n          for (let n = i; n < buffered.length; ++n) {\n            buffered[n].callback(err)\n          }\n        }\n    // Make a copy of `buffered` if it's going to be used by `callback` above,\n    // since `doWrite` will mutate the array.\n    const chunks = state.allNoop && i === 0 ? buffered : ArrayPrototypeSlice(buffered, i)\n    chunks.allBuffers = state.allBuffers\n    doWrite(stream, state, true, state.length, chunks, '', callback)\n    resetBuffer(state)\n  } else {\n    do {\n      const { chunk, encoding, callback } = buffered[i]\n      buffered[i++] = null\n      const len = objectMode ? 1 : chunk.length\n      doWrite(stream, state, false, len, chunk, encoding, callback)\n    } while (i < buffered.length && !state.writing)\n    if (i === buffered.length) {\n      resetBuffer(state)\n    } else if (i > 256) {\n      buffered.splice(0, i)\n      state.bufferedIndex = 0\n    } else {\n      state.bufferedIndex = i\n    }\n  }\n  state.bufferProcessing = false\n}\nWritable.prototype._write = function (chunk, encoding, cb) {\n  if (this._writev) {\n    this._writev(\n      [\n        {\n          chunk,\n          encoding\n        }\n      ],\n      cb\n    )\n  } else {\n    throw new ERR_METHOD_NOT_IMPLEMENTED('_write()')\n  }\n}\nWritable.prototype._writev = null\nWritable.prototype.end = function (chunk, encoding, cb) {\n  const state = this._writableState\n  if (typeof chunk === 'function') {\n    cb = chunk\n    chunk = null\n    encoding = null\n  } else if (typeof encoding === 'function') {\n    cb = encoding\n    encoding = null\n  }\n  let err\n  if (chunk !== null && chunk !== undefined) {\n    const ret = _write(this, chunk, encoding)\n    if (ret instanceof Error) {\n      err = ret\n    }\n  }\n\n  // .end() fully uncorks.\n  if (state.corked) {\n    state.corked = 1\n    this.uncork()\n  }\n  if (err) {\n    // Do nothing...\n  } else if (!state.errored && !state.ending) {\n    // This is forgiving in terms of unnecessary calls to end() and can hide\n    // logic errors. However, usually such errors are harmless and causing a\n    // hard error can be disproportionately destructive. It is not always\n    // trivial for the user to determine whether end() needs to be called\n    // or not.\n\n    state.ending = true\n    finishMaybe(this, state, true)\n    state.ended = true\n  } else if (state.finished) {\n    err = new ERR_STREAM_ALREADY_FINISHED('end')\n  } else if (state.destroyed) {\n    err = new ERR_STREAM_DESTROYED('end')\n  }\n  if (typeof cb === 'function') {\n    if (err || state.finished) {\n      process.nextTick(cb, err)\n    } else {\n      state[kOnFinished].push(cb)\n    }\n  }\n  return this\n}\nfunction needFinish(state) {\n  return (\n    state.ending &&\n    !state.destroyed &&\n    state.constructed &&\n    state.length === 0 &&\n    !state.errored &&\n    state.buffered.length === 0 &&\n    !state.finished &&\n    !state.writing &&\n    !state.errorEmitted &&\n    !state.closeEmitted\n  )\n}\nfunction callFinal(stream, state) {\n  let called = false\n  function onFinish(err) {\n    if (called) {\n      errorOrDestroy(stream, err !== null && err !== undefined ? err : ERR_MULTIPLE_CALLBACK())\n      return\n    }\n    called = true\n    state.pendingcb--\n    if (err) {\n      const onfinishCallbacks = state[kOnFinished].splice(0)\n      for (let i = 0; i < onfinishCallbacks.length; i++) {\n        onfinishCallbacks[i](err)\n      }\n      errorOrDestroy(stream, err, state.sync)\n    } else if (needFinish(state)) {\n      state.prefinished = true\n      stream.emit('prefinish')\n      // Backwards compat. Don't check state.sync here.\n      // Some streams assume 'finish' will be emitted\n      // asynchronously relative to _final callback.\n      state.pendingcb++\n      process.nextTick(finish, stream, state)\n    }\n  }\n  state.sync = true\n  state.pendingcb++\n  try {\n    stream._final(onFinish)\n  } catch (err) {\n    onFinish(err)\n  }\n  state.sync = false\n}\nfunction prefinish(stream, state) {\n  if (!state.prefinished && !state.finalCalled) {\n    if (typeof stream._final === 'function' && !state.destroyed) {\n      state.finalCalled = true\n      callFinal(stream, state)\n    } else {\n      state.prefinished = true\n      stream.emit('prefinish')\n    }\n  }\n}\nfunction finishMaybe(stream, state, sync) {\n  if (needFinish(state)) {\n    prefinish(stream, state)\n    if (state.pendingcb === 0) {\n      if (sync) {\n        state.pendingcb++\n        process.nextTick(\n          (stream, state) => {\n            if (needFinish(state)) {\n              finish(stream, state)\n            } else {\n              state.pendingcb--\n            }\n          },\n          stream,\n          state\n        )\n      } else if (needFinish(state)) {\n        state.pendingcb++\n        finish(stream, state)\n      }\n    }\n  }\n}\nfunction finish(stream, state) {\n  state.pendingcb--\n  state.finished = true\n  const onfinishCallbacks = state[kOnFinished].splice(0)\n  for (let i = 0; i < onfinishCallbacks.length; i++) {\n    onfinishCallbacks[i]()\n  }\n  stream.emit('finish')\n  if (state.autoDestroy) {\n    // In case of duplex streams we need a way to detect\n    // if the readable side is ready for autoDestroy as well.\n    const rState = stream._readableState\n    const autoDestroy =\n      !rState ||\n      (rState.autoDestroy &&\n        // We don't expect the readable to ever 'end'\n        // if readable is explicitly set to false.\n        (rState.endEmitted || rState.readable === false))\n    if (autoDestroy) {\n      stream.destroy()\n    }\n  }\n}\nObjectDefineProperties(Writable.prototype, {\n  closed: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.closed : false\n    }\n  },\n  destroyed: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.destroyed : false\n    },\n    set(value) {\n      // Backward compatibility, the user is explicitly managing destroyed.\n      if (this._writableState) {\n        this._writableState.destroyed = value\n      }\n    }\n  },\n  writable: {\n    __proto__: null,\n    get() {\n      const w = this._writableState\n      // w.writable === false means that this is part of a Duplex stream\n      // where the writable side was disabled upon construction.\n      // Compat. The user might manually disable writable side through\n      // deprecated setter.\n      return !!w && w.writable !== false && !w.destroyed && !w.errored && !w.ending && !w.ended\n    },\n    set(val) {\n      // Backwards compatible.\n      if (this._writableState) {\n        this._writableState.writable = !!val\n      }\n    }\n  },\n  writableFinished: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.finished : false\n    }\n  },\n  writableObjectMode: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.objectMode : false\n    }\n  },\n  writableBuffer: {\n    __proto__: null,\n    get() {\n      return this._writableState && this._writableState.getBuffer()\n    }\n  },\n  writableEnded: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.ending : false\n    }\n  },\n  writableNeedDrain: {\n    __proto__: null,\n    get() {\n      const wState = this._writableState\n      if (!wState) return false\n      return !wState.destroyed && !wState.ending && wState.needDrain\n    }\n  },\n  writableHighWaterMark: {\n    __proto__: null,\n    get() {\n      return this._writableState && this._writableState.highWaterMark\n    }\n  },\n  writableCorked: {\n    __proto__: null,\n    get() {\n      return this._writableState ? this._writableState.corked : 0\n    }\n  },\n  writableLength: {\n    __proto__: null,\n    get() {\n      return this._writableState && this._writableState.length\n    }\n  },\n  errored: {\n    __proto__: null,\n    enumerable: false,\n    get() {\n      return this._writableState ? this._writableState.errored : null\n    }\n  },\n  writableAborted: {\n    __proto__: null,\n    enumerable: false,\n    get: function () {\n      return !!(\n        this._writableState.writable !== false &&\n        (this._writableState.destroyed || this._writableState.errored) &&\n        !this._writableState.finished\n      )\n    }\n  }\n})\nconst destroy = destroyImpl.destroy\nWritable.prototype.destroy = function (err, cb) {\n  const state = this._writableState\n\n  // Invoke pending callbacks.\n  if (!state.destroyed && (state.bufferedIndex < state.buffered.length || state[kOnFinished].length)) {\n    process.nextTick(errorBuffer, state)\n  }\n  destroy.call(this, err, cb)\n  return this\n}\nWritable.prototype._undestroy = destroyImpl.undestroy\nWritable.prototype._destroy = function (err, cb) {\n  cb(err)\n}\nWritable.prototype[EE.captureRejectionSymbol] = function (err) {\n  this.destroy(err)\n}\nlet webStreamsAdapters\n\n// Lazy to avoid circular references\nfunction lazyWebStreams() {\n  if (webStreamsAdapters === undefined) webStreamsAdapters = {}\n  return webStreamsAdapters\n}\nWritable.fromWeb = function (writableStream, options) {\n  return lazyWebStreams().newStreamWritableFromWritableStream(writableStream, options)\n}\nWritable.toWeb = function (streamWritable) {\n  return lazyWebStreams().newWritableStreamFromStreamWritable(streamWritable)\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/streams/writable.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/internal/validators.js":
+/*!*****************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/internal/validators.js ***!
+  \*****************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("/* eslint jsdoc/require-jsdoc: \"error\" */\n\n\n\nconst {\n  ArrayIsArray,\n  ArrayPrototypeIncludes,\n  ArrayPrototypeJoin,\n  ArrayPrototypeMap,\n  NumberIsInteger,\n  NumberIsNaN,\n  NumberMAX_SAFE_INTEGER,\n  NumberMIN_SAFE_INTEGER,\n  NumberParseInt,\n  ObjectPrototypeHasOwnProperty,\n  RegExpPrototypeExec,\n  String,\n  StringPrototypeToUpperCase,\n  StringPrototypeTrim\n} = __webpack_require__(/*! ../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst {\n  hideStackFrames,\n  codes: { ERR_SOCKET_BAD_PORT, ERR_INVALID_ARG_TYPE, ERR_INVALID_ARG_VALUE, ERR_OUT_OF_RANGE, ERR_UNKNOWN_SIGNAL }\n} = __webpack_require__(/*! ../ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst { normalizeEncoding } = __webpack_require__(/*! ../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nconst { isAsyncFunction, isArrayBufferView } = (__webpack_require__(/*! ../ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\").types)\nconst signals = {}\n\n/**\n * @param {*} value\n * @returns {boolean}\n */\nfunction isInt32(value) {\n  return value === (value | 0)\n}\n\n/**\n * @param {*} value\n * @returns {boolean}\n */\nfunction isUint32(value) {\n  return value === value >>> 0\n}\nconst octalReg = /^[0-7]+$/\nconst modeDesc = 'must be a 32-bit unsigned integer or an octal string'\n\n/**\n * Parse and validate values that will be converted into mode_t (the S_*\n * constants). Only valid numbers and octal strings are allowed. They could be\n * converted to 32-bit unsigned integers or non-negative signed integers in the\n * C++ land, but any value higher than 0o777 will result in platform-specific\n * behaviors.\n *\n * @param {*} value Values to be validated\n * @param {string} name Name of the argument\n * @param {number} [def] If specified, will be returned for invalid values\n * @returns {number}\n */\nfunction parseFileMode(value, name, def) {\n  if (typeof value === 'undefined') {\n    value = def\n  }\n  if (typeof value === 'string') {\n    if (RegExpPrototypeExec(octalReg, value) === null) {\n      throw new ERR_INVALID_ARG_VALUE(name, value, modeDesc)\n    }\n    value = NumberParseInt(value, 8)\n  }\n  validateUint32(value, name)\n  return value\n}\n\n/**\n * @callback validateInteger\n * @param {*} value\n * @param {string} name\n * @param {number} [min]\n * @param {number} [max]\n * @returns {asserts value is number}\n */\n\n/** @type {validateInteger} */\nconst validateInteger = hideStackFrames((value, name, min = NumberMIN_SAFE_INTEGER, max = NumberMAX_SAFE_INTEGER) => {\n  if (typeof value !== 'number') throw new ERR_INVALID_ARG_TYPE(name, 'number', value)\n  if (!NumberIsInteger(value)) throw new ERR_OUT_OF_RANGE(name, 'an integer', value)\n  if (value < min || value > max) throw new ERR_OUT_OF_RANGE(name, `>= ${min} && <= ${max}`, value)\n})\n\n/**\n * @callback validateInt32\n * @param {*} value\n * @param {string} name\n * @param {number} [min]\n * @param {number} [max]\n * @returns {asserts value is number}\n */\n\n/** @type {validateInt32} */\nconst validateInt32 = hideStackFrames((value, name, min = -2147483648, max = 2147483647) => {\n  // The defaults for min and max correspond to the limits of 32-bit integers.\n  if (typeof value !== 'number') {\n    throw new ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n  if (!NumberIsInteger(value)) {\n    throw new ERR_OUT_OF_RANGE(name, 'an integer', value)\n  }\n  if (value < min || value > max) {\n    throw new ERR_OUT_OF_RANGE(name, `>= ${min} && <= ${max}`, value)\n  }\n})\n\n/**\n * @callback validateUint32\n * @param {*} value\n * @param {string} name\n * @param {number|boolean} [positive=false]\n * @returns {asserts value is number}\n */\n\n/** @type {validateUint32} */\nconst validateUint32 = hideStackFrames((value, name, positive = false) => {\n  if (typeof value !== 'number') {\n    throw new ERR_INVALID_ARG_TYPE(name, 'number', value)\n  }\n  if (!NumberIsInteger(value)) {\n    throw new ERR_OUT_OF_RANGE(name, 'an integer', value)\n  }\n  const min = positive ? 1 : 0\n  // 2 ** 32 === 4294967296\n  const max = 4294967295\n  if (value < min || value > max) {\n    throw new ERR_OUT_OF_RANGE(name, `>= ${min} && <= ${max}`, value)\n  }\n})\n\n/**\n * @callback validateString\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is string}\n */\n\n/** @type {validateString} */\nfunction validateString(value, name) {\n  if (typeof value !== 'string') throw new ERR_INVALID_ARG_TYPE(name, 'string', value)\n}\n\n/**\n * @callback validateNumber\n * @param {*} value\n * @param {string} name\n * @param {number} [min]\n * @param {number} [max]\n * @returns {asserts value is number}\n */\n\n/** @type {validateNumber} */\nfunction validateNumber(value, name, min = undefined, max) {\n  if (typeof value !== 'number') throw new ERR_INVALID_ARG_TYPE(name, 'number', value)\n  if (\n    (min != null && value < min) ||\n    (max != null && value > max) ||\n    ((min != null || max != null) && NumberIsNaN(value))\n  ) {\n    throw new ERR_OUT_OF_RANGE(\n      name,\n      `${min != null ? `>= ${min}` : ''}${min != null && max != null ? ' && ' : ''}${max != null ? `<= ${max}` : ''}`,\n      value\n    )\n  }\n}\n\n/**\n * @callback validateOneOf\n * @template T\n * @param {T} value\n * @param {string} name\n * @param {T[]} oneOf\n */\n\n/** @type {validateOneOf} */\nconst validateOneOf = hideStackFrames((value, name, oneOf) => {\n  if (!ArrayPrototypeIncludes(oneOf, value)) {\n    const allowed = ArrayPrototypeJoin(\n      ArrayPrototypeMap(oneOf, (v) => (typeof v === 'string' ? `'${v}'` : String(v))),\n      ', '\n    )\n    const reason = 'must be one of: ' + allowed\n    throw new ERR_INVALID_ARG_VALUE(name, value, reason)\n  }\n})\n\n/**\n * @callback validateBoolean\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is boolean}\n */\n\n/** @type {validateBoolean} */\nfunction validateBoolean(value, name) {\n  if (typeof value !== 'boolean') throw new ERR_INVALID_ARG_TYPE(name, 'boolean', value)\n}\n\n/**\n * @param {any} options\n * @param {string} key\n * @param {boolean} defaultValue\n * @returns {boolean}\n */\nfunction getOwnPropertyValueOrDefault(options, key, defaultValue) {\n  return options == null || !ObjectPrototypeHasOwnProperty(options, key) ? defaultValue : options[key]\n}\n\n/**\n * @callback validateObject\n * @param {*} value\n * @param {string} name\n * @param {{\n *   allowArray?: boolean,\n *   allowFunction?: boolean,\n *   nullable?: boolean\n * }} [options]\n */\n\n/** @type {validateObject} */\nconst validateObject = hideStackFrames((value, name, options = null) => {\n  const allowArray = getOwnPropertyValueOrDefault(options, 'allowArray', false)\n  const allowFunction = getOwnPropertyValueOrDefault(options, 'allowFunction', false)\n  const nullable = getOwnPropertyValueOrDefault(options, 'nullable', false)\n  if (\n    (!nullable && value === null) ||\n    (!allowArray && ArrayIsArray(value)) ||\n    (typeof value !== 'object' && (!allowFunction || typeof value !== 'function'))\n  ) {\n    throw new ERR_INVALID_ARG_TYPE(name, 'Object', value)\n  }\n})\n\n/**\n * @callback validateDictionary - We are using the Web IDL Standard definition\n *                                of \"dictionary\" here, which means any value\n *                                whose Type is either Undefined, Null, or\n *                                Object (which includes functions).\n * @param {*} value\n * @param {string} name\n * @see https://webidl.spec.whatwg.org/#es-dictionary\n * @see https://tc39.es/ecma262/#table-typeof-operator-results\n */\n\n/** @type {validateDictionary} */\nconst validateDictionary = hideStackFrames((value, name) => {\n  if (value != null && typeof value !== 'object' && typeof value !== 'function') {\n    throw new ERR_INVALID_ARG_TYPE(name, 'a dictionary', value)\n  }\n})\n\n/**\n * @callback validateArray\n * @param {*} value\n * @param {string} name\n * @param {number} [minLength]\n * @returns {asserts value is any[]}\n */\n\n/** @type {validateArray} */\nconst validateArray = hideStackFrames((value, name, minLength = 0) => {\n  if (!ArrayIsArray(value)) {\n    throw new ERR_INVALID_ARG_TYPE(name, 'Array', value)\n  }\n  if (value.length < minLength) {\n    const reason = `must be longer than ${minLength}`\n    throw new ERR_INVALID_ARG_VALUE(name, value, reason)\n  }\n})\n\n/**\n * @callback validateStringArray\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is string[]}\n */\n\n/** @type {validateStringArray} */\nfunction validateStringArray(value, name) {\n  validateArray(value, name)\n  for (let i = 0; i < value.length; i++) {\n    validateString(value[i], `${name}[${i}]`)\n  }\n}\n\n/**\n * @callback validateBooleanArray\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is boolean[]}\n */\n\n/** @type {validateBooleanArray} */\nfunction validateBooleanArray(value, name) {\n  validateArray(value, name)\n  for (let i = 0; i < value.length; i++) {\n    validateBoolean(value[i], `${name}[${i}]`)\n  }\n}\n\n/**\n * @param {*} signal\n * @param {string} [name='signal']\n * @returns {asserts signal is keyof signals}\n */\nfunction validateSignalName(signal, name = 'signal') {\n  validateString(signal, name)\n  if (signals[signal] === undefined) {\n    if (signals[StringPrototypeToUpperCase(signal)] !== undefined) {\n      throw new ERR_UNKNOWN_SIGNAL(signal + ' (signals must use all capital letters)')\n    }\n    throw new ERR_UNKNOWN_SIGNAL(signal)\n  }\n}\n\n/**\n * @callback validateBuffer\n * @param {*} buffer\n * @param {string} [name='buffer']\n * @returns {asserts buffer is ArrayBufferView}\n */\n\n/** @type {validateBuffer} */\nconst validateBuffer = hideStackFrames((buffer, name = 'buffer') => {\n  if (!isArrayBufferView(buffer)) {\n    throw new ERR_INVALID_ARG_TYPE(name, ['Buffer', 'TypedArray', 'DataView'], buffer)\n  }\n})\n\n/**\n * @param {string} data\n * @param {string} encoding\n */\nfunction validateEncoding(data, encoding) {\n  const normalizedEncoding = normalizeEncoding(encoding)\n  const length = data.length\n  if (normalizedEncoding === 'hex' && length % 2 !== 0) {\n    throw new ERR_INVALID_ARG_VALUE('encoding', encoding, `is invalid for data of length ${length}`)\n  }\n}\n\n/**\n * Check that the port number is not NaN when coerced to a number,\n * is an integer and that it falls within the legal range of port numbers.\n * @param {*} port\n * @param {string} [name='Port']\n * @param {boolean} [allowZero=true]\n * @returns {number}\n */\nfunction validatePort(port, name = 'Port', allowZero = true) {\n  if (\n    (typeof port !== 'number' && typeof port !== 'string') ||\n    (typeof port === 'string' && StringPrototypeTrim(port).length === 0) ||\n    +port !== +port >>> 0 ||\n    port > 0xffff ||\n    (port === 0 && !allowZero)\n  ) {\n    throw new ERR_SOCKET_BAD_PORT(name, port, allowZero)\n  }\n  return port | 0\n}\n\n/**\n * @callback validateAbortSignal\n * @param {*} signal\n * @param {string} name\n */\n\n/** @type {validateAbortSignal} */\nconst validateAbortSignal = hideStackFrames((signal, name) => {\n  if (signal !== undefined && (signal === null || typeof signal !== 'object' || !('aborted' in signal))) {\n    throw new ERR_INVALID_ARG_TYPE(name, 'AbortSignal', signal)\n  }\n})\n\n/**\n * @callback validateFunction\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is Function}\n */\n\n/** @type {validateFunction} */\nconst validateFunction = hideStackFrames((value, name) => {\n  if (typeof value !== 'function') throw new ERR_INVALID_ARG_TYPE(name, 'Function', value)\n})\n\n/**\n * @callback validatePlainFunction\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is Function}\n */\n\n/** @type {validatePlainFunction} */\nconst validatePlainFunction = hideStackFrames((value, name) => {\n  if (typeof value !== 'function' || isAsyncFunction(value)) throw new ERR_INVALID_ARG_TYPE(name, 'Function', value)\n})\n\n/**\n * @callback validateUndefined\n * @param {*} value\n * @param {string} name\n * @returns {asserts value is undefined}\n */\n\n/** @type {validateUndefined} */\nconst validateUndefined = hideStackFrames((value, name) => {\n  if (value !== undefined) throw new ERR_INVALID_ARG_TYPE(name, 'undefined', value)\n})\n\n/**\n * @template T\n * @param {T} value\n * @param {string} name\n * @param {T[]} union\n */\nfunction validateUnion(value, name, union) {\n  if (!ArrayPrototypeIncludes(union, value)) {\n    throw new ERR_INVALID_ARG_TYPE(name, `('${ArrayPrototypeJoin(union, '|')}')`, value)\n  }\n}\n\n/*\n  The rules for the Link header field are described here:\n  https://www.rfc-editor.org/rfc/rfc8288.html#section-3\n\n  This regex validates any string surrounded by angle brackets\n  (not necessarily a valid URI reference) followed by zero or more\n  link-params separated by semicolons.\n*/\nconst linkValueRegExp = /^(?:<[^>]*>)(?:\\s*;\\s*[^;\"\\s]+(?:=(\")?[^;\"\\s]*\\1)?)*$/\n\n/**\n * @param {any} value\n * @param {string} name\n */\nfunction validateLinkHeaderFormat(value, name) {\n  if (typeof value === 'undefined' || !RegExpPrototypeExec(linkValueRegExp, value)) {\n    throw new ERR_INVALID_ARG_VALUE(\n      name,\n      value,\n      'must be an array or string of format \"</styles.css>; rel=preload; as=style\"'\n    )\n  }\n}\n\n/**\n * @param {any} hints\n * @return {string}\n */\nfunction validateLinkHeaderValue(hints) {\n  if (typeof hints === 'string') {\n    validateLinkHeaderFormat(hints, 'hints')\n    return hints\n  } else if (ArrayIsArray(hints)) {\n    const hintsLength = hints.length\n    let result = ''\n    if (hintsLength === 0) {\n      return result\n    }\n    for (let i = 0; i < hintsLength; i++) {\n      const link = hints[i]\n      validateLinkHeaderFormat(link, 'hints')\n      result += link\n      if (i !== hintsLength - 1) {\n        result += ', '\n      }\n    }\n    return result\n  }\n  throw new ERR_INVALID_ARG_VALUE(\n    'hints',\n    hints,\n    'must be an array or string of format \"</styles.css>; rel=preload; as=style\"'\n  )\n}\nmodule.exports = {\n  isInt32,\n  isUint32,\n  parseFileMode,\n  validateArray,\n  validateStringArray,\n  validateBooleanArray,\n  validateBoolean,\n  validateBuffer,\n  validateDictionary,\n  validateEncoding,\n  validateFunction,\n  validateInt32,\n  validateInteger,\n  validateNumber,\n  validateObject,\n  validateOneOf,\n  validatePlainFunction,\n  validatePort,\n  validateSignalName,\n  validateString,\n  validateUint32,\n  validateUndefined,\n  validateUnion,\n  validateAbortSignal,\n  validateLinkHeaderValue\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/internal/validators.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/ours/browser.js":
+/*!**********************************************************!*\
+  !*** ./node_modules/readable-stream/lib/ours/browser.js ***!
+  \**********************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst CustomStream = __webpack_require__(/*! ../stream */ \"./node_modules/readable-stream/lib/stream.js\")\nconst promises = __webpack_require__(/*! ../stream/promises */ \"./node_modules/readable-stream/lib/stream/promises.js\")\nconst originalDestroy = CustomStream.Readable.destroy\nmodule.exports = CustomStream.Readable\n\n// Explicit export naming is needed for ESM\nmodule.exports._uint8ArrayToBuffer = CustomStream._uint8ArrayToBuffer\nmodule.exports._isUint8Array = CustomStream._isUint8Array\nmodule.exports.isDisturbed = CustomStream.isDisturbed\nmodule.exports.isErrored = CustomStream.isErrored\nmodule.exports.isReadable = CustomStream.isReadable\nmodule.exports.Readable = CustomStream.Readable\nmodule.exports.Writable = CustomStream.Writable\nmodule.exports.Duplex = CustomStream.Duplex\nmodule.exports.Transform = CustomStream.Transform\nmodule.exports.PassThrough = CustomStream.PassThrough\nmodule.exports.addAbortSignal = CustomStream.addAbortSignal\nmodule.exports.finished = CustomStream.finished\nmodule.exports.destroy = CustomStream.destroy\nmodule.exports.destroy = originalDestroy\nmodule.exports.pipeline = CustomStream.pipeline\nmodule.exports.compose = CustomStream.compose\nObject.defineProperty(CustomStream, 'promises', {\n  configurable: true,\n  enumerable: true,\n  get() {\n    return promises\n  }\n})\nmodule.exports.Stream = CustomStream.Stream\n\n// Allow default importing\nmodule.exports[\"default\"] = module.exports\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/ours/browser.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/ours/errors.js":
+/*!*********************************************************!*\
+  !*** ./node_modules/readable-stream/lib/ours/errors.js ***!
+  \*********************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { format, inspect, AggregateError: CustomAggregateError } = __webpack_require__(/*! ./util */ \"./node_modules/readable-stream/lib/ours/util.js\")\n\n/*\n  This file is a reduced and adapted version of the main lib/internal/errors.js file defined at\n\n  https://github.com/nodejs/node/blob/master/lib/internal/errors.js\n\n  Don't try to replace with the original file and keep it up to date (starting from E(...) definitions)\n  with the upstream file.\n*/\n\nconst AggregateError = globalThis.AggregateError || CustomAggregateError\nconst kIsNodeError = Symbol('kIsNodeError')\nconst kTypes = [\n  'string',\n  'function',\n  'number',\n  'object',\n  // Accept 'Function' and 'Object' as alternative to the lower cased version.\n  'Function',\n  'Object',\n  'boolean',\n  'bigint',\n  'symbol'\n]\nconst classRegExp = /^([A-Z][a-z0-9]*)+$/\nconst nodeInternalPrefix = '__node_internal_'\nconst codes = {}\nfunction assert(value, message) {\n  if (!value) {\n    throw new codes.ERR_INTERNAL_ASSERTION(message)\n  }\n}\n\n// Only use this for integers! Decimal numbers do not work with this function.\nfunction addNumericalSeparator(val) {\n  let res = ''\n  let i = val.length\n  const start = val[0] === '-' ? 1 : 0\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`\n  }\n  return `${val.slice(0, i)}${res}`\n}\nfunction getMessage(key, msg, args) {\n  if (typeof msg === 'function') {\n    assert(\n      msg.length <= args.length,\n      // Default options do not count.\n      `Code: ${key}; The provided arguments length (${args.length}) does not match the required ones (${msg.length}).`\n    )\n    return msg(...args)\n  }\n  const expectedLength = (msg.match(/%[dfijoOs]/g) || []).length\n  assert(\n    expectedLength === args.length,\n    `Code: ${key}; The provided arguments length (${args.length}) does not match the required ones (${expectedLength}).`\n  )\n  if (args.length === 0) {\n    return msg\n  }\n  return format(msg, ...args)\n}\nfunction E(code, message, Base) {\n  if (!Base) {\n    Base = Error\n  }\n  class NodeError extends Base {\n    constructor(...args) {\n      super(getMessage(code, message, args))\n    }\n    toString() {\n      return `${this.name} [${code}]: ${this.message}`\n    }\n  }\n  Object.defineProperties(NodeError.prototype, {\n    name: {\n      value: Base.name,\n      writable: true,\n      enumerable: false,\n      configurable: true\n    },\n    toString: {\n      value() {\n        return `${this.name} [${code}]: ${this.message}`\n      },\n      writable: true,\n      enumerable: false,\n      configurable: true\n    }\n  })\n  NodeError.prototype.code = code\n  NodeError.prototype[kIsNodeError] = true\n  codes[code] = NodeError\n}\nfunction hideStackFrames(fn) {\n  // We rename the functions that will be hidden to cut off the stacktrace\n  // at the outermost one\n  const hidden = nodeInternalPrefix + fn.name\n  Object.defineProperty(fn, 'name', {\n    value: hidden\n  })\n  return fn\n}\nfunction aggregateTwoErrors(innerError, outerError) {\n  if (innerError && outerError && innerError !== outerError) {\n    if (Array.isArray(outerError.errors)) {\n      // If `outerError` is already an `AggregateError`.\n      outerError.errors.push(innerError)\n      return outerError\n    }\n    const err = new AggregateError([outerError, innerError], outerError.message)\n    err.code = outerError.code\n    return err\n  }\n  return innerError || outerError\n}\nclass AbortError extends Error {\n  constructor(message = 'The operation was aborted', options = undefined) {\n    if (options !== undefined && typeof options !== 'object') {\n      throw new codes.ERR_INVALID_ARG_TYPE('options', 'Object', options)\n    }\n    super(message, options)\n    this.code = 'ABORT_ERR'\n    this.name = 'AbortError'\n  }\n}\nE('ERR_ASSERTION', '%s', Error)\nE(\n  'ERR_INVALID_ARG_TYPE',\n  (name, expected, actual) => {\n    assert(typeof name === 'string', \"'name' must be a string\")\n    if (!Array.isArray(expected)) {\n      expected = [expected]\n    }\n    let msg = 'The '\n    if (name.endsWith(' argument')) {\n      // For cases like 'first argument'\n      msg += `${name} `\n    } else {\n      msg += `\"${name}\" ${name.includes('.') ? 'property' : 'argument'} `\n    }\n    msg += 'must be '\n    const types = []\n    const instances = []\n    const other = []\n    for (const value of expected) {\n      assert(typeof value === 'string', 'All expected entries have to be of type string')\n      if (kTypes.includes(value)) {\n        types.push(value.toLowerCase())\n      } else if (classRegExp.test(value)) {\n        instances.push(value)\n      } else {\n        assert(value !== 'object', 'The value \"object\" should be written as \"Object\"')\n        other.push(value)\n      }\n    }\n\n    // Special handle `object` in case other instances are allowed to outline\n    // the differences between each other.\n    if (instances.length > 0) {\n      const pos = types.indexOf('object')\n      if (pos !== -1) {\n        types.splice(types, pos, 1)\n        instances.push('Object')\n      }\n    }\n    if (types.length > 0) {\n      switch (types.length) {\n        case 1:\n          msg += `of type ${types[0]}`\n          break\n        case 2:\n          msg += `one of type ${types[0]} or ${types[1]}`\n          break\n        default: {\n          const last = types.pop()\n          msg += `one of type ${types.join(', ')}, or ${last}`\n        }\n      }\n      if (instances.length > 0 || other.length > 0) {\n        msg += ' or '\n      }\n    }\n    if (instances.length > 0) {\n      switch (instances.length) {\n        case 1:\n          msg += `an instance of ${instances[0]}`\n          break\n        case 2:\n          msg += `an instance of ${instances[0]} or ${instances[1]}`\n          break\n        default: {\n          const last = instances.pop()\n          msg += `an instance of ${instances.join(', ')}, or ${last}`\n        }\n      }\n      if (other.length > 0) {\n        msg += ' or '\n      }\n    }\n    switch (other.length) {\n      case 0:\n        break\n      case 1:\n        if (other[0].toLowerCase() !== other[0]) {\n          msg += 'an '\n        }\n        msg += `${other[0]}`\n        break\n      case 2:\n        msg += `one of ${other[0]} or ${other[1]}`\n        break\n      default: {\n        const last = other.pop()\n        msg += `one of ${other.join(', ')}, or ${last}`\n      }\n    }\n    if (actual == null) {\n      msg += `. Received ${actual}`\n    } else if (typeof actual === 'function' && actual.name) {\n      msg += `. Received function ${actual.name}`\n    } else if (typeof actual === 'object') {\n      var _actual$constructor\n      if (\n        (_actual$constructor = actual.constructor) !== null &&\n        _actual$constructor !== undefined &&\n        _actual$constructor.name\n      ) {\n        msg += `. Received an instance of ${actual.constructor.name}`\n      } else {\n        const inspected = inspect(actual, {\n          depth: -1\n        })\n        msg += `. Received ${inspected}`\n      }\n    } else {\n      let inspected = inspect(actual, {\n        colors: false\n      })\n      if (inspected.length > 25) {\n        inspected = `${inspected.slice(0, 25)}...`\n      }\n      msg += `. Received type ${typeof actual} (${inspected})`\n    }\n    return msg\n  },\n  TypeError\n)\nE(\n  'ERR_INVALID_ARG_VALUE',\n  (name, value, reason = 'is invalid') => {\n    let inspected = inspect(value)\n    if (inspected.length > 128) {\n      inspected = inspected.slice(0, 128) + '...'\n    }\n    const type = name.includes('.') ? 'property' : 'argument'\n    return `The ${type} '${name}' ${reason}. Received ${inspected}`\n  },\n  TypeError\n)\nE(\n  'ERR_INVALID_RETURN_VALUE',\n  (input, name, value) => {\n    var _value$constructor\n    const type =\n      value !== null &&\n      value !== undefined &&\n      (_value$constructor = value.constructor) !== null &&\n      _value$constructor !== undefined &&\n      _value$constructor.name\n        ? `instance of ${value.constructor.name}`\n        : `type ${typeof value}`\n    return `Expected ${input} to be returned from the \"${name}\"` + ` function but got ${type}.`\n  },\n  TypeError\n)\nE(\n  'ERR_MISSING_ARGS',\n  (...args) => {\n    assert(args.length > 0, 'At least one arg needs to be specified')\n    let msg\n    const len = args.length\n    args = (Array.isArray(args) ? args : [args]).map((a) => `\"${a}\"`).join(' or ')\n    switch (len) {\n      case 1:\n        msg += `The ${args[0]} argument`\n        break\n      case 2:\n        msg += `The ${args[0]} and ${args[1]} arguments`\n        break\n      default:\n        {\n          const last = args.pop()\n          msg += `The ${args.join(', ')}, and ${last} arguments`\n        }\n        break\n    }\n    return `${msg} must be specified`\n  },\n  TypeError\n)\nE(\n  'ERR_OUT_OF_RANGE',\n  (str, range, input) => {\n    assert(range, 'Missing \"range\" argument')\n    let received\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input))\n    } else if (typeof input === 'bigint') {\n      received = String(input)\n      if (input > 2n ** 32n || input < -(2n ** 32n)) {\n        received = addNumericalSeparator(received)\n      }\n      received += 'n'\n    } else {\n      received = inspect(input)\n    }\n    return `The value of \"${str}\" is out of range. It must be ${range}. Received ${received}`\n  },\n  RangeError\n)\nE('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times', Error)\nE('ERR_METHOD_NOT_IMPLEMENTED', 'The %s method is not implemented', Error)\nE('ERR_STREAM_ALREADY_FINISHED', 'Cannot call %s after a stream was finished', Error)\nE('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable', Error)\nE('ERR_STREAM_DESTROYED', 'Cannot call %s after a stream was destroyed', Error)\nE('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError)\nE('ERR_STREAM_PREMATURE_CLOSE', 'Premature close', Error)\nE('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF', Error)\nE('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event', Error)\nE('ERR_STREAM_WRITE_AFTER_END', 'write after end', Error)\nE('ERR_UNKNOWN_ENCODING', 'Unknown encoding: %s', TypeError)\nmodule.exports = {\n  AbortError,\n  aggregateTwoErrors: hideStackFrames(aggregateTwoErrors),\n  hideStackFrames,\n  codes\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/ours/errors.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/ours/primordials.js":
+/*!**************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/ours/primordials.js ***!
+  \**************************************************************/
+/***/ ((module) => {
+
+"use strict";
+eval("\n\n/*\n  This file is a reduced and adapted version of the main lib/internal/per_context/primordials.js file defined at\n\n  https://github.com/nodejs/node/blob/master/lib/internal/per_context/primordials.js\n\n  Don't try to replace with the original file and keep it up to date with the upstream file.\n*/\nmodule.exports = {\n  ArrayIsArray(self) {\n    return Array.isArray(self)\n  },\n  ArrayPrototypeIncludes(self, el) {\n    return self.includes(el)\n  },\n  ArrayPrototypeIndexOf(self, el) {\n    return self.indexOf(el)\n  },\n  ArrayPrototypeJoin(self, sep) {\n    return self.join(sep)\n  },\n  ArrayPrototypeMap(self, fn) {\n    return self.map(fn)\n  },\n  ArrayPrototypePop(self, el) {\n    return self.pop(el)\n  },\n  ArrayPrototypePush(self, el) {\n    return self.push(el)\n  },\n  ArrayPrototypeSlice(self, start, end) {\n    return self.slice(start, end)\n  },\n  Error,\n  FunctionPrototypeCall(fn, thisArgs, ...args) {\n    return fn.call(thisArgs, ...args)\n  },\n  FunctionPrototypeSymbolHasInstance(self, instance) {\n    return Function.prototype[Symbol.hasInstance].call(self, instance)\n  },\n  MathFloor: Math.floor,\n  Number,\n  NumberIsInteger: Number.isInteger,\n  NumberIsNaN: Number.isNaN,\n  NumberMAX_SAFE_INTEGER: Number.MAX_SAFE_INTEGER,\n  NumberMIN_SAFE_INTEGER: Number.MIN_SAFE_INTEGER,\n  NumberParseInt: Number.parseInt,\n  ObjectDefineProperties(self, props) {\n    return Object.defineProperties(self, props)\n  },\n  ObjectDefineProperty(self, name, prop) {\n    return Object.defineProperty(self, name, prop)\n  },\n  ObjectGetOwnPropertyDescriptor(self, name) {\n    return Object.getOwnPropertyDescriptor(self, name)\n  },\n  ObjectKeys(obj) {\n    return Object.keys(obj)\n  },\n  ObjectSetPrototypeOf(target, proto) {\n    return Object.setPrototypeOf(target, proto)\n  },\n  Promise,\n  PromisePrototypeCatch(self, fn) {\n    return self.catch(fn)\n  },\n  PromisePrototypeThen(self, thenFn, catchFn) {\n    return self.then(thenFn, catchFn)\n  },\n  PromiseReject(err) {\n    return Promise.reject(err)\n  },\n  ReflectApply: Reflect.apply,\n  RegExpPrototypeTest(self, value) {\n    return self.test(value)\n  },\n  SafeSet: Set,\n  String,\n  StringPrototypeSlice(self, start, end) {\n    return self.slice(start, end)\n  },\n  StringPrototypeToLowerCase(self) {\n    return self.toLowerCase()\n  },\n  StringPrototypeToUpperCase(self) {\n    return self.toUpperCase()\n  },\n  StringPrototypeTrim(self) {\n    return self.trim()\n  },\n  Symbol,\n  SymbolFor: Symbol.for,\n  SymbolAsyncIterator: Symbol.asyncIterator,\n  SymbolHasInstance: Symbol.hasInstance,\n  SymbolIterator: Symbol.iterator,\n  TypedArrayPrototypeSet(self, buf, len) {\n    return self.set(buf, len)\n  },\n  Uint8Array\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/ours/primordials.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/ours/util.js":
+/*!*******************************************************!*\
+  !*** ./node_modules/readable-stream/lib/ours/util.js ***!
+  \*******************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst bufferModule = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nconst AsyncFunction = Object.getPrototypeOf(async function () {}).constructor\nconst Blob = globalThis.Blob || bufferModule.Blob\n/* eslint-disable indent */\nconst isBlob =\n  typeof Blob !== 'undefined'\n    ? function isBlob(b) {\n        // eslint-disable-next-line indent\n        return b instanceof Blob\n      }\n    : function isBlob(b) {\n        return false\n      }\n/* eslint-enable indent */\n\n// This is a simplified version of AggregateError\nclass AggregateError extends Error {\n  constructor(errors) {\n    if (!Array.isArray(errors)) {\n      throw new TypeError(`Expected input to be an Array, got ${typeof errors}`)\n    }\n    let message = ''\n    for (let i = 0; i < errors.length; i++) {\n      message += `    ${errors[i].stack}\\n`\n    }\n    super(message)\n    this.name = 'AggregateError'\n    this.errors = errors\n  }\n}\nmodule.exports = {\n  AggregateError,\n  kEmptyObject: Object.freeze({}),\n  once(callback) {\n    let called = false\n    return function (...args) {\n      if (called) {\n        return\n      }\n      called = true\n      callback.apply(this, args)\n    }\n  },\n  createDeferredPromise: function () {\n    let resolve\n    let reject\n\n    // eslint-disable-next-line promise/param-names\n    const promise = new Promise((res, rej) => {\n      resolve = res\n      reject = rej\n    })\n    return {\n      promise,\n      resolve,\n      reject\n    }\n  },\n  promisify(fn) {\n    return new Promise((resolve, reject) => {\n      fn((err, ...args) => {\n        if (err) {\n          return reject(err)\n        }\n        return resolve(...args)\n      })\n    })\n  },\n  debuglog() {\n    return function () {}\n  },\n  format(format, ...args) {\n    // Simplified version of https://nodejs.org/api/util.html#utilformatformat-args\n    return format.replace(/%([sdifj])/g, function (...[_unused, type]) {\n      const replacement = args.shift()\n      if (type === 'f') {\n        return replacement.toFixed(6)\n      } else if (type === 'j') {\n        return JSON.stringify(replacement)\n      } else if (type === 's' && typeof replacement === 'object') {\n        const ctor = replacement.constructor !== Object ? replacement.constructor.name : ''\n        return `${ctor} {}`.trim()\n      } else {\n        return replacement.toString()\n      }\n    })\n  },\n  inspect(value) {\n    // Vastly simplified version of https://nodejs.org/api/util.html#utilinspectobject-options\n    switch (typeof value) {\n      case 'string':\n        if (value.includes(\"'\")) {\n          if (!value.includes('\"')) {\n            return `\"${value}\"`\n          } else if (!value.includes('`') && !value.includes('${')) {\n            return `\\`${value}\\``\n          }\n        }\n        return `'${value}'`\n      case 'number':\n        if (isNaN(value)) {\n          return 'NaN'\n        } else if (Object.is(value, -0)) {\n          return String(value)\n        }\n        return value\n      case 'bigint':\n        return `${String(value)}n`\n      case 'boolean':\n      case 'undefined':\n        return String(value)\n      case 'object':\n        return '{}'\n    }\n  },\n  types: {\n    isAsyncFunction(fn) {\n      return fn instanceof AsyncFunction\n    },\n    isArrayBufferView(arr) {\n      return ArrayBuffer.isView(arr)\n    }\n  },\n  isBlob\n}\nmodule.exports.promisify.custom = Symbol.for('nodejs.util.promisify.custom')\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/ours/util.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/stream.js":
+/*!****************************************************!*\
+  !*** ./node_modules/readable-stream/lib/stream.js ***!
+  \****************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+eval("/* replacement start */\n\nconst { Buffer } = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\n\n/* replacement end */\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n;('use strict')\nconst { ObjectDefineProperty, ObjectKeys, ReflectApply } = __webpack_require__(/*! ./ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst {\n  promisify: { custom: customPromisify }\n} = __webpack_require__(/*! ./ours/util */ \"./node_modules/readable-stream/lib/ours/util.js\")\nconst { streamReturningOperators, promiseReturningOperators } = __webpack_require__(/*! ./internal/streams/operators */ \"./node_modules/readable-stream/lib/internal/streams/operators.js\")\nconst {\n  codes: { ERR_ILLEGAL_CONSTRUCTOR }\n} = __webpack_require__(/*! ./ours/errors */ \"./node_modules/readable-stream/lib/ours/errors.js\")\nconst compose = __webpack_require__(/*! ./internal/streams/compose */ \"./node_modules/readable-stream/lib/internal/streams/compose.js\")\nconst { pipeline } = __webpack_require__(/*! ./internal/streams/pipeline */ \"./node_modules/readable-stream/lib/internal/streams/pipeline.js\")\nconst { destroyer } = __webpack_require__(/*! ./internal/streams/destroy */ \"./node_modules/readable-stream/lib/internal/streams/destroy.js\")\nconst eos = __webpack_require__(/*! ./internal/streams/end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\nconst internalBuffer = {}\nconst promises = __webpack_require__(/*! ./stream/promises */ \"./node_modules/readable-stream/lib/stream/promises.js\")\nconst utils = __webpack_require__(/*! ./internal/streams/utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst Stream = (module.exports = __webpack_require__(/*! ./internal/streams/legacy */ \"./node_modules/readable-stream/lib/internal/streams/legacy.js\").Stream)\nStream.isDisturbed = utils.isDisturbed\nStream.isErrored = utils.isErrored\nStream.isReadable = utils.isReadable\nStream.Readable = __webpack_require__(/*! ./internal/streams/readable */ \"./node_modules/readable-stream/lib/internal/streams/readable.js\")\nfor (const key of ObjectKeys(streamReturningOperators)) {\n  const op = streamReturningOperators[key]\n  function fn(...args) {\n    if (new.target) {\n      throw ERR_ILLEGAL_CONSTRUCTOR()\n    }\n    return Stream.Readable.from(ReflectApply(op, this, args))\n  }\n  ObjectDefineProperty(fn, 'name', {\n    __proto__: null,\n    value: op.name\n  })\n  ObjectDefineProperty(fn, 'length', {\n    __proto__: null,\n    value: op.length\n  })\n  ObjectDefineProperty(Stream.Readable.prototype, key, {\n    __proto__: null,\n    value: fn,\n    enumerable: false,\n    configurable: true,\n    writable: true\n  })\n}\nfor (const key of ObjectKeys(promiseReturningOperators)) {\n  const op = promiseReturningOperators[key]\n  function fn(...args) {\n    if (new.target) {\n      throw ERR_ILLEGAL_CONSTRUCTOR()\n    }\n    return ReflectApply(op, this, args)\n  }\n  ObjectDefineProperty(fn, 'name', {\n    __proto__: null,\n    value: op.name\n  })\n  ObjectDefineProperty(fn, 'length', {\n    __proto__: null,\n    value: op.length\n  })\n  ObjectDefineProperty(Stream.Readable.prototype, key, {\n    __proto__: null,\n    value: fn,\n    enumerable: false,\n    configurable: true,\n    writable: true\n  })\n}\nStream.Writable = __webpack_require__(/*! ./internal/streams/writable */ \"./node_modules/readable-stream/lib/internal/streams/writable.js\")\nStream.Duplex = __webpack_require__(/*! ./internal/streams/duplex */ \"./node_modules/readable-stream/lib/internal/streams/duplex.js\")\nStream.Transform = __webpack_require__(/*! ./internal/streams/transform */ \"./node_modules/readable-stream/lib/internal/streams/transform.js\")\nStream.PassThrough = __webpack_require__(/*! ./internal/streams/passthrough */ \"./node_modules/readable-stream/lib/internal/streams/passthrough.js\")\nStream.pipeline = pipeline\nconst { addAbortSignal } = __webpack_require__(/*! ./internal/streams/add-abort-signal */ \"./node_modules/readable-stream/lib/internal/streams/add-abort-signal.js\")\nStream.addAbortSignal = addAbortSignal\nStream.finished = eos\nStream.destroy = destroyer\nStream.compose = compose\nObjectDefineProperty(Stream, 'promises', {\n  __proto__: null,\n  configurable: true,\n  enumerable: true,\n  get() {\n    return promises\n  }\n})\nObjectDefineProperty(pipeline, customPromisify, {\n  __proto__: null,\n  enumerable: true,\n  get() {\n    return promises.pipeline\n  }\n})\nObjectDefineProperty(eos, customPromisify, {\n  __proto__: null,\n  enumerable: true,\n  get() {\n    return promises.finished\n  }\n})\n\n// Backwards-compat with node 0.4.x\nStream.Stream = Stream\nStream._isUint8Array = function isUint8Array(value) {\n  return value instanceof Uint8Array\n}\nStream._uint8ArrayToBuffer = function _uint8ArrayToBuffer(chunk) {\n  return Buffer.from(chunk.buffer, chunk.byteOffset, chunk.byteLength)\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/stream.js?");
+
+/***/ }),
+
+/***/ "./node_modules/readable-stream/lib/stream/promises.js":
+/*!*************************************************************!*\
+  !*** ./node_modules/readable-stream/lib/stream/promises.js ***!
+  \*************************************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+eval("\n\nconst { ArrayPrototypePop, Promise } = __webpack_require__(/*! ../ours/primordials */ \"./node_modules/readable-stream/lib/ours/primordials.js\")\nconst { isIterable, isNodeStream, isWebStream } = __webpack_require__(/*! ../internal/streams/utils */ \"./node_modules/readable-stream/lib/internal/streams/utils.js\")\nconst { pipelineImpl: pl } = __webpack_require__(/*! ../internal/streams/pipeline */ \"./node_modules/readable-stream/lib/internal/streams/pipeline.js\")\nconst { finished } = __webpack_require__(/*! ../internal/streams/end-of-stream */ \"./node_modules/readable-stream/lib/internal/streams/end-of-stream.js\")\n__webpack_require__(/*! ../../lib/stream.js */ \"./node_modules/readable-stream/lib/stream.js\")\nfunction pipeline(...streams) {\n  return new Promise((resolve, reject) => {\n    let signal\n    let end\n    const lastArg = streams[streams.length - 1]\n    if (\n      lastArg &&\n      typeof lastArg === 'object' &&\n      !isNodeStream(lastArg) &&\n      !isIterable(lastArg) &&\n      !isWebStream(lastArg)\n    ) {\n      const options = ArrayPrototypePop(streams)\n      signal = options.signal\n      end = options.end\n    }\n    pl(\n      streams,\n      (err, value) => {\n        if (err) {\n          reject(err)\n        } else {\n          resolve(value)\n        }\n      },\n      {\n        signal,\n        end\n      }\n    )\n  })\n}\nmodule.exports = {\n  finished,\n  pipeline\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/readable-stream/lib/stream/promises.js?");
+
+/***/ }),
+
+/***/ "./node_modules/safe-buffer/index.js":
+/*!*******************************************!*\
+  !*** ./node_modules/safe-buffer/index.js ***!
+  \*******************************************/
+/***/ ((module, exports, __webpack_require__) => {
+
+eval("/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = __webpack_require__(/*! buffer */ \"./node_modules/buffer/index.js\")\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n  for (var key in src) {\n    dst[key] = src[key]\n  }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n  module.exports = buffer\n} else {\n  // Copy properties from require('buffer')\n  copyProps(buffer, exports)\n  exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n  if (typeof arg === 'number') {\n    throw new TypeError('Argument must not be a number')\n  }\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  var buf = Buffer(size)\n  if (fill !== undefined) {\n    if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n  } else {\n    buf.fill(0)\n  }\n  return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return buffer.SlowBuffer(size)\n}\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/safe-buffer/index.js?");
+
+/***/ }),
+
+/***/ "./node_modules/string_decoder/lib/string_decoder.js":
+/*!***********************************************************!*\
+  !*** ./node_modules/string_decoder/lib/string_decoder.js ***!
+  \***********************************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\n\n/*<replacement>*/\n\nvar Buffer = (__webpack_require__(/*! safe-buffer */ \"./node_modules/safe-buffer/index.js\").Buffer);\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n  encoding = '' + encoding;\n  switch (encoding && encoding.toLowerCase()) {\n    case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n      return true;\n    default:\n      return false;\n  }\n};\n\nfunction _normalizeEncoding(enc) {\n  if (!enc) return 'utf8';\n  var retried;\n  while (true) {\n    switch (enc) {\n      case 'utf8':\n      case 'utf-8':\n        return 'utf8';\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return 'utf16le';\n      case 'latin1':\n      case 'binary':\n        return 'latin1';\n      case 'base64':\n      case 'ascii':\n      case 'hex':\n        return enc;\n      default:\n        if (retried) return; // undefined\n        enc = ('' + enc).toLowerCase();\n        retried = true;\n    }\n  }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n  var nenc = _normalizeEncoding(enc);\n  if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n  return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n  this.encoding = normalizeEncoding(encoding);\n  var nb;\n  switch (this.encoding) {\n    case 'utf16le':\n      this.text = utf16Text;\n      this.end = utf16End;\n      nb = 4;\n      break;\n    case 'utf8':\n      this.fillLast = utf8FillLast;\n      nb = 4;\n      break;\n    case 'base64':\n      this.text = base64Text;\n      this.end = base64End;\n      nb = 3;\n      break;\n    default:\n      this.write = simpleWrite;\n      this.end = simpleEnd;\n      return;\n  }\n  this.lastNeed = 0;\n  this.lastTotal = 0;\n  this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n  if (buf.length === 0) return '';\n  var r;\n  var i;\n  if (this.lastNeed) {\n    r = this.fillLast(buf);\n    if (r === undefined) return '';\n    i = this.lastNeed;\n    this.lastNeed = 0;\n  } else {\n    i = 0;\n  }\n  if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n  return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n  if (this.lastNeed <= buf.length) {\n    buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n    return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n  }\n  buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n  this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n  if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n  return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n  var j = buf.length - 1;\n  if (j < i) return 0;\n  var nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) self.lastNeed = nb - 1;\n    return nb;\n  }\n  if (--j < i || nb === -2) return 0;\n  nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) self.lastNeed = nb - 2;\n    return nb;\n  }\n  if (--j < i || nb === -2) return 0;\n  nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) {\n      if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n    }\n    return nb;\n  }\n  return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n  if ((buf[0] & 0xC0) !== 0x80) {\n    self.lastNeed = 0;\n    return '\\ufffd';\n  }\n  if (self.lastNeed > 1 && buf.length > 1) {\n    if ((buf[1] & 0xC0) !== 0x80) {\n      self.lastNeed = 1;\n      return '\\ufffd';\n    }\n    if (self.lastNeed > 2 && buf.length > 2) {\n      if ((buf[2] & 0xC0) !== 0x80) {\n        self.lastNeed = 2;\n        return '\\ufffd';\n      }\n    }\n  }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n  var p = this.lastTotal - this.lastNeed;\n  var r = utf8CheckExtraBytes(this, buf, p);\n  if (r !== undefined) return r;\n  if (this.lastNeed <= buf.length) {\n    buf.copy(this.lastChar, p, 0, this.lastNeed);\n    return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n  }\n  buf.copy(this.lastChar, p, 0, buf.length);\n  this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n  var total = utf8CheckIncomplete(this, buf, i);\n  if (!this.lastNeed) return buf.toString('utf8', i);\n  this.lastTotal = total;\n  var end = buf.length - (total - this.lastNeed);\n  buf.copy(this.lastChar, 0, end);\n  return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) return r + '\\ufffd';\n  return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n  if ((buf.length - i) % 2 === 0) {\n    var r = buf.toString('utf16le', i);\n    if (r) {\n      var c = r.charCodeAt(r.length - 1);\n      if (c >= 0xD800 && c <= 0xDBFF) {\n        this.lastNeed = 2;\n        this.lastTotal = 4;\n        this.lastChar[0] = buf[buf.length - 2];\n        this.lastChar[1] = buf[buf.length - 1];\n        return r.slice(0, -1);\n      }\n    }\n    return r;\n  }\n  this.lastNeed = 1;\n  this.lastTotal = 2;\n  this.lastChar[0] = buf[buf.length - 1];\n  return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) {\n    var end = this.lastTotal - this.lastNeed;\n    return r + this.lastChar.toString('utf16le', 0, end);\n  }\n  return r;\n}\n\nfunction base64Text(buf, i) {\n  var n = (buf.length - i) % 3;\n  if (n === 0) return buf.toString('base64', i);\n  this.lastNeed = 3 - n;\n  this.lastTotal = 3;\n  if (n === 1) {\n    this.lastChar[0] = buf[buf.length - 1];\n  } else {\n    this.lastChar[0] = buf[buf.length - 2];\n    this.lastChar[1] = buf[buf.length - 1];\n  }\n  return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n  return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n  return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n  return buf && buf.length ? this.write(buf) : '';\n}\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/string_decoder/lib/string_decoder.js?");
+
+/***/ }),
+
+/***/ "./src/index.ts":
+/*!**********************!*\
+  !*** ./src/index.ts ***!
+  \**********************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\ntslib_1.__exportStar(__webpack_require__(/*! ./ontologies */ \"./src/ontologies/index.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./rdf */ \"./src/rdf/index.ts\"), exports);\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/index.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/index.ts":
+/*!*********************************!*\
+  !*** ./src/ontologies/index.ts ***!
+  \*********************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports._xsd = exports.xsd = exports._XSD = exports.XSD = exports._skos = exports.skos = exports._SKOS = exports.SKOS = exports._skos_xl = exports.skos_xl = exports._SKOS_XL = exports.SKOS_XL = exports._sh = exports.sh = exports._SH = exports.SH = exports._rdfs = exports.rdfs = exports._RDFS = exports.RDFS = exports._rdfa = exports.rdfa = exports._RDFA = exports.RDFA = exports._rdf = exports.rdf = exports._RDF = exports.RDF = exports._owl = exports.owl = exports._OWL = exports.OWL = void 0;\nvar owl_1 = __webpack_require__(/*! ./owl */ \"./src/ontologies/owl.ts\");\nObject.defineProperty(exports, \"OWL\", ({ enumerable: true, get: function () { return owl_1.OWL; } }));\nObject.defineProperty(exports, \"_OWL\", ({ enumerable: true, get: function () { return owl_1._OWL; } }));\nObject.defineProperty(exports, \"owl\", ({ enumerable: true, get: function () { return owl_1.owl; } }));\nObject.defineProperty(exports, \"_owl\", ({ enumerable: true, get: function () { return owl_1._owl; } }));\nvar rdf_1 = __webpack_require__(/*! ./rdf */ \"./src/ontologies/rdf.ts\");\nObject.defineProperty(exports, \"RDF\", ({ enumerable: true, get: function () { return rdf_1.RDF; } }));\nObject.defineProperty(exports, \"_RDF\", ({ enumerable: true, get: function () { return rdf_1._RDF; } }));\nObject.defineProperty(exports, \"rdf\", ({ enumerable: true, get: function () { return rdf_1.rdf; } }));\nObject.defineProperty(exports, \"_rdf\", ({ enumerable: true, get: function () { return rdf_1._rdf; } }));\nvar rdfa_1 = __webpack_require__(/*! ./rdfa */ \"./src/ontologies/rdfa.ts\");\nObject.defineProperty(exports, \"RDFA\", ({ enumerable: true, get: function () { return rdfa_1.RDFA; } }));\nObject.defineProperty(exports, \"_RDFA\", ({ enumerable: true, get: function () { return rdfa_1._RDFA; } }));\nObject.defineProperty(exports, \"rdfa\", ({ enumerable: true, get: function () { return rdfa_1.rdfa; } }));\nObject.defineProperty(exports, \"_rdfa\", ({ enumerable: true, get: function () { return rdfa_1._rdfa; } }));\nvar rdfs_1 = __webpack_require__(/*! ./rdfs */ \"./src/ontologies/rdfs.ts\");\nObject.defineProperty(exports, \"RDFS\", ({ enumerable: true, get: function () { return rdfs_1.RDFS; } }));\nObject.defineProperty(exports, \"_RDFS\", ({ enumerable: true, get: function () { return rdfs_1._RDFS; } }));\nObject.defineProperty(exports, \"rdfs\", ({ enumerable: true, get: function () { return rdfs_1.rdfs; } }));\nObject.defineProperty(exports, \"_rdfs\", ({ enumerable: true, get: function () { return rdfs_1._rdfs; } }));\nvar sh_1 = __webpack_require__(/*! ./sh */ \"./src/ontologies/sh.ts\");\nObject.defineProperty(exports, \"SH\", ({ enumerable: true, get: function () { return sh_1.SH; } }));\nObject.defineProperty(exports, \"_SH\", ({ enumerable: true, get: function () { return sh_1._SH; } }));\nObject.defineProperty(exports, \"sh\", ({ enumerable: true, get: function () { return sh_1.sh; } }));\nObject.defineProperty(exports, \"_sh\", ({ enumerable: true, get: function () { return sh_1._sh; } }));\nvar skos_xl_1 = __webpack_require__(/*! ./skos-xl */ \"./src/ontologies/skos-xl.ts\");\nObject.defineProperty(exports, \"SKOS_XL\", ({ enumerable: true, get: function () { return skos_xl_1.SKOS_XL; } }));\nObject.defineProperty(exports, \"_SKOS_XL\", ({ enumerable: true, get: function () { return skos_xl_1._SKOS_XL; } }));\nObject.defineProperty(exports, \"skos_xl\", ({ enumerable: true, get: function () { return skos_xl_1.skos_xl; } }));\nObject.defineProperty(exports, \"_skos_xl\", ({ enumerable: true, get: function () { return skos_xl_1._skos_xl; } }));\nvar skos_1 = __webpack_require__(/*! ./skos */ \"./src/ontologies/skos.ts\");\nObject.defineProperty(exports, \"SKOS\", ({ enumerable: true, get: function () { return skos_1.SKOS; } }));\nObject.defineProperty(exports, \"_SKOS\", ({ enumerable: true, get: function () { return skos_1._SKOS; } }));\nObject.defineProperty(exports, \"skos\", ({ enumerable: true, get: function () { return skos_1.skos; } }));\nObject.defineProperty(exports, \"_skos\", ({ enumerable: true, get: function () { return skos_1._skos; } }));\nvar xsd_1 = __webpack_require__(/*! ./xsd */ \"./src/ontologies/xsd.ts\");\nObject.defineProperty(exports, \"XSD\", ({ enumerable: true, get: function () { return xsd_1.XSD; } }));\nObject.defineProperty(exports, \"_XSD\", ({ enumerable: true, get: function () { return xsd_1._XSD; } }));\nObject.defineProperty(exports, \"xsd\", ({ enumerable: true, get: function () { return xsd_1.xsd; } }));\nObject.defineProperty(exports, \"_xsd\", ({ enumerable: true, get: function () { return xsd_1._xsd; } }));\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/index.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/owl.ts":
+/*!*******************************!*\
+  !*** ./src/ontologies/owl.ts ***!
+  \*******************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.owl = exports._owl = exports.OWL = exports._OWL = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the OWL vocabulary. */\nexports._OWL = 'http://www.w3.org/2002/07/owl#';\nexports.OWL = {\n    /** The class of collections of pairwise different individuals. */\n    'AllDifferent': 'http://www.w3.org/2002/07/owl#AllDifferent',\n    /** The class of collections of pairwise disjoint classes. */\n    'AllDisjointClasses': 'http://www.w3.org/2002/07/owl#AllDisjointClasses',\n    /** The class of collections of pairwise disjoint properties. */\n    'AllDisjointProperties': 'http://www.w3.org/2002/07/owl#AllDisjointProperties',\n    /** The class of annotated annotations for which the RDF serialization consists of an annotated subject, predicate and object. */\n    'Annotation': 'http://www.w3.org/2002/07/owl#Annotation',\n    /** The class of annotation properties. */\n    'AnnotationProperty': 'http://www.w3.org/2002/07/owl#AnnotationProperty',\n    /** The class of asymmetric properties. */\n    'AsymmetricProperty': 'http://www.w3.org/2002/07/owl#AsymmetricProperty',\n    /** The class of annotated axioms for which the RDF serialization consists of an annotated subject, predicate and object. */\n    'Axiom': 'http://www.w3.org/2002/07/owl#Axiom',\n    /** The class of OWL classes. */\n    'Class': 'http://www.w3.org/2002/07/owl#Class',\n    /** The class of OWL data ranges, which are special kinds of datatypes. Note: The use of the IRI owl:DataRange has been deprecated as of OWL 2. The IRI rdfs:Datatype SHOULD be used instead. */\n    'DataRange': 'http://www.w3.org/2002/07/owl#DataRange',\n    /** The class of data properties. */\n    'DatatypeProperty': 'http://www.w3.org/2002/07/owl#DatatypeProperty',\n    /** The class of deprecated classes. */\n    'DeprecatedClass': 'http://www.w3.org/2002/07/owl#DeprecatedClass',\n    /** The class of deprecated properties. */\n    'DeprecatedProperty': 'http://www.w3.org/2002/07/owl#DeprecatedProperty',\n    /** The class of functional properties. */\n    'FunctionalProperty': 'http://www.w3.org/2002/07/owl#FunctionalProperty',\n    /** The class of inverse-functional properties. */\n    'InverseFunctionalProperty': 'http://www.w3.org/2002/07/owl#InverseFunctionalProperty',\n    /** The class of irreflexive properties. */\n    'IrreflexiveProperty': 'http://www.w3.org/2002/07/owl#IrreflexiveProperty',\n    /** The class of named individuals. */\n    'NamedIndividual': 'http://www.w3.org/2002/07/owl#NamedIndividual',\n    /** The class of negative property assertions. */\n    'NegativePropertyAssertion': 'http://www.w3.org/2002/07/owl#NegativePropertyAssertion',\n    /** This is the empty class. */\n    'Nothing': 'http://www.w3.org/2002/07/owl#Nothing',\n    /** The class of object properties. */\n    'ObjectProperty': 'http://www.w3.org/2002/07/owl#ObjectProperty',\n    /** The class of ontologies. */\n    'Ontology': 'http://www.w3.org/2002/07/owl#Ontology',\n    /** The class of ontology properties. */\n    'OntologyProperty': 'http://www.w3.org/2002/07/owl#OntologyProperty',\n    /** The class of reflexive properties. */\n    'ReflexiveProperty': 'http://www.w3.org/2002/07/owl#ReflexiveProperty',\n    /** The class of property restrictions. */\n    'Restriction': 'http://www.w3.org/2002/07/owl#Restriction',\n    /** The class of symmetric properties. */\n    'SymmetricProperty': 'http://www.w3.org/2002/07/owl#SymmetricProperty',\n    /** The class of OWL individuals. */\n    'Thing': 'http://www.w3.org/2002/07/owl#Thing',\n    /** The class of transitive properties. */\n    'TransitiveProperty': 'http://www.w3.org/2002/07/owl#TransitiveProperty',\n    /** The property that determines the class that a universal property restriction refers to. */\n    'allValuesFrom': 'http://www.w3.org/2002/07/owl#allValuesFrom',\n    /** The property that determines the predicate of an annotated axiom or annotated annotation. */\n    'annotatedProperty': 'http://www.w3.org/2002/07/owl#annotatedProperty',\n    /** The property that determines the subject of an annotated axiom or annotated annotation. */\n    'annotatedSource': 'http://www.w3.org/2002/07/owl#annotatedSource',\n    /** The property that determines the object of an annotated axiom or annotated annotation. */\n    'annotatedTarget': 'http://www.w3.org/2002/07/owl#annotatedTarget',\n    /** The property that determines the predicate of a negative property assertion. */\n    'assertionProperty': 'http://www.w3.org/2002/07/owl#assertionProperty',\n    /** The annotation property that indicates that a given ontology is backward compatible with another ontology. */\n    'backwardCompatibleWith': 'http://www.w3.org/2002/07/owl#backwardCompatibleWith',\n    /** The data property that does not relate any individual to any data value. */\n    'bottomDataProperty': 'http://www.w3.org/2002/07/owl#bottomDataProperty',\n    /** The object property that does not relate any two individuals. */\n    'bottomObjectProperty': 'http://www.w3.org/2002/07/owl#bottomObjectProperty',\n    /** The property that determines the cardinality of an exact cardinality restriction. */\n    'cardinality': 'http://www.w3.org/2002/07/owl#cardinality',\n    /** The property that determines that a given class is the complement of another class. */\n    'complementOf': 'http://www.w3.org/2002/07/owl#complementOf',\n    /** The property that determines that a given data range is the complement of another data range with respect to the data domain. */\n    'datatypeComplementOf': 'http://www.w3.org/2002/07/owl#datatypeComplementOf',\n    /** The annotation property that indicates that a given entity has been deprecated. */\n    'deprecated': 'http://www.w3.org/2002/07/owl#deprecated',\n    /** The property that determines that two given individuals are different. */\n    'differentFrom': 'http://www.w3.org/2002/07/owl#differentFrom',\n    /** The property that determines that a given class is equivalent to the disjoint union of a collection of other classes. */\n    'disjointUnionOf': 'http://www.w3.org/2002/07/owl#disjointUnionOf',\n    /** The property that determines that two given classes are disjoint. */\n    'disjointWith': 'http://www.w3.org/2002/07/owl#disjointWith',\n    /** The property that determines the collection of pairwise different individuals in a owl:AllDifferent axiom. */\n    'distinctMembers': 'http://www.w3.org/2002/07/owl#distinctMembers',\n    /** The property that determines that two given classes are equivalent, and that is used to specify datatype definitions. */\n    'equivalentClass': 'http://www.w3.org/2002/07/owl#equivalentClass',\n    /** The property that determines that two given properties are equivalent. */\n    'equivalentProperty': 'http://www.w3.org/2002/07/owl#equivalentProperty',\n    /** The property that determines the collection of properties that jointly build a key. */\n    'hasKey': 'http://www.w3.org/2002/07/owl#hasKey',\n    /** The property that determines the property that a self restriction refers to. */\n    'hasSelf': 'http://www.w3.org/2002/07/owl#hasSelf',\n    /** The property that determines the individual that a has-value restriction refers to. */\n    'hasValue': 'http://www.w3.org/2002/07/owl#hasValue',\n    /** The property that is used for importing other ontologies into a given ontology. */\n    'imports': 'http://www.w3.org/2002/07/owl#imports',\n    /** The annotation property that indicates that a given ontology is incompatible with another ontology. */\n    'incompatibleWith': 'http://www.w3.org/2002/07/owl#incompatibleWith',\n    /** The property that determines the collection of classes or data ranges that build an intersection. */\n    'intersectionOf': 'http://www.w3.org/2002/07/owl#intersectionOf',\n    /** The property that determines that two given properties are inverse. */\n    'inverseOf': 'http://www.w3.org/2002/07/owl#inverseOf',\n    /** The property that determines the cardinality of a maximum cardinality restriction. */\n    'maxCardinality': 'http://www.w3.org/2002/07/owl#maxCardinality',\n    /** The property that determines the cardinality of a maximum qualified cardinality restriction. */\n    'maxQualifiedCardinality': 'http://www.w3.org/2002/07/owl#maxQualifiedCardinality',\n    /** The property that determines the collection of members in either a owl:AllDifferent, owl:AllDisjointClasses or owl:AllDisjointProperties axiom. */\n    'members': 'http://www.w3.org/2002/07/owl#members',\n    /** The property that determines the cardinality of a minimum cardinality restriction. */\n    'minCardinality': 'http://www.w3.org/2002/07/owl#minCardinality',\n    /** The property that determines the cardinality of a minimum qualified cardinality restriction. */\n    'minQualifiedCardinality': 'http://www.w3.org/2002/07/owl#minQualifiedCardinality',\n    /** The property that determines the class that a qualified object cardinality restriction refers to. */\n    'onClass': 'http://www.w3.org/2002/07/owl#onClass',\n    /** The property that determines the data range that a qualified data cardinality restriction refers to. */\n    'onDataRange': 'http://www.w3.org/2002/07/owl#onDataRange',\n    /** The property that determines the datatype that a datatype restriction refers to. */\n    'onDatatype': 'http://www.w3.org/2002/07/owl#onDatatype',\n    /** The property that determines the n-tuple of properties that a property restriction on an n-ary data range refers to. */\n    'onProperties': 'http://www.w3.org/2002/07/owl#onProperties',\n    /** The property that determines the property that a property restriction refers to. */\n    'onProperty': 'http://www.w3.org/2002/07/owl#onProperty',\n    /** The property that determines the collection of individuals or data values that build an enumeration. */\n    'oneOf': 'http://www.w3.org/2002/07/owl#oneOf',\n    /** The annotation property that indicates the predecessor ontology of a given ontology. */\n    'priorVersion': 'http://www.w3.org/2002/07/owl#priorVersion',\n    /** The property that determines the n-tuple of properties that build a sub property chain of a given property. */\n    'propertyChainAxiom': 'http://www.w3.org/2002/07/owl#propertyChainAxiom',\n    /** The property that determines that two given properties are disjoint. */\n    'propertyDisjointWith': 'http://www.w3.org/2002/07/owl#propertyDisjointWith',\n    /** The property that determines the cardinality of an exact qualified cardinality restriction. */\n    'qualifiedCardinality': 'http://www.w3.org/2002/07/owl#qualifiedCardinality',\n    /** The property that determines that two given individuals are equal. */\n    'sameAs': 'http://www.w3.org/2002/07/owl#sameAs',\n    /** The property that determines the class that an existential property restriction refers to. */\n    'someValuesFrom': 'http://www.w3.org/2002/07/owl#someValuesFrom',\n    /** The property that determines the subject of a negative property assertion. */\n    'sourceIndividual': 'http://www.w3.org/2002/07/owl#sourceIndividual',\n    /** The property that determines the object of a negative object property assertion. */\n    'targetIndividual': 'http://www.w3.org/2002/07/owl#targetIndividual',\n    /** The property that determines the value of a negative data property assertion. */\n    'targetValue': 'http://www.w3.org/2002/07/owl#targetValue',\n    /** The data property that relates every individual to every data value. */\n    'topDataProperty': 'http://www.w3.org/2002/07/owl#topDataProperty',\n    /** The object property that relates every two individuals. */\n    'topObjectProperty': 'http://www.w3.org/2002/07/owl#topObjectProperty',\n    /** The property that determines the collection of classes or data ranges that build a union. */\n    'unionOf': 'http://www.w3.org/2002/07/owl#unionOf',\n    /** The property that identifies the version IRI of an ontology. */\n    'versionIRI': 'http://www.w3.org/2002/07/owl#versionIRI',\n    /** The annotation property that provides version information for an ontology or another OWL construct. */\n    'versionInfo': 'http://www.w3.org/2002/07/owl#versionInfo',\n    /** The property that determines the collection of facet-value pairs that define a datatype restriction. */\n    'withRestrictions': 'http://www.w3.org/2002/07/owl#withRestrictions',\n};\n/** Namespace URI of the owl vocabulary. */\nexports._owl = new n3.NamedNode('http://www.w3.org/2002/07/owl#');\nexports.owl = {\n    /** The class of collections of pairwise different individuals. */\n    'AllDifferent': new n3.NamedNode('http://www.w3.org/2002/07/owl#AllDifferent'),\n    /** The class of collections of pairwise disjoint classes. */\n    'AllDisjointClasses': new n3.NamedNode('http://www.w3.org/2002/07/owl#AllDisjointClasses'),\n    /** The class of collections of pairwise disjoint properties. */\n    'AllDisjointProperties': new n3.NamedNode('http://www.w3.org/2002/07/owl#AllDisjointProperties'),\n    /** The class of annotated annotations for which the RDF serialization consists of an annotated subject, predicate and object. */\n    'Annotation': new n3.NamedNode('http://www.w3.org/2002/07/owl#Annotation'),\n    /** The class of annotation properties. */\n    'AnnotationProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#AnnotationProperty'),\n    /** The class of asymmetric properties. */\n    'AsymmetricProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#AsymmetricProperty'),\n    /** The class of annotated axioms for which the RDF serialization consists of an annotated subject, predicate and object. */\n    'Axiom': new n3.NamedNode('http://www.w3.org/2002/07/owl#Axiom'),\n    /** The class of OWL classes. */\n    'Class': new n3.NamedNode('http://www.w3.org/2002/07/owl#Class'),\n    /** The class of OWL data ranges, which are special kinds of datatypes. Note: The use of the IRI owl:DataRange has been deprecated as of OWL 2. The IRI rdfs:Datatype SHOULD be used instead. */\n    'DataRange': new n3.NamedNode('http://www.w3.org/2002/07/owl#DataRange'),\n    /** The class of data properties. */\n    'DatatypeProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#DatatypeProperty'),\n    /** The class of deprecated classes. */\n    'DeprecatedClass': new n3.NamedNode('http://www.w3.org/2002/07/owl#DeprecatedClass'),\n    /** The class of deprecated properties. */\n    'DeprecatedProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#DeprecatedProperty'),\n    /** The class of functional properties. */\n    'FunctionalProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#FunctionalProperty'),\n    /** The class of inverse-functional properties. */\n    'InverseFunctionalProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#InverseFunctionalProperty'),\n    /** The class of irreflexive properties. */\n    'IrreflexiveProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#IrreflexiveProperty'),\n    /** The class of named individuals. */\n    'NamedIndividual': new n3.NamedNode('http://www.w3.org/2002/07/owl#NamedIndividual'),\n    /** The class of negative property assertions. */\n    'NegativePropertyAssertion': new n3.NamedNode('http://www.w3.org/2002/07/owl#NegativePropertyAssertion'),\n    /** This is the empty class. */\n    'Nothing': new n3.NamedNode('http://www.w3.org/2002/07/owl#Nothing'),\n    /** The class of object properties. */\n    'ObjectProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#ObjectProperty'),\n    /** The class of ontologies. */\n    'Ontology': new n3.NamedNode('http://www.w3.org/2002/07/owl#Ontology'),\n    /** The class of ontology properties. */\n    'OntologyProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#OntologyProperty'),\n    /** The class of reflexive properties. */\n    'ReflexiveProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#ReflexiveProperty'),\n    /** The class of property restrictions. */\n    'Restriction': new n3.NamedNode('http://www.w3.org/2002/07/owl#Restriction'),\n    /** The class of symmetric properties. */\n    'SymmetricProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#SymmetricProperty'),\n    /** The class of OWL individuals. */\n    'Thing': new n3.NamedNode('http://www.w3.org/2002/07/owl#Thing'),\n    /** The class of transitive properties. */\n    'TransitiveProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#TransitiveProperty'),\n    /** The property that determines the class that a universal property restriction refers to. */\n    'allValuesFrom': new n3.NamedNode('http://www.w3.org/2002/07/owl#allValuesFrom'),\n    /** The property that determines the predicate of an annotated axiom or annotated annotation. */\n    'annotatedProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#annotatedProperty'),\n    /** The property that determines the subject of an annotated axiom or annotated annotation. */\n    'annotatedSource': new n3.NamedNode('http://www.w3.org/2002/07/owl#annotatedSource'),\n    /** The property that determines the object of an annotated axiom or annotated annotation. */\n    'annotatedTarget': new n3.NamedNode('http://www.w3.org/2002/07/owl#annotatedTarget'),\n    /** The property that determines the predicate of a negative property assertion. */\n    'assertionProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#assertionProperty'),\n    /** The annotation property that indicates that a given ontology is backward compatible with another ontology. */\n    'backwardCompatibleWith': new n3.NamedNode('http://www.w3.org/2002/07/owl#backwardCompatibleWith'),\n    /** The data property that does not relate any individual to any data value. */\n    'bottomDataProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#bottomDataProperty'),\n    /** The object property that does not relate any two individuals. */\n    'bottomObjectProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#bottomObjectProperty'),\n    /** The property that determines the cardinality of an exact cardinality restriction. */\n    'cardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#cardinality'),\n    /** The property that determines that a given class is the complement of another class. */\n    'complementOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#complementOf'),\n    /** The property that determines that a given data range is the complement of another data range with respect to the data domain. */\n    'datatypeComplementOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#datatypeComplementOf'),\n    /** The annotation property that indicates that a given entity has been deprecated. */\n    'deprecated': new n3.NamedNode('http://www.w3.org/2002/07/owl#deprecated'),\n    /** The property that determines that two given individuals are different. */\n    'differentFrom': new n3.NamedNode('http://www.w3.org/2002/07/owl#differentFrom'),\n    /** The property that determines that a given class is equivalent to the disjoint union of a collection of other classes. */\n    'disjointUnionOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#disjointUnionOf'),\n    /** The property that determines that two given classes are disjoint. */\n    'disjointWith': new n3.NamedNode('http://www.w3.org/2002/07/owl#disjointWith'),\n    /** The property that determines the collection of pairwise different individuals in a owl:AllDifferent axiom. */\n    'distinctMembers': new n3.NamedNode('http://www.w3.org/2002/07/owl#distinctMembers'),\n    /** The property that determines that two given classes are equivalent, and that is used to specify datatype definitions. */\n    'equivalentClass': new n3.NamedNode('http://www.w3.org/2002/07/owl#equivalentClass'),\n    /** The property that determines that two given properties are equivalent. */\n    'equivalentProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#equivalentProperty'),\n    /** The property that determines the collection of properties that jointly build a key. */\n    'hasKey': new n3.NamedNode('http://www.w3.org/2002/07/owl#hasKey'),\n    /** The property that determines the property that a self restriction refers to. */\n    'hasSelf': new n3.NamedNode('http://www.w3.org/2002/07/owl#hasSelf'),\n    /** The property that determines the individual that a has-value restriction refers to. */\n    'hasValue': new n3.NamedNode('http://www.w3.org/2002/07/owl#hasValue'),\n    /** The property that is used for importing other ontologies into a given ontology. */\n    'imports': new n3.NamedNode('http://www.w3.org/2002/07/owl#imports'),\n    /** The annotation property that indicates that a given ontology is incompatible with another ontology. */\n    'incompatibleWith': new n3.NamedNode('http://www.w3.org/2002/07/owl#incompatibleWith'),\n    /** The property that determines the collection of classes or data ranges that build an intersection. */\n    'intersectionOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#intersectionOf'),\n    /** The property that determines that two given properties are inverse. */\n    'inverseOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#inverseOf'),\n    /** The property that determines the cardinality of a maximum cardinality restriction. */\n    'maxCardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#maxCardinality'),\n    /** The property that determines the cardinality of a maximum qualified cardinality restriction. */\n    'maxQualifiedCardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#maxQualifiedCardinality'),\n    /** The property that determines the collection of members in either a owl:AllDifferent, owl:AllDisjointClasses or owl:AllDisjointProperties axiom. */\n    'members': new n3.NamedNode('http://www.w3.org/2002/07/owl#members'),\n    /** The property that determines the cardinality of a minimum cardinality restriction. */\n    'minCardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#minCardinality'),\n    /** The property that determines the cardinality of a minimum qualified cardinality restriction. */\n    'minQualifiedCardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#minQualifiedCardinality'),\n    /** The property that determines the class that a qualified object cardinality restriction refers to. */\n    'onClass': new n3.NamedNode('http://www.w3.org/2002/07/owl#onClass'),\n    /** The property that determines the data range that a qualified data cardinality restriction refers to. */\n    'onDataRange': new n3.NamedNode('http://www.w3.org/2002/07/owl#onDataRange'),\n    /** The property that determines the datatype that a datatype restriction refers to. */\n    'onDatatype': new n3.NamedNode('http://www.w3.org/2002/07/owl#onDatatype'),\n    /** The property that determines the n-tuple of properties that a property restriction on an n-ary data range refers to. */\n    'onProperties': new n3.NamedNode('http://www.w3.org/2002/07/owl#onProperties'),\n    /** The property that determines the property that a property restriction refers to. */\n    'onProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#onProperty'),\n    /** The property that determines the collection of individuals or data values that build an enumeration. */\n    'oneOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#oneOf'),\n    /** The annotation property that indicates the predecessor ontology of a given ontology. */\n    'priorVersion': new n3.NamedNode('http://www.w3.org/2002/07/owl#priorVersion'),\n    /** The property that determines the n-tuple of properties that build a sub property chain of a given property. */\n    'propertyChainAxiom': new n3.NamedNode('http://www.w3.org/2002/07/owl#propertyChainAxiom'),\n    /** The property that determines that two given properties are disjoint. */\n    'propertyDisjointWith': new n3.NamedNode('http://www.w3.org/2002/07/owl#propertyDisjointWith'),\n    /** The property that determines the cardinality of an exact qualified cardinality restriction. */\n    'qualifiedCardinality': new n3.NamedNode('http://www.w3.org/2002/07/owl#qualifiedCardinality'),\n    /** The property that determines that two given individuals are equal. */\n    'sameAs': new n3.NamedNode('http://www.w3.org/2002/07/owl#sameAs'),\n    /** The property that determines the class that an existential property restriction refers to. */\n    'someValuesFrom': new n3.NamedNode('http://www.w3.org/2002/07/owl#someValuesFrom'),\n    /** The property that determines the subject of a negative property assertion. */\n    'sourceIndividual': new n3.NamedNode('http://www.w3.org/2002/07/owl#sourceIndividual'),\n    /** The property that determines the object of a negative object property assertion. */\n    'targetIndividual': new n3.NamedNode('http://www.w3.org/2002/07/owl#targetIndividual'),\n    /** The property that determines the value of a negative data property assertion. */\n    'targetValue': new n3.NamedNode('http://www.w3.org/2002/07/owl#targetValue'),\n    /** The data property that relates every individual to every data value. */\n    'topDataProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#topDataProperty'),\n    /** The object property that relates every two individuals. */\n    'topObjectProperty': new n3.NamedNode('http://www.w3.org/2002/07/owl#topObjectProperty'),\n    /** The property that determines the collection of classes or data ranges that build a union. */\n    'unionOf': new n3.NamedNode('http://www.w3.org/2002/07/owl#unionOf'),\n    /** The property that identifies the version IRI of an ontology. */\n    'versionIRI': new n3.NamedNode('http://www.w3.org/2002/07/owl#versionIRI'),\n    /** The annotation property that provides version information for an ontology or another OWL construct. */\n    'versionInfo': new n3.NamedNode('http://www.w3.org/2002/07/owl#versionInfo'),\n    /** The property that determines the collection of facet-value pairs that define a datatype restriction. */\n    'withRestrictions': new n3.NamedNode('http://www.w3.org/2002/07/owl#withRestrictions'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/owl.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/rdf.ts":
+/*!*******************************!*\
+  !*** ./src/ontologies/rdf.ts ***!
+  \*******************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.rdf = exports._rdf = exports.RDF = exports._RDF = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the RDF vocabulary. */\nexports._RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\nexports.RDF = {\n    /** The class of containers of alternatives. */\n    'Alt': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#Alt',\n    /** The class of unordered containers. */\n    'Bag': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#Bag',\n    /** A class representing a compound literal. */\n    'CompoundLiteral': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#CompoundLiteral',\n    /** The datatype of RDF literals storing fragments of HTML content */\n    'HTML': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#HTML',\n    /** The datatype of RDF literals storing JSON content. */\n    'JSON': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#JSON',\n    /** The class of RDF Lists. */\n    'List': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#List',\n    /** The class of plain (i.e. untyped) literal values, as used in RIF and OWL 2 */\n    'PlainLiteral': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#PlainLiteral',\n    /** The class of RDF properties. */\n    'Property': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#Property',\n    /** The class of ordered containers. */\n    'Seq': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#Seq',\n    /** The class of RDF statements. */\n    'Statement': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#Statement',\n    /** The datatype of XML literal values. */\n    'XMLLiteral': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral',\n    /** The base direction component of a CompoundLiteral. */\n    'direction': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#direction',\n    /** The first item in the subject RDF list. */\n    'first': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#first',\n    /** The datatype of language-tagged string values */\n    'langString': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#langString',\n    /** The language component of a CompoundLiteral. */\n    'language': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#language',\n    /** The empty list, with no items in it. If the rest of a list is nil then the list has no more items in it. */\n    'nil': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#nil',\n    /** The object of the subject RDF statement. */\n    'object': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#object',\n    /** The predicate of the subject RDF statement. */\n    'predicate': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#predicate',\n    /** The rest of the subject RDF list after the first item. */\n    'rest': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#rest',\n    /** The subject of the subject RDF statement. */\n    'subject': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#subject',\n    /** The subject is an instance of a class. */\n    'type': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type',\n    /** Idiomatic property used for structured values. */\n    'value': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#value',\n};\n/** Namespace URI of the rdf vocabulary. */\nexports._rdf = new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#');\nexports.rdf = {\n    /** The class of containers of alternatives. */\n    'Alt': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#Alt'),\n    /** The class of unordered containers. */\n    'Bag': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#Bag'),\n    /** A class representing a compound literal. */\n    'CompoundLiteral': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#CompoundLiteral'),\n    /** The datatype of RDF literals storing fragments of HTML content */\n    'HTML': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#HTML'),\n    /** The datatype of RDF literals storing JSON content. */\n    'JSON': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#JSON'),\n    /** The class of RDF Lists. */\n    'List': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#List'),\n    /** The class of plain (i.e. untyped) literal values, as used in RIF and OWL 2 */\n    'PlainLiteral': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#PlainLiteral'),\n    /** The class of RDF properties. */\n    'Property': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#Property'),\n    /** The class of ordered containers. */\n    'Seq': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#Seq'),\n    /** The class of RDF statements. */\n    'Statement': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#Statement'),\n    /** The datatype of XML literal values. */\n    'XMLLiteral': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#XMLLiteral'),\n    /** The base direction component of a CompoundLiteral. */\n    'direction': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#direction'),\n    /** The first item in the subject RDF list. */\n    'first': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#first'),\n    /** The datatype of language-tagged string values */\n    'langString': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#langString'),\n    /** The language component of a CompoundLiteral. */\n    'language': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#language'),\n    /** The empty list, with no items in it. If the rest of a list is nil then the list has no more items in it. */\n    'nil': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#nil'),\n    /** The object of the subject RDF statement. */\n    'object': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#object'),\n    /** The predicate of the subject RDF statement. */\n    'predicate': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#predicate'),\n    /** The rest of the subject RDF list after the first item. */\n    'rest': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#rest'),\n    /** The subject of the subject RDF statement. */\n    'subject': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#subject'),\n    /** The subject is an instance of a class. */\n    'type': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#type'),\n    /** Idiomatic property used for structured values. */\n    'value': new n3.NamedNode('http://www.w3.org/1999/02/22-rdf-syntax-ns#value'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/rdf.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/rdfa.ts":
+/*!********************************!*\
+  !*** ./src/ontologies/rdfa.ts ***!
+  \********************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.rdfa = exports._rdfa = exports.RDFA = exports._RDFA = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the RDFA vocabulary. */\nexports._RDFA = 'http://www.w3.org/ns/rdfa#';\nexports.RDFA = {\n    'me': 'http://www.ivan-herman.net/foaf#me',\n    'DocumentError': 'http://www.w3.org/ns/rdfa#DocumentError',\n    'Error': 'http://www.w3.org/ns/rdfa#Error',\n    'Info': 'http://www.w3.org/ns/rdfa#Info',\n    'PGClass': 'http://www.w3.org/ns/rdfa#PGClass',\n    'Pattern': 'http://www.w3.org/ns/rdfa#Pattern',\n    'PrefixMapping': 'http://www.w3.org/ns/rdfa#PrefixMapping',\n    'PrefixOrTermMapping': 'http://www.w3.org/ns/rdfa#PrefixOrTermMapping',\n    'PrefixRedefinition': 'http://www.w3.org/ns/rdfa#PrefixRedefinition',\n    'TermMapping': 'http://www.w3.org/ns/rdfa#TermMapping',\n    'UnresolvedCURIE': 'http://www.w3.org/ns/rdfa#UnresolvedCURIE',\n    'UnresolvedTerm': 'http://www.w3.org/ns/rdfa#UnresolvedTerm',\n    'VocabReferenceError': 'http://www.w3.org/ns/rdfa#VocabReferenceError',\n    'Warning': 'http://www.w3.org/ns/rdfa#Warning',\n    'context': 'http://www.w3.org/ns/rdfa#context',\n    'copy': 'http://www.w3.org/ns/rdfa#copy',\n    'prefix': 'http://www.w3.org/ns/rdfa#prefix',\n    'term': 'http://www.w3.org/ns/rdfa#term',\n    'uri': 'http://www.w3.org/ns/rdfa#uri',\n    'usesVocabulary': 'http://www.w3.org/ns/rdfa#usesVocabulary',\n    'vocabulary': 'http://www.w3.org/ns/rdfa#vocabulary',\n};\n/** Namespace URI of the rdfa vocabulary. */\nexports._rdfa = new n3.NamedNode('http://www.w3.org/ns/rdfa#');\nexports.rdfa = {\n    'me': new n3.NamedNode('http://www.ivan-herman.net/foaf#me'),\n    'DocumentError': new n3.NamedNode('http://www.w3.org/ns/rdfa#DocumentError'),\n    'Error': new n3.NamedNode('http://www.w3.org/ns/rdfa#Error'),\n    'Info': new n3.NamedNode('http://www.w3.org/ns/rdfa#Info'),\n    'PGClass': new n3.NamedNode('http://www.w3.org/ns/rdfa#PGClass'),\n    'Pattern': new n3.NamedNode('http://www.w3.org/ns/rdfa#Pattern'),\n    'PrefixMapping': new n3.NamedNode('http://www.w3.org/ns/rdfa#PrefixMapping'),\n    'PrefixOrTermMapping': new n3.NamedNode('http://www.w3.org/ns/rdfa#PrefixOrTermMapping'),\n    'PrefixRedefinition': new n3.NamedNode('http://www.w3.org/ns/rdfa#PrefixRedefinition'),\n    'TermMapping': new n3.NamedNode('http://www.w3.org/ns/rdfa#TermMapping'),\n    'UnresolvedCURIE': new n3.NamedNode('http://www.w3.org/ns/rdfa#UnresolvedCURIE'),\n    'UnresolvedTerm': new n3.NamedNode('http://www.w3.org/ns/rdfa#UnresolvedTerm'),\n    'VocabReferenceError': new n3.NamedNode('http://www.w3.org/ns/rdfa#VocabReferenceError'),\n    'Warning': new n3.NamedNode('http://www.w3.org/ns/rdfa#Warning'),\n    'context': new n3.NamedNode('http://www.w3.org/ns/rdfa#context'),\n    'copy': new n3.NamedNode('http://www.w3.org/ns/rdfa#copy'),\n    'prefix': new n3.NamedNode('http://www.w3.org/ns/rdfa#prefix'),\n    'term': new n3.NamedNode('http://www.w3.org/ns/rdfa#term'),\n    'uri': new n3.NamedNode('http://www.w3.org/ns/rdfa#uri'),\n    'usesVocabulary': new n3.NamedNode('http://www.w3.org/ns/rdfa#usesVocabulary'),\n    'vocabulary': new n3.NamedNode('http://www.w3.org/ns/rdfa#vocabulary'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/rdfa.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/rdfs.ts":
+/*!********************************!*\
+  !*** ./src/ontologies/rdfs.ts ***!
+  \********************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.rdfs = exports._rdfs = exports.RDFS = exports._RDFS = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the RDFS vocabulary. */\nexports._RDFS = 'http://www.w3.org/2000/01/rdf-schema#';\nexports.RDFS = {\n    /** The class of classes. */\n    'Class': 'http://www.w3.org/2000/01/rdf-schema#Class',\n    /** The class of RDF containers. */\n    'Container': 'http://www.w3.org/2000/01/rdf-schema#Container',\n    /** The class of container membership properties, rdf:_1, rdf:_2, ...,\n                    all of which are sub-properties of 'member'. */\n    'ContainerMembershipProperty': 'http://www.w3.org/2000/01/rdf-schema#ContainerMembershipProperty',\n    /** The class of RDF datatypes. */\n    'Datatype': 'http://www.w3.org/2000/01/rdf-schema#Datatype',\n    /** The class of literal values, eg. textual strings and integers. */\n    'Literal': 'http://www.w3.org/2000/01/rdf-schema#Literal',\n    /** The class resource, everything. */\n    'Resource': 'http://www.w3.org/2000/01/rdf-schema#Resource',\n    /** A description of the subject resource. */\n    'comment': 'http://www.w3.org/2000/01/rdf-schema#comment',\n    /** A domain of the subject property. */\n    'domain': 'http://www.w3.org/2000/01/rdf-schema#domain',\n    /** The defininition of the subject resource. */\n    'isDefinedBy': 'http://www.w3.org/2000/01/rdf-schema#isDefinedBy',\n    /** A human-readable name for the subject. */\n    'label': 'http://www.w3.org/2000/01/rdf-schema#label',\n    /** A member of the subject resource. */\n    'member': 'http://www.w3.org/2000/01/rdf-schema#member',\n    /** A range of the subject property. */\n    'range': 'http://www.w3.org/2000/01/rdf-schema#range',\n    /** Further information about the subject resource. */\n    'seeAlso': 'http://www.w3.org/2000/01/rdf-schema#seeAlso',\n    /** The subject is a subclass of a class. */\n    'subClassOf': 'http://www.w3.org/2000/01/rdf-schema#subClassOf',\n    /** The subject is a subproperty of a property. */\n    'subPropertyOf': 'http://www.w3.org/2000/01/rdf-schema#subPropertyOf',\n};\n/** Namespace URI of the rdfs vocabulary. */\nexports._rdfs = new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#');\nexports.rdfs = {\n    /** The class of classes. */\n    'Class': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#Class'),\n    /** The class of RDF containers. */\n    'Container': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#Container'),\n    /** The class of container membership properties, rdf:_1, rdf:_2, ...,\n                    all of which are sub-properties of 'member'. */\n    'ContainerMembershipProperty': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#ContainerMembershipProperty'),\n    /** The class of RDF datatypes. */\n    'Datatype': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#Datatype'),\n    /** The class of literal values, eg. textual strings and integers. */\n    'Literal': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#Literal'),\n    /** The class resource, everything. */\n    'Resource': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#Resource'),\n    /** A description of the subject resource. */\n    'comment': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#comment'),\n    /** A domain of the subject property. */\n    'domain': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#domain'),\n    /** The defininition of the subject resource. */\n    'isDefinedBy': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#isDefinedBy'),\n    /** A human-readable name for the subject. */\n    'label': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#label'),\n    /** A member of the subject resource. */\n    'member': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#member'),\n    /** A range of the subject property. */\n    'range': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#range'),\n    /** Further information about the subject resource. */\n    'seeAlso': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#seeAlso'),\n    /** The subject is a subclass of a class. */\n    'subClassOf': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#subClassOf'),\n    /** The subject is a subproperty of a property. */\n    'subPropertyOf': new n3.NamedNode('http://www.w3.org/2000/01/rdf-schema#subPropertyOf'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/rdfs.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/sh.ts":
+/*!******************************!*\
+  !*** ./src/ontologies/sh.ts ***!
+  \******************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.sh = exports._sh = exports.SH = exports._SH = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the SH vocabulary. */\nexports._SH = 'http://www.w3.org/ns/shacl#';\nexports.SH = {\n    /** The base class of validation results, typically not instantiated directly. */\n    'AbstractResult': 'http://www.w3.org/ns/shacl#AbstractResult',\n    /** A constraint component that can be used to test whether a value node conforms to all members of a provided list of shapes. */\n    'AndConstraintComponent': 'http://www.w3.org/ns/shacl#AndConstraintComponent',\n    'AndConstraintComponent_and': 'http://www.w3.org/ns/shacl#AndConstraintComponent-and',\n    /** The node kind of all blank nodes. */\n    'BlankNode': 'http://www.w3.org/ns/shacl#BlankNode',\n    /** The node kind of all blank nodes or IRIs. */\n    'BlankNodeOrIRI': 'http://www.w3.org/ns/shacl#BlankNodeOrIRI',\n    /** The node kind of all blank nodes or literals. */\n    'BlankNodeOrLiteral': 'http://www.w3.org/ns/shacl#BlankNodeOrLiteral',\n    /** A constraint component that can be used to verify that each value node is an instance of a given type. */\n    'ClassConstraintComponent': 'http://www.w3.org/ns/shacl#ClassConstraintComponent',\n    'ClassConstraintComponent_class': 'http://www.w3.org/ns/shacl#ClassConstraintComponent-class',\n    /** A constraint component that can be used to indicate that focus nodes must only have values for those properties that have been explicitly enumerated via sh:property/sh:path. */\n    'ClosedConstraintComponent': 'http://www.w3.org/ns/shacl#ClosedConstraintComponent',\n    'ClosedConstraintComponent_closed': 'http://www.w3.org/ns/shacl#ClosedConstraintComponent-closed',\n    'ClosedConstraintComponent_ignoredProperties': 'http://www.w3.org/ns/shacl#ClosedConstraintComponent-ignoredProperties',\n    /** The class of constraint components. */\n    'ConstraintComponent': 'http://www.w3.org/ns/shacl#ConstraintComponent',\n    /** A constraint component that can be used to restrict the datatype of all value nodes. */\n    'DatatypeConstraintComponent': 'http://www.w3.org/ns/shacl#DatatypeConstraintComponent',\n    'DatatypeConstraintComponent_datatype': 'http://www.w3.org/ns/shacl#DatatypeConstraintComponent-datatype',\n    /** A constraint component that can be used to verify that the set of value nodes is disjoint with the the set of nodes that have the focus node as subject and the value of a given property as predicate. */\n    'DisjointConstraintComponent': 'http://www.w3.org/ns/shacl#DisjointConstraintComponent',\n    'DisjointConstraintComponent_disjoint': 'http://www.w3.org/ns/shacl#DisjointConstraintComponent-disjoint',\n    /** A constraint component that can be used to verify that the set of value nodes is equal to the set of nodes that have the focus node as subject and the value of a given property as predicate. */\n    'EqualsConstraintComponent': 'http://www.w3.org/ns/shacl#EqualsConstraintComponent',\n    'EqualsConstraintComponent_equals': 'http://www.w3.org/ns/shacl#EqualsConstraintComponent-equals',\n    /** A constraint component that can be used to verify that a given node expression produces true for all value nodes. */\n    'ExpressionConstraintComponent': 'http://www.w3.org/ns/shacl#ExpressionConstraintComponent',\n    'ExpressionConstraintComponent_expression': 'http://www.w3.org/ns/shacl#ExpressionConstraintComponent-expression',\n    /** The class of SHACL functions. */\n    'Function': 'http://www.w3.org/ns/shacl#Function',\n    /** A constraint component that can be used to verify that one of the value nodes is a given RDF node. */\n    'HasValueConstraintComponent': 'http://www.w3.org/ns/shacl#HasValueConstraintComponent',\n    'HasValueConstraintComponent_hasValue': 'http://www.w3.org/ns/shacl#HasValueConstraintComponent-hasValue',\n    /** The node kind of all IRIs. */\n    'IRI': 'http://www.w3.org/ns/shacl#IRI',\n    /** The node kind of all IRIs or literals. */\n    'IRIOrLiteral': 'http://www.w3.org/ns/shacl#IRIOrLiteral',\n    /** A constraint component that can be used to exclusively enumerate the permitted value nodes. */\n    'InConstraintComponent': 'http://www.w3.org/ns/shacl#InConstraintComponent',\n    'InConstraintComponent_in': 'http://www.w3.org/ns/shacl#InConstraintComponent-in',\n    /** The severity for an informational validation result. */\n    'Info': 'http://www.w3.org/ns/shacl#Info',\n    /** The class of constraints backed by a JavaScript function. */\n    'JSConstraint': 'http://www.w3.org/ns/shacl#JSConstraint',\n    'JSConstraint_js': 'http://www.w3.org/ns/shacl#JSConstraint-js',\n    /** A constraint component with the parameter sh:js linking to a sh:JSConstraint containing a sh:script. */\n    'JSConstraintComponent': 'http://www.w3.org/ns/shacl#JSConstraintComponent',\n    /** Abstract base class of resources that declare an executable JavaScript. */\n    'JSExecutable': 'http://www.w3.org/ns/shacl#JSExecutable',\n    /** The class of SHACL functions that execute a JavaScript function when called. */\n    'JSFunction': 'http://www.w3.org/ns/shacl#JSFunction',\n    /** Represents a JavaScript library, typically identified by one or more URLs of files to include. */\n    'JSLibrary': 'http://www.w3.org/ns/shacl#JSLibrary',\n    /** The class of SHACL rules expressed using JavaScript. */\n    'JSRule': 'http://www.w3.org/ns/shacl#JSRule',\n    /** The class of targets that are based on JavaScript functions. */\n    'JSTarget': 'http://www.w3.org/ns/shacl#JSTarget',\n    /** The (meta) class for parameterizable targets that are based on JavaScript functions. */\n    'JSTargetType': 'http://www.w3.org/ns/shacl#JSTargetType',\n    /** A SHACL validator based on JavaScript. This can be used to declare SHACL constraint components that perform JavaScript-based validation when used. */\n    'JSValidator': 'http://www.w3.org/ns/shacl#JSValidator',\n    /** A constraint component that can be used to enumerate language tags that all value nodes must have. */\n    'LanguageInConstraintComponent': 'http://www.w3.org/ns/shacl#LanguageInConstraintComponent',\n    'LanguageInConstraintComponent_languageIn': 'http://www.w3.org/ns/shacl#LanguageInConstraintComponent-languageIn',\n    /** A constraint component that can be used to verify that each value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */\n    'LessThanConstraintComponent': 'http://www.w3.org/ns/shacl#LessThanConstraintComponent',\n    'LessThanConstraintComponent_lessThan': 'http://www.w3.org/ns/shacl#LessThanConstraintComponent-lessThan',\n    /** A constraint component that can be used to verify that every value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */\n    'LessThanOrEqualsConstraintComponent': 'http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent',\n    'LessThanOrEqualsConstraintComponent_lessThanOrEquals': 'http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent-lessThanOrEquals',\n    /** The node kind of all literals. */\n    'Literal': 'http://www.w3.org/ns/shacl#Literal',\n    /** A constraint component that can be used to restrict the maximum number of value nodes. */\n    'MaxCountConstraintComponent': 'http://www.w3.org/ns/shacl#MaxCountConstraintComponent',\n    'MaxCountConstraintComponent_maxCount': 'http://www.w3.org/ns/shacl#MaxCountConstraintComponent-maxCount',\n    /** A constraint component that can be used to restrict the range of value nodes with a maximum exclusive value. */\n    'MaxExclusiveConstraintComponent': 'http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent',\n    'MaxExclusiveConstraintComponent_maxExclusive': 'http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent-maxExclusive',\n    /** A constraint component that can be used to restrict the range of value nodes with a maximum inclusive value. */\n    'MaxInclusiveConstraintComponent': 'http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent',\n    'MaxInclusiveConstraintComponent_maxInclusive': 'http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent-maxInclusive',\n    /** A constraint component that can be used to restrict the maximum string length of value nodes. */\n    'MaxLengthConstraintComponent': 'http://www.w3.org/ns/shacl#MaxLengthConstraintComponent',\n    'MaxLengthConstraintComponent_maxLength': 'http://www.w3.org/ns/shacl#MaxLengthConstraintComponent-maxLength',\n    /** A constraint component that can be used to restrict the minimum number of value nodes. */\n    'MinCountConstraintComponent': 'http://www.w3.org/ns/shacl#MinCountConstraintComponent',\n    'MinCountConstraintComponent_minCount': 'http://www.w3.org/ns/shacl#MinCountConstraintComponent-minCount',\n    /** A constraint component that can be used to restrict the range of value nodes with a minimum exclusive value. */\n    'MinExclusiveConstraintComponent': 'http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent',\n    'MinExclusiveConstraintComponent_minExclusive': 'http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent-minExclusive',\n    /** A constraint component that can be used to restrict the range of value nodes with a minimum inclusive value. */\n    'MinInclusiveConstraintComponent': 'http://www.w3.org/ns/shacl#MinInclusiveConstraintComponent',\n    'MinInclusiveConstraintComponent_minInclusive': 'http://www.w3.org/ns/shacl#MinInclusiveConstraintComponent-minInclusive',\n    /** A constraint component that can be used to restrict the minimum string length of value nodes. */\n    'MinLengthConstraintComponent': 'http://www.w3.org/ns/shacl#MinLengthConstraintComponent',\n    'MinLengthConstraintComponent_minLength': 'http://www.w3.org/ns/shacl#MinLengthConstraintComponent-minLength',\n    /** A constraint component that can be used to verify that all value nodes conform to the given node shape. */\n    'NodeConstraintComponent': 'http://www.w3.org/ns/shacl#NodeConstraintComponent',\n    'NodeConstraintComponent_node': 'http://www.w3.org/ns/shacl#NodeConstraintComponent-node',\n    /** The class of all node kinds, including sh:BlankNode, sh:IRI, sh:Literal or the combinations of these: sh:BlankNodeOrIRI, sh:BlankNodeOrLiteral, sh:IRIOrLiteral. */\n    'NodeKind': 'http://www.w3.org/ns/shacl#NodeKind',\n    /** A constraint component that can be used to restrict the RDF node kind of each value node. */\n    'NodeKindConstraintComponent': 'http://www.w3.org/ns/shacl#NodeKindConstraintComponent',\n    'NodeKindConstraintComponent_nodeKind': 'http://www.w3.org/ns/shacl#NodeKindConstraintComponent-nodeKind',\n    /** A node shape is a shape that specifies constraint that need to be met with respect to focus nodes. */\n    'NodeShape': 'http://www.w3.org/ns/shacl#NodeShape',\n    /** A constraint component that can be used to verify that value nodes do not conform to a given shape. */\n    'NotConstraintComponent': 'http://www.w3.org/ns/shacl#NotConstraintComponent',\n    'NotConstraintComponent_not': 'http://www.w3.org/ns/shacl#NotConstraintComponent-not',\n    /** A constraint component that can be used to restrict the value nodes so that they conform to at least one out of several provided shapes. */\n    'OrConstraintComponent': 'http://www.w3.org/ns/shacl#OrConstraintComponent',\n    'OrConstraintComponent_or': 'http://www.w3.org/ns/shacl#OrConstraintComponent-or',\n    /** The class of parameter declarations, consisting of a path predicate and (possibly) information about allowed value type, cardinality and other characteristics. */\n    'Parameter': 'http://www.w3.org/ns/shacl#Parameter',\n    /** Superclass of components that can take parameters, especially functions and constraint components. */\n    'Parameterizable': 'http://www.w3.org/ns/shacl#Parameterizable',\n    /** A constraint component that can be used to verify that every value node matches a given regular expression. */\n    'PatternConstraintComponent': 'http://www.w3.org/ns/shacl#PatternConstraintComponent',\n    'PatternConstraintComponent_flags': 'http://www.w3.org/ns/shacl#PatternConstraintComponent-flags',\n    'PatternConstraintComponent_pattern': 'http://www.w3.org/ns/shacl#PatternConstraintComponent-pattern',\n    /** The class of prefix declarations, consisting of pairs of a prefix with a namespace. */\n    'PrefixDeclaration': 'http://www.w3.org/ns/shacl#PrefixDeclaration',\n    /** A constraint component that can be used to verify that all value nodes conform to the given property shape. */\n    'PropertyConstraintComponent': 'http://www.w3.org/ns/shacl#PropertyConstraintComponent',\n    'PropertyConstraintComponent_property': 'http://www.w3.org/ns/shacl#PropertyConstraintComponent-property',\n    /** Instances of this class represent groups of property shapes that belong together. */\n    'PropertyGroup': 'http://www.w3.org/ns/shacl#PropertyGroup',\n    /** A property shape is a shape that specifies constraints on the values of a focus node for a given property or path. */\n    'PropertyShape': 'http://www.w3.org/ns/shacl#PropertyShape',\n    /** A constraint component that can be used to verify that a specified maximum number of value nodes conforms to a given shape. */\n    'QualifiedMaxCountConstraintComponent': 'http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent',\n    'QualifiedMaxCountConstraintComponent_qualifiedMaxCount': 'http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedMaxCount',\n    'QualifiedMaxCountConstraintComponent_qualifiedValueShape': 'http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedValueShape',\n    'QualifiedMaxCountConstraintComponent_qualifiedValueShapesDisjoint': 'http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedValueShapesDisjoint',\n    /** A constraint component that can be used to verify that a specified minimum number of value nodes conforms to a given shape. */\n    'QualifiedMinCountConstraintComponent': 'http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent',\n    'QualifiedMinCountConstraintComponent_qualifiedMinCount': 'http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedMinCount',\n    'QualifiedMinCountConstraintComponent_qualifiedValueShape': 'http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedValueShape',\n    'QualifiedMinCountConstraintComponent_qualifiedValueShapesDisjoint': 'http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedValueShapesDisjoint',\n    /** A class of result annotations, which define the rules to derive the values of a given annotation property as extra values for a validation result. */\n    'ResultAnnotation': 'http://www.w3.org/ns/shacl#ResultAnnotation',\n    /** The class of SHACL rules. Never instantiated directly. */\n    'Rule': 'http://www.w3.org/ns/shacl#Rule',\n    /** The class of SPARQL executables that are based on an ASK query. */\n    'SPARQLAskExecutable': 'http://www.w3.org/ns/shacl#SPARQLAskExecutable',\n    /** The class of validators based on SPARQL ASK queries. The queries are evaluated for each value node and are supposed to return true if the given node conforms. */\n    'SPARQLAskValidator': 'http://www.w3.org/ns/shacl#SPARQLAskValidator',\n    /** The class of constraints based on SPARQL SELECT queries. */\n    'SPARQLConstraint': 'http://www.w3.org/ns/shacl#SPARQLConstraint',\n    /** A constraint component that can be used to define constraints based on SPARQL queries. */\n    'SPARQLConstraintComponent': 'http://www.w3.org/ns/shacl#SPARQLConstraintComponent',\n    'SPARQLConstraintComponent_sparql': 'http://www.w3.org/ns/shacl#SPARQLConstraintComponent-sparql',\n    /** The class of SPARQL executables that are based on a CONSTRUCT query. */\n    'SPARQLConstructExecutable': 'http://www.w3.org/ns/shacl#SPARQLConstructExecutable',\n    /** The class of resources that encapsulate a SPARQL query. */\n    'SPARQLExecutable': 'http://www.w3.org/ns/shacl#SPARQLExecutable',\n    /** A function backed by a SPARQL query - either ASK or SELECT. */\n    'SPARQLFunction': 'http://www.w3.org/ns/shacl#SPARQLFunction',\n    /** The class of SHACL rules based on SPARQL CONSTRUCT queries. */\n    'SPARQLRule': 'http://www.w3.org/ns/shacl#SPARQLRule',\n    /** The class of SPARQL executables based on a SELECT query. */\n    'SPARQLSelectExecutable': 'http://www.w3.org/ns/shacl#SPARQLSelectExecutable',\n    /** The class of validators based on SPARQL SELECT queries. The queries are evaluated for each focus node and are supposed to produce bindings for all focus nodes that do not conform. */\n    'SPARQLSelectValidator': 'http://www.w3.org/ns/shacl#SPARQLSelectValidator',\n    /** The class of targets that are based on SPARQL queries. */\n    'SPARQLTarget': 'http://www.w3.org/ns/shacl#SPARQLTarget',\n    /** The (meta) class for parameterizable targets that are based on SPARQL queries. */\n    'SPARQLTargetType': 'http://www.w3.org/ns/shacl#SPARQLTargetType',\n    /** The class of SPARQL executables based on a SPARQL UPDATE. */\n    'SPARQLUpdateExecutable': 'http://www.w3.org/ns/shacl#SPARQLUpdateExecutable',\n    /** The class of validation result severity levels, including violation and warning levels. */\n    'Severity': 'http://www.w3.org/ns/shacl#Severity',\n    /** A shape is a collection of constraints that may be targeted for certain nodes. */\n    'Shape': 'http://www.w3.org/ns/shacl#Shape',\n    /** The base class of targets such as those based on SPARQL queries. */\n    'Target': 'http://www.w3.org/ns/shacl#Target',\n    /** The (meta) class for parameterizable targets.\tInstances of this are instantiated as values of the sh:target property. */\n    'TargetType': 'http://www.w3.org/ns/shacl#TargetType',\n    /** A rule based on triple (subject, predicate, object) pattern. */\n    'TripleRule': 'http://www.w3.org/ns/shacl#TripleRule',\n    /** A constraint component that can be used to specify that no pair of value nodes may use the same language tag. */\n    'UniqueLangConstraintComponent': 'http://www.w3.org/ns/shacl#UniqueLangConstraintComponent',\n    'UniqueLangConstraintComponent_uniqueLang': 'http://www.w3.org/ns/shacl#UniqueLangConstraintComponent-uniqueLang',\n    /** The class of SHACL validation reports. */\n    'ValidationReport': 'http://www.w3.org/ns/shacl#ValidationReport',\n    /** The class of validation results. */\n    'ValidationResult': 'http://www.w3.org/ns/shacl#ValidationResult',\n    /** The class of validators, which provide instructions on how to process a constraint definition. This class serves as base class for the SPARQL-based validators and other possible implementations. */\n    'Validator': 'http://www.w3.org/ns/shacl#Validator',\n    /** The severity for a violation validation result. */\n    'Violation': 'http://www.w3.org/ns/shacl#Violation',\n    /** The severity for a warning validation result. */\n    'Warning': 'http://www.w3.org/ns/shacl#Warning',\n    /** A constraint component that can be used to restrict the value nodes so that they conform to exactly one out of several provided shapes. */\n    'XoneConstraintComponent': 'http://www.w3.org/ns/shacl#XoneConstraintComponent',\n    'XoneConstraintComponent_xone': 'http://www.w3.org/ns/shacl#XoneConstraintComponent-xone',\n    /** The (single) value of this property must be a list of path elements, representing the elements of alternative paths. */\n    'alternativePath': 'http://www.w3.org/ns/shacl#alternativePath',\n    /** RDF list of shapes to validate the value nodes against. */\n    'and': 'http://www.w3.org/ns/shacl#and',\n    /** The annotation property that shall be set. */\n    'annotationProperty': 'http://www.w3.org/ns/shacl#annotationProperty',\n    /** The (default) values of the annotation property. */\n    'annotationValue': 'http://www.w3.org/ns/shacl#annotationValue',\n    /** The name of the SPARQL variable from the SELECT clause that shall be used for the values. */\n    'annotationVarName': 'http://www.w3.org/ns/shacl#annotationVarName',\n    /** The SPARQL ASK query to execute. */\n    'ask': 'http://www.w3.org/ns/shacl#ask',\n    /** The type that all value nodes must have. */\n    'class': 'http://www.w3.org/ns/shacl#class',\n    /** If set to true then the shape is closed. */\n    'closed': 'http://www.w3.org/ns/shacl#closed',\n    /** The shapes that the focus nodes need to conform to before a rule is executed on them. */\n    'condition': 'http://www.w3.org/ns/shacl#condition',\n    /** True if the validation did not produce any validation results, and false otherwise. */\n    'conforms': 'http://www.w3.org/ns/shacl#conforms',\n    /** The SPARQL CONSTRUCT query to execute. */\n    'construct': 'http://www.w3.org/ns/shacl#construct',\n    /** Specifies an RDF datatype that all value nodes must have. */\n    'datatype': 'http://www.w3.org/ns/shacl#datatype',\n    /** If set to true then all nodes conform to this. */\n    'deactivated': 'http://www.w3.org/ns/shacl#deactivated',\n    /** Links a resource with its namespace prefix declarations. */\n    'declare': 'http://www.w3.org/ns/shacl#declare',\n    /** A default value for a property, for example for user interface tools to pre-populate input fields. */\n    'defaultValue': 'http://www.w3.org/ns/shacl#defaultValue',\n    /** Human-readable descriptions for the property in the context of the surrounding shape. */\n    'description': 'http://www.w3.org/ns/shacl#description',\n    /** Links a result with other results that provide more details, for example to describe violations against nested shapes. */\n    'detail': 'http://www.w3.org/ns/shacl#detail',\n    /** Specifies a property where the set of values must be disjoint with the value nodes. */\n    'disjoint': 'http://www.w3.org/ns/shacl#disjoint',\n    /** An entailment regime that indicates what kind of inferencing is required by a shapes graph. */\n    'entailment': 'http://www.w3.org/ns/shacl#entailment',\n    /** Specifies a property that must have the same values as the value nodes. */\n    'equals': 'http://www.w3.org/ns/shacl#equals',\n    /** The node expression that must return true for the value nodes. */\n    'expression': 'http://www.w3.org/ns/shacl#expression',\n    /** The shape that all input nodes of the expression need to conform to. */\n    'filterShape': 'http://www.w3.org/ns/shacl#filterShape',\n    /** An optional flag to be used with regular expression pattern matching. */\n    'flags': 'http://www.w3.org/ns/shacl#flags',\n    /** The focus node that was validated when the result was produced. */\n    'focusNode': 'http://www.w3.org/ns/shacl#focusNode',\n    /** Can be used to link to a property group to indicate that a property shape belongs to a group of related property shapes. */\n    'group': 'http://www.w3.org/ns/shacl#group',\n    /** Specifies a value that must be among the value nodes. */\n    'hasValue': 'http://www.w3.org/ns/shacl#hasValue',\n    /** An optional RDF list of properties that are also permitted in addition to those explicitly enumerated via sh:property/sh:path. */\n    'ignoredProperties': 'http://www.w3.org/ns/shacl#ignoredProperties',\n    /** Specifies a list of allowed values so that each value node must be among the members of the given list. */\n    'in': 'http://www.w3.org/ns/shacl#in',\n    /** A list of node expressions that shall be intersected. */\n    'intersection': 'http://www.w3.org/ns/shacl#intersection',\n    /** The (single) value of this property represents an inverse path (object to subject). */\n    'inversePath': 'http://www.w3.org/ns/shacl#inversePath',\n    /** Constraints expressed in JavaScript. */\n    'js': 'http://www.w3.org/ns/shacl#js',\n    /** The name of the JavaScript function to execute. */\n    'jsFunctionName': 'http://www.w3.org/ns/shacl#jsFunctionName',\n    /** Declares which JavaScript libraries are needed to execute this. */\n    'jsLibrary': 'http://www.w3.org/ns/shacl#jsLibrary',\n    /** Declares the URLs of a JavaScript library. This should be the absolute URL of a JavaScript file. Implementations may redirect those to local files. */\n    'jsLibraryURL': 'http://www.w3.org/ns/shacl#jsLibraryURL',\n    /** Outlines how human-readable labels of instances of the associated Parameterizable shall be produced. The values can contain {?paramName} as placeholders for the actual values of the given parameter. */\n    'labelTemplate': 'http://www.w3.org/ns/shacl#labelTemplate',\n    /** Specifies a list of language tags that all value nodes must have. */\n    'languageIn': 'http://www.w3.org/ns/shacl#languageIn',\n    /** Specifies a property that must have smaller values than the value nodes. */\n    'lessThan': 'http://www.w3.org/ns/shacl#lessThan',\n    /** Specifies a property that must have smaller or equal values than the value nodes. */\n    'lessThanOrEquals': 'http://www.w3.org/ns/shacl#lessThanOrEquals',\n    /** Specifies the maximum number of values in the set of value nodes. */\n    'maxCount': 'http://www.w3.org/ns/shacl#maxCount',\n    /** Specifies the maximum exclusive value of each value node. */\n    'maxExclusive': 'http://www.w3.org/ns/shacl#maxExclusive',\n    /** Specifies the maximum inclusive value of each value node. */\n    'maxInclusive': 'http://www.w3.org/ns/shacl#maxInclusive',\n    /** Specifies the maximum string length of each value node. */\n    'maxLength': 'http://www.w3.org/ns/shacl#maxLength',\n    /** A human-readable message (possibly with placeholders for variables) explaining the cause of the result. */\n    'message': 'http://www.w3.org/ns/shacl#message',\n    /** Specifies the minimum number of values in the set of value nodes. */\n    'minCount': 'http://www.w3.org/ns/shacl#minCount',\n    /** Specifies the minimum exclusive value of each value node. */\n    'minExclusive': 'http://www.w3.org/ns/shacl#minExclusive',\n    /** Specifies the minimum inclusive value of each value node. */\n    'minInclusive': 'http://www.w3.org/ns/shacl#minInclusive',\n    /** Specifies the minimum string length of each value node. */\n    'minLength': 'http://www.w3.org/ns/shacl#minLength',\n    /** Human-readable labels for the property in the context of the surrounding shape. */\n    'name': 'http://www.w3.org/ns/shacl#name',\n    /** The namespace associated with a prefix in a prefix declaration. */\n    'namespace': 'http://www.w3.org/ns/shacl#namespace',\n    /** Specifies the node shape that all value nodes must conform to. */\n    'node': 'http://www.w3.org/ns/shacl#node',\n    /** Specifies the node kind (e.g. IRI or literal) each value node. */\n    'nodeKind': 'http://www.w3.org/ns/shacl#nodeKind',\n    /** The validator(s) used to evaluate a constraint in the context of a node shape. */\n    'nodeValidator': 'http://www.w3.org/ns/shacl#nodeValidator',\n    /** The node expression producing the input nodes of a filter shape expression. */\n    'nodes': 'http://www.w3.org/ns/shacl#nodes',\n    /** Specifies a shape that the value nodes must not conform to. */\n    'not': 'http://www.w3.org/ns/shacl#not',\n    /** An expression producing the nodes that shall be inferred as objects. */\n    'object': 'http://www.w3.org/ns/shacl#object',\n    /** The (single) value of this property represents a path that is matched one or more times. */\n    'oneOrMorePath': 'http://www.w3.org/ns/shacl#oneOrMorePath',\n    /** Indicates whether a parameter is optional. */\n    'optional': 'http://www.w3.org/ns/shacl#optional',\n    /** Specifies a list of shapes so that the value nodes must conform to at least one of the shapes. */\n    'or': 'http://www.w3.org/ns/shacl#or',\n    /** Specifies the relative order of this compared to its siblings. For example use 0 for the first, 1 for the second. */\n    'order': 'http://www.w3.org/ns/shacl#order',\n    /** The parameters of a function or constraint component. */\n    'parameter': 'http://www.w3.org/ns/shacl#parameter',\n    /** Specifies the property path of a property shape. */\n    'path': 'http://www.w3.org/ns/shacl#path',\n    /** Specifies a regular expression pattern that the string representations of the value nodes must match. */\n    'pattern': 'http://www.w3.org/ns/shacl#pattern',\n    /** An expression producing the properties that shall be inferred as predicates. */\n    'predicate': 'http://www.w3.org/ns/shacl#predicate',\n    /** The prefix of a prefix declaration. */\n    'prefix': 'http://www.w3.org/ns/shacl#prefix',\n    /** The prefixes that shall be applied before parsing the associated SPARQL query. */\n    'prefixes': 'http://www.w3.org/ns/shacl#prefixes',\n    /** Links a shape to its property shapes. */\n    'property': 'http://www.w3.org/ns/shacl#property',\n    /** The validator(s) used to evaluate a constraint in the context of a property shape. */\n    'propertyValidator': 'http://www.w3.org/ns/shacl#propertyValidator',\n    /** The maximum number of value nodes that can conform to the shape. */\n    'qualifiedMaxCount': 'http://www.w3.org/ns/shacl#qualifiedMaxCount',\n    /** The minimum number of value nodes that must conform to the shape. */\n    'qualifiedMinCount': 'http://www.w3.org/ns/shacl#qualifiedMinCount',\n    /** The shape that a specified number of values must conform to. */\n    'qualifiedValueShape': 'http://www.w3.org/ns/shacl#qualifiedValueShape',\n    /** Can be used to mark the qualified value shape to be disjoint with its sibling shapes. */\n    'qualifiedValueShapesDisjoint': 'http://www.w3.org/ns/shacl#qualifiedValueShapesDisjoint',\n    /** The validation results contained in a validation report. */\n    'result': 'http://www.w3.org/ns/shacl#result',\n    /** Links a SPARQL validator with zero or more sh:ResultAnnotation instances, defining how to derive additional result properties based on the variables of the SELECT query. */\n    'resultAnnotation': 'http://www.w3.org/ns/shacl#resultAnnotation',\n    /** Human-readable messages explaining the cause of the result. */\n    'resultMessage': 'http://www.w3.org/ns/shacl#resultMessage',\n    /** The path of a validation result, based on the path of the validated property shape. */\n    'resultPath': 'http://www.w3.org/ns/shacl#resultPath',\n    /** The severity of the result, e.g. warning. */\n    'resultSeverity': 'http://www.w3.org/ns/shacl#resultSeverity',\n    /** The expected type of values returned by the associated function. */\n    'returnType': 'http://www.w3.org/ns/shacl#returnType',\n    /** The rules linked to a shape. */\n    'rule': 'http://www.w3.org/ns/shacl#rule',\n    /** The SPARQL SELECT query to execute. */\n    'select': 'http://www.w3.org/ns/shacl#select',\n    /** Defines the severity that validation results produced by a shape must have. Defaults to sh:Violation. */\n    'severity': 'http://www.w3.org/ns/shacl#severity',\n    /** Shapes graphs that should be used when validating this data graph. */\n    'shapesGraph': 'http://www.w3.org/ns/shacl#shapesGraph',\n    /** If true then the validation engine was certain that the shapes graph has passed all SHACL syntax requirements during the validation process. */\n    'shapesGraphWellFormed': 'http://www.w3.org/ns/shacl#shapesGraphWellFormed',\n    /** The constraint that was validated when the result was produced. */\n    'sourceConstraint': 'http://www.w3.org/ns/shacl#sourceConstraint',\n    /** The constraint component that is the source of the result. */\n    'sourceConstraintComponent': 'http://www.w3.org/ns/shacl#sourceConstraintComponent',\n    /** The shape that is was validated when the result was produced. */\n    'sourceShape': 'http://www.w3.org/ns/shacl#sourceShape',\n    /** Links a shape with SPARQL constraints. */\n    'sparql': 'http://www.w3.org/ns/shacl#sparql',\n    /** An expression producing the resources that shall be inferred as subjects. */\n    'subject': 'http://www.w3.org/ns/shacl#subject',\n    /** Suggested shapes graphs for this ontology. The values of this property may be used in the absence of specific sh:shapesGraph statements. */\n    'suggestedShapesGraph': 'http://www.w3.org/ns/shacl#suggestedShapesGraph',\n    /** Links a shape to a target specified by an extension language, for example instances of sh:SPARQLTarget. */\n    'target': 'http://www.w3.org/ns/shacl#target',\n    /** Links a shape to a class, indicating that all instances of the class must conform to the shape. */\n    'targetClass': 'http://www.w3.org/ns/shacl#targetClass',\n    /** Links a shape to individual nodes, indicating that these nodes must conform to the shape. */\n    'targetNode': 'http://www.w3.org/ns/shacl#targetNode',\n    /** Links a shape to a property, indicating that all all objects of triples that have the given property as their predicate must conform to the shape. */\n    'targetObjectsOf': 'http://www.w3.org/ns/shacl#targetObjectsOf',\n    /** Links a shape to a property, indicating that all subjects of triples that have the given property as their predicate must conform to the shape. */\n    'targetSubjectsOf': 'http://www.w3.org/ns/shacl#targetSubjectsOf',\n    /** A node expression that represents the current focus node. */\n    'this': 'http://www.w3.org/ns/shacl#this',\n    /** A list of node expressions that shall be used together. */\n    'union': 'http://www.w3.org/ns/shacl#union',\n    /** Specifies whether all node values must have a unique (or no) language tag. */\n    'uniqueLang': 'http://www.w3.org/ns/shacl#uniqueLang',\n    /** The SPARQL UPDATE to execute. */\n    'update': 'http://www.w3.org/ns/shacl#update',\n    /** The validator(s) used to evaluate constraints of either node or property shapes. */\n    'validator': 'http://www.w3.org/ns/shacl#validator',\n    /** An RDF node that has caused the result. */\n    'value': 'http://www.w3.org/ns/shacl#value',\n    /** Specifies a list of shapes so that the value nodes must conform to exactly one of the shapes. */\n    'xone': 'http://www.w3.org/ns/shacl#xone',\n    /** The (single) value of this property represents a path that is matched zero or more times. */\n    'zeroOrMorePath': 'http://www.w3.org/ns/shacl#zeroOrMorePath',\n    /** The (single) value of this property represents a path that is matched zero or one times. */\n    'zeroOrOnePath': 'http://www.w3.org/ns/shacl#zeroOrOnePath',\n};\n/** Namespace URI of the sh vocabulary. */\nexports._sh = new n3.NamedNode('http://www.w3.org/ns/shacl#');\nexports.sh = {\n    /** The base class of validation results, typically not instantiated directly. */\n    'AbstractResult': new n3.NamedNode('http://www.w3.org/ns/shacl#AbstractResult'),\n    /** A constraint component that can be used to test whether a value node conforms to all members of a provided list of shapes. */\n    'AndConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#AndConstraintComponent'),\n    'AndConstraintComponent_and': new n3.NamedNode('http://www.w3.org/ns/shacl#AndConstraintComponent-and'),\n    /** The node kind of all blank nodes. */\n    'BlankNode': new n3.NamedNode('http://www.w3.org/ns/shacl#BlankNode'),\n    /** The node kind of all blank nodes or IRIs. */\n    'BlankNodeOrIRI': new n3.NamedNode('http://www.w3.org/ns/shacl#BlankNodeOrIRI'),\n    /** The node kind of all blank nodes or literals. */\n    'BlankNodeOrLiteral': new n3.NamedNode('http://www.w3.org/ns/shacl#BlankNodeOrLiteral'),\n    /** A constraint component that can be used to verify that each value node is an instance of a given type. */\n    'ClassConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#ClassConstraintComponent'),\n    'ClassConstraintComponent_class': new n3.NamedNode('http://www.w3.org/ns/shacl#ClassConstraintComponent-class'),\n    /** A constraint component that can be used to indicate that focus nodes must only have values for those properties that have been explicitly enumerated via sh:property/sh:path. */\n    'ClosedConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#ClosedConstraintComponent'),\n    'ClosedConstraintComponent_closed': new n3.NamedNode('http://www.w3.org/ns/shacl#ClosedConstraintComponent-closed'),\n    'ClosedConstraintComponent_ignoredProperties': new n3.NamedNode('http://www.w3.org/ns/shacl#ClosedConstraintComponent-ignoredProperties'),\n    /** The class of constraint components. */\n    'ConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#ConstraintComponent'),\n    /** A constraint component that can be used to restrict the datatype of all value nodes. */\n    'DatatypeConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#DatatypeConstraintComponent'),\n    'DatatypeConstraintComponent_datatype': new n3.NamedNode('http://www.w3.org/ns/shacl#DatatypeConstraintComponent-datatype'),\n    /** A constraint component that can be used to verify that the set of value nodes is disjoint with the the set of nodes that have the focus node as subject and the value of a given property as predicate. */\n    'DisjointConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#DisjointConstraintComponent'),\n    'DisjointConstraintComponent_disjoint': new n3.NamedNode('http://www.w3.org/ns/shacl#DisjointConstraintComponent-disjoint'),\n    /** A constraint component that can be used to verify that the set of value nodes is equal to the set of nodes that have the focus node as subject and the value of a given property as predicate. */\n    'EqualsConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#EqualsConstraintComponent'),\n    'EqualsConstraintComponent_equals': new n3.NamedNode('http://www.w3.org/ns/shacl#EqualsConstraintComponent-equals'),\n    /** A constraint component that can be used to verify that a given node expression produces true for all value nodes. */\n    'ExpressionConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#ExpressionConstraintComponent'),\n    'ExpressionConstraintComponent_expression': new n3.NamedNode('http://www.w3.org/ns/shacl#ExpressionConstraintComponent-expression'),\n    /** The class of SHACL functions. */\n    'Function': new n3.NamedNode('http://www.w3.org/ns/shacl#Function'),\n    /** A constraint component that can be used to verify that one of the value nodes is a given RDF node. */\n    'HasValueConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#HasValueConstraintComponent'),\n    'HasValueConstraintComponent_hasValue': new n3.NamedNode('http://www.w3.org/ns/shacl#HasValueConstraintComponent-hasValue'),\n    /** The node kind of all IRIs. */\n    'IRI': new n3.NamedNode('http://www.w3.org/ns/shacl#IRI'),\n    /** The node kind of all IRIs or literals. */\n    'IRIOrLiteral': new n3.NamedNode('http://www.w3.org/ns/shacl#IRIOrLiteral'),\n    /** A constraint component that can be used to exclusively enumerate the permitted value nodes. */\n    'InConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#InConstraintComponent'),\n    'InConstraintComponent_in': new n3.NamedNode('http://www.w3.org/ns/shacl#InConstraintComponent-in'),\n    /** The severity for an informational validation result. */\n    'Info': new n3.NamedNode('http://www.w3.org/ns/shacl#Info'),\n    /** The class of constraints backed by a JavaScript function. */\n    'JSConstraint': new n3.NamedNode('http://www.w3.org/ns/shacl#JSConstraint'),\n    'JSConstraint_js': new n3.NamedNode('http://www.w3.org/ns/shacl#JSConstraint-js'),\n    /** A constraint component with the parameter sh:js linking to a sh:JSConstraint containing a sh:script. */\n    'JSConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#JSConstraintComponent'),\n    /** Abstract base class of resources that declare an executable JavaScript. */\n    'JSExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#JSExecutable'),\n    /** The class of SHACL functions that execute a JavaScript function when called. */\n    'JSFunction': new n3.NamedNode('http://www.w3.org/ns/shacl#JSFunction'),\n    /** Represents a JavaScript library, typically identified by one or more URLs of files to include. */\n    'JSLibrary': new n3.NamedNode('http://www.w3.org/ns/shacl#JSLibrary'),\n    /** The class of SHACL rules expressed using JavaScript. */\n    'JSRule': new n3.NamedNode('http://www.w3.org/ns/shacl#JSRule'),\n    /** The class of targets that are based on JavaScript functions. */\n    'JSTarget': new n3.NamedNode('http://www.w3.org/ns/shacl#JSTarget'),\n    /** The (meta) class for parameterizable targets that are based on JavaScript functions. */\n    'JSTargetType': new n3.NamedNode('http://www.w3.org/ns/shacl#JSTargetType'),\n    /** A SHACL validator based on JavaScript. This can be used to declare SHACL constraint components that perform JavaScript-based validation when used. */\n    'JSValidator': new n3.NamedNode('http://www.w3.org/ns/shacl#JSValidator'),\n    /** A constraint component that can be used to enumerate language tags that all value nodes must have. */\n    'LanguageInConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#LanguageInConstraintComponent'),\n    'LanguageInConstraintComponent_languageIn': new n3.NamedNode('http://www.w3.org/ns/shacl#LanguageInConstraintComponent-languageIn'),\n    /** A constraint component that can be used to verify that each value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */\n    'LessThanConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#LessThanConstraintComponent'),\n    'LessThanConstraintComponent_lessThan': new n3.NamedNode('http://www.w3.org/ns/shacl#LessThanConstraintComponent-lessThan'),\n    /** A constraint component that can be used to verify that every value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate. */\n    'LessThanOrEqualsConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent'),\n    'LessThanOrEqualsConstraintComponent_lessThanOrEquals': new n3.NamedNode('http://www.w3.org/ns/shacl#LessThanOrEqualsConstraintComponent-lessThanOrEquals'),\n    /** The node kind of all literals. */\n    'Literal': new n3.NamedNode('http://www.w3.org/ns/shacl#Literal'),\n    /** A constraint component that can be used to restrict the maximum number of value nodes. */\n    'MaxCountConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxCountConstraintComponent'),\n    'MaxCountConstraintComponent_maxCount': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxCountConstraintComponent-maxCount'),\n    /** A constraint component that can be used to restrict the range of value nodes with a maximum exclusive value. */\n    'MaxExclusiveConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent'),\n    'MaxExclusiveConstraintComponent_maxExclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxExclusiveConstraintComponent-maxExclusive'),\n    /** A constraint component that can be used to restrict the range of value nodes with a maximum inclusive value. */\n    'MaxInclusiveConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent'),\n    'MaxInclusiveConstraintComponent_maxInclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxInclusiveConstraintComponent-maxInclusive'),\n    /** A constraint component that can be used to restrict the maximum string length of value nodes. */\n    'MaxLengthConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxLengthConstraintComponent'),\n    'MaxLengthConstraintComponent_maxLength': new n3.NamedNode('http://www.w3.org/ns/shacl#MaxLengthConstraintComponent-maxLength'),\n    /** A constraint component that can be used to restrict the minimum number of value nodes. */\n    'MinCountConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MinCountConstraintComponent'),\n    'MinCountConstraintComponent_minCount': new n3.NamedNode('http://www.w3.org/ns/shacl#MinCountConstraintComponent-minCount'),\n    /** A constraint component that can be used to restrict the range of value nodes with a minimum exclusive value. */\n    'MinExclusiveConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent'),\n    'MinExclusiveConstraintComponent_minExclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#MinExclusiveConstraintComponent-minExclusive'),\n    /** A constraint component that can be used to restrict the range of value nodes with a minimum inclusive value. */\n    'MinInclusiveConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MinInclusiveConstraintComponent'),\n    'MinInclusiveConstraintComponent_minInclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#MinInclusiveConstraintComponent-minInclusive'),\n    /** A constraint component that can be used to restrict the minimum string length of value nodes. */\n    'MinLengthConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#MinLengthConstraintComponent'),\n    'MinLengthConstraintComponent_minLength': new n3.NamedNode('http://www.w3.org/ns/shacl#MinLengthConstraintComponent-minLength'),\n    /** A constraint component that can be used to verify that all value nodes conform to the given node shape. */\n    'NodeConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeConstraintComponent'),\n    'NodeConstraintComponent_node': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeConstraintComponent-node'),\n    /** The class of all node kinds, including sh:BlankNode, sh:IRI, sh:Literal or the combinations of these: sh:BlankNodeOrIRI, sh:BlankNodeOrLiteral, sh:IRIOrLiteral. */\n    'NodeKind': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeKind'),\n    /** A constraint component that can be used to restrict the RDF node kind of each value node. */\n    'NodeKindConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeKindConstraintComponent'),\n    'NodeKindConstraintComponent_nodeKind': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeKindConstraintComponent-nodeKind'),\n    /** A node shape is a shape that specifies constraint that need to be met with respect to focus nodes. */\n    'NodeShape': new n3.NamedNode('http://www.w3.org/ns/shacl#NodeShape'),\n    /** A constraint component that can be used to verify that value nodes do not conform to a given shape. */\n    'NotConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#NotConstraintComponent'),\n    'NotConstraintComponent_not': new n3.NamedNode('http://www.w3.org/ns/shacl#NotConstraintComponent-not'),\n    /** A constraint component that can be used to restrict the value nodes so that they conform to at least one out of several provided shapes. */\n    'OrConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#OrConstraintComponent'),\n    'OrConstraintComponent_or': new n3.NamedNode('http://www.w3.org/ns/shacl#OrConstraintComponent-or'),\n    /** The class of parameter declarations, consisting of a path predicate and (possibly) information about allowed value type, cardinality and other characteristics. */\n    'Parameter': new n3.NamedNode('http://www.w3.org/ns/shacl#Parameter'),\n    /** Superclass of components that can take parameters, especially functions and constraint components. */\n    'Parameterizable': new n3.NamedNode('http://www.w3.org/ns/shacl#Parameterizable'),\n    /** A constraint component that can be used to verify that every value node matches a given regular expression. */\n    'PatternConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#PatternConstraintComponent'),\n    'PatternConstraintComponent_flags': new n3.NamedNode('http://www.w3.org/ns/shacl#PatternConstraintComponent-flags'),\n    'PatternConstraintComponent_pattern': new n3.NamedNode('http://www.w3.org/ns/shacl#PatternConstraintComponent-pattern'),\n    /** The class of prefix declarations, consisting of pairs of a prefix with a namespace. */\n    'PrefixDeclaration': new n3.NamedNode('http://www.w3.org/ns/shacl#PrefixDeclaration'),\n    /** A constraint component that can be used to verify that all value nodes conform to the given property shape. */\n    'PropertyConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#PropertyConstraintComponent'),\n    'PropertyConstraintComponent_property': new n3.NamedNode('http://www.w3.org/ns/shacl#PropertyConstraintComponent-property'),\n    /** Instances of this class represent groups of property shapes that belong together. */\n    'PropertyGroup': new n3.NamedNode('http://www.w3.org/ns/shacl#PropertyGroup'),\n    /** A property shape is a shape that specifies constraints on the values of a focus node for a given property or path. */\n    'PropertyShape': new n3.NamedNode('http://www.w3.org/ns/shacl#PropertyShape'),\n    /** A constraint component that can be used to verify that a specified maximum number of value nodes conforms to a given shape. */\n    'QualifiedMaxCountConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent'),\n    'QualifiedMaxCountConstraintComponent_qualifiedMaxCount': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedMaxCount'),\n    'QualifiedMaxCountConstraintComponent_qualifiedValueShape': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedValueShape'),\n    'QualifiedMaxCountConstraintComponent_qualifiedValueShapesDisjoint': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMaxCountConstraintComponent-qualifiedValueShapesDisjoint'),\n    /** A constraint component that can be used to verify that a specified minimum number of value nodes conforms to a given shape. */\n    'QualifiedMinCountConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent'),\n    'QualifiedMinCountConstraintComponent_qualifiedMinCount': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedMinCount'),\n    'QualifiedMinCountConstraintComponent_qualifiedValueShape': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedValueShape'),\n    'QualifiedMinCountConstraintComponent_qualifiedValueShapesDisjoint': new n3.NamedNode('http://www.w3.org/ns/shacl#QualifiedMinCountConstraintComponent-qualifiedValueShapesDisjoint'),\n    /** A class of result annotations, which define the rules to derive the values of a given annotation property as extra values for a validation result. */\n    'ResultAnnotation': new n3.NamedNode('http://www.w3.org/ns/shacl#ResultAnnotation'),\n    /** The class of SHACL rules. Never instantiated directly. */\n    'Rule': new n3.NamedNode('http://www.w3.org/ns/shacl#Rule'),\n    /** The class of SPARQL executables that are based on an ASK query. */\n    'SPARQLAskExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLAskExecutable'),\n    /** The class of validators based on SPARQL ASK queries. The queries are evaluated for each value node and are supposed to return true if the given node conforms. */\n    'SPARQLAskValidator': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLAskValidator'),\n    /** The class of constraints based on SPARQL SELECT queries. */\n    'SPARQLConstraint': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLConstraint'),\n    /** A constraint component that can be used to define constraints based on SPARQL queries. */\n    'SPARQLConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLConstraintComponent'),\n    'SPARQLConstraintComponent_sparql': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLConstraintComponent-sparql'),\n    /** The class of SPARQL executables that are based on a CONSTRUCT query. */\n    'SPARQLConstructExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLConstructExecutable'),\n    /** The class of resources that encapsulate a SPARQL query. */\n    'SPARQLExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLExecutable'),\n    /** A function backed by a SPARQL query - either ASK or SELECT. */\n    'SPARQLFunction': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLFunction'),\n    /** The class of SHACL rules based on SPARQL CONSTRUCT queries. */\n    'SPARQLRule': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLRule'),\n    /** The class of SPARQL executables based on a SELECT query. */\n    'SPARQLSelectExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLSelectExecutable'),\n    /** The class of validators based on SPARQL SELECT queries. The queries are evaluated for each focus node and are supposed to produce bindings for all focus nodes that do not conform. */\n    'SPARQLSelectValidator': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLSelectValidator'),\n    /** The class of targets that are based on SPARQL queries. */\n    'SPARQLTarget': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLTarget'),\n    /** The (meta) class for parameterizable targets that are based on SPARQL queries. */\n    'SPARQLTargetType': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLTargetType'),\n    /** The class of SPARQL executables based on a SPARQL UPDATE. */\n    'SPARQLUpdateExecutable': new n3.NamedNode('http://www.w3.org/ns/shacl#SPARQLUpdateExecutable'),\n    /** The class of validation result severity levels, including violation and warning levels. */\n    'Severity': new n3.NamedNode('http://www.w3.org/ns/shacl#Severity'),\n    /** A shape is a collection of constraints that may be targeted for certain nodes. */\n    'Shape': new n3.NamedNode('http://www.w3.org/ns/shacl#Shape'),\n    /** The base class of targets such as those based on SPARQL queries. */\n    'Target': new n3.NamedNode('http://www.w3.org/ns/shacl#Target'),\n    /** The (meta) class for parameterizable targets.\tInstances of this are instantiated as values of the sh:target property. */\n    'TargetType': new n3.NamedNode('http://www.w3.org/ns/shacl#TargetType'),\n    /** A rule based on triple (subject, predicate, object) pattern. */\n    'TripleRule': new n3.NamedNode('http://www.w3.org/ns/shacl#TripleRule'),\n    /** A constraint component that can be used to specify that no pair of value nodes may use the same language tag. */\n    'UniqueLangConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#UniqueLangConstraintComponent'),\n    'UniqueLangConstraintComponent_uniqueLang': new n3.NamedNode('http://www.w3.org/ns/shacl#UniqueLangConstraintComponent-uniqueLang'),\n    /** The class of SHACL validation reports. */\n    'ValidationReport': new n3.NamedNode('http://www.w3.org/ns/shacl#ValidationReport'),\n    /** The class of validation results. */\n    'ValidationResult': new n3.NamedNode('http://www.w3.org/ns/shacl#ValidationResult'),\n    /** The class of validators, which provide instructions on how to process a constraint definition. This class serves as base class for the SPARQL-based validators and other possible implementations. */\n    'Validator': new n3.NamedNode('http://www.w3.org/ns/shacl#Validator'),\n    /** The severity for a violation validation result. */\n    'Violation': new n3.NamedNode('http://www.w3.org/ns/shacl#Violation'),\n    /** The severity for a warning validation result. */\n    'Warning': new n3.NamedNode('http://www.w3.org/ns/shacl#Warning'),\n    /** A constraint component that can be used to restrict the value nodes so that they conform to exactly one out of several provided shapes. */\n    'XoneConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#XoneConstraintComponent'),\n    'XoneConstraintComponent_xone': new n3.NamedNode('http://www.w3.org/ns/shacl#XoneConstraintComponent-xone'),\n    /** The (single) value of this property must be a list of path elements, representing the elements of alternative paths. */\n    'alternativePath': new n3.NamedNode('http://www.w3.org/ns/shacl#alternativePath'),\n    /** RDF list of shapes to validate the value nodes against. */\n    'and': new n3.NamedNode('http://www.w3.org/ns/shacl#and'),\n    /** The annotation property that shall be set. */\n    'annotationProperty': new n3.NamedNode('http://www.w3.org/ns/shacl#annotationProperty'),\n    /** The (default) values of the annotation property. */\n    'annotationValue': new n3.NamedNode('http://www.w3.org/ns/shacl#annotationValue'),\n    /** The name of the SPARQL variable from the SELECT clause that shall be used for the values. */\n    'annotationVarName': new n3.NamedNode('http://www.w3.org/ns/shacl#annotationVarName'),\n    /** The SPARQL ASK query to execute. */\n    'ask': new n3.NamedNode('http://www.w3.org/ns/shacl#ask'),\n    /** The type that all value nodes must have. */\n    'class': new n3.NamedNode('http://www.w3.org/ns/shacl#class'),\n    /** If set to true then the shape is closed. */\n    'closed': new n3.NamedNode('http://www.w3.org/ns/shacl#closed'),\n    /** The shapes that the focus nodes need to conform to before a rule is executed on them. */\n    'condition': new n3.NamedNode('http://www.w3.org/ns/shacl#condition'),\n    /** True if the validation did not produce any validation results, and false otherwise. */\n    'conforms': new n3.NamedNode('http://www.w3.org/ns/shacl#conforms'),\n    /** The SPARQL CONSTRUCT query to execute. */\n    'construct': new n3.NamedNode('http://www.w3.org/ns/shacl#construct'),\n    /** Specifies an RDF datatype that all value nodes must have. */\n    'datatype': new n3.NamedNode('http://www.w3.org/ns/shacl#datatype'),\n    /** If set to true then all nodes conform to this. */\n    'deactivated': new n3.NamedNode('http://www.w3.org/ns/shacl#deactivated'),\n    /** Links a resource with its namespace prefix declarations. */\n    'declare': new n3.NamedNode('http://www.w3.org/ns/shacl#declare'),\n    /** A default value for a property, for example for user interface tools to pre-populate input fields. */\n    'defaultValue': new n3.NamedNode('http://www.w3.org/ns/shacl#defaultValue'),\n    /** Human-readable descriptions for the property in the context of the surrounding shape. */\n    'description': new n3.NamedNode('http://www.w3.org/ns/shacl#description'),\n    /** Links a result with other results that provide more details, for example to describe violations against nested shapes. */\n    'detail': new n3.NamedNode('http://www.w3.org/ns/shacl#detail'),\n    /** Specifies a property where the set of values must be disjoint with the value nodes. */\n    'disjoint': new n3.NamedNode('http://www.w3.org/ns/shacl#disjoint'),\n    /** An entailment regime that indicates what kind of inferencing is required by a shapes graph. */\n    'entailment': new n3.NamedNode('http://www.w3.org/ns/shacl#entailment'),\n    /** Specifies a property that must have the same values as the value nodes. */\n    'equals': new n3.NamedNode('http://www.w3.org/ns/shacl#equals'),\n    /** The node expression that must return true for the value nodes. */\n    'expression': new n3.NamedNode('http://www.w3.org/ns/shacl#expression'),\n    /** The shape that all input nodes of the expression need to conform to. */\n    'filterShape': new n3.NamedNode('http://www.w3.org/ns/shacl#filterShape'),\n    /** An optional flag to be used with regular expression pattern matching. */\n    'flags': new n3.NamedNode('http://www.w3.org/ns/shacl#flags'),\n    /** The focus node that was validated when the result was produced. */\n    'focusNode': new n3.NamedNode('http://www.w3.org/ns/shacl#focusNode'),\n    /** Can be used to link to a property group to indicate that a property shape belongs to a group of related property shapes. */\n    'group': new n3.NamedNode('http://www.w3.org/ns/shacl#group'),\n    /** Specifies a value that must be among the value nodes. */\n    'hasValue': new n3.NamedNode('http://www.w3.org/ns/shacl#hasValue'),\n    /** An optional RDF list of properties that are also permitted in addition to those explicitly enumerated via sh:property/sh:path. */\n    'ignoredProperties': new n3.NamedNode('http://www.w3.org/ns/shacl#ignoredProperties'),\n    /** Specifies a list of allowed values so that each value node must be among the members of the given list. */\n    'in': new n3.NamedNode('http://www.w3.org/ns/shacl#in'),\n    /** A list of node expressions that shall be intersected. */\n    'intersection': new n3.NamedNode('http://www.w3.org/ns/shacl#intersection'),\n    /** The (single) value of this property represents an inverse path (object to subject). */\n    'inversePath': new n3.NamedNode('http://www.w3.org/ns/shacl#inversePath'),\n    /** Constraints expressed in JavaScript. */\n    'js': new n3.NamedNode('http://www.w3.org/ns/shacl#js'),\n    /** The name of the JavaScript function to execute. */\n    'jsFunctionName': new n3.NamedNode('http://www.w3.org/ns/shacl#jsFunctionName'),\n    /** Declares which JavaScript libraries are needed to execute this. */\n    'jsLibrary': new n3.NamedNode('http://www.w3.org/ns/shacl#jsLibrary'),\n    /** Declares the URLs of a JavaScript library. This should be the absolute URL of a JavaScript file. Implementations may redirect those to local files. */\n    'jsLibraryURL': new n3.NamedNode('http://www.w3.org/ns/shacl#jsLibraryURL'),\n    /** Outlines how human-readable labels of instances of the associated Parameterizable shall be produced. The values can contain {?paramName} as placeholders for the actual values of the given parameter. */\n    'labelTemplate': new n3.NamedNode('http://www.w3.org/ns/shacl#labelTemplate'),\n    /** Specifies a list of language tags that all value nodes must have. */\n    'languageIn': new n3.NamedNode('http://www.w3.org/ns/shacl#languageIn'),\n    /** Specifies a property that must have smaller values than the value nodes. */\n    'lessThan': new n3.NamedNode('http://www.w3.org/ns/shacl#lessThan'),\n    /** Specifies a property that must have smaller or equal values than the value nodes. */\n    'lessThanOrEquals': new n3.NamedNode('http://www.w3.org/ns/shacl#lessThanOrEquals'),\n    /** Specifies the maximum number of values in the set of value nodes. */\n    'maxCount': new n3.NamedNode('http://www.w3.org/ns/shacl#maxCount'),\n    /** Specifies the maximum exclusive value of each value node. */\n    'maxExclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#maxExclusive'),\n    /** Specifies the maximum inclusive value of each value node. */\n    'maxInclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#maxInclusive'),\n    /** Specifies the maximum string length of each value node. */\n    'maxLength': new n3.NamedNode('http://www.w3.org/ns/shacl#maxLength'),\n    /** A human-readable message (possibly with placeholders for variables) explaining the cause of the result. */\n    'message': new n3.NamedNode('http://www.w3.org/ns/shacl#message'),\n    /** Specifies the minimum number of values in the set of value nodes. */\n    'minCount': new n3.NamedNode('http://www.w3.org/ns/shacl#minCount'),\n    /** Specifies the minimum exclusive value of each value node. */\n    'minExclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#minExclusive'),\n    /** Specifies the minimum inclusive value of each value node. */\n    'minInclusive': new n3.NamedNode('http://www.w3.org/ns/shacl#minInclusive'),\n    /** Specifies the minimum string length of each value node. */\n    'minLength': new n3.NamedNode('http://www.w3.org/ns/shacl#minLength'),\n    /** Human-readable labels for the property in the context of the surrounding shape. */\n    'name': new n3.NamedNode('http://www.w3.org/ns/shacl#name'),\n    /** The namespace associated with a prefix in a prefix declaration. */\n    'namespace': new n3.NamedNode('http://www.w3.org/ns/shacl#namespace'),\n    /** Specifies the node shape that all value nodes must conform to. */\n    'node': new n3.NamedNode('http://www.w3.org/ns/shacl#node'),\n    /** Specifies the node kind (e.g. IRI or literal) each value node. */\n    'nodeKind': new n3.NamedNode('http://www.w3.org/ns/shacl#nodeKind'),\n    /** The validator(s) used to evaluate a constraint in the context of a node shape. */\n    'nodeValidator': new n3.NamedNode('http://www.w3.org/ns/shacl#nodeValidator'),\n    /** The node expression producing the input nodes of a filter shape expression. */\n    'nodes': new n3.NamedNode('http://www.w3.org/ns/shacl#nodes'),\n    /** Specifies a shape that the value nodes must not conform to. */\n    'not': new n3.NamedNode('http://www.w3.org/ns/shacl#not'),\n    /** An expression producing the nodes that shall be inferred as objects. */\n    'object': new n3.NamedNode('http://www.w3.org/ns/shacl#object'),\n    /** The (single) value of this property represents a path that is matched one or more times. */\n    'oneOrMorePath': new n3.NamedNode('http://www.w3.org/ns/shacl#oneOrMorePath'),\n    /** Indicates whether a parameter is optional. */\n    'optional': new n3.NamedNode('http://www.w3.org/ns/shacl#optional'),\n    /** Specifies a list of shapes so that the value nodes must conform to at least one of the shapes. */\n    'or': new n3.NamedNode('http://www.w3.org/ns/shacl#or'),\n    /** Specifies the relative order of this compared to its siblings. For example use 0 for the first, 1 for the second. */\n    'order': new n3.NamedNode('http://www.w3.org/ns/shacl#order'),\n    /** The parameters of a function or constraint component. */\n    'parameter': new n3.NamedNode('http://www.w3.org/ns/shacl#parameter'),\n    /** Specifies the property path of a property shape. */\n    'path': new n3.NamedNode('http://www.w3.org/ns/shacl#path'),\n    /** Specifies a regular expression pattern that the string representations of the value nodes must match. */\n    'pattern': new n3.NamedNode('http://www.w3.org/ns/shacl#pattern'),\n    /** An expression producing the properties that shall be inferred as predicates. */\n    'predicate': new n3.NamedNode('http://www.w3.org/ns/shacl#predicate'),\n    /** The prefix of a prefix declaration. */\n    'prefix': new n3.NamedNode('http://www.w3.org/ns/shacl#prefix'),\n    /** The prefixes that shall be applied before parsing the associated SPARQL query. */\n    'prefixes': new n3.NamedNode('http://www.w3.org/ns/shacl#prefixes'),\n    /** Links a shape to its property shapes. */\n    'property': new n3.NamedNode('http://www.w3.org/ns/shacl#property'),\n    /** The validator(s) used to evaluate a constraint in the context of a property shape. */\n    'propertyValidator': new n3.NamedNode('http://www.w3.org/ns/shacl#propertyValidator'),\n    /** The maximum number of value nodes that can conform to the shape. */\n    'qualifiedMaxCount': new n3.NamedNode('http://www.w3.org/ns/shacl#qualifiedMaxCount'),\n    /** The minimum number of value nodes that must conform to the shape. */\n    'qualifiedMinCount': new n3.NamedNode('http://www.w3.org/ns/shacl#qualifiedMinCount'),\n    /** The shape that a specified number of values must conform to. */\n    'qualifiedValueShape': new n3.NamedNode('http://www.w3.org/ns/shacl#qualifiedValueShape'),\n    /** Can be used to mark the qualified value shape to be disjoint with its sibling shapes. */\n    'qualifiedValueShapesDisjoint': new n3.NamedNode('http://www.w3.org/ns/shacl#qualifiedValueShapesDisjoint'),\n    /** The validation results contained in a validation report. */\n    'result': new n3.NamedNode('http://www.w3.org/ns/shacl#result'),\n    /** Links a SPARQL validator with zero or more sh:ResultAnnotation instances, defining how to derive additional result properties based on the variables of the SELECT query. */\n    'resultAnnotation': new n3.NamedNode('http://www.w3.org/ns/shacl#resultAnnotation'),\n    /** Human-readable messages explaining the cause of the result. */\n    'resultMessage': new n3.NamedNode('http://www.w3.org/ns/shacl#resultMessage'),\n    /** The path of a validation result, based on the path of the validated property shape. */\n    'resultPath': new n3.NamedNode('http://www.w3.org/ns/shacl#resultPath'),\n    /** The severity of the result, e.g. warning. */\n    'resultSeverity': new n3.NamedNode('http://www.w3.org/ns/shacl#resultSeverity'),\n    /** The expected type of values returned by the associated function. */\n    'returnType': new n3.NamedNode('http://www.w3.org/ns/shacl#returnType'),\n    /** The rules linked to a shape. */\n    'rule': new n3.NamedNode('http://www.w3.org/ns/shacl#rule'),\n    /** The SPARQL SELECT query to execute. */\n    'select': new n3.NamedNode('http://www.w3.org/ns/shacl#select'),\n    /** Defines the severity that validation results produced by a shape must have. Defaults to sh:Violation. */\n    'severity': new n3.NamedNode('http://www.w3.org/ns/shacl#severity'),\n    /** Shapes graphs that should be used when validating this data graph. */\n    'shapesGraph': new n3.NamedNode('http://www.w3.org/ns/shacl#shapesGraph'),\n    /** If true then the validation engine was certain that the shapes graph has passed all SHACL syntax requirements during the validation process. */\n    'shapesGraphWellFormed': new n3.NamedNode('http://www.w3.org/ns/shacl#shapesGraphWellFormed'),\n    /** The constraint that was validated when the result was produced. */\n    'sourceConstraint': new n3.NamedNode('http://www.w3.org/ns/shacl#sourceConstraint'),\n    /** The constraint component that is the source of the result. */\n    'sourceConstraintComponent': new n3.NamedNode('http://www.w3.org/ns/shacl#sourceConstraintComponent'),\n    /** The shape that is was validated when the result was produced. */\n    'sourceShape': new n3.NamedNode('http://www.w3.org/ns/shacl#sourceShape'),\n    /** Links a shape with SPARQL constraints. */\n    'sparql': new n3.NamedNode('http://www.w3.org/ns/shacl#sparql'),\n    /** An expression producing the resources that shall be inferred as subjects. */\n    'subject': new n3.NamedNode('http://www.w3.org/ns/shacl#subject'),\n    /** Suggested shapes graphs for this ontology. The values of this property may be used in the absence of specific sh:shapesGraph statements. */\n    'suggestedShapesGraph': new n3.NamedNode('http://www.w3.org/ns/shacl#suggestedShapesGraph'),\n    /** Links a shape to a target specified by an extension language, for example instances of sh:SPARQLTarget. */\n    'target': new n3.NamedNode('http://www.w3.org/ns/shacl#target'),\n    /** Links a shape to a class, indicating that all instances of the class must conform to the shape. */\n    'targetClass': new n3.NamedNode('http://www.w3.org/ns/shacl#targetClass'),\n    /** Links a shape to individual nodes, indicating that these nodes must conform to the shape. */\n    'targetNode': new n3.NamedNode('http://www.w3.org/ns/shacl#targetNode'),\n    /** Links a shape to a property, indicating that all all objects of triples that have the given property as their predicate must conform to the shape. */\n    'targetObjectsOf': new n3.NamedNode('http://www.w3.org/ns/shacl#targetObjectsOf'),\n    /** Links a shape to a property, indicating that all subjects of triples that have the given property as their predicate must conform to the shape. */\n    'targetSubjectsOf': new n3.NamedNode('http://www.w3.org/ns/shacl#targetSubjectsOf'),\n    /** A node expression that represents the current focus node. */\n    'this': new n3.NamedNode('http://www.w3.org/ns/shacl#this'),\n    /** A list of node expressions that shall be used together. */\n    'union': new n3.NamedNode('http://www.w3.org/ns/shacl#union'),\n    /** Specifies whether all node values must have a unique (or no) language tag. */\n    'uniqueLang': new n3.NamedNode('http://www.w3.org/ns/shacl#uniqueLang'),\n    /** The SPARQL UPDATE to execute. */\n    'update': new n3.NamedNode('http://www.w3.org/ns/shacl#update'),\n    /** The validator(s) used to evaluate constraints of either node or property shapes. */\n    'validator': new n3.NamedNode('http://www.w3.org/ns/shacl#validator'),\n    /** An RDF node that has caused the result. */\n    'value': new n3.NamedNode('http://www.w3.org/ns/shacl#value'),\n    /** Specifies a list of shapes so that the value nodes must conform to exactly one of the shapes. */\n    'xone': new n3.NamedNode('http://www.w3.org/ns/shacl#xone'),\n    /** The (single) value of this property represents a path that is matched zero or more times. */\n    'zeroOrMorePath': new n3.NamedNode('http://www.w3.org/ns/shacl#zeroOrMorePath'),\n    /** The (single) value of this property represents a path that is matched zero or one times. */\n    'zeroOrOnePath': new n3.NamedNode('http://www.w3.org/ns/shacl#zeroOrOnePath'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/sh.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/skos-xl.ts":
+/*!***********************************!*\
+  !*** ./src/ontologies/skos-xl.ts ***!
+  \***********************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.skos_xl = exports._skos_xl = exports.SKOS_XL = exports._SKOS_XL = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the SKOS_XL vocabulary. */\nexports._SKOS_XL = 'http://www.w3.org/2008/05/skos-xl#';\nexports.SKOS_XL = {\n    'skos_xl': 'http://www.w3.org/2008/05/skos-xl',\n    /** A special class of lexical entities. */\n    'Label': 'http://www.w3.org/2008/05/skos-xl#Label',\n    /** The property skosxl:altLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:altLabel. */\n    'altLabel': 'http://www.w3.org/2008/05/skos-xl#altLabel',\n    /** The property skosxl:hiddenLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:hiddenLabel. */\n    'hiddenLabel': 'http://www.w3.org/2008/05/skos-xl#hiddenLabel',\n    /** The property skosxl:labelRelation is used for representing binary ('direct') relations between instances of the class skosxl:Label. */\n    'labelRelation': 'http://www.w3.org/2008/05/skos-xl#labelRelation',\n    /** The property skosxl:literalForm is used to give the literal form of an skosxl:Label. */\n    'literalForm': 'http://www.w3.org/2008/05/skos-xl#literalForm',\n    /** The property skosxl:prefLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:prefLabel. */\n    'prefLabel': 'http://www.w3.org/2008/05/skos-xl#prefLabel',\n};\n/** Namespace URI of the skos_xl vocabulary. */\nexports._skos_xl = new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#');\nexports.skos_xl = {\n    'skos_xl': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl'),\n    /** A special class of lexical entities. */\n    'Label': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#Label'),\n    /** The property skosxl:altLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:altLabel. */\n    'altLabel': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#altLabel'),\n    /** The property skosxl:hiddenLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:hiddenLabel. */\n    'hiddenLabel': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#hiddenLabel'),\n    /** The property skosxl:labelRelation is used for representing binary ('direct') relations between instances of the class skosxl:Label. */\n    'labelRelation': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#labelRelation'),\n    /** The property skosxl:literalForm is used to give the literal form of an skosxl:Label. */\n    'literalForm': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#literalForm'),\n    /** The property skosxl:prefLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:prefLabel. */\n    'prefLabel': new n3.NamedNode('http://www.w3.org/2008/05/skos-xl#prefLabel'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/skos-xl.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/skos.ts":
+/*!********************************!*\
+  !*** ./src/ontologies/skos.ts ***!
+  \********************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.skos = exports._skos = exports.SKOS = exports._SKOS = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the SKOS vocabulary. */\nexports._SKOS = 'http://www.w3.org/2004/02/skos/core#';\nexports.SKOS = {\n    'core': 'http://www.w3.org/2004/02/skos/core',\n    /** A meaningful collection of concepts. */\n    'Collection': 'http://www.w3.org/2004/02/skos/core#Collection',\n    /** An idea or notion; a unit of thought. */\n    'Concept': 'http://www.w3.org/2004/02/skos/core#Concept',\n    /** A set of concepts, optionally including statements about semantic relationships between those concepts. */\n    'ConceptScheme': 'http://www.w3.org/2004/02/skos/core#ConceptScheme',\n    /** An ordered collection of concepts, where both the grouping and the ordering are meaningful. */\n    'OrderedCollection': 'http://www.w3.org/2004/02/skos/core#OrderedCollection',\n    /** An alternative lexical label for a resource. */\n    'altLabel': 'http://www.w3.org/2004/02/skos/core#altLabel',\n    /** skos:broadMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */\n    'broadMatch': 'http://www.w3.org/2004/02/skos/core#broadMatch',\n    /** Relates a concept to a concept that is more general in meaning. */\n    'broader': 'http://www.w3.org/2004/02/skos/core#broader',\n    /** 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. */\n    'broaderTransitive': 'http://www.w3.org/2004/02/skos/core#broaderTransitive',\n    /** A note about a modification to a concept. */\n    'changeNote': 'http://www.w3.org/2004/02/skos/core#changeNote',\n    /** skos:closeMatch is used to link two concepts that are sufficiently similar that they can be used interchangeably in some information retrieval applications. In order to avoid the possibility of \"compound errors\" when combining mappings across more than two concept schemes, skos:closeMatch is not declared to be a transitive property. */\n    'closeMatch': 'http://www.w3.org/2004/02/skos/core#closeMatch',\n    /** A statement or formal explanation of the meaning of a concept. */\n    'definition': 'http://www.w3.org/2004/02/skos/core#definition',\n    /** A note for an editor, translator or maintainer of the vocabulary. */\n    'editorialNote': 'http://www.w3.org/2004/02/skos/core#editorialNote',\n    /** skos:exactMatch is used to link two concepts, indicating a high degree of confidence that the concepts can be used interchangeably across a wide range of information retrieval applications. skos:exactMatch is a transitive property, and is a sub-property of skos:closeMatch. */\n    'exactMatch': 'http://www.w3.org/2004/02/skos/core#exactMatch',\n    /** An example of the use of a concept. */\n    'example': 'http://www.w3.org/2004/02/skos/core#example',\n    /** Relates, by convention, a concept scheme to a concept which is topmost in the broader/narrower concept hierarchies for that scheme, providing an entry point to these hierarchies. */\n    'hasTopConcept': 'http://www.w3.org/2004/02/skos/core#hasTopConcept',\n    /** A lexical label for a resource that should be hidden when generating visual displays of the resource, but should still be accessible to free text search operations. */\n    'hiddenLabel': 'http://www.w3.org/2004/02/skos/core#hiddenLabel',\n    /** A note about the past state/use/meaning of a concept. */\n    'historyNote': 'http://www.w3.org/2004/02/skos/core#historyNote',\n    /** Relates a resource (for example a concept) to a concept scheme in which it is included. */\n    'inScheme': 'http://www.w3.org/2004/02/skos/core#inScheme',\n    /** Relates two concepts coming, by convention, from different schemes, and that have comparable meanings */\n    'mappingRelation': 'http://www.w3.org/2004/02/skos/core#mappingRelation',\n    /** Relates a collection to one of its members. */\n    'member': 'http://www.w3.org/2004/02/skos/core#member',\n    /** Relates an ordered collection to the RDF list containing its members. */\n    'memberList': 'http://www.w3.org/2004/02/skos/core#memberList',\n    /** skos:narrowMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */\n    'narrowMatch': 'http://www.w3.org/2004/02/skos/core#narrowMatch',\n    /** Relates a concept to a concept that is more specific in meaning. */\n    'narrower': 'http://www.w3.org/2004/02/skos/core#narrower',\n    /** 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. */\n    'narrowerTransitive': 'http://www.w3.org/2004/02/skos/core#narrowerTransitive',\n    /** 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. */\n    'notation': 'http://www.w3.org/2004/02/skos/core#notation',\n    /** A general note, for any purpose. */\n    'note': 'http://www.w3.org/2004/02/skos/core#note',\n    /** The preferred lexical label for a resource, in a given language. */\n    'prefLabel': 'http://www.w3.org/2004/02/skos/core#prefLabel',\n    /** Relates a concept to a concept with which there is an associative semantic relationship. */\n    'related': 'http://www.w3.org/2004/02/skos/core#related',\n    /** skos:relatedMatch is used to state an associative mapping link between two conceptual resources in different concept schemes. */\n    'relatedMatch': 'http://www.w3.org/2004/02/skos/core#relatedMatch',\n    /** A note that helps to clarify the meaning and/or the use of a concept. */\n    'scopeNote': 'http://www.w3.org/2004/02/skos/core#scopeNote',\n    /** Links a concept to a concept related by meaning. */\n    'semanticRelation': 'http://www.w3.org/2004/02/skos/core#semanticRelation',\n    /** Relates a concept to the concept scheme that it is a top level concept of. */\n    'topConceptOf': 'http://www.w3.org/2004/02/skos/core#topConceptOf',\n};\n/** Namespace URI of the skos vocabulary. */\nexports._skos = new n3.NamedNode('http://www.w3.org/2004/02/skos/core#');\nexports.skos = {\n    'core': new n3.NamedNode('http://www.w3.org/2004/02/skos/core'),\n    /** A meaningful collection of concepts. */\n    'Collection': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#Collection'),\n    /** An idea or notion; a unit of thought. */\n    'Concept': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#Concept'),\n    /** A set of concepts, optionally including statements about semantic relationships between those concepts. */\n    'ConceptScheme': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#ConceptScheme'),\n    /** An ordered collection of concepts, where both the grouping and the ordering are meaningful. */\n    'OrderedCollection': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#OrderedCollection'),\n    /** An alternative lexical label for a resource. */\n    'altLabel': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#altLabel'),\n    /** skos:broadMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */\n    'broadMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broadMatch'),\n    /** Relates a concept to a concept that is more general in meaning. */\n    'broader': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broader'),\n    /** 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. */\n    'broaderTransitive': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#broaderTransitive'),\n    /** A note about a modification to a concept. */\n    'changeNote': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#changeNote'),\n    /** skos:closeMatch is used to link two concepts that are sufficiently similar that they can be used interchangeably in some information retrieval applications. In order to avoid the possibility of \"compound errors\" when combining mappings across more than two concept schemes, skos:closeMatch is not declared to be a transitive property. */\n    'closeMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#closeMatch'),\n    /** A statement or formal explanation of the meaning of a concept. */\n    'definition': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#definition'),\n    /** A note for an editor, translator or maintainer of the vocabulary. */\n    'editorialNote': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#editorialNote'),\n    /** skos:exactMatch is used to link two concepts, indicating a high degree of confidence that the concepts can be used interchangeably across a wide range of information retrieval applications. skos:exactMatch is a transitive property, and is a sub-property of skos:closeMatch. */\n    'exactMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#exactMatch'),\n    /** An example of the use of a concept. */\n    'example': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#example'),\n    /** Relates, by convention, a concept scheme to a concept which is topmost in the broader/narrower concept hierarchies for that scheme, providing an entry point to these hierarchies. */\n    'hasTopConcept': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#hasTopConcept'),\n    /** A lexical label for a resource that should be hidden when generating visual displays of the resource, but should still be accessible to free text search operations. */\n    'hiddenLabel': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#hiddenLabel'),\n    /** A note about the past state/use/meaning of a concept. */\n    'historyNote': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#historyNote'),\n    /** Relates a resource (for example a concept) to a concept scheme in which it is included. */\n    'inScheme': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#inScheme'),\n    /** Relates two concepts coming, by convention, from different schemes, and that have comparable meanings */\n    'mappingRelation': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#mappingRelation'),\n    /** Relates a collection to one of its members. */\n    'member': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#member'),\n    /** Relates an ordered collection to the RDF list containing its members. */\n    'memberList': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#memberList'),\n    /** skos:narrowMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes. */\n    'narrowMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrowMatch'),\n    /** Relates a concept to a concept that is more specific in meaning. */\n    'narrower': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrower'),\n    /** 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. */\n    'narrowerTransitive': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#narrowerTransitive'),\n    /** 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. */\n    'notation': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#notation'),\n    /** A general note, for any purpose. */\n    'note': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#note'),\n    /** The preferred lexical label for a resource, in a given language. */\n    'prefLabel': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#prefLabel'),\n    /** Relates a concept to a concept with which there is an associative semantic relationship. */\n    'related': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#related'),\n    /** skos:relatedMatch is used to state an associative mapping link between two conceptual resources in different concept schemes. */\n    'relatedMatch': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#relatedMatch'),\n    /** A note that helps to clarify the meaning and/or the use of a concept. */\n    'scopeNote': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#scopeNote'),\n    /** Links a concept to a concept related by meaning. */\n    'semanticRelation': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#semanticRelation'),\n    /** Relates a concept to the concept scheme that it is a top level concept of. */\n    'topConceptOf': new n3.NamedNode('http://www.w3.org/2004/02/skos/core#topConceptOf'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/skos.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/src.ts":
+/*!*******************************!*\
+  !*** ./src/ontologies/src.ts ***!
+  \*******************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.xsd = exports.skos = exports.skos_xl = exports.sh = exports.rdfs = exports.rdfa = exports.rdf = exports.owl = void 0;\nexports.owl = `@prefix dc: <http://purl.org/dc/elements/1.1/> .\n@prefix grddl: <http://www.w3.org/2003/g/data-view#> .\n@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix xml: <http://www.w3.org/XML/1998/namespace> .\n@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .\n\n<http://www.w3.org/2002/07/owl#> a owl:Ontology ;\n     dc:title \"The OWL 2 Schema vocabulary (OWL 2)\" ;\n     rdfs:comment \"\"\"\n  This ontology partially describes the built-in classes and\n  properties that together form the basis of the RDF/XML syntax of OWL 2.\n  The content of this ontology is based on Tables 6.1 and 6.2\n  in Section 6.4 of the OWL 2 RDF-Based Semantics specification,\n  available at http://www.w3.org/TR/owl2-rdf-based-semantics/.\n  Please note that those tables do not include the different annotations\n  (labels, comments and rdfs:isDefinedBy links) used in this file.\n  Also note that the descriptions provided in this ontology do not\n  provide a complete and correct formal description of either the syntax\n  or the semantics of the introduced terms (please see the OWL 2\n  recommendations for the complete and normative specifications).\n  Furthermore, the information provided by this ontology may be\n  misleading if not used with care. This ontology SHOULD NOT be imported\n  into OWL ontologies. Importing this file into an OWL 2 DL ontology\n  will cause it to become an OWL 2 Full ontology and may have other,\n  unexpected, consequences.\n   \"\"\" ;\n     rdfs:isDefinedBy\n          <http://www.w3.org/TR/owl2-mapping-to-rdf/>,\n          <http://www.w3.org/TR/owl2-rdf-based-semantics/>,\n          <http://www.w3.org/TR/owl2-syntax/> ;\n     rdfs:seeAlso   <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-classes>,\n                    <http://www.w3.org/TR/owl2-rdf-based-semantics/#table-axiomatic-properties> ;\n     owl:imports <http://www.w3.org/2000/01/rdf-schema> ;\n     owl:versionIRI <http://www.w3.org/2002/07/owl> ;\n     owl:versionInfo \"$Date: 2009/11/15 10:54:12 $\" ;\n     grddl:namespaceTransformation <http://dev.w3.org/cvsweb/2009/owl-grddl/owx2rdf.xsl> . \n\n\nowl:AllDifferent a rdfs:Class ;\n     rdfs:label \"AllDifferent\" ;\n     rdfs:comment \"The class of collections of pairwise different individuals.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:AllDisjointClasses a rdfs:Class ;\n     rdfs:label \"AllDisjointClasses\" ;\n     rdfs:comment \"The class of collections of pairwise disjoint classes.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:AllDisjointProperties a rdfs:Class ;\n     rdfs:label \"AllDisjointProperties\" ;\n     rdfs:comment \"The class of collections of pairwise disjoint properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:Annotation a rdfs:Class ;\n     rdfs:label \"Annotation\" ;\n     rdfs:comment \"The class of annotated annotations for which the RDF serialization consists of an annotated subject, predicate and object.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:AnnotationProperty a rdfs:Class ;\n     rdfs:label \"AnnotationProperty\" ;\n     rdfs:comment \"The class of annotation properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property .\n\nowl:AsymmetricProperty a rdfs:Class ;\n     rdfs:label \"AsymmetricProperty\" ;\n     rdfs:comment \"The class of asymmetric properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:Axiom a rdfs:Class ;\n     rdfs:label \"Axiom\" ;\n     rdfs:comment \"The class of annotated axioms for which the RDF serialization consists of an annotated subject, predicate and object.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:Class a rdfs:Class ;\n     rdfs:label \"Class\" ;\n     rdfs:comment \"The class of OWL classes.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Class . \n\nowl:DataRange a rdfs:Class ;\n     rdfs:label \"DataRange\" ;\n     rdfs:comment \"The class of OWL data ranges, which are special kinds of datatypes. Note: The use of the IRI owl:DataRange has been deprecated as of OWL 2. The IRI rdfs:Datatype SHOULD be used instead.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Datatype . \n\nowl:DatatypeProperty a rdfs:Class ;\n     rdfs:label \"DatatypeProperty\" ;\n     rdfs:comment \"The class of data properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property . \n\nowl:DeprecatedClass a rdfs:Class ;\n     rdfs:label \"DeprecatedClass\" ;\n     rdfs:comment \"The class of deprecated classes.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Class . \n\nowl:DeprecatedProperty a rdfs:Class ;\n     rdfs:label \"DeprecatedProperty\" ;\n     rdfs:comment \"The class of deprecated properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property . \n\nowl:FunctionalProperty a rdfs:Class ;\n     rdfs:label \"FunctionalProperty\" ;\n     rdfs:comment \"The class of functional properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property . \n\nowl:InverseFunctionalProperty a rdfs:Class ;\n     rdfs:label \"InverseFunctionalProperty\" ;\n     rdfs:comment \"The class of inverse-functional properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:IrreflexiveProperty a rdfs:Class ;\n     rdfs:label \"IrreflexiveProperty\" ;\n     rdfs:comment \"The class of irreflexive properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:NamedIndividual a rdfs:Class ;\n     rdfs:label \"NamedIndividual\" ;\n     rdfs:comment \"The class of named individuals.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:Thing . \n\nowl:NegativePropertyAssertion a rdfs:Class ;\n     rdfs:label \"NegativePropertyAssertion\" ;\n     rdfs:comment \"The class of negative property assertions.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:Nothing a owl:Class ;\n     rdfs:label \"Nothing\" ;\n     rdfs:comment \"This is the empty class.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:Thing . \n\nowl:ObjectProperty a rdfs:Class ;\n     rdfs:label \"ObjectProperty\" ;\n     rdfs:comment \"The class of object properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property . \n\nowl:Ontology a rdfs:Class ;\n     rdfs:label \"Ontology\" ;\n     rdfs:comment \"The class of ontologies.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdfs:Resource . \n\nowl:OntologyProperty a rdfs:Class ;\n     rdfs:label \"OntologyProperty\" ;\n     rdfs:comment \"The class of ontology properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf rdf:Property . \n\nowl:ReflexiveProperty a rdfs:Class ;\n     rdfs:label \"ReflexiveProperty\" ;\n     rdfs:comment \"The class of reflexive properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:Restriction a rdfs:Class ;\n     rdfs:label \"Restriction\" ;\n     rdfs:comment \"The class of property restrictions.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:Class . \n\nowl:SymmetricProperty a rdfs:Class ;\n     rdfs:label \"SymmetricProperty\" ;\n     rdfs:comment \"The class of symmetric properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:TransitiveProperty a rdfs:Class ;\n     rdfs:label \"TransitiveProperty\" ;\n     rdfs:comment \"The class of transitive properties.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:subClassOf owl:ObjectProperty . \n\nowl:Thing a owl:Class ;\n     rdfs:label \"Thing\" ;\n     rdfs:comment \"The class of OWL individuals.\" ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> .\n     \nowl:allValuesFrom a rdf:Property ;\n     rdfs:label \"allValuesFrom\" ;\n     rdfs:comment \"The property that determines the class that a universal property restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Class . \n\nowl:annotatedProperty a rdf:Property ;\n     rdfs:label \"annotatedProperty\" ;\n     rdfs:comment \"The property that determines the predicate of an annotated axiom or annotated annotation.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:annotatedSource a rdf:Property ;\n     rdfs:label \"annotatedSource\" ;\n     rdfs:comment \"The property that determines the subject of an annotated axiom or annotated annotation.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:annotatedTarget a rdf:Property ;\n     rdfs:label \"annotatedTarget\" ;\n     rdfs:comment \"The property that determines the object of an annotated axiom or annotated annotation.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:assertionProperty a rdf:Property ;\n     rdfs:label \"assertionProperty\" ;\n     rdfs:comment \"The property that determines the predicate of a negative property assertion.\" ;\n     rdfs:domain owl:NegativePropertyAssertion ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:Property . \n\nowl:backwardCompatibleWith a owl:AnnotationProperty, owl:OntologyProperty ;\n     rdfs:label \"backwardCompatibleWith\" ;\n     rdfs:comment \"The annotation property that indicates that a given ontology is backward compatible with another ontology.\" ;\n     rdfs:domain owl:Ontology ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Ontology . \n\nowl:bottomDataProperty a owl:DatatypeProperty ;\n     rdfs:label \"bottomDataProperty\" ;\n     rdfs:comment \"The data property that does not relate any individual to any data value.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Literal . \n\nowl:bottomObjectProperty a owl:ObjectProperty ;\n     rdfs:label \"bottomObjectProperty\" ;\n     rdfs:comment \"The object property that does not relate any two individuals.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:cardinality a rdf:Property ;\n     rdfs:label \"cardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of an exact cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:complementOf a rdf:Property ;\n     rdfs:label \"complementOf\" ;\n     rdfs:comment \"The property that determines that a given class is the complement of another class.\" ;\n     rdfs:domain owl:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Class . \n\nowl:datatypeComplementOf a rdf:Property ;\n     rdfs:label \"datatypeComplementOf\" ;\n     rdfs:comment \"The property that determines that a given data range is the complement of another data range with respect to the data domain.\" ;\n     rdfs:domain rdfs:Datatype ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Datatype . \n\nowl:deprecated a owl:AnnotationProperty ;\n     rdfs:label \"deprecated\" ;\n     rdfs:comment \"The annotation property that indicates that a given entity has been deprecated.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:differentFrom a rdf:Property ;\n     rdfs:label \"differentFrom\" ;\n     rdfs:comment \"The property that determines that two given individuals are different.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:disjointUnionOf a rdf:Property ;\n     rdfs:label \"disjointUnionOf\" ;\n     rdfs:comment \"The property that determines that a given class is equivalent to the disjoint union of a collection of other classes.\" ;\n     rdfs:domain owl:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:disjointWith a rdf:Property ;\n     rdfs:label \"disjointWith\" ;\n     rdfs:comment \"The property that determines that two given classes are disjoint.\" ;\n     rdfs:domain owl:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Class . \n\nowl:distinctMembers a rdf:Property ;\n     rdfs:label \"distinctMembers\" ;\n     rdfs:comment \"The property that determines the collection of pairwise different individuals in a owl:AllDifferent axiom.\" ;\n     rdfs:domain owl:AllDifferent ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:equivalentClass a rdf:Property ;\n     rdfs:label \"equivalentClass\" ;\n     rdfs:comment \"The property that determines that two given classes are equivalent, and that is used to specify datatype definitions.\" ;\n     rdfs:domain rdfs:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Class . \n\nowl:equivalentProperty a rdf:Property ;\n     rdfs:label \"equivalentProperty\" ;\n     rdfs:comment \"The property that determines that two given properties are equivalent.\" ;\n     rdfs:domain rdf:Property ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:Property . \n\nowl:hasKey a rdf:Property ;\n     rdfs:label \"hasKey\" ;\n     rdfs:comment \"The property that determines the collection of properties that jointly build a key.\" ;\n     rdfs:domain owl:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:hasSelf a rdf:Property ;\n     rdfs:label \"hasSelf\" ;\n     rdfs:comment \"The property that determines the property that a self restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:hasValue a rdf:Property ;\n     rdfs:label \"hasValue\" ;\n     rdfs:comment \"The property that determines the individual that a has-value restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource . \n\nowl:imports a owl:OntologyProperty ;\n     rdfs:label \"imports\" ;\n     rdfs:comment \"The property that is used for importing other ontologies into a given ontology.\" ;\n     rdfs:domain owl:Ontology ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Ontology . \n\nowl:incompatibleWith a owl:AnnotationProperty, owl:OntologyProperty ;\n     rdfs:label \"incompatibleWith\" ;\n     rdfs:comment \"The annotation property that indicates that a given ontology is incompatible with another ontology.\" ;\n     rdfs:domain owl:Ontology ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Ontology . \n\nowl:intersectionOf a rdf:Property ;\n     rdfs:label \"intersectionOf\" ;\n     rdfs:comment \"The property that determines the collection of classes or data ranges that build an intersection.\" ;\n     rdfs:domain rdfs:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:inverseOf a rdf:Property ;\n     rdfs:label \"inverseOf\" ;\n     rdfs:comment \"The property that determines that two given properties are inverse.\" ;\n     rdfs:domain owl:ObjectProperty ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:ObjectProperty . \n\nowl:maxCardinality a rdf:Property ;\n     rdfs:label \"maxCardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of a maximum cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:maxQualifiedCardinality a rdf:Property ;\n     rdfs:label \"maxQualifiedCardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of a maximum qualified cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:members a rdf:Property ;\n     rdfs:label \"members\" ;\n     rdfs:comment \"The property that determines the collection of members in either a owl:AllDifferent, owl:AllDisjointClasses or owl:AllDisjointProperties axiom.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:minCardinality a rdf:Property ;\n     rdfs:label \"minCardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of a minimum cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:minQualifiedCardinality a rdf:Property ;\n     rdfs:label \"minQualifiedCardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of a minimum qualified cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:onClass a rdf:Property ;\n     rdfs:label \"onClass\" ;\n     rdfs:comment \"The property that determines the class that a qualified object cardinality restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Class . \n\nowl:onDataRange a rdf:Property ;\n     rdfs:label \"onDataRange\" ;\n     rdfs:comment \"The property that determines the data range that a qualified data cardinality restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Datatype . \n\nowl:onDatatype a rdf:Property ;\n     rdfs:label \"onDatatype\" ;\n     rdfs:comment \"The property that determines the datatype that a datatype restriction refers to.\" ;\n     rdfs:domain rdfs:Datatype ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Datatype . \n\nowl:oneOf a rdf:Property ;\n     rdfs:label \"oneOf\" ;\n     rdfs:comment \"The property that determines the collection of individuals or data values that build an enumeration.\" ;\n     rdfs:domain rdfs:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:onProperties a rdf:Property ;\n     rdfs:label \"onProperties\" ;\n     rdfs:comment \"The property that determines the n-tuple of properties that a property restriction on an n-ary data range refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List .\n\nowl:onProperty a rdf:Property ;\n     rdfs:label \"onProperty\" ;\n     rdfs:comment \"The property that determines the property that a property restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:Property . \n\nowl:priorVersion a owl:AnnotationProperty, owl:OntologyProperty ;\n     rdfs:label \"priorVersion\" ;\n     rdfs:comment \"The annotation property that indicates the predecessor ontology of a given ontology.\" ;\n     rdfs:domain owl:Ontology ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Ontology . \n\nowl:propertyChainAxiom a rdf:Property ;\n     rdfs:label \"propertyChainAxiom\" ;\n     rdfs:comment \"The property that determines the n-tuple of properties that build a sub property chain of a given property.\" ;\n     rdfs:domain owl:ObjectProperty ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:propertyDisjointWith a rdf:Property ;\n     rdfs:label \"propertyDisjointWith\" ;\n     rdfs:comment \"The property that determines that two given properties are disjoint.\" ;\n     rdfs:domain rdf:Property ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:Property . \n\nowl:qualifiedCardinality a rdf:Property ;\n     rdfs:label \"qualifiedCardinality\" ;\n     rdfs:comment \"The property that determines the cardinality of an exact qualified cardinality restriction.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range xsd:nonNegativeInteger . \n\nowl:sameAs a rdf:Property ;\n     rdfs:label \"sameAs\" ;\n     rdfs:comment \"The property that determines that two given individuals are equal.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:someValuesFrom a rdf:Property ;\n     rdfs:label \"someValuesFrom\" ;\n     rdfs:comment \"The property that determines the class that an existential property restriction refers to.\" ;\n     rdfs:domain owl:Restriction ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Class . \n\nowl:sourceIndividual a rdf:Property ;\n     rdfs:label \"sourceIndividual\" ;\n     rdfs:comment \"The property that determines the subject of a negative property assertion.\" ;\n     rdfs:domain owl:NegativePropertyAssertion ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:targetIndividual a rdf:Property ;\n     rdfs:label \"targetIndividual\" ;\n     rdfs:comment \"The property that determines the object of a negative object property assertion.\" ;\n     rdfs:domain owl:NegativePropertyAssertion ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:targetValue a rdf:Property ;\n     rdfs:label \"targetValue\" ;\n     rdfs:comment \"The property that determines the value of a negative data property assertion.\" ;\n     rdfs:domain owl:NegativePropertyAssertion ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Literal . \n\nowl:topDataProperty a owl:DatatypeProperty ;\n     rdfs:label \"topDataProperty\" ;\n     rdfs:comment \"The data property that relates every individual to every data value.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Literal . \n\nowl:topObjectProperty a owl:ObjectProperty ;\n     rdfs:label \"topObjectProperty\" ;\n     rdfs:comment \"The object property that relates every two individuals.\" ;\n     rdfs:domain owl:Thing ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Thing . \n\nowl:unionOf a rdf:Property ;\n     rdfs:label \"unionOf\" ;\n     rdfs:comment \"The property that determines the collection of classes or data ranges that build a union.\" ;\n     rdfs:domain rdfs:Class ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List . \n\nowl:versionInfo a owl:AnnotationProperty ;\n     rdfs:label \"versionInfo\" ;\n     rdfs:comment \"The annotation property that provides version information for an ontology or another OWL construct.\" ;\n     rdfs:domain rdfs:Resource ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdfs:Resource .\n     \nowl:versionIRI a owl:OntologyProperty ;\n     rdfs:label \"versionIRI\" ;\n     rdfs:comment \"The property that identifies the version IRI of an ontology.\" ;\n     rdfs:domain owl:Ontology ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range owl:Ontology . \n\nowl:withRestrictions a rdf:Property ;\n     rdfs:label \"withRestrictions\" ;\n     rdfs:comment \"The property that determines the collection of facet-value pairs that define a datatype restriction.\" ;\n     rdfs:domain rdfs:Datatype ;\n     rdfs:isDefinedBy <http://www.w3.org/2002/07/owl#> ;\n     rdfs:range rdf:List .\n     `;\nexports.rdf = `@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix dc: <http://purl.org/dc/elements/1.1/> .\n\n<http://www.w3.org/1999/02/22-rdf-syntax-ns#> a owl:Ontology ;\n\tdc:title \"The RDF Concepts Vocabulary (RDF)\" ;\n\tdc:date \"2019-12-16\" ;\n\tdc:description \"This is the RDF Schema for the RDF vocabulary terms in the RDF Namespace, defined in RDF 1.1 Concepts.\" .\n\nrdf:HTML a rdfs:Datatype ;\n\trdfs:subClassOf rdfs:Literal ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <http://www.w3.org/TR/rdf11-concepts/#section-html> ;\n\trdfs:label \"HTML\" ;\n\trdfs:comment \"The datatype of RDF literals storing fragments of HTML content\" .\n\nrdf:langString a rdfs:Datatype ;\n\trdfs:subClassOf rdfs:Literal ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <http://www.w3.org/TR/rdf11-concepts/#section-Graph-Literal> ;\n\trdfs:label \"langString\" ;\n\trdfs:comment \"The datatype of language-tagged string values\" .\n\nrdf:PlainLiteral a rdfs:Datatype ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:subClassOf rdfs:Literal ;\n\trdfs:seeAlso <http://www.w3.org/TR/rdf-plain-literal/> ;\n\trdfs:label \"PlainLiteral\" ;\n\trdfs:comment \"The class of plain (i.e. untyped) literal values, as used in RIF and OWL 2\" .\n\nrdf:type a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"type\" ;\n\trdfs:comment \"The subject is an instance of a class.\" ;\n\trdfs:range rdfs:Class ;\n\trdfs:domain rdfs:Resource .\n\nrdf:Property a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"Property\" ;\n\trdfs:comment \"The class of RDF properties.\" ;\n\trdfs:subClassOf rdfs:Resource .\n\nrdf:Statement a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"Statement\" ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:comment \"The class of RDF statements.\" .\n\nrdf:subject a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"subject\" ;\n\trdfs:comment \"The subject of the subject RDF statement.\" ;\n\trdfs:domain rdf:Statement ;\n\trdfs:range rdfs:Resource .\n\nrdf:predicate a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"predicate\" ;\n\trdfs:comment \"The predicate of the subject RDF statement.\" ;\n\trdfs:domain rdf:Statement ;\n\trdfs:range rdfs:Resource .\n\nrdf:object a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"object\" ;\n\trdfs:comment \"The object of the subject RDF statement.\" ;\n\trdfs:domain rdf:Statement ;\n\trdfs:range rdfs:Resource .\n\nrdf:Bag a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"Bag\" ;\n\trdfs:comment \"The class of unordered containers.\" ;\n\trdfs:subClassOf rdfs:Container .\n\nrdf:Seq a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"Seq\" ;\n\trdfs:comment \"The class of ordered containers.\" ;\n\trdfs:subClassOf rdfs:Container .\n\nrdf:Alt a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"Alt\" ;\n\trdfs:comment \"The class of containers of alternatives.\" ;\n\trdfs:subClassOf rdfs:Container .\n\nrdf:value a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"value\" ;\n\trdfs:comment \"Idiomatic property used for structured values.\" ;\n\trdfs:domain rdfs:Resource ;\n\trdfs:range rdfs:Resource .\n\nrdf:List a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"List\" ;\n\trdfs:comment \"The class of RDF Lists.\" ;\n\trdfs:subClassOf rdfs:Resource .\n\nrdf:nil a rdf:List ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"nil\" ;\n\trdfs:comment \"The empty list, with no items in it. If the rest of a list is nil then the list has no more items in it.\" .\n\nrdf:first a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"first\" ;\n\trdfs:comment \"The first item in the subject RDF list.\" ;\n\trdfs:domain rdf:List ;\n\trdfs:range rdfs:Resource .\n\nrdf:rest a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"rest\" ;\n\trdfs:comment \"The rest of the subject RDF list after the first item.\" ;\n\trdfs:domain rdf:List ;\n\trdfs:range rdf:List .\n\nrdf:XMLLiteral a rdfs:Datatype ;\n\trdfs:subClassOf rdfs:Literal ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:label \"XMLLiteral\" ;\n\trdfs:comment \"The datatype of XML literal values.\" .\n\nrdf:JSON a rdfs:Datatype ;\n\trdfs:label \"JSON\" ;\n\trdfs:comment \"The datatype of RDF literals storing JSON content.\" ;\n\trdfs:subClassOf rdfs:Literal ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <https://www.w3.org/TR/json-ld11/#the-rdf-json-datatype> .\n\nrdf:CompoundLiteral a rdfs:Class ;\n\trdfs:label \"CompoundLiteral\" ;\n\trdfs:comment \"A class representing a compound literal.\" ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <https://www.w3.org/TR/json-ld11/#the-rdf-compoundliteral-class-and-the-rdf-language-and-rdf-direction-properties> .\n\nrdf:language a rdf:Property ;\n\trdfs:label \"language\" ;\n\trdfs:comment \"The language component of a CompoundLiteral.\" ;\n\trdfs:domain rdf:CompoundLiteral ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <https://www.w3.org/TR/json-ld11/#the-rdf-compoundliteral-class-and-the-rdf-language-and-rdf-direction-properties> .\n\nrdf:direction a rdf:Property ;\n\trdfs:label \"direction\" ;\n\trdfs:comment \"The base direction component of a CompoundLiteral.\" ;\n\trdfs:domain rdf:CompoundLiteral ;\n\trdfs:isDefinedBy <http://www.w3.org/1999/02/22-rdf-syntax-ns#> ;\n\trdfs:seeAlso <https://www.w3.org/TR/json-ld11/#the-rdf-compoundliteral-class-and-the-rdf-language-and-rdf-direction-properties> .\n`;\nexports.rdfa = `@prefix dcterms: <http://purl.org/dc/terms/> .\n@prefix foaf: <http://xmlns.com/foaf/0.1/> .\n@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfa: <http://www.w3.org/ns/rdfa#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .\n\nrdfa:PGClass a rdfs:Class,\n        owl:Class;\n    dcterms:description \"is the top level class of the hierarchy\" .\n\nrdfa:Pattern a rdfs:Class,\n        owl:Class;\n    dcterms:description \"Class to identify an (RDF) resource whose properties are to be copied to another resource\" .\n\nrdfa:PrefixOrTermMapping a rdfs:Class,\n        owl:Class;\n    dcterms:description \"is the top level class for prefix or term mappings\" .\n\nrdfa: a owl:Ontology;\n    dcterms:creator <http://www.ivan-herman.net/foaf#me>;\n    dcterms:date \"2013-01-18\";\n    dcterms:description \"This document describes the RDFa Vocabulary for Term and Prefix Assignment. The Vocabulary is used to modify RDFa 1.1 processing behavior.\";\n    dcterms:publisher <http://www.w3.org/data#W3C>;\n    dcterms:title \"RDFa Vocabulary for Term and Prefix Assignment, and for Processor Graph Reporting\";\n    rdfs:isDefinedBy <http://www.w3.org/TR/rdfa-core/#s_initialcontexts>;\n    owl:versionInfo \"$Date: 2013-03-11 07:54:23 $\" .\n\nrdfa:DocumentError dcterms:description \"error condition; to be used when the document fails to be fully processed as a result of non-conformant host language markup\";\n    rdfs:subClassOf rdfa:Error .\n\nrdfa:Info dcterms:description \"is the class for all informations\";\n    rdfs:subClassOf rdfa:PGClass .\n\nrdfa:PrefixRedefinition dcterms:description \"warning; to be used when a prefix, either from the initial context or inherited from an ancestor node, is redefined in an element\";\n    rdfs:subClassOf rdfa:Warning .\n\nrdfa:UnresolvedCURIE dcterms:description \"warning; to be used when a CURIE prefix fails to be resolved\";\n    rdfs:subClassOf rdfa:Warning .\n\nrdfa:UnresolvedTerm dcterms:description \"warning; to be used when a Term fails to be resolved\";\n    rdfs:subClassOf rdfa:Warning .\n\nrdfa:VocabReferenceError dcterms:description \"warning; to be used when the value of a @vocab attribute cannot be dereferenced, hence the vocabulary expansion cannot be completed\";\n    rdfs:subClassOf rdfa:Warning .\n\nrdfa:context a rdf:Property,\n        owl:ObjectProperty;\n    dcterms:description \"provides extra context for the error, eg, http response, an XPointer/XPath information, or simply the URI that created the error\";\n    rdfs:domain rdfa:PGClass .\n\nrdfa:copy a rdf:Property,\n        owl:ObjectProperty;\n    dcterms:description \"identifies the resource (i.e., pattern) whose properties and values should be copied to replace the current triple (retaining the subject of the triple).\" .\n\nrdfa:prefix a rdf:Property,\n        owl:DatatypeProperty;\n    dcterms:description \"defines a prefix mapping for a URI; the value is supposed to be a NMTOKEN\";\n    rdfs:domain rdfa:PrefixMapping .\n\nrdfa:term a rdf:Property,\n        owl:DatatypeProperty;\n    dcterms:description \"defines a term mapping for a URI; the value is supposed to be a NMTOKEN\";\n    rdfs:domain rdfa:TermMapping .\n\nrdfa:uri a rdf:Property,\n        owl:DatatypeProperty;\n    dcterms:description \"defines the URI for either a prefix or a term mapping; the value is supposed to be an absolute URI\";\n    rdfs:domain rdfa:PrefixOrTermMapping .\n\nrdfa:usesVocabulary a rdf:Property,\n        owl:ObjectProperty;\n    dcterms:description \"\"\"provides a relationship between the host document and a vocabulary\n\tdefined using the @vocab facility of RDFa1.1\"\"\" .\n\nrdfa:vocabulary a rdf:Property,\n        owl:DatatypeProperty;\n    dcterms:description \"defines an absolute URI to be used as a default vocabulary; the value is can be any string; for documentation purposes it is advised to use the string 'true' or 'True'.\" .\n\n<http://www.ivan-herman.net/foaf#me> a foaf:Person;\n    rdfs:seeAlso <http://www.ivan-herman.net/foaf>;\n    foaf:mbox <mailto:ivan@w3.org>;\n    foaf:name \"Ivan Herman\";\n    foaf:title \"Semantic Web Activity Lead\";\n    foaf:workplaceHomepage <http://www.w3.org> .\n\nrdfa:Error dcterms:description \"is the class for all error conditions\";\n    rdfs:subClassOf rdfa:PGClass .\n\nrdfa:PrefixMapping dcterms:description \"is the class for prefix mappings\";\n    rdfs:subClassOf rdfa:PrefixOrTermMapping .\n\nrdfa:TermMapping dcterms:description \"is the class for term mappings\";\n    rdfs:subClassOf rdfa:PrefixOrTermMapping .\n\nrdfa:Warning dcterms:description \"is the class for all warnings\";\n    rdfs:subClassOf rdfa:PGClass .\n\n\n`;\nexports.rdfs = `@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix dc: <http://purl.org/dc/elements/1.1/> .\n\n<http://www.w3.org/2000/01/rdf-schema#> a owl:Ontology ;\n\tdc:title \"The RDF Schema vocabulary (RDFS)\" .\n\nrdfs:Resource a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"Resource\" ;\n\trdfs:comment \"The class resource, everything.\" .\n\nrdfs:Class a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"Class\" ;\n\trdfs:comment \"The class of classes.\" ;\n\trdfs:subClassOf rdfs:Resource .\n\nrdfs:subClassOf a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"subClassOf\" ;\n\trdfs:comment \"The subject is a subclass of a class.\" ;\n\trdfs:range rdfs:Class ;\n\trdfs:domain rdfs:Class .\n\nrdfs:subPropertyOf a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"subPropertyOf\" ;\n\trdfs:comment \"The subject is a subproperty of a property.\" ;\n\trdfs:range rdf:Property ;\n\trdfs:domain rdf:Property .\n\nrdfs:comment a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"comment\" ;\n\trdfs:comment \"A description of the subject resource.\" ;\n\trdfs:domain rdfs:Resource ;\n\trdfs:range rdfs:Literal .\n\nrdfs:label a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"label\" ;\n\trdfs:comment \"A human-readable name for the subject.\" ;\n\trdfs:domain rdfs:Resource ;\n\trdfs:range rdfs:Literal .\n\nrdfs:domain a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"domain\" ;\n\trdfs:comment \"A domain of the subject property.\" ;\n\trdfs:range rdfs:Class ;\n\trdfs:domain rdf:Property .\n\nrdfs:range a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"range\" ;\n\trdfs:comment \"A range of the subject property.\" ;\n\trdfs:range rdfs:Class ;\n\trdfs:domain rdf:Property .\n\nrdfs:seeAlso a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"seeAlso\" ;\n\trdfs:comment \"Further information about the subject resource.\" ;\n\trdfs:range rdfs:Resource ;\n\trdfs:domain rdfs:Resource .\n\nrdfs:isDefinedBy a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:subPropertyOf rdfs:seeAlso ;\n\trdfs:label \"isDefinedBy\" ;\n\trdfs:comment \"The defininition of the subject resource.\" ;\n\trdfs:range rdfs:Resource ;\n\trdfs:domain rdfs:Resource .\n\nrdfs:Literal a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"Literal\" ;\n\trdfs:comment \"The class of literal values, eg. textual strings and integers.\" ;\n\trdfs:subClassOf rdfs:Resource .\n\nrdfs:Container a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"Container\" ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:comment \"The class of RDF containers.\" .\n\nrdfs:ContainerMembershipProperty a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"ContainerMembershipProperty\" ;\n\trdfs:comment \"\"\"The class of container membership properties, rdf:_1, rdf:_2, ...,\n                    all of which are sub-properties of 'member'.\"\"\" ;\n\trdfs:subClassOf rdf:Property .\n\nrdfs:member a rdf:Property ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"member\" ;\n\trdfs:comment \"A member of the subject resource.\" ;\n\trdfs:domain rdfs:Resource ;\n\trdfs:range rdfs:Resource .\n\nrdfs:Datatype a rdfs:Class ;\n\trdfs:isDefinedBy <http://www.w3.org/2000/01/rdf-schema#> ;\n\trdfs:label \"Datatype\" ;\n\trdfs:comment \"The class of RDF datatypes.\" ;\n\trdfs:subClassOf rdfs:Class .\n\n<http://www.w3.org/2000/01/rdf-schema#> rdfs:seeAlso <http://www.w3.org/2000/01/rdf-schema-more> .\n`;\nexports.sh = `# W3C Shapes Constraint Language (SHACL) Vocabulary\n# Version from 2017-07-20\n\n@prefix owl:  <http://www.w3.org/2002/07/owl#> .\n@prefix rdf:  <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix xsd:  <http://www.w3.org/2001/XMLSchema#> .\n@prefix sh:   <http://www.w3.org/ns/shacl#> .\n\nsh:\n\ta owl:Ontology ;\n\trdfs:label \"W3C Shapes Constraint Language (SHACL) Vocabulary\"@en ;\n\trdfs:comment \"This vocabulary defines terms used in SHACL, the W3C Shapes Constraint Language.\"@en ;\n\tsh:declare [\n\t\tsh:prefix \"sh\" ;\n\t\tsh:namespace \"http://www.w3.org/ns/shacl#\" ;\n\t] ;\n\tsh:suggestedShapesGraph <http://www.w3.org/ns/shacl-shacl#> .\n\n\n# Shapes vocabulary -----------------------------------------------------------\n\nsh:Shape\n\ta rdfs:Class ;\n\trdfs:label \"Shape\"@en ;\n\trdfs:comment \"A shape is a collection of constraints that may be targeted for certain nodes.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:NodeShape\n\ta rdfs:Class ;\n\trdfs:label \"Node Shape\"@en ;\n\trdfs:comment \"A node shape is a shape that specifies constraint that need to be met with respect to focus nodes.\"@en ;\n\trdfs:subClassOf sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:PropertyShape\n\ta rdfs:Class ;\n\trdfs:label \"Property Shape\"@en ;\n\trdfs:comment \"A property shape is a shape that specifies constraints on the values of a focus node for a given property or path.\"@en ;\n\trdfs:subClassOf sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:deactivated\n\ta rdf:Property ;\n\trdfs:label \"deactivated\"@en ;\n\trdfs:comment \"If set to true then all nodes conform to this.\"@en ;\n\t# rdfs:domain sh:Shape or sh:SPARQLConstraint\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\nsh:targetClass \n\ta rdf:Property ;\n\trdfs:label \"target class\"@en ;\n\trdfs:comment \"Links a shape to a class, indicating that all instances of the class must conform to the shape.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range rdfs:Class ;\n\trdfs:isDefinedBy sh: .\n\nsh:targetNode \n\ta rdf:Property ;\n\trdfs:label \"target node\"@en ;\n\trdfs:comment \"Links a shape to individual nodes, indicating that these nodes must conform to the shape.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:targetObjectsOf\n\ta rdf:Property ;\n\trdfs:label \"target objects of\"@en ;\n\trdfs:comment \"Links a shape to a property, indicating that all all objects of triples that have the given property as their predicate must conform to the shape.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\nsh:targetSubjectsOf\n\ta rdf:Property ;\n\trdfs:label \"target subjects of\"@en ;\n\trdfs:comment \"Links a shape to a property, indicating that all subjects of triples that have the given property as their predicate must conform to the shape.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\nsh:message\n\ta rdf:Property ;\n\t# domain: sh:Shape or sh:SPARQLConstraint or sh:SPARQLSelectValidator or sh:SPARQLAskValidator\n\t# range: xsd:string or rdf:langString\n\trdfs:label \"message\"@en ;\n\trdfs:comment \"A human-readable message (possibly with placeholders for variables) explaining the cause of the result.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:severity\n\ta rdf:Property ;\n\trdfs:label \"severity\"@en ;\n\trdfs:comment \"Defines the severity that validation results produced by a shape must have. Defaults to sh:Violation.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range sh:Severity ;\n\trdfs:isDefinedBy sh: .\n\n\n# Node kind vocabulary --------------------------------------------------------\n\nsh:NodeKind\n\ta rdfs:Class ;\n\trdfs:label \"Node Kind\"@en ;\n\trdfs:comment \"The class of all node kinds, including sh:BlankNode, sh:IRI, sh:Literal or the combinations of these: sh:BlankNodeOrIRI, sh:BlankNodeOrLiteral, sh:IRIOrLiteral.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:BlankNode\n\ta sh:NodeKind ;\n\trdfs:label \"Blank Node\"@en ;\n\trdfs:comment \"The node kind of all blank nodes.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:BlankNodeOrIRI\n\ta sh:NodeKind ;\n\trdfs:label \"Blank Node or IRI\"@en ;\n\trdfs:comment \"The node kind of all blank nodes or IRIs.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:BlankNodeOrLiteral\n\ta sh:NodeKind ;\n\trdfs:label \"Blank Node or Literal\"@en ;\n\trdfs:comment \"The node kind of all blank nodes or literals.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:IRI\n\ta sh:NodeKind ;\n\trdfs:label \"IRI\"@en ;\n\trdfs:comment \"The node kind of all IRIs.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:IRIOrLiteral\n\ta sh:NodeKind ;\n\trdfs:label \"IRI or Literal\"@en ;\n\trdfs:comment \"The node kind of all IRIs or literals.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:Literal\n\ta sh:NodeKind ;\n\trdfs:label \"Literal\"@en ;\n\trdfs:comment \"The node kind of all literals.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\n# Results vocabulary ----------------------------------------------------------\n\nsh:ValidationReport\n\ta rdfs:Class ;\n\trdfs:label \"Validation Report\"@en ;\n\trdfs:comment \"The class of SHACL validation reports.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:conforms\n\ta rdf:Property ;\n\trdfs:label \"conforms\"@en ;\n\trdfs:comment \"True if the validation did not produce any validation results, and false otherwise.\"@en ;\n\trdfs:domain sh:ValidationReport ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\nsh:result\n\ta rdf:Property ;\n\trdfs:label \"result\"@en ;\n\trdfs:comment \"The validation results contained in a validation report.\"@en ;\n\trdfs:domain sh:ValidationReport ;\n\trdfs:range sh:ValidationResult ;\n\trdfs:isDefinedBy sh: .\n\nsh:shapesGraphWellFormed\n\ta rdf:Property ;\n\trdfs:label \"shapes graph well-formed\"@en ;\n\trdfs:comment \"If true then the validation engine was certain that the shapes graph has passed all SHACL syntax requirements during the validation process.\"@en ;\n\trdfs:domain sh:ValidationReport ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\nsh:AbstractResult\n\ta rdfs:Class ;\n\trdfs:label \"Abstract Result\"@en ;\n\trdfs:comment \"The base class of validation results, typically not instantiated directly.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:ValidationResult\n\ta rdfs:Class ;\n\trdfs:label \"Validation Result\"@en ;\n\trdfs:comment \"The class of validation results.\"@en ;\n\trdfs:subClassOf sh:AbstractResult ;\n\trdfs:isDefinedBy sh: .\n\nsh:Severity\n\ta rdfs:Class ;\n\trdfs:label \"Severity\"@en ;\n\trdfs:comment \"The class of validation result severity levels, including violation and warning levels.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:Info\n\ta sh:Severity ;\n\trdfs:label \"Info\"@en ;\n\trdfs:comment \"The severity for an informational validation result.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:Violation\n\ta sh:Severity ;\n\trdfs:label \"Violation\"@en ;\n\trdfs:comment \"The severity for a violation validation result.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:Warning\n\ta sh:Severity ;\n\trdfs:label \"Warning\"@en ;\n\trdfs:comment \"The severity for a warning validation result.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:detail\n\ta rdf:Property ;\n\trdfs:label \"detail\"@en ;\n\trdfs:comment \"Links a result with other results that provide more details, for example to describe violations against nested shapes.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:range sh:AbstractResult ;\n\trdfs:isDefinedBy sh: .\n\nsh:focusNode\n\ta rdf:Property ;\n\trdfs:label \"focus node\"@en ;\n\trdfs:comment \"The focus node that was validated when the result was produced.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:isDefinedBy sh: .\n\nsh:resultMessage\n\ta rdf:Property ;\n\trdfs:label \"result message\"@en ;\n\trdfs:comment \"Human-readable messages explaining the cause of the result.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\t# range: xsd:string or rdf:langString\n\trdfs:isDefinedBy sh: .\n\nsh:resultPath\n\ta rdf:Property ;\n\trdfs:label \"result path\"@en ;\n\trdfs:comment \"The path of a validation result, based on the path of the validated property shape.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:resultSeverity\n\ta rdf:Property ;\n\trdfs:label \"result severity\"@en ;\n\trdfs:comment \"The severity of the result, e.g. warning.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:range sh:Severity ;\n\trdfs:isDefinedBy sh: .\n\nsh:sourceConstraint\n\ta rdf:Property ;\n\trdfs:label \"source constraint\"@en ;\n\trdfs:comment \"The constraint that was validated when the result was produced.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:isDefinedBy sh: .\n\nsh:sourceShape\n\ta rdf:Property ;\n\trdfs:label \"source shape\"@en ;\n\trdfs:comment \"The shape that is was validated when the result was produced.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:range sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:sourceConstraintComponent\n\ta rdf:Property ;\n\trdfs:label \"source Constraint Component\"@en ;\n\trdfs:comment \"The constraint component that is the source of the result.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:range sh:ConstraintComponent ;\n\trdfs:isDefinedBy sh: .\n\nsh:value\n\ta rdf:Property ;\n\trdfs:label \"value\"@en ;\n\trdfs:comment \"An RDF node that has caused the result.\"@en ;\n\trdfs:domain sh:AbstractResult ;\n\trdfs:isDefinedBy sh: .\n\n\t\n# Graph properties ------------------------------------------------------------\n\nsh:shapesGraph\n\ta rdf:Property ;\n\trdfs:label \"shapes graph\"@en ;\n\trdfs:comment \"Shapes graphs that should be used when validating this data graph.\"@en ;\n\trdfs:domain owl:Ontology ;\n\trdfs:range owl:Ontology ;\n\trdfs:isDefinedBy sh: .\n\nsh:suggestedShapesGraph\n\ta rdf:Property ;\n\trdfs:label \"suggested shapes graph\"@en ;\n\trdfs:comment \"Suggested shapes graphs for this ontology. The values of this property may be used in the absence of specific sh:shapesGraph statements.\"@en ;\n\trdfs:domain owl:Ontology ;\n\trdfs:range owl:Ontology ;\n\trdfs:isDefinedBy sh: .\n\nsh:entailment\n\ta rdf:Property ;\n\trdfs:label \"entailment\"@en ;\n\trdfs:comment \"An entailment regime that indicates what kind of inferencing is required by a shapes graph.\"@en ;\n\trdfs:domain owl:Ontology ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\n\n# Path vocabulary -------------------------------------------------------------\n\nsh:path\n\ta rdf:Property ;\n\trdfs:label \"path\"@en ;\n\trdfs:comment \"Specifies the property path of a property shape.\"@en ;\n\trdfs:domain sh:PropertyShape ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:inversePath\n\ta rdf:Property ;\n\trdfs:label \"inverse path\"@en ;\n\trdfs:comment \"The (single) value of this property represents an inverse path (object to subject).\"@en ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:alternativePath\n\ta rdf:Property ;\n\trdfs:label \"alternative path\"@en ;\n\trdfs:comment \"The (single) value of this property must be a list of path elements, representing the elements of alternative paths.\"@en ;\n\trdfs:range rdf:List ;\n\trdfs:isDefinedBy sh: .\n\nsh:zeroOrMorePath\n\ta rdf:Property ;\n\trdfs:label \"zero or more path\"@en ;\n\trdfs:comment \"The (single) value of this property represents a path that is matched zero or more times.\"@en ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:oneOrMorePath\n\ta rdf:Property ;\n\trdfs:label \"one or more path\"@en ;\n\trdfs:comment \"The (single) value of this property represents a path that is matched one or more times.\"@en ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:zeroOrOnePath\n\ta rdf:Property ;\n\trdfs:label \"zero or one path\"@en ;\n\trdfs:comment \"The (single) value of this property represents a path that is matched zero or one times.\"@en ;\n\trdfs:range rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\n\n# Parameters metamodel --------------------------------------------------------\n\nsh:Parameterizable\n\ta rdfs:Class ;\n\trdfs:label \"Parameterizable\"@en ;\n\trdfs:comment \"Superclass of components that can take parameters, especially functions and constraint components.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:parameter\n\ta rdf:Property ;\n\trdfs:label \"parameter\"@en ;\n\trdfs:comment \"The parameters of a function or constraint component.\"@en ;\n\trdfs:domain sh:Parameterizable ;\n\trdfs:range sh:Parameter ;\n\trdfs:isDefinedBy sh: .\n\nsh:labelTemplate\n\ta rdf:Property ;\n\trdfs:label \"label template\"@en ;\n\trdfs:comment \"Outlines how human-readable labels of instances of the associated Parameterizable shall be produced. The values can contain {?paramName} as placeholders for the actual values of the given parameter.\"@en ;\n\trdfs:domain sh:Parameterizable ;\n\t# range: xsd:string or rdf:langString\n\trdfs:isDefinedBy sh: .\n\nsh:Parameter\n\ta rdfs:Class ;\n\trdfs:label \"Parameter\"@en ;\n\trdfs:comment \"The class of parameter declarations, consisting of a path predicate and (possibly) information about allowed value type, cardinality and other characteristics.\"@en ;\n\trdfs:subClassOf sh:PropertyShape ;\n\trdfs:isDefinedBy sh: .\n\nsh:optional\n\ta rdf:Property ;\n\trdfs:label \"optional\"@en ;\n\trdfs:comment \"Indicates whether a parameter is optional.\"@en ;\n\trdfs:domain sh:Parameter ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\n\n# Constraint components metamodel ---------------------------------------------\n\nsh:ConstraintComponent\n\ta rdfs:Class ;\n\trdfs:label \"Constraint Component\"@en ;\n\trdfs:comment \"The class of constraint components.\"@en ;\n\trdfs:subClassOf sh:Parameterizable ;\n\trdfs:isDefinedBy sh: .\n\nsh:validator\n\ta rdf:Property ;\n\trdfs:label \"validator\"@en ;\n\trdfs:comment \"The validator(s) used to evaluate constraints of either node or property shapes.\"@en ;\n\trdfs:domain sh:ConstraintComponent ;\n\trdfs:range sh:Validator ;\n\trdfs:isDefinedBy sh: .\n\nsh:nodeValidator\n\ta rdf:Property ;\n\trdfs:label \"shape validator\"@en ;\n\trdfs:comment \"The validator(s) used to evaluate a constraint in the context of a node shape.\"@en ;\n\trdfs:domain sh:ConstraintComponent ;\n\trdfs:range sh:Validator ;\n\trdfs:isDefinedBy sh: .\n\nsh:propertyValidator\n\ta rdf:Property ;\n\trdfs:label \"property validator\"@en ;\n\trdfs:comment \"The validator(s) used to evaluate a constraint in the context of a property shape.\"@en ;\n\trdfs:domain sh:ConstraintComponent ;\n\trdfs:range sh:Validator ;\n\trdfs:isDefinedBy sh: .\n\nsh:Validator\n\ta rdfs:Class ;\n\trdfs:label \"Validator\"@en ;\n\trdfs:comment \"The class of validators, which provide instructions on how to process a constraint definition. This class serves as base class for the SPARQL-based validators and other possible implementations.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLAskValidator\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL ASK Validator\"@en ;\n\trdfs:comment \"The class of validators based on SPARQL ASK queries. The queries are evaluated for each value node and are supposed to return true if the given node conforms.\"@en ;\n\trdfs:subClassOf sh:Validator ;\n\trdfs:subClassOf sh:SPARQLAskExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLSelectValidator\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL SELECT Validator\"@en ;\n\trdfs:comment \"The class of validators based on SPARQL SELECT queries. The queries are evaluated for each focus node and are supposed to produce bindings for all focus nodes that do not conform.\"@en ;\n\trdfs:subClassOf sh:Validator ;\n\trdfs:subClassOf sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\n\n# Library of Core Constraint Components and their properties ------------------\n\nsh:AndConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"And Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to test whether a value node conforms to all members of a provided list of shapes.\"@en ;\n\tsh:parameter sh:AndConstraintComponent-and ;\n\trdfs:isDefinedBy sh: .\n\nsh:AndConstraintComponent-and\n\ta sh:Parameter ;\n\tsh:path sh:and ;\n\trdfs:isDefinedBy sh: .\n\nsh:and\n\ta rdf:Property ;\n\trdfs:label \"and\"@en ;\n\trdfs:comment \"RDF list of shapes to validate the value nodes against.\"@en ;\n\trdfs:range rdf:List ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:ClassConstraintComponent \n\ta sh:ConstraintComponent ;\n\trdfs:label \"Class Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that each value node is an instance of a given type.\"@en ;\n\tsh:parameter sh:ClassConstraintComponent-class ;\n\trdfs:isDefinedBy sh: .\n\nsh:ClassConstraintComponent-class\n\ta sh:Parameter ;\n\tsh:path sh:class ;\n\tsh:nodeKind sh:IRI ;\n\trdfs:isDefinedBy sh: .\n\nsh:class\n\ta rdf:Property ;\n\trdfs:label \"class\"@en ;\n\trdfs:comment \"The type that all value nodes must have.\"@en ;\n\trdfs:range rdfs:Class ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:ClosedConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Closed Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to indicate that focus nodes must only have values for those properties that have been explicitly enumerated via sh:property/sh:path.\"@en ;\n\tsh:parameter sh:ClosedConstraintComponent-closed ;\n\tsh:parameter sh:ClosedConstraintComponent-ignoredProperties ;\n\trdfs:isDefinedBy sh: .\n\nsh:ClosedConstraintComponent-closed\n\ta sh:Parameter ; \n\tsh:path sh:closed ;\n\tsh:datatype xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\nsh:ClosedConstraintComponent-ignoredProperties\n\ta sh:Parameter ;\n\tsh:path sh:ignoredProperties ;\n\tsh:optional true ;\n\trdfs:isDefinedBy sh: .\n\nsh:closed\n\ta rdf:Property ;\n\trdfs:label \"closed\"@en ;\n\trdfs:comment \"If set to true then the shape is closed.\"@en ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\nsh:ignoredProperties\n\ta rdf:Property ;\n\trdfs:label \"ignored properties\"@en ;\n\trdfs:comment \"An optional RDF list of properties that are also permitted in addition to those explicitly enumerated via sh:property/sh:path.\"@en ;\n\trdfs:range rdf:List ;    # members: rdf:Property\n\trdfs:isDefinedBy sh: .\n\n\nsh:DatatypeConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Datatype Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the datatype of all value nodes.\"@en ;\n\tsh:parameter sh:DatatypeConstraintComponent-datatype ;\n\trdfs:isDefinedBy sh: .\n\nsh:DatatypeConstraintComponent-datatype\n\ta sh:Parameter ;\n\tsh:path sh:datatype ;\n\tsh:nodeKind sh:IRI ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:datatype\n\ta rdf:Property ;\n\trdfs:label \"datatype\"@en ;\n\trdfs:comment \"Specifies an RDF datatype that all value nodes must have.\"@en ;\n\trdfs:range rdfs:Datatype ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:DisjointConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Disjoint Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that the set of value nodes is disjoint with the the set of nodes that have the focus node as subject and the value of a given property as predicate.\"@en ;\n\tsh:parameter sh:DisjointConstraintComponent-disjoint ;\n\trdfs:isDefinedBy sh: .\n\nsh:DisjointConstraintComponent-disjoint\n\ta sh:Parameter ;\n\tsh:path sh:disjoint ;\n\tsh:nodeKind sh:IRI ;\n\trdfs:isDefinedBy sh: .\n\nsh:disjoint\n\ta rdf:Property ;\n\trdfs:label \"disjoint\"@en ;\n\trdfs:comment \"Specifies a property where the set of values must be disjoint with the value nodes.\"@en ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:EqualsConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Equals Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that the set of value nodes is equal to the set of nodes that have the focus node as subject and the value of a given property as predicate.\"@en ;\n\tsh:parameter sh:EqualsConstraintComponent-equals ;\n\trdfs:isDefinedBy sh: .\n\nsh:EqualsConstraintComponent-equals\n\ta sh:Parameter ;\n\tsh:path sh:equals ;\n\tsh:nodeKind sh:IRI ;\n\trdfs:isDefinedBy sh: .\n\nsh:equals\n\ta rdf:Property ;\n\trdfs:label \"equals\"@en ;\n\trdfs:comment \"Specifies a property that must have the same values as the value nodes.\"@en ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:HasValueConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Has-value Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that one of the value nodes is a given RDF node.\"@en ;\n\tsh:parameter sh:HasValueConstraintComponent-hasValue ;\n\trdfs:isDefinedBy sh: .\n\nsh:HasValueConstraintComponent-hasValue\n\ta sh:Parameter ;\n\tsh:path sh:hasValue ;\n\trdfs:isDefinedBy sh: .\n\nsh:hasValue\n\ta rdf:Property ;\n\trdfs:label \"has value\"@en ;\n\trdfs:comment \"Specifies a value that must be among the value nodes.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:InConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"In Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to exclusively enumerate the permitted value nodes.\"@en ;\n\tsh:parameter sh:InConstraintComponent-in ;\n\trdfs:isDefinedBy sh: .\n\nsh:InConstraintComponent-in\n\ta sh:Parameter ;\n\tsh:path sh:in ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:in\n\ta rdf:Property ;\n\trdfs:label \"in\"@en ;\n\trdfs:comment \"Specifies a list of allowed values so that each value node must be among the members of the given list.\"@en ;\n\trdfs:range rdf:List ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:LanguageInConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Language-in Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to enumerate language tags that all value nodes must have.\"@en ;\n\tsh:parameter sh:LanguageInConstraintComponent-languageIn ;\n\trdfs:isDefinedBy sh: .\n\nsh:LanguageInConstraintComponent-languageIn\n\ta sh:Parameter ;\n\tsh:path sh:languageIn ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:languageIn\n\ta rdf:Property ;\n\trdfs:label \"language in\"@en ;\n\trdfs:comment \"Specifies a list of language tags that all value nodes must have.\"@en ;\n\trdfs:range rdf:List ;   # members: xsd:string\n\trdfs:isDefinedBy sh: .\n\n\nsh:LessThanConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Less-than Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that each value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate.\"@en ;\n\tsh:parameter sh:LessThanConstraintComponent-lessThan ;\n\trdfs:isDefinedBy sh: .\n\nsh:LessThanConstraintComponent-lessThan\n\ta sh:Parameter ;\n\tsh:path sh:lessThan ;\n\tsh:nodeKind sh:IRI ;\n\trdfs:isDefinedBy sh: .\n\nsh:lessThan\n\ta rdf:Property ;\n\trdfs:label \"less than\"@en ;\n\trdfs:comment \"Specifies a property that must have smaller values than the value nodes.\"@en ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:LessThanOrEqualsConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Less-than-or-equals Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that every value node is smaller than all the nodes that have the focus node as subject and the value of a given property as predicate.\"@en ;\n\tsh:parameter sh:LessThanOrEqualsConstraintComponent-lessThanOrEquals ;\n\trdfs:isDefinedBy sh: .\n\nsh:LessThanOrEqualsConstraintComponent-lessThanOrEquals\n\ta sh:Parameter ;\n\tsh:path sh:lessThanOrEquals ;\n\tsh:nodeKind sh:IRI ;\n\trdfs:isDefinedBy sh: .\n\nsh:lessThanOrEquals\n\ta rdf:Property ;\n\trdfs:label \"less than or equals\"@en ;\n\trdfs:comment \"Specifies a property that must have smaller or equal values than the value nodes.\"@en ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MaxCountConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Max-count Constraint ConstraintComponentomponent\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the maximum number of value nodes.\"@en ;\n\tsh:parameter sh:MaxCountConstraintComponent-maxCount ;\n\trdfs:isDefinedBy sh: .\n\nsh:MaxCountConstraintComponent-maxCount\n\ta sh:Parameter ;\n\tsh:path sh:maxCount ;\n\tsh:datatype xsd:integer ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:maxCount\n\ta rdf:Property ;\n\trdfs:label \"max count\"@en ;\n\trdfs:comment \"Specifies the maximum number of values in the set of value nodes.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MaxExclusiveConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Max-exclusive Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the range of value nodes with a maximum exclusive value.\"@en ;\n\tsh:parameter sh:MaxExclusiveConstraintComponent-maxExclusive ;\n\trdfs:isDefinedBy sh: .\n\nsh:MaxExclusiveConstraintComponent-maxExclusive\n\ta sh:Parameter ;\n\tsh:path sh:maxExclusive ;\n\tsh:maxCount 1 ;\n\tsh:nodeKind sh:Literal ;\n\trdfs:isDefinedBy sh: .\n\nsh:maxExclusive\n\ta rdf:Property ;\n\trdfs:label \"max exclusive\"@en ;\n\trdfs:comment \"Specifies the maximum exclusive value of each value node.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MaxInclusiveConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Max-inclusive Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the range of value nodes with a maximum inclusive value.\"@en ;\n\tsh:parameter sh:MaxInclusiveConstraintComponent-maxInclusive ;\n\trdfs:isDefinedBy sh: .\n\nsh:MaxInclusiveConstraintComponent-maxInclusive\n\ta sh:Parameter ;\n\tsh:path sh:maxInclusive ;\n\tsh:maxCount 1 ;\n\tsh:nodeKind sh:Literal ;\n\trdfs:isDefinedBy sh: .\n\nsh:maxInclusive\n\ta rdf:Property ;\n\trdfs:label \"max inclusive\"@en ;\n\trdfs:comment \"Specifies the maximum inclusive value of each value node.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MaxLengthConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Max-length Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the maximum string length of value nodes.\"@en ;\n\tsh:parameter sh:MaxLengthConstraintComponent-maxLength ;\n\trdfs:isDefinedBy sh: .\n\nsh:MaxLengthConstraintComponent-maxLength\n\ta sh:Parameter ;\n\tsh:path sh:maxLength ;\n\tsh:datatype xsd:integer ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:maxLength\n\ta rdf:Property ;\n\trdfs:label \"max length\"@en ;\n\trdfs:comment \"Specifies the maximum string length of each value node.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MinCountConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Min-count Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the minimum number of value nodes.\"@en ;\n\tsh:parameter sh:MinCountConstraintComponent-minCount ;\n\trdfs:isDefinedBy sh: .\n\nsh:MinCountConstraintComponent-minCount\n\ta sh:Parameter ;\n\tsh:path sh:minCount ;\n\tsh:datatype xsd:integer ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:minCount\n\ta rdf:Property ;\n\trdfs:label \"min count\"@en ;\n\trdfs:comment \"Specifies the minimum number of values in the set of value nodes.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MinExclusiveConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Min-exclusive Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the range of value nodes with a minimum exclusive value.\"@en ;\n\tsh:parameter sh:MinExclusiveConstraintComponent-minExclusive ;\n\trdfs:isDefinedBy sh: .\n\nsh:MinExclusiveConstraintComponent-minExclusive\n\ta sh:Parameter ;\n\tsh:path sh:minExclusive ;\n\tsh:maxCount 1 ;\n\tsh:nodeKind sh:Literal ;\n\trdfs:isDefinedBy sh: .\n\nsh:minExclusive\n\ta rdf:Property ;\n\trdfs:label \"min exclusive\"@en ;\n\trdfs:comment \"Specifies the minimum exclusive value of each value node.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MinInclusiveConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Min-inclusive Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the range of value nodes with a minimum inclusive value.\"@en ;\n\tsh:parameter sh:MinInclusiveConstraintComponent-minInclusive ;\n\trdfs:isDefinedBy sh: .\n\nsh:MinInclusiveConstraintComponent-minInclusive\n\ta sh:Parameter ;\n\tsh:path sh:minInclusive ;\n\tsh:maxCount 1 ;\n\tsh:nodeKind sh:Literal ;\n\trdfs:isDefinedBy sh: .\n\nsh:minInclusive\n\ta rdf:Property ;\n\trdfs:label \"min inclusive\"@en ;\n\trdfs:comment \"Specifies the minimum inclusive value of each value node.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:MinLengthConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Min-length Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the minimum string length of value nodes.\"@en ;\n\tsh:parameter sh:MinLengthConstraintComponent-minLength ;\n\trdfs:isDefinedBy sh: .\n\nsh:MinLengthConstraintComponent-minLength\n\ta sh:Parameter ;\n\tsh:path sh:minLength ;\n\tsh:datatype xsd:integer ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:minLength\n\ta rdf:Property ;\n\trdfs:label \"min length\"@en ;\n\trdfs:comment \"Specifies the minimum string length of each value node.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:NodeConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Node Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that all value nodes conform to the given node shape.\"@en ;\n\tsh:parameter sh:NodeConstraintComponent-node ;\n\trdfs:isDefinedBy sh: .\n\nsh:NodeConstraintComponent-node\n\ta sh:Parameter ;\n\tsh:path sh:node ;\n\trdfs:isDefinedBy sh: .\n\nsh:node\n\ta rdf:Property ;\n\trdfs:label \"node\"@en ;\n\trdfs:comment \"Specifies the node shape that all value nodes must conform to.\"@en ;\n\trdfs:range sh:NodeShape ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:NodeKindConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Node-kind Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the RDF node kind of each value node.\"@en ;\n\tsh:parameter sh:NodeKindConstraintComponent-nodeKind ;\n\trdfs:isDefinedBy sh: .\n\nsh:NodeKindConstraintComponent-nodeKind\n\ta sh:Parameter ;\n\tsh:path sh:nodeKind ;\n\tsh:in ( sh:BlankNode sh:IRI sh:Literal sh:BlankNodeOrIRI sh:BlankNodeOrLiteral sh:IRIOrLiteral ) ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:nodeKind\n\ta rdf:Property ;\n\trdfs:label \"node kind\"@en ;\n\trdfs:comment \"Specifies the node kind (e.g. IRI or literal) each value node.\"@en ;\n\trdfs:range sh:NodeKind ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:NotConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Not Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that value nodes do not conform to a given shape.\"@en ;\n\tsh:parameter sh:NotConstraintComponent-not ;\n\trdfs:isDefinedBy sh: .\n\nsh:NotConstraintComponent-not\n\ta sh:Parameter ;\n\tsh:path sh:not ;\n\trdfs:isDefinedBy sh: .\n\nsh:not\n\ta rdf:Property ;\n\trdfs:label \"not\"@en ;\n\trdfs:comment \"Specifies a shape that the value nodes must not conform to.\"@en ;\n\trdfs:range sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:OrConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Or Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the value nodes so that they conform to at least one out of several provided shapes.\"@en ;\n\tsh:parameter sh:OrConstraintComponent-or ;\n\trdfs:isDefinedBy sh: .\n\nsh:OrConstraintComponent-or\n\ta sh:Parameter ;\n\tsh:path sh:or ;\n\trdfs:isDefinedBy sh: .\n\nsh:or\n\ta rdf:Property ;\n\trdfs:label \"or\"@en ;\n\trdfs:comment \"Specifies a list of shapes so that the value nodes must conform to at least one of the shapes.\"@en ;\n\trdfs:range rdf:List ;    # members: sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:PatternConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Pattern Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that every value node matches a given regular expression.\"@en ;\n\tsh:parameter sh:PatternConstraintComponent-pattern ;\n\tsh:parameter sh:PatternConstraintComponent-flags ;\n\trdfs:isDefinedBy sh: .\n\nsh:PatternConstraintComponent-pattern\n\ta sh:Parameter ;\n\tsh:path sh:pattern ;\n\tsh:datatype xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:PatternConstraintComponent-flags\n\ta sh:Parameter ;\n\tsh:path sh:flags ;\n\tsh:datatype xsd:string ;\n\tsh:optional true ;\n\trdfs:isDefinedBy sh: .\n\nsh:flags\n\ta rdf:Property ;\n\trdfs:label \"flags\"@en ;\n\trdfs:comment \"An optional flag to be used with regular expression pattern matching.\"@en ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:pattern\n\ta rdf:Property ;\n\trdfs:label \"pattern\"@en ;\n\trdfs:comment \"Specifies a regular expression pattern that the string representations of the value nodes must match.\"@en ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:PropertyConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Property Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that all value nodes conform to the given property shape.\"@en ;\n\tsh:parameter sh:PropertyConstraintComponent-property ;\n\trdfs:isDefinedBy sh: .\n\nsh:PropertyConstraintComponent-property\n\ta sh:Parameter ;\n\tsh:path sh:property ;\n\trdfs:isDefinedBy sh: .\n\nsh:property\n\ta rdf:Property ;\n\trdfs:label \"property\"@en ;\n\trdfs:comment \"Links a shape to its property shapes.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range sh:PropertyShape ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:QualifiedMaxCountConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Qualified-max-count Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that a specified maximum number of value nodes conforms to a given shape.\"@en ;\n\tsh:parameter sh:QualifiedMaxCountConstraintComponent-qualifiedMaxCount ;\n\tsh:parameter sh:QualifiedMaxCountConstraintComponent-qualifiedValueShape ;\n\tsh:parameter sh:QualifiedMaxCountConstraintComponent-qualifiedValueShapesDisjoint ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMaxCountConstraintComponent-qualifiedMaxCount\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedMaxCount ;\n\tsh:datatype xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMaxCountConstraintComponent-qualifiedValueShape\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedValueShape ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMaxCountConstraintComponent-qualifiedValueShapesDisjoint\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedValueShapesDisjoint ;\n\tsh:datatype xsd:boolean ;\n\tsh:optional true ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:QualifiedMinCountConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Qualified-min-count Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that a specified minimum number of value nodes conforms to a given shape.\"@en ;\n\tsh:parameter sh:QualifiedMinCountConstraintComponent-qualifiedMinCount ;\n\tsh:parameter sh:QualifiedMinCountConstraintComponent-qualifiedValueShape ;\n\tsh:parameter sh:QualifiedMinCountConstraintComponent-qualifiedValueShapesDisjoint ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMinCountConstraintComponent-qualifiedMinCount\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedMinCount ;\n\tsh:datatype xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMinCountConstraintComponent-qualifiedValueShape\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedValueShape ;\n\trdfs:isDefinedBy sh: .\n\nsh:QualifiedMinCountConstraintComponent-qualifiedValueShapesDisjoint\n\ta sh:Parameter ;\n\tsh:path sh:qualifiedValueShapesDisjoint ;\n\tsh:datatype xsd:boolean ;\n\tsh:optional true ;\n\trdfs:isDefinedBy sh: .\n\nsh:qualifiedMaxCount\n\ta rdf:Property ;\n\trdfs:label \"qualified max count\"@en ;\n\trdfs:comment \"The maximum number of value nodes that can conform to the shape.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\nsh:qualifiedMinCount\n\ta rdf:Property ;\n\trdfs:label \"qualified min count\"@en ;\n\trdfs:comment \"The minimum number of value nodes that must conform to the shape.\"@en ;\n\trdfs:range xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\nsh:qualifiedValueShape\n\ta rdf:Property ;\n\trdfs:label \"qualified value shape\"@en ;\n\trdfs:comment \"The shape that a specified number of values must conform to.\"@en ;\n\trdfs:range sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\t\nsh:qualifiedValueShapesDisjoint\n\ta rdf:Property ;\n\trdfs:label \"qualified value shapes disjoint\"@en ;\n\trdfs:comment \"Can be used to mark the qualified value shape to be disjoint with its sibling shapes.\"@en ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:UniqueLangConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Unique-languages Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to specify that no pair of value nodes may use the same language tag.\"@en ;\n\tsh:parameter sh:UniqueLangConstraintComponent-uniqueLang ;\n\trdfs:isDefinedBy sh: .\n\nsh:UniqueLangConstraintComponent-uniqueLang\n\ta sh:Parameter ;\n\tsh:path sh:uniqueLang ;\n\tsh:datatype xsd:boolean ;\n\tsh:maxCount 1 ;\n\trdfs:isDefinedBy sh: .\n\nsh:uniqueLang\n\ta rdf:Property ;\n\trdfs:label \"unique languages\"@en ;\n\trdfs:comment \"Specifies whether all node values must have a unique (or no) language tag.\"@en ;\n\trdfs:range xsd:boolean ;\n\trdfs:isDefinedBy sh: .\n\n\nsh:XoneConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Exactly one Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to restrict the value nodes so that they conform to exactly one out of several provided shapes.\"@en ;\n\tsh:parameter sh:XoneConstraintComponent-xone ;\n\trdfs:isDefinedBy sh: .\n\nsh:XoneConstraintComponent-xone\n\ta sh:Parameter ;\n\tsh:path sh:xone ;\n\trdfs:isDefinedBy sh: .\n\nsh:xone\n\ta rdf:Property ;\n\trdfs:label \"exactly one\"@en ;\n\trdfs:comment \"Specifies a list of shapes so that the value nodes must conform to exactly one of the shapes.\"@en ;\n\trdfs:range rdf:List ;    # members: sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\n\n# General SPARQL execution support --------------------------------------------\n\nsh:SPARQLExecutable\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL Executable\"@en ;\n\trdfs:comment \"The class of resources that encapsulate a SPARQL query.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLAskExecutable\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL ASK Executable\"@en ;\n\trdfs:comment \"The class of SPARQL executables that are based on an ASK query.\"@en ;\n\trdfs:subClassOf sh:SPARQLExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:ask\n\ta rdf:Property ;\n\trdfs:label \"ask\"@en ;\n\trdfs:comment \"The SPARQL ASK query to execute.\"@en ;\n\trdfs:domain sh:SPARQLAskExecutable ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLConstructExecutable\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL CONSTRUCT Executable\"@en ;\n\trdfs:comment \"The class of SPARQL executables that are based on a CONSTRUCT query.\"@en ;\n\trdfs:subClassOf sh:SPARQLExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:construct\n\ta rdf:Property ;\n\trdfs:label \"construct\"@en ;\n\trdfs:comment \"The SPARQL CONSTRUCT query to execute.\"@en ;\n\trdfs:domain sh:SPARQLConstructExecutable ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLSelectExecutable\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL SELECT Executable\"@en ;\n\trdfs:comment \"The class of SPARQL executables based on a SELECT query.\"@en ;\n\trdfs:subClassOf sh:SPARQLExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:select\n\ta rdf:Property ;\n\trdfs:label \"select\"@en ;\n\trdfs:comment \"The SPARQL SELECT query to execute.\"@en ;\n\trdfs:range xsd:string ;\n\trdfs:domain sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLUpdateExecutable\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL UPDATE Executable\"@en ;\n\trdfs:comment \"The class of SPARQL executables based on a SPARQL UPDATE.\"@en ;\n\trdfs:subClassOf sh:SPARQLExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:update\n\ta rdf:Property ;\n\trdfs:label \"update\"@en ;\n\trdfs:comment \"The SPARQL UPDATE to execute.\"@en ;\n\trdfs:domain sh:SPARQLUpdateExecutable ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:prefixes\n\ta rdf:Property ;\n\trdfs:label \"prefixes\"@en ;\n\trdfs:comment \"The prefixes that shall be applied before parsing the associated SPARQL query.\"@en ;\n\trdfs:domain sh:SPARQLExecutable ;\n\trdfs:range owl:Ontology ;\n\trdfs:isDefinedBy sh: .\n\nsh:PrefixDeclaration\n\ta rdfs:Class ;\n\trdfs:label \"Prefix Declaration\"@en ;\n\trdfs:comment \"The class of prefix declarations, consisting of pairs of a prefix with a namespace.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:declare\n\ta rdf:Property ;\n\trdfs:label \"declare\"@en ;\n\trdfs:comment \"Links a resource with its namespace prefix declarations.\"@en ;\n\trdfs:domain owl:Ontology ;\n\trdfs:range sh:PrefixDeclaration ;\n\trdfs:isDefinedBy sh: .\n\nsh:prefix\n\ta rdf:Property ;\n\trdfs:label \"prefix\"@en ;\n\trdfs:comment \"The prefix of a prefix declaration.\"@en ;\n\trdfs:domain sh:PrefixDeclaration ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:namespace\n\ta rdf:Property ;\n\trdfs:label \"namespace\"@en ;\n\trdfs:comment \"The namespace associated with a prefix in a prefix declaration.\"@en ;\n\trdfs:domain sh:PrefixDeclaration ;\n\trdfs:range xsd:anyURI ;\n\trdfs:isDefinedBy sh: .\n\t\n\n# SPARQL-based Constraints support --------------------------------------------\n\nsh:SPARQLConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"SPARQL Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to define constraints based on SPARQL queries.\"@en ;\n\tsh:parameter sh:SPARQLConstraintComponent-sparql ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLConstraintComponent-sparql\n\ta sh:Parameter ;\n\tsh:path sh:sparql ;\n\trdfs:isDefinedBy sh: .\n\nsh:sparql\n\ta rdf:Property ;\n\trdfs:label \"constraint (in SPARQL)\"@en ;\n\trdfs:comment \"Links a shape with SPARQL constraints.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range sh:SPARQLConstraint ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLConstraint\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL Constraint\"@en ;\n\trdfs:comment \"The class of constraints based on SPARQL SELECT queries.\"@en ;\n\trdfs:subClassOf sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\n\n# Non-validating constraint properties ----------------------------------------\n\nsh:defaultValue\n\ta rdf:Property ;\n\trdfs:label \"default value\"@en ;\n\trdfs:comment \"A default value for a property, for example for user interface tools to pre-populate input fields.\"@en ;\n\trdfs:domain sh:PropertyShape ;\n\trdfs:isDefinedBy sh: .\n\nsh:description\n\ta rdf:Property ;\n\trdfs:label \"description\"@en ;\n\trdfs:comment \"Human-readable descriptions for the property in the context of the surrounding shape.\"@en ;\n\trdfs:domain sh:PropertyShape ;\n\t# range: xsd:string or rdf:langString\n\trdfs:isDefinedBy sh: .\n\nsh:group\n\ta rdf:Property ;\n\trdfs:label \"group\"@en ;\n\trdfs:comment \"Can be used to link to a property group to indicate that a property shape belongs to a group of related property shapes.\"@en ;\n\trdfs:domain sh:PropertyShape ;\n\trdfs:range sh:PropertyGroup ;\n\trdfs:isDefinedBy sh: .\n\nsh:name\n\ta rdf:Property ;\n\trdfs:label \"name\"@en ;\n\trdfs:comment \"Human-readable labels for the property in the context of the surrounding shape.\"@en ;\n\trdfs:domain sh:PropertyShape ;\n\t# range: xsd:string or rdf:langString\n\trdfs:isDefinedBy sh: .\n\nsh:order\n\ta rdf:Property ;\n\trdfs:label \"order\"@en ;\n\trdfs:comment \"Specifies the relative order of this compared to its siblings. For example use 0 for the first, 1 for the second.\"@en ;\n\t# range: xsd:decimal or xsd:integer ;\n\trdfs:isDefinedBy sh: .\n\nsh:PropertyGroup\n\ta rdfs:Class ;\n\trdfs:label \"Property Group\"@en ;\n\trdfs:comment \"Instances of this class represent groups of property shapes that belong together.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\n\n# -----------------------------------------------------------------------------\n# SHACL ADVANCED FEATURES -----------------------------------------------------\n# -----------------------------------------------------------------------------\n\t\n\n# Advanced Target vocabulary --------------------------------------------------\n\nsh:target\n\ta rdf:Property ;\n\trdfs:label \"target\"@en ;\n\trdfs:comment \"Links a shape to a target specified by an extension language, for example instances of sh:SPARQLTarget.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range sh:Target ;\n\trdfs:isDefinedBy sh: .\n\nsh:Target\n\ta rdfs:Class ;\n\trdfs:label \"Target\"@en ;\n\trdfs:comment \"The base class of targets such as those based on SPARQL queries.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:TargetType\n\ta rdfs:Class ;\n\trdfs:label \"Target Type\"@en ;\n\trdfs:comment \"The (meta) class for parameterizable targets.\tInstances of this are instantiated as values of the sh:target property.\"@en ;\n\trdfs:subClassOf rdfs:Class ;\n\trdfs:subClassOf sh:Parameterizable ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLTarget\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL Target\"@en ;\n\trdfs:comment \"The class of targets that are based on SPARQL queries.\"@en ;\n\trdfs:subClassOf sh:Target ;\n\trdfs:subClassOf sh:SPARQLAskExecutable ;\n\trdfs:subClassOf sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLTargetType\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL Target Type\"@en ;\n\trdfs:comment \"The (meta) class for parameterizable targets that are based on SPARQL queries.\"@en ;\n\trdfs:subClassOf sh:TargetType ;\n\trdfs:subClassOf sh:SPARQLAskExecutable ;\n\trdfs:subClassOf sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\n\n# Functions Vocabulary --------------------------------------------------------\n\nsh:Function\n\ta rdfs:Class ;\n\trdfs:label \"Function\"@en ;\n\trdfs:comment \"The class of SHACL functions.\"@en ;\n\trdfs:subClassOf sh:Parameterizable ;\n\trdfs:isDefinedBy sh: .\n\nsh:returnType\n\ta rdf:Property ;\n\trdfs:label \"return type\"@en ;\n\trdfs:comment \"The expected type of values returned by the associated function.\"@en ;\n\trdfs:domain sh:Function ;\n\trdfs:range rdfs:Class ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLFunction\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL Function\"@en ;\n\trdfs:comment \"A function backed by a SPARQL query - either ASK or SELECT.\"@en ;\n\trdfs:subClassOf sh:Function ;\n\trdfs:subClassOf sh:SPARQLAskExecutable ;\n\trdfs:subClassOf sh:SPARQLSelectExecutable ;\n\trdfs:isDefinedBy sh: .\n\n\n# Result Annotations ----------------------------------------------------------\n\nsh:resultAnnotation\n\ta rdf:Property ;\n\trdfs:label \"result annotation\"@en ;\n\trdfs:comment \"Links a SPARQL validator with zero or more sh:ResultAnnotation instances, defining how to derive additional result properties based on the variables of the SELECT query.\"@en ;\n\trdfs:domain sh:SPARQLSelectValidator ;\n\trdfs:range sh:ResultAnnotation ;\n\trdfs:isDefinedBy sh: .\n\nsh:ResultAnnotation\n\ta rdfs:Class ;\n\trdfs:label \"Result Annotation\"@en ;\n\trdfs:comment \"A class of result annotations, which define the rules to derive the values of a given annotation property as extra values for a validation result.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:annotationProperty\n\ta rdf:Property ;\n\trdfs:label \"annotation property\"@en ;\n\trdfs:comment \"The annotation property that shall be set.\"@en ;\n\trdfs:domain sh:ResultAnnotation ;\n\trdfs:range rdf:Property ;\n\trdfs:isDefinedBy sh: .\n\nsh:annotationValue\n\ta rdf:Property ;\n\trdfs:label \"annotation value\"@en ;\n\trdfs:comment \"The (default) values of the annotation property.\"@en ;\n\trdfs:domain sh:ResultAnnotation ;\n\trdfs:isDefinedBy sh: .\n\nsh:annotationVarName\n\ta rdf:Property ;\n\trdfs:label \"annotation variable name\"@en ;\n\trdfs:comment \"The name of the SPARQL variable from the SELECT clause that shall be used for the values.\"@en ;\n\trdfs:domain sh:ResultAnnotation ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\n\t\n# Node Expressions ------------------------------------------------------------\n\nsh:this\n\ta rdfs:Resource ;\n\trdfs:label \"this\"@en ;\n\trdfs:comment \"A node expression that represents the current focus node.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:filterShape\n\ta rdf:Property ;\n\trdfs:label \"filter shape\"@en ;\n\trdfs:comment \"The shape that all input nodes of the expression need to conform to.\"@en ;\n\trdfs:range sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:nodes\n\ta rdf:Property ;\n\trdfs:label \"nodes\"@en ;\n\trdfs:comment \"The node expression producing the input nodes of a filter shape expression.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:intersection\n\ta rdf:Property ;\n\trdfs:label \"intersection\"@en ;\n\trdfs:comment \"A list of node expressions that shall be intersected.\"@en ;\n\trdfs:isDefinedBy sh: .\n\nsh:union\n\ta rdf:Property ;\n\trdfs:label \"union\"@en ;\n\trdfs:comment \"A list of node expressions that shall be used together.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\n# Expression Constraints ------------------------------------------------------\n\nsh:ExpressionConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"Expression Constraint Component\"@en ;\n\trdfs:comment \"A constraint component that can be used to verify that a given node expression produces true for all value nodes.\"@en ;\n\tsh:parameter sh:ExpressionConstraintComponent-expression ;\n\trdfs:isDefinedBy sh: .\n\nsh:ExpressionConstraintComponent-expression\n\ta sh:Parameter ;\n\tsh:path sh:expression ;\n\trdfs:isDefinedBy sh: .\n\nsh:expression\n\ta rdf:Property ;\n\trdfs:label \"expression\"@en ;\n\trdfs:comment \"The node expression that must return true for the value nodes.\"@en ;\n\trdfs:isDefinedBy sh: .\n\n\n# Rules -----------------------------------------------------------------------\n\nsh:Rule\n\ta rdfs:Class ;\n\trdfs:label \"Rule\"@en ;\n\trdfs:comment \"The class of SHACL rules. Never instantiated directly.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:rule\n\ta rdf:Property ;\n\trdfs:label \"rule\"@en ;\n\trdfs:comment \"The rules linked to a shape.\"@en ;\n\trdfs:domain sh:Shape ;\n\trdfs:range sh:Rule ;\n\trdfs:isDefinedBy sh:  .\n\nsh:condition\n\ta rdf:Property ;\n\trdfs:label \"condition\"@en ;\n\trdfs:comment \"The shapes that the focus nodes need to conform to before a rule is executed on them.\"@en ;\n\trdfs:domain sh:Rule ;\n\trdfs:range sh:Shape ;\n\trdfs:isDefinedBy sh: .\n\nsh:TripleRule\n\ta rdfs:Class ;\n\trdfs:label \"Triple Rule\"@en ;\n\trdfs:comment \"A rule based on triple (subject, predicate, object) pattern.\"@en ;\n\trdfs:subClassOf sh:Rule ;\n\trdfs:isDefinedBy sh: .\n\nsh:subject\n\ta rdf:Property ;\n\trdfs:label \"subject\"@en ;\n\trdfs:comment \"An expression producing the resources that shall be inferred as subjects.\"@en ;\n\trdfs:domain sh:TripleRule ;\n\trdfs:isDefinedBy sh: .\n\nsh:predicate\n\ta rdf:Property ;\n\trdfs:label \"predicate\"@en ;\n\trdfs:comment \"An expression producing the properties that shall be inferred as predicates.\"@en ;\n\trdfs:domain sh:TripleRule ;\n\trdfs:isDefinedBy sh: .\n\nsh:object\n\ta rdf:Property ;\n\trdfs:label \"object\"@en ;\n\trdfs:comment \"An expression producing the nodes that shall be inferred as objects.\"@en ;\n\trdfs:domain sh:TripleRule ;\n\trdfs:isDefinedBy sh: .\n\nsh:SPARQLRule\n\ta rdfs:Class ;\n\trdfs:label \"SPARQL CONSTRUCT Rule\"@en ;\n\trdfs:comment \"The class of SHACL rules based on SPARQL CONSTRUCT queries.\"@en ;\n\trdfs:subClassOf sh:Rule ;\n\trdfs:subClassOf sh:SPARQLConstructExecutable ;\n\trdfs:isDefinedBy sh: .\n\n\n# SHACL-JS --------------------------------------------------------------------\n\nsh:JSExecutable\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Executable\"@en ;\n\trdfs:comment \"Abstract base class of resources that declare an executable JavaScript.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSTarget\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Target\"@en ;\n\trdfs:comment \"The class of targets that are based on JavaScript functions.\"@en ;\n\trdfs:subClassOf sh:Target ;\n\trdfs:subClassOf sh:JSExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSTargetType\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Target Type\"@en ;\n\trdfs:comment \"The (meta) class for parameterizable targets that are based on JavaScript functions.\"@en ;\n\trdfs:subClassOf sh:TargetType ;\n\trdfs:subClassOf sh:JSExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSConstraint\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Constraint\"@en ;\n\trdfs:comment \"The class of constraints backed by a JavaScript function.\"@en ;\n\trdfs:subClassOf sh:JSExecutable ;\n\trdfs:isDefinedBy sh: .\n\t\nsh:JSConstraintComponent\n\ta sh:ConstraintComponent ;\n\trdfs:label \"JavaScript Constraint Component\"@en ;\n\trdfs:comment \"A constraint component with the parameter sh:js linking to a sh:JSConstraint containing a sh:script.\"@en ;\n  \tsh:parameter sh:JSConstraint-js ;\n\trdfs:isDefinedBy sh: .\n \nsh:JSConstraint-js\n\ta sh:Parameter ;\n\tsh:path sh:js ;\n\trdfs:isDefinedBy sh: .\n\t\nsh:js\n\ta rdf:Property ;\n\trdfs:label \"JavaScript constraint\"@en ;\n\trdfs:comment \"Constraints expressed in JavaScript.\" ;\n  \trdfs:range sh:JSConstraint ;\n\trdfs:isDefinedBy sh: .\n\nsh:jsFunctionName\n\ta rdf:Property ;\n\trdfs:label \"JavaScript function name\"@en ;\n\trdfs:comment \"The name of the JavaScript function to execute.\"@en ;\n\trdfs:domain sh:JSExecutable ;\n\trdfs:range xsd:string ;\n\trdfs:isDefinedBy sh: .\n\nsh:jsLibrary\n\ta rdf:Property ;\n\trdfs:label \"JavaScript library\"@en ;\n  \trdfs:comment \"Declares which JavaScript libraries are needed to execute this.\"@en ;\n\trdfs:range sh:JSLibrary ;\n\trdfs:isDefinedBy sh: .\n\nsh:jsLibraryURL\n\ta rdf:Property ;\n\trdfs:label \"JavaScript library URL\"@en ;\n\trdfs:comment \"Declares the URLs of a JavaScript library. This should be the absolute URL of a JavaScript file. Implementations may redirect those to local files.\"@en ;\n\trdfs:domain sh:JSLibrary ;\n\trdfs:range xsd:anyURI ;\n\trdfs:isDefinedBy sh: .\n\t\nsh:JSFunction\n\ta rdfs:Class ;\n  \trdfs:label \"JavaScript Function\"@en ;\n\trdfs:comment \"The class of SHACL functions that execute a JavaScript function when called.\"@en ;\n\trdfs:subClassOf sh:Function ;\n\trdfs:subClassOf sh:JSExecutable ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSLibrary\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Library\"@en ;\n\trdfs:comment \"Represents a JavaScript library, typically identified by one or more URLs of files to include.\"@en ;\n\trdfs:subClassOf rdfs:Resource ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSRule\n\ta rdfs:Class ;\n\trdfs:label \"JavaScript Rule\"@en ;\n\trdfs:comment \"The class of SHACL rules expressed using JavaScript.\"@en ;\n\trdfs:subClassOf sh:JSExecutable ;\n\trdfs:subClassOf sh:Rule ;\n\trdfs:isDefinedBy sh: .\n\nsh:JSValidator\n\ta rdfs:Class ;\n  \trdfs:label \"JavaScript Validator\"@en ;\n\trdfs:comment \"A SHACL validator based on JavaScript. This can be used to declare SHACL constraint components that perform JavaScript-based validation when used.\"@en ;\n  \trdfs:subClassOf sh:JSExecutable ;\n  \trdfs:subClassOf sh:Validator ;\n  \trdfs:isDefinedBy sh: .\n`;\nexports.skos_xl = `@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix dct: <http://purl.org/dc/terms/> .\n@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix skos: <http://www.w3.org/2004/02/skos/core#> .\n\n<http://www.w3.org/2008/05/skos-xl> a owl:Ontology ;\n\tdct:creator \"Alistair Miles\" , \"Sean Bechhofer\" ;\n\trdfs:seeAlso <http://www.w3.org/2008/05/skos> ;\n\towl:imports <http://www.w3.org/2004/02/skos/core> ;\n\tdct:title \"SKOS XL Vocabulary\"@en ;\n\tdct:contributor \"Participants in W3C's Semantic Web Deployment Working Group.\" ;\n\tdct:description \"An RDF vocabulary extending SKOS and allowing the description and linking of lexical entities.\"@en .\n\n<http://www.w3.org/2008/05/skos-xl#Label> rdfs:label \"Label\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"A special class of lexical entities.\"@en ;\n\ta owl:Class ;\n\towl:disjointWith skos:Concept , skos:Collection , skos:ConceptScheme ;\n\trdfs:subClassOf _:node17168m7qhx2 .\n\n_:node17168m7qhx2 a owl:Restriction ;\n\towl:onProperty <http://www.w3.org/2008/05/skos-xl#literalForm> ;\n\towl:cardinality \"1\"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .\n\n<http://www.w3.org/2008/05/skos-xl#literalForm> rdfs:label \"literal form\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"The property skosxl:literalForm is used to give the literal form of an skosxl:Label.\"@en ;\n\trdfs:comment \"If two instances of the class skosxl:Label have the same literal form, they are not necessarily the same resource.\"@en ;\n\ta owl:DatatypeProperty ;\n\trdfs:domain <http://www.w3.org/2008/05/skos-xl#Label> ;\n\trdfs:comment \"The range of skosxl:literalForm is the class of RDF plain literals.\"@en ;\n\ta rdf:Property .\n\n<http://www.w3.org/2008/05/skos-xl#prefLabel> rdfs:label \"preferred label\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"The property skosxl:prefLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:prefLabel.\"@en ;\n\trdfs:seeAlso skos:prefLabel ;\n\ta owl:ObjectProperty ;\n\trdfs:range <http://www.w3.org/2008/05/skos-xl#Label> ;\n\trdfs:comment \"If C skosxl:prefLabel L and L skosxl:literalForm V, then X skos:prefLabel V.\"@en ;\n\ta rdf:Property .\n\n<http://www.w3.org/2008/05/skos-xl#altLabel> rdfs:label \"alternative label\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"The property skosxl:altLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:altLabel.\"@en ;\n\trdfs:seeAlso skos:altLabel ;\n\ta owl:ObjectProperty ;\n\trdfs:range <http://www.w3.org/2008/05/skos-xl#Label> ;\n\trdfs:comment \"If C skosxl:altLabel L and L skosxl:literalForm V, then X skos:altLabel V.\"@en ;\n\ta rdf:Property .\n\n<http://www.w3.org/2008/05/skos-xl#hiddenLabel> rdfs:label \"hidden label\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"The property skosxl:hiddenLabel is used to associate an skosxl:Label with a skos:Concept. The property is analogous to skos:hiddenLabel.\"@en ;\n\trdfs:seeAlso skos:hiddenLabel ;\n\ta owl:ObjectProperty ;\n\trdfs:range <http://www.w3.org/2008/05/skos-xl#Label> ;\n\trdfs:comment \"If C skosxl:hiddenLabel L and L skosxl:literalForm V, then C skos:hiddenLabel V.\"@en ;\n\ta rdf:Property .\n\n<http://www.w3.org/2008/05/skos-xl#labelRelation> rdfs:label \"label relation\"@en ;\n\trdfs:isDefinedBy <http://www.w3.org/2008/05/skos-xl> ;\n\tskos:definition \"The property skosxl:labelRelation is used for representing binary ('direct') relations between instances of the class skosxl:Label.\"@en ;\n\tskos:scopeNote \"skosxl:labelRelation is not intended to be used directly, but rather as the basis for a design pattern which can be refined for more specific labeling scenarios.\"@en ;\n\ta owl:ObjectProperty ;\n\trdfs:domain <http://www.w3.org/2008/05/skos-xl#Label> ;\n\trdfs:range <http://www.w3.org/2008/05/skos-xl#Label> ;\n\ta owl:SymmetricProperty , rdf:Property .\n`;\nexports.skos = `@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix dc: <http://purl.org/dc/terms/> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix skos: <http://www.w3.org/2004/02/skos/core#> .\n@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n\n<http://www.w3.org/2004/02/skos/core>\n  a owl:Ontology ;\n  dc:title \"SKOS Vocabulary\"@en ;\n  dc:contributor \"Dave Beckett\", \"Nikki Rogers\", \"Participants in W3C's Semantic Web Deployment Working Group.\" ;\n  dc:description \"An RDF vocabulary for describing the basic structure and content of concept schemes such as thesauri, classification schemes, subject heading lists, taxonomies, 'folksonomies', other types of controlled vocabulary, and also concept schemes embedded in glossaries and terminologies.\"@en ;\n  dc:creator \"Alistair Miles\", \"Sean Bechhofer\" ;\n  rdfs:seeAlso <http://www.w3.org/TR/skos-reference/> .\n\nskos:Concept\n  rdfs:label \"Concept\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"An idea or notion; a unit of thought.\"@en ;\n  a owl:Class .\n\nskos:ConceptScheme\n  rdfs:label \"Concept Scheme\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A set of concepts, optionally including statements about semantic relationships between those concepts.\"@en ;\n  skos:scopeNote \"A concept scheme may be defined to include concepts from different sources.\"@en ;\n  skos:example \"Thesauri, classification schemes, subject heading lists, taxonomies, 'folksonomies', and other types of controlled vocabulary are all examples of concept schemes. Concept schemes are also embedded in glossaries and terminologies.\"@en ;\n  a owl:Class ;\n  owl:disjointWith skos:Concept .\n\nskos:Collection\n  rdfs:label \"Collection\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A meaningful collection of concepts.\"@en ;\n  skos:scopeNote \"Labelled collections can be used where you would like a set of concepts to be displayed under a 'node label' in the hierarchy.\"@en ;\n  a owl:Class ;\n  owl:disjointWith skos:Concept, skos:ConceptScheme .\n\nskos:OrderedCollection\n  rdfs:label \"Ordered Collection\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"An ordered collection of concepts, where both the grouping and the ordering are meaningful.\"@en ;\n  skos:scopeNote \"Ordered collections can be used where you would like a set of concepts to be displayed in a specific order, and optionally under a 'node label'.\"@en ;\n  a owl:Class ;\n  rdfs:subClassOf skos:Collection .\n\nskos:inScheme\n  rdfs:label \"is in scheme\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a resource (for example a concept) to a concept scheme in which it is included.\"@en ;\n  skos:scopeNote \"A concept may be a member of more than one concept scheme.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:range skos:ConceptScheme .\n\nskos:hasTopConcept\n  rdfs:label \"has top concept\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates, by convention, a concept scheme to a concept which is topmost in the broader/narrower concept hierarchies for that scheme, providing an entry point to these hierarchies.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:domain skos:ConceptScheme ;\n  rdfs:range skos:Concept ;\n  owl:inverseOf skos:topConceptOf .\n\nskos:topConceptOf\n  rdfs:label \"is top concept in scheme\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a concept to the concept scheme that it is a top level concept of.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:inScheme ;\n  owl:inverseOf skos:hasTopConcept ;\n  rdfs:domain skos:Concept ;\n  rdfs:range skos:ConceptScheme .\n\nskos:prefLabel\n  rdfs:label \"preferred label\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"The preferred lexical label for a resource, in a given language.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf rdfs:label ;\n  rdfs:comment \"A resource has no more than one value of skos:prefLabel per language tag, and no more than one value of skos:prefLabel without language tag.\"@en, \"The range of skos:prefLabel is the class of RDF plain literals.\"@en, \"\"\"skos:prefLabel, skos:altLabel and skos:hiddenLabel are pairwise\n      disjoint properties.\"\"\"@en .\n\nskos:altLabel\n  rdfs:label \"alternative label\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"An alternative lexical label for a resource.\"@en ;\n  skos:example \"Acronyms, abbreviations, spelling variants, and irregular plural/singular forms may be included among the alternative labels for a concept. Mis-spelled terms are normally included as hidden labels (see skos:hiddenLabel).\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf rdfs:label ;\n  rdfs:comment \"The range of skos:altLabel is the class of RDF plain literals.\"@en, \"skos:prefLabel, skos:altLabel and skos:hiddenLabel are pairwise disjoint properties.\"@en .\n\nskos:hiddenLabel\n  rdfs:label \"hidden label\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A lexical label for a resource that should be hidden when generating visual displays of the resource, but should still be accessible to free text search operations.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf rdfs:label ;\n  rdfs:comment \"The range of skos:hiddenLabel is the class of RDF plain literals.\"@en, \"skos:prefLabel, skos:altLabel and skos:hiddenLabel are pairwise disjoint properties.\"@en .\n\nskos:notation\n  rdfs:label \"notation\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"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.\"@en ;\n  skos:scopeNote \"By convention, skos:notation is used with a typed literal in the object position of the triple.\"@en ;\n  a owl:DatatypeProperty, rdf:Property .\n\nskos:note\n  rdfs:label \"note\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A general note, for any purpose.\"@en ;\n  skos:scopeNote \"This property may be used directly, or as a super-property for more specific note types.\"@en ;\n  a owl:AnnotationProperty, rdf:Property .\n\nskos:changeNote\n  rdfs:label \"change note\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A note about a modification to a concept.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:definition\n  rdfs:label \"definition\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A statement or formal explanation of the meaning of a concept.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:editorialNote\n  rdfs:label \"editorial note\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A note for an editor, translator or maintainer of the vocabulary.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:example\n  rdfs:label \"example\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"An example of the use of a concept.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:historyNote\n  rdfs:label \"history note\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A note about the past state/use/meaning of a concept.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:scopeNote\n  rdfs:label \"scope note\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"A note that helps to clarify the meaning and/or the use of a concept.\"@en ;\n  a owl:AnnotationProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:note .\n\nskos:semanticRelation\n  rdfs:label \"is in semantic relation with\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Links a concept to a concept related by meaning.\"@en ;\n  skos:scopeNote \"This property should not be used directly, but as a super-property for all properties denoting a relationship of meaning between concepts.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:domain skos:Concept ;\n  rdfs:range skos:Concept .\n\nskos:broader\n  rdfs:label \"has broader\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a concept to a concept that is more general in meaning.\"@en ;\n  rdfs:comment \"Broader concepts are typically rendered as parents in a concept hierarchy (tree).\"@en ;\n  skos:scopeNote \"By convention, skos:broader is only used to assert an immediate (i.e. direct) hierarchical link between two conceptual resources.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:broaderTransitive ;\n  owl:inverseOf skos:narrower .\n\nskos:narrower\n  rdfs:label \"has narrower\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a concept to a concept that is more specific in meaning.\"@en ;\n  skos:scopeNote \"By convention, skos:broader is only used to assert an immediate (i.e. direct) hierarchical link between two conceptual resources.\"@en ;\n  rdfs:comment \"Narrower concepts are typically rendered as children in a concept hierarchy (tree).\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:narrowerTransitive ;\n  owl:inverseOf skos:broader .\n\nskos:related\n  rdfs:label \"has related\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a concept to a concept with which there is an associative semantic relationship.\"@en ;\n  a owl:ObjectProperty, owl:SymmetricProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:semanticRelation ;\n  rdfs:comment \"skos:related is disjoint with skos:broaderTransitive\"@en .\n\nskos:broaderTransitive\n  rdfs:label \"has broader transitive\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:broaderTransitive is a transitive superproperty of skos:broader.\" ;\n  skos:scopeNote \"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.\"@en ;\n  a owl:ObjectProperty, owl:TransitiveProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:semanticRelation ;\n  owl:inverseOf skos:narrowerTransitive .\n\nskos:narrowerTransitive\n  rdfs:label \"has narrower transitive\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:narrowerTransitive is a transitive superproperty of skos:narrower.\" ;\n  skos:scopeNote \"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.\"@en ;\n  a owl:ObjectProperty, owl:TransitiveProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:semanticRelation ;\n  owl:inverseOf skos:broaderTransitive .\n\nskos:member\n  rdfs:label \"has member\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates a collection to one of its members.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:domain skos:Collection ;\n  rdfs:range [\n    a owl:Class ;\n    owl:unionOf (\n     skos:Concept\n     skos:Collection\n   )\n  ] .\n\nskos:memberList\n  rdfs:label \"has member list\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates an ordered collection to the RDF list containing its members.\"@en ;\n  a owl:ObjectProperty, owl:FunctionalProperty, rdf:Property ;\n  rdfs:domain skos:OrderedCollection ;\n  rdfs:range rdf:List ;\n  rdfs:comment \"\"\"For any resource, every item in the list given as the value of the\n      skos:memberList property is also a value of the skos:member property.\"\"\"@en .\n\nskos:mappingRelation\n  rdfs:label \"is in mapping relation with\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"Relates two concepts coming, by convention, from different schemes, and that have comparable meanings\"@en ;\n  rdfs:comment \"These concept mapping relations mirror semantic relations, and the data model defined below is similar (with the exception of skos:exactMatch) to the data model defined for semantic relations. A distinct vocabulary is provided for concept mapping relations, to provide a convenient way to differentiate links within a concept scheme from links between concept schemes. However, this pattern of usage is not a formal requirement of the SKOS data model, and relies on informal definitions of best practice.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:semanticRelation .\n\nskos:broadMatch\n  rdfs:label \"has broader match\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:broadMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:mappingRelation, skos:broader ;\n  owl:inverseOf skos:narrowMatch .\n\nskos:narrowMatch\n  rdfs:label \"has narrower match\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:narrowMatch is used to state a hierarchical mapping link between two conceptual resources in different concept schemes.\"@en ;\n  a owl:ObjectProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:mappingRelation, skos:narrower ;\n  owl:inverseOf skos:broadMatch .\n\nskos:relatedMatch\n  rdfs:label \"has related match\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:relatedMatch is used to state an associative mapping link between two conceptual resources in different concept schemes.\"@en ;\n  a owl:ObjectProperty, owl:SymmetricProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:mappingRelation, skos:related .\n\nskos:exactMatch\n  rdfs:label \"has exact match\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:exactMatch is used to link two concepts, indicating a high degree of confidence that the concepts can be used interchangeably across a wide range of information retrieval applications. skos:exactMatch is a transitive property, and is a sub-property of skos:closeMatch.\"@en ;\n  a owl:ObjectProperty, owl:SymmetricProperty, owl:TransitiveProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:closeMatch ;\n  rdfs:comment \"skos:exactMatch is disjoint with each of the properties skos:broadMatch and skos:relatedMatch.\"@en .\n\nskos:closeMatch\n  rdfs:label \"has close match\"@en ;\n  rdfs:isDefinedBy <http://www.w3.org/2004/02/skos/core> ;\n  skos:definition \"skos:closeMatch is used to link two concepts that are sufficiently similar that they can be used interchangeably in some information retrieval applications. In order to avoid the possibility of 'compound errors' when combining mappings across more than two concept schemes, skos:closeMatch is not declared to be a transitive property.\"@en ;\n  a owl:ObjectProperty, owl:SymmetricProperty, rdf:Property ;\n  rdfs:subPropertyOf skos:mappingRelation .`;\nexports.xsd = `@prefix owl: <http://www.w3.org/2002/07/owl#> .\n@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .\n@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .\n@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .\n@prefix vann: <http://purl.org/vocab/vann/> .\n\nxsd: a owl:Ontology ;\n    rdfs:label \"W3C XML Schema Definition Language (XSD) 1.1 Part 2: Datatypes\" ;\n    rdfs:seeAlso <https://www.w3.org/TR/xmlschema11-2/#built-in-primitive-datatypes> .\n\nxsd:anyURI a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:base64Binary a rdfs:Datatype ;\n    rdfs:comment \"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].\" .\n\nxsd:boolean a rdfs:Datatype ;\n    rdfs:comment \"boolean represents the values of two-valued logic.\" .\n\nxsd:byte a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:date a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:dateTime a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:decimal a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:double a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:duration a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:float a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:int a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:integer a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:long a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:negativeInteger a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:nonNegativeInteger a rdfs:Datatype .\n\nxsd:nonPositiveInteger a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:positiveInteger a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:short a rdfs:Datatype ;\n    rdfs:comment \"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.\" .\n\nxsd:string a rdfs:Datatype ;\n    rdfs:comment \"The string datatype represents character strings in XML.\" .\n\nxsd:time a rdfs:Datatype ;\n    rdfs:comment \"time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day.\" .\n\nxsd:unsignedInt a rdfs:Datatype ;\n    rdfs:comment \"unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong.\" .\n\nxsd:unsignedShort a rdfs:Datatype ;\n    rdfs:comment \"unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt.\" .\n\nxsd:unsingedLong a rdfs:Datatype ;\n    rdfs:comment \"unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger.\" .\n\nxsd:usignedByte a rdfs:Datatype ;\n    rdfs:comment \"unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort.\" .`;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/src.ts?");
+
+/***/ }),
+
+/***/ "./src/ontologies/xsd.ts":
+/*!*******************************!*\
+  !*** ./src/ontologies/xsd.ts ***!
+  \*******************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.xsd = exports._xsd = exports.XSD = exports._XSD = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\n/** Namespace URI of the XSD vocabulary. */\nexports._XSD = 'http://www.w3.org/2001/XMLSchema#';\nexports.XSD = {\n    /** 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. */\n    'anyURI': 'http://www.w3.org/2001/XMLSchema#anyURI',\n    /** 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]. */\n    'base64Binary': 'http://www.w3.org/2001/XMLSchema#base64Binary',\n    /** boolean represents the values of two-valued logic. */\n    'boolean': 'http://www.w3.org/2001/XMLSchema#boolean',\n    /** 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. */\n    'byte': 'http://www.w3.org/2001/XMLSchema#byte',\n    /** 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. */\n    'date': 'http://www.w3.org/2001/XMLSchema#date',\n    /** 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. */\n    'dateTime': 'http://www.w3.org/2001/XMLSchema#dateTime',\n    /** 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. */\n    'decimal': 'http://www.w3.org/2001/XMLSchema#decimal',\n    /** 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. */\n    'double': 'http://www.w3.org/2001/XMLSchema#double',\n    /** 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. */\n    'duration': 'http://www.w3.org/2001/XMLSchema#duration',\n    /** 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. */\n    'float': 'http://www.w3.org/2001/XMLSchema#float',\n    /** 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. */\n    'int': 'http://www.w3.org/2001/XMLSchema#int',\n    /** 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. */\n    'integer': 'http://www.w3.org/2001/XMLSchema#integer',\n    /** 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. */\n    'long': 'http://www.w3.org/2001/XMLSchema#long',\n    /** 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. */\n    'negativeInteger': 'http://www.w3.org/2001/XMLSchema#negativeInteger',\n    'nonNegativeInteger': 'http://www.w3.org/2001/XMLSchema#nonNegativeInteger',\n    /** 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. */\n    'nonPositiveInteger': 'http://www.w3.org/2001/XMLSchema#nonPositiveInteger',\n    /** 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. */\n    'positiveInteger': 'http://www.w3.org/2001/XMLSchema#positiveInteger',\n    /** 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. */\n    'short': 'http://www.w3.org/2001/XMLSchema#short',\n    /** The string datatype represents character strings in XML. */\n    'string': 'http://www.w3.org/2001/XMLSchema#string',\n    /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */\n    'time': 'http://www.w3.org/2001/XMLSchema#time',\n    /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */\n    'unsignedInt': 'http://www.w3.org/2001/XMLSchema#unsignedInt',\n    /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */\n    'unsignedShort': 'http://www.w3.org/2001/XMLSchema#unsignedShort',\n    /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */\n    'unsingedLong': 'http://www.w3.org/2001/XMLSchema#unsingedLong',\n    /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */\n    'usignedByte': 'http://www.w3.org/2001/XMLSchema#usignedByte',\n};\n/** Namespace URI of the xsd vocabulary. */\nexports._xsd = new n3.NamedNode('http://www.w3.org/2001/XMLSchema#');\nexports.xsd = {\n    /** 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. */\n    'anyURI': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#anyURI'),\n    /** 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]. */\n    'base64Binary': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#base64Binary'),\n    /** boolean represents the values of two-valued logic. */\n    'boolean': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#boolean'),\n    /** 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. */\n    'byte': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#byte'),\n    /** 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. */\n    'date': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#date'),\n    /** 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. */\n    'dateTime': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#dateTime'),\n    /** 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. */\n    'decimal': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#decimal'),\n    /** 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. */\n    'double': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#double'),\n    /** 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. */\n    'duration': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#duration'),\n    /** 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. */\n    'float': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#float'),\n    /** 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. */\n    'int': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#int'),\n    /** 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. */\n    'integer': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#integer'),\n    /** 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. */\n    'long': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#long'),\n    /** 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. */\n    'negativeInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#negativeInteger'),\n    'nonNegativeInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#nonNegativeInteger'),\n    /** 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. */\n    'nonPositiveInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#nonPositiveInteger'),\n    /** 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. */\n    'positiveInteger': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#positiveInteger'),\n    /** 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. */\n    'short': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#short'),\n    /** The string datatype represents character strings in XML. */\n    'string': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#string'),\n    /** time represents instants of time that recur at the same point in each calendar day, or that occur in some arbitrary calendar day. */\n    'time': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#time'),\n    /** unsignedInt is ·derived· from unsignedLong by setting the value of ·maxInclusive· to be 4294967295.  The ·base type· of unsignedInt is unsignedLong. */\n    'unsignedInt': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsignedInt'),\n    /** unsignedShort is ·derived· from unsignedInt by setting the value of ·maxInclusive· to be 65535.  The ·base type· of unsignedShort is unsignedInt. */\n    'unsignedShort': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsignedShort'),\n    /** unsignedLong is ·derived· from nonNegativeInteger by setting the value of ·maxInclusive· to be 18446744073709551615.  The ·base type· of unsignedLong is nonNegativeInteger. */\n    'unsingedLong': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#unsingedLong'),\n    /** unsignedByte is ·derived· from unsignedShort by setting the value of ·maxInclusive· to be 255.  The ·base type· of unsignedByte is unsignedShort. */\n    'usignedByte': new n3.NamedNode('http://www.w3.org/2001/XMLSchema#usignedByte'),\n};\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/ontologies/xsd.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/class-repository.ts":
+/*!*************************************!*\
+  !*** ./src/rdf/class-repository.ts ***!
+  \*************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ClassRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst concept_repository_1 = __webpack_require__(/*! ./concept-repository */ \"./src/rdf/concept-repository.ts\");\n/**\n * A repository for retrieving classes from graphs.\n */\nclass ClassRepository extends concept_repository_1.ConceptRepository {\n    constructor(store) { super(store); }\n    /**\n     * Get all classes in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all classes in the repository.\n     */\n    getClasses(graphUris, options) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.rdfs.Class, options?.includeInferred)) {\n            if (!this.skip(graphUris, q.subject, options)) {\n                result.add(q.subject.value);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get the super classes of a given class.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of a class.\n     * @param options Optional query parameters.\n     * @returns An array of super classes of the given class, an empty array if the class has no super classes.\n     */\n    getSuperClasses(graphUris, subjectUri, options) {\n        const result = new Set();\n        const s = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.subClassOf, null, options?.includeInferred)) {\n            if (!this.skip(graphUris, q.object, options)) {\n                result.add(q.object.value);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get the first discovered path from a given class to a root class.\n     * @param subjectUri URI of a class.\n     * @returns A string array containing the first path that is found from the given class to a root class.\n     */\n    getRootClassPath(graphUris, subjectUri, options) {\n        return this._getRootClassPath(graphUris, subjectUri, [], new Set(), options);\n    }\n    /**\n     * Recursively find the first path from a given class to a root class.\n     * @param subjectUri URI of a class.\n     * @param path The current class path.\n     * @param backtrack Set of URIs that have already been visited.\n     * @returns The first path that is found from the given class to a root class.\n     */\n    _getRootClassPath(graphUris, subjectUri, path, backtrack, options) {\n        const superClasses = this.getSuperClasses(graphUris, subjectUri, options);\n        for (let o of superClasses.filter(o => !backtrack.has(o))) {\n            return this._getRootClassPath(graphUris, o, [...path, o], backtrack, options);\n        }\n        return path;\n    }\n    /**\n     * Indicate if there are sub classes of a given class.\n     * @param subjectUri URI of a class.\n     * @returns true if the class has sub classes, false otherwise.\n     */\n    hasSubClasses(graphUris, subjectUri, options) {\n        const o = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, o)) {\n            if (!this.skip(graphUris, q.subject, options)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Get the sub classes of a given class or all root classes.\n     * @param subjectUri URI of a class or undefined to get all root classes.\n     * @returns An array of sub classes of the given class, an empty array if the class has no sub classes.\n     */\n    getSubClasses(graphUris, subjectUri, options) {\n        if (subjectUri) {\n            const result = new Set();\n            const o = n3.DataFactory.namedNode(subjectUri);\n            for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, o, options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n            return Array.from(result);\n        }\n        else {\n            return this.getRootClasses(graphUris, options);\n        }\n    }\n    /**\n     * Recursively traverse all sub classes of a given class and invoke a callback.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param superClass The super class to start the traversal from.\n     * @param callback A function to call for each sub class. If the function returns `false`, the traversal stops.\n     * @param options Optional query parameters.\n     * @param visited A set of visited URIs.\n     * @returns `true` if the traversal was completed, `false` if it was stopped by the callback.\n     */\n    _traverseSubClasses(graphUris, superClass, callback, options, visited = new Set()) {\n        // Enumerate all sub classes of the given super class.\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subClassOf, superClass, options?.includeInferred)) {\n            // If it is not skipped and has not been visited yet, we call the callback function.\n            if (!this.skip(graphUris, q.subject, options) && !visited.has(q.subject.value)) {\n                visited.add(q.subject.value);\n                // If the callback returns false, we stop the traversal.\n                if (callback(q.subject)) {\n                    this._traverseSubClasses(graphUris, q.subject, callback, options, visited);\n                }\n                else {\n                    return false;\n                }\n            }\n        }\n        return true;\n    }\n    /**\n     * Get all sub classes of a given class, including indirect sub classes.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of a class.\n     * @param options Optional query parameters.\n     * @returns An array of all sub classes of the given class.\n     */\n    getAllSubClasses(graphUris, subjectUri, options) {\n        const result = new Set();\n        this._traverseSubClasses(graphUris, n3.DataFactory.namedNode(subjectUri), s => { result.add(s.value); return true; }, options);\n        return Array.from(result);\n    }\n    /**\n     * Indicate if there are instances of a given class or any of its sub classes.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param typeUri URI of the class.\n     * @param options Optional query parameters.\n     * @returns `true` if the class has instances, `false` otherwise.\n     */\n    hasSubjectsOfType(graphUris, typeUri, options) {\n        // TODO: Optimize implementation.\n        return this.getSubjectsOfType(graphUris, typeUri, options).length > 0;\n    }\n    /**\n     * Get all subjects of a given class in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param typeUri URI of the class.\n     * @param options Optional query parameters.\n     * @returns A list of all shapes in the repository.\n     */\n    getSubjectsOfType(graphUris, typeUri, options) {\n        const result = new Set();\n        if (options?.includeSubTypes === false) {\n            // 1. Get all subclasses of the given type from the repository -> ClassRepository.\n            const subclasses = new Set(this.getAllSubClasses(graphUris, typeUri));\n            // 2. Then get all triples that have a rdf:type predicate.\n            //  a) if the object matches the given type, add it to the result.\n            //  b) if the object is a subclass of the given type, remove it from the result.\n            const filtered = new Set();\n            for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, null, options?.includeInferred)) {\n                if (q.object.value == typeUri && !this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n                else if (subclasses.has(q.object.value)) {\n                    filtered.add(q.subject.value);\n                }\n            }\n            return Array.from(result).filter(x => !filtered.has(x));\n        }\n        else {\n            // TODO: This does not explicitly check the sub classes. Implement a unit test.\n            for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, new n3.NamedNode(typeUri), options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n            return Array.from(result);\n        }\n    }\n    /**\n     * Indicate if a given class is direct or indirect (inferred) sub class of another class.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of the sub class.\n     * @param classUri URI of the super class.\n     * @param options Optional query parameters.\n     * @returns `true` if the class is a sub class of the other class, false otherwise.\n     */\n    isSubClassOf(graphUris, subjectUri, classUri, options) {\n        return this.getRootClassPath(graphUris, subjectUri, options).includes(classUri);\n    }\n    /**\n     * Indicate if a given class is the intersection of classes.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of a class.\n     * @returns `true` if the class is the intersection of classes, `false` otherwise.\n     */\n    isIntersectionOfClasses(graphUris, subjectUri) {\n        const s = n3.DataFactory.namedNode(subjectUri);\n        if (this._isIntersectionOfClasses(graphUris, s)) {\n            return true;\n        }\n        // Note: The intersection must be defined in the original graphs, so inference is not required.\n        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, false)) {\n            if (this._isIntersectionOfClasses(graphUris, q.object)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    _isIntersectionOfClasses(graphUris, subject) {\n        if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {\n            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.intersectionOf, null, false)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Indicate if a given class is a (disjoint) union of classes.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of a class.\n     * @returns `true` if the class is a (disjoint) union of classes, `false` otherwise.\n     */\n    isUnionOfClasses(graphUris, subjectUri) {\n        const s = n3.DataFactory.namedNode(subjectUri);\n        if (this._isUnionOfClasses(graphUris, s)) {\n            return true;\n        }\n        // Note: The union must be defined in the original graphs, so inference is not required.\n        for (let q of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, false)) {\n            if (this._isUnionOfClasses(graphUris, q.object)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    _isUnionOfClasses(graphUris, subject) {\n        if (subject instanceof n3.BlankNode || subject instanceof n3.NamedNode) {\n            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.unionOf, null, false)) {\n                return true;\n            }\n            for (let _ of this.store.match(graphUris, subject, ontologies_1.owl.disjointUnionOf, null, false)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Get all classes from the repository that have no super classes.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns An array of root classes in the repository.\n     */\n    getRootClasses(graphUris, options) {\n        const result = new Set();\n        const classes = new Set(this.getClasses(graphUris, options));\n        for (let c of classes) {\n            let hasSuperClass = false;\n            for (let q of this.store.match(graphUris, new n3.NamedNode(c), ontologies_1.rdfs.subClassOf, null, options?.includeInferred)) {\n                const includeReferenced = options?.includeReferenced ?? false;\n                const skip = this.skip(graphUris, q.object, options);\n                // Do not skip the super property if it is only referenced and the includeReferenced option is set.\n                if (q.object.termType != \"NamedNode\" || skip && (!includeReferenced || includeReferenced && this.hasSubject(graphUris, q.object.value))) {\n                    continue;\n                }\n                hasSuperClass = true;\n                // 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.\n                if (!classes.has(q.object.value)) {\n                    result.add(q.object.value);\n                }\n                break;\n            }\n            if (!hasSuperClass) {\n                result.add(c);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicate if there is an equivalent class of a given class.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri URI of a class.\n     * @param options Optional query parameters.\n     * @returns `true` if the class has an equivalent class, `false` otherwise.\n     */\n    hasEquivalentClass(graphUris, subjectUri, options) {\n        const s = n3.DataFactory.namedNode(subjectUri);\n        // The OWL resoner will assert the equivalent class relationship in both directions.\n        for (let _ of this.store.match(graphUris, s, ontologies_1.owl.equivalentClass, null, options?.includeInferred)) {\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Indicate if a given class has at least one individual defined for it or for one of its sub classes.\n     * @param graphUris Graph URIs to search in, undefined for the default graph.\n     * @param classUri URI of a class.\n     * @param options Optional query parameters.\n     * @returns `true` if the class has individuals, `false` otherwise.\n     */\n    hasIndividuals(graphUris, classUri, options) {\n        const s = n3.DataFactory.namedNode(classUri);\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, s, options?.includeInferred)) {\n            if (!this.skip(graphUris, q.subject, options)) {\n                return true;\n            }\n        }\n        for (let c of this.getSubClasses(graphUris, classUri, options)) {\n            if (this.hasIndividuals(graphUris, c)) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\nexports.ClassRepository = ClassRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/class-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/concept-repository.ts":
+/*!***************************************!*\
+  !*** ./src/rdf/concept-repository.ts ***!
+  \***************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ConceptRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst resource_repository_1 = __webpack_require__(/*! ./resource-repository */ \"./src/rdf/resource-repository.ts\");\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nclass ConceptRepository extends resource_repository_1.ResourceRepository {\n    /**\n     * Get all concepts.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @returns A list of URIs of all concepts.\n     */\n    getConcepts(graphUris) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.skos.Concept)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all concept schemes.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @returns A list of URIs of all concepts.\n     */\n    getConceptSchemes(graphUris) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.skos.ConceptScheme)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all collections.\n     * @param graphUris URI of the graphs to search for collections.\n     * @returns A list of URIs of all collections.\n     */\n    getCollections(graphUris) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.skos.Collection)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.skos.OrderedCollection)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get the members of a collection. This includes both `skos:member` and `skos:memberList` properties.\n     * @param graphUris URI of the graphs to search for collections.\n     * @param collectionUri URI of a collection.\n     * @returns An array of URIs of the members of the collection.\n     */\n    getCollectionMembers(graphUris, collectionUri) {\n        const s = n3.DataFactory.namedNode(collectionUri);\n        let result = [];\n        for (let q of this.store.match(graphUris, s, ontologies_1.skos.member, null)) {\n            result.push(q.object.value);\n        }\n        for (let q of this.store.match(graphUris, s, ontologies_1.skos.memberList, null)) {\n            result = [...result, ...this.store.getListItems(graphUris, q.object.value)];\n        }\n        return result;\n    }\n    /**\n     * Get the members of a collection. This includes both `skos:member` and `skos:memberList` properties.\n     * @param graphUris URI of the graphs to search for collections.\n     * @param collectionUri URI of a collection.\n     * @returns An array of URIs of the members of the collection.\n     */\n    hasCollectionMembers(graphUris, collectionUri) {\n        const s = n3.DataFactory.namedNode(collectionUri);\n        for (let _ of this.store.match(graphUris, s, ontologies_1.skos.member, null)) {\n            return true;\n        }\n        for (let _ of this.store.match(graphUris, s, ontologies_1.skos.memberList, null)) {\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Indicates whether a collection is an ordered collection.\n     * @param graphUris URI of the graphs to search for collections.\n     * @param collectionUri URI of a collection.\n     * @returns `true` if the collection is an ordered collection, `false` otherwise.\n     */\n    isOrderedCollection(graphUris, collectionUri) {\n        const s = n3.DataFactory.namedNode(collectionUri);\n        for (let _ of this.store.match(graphUris, s, ontologies_1.rdf.type, ontologies_1.skos.OrderedCollection)) {\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Get all broader concepts of a concept scheme.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept scheme.\n     */\n    getBroaderConcepts(graphUris, subjectUri) {\n        const result = new Set();\n        const s = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, null, ontologies_1.skos.hasTopConcept, s)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        for (let q of this.store.match(graphUris, null, ontologies_1.skos.narrower, s)) {\n            const s = q.subject;\n            result.add(s.value);\n        }\n        for (let q of this.store.match(graphUris, s, ontologies_1.skos.topConceptOf, null)) {\n            const o = q.object;\n            result.add(o.value);\n        }\n        for (let q of this.store.match(graphUris, s, ontologies_1.skos.broader, null)) {\n            const o = q.object;\n            result.add(o.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicates whether a concept has broader concepts.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept.\n     */\n    hasBroaderConcepts(graphUris, subjectUri) {\n        return this.getBroaderConcepts(graphUris, subjectUri).length > 0;\n    }\n    /**\n     * Get all narrower concepts of a concept or top concepts of a concept scheme.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept or concept scheme.\n     */\n    getNarrowerConcepts(graphUris, subjectUri) {\n        if (subjectUri) {\n            const result = new Set();\n            const s = n3.DataFactory.namedNode(subjectUri);\n            for (let q of this.store.match(graphUris, s, ontologies_1.skos.hasTopConcept, null)) {\n                const o = q.object;\n                result.add(o.value);\n            }\n            for (let q of this.store.match(graphUris, s, ontologies_1.skos.narrower, null)) {\n                const o = q.object;\n                result.add(o.value);\n            }\n            for (let q of this.store.match(graphUris, null, ontologies_1.skos.topConceptOf, s)) {\n                const s = q.subject;\n                result.add(s.value);\n            }\n            for (let q of this.store.match(graphUris, null, ontologies_1.skos.broader, s)) {\n                const s = q.subject;\n                result.add(s.value);\n            }\n            return Array.from(result);\n        }\n        else {\n            return this.getConceptSchemes(graphUris);\n        }\n    }\n    /**\n     * Indicates whether a concept has narrower concepts.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept.\n     */\n    hasNarrowerConcepts(graphUris, subjectUri) {\n        return this.getNarrowerConcepts(graphUris, subjectUri).length > 0;\n    }\n    /**\n     * Indicates whether a concept is a narrower concept of another concept.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept.\n     * @param broaderUri URI of a broader concept.\n     * @returns `true` if the concept is a narrower concept of the broader concept, `false` otherwise.\n     */\n    isNarrowerConceptOf(graphUris, subjectUri, broaderUri) {\n        return this.getConceptSchemePath(graphUris, subjectUri).includes(broaderUri);\n    }\n    /**\n     * Indicates whether a subject is a concept scheme.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a subject.\n     * @returns `true` if the subject is a concept scheme, `false` otherwise.\n     */\n    isConceptScheme(graphUris, subjectUri) {\n        if (subjectUri) {\n            const s = n3.DataFactory.namedNode(subjectUri);\n            for (let _ of this.store.match(graphUris, s, ontologies_1.rdf.type, ontologies_1.skos.ConceptScheme)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Get all broader concepts up to and including a concept scheme.\n     * @param graphUris URIs of the graphs to search for concepts.\n     * @param subjectUri URI of a concept.\n     */\n    getConceptSchemePath(graphUris, subjectUri) {\n        return this._getConceptSchemePath(graphUris, subjectUri, [], new Set());\n    }\n    /**\n     * Recursively find the first path from a given class to a root class.\n     * @param subjectUri URI of a class.\n     * @param path The current class path.\n     * @param backtrack Set of URIs that have already been visited.\n     * @returns The first path that is found from the given class to a root class.\n     */\n    _getConceptSchemePath(graphUris, subjectUri, path, backtrack) {\n        const broaderConcepts = this.getBroaderConcepts(graphUris, subjectUri);\n        for (let o of broaderConcepts.filter(o => !backtrack.has(o))) {\n            return this._getConceptSchemePath(graphUris, o, [...path, o], backtrack);\n        }\n        return path;\n    }\n}\nexports.ConceptRepository = ConceptRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/concept-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/index.ts":
+/*!**************************!*\
+  !*** ./src/rdf/index.ts ***!
+  \**************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\ntslib_1.__exportStar(__webpack_require__(/*! ./class-repository */ \"./src/rdf/class-repository.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./individual-repository */ \"./src/rdf/individual-repository.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./parsers/rdf-syntax */ \"./src/rdf/parsers/rdf-syntax.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./parsers/turtle-syntax-parser */ \"./src/rdf/parsers/turtle-syntax-parser.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./parsers/trig-syntax-parser */ \"./src/rdf/parsers/trig-syntax-parser.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./parsers/sparql-syntax-parser */ \"./src/rdf/parsers/sparql-syntax-parser.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./parsers/syntax-parser */ \"./src/rdf/parsers/syntax-parser.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./property-repository */ \"./src/rdf/property-repository.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./reasoners/owl-reasoner */ \"./src/rdf/reasoners/owl-reasoner.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./reasoners/rdfs-reasoner */ \"./src/rdf/reasoners/rdfs-reasoner.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./resource-repository */ \"./src/rdf/resource-repository.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./store */ \"./src/rdf/store.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./uri */ \"./src/rdf/uri.ts\"), exports);\ntslib_1.__exportStar(__webpack_require__(/*! ./vocabulary-repository */ \"./src/rdf/vocabulary-repository.ts\"), exports);\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/index.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/individual-repository.ts":
+/*!******************************************!*\
+  !*** ./src/rdf/individual-repository.ts ***!
+  \******************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.IndividualRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst property_repository_1 = __webpack_require__(/*! ./property-repository */ \"./src/rdf/property-repository.ts\");\n/**\n * A repository for retrieving classes from graphs.\n */\nclass IndividualRepository extends property_repository_1.PropertyRepository {\n    constructor(store) { super(store); }\n    /**\n     * Get all classes that have instances or all types of a specific individual.\n     * @param graphUris The graph URIs to search.\n     * @param subjectUri The URI of a subject for which to get the types (optional).\n     * @param options Options for retrieving the individuals.\n     * @returns A list of all individual types, or all types of a specific individual.\n     */\n    getIndividualTypes(graphUris, subjectUri, options) {\n        const result = new Set();\n        const subject = subjectUri ? new n3.NamedNode(subjectUri) : null;\n        for (const q of this.store.match(graphUris, subject, ontologies_1.rdf.type, ontologies_1.owl.NamedIndividual)) {\n            if (this.skip(graphUris, q.subject, options)) {\n                continue;\n            }\n            // Note: We do not include inferred types here.\n            for (const p of this.store.match(graphUris, q.subject, ontologies_1.rdf.type, null, false)) {\n                if (p.object.equals(ontologies_1.owl.NamedIndividual)) {\n                    continue;\n                }\n                result.add(p.object.value);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all individuals in the repository.\n     * @param typeUri The type of the individuals to get.\n     * @param options Options for retrieving the individuals.\n     * @returns A list of all individuals in the repository.\n     */\n    getIndividuals(graphUris, typeUri, options) {\n        const result = new Set();\n        for (const q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.owl.NamedIndividual)) {\n            if (this.skip(graphUris, q.subject, options)) {\n                continue;\n            }\n            if (!typeUri || this.isInstanceOfType(graphUris, q.subject.value, typeUri)) {\n                result.add(q.subject.value);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicate if the subject is an instance of the type, or of one of its super types.\n     * @param subjectUri URI of the subject.\n     * @param typeUri URI of the type to check.\n     * @returns true if the subject is an instance of the type, or of one of its super types.\n     */\n    isInstanceOfType(graphUris, subjectUri, typeUri) {\n        const subject = new n3.NamedNode(subjectUri);\n        const type = new n3.NamedNode(typeUri);\n        for (const q of this.store.match(graphUris, subject, ontologies_1.rdf.type, null)) {\n            const o = q.object;\n            if (o.termType != \"NamedNode\") {\n                continue;\n            }\n            if (o.equals(type) || this.isSubClassOf(graphUris, o.value, type.value)) {\n                return true;\n            }\n        }\n        return false;\n    }\n}\nexports.IndividualRepository = IndividualRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/individual-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/parsers/rdf-syntax.ts":
+/*!***************************************!*\
+  !*** ./src/rdf/parsers/rdf-syntax.ts ***!
+  \***************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.RdfSyntax = void 0;\n/**\n * Enumerates the RDF syntaxes supported by the Mentor RDF library.\n */\nvar RdfSyntax;\n(function (RdfSyntax) {\n    RdfSyntax[\"N3\"] = \"n3\";\n    RdfSyntax[\"NTriples\"] = \"ntriples\";\n    RdfSyntax[\"NQuads\"] = \"nquads\";\n    RdfSyntax[\"Turtle\"] = \"turtle\";\n    RdfSyntax[\"TriG\"] = \"trig\";\n    RdfSyntax[\"TriX\"] = \"trix\";\n    RdfSyntax[\"JsonLd\"] = \"jsonld\";\n    RdfSyntax[\"RdfXml\"] = \"rdfxml\";\n    RdfSyntax[\"Sparql\"] = \"sparql\";\n})(RdfSyntax || (exports.RdfSyntax = RdfSyntax = {}));\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/parsers/rdf-syntax.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/parsers/sparql-syntax-parser.ts":
+/*!*************************************************!*\
+  !*** ./src/rdf/parsers/sparql-syntax-parser.ts ***!
+  \*************************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.SparqlSyntaxParser = void 0;\nconst millan_1 = __webpack_require__(/*! millan */ \"./node_modules/millan/dist/millan.js\");\n/**\n * An extended version of the Millan SPARQL parser that also returns semantic errors such as undefined prefixes.\n */\nclass SparqlSyntaxParser {\n    constructor() {\n        this.parser = new millan_1.W3SpecSparqlParser();\n        this.parse = (document) => {\n            const { cst, errors, comments } = this.parser.parse(document);\n            const tokens = this.parser.input;\n            const semanticErrors = [];\n            const declaredPrefixes = new Set();\n            for (let i = 0; i < tokens.length; i++) {\n                const token = tokens[i];\n                const tokenName = token.tokenType?.name;\n                switch (tokenName) {\n                    case \"PNAME_NS\": {\n                        const prefix = token.image.split(\":\")[0];\n                        declaredPrefixes.add(prefix);\n                        break;\n                    }\n                    case \"PNAME_LN\": {\n                        const prefix = token.image.split(\":\")[0];\n                        if (!declaredPrefixes.has(prefix)) {\n                            semanticErrors.push({\n                                message: `Undefined prefix: ${prefix}`,\n                                name: \"NoNamespacePrefixError\",\n                                token: token,\n                                resyncedTokens: [],\n                                context: {\n                                    ruleStack: [],\n                                    ruleOccurrenceStack: []\n                                }\n                            });\n                        }\n                        break;\n                    }\n                }\n            }\n            return {\n                comments: comments ? comments : [],\n                cst,\n                errors,\n                semanticErrors,\n                tokens,\n            };\n        };\n    }\n    get input() {\n        return this.parser.input;\n    }\n    tokenize(document) {\n        return this.parser.tokenize(document);\n    }\n}\nexports.SparqlSyntaxParser = SparqlSyntaxParser;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/parsers/sparql-syntax-parser.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/parsers/syntax-parser.ts":
+/*!******************************************!*\
+  !*** ./src/rdf/parsers/syntax-parser.ts ***!
+  \******************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/parsers/syntax-parser.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/parsers/trig-syntax-parser.ts":
+/*!***********************************************!*\
+  !*** ./src/rdf/parsers/trig-syntax-parser.ts ***!
+  \***********************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TrigSyntaxParser = void 0;\nconst millan_1 = __webpack_require__(/*! millan */ \"./node_modules/millan/dist/millan.js\");\n/**\n * A TriG document parser that also returns comments.\n */\nclass TrigSyntaxParser extends millan_1.TrigParser {\n    constructor() {\n        super(...arguments);\n        this.parse = (content) => {\n            const result = this.lexer.tokenize(content);\n            this.input = result.tokens;\n            const cst = this.trigDoc(0, ['standard']);\n            const errors = [...this.errors];\n            const semanticErrors = [...this.semanticErrors];\n            const comments = result.groups.comments || [];\n            this.resetManagedState();\n            return {\n                comments,\n                cst,\n                errors,\n                semanticErrors,\n                tokens: result.tokens,\n            };\n        };\n    }\n}\nexports.TrigSyntaxParser = TrigSyntaxParser;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/parsers/trig-syntax-parser.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/parsers/turtle-syntax-parser.ts":
+/*!*************************************************!*\
+  !*** ./src/rdf/parsers/turtle-syntax-parser.ts ***!
+  \*************************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.TurtleSyntaxParser = void 0;\nconst millan_1 = __webpack_require__(/*! millan */ \"./node_modules/millan/dist/millan.js\");\n/**\n * A Turtle document parser that also returns comments.\n */\nclass TurtleSyntaxParser extends millan_1.TrigParser {\n    constructor() {\n        super(...arguments);\n        this.parse = (content) => {\n            const result = this.lexer.tokenize(content);\n            this.input = result.tokens;\n            const cst = this.turtleDoc(0, ['standard']);\n            const errors = [...this.errors];\n            const semanticErrors = [...this.semanticErrors];\n            const comments = result.groups.comments || [];\n            this.resetManagedState();\n            return {\n                comments,\n                cst,\n                errors,\n                semanticErrors,\n                tokens: result.tokens,\n            };\n        };\n    }\n}\nexports.TurtleSyntaxParser = TurtleSyntaxParser;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/parsers/turtle-syntax-parser.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/property-repository.ts":
+/*!****************************************!*\
+  !*** ./src/rdf/property-repository.ts ***!
+  \****************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.PropertyRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst class_repository_1 = __webpack_require__(/*! ./class-repository */ \"./src/rdf/class-repository.ts\");\n/**\n * A repository for retrieving properties from graphs.\n */\nclass PropertyRepository extends class_repository_1.ClassRepository {\n    constructor(store) {\n        super(store);\n        /**\n         * The predicate used to indicate the domain of a property.\n         */\n        this.domainPredicate = ontologies_1.rdfs.domain;\n        /**\n         * The predicate used to indicate the range of a property.\n         */\n        this.rangePredicate = ontologies_1.rdfs.range;\n    }\n    /**\n     * Get all properties in the repository.\n     * @param options Optional options for retrieving properties.\n     * @returns A list of all properties in the repository.\n     */\n    getProperties(graphUris, options) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.rdf.Property, options?.includeInferred)) {\n            if (this.skip(graphUris, q.subject, options)) {\n                continue;\n            }\n            result.add(q.subject.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get properties of a given type.\n     * @param typeUri URI of a property type.\n     * @param includeInferred Indicate if properties of a more specific type should be included in the result.\n     * @returns A list of properties of the given type.\n     */\n    getRootPropertiesOfType(graphUris, typeUri, options) {\n        const result = new Set();\n        const type = new n3.NamedNode(typeUri);\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, type, options?.includeInferred)) {\n            if (this.skip(graphUris, q.subject, options)) {\n                continue;\n            }\n            let hasSuperProperty = false;\n            for (let q2 of this.store.match(graphUris, q.subject, ontologies_1.rdfs.subPropertyOf, null, options?.includeInferred)) {\n                // Note: We have not skipped the property so it is relevant for our result. However, if we want \n                // to include referenced properties, then we include the referenced super property instead of the\n                // current one.\n                if (options?.includeReferenced && !this.hasSubject(graphUris, q2.object.value)) {\n                    // We must assume that the referenced super property is of the same type as the given type or a super type of it.\n                    result.add(q2.object.value);\n                }\n                else if (this.skip(graphUris, q2.object, options)) {\n                    // If the super property is skipped, then we ignore it.\n                    continue;\n                }\n                hasSuperProperty = true;\n                break;\n            }\n            if (hasSuperProperty) {\n                continue;\n            }\n            if (typeUri === ontologies_1.RDF.Property && options?.includeInferred === false) {\n                // In the case of rdf:Property, we do not want to include properties that have a more specific type.\n                const t = Array.from(this.store.match(graphUris, q.subject, ontologies_1.rdf.type, null, options?.includeInferred)).map(q => q.object.value);\n                if (new Set(t).size == 1) {\n                    result.add(q.subject.value);\n                }\n            }\n            else {\n                result.add(q.subject.value);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get the super properties of a given property.\n     * @param subjectUri URI of a property.\n     * @param options Optional options for retrieving properties.\n     * @returns An array of super properties of the given property, an empty array if the property has no super properties.\n     */\n    getSuperProperties(graphUris, subjectUri, options) {\n        const result = [];\n        const s = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.subPropertyOf, null, options?.includeInferred)) {\n            if (this.skip(graphUris, q.object, options)) {\n                continue;\n            }\n            result.push(q.object.value);\n        }\n        return result;\n    }\n    /**\n     * Recursively find the first path from a given property to a root property.\n     * @param subjectUri URI of a property.\n     * @param path The current property path.\n     * @param backtrack Set of URIs that have already been visited.\n     * @param options Optional options for retrieving properties.\n     * @returns The first path that is found from the given property to a root class.\n     */\n    _getRootPropertyPath(graphUris, subjectUri, path, backtrack, options) {\n        const superClasses = this.getSuperProperties(graphUris, subjectUri, options);\n        for (let o of superClasses.filter(o => !backtrack.has(o))) {\n            return this._getRootPropertyPath(graphUris, o, [...path, o], backtrack, options);\n        }\n        return path;\n    }\n    /**\n     * Get the first discovered path from a given property to a root property.\n     * @param subjectUri URI of a property.\n     * @param options Optional options for retrieving properties.\n     * @returns A string array containing the first path that is found from the given property to a root property.\n     */\n    getRootPropertiesPath(graphUris, subjectUri, options) {\n        return this._getRootPropertyPath(graphUris, subjectUri, [], new Set(), options);\n    }\n    /**\n     * Indicate if there are sub properties of a given property.\n     * @param subjectUri URI of a property.\n     * @param options Optional options for retrieving properties.\n     * @returns true if the property has sub properties, false otherwise.\n     */\n    hasSubProperties(graphUris, subjectUri, options) {\n        const o = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subPropertyOf, o, options?.includeInferred)) {\n            if (!this.skip(graphUris, q.subject, options)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Get the sub properties of a given property or all root properties.\n     * @param subjectUri URI of a property or undefined to get all root properties.\n     * @param options Optional options for retrieving properties.\n     * @returns An array of sub properties of the given property, an empty array if the property has no sub properties.\n     */\n    getSubProperties(graphUris, subjectUri, options) {\n        if (subjectUri) {\n            const result = new Set();\n            const o = n3.DataFactory.namedNode(subjectUri);\n            for (let q of this.store.match(graphUris, null, ontologies_1.rdfs.subPropertyOf, o, options?.includeInferred)) {\n                if (this.skip(graphUris, q.subject, options)) {\n                    continue;\n                }\n                result.add(q.subject.value);\n            }\n            return Array.from(result);\n        }\n        else {\n            return this.getRootProperties(graphUris, options);\n        }\n    }\n    /**\n     * Get all properties from the repository that have no super properties.\n     * @param options Optional options for retrieving properties.\n     * @returns An array of root properties in the repository.\n     */\n    getRootProperties(graphUris, options) {\n        const result = new Set();\n        const properties = new Set(this.getProperties(graphUris, options));\n        for (let p of properties) {\n            let hasSuperProperty = false;\n            for (let q of this.store.match(graphUris, new n3.NamedNode(p), ontologies_1.rdfs.subPropertyOf, null, options?.includeInferred)) {\n                const includeReferenced = options?.includeReferenced ?? false;\n                const skip = this.skip(graphUris, q.object, options);\n                // Do not skip the super property if it is only referenced and the includeReferenced option is set.\n                if (q.object.termType != \"NamedNode\" || skip && (!includeReferenced || includeReferenced && this.hasSubject(graphUris, q.object.value))) {\n                    continue;\n                }\n                hasSuperProperty = true;\n                // 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.\n                if (!properties.has(q.object.value)) {\n                    result.add(q.object.value);\n                }\n                break;\n            }\n            if (!hasSuperProperty) {\n                result.add(p);\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicate if there is an equivalent property of a given property.\n     * @param propertyUri URI of a property.\n     * @returns true if the property has an equivalent property, false otherwise.\n     */\n    hasEquivalentProperty(graphUris, propertyUri) {\n        const s = n3.DataFactory.namedNode(propertyUri);\n        // The OWL resoner will assert the equivalent class relationship in both directions.\n        for (let _ of this.store.match(graphUris, s, ontologies_1.owl.equivalentProperty, null)) {\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Get the domain of a given property.\n     * @param propertyUri URI of a property.\n     * @returns The URI of the domain of the given property. If no domain is specified, rdfs:Resource is returned.\n     */\n    getDomain(graphUris, propertyUri) {\n        const s = n3.DataFactory.namedNode(propertyUri);\n        for (let q of this.store.match(graphUris, s, this.domainPredicate, null)) {\n            return q.object.value;\n        }\n        return ontologies_1.rdfs.Resource.value;\n    }\n    /**\n     * Get the range of a given property.\n     * @param propertyUri URI of a property.\n     * @returns The URI of the range of the given property. If no range is specified, `undefined` is returned.\n     */\n    getRange(graphUris, propertyUri) {\n        const s = n3.DataFactory.namedNode(propertyUri);\n        for (let q of this.store.match(graphUris, s, this.rangePredicate, null)) {\n            return q.object.value;\n        }\n        return undefined;\n    }\n    /**\n     * Get all asserted and inferred property types.\n     * @param graphUris The URI of the graph or an array of graphs to search for property types.\n     * @param options Optional options for retrieving properties.\n     * @returns A list of all property types in the repository.\n     */\n    getPropertyTypes(graphUris, options) {\n        const result = new Set();\n        const properties = this.getProperties(graphUris, options).map(p => new n3.NamedNode(p));\n        for (let p of properties) {\n            const types = new Set(Array.from(this.store.match(graphUris, p, ontologies_1.rdf.type, null, false)).map(t => t.object.value));\n            if (types.size > 0) {\n                for (let t of types) {\n                    // Do not assert rdf:Property for properties that have multiple types.\n                    if (t !== ontologies_1.RDF.Property || types.size == 1) {\n                        result.add(t);\n                    }\n                }\n            }\n            else {\n                // If there are no asserted types, we need to infer rdf:Property.\n                result.add(ontologies_1.RDF.Property);\n            }\n        }\n        return Array.from(result);\n    }\n}\nexports.PropertyRepository = PropertyRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/property-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/reasoners/owl-reasoner.ts":
+/*!*******************************************!*\
+  !*** ./src/rdf/reasoners/owl-reasoner.ts ***!
+  \*******************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.OwlReasoner = void 0;\nconst ontologies_1 = __webpack_require__(/*! ../../ontologies */ \"./src/ontologies/index.ts\");\nconst shacl_reasoner_1 = __webpack_require__(/*! ./shacl-reasoner */ \"./src/rdf/reasoners/shacl-reasoner.ts\");\n/**\n * A simple OWL reasoner that expands the graph with inferred triples.\n */\nclass OwlReasoner extends shacl_reasoner_1.ShaclReasoner {\n    constructor() {\n        super();\n        this.restrictions = {};\n    }\n    afterInference() {\n        super.afterInference();\n        for (let r of Object.values(this.restrictions)) {\n            const p = r.onProperty;\n            if (!p)\n                continue;\n            if (r.onDataRange) {\n                this.store.addQuad(p, ontologies_1.rdf.type, ontologies_1.owl.DatatypeProperty, this.targetGraph);\n                this.store.addQuad(p, ontologies_1.rdfs.range, r.onDataRange, this.targetGraph);\n            }\n            else if (r.onClass) {\n                this.store.addQuad(p, ontologies_1.rdf.type, ontologies_1.owl.ObjectProperty, this.targetGraph);\n                this.store.addQuad(p, ontologies_1.rdfs.range, r.onClass, this.targetGraph);\n            }\n            else if (r.allValuesFrom) {\n                this.store.addQuad(p, ontologies_1.rdf.type, ontologies_1.owl.ObjectProperty, this.targetGraph);\n            }\n            else if (r.someValuesFrom) {\n                this.store.addQuad(p, ontologies_1.rdf.type, ontologies_1.owl.ObjectProperty, this.targetGraph);\n            }\n        }\n        this.restrictions = {};\n    }\n    inferClassAxioms(quad) {\n        super.inferClassAxioms(quad);\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        // See: https://www.w3.org/TR/owl2-profiles/#Reasoning_in_OWL_2_RL_and_RDF_Graphs_using_Rules\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.id == ontologies_1.owl.Restriction.id) {\n                    this.restrictions[s.value] = {};\n                }\n                return;\n            }\n            case ontologies_1.owl.equivalentClass.id: {\n                this.assertClass(s);\n                if (o && !this.isW3CNode(o)) {\n                    this.assertClass(o);\n                }\n                // The opposite is also true.\n                if (o.termType == \"NamedNode\") {\n                    this.store.addQuad(o, ontologies_1.owl.equivalentClass, s, this.targetGraph);\n                }\n                return;\n            }\n            case ontologies_1.owl.complementOf.id:\n            case ontologies_1.owl.disjointWith.id: {\n                this.assertClass(s);\n                if (o && !this.isW3CNode(o)) {\n                    this.assertClass(o);\n                }\n                return;\n            }\n            case ontologies_1.owl.intersectionOf.id: {\n                let equivalentSubjects = [...this.store.match(null, ontologies_1.owl.equivalentClass, s)]\n                    .map(q => q.subject)\n                    .filter(q => q.termType == \"NamedNode\");\n                // Rule #scm-int\n                let classes = this.getListItems(o.value);\n                if (!Array.isArray(classes)) {\n                    this.errors.push({ quad: quad, message: `Expected an array of classes for ${o.value}` });\n                    return;\n                }\n                for (let c of classes) {\n                    if (c.termType != \"NamedNode\") {\n                        continue;\n                    }\n                    this.store.addQuad(s, ontologies_1.rdfs.subClassOf, c, this.targetGraph);\n                    for (let es of equivalentSubjects) {\n                        this.store.addQuad(es, ontologies_1.rdfs.subClassOf, c, this.targetGraph);\n                    }\n                }\n                return;\n            }\n            case ontologies_1.owl.unionOf.id: {\n                let equivalentSubjects = [...this.store.match(null, ontologies_1.owl.equivalentClass, s)]\n                    .map(q => q.subject)\n                    .filter(q => q.termType == \"NamedNode\");\n                // Rule #scm-uni\n                let classes = this.getListItems(o.value);\n                if (!Array.isArray(classes)) {\n                    this.errors.push({ quad: quad, message: `Expected an array of classes for ${o.value}` });\n                    return;\n                }\n                for (let c of classes) {\n                    if (c.termType != \"NamedNode\") {\n                        continue;\n                    }\n                    this.store.addQuad(c, ontologies_1.rdfs.subClassOf, s, this.targetGraph);\n                    for (let es of equivalentSubjects) {\n                        this.store.addQuad(c, ontologies_1.rdfs.subClassOf, es, this.targetGraph);\n                    }\n                }\n                return;\n            }\n            case ontologies_1.owl.onClass.id: {\n                if (o.termType == \"NamedNode\") {\n                    this.assertClass(o);\n                }\n                return;\n            }\n            case ontologies_1.owl.onDataRange.id: {\n                if (o.termType == \"NamedNode\") {\n                    this.store.addQuad(o, ontologies_1.rdf.type, ontologies_1.rdfs.Datatype, this.targetGraph);\n                }\n                return;\n            }\n            // Note:\n            //   e.g. Gist also uses these on xsd:string, so inferring that this is a \n            //   class is technically true, however, it would lead to undesirable results.\n            //\n            // case owl.allValuesFrom.id: {\n            //     if (o.termType == \"NamedNode\") {\n            //         this.store.addQuad(o, rdf.type, rdfs.Class, this.targetGraph);\n            //     }\n            //\n            //     return;\n            // }\n            // case owl.someValuesFrom.id: {\n            //     if (o.termType == \"NamedNode\") {\n            //         this.store.addQuad(o, rdf.type, rdfs.Class, this.targetGraph);\n            //     }\n            //\n            //     break;\n            // }\n        }\n    }\n    inferPropertyAxioms(quad) {\n        super.inferPropertyAxioms(quad);\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.owl.onProperty.id: {\n                this.assertProperty(o);\n                if (this.restrictions[s.value] && o.termType == \"NamedNode\") {\n                    this.restrictions[s.value].onProperty = o;\n                }\n                return;\n            }\n            case ontologies_1.owl.onClass.id: {\n                if (this.restrictions[s.value] && o.termType == \"NamedNode\") {\n                    this.restrictions[s.value].onClass = o;\n                }\n                return;\n            }\n            case ontologies_1.owl.onDataRange.id: {\n                if (this.restrictions[s.value] && o.termType == \"NamedNode\") {\n                    this.restrictions[s.value].onDataRange = o;\n                }\n                return;\n            }\n            case ontologies_1.owl.allValuesFrom.id: {\n                if (this.restrictions[s.value]) {\n                    this.restrictions[s.value].allValuesFrom = o;\n                }\n                return;\n            }\n            case ontologies_1.owl.someValuesFrom.id: {\n                if (this.restrictions[s.value]) {\n                    this.restrictions[s.value].someValuesFrom = o;\n                }\n                return;\n            }\n            case ontologies_1.owl.equivalentProperty.id: {\n                this.assertProperty(s);\n                this.assertProperty(o);\n                // The opposite is also true.\n                if (o.termType == \"NamedNode\") {\n                    this.store.addQuad(o, ontologies_1.owl.equivalentProperty, s, this.targetGraph);\n                }\n                return;\n            }\n            case ontologies_1.rdf.type.id: {\n                switch (o.id) {\n                    case ontologies_1.owl.AnnotationProperty.id:\n                    case ontologies_1.owl.AsymmetricProperty.id:\n                    case ontologies_1.owl.DatatypeProperty.id:\n                    case ontologies_1.owl.DeprecatedProperty.id:\n                    case ontologies_1.owl.FunctionalProperty.id:\n                    case ontologies_1.owl.InverseFunctionalProperty.id:\n                    case ontologies_1.owl.IrreflexiveProperty.id:\n                    case ontologies_1.owl.ObjectProperty.id:\n                    case ontologies_1.owl.OntologyProperty.id:\n                    case ontologies_1.owl.ReflexiveProperty.id:\n                    case ontologies_1.owl.SymmetricProperty.id:\n                    case ontologies_1.owl.TransitiveProperty.id: {\n                        this.assertProperty(s);\n                    }\n                }\n                return;\n            }\n        }\n    }\n}\nexports.OwlReasoner = OwlReasoner;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/reasoners/owl-reasoner.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/reasoners/rdfs-reasoner.ts":
+/*!********************************************!*\
+  !*** ./src/rdf/reasoners/rdfs-reasoner.ts ***!
+  \********************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.RdfsReasoner = void 0;\nconst ontologies_1 = __webpack_require__(/*! ../../ontologies */ \"./src/ontologies/index.ts\");\nconst skos_reasoner_1 = __webpack_require__(/*! ./skos-reasoner */ \"./src/rdf/reasoners/skos-reasoner.ts\");\n/**\n * A simple RDFS reasoner that expands the graph with inferred triples.\n */\nclass RdfsReasoner extends skos_reasoner_1.SkosReasoner {\n    constructor() {\n        super(...arguments);\n        this.ontologies = new Set();\n        this.classes = new Set();\n        this.properties = new Set();\n        this.invididuals = new Set();\n    }\n    isIgnoredNode(term) {\n        switch (term.id) {\n            case ontologies_1.skos.Concept.id:\n            case ontologies_1.skos.ConceptScheme.id:\n            case ontologies_1.skos.Collection.id:\n            case ontologies_1.skos.OrderedCollection.id:\n            case ontologies_1.sh.Shape.id:\n            case ontologies_1.sh.NodeShape.id:\n            case ontologies_1.sh.PropertyShape.id:\n                return true;\n            default:\n                return false;\n        }\n    }\n    isClass(id) {\n        return super.isClass(id) ||\n            this.classes.has(id) ||\n            this.properties.has(id) ||\n            this.ontologies.has(id);\n    }\n    afterInference() {\n        super.afterInference();\n        // After all axioms have been inferred, add the inferred individuals to the graph.\n        const individuals = [...this.invididuals].filter(x => !this.isClass(x.id));\n        for (let individual of individuals) {\n            this.store.addQuad(individual, ontologies_1.rdf.type, ontologies_1.owl.NamedIndividual, this.targetGraph);\n        }\n    }\n    applyInference(quad) {\n        super.applyInference(quad);\n        // Treat all named nodes with rdf:type definitions as potential individuals.\n        if (quad.subject.termType == \"NamedNode\" && quad.predicate.equals(ontologies_1.rdf.type)) {\n            // Only consider individuals that are not of a type that is ignored such as skos:Concept.\n            if (!this.isIgnoredNode(quad.object)) {\n                this.invididuals.add(quad.subject);\n            }\n            if (quad.object.id == ontologies_1.owl.Ontology.id) {\n                this.ontologies.add(quad.subject.id);\n            }\n        }\n        this.inferClassAxioms(quad);\n        this.inferPropertyAxioms(quad);\n    }\n    assertClass(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.rdfs.Class, this.targetGraph);\n        this.classes.add(subject.id);\n    }\n    inferClassAxioms(quad) {\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.equals(ontologies_1.rdfs.Class)) {\n                    // No need to infer the class type, as it is already asserted.\n                    this.classes.add(s.id);\n                }\n                else if (o.equals(ontologies_1.owl.Class)) {\n                    this.assertClass(s);\n                }\n                else if (!this.isW3CNode(o)) {\n                    this.assertClass(o);\n                }\n                return;\n            }\n            case ontologies_1.rdfs.subClassOf.id: {\n                this.assertClass(s);\n                if (!this.isW3CNode(o)) {\n                    this.assertClass(o);\n                }\n                else if (o.equals(ontologies_1.rdfs.Resource)) {\n                    this.store.addQuad(ontologies_1.rdfs.Resource, ontologies_1.rdf.type, ontologies_1.rdfs.Class, this.targetGraph);\n                }\n                else if (o.equals(ontologies_1.rdfs.Class)) {\n                    this.store.addQuad(ontologies_1.rdfs.Class, ontologies_1.rdf.type, ontologies_1.rdfs.Class, this.targetGraph);\n                    this.store.addQuad(ontologies_1.rdfs.Class, ontologies_1.rdfs.subClassOf, ontologies_1.rdfs.Resource, this.targetGraph);\n                }\n                else if (o.equals(ontologies_1.rdfs.Datatype)) {\n                    this.store.addQuad(ontologies_1.rdfs.Datatype, ontologies_1.rdf.type, ontologies_1.rdfs.Class, this.targetGraph);\n                    this.store.addQuad(ontologies_1.rdfs.Datatype, ontologies_1.rdfs.subClassOf, ontologies_1.rdfs.Class, this.targetGraph);\n                }\n                else if (o.equals(ontologies_1.owl.Class)) {\n                    this.store.addQuad(ontologies_1.owl.Class, ontologies_1.rdf.type, ontologies_1.rdfs.Class, this.targetGraph);\n                    this.store.addQuad(ontologies_1.owl.Class, ontologies_1.rdfs.subClassOf, ontologies_1.rdfs.Class, this.targetGraph);\n                }\n                return;\n            }\n            case ontologies_1.rdfs.range.id:\n            case ontologies_1.rdfs.domain.id: {\n                if (!this.isW3CNode(o)) {\n                    this.assertClass(o);\n                }\n                return;\n            }\n        }\n    }\n    assertProperty(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.rdf.Property, this.targetGraph);\n        this.properties.add(subject.id);\n    }\n    inferPropertyAxioms(quad) {\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.equals(ontologies_1.rdf.Property)) {\n                    // No need to infer the property type, as it is already asserted.\n                    this.properties.add(s.id);\n                }\n                return;\n            }\n            case ontologies_1.rdfs.range.id:\n            case ontologies_1.rdfs.domain.id: {\n                this.assertProperty(s);\n                return;\n            }\n        }\n    }\n}\nexports.RdfsReasoner = RdfsReasoner;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/reasoners/rdfs-reasoner.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/reasoners/reasoner.ts":
+/*!***************************************!*\
+  !*** ./src/rdf/reasoners/reasoner.ts ***!
+  \***************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ReasonerBase = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../../ontologies */ \"./src/ontologies/index.ts\");\n/**\n * A base class for reasoners that expand graphs with inferred triples.\n */\nclass ReasonerBase {\n    constructor() {\n        this.store = new n3.Store();\n        this.errors = [];\n    }\n    getInferenceGraphUri(uri) {\n        const u = new URL(typeof uri == \"string\" ? uri : uri.value);\n        u.protocol = 'mentor:';\n        // This reasoner is specifically designed to work with the Mentor platform.\n        return u.toString();\n    }\n    isInferenceGraphUri(uri) {\n        const u = new URL(typeof uri == \"string\" ? uri : uri.value);\n        return u.protocol === 'mentor:';\n    }\n    getGraphNode(graph) {\n        if (typeof graph === \"string\") {\n            return new n3.NamedNode(graph);\n        }\n        else {\n            return graph;\n        }\n    }\n    isW3CNode(term) {\n        return term.value.startsWith(\"http://www.w3.org\");\n    }\n    /**\n     * Get the URIs of ordered list members in the store.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param listUri URI of the list to get the items from.\n     * @returns An array of URIs of the items in the list.\n     */\n    getListItems(listUri) {\n        // To do: Fix #10\n        const list = listUri.includes(':') ? new n3.NamedNode(listUri) : new n3.BlankNode(listUri);\n        return this._getListItems(list);\n    }\n    _getListItems(subject) {\n        if (!this.sourceGraph) {\n            return [];\n        }\n        let first = Array.from(this.match(this.sourceGraph, subject, ontologies_1.rdf.first, null));\n        if (!first.length) {\n            return [];\n        }\n        const rest = Array.from(this.match(this.sourceGraph, subject, ontologies_1.rdf.rest, null));\n        const firstItem = first[0].object;\n        const restList = rest[0]?.object;\n        if (restList.value === ontologies_1.RDF.nil) {\n            return [firstItem];\n        }\n        else {\n            const restItems = this._getListItems(restList);\n            return [firstItem, ...restItems];\n        }\n    }\n    /**\n     * Query the store for triples matching the given pattern supporting multiple graphs.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param subject A subject URI or null to match any subject.\n     * @param predicate A predicate URI or null to match any predicate.\n     * @param object An object URI or null to match any object.\n     * @todo Refactor and merge with the same method in the Mentor RDF Store class.\n     */\n    *match(graph, subject, predicate, object) {\n        if (graph !== undefined) {\n            yield* this.store.match(subject, predicate, object, graph);\n        }\n        else {\n            yield* this.store.match(subject, predicate, object);\n        }\n    }\n    expand(store, sourceGraph, targetGraph) {\n        if (!targetGraph) {\n            targetGraph = this.getInferenceGraphUri(sourceGraph);\n        }\n        this.store = store;\n        if (this.store.getGraphs(null, null, null).filter(g => g.id == targetGraph).length > 0) {\n            // Ensure the target graph is empty so this function is idempotent and consistent.\n            store.deleteGraph(targetGraph);\n        }\n        this.sourceGraph = this.getGraphNode(sourceGraph);\n        this.targetGraph = this.getGraphNode(targetGraph);\n        this.beforeInference();\n        for (let quad of store.match(null, null, null, this.sourceGraph)) {\n            let q = quad;\n            this.applyInference(q);\n        }\n        this.afterInference();\n        return store;\n    }\n    beforeInference() { }\n    afterInference() { }\n}\nexports.ReasonerBase = ReasonerBase;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/reasoners/reasoner.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/reasoners/shacl-reasoner.ts":
+/*!*********************************************!*\
+  !*** ./src/rdf/reasoners/shacl-reasoner.ts ***!
+  \*********************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ShaclReasoner = void 0;\nconst ontologies_1 = __webpack_require__(/*! ../../ontologies */ \"./src/ontologies/index.ts\");\nconst rdfs_reasoner_1 = __webpack_require__(/*! ./rdfs-reasoner */ \"./src/rdf/reasoners/rdfs-reasoner.ts\");\n/**\n * A simple SKOS reasoner that expands the graph with inferred triples.\n */\nclass ShaclReasoner extends rdfs_reasoner_1.RdfsReasoner {\n    constructor() {\n        super(...arguments);\n        this.classes = new Set();\n    }\n    isClass(id) {\n        return this.classes.has(id) || super.isClass(id);\n    }\n    applyInference(quad) {\n        super.applyInference(quad);\n        this.inferShapeAxioms(quad);\n    }\n    assertShape(subject, type) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.sh.Shape, this.targetGraph);\n        if (type) {\n            this.store.addQuad(subject, ontologies_1.rdf.type, type, this.targetGraph);\n        }\n        this.classes.add(subject.id);\n    }\n    assertValidator(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.sh.Validator, this.targetGraph);\n        this.classes.add(subject.id);\n    }\n    assertParameterizable(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.sh.Parameterizable, this.targetGraph);\n        this.classes.add(subject.id);\n    }\n    assertRule(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.sh.Rule, this.targetGraph);\n        this.classes.add(subject.id);\n    }\n    isShapeType(subject) {\n        switch (subject.id) {\n            case ontologies_1.sh.Shape.id:\n            case ontologies_1.sh.NodeShape.id:\n            case ontologies_1.sh.PropertyShape.id:\n            case ontologies_1.sh.Parameter.id: {\n                return true;\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    isRuleType(subject) {\n        switch (subject.id) {\n            case ontologies_1.sh.Rule.id:\n            case ontologies_1.sh.JSRule.id:\n            case ontologies_1.sh.SPARQLRule.id:\n            case ontologies_1.sh.TripleRule.id: {\n                return true;\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    isValidatorType(subject) {\n        switch (subject.id) {\n            case ontologies_1.sh.Validator.id:\n            case ontologies_1.sh.JSValidator.id:\n            case ontologies_1.sh.SPARQLAskValidator.id:\n            case ontologies_1.sh.SPARQLSelectValidator.id: {\n                return true;\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    isParameterizableType(subject) {\n        switch (subject.id) {\n            case ontologies_1.sh.Parameter.id:\n            case ontologies_1.sh.ConstraintComponent.id:\n            case ontologies_1.sh.Function.id:\n            case ontologies_1.sh.JSFunction.id:\n            case ontologies_1.sh.SPARQLFunction.id:\n            case ontologies_1.sh.TargetType.id:\n            case ontologies_1.sh.JSTargetType.id:\n            case ontologies_1.sh.SPARQLTargetType.id: {\n                return true;\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    inferShapeAxioms(quad) {\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.equals(ontologies_1.sh.Shape) || o.equals(ontologies_1.sh.Parameterizable)) {\n                    // No need to infer the type, as it is already asserted.\n                    this.classes.add(s.id);\n                }\n                else if (this.isShapeType(o)) {\n                    this.assertShape(s, o);\n                }\n                else if (this.isParameterizableType(o)) {\n                    this.assertParameterizable(s);\n                }\n                else if (this.isValidatorType(o)) {\n                    this.assertValidator(s);\n                }\n                else if (this.isRuleType(o)) {\n                    this.assertRule(s);\n                }\n                return;\n            }\n            case ontologies_1.sh.targetClass.id: {\n                this.assertShape(s, ontologies_1.sh.NodeShape);\n                this.assertClass(o);\n                return;\n            }\n            case ontologies_1.sh.class.id: {\n                this.assertShape(s, ontologies_1.sh.PropertyShape);\n                this.assertClass(o);\n                return;\n            }\n            case ontologies_1.sh.path.id: {\n                this.assertShape(s, ontologies_1.sh.PropertyShape);\n                this.assertProperty(o);\n                return;\n            }\n            case ontologies_1.sh.property.id: {\n                this.assertShape(s, ontologies_1.sh.NodeShape);\n                this.assertShape(o, ontologies_1.sh.PropertyShape);\n                return;\n            }\n            case ontologies_1.sh.parameter.id: {\n                this.assertShape(o, ontologies_1.sh.Parameter);\n                this.assertParameterizable(s);\n                return;\n            }\n            case ontologies_1.sh.labelTemplate.id: {\n                this.assertParameterizable(s);\n                return;\n            }\n            case ontologies_1.sh.validator.id: {\n                this.assertValidator(o);\n                return;\n            }\n            case ontologies_1.sh.rule.id: {\n                this.assertRule(o);\n                return;\n            }\n            case ontologies_1.sh.subject.id:\n            case ontologies_1.sh.predicate.id:\n            case ontologies_1.sh.object.id: {\n                this.assertRule(s);\n                return;\n            }\n        }\n    }\n}\nexports.ShaclReasoner = ShaclReasoner;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/reasoners/shacl-reasoner.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/reasoners/skos-reasoner.ts":
+/*!********************************************!*\
+  !*** ./src/rdf/reasoners/skos-reasoner.ts ***!
+  \********************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.SkosReasoner = void 0;\nconst ontologies_1 = __webpack_require__(/*! ../../ontologies */ \"./src/ontologies/index.ts\");\nconst reasoner_1 = __webpack_require__(/*! ./reasoner */ \"./src/rdf/reasoners/reasoner.ts\");\n/**\n * A simple SKOS reasoner that expands the graph with inferred triples.\n */\nclass SkosReasoner extends reasoner_1.ReasonerBase {\n    constructor() {\n        super(...arguments);\n        this.concepts = new Set();\n        this.conceptSchemes = new Set();\n        this.collections = new Set();\n    }\n    applyInference(quad) {\n        this.inferConceptAxioms(quad);\n        this.inferCollectionAxioms(quad);\n    }\n    assertConcept(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.skos.Concept, this.targetGraph);\n        this.concepts.add(subject.id);\n    }\n    assertConceptScheme(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.skos.ConceptScheme, this.targetGraph);\n        this.conceptSchemes.add(subject.id);\n    }\n    isClass(id) {\n        return this.concepts.has(id) ||\n            this.conceptSchemes.has(id) ||\n            this.collections.has(id);\n    }\n    inferConceptAxioms(quad) {\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.equals(ontologies_1.skos.Concept)) {\n                    // No need to infer the type, as it is already asserted.\n                    this.concepts.add(s.id);\n                }\n                else if (o.equals(ontologies_1.skos.ConceptScheme)) {\n                    // No need to infer the type, as it is already asserted.\n                    this.conceptSchemes.add(s.id);\n                }\n                return;\n            }\n            case ontologies_1.skos.inScheme.id: {\n                this.assertConcept(s);\n                this.assertConceptScheme(o);\n                return;\n            }\n            case ontologies_1.skos.topConceptOf.id: {\n                this.assertConcept(s);\n                this.assertConceptScheme(o);\n                return;\n            }\n            case ontologies_1.skos.hasTopConcept.id: {\n                this.assertConcept(o);\n                this.assertConceptScheme(s);\n                return;\n            }\n        }\n    }\n    assertCollection(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.skos.Collection, this.targetGraph);\n        this.collections.add(subject.id);\n    }\n    assertOrderedCollection(subject) {\n        this.store.addQuad(subject, ontologies_1.rdf.type, ontologies_1.skos.OrderedCollection, this.targetGraph);\n        // We do not make a distinction between collections and ordered collections here.\n        this.collections.add(subject.id);\n    }\n    inferCollectionAxioms(quad) {\n        let s = quad.subject;\n        let p = quad.predicate;\n        let o = quad.object.termType != \"Literal\" ? quad.object : undefined;\n        if (!o) {\n            return;\n        }\n        switch (p.id) {\n            case ontologies_1.rdf.type.id: {\n                if (o.equals(ontologies_1.skos.Collection)) {\n                    // No need to infer the type, as it is already asserted.\n                    this.collections.add(s.id);\n                }\n                else if (o.equals(ontologies_1.skos.OrderedCollection)) {\n                    // No need to infer the type, as it is already asserted.\n                    this.collections.add(s.id);\n                }\n                return;\n            }\n            case ontologies_1.skos.member.id: {\n                this.assertCollection(s);\n                return;\n            }\n            case ontologies_1.skos.memberList.id: {\n                this.assertOrderedCollection(s);\n                return;\n            }\n        }\n    }\n}\nexports.SkosReasoner = SkosReasoner;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/reasoners/skos-reasoner.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/resource-repository.ts":
+/*!****************************************!*\
+  !*** ./src/rdf/resource-repository.ts ***!
+  \****************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ResourceRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst uri_1 = __webpack_require__(/*! ./uri */ \"./src/rdf/uri.ts\");\n/**\n * A repository for retrieving resources from graphs.\n */\nclass ResourceRepository {\n    constructor(store) {\n        this.store = store;\n    }\n    /**\n     * Inidiates if a node should not be included in the result of a definition query.\n     * @param graphUris URIs of the graphs to search.\n     * @param subject The focus node.\n     * @param options Definition query options.\n     * @param optionDefaults Custom default values for the query options.\n     * @returns\n     */\n    skip(graphUris, subject, options, optionDefaults = { includeBlankNodes: false, includeReferenced: false }) {\n        const opts = { ...optionDefaults, ...options };\n        if (!opts.includeBlankNodes && subject.termType != \"NamedNode\") {\n            // We are only interested in named nodes.\n            return true;\n        }\n        if (!opts.includeReferenced && !this.hasSubject(graphUris, subject)) {\n            // Skip the node if it is not explicitly defined in the graph as a subject.\n            return true;\n        }\n        if (opts?.definedBy !== undefined) {\n            const isDefined = this.isDefinedBy(graphUris, subject, opts.definedBy);\n            // Do not skip the node if it has a different namespace but is *explicitly* defined by the given URI.\n            if (opts.definedBy === null && isDefined || opts.definedBy !== null && !isDefined) {\n                return true;\n            }\n        }\n        else if (opts?.notDefinedBy !== undefined) {\n            for (const source of opts.notDefinedBy) {\n                if (this.isDefinedBy(graphUris, subject, source)) {\n                    return true;\n                }\n            }\n        }\n        return false;\n    }\n    /**\n     * Indicate if a given URI exists as the subject of a triple in the graph.\n     * @param graphUris URIs of the graphs to search.\n     * @param subjectUri URI of the subject to search for.\n     * @returns true if the URI is a subject, false otherwise.\n     */\n    hasSubject(graphUris, subjectUri) {\n        let s;\n        if (typeof subjectUri === \"string\") {\n            s = n3.DataFactory.namedNode(subjectUri);\n        }\n        else if (subjectUri.termType !== \"Literal\") {\n            s = subjectUri;\n        }\n        if (s) {\n            for (let _ of this.store.match(graphUris, s, null, null, false)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Indicate if a node is explicitly defined by the given URI using the `rdfs:isDefinedBy` property, or implicitly by sharing the same namespace.\n     * @param graphUris URIs of the graphs to search.\n     * @param node A named node to check if it is defined by the given URI.\n     * @param definedBy URI of the vocabulary that defines the resource (rdfs:isDefinedBy). Provide `null` to only return resources that have no `rdfs:isDefinedBy` property.\n     * @returns `true` if the node is defined by the given URI, `false` otherwise.\n     */\n    isDefinedBy(graphUris, node, definedBy) {\n        const s = node;\n        if (definedBy === null) {\n            // If there is no definedBy URI, we assume that the resource is not\n            // explicitly defined by any ontology.\n            for (let _ of this.store.match(graphUris, s, ontologies_1.rdfs.isDefinedBy, null)) {\n                return true;\n            }\n        }\n        else {\n            // We assume that a resource is defined by an ontology if it starts with the namespace of the ontology.\n            if (node.value.startsWith(definedBy)) {\n                return true;\n            }\n            // If the ontology is something like <http://purl.obolibrary.org/obo/bfo.owl> or <http://www.w3.org/ns/prov#>\n            // and the subject is <http://purl.obolibrary.org/obo/BFO_0000001> or <http://www.w3.org/ns/prov#Entity>\n            // then we assume that it is defined by the ontology. The OBO case shows that we need to remove the file\n            // name in oder to be able to compare the namespace URIs.\n            const ontologyNamespace = uri_1.Uri.getNormalizedUri(uri_1.Uri.getNamespaceUri(definedBy));\n            const subjectNamespace = uri_1.Uri.getNormalizedUri(uri_1.Uri.getNamespaceUri(node.value));\n            if (subjectNamespace === ontologyNamespace) {\n                return true;\n            }\n            const o = n3.DataFactory.namedNode(uri_1.Uri.getNormalizedUri(definedBy));\n            // The explicit annotation of the definition source has precedence over heuristic checks.\n            for (let q of this.store.match(graphUris, s, ontologies_1.rdfs.isDefinedBy, null)) {\n                if (uri_1.Uri.getNormalizedUri(q.object.value) === o.value) {\n                    return true;\n                }\n            }\n            // A blank node is defined in the namespace if it is the object of a triple that is defined by the URI.\n            if (s.termType === \"BlankNode\") {\n                for (let q of this.store.match(graphUris, null, null, s, false)) {\n                    return this.isDefinedBy(graphUris, q.subject, definedBy);\n                }\n            }\n        }\n        return false;\n    }\n    /**\n     * Indicate if a resource has a given type in the graph.\n     * @param graphUris URIs of the graphs to search.\n     * @param subjectUri URI or blank node id of the subject to match.\n     * @param typeUri URI of the type to match.\n     * @param options Optional query parameters.\n     * @returns `true` if the resource has the type, `false` otherwise.\n     */\n    hasType(graphUris, subjectUri, typeUri, options) {\n        const o = n3.DataFactory.namedNode(typeUri);\n        for (let _ of this.store.match(graphUris, n3.DataFactory.namedNode(subjectUri), ontologies_1.rdf.type, o, options?.includeInferred)) {\n            return true;\n        }\n        for (let _ of this.store.match(graphUris, n3.DataFactory.blankNode(subjectUri), ontologies_1.rdf.type, o, options?.includeInferred)) {\n            return true;\n        }\n        return false;\n    }\n}\nexports.ResourceRepository = ResourceRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/resource-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/shape-repository.ts":
+/*!*************************************!*\
+  !*** ./src/rdf/shape-repository.ts ***!
+  \*************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.ShapeRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst individual_repository_1 = __webpack_require__(/*! ./individual-repository */ \"./src/rdf/individual-repository.ts\");\n/**\n * A repository for retrieving SHACL shapes from graphs.\n */\nclass ShapeRepository extends individual_repository_1.IndividualRepository {\n    constructor(store) { super(store); }\n    /**\n     * Get all shapes in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all shapes in the repository.\n     */\n    getShapes(graphUris, subjectUri, options) {\n        const result = new Set();\n        if (!subjectUri) {\n            for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.Shape, options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n        }\n        else {\n            const s = n3.DataFactory.namedNode(subjectUri);\n            for (let q of this.store.match(graphUris, s, ontologies_1.rdf.type, ontologies_1.sh.Shape, options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n            for (let q of this.store.match(graphUris, null, ontologies_1.sh.targetClass, s, options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n            for (let q of this.store.match(graphUris, null, ontologies_1.sh.path, s, options?.includeInferred)) {\n                if (!this.skip(graphUris, q.subject, options)) {\n                    result.add(q.subject.value);\n                }\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all shape types in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all shape types in the repository.\n     */\n    getShapeTypes(graphUris, options) {\n        const result = new Set();\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.NodeShape)) {\n            if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {\n                result.add(ontologies_1.SH.NodeShape);\n                break;\n            }\n        }\n        for (let q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.PropertyShape)) {\n            if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {\n                result.add(ontologies_1.SH.PropertyShape);\n                break;\n            }\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all validator types in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all shape types in the repository.\n     */\n    getValidatorTypes(graphUris, options) {\n        const result = new Set();\n        // Get all validators in the repository, including the inferred ones.\n        if (this.store.has(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.Validator, options?.includeInferred)) {\n            result.add(ontologies_1.SH.Validator);\n        }\n        if (this.store.has(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.JSValidator, false)) {\n            result.add(ontologies_1.SH.JSValidator);\n        }\n        if (this.store.has(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.SPARQLAskValidator, false)) {\n            result.add(ontologies_1.SH.SPARQLAskValidator);\n        }\n        if (this.store.has(graphUris, null, ontologies_1.rdf.type, ontologies_1.sh.SPARQLSelectValidator, false)) {\n            result.add(ontologies_1.SH.SPARQLSelectValidator);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Get all target classes, nodes or properties of a given shape in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param shape The URI or blank id of the shape.\n     * @param options Optional query parameters.\n     * @returns A list of all targeted reesources in the repository.\n     */\n    getShapeTargets(graphUris, shape, options) {\n        const result = new Set();\n        // Add the shape definition itself if it is a class.\n        for (let q of this.store.match(graphUris, shape, ontologies_1.rdf.type, ontologies_1.rdfs.Class, true)) {\n            result.add(q.subject.value);\n        }\n        for (let q of this.store.match(graphUris, shape, ontologies_1.sh.targetClass, null, options?.includeInferred)) {\n            result.add(q.object.value);\n        }\n        for (let q of this.store.match(graphUris, shape, ontologies_1.sh.targetNode, null, options?.includeInferred)) {\n            result.add(q.object.value);\n        }\n        for (let q of this.store.match(graphUris, shape, ontologies_1.sh.path, null, options?.includeInferred)) {\n            result.add(q.object.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicate if there are shapes for a subject in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri The URI of the subject.\n     * @param options Optional query parameters.\n     * @returns `true` if there are shapes for the subject, `false` otherwise.\n     */\n    hasShapes(graphUris, subjectUri, options) {\n        const s = n3.DataFactory.namedNode(subjectUri);\n        for (let q of this.store.match(graphUris, s, ontologies_1.rdf.type, ontologies_1.sh.Shape)) {\n            if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {\n                return true;\n            }\n        }\n        for (let q of this.store.match(graphUris, null, ontologies_1.sh.targetClass, s)) {\n            if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {\n                return true;\n            }\n        }\n        for (let q of this.store.match(graphUris, null, ontologies_1.sh.path, s)) {\n            if (!this.skip(graphUris, q.subject, options, { includeBlankNodes: true })) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Indicate if there validators defined in the vocabulary.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all validators in the repository.\n     */\n    hasValidators(graphUris, options) {\n        return this.hasSubjectsOfType(graphUris, ontologies_1.SH.Validator, options);\n    }\n    /**\n     * Get all validators in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all validators in the repository.\n     */\n    getValidators(graphUris, options) {\n        return this.getSubjectsOfType(graphUris, ontologies_1.SH.Validator, options);\n    }\n    /**\n     * Indicate if there are rules in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri The URI of the subject.\n     * @param options Optional query parameters.\n     * @returns `true` if there are rules for the subject, `false` otherwise.\n     */\n    hasRules(graphUris, options) {\n        return this.hasSubjectsOfType(graphUris, ontologies_1.SH.Rule, options);\n    }\n    /**\n     * Get all rules in the repository.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param options Optional query parameters.\n     * @returns A list of all rules in the repository.\n     */\n    getRules(graphUris, options) {\n        return this.getSubjectsOfType(graphUris, ontologies_1.SH.Rule, options);\n    }\n    /**\n     * Get the SHACL datatype of a given property.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri The URI of the subject.\n     * @param options Optional query parameters.\n     * @returns A datatype URI on success, `xsd:anyURI` otherwise.\n     */\n    getDatatype(graphUris, subjectUri, options) {\n        for (let q of this.store.match(graphUris, null, ontologies_1.sh.path, n3.DataFactory.namedNode(subjectUri), options?.includeInferred)) {\n            for (let x of this.store.match(graphUris, q.subject, ontologies_1.sh.datatype, null, options?.includeInferred)) {\n                return x.object.value;\n            }\n        }\n    }\n    /**\n     * Get the SHACL cardinality constraints of a given property.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subjectUri The URI of the subject.\n     * @param options Optional query parameters.\n     * @returns An object with the minimum and maximum cardinalities; values are `-1` if not found.\n     */\n    getCardinalites(graphUris, subjectUri, options) {\n        let minCount = -1;\n        let maxCount = -1;\n        for (let q of this.store.match(graphUris, null, ontologies_1.sh.path, n3.DataFactory.namedNode(subjectUri), options?.includeInferred)) {\n            for (let x of this.store.match(graphUris, q.subject, ontologies_1.sh.minCount, null, options?.includeInferred)) {\n                minCount = parseInt(x.object.value);\n                break;\n            }\n            for (let x of this.store.match(graphUris, q.subject, ontologies_1.sh.maxCount, null, options?.includeInferred)) {\n                maxCount = parseInt(x.object.value);\n                break;\n            }\n        }\n        return { minCount, maxCount };\n    }\n    /**\n     * Get the RDF property path representation of the given SHACL property path. This method parses the SHACL property path and\n     * returns the RDF property path as a combination of nodes and strings.\n     * @param graphUris URIs of the graphs to search, `undefined` for the default graph.\n     * @param subject The URI or blank id of the node referred to by sh:path.\n     * @param options Optional query parameters.\n     * @returns A flattened list of all path components, either as URIs or as strings.\n     */\n    getPropertyPathTokens(graphUris, subject) {\n        const visitedNodes = new Set();\n        /**\n         * Parse the given subject node and return the path components.\n         * @param subject The currently parsed focus node.\n         * @param level The nesting level of the current path.\n         * @param separator The separator to use to separate path components.\n         * @param i The index of the current node in a list.\n         * @returns The sub path of the current node.\n         */\n        const parse = (subject, level, separator = '/', i = 0) => {\n            if (visitedNodes.has(subject.value)) {\n                return [];\n            }\n            visitedNodes.add(subject.value);\n            if (subject.termType === 'NamedNode') {\n                // If we have a terminal node, we add it to the path.\n                return [subject];\n            }\n            else {\n                // Determine if we are looking at an item in a collection.\n                const first = this.store.match(graphUris, subject, ontologies_1.rdf.first, null, false).next().value;\n                if (first) {\n                    // Note: We increase the nesting level as nested nodes in paths need to be wrapped in parentheses.\n                    const path = parse(first.object, level + 1);\n                    const rest = this.store.match(graphUris, subject, ontologies_1.rdf.rest, null, false).next().value;\n                    if (rest && rest.object.value !== ontologies_1.rdf.nil.id) {\n                        // The first item of the list sees the complete recursively parsed sub path.\n                        const tail = parse(rest.object, level, separator, i + 1);\n                        // If there is no tail we return the current item's path.\n                        if (tail.length === 0) {\n                            return path;\n                        }\n                        // For nested paths, we wrap the path in parentheses if it contains more than one item.\n                        if (i === 0 && level > 0) {\n                            return ['(', ...path, separator, ...tail, ')'];\n                        }\n                        else {\n                            return [...path, separator, ...tail];\n                        }\n                    }\n                    return path;\n                }\n                else {\n                    // Blank nodes that are not lists contain SHACL path predicates.\n                    for (let q of this.store.match(graphUris, subject, null, null, false)) {\n                        switch (q.predicate.value) {\n                            case ontologies_1.sh.inversePath.id: {\n                                return ['^', ...parse(q.object, level)];\n                            }\n                            case ontologies_1.sh.zeroOrOnePath.id: {\n                                return [...parse(q.object, level), '?'];\n                            }\n                            case ontologies_1.sh.zeroOrMorePath.id: {\n                                return [...parse(q.object, level), '*'];\n                            }\n                            case ontologies_1.sh.oneOrMorePath.id: {\n                                return [...parse(q.object, level), '+'];\n                            }\n                            case ontologies_1.sh.alternativePath.id: {\n                                return parse(q.object, level, '|');\n                            }\n                            default:\n                                throw new Error(`Unsupported path predicate: ${q.predicate.value}`);\n                        }\n                    }\n                    throw new Error(`Unsupported path subject: ${subject}`);\n                }\n            }\n        };\n        return parse(subject, 0);\n    }\n}\nexports.ShapeRepository = ShapeRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/shape-repository.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/store.ts":
+/*!**************************!*\
+  !*** ./src/rdf/store.ts ***!
+  \**************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Store = exports.TripleNotFoundError = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst src = tslib_1.__importStar(__webpack_require__(/*! ../ontologies/src */ \"./src/ontologies/src.ts\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst ontologies_2 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\n/**\n * Indicates an error when a triple is not found in the store.\n */\nclass TripleNotFoundError extends Error {\n    /**\n     * Create a new instance of the error.\n     * @param message The error message.\n     */\n    constructor(subject, predicate, object) {\n        super(`No triple was found matching the pattern: ${subject} ${predicate} ${object}`);\n        this.name = \"TripleNotFoundError\";\n    }\n}\nexports.TripleNotFoundError = TripleNotFoundError;\n/*\n * A store for RDF triples with support for reasoning.\n */\nclass Store {\n    /**\n     * Return the number of triples in the store.\n     */\n    get size() {\n        return this._store.size;\n    }\n    /**\n     * Create a new RDF triple store.\n     * @param reasoner The reasoner to be used for inference.\n     */\n    constructor(reasoner) {\n        /**\n         * The N3 triple store implementation.\n         */\n        this._store = new n3.Store();\n        this.reasoner = reasoner;\n    }\n    /**\n     * Loads a set of W3C Standard ontologies into the store (RDF, RDFA, RDFS, OWL, SKOS, SHACL, XSD).\n     */\n    async loadFrameworkOntologies() {\n        await this.loadFromStream(src.rdf, ontologies_2._RDF);\n        await this.loadFromStream(src.rdfa, ontologies_2._RDFA);\n        await this.loadFromStream(src.rdfs, ontologies_2._RDFS);\n        await this.loadFromStream(src.owl, ontologies_2._OWL);\n        await this.loadFromStream(src.sh, ontologies_2._SH);\n        await this.loadFromStream(src.skos, ontologies_2._SKOS);\n        await this.loadFromStream(src.xsd, ontologies_2._XSD);\n    }\n    /**\n     * Get the URIs of the graphs in the triple store.\n     * @returns An array of graph URIs in no particular order.\n     */\n    getGraphs() {\n        return this._store.getGraphs(null, null, null).map(g => g.id);\n    }\n    /**\n     * Load a set of triples into the store.\n     * @param quads An array of quads to be loaded into the store.\n     * @param graphUri The target graph URI.\n     * @param executeInference Indicates if inference should be executed after loading the triples.\n     * @param clearGraph Indicates if the graph should be cleared before loading.\n     * @param onQuad A callback function that will be called for each parsed triple.\n     */\n    _loadQuads(quads, graphUri, executeInference = true, clearGraph = true, onQuad) {\n        const graph = new n3.NamedNode(graphUri.replace('\\\\', '\\/'));\n        // Only clear the graph once if there had been no errors.\n        if (clearGraph) {\n            // Note: Using the match method to clear the graph results in an error because the graph is being modified.\n            this.deleteGraphs([graphUri]);\n            if (this.reasoner) {\n                const inferenceGraph = new n3.NamedNode(this.reasoner.getInferenceGraphUri(graphUri));\n                this.deleteGraphs([inferenceGraph.value]);\n            }\n        }\n        for (let q of quads) {\n            this._store.add(new n3.Quad(q.subject, q.predicate, q.object, graph));\n            if (onQuad) {\n                onQuad(q);\n            }\n        }\n        if (this.reasoner && executeInference) {\n            this.reasoner.expand(this._store, graphUri);\n        }\n    }\n    /**\n     * Create an RDF store from a file.\n     * @param input Input data or stream in Turtle format to be parsed.\n     * @param graphUri URI of the graph to in which the triples will be created.\n     * @param executeInference Indicates if inference should be executed after loading the triples.\n     * @param clearGraph Indicates if the graph should be cleared before loading.\n     * @param onQuad Callback function that will be called for each parsed triple.\n     * @returns A promise that resolves to an RDF store.\n     */\n    async loadFromStream(input, graphUri, executeInference = true, clearGraph = true, onQuad) {\n        return new Promise((resolve, reject) => {\n            let quads = [];\n            new n3.Parser({}).parse(input, (error, quad, done) => {\n                if (error) {\n                    reject(error);\n                }\n                else if (quad) {\n                    quads.push(quad);\n                }\n                else if (done) {\n                    this._loadQuads(quads, graphUri, executeInference, clearGraph, onQuad);\n                    resolve(this);\n                }\n            });\n        });\n    }\n    /**\n     * Indicates if the store contains triples in a given graph.\n     * @param graphUri A graph URI.\n     * @returns `true` if the store contains triples in the graph URI, `false` otherwise.\n     */\n    hasGraph(graphUri) {\n        const uri = typeof graphUri === 'string' ? new n3.NamedNode(graphUri) : graphUri;\n        for (const _ of this._store.match(null, null, null, uri)) {\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Apply inference to the given graph and store the triples in the associated inference graph.\n     * @param graphUri A graph URI.\n     */\n    executeInference(graphUri) {\n        if (this.reasoner) {\n            this.reasoner.expand(this._store, graphUri);\n        }\n    }\n    /**\n     * Delete named graphs from the store.\n     * @param graphUris URIs of the graphs to be deleted.\n     */\n    deleteGraphs(graphUris) {\n        for (let graphUri of graphUris) {\n            const g = new n3.NamedNode(graphUri);\n            for (let q of this._store.match(null, null, null, g)) {\n                this._store.removeQuad(q);\n            }\n        }\n    }\n    /**\n     * Get the URIs of ordered list members in the store.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param listUri URI of the list to get the items from.\n     * @returns An array of URIs of the items in the list.\n     */\n    getListItems(graphUris, listUri) {\n        // To do: Fix #10\n        const list = listUri.includes(':') ? new n3.NamedNode(listUri) : new n3.BlankNode(listUri);\n        return this._getListItems(graphUris, list).map(t => t.value);\n    }\n    _getListItems(graphUris, subject) {\n        const first = Array.from(this.match(graphUris, subject, ontologies_1.rdf.first, null));\n        if (!first.length) {\n            return [];\n        }\n        const rest = Array.from(this.match(graphUris, subject, ontologies_1.rdf.rest, null));\n        const firstItem = first[0].object;\n        const restList = rest[0]?.object;\n        if (restList.value === ontologies_1.RDF.nil) {\n            return [firstItem];\n        }\n        else {\n            const restItems = this._getListItems(graphUris, restList);\n            return [firstItem, ...restItems];\n        }\n    }\n    /**\n     * Query the store for triples matching the given pattern supporting multiple graphs.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param subject A subject URI or null to match any subject.\n     * @param predicate A predicate URI or null to match any predicate.\n     * @param object An object URI or null to match any object.\n     */\n    *match(graphUris, subject, predicate, object, includeInferred) {\n        if (includeInferred && !this.reasoner) {\n            throw new Error('Reasoner is not available to include inferred triples.');\n        }\n        const s = subject;\n        const p = predicate;\n        const o = object;\n        if (graphUris !== undefined) {\n            const graphs = Array.isArray(graphUris) ? graphUris : [graphUris];\n            for (let graph of graphs.map(g => new n3.NamedNode(g))) {\n                yield* this._store.match(s, p, o, graph);\n                if (includeInferred !== false && this.reasoner) {\n                    let inferenceGraph = new n3.NamedNode(this.reasoner.getInferenceGraphUri(graph.value));\n                    yield* this._store.match(s, p, o, inferenceGraph);\n                }\n            }\n        }\n        else {\n            yield* this._store.match(s, p, o);\n        }\n    }\n    /**\n     * Indicate if there are triples matching the given pattern in the store.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param subject A subject URI or null to match any subject.\n     * @param predicate A predicate URI or null to match any predicate.\n     * @param object An object URI or null to match any object.\n     * @returns `true` if there are triples matching the pattern, `false` otherwise.\n     */\n    has(graphUris, subject, predicate, object, includeInferred) {\n        return this.match(graphUris, subject, predicate, object, includeInferred).next().done === false;\n    }\n    /**\n     * Get the first triple matching the given pattern in the store.\n     * @param graphUris Optional graph URI or array of graph URIs to query.\n     * @param subject A subject URI or null to match any subject.\n     * @param predicate A predicate URI or null to match any predicate.\n     * @param object An object URI or null to match any object.\n     * @returns The first triple that matches the pattern.\n     * @throws {TripleNotFoundError} If no triple is found matching the pattern.\n     */\n    first(graphUris, subject, predicate, object, includeInferred) {\n        const result = this.match(graphUris, subject, predicate, object, includeInferred).next().value;\n        if (!result) {\n            throw new TripleNotFoundError(subject, predicate, object);\n        }\n        return result;\n    }\n}\nexports.Store = Store;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/store.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/uri.ts":
+/*!************************!*\
+  !*** ./src/rdf/uri.ts ***!
+  \************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.Uri = void 0;\n/**\n * A helper class for working with URI string.\n */\nclass Uri {\n    /**\n     * Get the portion of a URI after the first occurance of '#' or the last occurance of '/'.\n     * @param uri A URI.\n     * @returns The label portion of the URI.\n     */\n    static getUriLabel(uri) {\n        let u = uri;\n        let n = u.indexOf('?');\n        if (n > -1) {\n            u = uri.substring(0, n);\n        }\n        // If we have namespace URI, return the label of the document or folder.\n        if (u.endsWith('/') || u.endsWith('#')) {\n            u = u.substring(0, u.length - 1);\n        }\n        let ns = Uri.getNamespaceUri(u);\n        return ns.length < u.length ? u.replace(ns, \"\") : undefined;\n    }\n    /**\n     * Get the portion of a URI after the first occurance of '#' or the last occurance of '/'.\n     * @param uri A URI.\n     * @returns The namespace portion of the URI.\n     */\n    static getNamespaceUri(uri) {\n        // Remove any query strings from the URI.\n        let u = uri;\n        let n = u.indexOf('?');\n        if (n > -1) {\n            u = uri.substring(0, n);\n        }\n        // Find the first occurance of '#' and return the substring up to that point.\n        n = u.indexOf('#');\n        if (n > -1) {\n            return u.substring(0, n + 1);\n        }\n        // Find the last occurance of '/' and return the substring up to that point.\n        n = u.lastIndexOf('/');\n        // Only return the substring if it is not the 'http://' or 'https://' protocol.\n        if (n > 8) {\n            return u.substring(0, n + 1);\n        }\n        else {\n            return u + \"/\";\n        }\n    }\n    /**\n     * Get a transformed version of the URI that can be used as a JSON identifier which only contains letters, numbers and dots.\n     * @param uri A URI.\n     * @returns A transformed version which only contains letters, numbers and dots.\n     */\n    static toJsonId(uri) {\n        let u = uri.split('//')[1];\n        if (u) {\n            u = u.replace(/[^a-zA-Z0-9]/g, '.');\n            return u.endsWith('.') ? u.slice(0, -1) : u;\n        }\n        else {\n            return undefined;\n        }\n    }\n    /**\n     * Get a normalized version of the URI which removes any trailing slashes or hashes.\n     * @param uri A URI.\n     * @returns A normalized URI.\n     */\n    static getNormalizedUri(uri) {\n        let u = uri.split('?')[0];\n        if (u.endsWith('/') || u.endsWith('#')) {\n            return u.substring(0, u.length - 1);\n        }\n        else {\n            return u;\n        }\n    }\n}\nexports.Uri = Uri;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/uri.ts?");
+
+/***/ }),
+
+/***/ "./src/rdf/vocabulary-repository.ts":
+/*!******************************************!*\
+  !*** ./src/rdf/vocabulary-repository.ts ***!
+  \******************************************/
+/***/ ((__unused_webpack_module, exports, __webpack_require__) => {
+
+"use strict";
+eval("\nObject.defineProperty(exports, \"__esModule\", ({ value: true }));\nexports.VocabularyRepository = void 0;\nconst tslib_1 = __webpack_require__(/*! tslib */ \"./node_modules/tslib/tslib.es6.mjs\");\nconst n3 = tslib_1.__importStar(__webpack_require__(/*! n3 */ \"./node_modules/n3/src/index.js\"));\nconst ontologies_1 = __webpack_require__(/*! ../ontologies */ \"./src/ontologies/index.ts\");\nconst uri_1 = __webpack_require__(/*! ./uri */ \"./src/rdf/uri.ts\");\nconst shape_repository_1 = __webpack_require__(/*! ./shape-repository */ \"./src/rdf/shape-repository.ts\");\n/**\n * A repository for retrieving ontologies and ontology concepts from graphs.\n */\nclass VocabularyRepository extends shape_repository_1.ShapeRepository {\n    /**\n     * Get all concept schemes in the repository.\n     * @param graphUris URIs of the graphs to search.\n     * @returns A list of all concept schemes in the repository.\n     */\n    getConceptSchemes(graphUris) {\n        const result = new Set();\n        for (const q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.skos.ConceptScheme)) {\n            const s = q.subject;\n            if (s.termType != \"NamedNode\") {\n                continue;\n            }\n            result.add(s.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicates whether the repository contains any concept schemes.\n     * @param graphUris URIs of the graphs to search.\n     * @returns `true` if the repository contains any concept schemes, `false` otherwise.\n     */\n    hasConceptSchemes(graphUris) {\n        return this.getConceptSchemes(graphUris).length > 0;\n    }\n    /**\n     * Get all ontologies in the repository.\n     * @param graphUris URIs of the graphs to search.\n     * @returns A list of all ontologies in the repository.\n     */\n    getOntologies(graphUris) {\n        const result = new Set();\n        for (const q of this.store.match(graphUris, null, ontologies_1.rdf.type, ontologies_1.owl.Ontology)) {\n            const s = q.subject;\n            if (s.termType != \"NamedNode\") {\n                continue;\n            }\n            result.add(s.value);\n        }\n        return Array.from(result);\n    }\n    /**\n     * Indicates whether the repository contains any ontology headers.\n     * @param graphUris URIs of the graphs to search.\n     * @returns `true` if the repository contains any ontology headers, `false` otherwise.\n     */\n    hasOntologies(graphUris) {\n        return this.getOntologies(graphUris).length > 0;\n    }\n    /**\n     * Get the version (owl:versionInfo) of an ontology. If the version is a date, it is returned as a string in the format \"YYYY-MM-DD\".\n     * @param graphUris URIs of the graphs to search.\n     * @param ontologyUri URI of the ontology.\n     * @returns The version of the ontology, or undefined if it is not found.\n     */\n    getOntologyVersionInfo(graphUris, ontologyUri) {\n        const s = new n3.NamedNode(ontologyUri);\n        for (const q of this.store.match(graphUris, s, ontologies_1.owl.versionInfo, null)) {\n            // If the version is a date, return it in the format \"YYYY-MM-DD\".\n            const match = q.object.value.match(/(\\d{4}[\\/-]\\d{2}[\\/-]\\d{2})/);\n            if (match && match.length > 1) {\n                return new Date(match[1]).toISOString().substring(0, 10);\n            }\n            else {\n                return q.object.value;\n            }\n        }\n    }\n    /**\n     * Get the sources of definitions for a given graph. These are ontology definitions\n     * or the objects of `rdfs:isDefinedBy` triples. If the rdfs:isDefinedBy object can be\n     * matched with an ontology definition, the ontology URI is returned.\n     * @param graphUris URIs of the graphs to search.\n     * @returns A list of sources of definitions for the given graph.\n     */\n    getDefinitionSources(graphUris, includeOntologies = false) {\n        const result = new Set();\n        // Load all ontologies in the graph in a normalized form.\n        const ontologies = {};\n        // Store the normalized versions of the ontology URI so that we can detect \n        // equality even if different namespace seperators ('#' and '/') are used.\n        for (let o of this.getOntologies(graphUris)) {\n            const uri = uri_1.Uri.getNormalizedUri(o);\n            ontologies[uri] = o;\n        }\n        for (const q of this.store.match(graphUris, null, ontologies_1.rdfs.isDefinedBy, null)) {\n            const s = q.subject;\n            const o = q.object;\n            if (s.termType != \"NamedNode\" || o.termType != \"NamedNode\") {\n                continue;\n            }\n            // Do not include ontologies in the list of sources. However, if there are other\n            // terms defined by the object it will be included by subsequent iterations.\n            const s_ = uri_1.Uri.getNormalizedUri(s.value);\n            const o_ = uri_1.Uri.getNormalizedUri(o.value);\n            let isOntology = s_ in ontologies;\n            if (!isOntology || includeOntologies) {\n                if (o_ in ontologies) {\n                    result.add(ontologies[o_]);\n                }\n                else {\n                    result.add(o.value);\n                }\n            }\n        }\n        return Array.from(result);\n    }\n}\nexports.VocabularyRepository = VocabularyRepository;\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./src/rdf/vocabulary-repository.ts?");
+
+/***/ }),
+
+/***/ "./node_modules/tslib/tslib.es6.mjs":
+/*!******************************************!*\
+  !*** ./node_modules/tslib/tslib.es6.mjs ***!
+  \******************************************/
+/***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   __addDisposableResource: () => (/* binding */ __addDisposableResource),\n/* harmony export */   __assign: () => (/* binding */ __assign),\n/* harmony export */   __asyncDelegator: () => (/* binding */ __asyncDelegator),\n/* harmony export */   __asyncGenerator: () => (/* binding */ __asyncGenerator),\n/* harmony export */   __asyncValues: () => (/* binding */ __asyncValues),\n/* harmony export */   __await: () => (/* binding */ __await),\n/* harmony export */   __awaiter: () => (/* binding */ __awaiter),\n/* harmony export */   __classPrivateFieldGet: () => (/* binding */ __classPrivateFieldGet),\n/* harmony export */   __classPrivateFieldIn: () => (/* binding */ __classPrivateFieldIn),\n/* harmony export */   __classPrivateFieldSet: () => (/* binding */ __classPrivateFieldSet),\n/* harmony export */   __createBinding: () => (/* binding */ __createBinding),\n/* harmony export */   __decorate: () => (/* binding */ __decorate),\n/* harmony export */   __disposeResources: () => (/* binding */ __disposeResources),\n/* harmony export */   __esDecorate: () => (/* binding */ __esDecorate),\n/* harmony export */   __exportStar: () => (/* binding */ __exportStar),\n/* harmony export */   __extends: () => (/* binding */ __extends),\n/* harmony export */   __generator: () => (/* binding */ __generator),\n/* harmony export */   __importDefault: () => (/* binding */ __importDefault),\n/* harmony export */   __importStar: () => (/* binding */ __importStar),\n/* harmony export */   __makeTemplateObject: () => (/* binding */ __makeTemplateObject),\n/* harmony export */   __metadata: () => (/* binding */ __metadata),\n/* harmony export */   __param: () => (/* binding */ __param),\n/* harmony export */   __propKey: () => (/* binding */ __propKey),\n/* harmony export */   __read: () => (/* binding */ __read),\n/* harmony export */   __rest: () => (/* binding */ __rest),\n/* harmony export */   __runInitializers: () => (/* binding */ __runInitializers),\n/* harmony export */   __setFunctionName: () => (/* binding */ __setFunctionName),\n/* harmony export */   __spread: () => (/* binding */ __spread),\n/* harmony export */   __spreadArray: () => (/* binding */ __spreadArray),\n/* harmony export */   __spreadArrays: () => (/* binding */ __spreadArrays),\n/* harmony export */   __values: () => (/* binding */ __values),\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nfunction __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nvar __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nfunction __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nfunction __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nfunction __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nfunction __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nfunction __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nfunction __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nfunction __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nfunction __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nfunction __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nfunction __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nvar __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nfunction __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nfunction __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nfunction __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nfunction __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nfunction __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nfunction __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nfunction __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nfunction __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nfunction __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nfunction __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nfunction __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nfunction __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nfunction __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nfunction __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nfunction __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nfunction __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nfunction __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose;\n    if (async) {\n        if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n        dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n        if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n        dispose = value[Symbol.dispose];\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nfunction __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = ({\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n});\n\n\n//# sourceURL=webpack://@faubulous/mentor-rdf/./node_modules/tslib/tslib.es6.mjs?");
+
+/***/ })
+
+/******/ 	});
+/************************************************************************/
+/******/ 	// The module cache
+/******/ 	var __webpack_module_cache__ = {};
+/******/ 	
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/ 		// Check if module is in cache
+/******/ 		var cachedModule = __webpack_module_cache__[moduleId];
+/******/ 		if (cachedModule !== undefined) {
+/******/ 			return cachedModule.exports;
+/******/ 		}
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = __webpack_module_cache__[moduleId] = {
+/******/ 			// no module.id needed
+/******/ 			// no module.loaded needed
+/******/ 			exports: {}
+/******/ 		};
+/******/ 	
+/******/ 		// Execute the module function
+/******/ 		__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/ 	
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/ 	
+/************************************************************************/
+/******/ 	/* webpack/runtime/compat get default export */
+/******/ 	(() => {
+/******/ 		// getDefaultExport function for compatibility with non-harmony modules
+/******/ 		__webpack_require__.n = (module) => {
+/******/ 			var getter = module && module.__esModule ?
+/******/ 				() => (module['default']) :
+/******/ 				() => (module);
+/******/ 			__webpack_require__.d(getter, { a: getter });
+/******/ 			return getter;
+/******/ 		};
+/******/ 	})();
+/******/ 	
+/******/ 	/* webpack/runtime/define property getters */
+/******/ 	(() => {
+/******/ 		// define getter functions for harmony exports
+/******/ 		__webpack_require__.d = (exports, definition) => {
+/******/ 			for(var key in definition) {
+/******/ 				if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {
+/******/ 					Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });
+/******/ 				}
+/******/ 			}
+/******/ 		};
+/******/ 	})();
+/******/ 	
+/******/ 	/* webpack/runtime/global */
+/******/ 	(() => {
+/******/ 		__webpack_require__.g = (function() {
+/******/ 			if (typeof globalThis === 'object') return globalThis;
+/******/ 			try {
+/******/ 				return this || new Function('return this')();
+/******/ 			} catch (e) {
+/******/ 				if (typeof window === 'object') return window;
+/******/ 			}
+/******/ 		})();
+/******/ 	})();
+/******/ 	
+/******/ 	/* webpack/runtime/hasOwnProperty shorthand */
+/******/ 	(() => {
+/******/ 		__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))
+/******/ 	})();
+/******/ 	
+/******/ 	/* webpack/runtime/make namespace object */
+/******/ 	(() => {
+/******/ 		// define __esModule on exports
+/******/ 		__webpack_require__.r = (exports) => {
+/******/ 			if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
+/******/ 				Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+/******/ 			}
+/******/ 			Object.defineProperty(exports, '__esModule', { value: true });
+/******/ 		};
+/******/ 	})();
+/******/ 	
+/************************************************************************/
+/******/ 	
+/******/ 	// startup
+/******/ 	// Load entry module and return exports
+/******/ 	// This entry module is referenced by other modules so it can't be inlined
+/******/ 	var __webpack_exports__ = __webpack_require__("./src/index.ts");
+/******/ 	module.exports = __webpack_exports__;
+/******/ 	
+/******/ })()
+;