@thatopen/components 2.0.4 → 2.0.6

package/dist/index.mjs

@@ -92,26 +92,26 @@ function Ae(l) {
   return 2 * (s * t + t * e + e * s);
 }
 function Gs(l, s, t, e, i = null) {
-  let o = 1 / 0, n = 1 / 0, r = 1 / 0, a = -1 / 0, c = -1 / 0, E = -1 / 0, d = 1 / 0, h = 1 / 0, u = 1 / 0, p = -1 / 0, A = -1 / 0, R = -1 / 0;
+  let o = 1 / 0, n = 1 / 0, r = 1 / 0, a = -1 / 0, c = -1 / 0, h = -1 / 0, d = 1 / 0, E = 1 / 0, u = 1 / 0, p = -1 / 0, A = -1 / 0, R = -1 / 0;
   const C = i !== null;
   for (let T = s * 6, F = (s + t) * 6; T < F; T += 6) {
     const f = l[T + 0], m = l[T + 1], O = f - m, S = f + m;
     O < o && (o = O), S > a && (a = S), C && f < d && (d = f), C && f > p && (p = f);
     const _ = l[T + 2], N = l[T + 3], L = _ - N, M = _ + N;
-    L < n && (n = L), M > c && (c = M), C && _ < h && (h = _), C && _ > A && (A = _);
+    L < n && (n = L), M > c && (c = M), C && _ < E && (E = _), C && _ > A && (A = _);
     const y = l[T + 4], x = l[T + 5], b = y - x, B = y + x;
-    b < r && (r = b), B > E && (E = B), C && y < u && (u = y), C && y > R && (R = y);
+    b < r && (r = b), B > h && (h = B), C && y < u && (u = y), C && y > R && (R = y);
   }
-  e[0] = o, e[1] = n, e[2] = r, e[3] = a, e[4] = c, e[5] = E, C && (i[0] = d, i[1] = h, i[2] = u, i[3] = p, i[4] = A, i[5] = R);
+  e[0] = o, e[1] = n, e[2] = r, e[3] = a, e[4] = c, e[5] = h, C && (i[0] = d, i[1] = E, i[2] = u, i[3] = p, i[4] = A, i[5] = R);
 }
 function ho(l, s, t, e) {
   let i = 1 / 0, o = 1 / 0, n = 1 / 0, r = -1 / 0, a = -1 / 0, c = -1 / 0;
-  for (let E = s * 6, d = (s + t) * 6; E < d; E += 6) {
-    const h = l[E + 0];
-    h < i && (i = h), h > r && (r = h);
-    const u = l[E + 2];
+  for (let h = s * 6, d = (s + t) * 6; h < d; h += 6) {
+    const E = l[h + 0];
+    E < i && (i = E), E > r && (r = E);
+    const u = l[h + 2];
     u < o && (o = u), u > a && (a = u);
-    const p = l[E + 4];
+    const p = l[h + 4];
     p < n && (n = p), p > c && (c = p);
   }
   e[0] = i, e[1] = o, e[2] = n, e[3] = r, e[4] = a, e[5] = c;
@@ -121,14 +121,14 @@ function Eo(l, s) {
   const t = l.attributes.position, e = l.index ? l.index.array : null, i = Ce(l), o = new Float32Array(i * 6), n = t.normalized, r = t.array, a = t.offset || 0;
   let c = 3;
   t.isInterleavedBufferAttribute && (c = t.data.stride);
-  const E = ["getX", "getY", "getZ"];
+  const h = ["getX", "getY", "getZ"];
   for (let d = 0; d < i; d++) {
-    const h = d * 3, u = d * 6;
-    let p = h + 0, A = h + 1, R = h + 2;
+    const E = d * 3, u = d * 6;
+    let p = E + 0, A = E + 1, R = E + 2;
     e && (p = e[p], A = e[A], R = e[R]), n || (p = p * c + a, A = A * c + a, R = R * c + a);
     for (let C = 0; C < 3; C++) {
       let T, F, f;
-      n ? (T = t[E[C]](p), F = t[E[C]](A), f = t[E[C]](R)) : (T = r[p + C], F = r[A + C], f = r[R + C]);
+      n ? (T = t[h[C]](p), F = t[h[C]](A), f = t[h[C]](R)) : (T = r[p + C], F = r[A + C], f = r[R + C]);
       let m = T;
       F < m && (m = F), f < m && (m = f);
       let O = T;
@@ -155,16 +155,16 @@ function Io(l, s, t, e, i, o) {
   else if (o === io) {
     const a = Ae(l);
     let c = Ys * i;
-    const E = e * 6, d = (e + i) * 6;
-    for (let h = 0; h < 3; h++) {
-      const u = s[h], R = (s[h + 3] - u) / wt;
+    const h = e * 6, d = (e + i) * 6;
+    for (let E = 0; E < 3; E++) {
+      const u = s[E], R = (s[E + 3] - u) / wt;
       if (i < wt / 4) {
         const C = [...Ut];
         C.length = i;
         let T = 0;
-        for (let f = E; f < d; f += 6, T++) {
+        for (let f = h; f < d; f += 6, T++) {
           const m = C[T];
-          m.candidate = t[f + 2 * h], m.count = 0;
+          m.candidate = t[f + 2 * E], m.count = 0;
           const {
             bounds: O,
             leftCacheBounds: S,
@@ -181,8 +181,8 @@ function Io(l, s, t, e, i, o) {
           for (; f + 1 < F && C[f + 1].candidate === m.candidate; )
             C.splice(f + 1, 1), F--;
         }
-        for (let f = E; f < d; f += 6) {
-          const m = t[f + 2 * h];
+        for (let f = h; f < d; f += 6) {
+          const m = t[f + 2 * E];
           for (let O = 0; O < F; O++) {
             const S = C[O];
             m >= S.candidate ? je(f, t, S.rightCacheBounds) : (je(f, t, S.leftCacheBounds), S.count++);
@@ -195,7 +195,7 @@ function Io(l, s, t, e, i, o) {
           let M = 0;
           S !== 0 && (M = Ae(N) / a);
           const y = vi + Ys * (L * O + M * S);
-          y < c && (n = h, c = y, r = m.candidate);
+          y < c && (n = E, c = y, r = m.candidate);
         }
       } else {
         for (let F = 0; F < wt; F++) {
@@ -205,8 +205,8 @@ function Io(l, s, t, e, i, o) {
           for (let O = 0; O < 3; O++)
             m[O] = 1 / 0, m[O + 3] = -1 / 0;
         }
-        for (let F = E; F < d; F += 6) {
-          let O = ~~((t[F + 2 * h] - u) / R);
+        for (let F = h; F < d; F += 6) {
+          let O = ~~((t[F + 2 * E] - u) / R);
           O >= wt && (O = wt - 1);
           const S = Ut[O];
           S.count++, je(F, t, S.bounds);
@@ -226,7 +226,7 @@ function Io(l, s, t, e, i, o) {
           const M = i - T;
           M !== 0 && (L = Ae(_) / a);
           const y = vi + Ys * (N * T + L * M);
-          y < c && (n = h, c = y, r = f.candidate);
+          y < c && (n = E, c = y, r = f.candidate);
         }
       }
     }
@@ -253,13 +253,13 @@ function po(l, s, t, e, i, o) {
     for (; n <= r && t[r * 6 + c] >= a; )
       r--;
     if (n < r) {
-      for (let E = 0; E < 3; E++) {
-        let d = s[n * 3 + E];
-        s[n * 3 + E] = s[r * 3 + E], s[r * 3 + E] = d;
+      for (let h = 0; h < 3; h++) {
+        let d = s[n * 3 + h];
+        s[n * 3 + h] = s[r * 3 + h], s[r * 3 + h] = d;
       }
-      for (let E = 0; E < 6; E++) {
-        let d = t[n * 6 + E];
-        t[n * 6 + E] = t[r * 6 + E], t[r * 6 + E] = d;
+      for (let h = 0; h < 6; h++) {
+        let d = t[n * 6 + h];
+        t[n * 6 + h] = t[r * 6 + h], t[r * 6 + h] = d;
       }
       n++, r--;
     } else
@@ -275,11 +275,11 @@ function Co(l, s, t, e, i, o) {
     for (; n <= r && t[r * 6 + c] >= a; )
       r--;
     if (n < r) {
-      let E = l[n];
-      l[n] = l[r], l[r] = E;
+      let h = l[n];
+      l[n] = l[r], l[r] = h;
       for (let d = 0; d < 6; d++) {
-        let h = t[n * 6 + d];
-        t[n * 6 + d] = t[r * 6 + d], t[r * 6 + d] = h;
+        let E = t[n * 6 + d];
+        t[n * 6 + d] = t[r * 6 + d], t[r * 6 + d] = E;
       }
       n++, r--;
     } else
@@ -293,12 +293,12 @@ function To(l, s) {
   return n;
 }
 function mo(l, s) {
-  const t = l.geometry, e = t.index ? t.index.array : null, i = s.maxDepth, o = s.verbose, n = s.maxLeafTris, r = s.strategy, a = s.onProgress, c = Ce(t), E = l._indirectBuffer;
+  const t = l.geometry, e = t.index ? t.index.array : null, i = s.maxDepth, o = s.verbose, n = s.maxLeafTris, r = s.strategy, a = s.onProgress, c = Ce(t), h = l._indirectBuffer;
   let d = !1;
-  const h = new Float32Array(6), u = new Float32Array(6), p = Eo(t, h), A = s.indirect ? Co : po, R = [], C = s.indirect ? Dn(t) : Un(t);
+  const E = new Float32Array(6), u = new Float32Array(6), p = Eo(t, E), A = s.indirect ? Co : po, R = [], C = s.indirect ? Dn(t) : Un(t);
   if (C.length === 1) {
     const f = C[0], m = new $e();
-    m.boundingData = h, ho(p, f.offset, f.count, u), F(m, f.offset, f.count, u), R.push(m);
+    m.boundingData = E, ho(p, f.offset, f.count, u), F(m, f.offset, f.count, u), R.push(m);
   } else
     for (let f of C) {
       const m = new $e();
@@ -314,7 +314,7 @@ function mo(l, s) {
     const N = Io(f.boundingData, S, p, m, O, r);
     if (N.axis === -1)
       return T(m + O), f.offset = m, f.count = O, f;
-    const L = A(E, e, p, m, O, N);
+    const L = A(h, e, p, m, O, N);
     if (L === m || L === m + O)
       T(m + O), f.offset = m, f.count = O;
     else {
@@ -336,29 +336,29 @@ function Ro(l, s) {
   let i, o, n;
   const r = [], a = s.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;
   for (let d = 0; d < e.length; d++) {
-    const h = e[d];
-    let u = c(h);
+    const E = e[d];
+    let u = c(E);
     const p = new a(Ts * u);
-    i = new Float32Array(p), o = new Uint32Array(p), n = new Uint16Array(p), E(0, h), r.push(p);
+    i = new Float32Array(p), o = new Uint32Array(p), n = new Uint16Array(p), h(0, E), r.push(p);
   }
   l._roots = r;
   return;
   function c(d) {
     return d.count ? 1 : 1 + c(d.left) + c(d.right);
   }
-  function E(d, h) {
-    const u = d / 4, p = d / 2, A = !!h.count, R = h.boundingData;
+  function h(d, E) {
+    const u = d / 4, p = d / 2, A = !!E.count, R = E.boundingData;
     for (let C = 0; C < 6; C++)
       i[u + C] = R[C];
     if (A) {
-      const C = h.offset, T = h.count;
+      const C = E.offset, T = E.count;
       return o[u + 6] = C, n[p + 14] = T, n[p + 15] = Us, d + Ts;
     } else {
-      const C = h.left, T = h.right, F = h.splitAxis;
+      const C = E.left, T = E.right, F = E.splitAxis;
       let f;
-      if (f = E(d + Ts, C), f / 4 > Math.pow(2, 32))
+      if (f = h(d + Ts, C), f / 4 > Math.pow(2, 32))
         throw new Error("MeshBVH: Cannot store child pointer greater than 32 bits.");
-      return o[u + 6] = f / 4, f = E(f, T), o[u + 7] = F, f;
+      return o[u + 6] = f / 4, f = h(f, T), o[u + 7] = F, f;
     }
   }
 }
@@ -393,8 +393,8 @@ Mt.prototype.setFromBox = function() {
     let n = 1 / 0, r = -1 / 0;
     for (let a = 0; a <= 1; a++)
       for (let c = 0; c <= 1; c++)
-        for (let E = 0; E <= 1; E++) {
-          l.x = i.x * a + o.x * (1 - a), l.y = i.y * c + o.y * (1 - c), l.z = i.z * E + o.z * (1 - E);
+        for (let h = 0; h <= 1; h++) {
+          l.x = i.x * a + o.x * (1 - a), l.y = i.y * c + o.y * (1 - c), l.z = i.z * h + o.z * (1 - h);
           const d = t.dot(l);
           n = Math.min(d, n), r = Math.max(d, r);
         }
@@ -404,11 +404,11 @@ Mt.prototype.setFromBox = function() {
 const Ao = function() {
   const l = new w(), s = new w(), t = new w();
   return function(i, o, n) {
-    const r = i.start, a = l, c = o.start, E = s;
+    const r = i.start, a = l, c = o.start, h = s;
     t.subVectors(r, c), l.subVectors(i.end, i.start), s.subVectors(o.end, o.start);
-    const d = t.dot(E), h = E.dot(a), u = E.dot(E), p = t.dot(a), R = a.dot(a) * u - h * h;
+    const d = t.dot(h), E = h.dot(a), u = h.dot(h), p = t.dot(a), R = a.dot(a) * u - E * E;
     let C, T;
-    R !== 0 ? C = (d * h - p * u) / R : C = 0, T = (d + C * h) / u, n.x = C, n.y = T;
+    R !== 0 ? C = (d * E - p * u) / R : C = 0, T = (d + C * E) / u, n.x = C, n.y = T;
   };
 }(), Oi = function() {
   const l = new pe(), s = new w(), t = new w();
@@ -425,16 +425,16 @@ const Ao = function() {
       a < 0 ? i.at(0, n) : i.at(1, n), o.closestPointToPoint(n, !0, r);
       return;
     } else {
-      let E;
-      a < 0 ? E = i.start : E = i.end;
+      let h;
+      a < 0 ? h = i.start : h = i.end;
       let d;
       c < 0 ? d = o.start : d = o.end;
-      const h = s, u = t;
-      if (i.closestPointToPoint(d, !0, s), o.closestPointToPoint(E, !0, t), h.distanceToSquared(d) <= u.distanceToSquared(E)) {
-        n.copy(h), r.copy(d);
+      const E = s, u = t;
+      if (i.closestPointToPoint(d, !0, s), o.closestPointToPoint(h, !0, t), E.distanceToSquared(d) <= u.distanceToSquared(h)) {
+        n.copy(E), r.copy(d);
         return;
       } else {
-        n.copy(E), r.copy(u);
+        n.copy(h), r.copy(u);
         return;
       }
     }
@@ -442,8 +442,8 @@ const Ao = function() {
 }(), Fo = function() {
   const l = new w(), s = new w(), t = new Fi(), e = new Lt();
   return function(o, n) {
-    const { radius: r, center: a } = o, { a: c, b: E, c: d } = n;
-    if (e.start = c, e.end = E, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r || (e.start = c, e.end = d, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r) || (e.start = E, e.end = d, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r))
+    const { radius: r, center: a } = o, { a: c, b: h, c: d } = n;
+    if (e.start = c, e.end = h, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r || (e.start = c, e.end = d, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r) || (e.start = h, e.end = d, e.closestPointToPoint(a, !0, l).distanceTo(a) <= r))
       return !0;
     const A = n.getPlane(t);
     if (Math.abs(A.distanceToPoint(a)) <= r) {
@@ -467,10 +467,10 @@ class Ft extends Ie {
   update() {
     const s = this.a, t = this.b, e = this.c, i = this.points, o = this.satAxes, n = this.satBounds, r = o[0], a = n[0];
     this.getNormal(r), a.setFromPoints(r, i);
-    const c = o[1], E = n[1];
-    c.subVectors(s, t), E.setFromPoints(c, i);
-    const d = o[2], h = n[2];
-    d.subVectors(t, e), h.setFromPoints(d, i);
+    const c = o[1], h = n[1];
+    c.subVectors(s, t), h.setFromPoints(c, i);
+    const d = o[2], E = n[2];
+    d.subVectors(t, e), E.setFromPoints(d, i);
     const u = o[3], p = n[3];
     u.subVectors(e, s), p.setFromPoints(u, i), this.sphere.setFromPoints(this.points), this.plane.setFromNormalAndCoplanarPoint(r, s), this.needsUpdate = !1;
   }
@@ -479,28 +479,28 @@ Ft.prototype.closestPointToSegment = function() {
   const l = new w(), s = new w(), t = new Lt();
   return function(i, o = null, n = null) {
     const { start: r, end: a } = i, c = this.points;
-    let E, d = 1 / 0;
-    for (let h = 0; h < 3; h++) {
-      const u = (h + 1) % 3;
-      t.start.copy(c[h]), t.end.copy(c[u]), Oi(t, i, l, s), E = l.distanceToSquared(s), E < d && (d = E, o && o.copy(l), n && n.copy(s));
+    let h, d = 1 / 0;
+    for (let E = 0; E < 3; E++) {
+      const u = (E + 1) % 3;
+      t.start.copy(c[E]), t.end.copy(c[u]), Oi(t, i, l, s), h = l.distanceToSquared(s), h < d && (d = h, o && o.copy(l), n && n.copy(s));
     }
-    return this.closestPointToPoint(r, l), E = r.distanceToSquared(l), E < d && (d = E, o && o.copy(l), n && n.copy(r)), this.closestPointToPoint(a, l), E = a.distanceToSquared(l), E < d && (d = E, o && o.copy(l), n && n.copy(a)), Math.sqrt(d);
+    return this.closestPointToPoint(r, l), h = r.distanceToSquared(l), h < d && (d = h, o && o.copy(l), n && n.copy(r)), this.closestPointToPoint(a, l), h = a.distanceToSquared(l), h < d && (d = h, o && o.copy(l), n && n.copy(a)), Math.sqrt(d);
   };
 }();
 Ft.prototype.intersectsTriangle = function() {
-  const l = new Ft(), s = new Array(3), t = new Array(3), e = new Mt(), i = new Mt(), o = new w(), n = new w(), r = new w(), a = new w(), c = new w(), E = new Lt(), d = new Lt(), h = new Lt(), u = new w();
+  const l = new Ft(), s = new Array(3), t = new Array(3), e = new Mt(), i = new Mt(), o = new w(), n = new w(), r = new w(), a = new w(), c = new w(), h = new Lt(), d = new Lt(), E = new Lt(), u = new w();
   function p(A, R, C) {
     const T = A.points;
     let F = 0, f = -1;
     for (let m = 0; m < 3; m++) {
-      const { start: O, end: S } = E;
-      O.copy(T[m]), S.copy(T[(m + 1) % 3]), E.delta(n);
+      const { start: O, end: S } = h;
+      O.copy(T[m]), S.copy(T[(m + 1) % 3]), h.delta(n);
       const _ = zs(R.distanceToPoint(O));
       if (zs(R.normal.dot(n)) && _) {
-        C.copy(E), F = 2;
+        C.copy(h), F = 2;
         break;
       }
-      const N = R.intersectLine(E, u);
+      const N = R.intersectLine(h, u);
       if (!N && _ && u.copy(O), (N || _) && !zs(u.distanceTo(S))) {
         if (F <= 1)
           (F === 1 ? C.start : C.end).copy(u), _ && (f = F);
@@ -547,17 +547,17 @@ Ft.prototype.intersectsTriangle = function() {
         return C && (C.start.copy(d.end), C.end.copy(d.end)), !0;
       if (m !== 2)
         return !1;
-      const O = p(R, F, h);
-      if (O === 1 && this.containsPoint(h.end))
-        return C && (C.start.copy(h.end), C.end.copy(h.end)), !0;
+      const O = p(R, F, E);
+      if (O === 1 && this.containsPoint(E.end))
+        return C && (C.start.copy(E.end), C.end.copy(E.end)), !0;
       if (O !== 2)
         return !1;
-      if (d.delta(r), h.delta(a), r.dot(a) < 0) {
-        let x = h.start;
-        h.start = h.end, h.end = x;
+      if (d.delta(r), E.delta(a), r.dot(a) < 0) {
+        let x = E.start;
+        E.start = E.end, E.end = x;
       }
-      const S = d.start.dot(r), _ = d.end.dot(r), N = h.start.dot(r), L = h.end.dot(r), M = _ < N, y = S < L;
-      return S !== L && N !== _ && M === y ? !1 : (C && (c.subVectors(d.start, h.start), c.dot(r) > 0 ? C.start.copy(d.start) : C.start.copy(h.start), c.subVectors(d.end, h.end), c.dot(r) < 0 ? C.end.copy(d.end) : C.end.copy(h.end)), !0);
+      const S = d.start.dot(r), _ = d.end.dot(r), N = E.start.dot(r), L = E.end.dot(r), M = _ < N, y = S < L;
+      return S !== L && N !== _ && M === y ? !1 : (C && (c.subVectors(d.start, E.start), c.dot(r) > 0 ? C.start.copy(d.start) : C.start.copy(E.start), c.subVectors(d.end, E.end), c.dot(r) < 0 ? C.end.copy(d.end) : C.end.copy(E.end)), !0);
     }
   };
 }();
@@ -573,25 +573,25 @@ Ft.prototype.distanceToTriangle = function() {
     const c = r || a ? e : null;
     if (this.intersectsTriangle(n, c))
       return (r || a) && (r && c.getCenter(r), a && c.getCenter(a)), 0;
-    let E = 1 / 0;
+    let h = 1 / 0;
     for (let d = 0; d < 3; d++) {
-      let h;
+      let E;
       const u = t[d], p = n[u];
-      this.closestPointToPoint(p, l), h = p.distanceToSquared(l), h < E && (E = h, r && r.copy(l), a && a.copy(p));
+      this.closestPointToPoint(p, l), E = p.distanceToSquared(l), E < h && (h = E, r && r.copy(l), a && a.copy(p));
       const A = this[u];
-      n.closestPointToPoint(A, l), h = A.distanceToSquared(l), h < E && (E = h, r && r.copy(A), a && a.copy(l));
+      n.closestPointToPoint(A, l), E = A.distanceToSquared(l), E < h && (h = E, r && r.copy(A), a && a.copy(l));
     }
     for (let d = 0; d < 3; d++) {
-      const h = t[d], u = t[(d + 1) % 3];
-      e.set(this[h], this[u]);
+      const E = t[d], u = t[(d + 1) % 3];
+      e.set(this[E], this[u]);
       for (let p = 0; p < 3; p++) {
         const A = t[p], R = t[(p + 1) % 3];
         i.set(n[A], n[R]), Oi(e, i, l, s);
         const C = l.distanceToSquared(s);
-        C < E && (E = C, r && r.copy(l), a && a.copy(s));
+        C < h && (h = C, r && r.copy(l), a && a.copy(s));
       }
     }
-    return Math.sqrt(E);
+    return Math.sqrt(h);
   };
 }();
 class at {
@@ -609,15 +609,15 @@ at.prototype.update = /* @__PURE__ */ function() {
   return function() {
     const s = this.matrix, t = this.min, e = this.max, i = this.points;
     for (let c = 0; c <= 1; c++)
-      for (let E = 0; E <= 1; E++)
+      for (let h = 0; h <= 1; h++)
         for (let d = 0; d <= 1; d++) {
-          const h = 1 * c | 2 * E | 4 * d, u = i[h];
-          u.x = c ? e.x : t.x, u.y = E ? e.y : t.y, u.z = d ? e.z : t.z, u.applyMatrix4(s);
+          const E = 1 * c | 2 * h | 4 * d, u = i[E];
+          u.x = c ? e.x : t.x, u.y = h ? e.y : t.y, u.z = d ? e.z : t.z, u.applyMatrix4(s);
         }
     const o = this.satBounds, n = this.satAxes, r = i[0];
     for (let c = 0; c < 3; c++) {
-      const E = n[c], d = o[c], h = 1 << c, u = i[h];
-      E.subVectors(r, u), d.setFromPoints(E, i);
+      const h = n[c], d = o[c], E = 1 << c, u = i[E];
+      h.subVectors(r, u), d.setFromPoints(h, i);
     }
     const a = this.alignedSatBounds;
     a[0].setFromPointsField(i, "x"), a[1].setFromPointsField(i, "y"), a[2].setFromPointsField(i, "z"), this.invMatrix.copy(this.matrix).invert(), this.needsUpdate = !1;
@@ -631,8 +631,8 @@ at.prototype.intersectsBox = function() {
     if (l.min = e.x, l.max = i.x, r[0].isSeparated(l) || (l.min = e.y, l.max = i.y, r[1].isSeparated(l)) || (l.min = e.z, l.max = i.z, r[2].isSeparated(l)))
       return !1;
     for (let a = 0; a < 3; a++) {
-      const c = n[a], E = o[a];
-      if (l.setFromBox(c, t), E.isSeparated(l))
+      const c = n[a], h = o[a];
+      if (l.setFromBox(c, t), h.isSeparated(l))
         return !1;
     }
     return !0;
@@ -644,21 +644,21 @@ at.prototype.intersectsTriangle = function() {
     this.needsUpdate && this.update(), n.isExtendedTriangle ? n.needsUpdate && n.update() : (l.copy(n), l.update(), n = l);
     const r = this.satBounds, a = this.satAxes;
     s[0] = n.a, s[1] = n.b, s[2] = n.c;
-    for (let h = 0; h < 3; h++) {
-      const u = r[h], p = a[h];
+    for (let E = 0; E < 3; E++) {
+      const u = r[E], p = a[E];
       if (t.setFromPoints(p, s), u.isSeparated(t))
         return !1;
     }
-    const c = n.satBounds, E = n.satAxes, d = this.points;
-    for (let h = 0; h < 3; h++) {
-      const u = c[h], p = E[h];
+    const c = n.satBounds, h = n.satAxes, d = this.points;
+    for (let E = 0; E < 3; E++) {
+      const u = c[E], p = h[E];
       if (t.setFromPoints(p, d), u.isSeparated(t))
         return !1;
     }
-    for (let h = 0; h < 3; h++) {
-      const u = a[h];
+    for (let E = 0; E < 3; E++) {
+      const u = a[E];
       for (let p = 0; p < 4; p++) {
-        const A = E[p];
+        const A = h[p];
         if (i.crossVectors(u, A), t.setFromPoints(i, s), e.setFromPoints(i, d), t.isSeparated(e))
           return !1;
       }
@@ -682,13 +682,13 @@ at.prototype.distanceToBox = function() {
   return function(n, r = 0, a = null, c = null) {
     if (this.needsUpdate && this.update(), this.intersectsBox(n))
       return (a || c) && (n.getCenter(i), this.closestPointToPoint(i, e), n.closestPointToPoint(e, i), a && a.copy(e), c && c.copy(i)), 0;
-    const E = r * r, d = n.min, h = n.max, u = this.points;
+    const h = r * r, d = n.min, E = n.max, u = this.points;
     let p = 1 / 0;
     for (let R = 0; R < 8; R++) {
       const C = u[R];
-      i.copy(C).clamp(d, h);
+      i.copy(C).clamp(d, E);
       const T = C.distanceToSquared(i);
-      if (T < p && (p = T, a && a.copy(C), c && c.copy(i), T < E))
+      if (T < p && (p = T, a && a.copy(C), c && c.copy(i), T < h))
         return Math.sqrt(T);
     }
     let A = 0;
@@ -698,14 +698,14 @@ at.prototype.distanceToBox = function() {
           const F = (R + 1) % 3, f = (R + 2) % 3, m = C << F | T << f, O = 1 << R | C << F | T << f, S = u[m], _ = u[O];
           s[A].set(S, _);
           const L = l[R], M = l[F], y = l[f], x = t[A], b = x.start, B = x.end;
-          b[L] = d[L], b[M] = C ? d[M] : h[M], b[y] = T ? d[y] : h[M], B[L] = h[L], B[M] = C ? d[M] : h[M], B[y] = T ? d[y] : h[M], A++;
+          b[L] = d[L], b[M] = C ? d[M] : E[M], b[y] = T ? d[y] : E[M], B[L] = E[L], B[M] = C ? d[M] : E[M], B[y] = T ? d[y] : E[M], A++;
         }
     for (let R = 0; R <= 1; R++)
       for (let C = 0; C <= 1; C++)
         for (let T = 0; T <= 1; T++) {
-          i.x = R ? h.x : d.x, i.y = C ? h.y : d.y, i.z = T ? h.z : d.z, this.closestPointToPoint(i, e);
+          i.x = R ? E.x : d.x, i.y = C ? E.y : d.y, i.z = T ? E.z : d.z, this.closestPointToPoint(i, e);
           const F = i.distanceToSquared(e);
-          if (F < p && (p = F, a && a.copy(e), c && c.copy(i), F < E))
+          if (F < p && (p = F, a && a.copy(e), c && c.copy(i), F < h))
             return Math.sqrt(F);
         }
     for (let R = 0; R < 12; R++) {
@@ -714,7 +714,7 @@ at.prototype.distanceToBox = function() {
         const F = t[T];
         Oi(C, F, e, i);
         const f = e.distanceToSquared(i);
-        if (f < p && (p = f, a && a.copy(e), c && c.copy(i), f < E))
+        if (f < p && (p = f, a && a.copy(e), c && c.copy(i), f < h))
           return Math.sqrt(f);
       }
     }
@@ -781,10 +781,10 @@ function _o(l, s, t, e, i, o) {
 }
 function ai(l, s, t, e, i = null, o = 0, n = 0) {
   const { float32Array: r, uint16Array: a, uint32Array: c } = Z;
-  let E = l * 2;
-  if (ht(E, a)) {
-    const h = Et(l, c), u = ft(E, a);
-    return $(l, r, Yt), e(h, u, !1, n, o + l, Yt);
+  let h = l * 2;
+  if (ht(h, a)) {
+    const E = Et(l, c), u = ft(h, a);
+    return $(l, r, Yt), e(E, u, !1, n, o + l, Yt);
   } else {
     let L = function(y) {
       const { uint16Array: x, uint32Array: b } = Z;
@@ -799,10 +799,10 @@ function ai(l, s, t, e, i = null, o = 0, n = 0) {
         y = Ct(y, b), B = y * 2;
       return Et(y, b) + ft(B, x);
     };
-    const h = pt(l), u = Ct(l, c);
-    let p = h, A = u, R, C, T, F;
+    const E = pt(l), u = Ct(l, c);
+    let p = E, A = u, R, C, T, F;
     if (i && (T = Yt, F = fe, $(p, r, T), $(A, r, F), R = i(T), C = i(F), C < R)) {
-      p = u, A = h;
+      p = u, A = E;
       const y = R;
       R = C, C = y, T = F;
     }
@@ -849,12 +849,12 @@ function No(l, s, t = {}, e = 0, i = 1 / 0) {
   let r = 1 / 0, a = null;
   if (l.shapecast(
     {
-      boundsTraverseOrder: (E) => (Fe.copy(s).clamp(E.min, E.max), Fe.distanceToSquared(s)),
-      intersectsBounds: (E, d, h) => h < r && h < n,
-      intersectsTriangle: (E, d) => {
-        E.closestPointToPoint(s, Fe);
-        const h = s.distanceToSquared(Fe);
-        return h < r && (Hs.copy(Fe), r = h, a = d), h < o;
+      boundsTraverseOrder: (h) => (Fe.copy(s).clamp(h.min, h.max), Fe.distanceToSquared(s)),
+      intersectsBounds: (h, d, E) => E < r && E < n,
+      intersectsTriangle: (h, d) => {
+        h.closestPointToPoint(s, Fe);
+        const E = s.distanceToSquared(Fe);
+        return E < r && (Hs.copy(Fe), r = E, a = d), E < o;
       }
     }
   ), r === 1 / 0)
@@ -875,14 +875,14 @@ function Lo(l, s, t, e, i, o, n, r, a) {
   const c = Po(l, ee, se, ie, ss, a);
   if (c) {
     e && (Je.fromBufferAttribute(e, o), ts.fromBufferAttribute(e, n), es.fromBufferAttribute(e, r), c.uv = Ie.getInterpolation(ss, ee, se, ie, Je, ts, es, new pe())), i && (Je.fromBufferAttribute(i, o), ts.fromBufferAttribute(i, n), es.fromBufferAttribute(i, r), c.uv1 = Ie.getInterpolation(ss, ee, se, ie, Je, ts, es, new pe())), t && (Gi.fromBufferAttribute(t, o), zi.fromBufferAttribute(t, n), Hi.fromBufferAttribute(t, r), c.normal = Ie.getInterpolation(ss, ee, se, ie, Gi, zi, Hi, new w()), c.normal.dot(l.direction) > 0 && c.normal.multiplyScalar(-1));
-    const E = {
+    const h = {
       a: o,
       b: n,
       c: r,
       normal: new w(),
       materialIndex: 0
     };
-    Ie.getNormal(ee, se, ie, E.normal), c.face = E, c.faceIndex = o;
+    Ie.getNormal(ee, se, ie, h.normal), c.face = h, c.faceIndex = o;
   }
   return c;
 }
@@ -891,7 +891,7 @@ function xs(l, s, t, e, i) {
   let n = o + 0, r = o + 1, a = o + 2;
   const c = l.index;
   l.index && (n = c.getX(n), r = c.getX(r), a = c.getX(a));
-  const { position: E, normal: d, uv: h, uv1: u } = l.attributes, p = Lo(t, E, d, h, u, n, r, a, s);
+  const { position: h, normal: d, uv: E, uv1: u } = l.attributes, p = Lo(t, h, d, E, u, n, r, a, s);
   return p ? (p.faceIndex = e, i && i.push(p), p) : null;
 }
 function et(l, s, t, e) {
@@ -907,7 +907,7 @@ function yo(l, s, t, e, i, o) {
 function wo(l, s, t, e, i) {
   const { geometry: o, _indirectBuffer: n } = l;
   let r = 1 / 0, a = null;
-  for (let c = e, E = e + i; c < E; c++) {
+  for (let c = e, h = e + i; c < h; c++) {
     let d;
     d = xs(o, s, t, c), d && d.distance < r && (a = d, r = d.distance);
   }
@@ -915,9 +915,9 @@ function wo(l, s, t, e, i) {
 }
 function Mo(l, s, t, e, i, o, n) {
   const { geometry: r } = t, { index: a } = r, c = r.attributes.position;
-  for (let E = l, d = s + l; E < d; E++) {
-    let h;
-    if (h = E, et(n, h * 3, a, c), n.needsUpdate = !0, e(n, h, i, o))
+  for (let h = l, d = s + l; h < d; h++) {
+    let E;
+    if (E = h, et(n, E * 3, a, c), n.needsUpdate = !0, e(n, E, i, o))
       return !0;
   }
   return !1;
@@ -926,22 +926,22 @@ function Do(l, s = null) {
   s && Array.isArray(s) && (s = new Set(s));
   const t = l.geometry, e = t.index ? t.index.array : null, i = t.attributes.position;
   let o, n, r, a, c = 0;
-  const E = l._roots;
-  for (let h = 0, u = E.length; h < u; h++)
-    o = E[h], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
-  function d(h, u, p = !1) {
-    const A = h * 2;
+  const h = l._roots;
+  for (let E = 0, u = h.length; E < u; E++)
+    o = h[E], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
+  function d(E, u, p = !1) {
+    const A = E * 2;
     if (r[A + 15] === Us) {
-      const C = n[h + 6], T = r[A + 14];
+      const C = n[E + 6], T = r[A + 14];
       let F = 1 / 0, f = 1 / 0, m = 1 / 0, O = -1 / 0, S = -1 / 0, _ = -1 / 0;
       for (let N = 3 * C, L = 3 * (C + T); N < L; N++) {
         let M = e[N];
         const y = i.getX(M), x = i.getY(M), b = i.getZ(M);
         y < F && (F = y), y > O && (O = y), x < f && (f = x), x > S && (S = x), b < m && (m = b), b > _ && (_ = b);
       }
-      return a[h + 0] !== F || a[h + 1] !== f || a[h + 2] !== m || a[h + 3] !== O || a[h + 4] !== S || a[h + 5] !== _ ? (a[h + 0] = F, a[h + 1] = f, a[h + 2] = m, a[h + 3] = O, a[h + 4] = S, a[h + 5] = _, !0) : !1;
+      return a[E + 0] !== F || a[E + 1] !== f || a[E + 2] !== m || a[E + 3] !== O || a[E + 4] !== S || a[E + 5] !== _ ? (a[E + 0] = F, a[E + 1] = f, a[E + 2] = m, a[E + 3] = O, a[E + 4] = S, a[E + 5] = _, !0) : !1;
     } else {
-      const C = h + 8, T = n[h + 6], F = C + u, f = T + u;
+      const C = E + 8, T = n[E + 6], F = C + u, f = T + u;
       let m = p, O = !1, S = !1;
       s ? m || (O = s.has(F), S = s.has(f), m = !O && !S) : (O = !0, S = !0);
       const _ = m || O, N = m || S;
@@ -953,7 +953,7 @@ function Do(l, s = null) {
       if (y)
         for (let x = 0; x < 3; x++) {
           const b = C + x, B = T + x, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
-          a[h + x] = H < st ? H : st, a[h + x + 3] = q > Q ? q : Q;
+          a[E + x] = H < st ? H : st, a[E + x + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -966,14 +966,14 @@ function zt(l, s, t, e) {
 function Uo(l, s, t, e, i, o) {
   const { geometry: n, _indirectBuffer: r } = l;
   for (let a = e, c = e + i; a < c; a++) {
-    let E = r ? r[a] : a;
-    xs(n, s, t, E, o);
+    let h = r ? r[a] : a;
+    xs(n, s, t, h, o);
   }
 }
 function xo(l, s, t, e, i) {
   const { geometry: o, _indirectBuffer: n } = l;
   let r = 1 / 0, a = null;
-  for (let c = e, E = e + i; c < E; c++) {
+  for (let c = e, h = e + i; c < h; c++) {
     let d;
     d = xs(o, s, t, n ? n[c] : c), d && d.distance < r && (a = d, r = d.distance);
   }
@@ -981,9 +981,9 @@ function xo(l, s, t, e, i) {
 }
 function bo(l, s, t, e, i, o, n) {
   const { geometry: r } = t, { index: a } = r, c = r.attributes.position;
-  for (let E = l, d = s + l; E < d; E++) {
-    let h;
-    if (h = t.resolveTriangleIndex(E), et(n, h * 3, a, c), n.needsUpdate = !0, e(n, h, i, o))
+  for (let h = l, d = s + l; h < d; h++) {
+    let E;
+    if (E = t.resolveTriangleIndex(h), et(n, E * 3, a, c), n.needsUpdate = !0, e(n, E, i, o))
       return !0;
   }
   return !1;
@@ -995,11 +995,11 @@ function vo(l, s, t, e, i) {
 function ci(l, s, t, e, i) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z, a = l * 2;
   if (ht(a, n)) {
-    const E = Et(l, r), d = ft(a, n);
-    yo(s, t, e, E, d, i);
+    const h = Et(l, r), d = ft(a, n);
+    yo(s, t, e, h, d, i);
   } else {
-    const E = pt(l);
-    zt(E, o, e, Wi) && ci(E, s, t, e, i);
+    const h = pt(l);
+    zt(h, o, e, Wi) && ci(h, s, t, e, i);
     const d = Ct(l, r);
     zt(d, o, e, Wi) && ci(d, s, t, e, i);
   }
@@ -1014,16 +1014,16 @@ function li(l, s, t, e) {
   const { float32Array: i, uint16Array: o, uint32Array: n } = Z;
   let r = l * 2;
   if (ht(r, o)) {
-    const c = Et(l, n), E = ft(r, o);
-    return wo(s, t, e, c, E);
+    const c = Et(l, n), h = ft(r, o);
+    return wo(s, t, e, c, h);
   } else {
-    const c = xn(l, n), E = Bo[c], h = e.direction[E] >= 0;
+    const c = xn(l, n), h = Bo[c], E = e.direction[h] >= 0;
     let u, p;
-    h ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
+    E ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
     const R = zt(u, i, e, Xi) ? li(u, s, t, e) : null;
     if (R) {
-      const F = R.point[E];
-      if (h ? F <= i[p + c] : (
+      const F = R.point[h];
+      if (E ? F <= i[p + c] : (
         // min bounding data
         F >= i[p + c + 3]
       ))
@@ -1043,33 +1043,33 @@ function hi(l, s, t, e, i = null) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z;
   let a = l * 2;
   if (i === null && (t.boundingBox || t.computeBoundingBox(), Zi.set(t.boundingBox.min, t.boundingBox.max, e), i = Zi), ht(a, n)) {
-    const E = s.geometry, d = E.index, h = E.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), R = ft(a, n);
+    const h = s.geometry, d = h.index, E = h.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), R = ft(a, n);
     if (Oe.copy(e).invert(), t.boundsTree)
       return $(l, o, ns), ns.matrix.copy(Oe), ns.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (T) => ns.intersectsBox(T),
         intersectsTriangle: (T) => {
           T.a.applyMatrix4(e), T.b.applyMatrix4(e), T.c.applyMatrix4(e), T.needsUpdate = !0;
           for (let F = A * 3, f = (R + A) * 3; F < f; F += 3)
-            if (et(oe, F, d, h), oe.needsUpdate = !0, T.intersectsTriangle(oe))
+            if (et(oe, F, d, E), oe.needsUpdate = !0, T.intersectsTriangle(oe))
               return !0;
           return !1;
         }
       });
     for (let C = A * 3, T = (R + A) * 3; C < T; C += 3) {
-      et(ne, C, d, h), ne.a.applyMatrix4(Oe), ne.b.applyMatrix4(Oe), ne.c.applyMatrix4(Oe), ne.needsUpdate = !0;
+      et(ne, C, d, E), ne.a.applyMatrix4(Oe), ne.b.applyMatrix4(Oe), ne.c.applyMatrix4(Oe), ne.needsUpdate = !0;
       for (let F = 0, f = u.count; F < f; F += 3)
         if (et(oe, F, u, p), oe.needsUpdate = !0, ne.intersectsTriangle(oe))
           return !0;
     }
   } else {
-    const E = l + 8, d = r[l + 6];
-    return $(E, o, is), !!(i.intersectsBox(is) && hi(E, s, t, e, i) || ($(d, o, is), i.intersectsBox(is) && hi(d, s, t, e, i)));
+    const h = l + 8, d = r[l + 6];
+    return $(h, o, is), !!(i.intersectsBox(is) && hi(h, s, t, e, i) || ($(d, o, is), i.intersectsBox(is) && hi(d, s, t, e, i)));
   }
 }
 const os = /* @__PURE__ */ new yt(), ks = /* @__PURE__ */ new at(), ge = /* @__PURE__ */ new at(), Go = /* @__PURE__ */ new w(), zo = /* @__PURE__ */ new w(), Ho = /* @__PURE__ */ new w(), ko = /* @__PURE__ */ new w();
 function Wo(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
   s.boundingBox || s.computeBoundingBox(), ks.set(s.boundingBox.min, s.boundingBox.max, t), ks.needsUpdate = !0;
-  const r = l.geometry, a = r.attributes.position, c = r.index, E = s.attributes.position, d = s.index, h = It.getPrimitive(), u = It.getPrimitive();
+  const r = l.geometry, a = r.attributes.position, c = r.index, h = s.attributes.position, d = s.index, E = It.getPrimitive(), u = It.getPrimitive();
   let p = Go, A = zo, R = null, C = null;
   i && (R = Ho, C = ko);
   let T = 1 / 0, F = null, f = null;
@@ -1084,10 +1084,10 @@ function Wo(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
             intersectsBounds: (_, N, L) => L < T && L < n,
             intersectsRange: (_, N) => {
               for (let L = _, M = _ + N; L < M; L++) {
-                et(u, 3 * L, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+                et(u, 3 * L, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
                 for (let y = m, x = m + O; y < x; y++) {
-                  et(h, 3 * y, c, a), h.needsUpdate = !0;
-                  const b = h.distanceToTriangle(u, p, R);
+                  et(E, 3 * y, c, a), E.needsUpdate = !0;
+                  const b = E.distanceToTriangle(u, p, R);
                   if (b < T && (A.copy(p), C && C.copy(R), T = b, F = y, f = L), b < o)
                     return !0;
                 }
@@ -1097,10 +1097,10 @@ function Wo(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
         {
           const S = Ce(s);
           for (let _ = 0, N = S; _ < N; _++) {
-            et(u, 3 * _, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            et(u, 3 * _, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
             for (let L = m, M = m + O; L < M; L++) {
-              et(h, 3 * L, c, a), h.needsUpdate = !0;
-              const y = h.distanceToTriangle(u, p, R);
+              et(E, 3 * L, c, a), E.needsUpdate = !0;
+              const y = E.distanceToTriangle(u, p, R);
               if (y < T && (A.copy(p), C && C.copy(R), T = y, F = L, f = _), y < o)
                 return !0;
             }
@@ -1108,19 +1108,19 @@ function Wo(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
         }
       }
     }
-  ), It.releasePrimitive(h), It.releasePrimitive(u), T === 1 / 0 ? null : (e.point ? e.point.copy(A) : e.point = A.clone(), e.distance = T, e.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(os), A.applyMatrix4(os), i.distance = A.sub(i.point).length(), i.faceIndex = f), e);
+  ), It.releasePrimitive(E), It.releasePrimitive(u), T === 1 / 0 ? null : (e.point ? e.point.copy(A) : e.point = A.clone(), e.distance = T, e.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(os), A.applyMatrix4(os), i.distance = A.sub(i.point).length(), i.faceIndex = f), e);
 }
 function Xo(l, s = null) {
   s && Array.isArray(s) && (s = new Set(s));
   const t = l.geometry, e = t.index ? t.index.array : null, i = t.attributes.position;
   let o, n, r, a, c = 0;
-  const E = l._roots;
-  for (let h = 0, u = E.length; h < u; h++)
-    o = E[h], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
-  function d(h, u, p = !1) {
-    const A = h * 2;
+  const h = l._roots;
+  for (let E = 0, u = h.length; E < u; E++)
+    o = h[E], n = new Uint32Array(o), r = new Uint16Array(o), a = new Float32Array(o), d(0, c), c += o.byteLength;
+  function d(E, u, p = !1) {
+    const A = E * 2;
     if (r[A + 15] === Us) {
-      const C = n[h + 6], T = r[A + 14];
+      const C = n[E + 6], T = r[A + 14];
       let F = 1 / 0, f = 1 / 0, m = 1 / 0, O = -1 / 0, S = -1 / 0, _ = -1 / 0;
       for (let N = C, L = C + T; N < L; N++) {
         const M = 3 * l.resolveTriangleIndex(N);
@@ -1131,9 +1131,9 @@ function Xo(l, s = null) {
           b < F && (F = b), b > O && (O = b), B < f && (f = B), B > S && (S = B), H < m && (m = H), H > _ && (_ = H);
         }
       }
-      return a[h + 0] !== F || a[h + 1] !== f || a[h + 2] !== m || a[h + 3] !== O || a[h + 4] !== S || a[h + 5] !== _ ? (a[h + 0] = F, a[h + 1] = f, a[h + 2] = m, a[h + 3] = O, a[h + 4] = S, a[h + 5] = _, !0) : !1;
+      return a[E + 0] !== F || a[E + 1] !== f || a[E + 2] !== m || a[E + 3] !== O || a[E + 4] !== S || a[E + 5] !== _ ? (a[E + 0] = F, a[E + 1] = f, a[E + 2] = m, a[E + 3] = O, a[E + 4] = S, a[E + 5] = _, !0) : !1;
     } else {
-      const C = h + 8, T = n[h + 6], F = C + u, f = T + u;
+      const C = E + 8, T = n[E + 6], F = C + u, f = T + u;
       let m = p, O = !1, S = !1;
       s ? m || (O = s.has(F), S = s.has(f), m = !O && !S) : (O = !0, S = !0);
       const _ = m || O, N = m || S;
@@ -1145,7 +1145,7 @@ function Xo(l, s = null) {
       if (y)
         for (let x = 0; x < 3; x++) {
           const b = C + x, B = T + x, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
-          a[h + x] = H < st ? H : st, a[h + x + 3] = q > Q ? q : Q;
+          a[E + x] = H < st ? H : st, a[E + x + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -1158,11 +1158,11 @@ function Zo(l, s, t, e, i) {
 function Ei(l, s, t, e, i) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z, a = l * 2;
   if (ht(a, n)) {
-    const E = Et(l, r), d = ft(a, n);
-    Uo(s, t, e, E, d, i);
+    const h = Et(l, r), d = ft(a, n);
+    Uo(s, t, e, h, d, i);
   } else {
-    const E = pt(l);
-    zt(E, o, e, Qi) && Ei(E, s, t, e, i);
+    const h = pt(l);
+    zt(h, o, e, Qi) && Ei(h, s, t, e, i);
     const d = Ct(l, r);
     zt(d, o, e, Qi) && Ei(d, s, t, e, i);
   }
@@ -1177,16 +1177,16 @@ function di(l, s, t, e) {
   const { float32Array: i, uint16Array: o, uint32Array: n } = Z;
   let r = l * 2;
   if (ht(r, o)) {
-    const c = Et(l, n), E = ft(r, o);
-    return xo(s, t, e, c, E);
+    const c = Et(l, n), h = ft(r, o);
+    return xo(s, t, e, c, h);
   } else {
-    const c = xn(l, n), E = Qo[c], h = e.direction[E] >= 0;
+    const c = xn(l, n), h = Qo[c], E = e.direction[h] >= 0;
     let u, p;
-    h ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
+    E ? (u = pt(l), p = Ct(l, n)) : (u = Ct(l, n), p = pt(l));
     const R = zt(u, i, e, ji) ? di(u, s, t, e) : null;
     if (R) {
-      const F = R.point[E];
-      if (h ? F <= i[p + c] : (
+      const F = R.point[h];
+      if (E ? F <= i[p + c] : (
         // min bounding data
         F >= i[p + c + 3]
       ))
@@ -1206,34 +1206,34 @@ function ui(l, s, t, e, i = null) {
   const { float32Array: o, uint16Array: n, uint32Array: r } = Z;
   let a = l * 2;
   if (i === null && (t.boundingBox || t.computeBoundingBox(), qi.set(t.boundingBox.min, t.boundingBox.max, e), i = qi), ht(a, n)) {
-    const E = s.geometry, d = E.index, h = E.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), R = ft(a, n);
+    const h = s.geometry, d = h.index, E = h.attributes.position, u = t.index, p = t.attributes.position, A = Et(l, r), R = ft(a, n);
     if (Se.copy(e).invert(), t.boundsTree)
       return $(l, o, as), as.matrix.copy(Se), as.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (T) => as.intersectsBox(T),
         intersectsTriangle: (T) => {
           T.a.applyMatrix4(e), T.b.applyMatrix4(e), T.c.applyMatrix4(e), T.needsUpdate = !0;
           for (let F = A, f = R + A; F < f; F++)
-            if (et(ae, 3 * s.resolveTriangleIndex(F), d, h), ae.needsUpdate = !0, T.intersectsTriangle(ae))
+            if (et(ae, 3 * s.resolveTriangleIndex(F), d, E), ae.needsUpdate = !0, T.intersectsTriangle(ae))
               return !0;
           return !1;
         }
       });
     for (let C = A, T = R + A; C < T; C++) {
       const F = s.resolveTriangleIndex(C);
-      et(re, 3 * F, d, h), re.a.applyMatrix4(Se), re.b.applyMatrix4(Se), re.c.applyMatrix4(Se), re.needsUpdate = !0;
+      et(re, 3 * F, d, E), re.a.applyMatrix4(Se), re.b.applyMatrix4(Se), re.c.applyMatrix4(Se), re.needsUpdate = !0;
       for (let f = 0, m = u.count; f < m; f += 3)
         if (et(ae, f, u, p), ae.needsUpdate = !0, re.intersectsTriangle(ae))
           return !0;
     }
   } else {
-    const E = l + 8, d = r[l + 6];
-    return $(E, o, rs), !!(i.intersectsBox(rs) && ui(E, s, t, e, i) || ($(d, o, rs), i.intersectsBox(rs) && ui(d, s, t, e, i)));
+    const h = l + 8, d = r[l + 6];
+    return $(h, o, rs), !!(i.intersectsBox(rs) && ui(h, s, t, e, i) || ($(d, o, rs), i.intersectsBox(rs) && ui(d, s, t, e, i)));
   }
 }
 const cs = /* @__PURE__ */ new yt(), Ws = /* @__PURE__ */ new at(), _e = /* @__PURE__ */ new at(), $o = /* @__PURE__ */ new w(), Ko = /* @__PURE__ */ new w(), Jo = /* @__PURE__ */ new w(), tr = /* @__PURE__ */ new w();
 function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
   s.boundingBox || s.computeBoundingBox(), Ws.set(s.boundingBox.min, s.boundingBox.max, t), Ws.needsUpdate = !0;
-  const r = l.geometry, a = r.attributes.position, c = r.index, E = s.attributes.position, d = s.index, h = It.getPrimitive(), u = It.getPrimitive();
+  const r = l.geometry, a = r.attributes.position, c = r.index, h = s.attributes.position, d = s.index, E = It.getPrimitive(), u = It.getPrimitive();
   let p = $o, A = Ko, R = null, C = null;
   i && (R = Jo, C = tr);
   let T = 1 / 0, F = null, f = null;
@@ -1250,11 +1250,11 @@ function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
             intersectsRange: (_, N) => {
               for (let L = _, M = _ + N; L < M; L++) {
                 const y = S.resolveTriangleIndex(L);
-                et(u, 3 * y, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+                et(u, 3 * y, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
                 for (let x = m, b = m + O; x < b; x++) {
                   const B = l.resolveTriangleIndex(x);
-                  et(h, 3 * B, c, a), h.needsUpdate = !0;
-                  const H = h.distanceToTriangle(u, p, R);
+                  et(E, 3 * B, c, a), E.needsUpdate = !0;
+                  const H = E.distanceToTriangle(u, p, R);
                   if (H < T && (A.copy(p), C && C.copy(R), T = H, F = x, f = L), H < o)
                     return !0;
                 }
@@ -1264,11 +1264,11 @@ function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
         } else {
           const S = Ce(s);
           for (let _ = 0, N = S; _ < N; _++) {
-            et(u, 3 * _, d, E), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            et(u, 3 * _, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
             for (let L = m, M = m + O; L < M; L++) {
               const y = l.resolveTriangleIndex(L);
-              et(h, 3 * y, c, a), h.needsUpdate = !0;
-              const x = h.distanceToTriangle(u, p, R);
+              et(E, 3 * y, c, a), E.needsUpdate = !0;
+              const x = E.distanceToTriangle(u, p, R);
               if (x < T && (A.copy(p), C && C.copy(R), T = x, F = L, f = _), x < o)
                 return !0;
             }
@@ -1276,7 +1276,7 @@ function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
         }
       }
     }
-  ), It.releasePrimitive(h), It.releasePrimitive(u), T === 1 / 0 ? null : (e.point ? e.point.copy(A) : e.point = A.clone(), e.distance = T, e.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(cs), A.applyMatrix4(cs), i.distance = A.sub(i.point).length(), i.faceIndex = f), e);
+  ), It.releasePrimitive(E), It.releasePrimitive(u), T === 1 / 0 ? null : (e.point ? e.point.copy(A) : e.point = A.clone(), e.distance = T, e.faceIndex = F, i && (i.point ? i.point.copy(C) : i.point = C.clone(), i.point.applyMatrix4(cs), A.applyMatrix4(cs), i.distance = A.sub(i.point).length(), i.faceIndex = f), e);
 }
 function sr() {
   return typeof SharedArrayBuffer < "u";
@@ -1290,11 +1290,11 @@ function ir(l, s, t, e) {
   const i = l._roots, o = s._roots;
   let n, r = 0, a = 0;
   const c = new yt().copy(t).invert();
-  for (let E = 0, d = i.length; E < d; E++) {
-    be.setBuffer(i[E]), a = 0;
-    const h = vt.getPrimitive();
-    $(0, be.float32Array, h), h.applyMatrix4(c);
-    for (let u = 0, p = o.length; u < p && (As.setBuffer(o[E]), n = Tt(
+  for (let h = 0, d = i.length; h < d; h++) {
+    be.setBuffer(i[h]), a = 0;
+    const E = vt.getPrimitive();
+    $(0, be.float32Array, E), E.applyMatrix4(c);
+    for (let u = 0, p = o.length; u < p && (As.setBuffer(o[h]), n = Tt(
       0,
       0,
       t,
@@ -1304,21 +1304,21 @@ function ir(l, s, t, e) {
       a,
       0,
       0,
-      h
+      E
     ), As.clearBuffer(), a += o[u].length, !n); u++)
       ;
-    if (vt.releasePrimitive(h), be.clearBuffer(), r += i[E].length, n)
+    if (vt.releasePrimitive(E), be.clearBuffer(), r += i[h].length, n)
       break;
   }
   return Qs = !1, n;
 }
-function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
-  let d, h;
-  E ? (d = As, h = be) : (d = be, h = As);
-  const u = d.float32Array, p = d.uint32Array, A = d.uint16Array, R = h.float32Array, C = h.uint32Array, T = h.uint16Array, F = l * 2, f = s * 2, m = ht(F, A), O = ht(f, T);
+function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, h = !1) {
+  let d, E;
+  h ? (d = As, E = be) : (d = be, E = As);
+  const u = d.float32Array, p = d.uint32Array, A = d.uint16Array, R = E.float32Array, C = E.uint32Array, T = E.uint16Array, F = l * 2, f = s * 2, m = ht(F, A), O = ht(f, T);
   let S = !1;
   if (O && m)
-    E ? S = i(
+    h ? S = i(
       Et(s, C),
       ft(s * 2, T),
       Et(l, p),
@@ -1354,7 +1354,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
       a,
       r + 1,
       _,
-      !E
+      !h
     ) || y && Tt(
       s,
       L,
@@ -1366,7 +1366,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
       a,
       r + 1,
       _,
-      !E
+      !h
     ), vt.releasePrimitive(_);
   } else {
     const _ = pt(s), N = Ct(s, C);
@@ -1384,7 +1384,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
         r,
         a + 1,
         c,
-        E
+        h
       ) || Tt(
         l,
         N,
@@ -1396,7 +1396,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
         r,
         a + 1,
         c,
-        E
+        h
       );
     else if (L)
       if (m)
@@ -1411,7 +1411,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           r,
           a + 1,
           c,
-          E
+          h
         );
       else {
         const y = vt.getPrimitive();
@@ -1430,7 +1430,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ) || H && Tt(
           _,
           b,
@@ -1442,7 +1442,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ), vt.releasePrimitive(y);
       }
     else if (M)
@@ -1458,7 +1458,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           r,
           a + 1,
           c,
-          E
+          h
         );
       else {
         const y = vt.getPrimitive();
@@ -1477,7 +1477,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ) || H && Tt(
           N,
           b,
@@ -1489,7 +1489,7 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, E = !1) {
           a,
           r + 1,
           y,
-          !E
+          !h
         ), vt.releasePrimitive(y);
       }
   }
@@ -1565,22 +1565,22 @@ class Si {
     const e = this._roots[t], i = new Uint32Array(e), o = new Uint16Array(e);
     n(0);
     function n(r, a = 0) {
-      const c = r * 2, E = o[c + 15] === Us;
-      if (E) {
-        const d = i[r + 6], h = o[c + 14];
-        s(a, E, new Float32Array(e, r * 4, 6), d, h);
+      const c = r * 2, h = o[c + 15] === Us;
+      if (h) {
+        const d = i[r + 6], E = o[c + 14];
+        s(a, h, new Float32Array(e, r * 4, 6), d, E);
       } else {
-        const d = r + Ts / 4, h = i[r + 6], u = i[r + 7];
-        s(a, E, new Float32Array(e, r * 4, 6), u) || (n(d, a + 1), n(h, a + 1));
+        const d = r + Ts / 4, E = i[r + 6], u = i[r + 7];
+        s(a, h, new Float32Array(e, r * 4, 6), u) || (n(d, a + 1), n(E, a + 1));
       }
     }
   }
   /* Core Cast Functions */
   raycast(s, t = Di) {
-    const e = this._roots, i = this.geometry, o = [], n = t.isMaterial, r = Array.isArray(t), a = i.groups, c = n ? t.side : t, E = this.indirect ? Zo : vo;
-    for (let d = 0, h = e.length; d < h; d++) {
+    const e = this._roots, i = this.geometry, o = [], n = t.isMaterial, r = Array.isArray(t), a = i.groups, c = n ? t.side : t, h = this.indirect ? Zo : vo;
+    for (let d = 0, E = e.length; d < E; d++) {
       const u = r ? t[a[d].materialIndex].side : c, p = o.length;
-      if (E(this, d, u, s, o), r) {
+      if (h(this, d, u, s, o), r) {
         const A = a[d].materialIndex;
         for (let R = p, C = o.length; R < C; R++)
           o[R].face.materialIndex = A;
@@ -1591,9 +1591,9 @@ class Si {
   raycastFirst(s, t = Di) {
     const e = this._roots, i = this.geometry, o = t.isMaterial, n = Array.isArray(t);
     let r = null;
-    const a = i.groups, c = o ? t.side : t, E = this.indirect ? jo : Yo;
-    for (let d = 0, h = e.length; d < h; d++) {
-      const u = n ? t[a[d].materialIndex].side : c, p = E(this, d, u, s);
+    const a = i.groups, c = o ? t.side : t, h = this.indirect ? jo : Yo;
+    for (let d = 0, E = e.length; d < E; d++) {
+      const u = n ? t[a[d].materialIndex].side : c, p = h(this, d, u, s);
       p != null && (r == null || p.distance < r.distance) && (r = p, n && (p.face.materialIndex = a[d].materialIndex));
     }
     return r;
@@ -1615,13 +1615,13 @@ class Si {
     } = s;
     if (n && r) {
       const d = n;
-      n = (h, u, p, A, R) => d(h, u, p, A, R) ? !0 : e(h, u, this, r, p, A, t);
+      n = (E, u, p, A, R) => d(E, u, p, A, R) ? !0 : e(E, u, this, r, p, A, t);
     } else
-      n || (r ? n = (d, h, u, p) => e(d, h, this, r, u, p, t) : n = (d, h, u) => u);
+      n || (r ? n = (d, E, u, p) => e(d, E, this, r, u, p, t) : n = (d, E, u) => u);
     let a = !1, c = 0;
-    const E = this._roots;
-    for (let d = 0, h = E.length; d < h; d++) {
-      const u = E[d];
+    const h = this._roots;
+    for (let d = 0, E = h.length; d < E; d++) {
+      const u = h[d];
       if (a = _o(this, d, o, n, i, c), a)
         break;
       c += u.byteLength;
@@ -1638,18 +1638,18 @@ class Si {
       et(n, A * 3, r, a);
     } : (p) => {
       et(n, p * 3, r, a);
-    }, E = It.getPrimitive(), d = s.geometry.index, h = s.geometry.attributes.position, u = s.indirect ? (p) => {
+    }, h = It.getPrimitive(), d = s.geometry.index, E = s.geometry.attributes.position, u = s.indirect ? (p) => {
       const A = s.resolveTriangleIndex(p);
-      et(E, A * 3, d, h);
+      et(h, A * 3, d, E);
     } : (p) => {
-      et(E, p * 3, d, h);
+      et(h, p * 3, d, E);
     };
     if (o) {
       const p = (A, R, C, T, F, f, m, O) => {
         for (let S = C, _ = C + T; S < _; S++) {
-          u(S), E.a.applyMatrix4(t), E.b.applyMatrix4(t), E.c.applyMatrix4(t), E.needsUpdate = !0;
+          u(S), h.a.applyMatrix4(t), h.b.applyMatrix4(t), h.c.applyMatrix4(t), h.needsUpdate = !0;
           for (let N = A, L = A + R; N < L; N++)
-            if (c(N), n.needsUpdate = !0, o(n, E, N, S, F, f, m, O))
+            if (c(N), n.needsUpdate = !0, o(n, h, N, S, F, f, m, O))
               return !0;
         }
         return !1;
@@ -1987,11 +1987,11 @@ class ur {
     const e = this.faces;
     let i = -1 / 0, o = 1 / 0;
     for (let n = 0, r = e.length; n < r; n++) {
-      const a = e[n], c = a.distanceToPoint(s.origin), E = a.normal.dot(s.direction);
-      if (c > 0 && E >= 0)
+      const a = e[n], c = a.distanceToPoint(s.origin), h = a.normal.dot(s.direction);
+      if (c > 0 && h >= 0)
         return null;
-      const d = E !== 0 ? -c / E : 0;
-      if (!(d <= 0) && (E > 0 ? o = Math.min(d, o) : i = Math.max(d, i), i > o))
+      const d = h !== 0 ? -c / h : 0;
+      if (!(d <= 0) && (h > 0 ? o = Math.min(d, o) : i = Math.max(d, i), i > o))
         return null;
     }
     return i !== -1 / 0 ? s.at(i, t) : s.at(o, t), t;
@@ -2075,15 +2075,15 @@ class ur {
   computeInitialHull() {
     const s = this.vertices, t = this.computeExtremes(), e = t.min, i = t.max;
     let o = 0, n = 0;
-    for (let h = 0; h < 3; h++) {
-      const u = i[h].point.getComponent(h) - e[h].point.getComponent(h);
-      u > o && (o = u, n = h);
+    for (let E = 0; E < 3; E++) {
+      const u = i[E].point.getComponent(E) - e[E].point.getComponent(E);
+      u > o && (o = u, n = E);
     }
     const r = e[n], a = i[n];
-    let c, E;
+    let c, h;
     o = 0, tn.set(r.point, a.point);
-    for (let h = 0, u = this.vertices.length; h < u; h++) {
-      const p = s[h];
+    for (let E = 0, u = this.vertices.length; E < u; E++) {
+      const p = s[E];
       if (p !== r && p !== a) {
         tn.closestPointToPoint(p.point, !0, en);
         const A = en.distanceToSquared(p.point);
@@ -2091,42 +2091,42 @@ class ur {
       }
     }
     o = -1, qs.setFromCoplanarPoints(r.point, a.point, c.point);
-    for (let h = 0, u = this.vertices.length; h < u; h++) {
-      const p = s[h];
+    for (let E = 0, u = this.vertices.length; E < u; E++) {
+      const p = s[E];
       if (p !== r && p !== a && p !== c) {
         const A = Math.abs(qs.distanceToPoint(p.point));
-        A > o && (o = A, E = p);
+        A > o && (o = A, h = p);
       }
     }
     const d = [];
-    if (qs.distanceToPoint(E.point) < 0) {
+    if (qs.distanceToPoint(h.point) < 0) {
       d.push(
         Rt.create(r, a, c),
-        Rt.create(E, a, r),
-        Rt.create(E, c, a),
-        Rt.create(E, r, c)
+        Rt.create(h, a, r),
+        Rt.create(h, c, a),
+        Rt.create(h, r, c)
       );
-      for (let h = 0; h < 3; h++) {
-        const u = (h + 1) % 3;
-        d[h + 1].getEdge(2).setTwin(d[0].getEdge(u)), d[h + 1].getEdge(1).setTwin(d[u + 1].getEdge(0));
+      for (let E = 0; E < 3; E++) {
+        const u = (E + 1) % 3;
+        d[E + 1].getEdge(2).setTwin(d[0].getEdge(u)), d[E + 1].getEdge(1).setTwin(d[u + 1].getEdge(0));
       }
     } else {
       d.push(
         Rt.create(r, c, a),
-        Rt.create(E, r, a),
-        Rt.create(E, a, c),
-        Rt.create(E, c, r)
+        Rt.create(h, r, a),
+        Rt.create(h, a, c),
+        Rt.create(h, c, r)
       );
-      for (let h = 0; h < 3; h++) {
-        const u = (h + 1) % 3;
-        d[h + 1].getEdge(2).setTwin(d[0].getEdge((3 - h) % 3)), d[h + 1].getEdge(0).setTwin(d[u + 1].getEdge(1));
+      for (let E = 0; E < 3; E++) {
+        const u = (E + 1) % 3;
+        d[E + 1].getEdge(2).setTwin(d[0].getEdge((3 - E) % 3)), d[E + 1].getEdge(0).setTwin(d[u + 1].getEdge(1));
       }
     }
-    for (let h = 0; h < 4; h++)
-      this.faces.push(d[h]);
-    for (let h = 0, u = s.length; h < u; h++) {
-      const p = s[h];
-      if (p !== r && p !== a && p !== c && p !== E) {
+    for (let E = 0; E < 4; E++)
+      this.faces.push(d[E]);
+    for (let E = 0, u = s.length; E < u; E++) {
+      const p = s[E];
+      if (p !== r && p !== a && p !== c && p !== h) {
         o = this.tolerance;
         let A = null;
         for (let R = 0; R < 4; R++) {
@@ -2322,15 +2322,15 @@ function Cr(l, s) {
   let t = 0, e = 1;
   const i = l.elements;
   for (let c = 0; c < 3; c++) {
-    const E = Math.abs(i[Nt(Ii[c], fi[c])]);
-    E > t && (t = E, e = c);
+    const h = Math.abs(i[Nt(Ii[c], fi[c])]);
+    h > t && (t = h, e = c);
   }
   let o = 1, n = 0;
   const r = fi[e], a = Ii[e];
   if (Math.abs(i[Nt(a, r)]) > Number.EPSILON) {
-    const c = i[Nt(a, a)], E = i[Nt(r, r)], d = i[Nt(a, r)], h = (c - E) / 2 / d;
+    const c = i[Nt(a, a)], h = i[Nt(r, r)], d = i[Nt(a, r)], E = (c - h) / 2 / d;
     let u;
-    h < 0 ? u = -1 / (-h + Math.sqrt(1 + h * h)) : u = 1 / (h + Math.sqrt(1 + h * h)), o = 1 / Math.sqrt(1 + u * u), n = u * o;
+    E < 0 ? u = -1 / (-E + Math.sqrt(1 + E * E)) : u = 1 / (E + Math.sqrt(1 + E * E)), o = 1 / Math.sqrt(1 + u * u), n = u * o;
   }
   return s.identity(), s.elements[Nt(r, r)] = o, s.elements[Nt(a, a)] = o, s.elements[Nt(a, r)] = n, s.elements[Nt(r, a)] = -n, s;
 }
@@ -2368,12 +2368,12 @@ function mr(l) {
       n.push(bs.point.x, bs.point.y, bs.point.z), n.push(vs.point.x, vs.point.y, vs.point.z), n.push(Bs.point.x, Bs.point.y, Bs.point.z);
     }
   }
-  const r = new g.Vector3(), a = new g.Vector3(), c = new g.Vector3(), E = new g.Vector3(), d = new g.Vector3(), h = new g.Vector3(), u = new g.Vector3(), p = new g.Vector3();
+  const r = new g.Vector3(), a = new g.Vector3(), c = new g.Vector3(), h = new g.Vector3(), d = new g.Vector3(), E = new g.Vector3(), u = new g.Vector3(), p = new g.Vector3();
   let A = 0, R = 0, C = 0, T = 0, F = 0, f = 0, m = 0;
   for (let it = 0, Zt = n.length; it < Zt; it += 9) {
-    r.fromArray(n, it), a.fromArray(n, it + 3), c.fromArray(n, it + 6), u.set(0, 0, 0), u.add(r).add(a).add(c).divideScalar(3), E.subVectors(a, r), d.subVectors(c, r);
-    const tt = h.crossVectors(E, d).length() / 2;
-    p.add(h.copy(u).multiplyScalar(tt)), A += tt, R += (9 * u.x * u.x + r.x * r.x + a.x * a.x + c.x * c.x) * (tt / 12), C += (9 * u.x * u.y + r.x * r.y + a.x * a.y + c.x * c.y) * (tt / 12), T += (9 * u.x * u.z + r.x * r.z + a.x * a.z + c.x * c.z) * (tt / 12), F += (9 * u.y * u.y + r.y * r.y + a.y * a.y + c.y * c.y) * (tt / 12), f += (9 * u.y * u.z + r.y * r.z + a.y * a.z + c.y * c.z) * (tt / 12), m += (9 * u.z * u.z + r.z * r.z + a.z * a.z + c.z * c.z) * (tt / 12);
+    r.fromArray(n, it), a.fromArray(n, it + 3), c.fromArray(n, it + 6), u.set(0, 0, 0), u.add(r).add(a).add(c).divideScalar(3), h.subVectors(a, r), d.subVectors(c, r);
+    const tt = E.crossVectors(h, d).length() / 2;
+    p.add(E.copy(u).multiplyScalar(tt)), A += tt, R += (9 * u.x * u.x + r.x * r.x + a.x * a.x + c.x * c.x) * (tt / 12), C += (9 * u.x * u.y + r.x * r.y + a.x * a.y + c.x * c.y) * (tt / 12), T += (9 * u.x * u.z + r.x * r.z + a.x * a.z + c.x * c.z) * (tt / 12), F += (9 * u.y * u.y + r.y * r.y + a.y * a.y + c.y * c.y) * (tt / 12), f += (9 * u.y * u.z + r.y * r.z + a.y * a.z + c.y * c.z) * (tt / 12), m += (9 * u.z * u.z + r.z * r.z + a.z * a.z + c.z * c.z) * (tt / 12);
   }
   p.divideScalar(A), R /= A, C /= A, T /= A, F /= A, f /= A, m /= A, R -= p.x * p.x, C -= p.x * p.y, T -= p.x * p.z, F -= p.y * p.y, f -= p.y * p.z, m -= p.z * p.z;
   const O = new g.Matrix3();
@@ -3184,25 +3184,25 @@ function Es(l, s, t, e, i = 1 / 0, o) {
   e = Math.max(1e-4, e);
   const n = 2 / e, r = n * o, a = 1 / (1 + r + 0.48 * r * r + 0.235 * r * r * r);
   let c = l - s;
-  const E = s, d = i * e;
+  const h = s, d = i * e;
   c = mt(c, -d, d), s = l - c;
-  const h = (t.value + n * c) * o;
-  t.value = (t.value - n * h) * a;
-  let u = s + (c + h) * a;
-  return E - l > 0 == u > E && (u = E, t.value = (u - E) / o), u;
+  const E = (t.value + n * c) * o;
+  t.value = (t.value - n * E) * a;
+  let u = s + (c + E) * a;
+  return h - l > 0 == u > h && (u = h, t.value = (u - h) / o), u;
 }
 function an(l, s, t, e, i = 1 / 0, o, n) {
   e = Math.max(1e-4, e);
   const r = 2 / e, a = r * o, c = 1 / (1 + a + 0.48 * a * a + 0.235 * a * a * a);
-  let E = s.x, d = s.y, h = s.z, u = l.x - E, p = l.y - d, A = l.z - h;
-  const R = E, C = d, T = h, F = i * e, f = F * F, m = u * u + p * p + A * A;
+  let h = s.x, d = s.y, E = s.z, u = l.x - h, p = l.y - d, A = l.z - E;
+  const R = h, C = d, T = E, F = i * e, f = F * F, m = u * u + p * p + A * A;
   if (m > f) {
     const B = Math.sqrt(m);
     u = u / B * F, p = p / B * F, A = A / B * F;
   }
-  E = l.x - u, d = l.y - p, h = l.z - A;
+  h = l.x - u, d = l.y - p, E = l.z - A;
   const O = (t.x + r * u) * o, S = (t.y + r * p) * o, _ = (t.z + r * A) * o;
-  t.x = (t.x - r * O) * c, t.y = (t.y - r * S) * c, t.z = (t.z - r * _) * c, n.x = E + (u + O) * c, n.y = d + (p + S) * c, n.z = h + (A + _) * c;
+  t.x = (t.x - r * O) * c, t.y = (t.y - r * S) * c, t.z = (t.z - r * _) * c, n.x = h + (u + O) * c, n.y = d + (p + S) * c, n.z = E + (A + _) * c;
   const N = R - l.x, L = C - l.y, M = T - l.z, y = n.x - R, x = n.y - C, b = n.z - T;
   return N * y + L * x + M * b > 0 && (n.x = R, n.y = C, n.z = T, t.x = (n.x - R) / o, t.y = (n.y - C) / o, t.z = (n.z - T) / o), n;
 }
@@ -3408,7 +3408,7 @@ class ot extends gr {
         deltaY: 0,
         mouseButton: m
       };
-      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", E), this._isDragging = !0, A(f);
+      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), this._isDragging = !0, A(f);
     }, r = (f) => {
       if (!this._enabled || !this._domElement || this._lockedPointer)
         return;
@@ -3454,7 +3454,7 @@ class ot extends gr {
     }, c = (f) => {
       const m = this._lockedPointer || this._findPointerById(1);
       m && (m.clientX = f.clientX, m.clientY = f.clientY, m.deltaX = f.movementX, m.deltaY = f.movementY, this._state = 0, (this._lockedPointer || (f.buttons & V.LEFT) === V.LEFT) && (this._state = this._state | this.mouseButtons.left), (f.buttons & V.MIDDLE) === V.MIDDLE && (this._state = this._state | this.mouseButtons.middle), (f.buttons & V.RIGHT) === V.RIGHT && (this._state = this._state | this.mouseButtons.right), R());
-    }, E = (f) => {
+    }, h = (f) => {
       const m = this._findPointerById(f.pointerId);
       if (!(m && m === this._lockedPointer)) {
         if (m && this._disposePointer(m), f.pointerType === "touch")
@@ -3480,7 +3480,7 @@ class ot extends gr {
       const f = this._findPointerById(1);
       f && f === this._lockedPointer || (f && this._disposePointer(f), this._state = P.NONE, C());
     };
-    let h = -1;
+    let E = -1;
     const u = (f) => {
       if (!this._domElement || !this._enabled || this.mouseButtons.wheel === P.NONE)
         return;
@@ -3491,7 +3491,7 @@ class ot extends gr {
       }
       if (f.preventDefault(), this.dollyToCursor || this.mouseButtons.wheel === P.ROTATE || this.mouseButtons.wheel === P.TRUCK) {
         const N = performance.now();
-        h - N < 1e3 && this._getClientRect(this._elementRect), h = N;
+        E - N < 1e3 && this._getClientRect(this._elementRect), E = N;
       }
       const m = _r ? -1 : -3, O = f.deltaMode === 1 ? f.deltaY / m : f.deltaY / (m * 10), S = this.dollyToCursor ? (f.clientX - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, _ = this.dollyToCursor ? (f.clientY - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
       switch (this.mouseButtons.wheel) {
@@ -3521,7 +3521,7 @@ class ot extends gr {
       if (!(!this._domElement || !this._enabled)) {
         if (this.mouseButtons.right === ot.ACTION.NONE) {
           const m = f instanceof PointerEvent ? f.pointerId : (f instanceof MouseEvent, 0), O = this._findPointerById(m);
-          O && this._disposePointer(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("mouseup", d);
+          O && this._disposePointer(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("mouseup", d);
           return;
         }
         f.preventDefault();
@@ -3569,7 +3569,7 @@ class ot extends gr {
       }
       ((this._state & P.TRUCK) === P.TRUCK || (this._state & P.TOUCH_TRUCK) === P.TOUCH_TRUCK || (this._state & P.TOUCH_DOLLY_TRUCK) === P.TOUCH_DOLLY_TRUCK || (this._state & P.TOUCH_ZOOM_TRUCK) === P.TOUCH_ZOOM_TRUCK) && (this._truckInternal(O, S, !1), this._isUserControllingTruck = !0), ((this._state & P.OFFSET) === P.OFFSET || (this._state & P.TOUCH_OFFSET) === P.TOUCH_OFFSET || (this._state & P.TOUCH_DOLLY_OFFSET) === P.TOUCH_DOLLY_OFFSET || (this._state & P.TOUCH_ZOOM_OFFSET) === P.TOUCH_ZOOM_OFFSET) && (this._truckInternal(O, S, !0), this._isUserControllingOffset = !0), this.dispatchEvent({ type: "control" });
     }, C = () => {
-      Ks(this._activePointers, lt), i.copy(lt), this._dragNeedsUpdate = !1, (this._activePointers.length === 0 || this._activePointers.length === 1 && this._activePointers[0] === this._lockedPointer) && (this._isDragging = !1), this._activePointers.length === 0 && this._domElement && (this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mouseup", d), this.dispatchEvent({ type: "controlend" }));
+      Ks(this._activePointers, lt), i.copy(lt), this._dragNeedsUpdate = !1, (this._activePointers.length === 0 || this._activePointers.length === 1 && this._activePointers[0] === this._lockedPointer) && (this._isDragging = !1), this._activePointers.length === 0 && this._domElement && (this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mouseup", d), this.dispatchEvent({ type: "controlend" }));
     };
     this.lockPointer = () => {
       !this._enabled || !this._domElement || (this.cancel(), this._lockedPointer = {
@@ -3579,7 +3579,7 @@ class ot extends gr {
         deltaX: 0,
         deltaY: 0,
         mouseButton: null
-      }, this._activePointers.push(this._lockedPointer), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.requestPointerLock(), this._domElement.ownerDocument.addEventListener("pointerlockchange", T), this._domElement.ownerDocument.addEventListener("pointerlockerror", F), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", E), A());
+      }, this._activePointers.push(this._lockedPointer), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.requestPointerLock(), this._domElement.ownerDocument.addEventListener("pointerlockchange", T), this._domElement.ownerDocument.addEventListener("pointerlockerror", F), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), A());
     }, this.unlockPointer = () => {
       this._lockedPointer !== null && (this._disposePointer(this._lockedPointer), this._lockedPointer = null), document.exitPointerLock(), this.cancel(), this._domElement && (this._domElement.ownerDocument.removeEventListener("pointerlockchange", T), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
     };
@@ -3589,9 +3589,9 @@ class ot extends gr {
       this.unlockPointer();
     };
     this._addAllEventListeners = (f) => {
-      this._domElement = f, this._domElement.style.touchAction = "none", this._domElement.style.userSelect = "none", this._domElement.style.webkitUserSelect = "none", this._domElement.addEventListener("pointerdown", n), Nr && this._domElement.addEventListener("mousedown", r), this._domElement.addEventListener("pointercancel", E), this._domElement.addEventListener("wheel", u, { passive: !1 }), this._domElement.addEventListener("contextmenu", p);
+      this._domElement = f, this._domElement.style.touchAction = "none", this._domElement.style.userSelect = "none", this._domElement.style.webkitUserSelect = "none", this._domElement.addEventListener("pointerdown", n), Nr && this._domElement.addEventListener("mousedown", r), this._domElement.addEventListener("pointercancel", h), this._domElement.addEventListener("wheel", u, { passive: !1 }), this._domElement.addEventListener("contextmenu", p);
     }, this._removeAllEventListeners = () => {
-      this._domElement && (this._domElement.style.touchAction = "", this._domElement.style.userSelect = "", this._domElement.style.webkitUserSelect = "", this._domElement.removeEventListener("pointerdown", n), this._domElement.removeEventListener("mousedown", r), this._domElement.removeEventListener("pointercancel", E), this._domElement.removeEventListener("wheel", u, { passive: !1 }), this._domElement.removeEventListener("contextmenu", p), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", E), this._domElement.ownerDocument.removeEventListener("mouseup", d), this._domElement.ownerDocument.removeEventListener("pointerlockchange", T), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
+      this._domElement && (this._domElement.style.touchAction = "", this._domElement.style.userSelect = "", this._domElement.style.webkitUserSelect = "", this._domElement.removeEventListener("pointerdown", n), this._domElement.removeEventListener("mousedown", r), this._domElement.removeEventListener("pointercancel", h), this._domElement.removeEventListener("wheel", u, { passive: !1 }), this._domElement.removeEventListener("contextmenu", p), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", c), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mouseup", d), this._domElement.ownerDocument.removeEventListener("pointerlockchange", T), this._domElement.ownerDocument.removeEventListener("pointerlockerror", F));
     }, this.cancel = () => {
       this._state !== P.NONE && (this._state = P.NONE, this._activePointers.length = 0, C());
     }, t && this.connect(t), this.update(0);
@@ -3958,12 +3958,12 @@ class ot extends gr {
   fitToBox(s, t, { cover: e = !1, paddingLeft: i = 0, paddingRight: o = 0, paddingBottom: n = 0, paddingTop: r = 0 } = {}) {
     const a = [], c = s.isBox3 ? ue.copy(s) : ue.setFromObject(s);
     c.isEmpty() && (console.warn("camera-controls: fitTo() cannot be used with an empty box. Aborting"), Promise.resolve());
-    const E = rn(this._sphericalEnd.theta, on), d = rn(this._sphericalEnd.phi, on);
-    a.push(this.rotateTo(E, d, t));
-    const h = G.setFromSpherical(this._sphericalEnd).normalize(), u = dn.setFromUnitVectors(h, ti), p = k(Math.abs(h.y), 1);
-    p && u.multiply(si.setFromAxisAngle(us, E)), u.multiply(this._yAxisUpSpaceInverse);
+    const h = rn(this._sphericalEnd.theta, on), d = rn(this._sphericalEnd.phi, on);
+    a.push(this.rotateTo(h, d, t));
+    const E = G.setFromSpherical(this._sphericalEnd).normalize(), u = dn.setFromUnitVectors(E, ti), p = k(Math.abs(E.y), 1);
+    p && u.multiply(si.setFromAxisAngle(us, h)), u.multiply(this._yAxisUpSpaceInverse);
     const A = En.makeEmpty();
-    z.copy(c.min).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setX(c.max.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setY(c.max.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setZ(c.min.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setZ(c.max.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setY(c.min.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setX(c.min.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).applyQuaternion(u), A.expandByPoint(z), A.min.x -= i, A.min.y -= n, A.max.x += o, A.max.y += r, u.setFromUnitVectors(ti, h), p && u.premultiply(si.invert()), u.premultiply(this._yAxisUpSpace);
+    z.copy(c.min).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setX(c.max.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setY(c.max.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setZ(c.min.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.min).setZ(c.max.z).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setY(c.min.y).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).setX(c.min.x).applyQuaternion(u), A.expandByPoint(z), z.copy(c.max).applyQuaternion(u), A.expandByPoint(z), A.min.x -= i, A.min.y -= n, A.max.x += o, A.max.y += r, u.setFromUnitVectors(ti, E), p && u.premultiply(si.invert()), u.premultiply(this._yAxisUpSpace);
     const R = A.getSize(G), C = A.getCenter(z).applyQuaternion(u);
     if (Qt(this._camera)) {
       const T = this.getDistanceToFitBox(R.x, R.y, R.z, e);
@@ -4006,8 +4006,8 @@ class ot extends gr {
     this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._lastDollyDirection = he.NONE, this._changedDolly = 0;
     const a = z.set(i, o, n), c = G.set(s, t, e);
     this._targetEnd.copy(a), this._sphericalEnd.setFromVector3(c.sub(a).applyQuaternion(this._yAxisUpSpace)), this.normalizeRotations(), this._needsUpdate = !0, r || (this._target.copy(this._targetEnd), this._spherical.copy(this._sphericalEnd));
-    const E = !r || k(this._target.x, this._targetEnd.x, this.restThreshold) && k(this._target.y, this._targetEnd.y, this.restThreshold) && k(this._target.z, this._targetEnd.z, this.restThreshold) && k(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && k(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && k(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
-    return this._createOnRestPromise(E);
+    const h = !r || k(this._target.x, this._targetEnd.x, this.restThreshold) && k(this._target.y, this._targetEnd.y, this.restThreshold) && k(this._target.z, this._targetEnd.z, this.restThreshold) && k(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && k(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && k(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
+    return this._createOnRestPromise(h);
   }
   /**
    * Similar to setLookAt, but it interpolates between two states.
@@ -4027,11 +4027,11 @@ class ot extends gr {
    * @param enableTransition
    * @category Methods
    */
-  lerpLookAt(s, t, e, i, o, n, r, a, c, E, d, h, u, p = !1) {
+  lerpLookAt(s, t, e, i, o, n, r, a, c, h, d, E, u, p = !1) {
     this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._lastDollyDirection = he.NONE, this._changedDolly = 0;
     const A = G.set(i, o, n), R = z.set(s, t, e);
     dt.setFromVector3(R.sub(A).applyQuaternion(this._yAxisUpSpace));
-    const C = de.set(E, d, h), T = z.set(r, a, c);
+    const C = de.set(h, d, E), T = z.set(r, a, c);
     we.setFromVector3(T.sub(C).applyQuaternion(this._yAxisUpSpace)), this._targetEnd.copy(A.lerp(C, u));
     const F = we.theta - dt.theta, f = we.phi - dt.phi, m = we.radius - dt.radius;
     this._sphericalEnd.set(dt.radius + m * u, dt.phi + f * u, dt.theta + F * u), this.normalizeRotations(), this._needsUpdate = !0, p || (this._target.copy(this._targetEnd), this._spherical.copy(this._sphericalEnd));
@@ -4277,9 +4277,9 @@ class ot extends gr {
     }
     if (this.dollyToCursor) {
       if (Qt(this._camera) && this._changedDolly !== 0) {
-        const d = this._spherical.radius - this._lastDistance, h = this._camera, u = this._getCameraDirection(ye), p = G.copy(u).cross(h.up).normalize();
+        const d = this._spherical.radius - this._lastDistance, E = this._camera, u = this._getCameraDirection(ye), p = G.copy(u).cross(E.up).normalize();
         p.lengthSq() === 0 && (p.x = 1);
-        const A = z.crossVectors(p, u), R = this._sphericalEnd.radius * Math.tan(h.getEffectiveFOV() * Ne * 0.5), T = (this._sphericalEnd.radius - d - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = de.copy(this._targetEnd).add(p.multiplyScalar(this._dollyControlCoord.x * R * h.aspect)).add(A.multiplyScalar(this._dollyControlCoord.y * R)), f = G.copy(this._targetEnd).lerp(F, T), m = this._lastDollyDirection === he.IN && this._spherical.radius <= this.minDistance, O = this._lastDollyDirection === he.OUT && this.maxDistance <= this._spherical.radius;
+        const A = z.crossVectors(p, u), R = this._sphericalEnd.radius * Math.tan(E.getEffectiveFOV() * Ne * 0.5), T = (this._sphericalEnd.radius - d - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = de.copy(this._targetEnd).add(p.multiplyScalar(this._dollyControlCoord.x * R * E.aspect)).add(A.multiplyScalar(this._dollyControlCoord.y * R)), f = G.copy(this._targetEnd).lerp(F, T), m = this._lastDollyDirection === he.IN && this._spherical.radius <= this.minDistance, O = this._lastDollyDirection === he.OUT && this.maxDistance <= this._spherical.radius;
         if (this.infinityDolly && (m || O)) {
           this._sphericalEnd.radius -= d, this._spherical.radius -= d;
           const _ = z.copy(u).multiplyScalar(-d);
@@ -4289,7 +4289,7 @@ class ot extends gr {
         const S = z.subVectors(f, this._targetEnd);
         this._targetEnd.copy(f), this._target.add(S), this._changedDolly -= d, X(this._changedDolly) && (this._changedDolly = 0);
       } else if (bt(this._camera) && this._changedZoom !== 0) {
-        const d = this._zoom - this._lastZoom, h = this._camera, u = G.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (h.near + h.far) / (h.near - h.far)).unproject(h), p = z.set(0, 0, -1).applyQuaternion(h.quaternion), A = de.copy(u).add(p.multiplyScalar(-u.dot(h.up))), C = -(this._zoom - d - this._zoom) / this._zoom, T = this._getCameraDirection(ye), F = this._targetEnd.dot(T), f = G.copy(this._targetEnd).lerp(A, C), m = f.dot(T), O = T.multiplyScalar(m - F);
+        const d = this._zoom - this._lastZoom, E = this._camera, u = G.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (E.near + E.far) / (E.near - E.far)).unproject(E), p = z.set(0, 0, -1).applyQuaternion(E.quaternion), A = de.copy(u).add(p.multiplyScalar(-u.dot(E.up))), C = -(this._zoom - d - this._zoom) / this._zoom, T = this._getCameraDirection(ye), F = this._targetEnd.dot(T), f = G.copy(this._targetEnd).lerp(A, C), m = f.dot(T), O = T.multiplyScalar(m - F);
         f.sub(O), this._boundary.clampPoint(f, f);
         const S = z.subVectors(f, this._targetEnd);
         this._targetEnd.copy(f), this._target.add(S), this._changedZoom -= d, X(this._changedZoom) && (this._changedZoom = 0);
@@ -4298,8 +4298,8 @@ class ot extends gr {
     this._camera.zoom !== this._zoom && (this._camera.zoom = this._zoom, this._camera.updateProjectionMatrix(), this._updateNearPlaneCorners(), this._needsUpdate = !0), this._dragNeedsUpdate = !0;
     const a = this._collisionTest();
     this._spherical.radius = Math.min(this._spherical.radius, a), this._spherical.makeSafe(), this._camera.position.setFromSpherical(this._spherical).applyQuaternion(this._yAxisUpSpaceInverse).add(this._target), this._camera.lookAt(this._target), (!X(this._focalOffset.x) || !X(this._focalOffset.y) || !X(this._focalOffset.z)) && (this._camera.updateMatrixWorld(), gt.setFromMatrixColumn(this._camera.matrix, 0), St.setFromMatrixColumn(this._camera.matrix, 1), jt.setFromMatrixColumn(this._camera.matrix, 2), gt.multiplyScalar(this._focalOffset.x), St.multiplyScalar(-this._focalOffset.y), jt.multiplyScalar(this._focalOffset.z), G.copy(gt).add(St).add(jt), this._camera.position.add(G)), this._boundaryEnclosesCamera && this._encloseToBoundary(this._camera.position.copy(this._target), G.setFromSpherical(this._spherical).applyQuaternion(this._yAxisUpSpaceInverse), 1);
-    const E = this._needsUpdate;
-    return E && !this._updatedLastTime ? (this._hasRested = !1, this.dispatchEvent({ type: "wake" }), this.dispatchEvent({ type: "update" })) : E ? (this.dispatchEvent({ type: "update" }), X(t, this.restThreshold) && X(e, this.restThreshold) && X(i, this.restThreshold) && X(o.x, this.restThreshold) && X(o.y, this.restThreshold) && X(o.z, this.restThreshold) && X(n.x, this.restThreshold) && X(n.y, this.restThreshold) && X(n.z, this.restThreshold) && X(r, this.restThreshold) && !this._hasRested && (this._hasRested = !0, this.dispatchEvent({ type: "rest" }))) : !E && this._updatedLastTime && this.dispatchEvent({ type: "sleep" }), this._lastDistance = this._spherical.radius, this._lastZoom = this._zoom, this._updatedLastTime = E, this._needsUpdate = !1, E;
+    const h = this._needsUpdate;
+    return h && !this._updatedLastTime ? (this._hasRested = !1, this.dispatchEvent({ type: "wake" }), this.dispatchEvent({ type: "update" })) : h ? (this.dispatchEvent({ type: "update" }), X(t, this.restThreshold) && X(e, this.restThreshold) && X(i, this.restThreshold) && X(o.x, this.restThreshold) && X(o.y, this.restThreshold) && X(o.z, this.restThreshold) && X(n.x, this.restThreshold) && X(n.y, this.restThreshold) && X(n.z, this.restThreshold) && X(r, this.restThreshold) && !this._hasRested && (this._hasRested = !0, this.dispatchEvent({ type: "rest" }))) : !h && this._updatedLastTime && this.dispatchEvent({ type: "sleep" }), this._lastDistance = this._spherical.radius, this._lastZoom = this._zoom, this._updatedLastTime = h, this._needsUpdate = !1, h;
   }
   /**
    * Get all state in JSON string
@@ -4490,9 +4490,9 @@ class ot extends gr {
         return;
       const r = n, a = r.geometry.clone();
       a.applyMatrix4(r.matrixWorld);
-      const E = a.attributes.position;
-      for (let d = 0, h = E.count; d < h; d++)
-        G.fromBufferAttribute(E, d), o = Math.max(o, i.distanceToSquared(G));
+      const h = a.attributes.position;
+      for (let d = 0, E = h.count; d < E; d++)
+        G.fromBufferAttribute(h, d), o = Math.max(o, i.distanceToSquared(G));
     }), e.radius = Math.sqrt(o), e;
   }
 }
@@ -4801,9 +4801,6 @@ class Pr {
   set fade(s) {
     this._fade = s ? 3 : 0, this.material.uniforms.uFade.value = this._fade;
   }
-  [Symbol.dispose]() {
-    throw new Error("Method not implemented.");
-  }
   /** {@link Disposable.dispose} */
   dispose() {
     this.setupEvents(!1), this.components.get(Ht).destroy(this.three), this.onDisposed.trigger(), this.onDisposed.reset(), this.world = null, this.components = null;
@@ -4875,8 +4872,8 @@ class Lr extends ri {
       }), o[T] = F, i[T] = F, e[T] = F;
     }
     n("camera", s), n("object", void 0), n("enabled", !0), n("axis", null), n("mode", "translate"), n("translationSnap", null), n("rotationSnap", null), n("scaleSnap", null), n("space", "world"), n("size", 1), n("dragging", !1), n("showX", !0), n("showY", !0), n("showZ", !0);
-    const r = new w(), a = new w(), c = new Pt(), E = new Pt(), d = new w(), h = new Pt(), u = new w(), p = new w(), A = new w(), R = 0, C = new w();
-    n("worldPosition", r), n("worldPositionStart", a), n("worldQuaternion", c), n("worldQuaternionStart", E), n("cameraPosition", d), n("cameraQuaternion", h), n("pointStart", u), n("pointEnd", p), n("rotationAxis", A), n("rotationAngle", R), n("eye", C), this._offset = new w(), this._startNorm = new w(), this._endNorm = new w(), this._cameraScale = new w(), this._parentPosition = new w(), this._parentQuaternion = new Pt(), this._parentQuaternionInv = new Pt(), this._parentScale = new w(), this._worldScaleStart = new w(), this._worldQuaternionInv = new Pt(), this._worldScale = new w(), this._positionStart = new w(), this._quaternionStart = new Pt(), this._scaleStart = new w(), this._getPointer = yr.bind(this), this._onPointerDown = Mr.bind(this), this._onPointerHover = wr.bind(this), this._onPointerMove = Dr.bind(this), this._onPointerUp = Ur.bind(this), this.domElement.addEventListener("pointerdown", this._onPointerDown), this.domElement.addEventListener("pointermove", this._onPointerHover), this.domElement.addEventListener("pointerup", this._onPointerUp);
+    const r = new w(), a = new w(), c = new Pt(), h = new Pt(), d = new w(), E = new Pt(), u = new w(), p = new w(), A = new w(), R = 0, C = new w();
+    n("worldPosition", r), n("worldPositionStart", a), n("worldQuaternion", c), n("worldQuaternionStart", h), n("cameraPosition", d), n("cameraQuaternion", E), n("pointStart", u), n("pointEnd", p), n("rotationAxis", A), n("rotationAngle", R), n("eye", C), this._offset = new w(), this._startNorm = new w(), this._endNorm = new w(), this._cameraScale = new w(), this._parentPosition = new w(), this._parentQuaternion = new Pt(), this._parentQuaternionInv = new Pt(), this._parentScale = new w(), this._worldScaleStart = new w(), this._worldQuaternionInv = new Pt(), this._worldScale = new w(), this._positionStart = new w(), this._quaternionStart = new Pt(), this._scaleStart = new w(), this._getPointer = yr.bind(this), this._onPointerDown = Mr.bind(this), this._onPointerHover = wr.bind(this), this._onPointerMove = Dr.bind(this), this._onPointerUp = Ur.bind(this), this.domElement.addEventListener("pointerdown", this._onPointerDown), this.domElement.addEventListener("pointermove", this._onPointerHover), this.domElement.addEventListener("pointerup", this._onPointerUp);
   }
   // updateMatrixWorld  updates key transformation variables
   updateMatrixWorld() {
@@ -5038,12 +5035,12 @@ class xr extends ri {
     a.color.setHex(16711680), a.opacity = 0.5;
     const c = s.clone();
     c.color.setHex(65280), c.opacity = 0.5;
-    const E = s.clone();
-    E.color.setHex(255), E.opacity = 0.5;
+    const h = s.clone();
+    h.color.setHex(255), h.opacity = 0.5;
     const d = s.clone();
     d.opacity = 0.25;
-    const h = s.clone();
-    h.color.setHex(16776960), h.opacity = 0.25, s.clone().color.setHex(16776960);
+    const E = s.clone();
+    E.color.setHex(16776960), E.opacity = 0.25, s.clone().color.setHex(16776960);
     const p = s.clone();
     p.color.setHex(7895160);
     const A = new ct(0, 0.04, 0.1, 12);
@@ -5082,7 +5079,7 @@ class xr extends ri {
         [new v(new Qe(0.1, 0), d.clone()), [0, 0, 0]]
       ],
       XY: [
-        [new v(new rt(0.15, 0.15, 0.01), E.clone()), [0.15, 0.15, 0]]
+        [new v(new rt(0.15, 0.15, 0.01), h.clone()), [0.15, 0.15, 0]]
       ],
       YZ: [
         [new v(new rt(0.15, 0.15, 0.01), a.clone()), [0, 0.15, 0.15], [0, Math.PI / 2, 0]]
@@ -5148,7 +5145,7 @@ class xr extends ri {
         [new v(F(0.5, 0.5), r), null, [0, Math.PI / 2, 0]]
       ],
       E: [
-        [new v(F(0.75, 1), h), null, [0, Math.PI / 2, 0]]
+        [new v(F(0.75, 1), E), null, [0, Math.PI / 2, 0]]
       ]
     }, N = {
       AXIS: [
@@ -5187,7 +5184,7 @@ class xr extends ri {
         [new v(R, r), [0, 0, -0.5], [-Math.PI / 2, 0, 0]]
       ],
       XY: [
-        [new v(new rt(0.15, 0.15, 0.01), E), [0.15, 0.15, 0]]
+        [new v(new rt(0.15, 0.15, 0.01), h), [0.15, 0.15, 0]]
       ],
       YZ: [
         [new v(new rt(0.15, 0.15, 0.01), a), [0, 0.15, 0.15], [0, Math.PI / 2, 0]]
@@ -5853,22 +5850,22 @@ class Gr extends Vr {
     let a;
     if (Array.isArray(o)) {
       let d = !0;
-      const h = [];
+      const E = [];
       for (const u of o)
-        nn.isTransparent(u) ? h.push(this._transparentMat) : (d = !1, h.push(n));
+        nn.isTransparent(u) ? E.push(this._transparentMat) : (d = !1, E.push(n));
       if (d) {
         n.dispose(), this.isProcessing = !1;
         return;
       }
-      a = h;
+      a = E;
     } else if (nn.isTransparent(o)) {
       n.dispose(), this.isProcessing = !1;
       return;
     } else
       a = n;
     this._colorCodeMeshMap.set(r, t), this._meshIDColorCodeMap.set(t.uuid, r);
-    const c = e ? t.count : 1, E = new g.InstancedMesh(i, a, c);
-    e ? E.instanceMatrix = t.instanceMatrix : E.setMatrixAt(0, new g.Matrix4()), t.visible = !1, E.applyMatrix4(t.matrix), E.updateMatrix(), this.scene.add(E), this.colorMeshes.set(t.uuid, E), this.increaseColor(), this.isProcessing = !1;
+    const c = e ? t.count : 1, h = new g.InstancedMesh(i, a, c);
+    e ? h.instanceMatrix = t.instanceMatrix : h.setMatrixAt(0, new g.Matrix4()), t.visible = !1, h.applyMatrix4(t.matrix), h.updateMatrix(), this.scene.add(h), this.colorMeshes.set(t.uuid, h), this.increaseColor(), this.isProcessing = !1;
   }
   remove(t) {
     if (this.isProcessing) {
@@ -6288,10 +6285,10 @@ class oa extends ke {
     }
     const a = new g.Box3(n, r), c = new g.Vector3();
     a.getSize(c);
-    const E = new g.Vector3();
-    a.getCenter(E);
-    const d = Math.max(c.x, c.y, c.z) * e, h = new g.Sphere(E, d);
-    await this.controls.fitToSphere(h, !0);
+    const h = new g.Vector3();
+    a.getCenter(h);
+    const d = Math.max(c.x, c.y, c.z) * e, E = new g.Sphere(h, d);
+    await this.controls.fitToSphere(E, !0);
   }
   /**
    * Allows or prevents all user input.
@@ -6389,16 +6386,16 @@ const At = class At extends J {
     const o = t.matrixWorld, n = new g.Matrix4(), r = t instanceof g.InstancedMesh, a = /* @__PURE__ */ new Set();
     if (e && t instanceof Vt.FragmentMesh)
       for (const c of e) {
-        const E = t.fragment.getInstancesIDs(c);
-        if (E)
-          for (const d of E)
+        const h = t.fragment.getInstancesIDs(c);
+        if (h)
+          for (const d of h)
             a.add(d);
       }
     else
       a.add(0);
     for (const c of a) {
-      const E = i.min.clone(), d = i.max.clone();
-      r && (t.getMatrixAt(c, n), E.applyMatrix4(n), d.applyMatrix4(n)), E.applyMatrix4(o), d.applyMatrix4(o), E.x < this._absoluteMin.x && (this._absoluteMin.x = E.x), E.y < this._absoluteMin.y && (this._absoluteMin.y = E.y), E.z < this._absoluteMin.z && (this._absoluteMin.z = E.z), E.x > this._absoluteMax.x && (this._absoluteMax.x = E.x), E.y > this._absoluteMax.y && (this._absoluteMax.y = E.y), E.z > this._absoluteMax.z && (this._absoluteMax.z = E.z), d.x > this._absoluteMax.x && (this._absoluteMax.x = d.x), d.y > this._absoluteMax.y && (this._absoluteMax.y = d.y), d.z > this._absoluteMax.z && (this._absoluteMax.z = d.z), d.x < this._absoluteMin.x && (this._absoluteMin.x = d.x), d.y < this._absoluteMin.y && (this._absoluteMin.y = d.y), d.z < this._absoluteMin.z && (this._absoluteMin.z = d.z);
+      const h = i.min.clone(), d = i.max.clone();
+      r && (t.getMatrixAt(c, n), h.applyMatrix4(n), d.applyMatrix4(n)), h.applyMatrix4(o), d.applyMatrix4(o), h.x < this._absoluteMin.x && (this._absoluteMin.x = h.x), h.y < this._absoluteMin.y && (this._absoluteMin.y = h.y), h.z < this._absoluteMin.z && (this._absoluteMin.z = h.z), h.x > this._absoluteMax.x && (this._absoluteMax.x = h.x), h.y > this._absoluteMax.y && (this._absoluteMax.y = h.y), h.z > this._absoluteMax.z && (this._absoluteMax.z = h.z), d.x > this._absoluteMax.x && (this._absoluteMax.x = d.x), d.y > this._absoluteMax.y && (this._absoluteMax.y = d.y), d.z > this._absoluteMax.z && (this._absoluteMax.z = d.z), d.x < this._absoluteMin.x && (this._absoluteMin.x = d.x), d.y < this._absoluteMin.y && (this._absoluteMin.y = d.y), d.z < this._absoluteMin.z && (this._absoluteMin.z = d.z);
     }
   }
   static getFragmentBounds(t) {
@@ -6411,8 +6408,8 @@ const At = class At extends J {
         c += 2;
         continue;
       }
-      const E = a[c], d = e.getX(E), h = e.getY(E), u = e.getZ(E);
-      d < n.x && (n.x = d), h < n.y && (n.y = h), u < n.z && (n.z = u), d > r.x && (r.x = d), h > r.y && (r.y = h), u > r.z && (r.z = u);
+      const h = a[c], d = e.getX(h), E = e.getY(h), u = e.getZ(h);
+      d < n.x && (n.x = d), E < n.y && (n.y = E), u < n.z && (n.z = u), d > r.x && (r.x = d), E > r.y && (r.y = E), u > r.z && (r.z = u);
     }
     return new g.Box3(n, r);
   }
@@ -6581,9 +6578,9 @@ const Li = /* @__PURE__ */ new Set([
     for (const c of r) {
       if (Li.has(c))
         continue;
-      const E = a.has(c) && o, d = t.GetLineIDsWithType(e, c);
-      for (const h of d) {
-        const u = t.GetLine(0, h, E, i);
+      const h = a.has(c) && o, d = t.GetLineIDsWithType(e, c);
+      for (const E of d) {
+        const u = t.GetLine(0, E, h, i);
         n[u.expressID] = u;
       }
     }
@@ -6639,10 +6636,11 @@ const Ps = class Ps extends J {
    * @returns The loaded FragmentsGroup.
    */
   load(t, e) {
-    const o = { ...{ coordinate: !0 }, ...e }, { coordinate: n, properties: r, relationsMap: a } = o, c = this._loader.import(t);
-    for (const E of c.items)
-      E.group = c, this.list.set(E.id, E);
-    return n && this.coordinate([c]), this.groups.set(c.uuid, c), r && c.setLocalProperties(r), a && this.components.get(We).setRelationMap(c, a), this.onFragmentsLoaded.trigger(c), c;
+    const o = { ...{ coordinate: !0 }, ...e }, { coordinate: n, name: r, properties: a, relationsMap: c } = o, h = this._loader.import(t);
+    r && (h.name = r);
+    for (const d of h.items)
+      d.group = h, this.list.set(d.id, d);
+    return n && this.coordinate([h]), this.groups.set(h.uuid, h), a && h.setLocalProperties(a), c && this.components.get(We).setRelationMap(h, c), this.onFragmentsLoaded.trigger(h), h;
   }
   /**
    * Export the specified fragments.
@@ -7977,8 +7975,8 @@ class Gt {
       const a = await s.getProperties(r.value);
       if (!a || !a.UnitType || !a.UnitType.value || a.UnitType.value !== "LENGTHUNIT")
         continue;
-      let E = 1, d = 1;
-      return a.Name.value === "METRE" && (d = 1), a.Name.value === "FOOT" && (d = 0.3048), ((n = a.Prefix) == null ? void 0 : n.value) === "MILLI" && (E = 1e-3), d * E;
+      let h = 1, d = 1;
+      return a.Name.value === "METRE" && (d = 1), a.Name.value === "FOOT" && (d = 0.3048), ((n = a.Prefix) == null ? void 0 : n.value) === "MILLI" && (h = 1e-3), d * h;
     }
     return 1;
   }
@@ -7997,17 +7995,17 @@ class Gt {
     const o = e ?? (async () => {
     }), n = {}, r = s.getAllPropertiesIDs();
     for (const c of r) {
-      const E = await s.getProperties(c);
-      if (!E)
+      const h = await s.getProperties(c);
+      if (!h)
         continue;
-      const d = E.type === t, h = Object.keys(E).find(
+      const d = h.type === t, E = Object.keys(h).find(
         (C) => C.startsWith("Relating")
-      ), u = Object.keys(E).find(
+      ), u = Object.keys(h).find(
         (C) => C.startsWith("Related")
       );
-      if (!(d && h && u))
+      if (!(d && E && u))
         continue;
-      const p = await s.getProperties((a = E[h]) == null ? void 0 : a.value), A = E[u];
+      const p = await s.getProperties((a = h[E]) == null ? void 0 : a.value), A = h[u];
       if (!p || !A || !(A && Array.isArray(A)))
         continue;
       const R = A.map((C) => C.value);
@@ -8249,11 +8247,11 @@ const Qr = /* @__PURE__ */ new Map([
           const r = this._relToAttributesMap.get(i);
           if (!r)
             return;
-          const { forRelated: a, forRelating: c } = r, E = e.get(o) ?? /* @__PURE__ */ new Map(), d = this._inverseAttributes.indexOf(c);
-          E.set(d, n), e.set(o, E);
-          for (const h of n) {
-            const u = e.get(h) ?? /* @__PURE__ */ new Map(), p = this._inverseAttributes.indexOf(a), A = u.get(p) ?? [];
-            A.push(o), u.set(p, A), e.set(h, u);
+          const { forRelated: a, forRelating: c } = r, h = e.get(o) ?? /* @__PURE__ */ new Map(), d = this._inverseAttributes.indexOf(c);
+          h.set(d, n), e.set(o, h);
+          for (const E of n) {
+            const u = e.get(E) ?? /* @__PURE__ */ new Map(), p = this._inverseAttributes.indexOf(a), A = u.get(p) ?? [];
+            A.push(o), u.set(p, A), e.set(E, u);
           }
         }
       );
@@ -8274,18 +8272,18 @@ const Qr = /* @__PURE__ */ new Map([
       if (!n)
         continue;
       const { forRelated: r, forRelating: a } = n, c = t.GetLineIDsWithType(e, o);
-      for (let E = 0; E < c.size(); E++) {
+      for (let h = 0; h < c.size(); h++) {
         const d = await t.properties.getItemProperties(
           e,
-          c.get(E)
-        ), h = Object.keys(d).find(
+          c.get(h)
+        ), E = Object.keys(d).find(
           (T) => T.startsWith("Relating")
         ), u = Object.keys(d).find(
           (T) => T.startsWith("Related")
         );
-        if (!(h && u))
+        if (!(E && u))
           continue;
-        const p = d[h].value, A = d[u].map((T) => T.value), R = i.get(p) ?? /* @__PURE__ */ new Map(), C = this._inverseAttributes.indexOf(a);
+        const p = d[E].value, A = d[u].map((T) => T.value), R = i.get(p) ?? /* @__PURE__ */ new Map(), C = this._inverseAttributes.indexOf(a);
         R.set(C, A), i.set(p, R);
         for (const T of A) {
           const F = i.get(T) ?? /* @__PURE__ */ new Map(), f = this._inverseAttributes.indexOf(r), m = F.get(f) ?? [];
@@ -8483,48 +8481,48 @@ class Yn {
         e.add(i.get(c));
       const o = s.GetLineIDsWithType(0, U.IFCRELAGGREGATES), n = o.size();
       for (let c = 0; c < n; c++) {
-        const E = o.get(c), d = s.GetLine(0, E);
+        const h = o.get(c), d = s.GetLine(0, h);
         if (!d || !d.RelatingObject || !d.RelatedObjects)
           continue;
-        const h = d.RelatingObject.value, u = d.RelatedObjects;
+        const E = d.RelatingObject.value, u = d.RelatedObjects;
         for (const p of u) {
           const A = p.value;
-          e.has(A) && (this.itemsByFloor[A] = h);
+          e.has(A) && (this.itemsByFloor[A] = E);
         }
       }
       const r = {}, a = t.size();
       for (let c = 0; c < a; c++) {
-        const E = t.get(c), d = s.GetLine(0, E);
+        const h = t.get(c), d = s.GetLine(0, h);
         if (!d || !d.RelatingStructure || !d.RelatedElements)
           continue;
-        const h = d.RelatingStructure.value, u = d.RelatedElements;
-        if (e.has(h))
+        const E = d.RelatingStructure.value, u = d.RelatedElements;
+        if (e.has(E))
           for (const p of u) {
-            r[h] || (r[h] = []);
+            r[E] || (r[E] = []);
             const A = p.value;
-            r[h].push(A);
+            r[E].push(A);
           }
         else
           for (const p of u) {
             const A = p.value;
-            this.itemsByFloor[A] = h;
+            this.itemsByFloor[A] = E;
           }
       }
       for (const c in r) {
-        const E = this.itemsByFloor[c];
-        if (E !== void 0) {
+        const h = this.itemsByFloor[c];
+        if (h !== void 0) {
           const d = r[c];
-          for (const h of d)
-            this.itemsByFloor[h] = E;
+          for (const E of d)
+            this.itemsByFloor[E] = h;
         }
       }
       for (let c = 0; c < n; c++) {
-        const E = o.get(c), d = s.GetLine(0, E);
+        const h = o.get(c), d = s.GetLine(0, h);
         if (!d || !d.RelatingObject || !d.RelatedObjects)
           continue;
-        const h = d.RelatingObject.value, u = d.RelatedObjects;
+        const E = d.RelatingObject.value, u = d.RelatedObjects;
         for (const p of u) {
-          const A = p.value, R = this.itemsByFloor[h];
+          const A = p.value, R = this.itemsByFloor[E];
           R !== void 0 && (this.itemsByFloor[A] = R);
         }
       }
@@ -8594,22 +8592,22 @@ class Vn {
     for (const o of s) {
       const n = {};
       if (o.data)
-        for (const h of o.data) {
-          const [u, p] = h.split(": "), A = parseFloat(p);
+        for (const E of o.data) {
+          const [u, p] = E.split(": "), A = parseFloat(p);
           n[u] = A || p;
         }
       const { points: r } = o, a = new Float32Array(r.length * 3);
-      for (let h = 0; h < r.length; h++) {
-        const { x: u, y: p, z: A } = r[h];
-        a[h * 3] = u, a[h * 3 + 1] = p, a[h * 3 + 2] = A || 0;
+      for (let E = 0; E < r.length; E++) {
+        const { x: u, y: p, z: A } = r[E];
+        a[E * 3] = u, a[E * 3 + 1] = p, a[E * 3 + 2] = A || 0;
       }
-      const c = new g.BufferAttribute(a, 3), E = new g.EdgesGeometry();
-      E.setAttribute("position", c);
+      const c = new g.BufferAttribute(a, 3), h = new g.EdgesGeometry();
+      h.setAttribute("position", c);
       const d = new Vt.CurveMesh(
         i,
         n,
         t,
-        E,
+        h,
         this.defLineMat
       );
       e.push(d.curve), i++;
@@ -8618,19 +8616,38 @@ class Vn {
   }
 }
 class Gn {
-  get(s, t) {
-    let e = "";
-    const i = s.GetHeaderLine(0, t) || "";
-    if (!i)
-      return e;
-    for (const o of i.arguments)
-      if (o != null)
-        if (Array.isArray(o))
-          for (const n of o)
-            e += `${n.value}|`;
-        else
-          e += `${o.value}|`;
-    return e;
+  getNameInfo(s) {
+    var d;
+    const t = {}, { arguments: e } = s.GetHeaderLine(0, U.FILE_NAME) || {};
+    if (!e)
+      return t;
+    const [
+      i,
+      o,
+      n,
+      r,
+      a,
+      c,
+      h
+    ] = e;
+    if (i != null && i.value && (t.name = i.value), o != null && o.value && (t.creationDate = new Date(o.value)), n) {
+      t.author = {};
+      const [E, u] = n;
+      E != null && E.value && (t.author.name = E.value), u != null && u.value && (t.author.email = u.value);
+    }
+    return (d = r[0]) != null && d.value && (t.organization = r[0].value), a != null && a.value && (t.preprocessorVersion = a == null ? void 0 : a.value), c != null && c.value && (t.originatingSystem = c == null ? void 0 : c.value), h != null && h.value && (t.authorization = h == null ? void 0 : h.value), t;
+  }
+  getDescriptionInfo(s) {
+    var n;
+    const t = {}, { arguments: e } = s.GetHeaderLine(0, U.FILE_DESCRIPTION) || {};
+    if (!e)
+      return t;
+    const [i, o] = e;
+    if ((n = i[0]) != null && n.value) {
+      const r = i[0].value.match(/\[([^\]]+)\]/);
+      r[1] && (t.viewDefinition = r[1]);
+    }
+    return o != null && o.value && (t.implementationLevel = o.value), t;
   }
 }
 const Ge = class Ge extends J {
@@ -8678,43 +8695,45 @@ const Ge = class Ge extends J {
   }
   async getAllGeometries() {
     this._spatialTree.setUp(this.webIfc);
-    const t = this.webIfc.GetIfcEntityList(0), e = new Vt.FragmentsGroup(), { FILE_NAME: i, FILE_DESCRIPTION: o } = U;
+    const t = this.webIfc.GetIfcEntityList(0), e = new Vt.FragmentsGroup();
     e.ifcMetadata = {
-      name: this._metaData.get(this.webIfc, i),
-      description: this._metaData.get(this.webIfc, o),
+      name: "",
+      description: "",
+      ...this._metaData.getNameInfo(this.webIfc),
+      ...this._metaData.getDescriptionInfo(this.webIfc),
       schema: this.webIfc.GetModelSchema(0) || "IFC2X3",
       maxExpressID: this.webIfc.GetMaxExpressID(0)
     };
-    const n = [];
-    for (const a of t) {
-      if (!this.webIfc.IsIfcElement(a) && a !== U.IFCSPACE || this.settings.excludedCategories.has(a))
+    const i = [];
+    for (const n of t) {
+      if (!this.webIfc.IsIfcElement(n) && n !== U.IFCSPACE || this.settings.excludedCategories.has(n))
         continue;
-      const c = this.webIfc.GetLineIDsWithType(0, a), E = c.size();
-      for (let d = 0; d < E; d++) {
-        const h = c.get(d);
-        n.push(h);
-        const u = this._spatialTree.itemsByFloor[h] || 0;
-        e.data.set(h, [[], [u, a]]);
+      const r = this.webIfc.GetLineIDsWithType(0, n), a = r.size();
+      for (let c = 0; c < a; c++) {
+        const h = r.get(c);
+        i.push(h);
+        const d = this._spatialTree.itemsByFloor[h] || 0;
+        e.data.set(h, [[], [d, n]]);
       }
     }
-    this._spatialTree.cleanUp(), this.webIfc.StreamMeshes(0, n, (a) => {
-      this.getMesh(a, e);
+    this._spatialTree.cleanUp(), this.webIfc.StreamMeshes(0, i, (n) => {
+      this.getMesh(n, e);
     });
-    for (const a of this._visitedFragments) {
-      const { index: c, fragment: E } = a[1];
-      e.keyFragments.set(c, E.id);
+    for (const n of this._visitedFragments) {
+      const { index: r, fragment: a } = n[1];
+      e.keyFragments.set(r, a.id);
     }
-    for (const a of e.items) {
-      const c = this._fragmentInstances.get(a.id);
-      if (!c)
+    for (const n of e.items) {
+      const r = this._fragmentInstances.get(n.id);
+      if (!r)
         throw new Error("Fragment not found!");
-      const E = [];
-      for (const [d, h] of c)
-        E.push(h);
-      a.add(E);
+      const a = [];
+      for (const [c, h] of r)
+        a.push(h);
+      n.add(a);
     }
-    const r = this.webIfc.GetCoordinationMatrix(0);
-    return e.coordinationMatrix.fromArray(r), e.civilData = this._civil.read(this.webIfc), e;
+    const o = this.webIfc.GetCoordinationMatrix(0);
+    return e.coordinationMatrix.fromArray(o), e.civilData = this._civil.read(this.webIfc), e;
   }
   cleanUp() {
     this.webIfc = null, this.webIfc = new U.IfcAPI(), this._visitedFragments.clear(), this._fragmentInstances.clear();
@@ -8722,14 +8741,14 @@ const Ge = class Ge extends J {
   getMesh(t, e) {
     const i = t.geometries.size(), o = t.expressID;
     for (let n = 0; n < i; n++) {
-      const r = t.geometries.get(n), { x: a, y: c, z: E, w: d } = r.color, h = d !== 1, { geometryExpressID: u } = r, p = `${u}-${h}`;
+      const r = t.geometries.get(n), { x: a, y: c, z: h, w: d } = r.color, E = d !== 1, { geometryExpressID: u } = r, p = `${u}-${E}`;
       if (!this._visitedFragments.has(p)) {
-        const m = this.getGeometry(this.webIfc, u), O = h ? this._materialT : this._material, S = new Vt.Fragment(m, O, 1);
+        const m = this.getGeometry(this.webIfc, u), O = E ? this._materialT : this._material, S = new Vt.Fragment(m, O, 1);
         e.add(S.mesh), e.items.push(S);
         const _ = this._visitedFragments.size;
         this._visitedFragments.set(p, { index: _, fragment: S });
       }
-      const A = new g.Color().setRGB(a, c, E, "srgb"), R = new g.Matrix4();
+      const A = new g.Color().setRGB(a, c, h, "srgb"), R = new g.Matrix4();
       R.fromArray(r.flatTransformation);
       const C = this._visitedFragments.get(p);
       if (C === void 0)
@@ -8760,10 +8779,10 @@ const Ge = class Ge extends J {
       i.GetVertexData(),
       i.GetVertexDataSize()
     ), r = new Float32Array(n.length / 2), a = new Float32Array(n.length / 2);
-    for (let h = 0; h < n.length; h += 6)
-      r[h / 2] = n[h], r[h / 2 + 1] = n[h + 1], r[h / 2 + 2] = n[h + 2], a[h / 2] = n[h + 3], a[h / 2 + 1] = n[h + 4], a[h / 2 + 2] = n[h + 5];
-    const c = new g.BufferGeometry(), E = new g.BufferAttribute(r, 3), d = new g.BufferAttribute(a, 3);
-    return c.setAttribute("position", E), c.setAttribute("normal", d), c.setIndex(Array.from(o)), i.delete(), c;
+    for (let E = 0; E < n.length; E += 6)
+      r[E / 2] = n[E], r[E / 2 + 1] = n[E + 1], r[E / 2 + 2] = n[E + 2], a[E / 2] = n[E + 3], a[E / 2 + 1] = n[E + 4], a[E / 2 + 2] = n[E + 5];
+    const c = new g.BufferGeometry(), h = new g.BufferAttribute(r, 3), d = new g.BufferAttribute(a, 3);
+    return c.setAttribute("position", h), c.setAttribute("normal", d), c.setIndex(Array.from(o)), i.delete(), c;
   }
   async autoSetWasm() {
     const t = await fetch(
@@ -8846,23 +8865,23 @@ const Bt = class Bt extends J {
     }
   }
   async newPset(t, e, i) {
-    const o = Bt.getIFCSchema(t), { ownerHistoryHandle: n } = await this.getOwnerHistory(t), r = this.newGUID(t), a = new U[o].IfcLabel(e), c = i ? new U[o].IfcText(i) : null, E = new U[o].IfcPropertySet(
+    const o = Bt.getIFCSchema(t), { ownerHistoryHandle: n } = await this.getOwnerHistory(t), r = this.newGUID(t), a = new U[o].IfcLabel(e), c = i ? new U[o].IfcText(i) : null, h = new U[o].IfcPropertySet(
       r,
       n,
       a,
       c,
       []
     );
-    E.expressID = this.increaseMaxID(t);
-    const d = this.newGUID(t), h = new U[o].IfcRelDefinesByProperties(
+    h.expressID = this.increaseMaxID(t);
+    const d = this.newGUID(t), E = new U[o].IfcRelDefinesByProperties(
       d,
       n,
       null,
       null,
       [],
-      new U.Handle(E.expressID)
+      new U.Handle(h.expressID)
     );
-    return h.expressID = this.increaseMaxID(t), await this.setData(t, E, h), { pset: E, rel: h };
+    return E.expressID = this.increaseMaxID(t), await this.setData(t, h, E), { pset: h, rel: E };
   }
   async removePset(t, ...e) {
     for (const i of e) {
@@ -8931,10 +8950,10 @@ const Bt = class Bt extends J {
   async saveToIfc(t, e) {
     const i = this.components.get(Ri), o = i.webIfc, n = await i.readIfcFile(e), r = this.changeMap[t.uuid] ?? [];
     for (const c of r) {
-      const E = await t.getProperties(c);
-      if (E)
+      const h = await t.getProperties(c);
+      if (h)
         try {
-          o.WriteLine(n, E);
+          o.WriteLine(n, h);
         } catch {
         }
       else
@@ -8967,8 +8986,8 @@ const Bt = class Bt extends J {
       get() {
         return this._value;
       },
-      async set(E) {
-        this._value = E, c.trigger(E);
+      async set(h) {
+        this._value = h, c.trigger(h);
       }
     }), n[i].value = a, this.attributeListeners[t.uuid][e] || (this.attributeListeners[t.uuid][e] = {}), this.attributeListeners[t.uuid][e][i] = c, c;
   }
@@ -8992,8 +9011,8 @@ const Ls = class Ls extends J {
         else
           for (const a of r) {
             const c = n[a];
-            for (const E of i)
-              delete c[E];
+            for (const h of i)
+              delete c[h];
             Object.values(c).length === 0 && delete n[a];
           }
       }
@@ -9028,13 +9047,13 @@ const Ls = class Ls extends J {
         continue;
       }
       for (const c of a) {
-        const E = this.list[r][c];
-        if (E)
-          for (const d in E) {
+        const h = this.list[r][c];
+        if (h)
+          for (const d in h) {
             o[d] || (o[d] = /* @__PURE__ */ new Map());
-            for (const h of E[d]) {
-              const u = o[d].get(h);
-              u === void 0 ? o[d].set(h, 1) : o[d].set(h, u + 1);
+            for (const E of h[d]) {
+              const u = o[d].get(E);
+              u === void 0 ? o[d].set(E, 1) : o[d].set(E, u + 1);
             }
           }
       }
@@ -9042,10 +9061,10 @@ const Ls = class Ls extends J {
     const n = {};
     for (const r in o) {
       const a = o[r];
-      for (const [c, E] of a) {
-        if (E === void 0)
+      for (const [c, h] of a) {
+        if (h === void 0)
           throw new Error("Malformed fragments map!");
-        E === i && (n[r] || (n[r] = /* @__PURE__ */ new Set()), n[r].add(c));
+        h === i && (n[r] || (n[r] = /* @__PURE__ */ new Set()), n[r].add(c));
       }
     }
     return n;
@@ -9058,8 +9077,8 @@ const Ls = class Ls extends J {
     for (const [n, r] of e.data) {
       const a = r[0];
       for (const c of a) {
-        const E = e.keyFragments.get(c);
-        E && (o[E] || (o[E] = /* @__PURE__ */ new Set()), o[E].add(n));
+        const h = e.keyFragments.get(c);
+        h && (o[h] || (o[h] = /* @__PURE__ */ new Set()), o[h].add(n));
       }
     }
   }
@@ -9074,9 +9093,9 @@ const Ls = class Ls extends J {
       const a = String((o = r.PredefinedType) == null ? void 0 : o.value).toUpperCase();
       e[a] || (e[a] = {});
       const c = e[a];
-      for (const [E, d] of t.data) {
-        const h = d[0];
-        for (const u of h) {
+      for (const [h, d] of t.data) {
+        const E = d[0];
+        for (const u of E) {
           const p = t.keyFragments.get(u);
           if (!p)
             throw new Error("Fragment ID not found!");
@@ -9127,17 +9146,17 @@ const Ls = class Ls extends J {
       ), c = await t.getProperties(r);
       if (!(a && c))
         continue;
-      const E = (n = c.Name) == null ? void 0 : n.value;
+      const h = (n = c.Name) == null ? void 0 : n.value;
       for (const d of a) {
-        this.saveItem(t, o, E, d);
-        const h = e.getEntityRelations(
+        this.saveItem(t, o, h, d);
+        const E = e.getEntityRelations(
           t,
           Number(d),
           "IsDecomposedBy"
         );
-        if (h)
-          for (const u of h)
-            this.saveItem(t, o, E, u);
+        if (E)
+          for (const u of E)
+            this.saveItem(t, o, h, u);
       }
     }
   }
@@ -9198,12 +9217,12 @@ const ys = class ys extends J {
     const r = e.list[this.groupName], a = new g.Matrix4();
     for (const c in r) {
       a.elements[13] = n * o * this.height;
-      for (const E in r[c]) {
-        const d = i.list.get(E), h = c + E, u = this.list.has(h);
+      for (const h in r[c]) {
+        const d = i.list.get(h), E = c + h, u = this.list.has(E);
         if (!d || t && u || !t && !u)
           continue;
-        t ? this.list.add(h) : this.list.delete(h);
-        const p = r[c][E];
+        t ? this.list.add(E) : this.list.delete(E);
+        const p = r[c][h];
         d.applyTransform(p, a);
       }
       n++;
@@ -9304,47 +9323,47 @@ class $r extends J {
       U.IFCBUILDINGSTOREY,
       U.IFCSPACE
     ]);
-    for (const E of n)
-      e.add(E);
+    for (const h of n)
+      e.add(h);
     let r = 0.01, a = 0;
-    for (const E of e) {
-      if (a++, Li.has(E))
+    for (const h of e) {
+      if (a++, Li.has(h))
         continue;
-      const d = n.has(E), h = this.webIfc.GetLineIDsWithType(0, E), u = h.size();
+      const d = n.has(h), E = this.webIfc.GetLineIDsWithType(0, h), u = E.size();
       let p = 0;
       for (let R = 0; R < u - t; R += t) {
         const C = {};
         for (let T = 0; T < t; T++) {
           p++;
-          const F = h.get(R + T);
+          const F = E.get(R + T);
           try {
             const f = this.webIfc.GetLine(0, F, d);
-            i.includes(E) && this.getIndices(f, F, o), C[f.expressID] = f;
+            i.includes(h) && this.getIndices(f, F, o), C[f.expressID] = f;
           } catch {
             console.log(`Could not get property: ${F}`);
           }
         }
-        await this.onPropertiesStreamed.trigger({ type: E, data: C });
+        await this.onPropertiesStreamed.trigger({ type: h, data: C });
       }
       if (p !== u) {
         const R = {};
         for (let C = p; C < u; C++) {
-          const T = h.get(C);
+          const T = E.get(C);
           try {
             const F = this.webIfc.GetLine(0, T, d);
-            i.includes(E) && this.getIndices(F, T, o), R[F.expressID] = F;
+            i.includes(h) && this.getIndices(F, T, o), R[F.expressID] = F;
           } catch {
             console.log(`Could not get property: ${T}`);
           }
         }
-        await this.onPropertiesStreamed.trigger({ type: E, data: R });
+        await this.onPropertiesStreamed.trigger({ type: h, data: R });
       }
       const A = a / e.size;
       A > r && (r += 0.01, r = Math.max(r, A), await this.onProgress.trigger(Math.round(r * 100) / 100));
     }
     const c = [];
-    for (const [E, d] of o)
-      c.push([E, ...d]);
+    for (const [h, d] of o)
+      c.push([h, ...d]);
     await this.onIndicesStreamed.trigger(c);
   }
   getIndices(t, e, i) {
@@ -9419,49 +9438,50 @@ const Ms = class Ms extends J {
   async streamAllGeometries() {
     const { minGeometrySize: t, minAssetsSize: e } = this.settings;
     this._spatialTree.setUp(this.webIfc);
-    const i = this.webIfc.GetIfcEntityList(0), o = [[]], n = new Vt.FragmentsGroup(), { FILE_NAME: r, FILE_DESCRIPTION: a } = U;
+    const i = this.webIfc.GetIfcEntityList(0), o = [[]], n = new Vt.FragmentsGroup();
     n.ifcMetadata = {
-      name: this._metaData.get(this.webIfc, r),
-      description: this._metaData.get(this.webIfc, a),
+      name: "",
+      description: "",
+      ...this._metaData.getNameInfo(this.webIfc),
+      ...this._metaData.getDescriptionInfo(this.webIfc),
       schema: this.webIfc.GetModelSchema(0) || "IFC2X3",
       maxExpressID: this.webIfc.GetMaxExpressID(0)
     };
-    let c = 0, E = 0;
-    for (const T of i) {
-      if (!this.webIfc.IsIfcElement(T) && T !== U.IFCSPACE || this.settings.excludedCategories.has(T))
+    let r = 0, a = 0;
+    for (const R of i) {
+      if (!this.webIfc.IsIfcElement(R) && R !== U.IFCSPACE || this.settings.excludedCategories.has(R))
         continue;
-      const F = this.webIfc.GetLineIDsWithType(0, T), f = F.size();
-      console.log(f);
-      for (let m = 0; m < f; m++) {
-        c > t && (c = 0, E++, o.push([]));
-        const O = F.get(m);
-        o[E].push(O);
-        const S = this._spatialTree.itemsByFloor[O] || 0;
-        n.data.set(O, [[], [S, T]]), c++;
+      const C = this.webIfc.GetLineIDsWithType(0, R), T = C.size();
+      for (let F = 0; F < T; F++) {
+        r > t && (r = 0, a++, o.push([]));
+        const f = C.get(F);
+        o[a].push(f);
+        const m = this._spatialTree.itemsByFloor[f] || 0;
+        n.data.set(f, [[], [m, R]]), r++;
       }
     }
     this._spatialTree.cleanUp();
-    let d = 0.01, h = 0;
-    for (const T of o) {
-      h++, this.webIfc.StreamMeshes(0, T, (f) => {
-        this.getMesh(this.webIfc, f, n);
+    let c = 0.01, h = 0;
+    for (const R of o) {
+      h++, this.webIfc.StreamMeshes(0, R, (T) => {
+        this.getMesh(this.webIfc, T, n);
       }), this._geometryCount > t && await this.streamGeometries(), this._assets.length > e && await this.streamAssets();
-      const F = h / o.length;
-      F > d && (d += 0.01, d = Math.max(d, F), this.onProgress.trigger(Math.round(d * 100) / 100));
+      const C = h / o.length;
+      C > c && (c += 0.01, c = Math.max(c, C), this.onProgress.trigger(Math.round(c * 100) / 100));
     }
     this._geometryCount && await this.streamGeometries(), this._assets.length && await this.streamAssets();
-    const { opaque: u, transparent: p } = n.geometryIDs;
-    for (const [T, { index: F, uuid: f }] of this._visitedGeometries)
-      n.keyFragments.set(F, f), (T > 1 ? u : p).set(T, F);
-    const A = n.data.keys();
-    for (const T of A) {
-      const [F] = n.data.get(T);
-      F.length || n.data.delete(T);
-    }
-    const R = this.webIfc.GetCoordinationMatrix(0);
-    n.coordinationMatrix.fromArray(R), n.civilData = this._civil.read(this.webIfc);
-    const C = this._groupSerializer.export(n);
-    this.onIfcLoaded.trigger(C), n.dispose(!0);
+    const { opaque: d, transparent: E } = n.geometryIDs;
+    for (const [R, { index: C, uuid: T }] of this._visitedGeometries)
+      n.keyFragments.set(C, T), (R > 1 ? d : E).set(R, C);
+    const u = n.data.keys();
+    for (const R of u) {
+      const [C] = n.data.get(R);
+      C.length || n.data.delete(R);
+    }
+    const p = this.webIfc.GetCoordinationMatrix(0);
+    n.coordinationMatrix.fromArray(p), n.civilData = this._civil.read(this.webIfc);
+    const A = this._groupSerializer.export(n);
+    this.onIfcLoaded.trigger(A), n.dispose(!0);
   }
   cleanUp() {
     this.webIfc = null, this.webIfc = new U.IfcAPI(), this._visitedGeometries.clear(), this._geometries.clear(), this._assets = [], this._meshesWithHoles.clear();
@@ -9469,13 +9489,13 @@ const Ms = class Ms extends J {
   getMesh(t, e, i) {
     const o = e.geometries.size(), n = e.expressID, r = { id: n, geometries: [] };
     for (let a = 0; a < o; a++) {
-      const c = e.geometries.get(a), E = c.geometryExpressID, d = c.color.w === 1 ? 1 : -1, h = E * d;
-      if (!this._visitedGeometries.has(h)) {
-        this._visitedGeometries.has(E) || this.getGeometry(t, E);
+      const c = e.geometries.get(a), h = c.geometryExpressID, d = c.color.w === 1 ? 1 : -1, E = h * d;
+      if (!this._visitedGeometries.has(E)) {
+        this._visitedGeometries.has(h) || this.getGeometry(t, h);
         const m = this._visitedGeometries.size, O = g.MathUtils.generateUUID();
-        this._visitedGeometries.set(h, { uuid: O, index: m });
+        this._visitedGeometries.set(E, { uuid: O, index: m });
       }
-      const u = this._visitedGeometries.get(h);
+      const u = this._visitedGeometries.get(E);
       if (u === void 0)
         throw new Error("Error getting geometry data for streaming!");
       const p = i.data.get(n);
@@ -9483,7 +9503,7 @@ const Ms = class Ms extends J {
         throw new Error("Data not found!");
       p[0].push(u.index);
       const { x: A, y: R, z: C, w: T } = c.color, F = [A, R, C, T], f = c.flatTransformation;
-      r.geometries.push({ color: F, geometryID: E, transformation: f });
+      r.geometries.push({ color: F, geometryID: h, transformation: f });
     }
     this._assets.push(r);
   }
@@ -9497,12 +9517,12 @@ const Ms = class Ms extends J {
     ), r = new Float32Array(n.length / 2), a = new Float32Array(n.length / 2);
     for (let u = 0; u < n.length; u += 6)
       r[u / 2] = n[u], r[u / 2 + 1] = n[u + 1], r[u / 2 + 2] = n[u + 2], a[u / 2] = n[u + 3], a[u / 2 + 1] = n[u + 4], a[u / 2 + 2] = n[u + 5];
-    const c = mr(r), E = new Float32Array(c.transformation.elements), d = [c.center.x, c.center.y, c.center.z];
-    let h = !1;
+    const c = mr(r), h = new Float32Array(c.transformation.elements), d = [c.center.x, c.center.y, c.center.z];
+    let E = !1;
     for (let u = 0; u < r.length - 2; u += 3) {
       const p = r[u], A = r[u + 1], R = r[u + 2], C = a[u], T = a[u + 1], F = a[u + 2];
       if (Rr(d, [p, A, R], [C, T, F])) {
-        h = !0;
+        E = !0;
         break;
       }
     }
@@ -9510,8 +9530,8 @@ const Ms = class Ms extends J {
       position: r,
       normal: a,
       index: o,
-      boundingBox: E,
-      hasHoles: h
+      boundingBox: h,
+      hasHoles: E
     }), i.delete(), this._geometryCount++;
   }
   async streamAssets() {
@@ -9571,15 +9591,15 @@ class Kr extends J {
     for (const c of e) {
       if (n++, Li.has(c))
         continue;
-      const E = i.has(c), d = this.webIfc.GetLineIDsWithType(0, c), h = d.size();
+      const h = i.has(c), d = this.webIfc.GetLineIDsWithType(0, c), E = d.size();
       let u = 0;
-      for (let A = 0; A < h - t; A += t) {
+      for (let A = 0; A < E - t; A += t) {
         const R = {};
         for (let C = 0; C < t; C++) {
           u++;
           const T = d.get(A + C);
           try {
-            const F = this.webIfc.GetLine(0, T, E);
+            const F = this.webIfc.GetLine(0, T, h);
             R[F.expressID] = F;
           } catch {
             console.log(`Could not get property: ${T}`);
@@ -9587,12 +9607,12 @@ class Kr extends J {
         }
         await this.onPropertiesStreamed.trigger({ type: c, data: R });
       }
-      if (u !== h) {
+      if (u !== E) {
         const A = {};
-        for (let R = u; R < h; R++) {
+        for (let R = u; R < E; R++) {
           const C = d.get(R);
           try {
-            const T = this.webIfc.GetLine(0, C, E);
+            const T = this.webIfc.GetLine(0, C, h);
             A[T.expressID] = T;
           } catch {
             console.log(`Could not get property: ${C}`);
@@ -9625,60 +9645,60 @@ const Ds = class Ds extends J {
       i,
       t
     ), a = [];
-    for (let h = 0; h < n.length / 3; h++) {
-      const { plane: u, edges: p } = this.getFaceData(h, i, t);
+    for (let E = 0; E < n.length / 3; E++) {
+      const { plane: u, edges: p } = this.getFaceData(E, i, t);
       if (u.equals(r)) {
-        a.push({ index: h, edges: p });
+        a.push({ index: E, edges: p });
         for (const { id: A, points: R, distance: C } of p)
           o.set(A, { points: R, distance: C });
       }
     }
     let c = 0;
-    const E = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map();
-    for (const { index: h, edges: u } of a) {
+    const h = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map();
+    for (const { index: E, edges: u } of a) {
       const p = /* @__PURE__ */ new Map();
       for (const { id: m } of u)
-        if (E.has(m)) {
-          const O = E.get(m);
+        if (h.has(m)) {
+          const O = h.get(m);
           p.set(m, O);
         }
       const A = u.map((m) => m.id);
       if (!p.size) {
         const m = c++;
         for (const { id: O } of u)
-          E.set(O, m);
+          h.set(O, m);
         d.set(m, {
           edges: new Set(A),
-          indices: /* @__PURE__ */ new Set([h])
+          indices: /* @__PURE__ */ new Set([E])
         });
         continue;
       }
       let R = null;
       const C = /* @__PURE__ */ new Set(), T = new Set(A);
       for (const [m, O] of p) {
-        R === null ? R = O : O !== R && C.add(O), E.delete(m);
+        R === null ? R = O : O !== R && C.add(O), h.delete(m);
         const { edges: S } = d.get(O);
         S.delete(m), T.delete(m);
       }
       if (R === null)
         throw new Error("Error computing face!");
       const F = d.get(R), { indices: f } = F;
-      f.add(h);
+      f.add(E);
       for (const m of T) {
-        E.set(m, R);
+        h.set(m, R);
         const { edges: O } = F;
         O.add(m);
       }
       for (const m of C) {
         const O = d.get(m), { edges: S, indices: _ } = O, N = d.get(R), { edges: L, indices: M } = N;
         for (const y of S)
-          L.add(y), E.set(y, R);
+          L.add(y), h.set(y, R);
         for (const y of _)
           M.add(y);
         d.delete(m);
       }
     }
-    for (const [h, { indices: u, edges: p }] of d)
+    for (const [E, { indices: u, edges: p }] of d)
       if (u.has(e)) {
         const A = [];
         for (const R of p) {
@@ -9696,21 +9716,21 @@ const Ds = class Ds extends J {
   getFaceData(t, e, i) {
     const o = this.getVerticesAndNormal(i, t, e), { p1: n, p2: r, p3: a, faceNormal: c } = o;
     this.round(n), this.round(r), this.round(a), this.round(c);
-    const E = [
+    const h = [
       { id: `${n.x}|${n.y}|${n.z}`, value: n },
       { id: `${r.x}|${r.y}|${r.z}`, value: r },
       { id: `${a.x}|${a.y}|${a.z}`, value: a }
     ];
-    E.sort((F, f) => F.id < f.id ? -1 : F.id > f.id ? 1 : 0);
+    h.sort((F, f) => F.id < f.id ? -1 : F.id > f.id ? 1 : 0);
     const [
-      { id: d, value: h },
+      { id: d, value: E },
       { id: u, value: p },
       { id: A, value: R }
-    ] = E, C = [
+    ] = h, C = [
       {
         id: `${d}|${u}`,
-        distance: h.distanceTo(p),
-        points: [h, p]
+        distance: E.distanceTo(p),
+        points: [E, p]
       },
       {
         id: `${u}|${A}`,
@@ -9719,8 +9739,8 @@ const Ds = class Ds extends J {
       },
       {
         id: `${d}|${A}`,
-        distance: h.distanceTo(R),
-        points: [h, R]
+        distance: E.distanceTo(R),
+        points: [E, R]
       }
     ], T = new g.Plane();
     return T.setFromNormalAndCoplanarPoint(c, n), T.constant = Math.round(T.constant * 10) / 10, { plane: T, edges: C };
@@ -9728,14 +9748,14 @@ const Ds = class Ds extends J {
   getVerticesAndNormal(t, e, i) {
     if (!t.geometry.index)
       throw new Error("Geometry must be indexed!");
-    const o = t.geometry.index.array, n = t.geometry.attributes.position.array, r = t.geometry.attributes.normal.array, a = o[e * 3] * 3, c = o[e * 3 + 1] * 3, E = o[e * 3 + 2] * 3, d = new g.Vector3(n[a], n[a + 1], n[a + 2]), h = new g.Vector3(n[c], n[c + 1], n[c + 2]), u = new g.Vector3(n[E], n[E + 1], n[E + 2]), p = new g.Vector3(r[a], r[a + 1], r[a + 2]), A = new g.Vector3(r[c], r[c + 1], r[c + 2]), R = new g.Vector3(r[E], r[E + 1], r[E + 2]), C = (p.x + A.x + R.x) / 3, T = (p.y + A.y + R.y) / 3, F = (p.z + A.z + R.z) / 3, f = new g.Vector3(C, T, F);
+    const o = t.geometry.index.array, n = t.geometry.attributes.position.array, r = t.geometry.attributes.normal.array, a = o[e * 3] * 3, c = o[e * 3 + 1] * 3, h = o[e * 3 + 2] * 3, d = new g.Vector3(n[a], n[a + 1], n[a + 2]), E = new g.Vector3(n[c], n[c + 1], n[c + 2]), u = new g.Vector3(n[h], n[h + 1], n[h + 2]), p = new g.Vector3(r[a], r[a + 1], r[a + 2]), A = new g.Vector3(r[c], r[c + 1], r[c + 2]), R = new g.Vector3(r[h], r[h + 1], r[h + 2]), C = (p.x + A.x + R.x) / 3, T = (p.y + A.y + R.y) / 3, F = (p.z + A.z + R.z) / 3, f = new g.Vector3(C, T, F);
     if (i !== void 0 && t instanceof g.InstancedMesh) {
       const m = new g.Matrix4();
       t.getMatrixAt(i, m);
       const O = new g.Matrix4();
-      O.extractRotation(m), f.applyMatrix4(O), d.applyMatrix4(m), h.applyMatrix4(m), u.applyMatrix4(m);
+      O.extractRotation(m), f.applyMatrix4(O), d.applyMatrix4(m), E.applyMatrix4(m), u.applyMatrix4(m);
     }
-    return { p1: d, p2: h, p3: u, faceNormal: f };
+    return { p1: d, p2: E, p3: u, faceNormal: f };
   }
   round(t) {
     t.x = Math.trunc(t.x * 1e3) / 1e3, t.y = Math.trunc(t.y * 1e3) / 1e3, t.z = Math.trunc(t.z * 1e3) / 1e3;