@thatopen/components 2.1.0 → 2.1.2

package/dist/index.mjs

@@ -2731,6 +2731,10 @@ class ea extends et {
      * The event passes a THREE.Vector3 representing the position of the lost vertex.
      */
     I(this, "onVertexLost", new D());
+    /**
+     * An event that is triggered when the picker is enabled or disabled
+     */
+    I(this, "onEnabled", new D());
     /**
      * A reference to the Components instance associated with this VertexPicker.
      */
@@ -2758,7 +2762,7 @@ class ea extends et {
    * @param value - The new enabled state.
    */
   set enabled(t) {
-    this._enabled = t, t || (this._pickedPoint = null);
+    this._enabled = t, t || (this._pickedPoint = null), this.onEnabled.trigger(t);
   }
   /**
    * Gets the current enabled state of the VertexPicker.
@@ -2964,7 +2968,7 @@ const Fs = class Fs {
 /**
  * The version of the @thatopen/components library.
  */
-I(Fs, "release", "2.1.0");
+I(Fs, "release", "2.1.2");
 let pi = Fs;
 class Rr {
   constructor(s) {
@@ -7141,6 +7145,30 @@ const Xr = /* @__PURE__ */ new Map([
   dispose() {
     this.relationMaps = {}, this.components.get(ht).onFragmentsDisposed.remove(this.onFragmentsDisposed), this.onDisposed.trigger(Ye.uuid), this.onDisposed.reset();
   }
+  /**
+   * Gets the children of the given element recursively. E.g. in a model with project - site - building - storeys - rooms, passing a storey will include all its children and the children of the rooms contained in it.
+   *
+   * @param model The BIM model whose children to get.
+   * @param id The expressID of the item whose children to get.
+   * @param found An optional parameter that includes a set of expressIDs where the found element IDs will be added.
+   *
+   * @returns A `Set` with the expressIDs of the found items.
+   */
+  getElementsChildren(t, e, i = /* @__PURE__ */ new Set()) {
+    if (i.add(e), this.relationMaps[t.uuid] === void 0)
+      throw new Error(
+        "The provided model has no indices. You have to generate them first."
+      );
+    const n = this.getEntityRelations(t, e, "IsDecomposedBy");
+    if (n)
+      for (const a of n)
+        this.getElementsChildren(t, a, i);
+    const r = this.getEntityRelations(t, e, "ContainsElements");
+    if (r)
+      for (const a of r)
+        this.getElementsChildren(t, a, i);
+    return i;
+  }
 };
 /**
  * A unique identifier for the component.
@@ -10067,7 +10095,7 @@ const Ls = class Ls extends et {
           for (const a of r) {
             const c = n[a];
             for (const h of i)
-              delete c[h];
+              delete c.map[h];
             Object.values(c).length === 0 && delete n[a];
           }
       }
@@ -10089,7 +10117,7 @@ const Ls = class Ls extends et {
       const i = this.list[e];
       for (const o in i) {
         const n = i[o];
-        delete n[t];
+        delete n.map[t];
       }
     }
   }
@@ -10124,9 +10152,9 @@ const Ls = class Ls extends et {
       for (const c of a) {
         const h = this.list[r][c];
         if (h)
-          for (const d in h) {
+          for (const d in h.map) {
             o[d] || (o[d] = /* @__PURE__ */ new Map());
-            for (const E of h[d]) {
+            for (const E of h.map[d]) {
               const u = o[d].get(E);
               u === void 0 ? o[d].set(E, 1) : o[d].set(E, u + 1);
             }
@@ -10160,13 +10188,13 @@ const Ls = class Ls extends et {
   byModel(t, e) {
     this.list.models || (this.list.models = {});
     const i = this.list.models;
-    i[t] || (i[t] = {});
+    i[t] || (i[t] = { map: {}, id: null, name: t });
     const o = i[t];
     for (const [n, r] of e.data) {
       const a = r[0];
       for (const c of a) {
         const h = e.keyFragments.get(c);
-        h && (o[h] || (o[h] = /* @__PURE__ */ new Set()), o[h].add(n));
+        h && (o.map[h] || (o.map[h] = /* @__PURE__ */ new Set()), o.map[h].add(n));
       }
     }
   }
@@ -10192,7 +10220,11 @@ const Ls = class Ls extends et {
       if (!r)
         continue;
       const a = String((o = r.PredefinedType) == null ? void 0 : o.value).toUpperCase();
-      e[a] || (e[a] = {});
+      e[a] || (e[a] = {
+        map: {},
+        id: null,
+        name: a
+      });
       const c = e[a];
       for (const [h, d] of t.data) {
         const E = d[0];
@@ -10200,7 +10232,7 @@ const Ls = class Ls extends et {
           const f = t.keyFragments.get(u);
           if (!f)
             throw new Error("Fragment ID not found!");
-          c[f] || (c[f] = /* @__PURE__ */ new Set()), c[f].add(r.expressID);
+          c.map[f] || (c.map[f] = /* @__PURE__ */ new Set()), c.map[f].add(r.expressID);
         }
       }
     }
@@ -10263,6 +10295,7 @@ const Ls = class Ls extends et {
    * Classifies fragments based on their spatial structure in the IFC model.
    *
    * @param model - The FragmentsGroup containing the fragments to be classified.
+   * @param config - The configuration for the classifier. It includes "useProperties" (if false, the classification will use the expressIDs instead of the names)
    *
    * @remarks
    * This method iterates through the relations of the fragments in the provided group,
@@ -10272,49 +10305,55 @@ const Ls = class Ls extends et {
    *
    * @throws Will throw an error if the fragment ID is not found or if the model relations do not exist.
    */
-  async bySpatialStructure(t) {
-    var n, r;
-    const e = this.components.get(ke), i = e.relationMaps[t.uuid];
-    if (!i)
+  async bySpatialStructure(t, e = { useProperties: !0 }) {
+    var r, a;
+    const i = this.components.get(ke), o = i.relationMaps[t.uuid];
+    if (!o)
       throw new Error(
         `Classifier: model relations of ${t.name || t.uuid} have to exists to group by spatial structure.`
       );
-    const o = "spatialStructures";
-    for (const [a] of i) {
-      const c = e.getEntityRelations(
+    const n = "spatialStructures";
+    for (const [c] of o) {
+      const h = i.getEntityRelations(
         t,
-        a,
+        c,
         "Decomposes"
       );
-      if (c)
-        for (const u of c) {
-          const f = await t.getProperties(u);
-          if (!f)
-            continue;
-          const R = (n = f.Name) == null ? void 0 : n.value;
-          this.saveItem(t, o, R, a);
+      if (h)
+        for (const u of h) {
+          let f = u.toString();
+          if (e.useProperties) {
+            const R = await t.getProperties(u);
+            if (!R)
+              continue;
+            f = (r = R.Name) == null ? void 0 : r.value;
+          }
+          this.saveItem(t, n, f, c, u);
         }
-      const h = e.getEntityRelations(
+      const d = i.getEntityRelations(
         t,
-        a,
+        c,
         "ContainsElements"
       );
-      if (!h)
-        continue;
-      const d = await t.getProperties(a);
       if (!d)
         continue;
-      const E = (r = d.Name) == null ? void 0 : r.value;
-      for (const u of h) {
-        this.saveItem(t, o, E, u);
-        const f = e.getEntityRelations(
+      let E = c.toString();
+      if (e.useProperties) {
+        const u = await t.getProperties(c);
+        if (!u)
+          continue;
+        E = (a = u.Name) == null ? void 0 : a.value;
+      }
+      for (const u of d) {
+        this.saveItem(t, n, E, u, c);
+        const f = i.getEntityRelations(
           t,
           Number(u),
           "IsDecomposedBy"
         );
         if (f)
           for (const R of f)
-            this.saveItem(t, o, E, R);
+            this.saveItem(t, n, E, R, c);
       }
     }
   }
@@ -10362,15 +10401,15 @@ const Ls = class Ls extends et {
       o.resetColor(n);
     }
   }
-  saveItem(t, e, i, o) {
+  saveItem(t, e, i, o, n = null) {
     this.list[e] || (this.list[e] = {});
-    const n = t.data.get(o);
-    if (n)
-      for (const r of n[0]) {
-        const a = t.keyFragments.get(r);
-        if (a) {
-          const c = this.list[e];
-          c[i] || (c[i] = {}), c[i][a] || (c[i][a] = /* @__PURE__ */ new Set()), c[i][a].add(o);
+    const r = t.data.get(o);
+    if (r)
+      for (const a of r[0]) {
+        const c = t.keyFragments.get(a);
+        if (c) {
+          const h = this.list[e];
+          h[i] || (h[i] = { map: {}, id: n, name: i }), h[i].map[c] || (h[i].map[c] = /* @__PURE__ */ new Set()), h[i].map[c].add(o);
         }
       }
   }
@@ -10438,7 +10477,7 @@ const ys = class ys extends et {
         if (!d || t && u || !t && !u)
           continue;
         t ? this.list.add(E) : this.list.delete(E);
-        const f = r[c][h];
+        const f = r[c].map[h];
         d.applyTransform(f, a);
       }
       n++;