@woosh/meep-engine 2.109.24 → 2.109.26

package/src/core/collection/heap/{FastBinaryHeap.js → BinaryHeap.js}

@@ -1,10 +1,23 @@
 import { assert } from "../../assert.js";
 
 /**
- * Min-Heap implementation with a score function. The data structure is a binary heap where elements are removed in order defined by scoring function
+ * Min-Heap implementation with a score function.
+ * The data structure is a binary heap where elements are removed in order defined by scoring function
  * @template T
  */
 class BinaryHeap {
+    /**
+     * @private
+     * @type {T[]}
+     */
+    data = [];
+
+    /**
+     * @private
+     * @type {number}
+     */
+    length = 0;
+
     /**
      * @template T
      * @param {function(el:T):number} scoreFunction
@@ -18,17 +31,6 @@ class BinaryHeap {
          */
         this.scoreFunction = scoreFunction;
 
-        /**
-         *
-         * @type {T[]}
-         */
-        this.data = [];
-
-        /**
-         * @private
-         * @type {number}
-         */
-        this.length = 0;
     }
 
     /**
@@ -100,19 +102,19 @@ class BinaryHeap {
             if (right >= length) {
                 //right node doesn't exist
 
-
                 if (scoreLeft >= scoreMin) {
                     break;
                 } else {
                     minIndex = left;
                     dataMin = dataLeft;
                 }
+
             } else {
+
                 //both left and right nodes exist
                 const dataRight = data[right];
                 const scoreRight = this.scoreFunction(dataRight);
 
-                //
                 if (scoreLeft <= scoreRight) {
                     if (scoreLeft >= scoreMin) {
                         break;
@@ -128,6 +130,7 @@ class BinaryHeap {
                         dataMin = dataRight;
                     }
                 }
+
             }
 
             //swap positions
@@ -145,7 +148,6 @@ class BinaryHeap {
      */
     pop() {
 
-
         this.length--;
 
         const new_length = this.length;
@@ -154,19 +156,20 @@ class BinaryHeap {
 
         if (new_length === 0) {
 
+            // this was the last element in the heap
+
             return last;
 
-        } else {
+        }
 
-            const ret = this.data[0];
+        const ret = this.data[0];
 
-            this.data[0] = last;
+        this.data[0] = last;
 
-            this.bubbleDown(0);
+        this.bubbleDown(0);
 
-            return ret;
+        return ret;
 
-        }
     }
 
     /**
@@ -270,4 +273,11 @@ class BinaryHeap {
     }
 }
 
+/**
+ * Useful for type checks
+ * @readonly
+ * @type {boolean}
+ */
+BinaryHeap.prototype.isBinaryHeap = true;
+
 export default BinaryHeap;

package/src/core/collection/heap/BinaryHeap.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=BinaryHeap.spec.d.ts.map

package/src/core/collection/heap/BinaryHeap.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryHeap.spec.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/heap/BinaryHeap.spec.js"],"names":[],"mappings":""}

package/src/core/collection/heap/{FastBinaryHeap.spec.js → BinaryHeap.spec.js}

@@ -2,7 +2,7 @@ import { passThrough } from "../../function/passThrough.js";
 import { returnZero } from "../../function/returnZero.js";
 import { randomIntegerBetween } from "../../math/random/randomIntegerBetween.js";
 import { seededRandom } from "../../math/random/seededRandom.js";
