@woosh/meep-engine 3.0.1 → 3.0.2

package/src/core/geom/3d/frustum/frustum3_compute_closest_point.js

@@ -1,110 +1,117 @@
-import { v3_distance_above_plane } from "../../vec3/v3_distance_above_plane.js";
-import Vector3 from "../../Vector3.js";
-import { plane3_compute_intersection_objects } from "../plane/plane3_compute_intersection_objects.js";
-import { plane3_project_point } from "../plane/plane3_project_point.js";
-import { plane3_compute_3_plane_intersection_from_three } from "../plane/plane3_compute_3_plane_intersection_from_three.js";
-import { ray3_compute_closest_point } from "../ray/ray3_compute_closest_point.js";
-
-/**
- *
- * @type {Plane[]}
- */
-const scratch_outer_planes = [];
-
-const scratch_v3_0 = new Vector3();
-
-const scratch_v3_1 = new Vector3();
-
-/**
- *
- * @type {number[]}
- */
-const scratch_v3_array = [];
-
-/**
- *
- * @param {Vector3} result
- * @param {Plane[]} planes
- * @param {number} target_x
- * @param {number} target_y
- * @param {number} target_z
- * @returns {boolean} if point is inside the frustum - true, false otherwise
- */
-export function frustum3_compute_closest_point(result, planes, target_x, target_y, target_z) {
-    let j;
-
-    let outside_plane_count = 0;
-
-    const plane_count = planes.length;
-
-    for (j = 0; j < plane_count; j++) {
-
-        const plane = planes[j];
-
-        const plane_normal = plane.normal;
-
-        const distance = v3_distance_above_plane(
-            target_x, target_y, target_z,
-            plane_normal.x, plane_normal.y, plane_normal.z, plane.constant
-        );
-
-        if (distance < 0) {
-
-            scratch_outer_planes[outside_plane_count] = j;
-
-            outside_plane_count++;
-
-        }
-
-    }
-
-    if (outside_plane_count === 0) {
-        result.set(target_x, target_y, target_z);
-
-        return true;
-    }
-
-    // point is outside the frustum
-
-    if (outside_plane_count === 1) {
-        const plane_0_index = scratch_outer_planes[0];
-        const plane_0 = planes[plane_0_index];
-        // point lies outside exactly one plane
-        plane3_project_point(result, target_x, target_y, target_z, plane_0.normal.x, plane_0.normal.y, plane_0.normal.z, plane_0.constant);
-    } else if (outside_plane_count === 2) {
-        // outside two planes, nearest point lies on the intersection line of two planes
-
-        const plane_0_index = scratch_outer_planes[0];
-        const plane_1_index = scratch_outer_planes[1];
-
-        const plane_0 = planes[plane_0_index];
-        const plane_1 = planes[plane_1_index];
-
-        const intersection_exists = plane3_compute_intersection_objects(plane_0, plane_1, scratch_v3_0, scratch_v3_1);
-
-        if (!intersection_exists) {
-            throw new Error('Planes are parallel and do not intersect, likely an invalid frustum');
-        }
-
-        ray3_compute_closest_point(result,
-            scratch_v3_0.x, scratch_v3_0.y, scratch_v3_0.z,
-            scratch_v3_1.x, scratch_v3_1.y, scratch_v3_1.z,
-            target_x, target_y, target_z
-        );
-    } else if (outside_plane_count === 3) {
-        // outside 3 planes, nearest point is intersect of 3 planes
-        const plane_0_index = scratch_outer_planes[0];
-        const plane_1_index = scratch_outer_planes[1];
-        const plane_2_index = scratch_outer_planes[2];
-
-        const plane_0 = planes[plane_0_index];
-        const plane_1 = planes[plane_1_index];
-        const plane_2 = planes[plane_2_index];
-
-        plane3_compute_3_plane_intersection_from_three(scratch_v3_array, 0, plane_0, plane_1, plane_2);
-
-        result.fromArray(scratch_v3_array, 0)
-    }
-
-    return false;
-}
+import { v3_distance_above_plane } from "../../vec3/v3_distance_above_plane.js";
+import Vector3 from "../../Vector3.js";
+import { plane3_compute_3_plane_intersection } from "../plane/plane3_compute_3_plane_intersection.js";
+import { plane3_compute_intersection } from "../plane/plane3_compute_intersection.js";
+import { plane3_project_point } from "../plane/plane3_project_point.js";
+import { ray3_compute_closest_point } from "../ray/ray3_compute_closest_point.js";
+
+/**
+ * Indices into the caller's plane list, for the planes the target lies outside of.
+ * @type {number[]}
+ */
+const scratch_outer_planes = [];
+
+const scratch_v3_0 = new Vector3();
+
+const scratch_v3_1 = new Vector3();
+
+/**
+ *
+ * @type {number[]}
+ */
+const scratch_v3_array = [];
+
+/**
+ * The point inside a convex frustum nearest to a target point, and whether the target was already
+ * inside it.
+ *
+ * **A plane is a `Vector4`**: `x, y, z` its normal and `w` its constant, inside where
+ * `dot(normal, p) + w` is non-negative. That is the same four numbers every frustum query in the
+ * tree reads and what `camera_active_frustum` publishes; it used to be a three `Plane`, whose
+ * `normal`/`constant` pair is the same thing wearing an object (X15d).
+ *
+ * @param {Vector3} result
+ * @param {Vector4[]} planes
+ * @param {number} target_x
+ * @param {number} target_y
+ * @param {number} target_z
+ * @returns {boolean} if point is inside the frustum - true, false otherwise
+ */
+export function frustum3_compute_closest_point(result, planes, target_x, target_y, target_z) {
+    let j;
+
+    let outside_plane_count = 0;
+
+    const plane_count = planes.length;
+
+    for (j = 0; j < plane_count; j++) {
+
+        const plane = planes[j];
+
+        const distance = v3_distance_above_plane(
+            target_x, target_y, target_z,
+            plane.x, plane.y, plane.z, plane.w
+        );
+
+        if (distance < 0) {
+
+            scratch_outer_planes[outside_plane_count] = j;
+
+            outside_plane_count++;
+
+        }
+
+    }
+
+    if (outside_plane_count === 0) {
+        result.set(target_x, target_y, target_z);
+
+        return true;
+    }
+
+    // point is outside the frustum
+
+    if (outside_plane_count === 1) {
+        const plane_0 = planes[scratch_outer_planes[0]];
+
+        // point lies outside exactly one plane
+        plane3_project_point(result, target_x, target_y, target_z, plane_0.x, plane_0.y, plane_0.z, plane_0.w);
+    } else if (outside_plane_count === 2) {
+        // outside two planes, nearest point lies on the intersection line of two planes
+
+        const plane_0 = planes[scratch_outer_planes[0]];
+        const plane_1 = planes[scratch_outer_planes[1]];
+
+        const intersection_exists = plane3_compute_intersection(
+            scratch_v3_0, scratch_v3_1,
+            plane_0.x, plane_0.y, plane_0.z, plane_0.w,
+            plane_1.x, plane_1.y, plane_1.z, plane_1.w
+        );
+
+        if (!intersection_exists) {
+            throw new Error('Planes are parallel and do not intersect, likely an invalid frustum');
+        }
+
+        ray3_compute_closest_point(result,
+            scratch_v3_0.x, scratch_v3_0.y, scratch_v3_0.z,
+            scratch_v3_1.x, scratch_v3_1.y, scratch_v3_1.z,
+            target_x, target_y, target_z
+        );
+    } else if (outside_plane_count === 3) {
+        // outside 3 planes, nearest point is intersect of 3 planes
+        const plane_0 = planes[scratch_outer_planes[0]];
+        const plane_1 = planes[scratch_outer_planes[1]];
+        const plane_2 = planes[scratch_outer_planes[2]];
+
+        plane3_compute_3_plane_intersection(
+            scratch_v3_array, 0,
+            plane_0.x, plane_0.y, plane_0.z, plane_0.w,
+            plane_1.x, plane_1.y, plane_1.z, plane_1.w,
+            plane_2.x, plane_2.y, plane_2.z, plane_2.w
+        );
+
+        result.fromArray(scratch_v3_array, 0)
+    }
+
+    return false;
+}

