text: /******/ (function(modules) { // webpackBootstrap
  /******/ 	// The module cache
  /******/ 	var installedModules = {};
  /******/
  /******/ 	// The require function
  /******/ 	function __webpack_require__(moduleId) {
  /******/
  /******/ 		// Check if module is in cache
  /******/ 		if(installedModules[moduleId]) {
  /******/ 			return installedModules[moduleId].exports;
  /******/ 		}
  /******/ 		// Create a new module (and put it into the cache)
  /******/ 		var module = installedModules[moduleId] = {
  /******/ 			i: moduleId,
  /******/ 			l: false,
  /******/ 			exports: {}
  /******/ 		};
  /******/
  /******/ 		// Execute the module function
  /******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
  /******/
  /******/ 		// Flag the module as loaded
  /******/ 		module.l = true;
  /******/
  /******/ 		// Return the exports of the module
  /******/ 		return module.exports;
  /******/ 	}
  /******/
  /******/
  /******/ 	// expose the modules object (__webpack_modules__)
  /******/ 	__webpack_require__.m = modules;
  /******/
  /******/ 	// expose the module cache
  /******/ 	__webpack_require__.c = installedModules;
  /******/
  /******/ 	// define getter function for harmony exports
  /******/ 	__webpack_require__.d = function(exports, name, getter) {
  /******/ 		if(!__webpack_require__.o(exports, name)) {
  /******/ 			Object.defineProperty(exports, name, { enumerable: true, get: getter });
  /******/ 		}
  /******/ 	};
  /******/
  /******/ 	// define __esModule on exports
  /******/ 	__webpack_require__.r = function(exports) {
  /******/ 		if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
  /******/ 			Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
  /******/ 		}
  /******/ 		Object.defineProperty(exports, '__esModule', { value: true });
  /******/ 	};
  /******/
  /******/ 	// create a fake namespace object
  /******/ 	// mode & 1: value is a module id, require it
  /******/ 	// mode & 2: merge all properties of value into the ns
  /******/ 	// mode & 4: return value when already ns object
  /******/ 	// mode & 8|1: behave like require
  /******/ 	__webpack_require__.t = function(value, mode) {
  /******/ 		if(mode & 1) value = __webpack_require__(value);
  /******/ 		if(mode & 8) return value;
  /******/ 		if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;
  /******/ 		var ns = Object.create(null);
  /******/ 		__webpack_require__.r(ns);
  /******/ 		Object.defineProperty(ns, 'default', { enumerable: true, value: value });
  /******/ 		if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));
  /******/ 		return ns;
  /******/ 	};
  /******/
  /******/ 	// getDefaultExport function for compatibility with non-harmony modules
  /******/ 	__webpack_require__.n = function(module) {
  /******/ 		var getter = module && module.__esModule ?
  /******/ 			function getDefault() { return module['default']; } :
  /******/ 			function getModuleExports() { return module; };
  /******/ 		__webpack_require__.d(getter, 'a', getter);
  /******/ 		return getter;
  /******/ 	};
  /******/
  /******/ 	// Object.prototype.hasOwnProperty.call
  /******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
  /******/
  /******/ 	// __webpack_public_path__
  /******/ 	__webpack_require__.p = "";
  /******/
  /******/
  /******/ 	// Load entry module and return exports
  /******/ 	return __webpack_require__(__webpack_require__.s = "./node_modules/worker-loader/dist/cjs.js?!./node_modules/geotiff/src/decoder.worker.js");
  /******/ })
  /************************************************************************/
  /******/ ({
  
  /***/ "./node_modules/worker-loader/dist/cjs.js?!./node_modules/geotiff/src/decoder.worker.js":
  /*!*****************************************************************************************************!*\
    !*** ./node_modules/worker-loader/dist/cjs.js??ref--5!./node_modules/geotiff/src/decoder.worker.js ***!
    \*****************************************************************************************************/
  /*! no static exports found */
  /***/ (function(module, exports, __webpack_require__) {
  
  eval("module.exports = function() {\n  return __webpack_require__(/*! !./node_modules/worker-loader/dist/workers/InlineWorker.js */ \"./node_modules/worker-loader/dist/workers/InlineWorker.js\")(\"/******/ (function(modules) { // webpackBootstrap\\n/******/ \\t// The module cache\\n/******/ \\tvar installedModules = {};\\n/******/\\n/******/ \\t// The require function\\n/******/ \\tfunction __webpack_require__(moduleId) {\\n/******/\\n/******/ \\t\\t// Check if module is in cache\\n/******/ \\t\\tif(installedModules[moduleId]) {\\n/******/ \\t\\t\\treturn installedModules[moduleId].exports;\\n/******/ \\t\\t}\\n/******/ \\t\\t// Create a new module (and put it into the cache)\\n/******/ \\t\\tvar module = installedModules[moduleId] = {\\n/******/ \\t\\t\\ti: moduleId,\\n/******/ \\t\\t\\tl: false,\\n/******/ \\t\\t\\texports: {}\\n/******/ \\t\\t};\\n/******/\\n/******/ \\t\\t// Execute the module function\\n/******/ \\t\\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\\n/******/\\n/******/ \\t\\t// Flag the module as loaded\\n/******/ \\t\\tmodule.l = true;\\n/******/\\n/******/ \\t\\t// Return the exports of the module\\n/******/ \\t\\treturn module.exports;\\n/******/ \\t}\\n/******/\\n/******/\\n/******/ \\t// expose the modules object (__webpack_modules__)\\n/******/ \\t__webpack_require__.m = modules;\\n/******/\\n/******/ \\t// expose the module cache\\n/******/ \\t__webpack_require__.c = installedModules;\\n/******/\\n/******/ \\t// define getter function for harmony exports\\n/******/ \\t__webpack_require__.d = function(exports, name, getter) {\\n/******/ \\t\\tif(!__webpack_require__.o(exports, name)) {\\n/******/ \\t\\t\\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\\n/******/ \\t\\t}\\n/******/ \\t};\\n/******/\\n/******/ \\t// define __esModule on exports\\n/******/ \\t__webpack_require__.r = function(exports) {\\n/******/ \\t\\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\\n/******/ \\t\\t\\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\\n/******/ \\t\\t}\\n/******/ \\t\\tObject.defineProperty(exports, '__esModule', { value: true });\\n/******/ \\t};\\n/******/\\n/******/ \\t// create a fake namespace object\\n/******/ \\t// mode & 1: value is a module id, require it\\n/******/ \\t// mode & 2: merge all properties of value into the ns\\n/******/ \\t// mode & 4: return value when already ns object\\n/******/ \\t// mode & 8|1: behave like require\\n/******/ \\t__webpack_require__.t = function(value, mode) {\\n/******/ \\t\\tif(mode & 1) value = __webpack_require__(value);\\n/******/ \\t\\tif(mode & 8) return value;\\n/******/ \\t\\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\\n/******/ \\t\\tvar ns = Object.create(null);\\n/******/ \\t\\t__webpack_require__.r(ns);\\n/******/ \\t\\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\\n/******/ \\t\\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\\n/******/ \\t\\treturn ns;\\n/******/ \\t};\\n/******/\\n/******/ \\t// getDefaultExport function for compatibility with non-harmony modules\\n/******/ \\t__webpack_require__.n = function(module) {\\n/******/ \\t\\tvar getter = module && module.__esModule ?\\n/******/ \\t\\t\\tfunction getDefault() { return module['default']; } :\\n/******/ \\t\\t\\tfunction getModuleExports() { return module; };\\n/******/ \\t\\t__webpack_require__.d(getter, 'a', getter);\\n/******/ \\t\\treturn getter;\\n/******/ \\t};\\n/******/\\n/******/ \\t// Object.prototype.hasOwnProperty.call\\n/******/ \\t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\\n/******/\\n/******/ \\t// __webpack_public_path__\\n/******/ \\t__webpack_require__.p = \\\"\\\";\\n/******/\\n/******/\\n/******/ \\t// Load entry module and return exports\\n/******/ \\treturn __webpack_require__(__webpack_require__.s = \\\"./node_modules/worker-loader/dist/cjs.js?!./node_modules/geotiff/src/decoder.worker.js\\\");\\n/******/ })\\n/************************************************************************/\\n/******/ ({\\n\\n/***/ \\\"./node_modules/worker-loader/dist/cjs.js?!./node_modules/geotiff/src/decoder.worker.js\\\":\\n/*!*****************************************************************************************************!*\\\\\\n  !*** ./node_modules/worker-loader/dist/cjs.js??ref--5!./node_modules/geotiff/src/decoder.worker.js ***!\\n  \\\\*****************************************************************************************************/\\n/*! no static exports found */\\n/***/ (function(module, exports, __webpack_require__) {\\n\\neval(\\\"module.exports = function() {\\\\n  return __webpack_require__(/*! !./node_modules/worker-loader/dist/workers/InlineWorker.js */ \\\\\\\"./node_modules/worker-loader/dist/workers/InlineWorker.js\\\\\\\")(\\\\\\\"/******/ (function(modules) { // webpackBootstrap\\\\\\\\n/******/ \\\\\\\\t// The module cache\\\\\\\\n/******/ \\\\\\\\tvar installedModules = {};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// The require function\\\\\\\\n/******/ \\\\\\\\tfunction __webpack_require__(moduleId) {\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t// Check if module is in cache\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(installedModules[moduleId]) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\treturn installedModules[moduleId].exports;\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t}\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t// Create a new module (and put it into the cache)\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tvar module = installedModules[moduleId] = {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\ti: moduleId,\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\tl: false,\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\texports: {}\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t// Execute the module function\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t// Flag the module as loaded\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tmodule.l = true;\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t// Return the exports of the module\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\treturn module.exports;\\\\\\\\n/******/ \\\\\\\\t}\\\\\\\\n/******/\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// expose the modules object (__webpack_modules__)\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.m = modules;\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// expose the module cache\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.c = installedModules;\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// define getter function for harmony exports\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.d = function(exports, name, getter) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(!__webpack_require__.o(exports, name)) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t}\\\\\\\\n/******/ \\\\\\\\t};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// define __esModule on exports\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.r = function(exports) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t}\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tObject.defineProperty(exports, '__esModule', { value: true });\\\\\\\\n/******/ \\\\\\\\t};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// create a fake namespace object\\\\\\\\n/******/ \\\\\\\\t// mode & 1: value is a module id, require it\\\\\\\\n/******/ \\\\\\\\t// mode & 2: merge all properties of value into the ns\\\\\\\\n/******/ \\\\\\\\t// mode & 4: return value when already ns object\\\\\\\\n/******/ \\\\\\\\t// mode & 8|1: behave like require\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.t = function(value, mode) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(mode & 1) value = __webpack_require__(value);\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(mode & 8) return value;\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tvar ns = Object.create(null);\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t__webpack_require__.r(ns);\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\treturn ns;\\\\\\\\n/******/ \\\\\\\\t};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// getDefaultExport function for compatibility with non-harmony modules\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.n = function(module) {\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\tvar getter = module && module.__esModule ?\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\tfunction getDefault() { return module['default']; } :\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t\\\\\\\\tfunction getModuleExports() { return module; };\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\t__webpack_require__.d(getter, 'a', getter);\\\\\\\\n/******/ \\\\\\\\t\\\\\\\\treturn getter;\\\\\\\\n/******/ \\\\\\\\t};\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// Object.prototype.hasOwnProperty.call\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// __webpack_public_path__\\\\\\\\n/******/ \\\\\\\\t__webpack_require__.p = \\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\";\\\\\\\\n/******/\\\\\\\\n/******/\\\\\\\\n/******/ \\\\\\\\t// Load entry module and return exports\\\\\\\\n/******/ \\\\\\\\treturn __webpack_require__(__webpack_require__.s = \\\\\\\\\\\\\\\"./node_modules/geotiff/src/decoder.worker.js\\\\\\\\\\\\\\\");\\\\\\\\n/******/ })\\\\\\\\n/************************************************************************/\\\\\\\\n/******/ ({\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/basedecoder.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*************************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return BaseDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _predictor__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../predictor */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/predictor.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass BaseDecoder {\\\\\\\\\\\\\\\\n  decode(fileDirectory, buffer) {\\\\\\\\\\\\\\\\n    const decoded = this.decodeBlock(buffer);\\\\\\\\\\\\\\\\n    const predictor = fileDirectory.Predictor || 1;\\\\\\\\\\\\\\\\n    if (predictor !== 1) {\\\\\\\\\\\\\\\\n      const isTiled = !fileDirectory.StripOffsets;\\\\\\\\\\\\\\\\n      const tileWidth = isTiled ? fileDirectory.TileWidth : fileDirectory.ImageWidth;\\\\\\\\\\\\\\\\n      const tileHeight = isTiled ? fileDirectory.TileLength : (\\\\\\\\\\\\\\\\n        fileDirectory.RowsPerStrip || fileDirectory.ImageLength\\\\\\\\\\\\\\\\n      );\\\\\\\\\\\\\\\\n      return Object(_predictor__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"applyPredictor\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"])(\\\\\\\\\\\\\\\\n        decoded, predictor, tileWidth, tileHeight, fileDirectory.BitsPerSample,\\\\\\\\\\\\\\\\n        fileDirectory.PlanarConfiguration,\\\\\\\\\\\\\\\\n      );\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return decoded;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/basedecoder.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/deflate.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*********************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/deflate.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*********************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return DeflateDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var pako_lib_inflate__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! pako/lib/inflate */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/inflate.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var pako_lib_inflate__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(pako_lib_inflate__WEBPACK_IMPORTED_MODULE_0__);\\\\\\\\\\\\\\\\n/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./basedecoder */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass DeflateDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_1__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] {\\\\\\\\\\\\\\\\n  decodeBlock(buffer) {\\\\\\\\\\\\\\\\n    return Object(pako_lib_inflate__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"])(new Uint8Array(buffer)).buffer;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/deflate.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/index.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*******************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/index.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*******************************************************/\\\\\\\\n/*! exports provided: getDecoder */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"getDecoder\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return getDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _raw__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./raw */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/raw.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var _lzw__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./lzw */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/lzw.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var _jpeg__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./jpeg */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/jpeg.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var _deflate__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./deflate */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/deflate.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var _packbits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./packbits */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/packbits.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction getDecoder(fileDirectory) {\\\\\\\\\\\\\\\\n  switch (fileDirectory.Compression) {\\\\\\\\\\\\\\\\n    case undefined:\\\\\\\\\\\\\\\\n    case 1: // no compression\\\\\\\\\\\\\\\\n      return new _raw__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"]();\\\\\\\\\\\\\\\\n    case 5: // LZW\\\\\\\\\\\\\\\\n      return new _lzw__WEBPACK_IMPORTED_MODULE_1__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"]();\\\\\\\\\\\\\\\\n    case 6: // JPEG\\\\\\\\\\\\\\\\n      throw new Error('old style JPEG compression is not supported.');\\\\\\\\\\\\\\\\n    case 7: // JPEG\\\\\\\\\\\\\\\\n      return new _jpeg__WEBPACK_IMPORTED_MODULE_2__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"](fileDirectory);\\\\\\\\\\\\\\\\n    case 8: // Deflate as recognized by Adobe\\\\\\\\\\\\\\\\n    case 32946: // Deflate GDAL default\\\\\\\\\\\\\\\\n      return new _deflate__WEBPACK_IMPORTED_MODULE_3__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"]();\\\\\\\\\\\\\\\\n    case 32773: // packbits\\\\\\\\\\\\\\\\n      return new _packbits__WEBPACK_IMPORTED_MODULE_4__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"]();\\\\\\\\\\\\\\\\n    default:\\\\\\\\\\\\\\\\n      throw new Error(`Unknown compression method identifier: ${fileDirectory.Compression}`);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/index.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/jpeg.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!******************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/jpeg.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\******************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return JpegDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* -*- tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- /\\\\\\\\\\\\\\\\n/* vim: set shiftwidth=2 tabstop=2 autoindent cindent expandtab: */\\\\\\\\\\\\\\\\n/*\\\\\\\\\\\\\\\\n   Copyright 2011 notmasteryet\\\\\\\\\\\\\\\\n   Licensed under the Apache License, Version 2.0 (the \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"License\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n   you may not use this file except in compliance with the License.\\\\\\\\\\\\\\\\n   You may obtain a copy of the License at\\\\\\\\\\\\\\\\n       http://www.apache.org/licenses/LICENSE-2.0\\\\\\\\\\\\\\\\n   Unless required by applicable law or agreed to in writing, software\\\\\\\\\\\\\\\\n   distributed under the License is distributed on an \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"AS IS\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" BASIS,\\\\\\\\\\\\\\\\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\\\\\\\\\\\\\\\n   See the License for the specific language governing permissions and\\\\\\\\\\\\\\\\n   limitations under the License.\\\\\\\\\\\\\\\\n*/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// - The JPEG specification can be found in the ITU CCITT Recommendation T.81\\\\\\\\\\\\\\\\n//   (www.w3.org/Graphics/JPEG/itu-t81.pdf)\\\\\\\\\\\\\\\\n// - The JFIF specification can be found in the JPEG File Interchange Format\\\\\\\\\\\\\\\\n//   (www.w3.org/Graphics/JPEG/jfif3.pdf)\\\\\\\\\\\\\\\\n// - The Adobe Application-Specific JPEG markers in the Supporting the DCT Filters\\\\\\\\\\\\\\\\n//   in PostScript Level 2, Technical Note #5116\\\\\\\\\\\\\\\\n//   (partners.adobe.com/public/developer/en/ps/sdk/5116.DCT_Filter.pdf)\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nconst dctZigZag = new Int32Array([\\\\\\\\\\\\\\\\n  0,\\\\\\\\\\\\\\\\n  1, 8,\\\\\\\\\\\\\\\\n  16, 9, 2,\\\\\\\\\\\\\\\\n  3, 10, 17, 24,\\\\\\\\\\\\\\\\n  32, 25, 18, 11, 4,\\\\\\\\\\\\\\\\n  5, 12, 19, 26, 33, 40,\\\\\\\\\\\\\\\\n  48, 41, 34, 27, 20, 13, 6,\\\\\\\\\\\\\\\\n  7, 14, 21, 28, 35, 42, 49, 56,\\\\\\\\\\\\\\\\n  57, 50, 43, 36, 29, 22, 15,\\\\\\\\\\\\\\\\n  23, 30, 37, 44, 51, 58,\\\\\\\\\\\\\\\\n  59, 52, 45, 38, 31,\\\\\\\\\\\\\\\\n  39, 46, 53, 60,\\\\\\\\\\\\\\\\n  61, 54, 47,\\\\\\\\\\\\\\\\n  55, 62,\\\\\\\\\\\\\\\\n  63,\\\\\\\\\\\\\\\\n]);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nconst dctCos1 = 4017; // cos(pi/16)\\\\\\\\\\\\\\\\nconst dctSin1 = 799; // sin(pi/16)\\\\\\\\\\\\\\\\nconst dctCos3 = 3406; // cos(3*pi/16)\\\\\\\\\\\\\\\\nconst dctSin3 = 2276; // sin(3*pi/16)\\\\\\\\\\\\\\\\nconst dctCos6 = 1567; // cos(6*pi/16)\\\\\\\\\\\\\\\\nconst dctSin6 = 3784; // sin(6*pi/16)\\\\\\\\\\\\\\\\nconst dctSqrt2 = 5793; // sqrt(2)\\\\\\\\\\\\\\\\nconst dctSqrt1d2 = 2896;// sqrt(2) / 2\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction buildHuffmanTable(codeLengths, values) {\\\\\\\\\\\\\\\\n  let k = 0;\\\\\\\\\\\\\\\\n  const code = [];\\\\\\\\\\\\\\\\n  let length = 16;\\\\\\\\\\\\\\\\n  while (length > 0 && !codeLengths[length - 1]) {\\\\\\\\\\\\\\\\n    --length;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  code.push({ children: [], index: 0 });\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  let p = code[0];\\\\\\\\\\\\\\\\n  let q;\\\\\\\\\\\\\\\\n  for (let i = 0; i < length; i++) {\\\\\\\\\\\\\\\\n    for (let j = 0; j < codeLengths[i]; j++) {\\\\\\\\\\\\\\\\n      p = code.pop();\\\\\\\\\\\\\\\\n      p.children[p.index] = values[k];\\\\\\\\\\\\\\\\n      while (p.index > 0) {\\\\\\\\\\\\\\\\n        p = code.pop();\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      p.index++;\\\\\\\\\\\\\\\\n      code.push(p);\\\\\\\\\\\\\\\\n      while (code.length <= i) {\\\\\\\\\\\\\\\\n        code.push(q = { children: [], index: 0 });\\\\\\\\\\\\\\\\n        p.children[p.index] = q.children;\\\\\\\\\\\\\\\\n        p = q;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      k++;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (i + 1 < length) {\\\\\\\\\\\\\\\\n      // p here points to last code\\\\\\\\\\\\\\\\n      code.push(q = { children: [], index: 0 });\\\\\\\\\\\\\\\\n      p.children[p.index] = q.children;\\\\\\\\\\\\\\\\n      p = q;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return code[0].children;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction decodeScan(data, initialOffset,\\\\\\\\\\\\\\\\n  frame, components, resetInterval,\\\\\\\\\\\\\\\\n  spectralStart, spectralEnd,\\\\\\\\\\\\\\\\n  successivePrev, successive) {\\\\\\\\\\\\\\\\n  const { mcusPerLine, progressive } = frame;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const startOffset = initialOffset;\\\\\\\\\\\\\\\\n  let offset = initialOffset;\\\\\\\\\\\\\\\\n  let bitsData = 0;\\\\\\\\\\\\\\\\n  let bitsCount = 0;\\\\\\\\\\\\\\\\n  function readBit() {\\\\\\\\\\\\\\\\n    if (bitsCount > 0) {\\\\\\\\\\\\\\\\n      bitsCount--;\\\\\\\\\\\\\\\\n      return (bitsData >> bitsCount) & 1;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    bitsData = data[offset++];\\\\\\\\\\\\\\\\n    if (bitsData === 0xFF) {\\\\\\\\\\\\\\\\n      const nextByte = data[offset++];\\\\\\\\\\\\\\\\n      if (nextByte) {\\\\\\\\\\\\\\\\n        throw new Error(`unexpected marker: ${((bitsData << 8) | nextByte).toString(16)}`);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      // unstuff 0\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    bitsCount = 7;\\\\\\\\\\\\\\\\n    return bitsData >>> 7;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeHuffman(tree) {\\\\\\\\\\\\\\\\n    let node = tree;\\\\\\\\\\\\\\\\n    let bit;\\\\\\\\\\\\\\\\n    while ((bit = readBit()) !== null) { // eslint-disable-line no-cond-assign\\\\\\\\\\\\\\\\n      node = node[bit];\\\\\\\\\\\\\\\\n      if (typeof node === 'number') {\\\\\\\\\\\\\\\\n        return node;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      if (typeof node !== 'object') {\\\\\\\\\\\\\\\\n        throw new Error('invalid huffman sequence');\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return null;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function receive(initialLength) {\\\\\\\\\\\\\\\\n    let length = initialLength;\\\\\\\\\\\\\\\\n    let n = 0;\\\\\\\\\\\\\\\\n    while (length > 0) {\\\\\\\\\\\\\\\\n      const bit = readBit();\\\\\\\\\\\\\\\\n      if (bit === null) {\\\\\\\\\\\\\\\\n        return undefined;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      n = (n << 1) | bit;\\\\\\\\\\\\\\\\n      --length;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return n;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function receiveAndExtend(length) {\\\\\\\\\\\\\\\\n    const n = receive(length);\\\\\\\\\\\\\\\\n    if (n >= 1 << (length - 1)) {\\\\\\\\\\\\\\\\n      return n;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return n + (-1 << length) + 1;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeBaseline(component, zz) {\\\\\\\\\\\\\\\\n    const t = decodeHuffman(component.huffmanTableDC);\\\\\\\\\\\\\\\\n    const diff = t === 0 ? 0 : receiveAndExtend(t);\\\\\\\\\\\\\\\\n    component.pred += diff;\\\\\\\\\\\\\\\\n    zz[0] = component.pred;\\\\\\\\\\\\\\\\n    let k = 1;\\\\\\\\\\\\\\\\n    while (k < 64) {\\\\\\\\\\\\\\\\n      const rs = decodeHuffman(component.huffmanTableAC);\\\\\\\\\\\\\\\\n      const s = rs & 15;\\\\\\\\\\\\\\\\n      const r = rs >> 4;\\\\\\\\\\\\\\\\n      if (s === 0) {\\\\\\\\\\\\\\\\n        if (r < 15) {\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        k += 16;\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        k += r;\\\\\\\\\\\\\\\\n        const z = dctZigZag[k];\\\\\\\\\\\\\\\\n        zz[z] = receiveAndExtend(s);\\\\\\\\\\\\\\\\n        k++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeDCFirst(component, zz) {\\\\\\\\\\\\\\\\n    const t = decodeHuffman(component.huffmanTableDC);\\\\\\\\\\\\\\\\n    const diff = t === 0 ? 0 : (receiveAndExtend(t) << successive);\\\\\\\\\\\\\\\\n    component.pred += diff;\\\\\\\\\\\\\\\\n    zz[0] = component.pred;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeDCSuccessive(component, zz) {\\\\\\\\\\\\\\\\n    zz[0] |= readBit() << successive;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  let eobrun = 0;\\\\\\\\\\\\\\\\n  function decodeACFirst(component, zz) {\\\\\\\\\\\\\\\\n    if (eobrun > 0) {\\\\\\\\\\\\\\\\n      eobrun--;\\\\\\\\\\\\\\\\n      return;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    let k = spectralStart;\\\\\\\\\\\\\\\\n    const e = spectralEnd;\\\\\\\\\\\\\\\\n    while (k <= e) {\\\\\\\\\\\\\\\\n      const rs = decodeHuffman(component.huffmanTableAC);\\\\\\\\\\\\\\\\n      const s = rs & 15;\\\\\\\\\\\\\\\\n      const r = rs >> 4;\\\\\\\\\\\\\\\\n      if (s === 0) {\\\\\\\\\\\\\\\\n        if (r < 15) {\\\\\\\\\\\\\\\\n          eobrun = receive(r) + (1 << r) - 1;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        k += 16;\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        k += r;\\\\\\\\\\\\\\\\n        const z = dctZigZag[k];\\\\\\\\\\\\\\\\n        zz[z] = receiveAndExtend(s) * (1 << successive);\\\\\\\\\\\\\\\\n        k++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  let successiveACState = 0;\\\\\\\\\\\\\\\\n  let successiveACNextValue;\\\\\\\\\\\\\\\\n  function decodeACSuccessive(component, zz) {\\\\\\\\\\\\\\\\n    let k = spectralStart;\\\\\\\\\\\\\\\\n    const e = spectralEnd;\\\\\\\\\\\\\\\\n    let r = 0;\\\\\\\\\\\\\\\\n    while (k <= e) {\\\\\\\\\\\\\\\\n      const z = dctZigZag[k];\\\\\\\\\\\\\\\\n      const direction = zz[z] < 0 ? -1 : 1;\\\\\\\\\\\\\\\\n      switch (successiveACState) {\\\\\\\\\\\\\\\\n        case 0: { // initial state\\\\\\\\\\\\\\\\n          const rs = decodeHuffman(component.huffmanTableAC);\\\\\\\\\\\\\\\\n          const s = rs & 15;\\\\\\\\\\\\\\\\n          r = rs >> 4;\\\\\\\\\\\\\\\\n          if (s === 0) {\\\\\\\\\\\\\\\\n            if (r < 15) {\\\\\\\\\\\\\\\\n              eobrun = receive(r) + (1 << r);\\\\\\\\\\\\\\\\n              successiveACState = 4;\\\\\\\\\\\\\\\\n            } else {\\\\\\\\\\\\\\\\n              r = 16;\\\\\\\\\\\\\\\\n              successiveACState = 1;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          } else {\\\\\\\\\\\\\\\\n            if (s !== 1) {\\\\\\\\\\\\\\\\n              throw new Error('invalid ACn encoding');\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            successiveACNextValue = receiveAndExtend(s);\\\\\\\\\\\\\\\\n            successiveACState = r ? 2 : 3;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          continue; // eslint-disable-line no-continue\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        case 1: // skipping r zero items\\\\\\\\\\\\\\\\n        case 2:\\\\\\\\\\\\\\\\n          if (zz[z]) {\\\\\\\\\\\\\\\\n            zz[z] += (readBit() << successive) * direction;\\\\\\\\\\\\\\\\n          } else {\\\\\\\\\\\\\\\\n            r--;\\\\\\\\\\\\\\\\n            if (r === 0) {\\\\\\\\\\\\\\\\n              successiveACState = successiveACState === 2 ? 3 : 0;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        case 3: // set value for a zero item\\\\\\\\\\\\\\\\n          if (zz[z]) {\\\\\\\\\\\\\\\\n            zz[z] += (readBit() << successive) * direction;\\\\\\\\\\\\\\\\n          } else {\\\\\\\\\\\\\\\\n            zz[z] = successiveACNextValue << successive;\\\\\\\\\\\\\\\\n            successiveACState = 0;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        case 4: // eob\\\\\\\\\\\\\\\\n          if (zz[z]) {\\\\\\\\\\\\\\\\n            zz[z] += (readBit() << successive) * direction;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        default:\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      k++;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (successiveACState === 4) {\\\\\\\\\\\\\\\\n      eobrun--;\\\\\\\\\\\\\\\\n      if (eobrun === 0) {\\\\\\\\\\\\\\\\n        successiveACState = 0;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeMcu(component, decodeFunction, mcu, row, col) {\\\\\\\\\\\\\\\\n    const mcuRow = (mcu / mcusPerLine) | 0;\\\\\\\\\\\\\\\\n    const mcuCol = mcu % mcusPerLine;\\\\\\\\\\\\\\\\n    const blockRow = (mcuRow * component.v) + row;\\\\\\\\\\\\\\\\n    const blockCol = (mcuCol * component.h) + col;\\\\\\\\\\\\\\\\n    decodeFunction(component, component.blocks[blockRow][blockCol]);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function decodeBlock(component, decodeFunction, mcu) {\\\\\\\\\\\\\\\\n    const blockRow = (mcu / component.blocksPerLine) | 0;\\\\\\\\\\\\\\\\n    const blockCol = mcu % component.blocksPerLine;\\\\\\\\\\\\\\\\n    decodeFunction(component, component.blocks[blockRow][blockCol]);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const componentsLength = components.length;\\\\\\\\\\\\\\\\n  let component;\\\\\\\\\\\\\\\\n  let i;\\\\\\\\\\\\\\\\n  let j;\\\\\\\\\\\\\\\\n  let k;\\\\\\\\\\\\\\\\n  let n;\\\\\\\\\\\\\\\\n  let decodeFn;\\\\\\\\\\\\\\\\n  if (progressive) {\\\\\\\\\\\\\\\\n    if (spectralStart === 0) {\\\\\\\\\\\\\\\\n      decodeFn = successivePrev === 0 ? decodeDCFirst : decodeDCSuccessive;\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      decodeFn = successivePrev === 0 ? decodeACFirst : decodeACSuccessive;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  } else {\\\\\\\\\\\\\\\\n    decodeFn = decodeBaseline;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  let mcu = 0;\\\\\\\\\\\\\\\\n  let marker;\\\\\\\\\\\\\\\\n  let mcuExpected;\\\\\\\\\\\\\\\\n  if (componentsLength === 1) {\\\\\\\\\\\\\\\\n    mcuExpected = components[0].blocksPerLine * components[0].blocksPerColumn;\\\\\\\\\\\\\\\\n  } else {\\\\\\\\\\\\\\\\n    mcuExpected = mcusPerLine * frame.mcusPerColumn;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const usedResetInterval = resetInterval || mcuExpected;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  while (mcu < mcuExpected) {\\\\\\\\\\\\\\\\n    // reset interval stuff\\\\\\\\\\\\\\\\n    for (i = 0; i < componentsLength; i++) {\\\\\\\\\\\\\\\\n      components[i].pred = 0;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    eobrun = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (componentsLength === 1) {\\\\\\\\\\\\\\\\n      component = components[0];\\\\\\\\\\\\\\\\n      for (n = 0; n < usedResetInterval; n++) {\\\\\\\\\\\\\\\\n        decodeBlock(component, decodeFn, mcu);\\\\\\\\\\\\\\\\n        mcu++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      for (n = 0; n < usedResetInterval; n++) {\\\\\\\\\\\\\\\\n        for (i = 0; i < componentsLength; i++) {\\\\\\\\\\\\\\\\n          component = components[i];\\\\\\\\\\\\\\\\n          const { h, v } = component;\\\\\\\\\\\\\\\\n          for (j = 0; j < v; j++) {\\\\\\\\\\\\\\\\n            for (k = 0; k < h; k++) {\\\\\\\\\\\\\\\\n              decodeMcu(component, decodeFn, mcu, j, k);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        mcu++;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        // If we've reached our expected MCU's, stop decoding\\\\\\\\\\\\\\\\n        if (mcu === mcuExpected) {\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // find marker\\\\\\\\\\\\\\\\n    bitsCount = 0;\\\\\\\\\\\\\\\\n    marker = (data[offset] << 8) | data[offset + 1];\\\\\\\\\\\\\\\\n    if (marker < 0xFF00) {\\\\\\\\\\\\\\\\n      throw new Error('marker was not found');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (marker >= 0xFFD0 && marker <= 0xFFD7) { // RSTx\\\\\\\\\\\\\\\\n      offset += 2;\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      break;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return offset - startOffset;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction buildComponentData(frame, component) {\\\\\\\\\\\\\\\\n  const lines = [];\\\\\\\\\\\\\\\\n  const { blocksPerLine, blocksPerColumn } = component;\\\\\\\\\\\\\\\\n  const samplesPerLine = blocksPerLine << 3;\\\\\\\\\\\\\\\\n  const R = new Int32Array(64);\\\\\\\\\\\\\\\\n  const r = new Uint8Array(64);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // A port of poppler's IDCT method which in turn is taken from:\\\\\\\\\\\\\\\\n  //   Christoph Loeffler, Adriaan Ligtenberg, George S. Moschytz,\\\\\\\\\\\\\\\\n  //   \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Practical Fast 1-D DCT Algorithms with 11 Multiplications\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n  //   IEEE Intl. Conf. on Acoustics, Speech & Signal Processing, 1989,\\\\\\\\\\\\\\\\n  //   988-991.\\\\\\\\\\\\\\\\n  function quantizeAndInverse(zz, dataOut, dataIn) {\\\\\\\\\\\\\\\\n    const qt = component.quantizationTable;\\\\\\\\\\\\\\\\n    let v0;\\\\\\\\\\\\\\\\n    let v1;\\\\\\\\\\\\\\\\n    let v2;\\\\\\\\\\\\\\\\n    let v3;\\\\\\\\\\\\\\\\n    let v4;\\\\\\\\\\\\\\\\n    let v5;\\\\\\\\\\\\\\\\n    let v6;\\\\\\\\\\\\\\\\n    let v7;\\\\\\\\\\\\\\\\n    let t;\\\\\\\\\\\\\\\\n    const p = dataIn;\\\\\\\\\\\\\\\\n    let i;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // dequant\\\\\\\\\\\\\\\\n    for (i = 0; i < 64; i++) {\\\\\\\\\\\\\\\\n      p[i] = zz[i] * qt[i];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // inverse DCT on rows\\\\\\\\\\\\\\\\n    for (i = 0; i < 8; ++i) {\\\\\\\\\\\\\\\\n      const row = 8 * i;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // check for all-zero AC coefficients\\\\\\\\\\\\\\\\n      if (p[1 + row] === 0 && p[2 + row] === 0 && p[3 + row] === 0\\\\\\\\\\\\\\\\n        && p[4 + row] === 0 && p[5 + row] === 0 && p[6 + row] === 0\\\\\\\\\\\\\\\\n        && p[7 + row] === 0) {\\\\\\\\\\\\\\\\n        t = ((dctSqrt2 * p[0 + row]) + 512) >> 10;\\\\\\\\\\\\\\\\n        p[0 + row] = t;\\\\\\\\\\\\\\\\n        p[1 + row] = t;\\\\\\\\\\\\\\\\n        p[2 + row] = t;\\\\\\\\\\\\\\\\n        p[3 + row] = t;\\\\\\\\\\\\\\\\n        p[4 + row] = t;\\\\\\\\\\\\\\\\n        p[5 + row] = t;\\\\\\\\\\\\\\\\n        p[6 + row] = t;\\\\\\\\\\\\\\\\n        p[7 + row] = t;\\\\\\\\\\\\\\\\n        continue; // eslint-disable-line no-continue\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 4\\\\\\\\\\\\\\\\n      v0 = ((dctSqrt2 * p[0 + row]) + 128) >> 8;\\\\\\\\\\\\\\\\n      v1 = ((dctSqrt2 * p[4 + row]) + 128) >> 8;\\\\\\\\\\\\\\\\n      v2 = p[2 + row];\\\\\\\\\\\\\\\\n      v3 = p[6 + row];\\\\\\\\\\\\\\\\n      v4 = ((dctSqrt1d2 * (p[1 + row] - p[7 + row])) + 128) >> 8;\\\\\\\\\\\\\\\\n      v7 = ((dctSqrt1d2 * (p[1 + row] + p[7 + row])) + 128) >> 8;\\\\\\\\\\\\\\\\n      v5 = p[3 + row] << 4;\\\\\\\\\\\\\\\\n      v6 = p[5 + row] << 4;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 3\\\\\\\\\\\\\\\\n      t = (v0 - v1 + 1) >> 1;\\\\\\\\\\\\\\\\n      v0 = (v0 + v1 + 1) >> 1;\\\\\\\\\\\\\\\\n      v1 = t;\\\\\\\\\\\\\\\\n      t = ((v2 * dctSin6) + (v3 * dctCos6) + 128) >> 8;\\\\\\\\\\\\\\\\n      v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 128) >> 8;\\\\\\\\\\\\\\\\n      v3 = t;\\\\\\\\\\\\\\\\n      t = (v4 - v6 + 1) >> 1;\\\\\\\\\\\\\\\\n      v4 = (v4 + v6 + 1) >> 1;\\\\\\\\\\\\\\\\n      v6 = t;\\\\\\\\\\\\\\\\n      t = (v7 + v5 + 1) >> 1;\\\\\\\\\\\\\\\\n      v5 = (v7 - v5 + 1) >> 1;\\\\\\\\\\\\\\\\n      v7 = t;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 2\\\\\\\\\\\\\\\\n      t = (v0 - v3 + 1) >> 1;\\\\\\\\\\\\\\\\n      v0 = (v0 + v3 + 1) >> 1;\\\\\\\\\\\\\\\\n      v3 = t;\\\\\\\\\\\\\\\\n      t = (v1 - v2 + 1) >> 1;\\\\\\\\\\\\\\\\n      v1 = (v1 + v2 + 1) >> 1;\\\\\\\\\\\\\\\\n      v2 = t;\\\\\\\\\\\\\\\\n      t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v7 = t;\\\\\\\\\\\\\\\\n      t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v6 = t;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 1\\\\\\\\\\\\\\\\n      p[0 + row] = v0 + v7;\\\\\\\\\\\\\\\\n      p[7 + row] = v0 - v7;\\\\\\\\\\\\\\\\n      p[1 + row] = v1 + v6;\\\\\\\\\\\\\\\\n      p[6 + row] = v1 - v6;\\\\\\\\\\\\\\\\n      p[2 + row] = v2 + v5;\\\\\\\\\\\\\\\\n      p[5 + row] = v2 - v5;\\\\\\\\\\\\\\\\n      p[3 + row] = v3 + v4;\\\\\\\\\\\\\\\\n      p[4 + row] = v3 - v4;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // inverse DCT on columns\\\\\\\\\\\\\\\\n    for (i = 0; i < 8; ++i) {\\\\\\\\\\\\\\\\n      const col = i;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // check for all-zero AC coefficients\\\\\\\\\\\\\\\\n      if (p[(1 * 8) + col] === 0 && p[(2 * 8) + col] === 0 && p[(3 * 8) + col] === 0\\\\\\\\\\\\\\\\n        && p[(4 * 8) + col] === 0 && p[(5 * 8) + col] === 0 && p[(6 * 8) + col] === 0\\\\\\\\\\\\\\\\n        && p[(7 * 8) + col] === 0) {\\\\\\\\\\\\\\\\n        t = ((dctSqrt2 * dataIn[i + 0]) + 8192) >> 14;\\\\\\\\\\\\\\\\n        p[(0 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(1 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(2 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(3 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(4 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(5 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(6 * 8) + col] = t;\\\\\\\\\\\\\\\\n        p[(7 * 8) + col] = t;\\\\\\\\\\\\\\\\n        continue; // eslint-disable-line no-continue\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 4\\\\\\\\\\\\\\\\n      v0 = ((dctSqrt2 * p[(0 * 8) + col]) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v1 = ((dctSqrt2 * p[(4 * 8) + col]) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v2 = p[(2 * 8) + col];\\\\\\\\\\\\\\\\n      v3 = p[(6 * 8) + col];\\\\\\\\\\\\\\\\n      v4 = ((dctSqrt1d2 * (p[(1 * 8) + col] - p[(7 * 8) + col])) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v7 = ((dctSqrt1d2 * (p[(1 * 8) + col] + p[(7 * 8) + col])) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v5 = p[(3 * 8) + col];\\\\\\\\\\\\\\\\n      v6 = p[(5 * 8) + col];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 3\\\\\\\\\\\\\\\\n      t = (v0 - v1 + 1) >> 1;\\\\\\\\\\\\\\\\n      v0 = (v0 + v1 + 1) >> 1;\\\\\\\\\\\\\\\\n      v1 = t;\\\\\\\\\\\\\\\\n      t = ((v2 * dctSin6) + (v3 * dctCos6) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v2 = ((v2 * dctCos6) - (v3 * dctSin6) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v3 = t;\\\\\\\\\\\\\\\\n      t = (v4 - v6 + 1) >> 1;\\\\\\\\\\\\\\\\n      v4 = (v4 + v6 + 1) >> 1;\\\\\\\\\\\\\\\\n      v6 = t;\\\\\\\\\\\\\\\\n      t = (v7 + v5 + 1) >> 1;\\\\\\\\\\\\\\\\n      v5 = (v7 - v5 + 1) >> 1;\\\\\\\\\\\\\\\\n      v7 = t;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 2\\\\\\\\\\\\\\\\n      t = (v0 - v3 + 1) >> 1;\\\\\\\\\\\\\\\\n      v0 = (v0 + v3 + 1) >> 1;\\\\\\\\\\\\\\\\n      v3 = t;\\\\\\\\\\\\\\\\n      t = (v1 - v2 + 1) >> 1;\\\\\\\\\\\\\\\\n      v1 = (v1 + v2 + 1) >> 1;\\\\\\\\\\\\\\\\n      v2 = t;\\\\\\\\\\\\\\\\n      t = ((v4 * dctSin3) + (v7 * dctCos3) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v4 = ((v4 * dctCos3) - (v7 * dctSin3) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v7 = t;\\\\\\\\\\\\\\\\n      t = ((v5 * dctSin1) + (v6 * dctCos1) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v5 = ((v5 * dctCos1) - (v6 * dctSin1) + 2048) >> 12;\\\\\\\\\\\\\\\\n      v6 = t;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      // stage 1\\\\\\\\\\\\\\\\n      p[(0 * 8) + col] = v0 + v7;\\\\\\\\\\\\\\\\n      p[(7 * 8) + col] = v0 - v7;\\\\\\\\\\\\\\\\n      p[(1 * 8) + col] = v1 + v6;\\\\\\\\\\\\\\\\n      p[(6 * 8) + col] = v1 - v6;\\\\\\\\\\\\\\\\n      p[(2 * 8) + col] = v2 + v5;\\\\\\\\\\\\\\\\n      p[(5 * 8) + col] = v2 - v5;\\\\\\\\\\\\\\\\n      p[(3 * 8) + col] = v3 + v4;\\\\\\\\\\\\\\\\n      p[(4 * 8) + col] = v3 - v4;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // convert to 8-bit integers\\\\\\\\\\\\\\\\n    for (i = 0; i < 64; ++i) {\\\\\\\\\\\\\\\\n      const sample = 128 + ((p[i] + 8) >> 4);\\\\\\\\\\\\\\\\n      if (sample < 0) {\\\\\\\\\\\\\\\\n        dataOut[i] = 0;\\\\\\\\\\\\\\\\n      } else if (sample > 0XFF) {\\\\\\\\\\\\\\\\n        dataOut[i] = 0xFF;\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        dataOut[i] = sample;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (let blockRow = 0; blockRow < blocksPerColumn; blockRow++) {\\\\\\\\\\\\\\\\n    const scanLine = blockRow << 3;\\\\\\\\\\\\\\\\n    for (let i = 0; i < 8; i++) {\\\\\\\\\\\\\\\\n      lines.push(new Uint8Array(samplesPerLine));\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    for (let blockCol = 0; blockCol < blocksPerLine; blockCol++) {\\\\\\\\\\\\\\\\n      quantizeAndInverse(component.blocks[blockRow][blockCol], r, R);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      let offset = 0;\\\\\\\\\\\\\\\\n      const sample = blockCol << 3;\\\\\\\\\\\\\\\\n      for (let j = 0; j < 8; j++) {\\\\\\\\\\\\\\\\n        const line = lines[scanLine + j];\\\\\\\\\\\\\\\\n        for (let i = 0; i < 8; i++) {\\\\\\\\\\\\\\\\n          line[sample + i] = r[offset++];\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return lines;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass JpegStreamReader {\\\\\\\\\\\\\\\\n  constructor() {\\\\\\\\\\\\\\\\n    this.jfif = null;\\\\\\\\\\\\\\\\n    this.adobe = null;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    this.quantizationTables = [];\\\\\\\\\\\\\\\\n    this.huffmanTablesAC = [];\\\\\\\\\\\\\\\\n    this.huffmanTablesDC = [];\\\\\\\\\\\\\\\\n    this.resetFrames();\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  resetFrames() {\\\\\\\\\\\\\\\\n    this.frames = [];\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  parse(data) {\\\\\\\\\\\\\\\\n    let offset = 0;\\\\\\\\\\\\\\\\n    // const { length } = data;\\\\\\\\\\\\\\\\n    function readUint16() {\\\\\\\\\\\\\\\\n      const value = (data[offset] << 8) | data[offset + 1];\\\\\\\\\\\\\\\\n      offset += 2;\\\\\\\\\\\\\\\\n      return value;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    function readDataBlock() {\\\\\\\\\\\\\\\\n      const length = readUint16();\\\\\\\\\\\\\\\\n      const array = data.subarray(offset, offset + length - 2);\\\\\\\\\\\\\\\\n      offset += array.length;\\\\\\\\\\\\\\\\n      return array;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    function prepareComponents(frame) {\\\\\\\\\\\\\\\\n      let maxH = 0;\\\\\\\\\\\\\\\\n      let maxV = 0;\\\\\\\\\\\\\\\\n      let component;\\\\\\\\\\\\\\\\n      let componentId;\\\\\\\\\\\\\\\\n      for (componentId in frame.components) {\\\\\\\\\\\\\\\\n        if (frame.components.hasOwnProperty(componentId)) {\\\\\\\\\\\\\\\\n          component = frame.components[componentId];\\\\\\\\\\\\\\\\n          if (maxH < component.h) {\\\\\\\\\\\\\\\\n            maxH = component.h;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (maxV < component.v) {\\\\\\\\\\\\\\\\n            maxV = component.v;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      const mcusPerLine = Math.ceil(frame.samplesPerLine / 8 / maxH);\\\\\\\\\\\\\\\\n      const mcusPerColumn = Math.ceil(frame.scanLines / 8 / maxV);\\\\\\\\\\\\\\\\n      for (componentId in frame.components) {\\\\\\\\\\\\\\\\n        if (frame.components.hasOwnProperty(componentId)) {\\\\\\\\\\\\\\\\n          component = frame.components[componentId];\\\\\\\\\\\\\\\\n          const blocksPerLine = Math.ceil(Math.ceil(frame.samplesPerLine / 8) * component.h / maxH);\\\\\\\\\\\\\\\\n          const blocksPerColumn = Math.ceil(Math.ceil(frame.scanLines / 8) * component.v / maxV);\\\\\\\\\\\\\\\\n          const blocksPerLineForMcu = mcusPerLine * component.h;\\\\\\\\\\\\\\\\n          const blocksPerColumnForMcu = mcusPerColumn * component.v;\\\\\\\\\\\\\\\\n          const blocks = [];\\\\\\\\\\\\\\\\n          for (let i = 0; i < blocksPerColumnForMcu; i++) {\\\\\\\\\\\\\\\\n            const row = [];\\\\\\\\\\\\\\\\n            for (let j = 0; j < blocksPerLineForMcu; j++) {\\\\\\\\\\\\\\\\n              row.push(new Int32Array(64));\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            blocks.push(row);\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          component.blocksPerLine = blocksPerLine;\\\\\\\\\\\\\\\\n          component.blocksPerColumn = blocksPerColumn;\\\\\\\\\\\\\\\\n          component.blocks = blocks;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      frame.maxH = maxH;\\\\\\\\\\\\\\\\n      frame.maxV = maxV;\\\\\\\\\\\\\\\\n      frame.mcusPerLine = mcusPerLine;\\\\\\\\\\\\\\\\n      frame.mcusPerColumn = mcusPerColumn;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    let fileMarker = readUint16();\\\\\\\\\\\\\\\\n    if (fileMarker !== 0xFFD8) { // SOI (Start of Image)\\\\\\\\\\\\\\\\n      throw new Error('SOI not found');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    fileMarker = readUint16();\\\\\\\\\\\\\\\\n    while (fileMarker !== 0xFFD9) { // EOI (End of image)\\\\\\\\\\\\\\\\n      switch (fileMarker) {\\\\\\\\\\\\\\\\n        case 0xFF00: break;\\\\\\\\\\\\\\\\n        case 0xFFE0: // APP0 (Application Specific)\\\\\\\\\\\\\\\\n        case 0xFFE1: // APP1\\\\\\\\\\\\\\\\n        case 0xFFE2: // APP2\\\\\\\\\\\\\\\\n        case 0xFFE3: // APP3\\\\\\\\\\\\\\\\n        case 0xFFE4: // APP4\\\\\\\\\\\\\\\\n        case 0xFFE5: // APP5\\\\\\\\\\\\\\\\n        case 0xFFE6: // APP6\\\\\\\\\\\\\\\\n        case 0xFFE7: // APP7\\\\\\\\\\\\\\\\n        case 0xFFE8: // APP8\\\\\\\\\\\\\\\\n        case 0xFFE9: // APP9\\\\\\\\\\\\\\\\n        case 0xFFEA: // APP10\\\\\\\\\\\\\\\\n        case 0xFFEB: // APP11\\\\\\\\\\\\\\\\n        case 0xFFEC: // APP12\\\\\\\\\\\\\\\\n        case 0xFFED: // APP13\\\\\\\\\\\\\\\\n        case 0xFFEE: // APP14\\\\\\\\\\\\\\\\n        case 0xFFEF: // APP15\\\\\\\\\\\\\\\\n        case 0xFFFE: { // COM (Comment)\\\\\\\\\\\\\\\\n          const appData = readDataBlock();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if (fileMarker === 0xFFE0) {\\\\\\\\\\\\\\\\n            if (appData[0] === 0x4A && appData[1] === 0x46 && appData[2] === 0x49\\\\\\\\\\\\\\\\n              && appData[3] === 0x46 && appData[4] === 0) { // 'JFIF\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\x00'\\\\\\\\\\\\\\\\n              this.jfif = {\\\\\\\\\\\\\\\\n                version: { major: appData[5], minor: appData[6] },\\\\\\\\\\\\\\\\n                densityUnits: appData[7],\\\\\\\\\\\\\\\\n                xDensity: (appData[8] << 8) | appData[9],\\\\\\\\\\\\\\\\n                yDensity: (appData[10] << 8) | appData[11],\\\\\\\\\\\\\\\\n                thumbWidth: appData[12],\\\\\\\\\\\\\\\\n                thumbHeight: appData[13],\\\\\\\\\\\\\\\\n                thumbData: appData.subarray(14, 14 + (3 * appData[12] * appData[13])),\\\\\\\\\\\\\\\\n              };\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          // TODO APP1 - Exif\\\\\\\\\\\\\\\\n          if (fileMarker === 0xFFEE) {\\\\\\\\\\\\\\\\n            if (appData[0] === 0x41 && appData[1] === 0x64 && appData[2] === 0x6F\\\\\\\\\\\\\\\\n              && appData[3] === 0x62 && appData[4] === 0x65 && appData[5] === 0) { // 'Adobe\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\x00'\\\\\\\\\\\\\\\\n              this.adobe = {\\\\\\\\\\\\\\\\n                version: appData[6],\\\\\\\\\\\\\\\\n                flags0: (appData[7] << 8) | appData[8],\\\\\\\\\\\\\\\\n                flags1: (appData[9] << 8) | appData[10],\\\\\\\\\\\\\\\\n                transformCode: appData[11],\\\\\\\\\\\\\\\\n              };\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFDB: { // DQT (Define Quantization Tables)\\\\\\\\\\\\\\\\n          const quantizationTablesLength = readUint16();\\\\\\\\\\\\\\\\n          const quantizationTablesEnd = quantizationTablesLength + offset - 2;\\\\\\\\\\\\\\\\n          while (offset < quantizationTablesEnd) {\\\\\\\\\\\\\\\\n            const quantizationTableSpec = data[offset++];\\\\\\\\\\\\\\\\n            const tableData = new Int32Array(64);\\\\\\\\\\\\\\\\n            if ((quantizationTableSpec >> 4) === 0) { // 8 bit values\\\\\\\\\\\\\\\\n              for (let j = 0; j < 64; j++) {\\\\\\\\\\\\\\\\n                const z = dctZigZag[j];\\\\\\\\\\\\\\\\n                tableData[z] = data[offset++];\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n            } else if ((quantizationTableSpec >> 4) === 1) { // 16 bit\\\\\\\\\\\\\\\\n              for (let j = 0; j < 64; j++) {\\\\\\\\\\\\\\\\n                const z = dctZigZag[j];\\\\\\\\\\\\\\\\n                tableData[z] = readUint16();\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n            } else {\\\\\\\\\\\\\\\\n              throw new Error('DQT: invalid table spec');\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            this.quantizationTables[quantizationTableSpec & 15] = tableData;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFC0: // SOF0 (Start of Frame, Baseline DCT)\\\\\\\\\\\\\\\\n        case 0xFFC1: // SOF1 (Start of Frame, Extended DCT)\\\\\\\\\\\\\\\\n        case 0xFFC2: { // SOF2 (Start of Frame, Progressive DCT)\\\\\\\\\\\\\\\\n          readUint16(); // skip data length\\\\\\\\\\\\\\\\n          const frame = {\\\\\\\\\\\\\\\\n            extended: (fileMarker === 0xFFC1),\\\\\\\\\\\\\\\\n            progressive: (fileMarker === 0xFFC2),\\\\\\\\\\\\\\\\n            precision: data[offset++],\\\\\\\\\\\\\\\\n            scanLines: readUint16(),\\\\\\\\\\\\\\\\n            samplesPerLine: readUint16(),\\\\\\\\\\\\\\\\n            components: {},\\\\\\\\\\\\\\\\n            componentsOrder: [],\\\\\\\\\\\\\\\\n          };\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          const componentsCount = data[offset++];\\\\\\\\\\\\\\\\n          let componentId;\\\\\\\\\\\\\\\\n          // let maxH = 0;\\\\\\\\\\\\\\\\n          // let maxV = 0;\\\\\\\\\\\\\\\\n          for (let i = 0; i < componentsCount; i++) {\\\\\\\\\\\\\\\\n            componentId = data[offset];\\\\\\\\\\\\\\\\n            const h = data[offset + 1] >> 4;\\\\\\\\\\\\\\\\n            const v = data[offset + 1] & 15;\\\\\\\\\\\\\\\\n            const qId = data[offset + 2];\\\\\\\\\\\\\\\\n            frame.componentsOrder.push(componentId);\\\\\\\\\\\\\\\\n            frame.components[componentId] = {\\\\\\\\\\\\\\\\n              h,\\\\\\\\\\\\\\\\n              v,\\\\\\\\\\\\\\\\n              quantizationIdx: qId,\\\\\\\\\\\\\\\\n            };\\\\\\\\\\\\\\\\n            offset += 3;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          prepareComponents(frame);\\\\\\\\\\\\\\\\n          this.frames.push(frame);\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFC4: { // DHT (Define Huffman Tables)\\\\\\\\\\\\\\\\n          const huffmanLength = readUint16();\\\\\\\\\\\\\\\\n          for (let i = 2; i < huffmanLength;) {\\\\\\\\\\\\\\\\n            const huffmanTableSpec = data[offset++];\\\\\\\\\\\\\\\\n            const codeLengths = new Uint8Array(16);\\\\\\\\\\\\\\\\n            let codeLengthSum = 0;\\\\\\\\\\\\\\\\n            for (let j = 0; j < 16; j++, offset++) {\\\\\\\\\\\\\\\\n              codeLengths[j] = data[offset];\\\\\\\\\\\\\\\\n              codeLengthSum += codeLengths[j];\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            const huffmanValues = new Uint8Array(codeLengthSum);\\\\\\\\\\\\\\\\n            for (let j = 0; j < codeLengthSum; j++, offset++) {\\\\\\\\\\\\\\\\n              huffmanValues[j] = data[offset];\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            i += 17 + codeLengthSum;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n            if ((huffmanTableSpec >> 4) === 0) {\\\\\\\\\\\\\\\\n              this.huffmanTablesDC[huffmanTableSpec & 15] = buildHuffmanTable(\\\\\\\\\\\\\\\\n                codeLengths, huffmanValues,\\\\\\\\\\\\\\\\n              );\\\\\\\\\\\\\\\\n            } else {\\\\\\\\\\\\\\\\n              this.huffmanTablesAC[huffmanTableSpec & 15] = buildHuffmanTable(\\\\\\\\\\\\\\\\n                codeLengths, huffmanValues,\\\\\\\\\\\\\\\\n              );\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFDD: // DRI (Define Restart Interval)\\\\\\\\\\\\\\\\n          readUint16(); // skip data length\\\\\\\\\\\\\\\\n          this.resetInterval = readUint16();\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFDA: { // SOS (Start of Scan)\\\\\\\\\\\\\\\\n          readUint16(); // skip length\\\\\\\\\\\\\\\\n          const selectorsCount = data[offset++];\\\\\\\\\\\\\\\\n          const components = [];\\\\\\\\\\\\\\\\n          const frame = this.frames[0];\\\\\\\\\\\\\\\\n          for (let i = 0; i < selectorsCount; i++) {\\\\\\\\\\\\\\\\n            const component = frame.components[data[offset++]];\\\\\\\\\\\\\\\\n            const tableSpec = data[offset++];\\\\\\\\\\\\\\\\n            component.huffmanTableDC = this.huffmanTablesDC[tableSpec >> 4];\\\\\\\\\\\\\\\\n            component.huffmanTableAC = this.huffmanTablesAC[tableSpec & 15];\\\\\\\\\\\\\\\\n            components.push(component);\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          const spectralStart = data[offset++];\\\\\\\\\\\\\\\\n          const spectralEnd = data[offset++];\\\\\\\\\\\\\\\\n          const successiveApproximation = data[offset++];\\\\\\\\\\\\\\\\n          const processed = decodeScan(data, offset,\\\\\\\\\\\\\\\\n            frame, components, this.resetInterval,\\\\\\\\\\\\\\\\n            spectralStart, spectralEnd,\\\\\\\\\\\\\\\\n            successiveApproximation >> 4, successiveApproximation & 15);\\\\\\\\\\\\\\\\n          offset += processed;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        case 0xFFFF: // Fill bytes\\\\\\\\\\\\\\\\n          if (data[offset] !== 0xFF) { // Avoid skipping a valid marker.\\\\\\\\\\\\\\\\n            offset--;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        default:\\\\\\\\\\\\\\\\n          if (data[offset - 3] === 0xFF\\\\\\\\\\\\\\\\n            && data[offset - 2] >= 0xC0 && data[offset - 2] <= 0xFE) {\\\\\\\\\\\\\\\\n            // could be incorrect encoding -- last 0xFF byte of the previous\\\\\\\\\\\\\\\\n            // block was eaten by the encoder\\\\\\\\\\\\\\\\n            offset -= 3;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          throw new Error(`unknown JPEG marker ${fileMarker.toString(16)}`);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      fileMarker = readUint16();\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  getResult() {\\\\\\\\\\\\\\\\n    const { frames } = this;\\\\\\\\\\\\\\\\n    if (this.frames.length === 0) {\\\\\\\\\\\\\\\\n      throw new Error('no frames were decoded');\\\\\\\\\\\\\\\\n    } else if (this.frames.length > 1) {\\\\\\\\\\\\\\\\n      console.warn('more than one frame is not supported');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // set each frame's components quantization table\\\\\\\\\\\\\\\\n    for (let i = 0; i < this.frames.length; i++) {\\\\\\\\\\\\\\\\n      const cp = this.frames[i].components;\\\\\\\\\\\\\\\\n      for (const j of Object.keys(cp)) {\\\\\\\\\\\\\\\\n        cp[j].quantizationTable = this.quantizationTables[cp[j].quantizationIdx];\\\\\\\\\\\\\\\\n        delete cp[j].quantizationIdx;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    const frame = frames[0];\\\\\\\\\\\\\\\\n    const { components, componentsOrder } = frame;\\\\\\\\\\\\\\\\n    const outComponents = [];\\\\\\\\\\\\\\\\n    const width = frame.samplesPerLine;\\\\\\\\\\\\\\\\n    const height = frame.scanLines;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    for (let i = 0; i < componentsOrder.length; i++) {\\\\\\\\\\\\\\\\n      const component = components[componentsOrder[i]];\\\\\\\\\\\\\\\\n      outComponents.push({\\\\\\\\\\\\\\\\n        lines: buildComponentData(frame, component),\\\\\\\\\\\\\\\\n        scaleX: component.h / frame.maxH,\\\\\\\\\\\\\\\\n        scaleY: component.v / frame.maxV,\\\\\\\\\\\\\\\\n      });\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    const out = new Uint8Array(width * height * outComponents.length);\\\\\\\\\\\\\\\\n    let oi = 0;\\\\\\\\\\\\\\\\n    for (let y = 0; y < height; ++y) {\\\\\\\\\\\\\\\\n      for (let x = 0; x < width; ++x) {\\\\\\\\\\\\\\\\n        for (let i = 0; i < outComponents.length; ++i) {\\\\\\\\\\\\\\\\n          const component = outComponents[i];\\\\\\\\\\\\\\\\n          out[oi] = component.lines[0 | y * component.scaleY][0 | x * component.scaleX];\\\\\\\\\\\\\\\\n          ++oi;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return out;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass JpegDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] {\\\\\\\\\\\\\\\\n  constructor(fileDirectory) {\\\\\\\\\\\\\\\\n    super();\\\\\\\\\\\\\\\\n    this.reader = new JpegStreamReader();\\\\\\\\\\\\\\\\n    if (fileDirectory.JPEGTables) {\\\\\\\\\\\\\\\\n      this.reader.parse(fileDirectory.JPEGTables);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  decodeBlock(buffer) {\\\\\\\\\\\\\\\\n    this.reader.resetFrames();\\\\\\\\\\\\\\\\n    this.reader.parse(new Uint8Array(buffer));\\\\\\\\\\\\\\\\n    return this.reader.getResult().buffer;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/jpeg.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/lzw.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/lzw.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return LZWDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nconst MIN_BITS = 9;\\\\\\\\\\\\\\\\nconst CLEAR_CODE = 256; // clear code\\\\\\\\\\\\\\\\nconst EOI_CODE = 257; // end of information\\\\\\\\\\\\\\\\nconst MAX_BYTELENGTH = 12;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction getByte(array, position, length) {\\\\\\\\\\\\\\\\n  const d = position % 8;\\\\\\\\\\\\\\\\n  const a = Math.floor(position / 8);\\\\\\\\\\\\\\\\n  const de = 8 - d;\\\\\\\\\\\\\\\\n  const ef = (position + length) - ((a + 1) * 8);\\\\\\\\\\\\\\\\n  let fg = (8 * (a + 2)) - (position + length);\\\\\\\\\\\\\\\\n  const dg = ((a + 2) * 8) - position;\\\\\\\\\\\\\\\\n  fg = Math.max(0, fg);\\\\\\\\\\\\\\\\n  if (a >= array.length) {\\\\\\\\\\\\\\\\n    console.warn('ran off the end of the buffer before finding EOI_CODE (end on input code)');\\\\\\\\\\\\\\\\n    return EOI_CODE;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  let chunk1 = array[a] & ((2 ** (8 - d)) - 1);\\\\\\\\\\\\\\\\n  chunk1 <<= (length - de);\\\\\\\\\\\\\\\\n  let chunks = chunk1;\\\\\\\\\\\\\\\\n  if (a + 1 < array.length) {\\\\\\\\\\\\\\\\n    let chunk2 = array[a + 1] >>> fg;\\\\\\\\\\\\\\\\n    chunk2 <<= Math.max(0, (length - dg));\\\\\\\\\\\\\\\\n    chunks += chunk2;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (ef > 8 && a + 2 < array.length) {\\\\\\\\\\\\\\\\n    const hi = ((a + 3) * 8) - (position + length);\\\\\\\\\\\\\\\\n    const chunk3 = array[a + 2] >>> hi;\\\\\\\\\\\\\\\\n    chunks += chunk3;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return chunks;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction appendReversed(dest, source) {\\\\\\\\\\\\\\\\n  for (let i = source.length - 1; i >= 0; i--) {\\\\\\\\\\\\\\\\n    dest.push(source[i]);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return dest;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction decompress(input) {\\\\\\\\\\\\\\\\n  const dictionaryIndex = new Uint16Array(4093);\\\\\\\\\\\\\\\\n  const dictionaryChar = new Uint8Array(4093);\\\\\\\\\\\\\\\\n  for (let i = 0; i <= 257; i++) {\\\\\\\\\\\\\\\\n    dictionaryIndex[i] = 4096;\\\\\\\\\\\\\\\\n    dictionaryChar[i] = i;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  let dictionaryLength = 258;\\\\\\\\\\\\\\\\n  let byteLength = MIN_BITS;\\\\\\\\\\\\\\\\n  let position = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  function initDictionary() {\\\\\\\\\\\\\\\\n    dictionaryLength = 258;\\\\\\\\\\\\\\\\n    byteLength = MIN_BITS;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function getNext(array) {\\\\\\\\\\\\\\\\n    const byte = getByte(array, position, byteLength);\\\\\\\\\\\\\\\\n    position += byteLength;\\\\\\\\\\\\\\\\n    return byte;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function addToDictionary(i, c) {\\\\\\\\\\\\\\\\n    dictionaryChar[dictionaryLength] = c;\\\\\\\\\\\\\\\\n    dictionaryIndex[dictionaryLength] = i;\\\\\\\\\\\\\\\\n    dictionaryLength++;\\\\\\\\\\\\\\\\n    return dictionaryLength - 1;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  function getDictionaryReversed(n) {\\\\\\\\\\\\\\\\n    const rev = [];\\\\\\\\\\\\\\\\n    for (let i = n; i !== 4096; i = dictionaryIndex[i]) {\\\\\\\\\\\\\\\\n      rev.push(dictionaryChar[i]);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return rev;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const result = [];\\\\\\\\\\\\\\\\n  initDictionary();\\\\\\\\\\\\\\\\n  const array = new Uint8Array(input);\\\\\\\\\\\\\\\\n  let code = getNext(array);\\\\\\\\\\\\\\\\n  let oldCode;\\\\\\\\\\\\\\\\n  while (code !== EOI_CODE) {\\\\\\\\\\\\\\\\n    if (code === CLEAR_CODE) {\\\\\\\\\\\\\\\\n      initDictionary();\\\\\\\\\\\\\\\\n      code = getNext(array);\\\\\\\\\\\\\\\\n      while (code === CLEAR_CODE) {\\\\\\\\\\\\\\\\n        code = getNext(array);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      if (code === EOI_CODE) {\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      } else if (code > CLEAR_CODE) {\\\\\\\\\\\\\\\\n        throw new Error(`corrupted code at scanline ${code}`);\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        const val = getDictionaryReversed(code);\\\\\\\\\\\\\\\\n        appendReversed(result, val);\\\\\\\\\\\\\\\\n        oldCode = code;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    } else if (code < dictionaryLength) {\\\\\\\\\\\\\\\\n      const val = getDictionaryReversed(code);\\\\\\\\\\\\\\\\n      appendReversed(result, val);\\\\\\\\\\\\\\\\n      addToDictionary(oldCode, val[val.length - 1]);\\\\\\\\\\\\\\\\n      oldCode = code;\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      const oldVal = getDictionaryReversed(oldCode);\\\\\\\\\\\\\\\\n      if (!oldVal) {\\\\\\\\\\\\\\\\n        throw new Error(`Bogus entry. Not in dictionary, ${oldCode} / ${dictionaryLength}, position: ${position}`);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      appendReversed(result, oldVal);\\\\\\\\\\\\\\\\n      result.push(oldVal[oldVal.length - 1]);\\\\\\\\\\\\\\\\n      addToDictionary(oldCode, oldVal[oldVal.length - 1]);\\\\\\\\\\\\\\\\n      oldCode = code;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (dictionaryLength + 1 >= (2 ** byteLength)) {\\\\\\\\\\\\\\\\n      if (byteLength === MAX_BYTELENGTH) {\\\\\\\\\\\\\\\\n        oldCode = undefined;\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        byteLength++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    code = getNext(array);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return new Uint8Array(result);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass LZWDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] {\\\\\\\\\\\\\\\\n  decodeBlock(buffer) {\\\\\\\\\\\\\\\\n    return decompress(buffer, false).buffer;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/lzw.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/packbits.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!**********************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/packbits.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\**********************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return PackbitsDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass PackbitsDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] {\\\\\\\\\\\\\\\\n  decodeBlock(buffer) {\\\\\\\\\\\\\\\\n    const dataView = new DataView(buffer);\\\\\\\\\\\\\\\\n    const out = [];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    for (let i = 0; i < buffer.byteLength; ++i) {\\\\\\\\\\\\\\\\n      let header = dataView.getInt8(i);\\\\\\\\\\\\\\\\n      if (header < 0) {\\\\\\\\\\\\\\\\n        const next = dataView.getUint8(i + 1);\\\\\\\\\\\\\\\\n        header = -header;\\\\\\\\\\\\\\\\n        for (let j = 0; j <= header; ++j) {\\\\\\\\\\\\\\\\n          out.push(next);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        i += 1;\\\\\\\\\\\\\\\\n      } else {\\\\\\\\\\\\\\\\n        for (let j = 0; j <= header; ++j) {\\\\\\\\\\\\\\\\n          out.push(dataView.getUint8(i + j + 1));\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        i += header + 1;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return new Uint8Array(out).buffer;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/packbits.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/raw.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/compression/raw.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************************/\\\\\\\\n/*! exports provided: default */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return RawDecoder; });\\\\\\\\\\\\\\\\n/* harmony import */ var _basedecoder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./basedecoder */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/basedecoder.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nclass RawDecoder extends _basedecoder__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] {\\\\\\\\\\\\\\\\n  decodeBlock(buffer) {\\\\\\\\\\\\\\\\n    return buffer;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/compression/raw.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/decoder.worker.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!****************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/decoder.worker.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\****************************************************/\\\\\\\\n/*! no exports provided */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony import */ var threads_worker__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! threads/worker */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/worker.mjs\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n/* harmony import */ var _compression__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./compression */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/geotiff/src/compression/index.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction decode(fileDirectory, buffer) {\\\\\\\\\\\\\\\\n  const decoder = Object(_compression__WEBPACK_IMPORTED_MODULE_1__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"getDecoder\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"])(fileDirectory);\\\\\\\\\\\\\\\\n  return decoder.decode(fileDirectory, buffer);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nObject(threads_worker__WEBPACK_IMPORTED_MODULE_0__[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"expose\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"])(decode);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/decoder.worker.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/geotiff/src/predictor.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/geotiff/src/predictor.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! exports provided: applyPredictor */\\\\\\\\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"applyPredictor\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return applyPredictor; });\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction decodeRowAcc(row, stride) {\\\\\\\\\\\\\\\\n  let length = row.length - stride;\\\\\\\\\\\\\\\\n  let offset = 0;\\\\\\\\\\\\\\\\n  do {\\\\\\\\\\\\\\\\n    for (let i = stride; i > 0; i--) {\\\\\\\\\\\\\\\\n      row[offset + stride] += row[offset];\\\\\\\\\\\\\\\\n      offset++;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    length -= stride;\\\\\\\\\\\\\\\\n  } while (length > 0);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction decodeRowFloatingPoint(row, stride, bytesPerSample) {\\\\\\\\\\\\\\\\n  let index = 0;\\\\\\\\\\\\\\\\n  let count = row.length;\\\\\\\\\\\\\\\\n  const wc = count / bytesPerSample;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  while (count > stride) {\\\\\\\\\\\\\\\\n    for (let i = stride; i > 0; --i) {\\\\\\\\\\\\\\\\n      row[index + stride] += row[index];\\\\\\\\\\\\\\\\n      ++index;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    count -= stride;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const copy = row.slice();\\\\\\\\\\\\\\\\n  for (let i = 0; i < wc; ++i) {\\\\\\\\\\\\\\\\n    for (let b = 0; b < bytesPerSample; ++b) {\\\\\\\\\\\\\\\\n      row[(bytesPerSample * i) + b] = copy[((bytesPerSample - b - 1) * wc) + i];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction applyPredictor(block, predictor, width, height, bitsPerSample,\\\\\\\\\\\\\\\\n  planarConfiguration) {\\\\\\\\\\\\\\\\n  if (!predictor || predictor === 1) {\\\\\\\\\\\\\\\\n    return block;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (let i = 0; i < bitsPerSample.length; ++i) {\\\\\\\\\\\\\\\\n    if (bitsPerSample[i] % 8 !== 0) {\\\\\\\\\\\\\\\\n      throw new Error('When decoding with predictor, only multiple of 8 bits are supported.');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (bitsPerSample[i] !== bitsPerSample[0]) {\\\\\\\\\\\\\\\\n      throw new Error('When decoding with predictor, all samples must have the same size.');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  const bytesPerSample = bitsPerSample[0] / 8;\\\\\\\\\\\\\\\\n  const stride = planarConfiguration === 2 ? 1 : bitsPerSample.length;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (let i = 0; i < height; ++i) {\\\\\\\\\\\\\\\\n    // Last strip will be truncated if height % stripHeight != 0\\\\\\\\\\\\\\\\n    if (i * stride * width * bytesPerSample >= block.byteLength) {\\\\\\\\\\\\\\\\n      break;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    let row;\\\\\\\\\\\\\\\\n    if (predictor === 2) { // horizontal prediction\\\\\\\\\\\\\\\\n      switch (bitsPerSample[0]) {\\\\\\\\\\\\\\\\n        case 8:\\\\\\\\\\\\\\\\n          row = new Uint8Array(\\\\\\\\\\\\\\\\n            block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\\\\\\\\\\\\\\\\n          );\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        case 16:\\\\\\\\\\\\\\\\n          row = new Uint16Array(\\\\\\\\\\\\\\\\n            block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 2,\\\\\\\\\\\\\\\\n          );\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        case 32:\\\\\\\\\\\\\\\\n          row = new Uint32Array(\\\\\\\\\\\\\\\\n            block, i * stride * width * bytesPerSample, stride * width * bytesPerSample / 4,\\\\\\\\\\\\\\\\n          );\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        default:\\\\\\\\\\\\\\\\n          throw new Error(`Predictor 2 not allowed with ${bitsPerSample[0]} bits per sample.`);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      decodeRowAcc(row, stride, bytesPerSample);\\\\\\\\\\\\\\\\n    } else if (predictor === 3) { // horizontal floating point\\\\\\\\\\\\\\\\n      row = new Uint8Array(\\\\\\\\\\\\\\\\n        block, i * stride * width * bytesPerSample, stride * width * bytesPerSample,\\\\\\\\\\\\\\\\n      );\\\\\\\\\\\\\\\\n      decodeRowFloatingPoint(row, stride, bytesPerSample);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return block;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/predictor.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/is-observable/index.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/is-observable/index.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = value => {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\tif (!value) {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\treturn false;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t// eslint-disable-next-line no-use-extend-native/no-use-extend-native\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\tif (typeof Symbol.observable === 'symbol' && typeof value[Symbol.observable] === 'function') {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\t// eslint-disable-next-line no-use-extend-native/no-use-extend-native\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\treturn value === value[Symbol.observable]();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\tif (typeof value['@@observable'] === 'function') {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\treturn value === value['@@observable']();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\treturn false;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/is-observable/index.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/inflate.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!******************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/inflate.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\******************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar zlib_inflate = __webpack_require__(/*! ./zlib/inflate */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inflate.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar utils        = __webpack_require__(/*! ./utils/common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar strings      = __webpack_require__(/*! ./utils/strings */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/strings.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar c            = __webpack_require__(/*! ./zlib/constants */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/constants.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar msg          = __webpack_require__(/*! ./zlib/messages */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/messages.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar ZStream      = __webpack_require__(/*! ./zlib/zstream */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/zstream.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar GZheader     = __webpack_require__(/*! ./zlib/gzheader */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/gzheader.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar toString = Object.prototype.toString;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * class Inflate\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Generic JS-style wrapper for zlib calls. If you don't need\\\\\\\\\\\\\\\\n * streaming behaviour - use more simple functions: [[inflate]]\\\\\\\\\\\\\\\\n * and [[inflateRaw]].\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* internal\\\\\\\\\\\\\\\\n * inflate.chunks -> Array\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Chunks of output data, if [[Inflate#onData]] not overridden.\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate.result -> Uint8Array|Array|String\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Uncompressed result, generated by default [[Inflate#onData]]\\\\\\\\\\\\\\\\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\\\\\\\\\\\\\\\\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\\\\\\\\\\\\\\\\n * push a chunk with explicit flush (call [[Inflate#push]] with\\\\\\\\\\\\\\\\n * `Z_SYNC_FLUSH` param).\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate.err -> Number\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Error code after inflate finished. 0 (Z_OK) on success.\\\\\\\\\\\\\\\\n * Should be checked if broken data possible.\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate.msg -> String\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Error message, if [[Inflate.err]] != 0\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * new Inflate(options)\\\\\\\\\\\\\\\\n * - options (Object): zlib inflate options.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Creates new inflator instance with specified params. Throws exception\\\\\\\\\\\\\\\\n * on bad params. Supported options:\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * - `windowBits`\\\\\\\\\\\\\\\\n * - `dictionary`\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\\\\\\\\\\\\\\\\n * for more information on these.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Additional options, for internal needs:\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * - `chunkSize` - size of generated data chunks (16K by default)\\\\\\\\\\\\\\\\n * - `raw` (Boolean) - do raw inflate\\\\\\\\\\\\\\\\n * - `to` (String) - if equal to 'string', then result will be converted\\\\\\\\\\\\\\\\n *   from utf8 to utf16 (javascript) string. When string output requested,\\\\\\\\\\\\\\\\n *   chunk length can differ from `chunkSize`, depending on content.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * By default, when no options set, autodetect deflate/gzip data format via\\\\\\\\\\\\\\\\n * wrapper header.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ##### Example:\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ```javascript\\\\\\\\\\\\\\\\n * var pako = require('pako')\\\\\\\\\\\\\\\\n *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\\\\\\\\\\\\\\\\n *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * var inflate = new pako.Inflate({ level: 3});\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * inflate.push(chunk1, false);\\\\\\\\\\\\\\\\n * inflate.push(chunk2, true);  // true -> last chunk\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * if (inflate.err) { throw new Error(inflate.err); }\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * console.log(inflate.result);\\\\\\\\\\\\\\\\n * ```\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nfunction Inflate(options) {\\\\\\\\\\\\\\\\n  if (!(this instanceof Inflate)) return new Inflate(options);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  this.options = utils.assign({\\\\\\\\\\\\\\\\n    chunkSize: 16384,\\\\\\\\\\\\\\\\n    windowBits: 0,\\\\\\\\\\\\\\\\n    to: ''\\\\\\\\\\\\\\\\n  }, options || {});\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var opt = this.options;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Force window size for `raw` data, if not set directly,\\\\\\\\\\\\\\\\n  // because we have no header for autodetect.\\\\\\\\\\\\\\\\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\\\\\\\\\\\\\\\\n    opt.windowBits = -opt.windowBits;\\\\\\\\\\\\\\\\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\\\\\\\\\\\\\\\\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\\\\\\\\\\\\\\\\n      !(options && options.windowBits)) {\\\\\\\\\\\\\\\\n    opt.windowBits += 32;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Gzip header has no info about windows size, we can do autodetect only\\\\\\\\\\\\\\\\n  // for deflate. So, if window size not set, force it to max when gzip possible\\\\\\\\\\\\\\\\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\\\\\\\\\\\\\\\\n    // bit 3 (16) -> gzipped data\\\\\\\\\\\\\\\\n    // bit 4 (32) -> autodetect gzip/deflate\\\\\\\\\\\\\\\\n    if ((opt.windowBits & 15) === 0) {\\\\\\\\\\\\\\\\n      opt.windowBits |= 15;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\\\\\\\\\\\\\\\\n  this.msg    = '';     // error message\\\\\\\\\\\\\\\\n  this.ended  = false;  // used to avoid multiple onEnd() calls\\\\\\\\\\\\\\\\n  this.chunks = [];     // chunks of compressed data\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  this.strm   = new ZStream();\\\\\\\\\\\\\\\\n  this.strm.avail_out = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var status  = zlib_inflate.inflateInit2(\\\\\\\\\\\\\\\\n    this.strm,\\\\\\\\\\\\\\\\n    opt.windowBits\\\\\\\\\\\\\\\\n  );\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (status !== c.Z_OK) {\\\\\\\\\\\\\\\\n    throw new Error(msg[status]);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  this.header = new GZheader();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  zlib_inflate.inflateGetHeader(this.strm, this.header);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Setup dictionary\\\\\\\\\\\\\\\\n  if (opt.dictionary) {\\\\\\\\\\\\\\\\n    // Convert data if needed\\\\\\\\\\\\\\\\n    if (typeof opt.dictionary === 'string') {\\\\\\\\\\\\\\\\n      opt.dictionary = strings.string2buf(opt.dictionary);\\\\\\\\\\\\\\\\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\\\\\\\\\\\\\\\\n      opt.dictionary = new Uint8Array(opt.dictionary);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (opt.raw) { //In raw mode we need to set the dictionary early\\\\\\\\\\\\\\\\n      status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\\\\\\\\\\\\\\\\n      if (status !== c.Z_OK) {\\\\\\\\\\\\\\\\n        throw new Error(msg[status]);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate#push(data[, mode]) -> Boolean\\\\\\\\\\\\\\\\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\\\\\\\\\\\\\\\\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\\\\\\\\\\\\\\\\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\\\\\\\\\\\\\\\\n * new output chunks. Returns `true` on success. The last data block must have\\\\\\\\\\\\\\\\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\\\\\\\\\\\\\\\\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\\\\\\\\\\\\\\\\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * On fail call [[Inflate#onEnd]] with error code and return false.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * We strongly recommend to use `Uint8Array` on input for best speed (output\\\\\\\\\\\\\\\\n * format is detected automatically). Also, don't skip last param and always\\\\\\\\\\\\\\\\n * use the same type in your code (boolean or number). That will improve JS speed.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * For regular `Array`-s make sure all elements are [0..255].\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ##### Example\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ```javascript\\\\\\\\\\\\\\\\n * push(chunk, false); // push one of data chunks\\\\\\\\\\\\\\\\n * ...\\\\\\\\\\\\\\\\n * push(chunk, true);  // push last chunk\\\\\\\\\\\\\\\\n * ```\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nInflate.prototype.push = function (data, mode) {\\\\\\\\\\\\\\\\n  var strm = this.strm;\\\\\\\\\\\\\\\\n  var chunkSize = this.options.chunkSize;\\\\\\\\\\\\\\\\n  var dictionary = this.options.dictionary;\\\\\\\\\\\\\\\\n  var status, _mode;\\\\\\\\\\\\\\\\n  var next_out_utf8, tail, utf8str;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Flag to properly process Z_BUF_ERROR on testing inflate call\\\\\\\\\\\\\\\\n  // when we check that all output data was flushed.\\\\\\\\\\\\\\\\n  var allowBufError = false;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (this.ended) { return false; }\\\\\\\\\\\\\\\\n  _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Convert data if needed\\\\\\\\\\\\\\\\n  if (typeof data === 'string') {\\\\\\\\\\\\\\\\n    // Only binary strings can be decompressed on practice\\\\\\\\\\\\\\\\n    strm.input = strings.binstring2buf(data);\\\\\\\\\\\\\\\\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\\\\\\\\\\\\\\\\n    strm.input = new Uint8Array(data);\\\\\\\\\\\\\\\\n  } else {\\\\\\\\\\\\\\\\n    strm.input = data;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  strm.next_in = 0;\\\\\\\\\\\\\\\\n  strm.avail_in = strm.input.length;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  do {\\\\\\\\\\\\\\\\n    if (strm.avail_out === 0) {\\\\\\\\\\\\\\\\n      strm.output = new utils.Buf8(chunkSize);\\\\\\\\\\\\\\\\n      strm.next_out = 0;\\\\\\\\\\\\\\\\n      strm.avail_out = chunkSize;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);    /* no bad return value */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (status === c.Z_NEED_DICT && dictionary) {\\\\\\\\\\\\\\\\n      status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (status === c.Z_BUF_ERROR && allowBufError === true) {\\\\\\\\\\\\\\\\n      status = c.Z_OK;\\\\\\\\\\\\\\\\n      allowBufError = false;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\\\\\\\\\\\\\\\\n      this.onEnd(status);\\\\\\\\\\\\\\\\n      this.ended = true;\\\\\\\\\\\\\\\\n      return false;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (strm.next_out) {\\\\\\\\\\\\\\\\n      if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        if (this.options.to === 'string') {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          tail = strm.next_out - next_out_utf8;\\\\\\\\\\\\\\\\n          utf8str = strings.buf2string(strm.output, next_out_utf8);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          // move tail\\\\\\\\\\\\\\\\n          strm.next_out = tail;\\\\\\\\\\\\\\\\n          strm.avail_out = chunkSize - tail;\\\\\\\\\\\\\\\\n          if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          this.onData(utf8str);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        } else {\\\\\\\\\\\\\\\\n          this.onData(utils.shrinkBuf(strm.output, strm.next_out));\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // When no more input data, we should check that internal inflate buffers\\\\\\\\\\\\\\\\n    // are flushed. The only way to do it when avail_out = 0 - run one more\\\\\\\\\\\\\\\\n    // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\\\\\\\\\\\\\\\\n    // Here we set flag to process this error properly.\\\\\\\\\\\\\\\\n    //\\\\\\\\\\\\\\\\n    // NOTE. Deflate does not return error in this case and does not needs such\\\\\\\\\\\\\\\\n    // logic.\\\\\\\\\\\\\\\\n    if (strm.avail_in === 0 && strm.avail_out === 0) {\\\\\\\\\\\\\\\\n      allowBufError = true;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (status === c.Z_STREAM_END) {\\\\\\\\\\\\\\\\n    _mode = c.Z_FINISH;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Finalize on the last chunk.\\\\\\\\\\\\\\\\n  if (_mode === c.Z_FINISH) {\\\\\\\\\\\\\\\\n    status = zlib_inflate.inflateEnd(this.strm);\\\\\\\\\\\\\\\\n    this.onEnd(status);\\\\\\\\\\\\\\\\n    this.ended = true;\\\\\\\\\\\\\\\\n    return status === c.Z_OK;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // callback interim results if Z_SYNC_FLUSH.\\\\\\\\\\\\\\\\n  if (_mode === c.Z_SYNC_FLUSH) {\\\\\\\\\\\\\\\\n    this.onEnd(c.Z_OK);\\\\\\\\\\\\\\\\n    strm.avail_out = 0;\\\\\\\\\\\\\\\\n    return true;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return true;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate#onData(chunk) -> Void\\\\\\\\\\\\\\\\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\\\\\\\\\\\\\\\\n *   on js engine support. When string output requested, each chunk\\\\\\\\\\\\\\\\n *   will be string.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * By default, stores data blocks in `chunks[]` property and glue\\\\\\\\\\\\\\\\n * those in `onEnd`. Override this handler, if you need another behaviour.\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nInflate.prototype.onData = function (chunk) {\\\\\\\\\\\\\\\\n  this.chunks.push(chunk);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Inflate#onEnd(status) -> Void\\\\\\\\\\\\\\\\n * - status (Number): inflate status. 0 (Z_OK) on success,\\\\\\\\\\\\\\\\n *   other if not.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Called either after you tell inflate that the input stream is\\\\\\\\\\\\\\\\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\\\\\\\\\\\\\\\\n * or if an error happened. By default - join collected chunks,\\\\\\\\\\\\\\\\n * free memory and fill `results` / `err` properties.\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nInflate.prototype.onEnd = function (status) {\\\\\\\\\\\\\\\\n  // On success - join\\\\\\\\\\\\\\\\n  if (status === c.Z_OK) {\\\\\\\\\\\\\\\\n    if (this.options.to === 'string') {\\\\\\\\\\\\\\\\n      // Glue & convert here, until we teach pako to send\\\\\\\\\\\\\\\\n      // utf8 aligned strings to onData\\\\\\\\\\\\\\\\n      this.result = this.chunks.join('');\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      this.result = utils.flattenChunks(this.chunks);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  this.chunks = [];\\\\\\\\\\\\\\\\n  this.err = status;\\\\\\\\\\\\\\\\n  this.msg = this.strm.msg;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * inflate(data[, options]) -> Uint8Array|Array|String\\\\\\\\\\\\\\\\n * - data (Uint8Array|Array|String): input data to decompress.\\\\\\\\\\\\\\\\n * - options (Object): zlib inflate options.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\\\\\\\\\\\\\\\\n * format via wrapper header by default. That's why we don't provide\\\\\\\\\\\\\\\\n * separate `ungzip` method.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Supported options are:\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * - windowBits\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\\\\\\\\\\\\\\\\n * for more information.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Sugar (options):\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\\\\\\\\\\\\\\\\n *   negative windowBits implicitly.\\\\\\\\\\\\\\\\n * - `to` (String) - if equal to 'string', then result will be converted\\\\\\\\\\\\\\\\n *   from utf8 to utf16 (javascript) string. When string output requested,\\\\\\\\\\\\\\\\n *   chunk length can differ from `chunkSize`, depending on content.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ##### Example:\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * ```javascript\\\\\\\\\\\\\\\\n * var pako = require('pako')\\\\\\\\\\\\\\\\n *   , input = pako.deflate([1,2,3,4,5,6,7,8,9])\\\\\\\\\\\\\\\\n *   , output;\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * try {\\\\\\\\\\\\\\\\n *   output = pako.inflate(input);\\\\\\\\\\\\\\\\n * } catch (err)\\\\\\\\\\\\\\\\n *   console.log(err);\\\\\\\\\\\\\\\\n * }\\\\\\\\\\\\\\\\n * ```\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nfunction inflate(input, options) {\\\\\\\\\\\\\\\\n  var inflator = new Inflate(options);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  inflator.push(input, true);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // That will never happens, if you don't cheat with options :)\\\\\\\\\\\\\\\\n  if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return inflator.result;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\\\\\\\\\\\\\\\\n * - data (Uint8Array|Array|String): input data to decompress.\\\\\\\\\\\\\\\\n * - options (Object): zlib inflate options.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * The same as [[inflate]], but creates raw data, without wrapper\\\\\\\\\\\\\\\\n * (header and adler32 crc).\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\nfunction inflateRaw(input, options) {\\\\\\\\\\\\\\\\n  options = options || {};\\\\\\\\\\\\\\\\n  options.raw = true;\\\\\\\\\\\\\\\\n  return inflate(input, options);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * ungzip(data[, options]) -> Uint8Array|Array|String\\\\\\\\\\\\\\\\n * - data (Uint8Array|Array|String): input data to decompress.\\\\\\\\\\\\\\\\n * - options (Object): zlib inflate options.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * Just shortcut to [[inflate]], because it autodetects format\\\\\\\\\\\\\\\\n * by header.content. Done for convenience.\\\\\\\\\\\\\\\\n **/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nexports.Inflate = Inflate;\\\\\\\\\\\\\\\\nexports.inflate = inflate;\\\\\\\\\\\\\\\\nexports.inflateRaw = inflateRaw;\\\\\\\\\\\\\\\\nexports.ungzip  = inflate;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/inflate.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/common.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/utils/common.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar TYPED_OK =  (typeof Uint8Array !== 'undefined') &&\\\\\\\\\\\\\\\\n                (typeof Uint16Array !== 'undefined') &&\\\\\\\\\\\\\\\\n                (typeof Int32Array !== 'undefined');\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction _has(obj, key) {\\\\\\\\\\\\\\\\n  return Object.prototype.hasOwnProperty.call(obj, key);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\\\\\\\\\\\\\\\\n  var sources = Array.prototype.slice.call(arguments, 1);\\\\\\\\\\\\\\\\n  while (sources.length) {\\\\\\\\\\\\\\\\n    var source = sources.shift();\\\\\\\\\\\\\\\\n    if (!source) { continue; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (typeof source !== 'object') {\\\\\\\\\\\\\\\\n      throw new TypeError(source + 'must be non-object');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    for (var p in source) {\\\\\\\\\\\\\\\\n      if (_has(source, p)) {\\\\\\\\\\\\\\\\n        obj[p] = source[p];\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return obj;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// reduce buffer size, avoiding mem copy\\\\\\\\\\\\\\\\nexports.shrinkBuf = function (buf, size) {\\\\\\\\\\\\\\\\n  if (buf.length === size) { return buf; }\\\\\\\\\\\\\\\\n  if (buf.subarray) { return buf.subarray(0, size); }\\\\\\\\\\\\\\\\n  buf.length = size;\\\\\\\\\\\\\\\\n  return buf;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar fnTyped = {\\\\\\\\\\\\\\\\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\\\\\\\\\\\\\\\\n    if (src.subarray && dest.subarray) {\\\\\\\\\\\\\\\\n      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\\\\\\\\\\\\\\\\n      return;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    // Fallback to ordinary array\\\\\\\\\\\\\\\\n    for (var i = 0; i < len; i++) {\\\\\\\\\\\\\\\\n      dest[dest_offs + i] = src[src_offs + i];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  },\\\\\\\\\\\\\\\\n  // Join array of chunks to single array.\\\\\\\\\\\\\\\\n  flattenChunks: function (chunks) {\\\\\\\\\\\\\\\\n    var i, l, len, pos, chunk, result;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // calculate data length\\\\\\\\\\\\\\\\n    len = 0;\\\\\\\\\\\\\\\\n    for (i = 0, l = chunks.length; i < l; i++) {\\\\\\\\\\\\\\\\n      len += chunks[i].length;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // join chunks\\\\\\\\\\\\\\\\n    result = new Uint8Array(len);\\\\\\\\\\\\\\\\n    pos = 0;\\\\\\\\\\\\\\\\n    for (i = 0, l = chunks.length; i < l; i++) {\\\\\\\\\\\\\\\\n      chunk = chunks[i];\\\\\\\\\\\\\\\\n      result.set(chunk, pos);\\\\\\\\\\\\\\\\n      pos += chunk.length;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    return result;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar fnUntyped = {\\\\\\\\\\\\\\\\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\\\\\\\\\\\\\\\\n    for (var i = 0; i < len; i++) {\\\\\\\\\\\\\\\\n      dest[dest_offs + i] = src[src_offs + i];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  },\\\\\\\\\\\\\\\\n  // Join array of chunks to single array.\\\\\\\\\\\\\\\\n  flattenChunks: function (chunks) {\\\\\\\\\\\\\\\\n    return [].concat.apply([], chunks);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Enable/Disable typed arrays use, for testing\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\nexports.setTyped = function (on) {\\\\\\\\\\\\\\\\n  if (on) {\\\\\\\\\\\\\\\\n    exports.Buf8  = Uint8Array;\\\\\\\\\\\\\\\\n    exports.Buf16 = Uint16Array;\\\\\\\\\\\\\\\\n    exports.Buf32 = Int32Array;\\\\\\\\\\\\\\\\n    exports.assign(exports, fnTyped);\\\\\\\\\\\\\\\\n  } else {\\\\\\\\\\\\\\\\n    exports.Buf8  = Array;\\\\\\\\\\\\\\\\n    exports.Buf16 = Array;\\\\\\\\\\\\\\\\n    exports.Buf32 = Array;\\\\\\\\\\\\\\\\n    exports.assign(exports, fnUntyped);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nexports.setTyped(TYPED_OK);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/utils/common.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/strings.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/utils/strings.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"// String encode/decode helpers\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar utils = __webpack_require__(/*! ./common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Quick check if we can use fast array to bin string conversion\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// - apply(Array) can fail on Android 2.2\\\\\\\\\\\\\\\\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\nvar STR_APPLY_OK = true;\\\\\\\\\\\\\\\\nvar STR_APPLY_UIA_OK = true;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\\\\\\\\\\\\\\\\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Table with utf8 lengths (calculated by first byte of sequence)\\\\\\\\\\\\\\\\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\\\\\\\\\\\\\\\\n// because max possible codepoint is 0x10ffff\\\\\\\\\\\\\\\\nvar _utf8len = new utils.Buf8(256);\\\\\\\\\\\\\\\\nfor (var q = 0; q < 256; q++) {\\\\\\\\\\\\\\\\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// convert string to array (typed, when possible)\\\\\\\\\\\\\\\\nexports.string2buf = function (str) {\\\\\\\\\\\\\\\\n  var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // count binary size\\\\\\\\\\\\\\\\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\\\\\\\\\\\\\\\\n    c = str.charCodeAt(m_pos);\\\\\\\\\\\\\\\\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\\\\\\\\\\\\\\\\n      c2 = str.charCodeAt(m_pos + 1);\\\\\\\\\\\\\\\\n      if ((c2 & 0xfc00) === 0xdc00) {\\\\\\\\\\\\\\\\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\\\\\\\\\\\\\\\\n        m_pos++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // allocate buffer\\\\\\\\\\\\\\\\n  buf = new utils.Buf8(buf_len);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // convert\\\\\\\\\\\\\\\\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\\\\\\\\\\\\\\\\n    c = str.charCodeAt(m_pos);\\\\\\\\\\\\\\\\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\\\\\\\\\\\\\\\\n      c2 = str.charCodeAt(m_pos + 1);\\\\\\\\\\\\\\\\n      if ((c2 & 0xfc00) === 0xdc00) {\\\\\\\\\\\\\\\\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\\\\\\\\\\\\\\\\n        m_pos++;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (c < 0x80) {\\\\\\\\\\\\\\\\n      /* one byte */\\\\\\\\\\\\\\\\n      buf[i++] = c;\\\\\\\\\\\\\\\\n    } else if (c < 0x800) {\\\\\\\\\\\\\\\\n      /* two bytes */\\\\\\\\\\\\\\\\n      buf[i++] = 0xC0 | (c >>> 6);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c & 0x3f);\\\\\\\\\\\\\\\\n    } else if (c < 0x10000) {\\\\\\\\\\\\\\\\n      /* three bytes */\\\\\\\\\\\\\\\\n      buf[i++] = 0xE0 | (c >>> 12);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c & 0x3f);\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      /* four bytes */\\\\\\\\\\\\\\\\n      buf[i++] = 0xf0 | (c >>> 18);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\\\\\\\\\\\\\\\\n      buf[i++] = 0x80 | (c & 0x3f);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return buf;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Helper (used in 2 places)\\\\\\\\\\\\\\\\nfunction buf2binstring(buf, len) {\\\\\\\\\\\\\\\\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\\\\\\\\\\\\\\\\n  // If the length of the buffer is smaller than that, we can use this optimization,\\\\\\\\\\\\\\\\n  // otherwise we will take a slower path.\\\\\\\\\\\\\\\\n  if (len < 65534) {\\\\\\\\\\\\\\\\n    if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\\\\\\\\\\\\\\\\n      return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var result = '';\\\\\\\\\\\\\\\\n  for (var i = 0; i < len; i++) {\\\\\\\\\\\\\\\\n    result += String.fromCharCode(buf[i]);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return result;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Convert byte array to binary string\\\\\\\\\\\\\\\\nexports.buf2binstring = function (buf) {\\\\\\\\\\\\\\\\n  return buf2binstring(buf, buf.length);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Convert binary string (typed, when possible)\\\\\\\\\\\\\\\\nexports.binstring2buf = function (str) {\\\\\\\\\\\\\\\\n  var buf = new utils.Buf8(str.length);\\\\\\\\\\\\\\\\n  for (var i = 0, len = buf.length; i < len; i++) {\\\\\\\\\\\\\\\\n    buf[i] = str.charCodeAt(i);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return buf;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// convert array to string\\\\\\\\\\\\\\\\nexports.buf2string = function (buf, max) {\\\\\\\\\\\\\\\\n  var i, out, c, c_len;\\\\\\\\\\\\\\\\n  var len = max || buf.length;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Reserve max possible length (2 words per char)\\\\\\\\\\\\\\\\n  // NB: by unknown reasons, Array is significantly faster for\\\\\\\\\\\\\\\\n  //     String.fromCharCode.apply than Uint16Array.\\\\\\\\\\\\\\\\n  var utf16buf = new Array(len * 2);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (out = 0, i = 0; i < len;) {\\\\\\\\\\\\\\\\n    c = buf[i++];\\\\\\\\\\\\\\\\n    // quick process ascii\\\\\\\\\\\\\\\\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    c_len = _utf8len[c];\\\\\\\\\\\\\\\\n    // skip 5 & 6 byte codes\\\\\\\\\\\\\\\\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // apply mask on first byte\\\\\\\\\\\\\\\\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\\\\\\\\\\\\\\\\n    // join the rest\\\\\\\\\\\\\\\\n    while (c_len > 1 && i < len) {\\\\\\\\\\\\\\\\n      c = (c << 6) | (buf[i++] & 0x3f);\\\\\\\\\\\\\\\\n      c_len--;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    // terminated by end of string?\\\\\\\\\\\\\\\\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    if (c < 0x10000) {\\\\\\\\\\\\\\\\n      utf16buf[out++] = c;\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      c -= 0x10000;\\\\\\\\\\\\\\\\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\\\\\\\\\\\\\\\\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return buf2binstring(utf16buf, out);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Calculate max possible position in utf8 buffer,\\\\\\\\\\\\\\\\n// that will not break sequence. If that's not possible\\\\\\\\\\\\\\\\n// - (very small limits) return max size as is.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// buf[] - utf8 bytes array\\\\\\\\\\\\\\\\n// max   - length limit (mandatory);\\\\\\\\\\\\\\\\nexports.utf8border = function (buf, max) {\\\\\\\\\\\\\\\\n  var pos;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  max = max || buf.length;\\\\\\\\\\\\\\\\n  if (max > buf.length) { max = buf.length; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // go back from last position, until start of sequence found\\\\\\\\\\\\\\\\n  pos = max - 1;\\\\\\\\\\\\\\\\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // Very small and broken sequence,\\\\\\\\\\\\\\\\n  // return max, because we should return something anyway.\\\\\\\\\\\\\\\\n  if (pos < 0) { return max; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // If we came to start of buffer - that means buffer is too small,\\\\\\\\\\\\\\\\n  // return max too.\\\\\\\\\\\\\\\\n  if (pos === 0) { return max; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/utils/strings.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/adler32.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/adler32.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\\\\\\\\\\\\\\\\n// It isn't worth it to make additional optimizations as in original.\\\\\\\\\\\\\\\\n// Small size is preferable.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction adler32(adler, buf, len, pos) {\\\\\\\\\\\\\\\\n  var s1 = (adler & 0xffff) |0,\\\\\\\\\\\\\\\\n      s2 = ((adler >>> 16) & 0xffff) |0,\\\\\\\\\\\\\\\\n      n = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  while (len !== 0) {\\\\\\\\\\\\\\\\n    // Set limit ~ twice less than 5552, to keep\\\\\\\\\\\\\\\\n    // s2 in 31-bits, because we force signed ints.\\\\\\\\\\\\\\\\n    // in other case %= will fail.\\\\\\\\\\\\\\\\n    n = len > 2000 ? 2000 : len;\\\\\\\\\\\\\\\\n    len -= n;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    do {\\\\\\\\\\\\\\\\n      s1 = (s1 + buf[pos++]) |0;\\\\\\\\\\\\\\\\n      s2 = (s2 + s1) |0;\\\\\\\\\\\\\\\\n    } while (--n);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    s1 %= 65521;\\\\\\\\\\\\\\\\n    s2 %= 65521;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return (s1 | (s2 << 16)) |0;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = adler32;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/adler32.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/constants.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/constants.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* Allowed flush values; see deflate() and inflate() below for details */\\\\\\\\\\\\\\\\n  Z_NO_FLUSH:         0,\\\\\\\\\\\\\\\\n  Z_PARTIAL_FLUSH:    1,\\\\\\\\\\\\\\\\n  Z_SYNC_FLUSH:       2,\\\\\\\\\\\\\\\\n  Z_FULL_FLUSH:       3,\\\\\\\\\\\\\\\\n  Z_FINISH:           4,\\\\\\\\\\\\\\\\n  Z_BLOCK:            5,\\\\\\\\\\\\\\\\n  Z_TREES:            6,\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* Return codes for the compression/decompression functions. Negative values\\\\\\\\\\\\\\\\n  * are errors, positive values are used for special but normal events.\\\\\\\\\\\\\\\\n  */\\\\\\\\\\\\\\\\n  Z_OK:               0,\\\\\\\\\\\\\\\\n  Z_STREAM_END:       1,\\\\\\\\\\\\\\\\n  Z_NEED_DICT:        2,\\\\\\\\\\\\\\\\n  Z_ERRNO:           -1,\\\\\\\\\\\\\\\\n  Z_STREAM_ERROR:    -2,\\\\\\\\\\\\\\\\n  Z_DATA_ERROR:      -3,\\\\\\\\\\\\\\\\n  //Z_MEM_ERROR:     -4,\\\\\\\\\\\\\\\\n  Z_BUF_ERROR:       -5,\\\\\\\\\\\\\\\\n  //Z_VERSION_ERROR: -6,\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* compression levels */\\\\\\\\\\\\\\\\n  Z_NO_COMPRESSION:         0,\\\\\\\\\\\\\\\\n  Z_BEST_SPEED:             1,\\\\\\\\\\\\\\\\n  Z_BEST_COMPRESSION:       9,\\\\\\\\\\\\\\\\n  Z_DEFAULT_COMPRESSION:   -1,\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  Z_FILTERED:               1,\\\\\\\\\\\\\\\\n  Z_HUFFMAN_ONLY:           2,\\\\\\\\\\\\\\\\n  Z_RLE:                    3,\\\\\\\\\\\\\\\\n  Z_FIXED:                  4,\\\\\\\\\\\\\\\\n  Z_DEFAULT_STRATEGY:       0,\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* Possible values of the data_type field (though see inflate()) */\\\\\\\\\\\\\\\\n  Z_BINARY:                 0,\\\\\\\\\\\\\\\\n  Z_TEXT:                   1,\\\\\\\\\\\\\\\\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\\\\\\\\\\\\\\\\n  Z_UNKNOWN:                2,\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* The deflate compression method */\\\\\\\\\\\\\\\\n  Z_DEFLATED:               8\\\\\\\\\\\\\\\\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/constants.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/crc32.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/crc32.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Note: we can't get significant speed boost here.\\\\\\\\\\\\\\\\n// So write code to minimize size - no pregenerated tables\\\\\\\\\\\\\\\\n// and array tools dependencies.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Use ordinary array, since untyped makes no boost here\\\\\\\\\\\\\\\\nfunction makeTable() {\\\\\\\\\\\\\\\\n  var c, table = [];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (var n = 0; n < 256; n++) {\\\\\\\\\\\\\\\\n    c = n;\\\\\\\\\\\\\\\\n    for (var k = 0; k < 8; k++) {\\\\\\\\\\\\\\\\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    table[n] = c;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return table;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// Create table on load. Just 255 signed longs. Not a problem.\\\\\\\\\\\\\\\\nvar crcTable = makeTable();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction crc32(crc, buf, len, pos) {\\\\\\\\\\\\\\\\n  var t = crcTable,\\\\\\\\\\\\\\\\n      end = pos + len;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  crc ^= -1;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  for (var i = pos; i < end; i++) {\\\\\\\\\\\\\\\\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  return (crc ^ (-1)); // >>> 0;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = crc32;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/crc32.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/gzheader.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/gzheader.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction GZheader() {\\\\\\\\\\\\\\\\n  /* true if compressed data believed to be text */\\\\\\\\\\\\\\\\n  this.text       = 0;\\\\\\\\\\\\\\\\n  /* modification time */\\\\\\\\\\\\\\\\n  this.time       = 0;\\\\\\\\\\\\\\\\n  /* extra flags (not used when writing a gzip file) */\\\\\\\\\\\\\\\\n  this.xflags     = 0;\\\\\\\\\\\\\\\\n  /* operating system */\\\\\\\\\\\\\\\\n  this.os         = 0;\\\\\\\\\\\\\\\\n  /* pointer to extra field or Z_NULL if none */\\\\\\\\\\\\\\\\n  this.extra      = null;\\\\\\\\\\\\\\\\n  /* extra field length (valid if extra != Z_NULL) */\\\\\\\\\\\\\\\\n  this.extra_len  = 0; // Actually, we don't need it in JS,\\\\\\\\\\\\\\\\n                       // but leave for few code modifications\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  //\\\\\\\\\\\\\\\\n  // Setup limits is not necessary because in js we should not preallocate memory\\\\\\\\\\\\\\\\n  // for inflate use constant limit in 65536 bytes\\\\\\\\\\\\\\\\n  //\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* space at extra (only when reading header) */\\\\\\\\\\\\\\\\n  // this.extra_max  = 0;\\\\\\\\\\\\\\\\n  /* pointer to zero-terminated file name or Z_NULL */\\\\\\\\\\\\\\\\n  this.name       = '';\\\\\\\\\\\\\\\\n  /* space at name (only when reading header) */\\\\\\\\\\\\\\\\n  // this.name_max   = 0;\\\\\\\\\\\\\\\\n  /* pointer to zero-terminated comment or Z_NULL */\\\\\\\\\\\\\\\\n  this.comment    = '';\\\\\\\\\\\\\\\\n  /* space at comment (only when reading header) */\\\\\\\\\\\\\\\\n  // this.comm_max   = 0;\\\\\\\\\\\\\\\\n  /* true if there was or will be a header crc */\\\\\\\\\\\\\\\\n  this.hcrc       = 0;\\\\\\\\\\\\\\\\n  /* true when done reading gzip header (not used when writing a gzip file) */\\\\\\\\\\\\\\\\n  this.done       = false;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = GZheader;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/gzheader.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inffast.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/inffast.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// See state defs from inflate.js\\\\\\\\\\\\\\\\nvar BAD = 30;       /* got a data error -- remain here until reset */\\\\\\\\\\\\\\\\nvar TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/*\\\\\\\\\\\\\\\\n   Decode literal, length, and distance codes and write out the resulting\\\\\\\\\\\\\\\\n   literal and match bytes until either not enough input or output is\\\\\\\\\\\\\\\\n   available, an end-of-block is encountered, or a data error is encountered.\\\\\\\\\\\\\\\\n   When large enough input and output buffers are supplied to inflate(), for\\\\\\\\\\\\\\\\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\\\\\\\\\\\\\\\\n   inflate execution time is spent in this routine.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   Entry assumptions:\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        state.mode === LEN\\\\\\\\\\\\\\\\n        strm.avail_in >= 6\\\\\\\\\\\\\\\\n        strm.avail_out >= 258\\\\\\\\\\\\\\\\n        start >= strm.avail_out\\\\\\\\\\\\\\\\n        state.bits < 8\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   On return, state.mode is one of:\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        LEN -- ran out of enough output space or enough available input\\\\\\\\\\\\\\\\n        TYPE -- reached end of block code, inflate() to interpret next block\\\\\\\\\\\\\\\\n        BAD -- error in block data\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   Notes:\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    - The maximum input bits used by a length/distance pair is 15 bits for the\\\\\\\\\\\\\\\\n      length code, 5 bits for the length extra, 15 bits for the distance code,\\\\\\\\\\\\\\\\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\\\\\\\\\\\\\\\\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\\\\\\\\\\\\\\\\n      checking for available input while decoding.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    - The maximum bytes that a single length/distance pair can output is 258\\\\\\\\\\\\\\\\n      bytes, which is the maximum length that can be coded.  inflate_fast()\\\\\\\\\\\\\\\\n      requires strm.avail_out >= 258 for each loop to avoid checking for\\\\\\\\\\\\\\\\n      output space.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nmodule.exports = function inflate_fast(strm, start) {\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n  var _in;                    /* local strm.input */\\\\\\\\\\\\\\\\n  var last;                   /* have enough input while in < last */\\\\\\\\\\\\\\\\n  var _out;                   /* local strm.output */\\\\\\\\\\\\\\\\n  var beg;                    /* inflate()'s initial strm.output */\\\\\\\\\\\\\\\\n  var end;                    /* while out < end, enough space available */\\\\\\\\\\\\\\\\n//#ifdef INFLATE_STRICT\\\\\\\\\\\\\\\\n  var dmax;                   /* maximum distance from zlib header */\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n  var wsize;                  /* window size or zero if not using window */\\\\\\\\\\\\\\\\n  var whave;                  /* valid bytes in the window */\\\\\\\\\\\\\\\\n  var wnext;                  /* window write index */\\\\\\\\\\\\\\\\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\\\\\\\\\\\\\\\\n  var s_window;               /* allocated sliding window, if wsize != 0 */\\\\\\\\\\\\\\\\n  var hold;                   /* local strm.hold */\\\\\\\\\\\\\\\\n  var bits;                   /* local strm.bits */\\\\\\\\\\\\\\\\n  var lcode;                  /* local strm.lencode */\\\\\\\\\\\\\\\\n  var dcode;                  /* local strm.distcode */\\\\\\\\\\\\\\\\n  var lmask;                  /* mask for first level of length codes */\\\\\\\\\\\\\\\\n  var dmask;                  /* mask for first level of distance codes */\\\\\\\\\\\\\\\\n  var here;                   /* retrieved table entry */\\\\\\\\\\\\\\\\n  var op;                     /* code bits, operation, extra bits, or */\\\\\\\\\\\\\\\\n                              /*  window position, window bytes to copy */\\\\\\\\\\\\\\\\n  var len;                    /* match length, unused bytes */\\\\\\\\\\\\\\\\n  var dist;                   /* match distance */\\\\\\\\\\\\\\\\n  var from;                   /* where to copy match from */\\\\\\\\\\\\\\\\n  var from_source;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var input, output; // JS specific, because we have no pointers\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* copy state to local variables */\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n  //here = state.here;\\\\\\\\\\\\\\\\n  _in = strm.next_in;\\\\\\\\\\\\\\\\n  input = strm.input;\\\\\\\\\\\\\\\\n  last = _in + (strm.avail_in - 5);\\\\\\\\\\\\\\\\n  _out = strm.next_out;\\\\\\\\\\\\\\\\n  output = strm.output;\\\\\\\\\\\\\\\\n  beg = _out - (start - strm.avail_out);\\\\\\\\\\\\\\\\n  end = _out + (strm.avail_out - 257);\\\\\\\\\\\\\\\\n//#ifdef INFLATE_STRICT\\\\\\\\\\\\\\\\n  dmax = state.dmax;\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n  wsize = state.wsize;\\\\\\\\\\\\\\\\n  whave = state.whave;\\\\\\\\\\\\\\\\n  wnext = state.wnext;\\\\\\\\\\\\\\\\n  s_window = state.window;\\\\\\\\\\\\\\\\n  hold = state.hold;\\\\\\\\\\\\\\\\n  bits = state.bits;\\\\\\\\\\\\\\\\n  lcode = state.lencode;\\\\\\\\\\\\\\\\n  dcode = state.distcode;\\\\\\\\\\\\\\\\n  lmask = (1 << state.lenbits) - 1;\\\\\\\\\\\\\\\\n  dmask = (1 << state.distbits) - 1;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* decode literals and length/distances until end-of-block or not enough\\\\\\\\\\\\\\\\n     input data or output space */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  top:\\\\\\\\\\\\\\\\n  do {\\\\\\\\\\\\\\\\n    if (bits < 15) {\\\\\\\\\\\\\\\\n      hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n      bits += 8;\\\\\\\\\\\\\\\\n      hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n      bits += 8;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    here = lcode[hold & lmask];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    dolen:\\\\\\\\\\\\\\\\n    for (;;) { // Goto emulation\\\\\\\\\\\\\\\\n      op = here >>> 24/*here.bits*/;\\\\\\\\\\\\\\\\n      hold >>>= op;\\\\\\\\\\\\\\\\n      bits -= op;\\\\\\\\\\\\\\\\n      op = (here >>> 16) & 0xff/*here.op*/;\\\\\\\\\\\\\\\\n      if (op === 0) {                          /* literal */\\\\\\\\\\\\\\\\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\\\\\\\\\\\\\\\\n        //        \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         literal '%c'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" :\\\\\\\\\\\\\\\\n        //        \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         literal 0x%02x\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", here.val));\\\\\\\\\\\\\\\\n        output[_out++] = here & 0xffff/*here.val*/;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      else if (op & 16) {                     /* length base */\\\\\\\\\\\\\\\\n        len = here & 0xffff/*here.val*/;\\\\\\\\\\\\\\\\n        op &= 15;                           /* number of extra bits */\\\\\\\\\\\\\\\\n        if (op) {\\\\\\\\\\\\\\\\n          if (bits < op) {\\\\\\\\\\\\\\\\n            hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          len += hold & ((1 << op) - 1);\\\\\\\\\\\\\\\\n          hold >>>= op;\\\\\\\\\\\\\\\\n          bits -= op;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         length %u\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", len));\\\\\\\\\\\\\\\\n        if (bits < 15) {\\\\\\\\\\\\\\\\n          hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n          hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        here = dcode[hold & dmask];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        dodist:\\\\\\\\\\\\\\\\n        for (;;) { // goto emulation\\\\\\\\\\\\\\\\n          op = here >>> 24/*here.bits*/;\\\\\\\\\\\\\\\\n          hold >>>= op;\\\\\\\\\\\\\\\\n          bits -= op;\\\\\\\\\\\\\\\\n          op = (here >>> 16) & 0xff/*here.op*/;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if (op & 16) {                      /* distance base */\\\\\\\\\\\\\\\\n            dist = here & 0xffff/*here.val*/;\\\\\\\\\\\\\\\\n            op &= 15;                       /* number of extra bits */\\\\\\\\\\\\\\\\n            if (bits < op) {\\\\\\\\\\\\\\\\n              hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n              bits += 8;\\\\\\\\\\\\\\\\n              if (bits < op) {\\\\\\\\\\\\\\\\n                hold += input[_in++] << bits;\\\\\\\\\\\\\\\\n                bits += 8;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            dist += hold & ((1 << op) - 1);\\\\\\\\\\\\\\\\n//#ifdef INFLATE_STRICT\\\\\\\\\\\\\\\\n            if (dist > dmax) {\\\\\\\\\\\\\\\\n              strm.msg = 'invalid distance too far back';\\\\\\\\\\\\\\\\n              state.mode = BAD;\\\\\\\\\\\\\\\\n              break top;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n            hold >>>= op;\\\\\\\\\\\\\\\\n            bits -= op;\\\\\\\\\\\\\\\\n            //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         distance %u\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", dist));\\\\\\\\\\\\\\\\n            op = _out - beg;                /* max distance in output */\\\\\\\\\\\\\\\\n            if (dist > op) {                /* see if copy from window */\\\\\\\\\\\\\\\\n              op = dist - op;               /* distance back in window */\\\\\\\\\\\\\\\\n              if (op > whave) {\\\\\\\\\\\\\\\\n                if (state.sane) {\\\\\\\\\\\\\\\\n                  strm.msg = 'invalid distance too far back';\\\\\\\\\\\\\\\\n                  state.mode = BAD;\\\\\\\\\\\\\\\\n                  break top;\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (!) This block is disabled in zlib defaults,\\\\\\\\\\\\\\\\n// don't enable it for binary compatibility\\\\\\\\\\\\\\\\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\\\\\\\\\\\\\\\\n//                if (len <= op - whave) {\\\\\\\\\\\\\\\\n//                  do {\\\\\\\\\\\\\\\\n//                    output[_out++] = 0;\\\\\\\\\\\\\\\\n//                  } while (--len);\\\\\\\\\\\\\\\\n//                  continue top;\\\\\\\\\\\\\\\\n//                }\\\\\\\\\\\\\\\\n//                len -= op - whave;\\\\\\\\\\\\\\\\n//                do {\\\\\\\\\\\\\\\\n//                  output[_out++] = 0;\\\\\\\\\\\\\\\\n//                } while (--op > whave);\\\\\\\\\\\\\\\\n//                if (op === 0) {\\\\\\\\\\\\\\\\n//                  from = _out - dist;\\\\\\\\\\\\\\\\n//                  do {\\\\\\\\\\\\\\\\n//                    output[_out++] = output[from++];\\\\\\\\\\\\\\\\n//                  } while (--len);\\\\\\\\\\\\\\\\n//                  continue top;\\\\\\\\\\\\\\\\n//                }\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              from = 0; // window index\\\\\\\\\\\\\\\\n              from_source = s_window;\\\\\\\\\\\\\\\\n              if (wnext === 0) {           /* very common case */\\\\\\\\\\\\\\\\n                from += wsize - op;\\\\\\\\\\\\\\\\n                if (op < len) {         /* some from window */\\\\\\\\\\\\\\\\n                  len -= op;\\\\\\\\\\\\\\\\n                  do {\\\\\\\\\\\\\\\\n                    output[_out++] = s_window[from++];\\\\\\\\\\\\\\\\n                  } while (--op);\\\\\\\\\\\\\\\\n                  from = _out - dist;  /* rest from output */\\\\\\\\\\\\\\\\n                  from_source = output;\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              else if (wnext < op) {      /* wrap around window */\\\\\\\\\\\\\\\\n                from += wsize + wnext - op;\\\\\\\\\\\\\\\\n                op -= wnext;\\\\\\\\\\\\\\\\n                if (op < len) {         /* some from end of window */\\\\\\\\\\\\\\\\n                  len -= op;\\\\\\\\\\\\\\\\n                  do {\\\\\\\\\\\\\\\\n                    output[_out++] = s_window[from++];\\\\\\\\\\\\\\\\n                  } while (--op);\\\\\\\\\\\\\\\\n                  from = 0;\\\\\\\\\\\\\\\\n                  if (wnext < len) {  /* some from start of window */\\\\\\\\\\\\\\\\n                    op = wnext;\\\\\\\\\\\\\\\\n                    len -= op;\\\\\\\\\\\\\\\\n                    do {\\\\\\\\\\\\\\\\n                      output[_out++] = s_window[from++];\\\\\\\\\\\\\\\\n                    } while (--op);\\\\\\\\\\\\\\\\n                    from = _out - dist;      /* rest from output */\\\\\\\\\\\\\\\\n                    from_source = output;\\\\\\\\\\\\\\\\n                  }\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              else {                      /* contiguous in window */\\\\\\\\\\\\\\\\n                from += wnext - op;\\\\\\\\\\\\\\\\n                if (op < len) {         /* some from window */\\\\\\\\\\\\\\\\n                  len -= op;\\\\\\\\\\\\\\\\n                  do {\\\\\\\\\\\\\\\\n                    output[_out++] = s_window[from++];\\\\\\\\\\\\\\\\n                  } while (--op);\\\\\\\\\\\\\\\\n                  from = _out - dist;  /* rest from output */\\\\\\\\\\\\\\\\n                  from_source = output;\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              while (len > 2) {\\\\\\\\\\\\\\\\n                output[_out++] = from_source[from++];\\\\\\\\\\\\\\\\n                output[_out++] = from_source[from++];\\\\\\\\\\\\\\\\n                output[_out++] = from_source[from++];\\\\\\\\\\\\\\\\n                len -= 3;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              if (len) {\\\\\\\\\\\\\\\\n                output[_out++] = from_source[from++];\\\\\\\\\\\\\\\\n                if (len > 1) {\\\\\\\\\\\\\\\\n                  output[_out++] = from_source[from++];\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            else {\\\\\\\\\\\\\\\\n              from = _out - dist;          /* copy direct from output */\\\\\\\\\\\\\\\\n              do {                        /* minimum length is three */\\\\\\\\\\\\\\\\n                output[_out++] = output[from++];\\\\\\\\\\\\\\\\n                output[_out++] = output[from++];\\\\\\\\\\\\\\\\n                output[_out++] = output[from++];\\\\\\\\\\\\\\\\n                len -= 3;\\\\\\\\\\\\\\\\n              } while (len > 2);\\\\\\\\\\\\\\\\n              if (len) {\\\\\\\\\\\\\\\\n                output[_out++] = output[from++];\\\\\\\\\\\\\\\\n                if (len > 1) {\\\\\\\\\\\\\\\\n                  output[_out++] = output[from++];\\\\\\\\\\\\\\\\n                }\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\\\\\\\\\\\\\\\\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\\\\\\\\\\\\\\\\n            continue dodist;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          else {\\\\\\\\\\\\\\\\n            strm.msg = 'invalid distance code';\\\\\\\\\\\\\\\\n            state.mode = BAD;\\\\\\\\\\\\\\\\n            break top;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          break; // need to emulate goto via \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"continue\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      else if ((op & 64) === 0) {              /* 2nd level length code */\\\\\\\\\\\\\\\\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\\\\\\\\\\\\\\\\n        continue dolen;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      else if (op & 32) {                     /* end-of-block */\\\\\\\\\\\\\\\\n        //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         end of block\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        state.mode = TYPE;\\\\\\\\\\\\\\\\n        break top;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n      else {\\\\\\\\\\\\\\\\n        strm.msg = 'invalid literal/length code';\\\\\\\\\\\\\\\\n        state.mode = BAD;\\\\\\\\\\\\\\\\n        break top;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      break; // need to emulate goto via \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"continue\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  } while (_in < last && _out < end);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\\\\\\\\\\\\\\\\n  len = bits >> 3;\\\\\\\\\\\\\\\\n  _in -= len;\\\\\\\\\\\\\\\\n  bits -= len << 3;\\\\\\\\\\\\\\\\n  hold &= (1 << bits) - 1;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* update state and return */\\\\\\\\\\\\\\\\n  strm.next_in = _in;\\\\\\\\\\\\\\\\n  strm.next_out = _out;\\\\\\\\\\\\\\\\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\\\\\\\\\\\\\\\\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\\\\\\\\\\\\\\\\n  state.hold = hold;\\\\\\\\\\\\\\\\n  state.bits = bits;\\\\\\\\\\\\\\\\n  return;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/inffast.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inflate.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/inflate.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar utils         = __webpack_require__(/*! ../utils/common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar adler32       = __webpack_require__(/*! ./adler32 */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/adler32.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar crc32         = __webpack_require__(/*! ./crc32 */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/crc32.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar inflate_fast  = __webpack_require__(/*! ./inffast */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inffast.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nvar inflate_table = __webpack_require__(/*! ./inftrees */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inftrees.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar CODES = 0;\\\\\\\\\\\\\\\\nvar LENS = 1;\\\\\\\\\\\\\\\\nvar DISTS = 2;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* Public constants ==========================================================*/\\\\\\\\\\\\\\\\n/* ===========================================================================*/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* Allowed flush values; see deflate() and inflate() below for details */\\\\\\\\\\\\\\\\n//var Z_NO_FLUSH      = 0;\\\\\\\\\\\\\\\\n//var Z_PARTIAL_FLUSH = 1;\\\\\\\\\\\\\\\\n//var Z_SYNC_FLUSH    = 2;\\\\\\\\\\\\\\\\n//var Z_FULL_FLUSH    = 3;\\\\\\\\\\\\\\\\nvar Z_FINISH        = 4;\\\\\\\\\\\\\\\\nvar Z_BLOCK         = 5;\\\\\\\\\\\\\\\\nvar Z_TREES         = 6;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* Return codes for the compression/decompression functions. Negative values\\\\\\\\\\\\\\\\n * are errors, positive values are used for special but normal events.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nvar Z_OK            = 0;\\\\\\\\\\\\\\\\nvar Z_STREAM_END    = 1;\\\\\\\\\\\\\\\\nvar Z_NEED_DICT     = 2;\\\\\\\\\\\\\\\\n//var Z_ERRNO         = -1;\\\\\\\\\\\\\\\\nvar Z_STREAM_ERROR  = -2;\\\\\\\\\\\\\\\\nvar Z_DATA_ERROR    = -3;\\\\\\\\\\\\\\\\nvar Z_MEM_ERROR     = -4;\\\\\\\\\\\\\\\\nvar Z_BUF_ERROR     = -5;\\\\\\\\\\\\\\\\n//var Z_VERSION_ERROR = -6;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* The deflate compression method */\\\\\\\\\\\\\\\\nvar Z_DEFLATED  = 8;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* STATES ====================================================================*/\\\\\\\\\\\\\\\\n/* ===========================================================================*/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar    HEAD = 1;       /* i: waiting for magic header */\\\\\\\\\\\\\\\\nvar    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\\\\\\\\\\\\\\\\nvar    TIME = 3;       /* i: waiting for modification time (gzip) */\\\\\\\\\\\\\\\\nvar    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\\\\\\\\\\\\\\\\nvar    EXLEN = 5;      /* i: waiting for extra length (gzip) */\\\\\\\\\\\\\\\\nvar    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\\\\\\\\\\\\\\\\nvar    NAME = 7;       /* i: waiting for end of file name (gzip) */\\\\\\\\\\\\\\\\nvar    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\\\\\\\\\\\\\\\\nvar    HCRC = 9;       /* i: waiting for header crc (gzip) */\\\\\\\\\\\\\\\\nvar    DICTID = 10;    /* i: waiting for dictionary check value */\\\\\\\\\\\\\\\\nvar    DICT = 11;      /* waiting for inflateSetDictionary() call */\\\\\\\\\\\\\\\\nvar        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\\\\\\\\\\\\\\\\nvar        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\\\\\\\\\\\\\\\\nvar        STORED = 14;    /* i: waiting for stored size (length and complement) */\\\\\\\\\\\\\\\\nvar        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\\\\\\\\\\\\\\\\nvar        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\\\\\\\\\\\\\\\\nvar        TABLE = 17;     /* i: waiting for dynamic block table lengths */\\\\\\\\\\\\\\\\nvar        LENLENS = 18;   /* i: waiting for code length code lengths */\\\\\\\\\\\\\\\\nvar        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\\\\\\\\\\\\\\\\nvar            LEN_ = 20;      /* i: same as LEN below, but only first time in */\\\\\\\\\\\\\\\\nvar            LEN = 21;       /* i: waiting for length/lit/eob code */\\\\\\\\\\\\\\\\nvar            LENEXT = 22;    /* i: waiting for length extra bits */\\\\\\\\\\\\\\\\nvar            DIST = 23;      /* i: waiting for distance code */\\\\\\\\\\\\\\\\nvar            DISTEXT = 24;   /* i: waiting for distance extra bits */\\\\\\\\\\\\\\\\nvar            MATCH = 25;     /* o: waiting for output space to copy string */\\\\\\\\\\\\\\\\nvar            LIT = 26;       /* o: waiting for output space to write literal */\\\\\\\\\\\\\\\\nvar    CHECK = 27;     /* i: waiting for 32-bit check value */\\\\\\\\\\\\\\\\nvar    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\\\\\\\\\\\\\\\\nvar    DONE = 29;      /* finished check, done -- remain here until reset */\\\\\\\\\\\\\\\\nvar    BAD = 30;       /* got a data error -- remain here until reset */\\\\\\\\\\\\\\\\nvar    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\\\\\\\\\\\\\\\\nvar    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* ===========================================================================*/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar ENOUGH_LENS = 852;\\\\\\\\\\\\\\\\nvar ENOUGH_DISTS = 592;\\\\\\\\\\\\\\\\n//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar MAX_WBITS = 15;\\\\\\\\\\\\\\\\n/* 32K LZ77 window */\\\\\\\\\\\\\\\\nvar DEF_WBITS = MAX_WBITS;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction zswap32(q) {\\\\\\\\\\\\\\\\n  return  (((q >>> 24) & 0xff) +\\\\\\\\\\\\\\\\n          ((q >>> 8) & 0xff00) +\\\\\\\\\\\\\\\\n          ((q & 0xff00) << 8) +\\\\\\\\\\\\\\\\n          ((q & 0xff) << 24));\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction InflateState() {\\\\\\\\\\\\\\\\n  this.mode = 0;             /* current inflate mode */\\\\\\\\\\\\\\\\n  this.last = false;          /* true if processing last block */\\\\\\\\\\\\\\\\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\\\\\\\\\\\\\\\\n  this.havedict = false;      /* true if dictionary provided */\\\\\\\\\\\\\\\\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\\\\\\\\\\\\\\\\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\\\\\\\\\\\\\\\\n  this.check = 0;             /* protected copy of check value */\\\\\\\\\\\\\\\\n  this.total = 0;             /* protected copy of output count */\\\\\\\\\\\\\\\\n  // TODO: may be {}\\\\\\\\\\\\\\\\n  this.head = null;           /* where to save gzip header information */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* sliding window */\\\\\\\\\\\\\\\\n  this.wbits = 0;             /* log base 2 of requested window size */\\\\\\\\\\\\\\\\n  this.wsize = 0;             /* window size or zero if not using window */\\\\\\\\\\\\\\\\n  this.whave = 0;             /* valid bytes in the window */\\\\\\\\\\\\\\\\n  this.wnext = 0;             /* window write index */\\\\\\\\\\\\\\\\n  this.window = null;         /* allocated sliding window, if needed */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* bit accumulator */\\\\\\\\\\\\\\\\n  this.hold = 0;              /* input bit accumulator */\\\\\\\\\\\\\\\\n  this.bits = 0;              /* number of bits in \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"in\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* for string and stored block copying */\\\\\\\\\\\\\\\\n  this.length = 0;            /* literal or length of data to copy */\\\\\\\\\\\\\\\\n  this.offset = 0;            /* distance back to copy string from */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* for table and code decoding */\\\\\\\\\\\\\\\\n  this.extra = 0;             /* extra bits needed */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* fixed and dynamic code tables */\\\\\\\\\\\\\\\\n  this.lencode = null;          /* starting table for length/literal codes */\\\\\\\\\\\\\\\\n  this.distcode = null;         /* starting table for distance codes */\\\\\\\\\\\\\\\\n  this.lenbits = 0;           /* index bits for lencode */\\\\\\\\\\\\\\\\n  this.distbits = 0;          /* index bits for distcode */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* dynamic table building */\\\\\\\\\\\\\\\\n  this.ncode = 0;             /* number of code length code lengths */\\\\\\\\\\\\\\\\n  this.nlen = 0;              /* number of length code lengths */\\\\\\\\\\\\\\\\n  this.ndist = 0;             /* number of distance code lengths */\\\\\\\\\\\\\\\\n  this.have = 0;              /* number of code lengths in lens[] */\\\\\\\\\\\\\\\\n  this.next = null;              /* next available space in codes[] */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\\\\\\\\\\\\\\\\n  this.work = new utils.Buf16(288); /* work area for code table building */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /*\\\\\\\\\\\\\\\\n   because we don't have pointers in js, we use lencode and distcode directly\\\\\\\\\\\\\\\\n   as buffers so we don't need codes\\\\\\\\\\\\\\\\n  */\\\\\\\\\\\\\\\\n  //this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */\\\\\\\\\\\\\\\\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\\\\\\\\\\\\\\\\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\\\\\\\\\\\\\\\\n  this.sane = 0;                   /* if false, allow invalid distance too far */\\\\\\\\\\\\\\\\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\\\\\\\\\\\\\\\\n  this.was = 0;                    /* initial length of match */\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateResetKeep(strm) {\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n  strm.total_in = strm.total_out = state.total = 0;\\\\\\\\\\\\\\\\n  strm.msg = ''; /*Z_NULL*/\\\\\\\\\\\\\\\\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\\\\\\\\\\\\\\\\n    strm.adler = state.wrap & 1;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  state.mode = HEAD;\\\\\\\\\\\\\\\\n  state.last = 0;\\\\\\\\\\\\\\\\n  state.havedict = 0;\\\\\\\\\\\\\\\\n  state.dmax = 32768;\\\\\\\\\\\\\\\\n  state.head = null/*Z_NULL*/;\\\\\\\\\\\\\\\\n  state.hold = 0;\\\\\\\\\\\\\\\\n  state.bits = 0;\\\\\\\\\\\\\\\\n  //state.lencode = state.distcode = state.next = state.codes;\\\\\\\\\\\\\\\\n  state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\\\\\\\\\\\\\\\\n  state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  state.sane = 1;\\\\\\\\\\\\\\\\n  state.back = -1;\\\\\\\\\\\\\\\\n  //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate: reset\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n  return Z_OK;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateReset(strm) {\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n  state.wsize = 0;\\\\\\\\\\\\\\\\n  state.whave = 0;\\\\\\\\\\\\\\\\n  state.wnext = 0;\\\\\\\\\\\\\\\\n  return inflateResetKeep(strm);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateReset2(strm, windowBits) {\\\\\\\\\\\\\\\\n  var wrap;\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* get the state */\\\\\\\\\\\\\\\\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* extract wrap request from windowBits parameter */\\\\\\\\\\\\\\\\n  if (windowBits < 0) {\\\\\\\\\\\\\\\\n    wrap = 0;\\\\\\\\\\\\\\\\n    windowBits = -windowBits;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  else {\\\\\\\\\\\\\\\\n    wrap = (windowBits >> 4) + 1;\\\\\\\\\\\\\\\\n    if (windowBits < 48) {\\\\\\\\\\\\\\\\n      windowBits &= 15;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* set number of window bits, free window if different */\\\\\\\\\\\\\\\\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\\\\\\\\\\\\\\\\n    return Z_STREAM_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (state.window !== null && state.wbits !== windowBits) {\\\\\\\\\\\\\\\\n    state.window = null;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* update state and reset the rest of it */\\\\\\\\\\\\\\\\n  state.wrap = wrap;\\\\\\\\\\\\\\\\n  state.wbits = windowBits;\\\\\\\\\\\\\\\\n  return inflateReset(strm);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateInit2(strm, windowBits) {\\\\\\\\\\\\\\\\n  var ret;\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (!strm) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  //strm.msg = Z_NULL;                 /* in case we return an error */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  state = new InflateState();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  //if (state === Z_NULL) return Z_MEM_ERROR;\\\\\\\\\\\\\\\\n  //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate: allocated\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n  strm.state = state;\\\\\\\\\\\\\\\\n  state.window = null/*Z_NULL*/;\\\\\\\\\\\\\\\\n  ret = inflateReset2(strm, windowBits);\\\\\\\\\\\\\\\\n  if (ret !== Z_OK) {\\\\\\\\\\\\\\\\n    strm.state = null/*Z_NULL*/;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return ret;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateInit(strm) {\\\\\\\\\\\\\\\\n  return inflateInit2(strm, DEF_WBITS);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/*\\\\\\\\\\\\\\\\n Return state with length and distance decoding tables and index sizes set to\\\\\\\\\\\\\\\\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\\\\\\\\\\\\\\\\n If BUILDFIXED is defined, then instead this routine builds the tables the\\\\\\\\\\\\\\\\n first time it's called, and returns those tables the first time and\\\\\\\\\\\\\\\\n thereafter.  This reduces the size of the code by about 2K bytes, in\\\\\\\\\\\\\\\\n exchange for a little execution time.  However, BUILDFIXED should not be\\\\\\\\\\\\\\\\n used for threaded applications, since the rewriting of the tables and virgin\\\\\\\\\\\\\\\\n may not be thread-safe.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nvar virgin = true;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction fixedtables(state) {\\\\\\\\\\\\\\\\n  /* build fixed huffman tables if first call (may not be thread safe) */\\\\\\\\\\\\\\\\n  if (virgin) {\\\\\\\\\\\\\\\\n    var sym;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    lenfix = new utils.Buf32(512);\\\\\\\\\\\\\\\\n    distfix = new utils.Buf32(32);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* literal/length table */\\\\\\\\\\\\\\\\n    sym = 0;\\\\\\\\\\\\\\\\n    while (sym < 144) { state.lens[sym++] = 8; }\\\\\\\\\\\\\\\\n    while (sym < 256) { state.lens[sym++] = 9; }\\\\\\\\\\\\\\\\n    while (sym < 280) { state.lens[sym++] = 7; }\\\\\\\\\\\\\\\\n    while (sym < 288) { state.lens[sym++] = 8; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    inflate_table(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* distance table */\\\\\\\\\\\\\\\\n    sym = 0;\\\\\\\\\\\\\\\\n    while (sym < 32) { state.lens[sym++] = 5; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    inflate_table(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* do this just once */\\\\\\\\\\\\\\\\n    virgin = false;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  state.lencode = lenfix;\\\\\\\\\\\\\\\\n  state.lenbits = 9;\\\\\\\\\\\\\\\\n  state.distcode = distfix;\\\\\\\\\\\\\\\\n  state.distbits = 5;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/*\\\\\\\\\\\\\\\\n Update the window with the last wsize (normally 32K) bytes written before\\\\\\\\\\\\\\\\n returning.  If window does not exist yet, create it.  This is only called\\\\\\\\\\\\\\\\n when a window is already in use, or when output has been written during this\\\\\\\\\\\\\\\\n inflate call, but the end of the deflate stream has not been reached yet.\\\\\\\\\\\\\\\\n It is also called to create a window for dictionary data when a dictionary\\\\\\\\\\\\\\\\n is loaded.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n Providing output buffers larger than 32K to inflate() should provide a speed\\\\\\\\\\\\\\\\n advantage, since only the last 32K of output is copied to the sliding window\\\\\\\\\\\\\\\\n upon return from inflate(), and since all distances after the first 32K of\\\\\\\\\\\\\\\\n output will fall in the output data, making match copies simpler and faster.\\\\\\\\\\\\\\\\n The advantage may be dependent on the size of the processor's data caches.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nfunction updatewindow(strm, src, end, copy) {\\\\\\\\\\\\\\\\n  var dist;\\\\\\\\\\\\\\\\n  var state = strm.state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* if it hasn't been done already, allocate space for the window */\\\\\\\\\\\\\\\\n  if (state.window === null) {\\\\\\\\\\\\\\\\n    state.wsize = 1 << state.wbits;\\\\\\\\\\\\\\\\n    state.wnext = 0;\\\\\\\\\\\\\\\\n    state.whave = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    state.window = new utils.Buf8(state.wsize);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* copy state->wsize or less output bytes into the circular window */\\\\\\\\\\\\\\\\n  if (copy >= state.wsize) {\\\\\\\\\\\\\\\\n    utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\\\\\\\\\\\\\\\\n    state.wnext = 0;\\\\\\\\\\\\\\\\n    state.whave = state.wsize;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  else {\\\\\\\\\\\\\\\\n    dist = state.wsize - state.wnext;\\\\\\\\\\\\\\\\n    if (dist > copy) {\\\\\\\\\\\\\\\\n      dist = copy;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\\\\\\\\\\\\\\\\n    utils.arraySet(state.window, src, end - copy, dist, state.wnext);\\\\\\\\\\\\\\\\n    copy -= dist;\\\\\\\\\\\\\\\\n    if (copy) {\\\\\\\\\\\\\\\\n      //zmemcpy(state->window, end - copy, copy);\\\\\\\\\\\\\\\\n      utils.arraySet(state.window, src, end - copy, copy, 0);\\\\\\\\\\\\\\\\n      state.wnext = copy;\\\\\\\\\\\\\\\\n      state.whave = state.wsize;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    else {\\\\\\\\\\\\\\\\n      state.wnext += dist;\\\\\\\\\\\\\\\\n      if (state.wnext === state.wsize) { state.wnext = 0; }\\\\\\\\\\\\\\\\n      if (state.whave < state.wsize) { state.whave += dist; }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return 0;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflate(strm, flush) {\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n  var input, output;          // input/output buffers\\\\\\\\\\\\\\\\n  var next;                   /* next input INDEX */\\\\\\\\\\\\\\\\n  var put;                    /* next output INDEX */\\\\\\\\\\\\\\\\n  var have, left;             /* available input and output */\\\\\\\\\\\\\\\\n  var hold;                   /* bit buffer */\\\\\\\\\\\\\\\\n  var bits;                   /* bits in bit buffer */\\\\\\\\\\\\\\\\n  var _in, _out;              /* save starting available input and output */\\\\\\\\\\\\\\\\n  var copy;                   /* number of stored or match bytes to copy */\\\\\\\\\\\\\\\\n  var from;                   /* where to copy match bytes from */\\\\\\\\\\\\\\\\n  var from_source;\\\\\\\\\\\\\\\\n  var here = 0;               /* current decoding table entry */\\\\\\\\\\\\\\\\n  var here_bits, here_op, here_val; // paked \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"here\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" denormalized (JS specific)\\\\\\\\\\\\\\\\n  //var last;                   /* parent table entry */\\\\\\\\\\\\\\\\n  var last_bits, last_op, last_val; // paked \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"last\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" denormalized (JS specific)\\\\\\\\\\\\\\\\n  var len;                    /* length to copy for repeats, bits to drop */\\\\\\\\\\\\\\\\n  var ret;                    /* return code */\\\\\\\\\\\\\\\\n  var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */\\\\\\\\\\\\\\\\n  var opts;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var n; // temporary var for NEED_BITS\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var order = /* permutation of code lengths */\\\\\\\\\\\\\\\\n    [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (!strm || !strm.state || !strm.output ||\\\\\\\\\\\\\\\\n      (!strm.input && strm.avail_in !== 0)) {\\\\\\\\\\\\\\\\n    return Z_STREAM_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  //--- LOAD() ---\\\\\\\\\\\\\\\\n  put = strm.next_out;\\\\\\\\\\\\\\\\n  output = strm.output;\\\\\\\\\\\\\\\\n  left = strm.avail_out;\\\\\\\\\\\\\\\\n  next = strm.next_in;\\\\\\\\\\\\\\\\n  input = strm.input;\\\\\\\\\\\\\\\\n  have = strm.avail_in;\\\\\\\\\\\\\\\\n  hold = state.hold;\\\\\\\\\\\\\\\\n  bits = state.bits;\\\\\\\\\\\\\\\\n  //---\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  _in = have;\\\\\\\\\\\\\\\\n  _out = left;\\\\\\\\\\\\\\\\n  ret = Z_OK;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  inf_leave: // goto emulation\\\\\\\\\\\\\\\\n  for (;;) {\\\\\\\\\\\\\\\\n    switch (state.mode) {\\\\\\\\\\\\\\\\n      case HEAD:\\\\\\\\\\\\\\\\n        if (state.wrap === 0) {\\\\\\\\\\\\\\\\n          state.mode = TYPEDO;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //=== NEEDBITS(16);\\\\\\\\\\\\\\\\n        while (bits < 16) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\\\\\\\\\\\\\\\\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\\\\\\\\\\\\\\\\n          //=== CRC2(state.check, hold);\\\\\\\\\\\\\\\\n          hbuf[0] = hold & 0xff;\\\\\\\\\\\\\\\\n          hbuf[1] = (hold >>> 8) & 0xff;\\\\\\\\\\\\\\\\n          state.check = crc32(state.check, hbuf, 2, 0);\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          //=== INITBITS();\\\\\\\\\\\\\\\\n          hold = 0;\\\\\\\\\\\\\\\\n          bits = 0;\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          state.mode = FLAGS;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.flags = 0;           /* expect zlib header */\\\\\\\\\\\\\\\\n        if (state.head) {\\\\\\\\\\\\\\\\n          state.head.done = false;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\\\\\\\\\\\\\\\\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\\\\\\\\\\\\\\\\n          strm.msg = 'incorrect header check';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\\\\\\\\\\\\\\\\n          strm.msg = 'unknown compression method';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //--- DROPBITS(4) ---//\\\\\\\\\\\\\\\\n        hold >>>= 4;\\\\\\\\\\\\\\\\n        bits -= 4;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\\\\\\\\\\\\\\\\n        if (state.wbits === 0) {\\\\\\\\\\\\\\\\n          state.wbits = len;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else if (len > state.wbits) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid window size';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.dmax = 1 << len;\\\\\\\\\\\\\\\\n        //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:   zlib header ok\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\\\\\\\\\\\\\\\\n        state.mode = hold & 0x200 ? DICTID : TYPE;\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case FLAGS:\\\\\\\\\\\\\\\\n        //=== NEEDBITS(16); */\\\\\\\\\\\\\\\\n        while (bits < 16) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.flags = hold;\\\\\\\\\\\\\\\\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\\\\\\\\\\\\\\\\n          strm.msg = 'unknown compression method';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.flags & 0xe000) {\\\\\\\\\\\\\\\\n          strm.msg = 'unknown header flags set';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.head) {\\\\\\\\\\\\\\\\n          state.head.text = ((hold >> 8) & 1);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n          //=== CRC2(state.check, hold);\\\\\\\\\\\\\\\\n          hbuf[0] = hold & 0xff;\\\\\\\\\\\\\\\\n          hbuf[1] = (hold >>> 8) & 0xff;\\\\\\\\\\\\\\\\n          state.check = crc32(state.check, hbuf, 2, 0);\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.mode = TIME;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case TIME:\\\\\\\\\\\\\\\\n        //=== NEEDBITS(32); */\\\\\\\\\\\\\\\\n        while (bits < 32) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        if (state.head) {\\\\\\\\\\\\\\\\n          state.head.time = hold;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n          //=== CRC4(state.check, hold)\\\\\\\\\\\\\\\\n          hbuf[0] = hold & 0xff;\\\\\\\\\\\\\\\\n          hbuf[1] = (hold >>> 8) & 0xff;\\\\\\\\\\\\\\\\n          hbuf[2] = (hold >>> 16) & 0xff;\\\\\\\\\\\\\\\\n          hbuf[3] = (hold >>> 24) & 0xff;\\\\\\\\\\\\\\\\n          state.check = crc32(state.check, hbuf, 4, 0);\\\\\\\\\\\\\\\\n          //===\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.mode = OS;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case OS:\\\\\\\\\\\\\\\\n        //=== NEEDBITS(16); */\\\\\\\\\\\\\\\\n        while (bits < 16) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        if (state.head) {\\\\\\\\\\\\\\\\n          state.head.xflags = (hold & 0xff);\\\\\\\\\\\\\\\\n          state.head.os = (hold >> 8);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n          //=== CRC2(state.check, hold);\\\\\\\\\\\\\\\\n          hbuf[0] = hold & 0xff;\\\\\\\\\\\\\\\\n          hbuf[1] = (hold >>> 8) & 0xff;\\\\\\\\\\\\\\\\n          state.check = crc32(state.check, hbuf, 2, 0);\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.mode = EXLEN;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case EXLEN:\\\\\\\\\\\\\\\\n        if (state.flags & 0x0400) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(16); */\\\\\\\\\\\\\\\\n          while (bits < 16) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          state.length = hold;\\\\\\\\\\\\\\\\n          if (state.head) {\\\\\\\\\\\\\\\\n            state.head.extra_len = hold;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n            //=== CRC2(state.check, hold);\\\\\\\\\\\\\\\\n            hbuf[0] = hold & 0xff;\\\\\\\\\\\\\\\\n            hbuf[1] = (hold >>> 8) & 0xff;\\\\\\\\\\\\\\\\n            state.check = crc32(state.check, hbuf, 2, 0);\\\\\\\\\\\\\\\\n            //===//\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //=== INITBITS();\\\\\\\\\\\\\\\\n          hold = 0;\\\\\\\\\\\\\\\\n          bits = 0;\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else if (state.head) {\\\\\\\\\\\\\\\\n          state.head.extra = null/*Z_NULL*/;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.mode = EXTRA;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case EXTRA:\\\\\\\\\\\\\\\\n        if (state.flags & 0x0400) {\\\\\\\\\\\\\\\\n          copy = state.length;\\\\\\\\\\\\\\\\n          if (copy > have) { copy = have; }\\\\\\\\\\\\\\\\n          if (copy) {\\\\\\\\\\\\\\\\n            if (state.head) {\\\\\\\\\\\\\\\\n              len = state.head.extra_len - state.length;\\\\\\\\\\\\\\\\n              if (!state.head.extra) {\\\\\\\\\\\\\\\\n                // Use untyped array for more convenient processing later\\\\\\\\\\\\\\\\n                state.head.extra = new Array(state.head.extra_len);\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              utils.arraySet(\\\\\\\\\\\\\\\\n                state.head.extra,\\\\\\\\\\\\\\\\n                input,\\\\\\\\\\\\\\\\n                next,\\\\\\\\\\\\\\\\n                // extra field is limited to 65536 bytes\\\\\\\\\\\\\\\\n                // - no need for additional size check\\\\\\\\\\\\\\\\n                copy,\\\\\\\\\\\\\\\\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\\\\\\\\\\\\\\\\n                len\\\\\\\\\\\\\\\\n              );\\\\\\\\\\\\\\\\n              //zmemcpy(state.head.extra + len, next,\\\\\\\\\\\\\\\\n              //        len + copy > state.head.extra_max ?\\\\\\\\\\\\\\\\n              //        state.head.extra_max - len : copy);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n              state.check = crc32(state.check, input, copy, next);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            have -= copy;\\\\\\\\\\\\\\\\n            next += copy;\\\\\\\\\\\\\\\\n            state.length -= copy;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (state.length) { break inf_leave; }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.length = 0;\\\\\\\\\\\\\\\\n        state.mode = NAME;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case NAME:\\\\\\\\\\\\\\\\n        if (state.flags & 0x0800) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          copy = 0;\\\\\\\\\\\\\\\\n          do {\\\\\\\\\\\\\\\\n            // TODO: 2 or 1 bytes?\\\\\\\\\\\\\\\\n            len = input[next + copy++];\\\\\\\\\\\\\\\\n            /* use constant limit because in js we should not preallocate memory */\\\\\\\\\\\\\\\\n            if (state.head && len &&\\\\\\\\\\\\\\\\n                (state.length < 65536 /*state.head.name_max*/)) {\\\\\\\\\\\\\\\\n              state.head.name += String.fromCharCode(len);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          } while (len && copy < have);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n            state.check = crc32(state.check, input, copy, next);\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          have -= copy;\\\\\\\\\\\\\\\\n          next += copy;\\\\\\\\\\\\\\\\n          if (len) { break inf_leave; }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else if (state.head) {\\\\\\\\\\\\\\\\n          state.head.name = null;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.length = 0;\\\\\\\\\\\\\\\\n        state.mode = COMMENT;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case COMMENT:\\\\\\\\\\\\\\\\n        if (state.flags & 0x1000) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          copy = 0;\\\\\\\\\\\\\\\\n          do {\\\\\\\\\\\\\\\\n            len = input[next + copy++];\\\\\\\\\\\\\\\\n            /* use constant limit because in js we should not preallocate memory */\\\\\\\\\\\\\\\\n            if (state.head && len &&\\\\\\\\\\\\\\\\n                (state.length < 65536 /*state.head.comm_max*/)) {\\\\\\\\\\\\\\\\n              state.head.comment += String.fromCharCode(len);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          } while (len && copy < have);\\\\\\\\\\\\\\\\n          if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n            state.check = crc32(state.check, input, copy, next);\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          have -= copy;\\\\\\\\\\\\\\\\n          next += copy;\\\\\\\\\\\\\\\\n          if (len) { break inf_leave; }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else if (state.head) {\\\\\\\\\\\\\\\\n          state.head.comment = null;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.mode = HCRC;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case HCRC:\\\\\\\\\\\\\\\\n        if (state.flags & 0x0200) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(16); */\\\\\\\\\\\\\\\\n          while (bits < 16) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          if (hold !== (state.check & 0xffff)) {\\\\\\\\\\\\\\\\n            strm.msg = 'header crc mismatch';\\\\\\\\\\\\\\\\n            state.mode = BAD;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //=== INITBITS();\\\\\\\\\\\\\\\\n          hold = 0;\\\\\\\\\\\\\\\\n          bits = 0;\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (state.head) {\\\\\\\\\\\\\\\\n          state.head.hcrc = ((state.flags >> 9) & 1);\\\\\\\\\\\\\\\\n          state.head.done = true;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        strm.adler = state.check = 0;\\\\\\\\\\\\\\\\n        state.mode = TYPE;\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case DICTID:\\\\\\\\\\\\\\\\n        //=== NEEDBITS(32); */\\\\\\\\\\\\\\\\n        while (bits < 32) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        strm.adler = state.check = zswap32(hold);\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.mode = DICT;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case DICT:\\\\\\\\\\\\\\\\n        if (state.havedict === 0) {\\\\\\\\\\\\\\\\n          //--- RESTORE() ---\\\\\\\\\\\\\\\\n          strm.next_out = put;\\\\\\\\\\\\\\\\n          strm.avail_out = left;\\\\\\\\\\\\\\\\n          strm.next_in = next;\\\\\\\\\\\\\\\\n          strm.avail_in = have;\\\\\\\\\\\\\\\\n          state.hold = hold;\\\\\\\\\\\\\\\\n          state.bits = bits;\\\\\\\\\\\\\\\\n          //---\\\\\\\\\\\\\\\\n          return Z_NEED_DICT;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\\\\\\\\\\\\\\\\n        state.mode = TYPE;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case TYPE:\\\\\\\\\\\\\\\\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case TYPEDO:\\\\\\\\\\\\\\\\n        if (state.last) {\\\\\\\\\\\\\\\\n          //--- BYTEBITS() ---//\\\\\\\\\\\\\\\\n          hold >>>= bits & 7;\\\\\\\\\\\\\\\\n          bits -= bits & 7;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          state.mode = CHECK;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //=== NEEDBITS(3); */\\\\\\\\\\\\\\\\n        while (bits < 3) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.last = (hold & 0x01)/*BITS(1)*/;\\\\\\\\\\\\\\\\n        //--- DROPBITS(1) ---//\\\\\\\\\\\\\\\\n        hold >>>= 1;\\\\\\\\\\\\\\\\n        bits -= 1;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        switch ((hold & 0x03)/*BITS(2)*/) {\\\\\\\\\\\\\\\\n          case 0:                             /* stored block */\\\\\\\\\\\\\\\\n            //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:     stored block%s\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n            //        state.last ? \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" (last)\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" : \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n            state.mode = STORED;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          case 1:                             /* fixed block */\\\\\\\\\\\\\\\\n            fixedtables(state);\\\\\\\\\\\\\\\\n            //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:     fixed codes block%s\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n            //        state.last ? \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" (last)\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" : \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n            state.mode = LEN_;             /* decode codes */\\\\\\\\\\\\\\\\n            if (flush === Z_TREES) {\\\\\\\\\\\\\\\\n              //--- DROPBITS(2) ---//\\\\\\\\\\\\\\\\n              hold >>>= 2;\\\\\\\\\\\\\\\\n              bits -= 2;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n              break inf_leave;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          case 2:                             /* dynamic block */\\\\\\\\\\\\\\\\n            //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:     dynamic codes block%s\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n            //        state.last ? \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" (last)\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" : \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n            state.mode = TABLE;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          case 3:\\\\\\\\\\\\\\\\n            strm.msg = 'invalid block type';\\\\\\\\\\\\\\\\n            state.mode = BAD;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //--- DROPBITS(2) ---//\\\\\\\\\\\\\\\\n        hold >>>= 2;\\\\\\\\\\\\\\\\n        bits -= 2;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case STORED:\\\\\\\\\\\\\\\\n        //--- BYTEBITS() ---// /* go to byte boundary */\\\\\\\\\\\\\\\\n        hold >>>= bits & 7;\\\\\\\\\\\\\\\\n        bits -= bits & 7;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        //=== NEEDBITS(32); */\\\\\\\\\\\\\\\\n        while (bits < 32) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid stored block lengths';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.length = hold & 0xffff;\\\\\\\\\\\\\\\\n        //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:       stored length %u\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n        //        state.length));\\\\\\\\\\\\\\\\n        //=== INITBITS();\\\\\\\\\\\\\\\\n        hold = 0;\\\\\\\\\\\\\\\\n        bits = 0;\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.mode = COPY_;\\\\\\\\\\\\\\\\n        if (flush === Z_TREES) { break inf_leave; }\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case COPY_:\\\\\\\\\\\\\\\\n        state.mode = COPY;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case COPY:\\\\\\\\\\\\\\\\n        copy = state.length;\\\\\\\\\\\\\\\\n        if (copy) {\\\\\\\\\\\\\\\\n          if (copy > have) { copy = have; }\\\\\\\\\\\\\\\\n          if (copy > left) { copy = left; }\\\\\\\\\\\\\\\\n          if (copy === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          //--- zmemcpy(put, next, copy); ---\\\\\\\\\\\\\\\\n          utils.arraySet(output, input, next, copy, put);\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          have -= copy;\\\\\\\\\\\\\\\\n          next += copy;\\\\\\\\\\\\\\\\n          left -= copy;\\\\\\\\\\\\\\\\n          put += copy;\\\\\\\\\\\\\\\\n          state.length -= copy;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:       stored end\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        state.mode = TYPE;\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case TABLE:\\\\\\\\\\\\\\\\n        //=== NEEDBITS(14); */\\\\\\\\\\\\\\\\n        while (bits < 14) {\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //===//\\\\\\\\\\\\\\\\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\\\\\\\\\\\\\\\\n        //--- DROPBITS(5) ---//\\\\\\\\\\\\\\\\n        hold >>>= 5;\\\\\\\\\\\\\\\\n        bits -= 5;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\\\\\\\\\\\\\\\\n        //--- DROPBITS(5) ---//\\\\\\\\\\\\\\\\n        hold >>>= 5;\\\\\\\\\\\\\\\\n        bits -= 5;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\\\\\\\\\\\\\\\\n        //--- DROPBITS(4) ---//\\\\\\\\\\\\\\\\n        hold >>>= 4;\\\\\\\\\\\\\\\\n        bits -= 4;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n//#ifndef PKZIP_BUG_WORKAROUND\\\\\\\\\\\\\\\\n        if (state.nlen > 286 || state.ndist > 30) {\\\\\\\\\\\\\\\\n          strm.msg = 'too many length or distance symbols';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n        //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:       table sizes ok\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        state.have = 0;\\\\\\\\\\\\\\\\n        state.mode = LENLENS;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case LENLENS:\\\\\\\\\\\\\\\\n        while (state.have < state.ncode) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(3);\\\\\\\\\\\\\\\\n          while (bits < 3) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\\\\\\\\\\\\\\\\n          //--- DROPBITS(3) ---//\\\\\\\\\\\\\\\\n          hold >>>= 3;\\\\\\\\\\\\\\\\n          bits -= 3;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        while (state.have < 19) {\\\\\\\\\\\\\\\\n          state.lens[order[state.have++]] = 0;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        // We have separate tables & no pointers. 2 commented lines below not needed.\\\\\\\\\\\\\\\\n        //state.next = state.codes;\\\\\\\\\\\\\\\\n        //state.lencode = state.next;\\\\\\\\\\\\\\\\n        // Switch to use dynamic table\\\\\\\\\\\\\\\\n        state.lencode = state.lendyn;\\\\\\\\\\\\\\\\n        state.lenbits = 7;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        opts = { bits: state.lenbits };\\\\\\\\\\\\\\\\n        ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\\\\\\\\\\\\\\\\n        state.lenbits = opts.bits;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        if (ret) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid code lengths set';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:       code lengths ok\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        state.have = 0;\\\\\\\\\\\\\\\\n        state.mode = CODELENS;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case CODELENS:\\\\\\\\\\\\\\\\n        while (state.have < state.nlen + state.ndist) {\\\\\\\\\\\\\\\\n          for (;;) {\\\\\\\\\\\\\\\\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\\\\\\\\\\\\\\\\n            here_bits = here >>> 24;\\\\\\\\\\\\\\\\n            here_op = (here >>> 16) & 0xff;\\\\\\\\\\\\\\\\n            here_val = here & 0xffff;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n            if ((here_bits) <= bits) { break; }\\\\\\\\\\\\\\\\n            //--- PULLBYTE() ---//\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n            //---//\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (here_val < 16) {\\\\\\\\\\\\\\\\n            //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n            hold >>>= here_bits;\\\\\\\\\\\\\\\\n            bits -= here_bits;\\\\\\\\\\\\\\\\n            //---//\\\\\\\\\\\\\\\\n            state.lens[state.have++] = here_val;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          else {\\\\\\\\\\\\\\\\n            if (here_val === 16) {\\\\\\\\\\\\\\\\n              //=== NEEDBITS(here.bits + 2);\\\\\\\\\\\\\\\\n              n = here_bits + 2;\\\\\\\\\\\\\\\\n              while (bits < n) {\\\\\\\\\\\\\\\\n                if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n                have--;\\\\\\\\\\\\\\\\n                hold += input[next++] << bits;\\\\\\\\\\\\\\\\n                bits += 8;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              //===//\\\\\\\\\\\\\\\\n              //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n              hold >>>= here_bits;\\\\\\\\\\\\\\\\n              bits -= here_bits;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n              if (state.have === 0) {\\\\\\\\\\\\\\\\n                strm.msg = 'invalid bit length repeat';\\\\\\\\\\\\\\\\n                state.mode = BAD;\\\\\\\\\\\\\\\\n                break;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              len = state.lens[state.have - 1];\\\\\\\\\\\\\\\\n              copy = 3 + (hold & 0x03);//BITS(2);\\\\\\\\\\\\\\\\n              //--- DROPBITS(2) ---//\\\\\\\\\\\\\\\\n              hold >>>= 2;\\\\\\\\\\\\\\\\n              bits -= 2;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            else if (here_val === 17) {\\\\\\\\\\\\\\\\n              //=== NEEDBITS(here.bits + 3);\\\\\\\\\\\\\\\\n              n = here_bits + 3;\\\\\\\\\\\\\\\\n              while (bits < n) {\\\\\\\\\\\\\\\\n                if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n                have--;\\\\\\\\\\\\\\\\n                hold += input[next++] << bits;\\\\\\\\\\\\\\\\n                bits += 8;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              //===//\\\\\\\\\\\\\\\\n              //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n              hold >>>= here_bits;\\\\\\\\\\\\\\\\n              bits -= here_bits;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n              len = 0;\\\\\\\\\\\\\\\\n              copy = 3 + (hold & 0x07);//BITS(3);\\\\\\\\\\\\\\\\n              //--- DROPBITS(3) ---//\\\\\\\\\\\\\\\\n              hold >>>= 3;\\\\\\\\\\\\\\\\n              bits -= 3;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            else {\\\\\\\\\\\\\\\\n              //=== NEEDBITS(here.bits + 7);\\\\\\\\\\\\\\\\n              n = here_bits + 7;\\\\\\\\\\\\\\\\n              while (bits < n) {\\\\\\\\\\\\\\\\n                if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n                have--;\\\\\\\\\\\\\\\\n                hold += input[next++] << bits;\\\\\\\\\\\\\\\\n                bits += 8;\\\\\\\\\\\\\\\\n              }\\\\\\\\\\\\\\\\n              //===//\\\\\\\\\\\\\\\\n              //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n              hold >>>= here_bits;\\\\\\\\\\\\\\\\n              bits -= here_bits;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n              len = 0;\\\\\\\\\\\\\\\\n              copy = 11 + (hold & 0x7f);//BITS(7);\\\\\\\\\\\\\\\\n              //--- DROPBITS(7) ---//\\\\\\\\\\\\\\\\n              hold >>>= 7;\\\\\\\\\\\\\\\\n              bits -= 7;\\\\\\\\\\\\\\\\n              //---//\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            if (state.have + copy > state.nlen + state.ndist) {\\\\\\\\\\\\\\\\n              strm.msg = 'invalid bit length repeat';\\\\\\\\\\\\\\\\n              state.mode = BAD;\\\\\\\\\\\\\\\\n              break;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            while (copy--) {\\\\\\\\\\\\\\\\n              state.lens[state.have++] = len;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        /* handle error breaks in while */\\\\\\\\\\\\\\\\n        if (state.mode === BAD) { break; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        /* check for end-of-block code (better have one) */\\\\\\\\\\\\\\\\n        if (state.lens[256] === 0) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid code -- missing end-of-block';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        /* build code tables -- note: do not change the lenbits or distbits\\\\\\\\\\\\\\\\n           values here (9 and 6) without reading the comments in inftrees.h\\\\\\\\\\\\\\\\n           concerning the ENOUGH constants, which depend on those values */\\\\\\\\\\\\\\\\n        state.lenbits = 9;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        opts = { bits: state.lenbits };\\\\\\\\\\\\\\\\n        ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\\\\\\\\\\\\\\\\n        // We have separate tables & no pointers. 2 commented lines below not needed.\\\\\\\\\\\\\\\\n        // state.next_index = opts.table_index;\\\\\\\\\\\\\\\\n        state.lenbits = opts.bits;\\\\\\\\\\\\\\\\n        // state.lencode = state.next;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        if (ret) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid literal/lengths set';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        state.distbits = 6;\\\\\\\\\\\\\\\\n        //state.distcode.copy(state.codes);\\\\\\\\\\\\\\\\n        // Switch to use dynamic table\\\\\\\\\\\\\\\\n        state.distcode = state.distdyn;\\\\\\\\\\\\\\\\n        opts = { bits: state.distbits };\\\\\\\\\\\\\\\\n        ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\\\\\\\\\\\\\\\\n        // We have separate tables & no pointers. 2 commented lines below not needed.\\\\\\\\\\\\\\\\n        // state.next_index = opts.table_index;\\\\\\\\\\\\\\\\n        state.distbits = opts.bits;\\\\\\\\\\\\\\\\n        // state.distcode = state.next;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        if (ret) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid distances set';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //Tracev((stderr, 'inflate:       codes ok\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n'));\\\\\\\\\\\\\\\\n        state.mode = LEN_;\\\\\\\\\\\\\\\\n        if (flush === Z_TREES) { break inf_leave; }\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case LEN_:\\\\\\\\\\\\\\\\n        state.mode = LEN;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case LEN:\\\\\\\\\\\\\\\\n        if (have >= 6 && left >= 258) {\\\\\\\\\\\\\\\\n          //--- RESTORE() ---\\\\\\\\\\\\\\\\n          strm.next_out = put;\\\\\\\\\\\\\\\\n          strm.avail_out = left;\\\\\\\\\\\\\\\\n          strm.next_in = next;\\\\\\\\\\\\\\\\n          strm.avail_in = have;\\\\\\\\\\\\\\\\n          state.hold = hold;\\\\\\\\\\\\\\\\n          state.bits = bits;\\\\\\\\\\\\\\\\n          //---\\\\\\\\\\\\\\\\n          inflate_fast(strm, _out);\\\\\\\\\\\\\\\\n          //--- LOAD() ---\\\\\\\\\\\\\\\\n          put = strm.next_out;\\\\\\\\\\\\\\\\n          output = strm.output;\\\\\\\\\\\\\\\\n          left = strm.avail_out;\\\\\\\\\\\\\\\\n          next = strm.next_in;\\\\\\\\\\\\\\\\n          input = strm.input;\\\\\\\\\\\\\\\\n          have = strm.avail_in;\\\\\\\\\\\\\\\\n          hold = state.hold;\\\\\\\\\\\\\\\\n          bits = state.bits;\\\\\\\\\\\\\\\\n          //---\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if (state.mode === TYPE) {\\\\\\\\\\\\\\\\n            state.back = -1;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.back = 0;\\\\\\\\\\\\\\\\n        for (;;) {\\\\\\\\\\\\\\\\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\\\\\\\\\\\\\\\\n          here_bits = here >>> 24;\\\\\\\\\\\\\\\\n          here_op = (here >>> 16) & 0xff;\\\\\\\\\\\\\\\\n          here_val = here & 0xffff;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if (here_bits <= bits) { break; }\\\\\\\\\\\\\\\\n          //--- PULLBYTE() ---//\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (here_op && (here_op & 0xf0) === 0) {\\\\\\\\\\\\\\\\n          last_bits = here_bits;\\\\\\\\\\\\\\\\n          last_op = here_op;\\\\\\\\\\\\\\\\n          last_val = here_val;\\\\\\\\\\\\\\\\n          for (;;) {\\\\\\\\\\\\\\\\n            here = state.lencode[last_val +\\\\\\\\\\\\\\\\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\\\\\\\\\\\\\\\\n            here_bits = here >>> 24;\\\\\\\\\\\\\\\\n            here_op = (here >>> 16) & 0xff;\\\\\\\\\\\\\\\\n            here_val = here & 0xffff;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n            if ((last_bits + here_bits) <= bits) { break; }\\\\\\\\\\\\\\\\n            //--- PULLBYTE() ---//\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n            //---//\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //--- DROPBITS(last.bits) ---//\\\\\\\\\\\\\\\\n          hold >>>= last_bits;\\\\\\\\\\\\\\\\n          bits -= last_bits;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          state.back += last_bits;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n        hold >>>= here_bits;\\\\\\\\\\\\\\\\n        bits -= here_bits;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        state.back += here_bits;\\\\\\\\\\\\\\\\n        state.length = here_val;\\\\\\\\\\\\\\\\n        if (here_op === 0) {\\\\\\\\\\\\\\\\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\\\\\\\\\\\\\\\\n          //        \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         literal '%c'\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" :\\\\\\\\\\\\\\\\n          //        \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         literal 0x%02x\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", here.val));\\\\\\\\\\\\\\\\n          state.mode = LIT;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (here_op & 32) {\\\\\\\\\\\\\\\\n          //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         end of block\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n          state.back = -1;\\\\\\\\\\\\\\\\n          state.mode = TYPE;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (here_op & 64) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid literal/length code';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.extra = here_op & 15;\\\\\\\\\\\\\\\\n        state.mode = LENEXT;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case LENEXT:\\\\\\\\\\\\\\\\n        if (state.extra) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(state.extra);\\\\\\\\\\\\\\\\n          n = state.extra;\\\\\\\\\\\\\\\\n          while (bits < n) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\\\\\\\\\\\\\\\\n          //--- DROPBITS(state.extra) ---//\\\\\\\\\\\\\\\\n          hold >>>= state.extra;\\\\\\\\\\\\\\\\n          bits -= state.extra;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          state.back += state.extra;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         length %u\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", state.length));\\\\\\\\\\\\\\\\n        state.was = state.length;\\\\\\\\\\\\\\\\n        state.mode = DIST;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case DIST:\\\\\\\\\\\\\\\\n        for (;;) {\\\\\\\\\\\\\\\\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\\\\\\\\\\\\\\\\n          here_bits = here >>> 24;\\\\\\\\\\\\\\\\n          here_op = (here >>> 16) & 0xff;\\\\\\\\\\\\\\\\n          here_val = here & 0xffff;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          if ((here_bits) <= bits) { break; }\\\\\\\\\\\\\\\\n          //--- PULLBYTE() ---//\\\\\\\\\\\\\\\\n          if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n          have--;\\\\\\\\\\\\\\\\n          hold += input[next++] << bits;\\\\\\\\\\\\\\\\n          bits += 8;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if ((here_op & 0xf0) === 0) {\\\\\\\\\\\\\\\\n          last_bits = here_bits;\\\\\\\\\\\\\\\\n          last_op = here_op;\\\\\\\\\\\\\\\\n          last_val = here_val;\\\\\\\\\\\\\\\\n          for (;;) {\\\\\\\\\\\\\\\\n            here = state.distcode[last_val +\\\\\\\\\\\\\\\\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\\\\\\\\\\\\\\\\n            here_bits = here >>> 24;\\\\\\\\\\\\\\\\n            here_op = (here >>> 16) & 0xff;\\\\\\\\\\\\\\\\n            here_val = here & 0xffff;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n            if ((last_bits + here_bits) <= bits) { break; }\\\\\\\\\\\\\\\\n            //--- PULLBYTE() ---//\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n            //---//\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //--- DROPBITS(last.bits) ---//\\\\\\\\\\\\\\\\n          hold >>>= last_bits;\\\\\\\\\\\\\\\\n          bits -= last_bits;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          state.back += last_bits;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        //--- DROPBITS(here.bits) ---//\\\\\\\\\\\\\\\\n        hold >>>= here_bits;\\\\\\\\\\\\\\\\n        bits -= here_bits;\\\\\\\\\\\\\\\\n        //---//\\\\\\\\\\\\\\\\n        state.back += here_bits;\\\\\\\\\\\\\\\\n        if (here_op & 64) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid distance code';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.offset = here_val;\\\\\\\\\\\\\\\\n        state.extra = (here_op) & 15;\\\\\\\\\\\\\\\\n        state.mode = DISTEXT;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case DISTEXT:\\\\\\\\\\\\\\\\n        if (state.extra) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(state.extra);\\\\\\\\\\\\\\\\n          n = state.extra;\\\\\\\\\\\\\\\\n          while (bits < n) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\\\\\\\\\\\\\\\\n          //--- DROPBITS(state.extra) ---//\\\\\\\\\\\\\\\\n          hold >>>= state.extra;\\\\\\\\\\\\\\\\n          bits -= state.extra;\\\\\\\\\\\\\\\\n          //---//\\\\\\\\\\\\\\\\n          state.back += state.extra;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n//#ifdef INFLATE_STRICT\\\\\\\\\\\\\\\\n        if (state.offset > state.dmax) {\\\\\\\\\\\\\\\\n          strm.msg = 'invalid distance too far back';\\\\\\\\\\\\\\\\n          state.mode = BAD;\\\\\\\\\\\\\\\\n          break;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n        //Tracevv((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:         distance %u\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", state.offset));\\\\\\\\\\\\\\\\n        state.mode = MATCH;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case MATCH:\\\\\\\\\\\\\\\\n        if (left === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n        copy = _out - left;\\\\\\\\\\\\\\\\n        if (state.offset > copy) {         /* copy from window */\\\\\\\\\\\\\\\\n          copy = state.offset - copy;\\\\\\\\\\\\\\\\n          if (copy > state.whave) {\\\\\\\\\\\\\\\\n            if (state.sane) {\\\\\\\\\\\\\\\\n              strm.msg = 'invalid distance too far back';\\\\\\\\\\\\\\\\n              state.mode = BAD;\\\\\\\\\\\\\\\\n              break;\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n// (!) This block is disabled in zlib defaults,\\\\\\\\\\\\\\\\n// don't enable it for binary compatibility\\\\\\\\\\\\\\\\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\\\\\\\\\\\\\\\\n//          Trace((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate.c too far\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n//          copy -= state.whave;\\\\\\\\\\\\\\\\n//          if (copy > state.length) { copy = state.length; }\\\\\\\\\\\\\\\\n//          if (copy > left) { copy = left; }\\\\\\\\\\\\\\\\n//          left -= copy;\\\\\\\\\\\\\\\\n//          state.length -= copy;\\\\\\\\\\\\\\\\n//          do {\\\\\\\\\\\\\\\\n//            output[put++] = 0;\\\\\\\\\\\\\\\\n//          } while (--copy);\\\\\\\\\\\\\\\\n//          if (state.length === 0) { state.mode = LEN; }\\\\\\\\\\\\\\\\n//          break;\\\\\\\\\\\\\\\\n//#endif\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (copy > state.wnext) {\\\\\\\\\\\\\\\\n            copy -= state.wnext;\\\\\\\\\\\\\\\\n            from = state.wsize - copy;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          else {\\\\\\\\\\\\\\\\n            from = state.wnext - copy;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          if (copy > state.length) { copy = state.length; }\\\\\\\\\\\\\\\\n          from_source = state.window;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else {                              /* copy from output */\\\\\\\\\\\\\\\\n          from_source = output;\\\\\\\\\\\\\\\\n          from = put - state.offset;\\\\\\\\\\\\\\\\n          copy = state.length;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        if (copy > left) { copy = left; }\\\\\\\\\\\\\\\\n        left -= copy;\\\\\\\\\\\\\\\\n        state.length -= copy;\\\\\\\\\\\\\\\\n        do {\\\\\\\\\\\\\\\\n          output[put++] = from_source[from++];\\\\\\\\\\\\\\\\n        } while (--copy);\\\\\\\\\\\\\\\\n        if (state.length === 0) { state.mode = LEN; }\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case LIT:\\\\\\\\\\\\\\\\n        if (left === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n        output[put++] = state.length;\\\\\\\\\\\\\\\\n        left--;\\\\\\\\\\\\\\\\n        state.mode = LEN;\\\\\\\\\\\\\\\\n        break;\\\\\\\\\\\\\\\\n      case CHECK:\\\\\\\\\\\\\\\\n        if (state.wrap) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(32);\\\\\\\\\\\\\\\\n          while (bits < 32) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            // Use '|' instead of '+' to make sure that result is signed\\\\\\\\\\\\\\\\n            hold |= input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          _out -= left;\\\\\\\\\\\\\\\\n          strm.total_out += _out;\\\\\\\\\\\\\\\\n          state.total += _out;\\\\\\\\\\\\\\\\n          if (_out) {\\\\\\\\\\\\\\\\n            strm.adler = state.check =\\\\\\\\\\\\\\\\n                /*UPDATE(state.check, put - _out, _out);*/\\\\\\\\\\\\\\\\n                (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          _out = left;\\\\\\\\\\\\\\\\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\\\\\\\\\\\\\\\\n          if ((state.flags ? hold : zswap32(hold)) !== state.check) {\\\\\\\\\\\\\\\\n            strm.msg = 'incorrect data check';\\\\\\\\\\\\\\\\n            state.mode = BAD;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //=== INITBITS();\\\\\\\\\\\\\\\\n          hold = 0;\\\\\\\\\\\\\\\\n          bits = 0;\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:   check matches trailer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.mode = LENGTH;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case LENGTH:\\\\\\\\\\\\\\\\n        if (state.wrap && state.flags) {\\\\\\\\\\\\\\\\n          //=== NEEDBITS(32);\\\\\\\\\\\\\\\\n          while (bits < 32) {\\\\\\\\\\\\\\\\n            if (have === 0) { break inf_leave; }\\\\\\\\\\\\\\\\n            have--;\\\\\\\\\\\\\\\\n            hold += input[next++] << bits;\\\\\\\\\\\\\\\\n            bits += 8;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          if (hold !== (state.total & 0xffffffff)) {\\\\\\\\\\\\\\\\n            strm.msg = 'incorrect length check';\\\\\\\\\\\\\\\\n            state.mode = BAD;\\\\\\\\\\\\\\\\n            break;\\\\\\\\\\\\\\\\n          }\\\\\\\\\\\\\\\\n          //=== INITBITS();\\\\\\\\\\\\\\\\n          hold = 0;\\\\\\\\\\\\\\\\n          bits = 0;\\\\\\\\\\\\\\\\n          //===//\\\\\\\\\\\\\\\\n          //Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:   length matches trailer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        state.mode = DONE;\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      case DONE:\\\\\\\\\\\\\\\\n        ret = Z_STREAM_END;\\\\\\\\\\\\\\\\n        break inf_leave;\\\\\\\\\\\\\\\\n      case BAD:\\\\\\\\\\\\\\\\n        ret = Z_DATA_ERROR;\\\\\\\\\\\\\\\\n        break inf_leave;\\\\\\\\\\\\\\\\n      case MEM:\\\\\\\\\\\\\\\\n        return Z_MEM_ERROR;\\\\\\\\\\\\\\\\n      case SYNC:\\\\\\\\\\\\\\\\n        /* falls through */\\\\\\\\\\\\\\\\n      default:\\\\\\\\\\\\\\\\n        return Z_STREAM_ERROR;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  // inf_leave <- here is real place for \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"goto inf_leave\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", emulated via \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"break inf_leave\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /*\\\\\\\\\\\\\\\\n     Return from inflate(), updating the total counts and the check value.\\\\\\\\\\\\\\\\n     If there was no progress during the inflate() call, return a buffer\\\\\\\\\\\\\\\\n     error.  Call updatewindow() to create and/or update the window state.\\\\\\\\\\\\\\\\n     Note: a memory error from inflate() is non-recoverable.\\\\\\\\\\\\\\\\n   */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  //--- RESTORE() ---\\\\\\\\\\\\\\\\n  strm.next_out = put;\\\\\\\\\\\\\\\\n  strm.avail_out = left;\\\\\\\\\\\\\\\\n  strm.next_in = next;\\\\\\\\\\\\\\\\n  strm.avail_in = have;\\\\\\\\\\\\\\\\n  state.hold = hold;\\\\\\\\\\\\\\\\n  state.bits = bits;\\\\\\\\\\\\\\\\n  //---\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\\\\\\\\\\\\\\\\n                      (state.mode < CHECK || flush !== Z_FINISH))) {\\\\\\\\\\\\\\\\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\\\\\\\\\\\\\\\\n      state.mode = MEM;\\\\\\\\\\\\\\\\n      return Z_MEM_ERROR;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  _in -= strm.avail_in;\\\\\\\\\\\\\\\\n  _out -= strm.avail_out;\\\\\\\\\\\\\\\\n  strm.total_in += _in;\\\\\\\\\\\\\\\\n  strm.total_out += _out;\\\\\\\\\\\\\\\\n  state.total += _out;\\\\\\\\\\\\\\\\n  if (state.wrap && _out) {\\\\\\\\\\\\\\\\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\\\\\\\\\\\\\\\\n      (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\\\\\\\\\\\\\\\\n                    (state.mode === TYPE ? 128 : 0) +\\\\\\\\\\\\\\\\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\\\\\\\\\\\\\\\\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\\\\\\\\\\\\\\\\n    ret = Z_BUF_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  return ret;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateEnd(strm) {\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\\\\\\\\\\\\\\\\n    return Z_STREAM_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var state = strm.state;\\\\\\\\\\\\\\\\n  if (state.window) {\\\\\\\\\\\\\\\\n    state.window = null;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  strm.state = null;\\\\\\\\\\\\\\\\n  return Z_OK;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateGetHeader(strm, head) {\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* check state */\\\\\\\\\\\\\\\\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* save header structure */\\\\\\\\\\\\\\\\n  state.head = head;\\\\\\\\\\\\\\\\n  head.done = false;\\\\\\\\\\\\\\\\n  return Z_OK;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction inflateSetDictionary(strm, dictionary) {\\\\\\\\\\\\\\\\n  var dictLength = dictionary.length;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var state;\\\\\\\\\\\\\\\\n  var dictid;\\\\\\\\\\\\\\\\n  var ret;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* check state */\\\\\\\\\\\\\\\\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\\\\\\\\\\\\\\\\n  state = strm.state;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  if (state.wrap !== 0 && state.mode !== DICT) {\\\\\\\\\\\\\\\\n    return Z_STREAM_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* check for correct dictionary identifier */\\\\\\\\\\\\\\\\n  if (state.mode === DICT) {\\\\\\\\\\\\\\\\n    dictid = 1; /* adler32(0, null, 0)*/\\\\\\\\\\\\\\\\n    /* dictid = adler32(dictid, dictionary, dictLength); */\\\\\\\\\\\\\\\\n    dictid = adler32(dictid, dictionary, dictLength, 0);\\\\\\\\\\\\\\\\n    if (dictid !== state.check) {\\\\\\\\\\\\\\\\n      return Z_DATA_ERROR;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  /* copy dictionary to window using updatewindow(), which will amend the\\\\\\\\\\\\\\\\n   existing dictionary if appropriate */\\\\\\\\\\\\\\\\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\\\\\\\\\\\\\\\\n  if (ret) {\\\\\\\\\\\\\\\\n    state.mode = MEM;\\\\\\\\\\\\\\\\n    return Z_MEM_ERROR;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  state.havedict = 1;\\\\\\\\\\\\\\\\n  // Tracev((stderr, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"inflate:   dictionary set\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\n  return Z_OK;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nexports.inflateReset = inflateReset;\\\\\\\\\\\\\\\\nexports.inflateReset2 = inflateReset2;\\\\\\\\\\\\\\\\nexports.inflateResetKeep = inflateResetKeep;\\\\\\\\\\\\\\\\nexports.inflateInit = inflateInit;\\\\\\\\\\\\\\\\nexports.inflateInit2 = inflateInit2;\\\\\\\\\\\\\\\\nexports.inflate = inflate;\\\\\\\\\\\\\\\\nexports.inflateEnd = inflateEnd;\\\\\\\\\\\\\\\\nexports.inflateGetHeader = inflateGetHeader;\\\\\\\\\\\\\\\\nexports.inflateSetDictionary = inflateSetDictionary;\\\\\\\\\\\\\\\\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n/* Not implemented\\\\\\\\\\\\\\\\nexports.inflateCopy = inflateCopy;\\\\\\\\\\\\\\\\nexports.inflateGetDictionary = inflateGetDictionary;\\\\\\\\\\\\\\\\nexports.inflateMark = inflateMark;\\\\\\\\\\\\\\\\nexports.inflatePrime = inflatePrime;\\\\\\\\\\\\\\\\nexports.inflateSync = inflateSync;\\\\\\\\\\\\\\\\nexports.inflateSyncPoint = inflateSyncPoint;\\\\\\\\\\\\\\\\nexports.inflateUndermine = inflateUndermine;\\\\\\\\\\\\\\\\n*/\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/inflate.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/inftrees.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/inftrees.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar utils = __webpack_require__(/*! ../utils/common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/pako/lib/utils/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar MAXBITS = 15;\\\\\\\\\\\\\\\\nvar ENOUGH_LENS = 852;\\\\\\\\\\\\\\\\nvar ENOUGH_DISTS = 592;\\\\\\\\\\\\\\\\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar CODES = 0;\\\\\\\\\\\\\\\\nvar LENS = 1;\\\\\\\\\\\\\\\\nvar DISTS = 2;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar lbase = [ /* Length codes 257..285 base */\\\\\\\\\\\\\\\\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\\\\\\\\\\\\\\\\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\\\\\\\\\\\\\\\\n];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar lext = [ /* Length codes 257..285 extra */\\\\\\\\\\\\\\\\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\\\\\\\\\\\\\\\\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\\\\\\\\\\\\\\\\n];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar dbase = [ /* Distance codes 0..29 base */\\\\\\\\\\\\\\\\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\\\\\\\\\\\\\\\\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\\\\\\\\\\\\\\\\n  8193, 12289, 16385, 24577, 0, 0\\\\\\\\\\\\\\\\n];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar dext = [ /* Distance codes 0..29 extra */\\\\\\\\\\\\\\\\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\\\\\\\\\\\\\\\\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\\\\\\\\\\\\\\\\n  28, 28, 29, 29, 64, 64\\\\\\\\\\\\\\\\n];\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\\\\\\\\\\\\\\\\n{\\\\\\\\\\\\\\\\n  var bits = opts.bits;\\\\\\\\\\\\\\\\n      //here = opts.here; /* table entry for duplication */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var len = 0;               /* a code's length in bits */\\\\\\\\\\\\\\\\n  var sym = 0;               /* index of code symbols */\\\\\\\\\\\\\\\\n  var min = 0, max = 0;          /* minimum and maximum code lengths */\\\\\\\\\\\\\\\\n  var root = 0;              /* number of index bits for root table */\\\\\\\\\\\\\\\\n  var curr = 0;              /* number of index bits for current table */\\\\\\\\\\\\\\\\n  var drop = 0;              /* code bits to drop for sub-table */\\\\\\\\\\\\\\\\n  var left = 0;                   /* number of prefix codes available */\\\\\\\\\\\\\\\\n  var used = 0;              /* code entries in table used */\\\\\\\\\\\\\\\\n  var huff = 0;              /* Huffman code */\\\\\\\\\\\\\\\\n  var incr;              /* for incrementing code, index */\\\\\\\\\\\\\\\\n  var fill;              /* index for replicating entries */\\\\\\\\\\\\\\\\n  var low;               /* low bits for current root entry */\\\\\\\\\\\\\\\\n  var mask;              /* mask for low root bits */\\\\\\\\\\\\\\\\n  var next;             /* next available space in table */\\\\\\\\\\\\\\\\n  var base = null;     /* base value table to use */\\\\\\\\\\\\\\\\n  var base_index = 0;\\\\\\\\\\\\\\\\n//  var shoextra;    /* extra bits table to use */\\\\\\\\\\\\\\\\n  var end;                    /* use base and extra for symbol > end */\\\\\\\\\\\\\\\\n  var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\\\\\\\\\\\\\\\\n  var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\\\\\\\\\\\\\\\\n  var extra = null;\\\\\\\\\\\\\\\\n  var extra_index = 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  var here_bits, here_op, here_val;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /*\\\\\\\\\\\\\\\\n   Process a set of code lengths to create a canonical Huffman code.  The\\\\\\\\\\\\\\\\n   code lengths are lens[0..codes-1].  Each length corresponds to the\\\\\\\\\\\\\\\\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\\\\\\\\\\\\\\\\n   symbols by length from short to long, and retaining the symbol order\\\\\\\\\\\\\\\\n   for codes with equal lengths.  Then the code starts with all zero bits\\\\\\\\\\\\\\\\n   for the first code of the shortest length, and the codes are integer\\\\\\\\\\\\\\\\n   increments for the same length, and zeros are appended as the length\\\\\\\\\\\\\\\\n   increases.  For the deflate format, these bits are stored backwards\\\\\\\\\\\\\\\\n   from their more natural integer increment ordering, and so when the\\\\\\\\\\\\\\\\n   decoding tables are built in the large loop below, the integer codes\\\\\\\\\\\\\\\\n   are incremented backwards.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   This routine assumes, but does not check, that all of the entries in\\\\\\\\\\\\\\\\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\\\\\\\\\\\\\\\\n   1..MAXBITS is interpreted as that code length.  zero means that that\\\\\\\\\\\\\\\\n   symbol does not occur in this code.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   The codes are sorted by computing a count of codes for each length,\\\\\\\\\\\\\\\\n   creating from that a table of starting indices for each length in the\\\\\\\\\\\\\\\\n   sorted table, and then entering the symbols in order in the sorted\\\\\\\\\\\\\\\\n   table.  The sorted table is work[], with that space being provided by\\\\\\\\\\\\\\\\n   the caller.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   The length counts are used for other purposes as well, i.e. finding\\\\\\\\\\\\\\\\n   the minimum and maximum length codes, determining if there are any\\\\\\\\\\\\\\\\n   codes at all, checking for a valid set of lengths, and looking ahead\\\\\\\\\\\\\\\\n   at length counts to determine sub-table sizes when building the\\\\\\\\\\\\\\\\n   decoding tables.\\\\\\\\\\\\\\\\n   */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\\\\\\\\\\\\\\\\n  for (len = 0; len <= MAXBITS; len++) {\\\\\\\\\\\\\\\\n    count[len] = 0;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  for (sym = 0; sym < codes; sym++) {\\\\\\\\\\\\\\\\n    count[lens[lens_index + sym]]++;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* bound code lengths, force root to be within code lengths */\\\\\\\\\\\\\\\\n  root = bits;\\\\\\\\\\\\\\\\n  for (max = MAXBITS; max >= 1; max--) {\\\\\\\\\\\\\\\\n    if (count[max] !== 0) { break; }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (root > max) {\\\\\\\\\\\\\\\\n    root = max;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (max === 0) {                     /* no symbols to code at all */\\\\\\\\\\\\\\\\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\\\\\\\\\\\\\\\\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\\\\\\\\\\\\\\\\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\\\\\\\\\\\\\\\\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    //table.op[opts.table_index] = 64;\\\\\\\\\\\\\\\\n    //table.bits[opts.table_index] = 1;\\\\\\\\\\\\\\\\n    //table.val[opts.table_index++] = 0;\\\\\\\\\\\\\\\\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    opts.bits = 1;\\\\\\\\\\\\\\\\n    return 0;     /* no symbols, but wait for decoding to report error */\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  for (min = 1; min < max; min++) {\\\\\\\\\\\\\\\\n    if (count[min] !== 0) { break; }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (root < min) {\\\\\\\\\\\\\\\\n    root = min;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* check for an over-subscribed or incomplete set of lengths */\\\\\\\\\\\\\\\\n  left = 1;\\\\\\\\\\\\\\\\n  for (len = 1; len <= MAXBITS; len++) {\\\\\\\\\\\\\\\\n    left <<= 1;\\\\\\\\\\\\\\\\n    left -= count[len];\\\\\\\\\\\\\\\\n    if (left < 0) {\\\\\\\\\\\\\\\\n      return -1;\\\\\\\\\\\\\\\\n    }        /* over-subscribed */\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n  if (left > 0 && (type === CODES || max !== 1)) {\\\\\\\\\\\\\\\\n    return -1;                      /* incomplete set */\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* generate offsets into symbol table for each length for sorting */\\\\\\\\\\\\\\\\n  offs[1] = 0;\\\\\\\\\\\\\\\\n  for (len = 1; len < MAXBITS; len++) {\\\\\\\\\\\\\\\\n    offs[len + 1] = offs[len] + count[len];\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* sort symbols by length, by symbol order within each length */\\\\\\\\\\\\\\\\n  for (sym = 0; sym < codes; sym++) {\\\\\\\\\\\\\\\\n    if (lens[lens_index + sym] !== 0) {\\\\\\\\\\\\\\\\n      work[offs[lens[lens_index + sym]]++] = sym;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /*\\\\\\\\\\\\\\\\n   Create and fill in decoding tables.  In this loop, the table being\\\\\\\\\\\\\\\\n   filled is at next and has curr index bits.  The code being used is huff\\\\\\\\\\\\\\\\n   with length len.  That code is converted to an index by dropping drop\\\\\\\\\\\\\\\\n   bits off of the bottom.  For codes where len is less than drop + curr,\\\\\\\\\\\\\\\\n   those top drop + curr - len bits are incremented through all values to\\\\\\\\\\\\\\\\n   fill the table with replicated entries.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   root is the number of index bits for the root table.  When len exceeds\\\\\\\\\\\\\\\\n   root, sub-tables are created pointed to by the root entry with an index\\\\\\\\\\\\\\\\n   of the low root bits of huff.  This is saved in low to check for when a\\\\\\\\\\\\\\\\n   new sub-table should be started.  drop is zero when the root table is\\\\\\\\\\\\\\\\n   being filled, and drop is root when sub-tables are being filled.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   When a new sub-table is needed, it is necessary to look ahead in the\\\\\\\\\\\\\\\\n   code lengths to determine what size sub-table is needed.  The length\\\\\\\\\\\\\\\\n   counts are used for this, and so count[] is decremented as codes are\\\\\\\\\\\\\\\\n   entered in the tables.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   used keeps track of how many table entries have been allocated from the\\\\\\\\\\\\\\\\n   provided *table space.  It is checked for LENS and DIST tables against\\\\\\\\\\\\\\\\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\\\\\\\\\\\\\\\\n   the initial root table size constants.  See the comments in inftrees.h\\\\\\\\\\\\\\\\n   for more information.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n   sym increments through all symbols, and the loop terminates when\\\\\\\\\\\\\\\\n   all codes of length max, i.e. all codes, have been processed.  This\\\\\\\\\\\\\\\\n   routine permits incomplete codes, so another loop after this one fills\\\\\\\\\\\\\\\\n   in the rest of the decoding tables with invalid code markers.\\\\\\\\\\\\\\\\n   */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* set up for code type */\\\\\\\\\\\\\\\\n  // poor man optimization - use if-else instead of switch,\\\\\\\\\\\\\\\\n  // to avoid deopts in old v8\\\\\\\\\\\\\\\\n  if (type === CODES) {\\\\\\\\\\\\\\\\n    base = extra = work;    /* dummy value--not used */\\\\\\\\\\\\\\\\n    end = 19;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  } else if (type === LENS) {\\\\\\\\\\\\\\\\n    base = lbase;\\\\\\\\\\\\\\\\n    base_index -= 257;\\\\\\\\\\\\\\\\n    extra = lext;\\\\\\\\\\\\\\\\n    extra_index -= 257;\\\\\\\\\\\\\\\\n    end = 256;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  } else {                    /* DISTS */\\\\\\\\\\\\\\\\n    base = dbase;\\\\\\\\\\\\\\\\n    extra = dext;\\\\\\\\\\\\\\\\n    end = -1;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* initialize opts for loop */\\\\\\\\\\\\\\\\n  huff = 0;                   /* starting code */\\\\\\\\\\\\\\\\n  sym = 0;                    /* starting code symbol */\\\\\\\\\\\\\\\\n  len = min;                  /* starting code length */\\\\\\\\\\\\\\\\n  next = table_index;              /* current table to fill in */\\\\\\\\\\\\\\\\n  curr = root;                /* current table index bits */\\\\\\\\\\\\\\\\n  drop = 0;                   /* current bits to drop from code for index */\\\\\\\\\\\\\\\\n  low = -1;                   /* trigger new sub-table when len > root */\\\\\\\\\\\\\\\\n  used = 1 << root;          /* use root table entries */\\\\\\\\\\\\\\\\n  mask = used - 1;            /* mask for comparing low */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* check available table space */\\\\\\\\\\\\\\\\n  if ((type === LENS && used > ENOUGH_LENS) ||\\\\\\\\\\\\\\\\n    (type === DISTS && used > ENOUGH_DISTS)) {\\\\\\\\\\\\\\\\n    return 1;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* process all codes and make table entries */\\\\\\\\\\\\\\\\n  for (;;) {\\\\\\\\\\\\\\\\n    /* create table entry */\\\\\\\\\\\\\\\\n    here_bits = len - drop;\\\\\\\\\\\\\\\\n    if (work[sym] < end) {\\\\\\\\\\\\\\\\n      here_op = 0;\\\\\\\\\\\\\\\\n      here_val = work[sym];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    else if (work[sym] > end) {\\\\\\\\\\\\\\\\n      here_op = extra[extra_index + work[sym]];\\\\\\\\\\\\\\\\n      here_val = base[base_index + work[sym]];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    else {\\\\\\\\\\\\\\\\n      here_op = 32 + 64;         /* end of block */\\\\\\\\\\\\\\\\n      here_val = 0;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* replicate for those indices with low len bits equal to huff */\\\\\\\\\\\\\\\\n    incr = 1 << (len - drop);\\\\\\\\\\\\\\\\n    fill = 1 << curr;\\\\\\\\\\\\\\\\n    min = fill;                 /* save offset to next table */\\\\\\\\\\\\\\\\n    do {\\\\\\\\\\\\\\\\n      fill -= incr;\\\\\\\\\\\\\\\\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\\\\\\\\\\\\\\\\n    } while (fill !== 0);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* backwards increment the len-bit code huff */\\\\\\\\\\\\\\\\n    incr = 1 << (len - 1);\\\\\\\\\\\\\\\\n    while (huff & incr) {\\\\\\\\\\\\\\\\n      incr >>= 1;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (incr !== 0) {\\\\\\\\\\\\\\\\n      huff &= incr - 1;\\\\\\\\\\\\\\\\n      huff += incr;\\\\\\\\\\\\\\\\n    } else {\\\\\\\\\\\\\\\\n      huff = 0;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* go to next symbol, update count, len */\\\\\\\\\\\\\\\\n    sym++;\\\\\\\\\\\\\\\\n    if (--count[len] === 0) {\\\\\\\\\\\\\\\\n      if (len === max) { break; }\\\\\\\\\\\\\\\\n      len = lens[lens_index + work[sym]];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    /* create new sub-table if needed */\\\\\\\\\\\\\\\\n    if (len > root && (huff & mask) !== low) {\\\\\\\\\\\\\\\\n      /* if first time, transition to sub-tables */\\\\\\\\\\\\\\\\n      if (drop === 0) {\\\\\\\\\\\\\\\\n        drop = root;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      /* increment past last table */\\\\\\\\\\\\\\\\n      next += min;            /* here min is 1 << curr */\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      /* determine length of next table */\\\\\\\\\\\\\\\\n      curr = len - drop;\\\\\\\\\\\\\\\\n      left = 1 << curr;\\\\\\\\\\\\\\\\n      while (curr + drop < max) {\\\\\\\\\\\\\\\\n        left -= count[curr + drop];\\\\\\\\\\\\\\\\n        if (left <= 0) { break; }\\\\\\\\\\\\\\\\n        curr++;\\\\\\\\\\\\\\\\n        left <<= 1;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      /* check for enough space */\\\\\\\\\\\\\\\\n      used += 1 << curr;\\\\\\\\\\\\\\\\n      if ((type === LENS && used > ENOUGH_LENS) ||\\\\\\\\\\\\\\\\n        (type === DISTS && used > ENOUGH_DISTS)) {\\\\\\\\\\\\\\\\n        return 1;\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      /* point entry in root table to sub-table */\\\\\\\\\\\\\\\\n      low = huff & mask;\\\\\\\\\\\\\\\\n      /*table.op[low] = curr;\\\\\\\\\\\\\\\\n      table.bits[low] = root;\\\\\\\\\\\\\\\\n      table.val[low] = next - opts.table_index;*/\\\\\\\\\\\\\\\\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\\\\\\\\\\\\\\\\n   at most one remaining entry, since if the code is incomplete, the\\\\\\\\\\\\\\\\n   maximum code length that was allowed to get this far is one bit) */\\\\\\\\\\\\\\\\n  if (huff !== 0) {\\\\\\\\\\\\\\\\n    //table.op[next + huff] = 64;            /* invalid code marker */\\\\\\\\\\\\\\\\n    //table.bits[next + huff] = len - drop;\\\\\\\\\\\\\\\\n    //table.val[next + huff] = 0;\\\\\\\\\\\\\\\\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n  /* set return parameters */\\\\\\\\\\\\\\\\n  //opts.table_index += used;\\\\\\\\\\\\\\\\n  opts.bits = root;\\\\\\\\\\\\\\\\n  return 0;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/inftrees.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/messages.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/messages.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = {\\\\\\\\\\\\\\\\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\\\\\\\\\\\\\\\\n  1:      'stream end',          /* Z_STREAM_END      1  */\\\\\\\\\\\\\\\\n  0:      '',                    /* Z_OK              0  */\\\\\\\\\\\\\\\\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\\\\\\\\\\\\\\\\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\\\\\\\\\\\\\\\\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\\\\\\\\\\\\\\\\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\\\\\\\\\\\\\\\\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\\\\\\\\\\\\\\\\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/messages.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/pako/lib/zlib/zstream.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/pako/lib/zlib/zstream.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\\\\\\\\\\\\\\\\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// This software is provided 'as-is', without any express or implied\\\\\\\\\\\\\\\\n// warranty. In no event will the authors be held liable for any damages\\\\\\\\\\\\\\\\n// arising from the use of this software.\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// Permission is granted to anyone to use this software for any purpose,\\\\\\\\\\\\\\\\n// including commercial applications, and to alter it and redistribute it\\\\\\\\\\\\\\\\n// freely, subject to the following restrictions:\\\\\\\\\\\\\\\\n//\\\\\\\\\\\\\\\\n// 1. The origin of this software must not be misrepresented; you must not\\\\\\\\\\\\\\\\n//   claim that you wrote the original software. If you use this software\\\\\\\\\\\\\\\\n//   in a product, an acknowledgment in the product documentation would be\\\\\\\\\\\\\\\\n//   appreciated but is not required.\\\\\\\\\\\\\\\\n// 2. Altered source versions must be plainly marked as such, and must not be\\\\\\\\\\\\\\\\n//   misrepresented as being the original software.\\\\\\\\\\\\\\\\n// 3. This notice may not be removed or altered from any source distribution.\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nfunction ZStream() {\\\\\\\\\\\\\\\\n  /* next input byte */\\\\\\\\\\\\\\\\n  this.input = null; // JS specific, because we have no pointers\\\\\\\\\\\\\\\\n  this.next_in = 0;\\\\\\\\\\\\\\\\n  /* number of bytes available at input */\\\\\\\\\\\\\\\\n  this.avail_in = 0;\\\\\\\\\\\\\\\\n  /* total number of input bytes read so far */\\\\\\\\\\\\\\\\n  this.total_in = 0;\\\\\\\\\\\\\\\\n  /* next output byte should be put there */\\\\\\\\\\\\\\\\n  this.output = null; // JS specific, because we have no pointers\\\\\\\\\\\\\\\\n  this.next_out = 0;\\\\\\\\\\\\\\\\n  /* remaining free space at output */\\\\\\\\\\\\\\\\n  this.avail_out = 0;\\\\\\\\\\\\\\\\n  /* total number of bytes output so far */\\\\\\\\\\\\\\\\n  this.total_out = 0;\\\\\\\\\\\\\\\\n  /* last error message, NULL if no error */\\\\\\\\\\\\\\\\n  this.msg = ''/*Z_NULL*/;\\\\\\\\\\\\\\\\n  /* not visible by applications */\\\\\\\\\\\\\\\\n  this.state = null;\\\\\\\\\\\\\\\\n  /* best guess about the data type: binary or text */\\\\\\\\\\\\\\\\n  this.data_type = 2/*Z_UNKNOWN*/;\\\\\\\\\\\\\\\\n  /* adler32 value of the uncompressed data */\\\\\\\\\\\\\\\\n  this.adler = 0;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = ZStream;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/pako/lib/zlib/zstream.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/common.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/common.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.serialize = exports.deserialize = exports.registerSerializer = void 0;\\\\\\\\\\\\\\\\nconst serializers_1 = __webpack_require__(/*! ./serializers */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/serializers.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nlet registeredSerializer = serializers_1.DefaultSerializer;\\\\\\\\\\\\\\\\nfunction registerSerializer(serializer) {\\\\\\\\\\\\\\\\n    registeredSerializer = serializers_1.extendSerializer(registeredSerializer, serializer);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.registerSerializer = registerSerializer;\\\\\\\\\\\\\\\\nfunction deserialize(message) {\\\\\\\\\\\\\\\\n    return registeredSerializer.deserialize(message);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.deserialize = deserialize;\\\\\\\\\\\\\\\\nfunction serialize(input) {\\\\\\\\\\\\\\\\n    return registeredSerializer.serialize(input);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.serialize = serialize;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/common.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/serializers.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!**************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/serializers.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\**************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.DefaultSerializer = exports.extendSerializer = void 0;\\\\\\\\\\\\\\\\nfunction extendSerializer(extend, implementation) {\\\\\\\\\\\\\\\\n    const fallbackDeserializer = extend.deserialize.bind(extend);\\\\\\\\\\\\\\\\n    const fallbackSerializer = extend.serialize.bind(extend);\\\\\\\\\\\\\\\\n    return {\\\\\\\\\\\\\\\\n        deserialize(message) {\\\\\\\\\\\\\\\\n            return implementation.deserialize(message, fallbackDeserializer);\\\\\\\\\\\\\\\\n        },\\\\\\\\\\\\\\\\n        serialize(input) {\\\\\\\\\\\\\\\\n            return implementation.serialize(input, fallbackSerializer);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.extendSerializer = extendSerializer;\\\\\\\\\\\\\\\\nconst DefaultErrorSerializer = {\\\\\\\\\\\\\\\\n    deserialize(message) {\\\\\\\\\\\\\\\\n        return Object.assign(Error(message.message), {\\\\\\\\\\\\\\\\n            name: message.name,\\\\\\\\\\\\\\\\n            stack: message.stack\\\\\\\\\\\\\\\\n        });\\\\\\\\\\\\\\\\n    },\\\\\\\\\\\\\\\\n    serialize(error) {\\\\\\\\\\\\\\\\n        return {\\\\\\\\\\\\\\\\n            __error_marker: \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"$$error\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n            message: error.message,\\\\\\\\\\\\\\\\n            name: error.name,\\\\\\\\\\\\\\\\n            stack: error.stack\\\\\\\\\\\\\\\\n        };\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nconst isSerializedError = (thing) => thing && typeof thing === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__error_marker\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" in thing && thing.__error_marker === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"$$error\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\nexports.DefaultSerializer = {\\\\\\\\\\\\\\\\n    deserialize(message) {\\\\\\\\\\\\\\\\n        if (isSerializedError(message)) {\\\\\\\\\\\\\\\\n            return DefaultErrorSerializer.deserialize(message);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else {\\\\\\\\\\\\\\\\n            return message;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    },\\\\\\\\\\\\\\\\n    serialize(input) {\\\\\\\\\\\\\\\\n        if (input instanceof Error) {\\\\\\\\\\\\\\\\n            return DefaultErrorSerializer.serialize(input);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else {\\\\\\\\\\\\\\\\n            return input;\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/serializers.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/symbols.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!**********************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/symbols.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\**********************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.$worker = exports.$transferable = exports.$terminate = exports.$events = exports.$errors = void 0;\\\\\\\\\\\\\\\\nexports.$errors = Symbol(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"thread.errors\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nexports.$events = Symbol(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"thread.events\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nexports.$terminate = Symbol(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"thread.terminate\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nexports.$transferable = Symbol(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"thread.transferable\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nexports.$worker = Symbol(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"thread.worker\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/symbols.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/transferable.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/transferable.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.Transfer = exports.isTransferDescriptor = void 0;\\\\\\\\\\\\\\\\nconst symbols_1 = __webpack_require__(/*! ./symbols */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/symbols.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nfunction isTransferable(thing) {\\\\\\\\\\\\\\\\n    if (!thing || typeof thing !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\")\\\\\\\\\\\\\\\\n        return false;\\\\\\\\\\\\\\\\n    // Don't check too thoroughly, since the list of transferable things in JS might grow over time\\\\\\\\\\\\\\\\n    return true;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction isTransferDescriptor(thing) {\\\\\\\\\\\\\\\\n    return thing && typeof thing === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && thing[symbols_1.$transferable];\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.isTransferDescriptor = isTransferDescriptor;\\\\\\\\\\\\\\\\nfunction Transfer(payload, transferables) {\\\\\\\\\\\\\\\\n    if (!transferables) {\\\\\\\\\\\\\\\\n        if (!isTransferable(payload))\\\\\\\\\\\\\\\\n            throw Error();\\\\\\\\\\\\\\\\n        transferables = [payload];\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return {\\\\\\\\\\\\\\\\n        [symbols_1.$transferable]: true,\\\\\\\\\\\\\\\\n        send: payload,\\\\\\\\\\\\\\\\n        transferables\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.Transfer = Transfer;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/transferable.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/types/messages.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/types/messages.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.WorkerMessageType = exports.MasterMessageType = void 0;\\\\\\\\\\\\\\\\n/////////////////////////////\\\\\\\\\\\\\\\\n// Messages sent by master:\\\\\\\\\\\\\\\\nvar MasterMessageType;\\\\\\\\\\\\\\\\n(function (MasterMessageType) {\\\\\\\\\\\\\\\\n    MasterMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"cancel\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"cancel\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n    MasterMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"run\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"run\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n})(MasterMessageType = exports.MasterMessageType || (exports.MasterMessageType = {}));\\\\\\\\\\\\\\\\n////////////////////////////\\\\\\\\\\\\\\\\n// Messages sent by worker:\\\\\\\\\\\\\\\\nvar WorkerMessageType;\\\\\\\\\\\\\\\\n(function (WorkerMessageType) {\\\\\\\\\\\\\\\\n    WorkerMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"error\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"error\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n    WorkerMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"init\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"init\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n    WorkerMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"result\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"result\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n    WorkerMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"running\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"running\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n    WorkerMessageType[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"uncaughtError\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"] = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"uncaughtError\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n})(WorkerMessageType = exports.WorkerMessageType || (exports.WorkerMessageType = {}));\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/types/messages.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.browser.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!********************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/implementation.browser.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\********************************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n/// <reference lib=\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"dom\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" />\\\\\\\\\\\\\\\\n// tslint:disable no-shadowed-variable\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nconst isWorkerRuntime = function isWorkerRuntime() {\\\\\\\\\\\\\\\\n    const isWindowContext = typeof self !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && typeof Window !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && self instanceof Window;\\\\\\\\\\\\\\\\n    return typeof self !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && self.postMessage && !isWindowContext ? true : false;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nconst postMessageToMaster = function postMessageToMaster(data, transferList) {\\\\\\\\\\\\\\\\n    self.postMessage(data, transferList);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nconst subscribeToMasterMessages = function subscribeToMasterMessages(onMessage) {\\\\\\\\\\\\\\\\n    const messageHandler = (messageEvent) => {\\\\\\\\\\\\\\\\n        onMessage(messageEvent.data);\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    const unsubscribe = () => {\\\\\\\\\\\\\\\\n        self.removeEventListener(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"message\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", messageHandler);\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    self.addEventListener(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"message\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", messageHandler);\\\\\\\\\\\\\\\\n    return unsubscribe;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nexports.default = {\\\\\\\\\\\\\\\\n    isWorkerRuntime,\\\\\\\\\\\\\\\\n    postMessageToMaster,\\\\\\\\\\\\\\\\n    subscribeToMasterMessages\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/implementation.browser.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/implementation.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n// tslint:disable no-var-requires\\\\\\\\\\\\\\\\n/*\\\\\\\\\\\\\\\\n * This file is only a stub to make './implementation' resolve to the right module.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nvar __importDefault = (this && this.__importDefault) || function (mod) {\\\\\\\\\\\\\\\\n    return (mod && mod.__esModule) ? mod : { \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\": mod };\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nconst implementation_browser_1 = __importDefault(__webpack_require__(/*! ./implementation.browser */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.browser.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nconst implementation_tiny_worker_1 = __importDefault(__webpack_require__(/*! ./implementation.tiny-worker */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.tiny-worker.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nconst implementation_worker_threads_1 = __importDefault(__webpack_require__(/*! ./implementation.worker_threads */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.worker_threads.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nconst runningInNode = typeof process !== 'undefined' && process.arch !== 'browser' && 'pid' in process;\\\\\\\\\\\\\\\\nfunction selectNodeImplementation() {\\\\\\\\\\\\\\\\n    try {\\\\\\\\\\\\\\\\n        implementation_worker_threads_1.default.testImplementation();\\\\\\\\\\\\\\\\n        return implementation_worker_threads_1.default;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    catch (error) {\\\\\\\\\\\\\\\\n        return implementation_tiny_worker_1.default;\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.default = runningInNode\\\\\\\\\\\\\\\\n    ? selectNodeImplementation()\\\\\\\\\\\\\\\\n    : implementation_browser_1.default;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/implementation.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.tiny-worker.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!************************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/implementation.tiny-worker.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\************************************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\neval(\\\\\\\\\\\\\\\"module.exports = function() {\\\\\\\\\\\\\\\\n  return __webpack_require__(/*! !./node_modules/worker-loader/dist/workers/InlineWorker.js */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/worker-loader/dist/workers/InlineWorker.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\")(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"/******/ (function(modules) { // webpackBootstrap\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// The module cache\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tvar installedModules = {};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// The require function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tfunction __webpack_require__(moduleId) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Check if module is in cache\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(installedModules[moduleId]) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\treturn installedModules[moduleId].exports;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Create a new module (and put it into the cache)\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tvar module = installedModules[moduleId] = {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ti: moduleId,\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tl: false,\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\texports: {}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Execute the module function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Flag the module as loaded\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tmodule.l = true;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Return the exports of the module\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\treturn module.exports;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// expose the modules object (__webpack_modules__)\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.m = modules;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// expose the module cache\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.c = installedModules;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// define getter function for harmony exports\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.d = function(exports, name, getter) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(!__webpack_require__.o(exports, name)) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// define __esModule on exports\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.r = function(exports) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tObject.defineProperty(exports, '__esModule', { value: true });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// create a fake namespace object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// mode & 1: value is a module id, require it\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// mode & 2: merge all properties of value into the ns\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// mode & 4: return value when already ns object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// mode & 8|1: behave like require\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.t = function(value, mode) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(mode & 1) value = __webpack_require__(value);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(mode & 8) return value;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tvar ns = Object.create(null);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.r(ns);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\treturn ns;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// getDefaultExport function for compatibility with non-harmony modules\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.n = function(module) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tvar getter = module && module.__esModule ?\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tfunction getDefault() { return module['default']; } :\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\tfunction getModuleExports() { return module; };\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.d(getter, 'a', getter);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\treturn getter;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Object.prototype.hasOwnProperty.call\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// __webpack_public_path__\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t__webpack_require__.p = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\t// Load entry module and return exports\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\treturn __webpack_require__(__webpack_require__.s = \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.tiny-worker.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ })\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/************************************************************************/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ ({\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/***/ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.tiny-worker.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\":\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/*!************************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/implementation.tiny-worker.js ***!\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n  \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\************************************************************************/\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/*! no static exports found */\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\neval(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/// <reference lib=\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"dom\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" />\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n// tslint:disable no-shadowed-variable\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nif (typeof self === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\") {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    global.self = global;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nconst isWorkerRuntime = function isWorkerRuntime() {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    return typeof self !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && self.postMessage ? true : false;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nconst postMessageToMaster = function postMessageToMaster(data) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    // TODO: Warn that Transferables are not supported on first attempt to use feature\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    self.postMessage(data);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nlet muxingHandlerSetUp = false;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nconst messageHandlers = new Set();\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nconst subscribeToMasterMessages = function subscribeToMasterMessages(onMessage) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    if (!muxingHandlerSetUp) {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n        // We have one multiplexing message handler as tiny-worker's\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n        // addEventListener() only allows you to set a single message handler\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n        self.addEventListener(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"message\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", ((event) => {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n            messageHandlers.forEach(handler => handler(event.data));\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n        }));\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n        muxingHandlerSetUp = true;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    messageHandlers.add(onMessage);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    const unsubscribe = () => messageHandlers.delete(onMessage);\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    return unsubscribe;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nexports.default = {\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    isWorkerRuntime,\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    postMessageToMaster,\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n    subscribeToMasterMessages\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/implementation.tiny-worker.js?\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/***/ })\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n/******/ });\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", null);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/implementation.tiny-worker.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.worker_threads.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***************************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/implementation.worker_threads.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***************************************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nvar __importDefault = (this && this.__importDefault) || function (mod) {\\\\\\\\\\\\\\\\n    return (mod && mod.__esModule) ? mod : { \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\": mod };\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nconst worker_threads_1 = __importDefault(__webpack_require__(/*! ../worker_threads */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker_threads.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nfunction assertMessagePort(port) {\\\\\\\\\\\\\\\\n    if (!port) {\\\\\\\\\\\\\\\\n        throw Error(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Invariant violation: MessagePort to parent is not available.\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return port;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nconst isWorkerRuntime = function isWorkerRuntime() {\\\\\\\\\\\\\\\\n    return !worker_threads_1.default().isMainThread;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nconst postMessageToMaster = function postMessageToMaster(data, transferList) {\\\\\\\\\\\\\\\\n    assertMessagePort(worker_threads_1.default().parentPort).postMessage(data, transferList);\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nconst subscribeToMasterMessages = function subscribeToMasterMessages(onMessage) {\\\\\\\\\\\\\\\\n    const parentPort = worker_threads_1.default().parentPort;\\\\\\\\\\\\\\\\n    if (!parentPort) {\\\\\\\\\\\\\\\\n        throw Error(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Invariant violation: MessagePort to parent is not available.\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    const messageHandler = (message) => {\\\\\\\\\\\\\\\\n        onMessage(message);\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    const unsubscribe = () => {\\\\\\\\\\\\\\\\n        assertMessagePort(parentPort).off(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"message\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", messageHandler);\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    assertMessagePort(parentPort).on(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"message\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", messageHandler);\\\\\\\\\\\\\\\\n    return unsubscribe;\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nfunction testImplementation() {\\\\\\\\\\\\\\\\n    // Will throw if `worker_threads` are not available\\\\\\\\\\\\\\\\n    worker_threads_1.default();\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.default = {\\\\\\\\\\\\\\\\n    isWorkerRuntime,\\\\\\\\\\\\\\\\n    postMessageToMaster,\\\\\\\\\\\\\\\\n    subscribeToMasterMessages,\\\\\\\\\\\\\\\\n    testImplementation\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/implementation.worker_threads.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/index.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!***************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker/index.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\***************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\nvar __awaiter = (this && this.__awaiter) || function (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};\\\\\\\\\\\\\\\\nvar __importDefault = (this && this.__importDefault) || function (mod) {\\\\\\\\\\\\\\\\n    return (mod && mod.__esModule) ? mod : { \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"default\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\": mod };\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nexports.expose = exports.isWorkerRuntime = exports.Transfer = exports.registerSerializer = void 0;\\\\\\\\\\\\\\\\nconst is_observable_1 = __importDefault(__webpack_require__(/*! is-observable */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/is-observable/index.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nconst common_1 = __webpack_require__(/*! ../common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nconst transferable_1 = __webpack_require__(/*! ../transferable */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/transferable.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nconst messages_1 = __webpack_require__(/*! ../types/messages */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/types/messages.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nconst implementation_1 = __importDefault(__webpack_require__(/*! ./implementation */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/implementation.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"));\\\\\\\\\\\\\\\\nvar common_2 = __webpack_require__(/*! ../common */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/common.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"registerSerializer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { enumerable: true, get: function () { return common_2.registerSerializer; } });\\\\\\\\\\\\\\\\nvar transferable_2 = __webpack_require__(/*! ../transferable */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/transferable.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Transfer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { enumerable: true, get: function () { return transferable_2.Transfer; } });\\\\\\\\\\\\\\\\n/** Returns `true` if this code is currently running in a worker. */\\\\\\\\\\\\\\\\nexports.isWorkerRuntime = implementation_1.default.isWorkerRuntime;\\\\\\\\\\\\\\\\nlet exposeCalled = false;\\\\\\\\\\\\\\\\nconst activeSubscriptions = new Map();\\\\\\\\\\\\\\\\nconst isMasterJobCancelMessage = (thing) => thing && thing.type === messages_1.MasterMessageType.cancel;\\\\\\\\\\\\\\\\nconst isMasterJobRunMessage = (thing) => thing && thing.type === messages_1.MasterMessageType.run;\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * There are issues with `is-observable` not recognizing zen-observable's instances.\\\\\\\\\\\\\\\\n * We are using `observable-fns`, but it's based on zen-observable, too.\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nconst isObservable = (thing) => is_observable_1.default(thing) || isZenObservable(thing);\\\\\\\\\\\\\\\\nfunction isZenObservable(thing) {\\\\\\\\\\\\\\\\n    return thing && typeof thing === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && typeof thing.subscribe === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction deconstructTransfer(thing) {\\\\\\\\\\\\\\\\n    return transferable_1.isTransferDescriptor(thing)\\\\\\\\\\\\\\\\n        ? { payload: thing.send, transferables: thing.transferables }\\\\\\\\\\\\\\\\n        : { payload: thing, transferables: undefined };\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postFunctionInitMessage() {\\\\\\\\\\\\\\\\n    const initMessage = {\\\\\\\\\\\\\\\\n        type: messages_1.WorkerMessageType.init,\\\\\\\\\\\\\\\\n        exposed: {\\\\\\\\\\\\\\\\n            type: \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    implementation_1.default.postMessageToMaster(initMessage);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postModuleInitMessage(methodNames) {\\\\\\\\\\\\\\\\n    const initMessage = {\\\\\\\\\\\\\\\\n        type: messages_1.WorkerMessageType.init,\\\\\\\\\\\\\\\\n        exposed: {\\\\\\\\\\\\\\\\n            type: \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"module\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\",\\\\\\\\\\\\\\\\n            methods: methodNames\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    implementation_1.default.postMessageToMaster(initMessage);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postJobErrorMessage(uid, rawError) {\\\\\\\\\\\\\\\\n    const { payload: error, transferables } = deconstructTransfer(rawError);\\\\\\\\\\\\\\\\n    const errorMessage = {\\\\\\\\\\\\\\\\n        type: messages_1.WorkerMessageType.error,\\\\\\\\\\\\\\\\n        uid,\\\\\\\\\\\\\\\\n        error: common_1.serialize(error)\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    implementation_1.default.postMessageToMaster(errorMessage, transferables);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postJobResultMessage(uid, completed, resultValue) {\\\\\\\\\\\\\\\\n    const { payload, transferables } = deconstructTransfer(resultValue);\\\\\\\\\\\\\\\\n    const resultMessage = {\\\\\\\\\\\\\\\\n        type: messages_1.WorkerMessageType.result,\\\\\\\\\\\\\\\\n        uid,\\\\\\\\\\\\\\\\n        complete: completed ? true : undefined,\\\\\\\\\\\\\\\\n        payload\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    implementation_1.default.postMessageToMaster(resultMessage, transferables);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postJobStartMessage(uid, resultType) {\\\\\\\\\\\\\\\\n    const startMessage = {\\\\\\\\\\\\\\\\n        type: messages_1.WorkerMessageType.running,\\\\\\\\\\\\\\\\n        uid,\\\\\\\\\\\\\\\\n        resultType\\\\\\\\\\\\\\\\n    };\\\\\\\\\\\\\\\\n    implementation_1.default.postMessageToMaster(startMessage);\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction postUncaughtErrorMessage(error) {\\\\\\\\\\\\\\\\n    try {\\\\\\\\\\\\\\\\n        const errorMessage = {\\\\\\\\\\\\\\\\n            type: messages_1.WorkerMessageType.uncaughtError,\\\\\\\\\\\\\\\\n            error: common_1.serialize(error)\\\\\\\\\\\\\\\\n        };\\\\\\\\\\\\\\\\n        implementation_1.default.postMessageToMaster(errorMessage);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    catch (subError) {\\\\\\\\\\\\\\\\n        // tslint:disable-next-line no-console\\\\\\\\\\\\\\\\n        console.error(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Not reporting uncaught error back to master thread as it \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" +\\\\\\\\\\\\\\\\n            \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"occured while reporting an uncaught error already.\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" +\\\\\\\\\\\\\\\\n            \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nLatest error:\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", subError, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\nOriginal error:\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", error);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction runFunction(jobUID, fn, args) {\\\\\\\\\\\\\\\\n    return __awaiter(this, void 0, void 0, function* () {\\\\\\\\\\\\\\\\n        let syncResult;\\\\\\\\\\\\\\\\n        try {\\\\\\\\\\\\\\\\n            syncResult = fn(...args);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        catch (error) {\\\\\\\\\\\\\\\\n            return postJobErrorMessage(jobUID, error);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        const resultType = isObservable(syncResult) ? \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"observable\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" : \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"promise\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\";\\\\\\\\\\\\\\\\n        postJobStartMessage(jobUID, resultType);\\\\\\\\\\\\\\\\n        if (isObservable(syncResult)) {\\\\\\\\\\\\\\\\n            const subscription = syncResult.subscribe(value => postJobResultMessage(jobUID, false, common_1.serialize(value)), error => {\\\\\\\\\\\\\\\\n                postJobErrorMessage(jobUID, common_1.serialize(error));\\\\\\\\\\\\\\\\n                activeSubscriptions.delete(jobUID);\\\\\\\\\\\\\\\\n            }, () => {\\\\\\\\\\\\\\\\n                postJobResultMessage(jobUID, true);\\\\\\\\\\\\\\\\n                activeSubscriptions.delete(jobUID);\\\\\\\\\\\\\\\\n            });\\\\\\\\\\\\\\\\n            activeSubscriptions.set(jobUID, subscription);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n        else {\\\\\\\\\\\\\\\\n            try {\\\\\\\\\\\\\\\\n                const result = yield syncResult;\\\\\\\\\\\\\\\\n                postJobResultMessage(jobUID, true, common_1.serialize(result));\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n            catch (error) {\\\\\\\\\\\\\\\\n                postJobErrorMessage(jobUID, common_1.serialize(error));\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n/**\\\\\\\\\\\\\\\\n * Expose a function or a module (an object whose values are functions)\\\\\\\\\\\\\\\\n * to the main thread. Must be called exactly once in every worker thread\\\\\\\\\\\\\\\\n * to signal its API to the main thread.\\\\\\\\\\\\\\\\n *\\\\\\\\\\\\\\\\n * @param exposed Function or object whose values are functions\\\\\\\\\\\\\\\\n */\\\\\\\\\\\\\\\\nfunction expose(exposed) {\\\\\\\\\\\\\\\\n    if (!implementation_1.default.isWorkerRuntime()) {\\\\\\\\\\\\\\\\n        throw Error(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"expose() called in the master thread.\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    if (exposeCalled) {\\\\\\\\\\\\\\\\n        throw Error(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"expose() called more than once. This is not possible. Pass an object to expose() if you want to expose multiple functions.\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    exposeCalled = true;\\\\\\\\\\\\\\\\n    if (typeof exposed === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\") {\\\\\\\\\\\\\\\\n        implementation_1.default.subscribeToMasterMessages(messageData => {\\\\\\\\\\\\\\\\n            if (isMasterJobRunMessage(messageData) && !messageData.method) {\\\\\\\\\\\\\\\\n                runFunction(messageData.uid, exposed, messageData.args.map(common_1.deserialize));\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n        });\\\\\\\\\\\\\\\\n        postFunctionInitMessage();\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    else if (typeof exposed === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"object\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && exposed) {\\\\\\\\\\\\\\\\n        implementation_1.default.subscribeToMasterMessages(messageData => {\\\\\\\\\\\\\\\\n            if (isMasterJobRunMessage(messageData) && messageData.method) {\\\\\\\\\\\\\\\\n                runFunction(messageData.uid, exposed[messageData.method], messageData.args.map(common_1.deserialize));\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n        });\\\\\\\\\\\\\\\\n        const methodNames = Object.keys(exposed).filter(key => typeof exposed[key] === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n        postModuleInitMessage(methodNames);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    else {\\\\\\\\\\\\\\\\n        throw Error(`Invalid argument passed to expose(). Expected a function or an object, got: ${exposed}`);\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    implementation_1.default.subscribeToMasterMessages(messageData => {\\\\\\\\\\\\\\\\n        if (isMasterJobCancelMessage(messageData)) {\\\\\\\\\\\\\\\\n            const jobUID = messageData.uid;\\\\\\\\\\\\\\\\n            const subscription = activeSubscriptions.get(jobUID);\\\\\\\\\\\\\\\\n            if (subscription) {\\\\\\\\\\\\\\\\n                subscription.unsubscribe();\\\\\\\\\\\\\\\\n                activeSubscriptions.delete(jobUID);\\\\\\\\\\\\\\\\n            }\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.expose = expose;\\\\\\\\\\\\\\\\nif (typeof self !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && typeof self.addEventListener === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && implementation_1.default.isWorkerRuntime()) {\\\\\\\\\\\\\\\\n    self.addEventListener(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"error\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", event => {\\\\\\\\\\\\\\\\n        // Post with some delay, so the master had some time to subscribe to messages\\\\\\\\\\\\\\\\n        setTimeout(() => postUncaughtErrorMessage(event.error || event), 250);\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n    self.addEventListener(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"unhandledrejection\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", event => {\\\\\\\\\\\\\\\\n        const error = event.reason;\\\\\\\\\\\\\\\\n        if (error && typeof error.message === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"string\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\") {\\\\\\\\\\\\\\\\n            // Post with some delay, so the master had some time to subscribe to messages\\\\\\\\\\\\\\\\n            setTimeout(() => postUncaughtErrorMessage(error), 250);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nif (typeof process !== \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"undefined\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && typeof process.on === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\" && implementation_1.default.isWorkerRuntime()) {\\\\\\\\\\\\\\\\n    process.on(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"uncaughtException\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", (error) => {\\\\\\\\\\\\\\\\n        // Post with some delay, so the master had some time to subscribe to messages\\\\\\\\\\\\\\\\n        setTimeout(() => postUncaughtErrorMessage(error), 250);\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n    process.on(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"unhandledRejection\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", (error) => {\\\\\\\\\\\\\\\\n        if (error && typeof error.message === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"string\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\") {\\\\\\\\\\\\\\\\n            // Post with some delay, so the master had some time to subscribe to messages\\\\\\\\\\\\\\\\n            setTimeout(() => postUncaughtErrorMessage(error), 250);\\\\\\\\\\\\\\\\n        }\\\\\\\\\\\\\\\\n    });\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker/index.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/dist/worker_threads.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/dist/worker_threads.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n// Webpack hack\\\\\\\\\\\\\\\\n// tslint:disable no-eval\\\\\\\\\\\\\\\\nObject.defineProperty(exports, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"__esModule\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", { value: true });\\\\\\\\\\\\\\\\nlet implementation;\\\\\\\\\\\\\\\\nfunction selectImplementation() {\\\\\\\\\\\\\\\\n    return typeof require === \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"function\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n        ? require(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"worker_threads\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\")\\\\\\\\\\\\\\\\n        : eval(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"require\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\")(\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"worker_threads\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nfunction getImplementation() {\\\\\\\\\\\\\\\\n    if (!implementation) {\\\\\\\\\\\\\\\\n        implementation = selectImplementation();\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n    return implementation;\\\\\\\\\\\\\\\\n}\\\\\\\\\\\\\\\\nexports.default = getImplementation;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/dist/worker_threads.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/threads/worker.mjs\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/threads/worker.mjs ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************/\\\\\\\\n/*! exports provided: expose, registerSerializer, Transfer */\\\\\\\\n/***/ (function(__webpack_module__, __webpack_exports__, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"__webpack_require__.r(__webpack_exports__);\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"expose\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return expose; });\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"registerSerializer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return registerSerializer; });\\\\\\\\\\\\\\\\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"Transfer\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\", function() { return Transfer; });\\\\\\\\\\\\\\\\n/* harmony import */ var _dist_worker_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./dist/worker/index.js */ \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\"./node_modules/threads/dist/worker/index.js\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\");\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nconst expose = _dist_worker_index_js__WEBPACK_IMPORTED_MODULE_0__.expose\\\\\\\\\\\\\\\\nconst registerSerializer = _dist_worker_index_js__WEBPACK_IMPORTED_MODULE_0__.registerSerializer\\\\\\\\\\\\\\\\nconst Transfer = _dist_worker_index_js__WEBPACK_IMPORTED_MODULE_0__.Transfer\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/threads/worker.mjs?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ }),\\\\\\\\n\\\\\\\\n/***/ \\\\\\\\\\\\\\\"./node_modules/worker-loader/dist/workers/InlineWorker.js\\\\\\\\\\\\\\\":\\\\\\\\n/*!*****************************************************************!*\\\\\\\\\\\\\\\\\\\\\\\\n  !*** ./node_modules/worker-loader/dist/workers/InlineWorker.js ***!\\\\\\\\n  \\\\\\\\\\\\\\\\*****************************************************************/\\\\\\\\n/*! no static exports found */\\\\\\\\n/***/ (function(module, exports, __webpack_require__) {\\\\\\\\n\\\\\\\\n\\\\\\\\\\\\\\\"use strict\\\\\\\\\\\\\\\";\\\\\\\\neval(\\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n// http://stackoverflow.com/questions/10343913/how-to-create-a-web-worker-from-a-string\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nvar URL = window.URL || window.webkitURL;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\nmodule.exports = function (content, url) {\\\\\\\\\\\\\\\\n  try {\\\\\\\\\\\\\\\\n    try {\\\\\\\\\\\\\\\\n      var blob;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      try {\\\\\\\\\\\\\\\\n        // BlobBuilder = Deprecated, but widely implemented\\\\\\\\\\\\\\\\n        var BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        blob = new BlobBuilder();\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        blob.append(content);\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n        blob = blob.getBlob();\\\\\\\\\\\\\\\\n      } catch (e) {\\\\\\\\\\\\\\\\n        // The proposed API\\\\\\\\\\\\\\\\n        blob = new Blob([content]);\\\\\\\\\\\\\\\\n      }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n      return new Worker(URL.createObjectURL(blob));\\\\\\\\\\\\\\\\n    } catch (e) {\\\\\\\\\\\\\\\\n      return new Worker('data:application/javascript,' + encodeURIComponent(content));\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n  } catch (e) {\\\\\\\\\\\\\\\\n    if (!url) {\\\\\\\\\\\\\\\\n      throw Error('Inline worker is not supported');\\\\\\\\\\\\\\\\n    }\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n    return new Worker(url);\\\\\\\\\\\\\\\\n  }\\\\\\\\\\\\\\\\n};\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/worker-loader/dist/workers/InlineWorker.js?\\\\\\\\\\\\\\\");\\\\\\\\n\\\\\\\\n/***/ })\\\\\\\\n\\\\\\\\n/******/ });\\\\\\\", null);\\\\n};\\\\n\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/decoder.worker.js?./node_modules/worker-loader/dist/cjs.js??ref--5\\\");\\n\\n/***/ }),\\n\\n/***/ \\\"./node_modules/worker-loader/dist/workers/InlineWorker.js\\\":\\n/*!*****************************************************************!*\\\\\\n  !*** ./node_modules/worker-loader/dist/workers/InlineWorker.js ***!\\n  \\\\*****************************************************************/\\n/*! no static exports found */\\n/***/ (function(module, exports, __webpack_require__) {\\n\\n\\\"use strict\\\";\\neval(\\\"\\\\n\\\\n// http://stackoverflow.com/questions/10343913/how-to-create-a-web-worker-from-a-string\\\\n\\\\nvar URL = window.URL || window.webkitURL;\\\\n\\\\nmodule.exports = function (content, url) {\\\\n  try {\\\\n    try {\\\\n      var blob;\\\\n\\\\n      try {\\\\n        // BlobBuilder = Deprecated, but widely implemented\\\\n        var BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\\\\n\\\\n        blob = new BlobBuilder();\\\\n\\\\n        blob.append(content);\\\\n\\\\n        blob = blob.getBlob();\\\\n      } catch (e) {\\\\n        // The proposed API\\\\n        blob = new Blob([content]);\\\\n      }\\\\n\\\\n      return new Worker(URL.createObjectURL(blob));\\\\n    } catch (e) {\\\\n      return new Worker('data:application/javascript,' + encodeURIComponent(content));\\\\n    }\\\\n  } catch (e) {\\\\n    if (!url) {\\\\n      throw Error('Inline worker is not supported');\\\\n    }\\\\n\\\\n    return new Worker(url);\\\\n  }\\\\n};\\\\n\\\\n//# sourceURL=webpack://GeoRaster/./node_modules/worker-loader/dist/workers/InlineWorker.js?\\\");\\n\\n/***/ })\\n\\n/******/ });\", null);\n};\n\n//# sourceURL=webpack://GeoRaster/./node_modules/geotiff/src/decoder.worker.js?./node_modules/worker-loader/dist/cjs.js??ref--5");
  
  /***/ }),
  
  /***/ "./node_modules/worker-loader/dist/workers/InlineWorker.js":
  /*!*****************************************************************!*\
    !*** ./node_modules/worker-loader/dist/workers/InlineWorker.js ***!
    \*****************************************************************/
  /*! no static exports found */
  /***/ (function(module, exports, __webpack_require__) {
  
  "use strict";
  eval("\n\n// http://stackoverflow.com/questions/10343913/how-to-create-a-web-worker-from-a-string\n\nvar URL = window.URL || window.webkitURL;\n\nmodule.exports = function (content, url) {\n  try {\n    try {\n      var blob;\n\n      try {\n        // BlobBuilder = Deprecated, but widely implemented\n        var BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;\n\n        blob = new BlobBuilder();\n\n        blob.append(content);\n\n        blob = blob.getBlob();\n      } catch (e) {\n        // The proposed API\n        blob = new Blob([content]);\n      }\n\n      return new Worker(URL.createObjectURL(blob));\n    } catch (e) {\n      return new Worker('data:application/javascript,' + encodeURIComponent(content));\n    }\n  } catch (e) {\n    if (!url) {\n      throw Error('Inline worker is not supported');\n    }\n\n    return new Worker(url);\n  }\n};\n\n//# sourceURL=webpack://GeoRaster/./node_modules/worker-loader/dist/workers/InlineWorker.js?");
  
  /***/ })
  
  /******/ });