fl-web-component 2.0.19-beta.1 → 2.0.19

package/dist/fl-web-component.common.js

@@ -946,6 +946,17 @@ module.exports = !__webpack_require__("4b8b")(function () {
   }).a != 7;
 });
 
+/***/ }),
+
+/***/ "0c36":
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_607a330c_prod_lang_css__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("12e8");
+/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_607a330c_prod_lang_css__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_607a330c_prod_lang_css__WEBPACK_IMPORTED_MODULE_0__);
+/* unused harmony reexport * */
+
+
 /***/ }),
 
 /***/ "0e15":
@@ -1471,6 +1482,13 @@ Factory_1.Factory.addGetterSetter(Node_1.Node, 'threshold', 0.5, (0, Validators_
 
 /***/ }),
 
+/***/ "12e8":
+/***/ (function(module, exports, __webpack_require__) {
+
+// extracted by mini-css-extract-plugin
+
+/***/ }),
+
 /***/ "12f2":
 /***/ (function(module, exports, __webpack_require__) {
 
@@ -1489,17 +1507,6 @@ exports.default = function (ref) {
 };
 ;
 
-/***/ }),
-
-/***/ "12fb":
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_46d6866f_prod_lang_css__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("dd1a");
-/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_46d6866f_prod_lang_css__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_mini_css_extract_plugin_dist_loader_js_ref_6_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_6_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_6_oneOf_1_2_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_1_id_46d6866f_prod_lang_css__WEBPACK_IMPORTED_MODULE_0__);
-/* unused harmony reexport * */
-
-
 /***/ }),
 
 /***/ "14e9":
@@ -56500,7 +56507,7 @@ module.exports = document && document.documentElement;
 /***/ "9224":
 /***/ (function(module) {
 
-module.exports = JSON.parse("{\"name\":\"fl-web-component\",\"version\":\"2.0.19-beta.1\",\"scripts\":{\"postinstall\":\"patch-package\",\"tip1\":\"仅调试本组件不涉及业务组件,请执行dev\",\"dev\":\"vue-cli-service serve\",\"lint\":\"eslint \\\"{src,packages}/**/*.{vue,js}\\\" --fix\",\"prettier\":\"prettier --write  \\\"packages/**/*.{js,css,less,scss,vue,html}\\\"\",\"=\":\"=============================================================\",\"tip2\":\"同时调试本组件与业务组件,请执行watch，生产模式监听请执行watch:prod\",\"watch\":\"vue-cli-service build --watch --mode development --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"watch:prod\":\"vue-cli-service build --watch --mode production --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"build\":\"npm run lint && vue-cli-service build --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"build:test\":\"vue-cli-service build --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"publish:base\":\"npm run build && npm publish --registry https://registry.npmjs.org/\",\"publish:beta:base\":\"npm run build && npm publish --tag beta --registry https://registry.npmjs.org/\",\"==\":\"=============================================================\",\"tip3\":\"发版注意: 【测试版执行publish:beta】【修改bug执行publish:fix】【新增功能执行publish:feat】【新特性执行publish:perf】\",\"publish:beta\":\"npm version prerelease --preid=beta && npm run publish:beta:base\",\"publish:fix\":\"npm version patch && npm run publish:base\",\"publish:feat\":\"npm version minor && npm run publish:base\",\"publish:perf\":\"npm version major && npm run publish:base\"},\"files\":[\"dist\",\"packages\",\"src\"],\"main\":\"dist/fl-web-component.common.js\",\"dependencies\":{\"camera-controls\":\"2.9.0\",\"core-js\":\"^3.42.0\",\"dxf-parser\":\"^1.1.2\",\"element-ui\":\"2.15.14\",\"fflate\":\"^0.8.2\",\"html2canvas\":\"^1.4.1\",\"jspdf\":\"^3.0.1\",\"konva\":\"^9.3.12\",\"lodash\":\"^4.17.21\",\"meshline\":\"^3.3.1\",\"regenerator-runtime\":\"^0.14.1\",\"svg-pan-zoom\":\"^3.6.2\",\"three\":\"^0.176.0\",\"three.path\":\"^1.0.1\",\"vue\":\"^2.6.11\"},\"devDependencies\":{\"@babel/core\":\"^7.12.16\",\"@babel/plugin-proposal-nullish-coalescing-operator\":\"^7.18.6\",\"@babel/plugin-proposal-optional-chaining\":\"^7.21.0\",\"@babel/preset-env\":\"^7.0.0\",\"@babel/runtime-corejs3\":\"^7.27.1\",\"@vue/cli-plugin-babel\":\"~4.4.0\",\"@vue/cli-plugin-eslint\":\"~4.4.0\",\"@vue/cli-service\":\"~4.4.0\",\"babel-eslint\":\"^10.1.0\",\"babel-loader\":\"^8.0.0\",\"copy-webpack-plugin\":\"^4.0.1\",\"eslint\":\"^6.7.2\",\"eslint-config-prettier\":\"^6.15.0\",\"eslint-plugin-prettier\":\"^3.4.1\",\"eslint-plugin-vue\":\"^6.2.2\",\"patch-package\":\"^6.4.7\",\"prettier\":\"^2.8.8\",\"sass\":\"1.32.13\",\"sass-loader\":\"10.1.1\",\"vue-template-compiler\":\"^2.6.11\",\"worker-loader\":\"^3.0.8\"},\"browserslist\":[\"> 1%\",\"last 2 versions\"]}");
+module.exports = JSON.parse("{\"name\":\"fl-web-component\",\"version\":\"2.0.19\",\"scripts\":{\"postinstall\":\"patch-package\",\"tip1\":\"仅调试本组件不涉及业务组件,请执行dev\",\"dev\":\"vue-cli-service serve\",\"lint\":\"eslint \\\"{src,packages}/**/*.{vue,js}\\\" --fix\",\"prettier\":\"prettier --write  \\\"packages/**/*.{js,css,less,scss,vue,html}\\\"\",\"=\":\"=============================================================\",\"tip2\":\"同时调试本组件与业务组件,请执行watch\",\"watch\":\"vue-cli-service build --watch --mode production --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"build\":\"npm run lint && vue-cli-service build --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"build:test\":\"vue-cli-service build --target lib --name fl-web-component --formats commonjs ./src/main.js\",\"publish:base\":\"npm run build && npm publish --registry https://registry.npmjs.org/\",\"publish:beta:base\":\"npm run build && npm publish --tag beta --registry https://registry.npmjs.org/\",\"==\":\"=============================================================\",\"tip3\":\"发版注意: 【测试版执行publish:beta】【修改bug执行publish:fix】【新增功能执行publish:feat】【新特性执行publish:perf】\",\"publish:beta\":\"npm version prerelease --preid=beta && npm run publish:beta:base\",\"publish:fix\":\"npm version patch && npm run publish:base\",\"publish:feat\":\"npm version minor && npm run publish:base\",\"publish:perf\":\"npm version major && npm run publish:base\"},\"files\":[\"dist\",\"packages\",\"src\"],\"main\":\"dist/fl-web-component.common.js\",\"dependencies\":{\"camera-controls\":\"2.9.0\",\"core-js\":\"^3.42.0\",\"dxf-parser\":\"^1.1.2\",\"element-ui\":\"2.15.14\",\"fflate\":\"^0.8.2\",\"html2canvas\":\"^1.4.1\",\"jspdf\":\"^3.0.1\",\"konva\":\"^9.3.12\",\"lodash\":\"^4.17.21\",\"meshline\":\"^3.3.1\",\"regenerator-runtime\":\"^0.14.1\",\"svg-pan-zoom\":\"^3.6.2\",\"three\":\"^0.176.0\",\"three.path\":\"^1.0.1\",\"vue\":\"^2.6.11\"},\"devDependencies\":{\"@babel/core\":\"^7.12.16\",\"@babel/plugin-proposal-nullish-coalescing-operator\":\"^7.18.6\",\"@babel/plugin-proposal-optional-chaining\":\"^7.21.0\",\"@babel/preset-env\":\"^7.0.0\",\"@babel/runtime-corejs3\":\"^7.27.1\",\"@vue/cli-plugin-babel\":\"~4.4.0\",\"@vue/cli-plugin-eslint\":\"~4.4.0\",\"@vue/cli-service\":\"~4.4.0\",\"babel-eslint\":\"^10.1.0\",\"babel-loader\":\"^8.0.0\",\"copy-webpack-plugin\":\"^4.0.1\",\"eslint\":\"^6.7.2\",\"eslint-config-prettier\":\"^6.15.0\",\"eslint-plugin-prettier\":\"^3.4.1\",\"eslint-plugin-vue\":\"^6.2.2\",\"patch-package\":\"^6.4.7\",\"prettier\":\"^2.8.8\",\"sass\":\"1.32.13\",\"sass-loader\":\"10.1.1\",\"vue-template-compiler\":\"^2.6.11\",\"worker-loader\":\"^3.0.8\"},\"browserslist\":[\"> 1%\",\"last 2 versions\"]}");
 
 /***/ }),
 
@@ -59587,6 +59594,13 @@ Factory_1.Factory.addGetterSetter(Node_1.Node, 'noise', 0.2, (0, Validators_1.ge
 
 /***/ }),
 
+/***/ "bc46":
+/***/ (function(module, exports, __webpack_require__) {
+
+// extracted by mini-css-extract-plugin
+
+/***/ }),
+
 /***/ "bcb1":
 /***/ (function(module, exports, __webpack_require__) {
 
@@ -69128,14 +69142,10 @@ module.exports = function (it) {
 
 /***/ }),
 
-/***/ "cbdd":
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_46d6866f_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("d5c3");
-/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_46d6866f_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_46d6866f_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0__);
-/* unused harmony reexport * */
+/***/ "cbf5":
+/***/ (function(module) {
 
+module.exports = JSON.parse("{}");
 
 /***/ }),
 
@@ -69246,6 +69256,17 @@ module.exports = function (it) {
   return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991
 };
 
+/***/ }),
+
+/***/ "d181":
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_607a330c_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__("bc46");
+/* harmony import */ var _node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_607a330c_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_mini_css_extract_plugin_dist_loader_js_ref_8_oneOf_1_0_node_modules_css_loader_dist_cjs_js_ref_8_oneOf_1_1_node_modules_vue_loader_lib_loaders_stylePostLoader_js_node_modules_postcss_loader_src_index_js_ref_8_oneOf_1_2_node_modules_sass_loader_dist_cjs_js_ref_8_oneOf_1_3_node_modules_cache_loader_dist_cjs_js_ref_0_0_node_modules_vue_loader_lib_index_js_vue_loader_options_index_vue_vue_type_style_index_0_id_607a330c_prod_lang_scss_scoped_true__WEBPACK_IMPORTED_MODULE_0__);
+/* unused harmony reexport * */
+
+
 /***/ }),
 
 /***/ "d397":
@@ -70528,13 +70549,6 @@ module.exports = normalizeWheel;
 
 /***/ }),
 
-/***/ "d5c3":
-/***/ (function(module, exports, __webpack_require__) {
-
-// extracted by mini-css-extract-plugin
-
-/***/ }),
-
 /***/ "d777":
 /***/ (function(module, exports, __webpack_require__) {
 
@@ -72071,13 +72085,6 @@ module.exports = /******/function (modules) {
 
 /***/ }),
 
-/***/ "dd1a":
-/***/ (function(module, exports, __webpack_require__) {
-
-// extracted by mini-css-extract-plugin
-
-/***/ }),
-
 /***/ "df93":
 /***/ (function(module, exports, __webpack_require__) {
 
@@ -78634,8 +78641,8 @@ if (typeof window !== 'undefined') {
 // Indicate to webpack that this file can be concatenated
 /* harmony default export */ var setPublicPath = (null);
 
-// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"44f05828-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/index.vue?vue&type=template&id=46d6866f&scoped=true
-var com_graphicsvue_type_template_id_46d6866f_scoped_true_render = function render() {
+// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"13819966-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/index.vue?vue&type=template&id=607a330c&scoped=true
+var com_graphicsvue_type_template_id_607a330c_scoped_true_render = function render() {
   var _vm = this,
     _c = _vm._self._c;
   return _c('div', {
@@ -78647,7 +78654,7 @@ var com_graphicsvue_type_template_id_46d6866f_scoped_true_render = function rend
 };
 var staticRenderFns = [];
 
-// CONCATENATED MODULE: ./packages/components/com-graphics/index.vue?vue&type=template&id=46d6866f&scoped=true
+// CONCATENATED MODULE: ./packages/components/com-graphics/index.vue?vue&type=template&id=607a330c&scoped=true
 
 // CONCATENATED MODULE: ./node_modules/camera-controls/dist/camera-controls.module.js
 function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
@@ -109010,12 +109017,8 @@ function processMeshData(input, options) {
       mergeMaterialByMeshId.set(String(it.id), it);
     }
   }
-  var identity = new Matrix4().identity();
-  var identityElements = identity.elements;
   input.mesh.forEach(function (meshItem) {
-    var _meshItem$matrix;
     var geomList = [];
-    var meshMatrix = (_meshItem$matrix = meshItem.matrix) !== null && _meshItem$matrix !== void 0 && _meshItem$matrix.length ? meshItem.matrix : identityElements;
     meshItem.primitives.forEach(function (primitive) {
       var primitiveData = input.primitive.find(function (g) {
         return g.id === primitive.prmid;
@@ -109028,24 +109031,26 @@ function processMeshData(input, options) {
         var mergedMaterial = mergeMaterialByMeshId.get(String(meshItem.id));
         var material = mergedMaterial || baseMaterial;
         var sourceVisible = (mergedMaterial === null || mergedMaterial === void 0 ? void 0 : mergedMaterial.visible) === false || (baseMaterial === null || baseMaterial === void 0 ? void 0 : baseMaterial.visible) === false ? false : true;
-        var baseColor = [255, 255, 255, 1];
         var prop = {
-          color: material !== null && material !== void 0 && material.color ? material !== null && material !== void 0 && material.color.length ? material.color : baseColor : baseColor,
+          color: (material === null || material === void 0 ? void 0 : material.color) || [255, 255, 255, 1],
           fontsize: (material === null || material === void 0 ? void 0 : material.fontsize) !== undefined ? material === null || material === void 0 ? void 0 : material.fontsize : 20,
           frontname: (material === null || material === void 0 ? void 0 : material.frontname) !== undefined ? material === null || material === void 0 ? void 0 : material.frontname : '',
           italic: material === null || material === void 0 ? void 0 : material.italic,
           linepacing: 1,
           // 默认值
-          linewidth: (material === null || material === void 0 ? void 0 : material.linewidth) !== undefined ? material === null || material === void 0 ? void 0 : material.linewidth : 10,
+          linewidth: (material === null || material === void 0 ? void 0 : material.linewidth) !== undefined ? material === null || material === void 0 ? void 0 : material.linewidth : 1,
           // 默认值
           visible: sourceVisible,
           sourceVisible: sourceVisible,
           transparent: (material === null || material === void 0 ? void 0 : material.transp) !== undefined ? material === null || material === void 0 ? void 0 : material.transp : 0
         };
+        var identity = new Matrix4().identity();
         geomList.push({
           matrix: {
-            val: (_primitive$matrix = primitive.matrix) !== null && _primitive$matrix !== void 0 && _primitive$matrix.length ? primitive.matrix : identityElements
+            val: (_primitive$matrix = primitive.matrix) !== null && _primitive$matrix !== void 0 && _primitive$matrix.length ? primitive.matrix : identity.elements
+            // val: identity.elements,
           },
+          // originMatrix: meshItem.id == primitive.prmid ? [] : identity.elements,
           prmid: primitive.prmid,
           geomId: primitiveData.id,
           type: primitiveData.geomType,
@@ -109062,9 +109067,6 @@ function processMeshData(input, options) {
     });
     drawObjMap.set(meshItem.id, {
       drawObjId: meshItem.id,
-      matrix: {
-        val: meshMatrix
-      },
       geoms: geomList
       // lodLevel: meshItem.type || 2,
     });
@@ -109144,12 +109146,12 @@ function processNodeData(input, options) {
 
 // 处理一个primitive，生成多个drawObj
 function processOnePrimtiveToMultiMesh(primitive) {
-  var _primitive$geoms$;
+  var _primitive$geoms$, _primitive$geoms$2;
   return {
     instanceId: primitive.drawObjId,
     // 实例与drawObj一对多关系
     drawObject: ((_primitive$geoms$ = primitive.geoms[0]) === null || _primitive$geoms$ === void 0 ? void 0 : _primitive$geoms$.prmid) || '',
-    matrix: primitive.matrix || {}
+    matrix: ((_primitive$geoms$2 = primitive.geoms[0]) === null || _primitive$geoms$2 === void 0 ? void 0 : _primitive$geoms$2.matrix) || []
   };
 }
 
@@ -109235,19 +109237,14 @@ function parseNode(node, isFlatNode) {
 // 生成默认node节点
 function generateNode(mesh) {
   var nodes = [];
-  var identity = new Matrix4().identity();
-  var identityElements = identity.elements;
   mesh.forEach(function (item) {
     if (item.primitives.length) {
-      var _item$matrix;
       var tempNode = {
         id: item.id,
         _batchId: item.id,
         name: item.id,
         mesh: item.id,
-        matrix: {
-          val: (_item$matrix = item.matrix) !== null && _item$matrix !== void 0 && _item$matrix.length ? item.matrix : identityElements
-        },
+        matrix: {},
         nodeType: 3
       };
       nodes.push(tempNode);
@@ -111431,7 +111428,7 @@ var inline_default = /*#__PURE__*/__webpack_require__.n(inline);
 
 
 function Worker_fn() {
-  return inline_default()("/******/ (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 = \"f538\");\n/******/ })\n/************************************************************************/\n/******/ ({\n\n/***/ \"f538\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// CONCATENATED MODULE: ./node_modules/fflate/esm/browser.js\n// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = function wk(c, id, msg, transfer, cb) {\n  var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'], {\n    type: 'text/javascript'\n  }))));\n  w.onmessage = function (e) {\n    var d = e.data,\n      ed = d.$e$;\n    if (ed) {\n      var err = new Error(ed[0]);\n      err['code'] = ed[1];\n      err.stack = ed[2];\n      cb(err, null);\n    } else cb(null, d);\n  };\n  w.postMessage(msg, transfer);\n  return w;\n};\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array,\n  u16 = Uint16Array,\n  i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */0, 0, /* impossible */0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function freb(eb, start) {\n  var b = new u16(31);\n  for (var i = 0; i < 31; ++i) {\n    b[i] = start += 1 << eb[i - 1];\n  }\n  // numbers here are at max 18 bits\n  var r = new i32(b[30]);\n  for (var i = 1; i < 30; ++i) {\n    for (var j = b[i]; j < b[i + 1]; ++j) {\n      r[j] = j - b[i] << 5 | i;\n    }\n  }\n  return {\n    b: b,\n    r: r\n  };\n};\nvar _a = freb(fleb, 2),\n  fl = _a.b,\n  revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0),\n  fd = _b.b,\n  revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var browser_i = 0; browser_i < 32768; ++browser_i) {\n  // reverse table algorithm from SO\n  var x = (browser_i & 0xAAAA) >> 1 | (browser_i & 0x5555) << 1;\n  x = (x & 0xCCCC) >> 2 | (x & 0x3333) << 2;\n  x = (x & 0xF0F0) >> 4 | (x & 0x0F0F) << 4;\n  rev[browser_i] = ((x & 0xFF00) >> 8 | (x & 0x00FF) << 8) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = function hMap(cd, mb, r) {\n  var s = cd.length;\n  // index\n  var i = 0;\n  // u16 \"map\": index -> # of codes with bit length = index\n  var l = new u16(mb);\n  // length of cd must be 288 (total # of codes)\n  for (; i < s; ++i) {\n    if (cd[i]) ++l[cd[i] - 1];\n  }\n  // u16 \"map\": index -> minimum code for bit length = index\n  var le = new u16(mb);\n  for (i = 1; i < mb; ++i) {\n    le[i] = le[i - 1] + l[i - 1] << 1;\n  }\n  var co;\n  if (r) {\n    // u16 \"map\": index -> number of actual bits, symbol for code\n    co = new u16(1 << mb);\n    // bits to remove for reverser\n    var rvb = 15 - mb;\n    for (i = 0; i < s; ++i) {\n      // ignore 0 lengths\n      if (cd[i]) {\n        // num encoding both symbol and bits read\n        var sv = i << 4 | cd[i];\n        // free bits\n        var r_1 = mb - cd[i];\n        // start value\n        var v = le[cd[i] - 1]++ << r_1;\n        // m is end value\n        for (var m = v | (1 << r_1) - 1; v <= m; ++v) {\n          // every 16 bit value starting with the code yields the same result\n          co[rev[v] >> rvb] = sv;\n        }\n      }\n    }\n  } else {\n    co = new u16(s);\n    for (i = 0; i < s; ++i) {\n      if (cd[i]) {\n        co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];\n      }\n    }\n  }\n  return co;\n};\n// fixed length tree\nvar flt = new u8(288);\nfor (var browser_i = 0; browser_i < 144; ++browser_i) flt[browser_i] = 8;\nfor (var browser_i = 144; browser_i < 256; ++browser_i) flt[browser_i] = 9;\nfor (var browser_i = 256; browser_i < 280; ++browser_i) flt[browser_i] = 7;\nfor (var browser_i = 280; browser_i < 288; ++browser_i) flt[browser_i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var browser_i = 0; browser_i < 32; ++browser_i) fdt[browser_i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/hMap(flt, 9, 0),\n  flrm = /*#__PURE__*/hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/hMap(fdt, 5, 0),\n  fdrm = /*#__PURE__*/hMap(fdt, 5, 1);\n// find max of array\nvar max = function max(a) {\n  var m = a[0];\n  for (var i = 1; i < a.length; ++i) {\n    if (a[i] > m) m = a[i];\n  }\n  return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function bits(d, p, m) {\n  var o = p / 8 | 0;\n  return (d[o] | d[o + 1] << 8) >> (p & 7) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function bits16(d, p) {\n  var o = p / 8 | 0;\n  return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);\n};\n// get end of byte\nvar shft = function shft(p) {\n  return (p + 7) / 8 | 0;\n};\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function slc(v, s, e) {\n  if (s == null || s < 0) s = 0;\n  if (e == null || e > v.length) e = v.length;\n  // can't use .constructor in case user-supplied\n  return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nvar FlateErrorCode = {\n  UnexpectedEOF: 0,\n  InvalidBlockType: 1,\n  InvalidLengthLiteral: 2,\n  InvalidDistance: 3,\n  StreamFinished: 4,\n  NoStreamHandler: 5,\n  InvalidHeader: 6,\n  NoCallback: 7,\n  InvalidUTF8: 8,\n  ExtraFieldTooLong: 9,\n  InvalidDate: 10,\n  FilenameTooLong: 11,\n  StreamFinishing: 12,\n  InvalidZipData: 13,\n  UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = ['unexpected EOF', 'invalid block type', 'invalid length/literal', 'invalid distance', 'stream finished', 'no stream handler',, 'no callback', 'invalid UTF-8 data', 'extra field too long', 'date not in range 1980-2099', 'filename too long', 'stream finishing', 'invalid zip data'\n// determined by unknown compression method\n];\n;\nvar _err = function err(ind, msg, nt) {\n  var e = new Error(msg || ec[ind]);\n  e.code = ind;\n  if (Error.captureStackTrace) Error.captureStackTrace(e, _err);\n  if (!nt) throw e;\n  return e;\n};\n// expands raw DEFLATE data\nvar inflt = function inflt(dat, st, buf, dict) {\n  // source length       dict length\n  var sl = dat.length,\n    dl = dict ? dict.length : 0;\n  if (!sl || st.f && !st.l) return buf || new u8(0);\n  var noBuf = !buf;\n  // have to estimate size\n  var resize = noBuf || st.i != 2;\n  // no state\n  var noSt = st.i;\n  // Assumes roughly 33% compression ratio average\n  if (noBuf) buf = new u8(sl * 3);\n  // ensure buffer can fit at least l elements\n  var cbuf = function cbuf(l) {\n    var bl = buf.length;\n    // need to increase size to fit\n    if (l > bl) {\n      // Double or set to necessary, whichever is greater\n      var nbuf = new u8(Math.max(bl * 2, l));\n      nbuf.set(buf);\n      buf = nbuf;\n    }\n  };\n  //  last chunk         bitpos           bytes\n  var final = st.f || 0,\n    pos = st.p || 0,\n    bt = st.b || 0,\n    lm = st.l,\n    dm = st.d,\n    lbt = st.m,\n    dbt = st.n;\n  // total bits\n  var tbts = sl * 8;\n  do {\n    if (!lm) {\n      // BFINAL - this is only 1 when last chunk is next\n      final = bits(dat, pos, 1);\n      // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n      var type = bits(dat, pos + 1, 3);\n      pos += 3;\n      if (!type) {\n        // go to end of byte boundary\n        var s = shft(pos) + 4,\n          l = dat[s - 4] | dat[s - 3] << 8,\n          t = s + l;\n        if (t > sl) {\n          if (noSt) _err(0);\n          break;\n        }\n        // ensure size\n        if (resize) cbuf(bt + l);\n        // Copy over uncompressed data\n        buf.set(dat.subarray(s, t), bt);\n        // Get new bitpos, update byte count\n        st.b = bt += l, st.p = pos = t * 8, st.f = final;\n        continue;\n      } else if (type == 1) lm = flrm, dm = fdrm, lbt = 9, dbt = 5;else if (type == 2) {\n        //  literal                            lengths\n        var hLit = bits(dat, pos, 31) + 257,\n          hcLen = bits(dat, pos + 10, 15) + 4;\n        var tl = hLit + bits(dat, pos + 5, 31) + 1;\n        pos += 14;\n        // length+distance tree\n        var ldt = new u8(tl);\n        // code length tree\n        var clt = new u8(19);\n        for (var i = 0; i < hcLen; ++i) {\n          // use index map to get real code\n          clt[clim[i]] = bits(dat, pos + i * 3, 7);\n        }\n        pos += hcLen * 3;\n        // code lengths bits\n        var clb = max(clt),\n          clbmsk = (1 << clb) - 1;\n        // code lengths map\n        var clm = hMap(clt, clb, 1);\n        for (var i = 0; i < tl;) {\n          var r = clm[bits(dat, pos, clbmsk)];\n          // bits read\n          pos += r & 15;\n          // symbol\n          var s = r >> 4;\n          // code length to copy\n          if (s < 16) {\n            ldt[i++] = s;\n          } else {\n            //  copy   count\n            var c = 0,\n              n = 0;\n            if (s == 16) n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];else if (s == 17) n = 3 + bits(dat, pos, 7), pos += 3;else if (s == 18) n = 11 + bits(dat, pos, 127), pos += 7;\n            while (n--) ldt[i++] = c;\n          }\n        }\n        //    length tree                 distance tree\n        var lt = ldt.subarray(0, hLit),\n          dt = ldt.subarray(hLit);\n        // max length bits\n        lbt = max(lt);\n        // max dist bits\n        dbt = max(dt);\n        lm = hMap(lt, lbt, 1);\n        dm = hMap(dt, dbt, 1);\n      } else _err(1);\n      if (pos > tbts) {\n        if (noSt) _err(0);\n        break;\n      }\n    }\n    // Make sure the buffer can hold this + the largest possible addition\n    // Maximum chunk size (practically, theoretically infinite) is 2^17\n    if (resize) cbuf(bt + 131072);\n    var lms = (1 << lbt) - 1,\n      dms = (1 << dbt) - 1;\n    var lpos = pos;\n    for (;; lpos = pos) {\n      // bits read, code\n      var c = lm[bits16(dat, pos) & lms],\n        sym = c >> 4;\n      pos += c & 15;\n      if (pos > tbts) {\n        if (noSt) _err(0);\n        break;\n      }\n      if (!c) _err(2);\n      if (sym < 256) buf[bt++] = sym;else if (sym == 256) {\n        lpos = pos, lm = null;\n        break;\n      } else {\n        var add = sym - 254;\n        // no extra bits needed if less\n        if (sym > 264) {\n          // index\n          var i = sym - 257,\n            b = fleb[i];\n          add = bits(dat, pos, (1 << b) - 1) + fl[i];\n          pos += b;\n        }\n        // dist\n        var d = dm[bits16(dat, pos) & dms],\n          dsym = d >> 4;\n        if (!d) _err(3);\n        pos += d & 15;\n        var dt = fd[dsym];\n        if (dsym > 3) {\n          var b = fdeb[dsym];\n          dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n        }\n        if (pos > tbts) {\n          if (noSt) _err(0);\n          break;\n        }\n        if (resize) cbuf(bt + 131072);\n        var end = bt + add;\n        if (bt < dt) {\n          var shift = dl - dt,\n            dend = Math.min(dt, end);\n          if (shift + bt < 0) _err(3);\n          for (; bt < dend; ++bt) buf[bt] = dict[shift + bt];\n        }\n        for (; bt < end; ++bt) buf[bt] = buf[bt - dt];\n      }\n    }\n    st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n    if (lm) final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n  } while (!final);\n  // don't reallocate for streams or user buffers\n  return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function wbits(d, p, v) {\n  v <<= p & 7;\n  var o = p / 8 | 0;\n  d[o] |= v;\n  d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function wbits16(d, p, v) {\n  v <<= p & 7;\n  var o = p / 8 | 0;\n  d[o] |= v;\n  d[o + 1] |= v >> 8;\n  d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function hTree(d, mb) {\n  // Need extra info to make a tree\n  var t = [];\n  for (var i = 0; i < d.length; ++i) {\n    if (d[i]) t.push({\n      s: i,\n      f: d[i]\n    });\n  }\n  var s = t.length;\n  var t2 = t.slice();\n  if (!s) return {\n    t: et,\n    l: 0\n  };\n  if (s == 1) {\n    var v = new u8(t[0].s + 1);\n    v[t[0].s] = 1;\n    return {\n      t: v,\n      l: 1\n    };\n  }\n  t.sort(function (a, b) {\n    return a.f - b.f;\n  });\n  // after i2 reaches last ind, will be stopped\n  // freq must be greater than largest possible number of symbols\n  t.push({\n    s: -1,\n    f: 25001\n  });\n  var l = t[0],\n    r = t[1],\n    i0 = 0,\n    i1 = 1,\n    i2 = 2;\n  t[0] = {\n    s: -1,\n    f: l.f + r.f,\n    l: l,\n    r: r\n  };\n  // efficient algorithm from UZIP.js\n  // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n  // symbols that combined have high freq, will start processing i2 (high-freq,\n  // non-composite) symbols instead\n  // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n  while (i1 != s - 1) {\n    l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n    r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n    t[i1++] = {\n      s: -1,\n      f: l.f + r.f,\n      l: l,\n      r: r\n    };\n  }\n  var maxSym = t2[0].s;\n  for (var i = 1; i < s; ++i) {\n    if (t2[i].s > maxSym) maxSym = t2[i].s;\n  }\n  // code lengths\n  var tr = new u16(maxSym + 1);\n  // max bits in tree\n  var mbt = _ln(t[i1 - 1], tr, 0);\n  if (mbt > mb) {\n    // more algorithms from UZIP.js\n    // TODO: find out how this code works (debt)\n    //  ind    debt\n    var i = 0,\n      dt = 0;\n    //    left            cost\n    var lft = mbt - mb,\n      cst = 1 << lft;\n    t2.sort(function (a, b) {\n      return tr[b.s] - tr[a.s] || a.f - b.f;\n    });\n    for (; i < s; ++i) {\n      var i2_1 = t2[i].s;\n      if (tr[i2_1] > mb) {\n        dt += cst - (1 << mbt - tr[i2_1]);\n        tr[i2_1] = mb;\n      } else break;\n    }\n    dt >>= lft;\n    while (dt > 0) {\n      var i2_2 = t2[i].s;\n      if (tr[i2_2] < mb) dt -= 1 << mb - tr[i2_2]++ - 1;else ++i;\n    }\n    for (; i >= 0 && dt; --i) {\n      var i2_3 = t2[i].s;\n      if (tr[i2_3] == mb) {\n        --tr[i2_3];\n        ++dt;\n      }\n    }\n    mbt = mb;\n  }\n  return {\n    t: new u8(tr),\n    l: mbt\n  };\n};\n// get the max length and assign length codes\nvar _ln = function ln(n, l, d) {\n  return n.s == -1 ? Math.max(_ln(n.l, l, d + 1), _ln(n.r, l, d + 1)) : l[n.s] = d;\n};\n// length codes generation\nvar lc = function lc(c) {\n  var s = c.length;\n  // Note that the semicolon was intentional\n  while (s && !c[--s]);\n  var cl = new u16(++s);\n  //  ind      num         streak\n  var cli = 0,\n    cln = c[0],\n    cls = 1;\n  var w = function w(v) {\n    cl[cli++] = v;\n  };\n  for (var i = 1; i <= s; ++i) {\n    if (c[i] == cln && i != s) ++cls;else {\n      if (!cln && cls > 2) {\n        for (; cls > 138; cls -= 138) w(32754);\n        if (cls > 2) {\n          w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);\n          cls = 0;\n        }\n      } else if (cls > 3) {\n        w(cln), --cls;\n        for (; cls > 6; cls -= 6) w(8304);\n        if (cls > 2) w(cls - 3 << 5 | 8208), cls = 0;\n      }\n      while (cls--) w(cln);\n      cls = 1;\n      cln = c[i];\n    }\n  }\n  return {\n    c: cl.subarray(0, cli),\n    n: s\n  };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function clen(cf, cl) {\n  var l = 0;\n  for (var i = 0; i < cl.length; ++i) l += cf[i] * cl[i];\n  return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function wfblk(out, pos, dat) {\n  // no need to write 00 as type: TypedArray defaults to 0\n  var s = dat.length;\n  var o = shft(pos + 2);\n  out[o] = s & 255;\n  out[o + 1] = s >> 8;\n  out[o + 2] = out[o] ^ 255;\n  out[o + 3] = out[o + 1] ^ 255;\n  for (var i = 0; i < s; ++i) out[o + i + 4] = dat[i];\n  return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function wblk(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n  wbits(out, p++, final);\n  ++lf[256];\n  var _a = hTree(lf, 15),\n    dlt = _a.t,\n    mlb = _a.l;\n  var _b = hTree(df, 15),\n    ddt = _b.t,\n    mdb = _b.l;\n  var _c = lc(dlt),\n    lclt = _c.c,\n    nlc = _c.n;\n  var _d = lc(ddt),\n    lcdt = _d.c,\n    ndc = _d.n;\n  var lcfreq = new u16(19);\n  for (var i = 0; i < lclt.length; ++i) ++lcfreq[lclt[i] & 31];\n  for (var i = 0; i < lcdt.length; ++i) ++lcfreq[lcdt[i] & 31];\n  var _e = hTree(lcfreq, 7),\n    lct = _e.t,\n    mlcb = _e.l;\n  var nlcc = 19;\n  for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc);\n  var flen = bl + 5 << 3;\n  var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n  var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n  if (bs >= 0 && flen <= ftlen && flen <= dtlen) return wfblk(out, p, dat.subarray(bs, bs + bl));\n  var lm, ll, dm, dl;\n  wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n  if (dtlen < ftlen) {\n    lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n    var llm = hMap(lct, mlcb, 0);\n    wbits(out, p, nlc - 257);\n    wbits(out, p + 5, ndc - 1);\n    wbits(out, p + 10, nlcc - 4);\n    p += 14;\n    for (var i = 0; i < nlcc; ++i) wbits(out, p + 3 * i, lct[clim[i]]);\n    p += 3 * nlcc;\n    var lcts = [lclt, lcdt];\n    for (var it = 0; it < 2; ++it) {\n      var clct = lcts[it];\n      for (var i = 0; i < clct.length; ++i) {\n        var len = clct[i] & 31;\n        wbits(out, p, llm[len]), p += lct[len];\n        if (len > 15) wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;\n      }\n    }\n  } else {\n    lm = flm, ll = flt, dm = fdm, dl = fdt;\n  }\n  for (var i = 0; i < li; ++i) {\n    var sym = syms[i];\n    if (sym > 255) {\n      var len = sym >> 18 & 31;\n      wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n      if (len > 7) wbits(out, p, sym >> 23 & 31), p += fleb[len];\n      var dst = sym & 31;\n      wbits16(out, p, dm[dst]), p += dl[dst];\n      if (dst > 3) wbits16(out, p, sym >> 5 & 8191), p += fdeb[dst];\n    } else {\n      wbits16(out, p, lm[sym]), p += ll[sym];\n    }\n  }\n  wbits16(out, p, lm[256]);\n  return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function dflt(dat, lvl, plvl, pre, post, st) {\n  var s = st.z || dat.length;\n  var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n  // writing to this writes to the output buffer\n  var w = o.subarray(pre, o.length - post);\n  var lst = st.l;\n  var pos = (st.r || 0) & 7;\n  if (lvl) {\n    if (pos) w[0] = st.r >> 3;\n    var opt = deo[lvl - 1];\n    var n = opt >> 13,\n      c = opt & 8191;\n    var msk_1 = (1 << plvl) - 1;\n    //    prev 2-byte val map    curr 2-byte val map\n    var prev = st.p || new u16(32768),\n      head = st.h || new u16(msk_1 + 1);\n    var bs1_1 = Math.ceil(plvl / 3),\n      bs2_1 = 2 * bs1_1;\n    var hsh = function hsh(i) {\n      return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;\n    };\n    // 24576 is an arbitrary number of maximum symbols per block\n    // 424 buffer for last block\n    var syms = new i32(25000);\n    // length/literal freq   distance freq\n    var lf = new u16(288),\n      df = new u16(32);\n    //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n    var lc_1 = 0,\n      eb = 0,\n      i = st.i || 0,\n      li = 0,\n      wi = st.w || 0,\n      bs = 0;\n    for (; i + 2 < s; ++i) {\n      // hash value\n      var hv = hsh(i);\n      // index mod 32768    previous index mod\n      var imod = i & 32767,\n        pimod = head[hv];\n      prev[imod] = pimod;\n      head[hv] = imod;\n      // We always should modify head and prev, but only add symbols if\n      // this data is not yet processed (\"wait\" for wait index)\n      if (wi <= i) {\n        // bytes remaining\n        var rem = s - i;\n        if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n          pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n          li = lc_1 = eb = 0, bs = i;\n          for (var j = 0; j < 286; ++j) lf[j] = 0;\n          for (var j = 0; j < 30; ++j) df[j] = 0;\n        }\n        //  len    dist   chain\n        var l = 2,\n          d = 0,\n          ch_1 = c,\n          dif = imod - pimod & 32767;\n        if (rem > 2 && hv == hsh(i - dif)) {\n          var maxn = Math.min(n, rem) - 1;\n          var maxd = Math.min(32767, i);\n          // max possible length\n          // not capped at dif because decompressors implement \"rolling\" index population\n          var ml = Math.min(258, rem);\n          while (dif <= maxd && --ch_1 && imod != pimod) {\n            if (dat[i + l] == dat[i + l - dif]) {\n              var nl = 0;\n              for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl);\n              if (nl > l) {\n                l = nl, d = dif;\n                // break out early when we reach \"nice\" (we are satisfied enough)\n                if (nl > maxn) break;\n                // now, find the rarest 2-byte sequence within this\n                // length of literals and search for that instead.\n                // Much faster than just using the start\n                var mmd = Math.min(dif, nl - 2);\n                var md = 0;\n                for (var j = 0; j < mmd; ++j) {\n                  var ti = i - dif + j & 32767;\n                  var pti = prev[ti];\n                  var cd = ti - pti & 32767;\n                  if (cd > md) md = cd, pimod = ti;\n                }\n              }\n            }\n            // check the previous match\n            imod = pimod, pimod = prev[imod];\n            dif += imod - pimod & 32767;\n          }\n        }\n        // d will be nonzero only when a match was found\n        if (d) {\n          // store both dist and len data in one int32\n          // Make sure this is recognized as a len/dist with 28th bit (2^28)\n          syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];\n          var lin = revfl[l] & 31,\n            din = revfd[d] & 31;\n          eb += fleb[lin] + fdeb[din];\n          ++lf[257 + lin];\n          ++df[din];\n          wi = i + l;\n          ++lc_1;\n        } else {\n          syms[li++] = dat[i];\n          ++lf[dat[i]];\n        }\n      }\n    }\n    for (i = Math.max(i, wi); i < s; ++i) {\n      syms[li++] = dat[i];\n      ++lf[dat[i]];\n    }\n    pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n    if (!lst) {\n      st.r = pos & 7 | w[pos / 8 | 0] << 3;\n      // shft(pos) now 1 less if pos & 7 != 0\n      pos -= 7;\n      st.h = head, st.p = prev, st.i = i, st.w = wi;\n    }\n  } else {\n    for (var i = st.w || 0; i < s + lst; i += 65535) {\n      // end\n      var e = i + 65535;\n      if (e >= s) {\n        // write final block\n        w[pos / 8 | 0] = lst;\n        e = s;\n      }\n      pos = wfblk(w, pos + 1, dat.subarray(i, e));\n    }\n    st.i = s;\n  }\n  return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/function () {\n  var t = new Int32Array(256);\n  for (var i = 0; i < 256; ++i) {\n    var c = i,\n      k = 9;\n    while (--k) c = (c & 1 && -306674912) ^ c >>> 1;\n    t[i] = c;\n  }\n  return t;\n}();\n// CRC32\nvar crc = function crc() {\n  var c = -1;\n  return {\n    p: function p(d) {\n      // closures have awful performance\n      var cr = c;\n      for (var i = 0; i < d.length; ++i) cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;\n      c = cr;\n    },\n    d: function d() {\n      return ~c;\n    }\n  };\n};\n// Adler32\nvar adler = function adler() {\n  var a = 1,\n    b = 0;\n  return {\n    p: function p(d) {\n      // closures have awful performance\n      var n = a,\n        m = b;\n      var l = d.length | 0;\n      for (var i = 0; i != l;) {\n        var e = Math.min(i + 2655, l);\n        for (; i < e; ++i) m += n += d[i];\n        n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n      }\n      a = n, b = m;\n    },\n    d: function d() {\n      a %= 65521, b %= 65521;\n      return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | b >> 8;\n    }\n  };\n};\n;\n// deflate with opts\nvar dopt = function dopt(dat, opt, pre, post, st) {\n  if (!st) {\n    st = {\n      l: 1\n    };\n    if (opt.dictionary) {\n      var dict = opt.dictionary.subarray(-32768);\n      var newDat = new u8(dict.length + dat.length);\n      newDat.set(dict);\n      newDat.set(dat, dict.length);\n      dat = newDat;\n      st.w = dict.length;\n    }\n  }\n  return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20 : 12 + opt.mem, pre, post, st);\n};\n// Walmart object spread\nvar mrg = function mrg(a, b) {\n  var o = {};\n  for (var k in a) o[k] = a[k];\n  for (var k in b) o[k] = b[k];\n  return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function wcln(fn, fnStr, td) {\n  var dt = fn();\n  var st = fn.toString();\n  var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n  for (var i = 0; i < dt.length; ++i) {\n    var v = dt[i],\n      k = ks[i];\n    if (typeof v == 'function') {\n      fnStr += ';' + k + '=';\n      var st_1 = v.toString();\n      if (v.prototype) {\n        // for global objects\n        if (st_1.indexOf('[native code]') != -1) {\n          var spInd = st_1.indexOf(' ', 8) + 1;\n          fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n        } else {\n          fnStr += st_1;\n          for (var t in v.prototype) fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n        }\n      } else fnStr += st_1;\n    } else td[k] = v;\n  }\n  return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function cbfs(v) {\n  var tl = [];\n  for (var k in v) {\n    if (v[k].buffer) {\n      tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n    }\n  }\n  return tl;\n};\n// use a worker to execute code\nvar wrkr = function wrkr(fns, init, id, cb) {\n  if (!ch[id]) {\n    var fnStr = '',\n      td_1 = {},\n      m = fns.length - 1;\n    for (var i = 0; i < m; ++i) fnStr = wcln(fns[i], fnStr, td_1);\n    ch[id] = {\n      c: wcln(fns[m], fnStr, td_1),\n      e: td_1\n    };\n  }\n  var td = mrg({}, ch[id].e);\n  return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function bInflt() {\n  return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, _err, inflt, inflateSync, pbf, gopt];\n};\nvar bDflt = function bDflt() {\n  return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, _ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf];\n};\n// gzip extra\nvar gze = function gze() {\n  return [gzh, gzhl, wbytes, crc, crct];\n};\n// gunzip extra\nvar guze = function guze() {\n  return [gzs, gzl];\n};\n// zlib extra\nvar zle = function zle() {\n  return [zlh, wbytes, adler];\n};\n// unzlib extra\nvar zule = function zule() {\n  return [zls];\n};\n// post buf\nvar pbf = function pbf(msg) {\n  return postMessage(msg, [msg.buffer]);\n};\n// get opts\nvar gopt = function gopt(o) {\n  return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n  };\n};\n// async helper\nvar cbify = function cbify(dat, opts, fns, init, id, cb) {\n  var w = wrkr(fns, init, id, function (err, dat) {\n    w.terminate();\n    cb(err, dat);\n  });\n  w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n  return function () {\n    w.terminate();\n  };\n};\n// auto stream\nvar astrm = function astrm(strm) {\n  strm.ondata = function (dat, final) {\n    return postMessage([dat, final], [dat.buffer]);\n  };\n  return function (ev) {\n    if (ev.data.length) {\n      strm.push(ev.data[0], ev.data[1]);\n      postMessage([ev.data[0].length]);\n    } else strm.flush();\n  };\n};\n// async stream attach\nvar astrmify = function astrmify(fns, strm, opts, init, id, flush, ext) {\n  var t;\n  var w = wrkr(fns, init, id, function (err, dat) {\n    if (err) w.terminate(), strm.ondata.call(strm, err);else if (!Array.isArray(dat)) ext(dat);else if (dat.length == 1) {\n      strm.queuedSize -= dat[0];\n      if (strm.ondrain) strm.ondrain(dat[0]);\n    } else {\n      if (dat[1]) w.terminate();\n      strm.ondata.call(strm, err, dat[0], dat[1]);\n    }\n  });\n  w.postMessage(opts);\n  strm.queuedSize = 0;\n  strm.push = function (d, f) {\n    if (!strm.ondata) _err(5);\n    if (t) strm.ondata(_err(4, 0, 1), null, !!f);\n    strm.queuedSize += d.length;\n    w.postMessage([d, t = f], [d.buffer]);\n  };\n  strm.terminate = function () {\n    w.terminate();\n  };\n  if (flush) {\n    strm.flush = function () {\n      w.postMessage([]);\n    };\n  }\n};\n// read 2 bytes\nvar b2 = function b2(d, b) {\n  return d[b] | d[b + 1] << 8;\n};\n// read 4 bytes\nvar b4 = function b4(d, b) {\n  return (d[b] | d[b + 1] << 8 | d[b + 2] << 16 | d[b + 3] << 24) >>> 0;\n};\nvar b8 = function b8(d, b) {\n  return b4(d, b) + b4(d, b + 4) * 4294967296;\n};\n// write bytes\nvar wbytes = function wbytes(d, b, v) {\n  for (; v; ++b) d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function gzh(c, o) {\n  var fn = o.filename;\n  c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n  if (o.mtime != 0) wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n  if (fn) {\n    c[3] = 8;\n    for (var i = 0; i <= fn.length; ++i) c[i + 10] = fn.charCodeAt(i);\n  }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function gzs(d) {\n  if (d[0] != 31 || d[1] != 139 || d[2] != 8) _err(6, 'invalid gzip data');\n  var flg = d[3];\n  var st = 10;\n  if (flg & 4) st += (d[10] | d[11] << 8) + 2;\n  for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++]);\n  return st + (flg & 2);\n};\n// gzip length\nvar gzl = function gzl(d) {\n  var l = d.length;\n  return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function gzhl(o) {\n  return 10 + (o.filename ? o.filename.length + 1 : 0);\n};\n// zlib header\nvar zlh = function zlh(c, o) {\n  var lv = o.level,\n    fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n  c[0] = 120, c[1] = fl << 6 | (o.dictionary && 32);\n  c[1] |= 31 - (c[0] << 8 | c[1]) % 31;\n  if (o.dictionary) {\n    var h = adler();\n    h.p(o.dictionary);\n    wbytes(c, 2, h.d());\n  }\n};\n// zlib start\nvar zls = function zls(d, dict) {\n  if ((d[0] & 15) != 8 || d[0] >> 4 > 7 || (d[0] << 8 | d[1]) % 31) _err(6, 'invalid zlib data');\n  if ((d[1] >> 5 & 1) == +!dict) _err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n  return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n  if (typeof opts == 'function') cb = opts, opts = {};\n  this.ondata = cb;\n  return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/function () {\n  function Deflate(opts, cb) {\n    if (typeof opts == 'function') cb = opts, opts = {};\n    this.ondata = cb;\n    this.o = opts || {};\n    this.s = {\n      l: 0,\n      i: 32768,\n      w: 32768,\n      z: 32768\n    };\n    // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n    // 98304 = 32768 (lookback) + 65536 (common chunk size)\n    this.b = new u8(98304);\n    if (this.o.dictionary) {\n      var dict = this.o.dictionary.subarray(-32768);\n      this.b.set(dict, 32768 - dict.length);\n      this.s.i = 32768 - dict.length;\n    }\n  }\n  Deflate.prototype.p = function (c, f) {\n    this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Deflate.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (this.s.l) _err(4);\n    var endLen = chunk.length + this.s.z;\n    if (endLen > this.b.length) {\n      if (endLen > 2 * this.b.length - 32768) {\n        var newBuf = new u8(endLen & -32768);\n        newBuf.set(this.b.subarray(0, this.s.z));\n        this.b = newBuf;\n      }\n      var split = this.b.length - this.s.z;\n      this.b.set(chunk.subarray(0, split), this.s.z);\n      this.s.z = this.b.length;\n      this.p(this.b, false);\n      this.b.set(this.b.subarray(-32768));\n      this.b.set(chunk.subarray(split), 32768);\n      this.s.z = chunk.length - split + 32768;\n      this.s.i = 32766, this.s.w = 32768;\n    } else {\n      this.b.set(chunk, this.s.z);\n      this.s.z += chunk.length;\n    }\n    this.s.l = final & 1;\n    if (this.s.z > this.s.w + 8191 || final) {\n      this.p(this.b, final || false);\n      this.s.w = this.s.i, this.s.i -= 2;\n    }\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * deflated output for small inputs.\n   */\n  Deflate.prototype.flush = function () {\n    if (!this.ondata) _err(5);\n    if (this.s.l) _err(4);\n    this.p(this.b, false);\n    this.s.w = this.s.i, this.s.i -= 2;\n  };\n  return Deflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/function () {\n  function AsyncDeflate(opts, cb) {\n    astrmify([bDflt, function () {\n      return [astrm, Deflate];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Deflate(ev.data);\n      onmessage = astrm(strm);\n    }, 6, 1);\n  }\n  return AsyncDeflate;\n}();\n\nfunction deflate(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt], function (ev) {\n    return pbf(deflateSync(ev.data[0], ev.data[1]));\n  }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nfunction deflateSync(data, opts) {\n  return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/function () {\n  function Inflate(opts, cb) {\n    // no StrmOpt here to avoid adding to workerizer\n    if (typeof opts == 'function') cb = opts, opts = {};\n    this.ondata = cb;\n    var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n    this.s = {\n      i: 0,\n      b: dict ? dict.length : 0\n    };\n    this.o = new u8(32768);\n    this.p = new u8(0);\n    if (dict) this.o.set(dict);\n  }\n  Inflate.prototype.e = function (c) {\n    if (!this.ondata) _err(5);\n    if (this.d) _err(4);\n    if (!this.p.length) this.p = c;else if (c.length) {\n      var n = new u8(this.p.length + c.length);\n      n.set(this.p), n.set(c, this.p.length), this.p = n;\n    }\n  };\n  Inflate.prototype.c = function (final) {\n    this.s.i = +(this.d = final || false);\n    var bts = this.s.b;\n    var dt = inflt(this.p, this.s, this.o);\n    this.ondata(slc(dt, bts, this.s.b), this.d);\n    this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n    this.p = slc(this.p, this.s.p / 8 | 0), this.s.p &= 7;\n  };\n  /**\n   * Pushes a chunk to be inflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the final chunk\n   */\n  Inflate.prototype.push = function (chunk, final) {\n    this.e(chunk), this.c(final);\n  };\n  return Inflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/function () {\n  function AsyncInflate(opts, cb) {\n    astrmify([bInflt, function () {\n      return [astrm, Inflate];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Inflate(ev.data);\n      onmessage = astrm(strm);\n    }, 7, 0);\n  }\n  return AsyncInflate;\n}();\n\nfunction inflate(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt], function (ev) {\n    return pbf(inflateSync(ev.data[0], gopt(ev.data[1])));\n  }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction inflateSync(data, opts) {\n  return inflt(data, {\n    i: 2\n  }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/function () {\n  function Gzip(opts, cb) {\n    this.c = crc();\n    this.l = 0;\n    this.v = 1;\n    Deflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be GZIPped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Gzip.prototype.push = function (chunk, final) {\n    this.c.p(chunk);\n    this.l += chunk.length;\n    Deflate.prototype.push.call(this, chunk, final);\n  };\n  Gzip.prototype.p = function (c, f) {\n    var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n    if (this.v) gzh(raw, this.o), this.v = 0;\n    if (f) wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n    this.ondata(raw, f);\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * GZIPped output for small inputs.\n   */\n  Gzip.prototype.flush = function () {\n    Deflate.prototype.flush.call(this);\n  };\n  return Gzip;\n}();\n\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/function () {\n  function AsyncGzip(opts, cb) {\n    astrmify([bDflt, gze, function () {\n      return [astrm, Deflate, Gzip];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Gzip(ev.data);\n      onmessage = astrm(strm);\n    }, 8, 1);\n  }\n  return AsyncGzip;\n}();\n\nfunction gzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt, gze, function () {\n    return [gzipSync];\n  }], function (ev) {\n    return pbf(gzipSync(ev.data[0], ev.data[1]));\n  }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nfunction gzipSync(data, opts) {\n  if (!opts) opts = {};\n  var c = crc(),\n    l = data.length;\n  c.p(data);\n  var d = dopt(data, opts, gzhl(opts), 8),\n    s = d.length;\n  return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/function () {\n  function Gunzip(opts, cb) {\n    this.v = 1;\n    this.r = 0;\n    Inflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be GUNZIPped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Gunzip.prototype.push = function (chunk, final) {\n    Inflate.prototype.e.call(this, chunk);\n    this.r += chunk.length;\n    if (this.v) {\n      var p = this.p.subarray(this.v - 1);\n      var s = p.length > 3 ? gzs(p) : 4;\n      if (s > p.length) {\n        if (!final) return;\n      } else if (this.v > 1 && this.onmember) {\n        this.onmember(this.r - p.length);\n      }\n      this.p = p.subarray(s), this.v = 0;\n    }\n    // necessary to prevent TS from using the closure value\n    // This allows for workerization to function correctly\n    Inflate.prototype.c.call(this, final);\n    // process concatenated GZIP\n    if (this.s.f && !this.s.l && !final) {\n      this.v = shft(this.s.p) + 9;\n      this.s = {\n        i: 0\n      };\n      this.o = new u8(0);\n      this.push(new u8(0), final);\n    }\n  };\n  return Gunzip;\n}();\n\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/function () {\n  function AsyncGunzip(opts, cb) {\n    var _this = this;\n    astrmify([bInflt, guze, function () {\n      return [astrm, Inflate, Gunzip];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Gunzip(ev.data);\n      strm.onmember = function (offset) {\n        return postMessage(offset);\n      };\n      onmessage = astrm(strm);\n    }, 9, 0, function (offset) {\n      return _this.onmember && _this.onmember(offset);\n    });\n  }\n  return AsyncGunzip;\n}();\n\nfunction gunzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt, guze, function () {\n    return [gunzipSync];\n  }], function (ev) {\n    return pbf(gunzipSync(ev.data[0], ev.data[1]));\n  }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction gunzipSync(data, opts) {\n  var st = gzs(data);\n  if (st + 8 > data.length) _err(6, 'invalid gzip data');\n  return inflt(data.subarray(st, -8), {\n    i: 2\n  }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/function () {\n  function Zlib(opts, cb) {\n    this.c = adler();\n    this.v = 1;\n    Deflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be zlibbed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Zlib.prototype.push = function (chunk, final) {\n    this.c.p(chunk);\n    Deflate.prototype.push.call(this, chunk, final);\n  };\n  Zlib.prototype.p = function (c, f) {\n    var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n    if (this.v) zlh(raw, this.o), this.v = 0;\n    if (f) wbytes(raw, raw.length - 4, this.c.d());\n    this.ondata(raw, f);\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * zlibbed output for small inputs.\n   */\n  Zlib.prototype.flush = function () {\n    Deflate.prototype.flush.call(this);\n  };\n  return Zlib;\n}();\n\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/function () {\n  function AsyncZlib(opts, cb) {\n    astrmify([bDflt, zle, function () {\n      return [astrm, Deflate, Zlib];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Zlib(ev.data);\n      onmessage = astrm(strm);\n    }, 10, 1);\n  }\n  return AsyncZlib;\n}();\n\nfunction zlib(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt, zle, function () {\n    return [zlibSync];\n  }], function (ev) {\n    return pbf(zlibSync(ev.data[0], ev.data[1]));\n  }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nfunction zlibSync(data, opts) {\n  if (!opts) opts = {};\n  var a = adler();\n  a.p(data);\n  var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n  return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/function () {\n  function Unzlib(opts, cb) {\n    Inflate.call(this, opts, cb);\n    this.v = opts && opts.dictionary ? 2 : 1;\n  }\n  /**\n   * Pushes a chunk to be unzlibbed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Unzlib.prototype.push = function (chunk, final) {\n    Inflate.prototype.e.call(this, chunk);\n    if (this.v) {\n      if (this.p.length < 6 && !final) return;\n      this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n    }\n    if (final) {\n      if (this.p.length < 4) _err(6, 'invalid zlib data');\n      this.p = this.p.subarray(0, -4);\n    }\n    // necessary to prevent TS from using the closure value\n    // This allows for workerization to function correctly\n    Inflate.prototype.c.call(this, final);\n  };\n  return Unzlib;\n}();\n\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/function () {\n  function AsyncUnzlib(opts, cb) {\n    astrmify([bInflt, zule, function () {\n      return [astrm, Inflate, Unzlib];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Unzlib(ev.data);\n      onmessage = astrm(strm);\n    }, 11, 0);\n  }\n  return AsyncUnzlib;\n}();\n\nfunction unzlib(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt, zule, function () {\n    return [unzlibSync];\n  }], function (ev) {\n    return pbf(unzlibSync(ev.data[0], gopt(ev.data[1])));\n  }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction unzlibSync(data, opts) {\n  return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), {\n    i: 2\n  }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\n\n\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/function () {\n  function Decompress(opts, cb) {\n    this.o = StrmOpt.call(this, opts, cb) || {};\n    this.G = Gunzip;\n    this.I = Inflate;\n    this.Z = Unzlib;\n  }\n  // init substream\n  // overriden by AsyncDecompress\n  Decompress.prototype.i = function () {\n    var _this = this;\n    this.s.ondata = function (dat, final) {\n      _this.ondata(dat, final);\n    };\n  };\n  /**\n   * Pushes a chunk to be decompressed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Decompress.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (!this.s) {\n      if (this.p && this.p.length) {\n        var n = new u8(this.p.length + chunk.length);\n        n.set(this.p), n.set(chunk, this.p.length);\n      } else this.p = chunk;\n      if (this.p.length > 2) {\n        this.s = this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8 ? new this.G(this.o) : (this.p[0] & 15) != 8 || this.p[0] >> 4 > 7 || (this.p[0] << 8 | this.p[1]) % 31 ? new this.I(this.o) : new this.Z(this.o);\n        this.i();\n        this.s.push(this.p, final);\n        this.p = null;\n      }\n    } else this.s.push(chunk, final);\n  };\n  return Decompress;\n}();\n\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/function () {\n  function AsyncDecompress(opts, cb) {\n    Decompress.call(this, opts, cb);\n    this.queuedSize = 0;\n    this.G = AsyncGunzip;\n    this.I = AsyncInflate;\n    this.Z = AsyncUnzlib;\n  }\n  AsyncDecompress.prototype.i = function () {\n    var _this = this;\n    this.s.ondata = function (err, dat, final) {\n      _this.ondata(err, dat, final);\n    };\n    this.s.ondrain = function (size) {\n      _this.queuedSize -= size;\n      if (_this.ondrain) _this.ondrain(size);\n    };\n  };\n  /**\n   * Pushes a chunk to be decompressed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  AsyncDecompress.prototype.push = function (chunk, final) {\n    this.queuedSize += chunk.length;\n    Decompress.prototype.push.call(this, chunk, final);\n  };\n  return AsyncDecompress;\n}();\n\nfunction decompress(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return data[0] == 31 && data[1] == 139 && data[2] == 8 ? gunzip(data, opts, cb) : (data[0] & 15) != 8 || data[0] >> 4 > 7 || (data[0] << 8 | data[1]) % 31 ? inflate(data, opts, cb) : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction decompressSync(data, opts) {\n  return data[0] == 31 && data[1] == 139 && data[2] == 8 ? gunzipSync(data, opts) : (data[0] & 15) != 8 || data[0] >> 4 > 7 || (data[0] << 8 | data[1]) % 31 ? inflateSync(data, opts) : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar _fltn = function fltn(d, p, t, o) {\n  for (var k in d) {\n    var val = d[k],\n      n = p + k,\n      op = o;\n    if (Array.isArray(val)) op = mrg(o, val[1]), val = val[0];\n    if (val instanceof u8) t[n] = [val, op];else {\n      t[n += '/'] = [new u8(0), op];\n      _fltn(val, n, t, o);\n    }\n  }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n  td.decode(et, {\n    stream: true\n  });\n  tds = 1;\n} catch (e) {}\n// decode UTF8\nvar dutf8 = function dutf8(d) {\n  for (var r = '', i = 0;;) {\n    var c = d[i++];\n    var eb = (c > 127) + (c > 223) + (c > 239);\n    if (i + eb > d.length) return {\n      s: r,\n      r: slc(d, i - 1)\n    };\n    if (!eb) r += String.fromCharCode(c);else if (eb == 3) {\n      c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | d[i++] & 63) - 65536, r += String.fromCharCode(55296 | c >> 10, 56320 | c & 1023);\n    } else if (eb & 1) r += String.fromCharCode((c & 31) << 6 | d[i++] & 63);else r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | d[i++] & 63);\n  }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/function () {\n  /**\n   * Creates a UTF-8 decoding stream\n   * @param cb The callback to call whenever data is decoded\n   */\n  function DecodeUTF8(cb) {\n    this.ondata = cb;\n    if (tds) this.t = new TextDecoder();else this.p = et;\n  }\n  /**\n   * Pushes a chunk to be decoded from UTF-8 binary\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  DecodeUTF8.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    final = !!final;\n    if (this.t) {\n      this.ondata(this.t.decode(chunk, {\n        stream: true\n      }), final);\n      if (final) {\n        if (this.t.decode().length) _err(8);\n        this.t = null;\n      }\n      return;\n    }\n    if (!this.p) _err(4);\n    var dat = new u8(this.p.length + chunk.length);\n    dat.set(this.p);\n    dat.set(chunk, this.p.length);\n    var _a = dutf8(dat),\n      s = _a.s,\n      r = _a.r;\n    if (final) {\n      if (r.length) _err(8);\n      this.p = null;\n    } else this.p = r;\n    this.ondata(s, final);\n  };\n  return DecodeUTF8;\n}();\n\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/function () {\n  /**\n   * Creates a UTF-8 decoding stream\n   * @param cb The callback to call whenever data is encoded\n   */\n  function EncodeUTF8(cb) {\n    this.ondata = cb;\n  }\n  /**\n   * Pushes a chunk to be encoded to UTF-8\n   * @param chunk The string data to push\n   * @param final Whether this is the last chunk\n   */\n  EncodeUTF8.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (this.d) _err(4);\n    this.ondata(strToU8(chunk), this.d = final || false);\n  };\n  return EncodeUTF8;\n}();\n\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nfunction strToU8(str, latin1) {\n  if (latin1) {\n    var ar_1 = new u8(str.length);\n    for (var i = 0; i < str.length; ++i) ar_1[i] = str.charCodeAt(i);\n    return ar_1;\n  }\n  if (te) return te.encode(str);\n  var l = str.length;\n  var ar = new u8(str.length + (str.length >> 1));\n  var ai = 0;\n  var w = function w(v) {\n    ar[ai++] = v;\n  };\n  for (var i = 0; i < l; ++i) {\n    if (ai + 5 > ar.length) {\n      var n = new u8(ai + 8 + (l - i << 1));\n      n.set(ar);\n      ar = n;\n    }\n    var c = str.charCodeAt(i);\n    if (c < 128 || latin1) w(c);else if (c < 2048) w(192 | c >> 6), w(128 | c & 63);else if (c > 55295 && c < 57344) c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);else w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);\n  }\n  return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nfunction strFromU8(dat, latin1) {\n  if (latin1) {\n    var r = '';\n    for (var i = 0; i < dat.length; i += 16384) r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n    return r;\n  } else if (td) {\n    return td.decode(dat);\n  } else {\n    var _a = dutf8(dat),\n      s = _a.s,\n      r = _a.r;\n    if (r.length) _err(8);\n    return s;\n  }\n}\n;\n// deflate bit flag\nvar dbf = function dbf(l) {\n  return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0;\n};\n// skip local zip header\nvar slzh = function slzh(d, b) {\n  return b + 30 + b2(d, b + 26) + b2(d, b + 28);\n};\n// read zip header\nvar zh = function zh(d, b, z) {\n  var fnl = b2(d, b + 28),\n    fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)),\n    es = b + 46 + fnl,\n    bs = b4(d, b + 20);\n  var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)],\n    sc = _a[0],\n    su = _a[1],\n    off = _a[2];\n  return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function z64e(d, b) {\n  for (; b2(d, b) != 1; b += 4 + b2(d, b + 2));\n  return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function exfl(ex) {\n  var le = 0;\n  if (ex) {\n    for (var k in ex) {\n      var l = ex[k].length;\n      if (l > 65535) _err(9);\n      le += l + 4;\n    }\n  }\n  return le;\n};\n// write zip header\nvar wzh = function wzh(d, b, f, fn, u, c, ce, co) {\n  var fl = fn.length,\n    ex = f.extra,\n    col = co && co.length;\n  var exl = exfl(ex);\n  wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n  if (ce != null) d[b++] = 20, d[b++] = f.os;\n  d[b] = 20, b += 2; // spec compliance? what's that?\n  d[b++] = f.flag << 1 | (c < 0 && 8), d[b++] = u && 8;\n  d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n  var dt = new Date(f.mtime == null ? Date.now() : f.mtime),\n    y = dt.getFullYear() - 1980;\n  if (y < 0 || y > 119) _err(10);\n  wbytes(d, b, y << 25 | dt.getMonth() + 1 << 21 | dt.getDate() << 16 | dt.getHours() << 11 | dt.getMinutes() << 5 | dt.getSeconds() >> 1), b += 4;\n  if (c != -1) {\n    wbytes(d, b, f.crc);\n    wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n    wbytes(d, b + 8, f.size);\n  }\n  wbytes(d, b + 12, fl);\n  wbytes(d, b + 14, exl), b += 16;\n  if (ce != null) {\n    wbytes(d, b, col);\n    wbytes(d, b + 6, f.attrs);\n    wbytes(d, b + 10, ce), b += 14;\n  }\n  d.set(fn, b);\n  b += fl;\n  if (exl) {\n    for (var k in ex) {\n      var exf = ex[k],\n        l = exf.length;\n      wbytes(d, b, +k);\n      wbytes(d, b + 2, l);\n      d.set(exf, b + 4), b += 4 + l;\n    }\n  }\n  if (col) d.set(co, b), b += col;\n  return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function wzf(o, b, c, d, e) {\n  wbytes(o, b, 0x6054B50); // skip disk\n  wbytes(o, b + 8, c);\n  wbytes(o, b + 10, c);\n  wbytes(o, b + 12, d);\n  wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/function () {\n  /**\n   * Creates a pass-through stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   */\n  function ZipPassThrough(filename) {\n    this.filename = filename;\n    this.c = crc();\n    this.size = 0;\n    this.compression = 0;\n  }\n  /**\n   * Processes a chunk and pushes to the output stream. You can override this\n   * method in a subclass for custom behavior, but by default this passes\n   * the data through. You must call this.ondata(err, chunk, final) at some\n   * point in this method.\n   * @param chunk The chunk to process\n   * @param final Whether this is the last chunk\n   */\n  ZipPassThrough.prototype.process = function (chunk, final) {\n    this.ondata(null, chunk, final);\n  };\n  /**\n   * Pushes a chunk to be added. If you are subclassing this with a custom\n   * compression algorithm, note that you must push data from the source\n   * file only, pre-compression.\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  ZipPassThrough.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    this.c.p(chunk);\n    this.size += chunk.length;\n    if (final) this.crc = this.c.d();\n    this.process(chunk, final || false);\n  };\n  return ZipPassThrough;\n}();\n\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   * @param opts The compression options\n   */\n  function ZipDeflate(filename, opts) {\n    var _this = this;\n    if (!opts) opts = {};\n    ZipPassThrough.call(this, filename);\n    this.d = new Deflate(opts, function (dat, final) {\n      _this.ondata(null, dat, final);\n    });\n    this.compression = 8;\n    this.flag = dbf(opts.level);\n  }\n  ZipDeflate.prototype.process = function (chunk, final) {\n    try {\n      this.d.push(chunk, final);\n    } catch (e) {\n      this.ondata(e, null, final);\n    }\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  ZipDeflate.prototype.push = function (chunk, final) {\n    ZipPassThrough.prototype.push.call(this, chunk, final);\n  };\n  return ZipDeflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/function () {\n  /**\n   * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   * @param opts The compression options\n   */\n  function AsyncZipDeflate(filename, opts) {\n    var _this = this;\n    if (!opts) opts = {};\n    ZipPassThrough.call(this, filename);\n    this.d = new AsyncDeflate(opts, function (err, dat, final) {\n      _this.ondata(err, dat, final);\n    });\n    this.compression = 8;\n    this.flag = dbf(opts.level);\n    this.terminate = this.d.terminate;\n  }\n  AsyncZipDeflate.prototype.process = function (chunk, final) {\n    this.d.push(chunk, final);\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  AsyncZipDeflate.prototype.push = function (chunk, final) {\n    ZipPassThrough.prototype.push.call(this, chunk, final);\n  };\n  return AsyncZipDeflate;\n}();\n\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/function () {\n  /**\n   * Creates an empty ZIP archive to which files can be added\n   * @param cb The callback to call whenever data for the generated ZIP archive\n   *           is available\n   */\n  function Zip(cb) {\n    this.ondata = cb;\n    this.u = [];\n    this.d = 1;\n  }\n  /**\n   * Adds a file to the ZIP archive\n   * @param file The file stream to add\n   */\n  Zip.prototype.add = function (file) {\n    var _this = this;\n    if (!this.ondata) _err(5);\n    // finishing or finished\n    if (this.d & 2) this.ondata(_err(4 + (this.d & 1) * 8, 0, 1), null, false);else {\n      var f = strToU8(file.filename),\n        fl_1 = f.length;\n      var com = file.comment,\n        o = com && strToU8(com);\n      var u = fl_1 != file.filename.length || o && com.length != o.length;\n      var hl_1 = fl_1 + exfl(file.extra) + 30;\n      if (fl_1 > 65535) this.ondata(_err(11, 0, 1), null, false);\n      var header = new u8(hl_1);\n      wzh(header, 0, file, f, u, -1);\n      var chks_1 = [header];\n      var pAll_1 = function pAll_1() {\n        for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n          var chk = chks_2[_i];\n          _this.ondata(null, chk, false);\n        }\n        chks_1 = [];\n      };\n      var tr_1 = this.d;\n      this.d = 0;\n      var ind_1 = this.u.length;\n      var uf_1 = mrg(file, {\n        f: f,\n        u: u,\n        o: o,\n        t: function t() {\n          if (file.terminate) file.terminate();\n        },\n        r: function r() {\n          pAll_1();\n          if (tr_1) {\n            var nxt = _this.u[ind_1 + 1];\n            if (nxt) nxt.r();else _this.d = 1;\n          }\n          tr_1 = 1;\n        }\n      });\n      var cl_1 = 0;\n      file.ondata = function (err, dat, final) {\n        if (err) {\n          _this.ondata(err, dat, final);\n          _this.terminate();\n        } else {\n          cl_1 += dat.length;\n          chks_1.push(dat);\n          if (final) {\n            var dd = new u8(16);\n            wbytes(dd, 0, 0x8074B50);\n            wbytes(dd, 4, file.crc);\n            wbytes(dd, 8, cl_1);\n            wbytes(dd, 12, file.size);\n            chks_1.push(dd);\n            uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n            if (tr_1) uf_1.r();\n            tr_1 = 1;\n          } else if (tr_1) pAll_1();\n        }\n      };\n      this.u.push(uf_1);\n    }\n  };\n  /**\n   * Ends the process of adding files and prepares to emit the final chunks.\n   * This *must* be called after adding all desired files for the resulting\n   * ZIP file to work properly.\n   */\n  Zip.prototype.end = function () {\n    var _this = this;\n    if (this.d & 2) {\n      this.ondata(_err(4 + (this.d & 1) * 8, 0, 1), null, true);\n      return;\n    }\n    if (this.d) this.e();else this.u.push({\n      r: function r() {\n        if (!(_this.d & 1)) return;\n        _this.u.splice(-1, 1);\n        _this.e();\n      },\n      t: function t() {}\n    });\n    this.d = 3;\n  };\n  Zip.prototype.e = function () {\n    var bt = 0,\n      l = 0,\n      tl = 0;\n    for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n      var f = _a[_i];\n      tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n    }\n    var out = new u8(tl + 22);\n    for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n      var f = _c[_b];\n      wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n      bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n    }\n    wzf(out, bt, this.u.length, tl, l);\n    this.ondata(null, out, true);\n    this.d = 2;\n  };\n  /**\n   * A method to terminate any internal workers used by the stream. Subsequent\n   * calls to add() will fail.\n   */\n  Zip.prototype.terminate = function () {\n    for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n      var f = _a[_i];\n      f.t();\n    }\n    this.d = 2;\n  };\n  return Zip;\n}();\n\nfunction zip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  var r = {};\n  _fltn(data, '', r, opts);\n  var k = Object.keys(r);\n  var lft = k.length,\n    o = 0,\n    tot = 0;\n  var slft = lft,\n    files = new Array(lft);\n  var term = [];\n  var tAll = function tAll() {\n    for (var i = 0; i < term.length; ++i) term[i]();\n  };\n  var cbd = function cbd(a, b) {\n    mt(function () {\n      cb(a, b);\n    });\n  };\n  mt(function () {\n    cbd = cb;\n  });\n  var cbf = function cbf() {\n    var out = new u8(tot + 22),\n      oe = o,\n      cdl = tot - o;\n    tot = 0;\n    for (var i = 0; i < slft; ++i) {\n      var f = files[i];\n      try {\n        var l = f.c.length;\n        wzh(out, tot, f, f.f, f.u, l);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        var loc = tot + badd;\n        out.set(f.c, loc);\n        wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n      } catch (e) {\n        return cbd(e, null);\n      }\n    }\n    wzf(out, o, files.length, cdl, oe);\n    cbd(null, out);\n  };\n  if (!lft) cbf();\n  var _loop_1 = function _loop_1(i) {\n    var fn = k[i];\n    var _a = r[fn],\n      file = _a[0],\n      p = _a[1];\n    var c = crc(),\n      size = file.length;\n    c.p(file);\n    var f = strToU8(fn),\n      s = f.length;\n    var com = p.comment,\n      m = com && strToU8(com),\n      ms = m && m.length;\n    var exl = exfl(p.extra);\n    var compression = p.level == 0 ? 0 : 8;\n    var cbl = function cbl(e, d) {\n      if (e) {\n        tAll();\n        cbd(e, null);\n      } else {\n        var l = d.length;\n        files[i] = mrg(p, {\n          size: size,\n          crc: c.d(),\n          c: d,\n          f: f,\n          m: m,\n          u: s != fn.length || m && com.length != ms,\n          compression: compression\n        });\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n        if (! --lft) cbf();\n      }\n    };\n    if (s > 65535) cbl(_err(11, 0, 1), null);\n    if (!compression) cbl(null, file);else if (size < 160000) {\n      try {\n        cbl(null, deflateSync(file, p));\n      } catch (e) {\n        cbl(e, null);\n      }\n    } else term.push(deflate(file, p, cbl));\n  };\n  // Cannot use lft because it can decrease\n  for (var i = 0; i < slft; ++i) {\n    _loop_1(i);\n  }\n  return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nfunction zipSync(data, opts) {\n  if (!opts) opts = {};\n  var r = {};\n  var files = [];\n  _fltn(data, '', r, opts);\n  var o = 0;\n  var tot = 0;\n  for (var fn in r) {\n    var _a = r[fn],\n      file = _a[0],\n      p = _a[1];\n    var compression = p.level == 0 ? 0 : 8;\n    var f = strToU8(fn),\n      s = f.length;\n    var com = p.comment,\n      m = com && strToU8(com),\n      ms = m && m.length;\n    var exl = exfl(p.extra);\n    if (s > 65535) _err(11);\n    var d = compression ? deflateSync(file, p) : file,\n      l = d.length;\n    var c = crc();\n    c.p(file);\n    files.push(mrg(p, {\n      size: file.length,\n      crc: c.d(),\n      c: d,\n      f: f,\n      m: m,\n      u: s != fn.length || m && com.length != ms,\n      o: o,\n      compression: compression\n    }));\n    o += 30 + s + exl + l;\n    tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n  }\n  var out = new u8(tot + 22),\n    oe = o,\n    cdl = tot - o;\n  for (var i = 0; i < files.length; ++i) {\n    var f = files[i];\n    wzh(out, f.o, f, f.f, f.u, f.c.length);\n    var badd = 30 + f.f.length + exfl(f.extra);\n    out.set(f.c, f.o + badd);\n    wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n  }\n  wzf(out, o, files.length, cdl, oe);\n  return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/function () {\n  function UnzipPassThrough() {}\n  UnzipPassThrough.prototype.push = function (data, final) {\n    this.ondata(null, data, final);\n  };\n  UnzipPassThrough.compression = 0;\n  return UnzipPassThrough;\n}();\n\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE decompression that can be used in ZIP archives\n   */\n  function UnzipInflate() {\n    var _this = this;\n    this.i = new Inflate(function (dat, final) {\n      _this.ondata(null, dat, final);\n    });\n  }\n  UnzipInflate.prototype.push = function (data, final) {\n    try {\n      this.i.push(data, final);\n    } catch (e) {\n      this.ondata(e, null, final);\n    }\n  };\n  UnzipInflate.compression = 8;\n  return UnzipInflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE decompression that can be used in ZIP archives\n   */\n  function AsyncUnzipInflate(_, sz) {\n    var _this = this;\n    if (sz < 320000) {\n      this.i = new Inflate(function (dat, final) {\n        _this.ondata(null, dat, final);\n      });\n    } else {\n      this.i = new AsyncInflate(function (err, dat, final) {\n        _this.ondata(err, dat, final);\n      });\n      this.terminate = this.i.terminate;\n    }\n  }\n  AsyncUnzipInflate.prototype.push = function (data, final) {\n    if (this.i.terminate) data = slc(data, 0);\n    this.i.push(data, final);\n  };\n  AsyncUnzipInflate.compression = 8;\n  return AsyncUnzipInflate;\n}();\n\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/function () {\n  /**\n   * Creates a ZIP decompression stream\n   * @param cb The callback to call whenever a file in the ZIP archive is found\n   */\n  function Unzip(cb) {\n    this.onfile = cb;\n    this.k = [];\n    this.o = {\n      0: UnzipPassThrough\n    };\n    this.p = et;\n  }\n  /**\n   * Pushes a chunk to be unzipped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Unzip.prototype.push = function (chunk, final) {\n    var _this = this;\n    if (!this.onfile) _err(5);\n    if (!this.p) _err(4);\n    if (this.c > 0) {\n      var len = Math.min(this.c, chunk.length);\n      var toAdd = chunk.subarray(0, len);\n      this.c -= len;\n      if (this.d) this.d.push(toAdd, !this.c);else this.k[0].push(toAdd);\n      chunk = chunk.subarray(len);\n      if (chunk.length) return this.push(chunk, final);\n    } else {\n      var f = 0,\n        i = 0,\n        is = void 0,\n        buf = void 0;\n      if (!this.p.length) buf = chunk;else if (!chunk.length) buf = this.p;else {\n        buf = new u8(this.p.length + chunk.length);\n        buf.set(this.p), buf.set(chunk, this.p.length);\n      }\n      var l = buf.length,\n        oc = this.c,\n        add = oc && this.d;\n      var _loop_2 = function _loop_2() {\n        var _a;\n        var sig = b4(buf, i);\n        if (sig == 0x4034B50) {\n          f = 1, is = i;\n          this_1.d = null;\n          this_1.c = 0;\n          var bf = b2(buf, i + 6),\n            cmp_1 = b2(buf, i + 8),\n            u = bf & 2048,\n            dd = bf & 8,\n            fnl = b2(buf, i + 26),\n            es = b2(buf, i + 28);\n          if (l > i + 30 + fnl + es) {\n            var chks_3 = [];\n            this_1.k.unshift(chks_3);\n            f = 2;\n            var sc_1 = b4(buf, i + 18),\n              su_1 = b4(buf, i + 22);\n            var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n            if (sc_1 == 4294967295) {\n              _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n            } else if (dd) sc_1 = -1;\n            i += es;\n            this_1.c = sc_1;\n            var d_1;\n            var file_1 = {\n              name: fn_1,\n              compression: cmp_1,\n              start: function start() {\n                if (!file_1.ondata) _err(5);\n                if (!sc_1) file_1.ondata(null, et, true);else {\n                  var ctr = _this.o[cmp_1];\n                  if (!ctr) file_1.ondata(_err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                  d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                  d_1.ondata = function (err, dat, final) {\n                    file_1.ondata(err, dat, final);\n                  };\n                  for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                    var dat = chks_4[_i];\n                    d_1.push(dat, false);\n                  }\n                  if (_this.k[0] == chks_3 && _this.c) _this.d = d_1;else d_1.push(et, true);\n                }\n              },\n              terminate: function terminate() {\n                if (d_1 && d_1.terminate) d_1.terminate();\n              }\n            };\n            if (sc_1 >= 0) file_1.size = sc_1, file_1.originalSize = su_1;\n            this_1.onfile(file_1);\n          }\n          return \"break\";\n        } else if (oc) {\n          if (sig == 0x8074B50) {\n            is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n            return \"break\";\n          } else if (sig == 0x2014B50) {\n            is = i -= 4, f = 3, this_1.c = 0;\n            return \"break\";\n          }\n        }\n      };\n      var this_1 = this;\n      for (; i < l - 4; ++i) {\n        var state_1 = _loop_2();\n        if (state_1 === \"break\") break;\n      }\n      this.p = et;\n      if (oc < 0) {\n        var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n        if (add) add.push(dat, !!f);else this.k[+(f == 2)].push(dat);\n      }\n      if (f & 2) return this.push(buf.subarray(i), final);\n      this.p = buf.subarray(i);\n    }\n    if (final) {\n      if (this.c) _err(13);\n      this.p = null;\n    }\n  };\n  /**\n   * Registers a decoder with the stream, allowing for files compressed with\n   * the compression type provided to be expanded correctly\n   * @param decoder The decoder constructor\n   */\n  Unzip.prototype.register = function (decoder) {\n    this.o[decoder.compression] = decoder;\n  };\n  return Unzip;\n}();\n\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) {\n  fn();\n};\nfunction unzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  var term = [];\n  var tAll = function tAll() {\n    for (var i = 0; i < term.length; ++i) term[i]();\n  };\n  var files = {};\n  var cbd = function cbd(a, b) {\n    mt(function () {\n      cb(a, b);\n    });\n  };\n  mt(function () {\n    cbd = cb;\n  });\n  var e = data.length - 22;\n  for (; b4(data, e) != 0x6054B50; --e) {\n    if (!e || data.length - e > 65558) {\n      cbd(_err(13, 0, 1), null);\n      return tAll;\n    }\n  }\n  ;\n  var lft = b2(data, e + 8);\n  if (lft) {\n    var c = lft;\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n      var ze = b4(data, e - 12);\n      z = b4(data, ze) == 0x6064B50;\n      if (z) {\n        c = lft = b4(data, ze + 32);\n        o = b4(data, ze + 48);\n      }\n    }\n    var fltr = opts && opts.filter;\n    var _loop_3 = function _loop_3(i) {\n      var _a = zh(data, o, z),\n        c_1 = _a[0],\n        sc = _a[1],\n        su = _a[2],\n        fn = _a[3],\n        no = _a[4],\n        off = _a[5],\n        b = slzh(data, off);\n      o = no;\n      var cbl = function cbl(e, d) {\n        if (e) {\n          tAll();\n          cbd(e, null);\n        } else {\n          if (d) files[fn] = d;\n          if (! --lft) cbd(null, files);\n        }\n      };\n      if (!fltr || fltr({\n        name: fn,\n        size: sc,\n        originalSize: su,\n        compression: c_1\n      })) {\n        if (!c_1) cbl(null, slc(data, b, b + sc));else if (c_1 == 8) {\n          var infl = data.subarray(b, b + sc);\n          // Synchronously decompress under 512KB, or barely-compressed data\n          if (su < 524288 || sc > 0.8 * su) {\n            try {\n              cbl(null, inflateSync(infl, {\n                out: new u8(su)\n              }));\n            } catch (e) {\n              cbl(e, null);\n            }\n          } else term.push(inflate(infl, {\n            size: su\n          }, cbl));\n        } else cbl(_err(14, 'unknown compression type ' + c_1, 1), null);\n      } else cbl(null, null);\n    };\n    for (var i = 0; i < c; ++i) {\n      _loop_3(i);\n    }\n  } else cbd(null, {});\n  return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nfunction unzipSync(data, opts) {\n  var files = {};\n  var e = data.length - 22;\n  for (; b4(data, e) != 0x6054B50; --e) {\n    if (!e || data.length - e > 65558) _err(13);\n  }\n  ;\n  var c = b2(data, e + 8);\n  if (!c) return {};\n  var o = b4(data, e + 16);\n  var z = o == 4294967295 || c == 65535;\n  if (z) {\n    var ze = b4(data, e - 12);\n    z = b4(data, ze) == 0x6064B50;\n    if (z) {\n      c = b4(data, ze + 32);\n      o = b4(data, ze + 48);\n    }\n  }\n  var fltr = opts && opts.filter;\n  for (var i = 0; i < c; ++i) {\n    var _a = zh(data, o, z),\n      c_2 = _a[0],\n      sc = _a[1],\n      su = _a[2],\n      fn = _a[3],\n      no = _a[4],\n      off = _a[5],\n      b = slzh(data, off);\n    o = no;\n    if (!fltr || fltr({\n      name: fn,\n      size: sc,\n      originalSize: su,\n      compression: c_2\n    })) {\n      if (!c_2) files[fn] = slc(data, b, b + sc);else if (c_2 == 8) files[fn] = inflateSync(data.subarray(b, b + sc), {\n        out: new u8(su)\n      });else _err(14, 'unknown compression type ' + c_2);\n    }\n  }\n  return files;\n}\n// CONCATENATED MODULE: ./node_modules/babel-loader/lib!./node_modules/eslint-loader??ref--13-0!./packages/utils/StreamLoaderParser.worker.js\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\n\nself.__streamLoaderStates = self.__streamLoaderStates || new Map();\nvar utf8Decoder = new TextDecoder('utf-8');\nself.onmessage = function (e) {\n  var _e$data = e.data,\n    id = _e$data.id,\n    type = _e$data.type,\n    data = _e$data.data;\n  if (type === 'parseBufferData') {\n    try {\n      var buffer = data.buffer,\n        prefixIdKey = data.prefixIdKey;\n      var result = parseBufferData(buffer, prefixIdKey);\n      // Transfer the buffer back if possible, but we constructed new arrays.\n      // We rely on structured cloning.\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: result\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamInit') {\n    try {\n      var _ref = data || {},\n        streamId = _ref.streamId,\n        _prefixIdKey = _ref.prefixIdKey;\n      if (!streamId) throw new Error('Missing streamId');\n      var state = createStreamState(_prefixIdKey);\n      self.__streamLoaderStates.set(streamId, state);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: true\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamPush') {\n    try {\n      var _ref2 = data || {},\n        _streamId = _ref2.streamId,\n        chunk = _ref2.chunk,\n        _ref2$byteOffset = _ref2.byteOffset,\n        byteOffset = _ref2$byteOffset === void 0 ? 0 : _ref2$byteOffset,\n        byteLength = _ref2.byteLength,\n        _prefixIdKey2 = _ref2.prefixIdKey;\n      if (!_streamId) throw new Error('Missing streamId');\n      var _state = self.__streamLoaderStates.get(_streamId);\n      if (!_state) {\n        _state = createStreamState(_prefixIdKey2);\n        self.__streamLoaderStates.set(_streamId, _state);\n      }\n      var view = new Uint8Array(chunk, byteOffset, byteLength !== null && byteLength !== void 0 ? byteLength : chunk.byteLength - byteOffset);\n      var _result = parseStreamChunk(_state, view);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamFlush') {\n    try {\n      var _ref3 = data || {},\n        _streamId2 = _ref3.streamId;\n      if (!_streamId2) throw new Error('Missing streamId');\n      var _state2 = self.__streamLoaderStates.get(_streamId2);\n      if (!_state2) {\n        self.postMessage({\n          id: id,\n          type: 'success',\n          result: {\n            meshes: [],\n            primitives: []\n          }\n        });\n        return;\n      }\n      var _result2 = parseStreamChunk(_state2, null, true);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result2\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamDispose') {\n    try {\n      var _ref4 = data || {},\n        _streamId3 = _ref4.streamId;\n      if (_streamId3) self.__streamLoaderStates.delete(_streamId3);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: true\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'buildInstancedMapping') {\n    try {\n      var _ref5 = data || {},\n        instances = _ref5.instances,\n        drawObjs = _ref5.drawObjs;\n      var _result3 = buildInstancedMapping(instances || [], drawObjs || []);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result3\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'occlusionScan') {\n    var transfer = data && data.buffer ? [data.buffer] : [];\n    try {\n      var _ref6 = data || {},\n        _buffer = _ref6.buffer,\n        sw = _ref6.sw,\n        sh = _ref6.sh,\n        stride = _ref6.stride,\n        maxIdx = _ref6.maxIdx,\n        minSampleCount = _ref6.minSampleCount;\n      var _result4 = scanOcclusionBuffer(_buffer, sw, sh, stride, maxIdx, minSampleCount);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result4,\n        buffer: _buffer\n      }, transfer);\n    } catch (error) {\n      var _buffer2 = data && data.buffer ? data.buffer : null;\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message,\n        buffer: _buffer2\n      }, transfer);\n    }\n  }\n};\nfunction createStreamState(prefixIdKey) {\n  return {\n    prefixIdKey: prefixIdKey || '',\n    buffer: new Uint8Array(),\n    pendingMesh: null,\n    pendingPrimitiveIds: new Set(),\n    pendingPrimitiveGroups: [],\n    pendingMatchedPrimitiveIds: new Set(),\n    expectingMesh: true,\n    isFullProps: true\n  };\n}\nfunction parseStreamChunk(state, chunkView) {\n  var flushing = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (chunkView && chunkView.length > 0) {\n    var merged = new Uint8Array(state.buffer.length + chunkView.length);\n    merged.set(state.buffer);\n    merged.set(chunkView, state.buffer.length);\n    state.buffer = merged;\n  }\n  var meshes = [];\n  var primitives = [];\n  var commitPendingMesh = function commitPendingMesh() {\n    if (!state.pendingMesh) return;\n    var meshList = Array.isArray(state.pendingMesh) ? state.pendingMesh : [state.pendingMesh];\n    meshList.forEach(function (mesh) {\n      meshes.push(mesh);\n      primitives.push(state.pendingPrimitiveGroups);\n    });\n    state.pendingMesh = null;\n    state.pendingPrimitiveIds = new Set();\n    state.pendingPrimitiveGroups = [];\n    state.pendingMatchedPrimitiveIds = new Set();\n  };\n  while (state.buffer.length > 0) {\n    if (state.expectingMesh) {\n      var meshResult = tryParseMeshFromState(state);\n      if (meshResult.status === 'incomplete') break;\n      if (meshResult.status === 'invalid') {\n        break;\n      }\n      commitPendingMesh();\n      state.pendingMesh = meshResult.mesh;\n      state.pendingPrimitiveIds = new Set(collectMeshPrimitiveIds(meshResult.mesh));\n      state.pendingPrimitiveGroups = [];\n      state.pendingMatchedPrimitiveIds = new Set();\n      state.expectingMesh = false;\n      state.buffer = state.buffer.slice(meshResult.totalLen);\n    } else {\n      var nextMeshResult = tryParseMeshFromState(state);\n      if (nextMeshResult.status === 'success') {\n        commitPendingMesh();\n        state.pendingMesh = nextMeshResult.mesh;\n        state.pendingPrimitiveIds = new Set(collectMeshPrimitiveIds(nextMeshResult.mesh));\n        state.pendingPrimitiveGroups = [];\n        state.pendingMatchedPrimitiveIds = new Set();\n        state.expectingMesh = false;\n        state.buffer = state.buffer.slice(nextMeshResult.totalLen);\n        continue;\n      }\n      if (state.buffer.length < 12) break;\n      var primitiveResult = null;\n      try {\n        primitiveResult = parsePrimitiveFromState(state);\n      } catch (e) {\n        break;\n      }\n      var primitiveData = primitiveResult.primitive;\n      if (state.pendingPrimitiveIds.has(primitiveData.id)) {\n        state.pendingPrimitiveGroups.push(primitiveData);\n        state.pendingMatchedPrimitiveIds.add(primitiveData.id);\n      }\n      state.buffer = state.buffer.slice(primitiveResult.consumedBytes);\n      if (state.pendingPrimitiveIds.size > 0 && state.pendingMatchedPrimitiveIds.size >= state.pendingPrimitiveIds.size) {\n        commitPendingMesh();\n        state.expectingMesh = true;\n      }\n    }\n  }\n  if (flushing) {\n    commitPendingMesh();\n    state.buffer = new Uint8Array();\n  }\n  return {\n    meshes: meshes,\n    primitives: primitives\n  };\n}\nfunction normalizeStreamMesh(mesh, prefixIdKey) {\n  _applyPrefixId(mesh, 'id', null, prefixIdKey);\n  var meshList = Array.isArray(mesh) ? mesh : [mesh];\n  meshList.forEach(function (item) {\n    if (!item) return;\n    if (!Array.isArray(item.primitives)) {\n      item.primitives = [];\n    }\n    _applyPrefixId(item.primitives, 'prmid', item.documentId, prefixIdKey);\n  });\n  return mesh;\n}\nfunction collectMeshPrimitiveIds(mesh) {\n  var ids = [];\n  var meshList = Array.isArray(mesh) ? mesh : [mesh];\n  meshList.forEach(function (item) {\n    if (!item || !Array.isArray(item.primitives)) return;\n    item.primitives.forEach(function (primitive) {\n      if (primitive && primitive.prmid != null) {\n        ids.push(primitive.prmid);\n      }\n    });\n  });\n  return ids;\n}\nfunction isValidStreamMesh(mesh) {\n  var meshList = Array.isArray(mesh) ? mesh : [mesh];\n  if (meshList.length === 0) return false;\n  return meshList.every(function (item) {\n    return item && _typeof(item) === 'object' && Array.isArray(item.primitives);\n  });\n}\nfunction tryParseMeshFromState(state) {\n  if (state.buffer.length < 4) {\n    return {\n      status: 'incomplete'\n    };\n  }\n  var length = new DataView(state.buffer.buffer, state.buffer.byteOffset).getUint32(0, false);\n  if (length <= 0 || length > 10 * 1024 * 1024) {\n    return {\n      status: 'invalid'\n    };\n  }\n  var totalLen = 4 + length;\n  if (state.buffer.length < totalLen) {\n    return {\n      status: 'incomplete'\n    };\n  }\n  try {\n    var data = state.buffer.slice(4, totalLen);\n    var parsedMesh = JSON.parse(utf8Decoder.decode(data));\n    if (!isValidStreamMesh(parsedMesh)) {\n      return {\n        status: 'invalid'\n      };\n    }\n    var mesh = normalizeStreamMesh(parsedMesh, state.prefixIdKey);\n    return {\n      status: 'success',\n      mesh: mesh,\n      totalLen: totalLen\n    };\n  } catch (e) {\n    return {\n      status: 'invalid'\n    };\n  }\n}\nfunction parsePrimitiveFromState(state) {\n  var dataView = new DataView(state.buffer.buffer, state.buffer.byteOffset, state.buffer.byteLength);\n  var primitiveResult = parsePrimitive(dataView, state.buffer, 0, state.isFullProps);\n  var primitiveData = primitiveResult.primitive;\n  _applyPrefixId(primitiveData, 'id', null, state.prefixIdKey);\n  _applyPrefixId(primitiveData, 'material', null, state.prefixIdKey);\n  if (state.isFullProps) {\n    var _parsePrimitiveData = parsePrimitiveData(primitiveData),\n      position = _parsePrimitiveData.position,\n      normal = _parsePrimitiveData.normal,\n      posindex = _parsePrimitiveData.posindex,\n      nolindex = _parsePrimitiveData.nolindex,\n      indices = _parsePrimitiveData.indices;\n    var formatted = formatPrimitiveData({\n      position: position,\n      normal: normal,\n      posindex: posindex,\n      nolindex: nolindex\n    });\n    delete primitiveData.nolindex;\n    delete primitiveData.posindex;\n    primitiveData.position = formatted.position;\n    primitiveData.normal = formatted.normal;\n    primitiveData.indices = indices;\n  }\n  return {\n    primitive: primitiveData,\n    consumedBytes: primitiveResult.offset\n  };\n}\nfunction parseBufferData(buffer, prefixIdKey) {\n  var uint8Array = null;\n  var dataView = null;\n  var meshJsonBytes = null;\n  var primitives = [];\n  var mesh = null;\n  try {\n    uint8Array = new Uint8Array(buffer);\n    dataView = new DataView(buffer);\n    var offset = 0;\n    var meshJsonLength = dataView.getInt32(offset, false);\n    offset += 4;\n    meshJsonBytes = new Uint8Array(uint8Array.buffer.slice(offset, offset + meshJsonLength));\n    offset += meshJsonLength;\n    var meshJsonStr = utf8Decoder.decode(meshJsonBytes);\n    meshJsonBytes = null;\n    try {\n      mesh = JSON.parse(meshJsonStr);\n      _applyPrefixId(mesh, 'id', null, prefixIdKey);\n      if (Array.isArray(mesh)) {\n        mesh.forEach(function (item) {\n          _applyPrefixId(item.primitives, 'prmid', item.documentId, prefixIdKey);\n        });\n      } else {\n        _applyPrefixId(mesh.primitives, 'prmid', mesh.documentId, prefixIdKey);\n      }\n    } catch (e) {\n      console.error('JSON 解析失败:', e, meshJsonStr);\n      throw new Error('JSON解析失败');\n    }\n    while (offset < uint8Array.length) {\n      try {\n        var result = parsePrimitive(dataView, uint8Array, offset);\n        if (!result) break;\n        primitives.push(result.primitive);\n        offset = result.offset;\n      } catch (e) {\n        console.error('解析失败，偏移:', offset, e);\n        break;\n      }\n    }\n    for (var i = 0; i < primitives.length; i++) {\n      var primitive = primitives[i];\n      _applyPrefixId(primitive, 'id', null, prefixIdKey);\n      _applyPrefixId(primitive, 'material', null, prefixIdKey);\n      var _parsePrimitiveData2 = parsePrimitiveData(primitive),\n        position = _parsePrimitiveData2.position,\n        normal = _parsePrimitiveData2.normal,\n        posindex = _parsePrimitiveData2.posindex,\n        nolindex = _parsePrimitiveData2.nolindex,\n        indices = _parsePrimitiveData2.indices;\n      var formatted = formatPrimitiveData({\n        position: position,\n        normal: normal,\n        posindex: posindex,\n        nolindex: nolindex\n      });\n      delete primitive.nolindex;\n      delete primitive.posindex;\n      primitive.position = formatted.position;\n      primitive.normal = formatted.normal;\n      primitive.indices = indices;\n    }\n    return {\n      mesh: mesh,\n      primitives: primitives\n    };\n  } catch (error) {\n    throw error;\n  }\n}\nfunction _applyPrefixId(target, propKey, customPrefixId, prefixIdKey) {\n  if (!prefixIdKey || !target) return;\n  if (Array.isArray(target)) {\n    target.forEach(function (item) {\n      var prefixId = customPrefixId || item[prefixIdKey];\n      if (item && prefixId && item[propKey] != null) {\n        item[propKey] = \"\".concat(item[propKey], \":\").concat(prefixId);\n      }\n    });\n  } else if ((customPrefixId || target[prefixIdKey]) && target[propKey] != null) {\n    var prefixId = customPrefixId || target[prefixIdKey];\n    target[propKey] = \"\".concat(target[propKey], \":\").concat(prefixId);\n  }\n}\nfunction parsePrimitive(dataView, uint8Array, offset) {\n  var isFullProps = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n  var primitive = {};\n  if (dataView.byteLength < offset + 12) {\n    throw new Error('Insufficient data for primitive header');\n  }\n  var primitiveIdTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (primitiveIdTextLen === 0xffffffff) {\n    primitive.id = null;\n  } else if (primitiveIdTextLen > 0) {\n    if (dataView.byteLength < offset + primitiveIdTextLen) {\n      throw new Error('Insufficient data for primitive id content');\n    }\n    var textBytes = uint8Array.subarray(offset, offset + primitiveIdTextLen);\n    primitive.id = utf8Decoder.decode(textBytes);\n    offset += primitiveIdTextLen;\n  } else {\n    primitive.id = '';\n  }\n  if (dataView.byteLength < offset + 4) {\n    throw new Error('Insufficient data for GeomText length');\n  }\n  var documentTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (documentTextLen === 0xffffffff) {\n    primitive.documentId = null;\n  } else if (documentTextLen > 0) {\n    if (dataView.byteLength < offset + documentTextLen) {\n      throw new Error('Insufficient data for GeomText content');\n    }\n    var _textBytes = uint8Array.subarray(offset, offset + documentTextLen);\n    primitive.documentId = utf8Decoder.decode(_textBytes);\n    offset += documentTextLen;\n  } else {\n    primitive.documentId = '';\n  }\n  if (dataView.byteLength < offset + 4) {\n    throw new Error('Insufficient data for Material length');\n  }\n  var materialTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (materialTextLen === 0xffffffff) {\n    primitive.material = null;\n  } else if (materialTextLen > 0) {\n    if (dataView.byteLength < offset + materialTextLen) {\n      throw new Error('Insufficient data for Material content');\n    }\n    var _textBytes2 = uint8Array.subarray(offset, offset + materialTextLen);\n    primitive.material = utf8Decoder.decode(_textBytes2);\n    offset += materialTextLen;\n  } else {\n    primitive.material = '';\n  }\n  if (dataView.byteLength < offset + 4) {\n    throw new Error('Insufficient data for GeomText length');\n  }\n  var geomTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (geomTextLen === 0xffffffff) {\n    primitive.geomText = null;\n  } else if (geomTextLen > 0) {\n    if (dataView.byteLength < offset + geomTextLen) {\n      throw new Error('Insufficient data for GeomText content');\n    }\n    var _textBytes3 = uint8Array.subarray(offset, offset + geomTextLen);\n    primitive.geomText = utf8Decoder.decode(_textBytes3);\n    offset += geomTextLen;\n  } else {\n    primitive.geomText = '';\n  }\n  primitive.isCompressed = dataView.getInt32(offset, false);\n  offset += 4;\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Position length');\n    var positionLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (positionLen === 0xffffffff) {\n      primitive.position = null;\n    } else {\n      if (dataView.byteLength < offset + positionLen) throw new Error('Insufficient data for Position content');\n      primitive.position = uint8Array.subarray(offset, offset + positionLen);\n      offset += positionLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Normal length');\n    var normalLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (normalLen === 0xffffffff) {\n      primitive.normal = null;\n    } else {\n      if (dataView.byteLength < offset + normalLen) throw new Error('Insufficient data for Normal content');\n      primitive.normal = uint8Array.subarray(offset, offset + normalLen);\n      offset += normalLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Indices length');\n    var indicesLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (indicesLen === 0xffffffff) {\n      primitive.indices = null;\n    } else {\n      if (dataView.byteLength < offset + indicesLen) throw new Error('Insufficient data for Indices content');\n      primitive.indices = uint8Array.subarray(offset, offset + indicesLen);\n      offset += indicesLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Posindex length');\n    var posindexLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (posindexLen === 0xffffffff) {\n      primitive.posindex = null;\n    } else {\n      if (dataView.byteLength < offset + posindexLen) throw new Error('Insufficient data for Posindex content');\n      primitive.posindex = uint8Array.subarray(offset, offset + posindexLen);\n      offset += posindexLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Nolindex length');\n    var nolindexLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (nolindexLen === 0xffffffff) {\n      primitive.nolindex = null;\n    } else {\n      if (dataView.byteLength < offset + nolindexLen) throw new Error('Insufficient data for Nolindex content');\n      primitive.nolindex = uint8Array.subarray(offset, offset + nolindexLen);\n      offset += nolindexLen;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for DataType length');\n  var dataTypeLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (dataTypeLen === 0xffffffff) {\n    primitive.dataType = null;\n  } else if (dataTypeLen > 0) {\n    if (dataView.byteLength < offset + dataTypeLen) throw new Error('Insufficient data for DataType content');\n    var _textBytes4 = uint8Array.subarray(offset, offset + dataTypeLen);\n    primitive.dataType = utf8Decoder.decode(_textBytes4);\n    offset += dataTypeLen;\n  } else {\n    primitive.dataType = '';\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Min count');\n  var minCount = dataView.getUint32(offset, false);\n  offset += 4;\n  if (minCount === 0xffffffff) {\n    primitive.min = null;\n  } else {\n    if (dataView.byteLength < offset + minCount * 8) throw new Error('Insufficient data for Min values');\n    primitive.min = [];\n    for (var i = 0; i < minCount; i++) {\n      primitive.min.push(dataView.getFloat64(offset, false));\n      offset += 8;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Max count');\n  var maxCount = dataView.getUint32(offset, false);\n  offset += 4;\n  if (maxCount === 0xffffffff) {\n    primitive.max = null;\n  } else {\n    if (dataView.byteLength < offset + maxCount * 8) throw new Error('Insufficient data for Max values');\n    primitive.max = [];\n    for (var _i = 0; _i < maxCount; _i++) {\n      primitive.max.push(dataView.getFloat64(offset, false));\n      offset += 8;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for GeomType');\n  primitive.geomType = dataView.getInt32(offset, false);\n  offset += 4;\n  return {\n    primitive: primitive,\n    offset: offset\n  };\n}\nfunction parsePrimitiveData(primitive) {\n  var keyOrder = ['position', 'normal', 'indices', 'posindex', 'nolindex'];\n  var typeMap = {\n    0: {\n      bytes: 4,\n      getter: 'getFloat32'\n    },\n    1: {\n      bytes: 4,\n      getter: 'getInt32'\n    },\n    2: {\n      bytes: 2,\n      getter: 'getInt16'\n    }\n  };\n  var parsedResult = {};\n  var dataTypeString = primitive.dataType;\n  for (var i = 0; i < keyOrder.length; i++) {\n    var key = keyOrder[i];\n    var typeCode = dataTypeString[i];\n    var typeInfo = typeMap[typeCode];\n    var uint8Array = primitive.isCompressed === 1 || primitive.isCompressed === undefined ? gunzipSync(primitive[key]) : primitive[key];\n    if (!typeInfo || !uint8Array) {\n      // console.warn(`无法找到键 \"${key}\" 或其类型定义，已跳过。`);\n      parsedResult[key] = [];\n      continue;\n    }\n    var result_array = [];\n    var dataView = new DataView(uint8Array.buffer, uint8Array.byteOffset, uint8Array.byteLength);\n    var littleEndian = true;\n    for (var byteOffset = 0; byteOffset < dataView.byteLength; byteOffset += typeInfo.bytes) {\n      if (byteOffset + typeInfo.bytes > dataView.byteLength) {\n        console.warn(\"\\u952E \\\"\".concat(key, \"\\\" \\u7684\\u6570\\u636E\\u957F\\u5EA6 (\").concat(dataView.byteLength, \") \\u4E0D\\u662F\\u5176\\u7C7B\\u578B (\").concat(typeInfo.bytes, \"\\u5B57\\u8282) \\u7684\\u6574\\u6570\\u500D\\uFF0C\\u672B\\u5C3E\\u6570\\u636E\\u53EF\\u80FD\\u4E0D\\u5B8C\\u6574\\u3002\"));\n        break;\n      }\n      var value = dataView[typeInfo.getter](byteOffset, littleEndian);\n      result_array.push(value);\n    }\n    parsedResult[key] = result_array;\n  }\n  return parsedResult;\n}\nfunction formatPrimitiveData(primitive) {\n  var position = primitive.position,\n    normal = primitive.normal,\n    posindex = primitive.posindex,\n    nolindex = primitive.nolindex;\n  var restoredPosition = new Array(posindex.length);\n  var restoredNormal = new Array(nolindex.length);\n  for (var i = 0; i < posindex.length; i++) {\n    var posIndex = posindex[i];\n    restoredPosition[i] = position[posIndex];\n  }\n  for (var _i2 = 0; _i2 < nolindex.length; _i2++) {\n    var normalIndex = nolindex[_i2];\n    restoredNormal[_i2] = normal[normalIndex];\n  }\n  primitive.position = null;\n  primitive.normal = null;\n  primitive.posindex = null;\n  primitive.nolindex = null;\n  return {\n    position: restoredPosition,\n    normal: restoredNormal\n  };\n}\nfunction buildInstancedMapping(instances, drawObjs) {\n  var drawObjMapInstance = {};\n  var instanceToDrawObject = [];\n  var meshByPrimId = new Map();\n  for (var i = 0; i < drawObjs.length; i++) {\n    var item = drawObjs[i];\n    if (!item || !Array.isArray(item.geoms)) continue;\n    var geoms = item.geoms;\n    for (var j = 0; j < geoms.length; j++) {\n      var geom = geoms[j];\n      if (geom && geom.prmid !== undefined && geom.prmid !== null) {\n        meshByPrimId.set(geom.prmid, geoms);\n      }\n    }\n  }\n  var seenByDrawObject = new Map();\n  for (var _i3 = 0; _i3 < instances.length; _i3++) {\n    var instance = instances[_i3];\n    if (!instance) continue;\n    var drawObject = instance.drawObject;\n    if (!drawObject) continue;\n    instanceToDrawObject.push({\n      instanceId: instance.instanceId,\n      drawObjectId: drawObject\n    });\n    var record = drawObjMapInstance[drawObject];\n    if (!record) {\n      record = {\n        MapInstance: [],\n        MapMesh: meshByPrimId.get(drawObject)\n      };\n      drawObjMapInstance[drawObject] = record;\n      seenByDrawObject.set(drawObject, new Set());\n    }\n    var seen = seenByDrawObject.get(drawObject);\n    if (!seen.has(instance.instanceId)) {\n      record.MapInstance.push(instance);\n      seen.add(instance.instanceId);\n    }\n  }\n  return {\n    drawObjMapInstance: drawObjMapInstance,\n    instanceToDrawObject: instanceToDrawObject\n  };\n}\nfunction scanOcclusionBuffer(buffer, sw, sh, stride, maxIdx, minSampleCount) {\n  var indices = [];\n  if (!buffer || !sw || !sh || !maxIdx) return {\n    indices: indices\n  };\n  var view = buffer instanceof Uint8Array ? buffer : new Uint8Array(buffer);\n  var step = Math.max(1, stride || 1);\n  var minCount = Math.max(1, minSampleCount || 1);\n  var counts = new Uint32Array(maxIdx + 1);\n  for (var y = 0; y < sh; y += step) {\n    var row = y * sw * 4;\n    for (var x = 0; x < sw; x += step) {\n      var p = row + x * 4;\n      var idxColor = view[p] + (view[p + 1] << 8) + (view[p + 2] << 16);\n      if (idxColor > 0 && idxColor <= maxIdx) {\n        var next = counts[idxColor] + 1;\n        counts[idxColor] = next;\n        if (next === minCount) {\n          indices.push(idxColor);\n        }\n      }\n    }\n  }\n  return {\n    indices: indices\n  };\n}\n\n/***/ })\n\n/******/ });\n", "Worker", undefined, undefined);
+  return inline_default()("/******/ (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 = \"f538\");\n/******/ })\n/************************************************************************/\n/******/ ({\n\n/***/ \"f538\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n// ESM COMPAT FLAG\n__webpack_require__.r(__webpack_exports__);\n\n// CONCATENATED MODULE: ./node_modules/fflate/esm/browser.js\n// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = function wk(c, id, msg, transfer, cb) {\n  var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'], {\n    type: 'text/javascript'\n  }))));\n  w.onmessage = function (e) {\n    var d = e.data,\n      ed = d.$e$;\n    if (ed) {\n      var err = new Error(ed[0]);\n      err['code'] = ed[1];\n      err.stack = ed[2];\n      cb(err, null);\n    } else cb(null, d);\n  };\n  w.postMessage(msg, transfer);\n  return w;\n};\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array,\n  u16 = Uint16Array,\n  i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */0, 0, /* impossible */0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function freb(eb, start) {\n  var b = new u16(31);\n  for (var i = 0; i < 31; ++i) {\n    b[i] = start += 1 << eb[i - 1];\n  }\n  // numbers here are at max 18 bits\n  var r = new i32(b[30]);\n  for (var i = 1; i < 30; ++i) {\n    for (var j = b[i]; j < b[i + 1]; ++j) {\n      r[j] = j - b[i] << 5 | i;\n    }\n  }\n  return {\n    b: b,\n    r: r\n  };\n};\nvar _a = freb(fleb, 2),\n  fl = _a.b,\n  revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0),\n  fd = _b.b,\n  revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var browser_i = 0; browser_i < 32768; ++browser_i) {\n  // reverse table algorithm from SO\n  var x = (browser_i & 0xAAAA) >> 1 | (browser_i & 0x5555) << 1;\n  x = (x & 0xCCCC) >> 2 | (x & 0x3333) << 2;\n  x = (x & 0xF0F0) >> 4 | (x & 0x0F0F) << 4;\n  rev[browser_i] = ((x & 0xFF00) >> 8 | (x & 0x00FF) << 8) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = function hMap(cd, mb, r) {\n  var s = cd.length;\n  // index\n  var i = 0;\n  // u16 \"map\": index -> # of codes with bit length = index\n  var l = new u16(mb);\n  // length of cd must be 288 (total # of codes)\n  for (; i < s; ++i) {\n    if (cd[i]) ++l[cd[i] - 1];\n  }\n  // u16 \"map\": index -> minimum code for bit length = index\n  var le = new u16(mb);\n  for (i = 1; i < mb; ++i) {\n    le[i] = le[i - 1] + l[i - 1] << 1;\n  }\n  var co;\n  if (r) {\n    // u16 \"map\": index -> number of actual bits, symbol for code\n    co = new u16(1 << mb);\n    // bits to remove for reverser\n    var rvb = 15 - mb;\n    for (i = 0; i < s; ++i) {\n      // ignore 0 lengths\n      if (cd[i]) {\n        // num encoding both symbol and bits read\n        var sv = i << 4 | cd[i];\n        // free bits\n        var r_1 = mb - cd[i];\n        // start value\n        var v = le[cd[i] - 1]++ << r_1;\n        // m is end value\n        for (var m = v | (1 << r_1) - 1; v <= m; ++v) {\n          // every 16 bit value starting with the code yields the same result\n          co[rev[v] >> rvb] = sv;\n        }\n      }\n    }\n  } else {\n    co = new u16(s);\n    for (i = 0; i < s; ++i) {\n      if (cd[i]) {\n        co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];\n      }\n    }\n  }\n  return co;\n};\n// fixed length tree\nvar flt = new u8(288);\nfor (var browser_i = 0; browser_i < 144; ++browser_i) flt[browser_i] = 8;\nfor (var browser_i = 144; browser_i < 256; ++browser_i) flt[browser_i] = 9;\nfor (var browser_i = 256; browser_i < 280; ++browser_i) flt[browser_i] = 7;\nfor (var browser_i = 280; browser_i < 288; ++browser_i) flt[browser_i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var browser_i = 0; browser_i < 32; ++browser_i) fdt[browser_i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/hMap(flt, 9, 0),\n  flrm = /*#__PURE__*/hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/hMap(fdt, 5, 0),\n  fdrm = /*#__PURE__*/hMap(fdt, 5, 1);\n// find max of array\nvar max = function max(a) {\n  var m = a[0];\n  for (var i = 1; i < a.length; ++i) {\n    if (a[i] > m) m = a[i];\n  }\n  return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function bits(d, p, m) {\n  var o = p / 8 | 0;\n  return (d[o] | d[o + 1] << 8) >> (p & 7) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function bits16(d, p) {\n  var o = p / 8 | 0;\n  return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);\n};\n// get end of byte\nvar shft = function shft(p) {\n  return (p + 7) / 8 | 0;\n};\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function slc(v, s, e) {\n  if (s == null || s < 0) s = 0;\n  if (e == null || e > v.length) e = v.length;\n  // can't use .constructor in case user-supplied\n  return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nvar FlateErrorCode = {\n  UnexpectedEOF: 0,\n  InvalidBlockType: 1,\n  InvalidLengthLiteral: 2,\n  InvalidDistance: 3,\n  StreamFinished: 4,\n  NoStreamHandler: 5,\n  InvalidHeader: 6,\n  NoCallback: 7,\n  InvalidUTF8: 8,\n  ExtraFieldTooLong: 9,\n  InvalidDate: 10,\n  FilenameTooLong: 11,\n  StreamFinishing: 12,\n  InvalidZipData: 13,\n  UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = ['unexpected EOF', 'invalid block type', 'invalid length/literal', 'invalid distance', 'stream finished', 'no stream handler',, 'no callback', 'invalid UTF-8 data', 'extra field too long', 'date not in range 1980-2099', 'filename too long', 'stream finishing', 'invalid zip data'\n// determined by unknown compression method\n];\n;\nvar _err = function err(ind, msg, nt) {\n  var e = new Error(msg || ec[ind]);\n  e.code = ind;\n  if (Error.captureStackTrace) Error.captureStackTrace(e, _err);\n  if (!nt) throw e;\n  return e;\n};\n// expands raw DEFLATE data\nvar inflt = function inflt(dat, st, buf, dict) {\n  // source length       dict length\n  var sl = dat.length,\n    dl = dict ? dict.length : 0;\n  if (!sl || st.f && !st.l) return buf || new u8(0);\n  var noBuf = !buf;\n  // have to estimate size\n  var resize = noBuf || st.i != 2;\n  // no state\n  var noSt = st.i;\n  // Assumes roughly 33% compression ratio average\n  if (noBuf) buf = new u8(sl * 3);\n  // ensure buffer can fit at least l elements\n  var cbuf = function cbuf(l) {\n    var bl = buf.length;\n    // need to increase size to fit\n    if (l > bl) {\n      // Double or set to necessary, whichever is greater\n      var nbuf = new u8(Math.max(bl * 2, l));\n      nbuf.set(buf);\n      buf = nbuf;\n    }\n  };\n  //  last chunk         bitpos           bytes\n  var final = st.f || 0,\n    pos = st.p || 0,\n    bt = st.b || 0,\n    lm = st.l,\n    dm = st.d,\n    lbt = st.m,\n    dbt = st.n;\n  // total bits\n  var tbts = sl * 8;\n  do {\n    if (!lm) {\n      // BFINAL - this is only 1 when last chunk is next\n      final = bits(dat, pos, 1);\n      // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n      var type = bits(dat, pos + 1, 3);\n      pos += 3;\n      if (!type) {\n        // go to end of byte boundary\n        var s = shft(pos) + 4,\n          l = dat[s - 4] | dat[s - 3] << 8,\n          t = s + l;\n        if (t > sl) {\n          if (noSt) _err(0);\n          break;\n        }\n        // ensure size\n        if (resize) cbuf(bt + l);\n        // Copy over uncompressed data\n        buf.set(dat.subarray(s, t), bt);\n        // Get new bitpos, update byte count\n        st.b = bt += l, st.p = pos = t * 8, st.f = final;\n        continue;\n      } else if (type == 1) lm = flrm, dm = fdrm, lbt = 9, dbt = 5;else if (type == 2) {\n        //  literal                            lengths\n        var hLit = bits(dat, pos, 31) + 257,\n          hcLen = bits(dat, pos + 10, 15) + 4;\n        var tl = hLit + bits(dat, pos + 5, 31) + 1;\n        pos += 14;\n        // length+distance tree\n        var ldt = new u8(tl);\n        // code length tree\n        var clt = new u8(19);\n        for (var i = 0; i < hcLen; ++i) {\n          // use index map to get real code\n          clt[clim[i]] = bits(dat, pos + i * 3, 7);\n        }\n        pos += hcLen * 3;\n        // code lengths bits\n        var clb = max(clt),\n          clbmsk = (1 << clb) - 1;\n        // code lengths map\n        var clm = hMap(clt, clb, 1);\n        for (var i = 0; i < tl;) {\n          var r = clm[bits(dat, pos, clbmsk)];\n          // bits read\n          pos += r & 15;\n          // symbol\n          var s = r >> 4;\n          // code length to copy\n          if (s < 16) {\n            ldt[i++] = s;\n          } else {\n            //  copy   count\n            var c = 0,\n              n = 0;\n            if (s == 16) n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];else if (s == 17) n = 3 + bits(dat, pos, 7), pos += 3;else if (s == 18) n = 11 + bits(dat, pos, 127), pos += 7;\n            while (n--) ldt[i++] = c;\n          }\n        }\n        //    length tree                 distance tree\n        var lt = ldt.subarray(0, hLit),\n          dt = ldt.subarray(hLit);\n        // max length bits\n        lbt = max(lt);\n        // max dist bits\n        dbt = max(dt);\n        lm = hMap(lt, lbt, 1);\n        dm = hMap(dt, dbt, 1);\n      } else _err(1);\n      if (pos > tbts) {\n        if (noSt) _err(0);\n        break;\n      }\n    }\n    // Make sure the buffer can hold this + the largest possible addition\n    // Maximum chunk size (practically, theoretically infinite) is 2^17\n    if (resize) cbuf(bt + 131072);\n    var lms = (1 << lbt) - 1,\n      dms = (1 << dbt) - 1;\n    var lpos = pos;\n    for (;; lpos = pos) {\n      // bits read, code\n      var c = lm[bits16(dat, pos) & lms],\n        sym = c >> 4;\n      pos += c & 15;\n      if (pos > tbts) {\n        if (noSt) _err(0);\n        break;\n      }\n      if (!c) _err(2);\n      if (sym < 256) buf[bt++] = sym;else if (sym == 256) {\n        lpos = pos, lm = null;\n        break;\n      } else {\n        var add = sym - 254;\n        // no extra bits needed if less\n        if (sym > 264) {\n          // index\n          var i = sym - 257,\n            b = fleb[i];\n          add = bits(dat, pos, (1 << b) - 1) + fl[i];\n          pos += b;\n        }\n        // dist\n        var d = dm[bits16(dat, pos) & dms],\n          dsym = d >> 4;\n        if (!d) _err(3);\n        pos += d & 15;\n        var dt = fd[dsym];\n        if (dsym > 3) {\n          var b = fdeb[dsym];\n          dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n        }\n        if (pos > tbts) {\n          if (noSt) _err(0);\n          break;\n        }\n        if (resize) cbuf(bt + 131072);\n        var end = bt + add;\n        if (bt < dt) {\n          var shift = dl - dt,\n            dend = Math.min(dt, end);\n          if (shift + bt < 0) _err(3);\n          for (; bt < dend; ++bt) buf[bt] = dict[shift + bt];\n        }\n        for (; bt < end; ++bt) buf[bt] = buf[bt - dt];\n      }\n    }\n    st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n    if (lm) final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n  } while (!final);\n  // don't reallocate for streams or user buffers\n  return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function wbits(d, p, v) {\n  v <<= p & 7;\n  var o = p / 8 | 0;\n  d[o] |= v;\n  d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function wbits16(d, p, v) {\n  v <<= p & 7;\n  var o = p / 8 | 0;\n  d[o] |= v;\n  d[o + 1] |= v >> 8;\n  d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function hTree(d, mb) {\n  // Need extra info to make a tree\n  var t = [];\n  for (var i = 0; i < d.length; ++i) {\n    if (d[i]) t.push({\n      s: i,\n      f: d[i]\n    });\n  }\n  var s = t.length;\n  var t2 = t.slice();\n  if (!s) return {\n    t: et,\n    l: 0\n  };\n  if (s == 1) {\n    var v = new u8(t[0].s + 1);\n    v[t[0].s] = 1;\n    return {\n      t: v,\n      l: 1\n    };\n  }\n  t.sort(function (a, b) {\n    return a.f - b.f;\n  });\n  // after i2 reaches last ind, will be stopped\n  // freq must be greater than largest possible number of symbols\n  t.push({\n    s: -1,\n    f: 25001\n  });\n  var l = t[0],\n    r = t[1],\n    i0 = 0,\n    i1 = 1,\n    i2 = 2;\n  t[0] = {\n    s: -1,\n    f: l.f + r.f,\n    l: l,\n    r: r\n  };\n  // efficient algorithm from UZIP.js\n  // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n  // symbols that combined have high freq, will start processing i2 (high-freq,\n  // non-composite) symbols instead\n  // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n  while (i1 != s - 1) {\n    l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n    r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n    t[i1++] = {\n      s: -1,\n      f: l.f + r.f,\n      l: l,\n      r: r\n    };\n  }\n  var maxSym = t2[0].s;\n  for (var i = 1; i < s; ++i) {\n    if (t2[i].s > maxSym) maxSym = t2[i].s;\n  }\n  // code lengths\n  var tr = new u16(maxSym + 1);\n  // max bits in tree\n  var mbt = _ln(t[i1 - 1], tr, 0);\n  if (mbt > mb) {\n    // more algorithms from UZIP.js\n    // TODO: find out how this code works (debt)\n    //  ind    debt\n    var i = 0,\n      dt = 0;\n    //    left            cost\n    var lft = mbt - mb,\n      cst = 1 << lft;\n    t2.sort(function (a, b) {\n      return tr[b.s] - tr[a.s] || a.f - b.f;\n    });\n    for (; i < s; ++i) {\n      var i2_1 = t2[i].s;\n      if (tr[i2_1] > mb) {\n        dt += cst - (1 << mbt - tr[i2_1]);\n        tr[i2_1] = mb;\n      } else break;\n    }\n    dt >>= lft;\n    while (dt > 0) {\n      var i2_2 = t2[i].s;\n      if (tr[i2_2] < mb) dt -= 1 << mb - tr[i2_2]++ - 1;else ++i;\n    }\n    for (; i >= 0 && dt; --i) {\n      var i2_3 = t2[i].s;\n      if (tr[i2_3] == mb) {\n        --tr[i2_3];\n        ++dt;\n      }\n    }\n    mbt = mb;\n  }\n  return {\n    t: new u8(tr),\n    l: mbt\n  };\n};\n// get the max length and assign length codes\nvar _ln = function ln(n, l, d) {\n  return n.s == -1 ? Math.max(_ln(n.l, l, d + 1), _ln(n.r, l, d + 1)) : l[n.s] = d;\n};\n// length codes generation\nvar lc = function lc(c) {\n  var s = c.length;\n  // Note that the semicolon was intentional\n  while (s && !c[--s]);\n  var cl = new u16(++s);\n  //  ind      num         streak\n  var cli = 0,\n    cln = c[0],\n    cls = 1;\n  var w = function w(v) {\n    cl[cli++] = v;\n  };\n  for (var i = 1; i <= s; ++i) {\n    if (c[i] == cln && i != s) ++cls;else {\n      if (!cln && cls > 2) {\n        for (; cls > 138; cls -= 138) w(32754);\n        if (cls > 2) {\n          w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);\n          cls = 0;\n        }\n      } else if (cls > 3) {\n        w(cln), --cls;\n        for (; cls > 6; cls -= 6) w(8304);\n        if (cls > 2) w(cls - 3 << 5 | 8208), cls = 0;\n      }\n      while (cls--) w(cln);\n      cls = 1;\n      cln = c[i];\n    }\n  }\n  return {\n    c: cl.subarray(0, cli),\n    n: s\n  };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function clen(cf, cl) {\n  var l = 0;\n  for (var i = 0; i < cl.length; ++i) l += cf[i] * cl[i];\n  return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function wfblk(out, pos, dat) {\n  // no need to write 00 as type: TypedArray defaults to 0\n  var s = dat.length;\n  var o = shft(pos + 2);\n  out[o] = s & 255;\n  out[o + 1] = s >> 8;\n  out[o + 2] = out[o] ^ 255;\n  out[o + 3] = out[o + 1] ^ 255;\n  for (var i = 0; i < s; ++i) out[o + i + 4] = dat[i];\n  return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function wblk(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n  wbits(out, p++, final);\n  ++lf[256];\n  var _a = hTree(lf, 15),\n    dlt = _a.t,\n    mlb = _a.l;\n  var _b = hTree(df, 15),\n    ddt = _b.t,\n    mdb = _b.l;\n  var _c = lc(dlt),\n    lclt = _c.c,\n    nlc = _c.n;\n  var _d = lc(ddt),\n    lcdt = _d.c,\n    ndc = _d.n;\n  var lcfreq = new u16(19);\n  for (var i = 0; i < lclt.length; ++i) ++lcfreq[lclt[i] & 31];\n  for (var i = 0; i < lcdt.length; ++i) ++lcfreq[lcdt[i] & 31];\n  var _e = hTree(lcfreq, 7),\n    lct = _e.t,\n    mlcb = _e.l;\n  var nlcc = 19;\n  for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc);\n  var flen = bl + 5 << 3;\n  var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n  var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n  if (bs >= 0 && flen <= ftlen && flen <= dtlen) return wfblk(out, p, dat.subarray(bs, bs + bl));\n  var lm, ll, dm, dl;\n  wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n  if (dtlen < ftlen) {\n    lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n    var llm = hMap(lct, mlcb, 0);\n    wbits(out, p, nlc - 257);\n    wbits(out, p + 5, ndc - 1);\n    wbits(out, p + 10, nlcc - 4);\n    p += 14;\n    for (var i = 0; i < nlcc; ++i) wbits(out, p + 3 * i, lct[clim[i]]);\n    p += 3 * nlcc;\n    var lcts = [lclt, lcdt];\n    for (var it = 0; it < 2; ++it) {\n      var clct = lcts[it];\n      for (var i = 0; i < clct.length; ++i) {\n        var len = clct[i] & 31;\n        wbits(out, p, llm[len]), p += lct[len];\n        if (len > 15) wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;\n      }\n    }\n  } else {\n    lm = flm, ll = flt, dm = fdm, dl = fdt;\n  }\n  for (var i = 0; i < li; ++i) {\n    var sym = syms[i];\n    if (sym > 255) {\n      var len = sym >> 18 & 31;\n      wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n      if (len > 7) wbits(out, p, sym >> 23 & 31), p += fleb[len];\n      var dst = sym & 31;\n      wbits16(out, p, dm[dst]), p += dl[dst];\n      if (dst > 3) wbits16(out, p, sym >> 5 & 8191), p += fdeb[dst];\n    } else {\n      wbits16(out, p, lm[sym]), p += ll[sym];\n    }\n  }\n  wbits16(out, p, lm[256]);\n  return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function dflt(dat, lvl, plvl, pre, post, st) {\n  var s = st.z || dat.length;\n  var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n  // writing to this writes to the output buffer\n  var w = o.subarray(pre, o.length - post);\n  var lst = st.l;\n  var pos = (st.r || 0) & 7;\n  if (lvl) {\n    if (pos) w[0] = st.r >> 3;\n    var opt = deo[lvl - 1];\n    var n = opt >> 13,\n      c = opt & 8191;\n    var msk_1 = (1 << plvl) - 1;\n    //    prev 2-byte val map    curr 2-byte val map\n    var prev = st.p || new u16(32768),\n      head = st.h || new u16(msk_1 + 1);\n    var bs1_1 = Math.ceil(plvl / 3),\n      bs2_1 = 2 * bs1_1;\n    var hsh = function hsh(i) {\n      return (dat[i] ^ dat[i + 1] << bs1_1 ^ dat[i + 2] << bs2_1) & msk_1;\n    };\n    // 24576 is an arbitrary number of maximum symbols per block\n    // 424 buffer for last block\n    var syms = new i32(25000);\n    // length/literal freq   distance freq\n    var lf = new u16(288),\n      df = new u16(32);\n    //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n    var lc_1 = 0,\n      eb = 0,\n      i = st.i || 0,\n      li = 0,\n      wi = st.w || 0,\n      bs = 0;\n    for (; i + 2 < s; ++i) {\n      // hash value\n      var hv = hsh(i);\n      // index mod 32768    previous index mod\n      var imod = i & 32767,\n        pimod = head[hv];\n      prev[imod] = pimod;\n      head[hv] = imod;\n      // We always should modify head and prev, but only add symbols if\n      // this data is not yet processed (\"wait\" for wait index)\n      if (wi <= i) {\n        // bytes remaining\n        var rem = s - i;\n        if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n          pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n          li = lc_1 = eb = 0, bs = i;\n          for (var j = 0; j < 286; ++j) lf[j] = 0;\n          for (var j = 0; j < 30; ++j) df[j] = 0;\n        }\n        //  len    dist   chain\n        var l = 2,\n          d = 0,\n          ch_1 = c,\n          dif = imod - pimod & 32767;\n        if (rem > 2 && hv == hsh(i - dif)) {\n          var maxn = Math.min(n, rem) - 1;\n          var maxd = Math.min(32767, i);\n          // max possible length\n          // not capped at dif because decompressors implement \"rolling\" index population\n          var ml = Math.min(258, rem);\n          while (dif <= maxd && --ch_1 && imod != pimod) {\n            if (dat[i + l] == dat[i + l - dif]) {\n              var nl = 0;\n              for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl);\n              if (nl > l) {\n                l = nl, d = dif;\n                // break out early when we reach \"nice\" (we are satisfied enough)\n                if (nl > maxn) break;\n                // now, find the rarest 2-byte sequence within this\n                // length of literals and search for that instead.\n                // Much faster than just using the start\n                var mmd = Math.min(dif, nl - 2);\n                var md = 0;\n                for (var j = 0; j < mmd; ++j) {\n                  var ti = i - dif + j & 32767;\n                  var pti = prev[ti];\n                  var cd = ti - pti & 32767;\n                  if (cd > md) md = cd, pimod = ti;\n                }\n              }\n            }\n            // check the previous match\n            imod = pimod, pimod = prev[imod];\n            dif += imod - pimod & 32767;\n          }\n        }\n        // d will be nonzero only when a match was found\n        if (d) {\n          // store both dist and len data in one int32\n          // Make sure this is recognized as a len/dist with 28th bit (2^28)\n          syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];\n          var lin = revfl[l] & 31,\n            din = revfd[d] & 31;\n          eb += fleb[lin] + fdeb[din];\n          ++lf[257 + lin];\n          ++df[din];\n          wi = i + l;\n          ++lc_1;\n        } else {\n          syms[li++] = dat[i];\n          ++lf[dat[i]];\n        }\n      }\n    }\n    for (i = Math.max(i, wi); i < s; ++i) {\n      syms[li++] = dat[i];\n      ++lf[dat[i]];\n    }\n    pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n    if (!lst) {\n      st.r = pos & 7 | w[pos / 8 | 0] << 3;\n      // shft(pos) now 1 less if pos & 7 != 0\n      pos -= 7;\n      st.h = head, st.p = prev, st.i = i, st.w = wi;\n    }\n  } else {\n    for (var i = st.w || 0; i < s + lst; i += 65535) {\n      // end\n      var e = i + 65535;\n      if (e >= s) {\n        // write final block\n        w[pos / 8 | 0] = lst;\n        e = s;\n      }\n      pos = wfblk(w, pos + 1, dat.subarray(i, e));\n    }\n    st.i = s;\n  }\n  return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/function () {\n  var t = new Int32Array(256);\n  for (var i = 0; i < 256; ++i) {\n    var c = i,\n      k = 9;\n    while (--k) c = (c & 1 && -306674912) ^ c >>> 1;\n    t[i] = c;\n  }\n  return t;\n}();\n// CRC32\nvar crc = function crc() {\n  var c = -1;\n  return {\n    p: function p(d) {\n      // closures have awful performance\n      var cr = c;\n      for (var i = 0; i < d.length; ++i) cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;\n      c = cr;\n    },\n    d: function d() {\n      return ~c;\n    }\n  };\n};\n// Adler32\nvar adler = function adler() {\n  var a = 1,\n    b = 0;\n  return {\n    p: function p(d) {\n      // closures have awful performance\n      var n = a,\n        m = b;\n      var l = d.length | 0;\n      for (var i = 0; i != l;) {\n        var e = Math.min(i + 2655, l);\n        for (; i < e; ++i) m += n += d[i];\n        n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n      }\n      a = n, b = m;\n    },\n    d: function d() {\n      a %= 65521, b %= 65521;\n      return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | b >> 8;\n    }\n  };\n};\n;\n// deflate with opts\nvar dopt = function dopt(dat, opt, pre, post, st) {\n  if (!st) {\n    st = {\n      l: 1\n    };\n    if (opt.dictionary) {\n      var dict = opt.dictionary.subarray(-32768);\n      var newDat = new u8(dict.length + dat.length);\n      newDat.set(dict);\n      newDat.set(dat, dict.length);\n      dat = newDat;\n      st.w = dict.length;\n    }\n  }\n  return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20 : 12 + opt.mem, pre, post, st);\n};\n// Walmart object spread\nvar mrg = function mrg(a, b) {\n  var o = {};\n  for (var k in a) o[k] = a[k];\n  for (var k in b) o[k] = b[k];\n  return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function wcln(fn, fnStr, td) {\n  var dt = fn();\n  var st = fn.toString();\n  var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n  for (var i = 0; i < dt.length; ++i) {\n    var v = dt[i],\n      k = ks[i];\n    if (typeof v == 'function') {\n      fnStr += ';' + k + '=';\n      var st_1 = v.toString();\n      if (v.prototype) {\n        // for global objects\n        if (st_1.indexOf('[native code]') != -1) {\n          var spInd = st_1.indexOf(' ', 8) + 1;\n          fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n        } else {\n          fnStr += st_1;\n          for (var t in v.prototype) fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n        }\n      } else fnStr += st_1;\n    } else td[k] = v;\n  }\n  return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function cbfs(v) {\n  var tl = [];\n  for (var k in v) {\n    if (v[k].buffer) {\n      tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n    }\n  }\n  return tl;\n};\n// use a worker to execute code\nvar wrkr = function wrkr(fns, init, id, cb) {\n  if (!ch[id]) {\n    var fnStr = '',\n      td_1 = {},\n      m = fns.length - 1;\n    for (var i = 0; i < m; ++i) fnStr = wcln(fns[i], fnStr, td_1);\n    ch[id] = {\n      c: wcln(fns[m], fnStr, td_1),\n      e: td_1\n    };\n  }\n  var td = mrg({}, ch[id].e);\n  return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function bInflt() {\n  return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, _err, inflt, inflateSync, pbf, gopt];\n};\nvar bDflt = function bDflt() {\n  return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, _ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf];\n};\n// gzip extra\nvar gze = function gze() {\n  return [gzh, gzhl, wbytes, crc, crct];\n};\n// gunzip extra\nvar guze = function guze() {\n  return [gzs, gzl];\n};\n// zlib extra\nvar zle = function zle() {\n  return [zlh, wbytes, adler];\n};\n// unzlib extra\nvar zule = function zule() {\n  return [zls];\n};\n// post buf\nvar pbf = function pbf(msg) {\n  return postMessage(msg, [msg.buffer]);\n};\n// get opts\nvar gopt = function gopt(o) {\n  return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n  };\n};\n// async helper\nvar cbify = function cbify(dat, opts, fns, init, id, cb) {\n  var w = wrkr(fns, init, id, function (err, dat) {\n    w.terminate();\n    cb(err, dat);\n  });\n  w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n  return function () {\n    w.terminate();\n  };\n};\n// auto stream\nvar astrm = function astrm(strm) {\n  strm.ondata = function (dat, final) {\n    return postMessage([dat, final], [dat.buffer]);\n  };\n  return function (ev) {\n    if (ev.data.length) {\n      strm.push(ev.data[0], ev.data[1]);\n      postMessage([ev.data[0].length]);\n    } else strm.flush();\n  };\n};\n// async stream attach\nvar astrmify = function astrmify(fns, strm, opts, init, id, flush, ext) {\n  var t;\n  var w = wrkr(fns, init, id, function (err, dat) {\n    if (err) w.terminate(), strm.ondata.call(strm, err);else if (!Array.isArray(dat)) ext(dat);else if (dat.length == 1) {\n      strm.queuedSize -= dat[0];\n      if (strm.ondrain) strm.ondrain(dat[0]);\n    } else {\n      if (dat[1]) w.terminate();\n      strm.ondata.call(strm, err, dat[0], dat[1]);\n    }\n  });\n  w.postMessage(opts);\n  strm.queuedSize = 0;\n  strm.push = function (d, f) {\n    if (!strm.ondata) _err(5);\n    if (t) strm.ondata(_err(4, 0, 1), null, !!f);\n    strm.queuedSize += d.length;\n    w.postMessage([d, t = f], [d.buffer]);\n  };\n  strm.terminate = function () {\n    w.terminate();\n  };\n  if (flush) {\n    strm.flush = function () {\n      w.postMessage([]);\n    };\n  }\n};\n// read 2 bytes\nvar b2 = function b2(d, b) {\n  return d[b] | d[b + 1] << 8;\n};\n// read 4 bytes\nvar b4 = function b4(d, b) {\n  return (d[b] | d[b + 1] << 8 | d[b + 2] << 16 | d[b + 3] << 24) >>> 0;\n};\nvar b8 = function b8(d, b) {\n  return b4(d, b) + b4(d, b + 4) * 4294967296;\n};\n// write bytes\nvar wbytes = function wbytes(d, b, v) {\n  for (; v; ++b) d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function gzh(c, o) {\n  var fn = o.filename;\n  c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n  if (o.mtime != 0) wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n  if (fn) {\n    c[3] = 8;\n    for (var i = 0; i <= fn.length; ++i) c[i + 10] = fn.charCodeAt(i);\n  }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function gzs(d) {\n  if (d[0] != 31 || d[1] != 139 || d[2] != 8) _err(6, 'invalid gzip data');\n  var flg = d[3];\n  var st = 10;\n  if (flg & 4) st += (d[10] | d[11] << 8) + 2;\n  for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++]);\n  return st + (flg & 2);\n};\n// gzip length\nvar gzl = function gzl(d) {\n  var l = d.length;\n  return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function gzhl(o) {\n  return 10 + (o.filename ? o.filename.length + 1 : 0);\n};\n// zlib header\nvar zlh = function zlh(c, o) {\n  var lv = o.level,\n    fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n  c[0] = 120, c[1] = fl << 6 | (o.dictionary && 32);\n  c[1] |= 31 - (c[0] << 8 | c[1]) % 31;\n  if (o.dictionary) {\n    var h = adler();\n    h.p(o.dictionary);\n    wbytes(c, 2, h.d());\n  }\n};\n// zlib start\nvar zls = function zls(d, dict) {\n  if ((d[0] & 15) != 8 || d[0] >> 4 > 7 || (d[0] << 8 | d[1]) % 31) _err(6, 'invalid zlib data');\n  if ((d[1] >> 5 & 1) == +!dict) _err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n  return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n  if (typeof opts == 'function') cb = opts, opts = {};\n  this.ondata = cb;\n  return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/function () {\n  function Deflate(opts, cb) {\n    if (typeof opts == 'function') cb = opts, opts = {};\n    this.ondata = cb;\n    this.o = opts || {};\n    this.s = {\n      l: 0,\n      i: 32768,\n      w: 32768,\n      z: 32768\n    };\n    // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n    // 98304 = 32768 (lookback) + 65536 (common chunk size)\n    this.b = new u8(98304);\n    if (this.o.dictionary) {\n      var dict = this.o.dictionary.subarray(-32768);\n      this.b.set(dict, 32768 - dict.length);\n      this.s.i = 32768 - dict.length;\n    }\n  }\n  Deflate.prototype.p = function (c, f) {\n    this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Deflate.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (this.s.l) _err(4);\n    var endLen = chunk.length + this.s.z;\n    if (endLen > this.b.length) {\n      if (endLen > 2 * this.b.length - 32768) {\n        var newBuf = new u8(endLen & -32768);\n        newBuf.set(this.b.subarray(0, this.s.z));\n        this.b = newBuf;\n      }\n      var split = this.b.length - this.s.z;\n      this.b.set(chunk.subarray(0, split), this.s.z);\n      this.s.z = this.b.length;\n      this.p(this.b, false);\n      this.b.set(this.b.subarray(-32768));\n      this.b.set(chunk.subarray(split), 32768);\n      this.s.z = chunk.length - split + 32768;\n      this.s.i = 32766, this.s.w = 32768;\n    } else {\n      this.b.set(chunk, this.s.z);\n      this.s.z += chunk.length;\n    }\n    this.s.l = final & 1;\n    if (this.s.z > this.s.w + 8191 || final) {\n      this.p(this.b, final || false);\n      this.s.w = this.s.i, this.s.i -= 2;\n    }\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * deflated output for small inputs.\n   */\n  Deflate.prototype.flush = function () {\n    if (!this.ondata) _err(5);\n    if (this.s.l) _err(4);\n    this.p(this.b, false);\n    this.s.w = this.s.i, this.s.i -= 2;\n  };\n  return Deflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/function () {\n  function AsyncDeflate(opts, cb) {\n    astrmify([bDflt, function () {\n      return [astrm, Deflate];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Deflate(ev.data);\n      onmessage = astrm(strm);\n    }, 6, 1);\n  }\n  return AsyncDeflate;\n}();\n\nfunction deflate(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt], function (ev) {\n    return pbf(deflateSync(ev.data[0], ev.data[1]));\n  }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nfunction deflateSync(data, opts) {\n  return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/function () {\n  function Inflate(opts, cb) {\n    // no StrmOpt here to avoid adding to workerizer\n    if (typeof opts == 'function') cb = opts, opts = {};\n    this.ondata = cb;\n    var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n    this.s = {\n      i: 0,\n      b: dict ? dict.length : 0\n    };\n    this.o = new u8(32768);\n    this.p = new u8(0);\n    if (dict) this.o.set(dict);\n  }\n  Inflate.prototype.e = function (c) {\n    if (!this.ondata) _err(5);\n    if (this.d) _err(4);\n    if (!this.p.length) this.p = c;else if (c.length) {\n      var n = new u8(this.p.length + c.length);\n      n.set(this.p), n.set(c, this.p.length), this.p = n;\n    }\n  };\n  Inflate.prototype.c = function (final) {\n    this.s.i = +(this.d = final || false);\n    var bts = this.s.b;\n    var dt = inflt(this.p, this.s, this.o);\n    this.ondata(slc(dt, bts, this.s.b), this.d);\n    this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n    this.p = slc(this.p, this.s.p / 8 | 0), this.s.p &= 7;\n  };\n  /**\n   * Pushes a chunk to be inflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the final chunk\n   */\n  Inflate.prototype.push = function (chunk, final) {\n    this.e(chunk), this.c(final);\n  };\n  return Inflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/function () {\n  function AsyncInflate(opts, cb) {\n    astrmify([bInflt, function () {\n      return [astrm, Inflate];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Inflate(ev.data);\n      onmessage = astrm(strm);\n    }, 7, 0);\n  }\n  return AsyncInflate;\n}();\n\nfunction inflate(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt], function (ev) {\n    return pbf(inflateSync(ev.data[0], gopt(ev.data[1])));\n  }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction inflateSync(data, opts) {\n  return inflt(data, {\n    i: 2\n  }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/function () {\n  function Gzip(opts, cb) {\n    this.c = crc();\n    this.l = 0;\n    this.v = 1;\n    Deflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be GZIPped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Gzip.prototype.push = function (chunk, final) {\n    this.c.p(chunk);\n    this.l += chunk.length;\n    Deflate.prototype.push.call(this, chunk, final);\n  };\n  Gzip.prototype.p = function (c, f) {\n    var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n    if (this.v) gzh(raw, this.o), this.v = 0;\n    if (f) wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n    this.ondata(raw, f);\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * GZIPped output for small inputs.\n   */\n  Gzip.prototype.flush = function () {\n    Deflate.prototype.flush.call(this);\n  };\n  return Gzip;\n}();\n\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/function () {\n  function AsyncGzip(opts, cb) {\n    astrmify([bDflt, gze, function () {\n      return [astrm, Deflate, Gzip];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Gzip(ev.data);\n      onmessage = astrm(strm);\n    }, 8, 1);\n  }\n  return AsyncGzip;\n}();\n\nfunction gzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt, gze, function () {\n    return [gzipSync];\n  }], function (ev) {\n    return pbf(gzipSync(ev.data[0], ev.data[1]));\n  }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nfunction gzipSync(data, opts) {\n  if (!opts) opts = {};\n  var c = crc(),\n    l = data.length;\n  c.p(data);\n  var d = dopt(data, opts, gzhl(opts), 8),\n    s = d.length;\n  return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/function () {\n  function Gunzip(opts, cb) {\n    this.v = 1;\n    this.r = 0;\n    Inflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be GUNZIPped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Gunzip.prototype.push = function (chunk, final) {\n    Inflate.prototype.e.call(this, chunk);\n    this.r += chunk.length;\n    if (this.v) {\n      var p = this.p.subarray(this.v - 1);\n      var s = p.length > 3 ? gzs(p) : 4;\n      if (s > p.length) {\n        if (!final) return;\n      } else if (this.v > 1 && this.onmember) {\n        this.onmember(this.r - p.length);\n      }\n      this.p = p.subarray(s), this.v = 0;\n    }\n    // necessary to prevent TS from using the closure value\n    // This allows for workerization to function correctly\n    Inflate.prototype.c.call(this, final);\n    // process concatenated GZIP\n    if (this.s.f && !this.s.l && !final) {\n      this.v = shft(this.s.p) + 9;\n      this.s = {\n        i: 0\n      };\n      this.o = new u8(0);\n      this.push(new u8(0), final);\n    }\n  };\n  return Gunzip;\n}();\n\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/function () {\n  function AsyncGunzip(opts, cb) {\n    var _this = this;\n    astrmify([bInflt, guze, function () {\n      return [astrm, Inflate, Gunzip];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Gunzip(ev.data);\n      strm.onmember = function (offset) {\n        return postMessage(offset);\n      };\n      onmessage = astrm(strm);\n    }, 9, 0, function (offset) {\n      return _this.onmember && _this.onmember(offset);\n    });\n  }\n  return AsyncGunzip;\n}();\n\nfunction gunzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt, guze, function () {\n    return [gunzipSync];\n  }], function (ev) {\n    return pbf(gunzipSync(ev.data[0], ev.data[1]));\n  }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction gunzipSync(data, opts) {\n  var st = gzs(data);\n  if (st + 8 > data.length) _err(6, 'invalid gzip data');\n  return inflt(data.subarray(st, -8), {\n    i: 2\n  }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/function () {\n  function Zlib(opts, cb) {\n    this.c = adler();\n    this.v = 1;\n    Deflate.call(this, opts, cb);\n  }\n  /**\n   * Pushes a chunk to be zlibbed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Zlib.prototype.push = function (chunk, final) {\n    this.c.p(chunk);\n    Deflate.prototype.push.call(this, chunk, final);\n  };\n  Zlib.prototype.p = function (c, f) {\n    var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n    if (this.v) zlh(raw, this.o), this.v = 0;\n    if (f) wbytes(raw, raw.length - 4, this.c.d());\n    this.ondata(raw, f);\n  };\n  /**\n   * Flushes buffered uncompressed data. Useful to immediately retrieve the\n   * zlibbed output for small inputs.\n   */\n  Zlib.prototype.flush = function () {\n    Deflate.prototype.flush.call(this);\n  };\n  return Zlib;\n}();\n\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/function () {\n  function AsyncZlib(opts, cb) {\n    astrmify([bDflt, zle, function () {\n      return [astrm, Deflate, Zlib];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Zlib(ev.data);\n      onmessage = astrm(strm);\n    }, 10, 1);\n  }\n  return AsyncZlib;\n}();\n\nfunction zlib(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bDflt, zle, function () {\n    return [zlibSync];\n  }], function (ev) {\n    return pbf(zlibSync(ev.data[0], ev.data[1]));\n  }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nfunction zlibSync(data, opts) {\n  if (!opts) opts = {};\n  var a = adler();\n  a.p(data);\n  var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n  return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/function () {\n  function Unzlib(opts, cb) {\n    Inflate.call(this, opts, cb);\n    this.v = opts && opts.dictionary ? 2 : 1;\n  }\n  /**\n   * Pushes a chunk to be unzlibbed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Unzlib.prototype.push = function (chunk, final) {\n    Inflate.prototype.e.call(this, chunk);\n    if (this.v) {\n      if (this.p.length < 6 && !final) return;\n      this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n    }\n    if (final) {\n      if (this.p.length < 4) _err(6, 'invalid zlib data');\n      this.p = this.p.subarray(0, -4);\n    }\n    // necessary to prevent TS from using the closure value\n    // This allows for workerization to function correctly\n    Inflate.prototype.c.call(this, final);\n  };\n  return Unzlib;\n}();\n\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/function () {\n  function AsyncUnzlib(opts, cb) {\n    astrmify([bInflt, zule, function () {\n      return [astrm, Inflate, Unzlib];\n    }], this, StrmOpt.call(this, opts, cb), function (ev) {\n      var strm = new Unzlib(ev.data);\n      onmessage = astrm(strm);\n    }, 11, 0);\n  }\n  return AsyncUnzlib;\n}();\n\nfunction unzlib(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return cbify(data, opts, [bInflt, zule, function () {\n    return [unzlibSync];\n  }], function (ev) {\n    return pbf(unzlibSync(ev.data[0], gopt(ev.data[1])));\n  }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction unzlibSync(data, opts) {\n  return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), {\n    i: 2\n  }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\n\n\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/function () {\n  function Decompress(opts, cb) {\n    this.o = StrmOpt.call(this, opts, cb) || {};\n    this.G = Gunzip;\n    this.I = Inflate;\n    this.Z = Unzlib;\n  }\n  // init substream\n  // overriden by AsyncDecompress\n  Decompress.prototype.i = function () {\n    var _this = this;\n    this.s.ondata = function (dat, final) {\n      _this.ondata(dat, final);\n    };\n  };\n  /**\n   * Pushes a chunk to be decompressed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Decompress.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (!this.s) {\n      if (this.p && this.p.length) {\n        var n = new u8(this.p.length + chunk.length);\n        n.set(this.p), n.set(chunk, this.p.length);\n      } else this.p = chunk;\n      if (this.p.length > 2) {\n        this.s = this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8 ? new this.G(this.o) : (this.p[0] & 15) != 8 || this.p[0] >> 4 > 7 || (this.p[0] << 8 | this.p[1]) % 31 ? new this.I(this.o) : new this.Z(this.o);\n        this.i();\n        this.s.push(this.p, final);\n        this.p = null;\n      }\n    } else this.s.push(chunk, final);\n  };\n  return Decompress;\n}();\n\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/function () {\n  function AsyncDecompress(opts, cb) {\n    Decompress.call(this, opts, cb);\n    this.queuedSize = 0;\n    this.G = AsyncGunzip;\n    this.I = AsyncInflate;\n    this.Z = AsyncUnzlib;\n  }\n  AsyncDecompress.prototype.i = function () {\n    var _this = this;\n    this.s.ondata = function (err, dat, final) {\n      _this.ondata(err, dat, final);\n    };\n    this.s.ondrain = function (size) {\n      _this.queuedSize -= size;\n      if (_this.ondrain) _this.ondrain(size);\n    };\n  };\n  /**\n   * Pushes a chunk to be decompressed\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  AsyncDecompress.prototype.push = function (chunk, final) {\n    this.queuedSize += chunk.length;\n    Decompress.prototype.push.call(this, chunk, final);\n  };\n  return AsyncDecompress;\n}();\n\nfunction decompress(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  return data[0] == 31 && data[1] == 139 && data[2] == 8 ? gunzip(data, opts, cb) : (data[0] & 15) != 8 || data[0] >> 4 > 7 || (data[0] << 8 | data[1]) % 31 ? inflate(data, opts, cb) : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nfunction decompressSync(data, opts) {\n  return data[0] == 31 && data[1] == 139 && data[2] == 8 ? gunzipSync(data, opts) : (data[0] & 15) != 8 || data[0] >> 4 > 7 || (data[0] << 8 | data[1]) % 31 ? inflateSync(data, opts) : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar _fltn = function fltn(d, p, t, o) {\n  for (var k in d) {\n    var val = d[k],\n      n = p + k,\n      op = o;\n    if (Array.isArray(val)) op = mrg(o, val[1]), val = val[0];\n    if (val instanceof u8) t[n] = [val, op];else {\n      t[n += '/'] = [new u8(0), op];\n      _fltn(val, n, t, o);\n    }\n  }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n  td.decode(et, {\n    stream: true\n  });\n  tds = 1;\n} catch (e) {}\n// decode UTF8\nvar dutf8 = function dutf8(d) {\n  for (var r = '', i = 0;;) {\n    var c = d[i++];\n    var eb = (c > 127) + (c > 223) + (c > 239);\n    if (i + eb > d.length) return {\n      s: r,\n      r: slc(d, i - 1)\n    };\n    if (!eb) r += String.fromCharCode(c);else if (eb == 3) {\n      c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | d[i++] & 63) - 65536, r += String.fromCharCode(55296 | c >> 10, 56320 | c & 1023);\n    } else if (eb & 1) r += String.fromCharCode((c & 31) << 6 | d[i++] & 63);else r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | d[i++] & 63);\n  }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/function () {\n  /**\n   * Creates a UTF-8 decoding stream\n   * @param cb The callback to call whenever data is decoded\n   */\n  function DecodeUTF8(cb) {\n    this.ondata = cb;\n    if (tds) this.t = new TextDecoder();else this.p = et;\n  }\n  /**\n   * Pushes a chunk to be decoded from UTF-8 binary\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  DecodeUTF8.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    final = !!final;\n    if (this.t) {\n      this.ondata(this.t.decode(chunk, {\n        stream: true\n      }), final);\n      if (final) {\n        if (this.t.decode().length) _err(8);\n        this.t = null;\n      }\n      return;\n    }\n    if (!this.p) _err(4);\n    var dat = new u8(this.p.length + chunk.length);\n    dat.set(this.p);\n    dat.set(chunk, this.p.length);\n    var _a = dutf8(dat),\n      s = _a.s,\n      r = _a.r;\n    if (final) {\n      if (r.length) _err(8);\n      this.p = null;\n    } else this.p = r;\n    this.ondata(s, final);\n  };\n  return DecodeUTF8;\n}();\n\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/function () {\n  /**\n   * Creates a UTF-8 decoding stream\n   * @param cb The callback to call whenever data is encoded\n   */\n  function EncodeUTF8(cb) {\n    this.ondata = cb;\n  }\n  /**\n   * Pushes a chunk to be encoded to UTF-8\n   * @param chunk The string data to push\n   * @param final Whether this is the last chunk\n   */\n  EncodeUTF8.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    if (this.d) _err(4);\n    this.ondata(strToU8(chunk), this.d = final || false);\n  };\n  return EncodeUTF8;\n}();\n\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nfunction strToU8(str, latin1) {\n  if (latin1) {\n    var ar_1 = new u8(str.length);\n    for (var i = 0; i < str.length; ++i) ar_1[i] = str.charCodeAt(i);\n    return ar_1;\n  }\n  if (te) return te.encode(str);\n  var l = str.length;\n  var ar = new u8(str.length + (str.length >> 1));\n  var ai = 0;\n  var w = function w(v) {\n    ar[ai++] = v;\n  };\n  for (var i = 0; i < l; ++i) {\n    if (ai + 5 > ar.length) {\n      var n = new u8(ai + 8 + (l - i << 1));\n      n.set(ar);\n      ar = n;\n    }\n    var c = str.charCodeAt(i);\n    if (c < 128 || latin1) w(c);else if (c < 2048) w(192 | c >> 6), w(128 | c & 63);else if (c > 55295 && c < 57344) c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);else w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);\n  }\n  return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nfunction strFromU8(dat, latin1) {\n  if (latin1) {\n    var r = '';\n    for (var i = 0; i < dat.length; i += 16384) r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n    return r;\n  } else if (td) {\n    return td.decode(dat);\n  } else {\n    var _a = dutf8(dat),\n      s = _a.s,\n      r = _a.r;\n    if (r.length) _err(8);\n    return s;\n  }\n}\n;\n// deflate bit flag\nvar dbf = function dbf(l) {\n  return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0;\n};\n// skip local zip header\nvar slzh = function slzh(d, b) {\n  return b + 30 + b2(d, b + 26) + b2(d, b + 28);\n};\n// read zip header\nvar zh = function zh(d, b, z) {\n  var fnl = b2(d, b + 28),\n    fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)),\n    es = b + 46 + fnl,\n    bs = b4(d, b + 20);\n  var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)],\n    sc = _a[0],\n    su = _a[1],\n    off = _a[2];\n  return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function z64e(d, b) {\n  for (; b2(d, b) != 1; b += 4 + b2(d, b + 2));\n  return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function exfl(ex) {\n  var le = 0;\n  if (ex) {\n    for (var k in ex) {\n      var l = ex[k].length;\n      if (l > 65535) _err(9);\n      le += l + 4;\n    }\n  }\n  return le;\n};\n// write zip header\nvar wzh = function wzh(d, b, f, fn, u, c, ce, co) {\n  var fl = fn.length,\n    ex = f.extra,\n    col = co && co.length;\n  var exl = exfl(ex);\n  wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n  if (ce != null) d[b++] = 20, d[b++] = f.os;\n  d[b] = 20, b += 2; // spec compliance? what's that?\n  d[b++] = f.flag << 1 | (c < 0 && 8), d[b++] = u && 8;\n  d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n  var dt = new Date(f.mtime == null ? Date.now() : f.mtime),\n    y = dt.getFullYear() - 1980;\n  if (y < 0 || y > 119) _err(10);\n  wbytes(d, b, y << 25 | dt.getMonth() + 1 << 21 | dt.getDate() << 16 | dt.getHours() << 11 | dt.getMinutes() << 5 | dt.getSeconds() >> 1), b += 4;\n  if (c != -1) {\n    wbytes(d, b, f.crc);\n    wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n    wbytes(d, b + 8, f.size);\n  }\n  wbytes(d, b + 12, fl);\n  wbytes(d, b + 14, exl), b += 16;\n  if (ce != null) {\n    wbytes(d, b, col);\n    wbytes(d, b + 6, f.attrs);\n    wbytes(d, b + 10, ce), b += 14;\n  }\n  d.set(fn, b);\n  b += fl;\n  if (exl) {\n    for (var k in ex) {\n      var exf = ex[k],\n        l = exf.length;\n      wbytes(d, b, +k);\n      wbytes(d, b + 2, l);\n      d.set(exf, b + 4), b += 4 + l;\n    }\n  }\n  if (col) d.set(co, b), b += col;\n  return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function wzf(o, b, c, d, e) {\n  wbytes(o, b, 0x6054B50); // skip disk\n  wbytes(o, b + 8, c);\n  wbytes(o, b + 10, c);\n  wbytes(o, b + 12, d);\n  wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/function () {\n  /**\n   * Creates a pass-through stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   */\n  function ZipPassThrough(filename) {\n    this.filename = filename;\n    this.c = crc();\n    this.size = 0;\n    this.compression = 0;\n  }\n  /**\n   * Processes a chunk and pushes to the output stream. You can override this\n   * method in a subclass for custom behavior, but by default this passes\n   * the data through. You must call this.ondata(err, chunk, final) at some\n   * point in this method.\n   * @param chunk The chunk to process\n   * @param final Whether this is the last chunk\n   */\n  ZipPassThrough.prototype.process = function (chunk, final) {\n    this.ondata(null, chunk, final);\n  };\n  /**\n   * Pushes a chunk to be added. If you are subclassing this with a custom\n   * compression algorithm, note that you must push data from the source\n   * file only, pre-compression.\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  ZipPassThrough.prototype.push = function (chunk, final) {\n    if (!this.ondata) _err(5);\n    this.c.p(chunk);\n    this.size += chunk.length;\n    if (final) this.crc = this.c.d();\n    this.process(chunk, final || false);\n  };\n  return ZipPassThrough;\n}();\n\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   * @param opts The compression options\n   */\n  function ZipDeflate(filename, opts) {\n    var _this = this;\n    if (!opts) opts = {};\n    ZipPassThrough.call(this, filename);\n    this.d = new Deflate(opts, function (dat, final) {\n      _this.ondata(null, dat, final);\n    });\n    this.compression = 8;\n    this.flag = dbf(opts.level);\n  }\n  ZipDeflate.prototype.process = function (chunk, final) {\n    try {\n      this.d.push(chunk, final);\n    } catch (e) {\n      this.ondata(e, null, final);\n    }\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  ZipDeflate.prototype.push = function (chunk, final) {\n    ZipPassThrough.prototype.push.call(this, chunk, final);\n  };\n  return ZipDeflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/function () {\n  /**\n   * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n   * @param filename The filename to associate with this data stream\n   * @param opts The compression options\n   */\n  function AsyncZipDeflate(filename, opts) {\n    var _this = this;\n    if (!opts) opts = {};\n    ZipPassThrough.call(this, filename);\n    this.d = new AsyncDeflate(opts, function (err, dat, final) {\n      _this.ondata(err, dat, final);\n    });\n    this.compression = 8;\n    this.flag = dbf(opts.level);\n    this.terminate = this.d.terminate;\n  }\n  AsyncZipDeflate.prototype.process = function (chunk, final) {\n    this.d.push(chunk, final);\n  };\n  /**\n   * Pushes a chunk to be deflated\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  AsyncZipDeflate.prototype.push = function (chunk, final) {\n    ZipPassThrough.prototype.push.call(this, chunk, final);\n  };\n  return AsyncZipDeflate;\n}();\n\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/function () {\n  /**\n   * Creates an empty ZIP archive to which files can be added\n   * @param cb The callback to call whenever data for the generated ZIP archive\n   *           is available\n   */\n  function Zip(cb) {\n    this.ondata = cb;\n    this.u = [];\n    this.d = 1;\n  }\n  /**\n   * Adds a file to the ZIP archive\n   * @param file The file stream to add\n   */\n  Zip.prototype.add = function (file) {\n    var _this = this;\n    if (!this.ondata) _err(5);\n    // finishing or finished\n    if (this.d & 2) this.ondata(_err(4 + (this.d & 1) * 8, 0, 1), null, false);else {\n      var f = strToU8(file.filename),\n        fl_1 = f.length;\n      var com = file.comment,\n        o = com && strToU8(com);\n      var u = fl_1 != file.filename.length || o && com.length != o.length;\n      var hl_1 = fl_1 + exfl(file.extra) + 30;\n      if (fl_1 > 65535) this.ondata(_err(11, 0, 1), null, false);\n      var header = new u8(hl_1);\n      wzh(header, 0, file, f, u, -1);\n      var chks_1 = [header];\n      var pAll_1 = function pAll_1() {\n        for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n          var chk = chks_2[_i];\n          _this.ondata(null, chk, false);\n        }\n        chks_1 = [];\n      };\n      var tr_1 = this.d;\n      this.d = 0;\n      var ind_1 = this.u.length;\n      var uf_1 = mrg(file, {\n        f: f,\n        u: u,\n        o: o,\n        t: function t() {\n          if (file.terminate) file.terminate();\n        },\n        r: function r() {\n          pAll_1();\n          if (tr_1) {\n            var nxt = _this.u[ind_1 + 1];\n            if (nxt) nxt.r();else _this.d = 1;\n          }\n          tr_1 = 1;\n        }\n      });\n      var cl_1 = 0;\n      file.ondata = function (err, dat, final) {\n        if (err) {\n          _this.ondata(err, dat, final);\n          _this.terminate();\n        } else {\n          cl_1 += dat.length;\n          chks_1.push(dat);\n          if (final) {\n            var dd = new u8(16);\n            wbytes(dd, 0, 0x8074B50);\n            wbytes(dd, 4, file.crc);\n            wbytes(dd, 8, cl_1);\n            wbytes(dd, 12, file.size);\n            chks_1.push(dd);\n            uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n            if (tr_1) uf_1.r();\n            tr_1 = 1;\n          } else if (tr_1) pAll_1();\n        }\n      };\n      this.u.push(uf_1);\n    }\n  };\n  /**\n   * Ends the process of adding files and prepares to emit the final chunks.\n   * This *must* be called after adding all desired files for the resulting\n   * ZIP file to work properly.\n   */\n  Zip.prototype.end = function () {\n    var _this = this;\n    if (this.d & 2) {\n      this.ondata(_err(4 + (this.d & 1) * 8, 0, 1), null, true);\n      return;\n    }\n    if (this.d) this.e();else this.u.push({\n      r: function r() {\n        if (!(_this.d & 1)) return;\n        _this.u.splice(-1, 1);\n        _this.e();\n      },\n      t: function t() {}\n    });\n    this.d = 3;\n  };\n  Zip.prototype.e = function () {\n    var bt = 0,\n      l = 0,\n      tl = 0;\n    for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n      var f = _a[_i];\n      tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n    }\n    var out = new u8(tl + 22);\n    for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n      var f = _c[_b];\n      wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n      bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n    }\n    wzf(out, bt, this.u.length, tl, l);\n    this.ondata(null, out, true);\n    this.d = 2;\n  };\n  /**\n   * A method to terminate any internal workers used by the stream. Subsequent\n   * calls to add() will fail.\n   */\n  Zip.prototype.terminate = function () {\n    for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n      var f = _a[_i];\n      f.t();\n    }\n    this.d = 2;\n  };\n  return Zip;\n}();\n\nfunction zip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  var r = {};\n  _fltn(data, '', r, opts);\n  var k = Object.keys(r);\n  var lft = k.length,\n    o = 0,\n    tot = 0;\n  var slft = lft,\n    files = new Array(lft);\n  var term = [];\n  var tAll = function tAll() {\n    for (var i = 0; i < term.length; ++i) term[i]();\n  };\n  var cbd = function cbd(a, b) {\n    mt(function () {\n      cb(a, b);\n    });\n  };\n  mt(function () {\n    cbd = cb;\n  });\n  var cbf = function cbf() {\n    var out = new u8(tot + 22),\n      oe = o,\n      cdl = tot - o;\n    tot = 0;\n    for (var i = 0; i < slft; ++i) {\n      var f = files[i];\n      try {\n        var l = f.c.length;\n        wzh(out, tot, f, f.f, f.u, l);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        var loc = tot + badd;\n        out.set(f.c, loc);\n        wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n      } catch (e) {\n        return cbd(e, null);\n      }\n    }\n    wzf(out, o, files.length, cdl, oe);\n    cbd(null, out);\n  };\n  if (!lft) cbf();\n  var _loop_1 = function _loop_1(i) {\n    var fn = k[i];\n    var _a = r[fn],\n      file = _a[0],\n      p = _a[1];\n    var c = crc(),\n      size = file.length;\n    c.p(file);\n    var f = strToU8(fn),\n      s = f.length;\n    var com = p.comment,\n      m = com && strToU8(com),\n      ms = m && m.length;\n    var exl = exfl(p.extra);\n    var compression = p.level == 0 ? 0 : 8;\n    var cbl = function cbl(e, d) {\n      if (e) {\n        tAll();\n        cbd(e, null);\n      } else {\n        var l = d.length;\n        files[i] = mrg(p, {\n          size: size,\n          crc: c.d(),\n          c: d,\n          f: f,\n          m: m,\n          u: s != fn.length || m && com.length != ms,\n          compression: compression\n        });\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n        if (! --lft) cbf();\n      }\n    };\n    if (s > 65535) cbl(_err(11, 0, 1), null);\n    if (!compression) cbl(null, file);else if (size < 160000) {\n      try {\n        cbl(null, deflateSync(file, p));\n      } catch (e) {\n        cbl(e, null);\n      }\n    } else term.push(deflate(file, p, cbl));\n  };\n  // Cannot use lft because it can decrease\n  for (var i = 0; i < slft; ++i) {\n    _loop_1(i);\n  }\n  return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nfunction zipSync(data, opts) {\n  if (!opts) opts = {};\n  var r = {};\n  var files = [];\n  _fltn(data, '', r, opts);\n  var o = 0;\n  var tot = 0;\n  for (var fn in r) {\n    var _a = r[fn],\n      file = _a[0],\n      p = _a[1];\n    var compression = p.level == 0 ? 0 : 8;\n    var f = strToU8(fn),\n      s = f.length;\n    var com = p.comment,\n      m = com && strToU8(com),\n      ms = m && m.length;\n    var exl = exfl(p.extra);\n    if (s > 65535) _err(11);\n    var d = compression ? deflateSync(file, p) : file,\n      l = d.length;\n    var c = crc();\n    c.p(file);\n    files.push(mrg(p, {\n      size: file.length,\n      crc: c.d(),\n      c: d,\n      f: f,\n      m: m,\n      u: s != fn.length || m && com.length != ms,\n      o: o,\n      compression: compression\n    }));\n    o += 30 + s + exl + l;\n    tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n  }\n  var out = new u8(tot + 22),\n    oe = o,\n    cdl = tot - o;\n  for (var i = 0; i < files.length; ++i) {\n    var f = files[i];\n    wzh(out, f.o, f, f.f, f.u, f.c.length);\n    var badd = 30 + f.f.length + exfl(f.extra);\n    out.set(f.c, f.o + badd);\n    wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n  }\n  wzf(out, o, files.length, cdl, oe);\n  return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/function () {\n  function UnzipPassThrough() {}\n  UnzipPassThrough.prototype.push = function (data, final) {\n    this.ondata(null, data, final);\n  };\n  UnzipPassThrough.compression = 0;\n  return UnzipPassThrough;\n}();\n\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE decompression that can be used in ZIP archives\n   */\n  function UnzipInflate() {\n    var _this = this;\n    this.i = new Inflate(function (dat, final) {\n      _this.ondata(null, dat, final);\n    });\n  }\n  UnzipInflate.prototype.push = function (data, final) {\n    try {\n      this.i.push(data, final);\n    } catch (e) {\n      this.ondata(e, null, final);\n    }\n  };\n  UnzipInflate.compression = 8;\n  return UnzipInflate;\n}();\n\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/function () {\n  /**\n   * Creates a DEFLATE decompression that can be used in ZIP archives\n   */\n  function AsyncUnzipInflate(_, sz) {\n    var _this = this;\n    if (sz < 320000) {\n      this.i = new Inflate(function (dat, final) {\n        _this.ondata(null, dat, final);\n      });\n    } else {\n      this.i = new AsyncInflate(function (err, dat, final) {\n        _this.ondata(err, dat, final);\n      });\n      this.terminate = this.i.terminate;\n    }\n  }\n  AsyncUnzipInflate.prototype.push = function (data, final) {\n    if (this.i.terminate) data = slc(data, 0);\n    this.i.push(data, final);\n  };\n  AsyncUnzipInflate.compression = 8;\n  return AsyncUnzipInflate;\n}();\n\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/function () {\n  /**\n   * Creates a ZIP decompression stream\n   * @param cb The callback to call whenever a file in the ZIP archive is found\n   */\n  function Unzip(cb) {\n    this.onfile = cb;\n    this.k = [];\n    this.o = {\n      0: UnzipPassThrough\n    };\n    this.p = et;\n  }\n  /**\n   * Pushes a chunk to be unzipped\n   * @param chunk The chunk to push\n   * @param final Whether this is the last chunk\n   */\n  Unzip.prototype.push = function (chunk, final) {\n    var _this = this;\n    if (!this.onfile) _err(5);\n    if (!this.p) _err(4);\n    if (this.c > 0) {\n      var len = Math.min(this.c, chunk.length);\n      var toAdd = chunk.subarray(0, len);\n      this.c -= len;\n      if (this.d) this.d.push(toAdd, !this.c);else this.k[0].push(toAdd);\n      chunk = chunk.subarray(len);\n      if (chunk.length) return this.push(chunk, final);\n    } else {\n      var f = 0,\n        i = 0,\n        is = void 0,\n        buf = void 0;\n      if (!this.p.length) buf = chunk;else if (!chunk.length) buf = this.p;else {\n        buf = new u8(this.p.length + chunk.length);\n        buf.set(this.p), buf.set(chunk, this.p.length);\n      }\n      var l = buf.length,\n        oc = this.c,\n        add = oc && this.d;\n      var _loop_2 = function _loop_2() {\n        var _a;\n        var sig = b4(buf, i);\n        if (sig == 0x4034B50) {\n          f = 1, is = i;\n          this_1.d = null;\n          this_1.c = 0;\n          var bf = b2(buf, i + 6),\n            cmp_1 = b2(buf, i + 8),\n            u = bf & 2048,\n            dd = bf & 8,\n            fnl = b2(buf, i + 26),\n            es = b2(buf, i + 28);\n          if (l > i + 30 + fnl + es) {\n            var chks_3 = [];\n            this_1.k.unshift(chks_3);\n            f = 2;\n            var sc_1 = b4(buf, i + 18),\n              su_1 = b4(buf, i + 22);\n            var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n            if (sc_1 == 4294967295) {\n              _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n            } else if (dd) sc_1 = -1;\n            i += es;\n            this_1.c = sc_1;\n            var d_1;\n            var file_1 = {\n              name: fn_1,\n              compression: cmp_1,\n              start: function start() {\n                if (!file_1.ondata) _err(5);\n                if (!sc_1) file_1.ondata(null, et, true);else {\n                  var ctr = _this.o[cmp_1];\n                  if (!ctr) file_1.ondata(_err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                  d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                  d_1.ondata = function (err, dat, final) {\n                    file_1.ondata(err, dat, final);\n                  };\n                  for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                    var dat = chks_4[_i];\n                    d_1.push(dat, false);\n                  }\n                  if (_this.k[0] == chks_3 && _this.c) _this.d = d_1;else d_1.push(et, true);\n                }\n              },\n              terminate: function terminate() {\n                if (d_1 && d_1.terminate) d_1.terminate();\n              }\n            };\n            if (sc_1 >= 0) file_1.size = sc_1, file_1.originalSize = su_1;\n            this_1.onfile(file_1);\n          }\n          return \"break\";\n        } else if (oc) {\n          if (sig == 0x8074B50) {\n            is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n            return \"break\";\n          } else if (sig == 0x2014B50) {\n            is = i -= 4, f = 3, this_1.c = 0;\n            return \"break\";\n          }\n        }\n      };\n      var this_1 = this;\n      for (; i < l - 4; ++i) {\n        var state_1 = _loop_2();\n        if (state_1 === \"break\") break;\n      }\n      this.p = et;\n      if (oc < 0) {\n        var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n        if (add) add.push(dat, !!f);else this.k[+(f == 2)].push(dat);\n      }\n      if (f & 2) return this.push(buf.subarray(i), final);\n      this.p = buf.subarray(i);\n    }\n    if (final) {\n      if (this.c) _err(13);\n      this.p = null;\n    }\n  };\n  /**\n   * Registers a decoder with the stream, allowing for files compressed with\n   * the compression type provided to be expanded correctly\n   * @param decoder The decoder constructor\n   */\n  Unzip.prototype.register = function (decoder) {\n    this.o[decoder.compression] = decoder;\n  };\n  return Unzip;\n}();\n\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) {\n  fn();\n};\nfunction unzip(data, opts, cb) {\n  if (!cb) cb = opts, opts = {};\n  if (typeof cb != 'function') _err(7);\n  var term = [];\n  var tAll = function tAll() {\n    for (var i = 0; i < term.length; ++i) term[i]();\n  };\n  var files = {};\n  var cbd = function cbd(a, b) {\n    mt(function () {\n      cb(a, b);\n    });\n  };\n  mt(function () {\n    cbd = cb;\n  });\n  var e = data.length - 22;\n  for (; b4(data, e) != 0x6054B50; --e) {\n    if (!e || data.length - e > 65558) {\n      cbd(_err(13, 0, 1), null);\n      return tAll;\n    }\n  }\n  ;\n  var lft = b2(data, e + 8);\n  if (lft) {\n    var c = lft;\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n      var ze = b4(data, e - 12);\n      z = b4(data, ze) == 0x6064B50;\n      if (z) {\n        c = lft = b4(data, ze + 32);\n        o = b4(data, ze + 48);\n      }\n    }\n    var fltr = opts && opts.filter;\n    var _loop_3 = function _loop_3(i) {\n      var _a = zh(data, o, z),\n        c_1 = _a[0],\n        sc = _a[1],\n        su = _a[2],\n        fn = _a[3],\n        no = _a[4],\n        off = _a[5],\n        b = slzh(data, off);\n      o = no;\n      var cbl = function cbl(e, d) {\n        if (e) {\n          tAll();\n          cbd(e, null);\n        } else {\n          if (d) files[fn] = d;\n          if (! --lft) cbd(null, files);\n        }\n      };\n      if (!fltr || fltr({\n        name: fn,\n        size: sc,\n        originalSize: su,\n        compression: c_1\n      })) {\n        if (!c_1) cbl(null, slc(data, b, b + sc));else if (c_1 == 8) {\n          var infl = data.subarray(b, b + sc);\n          // Synchronously decompress under 512KB, or barely-compressed data\n          if (su < 524288 || sc > 0.8 * su) {\n            try {\n              cbl(null, inflateSync(infl, {\n                out: new u8(su)\n              }));\n            } catch (e) {\n              cbl(e, null);\n            }\n          } else term.push(inflate(infl, {\n            size: su\n          }, cbl));\n        } else cbl(_err(14, 'unknown compression type ' + c_1, 1), null);\n      } else cbl(null, null);\n    };\n    for (var i = 0; i < c; ++i) {\n      _loop_3(i);\n    }\n  } else cbd(null, {});\n  return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nfunction unzipSync(data, opts) {\n  var files = {};\n  var e = data.length - 22;\n  for (; b4(data, e) != 0x6054B50; --e) {\n    if (!e || data.length - e > 65558) _err(13);\n  }\n  ;\n  var c = b2(data, e + 8);\n  if (!c) return {};\n  var o = b4(data, e + 16);\n  var z = o == 4294967295 || c == 65535;\n  if (z) {\n    var ze = b4(data, e - 12);\n    z = b4(data, ze) == 0x6064B50;\n    if (z) {\n      c = b4(data, ze + 32);\n      o = b4(data, ze + 48);\n    }\n  }\n  var fltr = opts && opts.filter;\n  for (var i = 0; i < c; ++i) {\n    var _a = zh(data, o, z),\n      c_2 = _a[0],\n      sc = _a[1],\n      su = _a[2],\n      fn = _a[3],\n      no = _a[4],\n      off = _a[5],\n      b = slzh(data, off);\n    o = no;\n    if (!fltr || fltr({\n      name: fn,\n      size: sc,\n      originalSize: su,\n      compression: c_2\n    })) {\n      if (!c_2) files[fn] = slc(data, b, b + sc);else if (c_2 == 8) files[fn] = inflateSync(data.subarray(b, b + sc), {\n        out: new u8(su)\n      });else _err(14, 'unknown compression type ' + c_2);\n    }\n  }\n  return files;\n}\n// CONCATENATED MODULE: ./node_modules/babel-loader/lib!./node_modules/eslint-loader??ref--13-0!./packages/utils/StreamLoaderParser.worker.js\n\nself.__streamLoaderStates = self.__streamLoaderStates || new Map();\nvar utf8Decoder = new TextDecoder('utf-8');\nself.onmessage = function (e) {\n  var _e$data = e.data,\n    id = _e$data.id,\n    type = _e$data.type,\n    data = _e$data.data;\n  if (type === 'parseBufferData') {\n    try {\n      var buffer = data.buffer,\n        prefixIdKey = data.prefixIdKey;\n      var result = parseBufferData(buffer, prefixIdKey);\n      // Transfer the buffer back if possible, but we constructed new arrays.\n      // We rely on structured cloning.\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: result\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamInit') {\n    try {\n      var _ref = data || {},\n        streamId = _ref.streamId,\n        _prefixIdKey = _ref.prefixIdKey;\n      if (!streamId) throw new Error('Missing streamId');\n      var state = createStreamState(_prefixIdKey);\n      self.__streamLoaderStates.set(streamId, state);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: true\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamPush') {\n    try {\n      var _ref2 = data || {},\n        _streamId = _ref2.streamId,\n        chunk = _ref2.chunk,\n        _ref2$byteOffset = _ref2.byteOffset,\n        byteOffset = _ref2$byteOffset === void 0 ? 0 : _ref2$byteOffset,\n        byteLength = _ref2.byteLength,\n        _prefixIdKey2 = _ref2.prefixIdKey;\n      if (!_streamId) throw new Error('Missing streamId');\n      var _state = self.__streamLoaderStates.get(_streamId);\n      if (!_state) {\n        _state = createStreamState(_prefixIdKey2);\n        self.__streamLoaderStates.set(_streamId, _state);\n      }\n      var view = new Uint8Array(chunk, byteOffset, byteLength !== null && byteLength !== void 0 ? byteLength : chunk.byteLength - byteOffset);\n      var _result = parseStreamChunk(_state, view);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamFlush') {\n    try {\n      var _ref3 = data || {},\n        _streamId2 = _ref3.streamId;\n      if (!_streamId2) throw new Error('Missing streamId');\n      var _state2 = self.__streamLoaderStates.get(_streamId2);\n      if (!_state2) {\n        self.postMessage({\n          id: id,\n          type: 'success',\n          result: {\n            meshes: [],\n            primitives: []\n          }\n        });\n        return;\n      }\n      var _result2 = parseStreamChunk(_state2, null, true);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result2\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'streamDispose') {\n    try {\n      var _ref4 = data || {},\n        _streamId3 = _ref4.streamId;\n      if (_streamId3) self.__streamLoaderStates.delete(_streamId3);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: true\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'buildInstancedMapping') {\n    try {\n      var _ref5 = data || {},\n        instances = _ref5.instances,\n        drawObjs = _ref5.drawObjs;\n      var _result3 = buildInstancedMapping(instances || [], drawObjs || []);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result3\n      });\n    } catch (error) {\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message\n      });\n    }\n  } else if (type === 'occlusionScan') {\n    var transfer = data && data.buffer ? [data.buffer] : [];\n    try {\n      var _ref6 = data || {},\n        _buffer = _ref6.buffer,\n        sw = _ref6.sw,\n        sh = _ref6.sh,\n        stride = _ref6.stride,\n        maxIdx = _ref6.maxIdx,\n        minSampleCount = _ref6.minSampleCount;\n      var _result4 = scanOcclusionBuffer(_buffer, sw, sh, stride, maxIdx, minSampleCount);\n      self.postMessage({\n        id: id,\n        type: 'success',\n        result: _result4,\n        buffer: _buffer\n      }, transfer);\n    } catch (error) {\n      var _buffer2 = data && data.buffer ? data.buffer : null;\n      self.postMessage({\n        id: id,\n        type: 'error',\n        error: error.message,\n        buffer: _buffer2\n      }, transfer);\n    }\n  }\n};\nfunction createStreamState(prefixIdKey) {\n  return {\n    prefixIdKey: prefixIdKey || '',\n    buffer: new Uint8Array(),\n    pendingPrimitives: new Map(),\n    expectingPrimitive: true,\n    isFullProps: true\n  };\n}\nfunction parseStreamChunk(state, chunkView) {\n  var flushing = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (chunkView && chunkView.length > 0) {\n    var merged = new Uint8Array(state.buffer.length + chunkView.length);\n    merged.set(state.buffer);\n    merged.set(chunkView, state.buffer.length);\n    state.buffer = merged;\n  }\n  var meshes = [];\n  var primitives = [];\n  while (state.buffer.length > 0) {\n    if (state.expectingPrimitive) {\n      if (state.buffer.length < 12) break;\n      try {\n        var dataView = new DataView(state.buffer.buffer, state.buffer.byteOffset, state.buffer.byteLength);\n        var primitiveResult = parsePrimitive(dataView, state.buffer, 0, state.isFullProps);\n        var primitiveData = primitiveResult.primitive;\n        _applyPrefixId(primitiveData, 'id', null, state.prefixIdKey);\n        _applyPrefixId(primitiveData, 'material', null, state.prefixIdKey);\n        if (state.isFullProps) {\n          var _parsePrimitiveData = parsePrimitiveData(primitiveData),\n            position = _parsePrimitiveData.position,\n            normal = _parsePrimitiveData.normal,\n            posindex = _parsePrimitiveData.posindex,\n            nolindex = _parsePrimitiveData.nolindex,\n            indices = _parsePrimitiveData.indices;\n          var formatted = formatPrimitiveData({\n            position: position,\n            normal: normal,\n            posindex: posindex,\n            nolindex: nolindex\n          });\n          delete primitiveData.nolindex;\n          delete primitiveData.posindex;\n          primitiveData.position = formatted.position;\n          primitiveData.normal = formatted.normal;\n          primitiveData.indices = indices;\n        }\n        state.pendingPrimitives.set(primitiveData.id, primitiveData);\n        state.expectingPrimitive = false;\n        state.buffer = state.buffer.slice(primitiveResult.offset);\n      } catch (e) {\n        break;\n      }\n    } else {\n      if (state.buffer.length < 4) break;\n      var length = new DataView(state.buffer.buffer, state.buffer.byteOffset).getUint32(0, false);\n      if (length > 10 * 1024 * 1024) {\n        state.expectingPrimitive = true;\n        continue;\n      }\n      var totalLen = 4 + length;\n      if (state.buffer.length < totalLen) break;\n      var data = state.buffer.slice(4, totalLen);\n      var mesh = null;\n      try {\n        var jsonStr = utf8Decoder.decode(data);\n        mesh = JSON.parse(jsonStr);\n      } catch (e) {\n        state.expectingPrimitive = true;\n        continue;\n      }\n      if (mesh) {\n        state.isFullProps = true;\n        _applyPrefixId(mesh, 'id', null, state.prefixIdKey);\n        if (Array.isArray(mesh)) {\n          mesh.forEach(function (item) {\n            _applyPrefixId(item.primitives, 'prmid', item.documentId, state.prefixIdKey);\n          });\n        } else {\n          _applyPrefixId(mesh.primitives, 'prmid', mesh.documentId, state.prefixIdKey);\n        }\n        var docId = mesh.id;\n        var meshToPrimId = mesh.primitives.map(function (item) {\n          return item.prmid;\n        });\n        var hasPendingPrimitive = meshToPrimId.some(function (item) {\n          return state.pendingPrimitives.has(item);\n        });\n        var hasPendingMesh = state.pendingPrimitives.has(docId);\n        if (hasPendingMesh || hasPendingPrimitive) {\n          var _primitiveData = state.pendingPrimitives.get(docId);\n          if (!hasPendingMesh && hasPendingPrimitive) {\n            _primitiveData = state.pendingPrimitives.get(meshToPrimId[0]);\n          }\n          meshes.push(mesh);\n          primitives.push(_primitiveData);\n        }\n        state.expectingPrimitive = false;\n        state.buffer = state.buffer.slice(totalLen);\n      }\n    }\n  }\n  if (flushing) {\n    state.buffer = new Uint8Array();\n  }\n  return {\n    meshes: meshes,\n    primitives: primitives\n  };\n}\nfunction parseBufferData(buffer, prefixIdKey) {\n  var uint8Array = null;\n  var dataView = null;\n  var meshJsonBytes = null;\n  var primitives = [];\n  var mesh = null;\n  try {\n    uint8Array = new Uint8Array(buffer);\n    dataView = new DataView(buffer);\n    var offset = 0;\n    var meshJsonLength = dataView.getInt32(offset, false);\n    offset += 4;\n    meshJsonBytes = new Uint8Array(uint8Array.buffer.slice(offset, offset + meshJsonLength));\n    offset += meshJsonLength;\n    var meshJsonStr = utf8Decoder.decode(meshJsonBytes);\n    meshJsonBytes = null;\n    try {\n      mesh = JSON.parse(meshJsonStr);\n      _applyPrefixId(mesh, 'id', null, prefixIdKey);\n      if (Array.isArray(mesh)) {\n        mesh.forEach(function (item) {\n          _applyPrefixId(item.primitives, 'prmid', item.documentId, prefixIdKey);\n        });\n      } else {\n        _applyPrefixId(mesh.primitives, 'prmid', mesh.documentId, prefixIdKey);\n      }\n    } catch (e) {\n      console.error('JSON 解析失败:', e, meshJsonStr);\n      throw new Error('JSON解析失败');\n    }\n    while (offset < uint8Array.length) {\n      try {\n        var result = parsePrimitive(dataView, uint8Array, offset);\n        if (!result) break;\n        primitives.push(result.primitive);\n        offset = result.offset;\n      } catch (e) {\n        console.error('解析失败，偏移:', offset, e);\n        break;\n      }\n    }\n    for (var i = 0; i < primitives.length; i++) {\n      var primitive = primitives[i];\n      _applyPrefixId(primitive, 'id', null, prefixIdKey);\n      _applyPrefixId(primitive, 'material', null, prefixIdKey);\n      var _parsePrimitiveData2 = parsePrimitiveData(primitive),\n        position = _parsePrimitiveData2.position,\n        normal = _parsePrimitiveData2.normal,\n        posindex = _parsePrimitiveData2.posindex,\n        nolindex = _parsePrimitiveData2.nolindex,\n        indices = _parsePrimitiveData2.indices;\n      var formatted = formatPrimitiveData({\n        position: position,\n        normal: normal,\n        posindex: posindex,\n        nolindex: nolindex\n      });\n      delete primitive.nolindex;\n      delete primitive.posindex;\n      primitive.position = formatted.position;\n      primitive.normal = formatted.normal;\n      primitive.indices = indices;\n    }\n    return {\n      mesh: mesh,\n      primitives: primitives\n    };\n  } catch (error) {\n    throw error;\n  }\n}\nfunction _applyPrefixId(target, propKey, customPrefixId, prefixIdKey) {\n  if (!prefixIdKey || !target) return;\n  if (Array.isArray(target)) {\n    target.forEach(function (item) {\n      var prefixId = customPrefixId || item[prefixIdKey];\n      if (item && prefixId && item[propKey] != null) {\n        item[propKey] = \"\".concat(item[propKey], \":\").concat(prefixId);\n      }\n    });\n  } else if ((customPrefixId || target[prefixIdKey]) && target[propKey] != null) {\n    var prefixId = customPrefixId || target[prefixIdKey];\n    target[propKey] = \"\".concat(target[propKey], \":\").concat(prefixId);\n  }\n}\nfunction parsePrimitive(dataView, uint8Array, offset) {\n  var isFullProps = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;\n  var primitive = {};\n  if (dataView.byteLength < offset + 12) {\n    throw new Error('Insufficient data for primitive header');\n  }\n  primitive.id = dataView.getInt32(offset, false);\n  offset += 4;\n  if (dataView.byteLength < offset + 4) {\n    throw new Error('Insufficient data for GeomText length');\n  }\n  var documentTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (documentTextLen === 0xffffffff) {\n    primitive.documentId = null;\n  } else if (documentTextLen > 0) {\n    if (dataView.byteLength < offset + documentTextLen) {\n      throw new Error('Insufficient data for GeomText content');\n    }\n    var textBytes = uint8Array.subarray(offset, offset + documentTextLen);\n    primitive.documentId = utf8Decoder.decode(textBytes);\n    offset += documentTextLen;\n  } else {\n    primitive.documentId = '';\n  }\n  primitive.material = dataView.getInt32(offset, false);\n  offset += 4;\n  if (dataView.byteLength < offset + 4) {\n    throw new Error('Insufficient data for GeomText length');\n  }\n  var geomTextLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (geomTextLen === 0xffffffff) {\n    primitive.geomText = null;\n  } else if (geomTextLen > 0) {\n    if (dataView.byteLength < offset + geomTextLen) {\n      throw new Error('Insufficient data for GeomText content');\n    }\n    var _textBytes = uint8Array.subarray(offset, offset + geomTextLen);\n    primitive.geomText = utf8Decoder.decode(_textBytes);\n    offset += geomTextLen;\n  } else {\n    primitive.geomText = '';\n  }\n  primitive.isCompressed = dataView.getInt32(offset, false);\n  offset += 4;\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Position length');\n    var positionLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (positionLen === 0xffffffff) {\n      primitive.position = null;\n    } else {\n      if (dataView.byteLength < offset + positionLen) throw new Error('Insufficient data for Position content');\n      primitive.position = uint8Array.subarray(offset, offset + positionLen);\n      offset += positionLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Normal length');\n    var normalLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (normalLen === 0xffffffff) {\n      primitive.normal = null;\n    } else {\n      if (dataView.byteLength < offset + normalLen) throw new Error('Insufficient data for Normal content');\n      primitive.normal = uint8Array.subarray(offset, offset + normalLen);\n      offset += normalLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Indices length');\n    var indicesLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (indicesLen === 0xffffffff) {\n      primitive.indices = null;\n    } else {\n      if (dataView.byteLength < offset + indicesLen) throw new Error('Insufficient data for Indices content');\n      primitive.indices = uint8Array.subarray(offset, offset + indicesLen);\n      offset += indicesLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Posindex length');\n    var posindexLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (posindexLen === 0xffffffff) {\n      primitive.posindex = null;\n    } else {\n      if (dataView.byteLength < offset + posindexLen) throw new Error('Insufficient data for Posindex content');\n      primitive.posindex = uint8Array.subarray(offset, offset + posindexLen);\n      offset += posindexLen;\n    }\n  }\n  if (isFullProps) {\n    if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Nolindex length');\n    var nolindexLen = dataView.getUint32(offset, false);\n    offset += 4;\n    if (nolindexLen === 0xffffffff) {\n      primitive.nolindex = null;\n    } else {\n      if (dataView.byteLength < offset + nolindexLen) throw new Error('Insufficient data for Nolindex content');\n      primitive.nolindex = uint8Array.subarray(offset, offset + nolindexLen);\n      offset += nolindexLen;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for DataType length');\n  var dataTypeLen = dataView.getUint32(offset, false);\n  offset += 4;\n  if (dataTypeLen === 0xffffffff) {\n    primitive.dataType = null;\n  } else if (dataTypeLen > 0) {\n    if (dataView.byteLength < offset + dataTypeLen) throw new Error('Insufficient data for DataType content');\n    var _textBytes2 = uint8Array.subarray(offset, offset + dataTypeLen);\n    primitive.dataType = utf8Decoder.decode(_textBytes2);\n    offset += dataTypeLen;\n  } else {\n    primitive.dataType = '';\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Min count');\n  var minCount = dataView.getUint32(offset, false);\n  offset += 4;\n  if (minCount === 0xffffffff) {\n    primitive.min = null;\n  } else {\n    if (dataView.byteLength < offset + minCount * 8) throw new Error('Insufficient data for Min values');\n    primitive.min = [];\n    for (var i = 0; i < minCount; i++) {\n      primitive.min.push(dataView.getFloat64(offset, false));\n      offset += 8;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for Max count');\n  var maxCount = dataView.getUint32(offset, false);\n  offset += 4;\n  if (maxCount === 0xffffffff) {\n    primitive.max = null;\n  } else {\n    if (dataView.byteLength < offset + maxCount * 8) throw new Error('Insufficient data for Max values');\n    primitive.max = [];\n    for (var _i = 0; _i < maxCount; _i++) {\n      primitive.max.push(dataView.getFloat64(offset, false));\n      offset += 8;\n    }\n  }\n  if (dataView.byteLength < offset + 4) throw new Error('Insufficient data for GeomType');\n  primitive.geomType = dataView.getInt32(offset, false);\n  offset += 4;\n  return {\n    primitive: primitive,\n    offset: offset\n  };\n}\nfunction parsePrimitiveData(primitive) {\n  var keyOrder = ['position', 'normal', 'indices', 'posindex', 'nolindex'];\n  var typeMap = {\n    0: {\n      bytes: 4,\n      getter: 'getFloat32'\n    },\n    1: {\n      bytes: 4,\n      getter: 'getInt32'\n    },\n    2: {\n      bytes: 2,\n      getter: 'getInt16'\n    }\n  };\n  var parsedResult = {};\n  var dataTypeString = primitive.dataType;\n  for (var i = 0; i < keyOrder.length; i++) {\n    var key = keyOrder[i];\n    var typeCode = dataTypeString[i];\n    var typeInfo = typeMap[typeCode];\n    var uint8Array = primitive.isCompressed === 1 || primitive.isCompressed === undefined ? gunzipSync(primitive[key]) : primitive[key];\n    if (!typeInfo || !uint8Array) {\n      // console.warn(`无法找到键 \"${key}\" 或其类型定义，已跳过。`);\n      parsedResult[key] = [];\n      continue;\n    }\n    var result_array = [];\n    var dataView = new DataView(uint8Array.buffer, uint8Array.byteOffset, uint8Array.byteLength);\n    var littleEndian = true;\n    for (var byteOffset = 0; byteOffset < dataView.byteLength; byteOffset += typeInfo.bytes) {\n      if (byteOffset + typeInfo.bytes > dataView.byteLength) {\n        console.warn(\"\\u952E \\\"\".concat(key, \"\\\" \\u7684\\u6570\\u636E\\u957F\\u5EA6 (\").concat(dataView.byteLength, \") \\u4E0D\\u662F\\u5176\\u7C7B\\u578B (\").concat(typeInfo.bytes, \"\\u5B57\\u8282) \\u7684\\u6574\\u6570\\u500D\\uFF0C\\u672B\\u5C3E\\u6570\\u636E\\u53EF\\u80FD\\u4E0D\\u5B8C\\u6574\\u3002\"));\n        break;\n      }\n      var value = dataView[typeInfo.getter](byteOffset, littleEndian);\n      result_array.push(value);\n    }\n    parsedResult[key] = result_array;\n  }\n  return parsedResult;\n}\nfunction formatPrimitiveData(primitive) {\n  var position = primitive.position,\n    normal = primitive.normal,\n    posindex = primitive.posindex,\n    nolindex = primitive.nolindex;\n  var restoredPosition = new Array(posindex.length);\n  var restoredNormal = new Array(nolindex.length);\n  for (var i = 0; i < posindex.length; i++) {\n    var posIndex = posindex[i];\n    restoredPosition[i] = position[posIndex];\n  }\n  for (var _i2 = 0; _i2 < nolindex.length; _i2++) {\n    var normalIndex = nolindex[_i2];\n    restoredNormal[_i2] = normal[normalIndex];\n  }\n  primitive.position = null;\n  primitive.normal = null;\n  primitive.posindex = null;\n  primitive.nolindex = null;\n  return {\n    position: restoredPosition,\n    normal: restoredNormal\n  };\n}\nfunction buildInstancedMapping(instances, drawObjs) {\n  var drawObjMapInstance = {};\n  var instanceToDrawObject = [];\n  var meshByPrimId = new Map();\n  for (var i = 0; i < drawObjs.length; i++) {\n    var item = drawObjs[i];\n    if (!item || !Array.isArray(item.geoms)) continue;\n    var geoms = item.geoms;\n    for (var j = 0; j < geoms.length; j++) {\n      var geom = geoms[j];\n      if (geom && geom.prmid !== undefined && geom.prmid !== null) {\n        meshByPrimId.set(geom.prmid, geoms);\n      }\n    }\n  }\n  var seenByDrawObject = new Map();\n  for (var _i3 = 0; _i3 < instances.length; _i3++) {\n    var instance = instances[_i3];\n    if (!instance) continue;\n    var drawObject = instance.drawObject;\n    if (!drawObject) continue;\n    instanceToDrawObject.push({\n      instanceId: instance.instanceId,\n      drawObjectId: drawObject\n    });\n    var record = drawObjMapInstance[drawObject];\n    if (!record) {\n      record = {\n        MapInstance: [],\n        MapMesh: meshByPrimId.get(drawObject)\n      };\n      drawObjMapInstance[drawObject] = record;\n      seenByDrawObject.set(drawObject, new Set());\n    }\n    var seen = seenByDrawObject.get(drawObject);\n    if (!seen.has(instance.instanceId)) {\n      record.MapInstance.push(instance);\n      seen.add(instance.instanceId);\n    }\n  }\n  return {\n    drawObjMapInstance: drawObjMapInstance,\n    instanceToDrawObject: instanceToDrawObject\n  };\n}\nfunction scanOcclusionBuffer(buffer, sw, sh, stride, maxIdx, minSampleCount) {\n  var indices = [];\n  if (!buffer || !sw || !sh || !maxIdx) return {\n    indices: indices\n  };\n  var view = buffer instanceof Uint8Array ? buffer : new Uint8Array(buffer);\n  var step = Math.max(1, stride || 1);\n  var minCount = Math.max(1, minSampleCount || 1);\n  var counts = new Uint32Array(maxIdx + 1);\n  for (var y = 0; y < sh; y += step) {\n    var row = y * sw * 4;\n    for (var x = 0; x < sw; x += step) {\n      var p = row + x * 4;\n      var idxColor = view[p] + (view[p + 1] << 8) + (view[p + 2] << 16);\n      if (idxColor > 0 && idxColor <= maxIdx) {\n        var next = counts[idxColor] + 1;\n        counts[idxColor] = next;\n        if (next === minCount) {\n          indices.push(idxColor);\n        }\n      }\n    }\n  }\n  return {\n    indices: indices\n  };\n}\n\n/***/ })\n\n/******/ });\n", "Worker", undefined, undefined);
 }
 
 // CONCATENATED MODULE: ./src/utils/instance-parser.js
@@ -111552,37 +111549,9 @@ function getInstanceNormalSign(matrix) {
   if (!matrix || typeof matrix.determinant !== 'function') return 1;
   return matrix.determinant() < 0 ? -1 : 1;
 }
-function getMatrixVal(matrix) {
-  var val = matrix && matrix.val ? matrix.val : matrix;
-  return val && val.length >= 16 ? val : null;
-}
-function composeInstanceMatrix(instance, mesh, geometry) {
-  var resultMatrix = new Matrix4();
-  var meshMatrix = new Matrix4();
-  var primitiveMatrix = new Matrix4();
-  var meshMatrixVal = getMatrixVal(instance && instance.matrix);
-  var primitiveMatrixVal = getMatrixVal(mesh && mesh.matrix);
-  if (meshMatrixVal) {
-    meshMatrix.fromArray(meshMatrixVal);
-  }
-  if (primitiveMatrixVal) {
-    primitiveMatrix.fromArray(primitiveMatrixVal);
-  }
-  var _ref = mesh || {},
-    points = _ref.points,
-    alignType = _ref.alignType;
-  if (mesh && isTextType(mesh.type) && points && points.length >= 3) {
-    var positionMatrix = new Matrix4();
-    var alignMatrix = createAlignedText(alignType, geometry);
-    positionMatrix.identity().makeTranslation(points[0], points[1], points[2]);
-    primitiveMatrix.multiply(alignMatrix).multiply(positionMatrix);
-  }
-  resultMatrix.multiplyMatrices(meshMatrix, primitiveMatrix);
-  return resultMatrix;
-}
 
-/**
- * 重置处理状态，用于新的批量加载会话
+/**
+ * 重置处理状态，用于新的批量加载会话
  */
 function resetProcessingState() {
   drawObjMapInstance = {};
@@ -111892,6 +111861,7 @@ function setInstanceMatricesAndColors(model, drawObj, mesh, meshName, customColo
 
   // 批量处理实例
   instances.forEach(function (item, index) {
+    var _item$matrix;
     // 设置用户数据
     model.userData.instanceIndex = index;
     model.userData.instanceId = item.instanceId;
@@ -111920,19 +111890,38 @@ function setInstanceMatricesAndColors(model, drawObj, mesh, meshName, customColo
 
     // const instancedMesh = instanceToInstancedMeshMap.get(item.instanceId);
 
-    var m4 = composeInstanceMatrix(item, mesh, model.geometry);
-    model.setMatrixAt(index, m4);
-    var normalSignAttr = model.geometry && model.geometry.getAttribute('instanceNormalSign');
-    if (normalSignAttr && normalSignAttr.array && index < normalSignAttr.array.length) {
-      normalSignAttr.array[index] = getInstanceNormalSign(m4);
-    }
-    var copyMatrix = new Matrix4().copy(m4);
-    model.userData.copyMatrix = copyMatrix;
-    var temp = model.userData.instancesMap.get(item.instanceId);
-    temp.copyMatrix = copyMatrix;
-    if (sourceVisible === false) {
-      var offsetMatrix = new Matrix4().copy(copyMatrix).makeTranslation(9999999, 9999999, 9999999);
-      model.setMatrixAt(index, offsetMatrix);
+    // 处理矩阵变换
+    var matrixVal = (_item$matrix = item.matrix) === null || _item$matrix === void 0 ? void 0 : _item$matrix.val;
+    if (matrixVal) {
+      var m4 = new Matrix4();
+      var meshMatrix = new Matrix4();
+      var geomMatrix = new Matrix4();
+      meshMatrix.fromArray(matrixVal);
+      geomMatrix.fromArray(new Matrix4().identity().elements);
+
+      // 处理文本居中对齐
+      var points = mesh.points,
+        alignType = mesh.alignType;
+      if (isTextType(mesh.type)) {
+        var positionMatrix = new Matrix4();
+        var alignMatrix = createAlignedText(alignType, model.geometry);
+        positionMatrix.identity().makeTranslation(points[0], points[1], points[2]);
+        geomMatrix.multiply(alignMatrix).multiply(positionMatrix);
+      }
+      m4.multiplyMatrices(meshMatrix, geomMatrix);
+      model.setMatrixAt(index, m4);
+      var _normalSignAttr = model.geometry && model.geometry.getAttribute('instanceNormalSign');
+      if (_normalSignAttr && _normalSignAttr.array && index < _normalSignAttr.array.length) {
+        _normalSignAttr.array[index] = getInstanceNormalSign(m4);
+      }
+      var copyMatrix = new Matrix4().copy(m4);
+      model.userData.copyMatrix = copyMatrix;
+      var temp = model.userData.instancesMap.get(item.instanceId);
+      temp.copyMatrix = copyMatrix;
+      if (sourceVisible === false) {
+        var offsetMatrix = new Matrix4().copy(copyMatrix).makeTranslation(9999999, 9999999, 9999999);
+        model.setMatrixAt(index, offsetMatrix);
+      }
     }
 
     // 设置颜色
@@ -111978,6 +111967,7 @@ function appendInstanceToInstancedGroup(group, drawObj, instance, customColor) {
   }
 }
 function appendInstanceToInstancedMesh(model, drawObj, mesh, instance, customColor) {
+  var _instance$matrix;
   if (!model || !model.isInstancedMesh) return;
   if (!instance || !instance.instanceId) return;
   var capacity = model.instanceMatrix && typeof model.instanceMatrix.count === 'number' ? model.instanceMatrix.count : model.count;
@@ -111990,8 +111980,22 @@ function appendInstanceToInstancedMesh(model, drawObj, mesh, instance, customCol
   var sourceVisible = mesh && mesh.prop && mesh.prop.sourceVisible === false ? false : true;
   var colorArr = Array.isArray(rawColor) ? rawColor : typeof rawColor === 'string' ? rawColor.split(',') : [255, 255, 255];
   var meshColor = customColor ? new Color(customColor) : new Color("rgb(".concat(colorArr[0], ", ").concat(colorArr[1], ", ").concat(colorArr[2], ")"));
-  if (!mesh) return;
-  var m4 = composeInstanceMatrix(instance, mesh, model.geometry);
+  var matrixVal = (_instance$matrix = instance.matrix) === null || _instance$matrix === void 0 ? void 0 : _instance$matrix.val;
+  if (!matrixVal || !mesh || !mesh.matrix || !mesh.matrix.val) return;
+  var m4 = new Matrix4();
+  var meshMatrix = new Matrix4();
+  var geomMatrix = new Matrix4();
+  meshMatrix.fromArray(instance.matrix.val);
+  geomMatrix.fromArray(new Matrix4().identity().elements);
+  var points = mesh.points,
+    alignType = mesh.alignType;
+  if (isTextType(mesh.type)) {
+    var positionMatrix = new Matrix4();
+    var alignMatrix = createAlignedText(alignType, model.geometry);
+    positionMatrix.identity().makeTranslation(points[0], points[1], points[2]);
+    geomMatrix.multiply(alignMatrix).multiply(positionMatrix);
+  }
+  m4.multiplyMatrices(meshMatrix, geomMatrix);
   var renderMatrix = sourceVisible === false ? new Matrix4().copy(m4).makeTranslation(9999999, 9999999, 9999999) : m4;
   model.setMatrixAt(currentCount, renderMatrix);
   if (model.instanceMatrix) model.instanceMatrix.needsUpdate = true;
@@ -112095,13 +112099,13 @@ function drawModel(geom, instanceName, instanceCount, nColor, nOpacity) {
   var model;
   // 处理二维几何体（普通2D图形和特殊2D图形）
   if (geom.type == GEOM_TYPES.geom_2d || geom.type == GEOM_TYPES.geom_2d_others) {
-    model = draw2Dmodel(geom, instanceName, instanceCount, nColor, nOpacity, options); // TODO 该类型调试中
+    model = draw2Dmodel(geom, instanceName, instanceCount, options); // TODO 该类型调试中
     // 处理二维文本类型
   } else if (isTextType(geom.type)) {
     model = drawText(geom, instanceName, instanceCount, options);
     // 处理各种曲线类型（圆形、圆弧、椭圆、椭圆弧）
   } else if (geom.type == GEOM_TYPES.geom_2d_circle || geom.type == GEOM_TYPES.geom_2d_arc || geom.type == GEOM_TYPES.geom_2d_ellipse || geom.type == GEOM_TYPES.geom_2d_ellipseArc) {
-    model = drawCurves(geom, instanceName, instanceCount, nColor, nOpacity, options); // TODO 该类型调试中
+    model = drawCurves(geom, instanceName, instanceCount, options); // TODO 该类型调试中
     // 处理三维几何体（普通3D模型和OBJ模型）
   } else if (geom.type == GEOM_TYPES.geom_3d || geom.type == GEOM_TYPES.geom_3d_obj) {
     model = draw3Dmodel(geom, instanceName, instanceCount, nColor, nOpacity, options);
@@ -112125,8 +112129,8 @@ function isTextType(type) {
  * @param {String} instanceName- 曲线实例的名称
  * @return {Object}- 包含曲线模型和曲线信息的对象
  */
-function drawCurves(geom, instanceName, instanceCount, nColor, nOpacity) {
-  var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
+function drawCurves(geom, instanceName, instanceCount) {
+  var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
   var points = geom.points,
     normals = geom.normals;
   var aX = points[0];
@@ -112156,7 +112160,7 @@ function drawCurves(geom, instanceName, instanceCount, nColor, nOpacity) {
   var model = draw2Dmodel(instance_parser_objectSpread(instance_parser_objectSpread({}, geom), {}, {
     points: list,
     normals: normals
-  }), instanceName, instanceCount, nColor, nOpacity, options);
+  }), instanceName, instanceCount, options);
   // model.rotation.x = -Math.PI / 2;
   // model.position.set(aX, aY, aZ);
   var matrix = new Matrix4();
@@ -112329,7 +112333,7 @@ function draw3Dmodel(geom, instanceName, instanceCount, nColor, nOpacity) {
 
   // 处理transparent透明度
   opacity = 1 - transparent;
-  var finalOpacity = nOpacity !== undefined && nOpacity !== null && nOpacity !== '' ? nOpacity : opacity;
+  var finalOpacity = nOpacity !== '' ? nOpacity : opacity;
 
   // 判断是否全透明
   var isTransparent = finalOpacity < 1.0;
@@ -112406,8 +112410,8 @@ function draw3Dmodel(geom, instanceName, instanceCount, nColor, nOpacity) {
  * @param {String} instanceName - 模型实例的名称
  * @returns {Object} - 包含所有 2D 模型的组对象
  */
-function draw2Dmodel(geom, instanceName, instanceCount, nColor, nOpacity) {
-  var options = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : {};
+function draw2Dmodel(geom, instanceName, instanceCount) {
+  var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
   var points = geom.points;
   var normals = geom.normals;
   var geometry = new BufferGeometry();
@@ -112433,7 +112437,7 @@ function draw2Dmodel(geom, instanceName, instanceCount, nColor, nOpacity) {
     prop: geom.prop,
     geometry: lineGeometry,
     material: material
-  }, instanceName, instanceCount, nColor, nOpacity, options);
+  }, instanceName, instanceCount, options);
   // mesh.raycast = raycast;
 
   model.userData.instanceName = instanceName;
@@ -114524,14 +114528,17 @@ _Stats.Panel = function (name, fg, bg) {
   };
 };
 /* harmony default export */ var stats_module = (_Stats);
+// EXTERNAL MODULE: ./packages/components/com-graphics/box.json
+var com_graphics_box = __webpack_require__("cbf5");
+
 // EXTERNAL MODULE: ./node_modules/fflate/esm/browser.js
 var browser = __webpack_require__("72ba");
 
 // CONCATENATED MODULE: ./packages/utils/StreamLoader.js
+function StreamLoader_typeof(o) { "@babel/helpers - typeof"; return StreamLoader_typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, StreamLoader_typeof(o); }
 function StreamLoader_ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function StreamLoader_objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? StreamLoader_ownKeys(Object(t), !0).forEach(function (r) { StreamLoader_defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : StreamLoader_ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
 function StreamLoader_defineProperty(e, r, t) { return (r = StreamLoader_toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
-function StreamLoader_typeof(o) { "@babel/helpers - typeof"; return StreamLoader_typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, StreamLoader_typeof(o); }
 function StreamLoader_toConsumableArray(r) { return StreamLoader_arrayWithoutHoles(r) || StreamLoader_iterableToArray(r) || StreamLoader_unsupportedIterableToArray(r) || StreamLoader_nonIterableSpread(); }
 function StreamLoader_nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
 function StreamLoader_unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return StreamLoader_arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? StreamLoader_arrayLikeToArray(r, a) : void 0; } }
@@ -114722,16 +114729,15 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "parseStreamImmediate",
     value: function () {
-      var _parseStreamImmediate = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee4(reader, list, range) {
+      var _parseStreamImmediate = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee3(reader, list, range) {
         var _this4 = this;
         var abortSignal,
           streamId,
           batchMeshes,
-          batchPrimitiveGroups,
+          batchPrimitives,
           batchSize,
           batchStart,
           streamStats,
-          flattenPrimitiveGroups,
           processStreamBatch,
           ensureNotAborted,
           localStreamId,
@@ -114749,52 +114755,63 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
           abortPromiseInBatch,
           interactionPromiseInBatch,
           meshesToProcess,
-          primitiveGroupsToProcess,
+          primitivesToProcess,
           _abortPromiseInBatch,
           _interactionPromiseInBatch,
           _meshesToProcess,
-          _primitiveGroupsToProcess,
+          _primitivesToProcess,
           transferable,
           parsed,
           _abortPromiseInBatch2,
           _interactionPromiseInBatch2,
           _meshesToProcess2,
-          _primitiveGroupsToProcess2,
+          _primitivesToProcess2,
           decoder,
           buffer,
-          expectingMesh,
-          pendingMesh,
-          pendingPrimitiveIds,
-          pendingPrimitiveGroups,
-          pendingMatchedPrimitiveIds,
+          pendingPrimitives,
+          expectingPrimitive,
           isFullProps,
-          normalizeMesh,
-          collectMeshPrimitiveIds,
-          isValidStreamMesh,
-          tryParseMeshFromBuffer,
-          parsePrimitiveFromBuffer,
-          commitPendingMesh,
           _content2,
           _content3,
           _done,
           _value,
           newBuf,
-          meshResult,
-          nextMeshResult,
+          dataView,
           primitiveResult,
           primitiveData,
-          _args4 = arguments,
+          consumedBytes,
+          _this$parsePrimitiveD,
+          position,
+          normal,
+          posindex,
+          nolindex,
+          indices,
+          formatted,
+          docId,
+          length,
+          totalLen,
+          data,
+          mesh,
+          jsonStr,
+          _docId,
+          meshToPrimId,
+          hasPendingPrimitive,
+          hasPendingMesh,
+          _primitiveData,
+          primId,
+          _args3 = arguments,
           _t,
           _t2,
           _t3,
-          _t4;
-        return StreamLoader_regenerator().w(function (_context4) {
-          while (1) switch (_context4.p = _context4.n) {
+          _t4,
+          _t5;
+        return StreamLoader_regenerator().w(function (_context3) {
+          while (1) switch (_context3.p = _context3.n) {
             case 0:
-              abortSignal = _args4.length > 3 && _args4[3] !== undefined ? _args4[3] : null;
-              streamId = _args4.length > 4 && _args4[4] !== undefined ? _args4[4] : null;
+              abortSignal = _args3.length > 3 && _args3[3] !== undefined ? _args3[3] : null;
+              streamId = _args3.length > 4 && _args3[4] !== undefined ? _args3[4] : null;
               batchMeshes = [];
-              batchPrimitiveGroups = [];
+              batchPrimitives = [];
               batchSize = this.batchSize;
               batchStart = 0;
               streamStats = {
@@ -114802,28 +114819,8 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 totalMeshes: 0,
                 totalPrimitives: 0
               };
-              flattenPrimitiveGroups = function flattenPrimitiveGroups(primitiveGroups) {
-                if (!primitiveGroups || primitiveGroups.length === 0) return [];
-                var primitivesToProcess = [];
-                var usedIds = new Set();
-                primitiveGroups.forEach(function (group) {
-                  var primitives = Array.isArray(group) ? group : [group];
-                  primitives.forEach(function (primitive) {
-                    if (!primitive) return;
-                    if (primitive.id == null) {
-                      primitivesToProcess.push(primitive);
-                      return;
-                    }
-                    if (usedIds.has(primitive.id)) return;
-                    usedIds.add(primitive.id);
-                    primitivesToProcess.push(primitive);
-                  });
-                });
-                return primitivesToProcess;
-              };
               processStreamBatch = /*#__PURE__*/function () {
-                var _ref2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee2(meshesToProcess, primitiveGroupsToProcess) {
-                  var primitivesToProcess;
+                var _ref2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee2(meshesToProcess, primitivesToProcess) {
                   return StreamLoader_regenerator().w(function (_context2) {
                     while (1) switch (_context2.n) {
                       case 0:
@@ -114833,7 +114830,6 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                         }
                         return _context2.a(2);
                       case 1:
-                        primitivesToProcess = flattenPrimitiveGroups(primitiveGroupsToProcess);
                         _context2.n = 2;
                         return _this4.processBatchData(meshesToProcess, primitivesToProcess, list, range, abortSignal);
                       case 2:
@@ -114857,7 +114853,7 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 return null;
               };
               if (!this.worker) {
-                _context4.n = 33;
+                _context3.n = 33;
                 break;
               }
               localStreamId = streamId || this.createStreamRequestId();
@@ -114865,45 +114861,45 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 if (!_this4.externalEnsureNotInteracting && !_this4.isUserInteracting) return null;
                 return _this4.ensureNotInteracting(abortSignal);
               };
-              _context4.n = 1;
+              _context3.n = 1;
               return this.workerRequest('streamInit', {
                 streamId: localStreamId,
                 prefixIdKey: this.prefixIdKey
               });
             case 1:
-              _context4.p = 1;
+              _context3.p = 1;
               if (this.debug) performance.mark('while-start');
             case 2:
               if (false) {}
               abortPromise = ensureNotAborted();
               if (!abortPromise) {
-                _context4.n = 3;
+                _context3.n = 3;
                 break;
               }
-              _context4.n = 3;
+              _context3.n = 3;
               return abortPromise;
             case 3:
               interactionPromise = ensureNotInteracting();
               if (!interactionPromise) {
-                _context4.n = 4;
+                _context3.n = 4;
                 break;
               }
-              _context4.n = 4;
+              _context3.n = 4;
               return interactionPromise;
             case 4:
               content = void 0;
-              _context4.p = 5;
-              _context4.n = 6;
+              _context3.p = 5;
+              _context3.n = 6;
               return reader.read();
             case 6:
-              content = _context4.v;
-              _context4.n = 9;
+              content = _context3.v;
+              _context3.n = 9;
               break;
             case 7:
-              _context4.p = 7;
-              _t = _context4.v;
+              _context3.p = 7;
+              _t = _context3.v;
               if (!(_t && _t.name === 'AbortError')) {
-                _context4.n = 8;
+                _context3.n = 8;
                 break;
               }
               throw _t;
@@ -114912,91 +114908,91 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
             case 9:
               _content = content, done = _content.done, value = _content.value;
               if (!done) {
-                _context4.n = 20;
+                _context3.n = 20;
                 break;
               }
               abortPromiseOnDone = ensureNotAborted();
               if (!abortPromiseOnDone) {
-                _context4.n = 10;
+                _context3.n = 10;
                 break;
               }
-              _context4.n = 10;
+              _context3.n = 10;
               return abortPromiseOnDone;
             case 10:
               if (this.debug) {
                 performance.mark('while-end');
                 performance.measure('while', 'while-start', 'while-end');
               }
-              _context4.n = 11;
+              _context3.n = 11;
               return this.workerRequest('streamFlush', {
                 streamId: localStreamId
               });
             case 11:
-              flushed = _context4.v;
+              flushed = _context3.v;
               if (flushed !== null && flushed !== void 0 && (_flushed$meshes = flushed.meshes) !== null && _flushed$meshes !== void 0 && _flushed$meshes.length) {
                 batchMeshes.push.apply(batchMeshes, StreamLoader_toConsumableArray(flushed.meshes));
-                batchPrimitiveGroups.push.apply(batchPrimitiveGroups, StreamLoader_toConsumableArray(flushed.primitives));
+                batchPrimitives.push.apply(batchPrimitives, StreamLoader_toConsumableArray(flushed.primitives));
               }
             case 12:
               if (!(batchMeshes.length - batchStart >= batchSize)) {
-                _context4.n = 16;
+                _context3.n = 16;
                 break;
               }
               abortPromiseInBatch = ensureNotAborted();
               if (!abortPromiseInBatch) {
-                _context4.n = 13;
+                _context3.n = 13;
                 break;
               }
-              _context4.n = 13;
+              _context3.n = 13;
               return abortPromiseInBatch;
             case 13:
               interactionPromiseInBatch = ensureNotInteracting();
               if (!interactionPromiseInBatch) {
-                _context4.n = 14;
+                _context3.n = 14;
                 break;
               }
-              _context4.n = 14;
+              _context3.n = 14;
               return interactionPromiseInBatch;
             case 14:
               meshesToProcess = batchMeshes.slice(batchStart, batchStart + batchSize);
-              primitiveGroupsToProcess = batchPrimitiveGroups.slice(batchStart, batchStart + batchSize);
+              primitivesToProcess = batchPrimitives.slice(batchStart, batchStart + batchSize);
               batchStart += batchSize;
-              _context4.n = 15;
-              return processStreamBatch(meshesToProcess, primitiveGroupsToProcess);
+              _context3.n = 15;
+              return processStreamBatch(meshesToProcess, primitivesToProcess);
             case 15:
-              _context4.n = 12;
+              _context3.n = 12;
               break;
             case 16:
               if (!(batchMeshes.length - batchStart > 0)) {
-                _context4.n = 19;
+                _context3.n = 19;
                 break;
               }
               _abortPromiseInBatch = ensureNotAborted();
               if (!_abortPromiseInBatch) {
-                _context4.n = 17;
+                _context3.n = 17;
                 break;
               }
-              _context4.n = 17;
+              _context3.n = 17;
               return _abortPromiseInBatch;
             case 17:
               _interactionPromiseInBatch = ensureNotInteracting();
               if (!_interactionPromiseInBatch) {
-                _context4.n = 18;
+                _context3.n = 18;
                 break;
               }
-              _context4.n = 18;
+              _context3.n = 18;
               return _interactionPromiseInBatch;
             case 18:
               _meshesToProcess = batchMeshes.slice(batchStart);
-              _primitiveGroupsToProcess = batchPrimitiveGroups.slice(batchStart);
+              _primitivesToProcess = batchPrimitives.slice(batchStart);
               batchStart = batchMeshes.length;
-              _context4.n = 19;
-              return processStreamBatch(_meshesToProcess, _primitiveGroupsToProcess);
+              _context3.n = 19;
+              return processStreamBatch(_meshesToProcess, _primitivesToProcess);
             case 19:
-              return _context4.a(3, 27);
+              return _context3.a(3, 27);
             case 20:
               transferable = (value === null || value === void 0 ? void 0 : value.buffer) instanceof ArrayBuffer ? [value.buffer] : [];
-              _context4.n = 21;
+              _context3.n = 21;
               return this.workerRequest('streamPush', {
                 streamId: localStreamId,
                 chunk: value.buffer,
@@ -115004,240 +115000,92 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 byteLength: value.byteLength
               }, transferable);
             case 21:
-              parsed = _context4.v;
+              parsed = _context3.v;
               if (parsed !== null && parsed !== void 0 && (_parsed$meshes = parsed.meshes) !== null && _parsed$meshes !== void 0 && _parsed$meshes.length) {
                 batchMeshes.push.apply(batchMeshes, StreamLoader_toConsumableArray(parsed.meshes));
-                batchPrimitiveGroups.push.apply(batchPrimitiveGroups, StreamLoader_toConsumableArray(parsed.primitives));
+                batchPrimitives.push.apply(batchPrimitives, StreamLoader_toConsumableArray(parsed.primitives));
               }
             case 22:
               if (!(batchMeshes.length - batchStart >= batchSize)) {
-                _context4.n = 26;
+                _context3.n = 26;
                 break;
               }
               _abortPromiseInBatch2 = ensureNotAborted();
               if (!_abortPromiseInBatch2) {
-                _context4.n = 23;
+                _context3.n = 23;
                 break;
               }
-              _context4.n = 23;
+              _context3.n = 23;
               return _abortPromiseInBatch2;
             case 23:
               _interactionPromiseInBatch2 = ensureNotInteracting();
               if (!_interactionPromiseInBatch2) {
-                _context4.n = 24;
+                _context3.n = 24;
                 break;
               }
-              _context4.n = 24;
+              _context3.n = 24;
               return _interactionPromiseInBatch2;
             case 24:
               _meshesToProcess2 = batchMeshes.slice(batchStart, batchStart + batchSize);
-              _primitiveGroupsToProcess2 = batchPrimitiveGroups.slice(batchStart, batchStart + batchSize);
+              _primitivesToProcess2 = batchPrimitives.slice(batchStart, batchStart + batchSize);
               batchStart += batchSize;
-              _context4.n = 25;
-              return processStreamBatch(_meshesToProcess2, _primitiveGroupsToProcess2);
+              _context3.n = 25;
+              return processStreamBatch(_meshesToProcess2, _primitivesToProcess2);
             case 25:
-              _context4.n = 22;
+              _context3.n = 22;
               break;
             case 26:
               if (batchStart >= batchSize * 4) {
                 batchMeshes.splice(0, batchStart);
-                batchPrimitiveGroups.splice(0, batchStart);
+                batchPrimitives.splice(0, batchStart);
                 batchStart = 0;
               }
-              _context4.n = 2;
+              _context3.n = 2;
               break;
             case 27:
-              _context4.p = 27;
-              _context4.p = 28;
-              _context4.n = 29;
+              _context3.p = 27;
+              _context3.p = 28;
+              _context3.n = 29;
               return this.workerRequest('streamDispose', {
                 streamId: localStreamId
               });
             case 29:
-              _context4.n = 31;
+              _context3.n = 31;
               break;
             case 30:
-              _context4.p = 30;
-              _t2 = _context4.v;
+              _context3.p = 30;
+              _t2 = _context3.v;
             case 31:
-              return _context4.f(27);
+              return _context3.f(27);
             case 32:
-              return _context4.a(2, streamStats);
+              return _context3.a(2, streamStats);
             case 33:
               decoder = new TextDecoder('utf-8');
               buffer = new Uint8Array();
-              expectingMesh = true;
-              pendingMesh = null;
-              pendingPrimitiveIds = new Set();
-              pendingPrimitiveGroups = [];
-              pendingMatchedPrimitiveIds = new Set();
+              pendingPrimitives = new Map();
+              expectingPrimitive = true;
               isFullProps = true;
-              normalizeMesh = function normalizeMesh(mesh) {
-                _this4._applyPrefixId(mesh, 'id');
-                var meshList = Array.isArray(mesh) ? mesh : [mesh];
-                meshList.forEach(function (item) {
-                  if (!item) return;
-                  if (!Array.isArray(item.primitives)) {
-                    item.primitives = [];
-                  }
-                  _this4._applyPrefixId(item.primitives, 'prmid', item.documentId);
-                });
-                return mesh;
-              };
-              collectMeshPrimitiveIds = function collectMeshPrimitiveIds(mesh) {
-                var ids = [];
-                var meshList = Array.isArray(mesh) ? mesh : [mesh];
-                meshList.forEach(function (item) {
-                  if (!item || !Array.isArray(item.primitives)) return;
-                  item.primitives.forEach(function (primitive) {
-                    if (primitive && primitive.prmid != null) {
-                      ids.push(primitive.prmid);
-                    }
-                  });
-                });
-                return ids;
-              };
-              isValidStreamMesh = function isValidStreamMesh(mesh) {
-                var meshList = Array.isArray(mesh) ? mesh : [mesh];
-                if (meshList.length === 0) return false;
-                return meshList.every(function (item) {
-                  return item && StreamLoader_typeof(item) === 'object' && Array.isArray(item.primitives);
-                });
-              };
-              tryParseMeshFromBuffer = function tryParseMeshFromBuffer() {
-                if (buffer.length < 4) {
-                  return {
-                    status: 'incomplete'
-                  };
-                }
-                var length = new DataView(buffer.buffer, buffer.byteOffset).getUint32(0, false);
-                if (length <= 0 || length > 10 * 1024 * 1024) {
-                  return {
-                    status: 'invalid'
-                  };
-                }
-                var totalLen = 4 + length;
-                if (buffer.length < totalLen) {
-                  return {
-                    status: 'incomplete'
-                  };
-                }
-                try {
-                  var data = buffer.slice(4, totalLen);
-                  var parsedMesh = JSON.parse(decoder.decode(data));
-                  if (!isValidStreamMesh(parsedMesh)) {
-                    return {
-                      status: 'invalid'
-                    };
-                  }
-                  var mesh = normalizeMesh(parsedMesh);
-                  return {
-                    status: 'success',
-                    mesh: mesh,
-                    totalLen: totalLen
-                  };
-                } catch (e) {
-                  return {
-                    status: 'invalid'
-                  };
-                }
-              };
-              parsePrimitiveFromBuffer = function parsePrimitiveFromBuffer() {
-                var dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength);
-                var primitiveResult = _this4.parsePrimitive(dataView, buffer, 0, isFullProps);
-                var primitiveData = primitiveResult.primitive;
-                _this4._applyPrefixId(primitiveData, 'id');
-                _this4._applyPrefixId(primitiveData, 'material');
-                if (isFullProps) {
-                  var _this4$parsePrimitive = _this4.parsePrimitiveData(primitiveData),
-                    position = _this4$parsePrimitive.position,
-                    normal = _this4$parsePrimitive.normal,
-                    posindex = _this4$parsePrimitive.posindex,
-                    nolindex = _this4$parsePrimitive.nolindex,
-                    indices = _this4$parsePrimitive.indices;
-                  var formatted = _this4.formatPrimitiveData({
-                    position: position,
-                    normal: normal,
-                    posindex: posindex,
-                    nolindex: nolindex
-                  });
-                  delete primitiveData.nolindex;
-                  delete primitiveData.posindex;
-                  primitiveData.position = formatted.position;
-                  primitiveData.normal = formatted.normal;
-                  primitiveData.indices = indices;
-                }
-                return {
-                  primitive: primitiveData,
-                  consumedBytes: primitiveResult.offset
-                };
-              };
-              commitPendingMesh = /*#__PURE__*/function () {
-                var _ref3 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee3() {
-                  var meshList;
-                  return StreamLoader_regenerator().w(function (_context3) {
-                    while (1) switch (_context3.n) {
-                      case 0:
-                        if (pendingMesh) {
-                          _context3.n = 1;
-                          break;
-                        }
-                        return _context3.a(2);
-                      case 1:
-                        meshList = Array.isArray(pendingMesh) ? pendingMesh : [pendingMesh];
-                        meshList.forEach(function (mesh) {
-                          batchMeshes.push(mesh);
-                          batchPrimitiveGroups.push(pendingPrimitiveGroups);
-                        });
-                        pendingMesh = null;
-                        pendingPrimitiveIds = new Set();
-                        pendingPrimitiveGroups = [];
-                        pendingMatchedPrimitiveIds = new Set();
-                        if (!(batchMeshes.length >= _this4.batchSize)) {
-                          _context3.n = 5;
-                          break;
-                        }
-                        _context3.n = 2;
-                        return ensureNotAborted();
-                      case 2:
-                        _context3.n = 3;
-                        return _this4.ensureNotInteracting(abortSignal);
-                      case 3:
-                        _context3.n = 4;
-                        return processStreamBatch(batchMeshes, batchPrimitiveGroups);
-                      case 4:
-                        batchMeshes.length = 0;
-                        batchPrimitiveGroups.length = 0;
-                      case 5:
-                        return _context3.a(2);
-                    }
-                  }, _callee3);
-                }));
-                return function commitPendingMesh() {
-                  return _ref3.apply(this, arguments);
-                };
-              }();
             case 34:
               if (false) {}
-              _context4.n = 35;
+              _context3.n = 35;
               return ensureNotAborted();
             case 35:
-              _context4.n = 36;
+              _context3.n = 36;
               return this.ensureNotInteracting(abortSignal);
             case 36:
               _content2 = void 0;
-              _context4.p = 37;
-              _context4.n = 38;
+              _context3.p = 37;
+              _context3.n = 38;
               return reader.read();
             case 38:
-              _content2 = _context4.v;
-              _context4.n = 41;
+              _content2 = _context3.v;
+              _context3.n = 41;
               break;
             case 39:
-              _context4.p = 39;
-              _t3 = _context4.v;
+              _context3.p = 39;
+              _t3 = _context3.v;
               if (!(_t3 && _t3.name === 'AbortError')) {
-                _context4.n = 40;
+                _context3.n = 40;
                 break;
               }
               throw _t3;
@@ -115246,125 +115094,178 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
             case 41:
               _content3 = _content2, _done = _content3.done, _value = _content3.value;
               if (!_done) {
-                _context4.n = 47;
+                _context3.n = 46;
                 break;
               }
-              _context4.n = 42;
+              _context3.n = 42;
               return ensureNotAborted();
             case 42:
-              _context4.n = 43;
-              return commitPendingMesh();
-            case 43:
               if (!(batchMeshes.length > 0)) {
-                _context4.n = 46;
+                _context3.n = 45;
                 break;
               }
-              _context4.n = 44;
+              _context3.n = 43;
               return ensureNotAborted();
-            case 44:
-              _context4.n = 45;
+            case 43:
+              _context3.n = 44;
               return this.ensureNotInteracting(abortSignal);
+            case 44:
+              _context3.n = 45;
+              return processStreamBatch(batchMeshes, batchPrimitives);
             case 45:
-              _context4.n = 46;
-              return processStreamBatch(batchMeshes, batchPrimitiveGroups);
+              return _context3.a(3, 65);
             case 46:
-              return _context4.a(3, 63);
-            case 47:
               newBuf = new Uint8Array(buffer.length + _value.length);
               newBuf.set(buffer);
               newBuf.set(_value, buffer.length);
               buffer = newBuf;
-            case 48:
+            case 47:
               if (!(buffer.length > 0)) {
-                _context4.n = 62;
+                _context3.n = 64;
                 break;
               }
-              _context4.n = 49;
+              _context3.n = 48;
               return ensureNotAborted();
-            case 49:
-              if (!expectingMesh) {
-                _context4.n = 53;
+            case 48:
+              if (!expectingPrimitive) {
+                _context3.n = 52;
                 break;
               }
-              meshResult = tryParseMeshFromBuffer();
-              if (!(meshResult.status === 'incomplete')) {
-                _context4.n = 50;
+              if (!(buffer.length < 12)) {
+                _context3.n = 49;
                 break;
               }
-              return _context4.a(3, 62);
-            case 50:
-              if (!(meshResult.status === 'invalid')) {
-                _context4.n = 51;
-                break;
+              return _context3.a(3, 64);
+            case 49:
+              _context3.p = 49;
+              dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.byteLength);
+              primitiveResult = this.parsePrimitive(dataView, buffer, 0, isFullProps);
+              primitiveData = primitiveResult.primitive;
+              this._applyPrefixId(primitiveData, 'id');
+              this._applyPrefixId(primitiveData, 'material');
+              consumedBytes = primitiveResult.offset;
+              if (isFullProps) {
+                _this$parsePrimitiveD = this.parsePrimitiveData(primitiveData), position = _this$parsePrimitiveD.position, normal = _this$parsePrimitiveD.normal, posindex = _this$parsePrimitiveD.posindex, nolindex = _this$parsePrimitiveD.nolindex, indices = _this$parsePrimitiveD.indices;
+                formatted = this.formatPrimitiveData({
+                  position: position,
+                  normal: normal,
+                  posindex: posindex,
+                  nolindex: nolindex
+                });
+                delete primitiveData.nolindex;
+                delete primitiveData.posindex;
+                primitiveData.position = formatted.position;
+                primitiveData.normal = formatted.normal;
+                primitiveData.indices = indices;
               }
-              return _context4.a(3, 62);
+              docId = primitiveData.id;
+              pendingPrimitives.set(docId, primitiveData);
+              expectingPrimitive = false;
+              buffer = buffer.slice(consumedBytes);
+              _context3.n = 51;
+              break;
+            case 50:
+              _context3.p = 50;
+              _t4 = _context3.v;
+              return _context3.a(3, 64);
             case 51:
-              _context4.n = 52;
-              return commitPendingMesh();
-            case 52:
-              pendingMesh = meshResult.mesh;
-              pendingPrimitiveIds = new Set(collectMeshPrimitiveIds(pendingMesh));
-              pendingPrimitiveGroups = [];
-              pendingMatchedPrimitiveIds = new Set();
-              expectingMesh = false;
-              buffer = buffer.slice(meshResult.totalLen);
-              _context4.n = 61;
+              _context3.n = 63;
               break;
+            case 52:
+              if (!(buffer.length < 4)) {
+                _context3.n = 53;
+                break;
+              }
+              return _context3.a(3, 64);
             case 53:
-              nextMeshResult = tryParseMeshFromBuffer();
-              if (!(nextMeshResult.status === 'success')) {
-                _context4.n = 55;
+              length = new DataView(buffer.buffer, buffer.byteOffset).getUint32(0, false);
+              if (!(length > 10 * 1024 * 1024)) {
+                _context3.n = 54;
                 break;
               }
-              _context4.n = 54;
-              return commitPendingMesh();
+              expectingPrimitive = true;
+              return _context3.a(3, 47);
             case 54:
-              pendingMesh = nextMeshResult.mesh;
-              pendingPrimitiveIds = new Set(collectMeshPrimitiveIds(pendingMesh));
-              expectingMesh = false;
-              buffer = buffer.slice(nextMeshResult.totalLen);
-              return _context4.a(3, 48);
-            case 55:
-              if (!(buffer.length < 12)) {
-                _context4.n = 56;
+              totalLen = 4 + length;
+              if (!(buffer.length < totalLen)) {
+                _context3.n = 55;
                 break;
               }
-              return _context4.a(3, 62);
-            case 56:
-              primitiveResult = null;
-              _context4.p = 57;
-              primitiveResult = parsePrimitiveFromBuffer();
-              _context4.n = 59;
+              return _context3.a(3, 64);
+            case 55:
+              data = buffer.slice(4, totalLen);
+              mesh = null;
+              _context3.p = 56;
+              jsonStr = decoder.decode(data);
+              mesh = JSON.parse(jsonStr);
+              _context3.n = 58;
               break;
+            case 57:
+              _context3.p = 57;
+              _t5 = _context3.v;
+              expectingPrimitive = true;
+              return _context3.a(3, 47);
             case 58:
-              _context4.p = 58;
-              _t4 = _context4.v;
-              return _context4.a(3, 62);
-            case 59:
-              primitiveData = primitiveResult.primitive;
-              if (pendingPrimitiveIds.has(primitiveData.id)) {
-                pendingPrimitiveGroups.push(primitiveData);
-                pendingMatchedPrimitiveIds.add(primitiveData.id);
+              if (!mesh) {
+                _context3.n = 63;
+                break;
               }
-              buffer = buffer.slice(primitiveResult.consumedBytes);
-              if (!(pendingPrimitiveIds.size > 0 && pendingMatchedPrimitiveIds.size >= pendingPrimitiveIds.size)) {
-                _context4.n = 61;
+              isFullProps = true;
+              this._applyPrefixId(mesh, 'id');
+              if (Array.isArray(mesh)) {
+                mesh.forEach(function (item) {
+                  _this4._applyPrefixId(item.primitives, 'prmid', item.documentId);
+                });
+              } else {
+                this._applyPrefixId(mesh.primitives, 'prmid', mesh.documentId);
+              }
+              _docId = mesh.id;
+              meshToPrimId = mesh.primitives.map(function (item) {
+                return item.prmid;
+              });
+              hasPendingPrimitive = meshToPrimId.some(function (item) {
+                return pendingPrimitives.has(item);
+              });
+              hasPendingMesh = pendingPrimitives.has(_docId);
+              if (!(hasPendingMesh || hasPendingPrimitive)) {
+                _context3.n = 62;
+                break;
+              }
+              _primitiveData = pendingPrimitives.get(_docId);
+              if (!hasPendingMesh && hasPendingPrimitive) {
+                primId = meshToPrimId[0];
+                _primitiveData = pendingPrimitives.get(primId);
+              }
+              batchMeshes.push(mesh);
+              batchPrimitives.push(_primitiveData);
+              if (!(batchMeshes.length >= this.batchSize)) {
+                _context3.n = 62;
                 break;
               }
-              _context4.n = 60;
-              return commitPendingMesh();
+              _context3.n = 59;
+              return ensureNotAborted();
+            case 59:
+              _context3.n = 60;
+              return this.ensureNotInteracting(abortSignal);
             case 60:
-              expectingMesh = true;
+              _context3.n = 61;
+              return processStreamBatch(batchMeshes, batchPrimitives);
             case 61:
-              _context4.n = 48;
-              break;
+              batchMeshes.length = 0;
+              batchPrimitives.length = 0;
             case 62:
-              _context4.n = 34;
-              break;
+              expectingPrimitive = false;
+              buffer = buffer.slice(totalLen);
             case 63:
-              return _context4.a(2, streamStats);
+              _context3.n = 47;
+              break;
+            case 64:
+              _context3.n = 34;
+              break;
+            case 65:
+              return _context3.a(2, streamStats);
           }
-        }, _callee4, this, [[57, 58], [37, 39], [28, 30], [5, 7], [1,, 27, 32]]);
+        }, _callee3, this, [[56, 57], [49, 50], [37, 39], [28, 30], [5, 7], [1,, 27, 32]]);
       }));
       function parseStreamImmediate(_x, _x2, _x3) {
         return _parseStreamImmediate.apply(this, arguments);
@@ -115376,57 +115277,57 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "processBatchData",
     value: function () {
-      var _processBatchData = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee5(meshes, primitives, list, range) {
+      var _processBatchData = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee4(meshes, primitives, list, range) {
         var abortSignal,
           renderResult,
-          _args5 = arguments,
-          _t5;
-        return StreamLoader_regenerator().w(function (_context5) {
-          while (1) switch (_context5.p = _context5.n) {
+          _args4 = arguments,
+          _t6;
+        return StreamLoader_regenerator().w(function (_context4) {
+          while (1) switch (_context4.p = _context4.n) {
             case 0:
-              abortSignal = _args5.length > 4 && _args5[4] !== undefined ? _args5[4] : null;
-              _context5.p = 1;
+              abortSignal = _args4.length > 4 && _args4[4] !== undefined ? _args4[4] : null;
+              _context4.p = 1;
               if (!(abortSignal && abortSignal.aborted)) {
-                _context5.n = 2;
+                _context4.n = 2;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
             case 2:
-              _context5.n = 3;
+              _context4.n = 3;
               return this.renderModelData(meshes, primitives, list, range, null, undefined, {
                 suppressLoadComplete: true,
                 source: 'inRangeDis2'
               });
             case 3:
-              renderResult = _context5.v;
+              renderResult = _context4.v;
               if (!(renderResult && renderResult.canceled)) {
-                _context5.n = 4;
+                _context4.n = 4;
                 break;
               }
               throw new DOMException('Batch loading was canceled', 'AbortError');
             case 4:
               if (!(abortSignal && abortSignal.aborted)) {
-                _context5.n = 5;
+                _context4.n = 5;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
             case 5:
-              return _context5.a(2, renderResult);
+              return _context4.a(2, renderResult);
             case 6:
-              _context5.p = 6;
-              _t5 = _context5.v;
-              if (!(_t5 && _t5.name === 'AbortError')) {
-                _context5.n = 7;
+              _context4.p = 6;
+              _t6 = _context4.v;
+              if (!(_t6 && _t6.name === 'AbortError')) {
+                _context4.n = 7;
                 break;
               }
-              throw _t5;
+              throw _t6;
             case 7:
-              console.error('Failed to render batch data:', _t5);
-              throw _t5;
+              console.error('Failed to render batch data:', _t6);
+              throw _t6;
             case 8:
-              return _context5.a(2);
+              return _context4.a(2);
           }
-        }, _callee5, this, [[1, 6]]);
+        }, _callee4, this, [[1, 6]]);
       }));
       function processBatchData(_x6, _x7, _x8, _x9) {
         return _processBatchData.apply(this, arguments);
@@ -115438,26 +115339,26 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByRangeStream",
     value: function () {
-      var _getPrimitivesByRangeStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee6(params, list, range) {
+      var _getPrimitivesByRangeStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee5(params, list, range) {
         var abortSignal,
           requestId,
           internalController,
           reader,
           res,
           streamStats,
-          _args6 = arguments,
-          _t6;
-        return StreamLoader_regenerator().w(function (_context6) {
-          while (1) switch (_context6.p = _context6.n) {
+          _args5 = arguments,
+          _t7;
+        return StreamLoader_regenerator().w(function (_context5) {
+          while (1) switch (_context5.p = _context5.n) {
             case 0:
-              abortSignal = _args6.length > 3 && _args6[3] !== undefined ? _args6[3] : null;
-              _context6.n = 1;
+              abortSignal = _args5.length > 3 && _args5[3] !== undefined ? _args5[3] : null;
+              _context5.n = 1;
               return this.abortAllStreamRequests();
             case 1:
               requestId = this.createStreamRequestId();
               internalController = null;
               reader = null;
-              _context6.p = 2;
+              _context5.p = 2;
               internalController = new AbortController();
               this.currentAbortController = internalController;
               this.activeStreamControllers.add(internalController);
@@ -115474,7 +115375,7 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 }
               }
               if (!internalController.signal.aborted) {
-                _context6.n = 3;
+                _context5.n = 3;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
@@ -115482,14 +115383,14 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               params.requestId = requestId;
               params.projectId = this.projectId;
               if (!(this.modelApi && typeof this.modelApi.getPrimitivesByRangeStream === 'function')) {
-                _context6.n = 5;
+                _context5.n = 5;
                 break;
               }
-              _context6.n = 4;
+              _context5.n = 4;
               return this.modelApi.getPrimitivesByRangeStream(params, internalController.signal);
             case 4:
-              res = _context6.v;
-              _context6.n = 6;
+              res = _context5.v;
+              _context5.n = 6;
               break;
             case 5:
               throw new Error('modelApi.getPrimitivesByRangeStream is not available');
@@ -115497,49 +115398,49 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               reader = res.getReader();
               this.currentStreamReader = reader;
               this.activeStreamReaders.add(reader);
-              _context6.n = 7;
+              _context5.n = 7;
               return this.parseStreamImmediate(reader, list, range, internalController.signal, requestId);
             case 7:
-              streamStats = _context6.v;
+              streamStats = _context5.v;
               if (!internalController.signal.aborted) {
-                _context6.n = 8;
+                _context5.n = 8;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
             case 8:
               if (!res) {
-                _context6.n = 9;
+                _context5.n = 9;
                 break;
               }
-              return _context6.a(2, StreamLoader_objectSpread({
+              return _context5.a(2, StreamLoader_objectSpread({
                 stream: res,
                 requestId: requestId
               }, streamStats || {}));
             case 9:
-              return _context6.a(2, null);
+              return _context5.a(2, null);
             case 10:
-              _context6.p = 10;
-              _t6 = _context6.v;
-              if (!(_t6.name === 'AbortError')) {
-                _context6.n = 11;
+              _context5.p = 10;
+              _t7 = _context5.v;
+              if (!(_t7.name === 'AbortError')) {
+                _context5.n = 11;
                 break;
               }
-              throw _t6;
+              throw _t7;
             case 11:
-              console.error(_t6);
-              throw _t6;
+              console.error(_t7);
+              throw _t7;
             case 12:
-              _context6.p = 12;
+              _context5.p = 12;
               if (reader) this.activeStreamReaders.delete(reader);
               if (internalController) this.activeStreamControllers.delete(internalController);
               if (requestId) this.activeRequestIds.delete(requestId);
               this.currentStreamReader = null;
               this.currentAbortController = null;
-              return _context6.f(12);
+              return _context5.f(12);
             case 13:
-              return _context6.a(2);
+              return _context5.a(2);
           }
-        }, _callee6, this, [[2, 10, 12, 13]]);
+        }, _callee5, this, [[2, 10, 12, 13]]);
       }));
       function getPrimitivesByRangeStream(_x0, _x1, _x10) {
         return _getPrimitivesByRangeStream.apply(this, arguments);
@@ -115549,56 +115450,56 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByRange",
     value: function () {
-      var _getPrimitivesByRange = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee7(params) {
+      var _getPrimitivesByRange = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee6(params) {
         var abortSignal,
           res,
-          _args7 = arguments,
-          _t7;
-        return StreamLoader_regenerator().w(function (_context7) {
-          while (1) switch (_context7.p = _context7.n) {
+          _args6 = arguments,
+          _t8;
+        return StreamLoader_regenerator().w(function (_context6) {
+          while (1) switch (_context6.p = _context6.n) {
             case 0:
-              abortSignal = _args7.length > 1 && _args7[1] !== undefined ? _args7[1] : null;
-              _context7.p = 1;
+              abortSignal = _args6.length > 1 && _args6[1] !== undefined ? _args6[1] : null;
+              _context6.p = 1;
               if (!(abortSignal && abortSignal.aborted)) {
-                _context7.n = 2;
+                _context6.n = 2;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
             case 2:
-              _context7.n = 3;
+              _context6.n = 3;
               return this.modelApi.getPrimitivesByRange(params, abortSignal);
             case 3:
-              res = _context7.v;
+              res = _context6.v;
               if (!(abortSignal && abortSignal.aborted)) {
-                _context7.n = 4;
+                _context6.n = 4;
                 break;
               }
               throw new DOMException('Request was aborted', 'AbortError');
             case 4:
               if (!res) {
-                _context7.n = 5;
+                _context6.n = 5;
                 break;
               }
-              return _context7.a(2, res);
+              return _context6.a(2, res);
             case 5:
               throw new Error('Failed to get primitives');
             case 6:
-              _context7.n = 9;
+              _context6.n = 9;
               break;
             case 7:
-              _context7.p = 7;
-              _t7 = _context7.v;
-              if (!(_t7.name === 'AbortError')) {
-                _context7.n = 8;
+              _context6.p = 7;
+              _t8 = _context6.v;
+              if (!(_t8.name === 'AbortError')) {
+                _context6.n = 8;
                 break;
               }
-              throw _t7;
+              throw _t8;
             case 8:
-              throw _t7;
+              throw _t8;
             case 9:
-              return _context7.a(2);
+              return _context6.a(2);
           }
-        }, _callee7, this, [[1, 7]]);
+        }, _callee6, this, [[1, 7]]);
       }));
       function getPrimitivesByRange(_x11) {
         return _getPrimitivesByRange.apply(this, arguments);
@@ -115608,31 +115509,31 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByMaterial",
     value: function () {
-      var _getPrimitivesByMaterial = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee8(params) {
-        var res, _t8;
-        return StreamLoader_regenerator().w(function (_context8) {
-          while (1) switch (_context8.p = _context8.n) {
+      var _getPrimitivesByMaterial = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee7(params) {
+        var res, _t9;
+        return StreamLoader_regenerator().w(function (_context7) {
+          while (1) switch (_context7.p = _context7.n) {
             case 0:
-              _context8.p = 0;
-              _context8.n = 1;
+              _context7.p = 0;
+              _context7.n = 1;
               return this.modelApi.getPrimitivesByMaterial(params);
             case 1:
-              res = _context8.v;
+              res = _context7.v;
               if (!res) {
-                _context8.n = 2;
+                _context7.n = 2;
                 break;
               }
-              return _context8.a(2, res);
+              return _context7.a(2, res);
             case 2:
               throw new Error('Failed to get Material');
             case 3:
-              _context8.p = 3;
-              _t8 = _context8.v;
-              throw _t8;
+              _context7.p = 3;
+              _t9 = _context7.v;
+              throw _t9;
             case 4:
-              return _context8.a(2);
+              return _context7.a(2);
           }
-        }, _callee8, this, [[0, 3]]);
+        }, _callee7, this, [[0, 3]]);
       }));
       function getPrimitivesByMaterial(_x12) {
         return _getPrimitivesByMaterial.apply(this, arguments);
@@ -115642,29 +115543,29 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByMergeMaterial",
     value: function () {
-      var _getPrimitivesByMergeMaterial = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee9(params) {
-        var res, _t9;
-        return StreamLoader_regenerator().w(function (_context9) {
-          while (1) switch (_context9.p = _context9.n) {
+      var _getPrimitivesByMergeMaterial = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee8(params) {
+        var res, _t0;
+        return StreamLoader_regenerator().w(function (_context8) {
+          while (1) switch (_context8.p = _context8.n) {
             case 0:
-              _context9.p = 0;
+              _context8.p = 0;
               if (!(!this.modelApi || typeof this.modelApi.getPrimitivesByMergeMaterial !== 'function')) {
-                _context9.n = 1;
+                _context8.n = 1;
                 break;
               }
-              return _context9.a(2, null);
+              return _context8.a(2, null);
             case 1:
-              _context9.n = 2;
+              _context8.n = 2;
               return this.modelApi.getPrimitivesByMergeMaterial(params);
             case 2:
-              res = _context9.v;
-              return _context9.a(2, res || null);
+              res = _context8.v;
+              return _context8.a(2, res || null);
             case 3:
-              _context9.p = 3;
-              _t9 = _context9.v;
-              return _context9.a(2, null);
+              _context8.p = 3;
+              _t0 = _context8.v;
+              return _context8.a(2, null);
           }
-        }, _callee9, this, [[0, 3]]);
+        }, _callee8, this, [[0, 3]]);
       }));
       function getPrimitivesByMergeMaterial(_x13) {
         return _getPrimitivesByMergeMaterial.apply(this, arguments);
@@ -115702,36 +115603,36 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "abortAllStreamRequests",
     value: function () {
-      var _abortAllStreamRequests = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee0() {
-        var requestIds, _i2, _requestIds, requestId, readers, _i3, _readers, reader, _t0, _t1, _t10;
-        return StreamLoader_regenerator().w(function (_context0) {
-          while (1) switch (_context0.p = _context0.n) {
+      var _abortAllStreamRequests = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee9() {
+        var requestIds, _i2, _requestIds, requestId, readers, _i3, _readers, reader, _t1, _t10, _t11;
+        return StreamLoader_regenerator().w(function (_context9) {
+          while (1) switch (_context9.p = _context9.n) {
             case 0:
-              _context0.p = 0;
+              _context9.p = 0;
               requestIds = Array.from(this.activeRequestIds);
               _i2 = 0, _requestIds = requestIds;
             case 1:
               if (!(_i2 < _requestIds.length)) {
-                _context0.n = 6;
+                _context9.n = 6;
                 break;
               }
               requestId = _requestIds[_i2];
               if (!(typeof this.onCancelRequestId === 'function')) {
-                _context0.n = 5;
+                _context9.n = 5;
                 break;
               }
-              _context0.p = 2;
-              _context0.n = 3;
+              _context9.p = 2;
+              _context9.n = 3;
               return this.onCancelRequestId(requestId);
             case 3:
-              _context0.n = 5;
+              _context9.n = 5;
               break;
             case 4:
-              _context0.p = 4;
-              _t0 = _context0.v;
+              _context9.p = 4;
+              _t1 = _context9.v;
             case 5:
               _i2++;
-              _context0.n = 1;
+              _context9.n = 1;
               break;
             case 6:
               this.activeRequestIds.clear();
@@ -115746,25 +115647,25 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               _i3 = 0, _readers = readers;
             case 7:
               if (!(_i3 < _readers.length)) {
-                _context0.n = 12;
+                _context9.n = 12;
                 break;
               }
               reader = _readers[_i3];
-              _context0.p = 8;
-              _context0.n = 9;
+              _context9.p = 8;
+              _context9.n = 9;
               return reader.cancel();
             case 9:
-              _context0.n = 11;
+              _context9.n = 11;
               break;
             case 10:
-              _context0.p = 10;
-              _t1 = _context0.v;
+              _context9.p = 10;
+              _t10 = _context9.v;
             case 11:
               _i3++;
-              _context0.n = 7;
+              _context9.n = 7;
               break;
             case 12:
-              _context0.p = 12;
+              _context9.p = 12;
               if (this.currentAbortController) {
                 try {
                   this.currentAbortController.abort();
@@ -115772,26 +115673,26 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 this.currentAbortController = null;
               }
               if (!this.currentStreamReader) {
-                _context0.n = 17;
+                _context9.n = 17;
                 break;
               }
-              _context0.p = 13;
-              _context0.n = 14;
+              _context9.p = 13;
+              _context9.n = 14;
               return this.currentStreamReader.cancel();
             case 14:
-              _context0.n = 16;
+              _context9.n = 16;
               break;
             case 15:
-              _context0.p = 15;
-              _t10 = _context0.v;
+              _context9.p = 15;
+              _t11 = _context9.v;
             case 16:
               this.currentStreamReader = null;
             case 17:
-              return _context0.f(12);
+              return _context9.f(12);
             case 18:
-              return _context0.a(2);
+              return _context9.a(2);
           }
-        }, _callee0, this, [[13, 15], [8, 10], [2, 4], [0,, 12, 18]]);
+        }, _callee9, this, [[13, 15], [8, 10], [2, 4], [0,, 12, 18]]);
       }));
       function abortAllStreamRequests() {
         return _abortAllStreamRequests.apply(this, arguments);
@@ -115803,52 +115704,52 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "fetchPrimitiveBufferByStream",
     value: function () {
-      var _fetchPrimitiveBufferByStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee1(range, list) {
+      var _fetchPrimitiveBufferByStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee0(range, list) {
         var abortSignal,
           requestId,
           request,
           streamResult,
-          _args1 = arguments,
-          _t11;
-        return StreamLoader_regenerator().w(function (_context1) {
-          while (1) switch (_context1.p = _context1.n) {
+          _args0 = arguments,
+          _t12;
+        return StreamLoader_regenerator().w(function (_context0) {
+          while (1) switch (_context0.p = _context0.n) {
             case 0:
-              abortSignal = _args1.length > 2 && _args1[2] !== undefined ? _args1[2] : null;
-              requestId = _args1.length > 3 && _args1[3] !== undefined ? _args1[3] : null;
-              _context1.p = 1;
-              _context1.n = 2;
+              abortSignal = _args0.length > 2 && _args0[2] !== undefined ? _args0[2] : null;
+              requestId = _args0.length > 3 && _args0[3] !== undefined ? _args0[3] : null;
+              _context0.p = 1;
+              _context0.n = 2;
               return this.abortAllStreamRequests();
             case 2:
               request = this.createAbortableRequest(requestId); // Use requestId if provided as key? Logic slightly different in utils
               // Adaptation: utils used getPrimitivesByRangeStreamWithAutoAbort which calls getPrimitivesByRangeStream
               // Here I simplify by calling getPrimitivesByRangeStream directly but managing request key
-              _context1.n = 3;
+              _context0.n = 3;
               return this.getPrimitivesByRangeStream(range, list, range, abortSignal || request.signal);
             case 3:
-              streamResult = _context1.v;
+              streamResult = _context0.v;
               this.cleanupRequest(request.requestId);
               if (streamResult) {
-                _context1.n = 4;
+                _context0.n = 4;
                 break;
               }
-              return _context1.a(2, null);
+              return _context0.a(2, null);
             case 4:
-              return _context1.a(2, streamResult);
+              return _context0.a(2, streamResult);
             case 5:
-              _context1.p = 5;
-              _t11 = _context1.v;
-              if (_t11.name === 'AbortError') {
+              _context0.p = 5;
+              _t12 = _context0.v;
+              if (_t12.name === 'AbortError') {
                 // throw error;
               }
               if (!(requestId && this.currentRequestId !== requestId)) {
-                _context1.n = 6;
+                _context0.n = 6;
                 break;
               }
-              return _context1.a(2, null);
+              return _context0.a(2, null);
             case 6:
-              return _context1.a(2);
+              return _context0.a(2);
           }
-        }, _callee1, this, [[1, 5]]);
+        }, _callee0, this, [[1, 5]]);
       }));
       function fetchPrimitiveBufferByStream(_x14, _x15) {
         return _fetchPrimitiveBufferByStream.apply(this, arguments);
@@ -115858,58 +115759,58 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "fetchPrimitiveBuffer",
     value: function () {
-      var _fetchPrimitiveBuffer = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee10(range) {
+      var _fetchPrimitiveBuffer = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee1(range) {
         var abortSignal,
           requestId,
           request,
-          _buffer,
-          _args10 = arguments,
-          _t12;
-        return StreamLoader_regenerator().w(function (_context10) {
-          while (1) switch (_context10.p = _context10.n) {
+          buffer,
+          _args1 = arguments,
+          _t13;
+        return StreamLoader_regenerator().w(function (_context1) {
+          while (1) switch (_context1.p = _context1.n) {
             case 0:
-              abortSignal = _args10.length > 1 && _args10[1] !== undefined ? _args10[1] : null;
-              requestId = _args10.length > 2 && _args10[2] !== undefined ? _args10[2] : null;
-              _context10.p = 1;
+              abortSignal = _args1.length > 1 && _args1[1] !== undefined ? _args1[1] : null;
+              requestId = _args1.length > 2 && _args1[2] !== undefined ? _args1[2] : null;
+              _context1.p = 1;
               request = this.createAbortableRequest(requestId || 'default');
-              _context10.n = 2;
+              _context1.n = 2;
               return this.getPrimitivesByRange(range, abortSignal || request.signal);
             case 2:
-              _buffer = _context10.v;
+              buffer = _context1.v;
               this.cleanupRequest(request.requestId);
-              if (!(!_buffer || _buffer.byteLength === 0)) {
-                _context10.n = 3;
+              if (!(!buffer || buffer.byteLength === 0)) {
+                _context1.n = 3;
                 break;
               }
-              return _context10.a(2, null);
+              return _context1.a(2, null);
             case 3:
-              if (!(_buffer.byteLength < 4)) {
-                _context10.n = 4;
+              if (!(buffer.byteLength < 4)) {
+                _context1.n = 4;
                 break;
               }
-              return _context10.a(2, null);
+              return _context1.a(2, null);
             case 4:
-              return _context10.a(2, _buffer);
+              return _context1.a(2, buffer);
             case 5:
-              _context10.p = 5;
-              _t12 = _context10.v;
-              if (!(_t12.name === 'AbortError')) {
-                _context10.n = 6;
+              _context1.p = 5;
+              _t13 = _context1.v;
+              if (!(_t13.name === 'AbortError')) {
+                _context1.n = 6;
                 break;
               }
-              throw _t12;
+              throw _t13;
             case 6:
               if (!(requestId && this.currentRequestId !== requestId)) {
-                _context10.n = 7;
+                _context1.n = 7;
                 break;
               }
-              return _context10.a(2, null);
+              return _context1.a(2, null);
             case 7:
-              throw _t12;
+              throw _t13;
             case 8:
-              return _context10.a(2);
+              return _context1.a(2);
           }
-        }, _callee10, this, [[1, 5]]);
+        }, _callee1, this, [[1, 5]]);
       }));
       function fetchPrimitiveBuffer(_x16) {
         return _fetchPrimitiveBuffer.apply(this, arguments);
@@ -115919,13 +115820,13 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "parseBufferData",
     value: function () {
-      var _parseBufferData = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee11(buffer) {
+      var _parseBufferData = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee10(buffer) {
         var transferable;
-        return StreamLoader_regenerator().w(function (_context11) {
-          while (1) switch (_context11.n) {
+        return StreamLoader_regenerator().w(function (_context10) {
+          while (1) switch (_context10.n) {
             case 0:
               if (!this.worker) {
-                _context11.n = 1;
+                _context10.n = 1;
                 break;
               }
               transferable = [];
@@ -115934,16 +115835,16 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               } else if (buffer.buffer instanceof ArrayBuffer) {
                 transferable.push(buffer.buffer);
               }
-              return _context11.a(2, this.workerRequest('parseBufferData', {
+              return _context10.a(2, this.workerRequest('parseBufferData', {
                 buffer: buffer,
                 prefixIdKey: this.prefixIdKey
               }, transferable));
             case 1:
-              return _context11.a(2, this._parseBufferDataSync(buffer));
+              return _context10.a(2, this._parseBufferDataSync(buffer));
             case 2:
-              return _context11.a(2);
+              return _context10.a(2);
           }
-        }, _callee11, this);
+        }, _callee10, this);
       }));
       function parseBufferData(_x17) {
         return _parseBufferData.apply(this, arguments);
@@ -115953,17 +115854,17 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "_parseBufferDataSync",
     value: function () {
-      var _parseBufferDataSync2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee12(buffer) {
+      var _parseBufferDataSync2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee11(buffer) {
         var _this6 = this;
-        var uint8Array, dataView, meshJsonBytes, primitives, offset, meshJsonLength, _decoder, meshJsonStr, mesh, result, i, primitive, _this$parsePrimitiveD, position, normal, posindex, nolindex, indices, formatted, _t13, _t14, _t15;
-        return StreamLoader_regenerator().w(function (_context12) {
-          while (1) switch (_context12.p = _context12.n) {
+        var uint8Array, dataView, meshJsonBytes, primitives, offset, meshJsonLength, decoder, meshJsonStr, mesh, result, i, primitive, _this$parsePrimitiveD2, position, normal, posindex, nolindex, indices, formatted, _t14, _t15, _t16;
+        return StreamLoader_regenerator().w(function (_context11) {
+          while (1) switch (_context11.p = _context11.n) {
             case 0:
               uint8Array = null;
               dataView = null;
               meshJsonBytes = null;
               primitives = [];
-              _context12.p = 1;
+              _context11.p = 1;
               uint8Array = new Uint8Array(buffer);
               dataView = new DataView(buffer);
               offset = 0;
@@ -115971,10 +115872,10 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               offset += 4;
               meshJsonBytes = new Uint8Array(uint8Array.buffer.slice(offset, offset + meshJsonLength));
               offset += meshJsonLength;
-              _decoder = new TextDecoder('utf-8');
-              meshJsonStr = _decoder.decode(meshJsonBytes);
+              decoder = new TextDecoder('utf-8');
+              meshJsonStr = decoder.decode(meshJsonBytes);
               meshJsonBytes = null;
-              _context12.p = 2;
+              _context11.p = 2;
               mesh = JSON.parse(meshJsonStr);
               this._applyPrefixId(mesh, 'id');
               if (Array.isArray(mesh)) {
@@ -115984,45 +115885,45 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               } else {
                 this._applyPrefixId(mesh.primitives, 'prmid', mesh.documentId);
               }
-              _context12.n = 4;
+              _context11.n = 4;
               break;
             case 3:
-              _context12.p = 3;
-              _t13 = _context12.v;
-              console.error('JSON 解析失败:', _t13, meshJsonStr);
+              _context11.p = 3;
+              _t14 = _context11.v;
+              console.error('JSON 解析失败:', _t14, meshJsonStr);
               throw new Error('JSON解析失败');
             case 4:
               if (!(offset < uint8Array.length)) {
-                _context12.n = 9;
+                _context11.n = 9;
                 break;
               }
-              _context12.p = 5;
+              _context11.p = 5;
               result = this.parsePrimitive(dataView, uint8Array, offset);
               console.log('result', result);
               if (result) {
-                _context12.n = 6;
+                _context11.n = 6;
                 break;
               }
-              return _context12.a(3, 9);
+              return _context11.a(3, 9);
             case 6:
               primitives.push(result.primitive);
               offset = result.offset;
-              _context12.n = 8;
+              _context11.n = 8;
               break;
             case 7:
-              _context12.p = 7;
-              _t14 = _context12.v;
-              console.error('解析失败，偏移:', offset, _t14);
-              return _context12.a(3, 9);
+              _context11.p = 7;
+              _t15 = _context11.v;
+              console.error('解析失败，偏移:', offset, _t15);
+              return _context11.a(3, 9);
             case 8:
-              _context12.n = 4;
+              _context11.n = 4;
               break;
             case 9:
               for (i = 0; i < primitives.length; i++) {
                 primitive = primitives[i];
                 this._applyPrefixId(primitive, 'id');
                 this._applyPrefixId(primitive, 'material');
-                _this$parsePrimitiveD = this.parsePrimitiveData(primitive), position = _this$parsePrimitiveD.position, normal = _this$parsePrimitiveD.normal, posindex = _this$parsePrimitiveD.posindex, nolindex = _this$parsePrimitiveD.nolindex, indices = _this$parsePrimitiveD.indices;
+                _this$parsePrimitiveD2 = this.parsePrimitiveData(primitive), position = _this$parsePrimitiveD2.position, normal = _this$parsePrimitiveD2.normal, posindex = _this$parsePrimitiveD2.posindex, nolindex = _this$parsePrimitiveD2.nolindex, indices = _this$parsePrimitiveD2.indices;
                 formatted = this.formatPrimitiveData({
                   position: position,
                   normal: normal,
@@ -116035,24 +115936,24 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 primitive.normal = formatted.normal;
                 primitive.indices = indices;
               }
-              return _context12.a(2, {
+              return _context11.a(2, {
                 mesh: mesh,
                 primitives: primitives
               });
             case 10:
-              _context12.p = 10;
-              _t15 = _context12.v;
-              throw _t15;
+              _context11.p = 10;
+              _t16 = _context11.v;
+              throw _t16;
             case 11:
-              _context12.p = 11;
+              _context11.p = 11;
               uint8Array = null;
               dataView = null;
               meshJsonBytes = null;
-              return _context12.f(11);
+              return _context11.f(11);
             case 12:
-              return _context12.a(2);
+              return _context11.a(2);
           }
-        }, _callee12, this, [[5, 7], [2, 3], [1, 10, 11, 12]]);
+        }, _callee11, this, [[5, 7], [2, 3], [1, 10, 11, 12]]);
       }));
       function _parseBufferDataSync(_x18) {
         return _parseBufferDataSync2.apply(this, arguments);
@@ -116062,7 +115963,7 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "fetchJsonSync",
     value: function () {
-      var _fetchJsonSync = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee13(list, range) {
+      var _fetchJsonSync = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee12(list, range) {
         var abortSignal,
           requestId,
           buffer,
@@ -116071,65 +115972,65 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
           _yield$this$parseBuff,
           mesh,
           parsed,
-          _args13 = arguments,
-          _t16;
-        return StreamLoader_regenerator().w(function (_context13) {
-          while (1) switch (_context13.p = _context13.n) {
+          _args12 = arguments,
+          _t17;
+        return StreamLoader_regenerator().w(function (_context12) {
+          while (1) switch (_context12.p = _context12.n) {
             case 0:
-              abortSignal = _args13.length > 2 && _args13[2] !== undefined ? _args13[2] : null;
-              requestId = _args13.length > 3 && _args13[3] !== undefined ? _args13[3] : null;
+              abortSignal = _args12.length > 2 && _args12[2] !== undefined ? _args12[2] : null;
+              requestId = _args12.length > 3 && _args12[3] !== undefined ? _args12[3] : null;
               buffer = null;
               primitives = [];
-              _context13.p = 1;
+              _context12.p = 1;
               loadStartTime = Date.now();
-              _context13.n = 2;
+              _context12.n = 2;
               return this.fetchPrimitiveBuffer(range, abortSignal, requestId);
             case 2:
-              buffer = _context13.v;
+              buffer = _context12.v;
               if (buffer) {
-                _context13.n = 3;
+                _context12.n = 3;
                 break;
               }
-              return _context13.a(2, {
+              return _context12.a(2, {
                 primitives: []
               });
             case 3:
-              _context13.n = 4;
+              _context12.n = 4;
               return this.parseBufferData(buffer);
             case 4:
-              _yield$this$parseBuff = _context13.v;
+              _yield$this$parseBuff = _context12.v;
               mesh = _yield$this$parseBuff.mesh;
               parsed = _yield$this$parseBuff.primitives;
               primitives = parsed;
               if (!(typeof this.renderModelData === 'function')) {
-                _context13.n = 5;
+                _context12.n = 5;
                 break;
               }
-              _context13.n = 5;
+              _context12.n = 5;
               return this.renderModelData(mesh, primitives, list, range);
             case 5:
-              return _context13.a(2, {
+              return _context12.a(2, {
                 primitives: primitives,
                 mesh: mesh
               });
             case 6:
-              _context13.p = 6;
-              _t16 = _context13.v;
-              if (!(_t16.name === 'AbortError')) {
-                _context13.n = 7;
+              _context12.p = 6;
+              _t17 = _context12.v;
+              if (!(_t17.name === 'AbortError')) {
+                _context12.n = 7;
                 break;
               }
-              throw _t16;
+              throw _t17;
             case 7:
               if (!(requestId && this.currentRequestId !== requestId)) {
-                _context13.n = 8;
+                _context12.n = 8;
                 break;
               }
-              return _context13.a(2);
+              return _context12.a(2);
             case 8:
-              throw _t16;
+              throw _t17;
             case 9:
-              _context13.p = 9;
+              _context12.p = 9;
               try {
                 buffer = null;
                 primitives = null;
@@ -116139,11 +116040,11 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               } catch (cleanupErr) {
                 console.warn('内存清理时发生错误:', cleanupErr);
               }
-              return _context13.f(9);
+              return _context12.f(9);
             case 10:
-              return _context13.a(2);
+              return _context12.a(2);
           }
-        }, _callee13, this, [[1, 6, 9, 10]]);
+        }, _callee12, this, [[1, 6, 9, 10]]);
       }));
       function fetchJsonSync(_x19, _x20) {
         return _fetchJsonSync.apply(this, arguments);
@@ -116153,47 +116054,47 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "fetchJsonStream",
     value: function () {
-      var _fetchJsonStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee14(list, range) {
+      var _fetchJsonStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee13(list, range) {
         var abortSignal,
           requestId,
           loadStartTime,
           streamResult,
-          _args14 = arguments,
-          _t17;
-        return StreamLoader_regenerator().w(function (_context14) {
-          while (1) switch (_context14.p = _context14.n) {
+          _args13 = arguments,
+          _t18;
+        return StreamLoader_regenerator().w(function (_context13) {
+          while (1) switch (_context13.p = _context13.n) {
             case 0:
-              abortSignal = _args14.length > 2 && _args14[2] !== undefined ? _args14[2] : null;
-              requestId = _args14.length > 3 && _args14[3] !== undefined ? _args14[3] : null;
-              _context14.p = 1;
+              abortSignal = _args13.length > 2 && _args13[2] !== undefined ? _args13[2] : null;
+              requestId = _args13.length > 3 && _args13[3] !== undefined ? _args13[3] : null;
+              _context13.p = 1;
               loadStartTime = Date.now();
-              _context14.n = 2;
+              _context13.n = 2;
               return this.fetchPrimitiveBufferByStream(range, list, abortSignal, requestId);
             case 2:
-              streamResult = _context14.v;
-              return _context14.a(2, StreamLoader_objectSpread(StreamLoader_objectSpread({}, streamResult || {}), {}, {
+              streamResult = _context13.v;
+              return _context13.a(2, StreamLoader_objectSpread(StreamLoader_objectSpread({}, streamResult || {}), {}, {
                 duration: Date.now() - loadStartTime
               }));
             case 3:
-              _context14.p = 3;
-              _t17 = _context14.v;
-              if (!(_t17.name === 'AbortError')) {
-                _context14.n = 4;
+              _context13.p = 3;
+              _t18 = _context13.v;
+              if (!(_t18.name === 'AbortError')) {
+                _context13.n = 4;
                 break;
               }
-              throw _t17;
+              throw _t18;
             case 4:
               if (!(requestId && this.currentRequestId !== requestId)) {
-                _context14.n = 5;
+                _context13.n = 5;
                 break;
               }
-              return _context14.a(2);
+              return _context13.a(2);
             case 5:
-              throw _t17;
+              throw _t18;
             case 6:
-              return _context14.a(2);
+              return _context13.a(2);
           }
-        }, _callee14, this, [[1, 3]]);
+        }, _callee13, this, [[1, 3]]);
       }));
       function fetchJsonStream(_x21, _x22) {
         return _fetchJsonStream.apply(this, arguments);
@@ -116281,20 +116182,8 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
       if (dataView.byteLength < offset + 12) {
         throw new Error('Insufficient data for primitive header');
       }
-      var primitiveIdTextLen = dataView.getUint32(offset, false);
+      primitive.id = dataView.getInt32(offset, false);
       offset += 4;
-      if (primitiveIdTextLen === 0xffffffff) {
-        primitive.id = null;
-      } else if (primitiveIdTextLen > 0) {
-        if (dataView.byteLength < offset + primitiveIdTextLen) {
-          throw new Error('Insufficient data for primitive id content');
-        }
-        var textBytes = uint8Array.subarray(offset, offset + primitiveIdTextLen);
-        primitive.id = new TextDecoder('utf-8').decode(textBytes);
-        offset += primitiveIdTextLen;
-      } else {
-        primitive.id = '';
-      }
       if (dataView.byteLength < offset + 4) {
         throw new Error('Insufficient data for GeomText length');
       }
@@ -116306,29 +116195,14 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
         if (dataView.byteLength < offset + documentTextLen) {
           throw new Error('Insufficient data for GeomText content');
         }
-        var _textBytes = uint8Array.subarray(offset, offset + documentTextLen);
-        primitive.documentId = new TextDecoder('utf-8').decode(_textBytes);
+        var textBytes = uint8Array.subarray(offset, offset + documentTextLen);
+        primitive.documentId = new TextDecoder('utf-8').decode(textBytes);
         offset += documentTextLen;
       } else {
         primitive.documentId = '';
       }
-      if (dataView.byteLength < offset + 4) {
-        throw new Error('Insufficient data for Material length');
-      }
-      var materialTextLen = dataView.getUint32(offset, false);
+      primitive.material = dataView.getInt32(offset, false);
       offset += 4;
-      if (materialTextLen === 0xffffffff) {
-        primitive.material = null;
-      } else if (materialTextLen > 0) {
-        if (dataView.byteLength < offset + materialTextLen) {
-          throw new Error('Insufficient data for Material content');
-        }
-        var _textBytes2 = uint8Array.subarray(offset, offset + materialTextLen);
-        primitive.material = new TextDecoder('utf-8').decode(_textBytes2);
-        offset += materialTextLen;
-      } else {
-        primitive.material = '';
-      }
       if (dataView.byteLength < offset + 4) {
         throw new Error('Insufficient data for GeomText length');
       }
@@ -116340,8 +116214,8 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
         if (dataView.byteLength < offset + geomTextLen) {
           throw new Error('Insufficient data for GeomText content');
         }
-        var _textBytes3 = uint8Array.subarray(offset, offset + geomTextLen);
-        primitive.geomText = new TextDecoder('utf-8').decode(_textBytes3);
+        var _textBytes = uint8Array.subarray(offset, offset + geomTextLen);
+        primitive.geomText = new TextDecoder('utf-8').decode(_textBytes);
         offset += geomTextLen;
       } else {
         primitive.geomText = '';
@@ -116421,8 +116295,8 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
         primitive.dataType = null;
       } else if (dataTypeLen > 0) {
         if (dataView.byteLength < offset + dataTypeLen) throw new Error('Insufficient data for DataType content');
-        var _textBytes4 = uint8Array.subarray(offset, offset + dataTypeLen);
-        primitive.dataType = new TextDecoder('utf-8').decode(_textBytes4);
+        var _textBytes2 = uint8Array.subarray(offset, offset + dataTypeLen);
+        primitive.dataType = new TextDecoder('utf-8').decode(_textBytes2);
         offset += dataTypeLen;
       } else {
         primitive.dataType = '';
@@ -116473,43 +116347,43 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "ensureNotInteracting",
     value: function () {
-      var _ensureNotInteracting = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee15(abortSignal) {
+      var _ensureNotInteracting = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee14(abortSignal) {
         var _this7 = this;
-        return StreamLoader_regenerator().w(function (_context15) {
-          while (1) switch (_context15.n) {
+        return StreamLoader_regenerator().w(function (_context14) {
+          while (1) switch (_context14.n) {
             case 0:
               if (!(abortSignal && abortSignal.aborted)) {
-                _context15.n = 1;
+                _context14.n = 1;
                 break;
               }
-              return _context15.a(2);
+              return _context14.a(2);
             case 1:
               if (!this.externalEnsureNotInteracting) {
-                _context15.n = 3;
+                _context14.n = 3;
                 break;
               }
-              _context15.n = 2;
+              _context14.n = 2;
               return this.externalEnsureNotInteracting(abortSignal);
             case 2:
-              return _context15.a(2);
+              return _context14.a(2);
             case 3:
               if (this.isUserInteracting) {
-                _context15.n = 4;
+                _context14.n = 4;
                 break;
               }
-              return _context15.a(2);
+              return _context14.a(2);
             case 4:
               if (!this.parsePausePromise) {
                 this.parsePausePromise = new Promise(function (resolve) {
                   _this7.parsePauseResolver = resolve;
                 });
               }
-              _context15.n = 5;
+              _context14.n = 5;
               return this.parsePausePromise;
             case 5:
-              return _context15.a(2);
+              return _context14.a(2);
           }
-        }, _callee15, this);
+        }, _callee14, this);
       }));
       function ensureNotInteracting(_x23) {
         return _ensureNotInteracting.apply(this, arguments);
@@ -116534,10 +116408,10 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "handleControlEnd",
     value: function () {
-      var _handleControlEnd = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee16() {
+      var _handleControlEnd = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee15() {
         var pressDuration;
-        return StreamLoader_regenerator().w(function (_context16) {
-          while (1) switch (_context16.n) {
+        return StreamLoader_regenerator().w(function (_context15) {
+          while (1) switch (_context15.n) {
             case 0:
               pressDuration = Date.now() - (this.controlPressStartAt || 0);
               if (pressDuration >= this.longPressAbortThresholdMs) {
@@ -116549,9 +116423,9 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               this.isUserInteracting = false;
               this.resumeParsing();
             case 1:
-              return _context16.a(2);
+              return _context15.a(2);
           }
-        }, _callee16, this);
+        }, _callee15, this);
       }));
       function handleControlEnd() {
         return _handleControlEnd.apply(this, arguments);
@@ -116561,18 +116435,18 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "handleWheelStart",
     value: function () {
-      var _handleWheelStart = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee17() {
-        return StreamLoader_regenerator().w(function (_context17) {
-          while (1) switch (_context17.n) {
+      var _handleWheelStart = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee16() {
+        return StreamLoader_regenerator().w(function (_context16) {
+          while (1) switch (_context16.n) {
             case 0:
               try {
                 // await this.abortAllStreamRequests();
               } catch (_) {}
               this.isUserInteracting = true;
             case 1:
-              return _context17.a(2);
+              return _context16.a(2);
           }
-        }, _callee17, this);
+        }, _callee16, this);
       }));
       function handleWheelStart() {
         return _handleWheelStart.apply(this, arguments);
@@ -116592,18 +116466,18 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "batchLoadRegions",
     value: function () {
-      var _batchLoadRegions = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee18(item, divideData) {
-        var priorityRegions, level0Regions, level1Regions, level2Regions, level3Regions, level4Regions, i, regionData, range, _t18, _t19;
-        return StreamLoader_regenerator().w(function (_context18) {
-          while (1) switch (_context18.p = _context18.n) {
+      var _batchLoadRegions = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee17(item, divideData) {
+        var priorityRegions, level0Regions, level1Regions, level2Regions, level3Regions, level4Regions, i, regionData, range, _t19, _t20;
+        return StreamLoader_regenerator().w(function (_context17) {
+          while (1) switch (_context17.p = _context17.n) {
             case 0:
               if (!(!divideData || divideData.length === 0)) {
-                _context18.n = 1;
+                _context17.n = 1;
                 break;
               }
-              return _context18.a(2);
+              return _context17.a(2);
             case 1:
-              _context18.p = 1;
+              _context17.p = 1;
               priorityRegions = [];
               level0Regions = divideData.filter(function (region) {
                 return region.lodLevel && region.lodLevel.includes(0);
@@ -116622,15 +116496,15 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               });
               priorityRegions.push.apply(priorityRegions, StreamLoader_toConsumableArray(level0Regions).concat(StreamLoader_toConsumableArray(level1Regions), StreamLoader_toConsumableArray(level2Regions), StreamLoader_toConsumableArray(level3Regions), StreamLoader_toConsumableArray(level4Regions)));
               if (!(priorityRegions.length === 0)) {
-                _context18.n = 2;
+                _context17.n = 2;
                 break;
               }
-              return _context18.a(2);
+              return _context17.a(2);
             case 2:
               i = 0;
             case 3:
               if (!(i < priorityRegions.length && i < 1)) {
-                _context18.n = 8;
+                _context17.n = 8;
                 break;
               }
               regionData = priorityRegions[i];
@@ -116638,30 +116512,30 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 regionIndex: regionData.index,
                 documentId: item.id
               };
-              _context18.p = 4;
-              _context18.n = 5;
+              _context17.p = 4;
+              _context17.n = 5;
               return this.fetchJsonSync(item, range);
             case 5:
-              _context18.n = 7;
+              _context17.n = 7;
               break;
             case 6:
-              _context18.p = 6;
-              _t18 = _context18.v;
+              _context17.p = 6;
+              _t19 = _context17.v;
             case 7:
               i++;
-              _context18.n = 3;
+              _context17.n = 3;
               break;
             case 8:
-              _context18.n = 10;
+              _context17.n = 10;
               break;
             case 9:
-              _context18.p = 9;
-              _t19 = _context18.v;
-              throw _t19;
+              _context17.p = 9;
+              _t20 = _context17.v;
+              throw _t20;
             case 10:
-              return _context18.a(2);
+              return _context17.a(2);
           }
-        }, _callee18, this, [[4, 6], [1, 9]]);
+        }, _callee17, this, [[4, 6], [1, 9]]);
       }));
       function batchLoadRegions(_x24, _x25) {
         return _batchLoadRegions.apply(this, arguments);
@@ -116671,59 +116545,59 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "loadModelByIds",
     value: function () {
-      var _loadModelByIds = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee19(options) {
-        var params, onComplete, buffer, primitives, _params$immediateUpda, loadStartTime, _ref4, ids, documentIdToIds, _yield$this$parseBuff2, mesh, parsed, _t20;
-        return StreamLoader_regenerator().w(function (_context19) {
-          while (1) switch (_context19.p = _context19.n) {
+      var _loadModelByIds = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee18(options) {
+        var params, onComplete, buffer, primitives, _params$immediateUpda, loadStartTime, _ref3, ids, documentIdToIds, _yield$this$parseBuff2, mesh, parsed, _t21;
+        return StreamLoader_regenerator().w(function (_context18) {
+          while (1) switch (_context18.p = _context18.n) {
             case 0:
               params = options.params, onComplete = options.onComplete;
               buffer = null;
               primitives = [];
-              _context19.p = 1;
+              _context18.p = 1;
               loadStartTime = Date.now(); // 构建 documentIdToIds 映射 多个documentid->modelid
-              _ref4 = options.params || {}, ids = _ref4.ids;
+              _ref3 = options.params || {}, ids = _ref3.ids;
               documentIdToIds = this.parseModelDocumentMappings(ids);
               delete params.ids;
               params.documentIdToIds = documentIdToIds;
               params.projectId = this.projectId;
-              _context19.n = 2;
+              _context18.n = 2;
               return this.getPrimitivesByRangeDetail(params);
             case 2:
-              buffer = _context19.v;
+              buffer = _context18.v;
               if (buffer) {
-                _context19.n = 3;
+                _context18.n = 3;
                 break;
               }
-              return _context19.a(2, {
+              return _context18.a(2, {
                 primitives: []
               });
             case 3:
-              _context19.n = 4;
+              _context18.n = 4;
               return this.parseBufferData(buffer);
             case 4:
-              _yield$this$parseBuff2 = _context19.v;
+              _yield$this$parseBuff2 = _context18.v;
               mesh = _yield$this$parseBuff2.mesh;
               parsed = _yield$this$parseBuff2.primitives;
               primitives = parsed;
-              _context19.n = 5;
+              _context18.n = 5;
               return this.renderModelData(mesh, primitives, params.folderInfo, null, onComplete, (_params$immediateUpda = params.immediateUpdate) !== null && _params$immediateUpda !== void 0 ? _params$immediateUpda : true);
             case 5:
-              return _context19.a(2, {
+              return _context18.a(2, {
                 primitives: primitives,
                 mesh: mesh
               });
             case 6:
-              _context19.p = 6;
-              _t20 = _context19.v;
-              if (!(_t20.name === 'AbortError')) {
-                _context19.n = 7;
+              _context18.p = 6;
+              _t21 = _context18.v;
+              if (!(_t21.name === 'AbortError')) {
+                _context18.n = 7;
                 break;
               }
-              throw _t20;
+              throw _t21;
             case 7:
-              throw _t20;
+              throw _t21;
             case 8:
-              _context19.p = 8;
+              _context18.p = 8;
               try {
                 buffer = null;
                 if (primitives && primitives.length > 0) {
@@ -116742,11 +116616,11 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                   window.gc();
                 }
               } catch (cleanupErr) {}
-              return _context19.f(8);
+              return _context18.f(8);
             case 9:
-              return _context19.a(2);
+              return _context18.a(2);
           }
-        }, _callee19, this, [[1, 6, 8, 9]]);
+        }, _callee18, this, [[1, 6, 8, 9]]);
       }));
       function loadModelByIds(_x26) {
         return _loadModelByIds.apply(this, arguments);
@@ -116758,26 +116632,26 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByDivide",
     value: function () {
-      var _getPrimitivesByDivide = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee20(params) {
+      var _getPrimitivesByDivide = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee19(params) {
         var res;
-        return StreamLoader_regenerator().w(function (_context20) {
-          while (1) switch (_context20.n) {
+        return StreamLoader_regenerator().w(function (_context19) {
+          while (1) switch (_context19.n) {
             case 0:
-              _context20.n = 1;
+              _context19.n = 1;
               return this.modelApi.getPrimitivesByDivide(params);
             case 1:
-              res = _context20.v;
+              res = _context19.v;
               if (!res) {
-                _context20.n = 2;
+                _context19.n = 2;
                 break;
               }
-              return _context20.a(2, res);
+              return _context19.a(2, res);
             case 2:
               throw new Error('Failed to get primitives');
             case 3:
-              return _context20.a(2);
+              return _context19.a(2);
           }
-        }, _callee20, this);
+        }, _callee19, this);
       }));
       function getPrimitivesByDivide(_x27) {
         return _getPrimitivesByDivide.apply(this, arguments);
@@ -116787,26 +116661,26 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getPrimitivesByRangeDetail",
     value: function () {
-      var _getPrimitivesByRangeDetail = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee21(params) {
+      var _getPrimitivesByRangeDetail = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee20(params) {
         var res;
-        return StreamLoader_regenerator().w(function (_context21) {
-          while (1) switch (_context21.n) {
+        return StreamLoader_regenerator().w(function (_context20) {
+          while (1) switch (_context20.n) {
             case 0:
-              _context21.n = 1;
+              _context20.n = 1;
               return this.modelApi.getPrimitivesByRangeDetail(params);
             case 1:
-              res = _context21.v;
+              res = _context20.v;
               if (!res) {
-                _context21.n = 2;
+                _context20.n = 2;
                 break;
               }
-              return _context21.a(2, res);
+              return _context20.a(2, res);
             case 2:
               throw new Error('Failed to get batch model');
             case 3:
-              return _context21.a(2);
+              return _context20.a(2);
           }
-        }, _callee21, this);
+        }, _callee20, this);
       }));
       function getPrimitivesByRangeDetail(_x28) {
         return _getPrimitivesByRangeDetail.apply(this, arguments);
@@ -116818,31 +116692,31 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getSceneBox",
     value: function () {
-      var _getSceneBox = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee22(_ref5) {
-        var id, _ref5$projectId, projectId, res;
-        return StreamLoader_regenerator().w(function (_context22) {
-          while (1) switch (_context22.n) {
+      var _getSceneBox = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee21(_ref4) {
+        var id, _ref4$projectId, projectId, res;
+        return StreamLoader_regenerator().w(function (_context21) {
+          while (1) switch (_context21.n) {
             case 0:
-              id = _ref5.id, _ref5$projectId = _ref5.projectId, projectId = _ref5$projectId === void 0 ? this.projectId : _ref5$projectId;
-              _context22.n = 1;
+              id = _ref4.id, _ref4$projectId = _ref4.projectId, projectId = _ref4$projectId === void 0 ? this.projectId : _ref4$projectId;
+              _context21.n = 1;
               return this.modelApi.getSceneBox({
                 id: id,
                 projectId: projectId
               });
             case 1:
-              res = _context22.v;
+              res = _context21.v;
               if (!(res && res[0])) {
-                _context22.n = 2;
+                _context21.n = 2;
                 break;
               }
               this.sceneBox = res[0];
-              return _context22.a(2, res[0]);
+              return _context21.a(2, res[0]);
             case 2:
-              return _context22.a(2, null);
+              return _context21.a(2, null);
             case 3:
-              return _context22.a(2);
+              return _context21.a(2);
           }
-        }, _callee22, this);
+        }, _callee21, this);
       }));
       function getSceneBox(_x29) {
         return _getSceneBox.apply(this, arguments);
@@ -116852,43 +116726,43 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "getBox",
     value: function () {
-      var _getBox = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee23(_ref6) {
-        var id, _ref6$projectId, projectId, isDebug, cached, res;
-        return StreamLoader_regenerator().w(function (_context23) {
-          while (1) switch (_context23.n) {
+      var _getBox = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee22(_ref5) {
+        var id, _ref5$projectId, projectId, cached, res;
+        return StreamLoader_regenerator().w(function (_context22) {
+          while (1) switch (_context22.n) {
             case 0:
-              id = _ref6.id, _ref6$projectId = _ref6.projectId, projectId = _ref6$projectId === void 0 ? this.projectId || 0 : _ref6$projectId, isDebug = _ref6.isDebug;
-              _context23.n = 1;
+              id = _ref5.id, _ref5$projectId = _ref5.projectId, projectId = _ref5$projectId === void 0 ? this.projectId || 0 : _ref5$projectId;
+              _context22.n = 1;
               return this._getFromDB(id, projectId);
             case 1:
-              cached = _context23.v;
-              if (!(cached && !isDebug)) {
-                _context23.n = 2;
+              cached = _context22.v;
+              if (!cached) {
+                _context22.n = 2;
                 break;
               }
-              return _context23.a(2, cached);
+              return _context22.a(2, cached);
             case 2:
-              _context23.n = 3;
+              _context22.n = 3;
               return this.modelApi.getBox({
                 id: id,
                 projectId: projectId
               });
             case 3:
-              res = _context23.v;
+              res = _context22.v;
               if (!res) {
-                _context23.n = 4;
+                _context22.n = 4;
                 break;
               }
               // 3. 存入 IndexedDB (存储原始数据)
               this._applyPrefixId(res, 'id', id);
               this._saveToDB(id, res, projectId);
-              return _context23.a(2, res);
+              return _context22.a(2, res);
             case 4:
-              return _context23.a(2, null);
+              return _context22.a(2, null);
             case 5:
-              return _context23.a(2);
+              return _context22.a(2);
           }
-        }, _callee23, this);
+        }, _callee22, this);
       }));
       function getBox(_x30) {
         return _getBox.apply(this, arguments);
@@ -116898,11 +116772,11 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "handleCameraControlForStream",
     value: function () {
-      var _handleCameraControlForStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee24(args) {
+      var _handleCameraControlForStream = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee23(args) {
         var _this8 = this;
-        var chainRequest, loadedModels, documentIdToIds, activeItems, primaryItem, requestId, range, streamResult, _t21;
-        return StreamLoader_regenerator().w(function (_context24) {
-          while (1) switch (_context24.p = _context24.n) {
+        var chainRequest, loadedModels, documentIdToIds, activeItems, primaryItem, requestId, range, streamResult, _t22;
+        return StreamLoader_regenerator().w(function (_context23) {
+          while (1) switch (_context23.p = _context23.n) {
             case 0:
               // 性能优化注释：禁用 range 被注释字段的解构声明与初始化
               chainRequest = args.chainRequest, loadedModels = args.loadedModels; // 构建 documentIdToIds 映射 多个documentid->modelid
@@ -116926,10 +116800,10 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 }
               });
               if (!(activeItems.length === 0)) {
-                _context24.n = 1;
+                _context23.n = 1;
                 break;
               }
-              return _context24.a(2);
+              return _context23.a(2);
             case 1:
               primaryItem = activeItems[0]; // 使用第一个item作为主上下文
               requestId = Date.now() + '_' + Math.random().toString(36).substr(2, 9);
@@ -116978,20 +116852,20 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               //   range.minZ = Math.max(range.minZ, boxToUse.min_z);
               //   range.maxZ = Math.min(range.maxZ, boxToUse.max_z);
               // }
-              _context24.p = 2;
-              _context24.n = 3;
+              _context23.p = 2;
+              _context23.n = 3;
               return this.fetchJsonStream(primaryItem, range, this.currentAbortController.signal, requestId);
             case 3:
-              streamResult = _context24.v;
+              streamResult = _context23.v;
               if (!(this.currentRequestId === requestId)) {
-                _context24.n = 5;
+                _context23.n = 5;
                 break;
               }
               if (!(typeof this.onRangeStreamComplete === 'function')) {
-                _context24.n = 4;
+                _context23.n = 4;
                 break;
               }
-              _context24.n = 4;
+              _context23.n = 4;
               return this.onRangeStreamComplete(StreamLoader_objectSpread({
                 source: 'inRangeDis2',
                 requestId: requestId,
@@ -117001,28 +116875,28 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
             case 4:
               this.currentAbortController = null;
               this.currentRequestId = null;
-              _context24.n = 5;
+              _context23.n = 5;
               break;
             case 5:
-              _context24.n = 8;
+              _context23.n = 8;
               break;
             case 6:
-              _context24.p = 6;
-              _t21 = _context24.v;
-              if (!(_t21.name === 'AbortError')) {
-                _context24.n = 7;
+              _context23.p = 6;
+              _t22 = _context23.v;
+              if (!(_t22.name === 'AbortError')) {
+                _context23.n = 7;
                 break;
               }
-              return _context24.a(2);
+              return _context23.a(2);
             case 7:
               if (this.currentRequestId === requestId) {
                 this.currentAbortController = null;
                 this.currentRequestId = null;
               }
             case 8:
-              return _context24.a(2);
+              return _context23.a(2);
           }
-        }, _callee24, this, [[2, 6]]);
+        }, _callee23, this, [[2, 6]]);
       }));
       function handleCameraControlForStream(_x31) {
         return _handleCameraControlForStream.apply(this, arguments);
@@ -117081,61 +116955,60 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "processModelItem",
     value: function () {
-      var _processModelItem = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee25(item) {
+      var _processModelItem = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee24(item) {
         var options,
           materialData,
           mergeMaterialData,
           sceneBox,
           boxIndex,
           modelResourceMapObj,
-          _args25 = arguments,
-          _t22;
-        return StreamLoader_regenerator().w(function (_context25) {
-          while (1) switch (_context25.p = _context25.n) {
+          _args24 = arguments,
+          _t23;
+        return StreamLoader_regenerator().w(function (_context24) {
+          while (1) switch (_context24.p = _context24.n) {
             case 0:
-              options = _args25.length > 1 && _args25[1] !== undefined ? _args25[1] : {};
-              _context25.p = 1;
+              options = _args24.length > 1 && _args24[1] !== undefined ? _args24[1] : {};
+              _context24.p = 1;
               if (typeof item.id !== 'string') {
                 item.id = '' + item.id;
               }
 
               // 获取材质数据
-              _context25.n = 2;
+              _context24.n = 2;
               return this.getPrimitivesByMaterial({
                 id: item.id,
                 projectId: this.projectId
               });
             case 2:
-              materialData = _context25.v;
-              _context25.n = 3;
+              materialData = _context24.v;
+              _context24.n = 3;
               return this.getPrimitivesByMergeMaterial({
                 id: item.id,
                 projectId: this.projectId
               });
             case 3:
-              mergeMaterialData = _context25.v;
+              mergeMaterialData = _context24.v;
               this._applyPrefixId(mergeMaterialData, 'id');
               this._applyPrefixId(materialData, 'id');
 
               // 获取场景包围盒
-              _context25.n = 4;
+              _context24.n = 4;
               return this.getSceneBox({
                 id: item.id,
                 projectId: this.projectId
               });
             case 4:
-              sceneBox = _context25.v;
+              sceneBox = _context24.v;
               this.sceneBox = sceneBox;
 
               // 获取BoxIndex
-              _context25.n = 5;
+              _context24.n = 5;
               return this.getBox({
                 id: item.id,
-                projectId: this.projectId,
-                isDebug: this.debug
+                projectId: this.projectId
               });
             case 5:
-              boxIndex = _context25.v;
+              boxIndex = _context24.v;
               this.boxIndex = boxIndex;
 
               // 将 mergeMaterialData 覆盖到 materialData（按 id 覆盖 color/transp）
@@ -117147,18 +117020,18 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
               }; // 设置当前模型到注册表
               this.updateModelRegistry(item, materialData, mergeMaterialData, sceneBox, boxIndex);
               console.log('modelRegistry', this.modelRegistry);
-              return _context25.a(2, {
+              return _context24.a(2, {
                 modelResourceMap: modelResourceMapObj,
                 sceneBox: sceneBox,
                 boxIndex: boxIndex,
                 item: item
               });
             case 6:
-              _context25.p = 6;
-              _t22 = _context25.v;
-              return _context25.a(2, null);
+              _context24.p = 6;
+              _t23 = _context24.v;
+              return _context24.a(2, null);
           }
-        }, _callee25, this, [[1, 6]]);
+        }, _callee24, this, [[1, 6]]);
       }));
       function processModelItem(_x32) {
         return _processModelItem.apply(this, arguments);
@@ -117197,27 +117070,27 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "_getFromDB",
     value: function () {
-      var _getFromDB2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee26(id) {
+      var _getFromDB2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee25(id) {
         var projectId,
           db,
-          _args26 = arguments,
-          _t23;
-        return StreamLoader_regenerator().w(function (_context26) {
-          while (1) switch (_context26.p = _context26.n) {
+          _args25 = arguments,
+          _t24;
+        return StreamLoader_regenerator().w(function (_context25) {
+          while (1) switch (_context25.p = _context25.n) {
             case 0:
-              projectId = _args26.length > 1 && _args26[1] !== undefined ? _args26[1] : this.projectId || 0;
-              _context26.p = 1;
-              _context26.n = 2;
+              projectId = _args25.length > 1 && _args25[1] !== undefined ? _args25[1] : this.projectId || 0;
+              _context25.p = 1;
+              _context25.n = 2;
               return this._initDB();
             case 2:
-              db = _context26.v;
+              db = _context25.v;
               if (db) {
-                _context26.n = 3;
+                _context25.n = 3;
                 break;
               }
-              return _context26.a(2, null);
+              return _context25.a(2, null);
             case 3:
-              return _context26.a(2, new Promise(function (resolve) {
+              return _context25.a(2, new Promise(function (resolve) {
                 var transaction = db.transaction(['boxCache'], 'readonly');
                 var store = transaction.objectStore('boxCache');
                 var request = store.get("".concat(projectId, ":").concat(id));
@@ -117229,12 +117102,12 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
                 };
               }));
             case 4:
-              _context26.p = 4;
-              _t23 = _context26.v;
-              console.warn('Error reading from IndexedDB:', _t23);
-              return _context26.a(2, null);
+              _context25.p = 4;
+              _t24 = _context25.v;
+              console.warn('Error reading from IndexedDB:', _t24);
+              return _context25.a(2, null);
           }
-        }, _callee26, this, [[1, 4]]);
+        }, _callee25, this, [[1, 4]]);
       }));
       function _getFromDB(_x33) {
         return _getFromDB2.apply(this, arguments);
@@ -117244,41 +117117,41 @@ var StreamLoader_StreamLoader = /*#__PURE__*/function () {
   }, {
     key: "_saveToDB",
     value: function () {
-      var _saveToDB2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee27(id, data) {
+      var _saveToDB2 = StreamLoader_asyncToGenerator(/*#__PURE__*/StreamLoader_regenerator().m(function _callee26(id, data) {
         var projectId,
           db,
           transaction,
           store,
-          _args27 = arguments,
-          _t24;
-        return StreamLoader_regenerator().w(function (_context27) {
-          while (1) switch (_context27.p = _context27.n) {
+          _args26 = arguments,
+          _t25;
+        return StreamLoader_regenerator().w(function (_context26) {
+          while (1) switch (_context26.p = _context26.n) {
             case 0:
-              projectId = _args27.length > 2 && _args27[2] !== undefined ? _args27[2] : this.projectId || 0;
-              _context27.p = 1;
-              _context27.n = 2;
+              projectId = _args26.length > 2 && _args26[2] !== undefined ? _args26[2] : this.projectId || 0;
+              _context26.p = 1;
+              _context26.n = 2;
               return this._initDB();
             case 2:
-              db = _context27.v;
+              db = _context26.v;
               if (db) {
-                _context27.n = 3;
+                _context26.n = 3;
                 break;
               }
-              return _context27.a(2);
+              return _context26.a(2);
             case 3:
               transaction = db.transaction(['boxCache'], 'readwrite');
               store = transaction.objectStore('boxCache');
               store.put(data, "".concat(projectId, ":").concat(id));
-              _context27.n = 5;
+              _context26.n = 5;
               break;
             case 4:
-              _context27.p = 4;
-              _t24 = _context27.v;
-              console.warn('Error saving to IndexedDB:', _t24);
+              _context26.p = 4;
+              _t25 = _context26.v;
+              console.warn('Error saving to IndexedDB:', _t25);
             case 5:
-              return _context27.a(2);
+              return _context26.a(2);
           }
-        }, _callee27, this, [[1, 4]]);
+        }, _callee26, this, [[1, 4]]);
       }));
       function _saveToDB(_x34, _x35) {
         return _saveToDB2.apply(this, arguments);
@@ -120921,7 +120794,7 @@ var LOG_INTERVAL = 30;
 
 
 
-// import boxJson from './box.json';
+
 
 
 
@@ -122252,12 +122125,8 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
       if (isAdd && boxJson) {
         var arr = boxJson ? boxJson : [];
         var modelIds = new Set();
-        var validGeomTypes = new Set(Object.values(GEOM_TYPES));
         for (var i = 0; i < arr.length; i++) {
           var it = arr[i];
-          if (!validGeomTypes.has(it.geomType)) {
-            continue;
-          }
           if (it.obb.length == 0) {
             continue;
           }
@@ -122268,21 +122137,10 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
 
           // 构造 AABB
           var boxThree = new this.THREE.Box3(min, max);
-          var hasMatrix = Array.isArray(it.matrix) && it.matrix.length >= 16;
-          var hasMeshMatrix = Array.isArray(it.meshMatrix) && it.meshMatrix.length >= 16;
-          var localMatrix = null;
-          if (hasMatrix || hasMeshMatrix) {
-            localMatrix = new this.THREE.Matrix4();
-            if (hasMeshMatrix) {
-              localMatrix.fromArray(it.meshMatrix);
-            } else {
-              localMatrix.identity();
-            }
-            if (hasMatrix) {
-              var matrix = new this.THREE.Matrix4().fromArray(it.matrix);
-              localMatrix.multiply(matrix);
-            }
-            var worldMatrix = localMatrix.clone();
+          var hasMatrix = Array.isArray(it.matrix);
+          if (hasMatrix && it.matrix.length >= 16) {
+            var matrix = new this.THREE.Matrix4().fromArray(it.matrix);
+            var worldMatrix = matrix.clone();
             if (this.bizToThreeMatrix) {
               worldMatrix.premultiply(this.bizToThreeMatrix);
             }
@@ -122294,19 +122152,15 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
           var userData = {
             flag: it.flag || 1,
             // 默认为 1
-            geomType: it.geomType,
             obbData: it.obb,
             // 存储原始 OBB 数据
             transparent: it.transp > 0,
             sourceVisible: it.visible === false ? false : true,
-            visible: it.visible === false ? false : true,
-            // 默认显示
-            occlusionEnabled: it.geomType === GEOM_TYPES.geom_3d || it.geomType === GEOM_TYPES.geom_3d_obj
+            visible: it.visible === false ? false : true // 默认显示
           };
           if (it.flag === 1) {
             userData.indices = it.indices;
-            userData.matrix = localMatrix ? localMatrix.toArray() : it.matrix;
-            userData.meshMatrix = it.meshMatrix;
+            userData.matrix = it.matrix;
             // userData.matrix = new this.THREE.Matrix4().identity();
           }
           // 如果是 flag=3，解析并存储中心点、半轴长、旋转矩阵
@@ -122320,9 +122174,6 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
             var rotationMatrix4 = new this.THREE.Matrix4().setFromMatrix3(rotation);
             var obbMatrix = new this.THREE.Matrix4().makeTranslation(center.x, center.y, center.z);
             obbMatrix.multiply(rotationMatrix4);
-            if (localMatrix) {
-              obbMatrix.premultiply(localMatrix);
-            }
             userData.obb = {
               matrix: obbMatrix,
               center: center,
@@ -122367,9 +122218,6 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
       this.buildOctreeFromBoxIndex();
       console.log('time end', Date.now());
     },
-    shouldApplyOcclusionByBox: function shouldApplyOcclusionByBox(box) {
-      return !!(box && box.userData && box.userData.occlusionEnabled);
-    },
     tryInitialCenterAfterBoundsReady: function tryInitialCenterAfterBoundsReady() {
       if (this.hasExecutedCentering || this.userInteracting) return;
       if (!this.sceneBoundingBox || !this.sceneBoundingBox.isBox3 || this.sceneBoundingBox.isEmpty()) return;
@@ -122999,7 +122847,7 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               }
               visibleIdSet = new Set(visibleIds);
               if (!_this12._octree) {
-                _context3.n = 8;
+                _context3.n = 7;
                 break;
               }
               frustum = _this12._getCurrentFrustum();
@@ -123008,40 +122856,29 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               i = 0;
             case 3:
               if (!(i < hits.length)) {
-                _context3.n = 7;
+                _context3.n = 6;
                 break;
               }
               if (!(hits[i].box && hits[i].box.userData && hits[i].box.userData.visible === false)) {
                 _context3.n = 4;
                 break;
               }
-              return _context3.a(3, 6);
+              return _context3.a(3, 5);
             case 4:
-              if (_this12.shouldApplyOcclusionByBox(hits[i].box)) {
-                _context3.n = 5;
-                break;
-              }
-              visibleIdSet.add(_this12.formatModelId(hits[i].modelId));
-              return _context3.a(3, 6);
-            case 5:
               candidates.push(hits[i]);
-            case 6:
+            case 5:
               i++;
               _context3.n = 3;
               break;
-            case 7:
-              _context3.n = 9;
+            case 6:
+              _context3.n = 8;
               break;
-            case 8:
+            case 7:
               if (_this12._boxIndex && _this12._boxIndex.size > 0) {
                 _this12._boxIndex.forEach(function (box, modelId) {
                   if (bypassList && bypassList.size > 0 && bypassList.has(modelId)) return;
                   if (box.userData && box.userData.visible === false) return;
                   if (_this12.isBoxInFrustum(box)) {
-                    if (!_this12.shouldApplyOcclusionByBox(box)) {
-                      visibleIdSet.add(_this12.formatModelId(modelId));
-                      return;
-                    }
                     candidates.push({
                       modelId: modelId,
                       box: box
@@ -123049,11 +122886,11 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                   }
                 });
               }
-            case 9:
+            case 8:
               occlusionState = _this12.noObserver ? _this12.noObserver.occlusionState : _this12.occlusionState; // 从响应式对象获取开关状态
               occlusionEnabled = _this12.occlusionState && _this12.occlusionState.enabled;
               if (!occlusionEnabled) {
-                _context3.n = 16;
+                _context3.n = 15;
                 break;
               }
               state = occlusionState;
@@ -123067,7 +122904,7 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               sh = Math.max(1, sh);
               rt = state._colorRT;
               t0 = performance.now();
-              _context3.p = 10;
+              _context3.p = 9;
               if (!rt || state._rtW !== sw || state._rtH !== sh) {
                 if (rt && typeof rt.dispose === 'function') rt.dispose();
                 rt = new _this12.THREE.WebGLRenderTarget(sw, sh, {
@@ -123564,9 +123401,9 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               extraStride = _this12.occlusionState && _this12.occlusionState.sampleStride ? _this12.occlusionState.sampleStride : 1;
               stride = Math.max(1, baseStride * Math.max(1, extraStride));
               minSampleCount = _this12.occlusionState && _this12.occlusionState.minSampleCount ? _this12.occlusionState.minSampleCount : 1;
-              _context3.n = 11;
+              _context3.n = 10;
               return _this12.scanOcclusionIndices(state._colorBuffer, sw, sh, stride, maxIdx, minSampleCount);
-            case 11:
+            case 10:
               scanResult = _context3.v;
               if (scanResult && scanResult.buffer) {
                 state._colorBuffer = new Uint8Array(scanResult.buffer);
@@ -123580,7 +123417,7 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               }
               transparentMaxIdx = typeof state._occTransparentMaxIdx === 'number' ? state._occTransparentMaxIdx : 0;
               if (!(transparentMaxIdx > 0 && transparentMesh && transparentMesh.visible)) {
-                _context3.n = 13;
+                _context3.n = 12;
                 break;
               }
               _this12.renderer.setClearColor(new _this12.THREE.Color(0, 0, 0), 0);
@@ -123588,9 +123425,9 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
               _this12.renderer.render(state._occTransparentScene, _this12.camera);
               _this12.renderer.readRenderTargetPixels(rt, 0, 0, sw, sh, state._colorBuffer);
               tIdIndexArr = transparentIdIndexArr;
-              _context3.n = 12;
+              _context3.n = 11;
               return _this12.scanOcclusionIndices(state._colorBuffer, sw, sh, stride, transparentMaxIdx, minSampleCount);
-            case 12:
+            case 11:
               tScanResult = _context3.v;
               if (tScanResult && tScanResult.buffer) {
                 state._colorBuffer = new Uint8Array(tScanResult.buffer);
@@ -123602,26 +123439,26 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                   visibleIdSet.add(_id);
                 }
               }
-            case 13:
+            case 12:
               _this12.renderer.setRenderTarget(prevTarget);
               _this12.renderer.setClearColor(prevClearColorHex, prevClearAlpha);
               _this12.renderer.toneMapping = prevToneMapping;
-              _context3.n = 15;
+              _context3.n = 14;
               break;
-            case 14:
-              _context3.p = 14;
+            case 13:
+              _context3.p = 13;
               _t2 = _context3.v;
               for (_i10 = 0; _i10 < candidates.length; _i10++) {
                 visibleIdSet.add(candidates[_i10].modelId);
               }
-            case 15:
-              _context3.n = 17;
+            case 14:
+              _context3.n = 16;
               break;
-            case 16:
+            case 15:
               for (_i11 = 0; _i11 < candidates.length; _i11++) {
                 visibleIdSet.add(candidates[_i11].modelId);
               }
-            case 17:
+            case 16:
               visibleIds.length = 0;
               visibleIdSet.forEach(function (id) {
                 return visibleIds.push(id);
@@ -123652,11 +123489,6 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                       if (bypassList && bypassList.size > 0 && bypassList.has(_modelId)) return;
                       var instanceInfo = instancesMap.get(_modelId);
                       var instanceIndex = instanceInfo && typeof instanceInfo.instanceIndex === 'number' ? instanceInfo.instanceIndex : null;
-                      var _box = _this12._boxIndex && _this12._boxIndex.has(String(_modelId)) ? _this12._boxIndex.get(String(_modelId)) : _this12._boxIndex && _this12._boxIndex.has(_modelId) ? _this12._boxIndex.get(_modelId) : null;
-                      if (!_this12.shouldApplyOcclusionByBox(_box)) {
-                        allInactive = false;
-                        continue;
-                      }
                       var _inFrustum = _this12.isModelInFrustum(child, instanceIndex, globalFrustum);
                       var _modelInVisible = toLoadSet.has(_modelId);
                       // console.log('modelId', modelId, 'inFrustum', inFrustum, 'modelInVisible', modelInVisible)
@@ -123670,13 +123502,6 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                     // 第二遍遍历：同步状态并决定是否卸载
                     for (var _i13 = 0, _modelIds3 = modelIds; _i13 < _modelIds3.length; _i13++) {
                       var _modelId2 = _modelIds3[_i13];
-                      var _box2 = _this12._boxIndex && _this12._boxIndex.has(String(_modelId2)) ? _this12._boxIndex.get(String(_modelId2)) : _this12._boxIndex && _this12._boxIndex.has(_modelId2) ? _this12._boxIndex.get(_modelId2) : null;
-                      if (!_this12.shouldApplyOcclusionByBox(_box2)) {
-                        if (toLoadSet.has(_modelId2)) {
-                          toLoadSet.delete(_modelId2);
-                        }
-                        continue;
-                      }
                       // 无论是否卸载，只要模型已在场景中，就从待加载集合中移除
                       if (toLoadSet.has(_modelId2)) {
                         toLoadSet.delete(_modelId2);
@@ -123698,13 +123523,6 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                 }
                 var modelId = child.parent && child.parent.userData && child.parent.userData.instanceId ? child.parent.userData.instanceId : child.uuid;
                 if (bypassList && bypassList.size > 0 && bypassList.has(modelId)) return;
-                var box = _this12._boxIndex && _this12._boxIndex.has(String(modelId)) ? _this12._boxIndex.get(String(modelId)) : _this12._boxIndex && _this12._boxIndex.has(modelId) ? _this12._boxIndex.get(modelId) : null;
-                if (!_this12.shouldApplyOcclusionByBox(box)) {
-                  if (toLoadSet.has(modelId)) {
-                    toLoadSet.delete(modelId);
-                  }
-                  return;
-                }
                 var inFrustum = _this12.isModelInFrustum(child, null, globalFrustum);
                 var modelInVisible = toLoadSet.has(modelId);
                 if (modelInVisible) {
@@ -123730,10 +123548,10 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
                 });
               }
               _this12.modelStateManager.isloadedModelsIds = Object.freeze(Array.from(toLoadSet));
-            case 18:
+            case 17:
               return _context3.a(2);
           }
-        }, _callee3, null, [[10, 14]]);
+        }, _callee3, null, [[9, 13]]);
       }))();
     },
     isBoxInFrustum: function isBoxInFrustum(box) {
@@ -127558,11 +127376,11 @@ var COLLISION_PENETRATION_EPSILON = 0.1;
 });
 // CONCATENATED MODULE: ./packages/components/com-graphics/index.vue?vue&type=script&lang=js
  /* harmony default export */ var components_com_graphicsvue_type_script_lang_js = (com_graphicsvue_type_script_lang_js); 
-// EXTERNAL MODULE: ./packages/components/com-graphics/index.vue?vue&type=style&index=0&id=46d6866f&prod&lang=scss&scoped=true
-var com_graphicsvue_type_style_index_0_id_46d6866f_prod_lang_scss_scoped_true = __webpack_require__("cbdd");
+// EXTERNAL MODULE: ./packages/components/com-graphics/index.vue?vue&type=style&index=0&id=607a330c&prod&lang=scss&scoped=true
+var com_graphicsvue_type_style_index_0_id_607a330c_prod_lang_scss_scoped_true = __webpack_require__("d181");
 
-// EXTERNAL MODULE: ./packages/components/com-graphics/index.vue?vue&type=style&index=1&id=46d6866f&prod&lang=css
-var com_graphicsvue_type_style_index_1_id_46d6866f_prod_lang_css = __webpack_require__("12fb");
+// EXTERNAL MODULE: ./packages/components/com-graphics/index.vue?vue&type=style&index=1&id=607a330c&prod&lang=css
+var com_graphicsvue_type_style_index_1_id_607a330c_prod_lang_css = __webpack_require__("0c36");
 
 // CONCATENATED MODULE: ./node_modules/vue-loader/lib/runtime/componentNormalizer.js
 /* globals __VUE_SSR_CONTEXT__ */
@@ -127674,17 +127492,17 @@ function normalizeComponent(
 
 var component = normalizeComponent(
   components_com_graphicsvue_type_script_lang_js,
-  com_graphicsvue_type_template_id_46d6866f_scoped_true_render,
+  com_graphicsvue_type_template_id_607a330c_scoped_true_render,
   staticRenderFns,
   false,
   null,
-  "46d6866f",
+  "607a330c",
   null
   
 )
 
 /* harmony default export */ var com_graphics = (component.exports);
-// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"44f05828-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-flcanvas/index.vue?vue&type=template&id=b313ab6c&scoped=true
+// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"13819966-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-flcanvas/index.vue?vue&type=template&id=b313ab6c&scoped=true
 var com_flcanvasvue_type_template_id_b313ab6c_scoped_true_render = function render() {
   var _vm = this,
     _c = _vm._self._c;
@@ -131737,7 +131555,7 @@ var com_flcanvas_component = normalizeComponent(
 )
 
 /* harmony default export */ var com_flcanvas = (com_flcanvas_component.exports);
-// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"44f05828-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/per-control.vue?vue&type=template&id=f547d5c6&scoped=true
+// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"13819966-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/per-control.vue?vue&type=template&id=f547d5c6&scoped=true
 var per_controlvue_type_template_id_f547d5c6_scoped_true_render = function render() {
   var _vm = this,
     _c = _vm._self._c;
@@ -131845,7 +131663,7 @@ var per_control_component = normalizeComponent(
 )
 
 /* harmony default export */ var per_control = (per_control_component.exports);
-// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"44f05828-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/pid.vue?vue&type=template&id=2572c0e2&scoped=true
+// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"13819966-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/pid.vue?vue&type=template&id=2572c0e2&scoped=true
 var pidvue_type_template_id_2572c0e2_scoped_true_render = function render() {
   var _vm = this,
     _c = _vm._self._c;
@@ -131892,7 +131710,7 @@ var browserify_default = /*#__PURE__*/__webpack_require__.n(browserify);
 var html2canvas = __webpack_require__("c0e9");
 var html2canvas_default = /*#__PURE__*/__webpack_require__.n(html2canvas);
 
-// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"44f05828-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/component/ann-tool.vue?vue&type=template&id=4b17bce0&scoped=true
+// CONCATENATED MODULE: ./node_modules/cache-loader/dist/cjs.js?{"cacheDirectory":"node_modules/.cache/vue-loader","cacheIdentifier":"13819966-vue-loader-template"}!./node_modules/cache-loader/dist/cjs.js??ref--12-0!./node_modules/babel-loader/lib!./node_modules/vue-loader/lib/loaders/templateLoader.js??ref--6!./node_modules/cache-loader/dist/cjs.js??ref--0-0!./node_modules/vue-loader/lib??vue-loader-options!./packages/components/com-graphics/component/ann-tool.vue?vue&type=template&id=4b17bce0&scoped=true
 var ann_toolvue_type_template_id_4b17bce0_scoped_true_render = function render() {
   var _vm = this,
     _c = _vm._self._c;