-import BinaryHeap from "./FastBinaryHeap.js";
+import BinaryHeap from "./BinaryHeap.js";
 
 test("constructor doesn't throw", () => {
     new BinaryHeap(returnZero);

package/src/core/collection/heap/Uint32Heap.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=Uint32Heap.spec.d.ts.map

package/src/core/collection/heap/Uint32Heap.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Uint32Heap.spec.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/heap/Uint32Heap.spec.js"],"names":[],"mappings":""}

package/src/core/collection/table/RowFirstTable.d.ts

@@ -1,7 +1,10 @@
+/**
+ * Compact binary table storage
+ */
 export class RowFirstTable {
     /**
      *
-     * @param {RowFirstTableSpec} spec
+     * @param {RowFirstTableSpec} spec what does the schema look like? How many columns do we have and what are their types?
      * @param {boolean} [shared_array] should we use SharedArrayBuffer instead of ArrayBuffer?
      * @constructor
      */
@@ -71,9 +74,9 @@ export class RowFirstTable {
     hash(): number;
     /**
      *
-     * @param {int} rowCount
+     * @param {number} rowCount
      */
-    setCapacity(rowCount: int): void;
+    setCapacity(rowCount: number): void;
     /**
      * Drop excess capacity, setting capacity exactly to the current length
      */
@@ -112,15 +115,15 @@ export class RowFirstTable {
     insertRows(index: number, rowCount: number): void;
     /**
      *
-     * @param {Array.<Number>} values
+     * @param {Array.<number>} values
      */
     addRow(values: Array<number>): void;
     /**
      *
-     * @param {int} count number of rows to be added
-     * @param {function} valueSupplier supplier of row values, called with row index and an empty row to be filled
+     * @param {number} count number of rows to be added
+     * @param {function(row_index:number, row:Array.<number>):*} valueSupplier supplier of row values, called with row index and an empty row to be filled
      */
-    addRows(count: int, valueSupplier: Function): void;
+    addRows(count: number, valueSupplier: any): void;
     /**
      * Copy data from another table. Specs must match.
      * NOTE: does not send onAdded signal

package/src/core/collection/table/RowFirstTable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RowFirstTable.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTable.js"],"names":[],"mappings":"AAMA;IACI;;;;;OAKG;IACH,oDAHW,OAAO,EAuDjB;IA/CG;;;OAGG;IACH,wBAAgB;IAEhB;;;OAGG;IACH,gBAFU,qBAAsB,CAET;IAEvB;;;OAGG;IACH,MAFU,WAAW,CAEuB;IAE5C;;;OAGG;IACH,gBAFU,MAAM,CAEyB;IAEzC;;;OAGG;IACH,QAFU,MAAM,CAED;IAEf;;;OAGG;IACH,UAFU,MAAM,CAEC;IAEjB;;;OAGG;IACH,UAFU,QAAQ,CAEE;IAEpB;;MAEC;IAKL;;OAEG;IACH,mBAiBC;IAXG;;;OAGG;IACH,sBAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEb;IAEvC;;;OAGG;IACH,uBAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEX;IAG7C;;;;OAIG;IACH,uDAMC;IAED;;;OAGG;IACH,QAFa,MAAM,CA4BlB;IAED;;;OAGG;IACH,iCAoCC;IAED;;OAEG;IACH,aAEC;IAED;;;OAGG;IACH,iBAFW,MAAM,QAYhB;IAED;;;;;OAKG;IACH,yBAJW,MAAM,eACN,MAAM,SACN,MAAM,QAchB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,eACN,MAAM,GACJ,MAAM,CAclB;IAED;;;;OAIG;IACH,kBAHW,MAAM,YACN,MAAM,QAyBhB;IAED;;;;;OAKG;IACH,kBAHW,MAAM,YACN,MAAM,QAqBhB;IAED;;;OAGG;IACH,eAFW,aAAc,QAgBxB;IAED;;;;OAIG;IACH,mDAiCC;IAED;;;;OAIG;IACH,YAFW,aAAa,QAsBvB;IAED;;;OAGG;IACH,cAHW,aAAa,GACX,OAAO,CAyBnB;IAED;;;;OAIG;IACH,wCAEC;IAED;;;;OAIG;IACH,cAHW,MAAM,UACN,MAAM,EAAE,QAIlB;IAED;;OAEG;IACH,qBA4BC;IAED;;OAEG;IACH,cAIC;IAED;;;OAGG;IACH,wBAEC;IAED;;;OAGG;IACH,cAFa,MAAM,EAAE,EAAE,CAgBtB;IAED;;OAEG;IACH,uBAIC;CACJ;mBA1fkB,+BAA+B"}
+{"version":3,"file":"RowFirstTable.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTable.js"],"names":[],"mappings":"AAMA;;GAEG;AACH;IACI;;;;;OAKG;IACH,oDAHW,OAAO,EAuDjB;IA/CG;;;OAGG;IACH,wBAAgB;IAEhB;;;OAGG;IACH,gBAFU,qBAAsB,CAET;IAEvB;;;OAGG;IACH,MAFU,WAAW,CAEuB;IAE5C;;;OAGG;IACH,gBAFU,MAAM,CAEyB;IAEzC;;;OAGG;IACH,QAFU,MAAM,CAED;IAEf;;;OAGG;IACH,UAFU,MAAM,CAEC;IAEjB;;;OAGG;IACH,UAFU,QAAQ,CAEE;IAEpB;;MAEC;IAKL;;OAEG;IACH,mBAiBC;IAXG;;;OAGG;IACH,sBAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEb;IAEvC;;;OAGG;IACH,uBAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEX;IAG7C;;;;OAIG;IACH,uDAMC;IAED;;;OAGG;IACH,QAFa,MAAM,CA4BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QA+ChB;IAED;;OAEG;IACH,aAEC;IAED;;;OAGG;IACH,iBAFW,MAAM,QAchB;IAED;;;;;OAKG;IACH,yBAJW,MAAM,eACN,MAAM,SACN,MAAM,QAchB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,eACN,MAAM,GACJ,MAAM,CAclB;IAED;;;;OAIG;IACH,kBAHW,MAAM,YACN,MAAM,QAyBhB;IAED;;;;;OAKG;IACH,kBAHW,MAAM,YACN,MAAM,QAqBhB;IAED;;;OAGG;IACH,eAFW,MAAO,MAAM,CAAC,QAexB;IAED;;;;OAIG;IACH,eAHW,MAAM,4BAoChB;IAED;;;;OAIG;IACH,YAFW,aAAa,QAsBvB;IAED;;;OAGG;IACH,cAHW,aAAa,GACX,OAAO,CAyBnB;IAED;;;;OAIG;IACH,wCAIC;IAED;;;;OAIG;IACH,cAHW,MAAM,UACN,MAAM,EAAE,QAMlB;IAED;;OAEG;IACH,qBA4BC;IAED;;OAEG;IACH,cAIC;IAED;;;OAGG;IACH,wBAEC;IAED;;;OAGG;IACH,cAFa,MAAM,EAAE,EAAE,CAgBtB;IAED;;OAEG;IACH,uBAIC;CACJ;mBA3gBkB,+BAA+B"}

package/src/core/collection/table/RowFirstTable.js

@@ -4,10 +4,13 @@ import Signal from "../../events/signal/Signal.js";
 import { max2 } from "../../math/max2.js";
 import { array_copy } from "../array/array_copy.js";
 
+/**
+ * Compact binary table storage
+ */
 export class RowFirstTable {
     /**
      *
-     * @param {RowFirstTableSpec} spec
+     * @param {RowFirstTableSpec} spec what does the schema look like? How many columns do we have and what are their types?
      * @param {boolean} [shared_array] should we use SharedArrayBuffer instead of ArrayBuffer?
      * @constructor
      */
@@ -134,13 +137,22 @@ export class RowFirstTable {
 
     /**
      *
-     * @param {int} rowCount
+     * @param {number} rowCount
      */
     setCapacity(rowCount) {
+        assert.isNonNegativeInteger(rowCount, 'rowCount');
+
+        if(this.capacity === rowCount){
+            // already right size
+            return;
+        }
+
+
         const oldData = this.data;
 
         const bytesPerRecord = this.bytesPerRecord;
         const byteSize = rowCount * bytesPerRecord;
+
         try {
             // can be either ArrayBuffer or SharedArrayBuffer
             const BufferConstructor = this.data.constructor;
@@ -186,6 +198,8 @@ export class RowFirstTable {
      * @param {number} rowCount
      */
     resize(rowCount) {
+        assert.isNonNegativeInteger(rowCount, 'rowCount');
+
         if (this.capacity < rowCount) {
             //grow
             const growFactor = 1.5;
@@ -296,7 +310,7 @@ export class RowFirstTable {
 
     /**
      *
-     * @param {Array.<Number>} values
+     * @param {Array.<number>} values
      */
     addRow(values) {
 
@@ -308,7 +322,6 @@ export class RowFirstTable {
 
         this.length = newRowCount;
 
-
         this.writeRowMethod(this.dataView, this.bytesPerRecord * rowIndex, values);
 
         this.on.added.send2(rowIndex, values);
@@ -316,8 +329,8 @@ export class RowFirstTable {
 
     /**
      *
-     * @param {int} count number of rows to be added
-     * @param {function} valueSupplier supplier of row values, called with row index and an empty row to be filled
+     * @param {number} count number of rows to be added
+     * @param {function(row_index:number, row:Array.<number>):*} valueSupplier supplier of row values, called with row index and an empty row to be filled
      */
     addRows(count, valueSupplier) {
         const newRowCount = this.length + count;
@@ -416,6 +429,8 @@ export class RowFirstTable {
      * @param {Array} result where row values are to be stored
      */
     getRow(index, result) {
+        assert.isNonNegativeInteger(index,'index');
+
         this.readRowMethod(this.dataView, this.bytesPerRecord * index, result);
     }
 
@@ -425,6 +440,8 @@ export class RowFirstTable {
      * @param {number[]} record
      */
     setRow(index, record) {
+        assert.isNonNegativeInteger(index,'index');
+
         this.writeRowMethod(this.dataView, this.bytesPerRecord * index, record);
     }
 

package/src/core/geom/3d/normal/octahedron/encode_unit_to_octahedron.js

@@ -23,10 +23,10 @@ export function encode_unit_to_octahedron(
     const inverse_sum = 1 / abs_sum;
 
     let p_x = x * inverse_sum;
-    let p_y = y * inverse_sum;
+    let p_y = z * inverse_sum;
 
     // Reflect the folds of the lower hemisphere over the diagonals
-    if (z < 0) {
+    if (y < 0) {
         const abs_x = Math.abs(p_x);
         const abs_y = Math.abs(p_y);
 

package/src/core/geom/3d/topology/simplify/simplifyTopoMesh.d.ts

@@ -22,4 +22,5 @@ export function collapse_edges(number_faces_to_remove: number, heap: BinaryHeap<
  */
 export function simplifyTopoMesh(mesh: TopoMesh, num_faces_to_remove: number, restricted_vertices?: Set<number>): void;
 import { EdgeCollapseCandidate } from "./EdgeCollapseCandidate.js";
+import BinaryHeap from "../../../../collection/heap/BinaryHeap.js";
 //# sourceMappingURL=simplifyTopoMesh.d.ts.map

package/src/core/geom/3d/topology/simplify/simplifyTopoMesh.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simplifyTopoMesh.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/topology/simplify/simplifyTopoMesh.js"],"names":[],"mappings":"AAaA;;;GAGG;AACH,wCAFW,qBAAqB,UAI/B;AAGD;;;;;;;GAOG;AACH,uDAPW,MAAM,iFAGN,cAAc,qBAAqB,CAAC,qBACpC,IAAI,MAAM,aAAa,uBACvB,IAAI,MAAM,CAAC,QAyKrB;AAED;;;;;;;GAOG;AACH,sEAHW,MAAM,wBACN,IAAI,MAAM,CAAC,QAwDrB;sCAnQqC,4BAA4B"}
+{"version":3,"file":"simplifyTopoMesh.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/topology/simplify/simplifyTopoMesh.js"],"names":[],"mappings":"AAaA;;;GAGG;AACH,wCAFW,qBAAqB,UAI/B;AAGD;;;;;;;GAOG;AACH,uDAPW,MAAM,QACN,WAAW,qBAAqB,CAAC,wCAEjC,cAAc,qBAAqB,CAAC,qBACpC,IAAI,MAAM,aAAa,uBACvB,IAAI,MAAM,CAAC,QAyKrB;AAED;;;;;;;GAOG;AACH,sEAHW,MAAM,wBACN,IAAI,MAAM,CAAC,QAwDrB;sCAhQqC,4BAA4B;uBAJ3C,2CAA2C"}

package/src/core/geom/3d/topology/simplify/simplifyTopoMesh.js

@@ -1,10 +1,10 @@
-import FastBinaryHeap from "../../../../collection/heap/FastBinaryHeap.js";
 import { array_copy_unique } from "../../../../collection/array/array_copy_unique.js";
+import BinaryHeap from "../../../../collection/heap/BinaryHeap.js";
+import { build_edge_collapse_candidates } from "./build_edge_collapse_candidates.js";
+import { collapse_all_degenerate_edges } from "./collapse_all_degenerate_edges.js";
+import { collapse_degenerate_edge } from "./collapse_degenerate_edge.js";
 import { EdgeCollapseCandidate } from "./EdgeCollapseCandidate.js";
 import { build_vertex_quadratics } from "./quadratic/build_vertex_quadratics.js";
-import { collapse_degenerate_edge } from "./collapse_degenerate_edge.js";
-import { collapse_all_degenerate_edges } from "./collapse_all_degenerate_edges.js";
-import { build_edge_collapse_candidates } from "./build_edge_collapse_candidates.js";
 
 
 const scratch_array_1 = [];
@@ -220,7 +220,7 @@ export function simplifyTopoMesh(mesh, num_faces_to_remove, restricted_vertices
      *
      * @type {BinaryHeap<EdgeCollapseCandidate>}
      */
-    const open_set = new FastBinaryHeap(extract_edge_cost);
+    const open_set = new BinaryHeap(extract_edge_cost);
 
     /**
      *

package/src/core/geom/3d/triangle/computeTriangleRayIntersectionBarycentricEdge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeTriangleRayIntersectionBarycentricEdge.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/triangle/computeTriangleRayIntersectionBarycentricEdge.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,sEAlBW,MAAM,EAAE,YACR,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,GACL,OAAO,CAgElB"}
+{"version":3,"file":"computeTriangleRayIntersectionBarycentricEdge.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/triangle/computeTriangleRayIntersectionBarycentricEdge.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,sEAlBW,MAAM,EAAE,YACR,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,GACL,OAAO,CAsElB"}

package/src/core/geom/3d/triangle/computeTriangleRayIntersectionBarycentricEdge.js

@@ -43,20 +43,27 @@ export function computeTriangleRayIntersectionBarycentricEdge(
     //if determinant is near zero, ray lies in plane of triangle
     const det = v3_dot(edge1_x, edge1_y, edge1_z, pvec_x, pvec_y, pvec_z);
 
+    if(det === 0){
+        // ray is parallel to the plane of the triange, no intersection possible
+        return false;
+    }
+
     if (det <= 0) {
         // back-face culling
-        return false;
+        // return false;
     }
 
+    const inv_det = 1 / det;
+
     // calculate distance from vert0 to ray origin (not really, but okay)
     const tvec_x = origin_x - ax;
     const tvec_y = origin_y - ay;
     const tvec_z = origin_z - az;
 
     // calculate u
-    const u = v3_dot(tvec_x, tvec_y, tvec_z, pvec_x, pvec_y, pvec_z);
+    const u = v3_dot(tvec_x, tvec_y, tvec_z, pvec_x, pvec_y, pvec_z)*inv_det;
 
-    if (u < 0 || u > det) {
+    if (u < 0 || u > 1) {
         // outside of bounds of the triangle
         return false;
     }
@@ -68,22 +75,21 @@ export function computeTriangleRayIntersectionBarycentricEdge(
     const qvec_z = tvec_x * edge1_y - tvec_y * edge1_x;
 
     // calculate V parameter
-    const v = v3_dot(direction_x, direction_y, direction_z, qvec_x, qvec_y, qvec_z);
+    const v = v3_dot(direction_x, direction_y, direction_z, qvec_x, qvec_y, qvec_z)*inv_det;
 
-    if (v < 0 || u + v > det) {
+    if (v < 0 || u + v > 1) {
         // out of bounds
         return false;
     }
 
 
-    const inv_det = 1 / det;
 
     // calculate t, scale parameter, ray intersects triangle
     const t = v3_dot(edge2_x, edge2_y, edge2_z, qvec_x, qvec_y, qvec_z) * inv_det;
 
     result[0] = t;
-    result[1] = u * inv_det;
-    result[2] = v * inv_det;
+    result[1] = u ;
+    result[2] = v ;
 
     return true;
 }

package/src/core/geom/packing/max-rect/MaxRectanglesPacker.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../assert.js";
-import BinaryHeap from "../../../collection/heap/FastBinaryHeap.js";
+import BinaryHeap from "../../../collection/heap/BinaryHeap.js";
 import AABB2 from "../../2d/aabb/AABB2.js";
 import { QuadTreeDatum } from "../../2d/quad-tree/QuadTreeDatum.js";
 import { QuadTreeNode } from "../../2d/quad-tree/QuadTreeNode.js";

package/src/core/graph/Edge.d.ts

@@ -75,6 +75,7 @@ export class Edge<N> {
      * @returns {N[]}
      */
     get nodes(): N[];
+    toString(): string;
     /**
      *
      * @type {boolean}

package/src/core/graph/Edge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Edge.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/Edge.js"],"names":[],"mappings":"gCAIU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,4BAmBC;IAfG;;;OAGG;IACH,WAAc;IACd;;;OAGG;IACH,YAAe;IAEf;;OAEG;IACH,WAFU,iBAAiB,CAEkB;IAGjD;;;;OAIG;IACH,eAHW,CAAC,GACA,OAAO,CAIlB;IAED;;;;;OAKG;IACH,2BAJW,CAAC,UACD,CAAC,GACC,OAAO,CASnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,CAAC,CAIb;IAED;;;OAGG;IACH,sBAFa,OAAO,CAInB;IAED;;;OAGG;IACH,uBAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,wBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,iBAEC;IAIL;;;OAGG;IACH,QAFU,OAAO,CAEI;CANpB"}
+{"version":3,"file":"Edge.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/Edge.js"],"names":[],"mappings":"gCAKU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,4BAmBC;IAfG;;;OAGG;IACH,WAAc;IACd;;;OAGG;IACH,YAAe;IAEf;;OAEG;IACH,WAFU,iBAAiB,CAEkB;IAGjD;;;;OAIG;IACH,eAHW,CAAC,GACA,OAAO,CAIlB;IAED;;;;;OAKG;IACH,2BAJW,CAAC,UACD,CAAC,GACC,OAAO,CASnB;IAED;;;;OAIG;IACH,YAHW,CAAC,GACC,CAAC,CAIb;IAED;;;OAGG;IACH,sBAFa,OAAO,CAInB;IAED;;;OAGG;IACH,uBAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,wBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;;OAIG;IACH,yBAHW,CAAC,GACC,OAAO,CAKnB;IAED;;;OAGG;IACH,iBAEC;IAED,mBAEC;IAIL;;;OAGG;IACH,QAFU,OAAO,CAEI;CANpB"}

package/src/core/graph/Edge.js

@@ -1,4 +1,5 @@
 import { assert } from "../assert.js";
+import { objectKeyByValue } from "../model/object/objectKeyByValue.js";
 
 /**
  *
@@ -118,6 +119,10 @@ export class Edge {
         return [this.first, this.second];
     }
 
+    toString() {
+        return `Edge:{ first=${this.first}, second=${this.second}, direction=${objectKeyByValue(EdgeDirectionType, this.direction)} }`
+    }
+
 }
 
 /**

package/src/core/graph/graph_compute_distance_matrix.js

@@ -1,6 +1,6 @@
 import { BitSet } from "../binary/BitSet.js";
 import { BinaryDataType } from "../binary/type/BinaryDataType.js";
-import FastBinaryHeap from "../collection/heap/FastBinaryHeap.js";
+import BinaryHeap from "../collection/heap/BinaryHeap.js";
 import { SquareMatrix } from "./SquareMatrix.js";
 
 /**
@@ -40,7 +40,7 @@ export function graph_compute_distance_matrix(graph, node_array, targets, node_i
         // distance to self is always 0
         m_distances.setCellValue(source_node, source_node, 0);
 
-        const heap = new FastBinaryHeap(score);
+        const heap = new BinaryHeap(score);
         heap.push(source_node);
 
         while (!heap.isEmpty()) {

package/src/core/graph/metis/cluster_mesh_metis.d.ts

@@ -0,0 +1,9 @@
+/**
+ *
+ * @param {Uint32Array} result
+ * @param {TopoMesh} mesh
+ * @param {number} patch_size
+ * @returns {number}
+ */
+export function cluster_mesh_metis(result: Uint32Array, mesh: TopoMesh, patch_size: number): number;
+//# sourceMappingURL=cluster_mesh_metis.d.ts.map

package/src/core/graph/metis/cluster_mesh_metis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster_mesh_metis.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/metis/cluster_mesh_metis.js"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,2CALW,WAAW,8BAEX,MAAM,GACJ,MAAM,CAqBlB"}

package/src/core/graph/metis/cluster_mesh_metis.js

@@ -0,0 +1,31 @@
+import { mesh_to_metis_graph } from "./mesh_to_metis_graph.js";
+import { metis_cluster_bs } from "./metis_cluster_bs.js";
+
+/**
+ *
+ * @param {Uint32Array} result
+ * @param {TopoMesh} mesh
+ * @param {number} patch_size
+ * @returns {number}
+ */
+export async function cluster_mesh_metis(result, mesh, patch_size) {
+
+    const face_set = mesh.getFaces();
+    const input_face_count = face_set.size;
+
+    const face_array = Array.from(face_set);
+
+    const metis_graph = mesh_to_metis_graph(face_array);
+
+    const partition_count = await metis_cluster_bs(
+        result,
+        input_face_count,
+        metis_graph.edge_addresses,
+        metis_graph.adjacency,
+        metis_graph.edge_weights,
+        patch_size
+    );
+
+    return partition_count;
+}
+

package/src/core/graph/metis/mesh_to_metis_graph.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @param {TopoTriangle[]} face_array
+ * @returns {{edge_addresses:Uint32Array, adjacency:Uint32Array, edge_weights:Uint32Array}}
+ */
+export function mesh_to_metis_graph(face_array: TopoTriangle[]): {
+    edge_addresses: Uint32Array;
+    adjacency: Uint32Array;
+    edge_weights: Uint32Array;
+};
+//# sourceMappingURL=mesh_to_metis_graph.d.ts.map

package/src/core/graph/metis/mesh_to_metis_graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh_to_metis_graph.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/metis/mesh_to_metis_graph.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,gDAHW,cAAc;oBACI,WAAW;eAAY,WAAW;kBAAe,WAAW;EA2DxF"}

package/src/core/graph/metis/mesh_to_metis_graph.js

@@ -0,0 +1,64 @@
+import { assert } from "../../assert.js";
+
+/**
+ * @param {TopoTriangle[]} face_array
+ * @returns {{edge_addresses:Uint32Array, adjacency:Uint32Array, edge_weights:Uint32Array}}
+ */
+export function mesh_to_metis_graph(face_array) {
+    assert.isArray(face_array, 'face_array');
+
+    const input_face_count = face_array.length;
+
+    const edge_addresses = new Uint32Array(input_face_count + 1);
+    const adjacency = [];
+    const edge_weights = [];
+
+    const face_index_map = new Map();
+
+    for (let i = 0; i < input_face_count; i++) {
+        const face = face_array[i];
+        face_index_map.set(face, i);
+    }
+
+    let offset = 0;
+    edge_addresses[0] = 0;
+    for (let i = 0; i < input_face_count; i++) {
+        const face = face_array[i];
+
+        const edges = face.edges;
+
+        const edge_count = edges.length;
+        for (let j = 0; j < edge_count; j++) {
+            const topoEdge = edges[j];
+
+            const edge_faces = topoEdge.faces;
+
+            const edge_face_count = edge_faces.length;
+            for (let k = 0; k < edge_face_count; k++) {
+                const neighbour = edge_faces[k];
+
+                if (neighbour === face) {
+                    //skip self
+                    continue;
+                }
+
+                adjacency[offset] = face_index_map.get(neighbour);
+                edge_weights[offset] = 1;
+
+                offset++;
+            }
+        }
+
+        edge_addresses[i + 1] = offset;
+    }
+
+    const adjecency_uint32 = new Uint32Array(adjacency);
+    const edge_weights_uint32 = new Uint32Array(edge_weights);
+
+
+    return {
+        edge_addresses: edge_addresses,
+        adjacency: adjecency_uint32,
+        edge_weights: edge_weights_uint32
+    };
+}

package/src/core/graph/metis/metis_cluster_bs.d.ts

@@ -0,0 +1,12 @@
+/**
+ *
+ * @param {Uint32Array} result
+ * @param {number} node_count
+ * @param {Uint32Array} edge_addresses
+ * @param {Uint32Array} adjacency_uint32
+ * @param {Uint32Array} edge_weights_uint32
+ * @param {number} patch_size
+ * @returns {Promise<number>}
+ */
+export function metis_cluster_bs(result: Uint32Array, node_count: number, edge_addresses: Uint32Array, adjacency_uint32: Uint32Array, edge_weights_uint32: Uint32Array, patch_size: number): Promise<number>;
+//# sourceMappingURL=metis_cluster_bs.d.ts.map

package/src/core/graph/metis/metis_cluster_bs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metis_cluster_bs.d.ts","sourceRoot":"","sources":["../../../../../src/core/graph/metis/metis_cluster_bs.js"],"names":[],"mappings":"AASA;;;;;;;;;GASG;AACH,yCARW,WAAW,cACX,MAAM,kBACN,WAAW,oBACX,WAAW,uBACX,WAAW,cACX,MAAM,GACJ,QAAQ,MAAM,CAAC,CA6G3B"}