package/src/core/geom/3d/tetrahedra/graphics/build_tetrahedral_mesh_geometry.d.ts

@@ -0,0 +1,14 @@
+/**
+ * A tetrahedral mesh as drawable line-list geometry, for looking at one.
+ *
+ * The index is a **line list** rather than triangles, so `Geometry.getPrimitiveCount` — which
+ * divides by three — does not describe it and no BVH should be built over it. It is a debug
+ * visualisation and the draw mode is the caller's to set.
+ *
+ * @param {TetrahedralMesh} tetrahedra
+ * @param {Float32Array|number[]} points 3 values per point
+ * @return {Geometry}
+ */
+export function build_tetrahedral_mesh_geometry(tetrahedra: TetrahedralMesh, points: Float32Array | number[]): Geometry;
+import { Geometry } from "../../../../../shade/renderer/geometry/Geometry.js";
+//# sourceMappingURL=build_tetrahedral_mesh_geometry.d.ts.map

package/src/core/geom/3d/tetrahedra/graphics/build_tetrahedral_mesh_geometry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build_tetrahedral_mesh_geometry.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/tetrahedra/graphics/build_tetrahedral_mesh_geometry.js"],"names":[],"mappings":"AAKA;;;;;;;;;;GAUG;AACH,qFAHW,YAAY,GAAC,MAAM,EAAE,GACpB,QAAQ,CAwBnB;yBArCwB,oDAAoD"}

