@thatopen/components 2.3.12 → 2.3.13

package/dist/index.mjs

@@ -2,7 +2,7 @@ var Ao = Object.defineProperty;
 var Fo = (c, i, t) => i in c ? Ao(c, i, { enumerable: !0, configurable: !0, writable: !0, value: t }) : c[i] = t;
 var C = (c, i, t) => (Fo(c, typeof i != "symbol" ? i + "" : i, t), t);
 import * as D from "three";
-import { BufferAttribute as Zr, Vector3 as Q, Vector2 as ai, Plane as Dn, Line3 as Ee, Triangle as ii, Sphere as So, Matrix4 as pe, Box3 as ae, BackSide as Oo, DoubleSide as jr, FrontSide as Xn, Mesh as rt, Ray as No, Raycaster as yo, Quaternion as de, Object3D as In, Euler as Lo, MeshBasicMaterial as qr, LineBasicMaterial as _o, CylinderGeometry as Vt, BoxGeometry as Ut, BufferGeometry as $n, Float32BufferAttribute as Zn, OctahedronGeometry as Gi, Line as Ae, SphereGeometry as Po, TorusGeometry as Ii, PlaneGeometry as wo } from "three";
+import { BufferAttribute as Zr, Vector3 as Q, Vector2 as ai, Plane as Dn, Line3 as Ee, Triangle as ii, Sphere as So, Matrix4 as pe, Box3 as ae, BackSide as Oo, DoubleSide as jr, FrontSide as Xn, Mesh as rt, Ray as No, Raycaster as yo, Quaternion as de, Object3D as In, Euler as Lo, MeshBasicMaterial as qr, LineBasicMaterial as Po, CylinderGeometry as Vt, BoxGeometry as Ut, BufferGeometry as $n, Float32BufferAttribute as Zn, OctahedronGeometry as Gi, Line as Ae, SphereGeometry as _o, TorusGeometry as Ii, PlaneGeometry as wo } from "three";
 import * as Qt from "@thatopen/fragments";
 import { FragmentsGroup as Mo, Serializer as Do } from "@thatopen/fragments";
 import * as z from "web-ifc";
@@ -739,10 +739,10 @@ class ea extends vn {
   }
 }
 const $t = /* @__PURE__ */ new ea();
