@thatopen/components 2.3.12 → 2.3.14

package/dist/index.mjs

@@ -2,10 +2,10 @@ 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 Fe, 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";
+import * as k from "web-ifc";
 const Qr = 0, bo = 1, vo = 2, jn = 2, Ws = 1.25, qn = 1, Is = 6 * 4 + 4 + 4, Ys = 65535, Uo = Math.pow(2, -24), Xs = Symbol("SKIP_GENERATION");
 function xo(c) {
   return c.index ? c.index.count : c.attributes.position.count;
@@ -139,7 +139,7 @@ function ko(c, i) {
   }
   return n;
 }
-const Te = 32, Ho = (c, i) => c.candidate - i.candidate, Fe = new Array(Te).fill().map(() => ({
+const Te = 32, Ho = (c, i) => c.candidate - i.candidate, Se = new Array(Te).fill().map(() => ({
   count: 0,
   bounds: new Float32Array(6),
   rightCacheBounds: new Float32Array(6),
@@ -159,7 +159,7 @@ function Wo(c, i, t, e, s, n) {
     for (let I = 0; I < 3; I++) {
       const u = i[I], T = (i[I + 3] - u) / Te;
       if (s < Te / 4) {
-        const p = [...Fe];
+        const p = [...Se];
         p.length = s;
         let m = 0;
         for (let R = h; R < f; R += 6, m++) {
@@ -199,7 +199,7 @@ function Wo(c, i, t, e, s, n) {
         }
       } else {
         for (let F = 0; F < Te; F++) {
-          const R = Fe[F];
+          const R = Se[F];
           R.count = 0, R.candidate = u + T + F * T;
           const S = R.bounds;
           for (let O = 0; O < 3; O++)
@@ -208,18 +208,18 @@ function Wo(c, i, t, e, s, n) {
         for (let F = h; F < f; F += 6) {
           let O = ~~((t[F + 2 * I] - u) / T);
           O >= Te && (O = Te - 1);
-          const y = Fe[O];
+          const y = Se[O];
           y.count++, zi(F, t, y.bounds);
         }
-        const p = Fe[Te - 1];
+        const p = Se[Te - 1];
         Kn(p.bounds, p.rightCacheBounds);
         for (let F = Te - 2; F >= 0; F--) {
-          const R = Fe[F], S = Fe[F + 1];
+          const R = Se[F], S = Se[F + 1];
           Jn(R.bounds, S.rightCacheBounds, R.rightCacheBounds);
         }
         let m = 0;
         for (let F = 0; F < Te - 1; F++) {
-          const R = Fe[F], S = R.count, O = R.bounds, w = Fe[F + 1].rightCacheBounds;
+          const R = Se[F], S = R.count, O = R.bounds, w = Se[F + 1].rightCacheBounds;
           S !== 0 && (m === 0 ? Kn(O, ki) : Jn(O, ki, ki)), m += S;
           let L = 0, b = 0;
           m !== 0 && (L = di(ki) / a);
@@ -362,7 +362,7 @@ function Qo(c, i) {
     }
   }
 }
-class ge {
+class Ae {
   constructor() {
     this.min = 1 / 0, this.max = -1 / 0;
   }
@@ -386,7 +386,7 @@ class ge {
     return this.min > i.max || i.min > this.max;
   }
 }
-ge.prototype.setFromBox = function() {
+Ae.prototype.setFromBox = function() {
   const c = new Q();
   return function(t, e) {
     const s = e.min, n = e.max;
@@ -459,7 +459,7 @@ function Zs(c) {
 }
 class ne extends ii {
   constructor(...i) {
-    super(...i), this.isExtendedTriangle = !0, this.satAxes = new Array(4).fill().map(() => new Q()), this.satBounds = new Array(4).fill().map(() => new ge()), this.points = [this.a, this.b, this.c], this.sphere = new So(), this.plane = new Dn(), this.needsUpdate = !0;
+    super(...i), this.isExtendedTriangle = !0, this.satAxes = new Array(4).fill().map(() => new Q()), this.satBounds = new Array(4).fill().map(() => new Ae()), this.points = [this.a, this.b, this.c], this.sphere = new So(), this.plane = new Dn(), this.needsUpdate = !0;
   }
   intersectsSphere(i) {
     return Jo(i, this);
@@ -488,7 +488,7 @@ ne.prototype.closestPointToSegment = function() {
   };
 }();
 ne.prototype.intersectsTriangle = function() {
-  const c = new ne(), i = new Array(3), t = new Array(3), e = new ge(), s = new ge(), n = new Q(), r = new Q(), o = new Q(), a = new Q(), l = new Q(), h = new Ee(), f = new Ee(), I = new Ee(), u = new Q();
+  const c = new ne(), i = new Array(3), t = new Array(3), e = new Ae(), s = new Ae(), n = new Q(), r = new Q(), o = new Q(), a = new Q(), l = new Q(), h = new Ee(), f = new Ee(), I = new Ee(), u = new Q();
   function d(E, T, p) {
     const m = E.points;
     let F = 0, R = -1;
@@ -596,7 +596,7 @@ ne.prototype.distanceToTriangle = function() {
 }();
 class Bt {
   constructor(i, t, e) {
-    this.isOrientedBox = !0, this.min = new Q(), this.max = new Q(), this.matrix = new pe(), this.invMatrix = new pe(), this.points = new Array(8).fill().map(() => new Q()), this.satAxes = new Array(3).fill().map(() => new Q()), this.satBounds = new Array(3).fill().map(() => new ge()), this.alignedSatBounds = new Array(3).fill().map(() => new ge()), this.needsUpdate = !1, i && this.min.copy(i), t && this.max.copy(t), e && this.matrix.copy(e);
+    this.isOrientedBox = !0, this.min = new Q(), this.max = new Q(), this.matrix = new pe(), this.invMatrix = new pe(), this.points = new Array(8).fill().map(() => new Q()), this.satAxes = new Array(3).fill().map(() => new Q()), this.satBounds = new Array(3).fill().map(() => new Ae()), this.alignedSatBounds = new Array(3).fill().map(() => new Ae()), this.needsUpdate = !1, i && this.min.copy(i), t && this.max.copy(t), e && this.matrix.copy(e);
   }
   set(i, t, e) {
     this.min.copy(i), this.max.copy(t), this.matrix.copy(e), this.needsUpdate = !0;
@@ -624,7 +624,7 @@ Bt.prototype.update = /* @__PURE__ */ function() {
   };
 }();
 Bt.prototype.intersectsBox = function() {
-  const c = new ge();
+  const c = new Ae();
   return function(t) {
     this.needsUpdate && this.update();
     const e = t.min, s = t.max, n = this.satBounds, r = this.satAxes, o = this.alignedSatBounds;
@@ -639,7 +639,7 @@ Bt.prototype.intersectsBox = function() {
   };
 }();
 Bt.prototype.intersectsTriangle = function() {
-  const c = new ne(), i = new Array(3), t = new ge(), e = new ge(), s = new Q();
+  const c = new ne(), i = new Array(3), t = new Ae(), e = new Ae(), s = new Q();
   return function(r) {
     this.needsUpdate && this.update(), r.isExtendedTriangle ? r.needsUpdate && r.update() : (c.copy(r), c.update(), r = c);
     const o = this.satBounds, a = this.satAxes;
@@ -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(
     {
@@ -1281,7 +1281,7 @@ function Ma(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
 function Da() {
   return typeof SharedArrayBuffer < "u";
 }
-const wi = new Ft.constructor(), ps = new Ft.constructor(), Ne = new vn(() => new ae()), qe = new ae(), Qe = new ae(), Ks = new ae(), Js = new ae();
+const wi = new Ft.constructor(), ps = new Ft.constructor(), ye = new vn(() => new ae()), qe = new ae(), Qe = new ae(), Ks = new ae(), Js = new ae();
 let tn = !1;
 function ba(c, i, t, e) {
   if (tn)
@@ -1292,7 +1292,7 @@ function ba(c, i, t, e) {
   const l = new pe().copy(t).invert();
   for (let h = 0, f = s.length; h < f; h++) {
     wi.setBuffer(s[h]), a = 0;
-    const I = Ne.getPrimitive();
+    const I = ye.getPrimitive();
     Nt(0, wi.float32Array, I), I.applyMatrix4(l);
     for (let u = 0, d = n.length; u < d && (ps.setBuffer(n[h]), r = Kt(
       0,
@@ -1307,7 +1307,7 @@ function ba(c, i, t, e) {
       I
     ), ps.clearBuffer(), a += n[u].length, !r); u++)
       ;
-    if (Ne.releasePrimitive(I), wi.clearBuffer(), o += s[h].length, r)
+    if (ye.releasePrimitive(I), wi.clearBuffer(), o += s[h].length, r)
       break;
   }
   return tn = !1, r;
@@ -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,
@@ -1338,7 +1338,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       r + i
     );
   else if (O) {
-    const w = Ne.getPrimitive();
+    const w = ye.getPrimitive();
     Nt(i, T, w), w.applyMatrix4(t);
     const L = jt(c), b = qt(c, d);
     Nt(L, u, qe), Nt(b, u, Qe);
@@ -1367,7 +1367,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       o + 1,
       w,
       !h
-    ), Ne.releasePrimitive(w);
+    ), ye.releasePrimitive(w);
   } else {
     const w = jt(i), L = qt(i, p);
     Nt(w, T, Ks), Nt(L, T, Js);
@@ -1414,7 +1414,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           h
         );
       else {
-        const N = Ne.getPrimitive();
+        const N = ye.getPrimitive();
         N.copy(Ks).applyMatrix4(t);
         const M = jt(c), g = qt(c, d);
         Nt(M, u, qe), Nt(g, u, Qe);
@@ -1443,7 +1443,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           o + 1,
           N,
           !h
-        ), Ne.releasePrimitive(N);
+        ), ye.releasePrimitive(N);
       }
     else if (Y)
       if (S)
@@ -1461,7 +1461,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           h
         );
       else {
-        const N = Ne.getPrimitive();
+        const N = ye.getPrimitive();
         N.copy(Js).applyMatrix4(t);
         const M = jt(c), g = qt(c, d);
         Nt(M, u, qe), Nt(g, u, Qe);
@@ -1490,7 +1490,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           o + 1,
           N,
           !h
-        ), Ne.releasePrimitive(N);
+        ), ye.releasePrimitive(N);
       }
   }
   return y;
@@ -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, z = n[Dt + 0].vertex, _ = n[Dt + 1].vertex;
+      r.push(X.point.x, X.point.y, X.point.z), r.push(z.point.x, z.point.y, z.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.14");
 let Cs = Fs;
 class Qa extends xn {
   constructor() {
@@ -3615,7 +3615,7 @@ const ht = {
 function ve(c) {
   return c.isPerspectiveCamera;
 }
-function Oe(c) {
+function Ne(c) {
   return c.isOrthographicCamera;
 }
 const Je = Math.PI * 2, Cr = Math.PI / 2, eo = 1e-5, Ri = Math.PI / 180;
@@ -3669,7 +3669,7 @@ function rn(c, i) {
   }), i.x /= c.length, i.y /= c.length;
 }
 function on(c, i) {
-  return Oe(c) ? (console.warn(`${i} is not supported in OrthographicCamera`), !0) : !1;
+  return Ne(c) ? (console.warn(`${i} is not supported in OrthographicCamera`), !0) : !1;
 }
 class ic {
   constructor() {
@@ -3812,7 +3812,7 @@ class vt extends ic {
       if (ve(this._camera)) {
         const L = ut.copy(this._camera.position).sub(this._target), b = this._camera.getEffectiveFOV() * Ri, Y = L.length() * Math.tan(b * 0.5);
         y = this.truckSpeed * R * Y / this._elementRect.height, w = this.truckSpeed * S * Y / this._elementRect.height;
-      } else if (Oe(this._camera)) {
+      } else if (Ne(this._camera)) {
         const L = this._camera;
         y = R * (L.right - L.left) / L.zoom / this._elementRect.width, w = S * (L.top - L.bottom) / L.zoom / this._elementRect.height;
       } else
@@ -3836,10 +3836,10 @@ class vt extends ic {
       left: H.ROTATE,
       middle: H.DOLLY,
       right: H.TRUCK,
-      wheel: ve(this._camera) ? H.DOLLY : Oe(this._camera) ? H.ZOOM : H.NONE
+      wheel: ve(this._camera) ? H.DOLLY : Ne(this._camera) ? H.ZOOM : H.NONE
     }, this.touches = {
       one: H.TOUCH_ROTATE,
-      two: ve(this._camera) ? H.TOUCH_DOLLY_TRUCK : Oe(this._camera) ? H.TOUCH_ZOOM_TRUCK : H.NONE,
+      two: ve(this._camera) ? H.TOUCH_DOLLY_TRUCK : Ne(this._camera) ? H.TOUCH_ZOOM_TRUCK : H.NONE,
       three: H.TOUCH_TRUCK
     };
     const e = new lt.Vector2(), s = new lt.Vector2(), n = new lt.Vector2(), r = (R) => {
@@ -4425,7 +4425,7 @@ class vt extends ic {
     if (ve(this._camera)) {
       const m = this.getDistanceToFitBox(T.x, T.y, T.z, e);
       a.push(this.moveTo(p.x, p.y, p.z, t)), a.push(this.dollyTo(m, t)), a.push(this.setFocalOffset(0, 0, 0, t));
-    } else if (Oe(this._camera)) {
+    } else if (Ne(this._camera)) {
       const m = this._camera, F = m.right - m.left, R = m.top - m.bottom, S = e ? Math.max(F / T.x, R / T.y) : Math.min(F / T.x, R / T.y);
       a.push(this.moveTo(p.x, p.y, p.z, t)), a.push(this.zoomTo(S, t)), a.push(this.setFocalOffset(0, 0, 0, t));
     }
@@ -4442,7 +4442,7 @@ class vt extends ic {
     if (e.push(this.moveTo(n.center.x, n.center.y, n.center.z, t)), ve(this._camera)) {
       const r = this.getDistanceToFitSphere(n.radius);
       e.push(this.dollyTo(r, t));
-    } else if (Oe(this._camera)) {
+    } else if (Ne(this._camera)) {
       const r = this._camera.right - this._camera.left, o = this._camera.top - this._camera.bottom, a = 2 * n.radius, l = Math.min(r / a, o / a);
       e.push(this.zoomTo(l, t));
     }
@@ -4745,7 +4745,7 @@ class vt extends ic {
         this._boundary.clampPoint(R, R);
         const y = Et.subVectors(R, this._targetEnd);
         this._targetEnd.copy(R), this._target.add(y), this._changedDolly -= f, gt(this._changedDolly) && (this._changedDolly = 0);
-      } else if (Oe(this._camera) && this._changedZoom !== 0) {
+      } else if (Ne(this._camera) && this._changedZoom !== 0) {
         const f = this._zoom - this._lastZoom, I = this._camera, u = ut.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (I.near + I.far) / (I.near - I.far)).unproject(I), d = Et.set(0, 0, -1).applyQuaternion(I.quaternion), E = ti.copy(u).add(d.multiplyScalar(-u.dot(I.up))), p = -(this._zoom - f - this._zoom) / this._zoom, m = this._getCameraDirection(Fi), F = this._targetEnd.dot(m), R = ut.copy(this._targetEnd).lerp(E, p), S = R.dot(m), O = m.multiplyScalar(S - F);
         R.sub(O), this._boundary.clampPoint(R, R);
         const y = Et.subVectors(R, this._targetEnd);
@@ -4860,7 +4860,7 @@ class vt extends ic {
     if (ve(this._camera)) {
       const i = this._camera, t = i.near, e = i.getEffectiveFOV() * Ri, s = Math.tan(e * 0.5) * t, n = s * i.aspect;
       this._nearPlaneCorners[0].set(-n, -s, 0), this._nearPlaneCorners[1].set(n, -s, 0), this._nearPlaneCorners[2].set(n, s, 0), this._nearPlaneCorners[3].set(-n, s, 0);
-    } else if (Oe(this._camera)) {
+    } else if (Ne(this._camera)) {
       const i = this._camera, t = 1 / i.zoom, e = i.left * t, s = i.right * t, n = i.top * t, r = i.bottom * t;
       this._nearPlaneCorners[0].set(e, n, 0), this._nearPlaneCorners[1].set(s, n, 0), this._nearPlaneCorners[2].set(s, r, 0), this._nearPlaneCorners[3].set(e, r, 0);
     }
@@ -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.
      */
@@ -6434,11 +6434,11 @@ const ys = class ys extends At {
  */
 C(ys, "uuid", "d1e814d5-b81c-4452-87a2-f039375e0489");
 let Or = ys;
-const xe = new yo(), bt = new Q(), Se = new Q(), Ot = new de(), Nr = {
+const xe = new yo(), bt = new Q(), Oe = 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";
@@ -6493,17 +6493,17 @@ class pc extends In {
       else if (e === "scale") {
         if (t.search("XYZ") !== -1) {
           let o = this.pointEnd.length() / this.pointStart.length();
-          this.pointEnd.dot(this.pointStart) < 0 && (o *= -1), Se.set(o, o, o);
+          this.pointEnd.dot(this.pointStart) < 0 && (o *= -1), Oe.set(o, o, o);
         } else
-          bt.copy(this.pointStart), Se.copy(this.pointEnd), bt.applyQuaternion(this._worldQuaternionInv), Se.applyQuaternion(this._worldQuaternionInv), Se.divide(bt), t.search("X") === -1 && (Se.x = 1), t.search("Y") === -1 && (Se.y = 1), t.search("Z") === -1 && (Se.z = 1);
-        s.scale.copy(this._scaleStart).multiply(Se), this.scaleSnap && (t.search("X") !== -1 && (s.scale.x = Math.round(s.scale.x / this.scaleSnap) * this.scaleSnap || this.scaleSnap), t.search("Y") !== -1 && (s.scale.y = Math.round(s.scale.y / this.scaleSnap) * this.scaleSnap || this.scaleSnap), t.search("Z") !== -1 && (s.scale.z = Math.round(s.scale.z / this.scaleSnap) * this.scaleSnap || this.scaleSnap));
+          bt.copy(this.pointStart), Oe.copy(this.pointEnd), bt.applyQuaternion(this._worldQuaternionInv), Oe.applyQuaternion(this._worldQuaternionInv), Oe.divide(bt), t.search("X") === -1 && (Oe.x = 1), t.search("Y") === -1 && (Oe.y = 1), t.search("Z") === -1 && (Oe.z = 1);
+        s.scale.copy(this._scaleStart).multiply(Oe), this.scaleSnap && (t.search("X") !== -1 && (s.scale.x = Math.round(s.scale.x / this.scaleSnap) * this.scaleSnap || this.scaleSnap), t.search("Y") !== -1 && (s.scale.y = Math.round(s.scale.y / this.scaleSnap) * this.scaleSnap || this.scaleSnap), t.search("Z") !== -1 && (s.scale.z = Math.round(s.scale.z / this.scaleSnap) * this.scaleSnap || this.scaleSnap));
       } else if (e === "rotate") {
         this._offset.copy(this.pointEnd).sub(this.pointStart);
         const o = 20 / this.worldPosition.distanceTo(bt.setFromMatrixPosition(this.camera.matrixWorld));
         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,
@@ -6707,16 +6707,16 @@ class Ac extends In {
         [new rt(new Gi(0.01, 2), s), null, null, null, "helper"]
       ],
       DELTA: [
-        [new Ae(R(), s), null, null, null, "helper"]
+        [new Fe(R(), s), null, null, null, "helper"]
       ],
       X: [
-        [new Ae(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
       ],
       Y: [
-        [new Ae(p, s.clone()), [0, -1e3, 0], [0, 0, Math.PI / 2], [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [0, -1e3, 0], [0, 0, Math.PI / 2], [1e6, 1, 1], "helper"]
       ],
       Z: [
-        [new Ae(p, s.clone()), [0, 0, -1e3], [0, -Math.PI / 2, 0], [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [0, 0, -1e3], [0, -Math.PI / 2, 0], [1e6, 1, 1], "helper"]
       ]
     }, w = {
       XYZE: [
@@ -6736,11 +6736,11 @@ class Ac extends In {
       ]
     }, L = {
       AXIS: [
-        [new Ae(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
       ]
     }, 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]]
@@ -6809,13 +6809,13 @@ class Ac extends In {
       ]
     }, M = {
       X: [
-        [new Ae(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
       ],
       Y: [
-        [new Ae(p, s.clone()), [0, -1e3, 0], [0, 0, Math.PI / 2], [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [0, -1e3, 0], [0, 0, Math.PI / 2], [1e6, 1, 1], "helper"]
       ],
       Z: [
-        [new Ae(p, s.clone()), [0, 0, -1e3], [0, -Math.PI / 2, 0], [1e6, 1, 1], "helper"]
+        [new Fe(p, s.clone()), [0, 0, -1e3], [0, -Math.PI / 2, 0], [1e6, 1, 1], "helper"]
       ]
     };
     function g(v) {
@@ -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);
     /**
@@ -7648,111 +7648,111 @@ class _c extends xi {
 }
 const Dr = /* @__PURE__ */ new Map([
   [
-    z.IFCRELAGGREGATES,
+    k.IFCRELAGGREGATES,
     {
       forRelated: "Decomposes",
       forRelating: "IsDecomposedBy"
     }
   ],
   [
-    z.IFCRELASSOCIATESMATERIAL,
+    k.IFCRELASSOCIATESMATERIAL,
     {
       forRelated: "HasAssociations",
       forRelating: "AssociatedTo"
     }
   ],
   [
-    z.IFCRELASSOCIATESCLASSIFICATION,
+    k.IFCRELASSOCIATESCLASSIFICATION,
     {
       forRelated: "HasAssociations",
       forRelating: "ClassificationForObjects"
     }
   ],
   [
-    z.IFCRELASSIGNSTOGROUP,
+    k.IFCRELASSIGNSTOGROUP,
     {
       forRelated: "HasAssignments",
       forRelating: "IsGroupedBy"
     }
   ],
   [
-    z.IFCRELDEFINESBYPROPERTIES,
+    k.IFCRELDEFINESBYPROPERTIES,
     {
       forRelated: "IsDefinedBy",
       forRelating: "DefinesOcurrence"
     }
   ],
   [
-    z.IFCRELDEFINESBYTYPE,
+    k.IFCRELDEFINESBYTYPE,
     {
       forRelated: "IsTypedBy",
       forRelating: "Types"
     }
   ],
   [
-    z.IFCRELDEFINESBYTEMPLATE,
+    k.IFCRELDEFINESBYTEMPLATE,
     {
       forRelated: "IsDefinedBy",
       forRelating: "Defines"
     }
   ],
   [
-    z.IFCRELCONTAINEDINSPATIALSTRUCTURE,
+    k.IFCRELCONTAINEDINSPATIALSTRUCTURE,
     {
       forRelated: "ContainedInStructure",
       forRelating: "ContainsElements"
     }
   ],
   [
-    z.IFCRELFLOWCONTROLELEMENTS,
+    k.IFCRELFLOWCONTROLELEMENTS,
     {
       forRelated: "AssignedToFlowElement",
       forRelating: "HasControlElements"
     }
   ],
   [
-    z.IFCRELCONNECTSELEMENTS,
+    k.IFCRELCONNECTSELEMENTS,
     {
       forRelated: "ConnectedFrom",
       forRelating: "ConnectedTo"
     }
   ],
   [
-    z.IFCRELASSIGNSTOPRODUCT,
+    k.IFCRELASSIGNSTOPRODUCT,
     {
       forRelated: "HasAssignments",
       forRelating: "ReferencedBy"
     }
   ],
   [
-    z.IFCRELDECLARES,
+    k.IFCRELDECLARES,
     {
       forRelated: "HasContext",
       forRelating: "Declares"
     }
   ],
   [
-    z.IFCRELASSIGNSTOCONTROL,
+    k.IFCRELASSIGNSTOCONTROL,
     {
       forRelated: "HasAssignments",
       forRelating: "Controls"
     }
   ],
   [
-    z.IFCRELNESTS,
+    k.IFCRELNESTS,
     {
       forRelated: "Nests",
       forRelating: "IsNestedBy"
     }
   ],
   [
-    z.IFCRELASSOCIATESDOCUMENT,
+    k.IFCRELASSOCIATESDOCUMENT,
     {
       forRelated: "HasAssociations",
       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++)
@@ -9047,7 +9047,7 @@ const ms = {
 class oi {
   static async getUnits(i) {
     var r, o, a;
-    const { IFCUNITASSIGNMENT: t } = z, e = await i.getAllPropertiesOfType(t);
+    const { IFCUNITASSIGNMENT: t } = k, e = await i.getAllPropertiesOfType(t);
     if (!e)
       return 1;
     const s = Object.keys(e), n = e[parseInt(s[0], 10)];
@@ -9098,19 +9098,19 @@ class oi {
   static async getQsetQuantities(i, t, e) {
     const n = e ?? (() => {
     }), r = await i.getProperties(t);
-    return !r || r.type !== z.IFCELEMENTQUANTITY ? null : (r.Quantities ?? [{}]).map((l) => (l.value && n(l.value), l.value)).filter((l) => l !== null);
+    return !r || r.type !== k.IFCELEMENTQUANTITY ? null : (r.Quantities ?? [{}]).map((l) => (l.value && n(l.value), l.value)).filter((l) => l !== null);
   }
   static async getPsetProps(i, t, e) {
     const n = e ?? (() => {
     }), r = await i.getProperties(t);
-    return !r || r.type !== z.IFCPROPERTYSET ? null : (r.HasProperties ?? [{}]).map((l) => (l.value && n(l.value), l.value)).filter((l) => l !== null);
+    return !r || r.type !== k.IFCPROPERTYSET ? null : (r.HasProperties ?? [{}]).map((l) => (l.value && n(l.value), l.value)).filter((l) => l !== null);
   }
   static async getPsetRel(i, t) {
     var o;
     if (!await i.getProperties(t))
       return null;
     const s = await i.getAllPropertiesOfType(
-      z.IFCRELDEFINESBYPROPERTIES
+      k.IFCRELDEFINESBYPROPERTIES
     );
     if (!s)
       return null;
@@ -10340,7 +10340,7 @@ class Mc {
     try {
       const e = i.GetLineIDsWithType(
         0,
-        z.IFCUNITASSIGNMENT
+        k.IFCUNITASSIGNMENT
       ).get(0), s = i.GetLine(0, e);
       for (const n of s.Units) {
         if (!n || n.value === null || n.value === void 0)
@@ -10387,11 +10387,11 @@ class no {
     try {
       const t = i.GetLineIDsWithType(
         0,
-        z.IFCRELCONTAINEDINSPATIALSTRUCTURE
-      ), e = /* @__PURE__ */ new Set(), s = i.GetLineIDsWithType(0, z.IFCSPACE);
+        k.IFCRELCONTAINEDINSPATIALSTRUCTURE
+      ), e = /* @__PURE__ */ new Set(), s = i.GetLineIDsWithType(0, k.IFCSPACE);
       for (let l = 0; l < s.size(); l++)
         e.add(s.get(l));
-      const n = i.GetLineIDsWithType(0, z.IFCRELAGGREGATES), r = n.size();
+      const n = i.GetLineIDsWithType(0, k.IFCRELAGGREGATES), r = n.size();
       for (let l = 0; l < r; l++) {
         const h = n.get(l), f = i.GetLine(0, h);
         if (!f || !f.RelatingObject || !f.RelatedObjects)
@@ -10454,12 +10454,12 @@ class Yn {
      * Generate the geometry for categories that are not included by default,
      * like IFCSPACE.
      */
-    C(this, "optionalCategories", [z.IFCSPACE]);
+    C(this, "optionalCategories", [k.IFCSPACE]);
     /** Path of the WASM for [web-ifc](https://github.com/ThatOpen/engine_web-ifc). */
     C(this, "wasm", {
       path: "",
       absolute: !1,
-      logLevel: z.LogLevel.LOG_LEVEL_OFF
+      logLevel: k.LogLevel.LOG_LEVEL_OFF
     });
     /** List of categories that won't be converted to fragments. */
     C(this, "excludedCategories", /* @__PURE__ */ new Set());
@@ -10544,7 +10544,7 @@ class ro {
 class oo {
   getNameInfo(i) {
     var f;
-    const t = {}, { arguments: e } = i.GetHeaderLine(0, z.FILE_NAME) || {};
+    const t = {}, { arguments: e } = i.GetHeaderLine(0, k.FILE_NAME) || {};
     if (!e)
       return t;
     const [
@@ -10565,7 +10565,7 @@ class oo {
   }
   getDescriptionInfo(i) {
     var r;
-    const t = {}, { arguments: e } = i.GetHeaderLine(0, z.FILE_DESCRIPTION) || {};
+    const t = {}, { arguments: e } = i.GetHeaderLine(0, k.FILE_DESCRIPTION) || {};
     if (!e)
       return t;
     const [s, n] = e;
@@ -10579,15 +10579,15 @@ class oo {
 class ao {
   static get(i, t) {
     const e = [
-      z.IFCPROJECT,
-      z.IFCSITE,
-      z.IFCBUILDING,
-      z.IFCBUILDINGSTOREY,
-      z.IFCSPACE,
-      z.IFCROAD,
-      z.IFCFACILITY,
-      z.IFCFACILITYPART,
-      z.IFCBRIDGE
+      k.IFCPROJECT,
+      k.IFCSITE,
+      k.IFCBUILDING,
+      k.IFCBUILDINGSTOREY,
+      k.IFCSPACE,
+      k.IFCROAD,
+      k.IFCFACILITY,
+      k.IFCFACILITYPART,
+      k.IFCBRIDGE
     ], s = i.data;
     for (const n of e) {
       const r = t.GetLineIDsWithType(0, n), o = r.size();
@@ -10748,11 +10748,11 @@ const co = /* @__PURE__ */ new Set([
    */
   async export(t, e, s = !1, n = !0) {
     const r = {}, o = new Set(t.GetIfcEntityList(e)), a = /* @__PURE__ */ new Set([
-      z.IFCPROJECT,
-      z.IFCSITE,
-      z.IFCBUILDING,
-      z.IFCBUILDINGSTOREY,
-      z.IFCSPACE
+      k.IFCPROJECT,
+      k.IFCSITE,
+      k.IFCBUILDING,
+      k.IFCBUILDINGSTOREY,
+      k.IFCSPACE
     ]);
     for (const l of a)
       o.add(l);
@@ -10800,7 +10800,7 @@ const bi = class bi extends At {
     /**
      * The instance of the Web-IFC library used for handling IFC data.
      */
-    C(this, "webIfc", new z.IfcAPI());
+    C(this, "webIfc", new k.IfcAPI());
     /** {@link Component.enabled} */
     C(this, "enabled", !0);
     C(this, "_material", new D.MeshLambertMaterial());
@@ -10813,7 +10813,7 @@ const bi = class bi extends At {
       transparent: !0,
       opacity: 0.5
     }));
-    this.components.add(bi.uuid, this), this.settings.excludedCategories.add(z.IFCOPENINGELEMENT);
+    this.components.add(bi.uuid, this), this.settings.excludedCategories.add(k.IFCOPENINGELEMENT);
   }
   /** {@link Disposable.dispose} */
   dispose() {
@@ -10915,7 +10915,7 @@ const bi = class bi extends At {
     } catch {
       console.log("Web-ifc wasn't disposed.");
     }
-    this.webIfc = null, this.webIfc = new z.IfcAPI(), this._visitedFragments.clear(), this._fragmentInstances.clear();
+    this.webIfc = null, this.webIfc = new k.IfcAPI(), this._visitedFragments.clear(), this._fragmentInstances.clear();
   }
   async getAllGeometries() {
     this._spatialTree.setUp(this.webIfc);
@@ -10930,7 +10930,7 @@ const bi = class bi extends At {
     };
     const s = [];
     for (const r of t) {
-      if (!this.webIfc.IsIfcElement(r) && r !== z.IFCSPACE)
+      if (!this.webIfc.IsIfcElement(r) && r !== k.IFCSPACE)
         continue;
       const o = this.settings.includedCategories;
       if (o.size > 0 && !o.has(r))
@@ -11061,27 +11061,27 @@ const Dc = {
   IfcRelDefinesByTemplate: { related: 5, relating: 6 }
 }, bc = {
   // IfcRelAssigns
-  [z.IFCRELASSIGNSTOCONTROL]: "IfcRelAssignsToControl",
-  [z.IFCRELASSIGNSTOGROUP]: "IfcRelAssignsToGroup",
-  [z.IFCRELASSIGNSTOPRODUCT]: "IfcRelAssignsToProduct",
+  [k.IFCRELASSIGNSTOCONTROL]: "IfcRelAssignsToControl",
+  [k.IFCRELASSIGNSTOGROUP]: "IfcRelAssignsToGroup",
+  [k.IFCRELASSIGNSTOPRODUCT]: "IfcRelAssignsToProduct",
   // IfcRelAssociates
-  [z.IFCRELASSOCIATESCLASSIFICATION]: "IfcRelAssociatesClassification",
-  [z.IFCRELASSOCIATESMATERIAL]: "IfcRelAssociatesMaterial",
-  [z.IFCRELASSOCIATESDOCUMENT]: "IfcRelAssociatesDocument",
+  [k.IFCRELASSOCIATESCLASSIFICATION]: "IfcRelAssociatesClassification",
+  [k.IFCRELASSOCIATESMATERIAL]: "IfcRelAssociatesMaterial",
+  [k.IFCRELASSOCIATESDOCUMENT]: "IfcRelAssociatesDocument",
   // IfcRelConnects
-  [z.IFCRELCONTAINEDINSPATIALSTRUCTURE]: "IfcRelContainedInSpatialStructure",
-  [z.IFCRELCONNECTSELEMENTS]: "IfcRelConnectsElements",
-  [z.IFCRELFLOWCONTROLELEMENTS]: "IfcRelFlowControlElements",
+  [k.IFCRELCONTAINEDINSPATIALSTRUCTURE]: "IfcRelContainedInSpatialStructure",
+  [k.IFCRELCONNECTSELEMENTS]: "IfcRelConnectsElements",
+  [k.IFCRELFLOWCONTROLELEMENTS]: "IfcRelFlowControlElements",
   // IfcRelDeclares
-  [z.IFCRELDECLARES]: "IfcRelDeclares",
+  [k.IFCRELDECLARES]: "IfcRelDeclares",
   // IfcRelDecomposes
-  [z.IFCRELAGGREGATES]: "IfcRelAggregates",
-  [z.IFCRELNESTS]: "IfcRelNests",
+  [k.IFCRELAGGREGATES]: "IfcRelAggregates",
+  [k.IFCRELNESTS]: "IfcRelNests",
   // IfcRelDefines
-  [z.IFCRELDEFINESBYPROPERTIES]: "IfcRelDefinesByProperties",
-  [z.IFCRELDEFINESBYTYPE]: "IfcRelDefinesByType",
-  [z.IFCRELDEFINESBYTEMPLATE]: "IfcRelDefinesByTemplate"
-}, ye = class ye extends At {
+  [k.IFCRELDEFINESBYPROPERTIES]: "IfcRelDefinesByProperties",
+  [k.IFCRELDEFINESBYTYPE]: "IfcRelDefinesByType",
+  [k.IFCRELDEFINESBYTEMPLATE]: "IfcRelDefinesByTemplate"
+}, me = class me extends At {
   constructor(t) {
     super(t);
     /** {@link Disposable.onDisposed} */
@@ -11131,11 +11131,11 @@ const Dc = {
      * Map of changed entities in the model.
      */
     C(this, "changeMap", {});
-    this.components.add(ye.uuid, this);
+    this.components.add(me.uuid, this);
   }
   /** {@link Disposable.dispose} */
   dispose() {
-    this.selectedModel = void 0, this.attributeListeners = {}, this.changeMap = {}, this.onElementToPset.reset(), this.onPropToPset.reset(), this.onPsetRemoved.reset(), this.onDataChanged.reset(), this.onDisposed.trigger(ye.uuid), this.onDisposed.reset();
+    this.selectedModel = void 0, this.attributeListeners = {}, this.changeMap = {}, this.onElementToPset.reset(), this.onPropToPset.reset(), this.onPsetRemoved.reset(), this.onDataChanged.reset(), this.onDisposed.trigger(me.uuid), this.onDisposed.reset();
   }
   /**
    * Static method to retrieve the IFC schema from a given model.
@@ -11181,23 +11181,14 @@ const Dc = {
    * @throws Will throw an error if no OwnerHistory is found in the model.
    */
   async newPset(t, e, s) {
-    const n = ye.getIFCSchema(t), { ownerHistoryHandle: r } = await this.getOwnerHistory(t), o = this.newGUID(t), a = new z[n].IfcLabel(e), l = s ? new z[n].IfcText(s) : null, h = new z[n].IfcPropertySet(
+    const n = me.getIFCSchema(t), { ownerHistoryHandle: r } = await this.getOwnerHistory(t), o = this.newGUID(t), a = new k[n].IfcLabel(e), l = s ? new k[n].IfcText(s) : null, h = new k[n].IfcPropertySet(
       o,
       r,
       a,
       l,
       []
     );
-    h.expressID = this.getNewExpressID(t);
-    const f = this.newGUID(t), I = new z[n].IfcRelDefinesByProperties(
-      f,
-      r,
-      null,
-      null,
-      [],
-      new z.Handle(h.expressID)
-    );
-    return I.expressID = this.getNewExpressID(t), await this.setData(t, h, I), { pset: h, rel: I };
+    return h.expressID = this.getNewExpressID(t), await this.setData(t, h), { pset: h };
   }
   /**
    * Removes a Property Set (Pset) from the given model.
@@ -11214,7 +11205,7 @@ const Dc = {
   async removePset(t, ...e) {
     for (const s of e) {
       const n = await t.getProperties(s);
-      if ((n == null ? void 0 : n.type) !== z.IFCPROPERTYSET)
+      if ((n == null ? void 0 : n.type) !== k.IFCPROPERTYSET)
         continue;
       const r = await oi.getPsetRel(t, s);
       if (r && (await t.setProperties(r, null), this.registerChange(t, r)), n) {
@@ -11286,16 +11277,16 @@ const Dc = {
    */
   async removePsetProp(t, e, s) {
     const n = await t.getProperties(e), r = await t.getProperties(s);
-    !n || !r || n.type === z.IFCPROPERTYSET && r && (n.HasProperties = n.HasProperties.filter((o) => o.value !== s), await t.setProperties(s, null), this.registerChange(t, e, s));
+    !n || !r || n.type === k.IFCPROPERTYSET && r && (n.HasProperties = n.HasProperties.filter((o) => o.value !== s), await t.setProperties(s, null), this.registerChange(t, e, s));
   }
   /**
    * @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" },
+      { type: k.IFCRELDEFINESBYPROPERTIES, inv: "DefinesOcurrence" },
       ...s
     );
   }
@@ -11318,7 +11309,7 @@ const Dc = {
       for (const r of s) {
         if (n.HasProperties.includes(r))
           continue;
-        const o = new z.Handle(r);
+        const o = new k.Handle(r);
         n.HasProperties.push(o), this.onPropToPset.trigger({ model: t, psetID: e, propID: r });
       }
       this.registerChange(t, e);
@@ -11340,16 +11331,16 @@ const Dc = {
     const r = bc[e];
     if (!r)
       throw new Error(`IfcPropertiesManager: ${r} is unsoported.`);
-    const o = t.ifcMetadata.schema, a = Dc[r], l = z[o][r];
+    const o = me.getIFCSchema(t), a = Dc[r], l = k[o][r];
     if (!(a && l))
       throw new Error(`IfcPropertiesManager: ${r} is unsoported.`);
-    const h = [new z[o].IfcGloballyUniqueId(oe.create())], { related: f, relating: I } = a, d = [...new Set(n)].map(
-      (p) => new z.Handle(p)
+    const h = [new k[o].IfcGloballyUniqueId(oe.create())], { related: f, relating: I } = a, d = [...new Set(n)].map(
+      (p) => new k.Handle(p)
     ), E = (p, m) => {
       for (let F = p; F < m - 1; F++)
         h.push(null);
     };
-    f < I ? (E(1, f), h.push(d), E(f, I), h.push(new z.Handle(s))) : (E(1, I), E(I, f), h.push(new z.Handle(s)), h.push(d));
+    f < I ? (E(1, f), h.push(d), E(f, I), h.push(new k.Handle(s))) : (E(1, I), E(I, f), h.push(new k.Handle(s)), h.push(d));
     const T = new l(...h);
     return await this.setData(t, T), T;
   }
@@ -11365,7 +11356,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);
@@ -11390,7 +11381,7 @@ const Dc = {
       return null;
     const n = [];
     for (const r in s) {
-      const o = new z.Handle(Number(r));
+      const o = new k.Handle(Number(r));
       n.push(o);
     }
     return n;
@@ -11439,16 +11430,16 @@ const Dc = {
     return t.ifcMetadata.maxExpressID++, t.ifcMetadata.maxExpressID;
   }
   newGUID(t) {
-    const e = ye.getIFCSchema(t);
-    return new z[e].IfcGloballyUniqueId(oe.create());
+    const e = me.getIFCSchema(t);
+    return new k[e].IfcGloballyUniqueId(oe.create());
   }
   async getOwnerHistory(t) {
     const e = await t.getAllPropertiesOfType(
-      z.IFCOWNERHISTORY
+      k.IFCOWNERHISTORY
     );
     if (!e)
       throw new Error("No OwnerHistory was found.");
-    const s = Object.keys(e).map((o) => parseInt(o, 10)), n = e[s[0]], r = new z.Handle(n.expressID);
+    const s = Object.keys(e).map((o) => parseInt(o, 10)), n = e[s[0]], r = new k.Handle(n.expressID);
     return { ownerHistory: n, ownerHistoryHandle: r };
   }
   registerChange(t, ...e) {
@@ -11457,7 +11448,7 @@ const Dc = {
       this.changeMap[t.uuid].add(s), this.onDataChanged.trigger({ model: t, expressID: s });
   }
   async newSingleProperty(t, e, s, n) {
-    const r = ye.getIFCSchema(t), o = new z[r].IfcIdentifier(s), a = new z[r][e](n), l = new z[r].IfcPropertySingleValue(
+    const r = me.getIFCSchema(t), o = new k[r].IfcIdentifier(s), a = new k[r][e](n), l = new k[r].IfcPropertySingleValue(
       o,
       null,
       a,
@@ -11470,8 +11461,8 @@ const Dc = {
  * A unique identifier for the component.
  * This UUID is used to register the component within the Components system.
  */
-C(ye, "uuid", "58c2d9f0-183c-48d6-a402-dfcf5b9a34df");
-let yn = ye;
+C(me, "uuid", "58c2d9f0-183c-48d6-a402-dfcf5b9a34df");
+let yn = me;
 const vi = class vi extends At {
   constructor(t) {
     super(t);
@@ -11526,21 +11517,21 @@ const vi = class vi extends At {
       "DocumentRefForObjects"
     ]);
     C(this, "_ifcRels", [
-      z.IFCRELAGGREGATES,
-      z.IFCRELASSOCIATESMATERIAL,
-      z.IFCRELASSOCIATESCLASSIFICATION,
-      z.IFCRELASSIGNSTOGROUP,
-      z.IFCRELDEFINESBYPROPERTIES,
-      z.IFCRELDEFINESBYTYPE,
-      z.IFCRELDEFINESBYTEMPLATE,
-      z.IFCRELCONTAINEDINSPATIALSTRUCTURE,
-      z.IFCRELFLOWCONTROLELEMENTS,
-      z.IFCRELCONNECTSELEMENTS,
-      z.IFCRELASSIGNSTOPRODUCT,
-      z.IFCRELDECLARES,
-      z.IFCRELASSIGNSTOCONTROL,
-      z.IFCRELNESTS,
-      z.IFCRELASSOCIATESDOCUMENT
+      k.IFCRELAGGREGATES,
+      k.IFCRELASSOCIATESMATERIAL,
+      k.IFCRELASSOCIATESCLASSIFICATION,
+      k.IFCRELASSIGNSTOGROUP,
+      k.IFCRELDEFINESBYPROPERTIES,
+      k.IFCRELDEFINESBYTYPE,
+      k.IFCRELDEFINESBYTEMPLATE,
+      k.IFCRELCONTAINEDINSPATIALSTRUCTURE,
+      k.IFCRELFLOWCONTROLELEMENTS,
+      k.IFCRELCONNECTSELEMENTS,
+      k.IFCRELASSIGNSTOPRODUCT,
+      k.IFCRELDECLARES,
+      k.IFCRELASSIGNSTOCONTROL,
+      k.IFCRELNESTS,
+      k.IFCRELASSOCIATESDOCUMENT
     ]);
     C(this, "onFragmentsDisposed", (t) => {
       delete this.relationMaps[t.groupID];
@@ -11858,7 +11849,7 @@ const vi = class vi extends At {
             const d = Object.keys(u), E = d.find((p) => p.startsWith("Related")), T = d.find((p) => p.startsWith("Relating"));
             if (!(E && T))
               continue;
-            u[E] = [...f].map((p) => new z.Handle(p)), u[T] = new z.Handle(l), await e.setData(n, u);
+            u[E] = [...f].map((p) => new k.Handle(p)), u[T] = new k.Handle(l), await e.setData(n, u);
           } else {
             const u = await e.createIfcRel(
               n,
@@ -11959,8 +11950,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 +11979,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 +12028,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 +12175,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;
@@ -13719,8 +13710,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           A[X] = 0;
       }
       function V(A) {
-        var X = A.state, k = X.pending;
-        k > A.avail_out && (k = A.avail_out), k !== 0 && (r.arraySet(A.output, X.pending_buf, X.pending_out, k, A.next_out), A.next_out += k, X.pending_out += k, A.total_out += k, A.avail_out -= k, X.pending -= k, X.pending === 0 && (X.pending_out = 0));
+        var X = A.state, z = X.pending;
+        z > A.avail_out && (z = A.avail_out), z !== 0 && (r.arraySet(A.output, X.pending_buf, X.pending_out, z, A.next_out), A.next_out += z, X.pending_out += z, A.total_out += z, A.avail_out -= z, X.pending -= z, X.pending === 0 && (X.pending_out = 0));
       }
       function x(A, X) {
         o._tr_flush_block(A, 0 <= A.block_start ? A.block_start : -1, A.strstart - A.block_start, X), A.block_start = A.strstart, V(A.strm);
@@ -13732,85 +13723,85 @@ 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 z, _, 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++;
+          if (K[(z = X) + $] === dt && K[z + $ - 1] === Rt && K[z] === K[U] && K[++z] === K[U + 1]) {
+            U += 2, z++;
             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))
+            while (K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && K[++U] === K[++z] && U < ct);
+            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, z, _, 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 = z = A.hash_size; _ = A.head[--X], A.head[X] = J <= _ ? _ - J : 0, --z; )
               ;
-            for (X = k = J; P = A.prev[--X], A.prev[X] = J <= P ? P - J : 0, --k; )
+            for (X = z = J; _ = A.prev[--X], A.prev[X] = J <= _ ? _ - J : 0, --z; )
               ;
-            _ += 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), z = 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 += z, 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 z, _; ; ) {
           if (A.lookahead < Y) {
             if (St(A), A.lookahead < Y && X === f)
               return g;
             if (A.lookahead === 0)
               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) {
-              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; )
+          if (z = 0, A.lookahead >= L && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, z = A.prev[A.strstart & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = A.strstart), z !== 0 && A.strstart - z <= A.w_size - Y && (A.match_length = tt(A, z)), A.match_length >= 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, z = 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 z, _, P; ; ) {
           if (A.lookahead < Y) {
             if (St(A), A.lookahead < Y && X === f)
               return g;
             if (A.lookahead === 0)
               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; )
+          if (z = 0, A.lookahead >= L && (A.ins_h = (A.ins_h << A.hash_shift ^ A.window[A.strstart + L - 1]) & A.hash_mask, z = 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, z !== 0 && A.prev_length < A.max_lazy_match && A.strstart - z <= A.w_size - Y && (A.match_length = tt(A, z), 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 (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, z = 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, z, _, P) {
+        this.good_length = A, this.max_lazy = X, this.nice_length = z, 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;
@@ -13821,23 +13812,23 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function Ht(A) {
         var X = Ct(A);
-        return X === u && function(k) {
-          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;
+        return X === u && function(z) {
+          z.window_size = 2 * z.w_size, nt(z.head), z.max_lazy_match = n[z.level].max_lazy, z.good_match = n[z.level].good_length, z.nice_match = n[z.level].nice_length, z.max_chain_length = n[z.level].max_chain, z.strstart = 0, z.block_start = 0, z.lookahead = 0, z.insert = 0, z.match_length = z.prev_length = L - 1, z.match_available = 0, z.ins_h = 0;
         }(A.state), X;
       }
-      function Dt(A, X, k, P, _, U) {
+      function Dt(A, X, z, _, 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 || z !== 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 = z, Ht(A);
       }
       n = [new It(0, 0, 0, 0, function(A, X) {
-        var k = 65535;
-        for (k > A.pending_buf_size - 5 && (k = A.pending_buf_size - 5); ; ) {
+        var z = 65535;
+        for (z > A.pending_buf_size - 5 && (z = A.pending_buf_size - 5); ; ) {
           if (A.lookahead <= 1) {
             if (St(A), A.lookahead === 0 && X === f)
               return g;
@@ -13845,8 +13836,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 + z;
+          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 +13846,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 z, _, 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, z = _.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;
-        } else if (A.avail_in === 0 && W(X) <= W(k) && X !== I)
+            return _.last_flush = -1, u;
+        } else if (A.avail_in === 0 && W(X) <= W(z) && 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 +13910,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,26 +13929,26 @@ 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;
-        if (!A || !A.state || (U = (k = A.state).wrap) === 2 || U === 1 && k.status !== N || k.lookahead)
+        var z, _, P, U, $, Z, B, K, st = X.length;
+        if (!A || !A.state || (U = (z = A.state).wrap) === 2 || U === 1 && z.status !== N || z.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 (U === 1 && (A.adler = a(A.adler, X, st, 0)), z.wrap = 0, st >= z.w_size && (U === 0 && (nt(z.head), z.strstart = 0, z.block_start = 0, z.insert = 0), K = new r.Buf8(z.w_size), r.arraySet(K, X, st - z.w_size, z.w_size, 0), X = K, st = z.w_size), $ = A.avail_in, Z = A.next_in, B = A.input, A.avail_in = st, A.next_in = 0, A.input = X, St(z); z.lookahead >= L; ) {
+          for (_ = z.strstart, P = z.lookahead - (L - 1); z.ins_h = (z.ins_h << z.hash_shift ^ z.window[_ + L - 1]) & z.hash_mask, z.prev[_ & z.w_mask] = z.head[z.ins_h], z.head[z.ins_h] = _, _++, --P; )
             ;
-          k.strstart = P, k.lookahead = L - 1, St(k);
+          z.strstart = _, z.lookahead = L - 1, St(z);
         }
-        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;
+        return z.strstart += z.lookahead, z.block_start = z.strstart, z.insert = z.lookahead, z.lookahead = 0, z.match_length = z.prev_length = L - 1, z.match_available = 0, A.next_in = Z, A.input = B, A.avail_in = $, z.wrap = U, u;
       }, s.deflateInfo = "pako deflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(t, e, s) {
       e.exports = function() {
@@ -14093,7 +14084,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, z, _, 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;
@@ -14297,14 +14288,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 }
                 for (; g.have < 19; )
                   g.lens[$[g.have++]] = 0;
-                if (g.lencode = g.lendyn, g.lenbits = 7, k = { bits: g.lenbits }, X = l(0, g.lens, 0, 19, g.lencode, 0, g.work, k), g.lenbits = k.bits, X) {
+                if (g.lencode = g.lendyn, g.lenbits = 7, z = { bits: g.lenbits }, X = l(0, g.lens, 0, 19, g.lencode, 0, g.work, z), g.lenbits = z.bits, X) {
                   N.msg = "invalid code lengths set", g.mode = 30;
                   break;
                 }
                 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 +14304,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 +14315,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;
@@ -14352,11 +14343,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   N.msg = "invalid code -- missing end-of-block", g.mode = 30;
                   break;
                 }
-                if (g.lenbits = 9, k = { bits: g.lenbits }, X = l(h, g.lens, 0, g.nlen, g.lencode, 0, g.work, k), g.lenbits = k.bits, X) {
+                if (g.lenbits = 9, z = { bits: g.lenbits }, X = l(h, g.lens, 0, g.nlen, g.lencode, 0, g.work, z), g.lenbits = z.bits, X) {
                   N.msg = "invalid literal/lengths set", g.mode = 30;
                   break;
                 }
-                if (g.distbits = 6, g.distcode = g.distdyn, k = { bits: g.distbits }, X = l(f, g.lens, g.nlen, g.ndist, g.distcode, 0, g.work, k), g.distbits = k.bits, X) {
+                if (g.distbits = 6, g.distcode = g.distdyn, z = { bits: g.distbits }, X = l(f, g.lens, g.nlen, g.ndist, g.distcode, 0, g.work, z), g.distbits = z.bits, X) {
                   N.msg = "invalid distances set", g.mode = 30;
                   break;
                 }
@@ -14369,13 +14360,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 +14388,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 +14397,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 +14417,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 +14551,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 +14566,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,34 +14653,34 @@ 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) {
+      var z = !1;
+      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(_) {
-        k || (function() {
+      s._tr_init = function(P) {
+        z || (function() {
           var U, $, Z, B, K, st = new Array(T + 1);
           for (B = Z = 0; B < h - 1; B++)
             for (v[B] = Z, U = 0; U < 1 << y[B]; U++)
@@ -14713,10 +14704,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) {
+        }(), z = !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 +14718,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 +14883,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 +14896,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 +14916,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 +14938,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 +14968,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 +15023,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 +15062,7 @@ function kc(c, i) {
     }
   return i;
 }
-function Pt(c, i, t) {
+function _t(c, i, t) {
   return {
     err: {
       code: c,
@@ -15308,7 +15299,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 +15322,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 +15537,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 +15561,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 +15576,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 +15585,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 +15853,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 +16075,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 +16601,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 +17084,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 +17116,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);
   }
   /**
@@ -17250,7 +17241,7 @@ const Ps = class Ps {
         n = !1;
         break;
       }
-      if (s === null && (s = Object.keys(new z.IFC4[t]()), s = s.slice(2), s === null)) {
+      if (s === null && (s = Object.keys(new k.IFC4[t]()), s = s.slice(2), s === null)) {
         if (this.inclusive)
           continue;
         n = !1;
@@ -17331,8 +17322,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 +17489,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 +17874,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 +18147,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());
     /**
@@ -18183,7 +18174,7 @@ const xs = class xs extends At {
     /**
      * The WebIFC API instance used for IFC file processing.
      */
-    C(this, "webIfc", new z.IfcAPI());
+    C(this, "webIfc", new k.IfcAPI());
     C(this, "_nextAvailableID", 0);
     C(this, "_splittedGeometries", /* @__PURE__ */ new Map());
     C(this, "_spatialTree", new no());
@@ -18196,7 +18187,7 @@ const xs = class xs extends At {
     C(this, "_groupSerializer", new Qt.Serializer());
     C(this, "_assets", []);
     C(this, "_meshesWithHoles", /* @__PURE__ */ new Set());
-    this.components.add(xs.uuid, this), this.settings.excludedCategories.add(z.IFCOPENINGELEMENT);
+    this.components.add(xs.uuid, this), this.settings.excludedCategories.add(k.IFCOPENINGELEMENT);
   }
   /** {@link Disposable.dispose} */
   dispose() {
@@ -18257,7 +18248,7 @@ const xs = class xs extends At {
     };
     let o = 0, a = 0;
     for (const E of s) {
-      if (!this.webIfc.IsIfcElement(E) && E !== z.IFCSPACE || this.settings.excludedCategories.has(E))
+      if (!this.webIfc.IsIfcElement(E) && E !== k.IFCSPACE || this.settings.excludedCategories.has(E))
         continue;
       const T = this.webIfc.GetLineIDsWithType(0, E), p = T.size();
       for (let m = 0; m < p; m++) {
@@ -18297,7 +18288,7 @@ const xs = class xs extends At {
       this.webIfc.Dispose();
     } catch {
     }
-    this.webIfc = null, this.webIfc = new z.IfcAPI(), this._visitedGeometries.clear(), this._geometries.clear(), this._assets = [], this._meshesWithHoles.clear();
+    this.webIfc = null, this.webIfc = new k.IfcAPI(), this._visitedGeometries.clear(), this._geometries.clear(), this._assets = [], this._meshesWithHoles.clear();
   }
   getMesh(t, e, s) {
     const n = e.geometries.size(), r = e.expressID, o = { id: r, geometries: [] };
@@ -18425,17 +18416,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} */
@@ -18447,7 +18438,7 @@ class eh extends At {
     /**
      * An instance of the IfcAPI class from the Web-IFC library, which provides methods for reading and processing IFC data.
      */
-    C(this, "webIfc", new z.IfcAPI());
+    C(this, "webIfc", new k.IfcAPI());
   }
   /** {@link Disposable.dispose} */
   async dispose() {
@@ -18481,11 +18472,11 @@ class eh extends At {
   }
   async streamAllProperties() {
     const { propertiesSize: t } = this.settings, e = new Set(this.webIfc.GetIfcEntityList(0)), s = /* @__PURE__ */ new Set([
-      z.IFCPROJECT,
-      z.IFCSITE,
-      z.IFCBUILDING,
-      z.IFCBUILDINGSTOREY,
-      z.IFCSPACE
+      k.IFCPROJECT,
+      k.IFCSITE,
+      k.IFCBUILDING,
+      k.IFCBUILDINGSTOREY,
+      k.IFCSPACE
     ]);
     for (const l of s)
       e.add(l);
@@ -18525,11 +18516,11 @@ 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() {
-    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new z.IfcAPI();
+    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new k.IfcAPI();
   }
 }
 /**
@@ -18748,7 +18739,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,
@@ -19704,7 +19695,7 @@ class ks {
     this.testResult.push(n);
   }
 }
-const me = (c, i) => {
+const Re = (c, i) => {
   let t = "";
   return i ? (i.type === "simple" && (t = `<ids:simpleValue>${i.parameter}</ids:simpleValue>`), i.type === "enumeration" && (t = `<xs:restriction base="xs:string">
     ${i.parameter.map((n) => `<xs:enumeration value="${n}" />`).join(`\r
@@ -19723,7 +19714,7 @@ class rh extends ks {
     this.name = e;
   }
   serialize(t) {
-    const e = me("Name", this.name), s = me("Value", this.value);
+    const e = Re("Name", this.name), s = Re("Value", this.value);
     let n = "";
     return t === "requirement" && (n += `cardinality="${this.cardinality}"`, n += this.instructions ? `instructions="${this.instructions}"` : ""), `<ids:attribute ${n}>
   ${e}
@@ -19825,7 +19816,7 @@ class oh extends ks {
     this.system = e;
   }
   serialize(t) {
-    const e = me("System", this.system), s = me("Value", this.value);
+    const e = Re("System", this.system), s = Re("Value", this.value);
     let n = "";
     return t === "requirement" && (n += `cardinality="${this.cardinality}"`, n += this.uri ? `uri=${this.uri}` : "", n += this.instructions ? `instructions="${this.instructions}"` : ""), `<ids:classification ${n}>
   ${e}
@@ -19835,9 +19826,9 @@ class oh extends ks {
   async getEntities(t, e = {}) {
     var h;
     const s = [], n = await t.getAllPropertiesOfType(
-      z.IFCCLASSIFICATIONREFERENCE
+      k.IFCCLASSIFICATIONREFERENCE
     ), r = await t.getAllPropertiesOfType(
-      z.IFCCLASSIFICATION
+      k.IFCCLASSIFICATION
     ), o = { ...n, ...r }, a = [];
     for (const f in o) {
       const I = Number(f), u = await t.getProperties(I);
@@ -19849,7 +19840,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,
@@ -19884,7 +19875,7 @@ class oh extends ks {
           continue;
         if (f = !1, !(this.value && this.system))
           break;
-        if (d.type !== z.IFCCLASSIFICATIONREFERENCE)
+        if (d.type !== k.IFCCLASSIFICATIONREFERENCE)
           continue;
         const T = !this.value || this.evalValue(d, l), p = !this.uri || this.evalURI(d, l);
         if (T && p)
@@ -19909,14 +19900,14 @@ class oh extends ks {
     if (!s)
       return null;
     const n = await t.getProperties(s);
-    return n ? (n.type === z.IFCCLASSIFICATIONREFERENCE && (n.ReferencedSource = await this.processReferencedSource(
+    return n ? (n.type === k.IFCCLASSIFICATIONREFERENCE && (n.ReferencedSource = await this.processReferencedSource(
       t,
       n
     )), n) : null;
   }
   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"
@@ -19924,14 +19915,14 @@ class oh extends ks {
     if (r)
       for (const I of r) {
         const u = await t.getProperties(I);
-        u && (u.type === z.IFCCLASSIFICATION && s.push(u), u.type === z.IFCCLASSIFICATIONREFERENCE && (u.ReferencedSource = await this.processReferencedSource(
+        u && (u.type === k.IFCCLASSIFICATION && s.push(u), u.type === k.IFCCLASSIFICATIONREFERENCE && (u.ReferencedSource = await this.processReferencedSource(
           t,
           u
         ), u.ReferencedSource && s.push(u)));
       }
     const o = s.map((I) => {
       var u, d, E;
-      return I.type === z.IFCCLASSIFICATION ? (u = I.Name) == null ? void 0 : u.value : I.type === z.IFCCLASSIFICATIONREFERENCE ? (E = (d = I.ReferencedSource) == null ? void 0 : d.Name) == null ? void 0 : E.value : null;
+      return I.type === k.IFCCLASSIFICATION ? (u = I.Name) == null ? void 0 : u.value : I.type === k.IFCCLASSIFICATIONREFERENCE ? (E = (d = I.ReferencedSource) == null ? void 0 : d.Name) == null ? void 0 : E.value : null;
     }).filter((I) => I), a = n.getEntityRelations(t, e, "IsTypedBy");
     if (!(a && a[0]))
       return s;
@@ -19944,12 +19935,12 @@ class oh extends ks {
       for (const I of h) {
         const u = await t.getProperties(I);
         if (u) {
-          if (u.type === z.IFCCLASSIFICATION) {
+          if (u.type === k.IFCCLASSIFICATION) {
             if (o.includes((f = u.Name) == null ? void 0 : f.value))
               continue;
             s.push(u);
           }
-          u.type === z.IFCCLASSIFICATIONREFERENCE && (u.ReferencedSource = await this.processReferencedSource(
+          u.type === k.IFCCLASSIFICATIONREFERENCE && (u.ReferencedSource = await this.processReferencedSource(
             t,
             u
           ), u.ReferencedSource && s.push(u));
@@ -19959,18 +19950,18 @@ class oh extends ks {
   }
   getSystemName(t) {
     var e, s, n, r;
-    if (t.type === z.IFCCLASSIFICATION)
+    if (t.type === k.IFCCLASSIFICATION)
       return (e = t.Name) == null ? void 0 : e.value;
-    if (t.type === z.IFCCLASSIFICATIONREFERENCE) {
-      if (((s = t.ReferencedSource) == null ? void 0 : s.type) === z.IFCCLASSIFICATIONREFERENCE)
+    if (t.type === k.IFCCLASSIFICATIONREFERENCE) {
+      if (((s = t.ReferencedSource) == null ? void 0 : s.type) === k.IFCCLASSIFICATIONREFERENCE)
         return this.getSystemName(t.ReferencedSource);
-      if (((n = t.ReferencedSource) == null ? void 0 : n.type) === z.IFCCLASSIFICATION)
+      if (((n = t.ReferencedSource) == null ? void 0 : n.type) === k.IFCCLASSIFICATION)
         return (r = t.ReferencedSource.Name) == null ? void 0 : r.value;
     }
     return null;
   }
   getAllReferenceIdentifications(t) {
-    if (t.type !== z.IFCCLASSIFICATIONREFERENCE)
+    if (t.type !== k.IFCCLASSIFICATIONREFERENCE)
       return null;
     const e = [];
     if (t.Identification && e.push(t.Identification.value), t.ReferencedSource) {
@@ -20023,7 +20014,7 @@ class ah extends ks {
     this.name = e;
   }
   serialize(t) {
-    const e = me("Name", this.name), s = me("Name", this.predefinedType);
+    const e = Re("Name", this.name), s = Re("Name", this.predefinedType);
     let n = "";
     return t === "requirement" && (n += `cardinality="${this.cardinality}"`, n += this.instructions ? `instructions="${this.instructions}"` : ""), `<ids:entity ${n}>
   ${e}
@@ -20079,7 +20070,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,14 +20110,15 @@ 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
+      k.IFCCOMPLEXPROPERTY,
+      k.IFCPHYSICALCOMPLEXQUANTITY
     ]);
     this.propertySet = e, this.baseName = s;
   }
   serialize(t) {
-    const e = me("PropertySet", this.propertySet), s = me("BaseName", this.baseName), n = me("Value", this.value), r = this.dataType ? `dataType=${this.dataType}` : "";
+    const e = Re("PropertySet", this.propertySet), s = Re("BaseName", this.baseName), n = Re("Value", this.value), r = this.dataType ? `dataType=${this.dataType}` : "";
     let o = "";
     return t === "requirement" && (o += `cardinality="${this.cardinality}"`, o += this.uri ? `uri=${this.uri}` : "", o += this.instructions ? `instructions="${this.instructions}"` : ""), `<ids:property ${r} ${o}>
   ${e}
@@ -20137,9 +20129,9 @@ class ch extends ks {
   async getEntities(t, e = {}) {
     var l, h;
     let s = {};
-    const n = await t.getAllPropertiesOfType(z.IFCPROPERTYSET);
+    const n = await t.getAllPropertiesOfType(k.IFCPROPERTYSET);
     s = { ...s, ...n };
-    const r = await t.getAllPropertiesOfType(z.IFCELEMENTQUANTITY);
+    const r = await t.getAllPropertiesOfType(k.IFCELEMENTQUANTITY);
     if (s = { ...s, ...r }, Object.keys(s).length === 0)
       return [];
     const o = [];
@@ -20148,7 +20140,7 @@ class ch extends ks {
       if (!u || !(((l = u.Name) == null ? void 0 : l.value) === this.propertySet.parameter))
         continue;
       let E;
-      if (u.type === z.IFCPROPERTYSET && (E = "HasProperties"), u.type === z.IFCELEMENTQUANTITY && (E = "Quantities"), !!E)
+      if (u.type === k.IFCPROPERTYSET && (E = "HasProperties"), u.type === k.IFCELEMENTQUANTITY && (E = "Quantities"), !!E)
         for (const T of u[E]) {
           const p = await t.getProperties(T.value);
           if (!(!p || !(((h = p.Name) == null ? void 0 : h.value) === this.baseName.parameter))) {
@@ -20163,7 +20155,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,
@@ -20256,16 +20248,41 @@ class ch extends ks {
   }
   getItemsAttrName(t) {
     let e;
-    return t === z.IFCPROPERTYSET && (e = "HasProperties"), t === z.IFCELEMENTQUANTITY && (e = "Quantities"), e;
+    return t === k.IFCPROPERTYSET && (e = "HasProperties"), t === k.IFCELEMENTQUANTITY && (e = "Quantities"), e;
   }
   getValueKey(t) {
     return Object.keys(t).find(
       (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 +20296,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;
   }
@@ -20302,7 +20315,7 @@ class ch extends ks {
           requiredValue: this.value.parameter
         }), !1;
       const r = t[s], o = structuredClone(this.value);
-      if (r.name === "IFCLABEL" && o.type === "simple" && (o.parameter = String(o.parameter)), (t.type === z.IFCPROPERTYLISTVALUE || t.type === z.IFCPROPERTYENUMERATEDVALUE) && Array.isArray(r)) {
+      if (r.name === "IFCLABEL" && o.type === "simple" && (o.parameter = String(o.parameter)), (t.type === k.IFCPROPERTYLISTVALUE || t.type === k.IFCPROPERTYENUMERATEDVALUE) && Array.isArray(r)) {
         const l = r.map((f) => f.value), h = r.find((f) => o ? this.evalRequirement(f.value, o, "Value") : !1);
         return e == null || e.push({
           currentValue: l,
@@ -20337,7 +20350,7 @@ class ch extends ks {
     if (!this.dataType)
       return !0;
     const s = this.getValueKey(t), n = t[s];
-    if ((t.type === z.IFCPROPERTYLISTVALUE || t.type === z.IFCPROPERTYENUMERATEDVALUE) && Array.isArray(n) && n[0]) {
+    if ((t.type === k.IFCPROPERTYLISTVALUE || t.type === k.IFCPROPERTYENUMERATEDVALUE) && Array.isArray(n) && n[0]) {
       const o = n[0].name;
       return this.evalRequirement(
         o,
@@ -20413,7 +20426,7 @@ class lh {
     </ids:specification>`;
   }
 }
-const Re = (c) => {
+const ge = (c) => {
   if (!c)
     return;
   const i = { type: "simple" };
@@ -20432,44 +20445,44 @@ const Re = (c) => {
 }, Xr = (c, i) => {
   const t = [];
   for (const e of i) {
-    const s = e.name, n = Re(s);
+    const s = e.name, n = ge(s);
     if (!n)
       continue;
     const r = new ah(c, n);
-    e.cardinality && (r.cardinality = e.cardinality), r.predefinedType = Re(e.predefinedType), r.instructions = e.instructions, t.push(r);
+    e.cardinality && (r.cardinality = e.cardinality), r.predefinedType = ge(e.predefinedType), r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, hh = (c, i) => {
   const t = [];
   for (const e of i) {
-    const s = e.name, n = Re(s);
+    const s = e.name, n = ge(s);
     if (!n)
       continue;
     const r = new rh(c, n);
-    e.cardinality && (r.cardinality = e.cardinality), r.value = Re(e.value), r.instructions = e.instructions, t.push(r);
+    e.cardinality && (r.cardinality = e.cardinality), r.value = ge(e.value), r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, uh = (c, i) => {
   const t = [];
   for (const e of i) {
-    const s = e.system, n = Re(s);
+    const s = e.system, n = ge(s);
     if (!n)
       continue;
     const r = new oh(c, n);
     e.cardinality && (r.cardinality = e.cardinality);
-    const o = Re(e.value);
+    const o = ge(e.value);
     (o == null ? void 0 : o.type) === "simple" && (o.parameter = String(o.parameter)), (o == null ? void 0 : o.type) === "enumeration" && Array.isArray(o.parameter) && (o.parameter = o.parameter.map(String)), r.value = o, r.uri = e.uri, r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, fh = (c, i) => {
   const t = [];
   for (const e of i) {
-    const s = e.propertySet, n = e.baseName, r = Re(s), o = Re(n);
+    const s = e.propertySet, n = e.baseName, r = ge(s), o = ge(n);
     if (!(o && r))
       continue;
     const a = new ch(c, r, o);
     e.cardinality && (a.cardinality = e.cardinality);
-    const l = Re(e.value);
+    const l = ge(e.value);
     (l == null ? void 0 : l.type) === "enumeration" && Array.isArray(l.parameter) && (l.parameter = l.parameter.map(String)), a.value = l, a.dataType = e.dataType, a.uri = e.uri, a.instructions = e.instructions, t.push(a);
   }
   return t;
@@ -20626,7 +20639,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 +20650,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 +20678,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 +20689,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 +20699,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,