package/src/core/geom/3d/tetrahedra/graphics/build_tetrahedral_mesh_geometry.js

@@ -0,0 +1,39 @@
+import { Attribute } from "../../../../../shade/renderer/geometry/Attribute.js";
+import { Geometry } from "../../../../../shade/renderer/geometry/Geometry.js";
+import { StandardAttributes } from "../../../../../shade/renderer/geometry/StandardAttributes.js";
+import { build_tetrahedral_mesh_geometry_lines } from "./build_tetrahedral_mesh_geometry_lines.js";
+
+/**
+ * A tetrahedral mesh as drawable line-list geometry, for looking at one.
+ *
+ * The index is a **line list** rather than triangles, so `Geometry.getPrimitiveCount` — which
+ * divides by three — does not describe it and no BVH should be built over it. It is a debug
+ * visualisation and the draw mode is the caller's to set.
+ *
+ * @param {TetrahedralMesh} tetrahedra
+ * @param {Float32Array|number[]} points 3 values per point
+ * @return {Geometry}
+ */
+export function build_tetrahedral_mesh_geometry(
+    tetrahedra,
+    points
+) {
+
+    const point_count = points.length / 3;
+
+    const lines = build_tetrahedral_mesh_geometry_lines(tetrahedra, point_count);
+
+    const geometry = new Geometry();
+
+    geometry.name = "TetrahedralMesh";
+
+    geometry.addAttribute(Attribute.from(
+        points instanceof Float32Array ? points : new Float32Array(points),
+        3,
+        StandardAttributes.Position
+    ));
+
+    geometry.index = Attribute.from(lines, 1, StandardAttributes.Index);
+
+    return geometry;
+}

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

@@ -1 +1 @@
-{"version":3,"file":"tri3_closest_point_barycentric.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/triangle/tri3_closest_point_barycentric.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AACH,uDAhBW,MAAM,EAAE,iBACR,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,IAAI,CAoJhB"}
+{"version":3,"file":"tri3_closest_point_barycentric.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/triangle/tri3_closest_point_barycentric.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AACH,uDAhBW,MAAM,EAAE,iBACR,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,IAAI,CAyJhB"}

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