-function Gt(c, i) {
+function zt(c, i) {
   return i[c + 15] === 65535;
 }
-function zt(c, i) {
+function kt(c, i) {
   return i[c + 6];
 }
 function Zt(c, i) {
@@ -770,44 +770,44 @@ class ia {
   }
 }
 const Ft = new ia();
-let _e, si;
+let Pe, si;
 const ze = [], Wi = /* @__PURE__ */ new vn(() => new ae());
 function sa(c, i, t, e, s, n) {
-  _e = Wi.getPrimitive(), si = Wi.getPrimitive(), ze.push(_e, si), Ft.setBuffer(c._roots[i]);
+  Pe = Wi.getPrimitive(), si = Wi.getPrimitive(), ze.push(Pe, si), Ft.setBuffer(c._roots[i]);
   const r = dn(0, c.geometry, t, e, s, n);
-  Ft.clearBuffer(), Wi.releasePrimitive(_e), Wi.releasePrimitive(si), ze.pop(), ze.pop();
+  Ft.clearBuffer(), Wi.releasePrimitive(Pe), Wi.releasePrimitive(si), ze.pop(), ze.pop();
   const o = ze.length;
-  return o > 0 && (si = ze[o - 1], _e = ze[o - 2]), r;
+  return o > 0 && (si = ze[o - 1], Pe = ze[o - 2]), r;
 }
 function dn(c, i, t, e, s = null, n = 0, r = 0) {
   const { float32Array: o, uint16Array: a, uint32Array: l } = Ft;
   let h = c * 2;
-  if (Gt(h, a)) {
-    const I = zt(c, l), u = Zt(h, a);
-    return Nt(c, o, _e), e(I, u, !1, r, n + c, _e);
+  if (zt(h, a)) {
+    const I = kt(c, l), u = Zt(h, a);
+    return Nt(c, o, Pe), e(I, u, !1, r, n + c, Pe);
   } else {
     let b = function(N) {
       const { uint16Array: M, uint32Array: g } = Ft;
       let v = N * 2;
-      for (; !Gt(v, M); )
+      for (; !zt(v, M); )
         N = jt(N), v = N * 2;
-      return zt(N, g);
+      return kt(N, g);
     }, Y = function(N) {
       const { uint16Array: M, uint32Array: g } = Ft;
       let v = N * 2;
-      for (; !Gt(v, M); )
+      for (; !zt(v, M); )
         N = qt(N, g), v = N * 2;
-      return zt(N, g) + Zt(v, M);
+      return kt(N, g) + Zt(v, M);
     };
     const I = jt(c), u = qt(c, l);
     let d = I, E = u, T, p, m, F;
-    if (s && (m = _e, F = si, Nt(d, o, m), Nt(E, o, F), T = s(m), p = s(F), p < T)) {
+    if (s && (m = Pe, F = si, Nt(d, o, m), Nt(E, o, F), T = s(m), p = s(F), p < T)) {
       d = u, E = I;
       const N = T;
       T = p, p = N, m = F;
     }
-    m || (m = _e, Nt(d, o, m));
-    const R = Gt(d * 2, a), S = t(m, R, T, r + 1, n + d);
+    m || (m = Pe, Nt(d, o, m));
+    const R = zt(d * 2, a), S = t(m, R, T, r + 1, n + d);
     let O;
     if (S === jn) {
       const N = b(d), g = Y(d) - N;
@@ -825,7 +825,7 @@ function dn(c, i, t, e, s = null, n = 0, r = 0) {
     if (O)
       return !0;
     F = si, Nt(E, o, F);
-    const y = Gt(E * 2, a), w = t(F, y, p, r + 1, n + E);
+    const y = zt(E * 2, a), w = t(F, y, p, r + 1, n + E);
     let L;
     if (w === jn) {
       const N = b(E), g = Y(E) - N;
@@ -994,8 +994,8 @@ function da(c, i, t, e, s) {
 }
 function En(c, i, t, e, s) {
   const { float32Array: n, uint16Array: r, uint32Array: o } = Ft, a = c * 2;
-  if (Gt(a, r)) {
-    const h = zt(c, o), f = Zt(a, r);
+  if (zt(a, r)) {
+    const h = kt(c, o), f = Zt(a, r);
     aa(i, t, e, h, f, s);
   } else {
     const h = jt(c);
@@ -1013,8 +1013,8 @@ function pa(c, i, t, e) {
 function pn(c, i, t, e) {
   const { float32Array: s, uint16Array: n, uint32Array: r } = Ft;
   let o = c * 2;
-  if (Gt(o, n)) {
-    const l = zt(c, r), h = Zt(o, n);
+  if (zt(o, n)) {
+    const l = kt(c, r), h = Zt(o, n);
     return ca(i, t, e, l, h);
   } else {
     const l = to(c, r), h = Ea[l], I = e.direction[h] >= 0;
@@ -1042,8 +1042,8 @@ function Ca(c, i, t, e) {
 function Cn(c, i, t, e, s = null) {
   const { float32Array: n, uint16Array: r, uint32Array: o } = Ft;
   let a = c * 2;
-  if (s === null && (t.boundingBox || t.computeBoundingBox(), or.set(t.boundingBox.min, t.boundingBox.max, e), s = or), Gt(a, r)) {
-    const h = i.geometry, f = h.index, I = h.attributes.position, u = t.index, d = t.attributes.position, E = zt(c, o), T = Zt(a, r);
+  if (s === null && (t.boundingBox || t.computeBoundingBox(), or.set(t.boundingBox.min, t.boundingBox.max, e), s = or), zt(a, r)) {
+    const h = i.geometry, f = h.index, I = h.attributes.position, u = t.index, d = t.attributes.position, E = kt(c, o), T = Zt(a, r);
     if (pi.copy(e).invert(), t.boundsTree)
       return Nt(c, n, Qi), Qi.matrix.copy(pi), Qi.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (m) => Qi.intersectsBox(m),
@@ -1157,8 +1157,8 @@ function Sa(c, i, t, e, s) {
 }
 function Tn(c, i, t, e, s) {
   const { float32Array: n, uint16Array: r, uint32Array: o } = Ft, a = c * 2;
-  if (Gt(a, r)) {
-    const h = zt(c, o), f = Zt(a, r);
+  if (zt(a, r)) {
+    const h = kt(c, o), f = Zt(a, r);
     ua(i, t, e, h, f, s);
   } else {
     const h = jt(c);
@@ -1176,8 +1176,8 @@ function Na(c, i, t, e) {
 function mn(c, i, t, e) {
   const { float32Array: s, uint16Array: n, uint32Array: r } = Ft;
   let o = c * 2;
-  if (Gt(o, n)) {
-    const l = zt(c, r), h = Zt(o, n);
+  if (zt(o, n)) {
+    const l = kt(c, r), h = Zt(o, n);
     return fa(i, t, e, l, h);
   } else {
     const l = to(c, r), h = Oa[l], I = e.direction[h] >= 0;
@@ -1205,8 +1205,8 @@ function ya(c, i, t, e) {
 function Rn(c, i, t, e, s = null) {
   const { float32Array: n, uint16Array: r, uint32Array: o } = Ft;
   let a = c * 2;
-  if (s === null && (t.boundingBox || t.computeBoundingBox(), lr.set(t.boundingBox.min, t.boundingBox.max, e), s = lr), Gt(a, r)) {
-    const h = i.geometry, f = h.index, I = h.attributes.position, u = t.index, d = t.attributes.position, E = zt(c, o), T = Zt(a, r);
+  if (s === null && (t.boundingBox || t.computeBoundingBox(), lr.set(t.boundingBox.min, t.boundingBox.max, e), s = lr), zt(a, r)) {
+    const h = i.geometry, f = h.index, I = h.attributes.position, u = t.index, d = t.attributes.position, E = kt(c, o), T = Zt(a, r);
     if (Ti.copy(e).invert(), t.boundsTree)
       return Nt(c, n, ts), ts.matrix.copy(Ti), ts.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (m) => ts.intersectsBox(m),
@@ -1230,12 +1230,12 @@ function Rn(c, i, t, e, s = null) {
     return Nt(h, n, Ji), !!(s.intersectsBox(Ji) && Rn(h, i, t, e, s) || (Nt(f, n, Ji), s.intersectsBox(Ji) && Rn(f, i, t, e, s)));
   }
 }
-const es = /* @__PURE__ */ new pe(), Qs = /* @__PURE__ */ new Bt(), mi = /* @__PURE__ */ new Bt(), La = /* @__PURE__ */ new Q(), _a = /* @__PURE__ */ new Q(), Pa = /* @__PURE__ */ new Q(), wa = /* @__PURE__ */ new Q();
+const es = /* @__PURE__ */ new pe(), Qs = /* @__PURE__ */ new Bt(), mi = /* @__PURE__ */ new Bt(), La = /* @__PURE__ */ new Q(), Pa = /* @__PURE__ */ new Q(), _a = /* @__PURE__ */ new Q(), wa = /* @__PURE__ */ new Q();
 function Ma(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
   i.boundingBox || i.computeBoundingBox(), Qs.set(i.boundingBox.min, i.boundingBox.max, t), Qs.needsUpdate = !0;
   const o = c.geometry, a = o.attributes.position, l = o.index, h = i.attributes.position, f = i.index, I = $t.getPrimitive(), u = $t.getPrimitive();
-  let d = La, E = _a, T = null, p = null;
-  s && (T = Pa, p = wa);
+  let d = La, E = Pa, T = null, p = null;
+  s && (T = _a, p = wa);
   let m = 1 / 0, F = null, R = null;
   return es.copy(t).invert(), mi.matrix.copy(es), c.shapecast(
     {
@@ -1315,22 +1315,22 @@ function ba(c, i, t, e) {
 function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
   let f, I;
   h ? (f = ps, I = wi) : (f = wi, I = ps);
-  const u = f.float32Array, d = f.uint32Array, E = f.uint16Array, T = I.float32Array, p = I.uint32Array, m = I.uint16Array, F = c * 2, R = i * 2, S = Gt(F, E), O = Gt(R, m);
+  const u = f.float32Array, d = f.uint32Array, E = f.uint16Array, T = I.float32Array, p = I.uint32Array, m = I.uint16Array, F = c * 2, R = i * 2, S = zt(F, E), O = zt(R, m);
   let y = !1;
   if (O && S)
     h ? y = s(
-      zt(i, p),
+      kt(i, p),
       Zt(i * 2, m),
-      zt(c, d),
+      kt(c, d),
       Zt(c * 2, E),
       a,
       r + i,
       o,
       n + c
     ) : y = s(
-      zt(c, d),
+      kt(c, d),
       Zt(c * 2, E),
-      zt(i, p),
+      kt(i, p),
       Zt(i * 2, m),
       o,
       n + c,
@@ -1765,7 +1765,7 @@ class j {
     this.handlers.length = 0;
   }
 }
-class Pe {
+class _e {
   constructor() {
     /** Triggers all the callbacks assigned to this event. */
     C(this, "trigger", async (i) => {
@@ -2542,8 +2542,8 @@ function qa(c) {
     while (Ct !== ft.edge);
     const Ht = n.length - 2;
     for (let Dt = 1, A = Ht; Dt <= A; Dt++) {
-      const X = n[0].vertex, k = n[Dt + 0].vertex, P = n[Dt + 1].vertex;
-      r.push(X.point.x, X.point.y, X.point.z), r.push(k.point.x, k.point.y, k.point.z), r.push(P.point.x, P.point.y, P.point.z);
+      const X = n[0].vertex, k = n[Dt + 0].vertex, _ = n[Dt + 1].vertex;
+      r.push(X.point.x, X.point.y, X.point.z), r.push(k.point.x, k.point.y, k.point.z), r.push(_.point.x, _.point.y, _.point.z);
     }
   }
   const o = new D.Vector3(), a = new D.Vector3(), l = new D.Vector3(), h = new D.Vector3(), f = new D.Vector3(), I = new D.Vector3(), u = new D.Vector3(), d = new D.Vector3();
@@ -2590,15 +2590,15 @@ class pr {
     return i.transparent && i.opacity < 1;
   }
 }
-const _t = class _t {
+const Pt = class Pt {
   // Copied from three.js source
   // Original source: http://stackoverflow.com/questions/105034/how-to-create-a-guid-uuid-in-javascript/21963136#21963136
   static create() {
     const i = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0;
-    return `${_t._lut[i & 255] + _t._lut[i >> 8 & 255] + _t._lut[i >> 16 & 255] + _t._lut[i >> 24 & 255]}-${_t._lut[t & 255]}${_t._lut[t >> 8 & 255]}-${_t._lut[t >> 16 & 15 | 64]}${_t._lut[t >> 24 & 255]}-${_t._lut[e & 63 | 128]}${_t._lut[e >> 8 & 255]}-${_t._lut[e >> 16 & 255]}${_t._lut[e >> 24 & 255]}${_t._lut[s & 255]}${_t._lut[s >> 8 & 255]}${_t._lut[s >> 16 & 255]}${_t._lut[s >> 24 & 255]}`.toLowerCase();
+    return `${Pt._lut[i & 255] + Pt._lut[i >> 8 & 255] + Pt._lut[i >> 16 & 255] + Pt._lut[i >> 24 & 255]}-${Pt._lut[t & 255]}${Pt._lut[t >> 8 & 255]}-${Pt._lut[t >> 16 & 15 | 64]}${Pt._lut[t >> 24 & 255]}-${Pt._lut[e & 63 | 128]}${Pt._lut[e >> 8 & 255]}-${Pt._lut[e >> 16 & 255]}${Pt._lut[e >> 24 & 255]}${Pt._lut[s & 255]}${Pt._lut[s >> 8 & 255]}${Pt._lut[s >> 16 & 255]}${Pt._lut[s >> 24 & 255]}`.toLowerCase();
   }
   static validate(i) {
-    if (!_t._pattern.test(i))
+    if (!Pt._pattern.test(i))
       throw new Error(
         `${i} is not a valid UUID v4.
 
@@ -2608,8 +2608,8 @@ const _t = class _t {
       );
   }
 };
-C(_t, "_pattern", /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-4[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$/), // prettier-ignore
-C(_t, "_lut", [
+C(Pt, "_pattern", /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-4[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$/), // prettier-ignore
+C(Pt, "_lut", [
   "00",
   "01",
   "02",
@@ -2867,7 +2867,7 @@ C(_t, "_lut", [
   "fe",
   "ff"
 ]);
-let oe = _t;
+let oe = Pt;
 class Th extends At {
   constructor(t, e) {
     super(t);
@@ -3137,7 +3137,7 @@ const Fs = class Fs {
 /**
  * The version of the @thatopen/components library.
  */
-C(Fs, "release", "2.3.12");
+C(Fs, "release", "2.3.13");
 let Cs = Fs;
 class Qa extends xn {
   constructor() {
@@ -5296,7 +5296,7 @@ class lc {
      * meshes that are currently visible, and the ones that were visible
      * just before but not anymore.
      */
-    C(this, "onViewUpdated", new Pe());
+    C(this, "onViewUpdated", new _e());
     /**
      * Whether this renderer is active or not. If not, it won't render anything.
      */
@@ -6438,7 +6438,7 @@ const xe = new yo(), bt = new Q(), Se = new Q(), Ot = new de(), Nr = {
   X: new Q(1, 0, 0),
   Y: new Q(0, 1, 0),
   Z: new Q(0, 0, 1)
-}, un = { type: "change" }, yr = { type: "mouseDown" }, Lr = { type: "mouseUp", mode: null }, _r = { type: "objectChange" };
+}, un = { type: "change" }, yr = { type: "mouseDown" }, Lr = { type: "mouseUp", mode: null }, Pr = { type: "objectChange" };
 class pc extends In {
   constructor(i, t) {
     super(), t === void 0 && (console.warn('THREE.TransformControls: The second parameter "domElement" is now mandatory.'), t = document), this.isTransformControls = !0, this.visible = !1, this.domElement = t, this.domElement.style.touchAction = "none";
@@ -6503,7 +6503,7 @@ class pc extends In {
         let a = !1;
         t === "XYZE" ? (this.rotationAxis.copy(this._offset).cross(this.eye).normalize(), this.rotationAngle = this._offset.dot(bt.copy(this.rotationAxis).cross(this.eye)) * o) : (t === "X" || t === "Y" || t === "Z") && (this.rotationAxis.copy(Nr[t]), bt.copy(Nr[t]), n === "local" && bt.applyQuaternion(this.worldQuaternion), bt.cross(this.eye), bt.length() === 0 ? a = !0 : this.rotationAngle = this._offset.dot(bt.normalize()) * o), (t === "E" || a) && (this.rotationAxis.copy(this.eye), this.rotationAngle = this.pointEnd.angleTo(this.pointStart), this._startNorm.copy(this.pointStart).normalize(), this._endNorm.copy(this.pointEnd).normalize(), this.rotationAngle *= this._endNorm.cross(this._startNorm).dot(this.eye) < 0 ? 1 : -1), this.rotationSnap && (this.rotationAngle = Math.round(this.rotationAngle / this.rotationSnap) * this.rotationSnap), n === "local" && t !== "E" && t !== "XYZE" ? (s.quaternion.copy(this._quaternionStart), s.quaternion.multiply(Ot.setFromAxisAngle(this.rotationAxis, this.rotationAngle)).normalize()) : (this.rotationAxis.applyQuaternion(this._parentQuaternionInv), s.quaternion.copy(Ot.setFromAxisAngle(this.rotationAxis, this.rotationAngle)), s.quaternion.multiply(this._quaternionStart).normalize());
       }
-      this.dispatchEvent(un), this.dispatchEvent(_r);
+      this.dispatchEvent(un), this.dispatchEvent(Pr);
     }
   }
   pointerUp(i) {
@@ -6523,7 +6523,7 @@ class pc extends In {
     return this.object = void 0, this.visible = !1, this.axis = null, this;
   }
   reset() {
-    this.enabled && this.dragging && (this.object.position.copy(this._positionStart), this.object.quaternion.copy(this._quaternionStart), this.object.scale.copy(this._scaleStart), this.dispatchEvent(un), this.dispatchEvent(_r), this.pointStart.copy(this.pointEnd));
+    this.enabled && this.dragging && (this.object.position.copy(this._positionStart), this.object.quaternion.copy(this._quaternionStart), this.object.scale.copy(this._scaleStart), this.dispatchEvent(un), this.dispatchEvent(Pr), this.pointStart.copy(this.pointEnd));
   }
   getRaycaster() {
     return xe;
@@ -6592,7 +6592,7 @@ function fn(c, i, t) {
       return e[s];
   return !1;
 }
-const cs = new Lo(), mt = new Q(0, 1, 0), Pr = new Q(0, 0, 0), wr = new pe(), ls = new de(), Es = new de(), ue = new Q(), Mr = new pe(), _i = new Q(1, 0, 0), Be = new Q(0, 1, 0), Pi = new Q(0, 0, 1), hs = new Q(), Oi = new Q(), Ni = new Q();
+const cs = new Lo(), mt = new Q(0, 1, 0), _r = new Q(0, 0, 0), wr = new pe(), ls = new de(), Es = new de(), ue = new Q(), Mr = new pe(), Pi = new Q(1, 0, 0), Be = new Q(0, 1, 0), _i = new Q(0, 0, 1), hs = new Q(), Oi = new Q(), Ni = new Q();
 class Ac extends In {
   constructor() {
     super(), this.isTransformControlsGizmo = !0, this.type = "TransformControlsGizmo";
@@ -6602,7 +6602,7 @@ class Ac extends In {
       fog: !1,
       toneMapped: !1,
       transparent: !0
-    }), t = new _o({
+    }), t = new Po({
       depthTest: !1,
       depthWrite: !1,
       fog: !1,
@@ -6740,7 +6740,7 @@ class Ac extends In {
       ]
     }, b = {
       XYZE: [
-        [new rt(new Po(0.25, 10, 8), e)]
+        [new rt(new _o(0.25, 10, 8), e)]
       ],
       X: [
         [new rt(new Ii(0.5, 0.1, 4, 24), e), [0, 0, 0], [0, -Math.PI / 2, -Math.PI / 2]]
@@ -6842,10 +6842,10 @@ class Ac extends In {
       r.visible = !0, r.rotation.set(0, 0, 0), r.position.copy(this.worldPosition);
       let o;
       if (this.camera.isOrthographicCamera ? o = (this.camera.top - this.camera.bottom) / this.camera.zoom : o = this.worldPosition.distanceTo(this.cameraPosition) * Math.min(1.9 * Math.tan(Math.PI * this.camera.fov / 360) / this.camera.zoom, 7), r.scale.set(1, 1, 1).multiplyScalar(o * this.size / 4), r.tag === "helper") {
-        r.visible = !1, r.name === "AXIS" ? (r.visible = !!this.axis, this.axis === "X" && (Ot.setFromEuler(cs.set(0, 0, 0)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "Y" && (Ot.setFromEuler(cs.set(0, 0, Math.PI / 2)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "Z" && (Ot.setFromEuler(cs.set(0, Math.PI / 2, 0)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "XYZE" && (Ot.setFromEuler(cs.set(0, Math.PI / 2, 0)), mt.copy(this.rotationAxis), r.quaternion.setFromRotationMatrix(wr.lookAt(Pr, mt, Be)), r.quaternion.multiply(Ot), r.visible = this.dragging), this.axis === "E" && (r.visible = !1)) : r.name === "START" ? (r.position.copy(this.worldPositionStart), r.visible = this.dragging) : r.name === "END" ? (r.position.copy(this.worldPosition), r.visible = this.dragging) : r.name === "DELTA" ? (r.position.copy(this.worldPositionStart), r.quaternion.copy(this.worldQuaternionStart), bt.set(1e-10, 1e-10, 1e-10).add(this.worldPositionStart).sub(this.worldPosition).multiplyScalar(-1), bt.applyQuaternion(this.worldQuaternionStart.clone().invert()), r.scale.copy(bt), r.visible = this.dragging) : (r.quaternion.copy(e), this.dragging ? r.position.copy(this.worldPositionStart) : r.position.copy(this.worldPosition), this.axis && (r.visible = this.axis.search(r.name) !== -1));
+        r.visible = !1, r.name === "AXIS" ? (r.visible = !!this.axis, this.axis === "X" && (Ot.setFromEuler(cs.set(0, 0, 0)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "Y" && (Ot.setFromEuler(cs.set(0, 0, Math.PI / 2)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "Z" && (Ot.setFromEuler(cs.set(0, Math.PI / 2, 0)), r.quaternion.copy(e).multiply(Ot), Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) > 0.9 && (r.visible = !1)), this.axis === "XYZE" && (Ot.setFromEuler(cs.set(0, Math.PI / 2, 0)), mt.copy(this.rotationAxis), r.quaternion.setFromRotationMatrix(wr.lookAt(_r, mt, Be)), r.quaternion.multiply(Ot), r.visible = this.dragging), this.axis === "E" && (r.visible = !1)) : r.name === "START" ? (r.position.copy(this.worldPositionStart), r.visible = this.dragging) : r.name === "END" ? (r.position.copy(this.worldPosition), r.visible = this.dragging) : r.name === "DELTA" ? (r.position.copy(this.worldPositionStart), r.quaternion.copy(this.worldQuaternionStart), bt.set(1e-10, 1e-10, 1e-10).add(this.worldPositionStart).sub(this.worldPosition).multiplyScalar(-1), bt.applyQuaternion(this.worldQuaternionStart.clone().invert()), r.scale.copy(bt), r.visible = this.dragging) : (r.quaternion.copy(e), this.dragging ? r.position.copy(this.worldPositionStart) : r.position.copy(this.worldPosition), this.axis && (r.visible = this.axis.search(r.name) !== -1));
         continue;
       }
-      r.quaternion.copy(e), this.mode === "translate" || this.mode === "scale" ? (r.name === "X" && Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "Y" && Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "Z" && Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "XY" && Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "YZ" && Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "XZ" && Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1)) : this.mode === "rotate" && (ls.copy(e), mt.copy(this.eye).applyQuaternion(Ot.copy(e).invert()), r.name.search("E") !== -1 && r.quaternion.setFromRotationMatrix(wr.lookAt(this.eye, Pr, Be)), r.name === "X" && (Ot.setFromAxisAngle(_i, Math.atan2(-mt.y, mt.z)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot)), r.name === "Y" && (Ot.setFromAxisAngle(Be, Math.atan2(mt.x, mt.z)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot)), r.name === "Z" && (Ot.setFromAxisAngle(Pi, Math.atan2(mt.y, mt.x)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot))), r.visible = r.visible && (r.name.indexOf("X") === -1 || this.showX), r.visible = r.visible && (r.name.indexOf("Y") === -1 || this.showY), r.visible = r.visible && (r.name.indexOf("Z") === -1 || this.showZ), r.visible = r.visible && (r.name.indexOf("E") === -1 || this.showX && this.showY && this.showZ), r.material._color = r.material._color || r.material.color.clone(), r.material._opacity = r.material._opacity || r.material.opacity, r.material.color.copy(r.material._color), r.material.opacity = r.material._opacity, this.enabled && this.axis && (r.name === this.axis || this.axis.split("").some(function(a) {
+      r.quaternion.copy(e), this.mode === "translate" || this.mode === "scale" ? (r.name === "X" && Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "Y" && Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "Z" && Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) > 0.99 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "XY" && Math.abs(mt.copy(_i).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "YZ" && Math.abs(mt.copy(Pi).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1), r.name === "XZ" && Math.abs(mt.copy(Be).applyQuaternion(e).dot(this.eye)) < 0.2 && (r.scale.set(1e-10, 1e-10, 1e-10), r.visible = !1)) : this.mode === "rotate" && (ls.copy(e), mt.copy(this.eye).applyQuaternion(Ot.copy(e).invert()), r.name.search("E") !== -1 && r.quaternion.setFromRotationMatrix(wr.lookAt(this.eye, _r, Be)), r.name === "X" && (Ot.setFromAxisAngle(Pi, Math.atan2(-mt.y, mt.z)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot)), r.name === "Y" && (Ot.setFromAxisAngle(Be, Math.atan2(mt.x, mt.z)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot)), r.name === "Z" && (Ot.setFromAxisAngle(_i, Math.atan2(mt.y, mt.x)), Ot.multiplyQuaternions(ls, Ot), r.quaternion.copy(Ot))), r.visible = r.visible && (r.name.indexOf("X") === -1 || this.showX), r.visible = r.visible && (r.name.indexOf("Y") === -1 || this.showY), r.visible = r.visible && (r.name.indexOf("Z") === -1 || this.showZ), r.visible = r.visible && (r.name.indexOf("E") === -1 || this.showX && this.showY && this.showZ), r.material._color = r.material._color || r.material.color.clone(), r.material._opacity = r.material._opacity || r.material.opacity, r.material.color.copy(r.material._color), r.material.opacity = r.material._opacity, this.enabled && this.axis && (r.name === this.axis || this.axis.split("").some(function(a) {
         return r.name === a;
       })) && (r.material.color.setHex(16776960), r.material.opacity = 1);
     }
@@ -6861,7 +6861,7 @@ class Fc extends rt {
   }
   updateMatrixWorld(i) {
     let t = this.space;
-    switch (this.position.copy(this.worldPosition), this.mode === "scale" && (t = "local"), hs.copy(_i).applyQuaternion(t === "local" ? this.worldQuaternion : Es), Oi.copy(Be).applyQuaternion(t === "local" ? this.worldQuaternion : Es), Ni.copy(Pi).applyQuaternion(t === "local" ? this.worldQuaternion : Es), mt.copy(Oi), this.mode) {
+    switch (this.position.copy(this.worldPosition), this.mode === "scale" && (t = "local"), hs.copy(Pi).applyQuaternion(t === "local" ? this.worldQuaternion : Es), Oi.copy(Be).applyQuaternion(t === "local" ? this.worldQuaternion : Es), Ni.copy(_i).applyQuaternion(t === "local" ? this.worldQuaternion : Es), mt.copy(Oi), this.mode) {
       case "translate":
       case "scale":
         switch (this.axis) {
@@ -7531,7 +7531,7 @@ class Lc {
     i.position.copy(t.position), i.quaternion.copy(t.quaternion), this._component.controls.mouseButtons.wheel = vt.ACTION.DOLLY, this.matchOrthoDistanceEnabled ? this._component.controls.distance = this.getDistance() : this._component.controls.distance = this._previousDistance, await this._component.controls.zoomTo(1), i.updateProjectionMatrix(), this._component.controls.camera = i, this.camera = i, this.current = "Perspective";
   }
 }
-class _c extends xi {
+class Pc extends xi {
   constructor(t) {
     super(t);
     /**
@@ -7752,7 +7752,7 @@ const Dr = /* @__PURE__ */ new Map([
       forRelating: "DocumentRefForObjects"
     }
   ]
-]), Pc = {
+]), _c = {
   103090709: "IFCPROJECT",
   4097777520: "IFCSITE",
   4031249490: "IFCBUILDING",
@@ -7893,7 +7893,7 @@ const Dr = /* @__PURE__ */ new Map([
 };
 class gh {
   getAll(i, t) {
-    const e = {}, s = Object.keys(Pc).map((n) => parseInt(n, 10));
+    const e = {}, s = Object.keys(_c).map((n) => parseInt(n, 10));
     for (let n = 0; n < s.length; n++) {
       const r = s[n], o = i.GetLineIDsWithType(t, r), a = o.size();
       for (let l = 0; l < a; l++)
@@ -11292,7 +11292,7 @@ const Dc = {
    * @deprecated Use indexer.addEntitiesRelation instead. This will be removed in future releases.
    */
   addElementToPset(t, e, ...s) {
-    this.components.get(kt).addEntitiesRelation(
+    this.components.get(Gt).addEntitiesRelation(
       t,
       e,
       { type: z.IFCRELDEFINESBYPROPERTIES, inv: "IsDefinedBy" },
@@ -11365,7 +11365,7 @@ const Dc = {
    */
   async saveToIfc(t, e) {
     const s = this.components.get(Nn), n = s.webIfc, r = await s.readIfcFile(e);
-    await this.components.get(kt).applyRelationChanges();
+    await this.components.get(Gt).applyRelationChanges();
     const a = this.changeMap[t.uuid] ?? [];
     for (const h of a) {
       const f = await t.getProperties(h);
@@ -11959,8 +11959,8 @@ const vi = class vi extends At {
  * This UUID is used to register the component within the Components system.
  */
 C(vi, "uuid", "23a889ab-83b3-44a4-8bee-ead83438370b");
-let kt = vi;
-const _s = class _s extends At {
+let Gt = vi;
+const Ps = class Ps extends At {
   constructor(t) {
     super(t);
     /** {@link Disposable.onDisposed} */
@@ -11988,7 +11988,7 @@ const _s = class _s extends At {
     /** {@link Component.enabled} */
     C(this, "enabled", !0);
     C(this, "_loader", new Do());
-    this.components.add(_s.uuid, this);
+    this.components.add(Ps.uuid, this);
   }
   /**
    * Getter for the meshes of all fragments in the FragmentsManager.
@@ -12037,7 +12037,7 @@ const _s = class _s extends At {
     e && (h.isStreamed = e.isStreamed || !1), o && (h.name = o);
     for (const f of h.items)
       f.group = h, this.list.set(f.id, f);
-    return r && this.coordinate([h]), this.groups.set(h.uuid, h), a && h.setLocalProperties(a), l && this.components.get(kt).setRelationMap(h, l), this.onFragmentsLoaded.trigger(h), h;
+    return r && this.coordinate([h]), this.groups.set(h.uuid, h), a && h.setLocalProperties(a), l && this.components.get(Gt).setRelationMap(h, l), this.onFragmentsLoaded.trigger(h), h;
   }
   /**
    * Export the specified fragmentsgroup to binary data.
@@ -12184,8 +12184,8 @@ const _s = class _s extends At {
  * A unique identifier for the component.
  * This UUID is used to register the component within the Components system.
  */
-C(_s, "uuid", "fef46874-46a3-461b-8c44-2922ab77c806");
-let Tt = _s;
+C(Ps, "uuid", "fef46874-46a3-461b-8c44-2922ab77c806");
+let Tt = Ps;
 var us = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
 function vc(c) {
   return c && c.__esModule && Object.prototype.hasOwnProperty.call(c, "default") ? c.default : c;
@@ -13732,42 +13732,42 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         A.pending_buf[A.pending++] = X >>> 8 & 255, A.pending_buf[A.pending++] = 255 & X;
       }
       function tt(A, X) {
-        var k, P, _ = A.max_chain_length, U = A.strstart, $ = A.prev_length, Z = A.nice_match, B = A.strstart > A.w_size - Y ? A.strstart - (A.w_size - Y) : 0, K = A.window, st = A.w_mask, J = A.prev, ct = A.strstart + b, Rt = K[U + $ - 1], dt = K[U + $];
-        A.prev_length >= A.good_match && (_ >>= 2), Z > A.lookahead && (Z = A.lookahead);
+        var k, _, P = A.max_chain_length, U = A.strstart, $ = A.prev_length, Z = A.nice_match, B = A.strstart > A.w_size - Y ? A.strstart - (A.w_size - Y) : 0, K = A.window, st = A.w_mask, J = A.prev, ct = A.strstart + b, Rt = K[U + $ - 1], dt = K[U + $];
+        A.prev_length >= A.good_match && (P >>= 2), Z > A.lookahead && (Z = A.lookahead);
         do
           if (K[(k = X) + $] === dt && K[k + $ - 1] === Rt && K[k] === K[U] && K[++k] === K[U + 1]) {
             U += 2, k++;
             do
               ;
             while (K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && K[++U] === K[++k] && U < ct);
-            if (P = b - (ct - U), U = ct - b, $ < P) {
-              if (A.match_start = X, Z <= ($ = P))
+            if (_ = b - (ct - U), U = ct - b, $ < _) {
+              if (A.match_start = X, Z <= ($ = _))
                 break;
               Rt = K[U + $ - 1], dt = K[U + $];
             }
           }
-        while ((X = J[X & st]) > B && --_ != 0);
+        while ((X = J[X & st]) > B && --P != 0);
         return $ <= A.lookahead ? $ : A.lookahead;
       }
       function St(A) {
-        var X, k, P, _, U, $, Z, B, K, st, J = A.w_size;
+        var X, k, _, P, U, $, Z, B, K, st, J = A.w_size;
         do {
-          if (_ = A.window_size - A.lookahead - A.strstart, A.strstart >= J + (J - Y)) {
-            for (r.arraySet(A.window, A.window, J, J, 0), A.match_start -= J, A.strstart -= J, A.block_start -= J, X = k = A.hash_size; P = A.head[--X], A.head[X] = J <= P ? P - J : 0, --k; )
+          if (P = A.window_size - A.lookahead - A.strstart, A.strstart >= J + (J - Y)) {
+            for (r.arraySet(A.window, A.window, J, J, 0), A.match_start -= J, A.strstart -= J, A.block_start -= J, X = k = A.hash_size; _ = A.head[--X], A.head[X] = J <= _ ? _ - J : 0, --k; )
               ;
-            for (X = k = J; P = A.prev[--X], A.prev[X] = J <= P ? P - J : 0, --k; )
+            for (X = k = J; _ = A.prev[--X], A.prev[X] = J <= _ ? _ - J : 0, --k; )
               ;
-            _ += J;
+            P += J;
           }
           if (A.strm.avail_in === 0)
             break;
-          if ($ = A.strm, Z = A.window, B = A.strstart + A.lookahead, K = _, st = void 0, st = $.avail_in, K < st && (st = K), k = st === 0 ? 0 : ($.avail_in -= st, r.arraySet(Z, $.input, $.next_in, st, B), $.state.wrap === 1 ? $.adler = a($.adler, Z, st, B) : $.state.wrap === 2 && ($.adler = l($.adler, Z, st, B)), $.next_in += st, $.total_in += st, st), A.lookahead += k, A.lookahead + A.insert >= L)
+          if ($ = A.strm, Z = A.window, B = A.strstart + A.lookahead, K = P, st = void 0, st = $.avail_in, K < st && (st = K), k = st === 0 ? 0 : ($.avail_in -= st, r.arraySet(Z, $.input, $.next_in, st, B), $.state.wrap === 1 ? $.adler = a($.adler, Z, st, B) : $.state.wrap === 2 && ($.adler = l($.adler, Z, st, B)), $.next_in += st, $.total_in += st, st), A.lookahead += k, A.lookahead + A.insert >= L)
             for (U = A.strstart - A.insert, A.ins_h = A.window[U], A.ins_h = (A.ins_h << A.hash_shift ^ A.window[U + 1]) & A.hash_mask; A.insert && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[U + L - 1]) & A.hash_mask, A.prev[U & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = U, U++, A.insert--, !(A.lookahead + A.insert < L)); )
               ;
         } while (A.lookahead < Y && A.strm.avail_in !== 0);
       }
       function yt(A, X) {
-        for (var k, P; ; ) {
+        for (var k, _; ; ) {
           if (A.lookahead < Y) {
             if (St(A), A.lookahead < Y && X === f)
               return g;
@@ -13775,21 +13775,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               break;
           }
           if (k = 0, A.lookahead >= L && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, k = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart), k !== 0 && A.strstart - k <= A.w_size - Y && (A.match_length = tt(A, k)), A.match_length >= L)
-            if (P = o._tr_tally(A, A.strstart - A.match_start, A.match_length - L), A.lookahead -= A.match_length, A.match_length <= A.max_lazy_match && A.lookahead >= L) {
+            if (_ = o._tr_tally(A, A.strstart - A.match_start, A.match_length - L), A.lookahead -= A.match_length, A.match_length <= A.max_lazy_match && A.lookahead >= L) {
               for (A.match_length--; A.strstart++, A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, k = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart, --A.match_length != 0; )
                 ;
               A.strstart++;
             } else
               A.strstart += A.match_length, A.match_length = 0, A.ins_h = A.window[A.strstart], A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + 1]) & A.hash_mask;
           else
-            P = o._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++;
-          if (P && (x(A, !1), A.strm.avail_out === 0))
+            _ = o._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++;
+          if (_ && (x(A, !1), A.strm.avail_out === 0))
             return g;
         }
         return A.insert = A.strstart < L - 1 ? A.strstart : L - 1, X === I ? (x(A, !0), A.strm.avail_out === 0 ? q : G) : A.last_lit && (x(A, !1), A.strm.avail_out === 0) ? g : v;
       }
       function at(A, X) {
-        for (var k, P, _; ; ) {
+        for (var k, _, P; ; ) {
           if (A.lookahead < Y) {
             if (St(A), A.lookahead < Y && X === f)
               return g;
@@ -13797,20 +13797,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               break;
           }
           if (k = 0, A.lookahead >= L && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, k = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart), A.prev_length = A.match_length, A.prev_match = A.match_start, A.match_length = L - 1, k !== 0 && A.prev_length < A.max_lazy_match && A.strstart - k <= A.w_size - Y && (A.match_length = tt(A, k), A.match_length <= 5 && (A.strategy === 1 || A.match_length === L && 4096 < A.strstart - A.match_start) && (A.match_length = L - 1)), A.prev_length >= L && A.match_length <= A.prev_length) {
-            for (_ = A.strstart + A.lookahead - L, P = o._tr_tally(A, A.strstart - 1 - A.prev_match, A.prev_length - L), A.lookahead -= A.prev_length - 1, A.prev_length -= 2; ++A.strstart <= _ && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, k = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart), --A.prev_length != 0; )
+            for (P = A.strstart + A.lookahead - L, _ = o._tr_tally(A, A.strstart - 1 - A.prev_match, A.prev_length - L), A.lookahead -= A.prev_length - 1, A.prev_length -= 2; ++A.strstart <= P && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, k = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart), --A.prev_length != 0; )
               ;
-            if (A.match_available = 0, A.match_length = L - 1, A.strstart++, P && (x(A, !1), A.strm.avail_out === 0))
+            if (A.match_available = 0, A.match_length = L - 1, A.strstart++, _ && (x(A, !1), A.strm.avail_out === 0))
               return g;
           } else if (A.match_available) {
-            if ((P = o._tr_tally(A, 0, A.window[A.strstart - 1])) && x(A, !1), A.strstart++, A.lookahead--, A.strm.avail_out === 0)
+            if ((_ = o._tr_tally(A, 0, A.window[A.strstart - 1])) && x(A, !1), A.strstart++, A.lookahead--, A.strm.avail_out === 0)
               return g;
           } else
             A.match_available = 1, A.strstart++, A.lookahead--;
         }
-        return A.match_available && (P = o._tr_tally(A, 0, A.window[A.strstart - 1]), A.match_available = 0), A.insert = A.strstart < L - 1 ? A.strstart : L - 1, X === I ? (x(A, !0), A.strm.avail_out === 0 ? q : G) : A.last_lit && (x(A, !1), A.strm.avail_out === 0) ? g : v;
+        return A.match_available && (_ = o._tr_tally(A, 0, A.window[A.strstart - 1]), A.match_available = 0), A.insert = A.strstart < L - 1 ? A.strstart : L - 1, X === I ? (x(A, !0), A.strm.avail_out === 0 ? q : G) : A.last_lit && (x(A, !1), A.strm.avail_out === 0) ? g : v;
       }
-      function It(A, X, k, P, _) {
-        this.good_length = A, this.max_lazy = X, this.nice_length = k, this.max_chain = P, this.func = _;
+      function It(A, X, k, _, P) {
+        this.good_length = A, this.max_lazy = X, this.nice_length = k, this.max_chain = _, this.func = P;
       }
       function ft() {
         this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = m, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new r.Buf16(2 * y), this.dyn_dtree = new r.Buf16(2 * (2 * S + 1)), this.bl_tree = new r.Buf16(2 * (2 * O + 1)), nt(this.dyn_ltree), nt(this.dyn_dtree), nt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new r.Buf16(w + 1), this.heap = new r.Buf16(2 * R + 1), nt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new r.Buf16(2 * R + 1), nt(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
@@ -13825,15 +13825,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           k.window_size = 2 * k.w_size, nt(k.head), k.max_lazy_match = n[k.level].max_lazy, k.good_match = n[k.level].good_length, k.nice_match = n[k.level].nice_length, k.max_chain_length = n[k.level].max_chain, k.strstart = 0, k.block_start = 0, k.lookahead = 0, k.insert = 0, k.match_length = k.prev_length = L - 1, k.match_available = 0, k.ins_h = 0;
         }(A.state), X;
       }
-      function Dt(A, X, k, P, _, U) {
+      function Dt(A, X, k, _, P, U) {
         if (!A)
           return d;
         var $ = 1;
-        if (X === E && (X = 6), P < 0 ? ($ = 0, P = -P) : 15 < P && ($ = 2, P -= 16), _ < 1 || F < _ || k !== m || P < 8 || 15 < P || X < 0 || 9 < X || U < 0 || T < U)
+        if (X === E && (X = 6), _ < 0 ? ($ = 0, _ = -_) : 15 < _ && ($ = 2, _ -= 16), P < 1 || F < P || k !== m || _ < 8 || 15 < _ || X < 0 || 9 < X || U < 0 || T < U)
           return et(A, d);
-        P === 8 && (P = 9);
+        _ === 8 && (_ = 9);
         var Z = new ft();
-        return (A.state = Z).strm = A, Z.wrap = $, Z.gzhead = null, Z.w_bits = P, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = _ + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + L - 1) / L), Z.window = new r.Buf8(2 * Z.w_size), Z.head = new r.Buf16(Z.hash_size), Z.prev = new r.Buf16(Z.w_size), Z.lit_bufsize = 1 << _ + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new r.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = X, Z.strategy = U, Z.method = k, Ht(A);
+        return (A.state = Z).strm = A, Z.wrap = $, Z.gzhead = null, Z.w_bits = _, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = P + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + L - 1) / L), Z.window = new r.Buf8(2 * Z.w_size), Z.head = new r.Buf16(Z.hash_size), Z.prev = new r.Buf16(Z.w_size), Z.lit_bufsize = 1 << P + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new r.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = X, Z.strategy = U, Z.method = k, Ht(A);
       }
       n = [new It(0, 0, 0, 0, function(A, X) {
         var k = 65535;
@@ -13845,8 +13845,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               break;
           }
           A.strstart += A.lookahead, A.lookahead = 0;
-          var P = A.block_start + k;
-          if ((A.strstart === 0 || A.strstart >= P) && (A.lookahead = A.strstart - P, A.strstart = P, x(A, !1), A.strm.avail_out === 0) || A.strstart - A.block_start >= A.w_size - Y && (x(A, !1), A.strm.avail_out === 0))
+          var _ = A.block_start + k;
+          if ((A.strstart === 0 || A.strstart >= _) && (A.lookahead = A.strstart - _, A.strstart = _, x(A, !1), A.strm.avail_out === 0) || A.strstart - A.block_start >= A.w_size - Y && (x(A, !1), A.strm.avail_out === 0))
             return g;
         }
         return A.insert = 0, X === I ? (x(A, !0), A.strm.avail_out === 0 ? q : G) : (A.strstart > A.block_start && (x(A, !1), A.strm.avail_out), g);
@@ -13855,60 +13855,60 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }, s.deflateInit2 = Dt, s.deflateReset = Ht, s.deflateResetKeep = Ct, s.deflateSetHeader = function(A, X) {
         return A && A.state ? A.state.wrap !== 2 ? d : (A.state.gzhead = X, u) : d;
       }, s.deflate = function(A, X) {
-        var k, P, _, U;
+        var k, _, P, U;
         if (!A || !A.state || 5 < X || X < 0)
           return A ? et(A, d) : d;
-        if (P = A.state, !A.output || !A.input && A.avail_in !== 0 || P.status === 666 && X !== I)
+        if (_ = A.state, !A.output || !A.input && A.avail_in !== 0 || _.status === 666 && X !== I)
           return et(A, A.avail_out === 0 ? -5 : d);
-        if (P.strm = A, k = P.last_flush, P.last_flush = X, P.status === N)
-          if (P.wrap === 2)
-            A.adler = 0, ot(P, 31), ot(P, 139), ot(P, 8), P.gzhead ? (ot(P, (P.gzhead.text ? 1 : 0) + (P.gzhead.hcrc ? 2 : 0) + (P.gzhead.extra ? 4 : 0) + (P.gzhead.name ? 8 : 0) + (P.gzhead.comment ? 16 : 0)), ot(P, 255 & P.gzhead.time), ot(P, P.gzhead.time >> 8 & 255), ot(P, P.gzhead.time >> 16 & 255), ot(P, P.gzhead.time >> 24 & 255), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 255 & P.gzhead.os), P.gzhead.extra && P.gzhead.extra.length && (ot(P, 255 & P.gzhead.extra.length), ot(P, P.gzhead.extra.length >> 8 & 255)), P.gzhead.hcrc && (A.adler = l(A.adler, P.pending_buf, P.pending, 0)), P.gzindex = 0, P.status = 69) : (ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 3), P.status = M);
+        if (_.strm = A, k = _.last_flush, _.last_flush = X, _.status === N)
+          if (_.wrap === 2)
+            A.adler = 0, ot(_, 31), ot(_, 139), ot(_, 8), _.gzhead ? (ot(_, (_.gzhead.text ? 1 : 0) + (_.gzhead.hcrc ? 2 : 0) + (_.gzhead.extra ? 4 : 0) + (_.gzhead.name ? 8 : 0) + (_.gzhead.comment ? 16 : 0)), ot(_, 255 & _.gzhead.time), ot(_, _.gzhead.time >> 8 & 255), ot(_, _.gzhead.time >> 16 & 255), ot(_, _.gzhead.time >> 24 & 255), ot(_, _.level === 9 ? 2 : 2 <= _.strategy || _.level < 2 ? 4 : 0), ot(_, 255 & _.gzhead.os), _.gzhead.extra && _.gzhead.extra.length && (ot(_, 255 & _.gzhead.extra.length), ot(_, _.gzhead.extra.length >> 8 & 255)), _.gzhead.hcrc && (A.adler = l(A.adler, _.pending_buf, _.pending, 0)), _.gzindex = 0, _.status = 69) : (ot(_, 0), ot(_, 0), ot(_, 0), ot(_, 0), ot(_, 0), ot(_, _.level === 9 ? 2 : 2 <= _.strategy || _.level < 2 ? 4 : 0), ot(_, 3), _.status = M);
           else {
-            var $ = m + (P.w_bits - 8 << 4) << 8;
-            $ |= (2 <= P.strategy || P.level < 2 ? 0 : P.level < 6 ? 1 : P.level === 6 ? 2 : 3) << 6, P.strstart !== 0 && ($ |= 32), $ += 31 - $ % 31, P.status = M, it(P, $), P.strstart !== 0 && (it(P, A.adler >>> 16), it(P, 65535 & A.adler)), A.adler = 1;
+            var $ = m + (_.w_bits - 8 << 4) << 8;
+            $ |= (2 <= _.strategy || _.level < 2 ? 0 : _.level < 6 ? 1 : _.level === 6 ? 2 : 3) << 6, _.strstart !== 0 && ($ |= 32), $ += 31 - $ % 31, _.status = M, it(_, $), _.strstart !== 0 && (it(_, A.adler >>> 16), it(_, 65535 & A.adler)), A.adler = 1;
           }
-        if (P.status === 69)
-          if (P.gzhead.extra) {
-            for (_ = P.pending; P.gzindex < (65535 & P.gzhead.extra.length) && (P.pending !== P.pending_buf_size || (P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), V(A), _ = P.pending, P.pending !== P.pending_buf_size)); )
-              ot(P, 255 & P.gzhead.extra[P.gzindex]), P.gzindex++;
-            P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), P.gzindex === P.gzhead.extra.length && (P.gzindex = 0, P.status = 73);
+        if (_.status === 69)
+          if (_.gzhead.extra) {
+            for (P = _.pending; _.gzindex < (65535 & _.gzhead.extra.length) && (_.pending !== _.pending_buf_size || (_.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), V(A), P = _.pending, _.pending !== _.pending_buf_size)); )
+              ot(_, 255 & _.gzhead.extra[_.gzindex]), _.gzindex++;
+            _.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), _.gzindex === _.gzhead.extra.length && (_.gzindex = 0, _.status = 73);
           } else
-            P.status = 73;
-        if (P.status === 73)
-          if (P.gzhead.name) {
-            _ = P.pending;
+            _.status = 73;
+        if (_.status === 73)
+          if (_.gzhead.name) {
+            P = _.pending;
             do {
-              if (P.pending === P.pending_buf_size && (P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), V(A), _ = P.pending, P.pending === P.pending_buf_size)) {
+              if (_.pending === _.pending_buf_size && (_.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), V(A), P = _.pending, _.pending === _.pending_buf_size)) {
                 U = 1;
                 break;
               }
-              U = P.gzindex < P.gzhead.name.length ? 255 & P.gzhead.name.charCodeAt(P.gzindex++) : 0, ot(P, U);
+              U = _.gzindex < _.gzhead.name.length ? 255 & _.gzhead.name.charCodeAt(_.gzindex++) : 0, ot(_, U);
             } while (U !== 0);
-            P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), U === 0 && (P.gzindex = 0, P.status = 91);
+            _.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), U === 0 && (_.gzindex = 0, _.status = 91);
           } else
-            P.status = 91;
-        if (P.status === 91)
-          if (P.gzhead.comment) {
-            _ = P.pending;
+            _.status = 91;
+        if (_.status === 91)
+          if (_.gzhead.comment) {
+            P = _.pending;
             do {
-              if (P.pending === P.pending_buf_size && (P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), V(A), _ = P.pending, P.pending === P.pending_buf_size)) {
+              if (_.pending === _.pending_buf_size && (_.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), V(A), P = _.pending, _.pending === _.pending_buf_size)) {
                 U = 1;
                 break;
               }
-              U = P.gzindex < P.gzhead.comment.length ? 255 & P.gzhead.comment.charCodeAt(P.gzindex++) : 0, ot(P, U);
+              U = _.gzindex < _.gzhead.comment.length ? 255 & _.gzhead.comment.charCodeAt(_.gzindex++) : 0, ot(_, U);
             } while (U !== 0);
-            P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), U === 0 && (P.status = 103);
+            _.gzhead.hcrc && _.pending > P && (A.adler = l(A.adler, _.pending_buf, _.pending - P, P)), U === 0 && (_.status = 103);
           } else
-            P.status = 103;
-        if (P.status === 103 && (P.gzhead.hcrc ? (P.pending + 2 > P.pending_buf_size && V(A), P.pending + 2 <= P.pending_buf_size && (ot(P, 255 & A.adler), ot(P, A.adler >> 8 & 255), A.adler = 0, P.status = M)) : P.status = M), P.pending !== 0) {
+            _.status = 103;
+        if (_.status === 103 && (_.gzhead.hcrc ? (_.pending + 2 > _.pending_buf_size && V(A), _.pending + 2 <= _.pending_buf_size && (ot(_, 255 & A.adler), ot(_, A.adler >> 8 & 255), A.adler = 0, _.status = M)) : _.status = M), _.pending !== 0) {
           if (V(A), A.avail_out === 0)
-            return P.last_flush = -1, u;
+            return _.last_flush = -1, u;
         } else if (A.avail_in === 0 && W(X) <= W(k) && X !== I)
           return et(A, -5);
-        if (P.status === 666 && A.avail_in !== 0)
+        if (_.status === 666 && A.avail_in !== 0)
           return et(A, -5);
-        if (A.avail_in !== 0 || P.lookahead !== 0 || X !== f && P.status !== 666) {
-          var Z = P.strategy === 2 ? function(B, K) {
+        if (A.avail_in !== 0 || _.lookahead !== 0 || X !== f && _.status !== 666) {
+          var Z = _.strategy === 2 ? function(B, K) {
             for (var st; ; ) {
               if (B.lookahead === 0 && (St(B), B.lookahead === 0)) {
                 if (K === f)
@@ -13919,7 +13919,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 return g;
             }
             return B.insert = 0, K === I ? (x(B, !0), B.strm.avail_out === 0 ? q : G) : B.last_lit && (x(B, !1), B.strm.avail_out === 0) ? g : v;
-          }(P, X) : P.strategy === 3 ? function(B, K) {
+          }(_, X) : _.strategy === 3 ? function(B, K) {
             for (var st, J, ct, Rt, dt = B.window; ; ) {
               if (B.lookahead <= b) {
                 if (St(B), B.lookahead <= b && K === f)
@@ -13938,24 +13938,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 return g;
             }
             return B.insert = 0, K === I ? (x(B, !0), B.strm.avail_out === 0 ? q : G) : B.last_lit && (x(B, !1), B.strm.avail_out === 0) ? g : v;
-          }(P, X) : n[P.level].func(P, X);
-          if (Z !== q && Z !== G || (P.status = 666), Z === g || Z === q)
-            return A.avail_out === 0 && (P.last_flush = -1), u;
-          if (Z === v && (X === 1 ? o._tr_align(P) : X !== 5 && (o._tr_stored_block(P, 0, 0, !1), X === 3 && (nt(P.head), P.lookahead === 0 && (P.strstart = 0, P.block_start = 0, P.insert = 0))), V(A), A.avail_out === 0))
-            return P.last_flush = -1, u;
+          }(_, X) : n[_.level].func(_, X);
+          if (Z !== q && Z !== G || (_.status = 666), Z === g || Z === q)
+            return A.avail_out === 0 && (_.last_flush = -1), u;
+          if (Z === v && (X === 1 ? o._tr_align(_) : X !== 5 && (o._tr_stored_block(_, 0, 0, !1), X === 3 && (nt(_.head), _.lookahead === 0 && (_.strstart = 0, _.block_start = 0, _.insert = 0))), V(A), A.avail_out === 0))
+            return _.last_flush = -1, u;
         }
-        return X !== I ? u : P.wrap <= 0 ? 1 : (P.wrap === 2 ? (ot(P, 255 & A.adler), ot(P, A.adler >> 8 & 255), ot(P, A.adler >> 16 & 255), ot(P, A.adler >> 24 & 255), ot(P, 255 & A.total_in), ot(P, A.total_in >> 8 & 255), ot(P, A.total_in >> 16 & 255), ot(P, A.total_in >> 24 & 255)) : (it(P, A.adler >>> 16), it(P, 65535 & A.adler)), V(A), 0 < P.wrap && (P.wrap = -P.wrap), P.pending !== 0 ? u : 1);
+        return X !== I ? u : _.wrap <= 0 ? 1 : (_.wrap === 2 ? (ot(_, 255 & A.adler), ot(_, A.adler >> 8 & 255), ot(_, A.adler >> 16 & 255), ot(_, A.adler >> 24 & 255), ot(_, 255 & A.total_in), ot(_, A.total_in >> 8 & 255), ot(_, A.total_in >> 16 & 255), ot(_, A.total_in >> 24 & 255)) : (it(_, A.adler >>> 16), it(_, 65535 & A.adler)), V(A), 0 < _.wrap && (_.wrap = -_.wrap), _.pending !== 0 ? u : 1);
       }, s.deflateEnd = function(A) {
         var X;
         return A && A.state ? (X = A.state.status) !== N && X !== 69 && X !== 73 && X !== 91 && X !== 103 && X !== M && X !== 666 ? et(A, d) : (A.state = null, X === M ? et(A, -3) : u) : d;
       }, s.deflateSetDictionary = function(A, X) {
-        var k, P, _, U, $, Z, B, K, st = X.length;
+        var k, _, P, U, $, Z, B, K, st = X.length;
         if (!A || !A.state || (U = (k = A.state).wrap) === 2 || U === 1 && k.status !== N || k.lookahead)
           return d;
         for (U === 1 && (A.adler = a(A.adler, X, st, 0)), k.wrap = 0, st >= k.w_size && (U === 0 && (nt(k.head), k.strstart = 0, k.block_start = 0, k.insert = 0), K = new r.Buf8(k.w_size), r.arraySet(K, X, st - k.w_size, k.w_size, 0), X = K, st = k.w_size), $ = A.avail_in, Z = A.next_in, B = A.input, A.avail_in = st, A.next_in = 0, A.input = X, St(k); k.lookahead >= L; ) {
-          for (P = k.strstart, _ = k.lookahead - (L - 1); k.ins_h = (k.ins_h << k.hash_shift ^ k.window[P + L - 1]) & k.hash_mask, k.prev[P & k.w_mask] = k.head[k.ins_h], k.head[k.ins_h] = P, P++, --_; )
+          for (_ = k.strstart, P = k.lookahead - (L - 1); k.ins_h = (k.ins_h << k.hash_shift ^ k.window[_ + L - 1]) & k.hash_mask, k.prev[_ & k.w_mask] = k.head[k.ins_h], k.head[k.ins_h] = _, _++, --P; )
             ;
-          k.strstart = P, k.lookahead = L - 1, St(k);
+          k.strstart = _, k.lookahead = L - 1, St(k);
         }
         return k.strstart += k.lookahead, k.block_start = k.strstart, k.insert = k.lookahead, k.lookahead = 0, k.match_length = k.prev_length = L - 1, k.match_available = 0, A.next_in = Z, A.input = B, A.avail_in = $, k.wrap = U, u;
       }, s.deflateInfo = "pako deflate (from Nodeca project)";
@@ -14093,7 +14093,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       s.inflateReset = R, s.inflateReset2 = S, s.inflateResetKeep = F, s.inflateInit = function(N) {
         return O(N, 15);
       }, s.inflateInit2 = O, s.inflate = function(N, M) {
-        var g, v, q, G, et, W, nt, V, x, ot, it, tt, St, yt, at, It, ft, Ct, Ht, Dt, A, X, k, P, _ = 0, U = new n.Buf8(4), $ = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        var g, v, q, G, et, W, nt, V, x, ot, it, tt, St, yt, at, It, ft, Ct, Ht, Dt, A, X, k, _, P = 0, U = new n.Buf8(4), $ = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!N || !N.state || !N.output || !N.input && N.avail_in !== 0)
           return u;
         (g = N.state).mode === 12 && (g.mode = 13), et = N.next_out, q = N.output, nt = N.avail_out, G = N.next_in, v = N.input, W = N.avail_in, V = g.hold, x = g.bits, ot = W, it = nt, X = I;
@@ -14304,7 +14304,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 g.have = 0, g.mode = 19;
               case 19:
                 for (; g.have < g.nlen + g.ndist; ) {
-                  for (; It = (_ = g.lencode[V & (1 << g.lenbits) - 1]) >>> 16 & 255, ft = 65535 & _, !((at = _ >>> 24) <= x); ) {
+                  for (; It = (P = g.lencode[V & (1 << g.lenbits) - 1]) >>> 16 & 255, ft = 65535 & P, !((at = P >>> 24) <= x); ) {
                     if (W === 0)
                       break t;
                     W--, V += v[G++] << x, x += 8;
@@ -14313,7 +14313,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     V >>>= at, x -= at, g.lens[g.have++] = ft;
                   else {
                     if (ft === 16) {
-                      for (P = at + 2; x < P; ) {
+                      for (_ = at + 2; x < _; ) {
                         if (W === 0)
                           break t;
                         W--, V += v[G++] << x, x += 8;
@@ -14324,14 +14324,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                       }
                       A = g.lens[g.have - 1], tt = 3 + (3 & V), V >>>= 2, x -= 2;
                     } else if (ft === 17) {
-                      for (P = at + 3; x < P; ) {
+                      for (_ = at + 3; x < _; ) {
                         if (W === 0)
                           break t;
                         W--, V += v[G++] << x, x += 8;
                       }
                       x -= at, A = 0, tt = 3 + (7 & (V >>>= at)), V >>>= 3, x -= 3;
                     } else {
-                      for (P = at + 7; x < P; ) {
+                      for (_ = at + 7; x < _; ) {
                         if (W === 0)
                           break t;
                         W--, V += v[G++] << x, x += 8;
@@ -14369,13 +14369,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   N.next_out = et, N.avail_out = nt, N.next_in = G, N.avail_in = W, g.hold = V, g.bits = x, a(N, it), et = N.next_out, q = N.output, nt = N.avail_out, G = N.next_in, v = N.input, W = N.avail_in, V = g.hold, x = g.bits, g.mode === 12 && (g.back = -1);
                   break;
                 }
-                for (g.back = 0; It = (_ = g.lencode[V & (1 << g.lenbits) - 1]) >>> 16 & 255, ft = 65535 & _, !((at = _ >>> 24) <= x); ) {
+                for (g.back = 0; It = (P = g.lencode[V & (1 << g.lenbits) - 1]) >>> 16 & 255, ft = 65535 & P, !((at = P >>> 24) <= x); ) {
                   if (W === 0)
                     break t;
                   W--, V += v[G++] << x, x += 8;
                 }
                 if (It && !(240 & It)) {
-                  for (Ct = at, Ht = It, Dt = ft; It = (_ = g.lencode[Dt + ((V & (1 << Ct + Ht) - 1) >> Ct)]) >>> 16 & 255, ft = 65535 & _, !(Ct + (at = _ >>> 24) <= x); ) {
+                  for (Ct = at, Ht = It, Dt = ft; It = (P = g.lencode[Dt + ((V & (1 << Ct + Ht) - 1) >> Ct)]) >>> 16 & 255, ft = 65535 & P, !(Ct + (at = P >>> 24) <= x); ) {
                     if (W === 0)
                       break t;
                     W--, V += v[G++] << x, x += 8;
@@ -14397,7 +14397,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 g.extra = 15 & It, g.mode = 22;
               case 22:
                 if (g.extra) {
-                  for (P = g.extra; x < P; ) {
+                  for (_ = g.extra; x < _; ) {
                     if (W === 0)
                       break t;
                     W--, V += v[G++] << x, x += 8;
@@ -14406,13 +14406,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 }
                 g.was = g.length, g.mode = 23;
               case 23:
-                for (; It = (_ = g.distcode[V & (1 << g.distbits) - 1]) >>> 16 & 255, ft = 65535 & _, !((at = _ >>> 24) <= x); ) {
+                for (; It = (P = g.distcode[V & (1 << g.distbits) - 1]) >>> 16 & 255, ft = 65535 & P, !((at = P >>> 24) <= x); ) {
                   if (W === 0)
                     break t;
                   W--, V += v[G++] << x, x += 8;
                 }
                 if (!(240 & It)) {
-                  for (Ct = at, Ht = It, Dt = ft; It = (_ = g.distcode[Dt + ((V & (1 << Ct + Ht) - 1) >> Ct)]) >>> 16 & 255, ft = 65535 & _, !(Ct + (at = _ >>> 24) <= x); ) {
+                  for (Ct = at, Ht = It, Dt = ft; It = (P = g.distcode[Dt + ((V & (1 << Ct + Ht) - 1) >> Ct)]) >>> 16 & 255, ft = 65535 & P, !(Ct + (at = P >>> 24) <= x); ) {
                     if (W === 0)
                       break t;
                     W--, V += v[G++] << x, x += 8;
@@ -14426,7 +14426,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 g.offset = ft, g.extra = 15 & It, g.mode = 24;
               case 24:
                 if (g.extra) {
-                  for (P = g.extra; x < P; ) {
+                  for (_ = g.extra; x < _; ) {
                     if (W === 0)
                       break t;
                     W--, V += v[G++] << x, x += 8;
@@ -14560,9 +14560,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       e.exports = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" };
     }, {}], 52: [function(t, e, s) {
       var n = t("../utils/common"), r = 0, o = 1;
-      function a(_) {
-        for (var U = _.length; 0 <= --U; )
-          _[U] = 0;
+      function a(P) {
+        for (var U = P.length; 0 <= --U; )
+          P[U] = 0;
       }
       var l = 0, h = 29, f = 256, I = f + 1 + h, u = 30, d = 19, E = 2 * I + 1, T = 15, p = 16, m = 7, F = 256, R = 16, S = 17, O = 18, y = [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], w = [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], L = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], b = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (I + 2));
       a(Y);
@@ -14575,78 +14575,78 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       var v = new Array(h);
       a(v);
       var q, G, et, W = new Array(u);
-      function nt(_, U, $, Z, B) {
-        this.static_tree = _, this.extra_bits = U, this.extra_base = $, this.elems = Z, this.max_length = B, this.has_stree = _ && _.length;
+      function nt(P, U, $, Z, B) {
+        this.static_tree = P, this.extra_bits = U, this.extra_base = $, this.elems = Z, this.max_length = B, this.has_stree = P && P.length;
       }
-      function V(_, U) {
-        this.dyn_tree = _, this.max_code = 0, this.stat_desc = U;
+      function V(P, U) {
+        this.dyn_tree = P, this.max_code = 0, this.stat_desc = U;
       }
-      function x(_) {
-        return _ < 256 ? M[_] : M[256 + (_ >>> 7)];
+      function x(P) {
+        return P < 256 ? M[P] : M[256 + (P >>> 7)];
       }
-      function ot(_, U) {
-        _.pending_buf[_.pending++] = 255 & U, _.pending_buf[_.pending++] = U >>> 8 & 255;
+      function ot(P, U) {
+        P.pending_buf[P.pending++] = 255 & U, P.pending_buf[P.pending++] = U >>> 8 & 255;
       }
-      function it(_, U, $) {
-        _.bi_valid > p - $ ? (_.bi_buf |= U << _.bi_valid & 65535, ot(_, _.bi_buf), _.bi_buf = U >> p - _.bi_valid, _.bi_valid += $ - p) : (_.bi_buf |= U << _.bi_valid & 65535, _.bi_valid += $);
+      function it(P, U, $) {
+        P.bi_valid > p - $ ? (P.bi_buf |= U << P.bi_valid & 65535, ot(P, P.bi_buf), P.bi_buf = U >> p - P.bi_valid, P.bi_valid += $ - p) : (P.bi_buf |= U << P.bi_valid & 65535, P.bi_valid += $);
       }
-      function tt(_, U, $) {
-        it(_, $[2 * U], $[2 * U + 1]);
+      function tt(P, U, $) {
+        it(P, $[2 * U], $[2 * U + 1]);
       }
-      function St(_, U) {
-        for (var $ = 0; $ |= 1 & _, _ >>>= 1, $ <<= 1, 0 < --U; )
+      function St(P, U) {
+        for (var $ = 0; $ |= 1 & P, P >>>= 1, $ <<= 1, 0 < --U; )
           ;
         return $ >>> 1;
       }
-      function yt(_, U, $) {
+      function yt(P, U, $) {
         var Z, B, K = new Array(T + 1), st = 0;
         for (Z = 1; Z <= T; Z++)
           K[Z] = st = st + $[Z - 1] << 1;
         for (B = 0; B <= U; B++) {
-          var J = _[2 * B + 1];
-          J !== 0 && (_[2 * B] = St(K[J]++, J));
+          var J = P[2 * B + 1];
+          J !== 0 && (P[2 * B] = St(K[J]++, J));
         }
       }
-      function at(_) {
+      function at(P) {
         var U;
         for (U = 0; U < I; U++)
-          _.dyn_ltree[2 * U] = 0;
+          P.dyn_ltree[2 * U] = 0;
         for (U = 0; U < u; U++)
-          _.dyn_dtree[2 * U] = 0;
+          P.dyn_dtree[2 * U] = 0;
         for (U = 0; U < d; U++)
-          _.bl_tree[2 * U] = 0;
-        _.dyn_ltree[2 * F] = 1, _.opt_len = _.static_len = 0, _.last_lit = _.matches = 0;
+          P.bl_tree[2 * U] = 0;
+        P.dyn_ltree[2 * F] = 1, P.opt_len = P.static_len = 0, P.last_lit = P.matches = 0;
       }
-      function It(_) {
-        8 < _.bi_valid ? ot(_, _.bi_buf) : 0 < _.bi_valid && (_.pending_buf[_.pending++] = _.bi_buf), _.bi_buf = 0, _.bi_valid = 0;
+      function It(P) {
+        8 < P.bi_valid ? ot(P, P.bi_buf) : 0 < P.bi_valid && (P.pending_buf[P.pending++] = P.bi_buf), P.bi_buf = 0, P.bi_valid = 0;
       }
-      function ft(_, U, $, Z) {
+      function ft(P, U, $, Z) {
         var B = 2 * U, K = 2 * $;
-        return _[B] < _[K] || _[B] === _[K] && Z[U] <= Z[$];
+        return P[B] < P[K] || P[B] === P[K] && Z[U] <= Z[$];
       }
-      function Ct(_, U, $) {
-        for (var Z = _.heap[$], B = $ << 1; B <= _.heap_len && (B < _.heap_len && ft(U, _.heap[B + 1], _.heap[B], _.depth) && B++, !ft(U, Z, _.heap[B], _.depth)); )
-          _.heap[$] = _.heap[B], $ = B, B <<= 1;
-        _.heap[$] = Z;
+      function Ct(P, U, $) {
+        for (var Z = P.heap[$], B = $ << 1; B <= P.heap_len && (B < P.heap_len && ft(U, P.heap[B + 1], P.heap[B], P.depth) && B++, !ft(U, Z, P.heap[B], P.depth)); )
+          P.heap[$] = P.heap[B], $ = B, B <<= 1;
+        P.heap[$] = Z;
       }
-      function Ht(_, U, $) {
+      function Ht(P, U, $) {
         var Z, B, K, st, J = 0;
-        if (_.last_lit !== 0)
-          for (; Z = _.pending_buf[_.d_buf + 2 * J] << 8 | _.pending_buf[_.d_buf + 2 * J + 1], B = _.pending_buf[_.l_buf + J], J++, Z === 0 ? tt(_, B, U) : (tt(_, (K = g[B]) + f + 1, U), (st = y[K]) !== 0 && it(_, B -= v[K], st), tt(_, K = x(--Z), $), (st = w[K]) !== 0 && it(_, Z -= W[K], st)), J < _.last_lit; )
+        if (P.last_lit !== 0)
+          for (; Z = P.pending_buf[P.d_buf + 2 * J] << 8 | P.pending_buf[P.d_buf + 2 * J + 1], B = P.pending_buf[P.l_buf + J], J++, Z === 0 ? tt(P, B, U) : (tt(P, (K = g[B]) + f + 1, U), (st = y[K]) !== 0 && it(P, B -= v[K], st), tt(P, K = x(--Z), $), (st = w[K]) !== 0 && it(P, Z -= W[K], st)), J < P.last_lit; )
             ;
-        tt(_, F, U);
+        tt(P, F, U);
       }
-      function Dt(_, U) {
+      function Dt(P, U) {
         var $, Z, B, K = U.dyn_tree, st = U.stat_desc.static_tree, J = U.stat_desc.has_stree, ct = U.stat_desc.elems, Rt = -1;
-        for (_.heap_len = 0, _.heap_max = E, $ = 0; $ < ct; $++)
-          K[2 * $] !== 0 ? (_.heap[++_.heap_len] = Rt = $, _.depth[$] = 0) : K[2 * $ + 1] = 0;
-        for (; _.heap_len < 2; )
-          K[2 * (B = _.heap[++_.heap_len] = Rt < 2 ? ++Rt : 0)] = 1, _.depth[B] = 0, _.opt_len--, J && (_.static_len -= st[2 * B + 1]);
-        for (U.max_code = Rt, $ = _.heap_len >> 1; 1 <= $; $--)
-          Ct(_, K, $);
-        for (B = ct; $ = _.heap[1], _.heap[1] = _.heap[_.heap_len--], Ct(_, K, 1), Z = _.heap[1], _.heap[--_.heap_max] = $, _.heap[--_.heap_max] = Z, K[2 * B] = K[2 * $] + K[2 * Z], _.depth[B] = (_.depth[$] >= _.depth[Z] ? _.depth[$] : _.depth[Z]) + 1, K[2 * $ + 1] = K[2 * Z + 1] = B, _.heap[1] = B++, Ct(_, K, 1), 2 <= _.heap_len; )
+        for (P.heap_len = 0, P.heap_max = E, $ = 0; $ < ct; $++)
+          K[2 * $] !== 0 ? (P.heap[++P.heap_len] = Rt = $, P.depth[$] = 0) : K[2 * $ + 1] = 0;
+        for (; P.heap_len < 2; )
+          K[2 * (B = P.heap[++P.heap_len] = Rt < 2 ? ++Rt : 0)] = 1, P.depth[B] = 0, P.opt_len--, J && (P.static_len -= st[2 * B + 1]);
+        for (U.max_code = Rt, $ = P.heap_len >> 1; 1 <= $; $--)
+          Ct(P, K, $);
+        for (B = ct; $ = P.heap[1], P.heap[1] = P.heap[P.heap_len--], Ct(P, K, 1), Z = P.heap[1], P.heap[--P.heap_max] = $, P.heap[--P.heap_max] = Z, K[2 * B] = K[2 * $] + K[2 * Z], P.depth[B] = (P.depth[$] >= P.depth[Z] ? P.depth[$] : P.depth[Z]) + 1, K[2 * $ + 1] = K[2 * Z + 1] = B, P.heap[1] = B++, Ct(P, K, 1), 2 <= P.heap_len; )
           ;
-        _.heap[--_.heap_max] = _.heap[1], function(dt, Wt) {
+        P.heap[--P.heap_max] = P.heap[1], function(dt, Wt) {
           var hi, ce, ui, Lt, Vi, Hs, Ce = Wt.dyn_tree, Hn = Wt.max_code, mo = Wt.stat_desc.static_tree, Ro = Wt.stat_desc.has_stree, go = Wt.stat_desc.extra_bits, Wn = Wt.stat_desc.extra_base, fi = Wt.stat_desc.max_length, Yi = 0;
           for (Lt = 0; Lt <= T; Lt++)
             dt.bl_count[Lt] = 0;
@@ -14662,33 +14662,33 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               for (ce = dt.bl_count[Lt]; ce !== 0; )
                 Hn < (ui = dt.heap[--hi]) || (Ce[2 * ui + 1] !== Lt && (dt.opt_len += (Lt - Ce[2 * ui + 1]) * Ce[2 * ui], Ce[2 * ui + 1] = Lt), ce--);
           }
-        }(_, U), yt(K, Rt, _.bl_count);
+        }(P, U), yt(K, Rt, P.bl_count);
       }
-      function A(_, U, $) {
+      function A(P, U, $) {
         var Z, B, K = -1, st = U[1], J = 0, ct = 7, Rt = 4;
         for (st === 0 && (ct = 138, Rt = 3), U[2 * ($ + 1) + 1] = 65535, Z = 0; Z <= $; Z++)
-          B = st, st = U[2 * (Z + 1) + 1], ++J < ct && B === st || (J < Rt ? _.bl_tree[2 * B] += J : B !== 0 ? (B !== K && _.bl_tree[2 * B]++, _.bl_tree[2 * R]++) : J <= 10 ? _.bl_tree[2 * S]++ : _.bl_tree[2 * O]++, K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4));
+          B = st, st = U[2 * (Z + 1) + 1], ++J < ct && B === st || (J < Rt ? P.bl_tree[2 * B] += J : B !== 0 ? (B !== K && P.bl_tree[2 * B]++, P.bl_tree[2 * R]++) : J <= 10 ? P.bl_tree[2 * S]++ : P.bl_tree[2 * O]++, K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4));
       }
-      function X(_, U, $) {
+      function X(P, U, $) {
         var Z, B, K = -1, st = U[1], J = 0, ct = 7, Rt = 4;
         for (st === 0 && (ct = 138, Rt = 3), Z = 0; Z <= $; Z++)
           if (B = st, st = U[2 * (Z + 1) + 1], !(++J < ct && B === st)) {
             if (J < Rt)
-              for (; tt(_, B, _.bl_tree), --J != 0; )
+              for (; tt(P, B, P.bl_tree), --J != 0; )
                 ;
             else
-              B !== 0 ? (B !== K && (tt(_, B, _.bl_tree), J--), tt(_, R, _.bl_tree), it(_, J - 3, 2)) : J <= 10 ? (tt(_, S, _.bl_tree), it(_, J - 3, 3)) : (tt(_, O, _.bl_tree), it(_, J - 11, 7));
+              B !== 0 ? (B !== K && (tt(P, B, P.bl_tree), J--), tt(P, R, P.bl_tree), it(P, J - 3, 2)) : J <= 10 ? (tt(P, S, P.bl_tree), it(P, J - 3, 3)) : (tt(P, O, P.bl_tree), it(P, J - 11, 7));
             K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4);
           }
       }
       a(W);
       var k = !1;
-      function P(_, U, $, Z) {
-        it(_, (l << 1) + (Z ? 1 : 0), 3), function(B, K, st, J) {
+      function _(P, U, $, Z) {
+        it(P, (l << 1) + (Z ? 1 : 0), 3), function(B, K, st, J) {
           It(B), ot(B, st), ot(B, ~st), n.arraySet(B.pending_buf, B.window, K, st, B.pending), B.pending += st;
-        }(_, U, $);
+        }(P, U, $);
       }
-      s._tr_init = function(_) {
+      s._tr_init = function(P) {
         k || (function() {
           var U, $, Z, B, K, st = new Array(T + 1);
           for (B = Z = 0; B < h - 1; B++)
@@ -14713,10 +14713,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           for (yt(Y, I + 1, st), U = 0; U < u; U++)
             N[2 * U + 1] = 5, N[2 * U] = St(U, 5);
           q = new nt(Y, y, f + 1, I, T), G = new nt(N, w, 0, u, T), et = new nt(new Array(0), L, 0, d, m);
-        }(), k = !0), _.l_desc = new V(_.dyn_ltree, q), _.d_desc = new V(_.dyn_dtree, G), _.bl_desc = new V(_.bl_tree, et), _.bi_buf = 0, _.bi_valid = 0, at(_);
-      }, s._tr_stored_block = P, s._tr_flush_block = function(_, U, $, Z) {
+        }(), k = !0), P.l_desc = new V(P.dyn_ltree, q), P.d_desc = new V(P.dyn_dtree, G), P.bl_desc = new V(P.bl_tree, et), P.bi_buf = 0, P.bi_valid = 0, at(P);
+      }, s._tr_stored_block = _, s._tr_flush_block = function(P, U, $, Z) {
         var B, K, st = 0;
-        0 < _.level ? (_.strm.data_type === 2 && (_.strm.data_type = function(J) {
+        0 < P.level ? (P.strm.data_type === 2 && (P.strm.data_type = function(J) {
           var ct, Rt = 4093624447;
           for (ct = 0; ct <= 31; ct++, Rt >>>= 1)
             if (1 & Rt && J.dyn_ltree[2 * ct] !== 0)
@@ -14727,23 +14727,23 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (J.dyn_ltree[2 * ct] !== 0)
               return o;
           return r;
-        }(_)), Dt(_, _.l_desc), Dt(_, _.d_desc), st = function(J) {
+        }(P)), Dt(P, P.l_desc), Dt(P, P.d_desc), st = function(J) {
           var ct;
           for (A(J, J.dyn_ltree, J.l_desc.max_code), A(J, J.dyn_dtree, J.d_desc.max_code), Dt(J, J.bl_desc), ct = d - 1; 3 <= ct && J.bl_tree[2 * b[ct] + 1] === 0; ct--)
             ;
           return J.opt_len += 3 * (ct + 1) + 5 + 5 + 4, ct;
-        }(_), B = _.opt_len + 3 + 7 >>> 3, (K = _.static_len + 3 + 7 >>> 3) <= B && (B = K)) : B = K = $ + 5, $ + 4 <= B && U !== -1 ? P(_, U, $, Z) : _.strategy === 4 || K === B ? (it(_, 2 + (Z ? 1 : 0), 3), Ht(_, Y, N)) : (it(_, 4 + (Z ? 1 : 0), 3), function(J, ct, Rt, dt) {
+        }(P), B = P.opt_len + 3 + 7 >>> 3, (K = P.static_len + 3 + 7 >>> 3) <= B && (B = K)) : B = K = $ + 5, $ + 4 <= B && U !== -1 ? _(P, U, $, Z) : P.strategy === 4 || K === B ? (it(P, 2 + (Z ? 1 : 0), 3), Ht(P, Y, N)) : (it(P, 4 + (Z ? 1 : 0), 3), function(J, ct, Rt, dt) {
           var Wt;
           for (it(J, ct - 257, 5), it(J, Rt - 1, 5), it(J, dt - 4, 4), Wt = 0; Wt < dt; Wt++)
             it(J, J.bl_tree[2 * b[Wt] + 1], 3);
           X(J, J.dyn_ltree, ct - 1), X(J, J.dyn_dtree, Rt - 1);
-        }(_, _.l_desc.max_code + 1, _.d_desc.max_code + 1, st + 1), Ht(_, _.dyn_ltree, _.dyn_dtree)), at(_), Z && It(_);
-      }, s._tr_tally = function(_, U, $) {
-        return _.pending_buf[_.d_buf + 2 * _.last_lit] = U >>> 8 & 255, _.pending_buf[_.d_buf + 2 * _.last_lit + 1] = 255 & U, _.pending_buf[_.l_buf + _.last_lit] = 255 & $, _.last_lit++, U === 0 ? _.dyn_ltree[2 * $]++ : (_.matches++, U--, _.dyn_ltree[2 * (g[$] + f + 1)]++, _.dyn_dtree[2 * x(U)]++), _.last_lit === _.lit_bufsize - 1;
-      }, s._tr_align = function(_) {
-        it(_, 2, 3), tt(_, F, Y), function(U) {
+        }(P, P.l_desc.max_code + 1, P.d_desc.max_code + 1, st + 1), Ht(P, P.dyn_ltree, P.dyn_dtree)), at(P), Z && It(P);
+      }, s._tr_tally = function(P, U, $) {
+        return P.pending_buf[P.d_buf + 2 * P.last_lit] = U >>> 8 & 255, P.pending_buf[P.d_buf + 2 * P.last_lit + 1] = 255 & U, P.pending_buf[P.l_buf + P.last_lit] = 255 & $, P.last_lit++, U === 0 ? P.dyn_ltree[2 * $]++ : (P.matches++, U--, P.dyn_ltree[2 * (g[$] + f + 1)]++, P.dyn_dtree[2 * x(U)]++), P.last_lit === P.lit_bufsize - 1;
+      }, s._tr_align = function(P) {
+        it(P, 2, 3), tt(P, F, Y), function(U) {
           U.bi_valid === 16 ? (ot(U, U.bi_buf), U.bi_buf = 0, U.bi_valid = 0) : 8 <= U.bi_valid && (U.pending_buf[U.pending++] = 255 & U.bi_buf, U.bi_buf >>= 8, U.bi_valid -= 8);
-        }(_);
+        }(P);
       };
     }, { "../utils/common": 41 }], 53: [function(t, e, s) {
       e.exports = function() {
@@ -14892,11 +14892,11 @@ Gn.validate = function(c, i) {
           a += c[n];
         if (a = a.trim(), a[a.length - 1] === "/" && (a = a.substring(0, a.length - 1), n--), !Wc(a)) {
           let f;
-          return a.trim().length === 0 ? f = "Invalid space after '<'." : f = "Tag '" + a + "' is an invalid name.", Pt("InvalidTag", f, xt(c, n));
+          return a.trim().length === 0 ? f = "Invalid space after '<'." : f = "Tag '" + a + "' is an invalid name.", _t("InvalidTag", f, xt(c, n));
         }
         const l = Yc(c, n);
         if (l === !1)
-          return Pt("InvalidAttr", "Attributes for '" + a + "' have open quote.", xt(c, n));
+          return _t("InvalidAttr", "Attributes for '" + a + "' have open quote.", xt(c, n));
         let h = l.value;
         if (n = l.index, h[h.length - 1] === "/") {
           const f = n - h.length;
@@ -14905,18 +14905,18 @@ Gn.validate = function(c, i) {
           if (I === !0)
             e = !0;
           else
-            return Pt(I.err.code, I.err.msg, xt(c, f + I.err.line));
+            return _t(I.err.code, I.err.msg, xt(c, f + I.err.line));
         } else if (o)
           if (l.tagClosed) {
             if (h.trim().length > 0)
-              return Pt("InvalidTag", "Closing tag '" + a + "' can't have attributes or invalid starting.", xt(c, r));
+              return _t("InvalidTag", "Closing tag '" + a + "' can't have attributes or invalid starting.", xt(c, r));
             if (t.length === 0)
-              return Pt("InvalidTag", "Closing tag '" + a + "' has not been opened.", xt(c, r));
+              return _t("InvalidTag", "Closing tag '" + a + "' has not been opened.", xt(c, r));
             {
               const f = t.pop();
               if (a !== f.tagName) {
                 let I = xt(c, f.tagStartPos);
-                return Pt(
+                return _t(
                   "InvalidTag",
                   "Expected closing tag '" + f.tagName + "' (opened in line " + I.line + ", col " + I.col + ") instead of closing tag '" + a + "'.",
                   xt(c, r)
@@ -14925,13 +14925,13 @@ Gn.validate = function(c, i) {
               t.length == 0 && (s = !0);
             }
           } else
-            return Pt("InvalidTag", "Closing tag '" + a + "' doesn't have proper closing.", xt(c, n));
+            return _t("InvalidTag", "Closing tag '" + a + "' doesn't have proper closing.", xt(c, n));
         else {
           const f = Br(h, i);
           if (f !== !0)
-            return Pt(f.err.code, f.err.msg, xt(c, n - h.length + f.err.line));
+            return _t(f.err.code, f.err.msg, xt(c, n - h.length + f.err.line));
           if (s === !0)
-            return Pt("InvalidXml", "Multiple possible root nodes found.", xt(c, n));
+            return _t("InvalidXml", "Multiple possible root nodes found.", xt(c, n));
           i.unpairedTags.indexOf(a) !== -1 || t.push({ tagName: a, tagStartPos: r }), e = !0;
         }
         for (n++; n < c.length; n++)
@@ -14947,24 +14947,24 @@ Gn.validate = function(c, i) {
           else if (c[n] === "&") {
             const f = kc(c, n);
             if (f == -1)
-              return Pt("InvalidChar", "char '&' is not expected.", xt(c, n));
+              return _t("InvalidChar", "char '&' is not expected.", xt(c, n));
             n = f;
           } else if (s === !0 && !vr(c[n]))
-            return Pt("InvalidXml", "Extra text at the end", xt(c, n));
+            return _t("InvalidXml", "Extra text at the end", xt(c, n));
         c[n] === "<" && n--;
       }
     } else {
       if (vr(c[n]))
         continue;
-      return Pt("InvalidChar", "char '" + c[n] + "' is not expected.", xt(c, n));
+      return _t("InvalidChar", "char '" + c[n] + "' is not expected.", xt(c, n));
     }
   if (e) {
     if (t.length == 1)
-      return Pt("InvalidTag", "Unclosed tag '" + t[0].tagName + "'.", xt(c, t[0].tagStartPos));
+      return _t("InvalidTag", "Unclosed tag '" + t[0].tagName + "'.", xt(c, t[0].tagStartPos));
     if (t.length > 0)
-      return Pt("InvalidXml", "Invalid '" + JSON.stringify(t.map((n) => n.tagName), null, 4).replace(/\r?\n/g, "") + "' found.", { line: 1, col: 1 });
+      return _t("InvalidXml", "Invalid '" + JSON.stringify(t.map((n) => n.tagName), null, 4).replace(/\r?\n/g, "") + "' found.", { line: 1, col: 1 });
   } else
-    return Pt("InvalidXml", "Start tag expected.", 1);
+    return _t("InvalidXml", "Start tag expected.", 1);
   return !0;
 };
 function vr(c) {
@@ -14977,7 +14977,7 @@ function Ur(c, i) {
     if (c[i] == "?" || c[i] == " ") {
       const e = c.substr(t, i - t);
       if (i > 5 && e === "xml")
-        return Pt("InvalidXml", "XML declaration allowed only at the start of the document.", xt(c, i));
+        return _t("InvalidXml", "XML declaration allowed only at the start of the document.", xt(c, i));
       if (c[i] == "?" && c[i + 1] == ">") {
         i++;
         break;
@@ -15032,18 +15032,18 @@ function Br(c, i) {
   const t = zn.getAllMatches(c, Gc), e = {};
   for (let s = 0; s < t.length; s++) {
     if (t[s][1].length === 0)
-      return Pt("InvalidAttr", "Attribute '" + t[s][2] + "' has no space in starting.", yi(t[s]));
+      return _t("InvalidAttr", "Attribute '" + t[s][2] + "' has no space in starting.", yi(t[s]));
     if (t[s][3] !== void 0 && t[s][4] === void 0)
-      return Pt("InvalidAttr", "Attribute '" + t[s][2] + "' is without value.", yi(t[s]));
+      return _t("InvalidAttr", "Attribute '" + t[s][2] + "' is without value.", yi(t[s]));
     if (t[s][3] === void 0 && !i.allowBooleanAttributes)
-      return Pt("InvalidAttr", "boolean attribute '" + t[s][2] + "' is not allowed.", yi(t[s]));
+      return _t("InvalidAttr", "boolean attribute '" + t[s][2] + "' is not allowed.", yi(t[s]));
     const n = t[s][2];
     if (!Hc(n))
-      return Pt("InvalidAttr", "Attribute '" + n + "' is an invalid name.", yi(t[s]));
+      return _t("InvalidAttr", "Attribute '" + n + "' is an invalid name.", yi(t[s]));
     if (!e.hasOwnProperty(n))
       e[n] = 1;
     else
-      return Pt("InvalidAttr", "Attribute '" + n + "' is repeated.", yi(t[s]));
+      return _t("InvalidAttr", "Attribute '" + n + "' is repeated.", yi(t[s]));
   }
   return !0;
 }
@@ -15071,7 +15071,7 @@ function kc(c, i) {
     }
   return i;
 }
-function Pt(c, i, t) {
+function _t(c, i, t) {
   return {
     err: {
       code: c,
@@ -15308,7 +15308,7 @@ function El(c, i, t, e, s, n, r) {
   if (c !== void 0 && (this.options.trimValues && !e && (c = c.trim()), c.length > 0)) {
     r || (c = this.replaceEntitiesValue(c));
     const o = this.options.tagValueProcessor(i, c, t, s, n);
-    return o == null ? c : typeof o != typeof c || o !== c ? o : this.options.trimValues ? _n(c, this.options.parseTagValue, this.options.numberParseOptions) : c.trim() === c ? _n(c, this.options.parseTagValue, this.options.numberParseOptions) : c;
+    return o == null ? c : typeof o != typeof c || o !== c ? o : this.options.trimValues ? Pn(c, this.options.parseTagValue, this.options.numberParseOptions) : c.trim() === c ? Pn(c, this.options.parseTagValue, this.options.numberParseOptions) : c;
   }
 }
 function pl(c) {
@@ -15331,7 +15331,7 @@ function Tl(c, i, t) {
         if (this.options.transformAttributeName && (l = this.options.transformAttributeName(l)), l === "__proto__" && (l = "#__proto__"), a !== void 0) {
           this.options.trimValues && (a = a.trim()), a = this.replaceEntitiesValue(a);
           const h = this.options.attributeValueProcessor(o, a, i);
-          h == null ? n[l] = a : typeof h != typeof a || h !== a ? n[l] = h : n[l] = _n(
+          h == null ? n[l] = a : typeof h != typeof a || h !== a ? n[l] = h : n[l] = Pn(
             a,
             this.options.parseAttributeValue,
             this.options.numberParseOptions
@@ -15546,7 +15546,7 @@ function Ol(c, i, t) {
         n && ((n && n.tagName) === i && n.tagExp[n.tagExp.length - 1] !== "/" && s++, t = n.closeIndex);
       }
 }
-function _n(c, i, t) {
+function Pn(c, i, t) {
   if (i && typeof c == "string") {
     const e = c.trim();
     return e === "true" ? !0 : e === "false" ? !1 : fl(c, t);
@@ -15570,8 +15570,8 @@ function Io(c, i, t) {
         continue;
       if (r[o]) {
         let l = Io(r[o], i, a);
-        const h = Pl(l, i);
-        r[":@"] ? _l(l, r[":@"], a, i) : Object.keys(l).length === 1 && l[i.textNodeName] !== void 0 && !i.alwaysCreateTextNode ? l = l[i.textNodeName] : Object.keys(l).length === 0 && (i.alwaysCreateTextNode ? l[i.textNodeName] = "" : l = ""), s[o] !== void 0 && s.hasOwnProperty(o) ? (Array.isArray(s[o]) || (s[o] = [s[o]]), s[o].push(l)) : i.isArray(o, a, h) ? s[o] = [l] : s[o] = l;
+        const h = _l(l, i);
+        r[":@"] ? Pl(l, r[":@"], a, i) : Object.keys(l).length === 1 && l[i.textNodeName] !== void 0 && !i.alwaysCreateTextNode ? l = l[i.textNodeName] : Object.keys(l).length === 0 && (i.alwaysCreateTextNode ? l[i.textNodeName] = "" : l = ""), s[o] !== void 0 && s.hasOwnProperty(o) ? (Array.isArray(s[o]) || (s[o] = [s[o]]), s[o].push(l)) : i.isArray(o, a, h) ? s[o] = [l] : s[o] = l;
       }
     }
   }
@@ -15585,7 +15585,7 @@ function Ll(c) {
       return e;
   }
 }
-function _l(c, i, t, e) {
+function Pl(c, i, t, e) {
   if (i) {
     const s = Object.keys(i), n = s.length;
     for (let r = 0; r < n; r++) {
@@ -15594,7 +15594,7 @@ function _l(c, i, t, e) {
     }
   }
 }
-function Pl(c, i) {
+function _l(c, i) {
   const { textNodeName: t } = i, e = Object.keys(c).length;
   return !!(e === 0 || e === 1 && (c[t] || typeof c[t] == "boolean" || c[t] === 0));
 }
@@ -15862,7 +15862,7 @@ var Co = {
   XMLValidator: Zl,
   XMLBuilder: ql
 };
-class Pn {
+class _n {
   /**
    * Constructs a new BCF Topic Comment instance.
    * @param components - The Components instance.
@@ -16084,7 +16084,7 @@ const Ie = class Ie {
    * ```
    */
   createComment(i, t) {
-    const e = new Pn(this._components, i);
+    const e = new _n(this._components, i);
     return e.viewpoint = t, e.topic = this, this.comments.set(e.guid, e), e;
   }
   createLabelTags(i = this._managerVersion) {
@@ -16610,9 +16610,9 @@ ${o}
       Comment: r,
       Viewpoint: o
     } = t;
-    if (!(e && s && n && (Pn || o)))
+    if (!(e && s && n && (_n || o)))
       return null;
-    const a = this.components.get(ie), l = new Pn(this.components, r ?? "");
+    const a = this.components.get(ie), l = new _n(this.components, r ?? "");
     return l.guid = e, l.date = new Date(s), l.author = n, l.viewpoint = o != null && o.Guid ? a.list.get(o.Guid) : void 0, l.modifiedAuthor = t.ModifiedAuthor, l.modifiedDate = t.ModifiedDate ? new Date(t.ModifiedDate) : void 0, l;
   }
   getMarkupComments(t, e) {
@@ -17093,7 +17093,7 @@ const ee = class ee extends At {
 };
 C(ee, "uuid", "d1444724-dba6-4cdd-a0c7-68ee1450d166");
 let wn = ee;
-const Ps = class Ps {
+const _s = class _s {
   constructor(i) {
     /**
      * Event used to notify the progress when performing a query on an IFC file.
@@ -17125,7 +17125,7 @@ const Ps = class Ps {
    * @param data the data of the query to import as a serializable object.
    */
   static import(i, t) {
-    const e = Ps.importers.get(t.type);
+    const e = _s.importers.get(t.type);
     return e ? e(i, t) : (console.warn("Invalid query data:.", t), null);
   }
   /**
@@ -17331,8 +17331,8 @@ const Ps = class Ps {
 /**
  * The list of functions to import the queries. If you create your own custom query, you should add its importer here. See the other queries provided by the library for reference.
  */
-C(Ps, "importers", /* @__PURE__ */ new Map());
-let se = Ps;
+C(_s, "importers", /* @__PURE__ */ new Map());
+let se = _s;
 class Yr {
   constructor(i) {
     /**
@@ -17498,7 +17498,7 @@ const Ms = class Ms extends se {
    * {@link IfcFinderQuery.items}
    */
   get items() {
-    const t = this.components.get(kt), e = this.components.get(Tt), s = [];
+    const t = this.components.get(Gt), e = this.components.get(Tt), s = [];
     for (const n in this.ids) {
       const r = e.groups.get(n);
       if (!r) {
@@ -17883,7 +17883,7 @@ const bs = class bs extends At {
    */
   async bySpatialStructure(t, e = {}) {
     var l, h;
-    const s = this.components.get(kt), n = s.relationMaps[t.uuid];
+    const s = this.components.get(Gt), n = s.relationMaps[t.uuid];
     if (!n)
       throw new Error(
         `Classifier: model relations of ${t.name || t.uuid} have to exists to group by spatial structure.`
@@ -18156,22 +18156,22 @@ const xs = class xs extends At {
      * Event triggered when geometry is streamed.
      * Contains the streamed geometry data and its buffer.
      */
-    C(this, "onGeometryStreamed", new Pe());
+    C(this, "onGeometryStreamed", new _e());
     /**
      * Event triggered when assets are streamed.
      * Contains the streamed assets.
      */
-    C(this, "onAssetStreamed", new Pe());
+    C(this, "onAssetStreamed", new _e());
     /**
      * Event triggered to indicate the progress of the streaming process.
      * Contains the progress percentage.
      */
-    C(this, "onProgress", new Pe());
+    C(this, "onProgress", new _e());
     /**
      * Event triggered when the IFC file is loaded.
      * Contains the loaded IFC file data.
      */
-    C(this, "onIfcLoaded", new Pe());
+    C(this, "onIfcLoaded", new _e());
     /** {@link Disposable.onDisposed} */
     C(this, "onDisposed", new j());
     /**
@@ -18425,17 +18425,17 @@ class eh extends At {
      * An event that is triggered when properties are streamed from the IFC file.
      * The event provides the type of the IFC entity and the corresponding data.
      */
-    C(this, "onPropertiesStreamed", new Pe());
+    C(this, "onPropertiesStreamed", new _e());
     /**
      * An event that is triggered to indicate the progress of the streaming process.
      * The event provides a number between 0 and 1 representing the progress percentage.
      */
-    C(this, "onProgress", new Pe());
+    C(this, "onProgress", new _e());
     /**
      * An event that is triggered when indices are streamed from the IFC file.
      * The event provides a map of indices, where the key is the entity type and the value is another map of indices.
      */
-    C(this, "onIndicesStreamed", new Pe());
+    C(this, "onIndicesStreamed", new _e());
     /** {@link Disposable.onDisposed} */
     C(this, "onDisposed", new j());
     /** {@link Component.enabled} */
@@ -18525,7 +18525,7 @@ class eh extends At {
       r / e.size > n && (n = Math.round(n * 100) / 100, await this.onProgress.trigger(n), n += 0.01);
     }
     await this.onProgress.trigger(1);
-    const a = await this.components.get(kt).processFromWebIfc(this.webIfc, 0);
+    const a = await this.components.get(Gt).processFromWebIfc(this.webIfc, 0);
     await this.onIndicesStreamed.trigger(a);
   }
   cleanUp() {
@@ -18748,7 +18748,7 @@ class To {
       throw new Error(
         "Viewpoint: the world's camera need controls to set the viewpoint."
       );
-    t instanceof _c && t.projection.set(this.projection);
+    t instanceof Pc && t.projection.set(this.projection);
     const e = new D.Vector3(
       this.camera.position.x,
       this.camera.position.y,
@@ -19849,7 +19849,7 @@ class oh extends ks {
       const E = await t.getProperties(d);
       !E || !this.evalSystem(E) || !this.evalValue(u) || !this.evalURI(u) || a.push(I);
     }
-    const l = this.components.get(kt);
+    const l = this.components.get(Gt);
     for (const f of a) {
       const I = l.getEntitiesWithRelation(
         t,
@@ -19916,7 +19916,7 @@ class oh extends ks {
   }
   async getSystems(t, e) {
     var f;
-    const s = [], n = this.components.get(kt), r = n.getEntityRelations(
+    const s = [], n = this.components.get(Gt), r = n.getEntityRelations(
       t,
       e,
       "HasAssociations"
@@ -20079,7 +20079,7 @@ class ah extends ks {
     var l, h, f, I;
     if (!this.predefinedType)
       return null;
-    const n = this.components.get(kt), r = typeof this.predefinedType.parameter == "string" && this.predefinedType.parameter === "USERDEFINED";
+    const n = this.components.get(Gt), r = typeof this.predefinedType.parameter == "string" && this.predefinedType.parameter === "USERDEFINED";
     let o = (l = e.PredefinedType) == null ? void 0 : l.value;
     if (o === "USERDEFINED" && !r) {
       const d = Object.keys(e).find(
@@ -20119,6 +20119,7 @@ class ch extends ks {
     C(this, "value");
     C(this, "dataType");
     C(this, "uri");
+    // These are defined by the IDS specification
     C(this, "_unsupportedTypes", [
       z.IFCCOMPLEXPROPERTY,
       z.IFCPHYSICALCOMPLEXQUANTITY
@@ -20163,7 +20164,7 @@ class ch extends ks {
           }
         }
     }
-    const a = this.components.get(kt);
+    const a = this.components.get(Gt);
     for (const f of o) {
       const I = a.getEntitiesWithRelation(
         t,
@@ -20263,9 +20264,34 @@ class ch extends ks {
       (e) => e.endsWith("Value") || e.endsWith("Values")
     );
   }
-  // IFCPROPERTYSET from type must be get as well
+  async getPsetProps(t, e, s) {
+    const n = structuredClone(e), r = [], o = n[s];
+    if (!o)
+      return r;
+    for (const { value: a } of o) {
+      const l = await t.getProperties(a);
+      l && r.push(l);
+    }
+    return n[s] = r, n;
+  }
+  async getTypePsets(t, e) {
+    const s = [], r = this.components.get(Gt).getEntityRelations(t, e, "IsTypedBy");
+    if (!(r && r[0]))
+      return s;
+    const o = await t.getProperties(r[0]);
+    if (!(o && "HasPropertySets" in o && Array.isArray(o.HasPropertySets)))
+      return s;
+    for (const { value: a } of o.HasPropertySets) {
+      const l = await t.getProperties(a);
+      if (!(l && "HasProperties" in l && Array.isArray(l.HasProperties)))
+        continue;
+      const h = await this.getPsetProps(t, l, "HasProperties");
+      s.push(h);
+    }
+    return s;
+  }
   async getPsets(t, e) {
-    const s = [], r = this.components.get(kt).getEntityRelations(
+    const s = await this.getTypePsets(t, e), r = this.components.get(Gt).getEntityRelations(
       t,
       e,
       "IsDefinedBy"
@@ -20279,12 +20305,8 @@ class ch extends ks {
       const l = this.getItemsAttrName(a.type);
       if (!l)
         continue;
-      const h = structuredClone(a), f = [];
-      for (const { value: I } of h[l]) {
-        const u = await t.getProperties(I);
-        u && f.push(u);
-      }
-      h[l] = f, s.push(h);
+      const h = await this.getPsetProps(t, a, l);
+      s.push(h);
     }
     return s;
   }
@@ -20626,7 +20648,7 @@ C(ri, "uuid", "9f0b9f78-9b2e-481a-b766-2fbfd01f342c"), C(ri, "xmlParser", new Co
 }));
 let $r = ri;
 export {
-  Pe as AsyncEvent,
+  _e as AsyncEvent,
   Mt as BCFTopics,
   Kl as BCFTopicsConfigManager,
   xn as Base,
@@ -20637,7 +20659,7 @@ export {
   wn as BoundingBoxer,
   Bi as Classifier,
   Sn as Clipper,
-  Pn as Comment,
+  _n as Comment,
   At as Component,
   ph as ComponentWithUI,
   Cs as Components,
@@ -20665,7 +20687,7 @@ export {
   gs as IfcBasicQuery,
   gh as IfcCategories,
   ms as IfcCategoryMap,
-  Pc as IfcElements,
+  _c as IfcElements,
   Gr as IfcFinder,
   se as IfcFinderQuery,
   Yn as IfcFragmentSettings,
@@ -20676,7 +20698,7 @@ export {
   eh as IfcPropertiesTiler,
   oi as IfcPropertiesUtils,
   As as IfcPropertyQuery,
-  kt as IfcRelationsIndexer,
+  Gt as IfcRelationsIndexer,
   Jl as IfcStreamingSettings,
   pr as MaterialsUtils,
   Wr as MeasurementUtils,
@@ -20686,7 +20708,7 @@ export {
   Hr as MiniMaps,
   fc as Mouse,
   Nc as OrbitMode,
-  _c as OrthoPerspectiveCamera,
+  Pc as OrthoPerspectiveCamera,
   yc as PlanMode,
   Lc as ProjectionManager,
   th as PropertiesStreamingSettings,