@thatopen/components 2.1.14 → 2.1.15

package/dist/index.mjs

@@ -5,7 +5,7 @@ import * as O from "three";
 import { BufferAttribute as Pn, Vector3 as M, Vector2 as fe, Plane as Fi, Line3 as Lt, Triangle as ue, Sphere as Zn, Matrix4 as yt, Box3 as gt, BackSide as Qn, DoubleSide as Ln, FrontSide as wi, Mesh as v, Ray as jn, Raycaster as qn, Quaternion as Pt, Object3D as ri, Euler as Kn, MeshBasicMaterial as yn, LineBasicMaterial as $n, CylinderGeometry as ct, BoxGeometry as rt, BufferGeometry as Di, Float32BufferAttribute as Ui, OctahedronGeometry as Ze, Line as Dt, SphereGeometry as Jn, TorusGeometry as Re, PlaneGeometry as to } from "three";
 import * as Vt from "@thatopen/fragments";
 import { Serializer as eo } from "@thatopen/fragments";
-import * as x from "web-ifc";
+import * as U from "web-ifc";
 const Mn = 0, so = 1, io = 2, xi = 2, Ys = 1.25, bi = 1, Cs = 6 * 4 + 4 + 4, Us = 65535, no = Math.pow(2, -24), Vs = Symbol("SKIP_GENERATION");
 function oo(l) {
   return l.index ? l.index.count : l.attributes.position.count;
@@ -99,7 +99,7 @@ function Gs(l, s, t, e, i = null) {
     g < o && (o = g), S > a && (a = S), C && p < d && (d = p), C && p > f && (f = p);
     const _ = l[A + 2], N = l[A + 3], L = _ - N, D = _ + N;
     L < n && (n = L), D > c && (c = D), C && _ < E && (E = _), C && _ > T && (T = _);
-    const y = l[A + 4], U = l[A + 5], b = y - U, B = y + U;
+    const y = l[A + 4], x = l[A + 5], b = y - x, B = y + x;
     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] = h, C && (i[0] = d, i[1] = E, i[2] = u, i[3] = f, i[4] = T, i[5] = R);
@@ -319,9 +319,9 @@ function mo(l, s) {
       A(m + g), p.offset = m, p.count = g;
     else {
       p.splitAxis = N.axis;
-      const D = new qe(), y = m, U = L - m;
-      p.left = D, D.boundingData = new Float32Array(6), Gs(f, y, U, D.boundingData, u), F(D, y, U, u, _ + 1);
-      const b = new qe(), B = L, H = g - U;
+      const D = new qe(), y = m, x = L - m;
+      p.left = D, D.boundingData = new Float32Array(6), Gs(f, y, x, D.boundingData, u), F(D, y, x, u, _ + 1);
+      const b = new qe(), B = L, H = g - x;
       p.right = b, b.boundingData = new Float32Array(6), Gs(f, B, H, b.boundingData, u), F(b, B, H, u, _ + 1);
     }
     return p;
@@ -553,8 +553,8 @@ Ft.prototype.intersectsTriangle = function() {
       if (g !== 2)
         return !1;
       if (d.delta(r), E.delta(a), r.dot(a) < 0) {
-        let U = E.start;
-        E.start = E.end, E.end = U;
+        let x = E.start;
+        E.start = E.end, E.end = x;
       }
       const S = d.start.dot(r), _ = d.end.dot(r), N = E.start.dot(r), L = E.end.dot(r), D = _ < N, y = S < L;
       return S !== L && N !== _ && D === 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);
@@ -697,7 +697,7 @@ at.prototype.distanceToBox = function() {
         for (let A = 0; A <= 1; A++) {
           const F = (R + 1) % 3, p = (R + 2) % 3, m = C << F | A << p, g = 1 << R | C << F | A << p, S = u[m], _ = u[g];
           s[T].set(S, _);
-          const L = l[R], D = l[F], y = l[p], U = t[T], b = U.start, B = U.end;
+          const L = l[R], D = l[F], y = l[p], x = t[T], b = x.start, B = x.end;
           b[L] = d[L], b[D] = C ? d[D] : E[D], b[y] = A ? d[y] : E[D], B[L] = E[L], B[D] = C ? d[D] : E[D], B[y] = A ? d[y] : E[D], T++;
         }
     for (let R = 0; R <= 1; R++)
@@ -787,17 +787,17 @@ function ai(l, s, t, e, i = null, o = 0, n = 0) {
     return K(l, r, Yt), e(E, u, !1, n, o + l, Yt);
   } else {
     let L = function(y) {
-      const { uint16Array: U, uint32Array: b } = Z;
+      const { uint16Array: x, uint32Array: b } = Z;
       let B = y * 2;
-      for (; !Et(B, U); )
+      for (; !Et(B, x); )
         y = pt(y), B = y * 2;
       return dt(y, b);
     }, D = function(y) {
-      const { uint16Array: U, uint32Array: b } = Z;
+      const { uint16Array: x, uint32Array: b } = Z;
       let B = y * 2;
-      for (; !Et(B, U); )
+      for (; !Et(B, x); )
         y = Ct(y, b), B = y * 2;
-      return dt(y, b) + ft(B, U);
+      return dt(y, b) + ft(B, x);
     };
     const E = pt(l), u = Ct(l, c);
     let f = E, T = u, R, C, A, F;
@@ -936,8 +936,8 @@ function Do(l, s = null) {
       let F = 1 / 0, p = 1 / 0, m = 1 / 0, g = -1 / 0, S = -1 / 0, _ = -1 / 0;
       for (let N = 3 * C, L = 3 * (C + A); N < L; N++) {
         let D = e[N];
-        const y = i.getX(D), U = i.getY(D), b = i.getZ(D);
-        y < F && (F = y), y > g && (g = y), U < p && (p = U), U > S && (S = U), b < m && (m = b), b > _ && (_ = b);
+        const y = i.getX(D), x = i.getY(D), b = i.getZ(D);
+        y < F && (F = y), y > g && (g = y), x < p && (p = x), x > S && (S = x), b < m && (m = b), b > _ && (_ = b);
       }
       return a[E + 0] !== F || a[E + 1] !== p || a[E + 2] !== m || a[E + 3] !== g || a[E + 4] !== S || a[E + 5] !== _ ? (a[E + 0] = F, a[E + 1] = p, a[E + 2] = m, a[E + 3] = g, a[E + 4] = S, a[E + 5] = _, !0) : !1;
     } else {
@@ -951,9 +951,9 @@ function Do(l, s = null) {
       N && (D = d(A, u, m));
       const y = L || D;
       if (y)
-        for (let U = 0; U < 3; U++) {
-          const b = C + U, B = A + U, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
-          a[E + U] = H < st ? H : st, a[E + U + 3] = q > Q ? q : Q;
+        for (let x = 0; x < 3; x++) {
+          const b = C + x, B = A + x, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
+          a[E + x] = H < st ? H : st, a[E + x + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -1085,7 +1085,7 @@ function ko(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
             intersectsRange: (_, N) => {
               for (let L = _, D = _ + N; L < D; L++) {
                 tt(u, 3 * L, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-                for (let y = m, U = m + g; y < U; y++) {
+                for (let y = m, x = m + g; y < x; y++) {
                   tt(E, 3 * y, c, a), E.needsUpdate = !0;
                   const b = E.distanceToTriangle(u, f, R);
                   if (b < A && (T.copy(f), C && C.copy(R), A = b, F = y, p = L), b < o)
@@ -1125,9 +1125,9 @@ function Xo(l, s = null) {
       for (let N = C, L = C + A; N < L; N++) {
         const D = 3 * l.resolveTriangleIndex(N);
         for (let y = 0; y < 3; y++) {
-          let U = D + y;
-          U = e ? e[U] : U;
-          const b = i.getX(U), B = i.getY(U), H = i.getZ(U);
+          let x = D + y;
+          x = e ? e[x] : x;
+          const b = i.getX(x), B = i.getY(x), H = i.getZ(x);
           b < F && (F = b), b > g && (g = b), B < p && (p = B), B > S && (S = B), H < m && (m = H), H > _ && (_ = H);
         }
       }
@@ -1143,9 +1143,9 @@ function Xo(l, s = null) {
       N && (D = d(A, u, m));
       const y = L || D;
       if (y)
-        for (let U = 0; U < 3; U++) {
-          const b = C + U, B = A + U, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
-          a[E + U] = H < st ? H : st, a[E + U + 3] = q > Q ? q : Q;
+        for (let x = 0; x < 3; x++) {
+          const b = C + x, B = A + x, H = a[b], q = a[b + 3], st = a[B], Q = a[B + 3];
+          a[E + x] = H < st ? H : st, a[E + x + 3] = q > Q ? q : Q;
         }
       return y;
     }
@@ -1251,11 +1251,11 @@ function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
               for (let L = _, D = _ + N; L < D; L++) {
                 const y = S.resolveTriangleIndex(L);
                 tt(u, 3 * y, d, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-                for (let U = m, b = m + g; U < b; U++) {
-                  const B = l.resolveTriangleIndex(U);
+                for (let x = m, b = m + g; x < b; x++) {
+                  const B = l.resolveTriangleIndex(x);
                   tt(E, 3 * B, c, a), E.needsUpdate = !0;
                   const H = E.distanceToTriangle(u, f, R);
-                  if (H < A && (T.copy(f), C && C.copy(R), A = H, F = U, p = L), H < o)
+                  if (H < A && (T.copy(f), C && C.copy(R), A = H, F = x, p = L), H < o)
                     return !0;
                 }
               }
@@ -1268,8 +1268,8 @@ function er(l, s, t, e = {}, i = {}, o = 0, n = 1 / 0) {
             for (let L = m, D = m + g; L < D; L++) {
               const y = l.resolveTriangleIndex(L);
               tt(E, 3 * y, c, a), E.needsUpdate = !0;
-              const U = E.distanceToTriangle(u, f, R);
-              if (U < A && (T.copy(f), C && C.copy(R), A = U, F = L, p = _), U < o)
+              const x = E.distanceToTriangle(u, f, R);
+              if (x < A && (T.copy(f), C && C.copy(R), A = x, F = L, p = _), x < o)
                 return !0;
             }
           }
@@ -1416,12 +1416,12 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, h = !1) {
       else {
         const y = vt.getPrimitive();
         y.copy(Xs).applyMatrix4(t);
-        const U = pt(l), b = Ct(l, f);
-        K(U, u, ae), K(b, u, ce);
+        const x = pt(l), b = Ct(l, f);
+        K(x, u, ae), K(b, u, ce);
         const B = y.intersectsBox(ae), H = y.intersectsBox(ce);
         S = B && Tt(
           _,
-          U,
+          x,
           e,
           t,
           i,
@@ -1463,12 +1463,12 @@ function Tt(l, s, t, e, i, o = 0, n = 0, r = 0, a = 0, c = null, h = !1) {
       else {
         const y = vt.getPrimitive();
         y.copy(Zs).applyMatrix4(t);
-        const U = pt(l), b = Ct(l, f);
-        K(U, u, ae), K(b, u, ce);
+        const x = pt(l), b = Ct(l, f);
+        K(x, u, ae), K(b, u, ce);
         const B = y.intersectsBox(ae), H = y.intersectsBox(ce);
         S = B && Tt(
           N,
-          U,
+          x,
           e,
           t,
           i,
@@ -2453,14 +2453,14 @@ function mr(l) {
   g.elements[0] = R, g.elements[1] = C, g.elements[2] = A, g.elements[3] = C, g.elements[4] = F, g.elements[5] = p, g.elements[6] = A, g.elements[7] = p, g.elements[8] = m, Tr(g, e);
   const S = e.unitary, _ = new O.Vector3(), N = new O.Vector3(), L = new O.Vector3();
   S.extractBasis(_, N, L);
-  let D = -1 / 0, y = -1 / 0, U = -1 / 0, b = 1 / 0, B = 1 / 0, H = 1 / 0;
+  let D = -1 / 0, y = -1 / 0, x = -1 / 0, b = 1 / 0, B = 1 / 0, H = 1 / 0;
   for (let it = 0, Xt = s.length; it < Xt; it++) {
     const J = s[it];
-    D = Math.max(_.dot(J), D), y = Math.max(N.dot(J), y), U = Math.max(L.dot(J), U), b = Math.min(_.dot(J), b), B = Math.min(N.dot(J), B), H = Math.min(L.dot(J), H);
+    D = Math.max(_.dot(J), D), y = Math.max(N.dot(J), y), x = Math.max(L.dot(J), x), b = Math.min(_.dot(J), b), B = Math.min(N.dot(J), B), H = Math.min(L.dot(J), H);
   }
-  _.multiplyScalar(0.5 * (b + D)), N.multiplyScalar(0.5 * (B + y)), L.multiplyScalar(0.5 * (H + U));
+  _.multiplyScalar(0.5 * (b + D)), N.multiplyScalar(0.5 * (B + y)), L.multiplyScalar(0.5 * (H + x));
   const q = new O.Vector3(), st = new O.Vector3(), Q = new O.Matrix3();
-  q.add(_).add(N).add(L), st.x = D - b, st.y = y - B, st.z = U - H, st.multiplyScalar(0.5), Q.copy(S);
+  q.add(_).add(N).add(L), st.x = D - b, st.y = y - B, st.z = x - H, st.multiplyScalar(0.5), Q.copy(S);
   const { x: Ht, y: Wt, z: kt } = st, ke = new O.Matrix4();
   ke.makeScale(Ht * 2, Wt * 2, kt * 2);
   const Te = new O.Matrix4();
@@ -3015,7 +3015,7 @@ const Fs = class Fs {
 /**
  * The version of the @thatopen/components library.
  */
-I(Fs, "release", "2.1.14");
+I(Fs, "release", "2.1.15");
 let pi = Fs;
 class Ar {
   constructor(s) {
@@ -3497,8 +3497,8 @@ function rn(l, s, t, e, i = 1 / 0, o, n) {
   h = l.x - u, d = l.y - f, E = l.z - T;
   const g = (t.x + r * u) * o, S = (t.y + r * f) * o, _ = (t.z + r * T) * o;
   t.x = (t.x - r * g) * c, t.y = (t.y - r * S) * c, t.z = (t.z - r * _) * c, n.x = h + (u + g) * c, n.y = d + (f + S) * c, n.z = E + (T + _) * c;
-  const N = R - l.x, L = C - l.y, D = A - l.z, y = n.x - R, U = n.y - C, b = n.z - A;
-  return N * y + L * U + D * b > 0 && (n.x = R, n.y = C, n.z = A, t.x = (n.x - R) / o, t.y = (n.y - C) / o, t.z = (n.z - A) / o), n;
+  const N = R - l.x, L = C - l.y, D = A - l.z, y = n.x - R, x = n.y - C, b = n.z - A;
+  return N * y + L * x + D * b > 0 && (n.x = R, n.y = C, n.z = A, t.x = (n.x - R) / o, t.y = (n.y - C) / o, t.z = (n.z - A) / o), n;
 }
 function $s(l, s) {
   s.set(0, 0), l.forEach((t) => {
@@ -3858,8 +3858,8 @@ class ot extends Or {
       if ((this._state & P.TOUCH_DOLLY) === P.TOUCH_DOLLY || (this._state & P.TOUCH_ZOOM) === P.TOUCH_ZOOM || (this._state & P.TOUCH_DOLLY_TRUCK) === P.TOUCH_DOLLY_TRUCK || (this._state & P.TOUCH_ZOOM_TRUCK) === P.TOUCH_ZOOM_TRUCK || (this._state & P.TOUCH_DOLLY_OFFSET) === P.TOUCH_DOLLY_OFFSET || (this._state & P.TOUCH_ZOOM_OFFSET) === P.TOUCH_ZOOM_OFFSET || (this._state & P.TOUCH_DOLLY_ROTATE) === P.TOUCH_DOLLY_ROTATE || (this._state & P.TOUCH_ZOOM_ROTATE) === P.TOUCH_ZOOM_ROTATE) {
         const _ = lt.x - this._activePointers[1].clientX, N = lt.y - this._activePointers[1].clientY, L = Math.sqrt(_ * _ + N * N), D = o.y - L;
         o.set(0, L);
-        const y = this.dollyToCursor ? (i.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, U = this.dollyToCursor ? (i.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
-        (this._state & P.TOUCH_DOLLY) === P.TOUCH_DOLLY || (this._state & P.TOUCH_DOLLY_ROTATE) === P.TOUCH_DOLLY_ROTATE || (this._state & P.TOUCH_DOLLY_TRUCK) === P.TOUCH_DOLLY_TRUCK || (this._state & P.TOUCH_DOLLY_OFFSET) === P.TOUCH_DOLLY_OFFSET ? (this._dollyInternal(D * Es, y, U), this._isUserControllingDolly = !0) : (this._zoomInternal(D * Es, y, U), this._isUserControllingZoom = !0);
+        const y = this.dollyToCursor ? (i.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, x = this.dollyToCursor ? (i.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
+        (this._state & P.TOUCH_DOLLY) === P.TOUCH_DOLLY || (this._state & P.TOUCH_DOLLY_ROTATE) === P.TOUCH_DOLLY_ROTATE || (this._state & P.TOUCH_DOLLY_TRUCK) === P.TOUCH_DOLLY_TRUCK || (this._state & P.TOUCH_DOLLY_OFFSET) === P.TOUCH_DOLLY_OFFSET ? (this._dollyInternal(D * Es, y, x), this._isUserControllingDolly = !0) : (this._zoomInternal(D * Es, y, x), this._isUserControllingZoom = !0);
       }
       ((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(g, 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(g, S, !0), this._isUserControllingOffset = !0), this.dispatchEvent({ type: "control" });
     }, C = () => {
@@ -5582,7 +5582,7 @@ class xr extends ri {
       XYZ: [
         [new v(new rt(0.2, 0.2, 0.2), e), [0, 0, 0]]
       ]
-    }, U = {
+    }, x = {
       X: [
         [new Dt(C, i.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
       ],
@@ -5604,7 +5604,7 @@ class xr extends ri {
         }
       return H;
     }
-    this.gizmo = {}, this.picker = {}, this.helper = {}, this.add(this.gizmo.translate = b(m)), this.add(this.gizmo.rotate = b(_)), this.add(this.gizmo.scale = b(D)), this.add(this.picker.translate = b(g)), this.add(this.picker.rotate = b(L)), this.add(this.picker.scale = b(y)), this.add(this.helper.translate = b(S)), this.add(this.helper.rotate = b(N)), this.add(this.helper.scale = b(U)), this.picker.translate.visible = !1, this.picker.rotate.visible = !1, this.picker.scale.visible = !1;
+    this.gizmo = {}, this.picker = {}, this.helper = {}, this.add(this.gizmo.translate = b(m)), this.add(this.gizmo.rotate = b(_)), this.add(this.gizmo.scale = b(D)), this.add(this.picker.translate = b(g)), this.add(this.picker.rotate = b(L)), this.add(this.picker.scale = b(y)), this.add(this.helper.translate = b(S)), this.add(this.helper.rotate = b(N)), this.add(this.helper.scale = b(x)), this.picker.translate.visible = !1, this.picker.rotate.visible = !1, this.picker.scale.visible = !1;
   }
   // updateMatrixWorld will update transformations and appearance of individual handles
   updateMatrixWorld(s) {
@@ -6915,60 +6915,74 @@ class aa extends We {
 }
 const Zr = /* @__PURE__ */ new Map([
   [
-    x.IFCRELAGGREGATES,
+    U.IFCRELAGGREGATES,
     {
       forRelating: "IsDecomposedBy",
       forRelated: "Decomposes"
     }
   ],
   [
-    x.IFCRELASSOCIATESMATERIAL,
+    U.IFCRELASSOCIATESMATERIAL,
     {
       forRelating: "AssociatedTo",
       forRelated: "HasAssociations"
     }
   ],
   [
-    x.IFCRELASSOCIATESCLASSIFICATION,
+    U.IFCRELASSOCIATESCLASSIFICATION,
     {
       forRelating: "ClassificationForObjects",
       forRelated: "HasAssociations"
     }
   ],
   [
-    x.IFCRELASSIGNSTOGROUP,
+    U.IFCRELASSIGNSTOGROUP,
     {
       forRelating: "IsGroupedBy",
       forRelated: "HasAssignments"
     }
   ],
   [
-    x.IFCRELDEFINESBYPROPERTIES,
+    U.IFCRELDEFINESBYPROPERTIES,
     {
       forRelated: "IsDefinedBy",
       forRelating: "DefinesOcurrence"
     }
   ],
   [
-    x.IFCRELDEFINESBYTYPE,
+    U.IFCRELDEFINESBYTYPE,
     {
       forRelated: "IsTypedBy",
       forRelating: "Types"
     }
   ],
   [
-    x.IFCRELDEFINESBYTEMPLATE,
+    U.IFCRELDEFINESBYTEMPLATE,
     {
       forRelated: "IsDefinedBy",
       forRelating: "Defines"
     }
   ],
   [
-    x.IFCRELCONTAINEDINSPATIALSTRUCTURE,
+    U.IFCRELCONTAINEDINSPATIALSTRUCTURE,
     {
       forRelated: "ContainedInStructure",
       forRelating: "ContainsElements"
     }
+  ],
+  [
+    U.IFCRELFLOWCONTROLELEMENTS,
+    {
+      forRelated: "AssignedToFlowElement",
+      forRelating: "HasControlElements"
+    }
+  ],
+  [
+    U.IFCRELCONNECTSELEMENTS,
+    {
+      forRelated: "ConnectedFrom",
+      forRelating: "ConnectedTo"
+    }
   ]
 ]), Ve = class Ve extends et {
   constructor(t) {
@@ -7010,17 +7024,21 @@ const Zr = /* @__PURE__ */ new Map([
       "Types",
       "Defines",
       "ContainedInStructure",
-      "ContainsElements"
+      "ContainsElements",
+      "HasControlElements",
+      "AssignedToFlowElement",
+      "ConnectedTo",
+      "ConnectedFrom"
     ]);
     I(this, "_ifcRels", [
-      x.IFCRELAGGREGATES,
-      x.IFCRELASSOCIATESMATERIAL,
-      x.IFCRELASSOCIATESCLASSIFICATION,
-      x.IFCRELASSIGNSTOGROUP,
-      x.IFCRELDEFINESBYPROPERTIES,
-      x.IFCRELDEFINESBYTYPE,
-      x.IFCRELDEFINESBYTEMPLATE,
-      x.IFCRELCONTAINEDINSPATIALSTRUCTURE
+      U.IFCRELAGGREGATES,
+      U.IFCRELASSOCIATESMATERIAL,
+      U.IFCRELASSOCIATESCLASSIFICATION,
+      U.IFCRELASSIGNSTOGROUP,
+      U.IFCRELDEFINESBYPROPERTIES,
+      U.IFCRELDEFINESBYTYPE,
+      U.IFCRELDEFINESBYTEMPLATE,
+      U.IFCRELCONTAINEDINSPATIALSTRUCTURE
     ]);
     I(this, "onFragmentsDisposed", (t) => {
       delete this.relationMaps[t.groupID];
@@ -7893,11 +7911,11 @@ const vn = /* @__PURE__ */ new Set([
    */
   async export(t, e, i = !1, o = !0) {
     const n = {}, r = new Set(t.GetIfcEntityList(e)), a = /* @__PURE__ */ new Set([
-      x.IFCPROJECT,
-      x.IFCSITE,
-      x.IFCBUILDING,
-      x.IFCBUILDINGSTOREY,
-      x.IFCSPACE
+      U.IFCPROJECT,
+      U.IFCSITE,
+      U.IFCBUILDING,
+      U.IFCBUILDINGSTOREY,
+      U.IFCSPACE
     ]);
     for (const c of a)
       r.add(c);
@@ -9214,7 +9232,7 @@ const Bn = {
 class Kt {
   static async getUnits(s) {
     var n, r, a;
-    const { IFCUNITASSIGNMENT: t } = x, e = await s.getAllPropertiesOfType(t);
+    const { IFCUNITASSIGNMENT: t } = U, e = await s.getAllPropertiesOfType(t);
     if (!e)
       return 1;
     const i = Object.keys(e), o = e[parseInt(i[0], 10)];
@@ -9265,19 +9283,19 @@ class Kt {
   static async getQsetQuantities(s, t, e) {
     const o = e ?? (() => {
     }), n = await s.getProperties(t);
-    return !n || n.type !== x.IFCELEMENTQUANTITY ? null : (n.Quantities ?? [{}]).map((c) => (c.value && o(c.value), c.value)).filter((c) => c !== null);
+    return !n || n.type !== U.IFCELEMENTQUANTITY ? null : (n.Quantities ?? [{}]).map((c) => (c.value && o(c.value), c.value)).filter((c) => c !== null);
   }
   static async getPsetProps(s, t, e) {
     const o = e ?? (() => {
     }), n = await s.getProperties(t);
-    return !n || n.type !== x.IFCPROPERTYSET ? null : (n.HasProperties ?? [{}]).map((c) => (c.value && o(c.value), c.value)).filter((c) => c !== null);
+    return !n || n.type !== U.IFCPROPERTYSET ? null : (n.HasProperties ?? [{}]).map((c) => (c.value && o(c.value), c.value)).filter((c) => c !== null);
   }
   static async getPsetRel(s, t) {
     var r;
     if (!await s.getProperties(t))
       return null;
     const i = await s.getAllPropertiesOfType(
-      x.IFCRELDEFINESBYPROPERTIES
+      U.IFCRELDEFINESBYPROPERTIES
     );
     if (!i)
       return null;
@@ -9368,7 +9386,7 @@ class jr {
     try {
       const e = s.GetLineIDsWithType(
         0,
-        x.IFCUNITASSIGNMENT
+        U.IFCUNITASSIGNMENT
       ).get(0), i = s.GetLine(0, e);
       for (const o of i.Units) {
         if (!o || o.value === null || o.value === void 0)
@@ -9415,11 +9433,11 @@ class Yn {
     try {
       const t = s.GetLineIDsWithType(
         0,
-        x.IFCRELCONTAINEDINSPATIALSTRUCTURE
-      ), e = /* @__PURE__ */ new Set(), i = s.GetLineIDsWithType(0, x.IFCSPACE);
+        U.IFCRELCONTAINEDINSPATIALSTRUCTURE
+      ), e = /* @__PURE__ */ new Set(), i = s.GetLineIDsWithType(0, U.IFCSPACE);
       for (let c = 0; c < i.size(); c++)
         e.add(i.get(c));
-      const o = s.GetLineIDsWithType(0, x.IFCRELAGGREGATES), n = o.size();
+      const o = s.GetLineIDsWithType(0, U.IFCRELAGGREGATES), n = o.size();
       for (let c = 0; c < n; c++) {
         const h = o.get(c), d = s.GetLine(0, h);
         if (!d || !d.RelatingObject || !d.RelatedObjects)
@@ -9482,14 +9500,14 @@ class Li {
      * Generate the geometry for categories that are not included by default,
      * like IFCSPACE.
      */
-    I(this, "optionalCategories", [x.IFCSPACE]);
+    I(this, "optionalCategories", [U.IFCSPACE]);
     /** Whether to use the coordination data coming from the IFC files. */
     I(this, "coordinate", !0);
     /** Path of the WASM for [web-ifc](https://github.com/ThatOpen/engine_web-ifc). */
     I(this, "wasm", {
       path: "",
       absolute: !1,
-      logLevel: x.LogLevel.LOG_LEVEL_OFF
+      logLevel: U.LogLevel.LOG_LEVEL_OFF
     });
     /** List of categories that won't be converted to fragments. */
     I(this, "excludedCategories", /* @__PURE__ */ new Set());
@@ -9572,7 +9590,7 @@ class Vn {
 class Gn {
   getNameInfo(s) {
     var d;
-    const t = {}, { arguments: e } = s.GetHeaderLine(0, x.FILE_NAME) || {};
+    const t = {}, { arguments: e } = s.GetHeaderLine(0, U.FILE_NAME) || {};
     if (!e)
       return t;
     const [
@@ -9593,7 +9611,7 @@ class Gn {
   }
   getDescriptionInfo(s) {
     var n;
-    const t = {}, { arguments: e } = s.GetHeaderLine(0, x.FILE_DESCRIPTION) || {};
+    const t = {}, { arguments: e } = s.GetHeaderLine(0, U.FILE_DESCRIPTION) || {};
     if (!e)
       return t;
     const [i, o] = e;
@@ -9607,15 +9625,15 @@ class Gn {
 class zn {
   static get(s, t) {
     const e = [
-      x.IFCPROJECT,
-      x.IFCSITE,
-      x.IFCBUILDING,
-      x.IFCBUILDINGSTOREY,
-      x.IFCSPACE,
-      x.IFCROAD,
-      x.IFCFACILITY,
-      x.IFCFACILITYPART,
-      x.IFCBRIDGE
+      U.IFCPROJECT,
+      U.IFCSITE,
+      U.IFCBUILDING,
+      U.IFCBUILDINGSTOREY,
+      U.IFCSPACE,
+      U.IFCROAD,
+      U.IFCFACILITY,
+      U.IFCFACILITYPART,
+      U.IFCBRIDGE
     ], i = s.data;
     for (const o of e) {
       const n = t.GetLineIDsWithType(0, o), r = n.size();
@@ -9647,7 +9665,7 @@ const Ge = class Ge extends et {
     /**
      * The instance of the Web-IFC library used for handling IFC data.
      */
-    I(this, "webIfc", new x.IfcAPI());
+    I(this, "webIfc", new U.IfcAPI());
     /** {@link Component.enabled} */
     I(this, "enabled", !0);
     I(this, "_material", new O.MeshLambertMaterial());
@@ -9660,7 +9678,7 @@ const Ge = class Ge extends et {
       transparent: !0,
       opacity: 0.5
     }));
-    this.components.add(Ge.uuid, this), this.settings.excludedCategories.add(x.IFCOPENINGELEMENT);
+    this.components.add(Ge.uuid, this), this.settings.excludedCategories.add(U.IFCOPENINGELEMENT);
   }
   /** {@link Disposable.dispose} */
   dispose() {
@@ -9755,7 +9773,7 @@ const Ge = class Ge extends et {
    * ```
    */
   cleanUp() {
-    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new x.IfcAPI(), this._visitedFragments.clear(), this._fragmentInstances.clear();
+    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new U.IfcAPI(), this._visitedFragments.clear(), this._fragmentInstances.clear();
   }
   async getAllGeometries() {
     this._spatialTree.setUp(this.webIfc);
@@ -9770,7 +9788,7 @@ const Ge = class Ge extends et {
     };
     const i = [];
     for (const n of t) {
-      if (!this.webIfc.IsIfcElement(n) && n !== x.IFCSPACE || this.settings.excludedCategories.has(n))
+      if (!this.webIfc.IsIfcElement(n) && n !== U.IFCSPACE || this.settings.excludedCategories.has(n))
         continue;
       const r = this.webIfc.GetLineIDsWithType(0, n), a = r.size();
       for (let c = 0; c < a; c++) {
@@ -9972,7 +9990,7 @@ const Bt = class Bt extends et {
    * @throws Will throw an error if no OwnerHistory is found in the model.
    */
   async newPset(t, e, i) {
-    const o = Bt.getIFCSchema(t), { ownerHistoryHandle: n } = await this.getOwnerHistory(t), r = this.newGUID(t), a = new x[o].IfcLabel(e), c = i ? new x[o].IfcText(i) : null, h = new x[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,
@@ -9980,13 +9998,13 @@ const Bt = class Bt extends et {
       []
     );
     h.expressID = this.increaseMaxID(t);
-    const d = this.newGUID(t), E = new x[o].IfcRelDefinesByProperties(
+    const d = this.newGUID(t), E = new U[o].IfcRelDefinesByProperties(
       d,
       n,
       null,
       null,
       [],
-      new x.Handle(h.expressID)
+      new U.Handle(h.expressID)
     );
     return E.expressID = this.increaseMaxID(t), await this.setData(t, h, E), { pset: h, rel: E };
   }
@@ -10005,7 +10023,7 @@ const Bt = class Bt extends et {
   async removePset(t, ...e) {
     for (const i of e) {
       const o = await t.getProperties(i);
-      if ((o == null ? void 0 : o.type) !== x.IFCPROPERTYSET)
+      if ((o == null ? void 0 : o.type) !== U.IFCPROPERTYSET)
         continue;
       const n = await Kt.getPsetRel(t, i);
       if (n && (await t.setProperties(n, null), this.registerChange(t, n)), o) {
@@ -10077,7 +10095,7 @@ const Bt = class Bt extends et {
    */
   async removePsetProp(t, e, i) {
     const o = await t.getProperties(e), n = await t.getProperties(i);
-    !o || !n || o.type === x.IFCPROPERTYSET && n && (o.HasProperties = o.HasProperties.filter((r) => r.value !== i), await t.setProperties(i, null), this.registerChange(t, e, i));
+    !o || !n || o.type === U.IFCPROPERTYSET && n && (o.HasProperties = o.HasProperties.filter((r) => r.value !== i), await t.setProperties(i, null), this.registerChange(t, e, i));
   }
   async addElementToPset(t, e, ...i) {
     const o = await Kt.getPsetRel(t, e);
@@ -10087,7 +10105,7 @@ const Bt = class Bt extends et {
     if (!n)
       return;
     for (const a of i) {
-      const c = new x.Handle(a);
+      const c = new U.Handle(a);
       n.RelatedObjects.push(c), this.onElementToPset.trigger({
         model: t,
         psetID: e,
@@ -10118,7 +10136,7 @@ const Bt = class Bt extends et {
       for (const n of i) {
         if (o.HasProperties.includes(n))
           continue;
-        const r = new x.Handle(n);
+        const r = new U.Handle(n);
         o.HasProperties.push(r), this.onPropToPset.trigger({ model: t, psetID: e, propID: n });
       }
       this.registerChange(t, e);
@@ -10197,15 +10215,15 @@ const Bt = class Bt extends et {
   }
   newGUID(t) {
     const e = Bt.getIFCSchema(t);
-    return new x[e].IfcGloballyUniqueId(ze.create());
+    return new U[e].IfcGloballyUniqueId(ze.create());
   }
   async getOwnerHistory(t) {
     const e = await t.getAllPropertiesOfType(
-      x.IFCOWNERHISTORY
+      U.IFCOWNERHISTORY
     );
     if (!e)
       throw new Error("No OwnerHistory was found.");
-    const i = Object.keys(e).map((r) => parseInt(r, 10)), o = e[i[0]], n = new x.Handle(o.expressID);
+    const i = Object.keys(e).map((r) => parseInt(r, 10)), o = e[i[0]], n = new U.Handle(o.expressID);
     return { ownerHistory: o, ownerHistoryHandle: n };
   }
   registerChange(t, ...e) {
@@ -10214,7 +10232,7 @@ const Bt = class Bt extends et {
       this.changeMap[t.uuid].add(i), this.onDataChanged.trigger({ model: t, expressID: i });
   }
   async newSingleProperty(t, e, i, o) {
-    const n = Bt.getIFCSchema(t), r = new x[n].IfcIdentifier(i), a = new x[n][e](o), c = new x[n].IfcPropertySingleValue(
+    const n = Bt.getIFCSchema(t), r = new U[n].IfcIdentifier(i), a = new U[n][e](o), c = new U[n].IfcPropertySingleValue(
       r,
       null,
       a,
@@ -10761,7 +10779,7 @@ const ws = class ws extends et {
     /**
      * The WebIFC API instance used for IFC file processing.
      */
-    I(this, "webIfc", new x.IfcAPI());
+    I(this, "webIfc", new U.IfcAPI());
     I(this, "_spatialTree", new Yn());
     I(this, "_metaData", new Gn());
     I(this, "_visitedGeometries", /* @__PURE__ */ new Map());
@@ -10772,7 +10790,7 @@ const ws = class ws extends et {
     I(this, "_groupSerializer", new Vt.Serializer());
     I(this, "_assets", []);
     I(this, "_meshesWithHoles", /* @__PURE__ */ new Set());
-    this.components.add(ws.uuid, this), this.settings.excludedCategories.add(x.IFCOPENINGELEMENT);
+    this.components.add(ws.uuid, this), this.settings.excludedCategories.add(U.IFCOPENINGELEMENT);
   }
   /** {@link Disposable.dispose} */
   dispose() {
@@ -10833,7 +10851,7 @@ const ws = class ws extends et {
     };
     let r = 0, a = 0;
     for (const T of i) {
-      if (!this.webIfc.IsIfcElement(T) && T !== x.IFCSPACE || this.settings.excludedCategories.has(T))
+      if (!this.webIfc.IsIfcElement(T) && T !== U.IFCSPACE || this.settings.excludedCategories.has(T))
         continue;
       const R = this.webIfc.GetLineIDsWithType(0, T), C = R.size();
       for (let A = 0; A < C; A++) {
@@ -10869,7 +10887,7 @@ const ws = class ws extends et {
     this.onIfcLoaded.trigger(f), n.dispose(!0);
   }
   cleanUp() {
-    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new x.IfcAPI(), this._visitedGeometries.clear(), this._geometries.clear(), this._assets = [], this._meshesWithHoles.clear();
+    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new U.IfcAPI(), this._visitedGeometries.clear(), this._geometries.clear(), this._assets = [], this._meshesWithHoles.clear();
   }
   getMesh(t, e, i) {
     const o = e.geometries.size(), n = e.expressID, r = { id: n, geometries: [] };
@@ -10974,7 +10992,7 @@ class $r extends et {
     /**
      * An instance of the IfcAPI class from the Web-IFC library, which provides methods for reading and processing IFC data.
      */
-    I(this, "webIfc", new x.IfcAPI());
+    I(this, "webIfc", new U.IfcAPI());
   }
   /** {@link Disposable.dispose} */
   async dispose() {
@@ -11008,11 +11026,11 @@ class $r extends et {
   }
   async streamAllProperties() {
     const { propertiesSize: t } = this.settings, e = new Set(this.webIfc.GetIfcEntityList(0)), i = /* @__PURE__ */ new Set([
-      x.IFCPROJECT,
-      x.IFCSITE,
-      x.IFCBUILDING,
-      x.IFCBUILDINGSTOREY,
-      x.IFCSPACE
+      U.IFCPROJECT,
+      U.IFCSITE,
+      U.IFCBUILDING,
+      U.IFCBUILDINGSTOREY,
+      U.IFCSPACE
     ]);
     for (const c of i)
       e.add(c);
@@ -11056,7 +11074,7 @@ class $r extends et {
     await this.onIndicesStreamed.trigger(a);
   }
   cleanUp() {
-    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new x.IfcAPI();
+    this.webIfc.Dispose(), this.webIfc = null, this.webIfc = new U.IfcAPI();
   }
 }
 /**