@@ -1,167 +1,172 @@
-import { v3_dot } from "../../vec3/v3_dot.js";
-
-/**
- *
- * @param {number[]} result result is written as a 2d vector, since barycentrics add up to 1, we omit the last value
- * @param {number} result_offset
- * @param {number} px reference point
- * @param {number} py reference point
- * @param {number} pz reference point
- * @param {number} ax Triangle apex A
- * @param {number} ay Triangle apex A
- * @param {number} az Triangle apex A
- * @param {number} bx Triangle apex B
- * @param {number} by Triangle apex B
- * @param {number} bz Triangle apex B
- * @param {number} cx Triangle apex C
- * @param {number} cy Triangle apex C
- * @param {number} cz Triangle apex C
- * @returns {void}
- */
-export function tri3_closest_point_barycentric(
-    result, result_offset,
-    px, py, pz,
-    ax, ay, az,
-    bx, by, bz,
-    cx, cy, cz
-) {
-    // adapted from https://github.com/mrdoob/three.js/blob/676e85dc7cd5971a6565c4152e9e6d8bdd20a2b7/src/math/Triangle.js#L222
-
-    let v, w;
-
-    // algorithm thanks to Real-Time Collision Detection by Christer Ericson,
-    // published by Morgan Kaufmann Publishers, (c) 2005 Elsevier Inc.,
-    // under the accompanying license; see chapter 5.1.5 for detailed explanation.
-    // basically, we're distinguishing which of the voronoi regions of the triangle
-    // the point lies in with the minimum amount of redundant computation.
-
-    // localize coordinates with respect to A
-    const _vab_x = bx - ax;
-    const _vab_y = by - ay;
-    const _vab_z = bz - az;
-
-    const _vac_x = cx - ax;
-    const _vac_y = cy - ay;
-    const _vac_z = cz - az;
-
-    const _vap_x = px - ax;
-    const _vap_y = py - ay;
-    const _vap_z = pz - az;
-
-    const d1 = v3_dot(_vab_x, _vab_y, _vab_z, _vap_x, _vap_y, _vap_z);
-    const d2 = v3_dot(_vac_x, _vac_y, _vac_z, _vap_x, _vap_y, _vap_z);
-
-    if (d1 <= 0 && d2 <= 0) {
-
-        // vertex region of A; barycentric coords (1, 0, 0)
-
-        result[result_offset] = 1;
-        result[result_offset + 1] = 0;
-
-        return;
-
-    }
-
-    const _vbp_x = px - bx;
-    const _vbp_y = py - by;
-    const _vbp_z = pz - bz;
-
-    const d3 = v3_dot(_vab_x, _vab_y, _vab_z, _vbp_x, _vbp_y, _vbp_z);
-    const d4 = v3_dot(_vac_x, _vac_y, _vac_z, _vbp_x, _vbp_y, _vbp_z);
-
-    if (d3 >= 0 && d4 <= d3) {
-
-        // vertex region of B; barycentric coords (0, 1, 0)
-
-        result[result_offset] = 0;
-        result[result_offset + 1] = 1;
-
-        return;
-
-    }
-
-    const vc = d1 * d4 - d3 * d2;
-    if (vc <= 0 && d1 >= 0 && d3 <= 0) {
-
-        const s = d1 - d3;
-
-        if (s !== 0) {
-            v = d1 / s;
-        } else {
-            v = 0;
-        }
-        // edge region of AB; barycentric coords (1-v, v, 0)
-
-        result[result_offset] = 1 - v;
-        result[result_offset + 1] = v;
-
-        return;
-
-    }
-
-    const _vcp_x = px - cx;
-    const _vcp_y = py - cy;
-    const _vcp_z = pz - cz;
-
-    const d5 = v3_dot(_vab_x, _vab_y, _vab_z, _vcp_x, _vcp_y, _vcp_z);
-    const d6 = v3_dot(_vac_x, _vac_y, _vac_z, _vcp_x, _vcp_y, _vcp_z);
-
-    if (d6 >= 0 && d5 <= d6) {
-
-        // vertex region of C; barycentric coords (0, 0, 1)
-
-        result[result_offset] = 0;
-        result[result_offset + 1] = 0;
-
-        return;
-
-    }
-
-    const vb = d5 * d2 - d1 * d6;
-    if (vb <= 0 && d2 >= 0 && d6 <= 0) {
-
-        const s = d2 - d6;
-
-        if (s !== 0) {
-            w = d2 / s;
-        } else {
-            w = 0;
-        }
-
-        // edge region of AC; barycentric coords (1-w, 0, w)
-
-        result[result_offset] = 1 - w;
-        result[result_offset + 1] = 0;
-
-        return;
-
-    }
-
-    const va = d3 * d6 - d5 * d4;
-    if (va <= 0 && (d4 - d3) >= 0 && (d5 - d6) >= 0) {
-
-        const s = (d4 - d3) + (d5 - d6);
-
-        if(s !== 0) {
-            w = (d4 - d3) / s;
-        }else{
-            w = 1;
-        }
-
-        // edge region of BC; barycentric coords (0, 1-w, w)
-
-        result[result_offset] = 0;
-        result[result_offset + 1] = 1 - w;
-
-        return;
-
-    }
-
-    // face region
-    const denom = 1 / (va + vb + vc);
-    const u = va * denom
-    v = vb * denom;
-
-    result[result_offset] = u;
-    result[result_offset + 1] = v;
+import { v3_dot } from "../../vec3/v3_dot.js";
+
+/**
+ *
+ * @param {number[]} result result is written as a 2d vector, since barycentrics add up to 1, we omit the last value
+ * @param {number} result_offset
+ * @param {number} px reference point
+ * @param {number} py reference point
+ * @param {number} pz reference point
+ * @param {number} ax Triangle apex A
+ * @param {number} ay Triangle apex A
+ * @param {number} az Triangle apex A
+ * @param {number} bx Triangle apex B
+ * @param {number} by Triangle apex B
+ * @param {number} bz Triangle apex B
+ * @param {number} cx Triangle apex C
+ * @param {number} cy Triangle apex C
+ * @param {number} cz Triangle apex C
+ * @returns {void}
+ */
+export function tri3_closest_point_barycentric(
+    result, result_offset,
+    px, py, pz,
+    ax, ay, az,
+    bx, by, bz,
+    cx, cy, cz
+) {
+    /*
+     Adapted from three's `Triangle.getBarycoord`:
+     https://github.com/mrdoob/three.js/blob/676e85dc7cd5971a6565c4152e9e6d8bdd20a2b7/src/math/Triangle.js#L222
+
+     Derived from three.js (https://github.com/mrdoob/three.js), Copyright (c) 2010-2024 three.js authors, MIT licence.
+    */
+
+    let v, w;
+
+    // algorithm thanks to Real-Time Collision Detection by Christer Ericson,
+    // published by Morgan Kaufmann Publishers, (c) 2005 Elsevier Inc.,
+    // under the accompanying license; see chapter 5.1.5 for detailed explanation.
+    // basically, we're distinguishing which of the voronoi regions of the triangle
+    // the point lies in with the minimum amount of redundant computation.
+
+    // localize coordinates with respect to A
+    const _vab_x = bx - ax;
+    const _vab_y = by - ay;
+    const _vab_z = bz - az;
+
+    const _vac_x = cx - ax;
+    const _vac_y = cy - ay;
+    const _vac_z = cz - az;
+
+    const _vap_x = px - ax;
+    const _vap_y = py - ay;
+    const _vap_z = pz - az;
+
+    const d1 = v3_dot(_vab_x, _vab_y, _vab_z, _vap_x, _vap_y, _vap_z);
+    const d2 = v3_dot(_vac_x, _vac_y, _vac_z, _vap_x, _vap_y, _vap_z);
+
+    if (d1 <= 0 && d2 <= 0) {
+
+        // vertex region of A; barycentric coords (1, 0, 0)
+
+        result[result_offset] = 1;
+        result[result_offset + 1] = 0;
+
+        return;
+
+    }
+
+    const _vbp_x = px - bx;
+    const _vbp_y = py - by;
+    const _vbp_z = pz - bz;
+
+    const d3 = v3_dot(_vab_x, _vab_y, _vab_z, _vbp_x, _vbp_y, _vbp_z);
+    const d4 = v3_dot(_vac_x, _vac_y, _vac_z, _vbp_x, _vbp_y, _vbp_z);
+
+    if (d3 >= 0 && d4 <= d3) {
+
+        // vertex region of B; barycentric coords (0, 1, 0)
+
+        result[result_offset] = 0;
+        result[result_offset + 1] = 1;
+
+        return;
+
+    }
+
+    const vc = d1 * d4 - d3 * d2;
+    if (vc <= 0 && d1 >= 0 && d3 <= 0) {
+
+        const s = d1 - d3;
+
+        if (s !== 0) {
+            v = d1 / s;
+        } else {
+            v = 0;
+        }
+        // edge region of AB; barycentric coords (1-v, v, 0)
+
+        result[result_offset] = 1 - v;
+        result[result_offset + 1] = v;
+
+        return;
+
+    }
+
+    const _vcp_x = px - cx;
+    const _vcp_y = py - cy;
+    const _vcp_z = pz - cz;
+
+    const d5 = v3_dot(_vab_x, _vab_y, _vab_z, _vcp_x, _vcp_y, _vcp_z);
+    const d6 = v3_dot(_vac_x, _vac_y, _vac_z, _vcp_x, _vcp_y, _vcp_z);
+
+    if (d6 >= 0 && d5 <= d6) {
+
+        // vertex region of C; barycentric coords (0, 0, 1)
+
+        result[result_offset] = 0;
+        result[result_offset + 1] = 0;
+
+        return;
+
+    }
+
+    const vb = d5 * d2 - d1 * d6;
+    if (vb <= 0 && d2 >= 0 && d6 <= 0) {
+
+        const s = d2 - d6;
+
+        if (s !== 0) {
+            w = d2 / s;
+        } else {
+            w = 0;
+        }
+
+        // edge region of AC; barycentric coords (1-w, 0, w)
+
+        result[result_offset] = 1 - w;
+        result[result_offset + 1] = 0;
+
+        return;
+
+    }
+
+    const va = d3 * d6 - d5 * d4;
+    if (va <= 0 && (d4 - d3) >= 0 && (d5 - d6) >= 0) {
+
+        const s = (d4 - d3) + (d5 - d6);
+
+        if(s !== 0) {
+            w = (d4 - d3) / s;
+        }else{
+            w = 1;
+        }
+
+        // edge region of BC; barycentric coords (0, 1-w, w)
+
+        result[result_offset] = 0;
+        result[result_offset + 1] = 1 - w;
+
+        return;
+
+    }
+
+    // face region
+    const denom = 1 / (va + vb + vc);
+    const u = va * denom
+    v = vb * denom;
+
+    result[result_offset] = u;
+    result[result_offset + 1] = v;
 }

package/src/engine/Engine.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Engine.d.ts","sourceRoot":"","sources":["../../../src/engine/Engine.js"],"names":[],"mappings":";AAsDA;IAoEI;;;;;;;;OAQG;IACH,8FANW,aAAa,EA4NvB;IA7QD;;;OAGG;IACH,UAFU,eAAe,GAAC,IAAI,CAEd;IAEhB;;;OAGG;IACH,OAFU,WAAW,GAAC,IAAI,CAEb;IAEb,qBAA4B;IAE5B;;;;;;;;;OASG;IACH,0BAFU,uBAAuB,CAEe;IAEhD;;;OAGG;IACH,kBAFU,mBAAmB,CAEO;IAEpC;;;;OAIG;IACH,iBAFU,MAAM,CAEM;IAEtB;;;;OAIG;IACH,mBAFU,kBAAkB,CAEa;IAmBrC;;;OAGG;IACH,yBAAwB;IAKxB;;;OAGG;IACH,aAFU,gBAAgB,CAEe;IAGzC,yCAAkE;IAK9D,mBAAkC;IAMtC;;;OAGG;IACH,cAFU,aAAa,MAAM,CAAC,CAK5B;IAEF,8CAiCE;IA4BF;;;OAGG;IACH,SAFU,WAAW,CAEoB;IAEzC;;;OAGG;IACH,oCAA0C;IAE1C;;;OAGG;IACH,sCAFU,2BAA2B,CAE+B;IAEpE,yBAAoC;IAGpC;;OAEG;IACH,aAAkB;IAElB;;;OAGG;IACH,SAFU,OAAO,CAEwB;IAGzC,2BAAsC;IAuCtC;;;OAGG;IACH,KAFU,SAAS,CAEO;IAE1B;;;OAGG;IACH,uBAFU,YAAY,CAEqD;IAI3E;;;;MAIC;IAWD;;;OAGG;IACH,kBAFU,OAAO,CAEW;IAiGhC,wBAgCC;IApBG,oBAAwB;IAsB5B,2BAgCC;IAED,oBAiBC;IAED;;;OAGG;IACH,+CAUC;IAED,eA6BC;IAED;;;OAGG;IACH,sBAkEC;IAqBD;;OAEG;IACH,sBAkCC;IAED,aAEC;IAED;;OAEG;IACH,4BAOC;IAIL;;;OAGG;IACH,mBAFU,OAAO,CAEQ;;CAPxB;gCAxrB+B,gCAAgC;wBAUxC,wBAAwB;0BApBtB,0CAA0C;wCAcN,iDAAiD;oCAG3E,iCAAiC;mBAElD,wBAAwB;+BArBZ,gDAAgD;iCAO9C,+CAA+C;6BAFnD,yBAAyB;uCAIf,6DAA6D;4BASxE,0BAA0B;+BApBvB,iCAAiC;4CAapB,qDAAqD;AAgBjG;IACI,gDAA2D;IAC3D,0BAAkC;IAClC,iCAAyC;CAC5C;6BAlC4B,sCAAsC;sBA2B7C,mBAAmB;yBAJhB,yBAAyB;8BALpB,kCAAkC;2BADrC,mCAAmC;8BADhC,kCAAkC;sBAZ1C,+BAA+B;+BAKtB,qCAAqC;8BAItC,wBAAwB;4BAX1B,kCAAkC;oBAH1C,yBAAyB"}
+{"version":3,"file":"Engine.d.ts","sourceRoot":"","sources":["../../../src/engine/Engine.js"],"names":[],"mappings":";AAsDA;IAoEI;;;;;;;;OAQG;IACH,8FANW,aAAa,EA4NvB;IA7QD;;;OAGG;IACH,UAFU,eAAe,GAAC,IAAI,CAEd;IAEhB;;;OAGG;IACH,OAFU,WAAW,GAAC,IAAI,CAEb;IAEb,qBAA4B;IAE5B;;;;;;;;;OASG;IACH,0BAFU,uBAAuB,CAEe;IAEhD;;;OAGG;IACH,kBAFU,mBAAmB,CAEO;IAEpC;;;;OAIG;IACH,iBAFU,MAAM,CAEM;IAEtB;;;;OAIG;IACH,mBAFU,kBAAkB,CAEa;IAmBrC;;;OAGG;IACH,yBAAwB;IAKxB;;;OAGG;IACH,aAFU,gBAAgB,CAEe;IAGzC,yCAAkE;IAK9D,mBAAkC;IAMtC;;;OAGG;IACH,cAFU,aAAa,MAAM,CAAC,CAK5B;IAEF,8CAiCE;IA4BF;;;OAGG;IACH,SAFU,WAAW,CAEoB;IAEzC;;;OAGG;IACH,oCAA0C;IAE1C;;;OAGG;IACH,sCAFU,2BAA2B,CAE+B;IAEpE,yBAAoC;IAGpC;;OAEG;IACH,aAAkB;IAElB;;;OAGG;IACH,SAFU,OAAO,CAEwB;IAGzC,2BAAsC;IAuCtC;;;OAGG;IACH,KAFU,SAAS,CAEO;IAE1B;;;OAGG;IACH,uBAFU,YAAY,CAEqD;IAI3E;;;;MAIC;IAWD;;;OAGG;IACH,kBAFU,OAAO,CAEW;IAgGhC,wBAgCC;IApBG,oBAAwB;IAsB5B,2BAgCC;IAED,oBAiBC;IAED;;;OAGG;IACH,+CAUC;IAED,eA6BC;IAED;;;OAGG;IACH,sBAkEC;IAqBD;;OAEG;IACH,sBAkCC;IAED,aAEC;IAED;;OAEG;IACH,4BAOC;IAIL;;;OAGG;IACH,mBAFU,OAAO,CAEQ;;CAPxB;gCAvrB+B,gCAAgC;wBAUxC,wBAAwB;0BApBtB,0CAA0C;wCAcN,iDAAiD;oCAG3E,iCAAiC;mBAElD,wBAAwB;+BArBZ,gDAAgD;iCAO9C,+CAA+C;6BAFnD,yBAAyB;uCAIf,6DAA6D;4BASxE,0BAA0B;+BApBvB,iCAAiC;4CAapB,qDAAqD;AAgBjG;IACI,gDAA2D;IAC3D,0BAAkC;IAClC,iCAAyC;CAC5C;6BAlC4B,sCAAsC;sBA2B7C,mBAAmB;yBAJhB,yBAAyB;8BALpB,kCAAkC;2BADrC,mCAAmC;8BADhC,kCAAkC;sBAZ1C,+BAA+B;+BAKtB,qCAAqC;8BAItC,wBAAwB;4BAX1B,kCAAkC;oBAH1C,yBAAyB"}

package/src/engine/Engine.js

@@ -405,8 +405,7 @@ class Engine {
     }
 
     /**
-     *
-     * @param {WebGLContextFailureReason} reason
+     * @param {ShadeDeviceFailure} reason carries a message written to be shown to a person
      */
     #handle_context_failed(reason) {
         logger.error(`Graphics context recovery abandoned (${reason}), no further rendering is possible`);