@woosh/meep-engine 2.169.1 → 2.169.2

package/src/core/bvh2/bvh3/query/bvh_query_user_data_ray_segment.js

@@ -1,100 +1,100 @@
-import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
-import { aabb3_intersects_ray_segment } from "../../../geom/3d/aabb/aabb3_intersects_ray_segment.js";
-import { COLUMN_CHILD_1, COLUMN_CHILD_2, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
-
-const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
-
-/**
- *
- * @param {number[]|Uint32Array} result
- * @param {number} result_offset
- * @param {BVH} bvh
- * @param {number} root
- * @param {number} origin_x
- * @param {number} origin_y
- * @param {number} origin_z
- * @param {number} direction_x
- * @param {number} direction_y
- * @param {number} direction_z
- * @param {number} t_min
- * @param {number} t_max
- * @returns {number}
- */
-export function bvh_query_user_data_ray_segment(
-    result, result_offset,
-    bvh, root,
-    origin_x, origin_y, origin_z,
-    direction_x, direction_y, direction_z,
-    t_min, t_max
-) {
-
-    if (root === NULL_NODE) {
-        return 0;
-    }
-
-    /**
-     * Move stack pointer to local variable scope to avoid de-referencing inside the loop
-     * @type {number}
-     */
-    let pointer = stack.pointer;
-
-    /**
-     *
-     * @type {number}
-     */
-    const stack_top = pointer;
-
-    stack[pointer++] = root;
-
-    let result_cursor = result_offset;
-
-    /*
-     For performance, we bind data directly to avoid extra copies required to read out AABB
-     */
-    const float32 = bvh.__data_float32;
-    const uint32 = bvh.__data_uint32;
-
-    do {
-        --pointer;
-
-        /**
-         *
-         * @type {number}
-         */
-        const node = stack[pointer];
-
-        const address = node * ELEMENT_WORD_COUNT;
-
-        // test node against the ray
-        const intersects = aabb3_intersects_ray_segment(
-            float32[address], float32[address + 1], float32[address + 2],
-            float32[address + 3], float32[address + 4], float32[address + 5],
-            origin_x, origin_y, origin_z,
-            1 / direction_x, 1 / direction_y, 1 / direction_z,
-            t_min, t_max
-        );
-
-        if (!intersects) {
-            continue;
-        }
-
-        // get fist child to check if this is a leaf node or not
-        const child_1 = uint32[address + COLUMN_CHILD_1];
-
-        if (child_1 !== NULL_NODE) {
-
-            // this is not a leaf node, push children onto traversal stack
-            const child_2 = uint32[address + COLUMN_CHILD_2];
-
-            stack[pointer++] = child_2;
-            stack[pointer++] = child_1;
-
-        } else {
-            // leaf node
-
-            result[result_cursor++] = uint32[address + COLUMN_USER_DATA];
-        }
-    } while (pointer > stack_top);
-
-    return result_cursor - result_offset;
-}
+import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { aabb3_intersects_ray_segment } from "../../../geom/3d/aabb/aabb3_intersects_ray_segment.js";
+import { COLUMN_CHILD_1, COLUMN_CHILD_2, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
+
+const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
+
+/**
+ *
+ * @param {number[]|Uint32Array} result
+ * @param {number} result_offset
+ * @param {BVH} bvh
+ * @param {number} root
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} origin_z
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} direction_z
+ * @param {number} t_min
+ * @param {number} t_max
+ * @returns {number}
+ */
+export function bvh_query_user_data_ray_segment(
+    result, result_offset,
+    bvh, root,
+    origin_x, origin_y, origin_z,
+    direction_x, direction_y, direction_z,
+    t_min, t_max
+) {
+
+    if (root === NULL_NODE) {
+        return 0;
+    }
+
+    /**
+     * Move stack pointer to local variable scope to avoid de-referencing inside the loop
+     * @type {number}
+     */
+    let pointer = stack.pointer;
+
+    /**
+     *
+     * @type {number}
+     */
+    const stack_top = pointer;
+
+    stack[pointer++] = root;
+
+    let result_cursor = result_offset;
+
+    /*
+     For performance, we bind data directly to avoid extra copies required to read out AABB
+     */
+    const float32 = bvh.__data_float32;
+    const uint32 = bvh.__data_uint32;
+
+    do {
+        --pointer;
+
+        /**
+         *
+         * @type {number}
+         */
+        const node = stack[pointer];
+
+        const address = node * ELEMENT_WORD_COUNT;
+
+        // test node against the ray
+        const intersects = aabb3_intersects_ray_segment(
+            float32[address], float32[address + 1], float32[address + 2],
+            float32[address + 3], float32[address + 4], float32[address + 5],
+            origin_x, origin_y, origin_z,
+            1 / direction_x, 1 / direction_y, 1 / direction_z,
+            t_min, t_max
+        );
+
+        if (!intersects) {
+            continue;
+        }
+
+        // get fist child to check if this is a leaf node or not
+        const child_1 = uint32[address + COLUMN_CHILD_1];
+
+        if (child_1 !== NULL_NODE) {
+
+            // this is not a leaf node, push children onto traversal stack
+            const child_2 = uint32[address + COLUMN_CHILD_2];
+
+            stack[pointer++] = child_2;
+            stack[pointer++] = child_1;
+
+        } else {
+            // leaf node
+
+            result[result_cursor++] = uint32[address + COLUMN_USER_DATA];
+        }
+    } while (pointer > stack_top);
+
+    return result_cursor - result_offset;
+}

package/src/core/bvh2/bvh3/query/compute_tight_near_far_clipping_planes.js

@@ -179,9 +179,9 @@ export function compute_tight_near_far_clipping_planes(
             const child1 = bvh.node_get_child1(node);
             const child2 = bvh.node_get_child2(node);
 
-            // write to stack in reverse order, so that fist child ends up being visited first
-            stack[stack.pointer++] = child1;
+            // write to stack in reverse order, so that the first child ends up being visited first
             stack[stack.pointer++] = child2;
+            stack[stack.pointer++] = child1;
 
         } else {
 

package/src/core/bvh8/aabb3_round_to_float32.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Round every component of an AABB to float32 precision, in place.
+ *
+ * The BVH8 node bounds are stored as float32, so a validator comparing a freshly-computed float64
+ * reference box against stored bounds must first drop the reference to the same precision — otherwise
+ * every comparison fails by sub-ULP amounts.
+ *
+ * Shared by the direct and pool-indirect geometry validators, which each carried a byte-identical copy.
+ *
+ * @param {AABB3} aabb mutated in place
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function aabb3_round_to_float32(aabb: AABB3): void;
+//# sourceMappingURL=aabb3_round_to_float32.d.ts.map

package/src/core/bvh8/aabb3_round_to_float32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb3_round_to_float32.d.ts","sourceRoot":"","sources":["../../../../src/core/bvh8/aabb3_round_to_float32.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,0DAOC"}

package/src/core/bvh8/aabb3_round_to_float32.js

@@ -0,0 +1,22 @@
+/**
+ * Round every component of an AABB to float32 precision, in place.
+ *
+ * The BVH8 node bounds are stored as float32, so a validator comparing a freshly-computed float64
+ * reference box against stored bounds must first drop the reference to the same precision — otherwise
+ * every comparison fails by sub-ULP amounts.
+ *
+ * Shared by the direct and pool-indirect geometry validators, which each carried a byte-identical copy.
+ *
+ * @param {AABB3} aabb mutated in place
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function aabb3_round_to_float32(aabb) {
+    aabb.x0 = Math.fround(aabb.x0);
+    aabb.y0 = Math.fround(aabb.y0);
+    aabb.z0 = Math.fround(aabb.z0);
+    aabb.x1 = Math.fround(aabb.x1);
+    aabb.y1 = Math.fround(aabb.y1);
+    aabb.z1 = Math.fround(aabb.z1);
+}

package/src/core/bvh8/bvh8_geometry_validate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bvh8_geometry_validate.d.ts","sourceRoot":"","sources":["../../../../src/core/bvh8/bvh8_geometry_validate.js"],"names":[],"mappings":"AAuGA;;;;;;;;;;;;;GAaG;AACH,+DAHW,MAAM,EAAE,kBACR,MAAM,EAAE,QAiClB"}
+{"version":3,"file":"bvh8_geometry_validate.d.ts","sourceRoot":"","sources":["../../../../src/core/bvh8/bvh8_geometry_validate.js"],"names":[],"mappings":"AA4FA;;;;;;;;;;;;;GAaG;AACH,+DAHW,MAAM,EAAE,kBACR,MAAM,EAAE,QAiClB"}

package/src/core/bvh8/bvh8_geometry_validate.js

@@ -1,3 +1,4 @@
+import { aabb3_round_to_float32 } from "./aabb3_round_to_float32.js";
 import { bitCount } from "../binary/operations/bitCount.js";
 import { AABB3 } from "../geom/3d/aabb/AABB3.js";
 import { aabb3_from_v3_array } from "../geom/3d/aabb/aabb3_from_v3_array.js";
@@ -6,18 +7,6 @@ import { aabb3_from_triangle_by_index } from "./build/aabb3_from_triangle_by_ind
 import { bvh8_collect_primitives } from "./bvh8_count_primitives.js";
 import { bvh8_get_node_child_bounds } from "./bvh8_get_node_child_bounds.js";
 
-/**
- *
- * @param {AABB3} aabb
- */
-function aabb3_round_to_float32(aabb) {
-    aabb.x0 = Math.fround(aabb.x0);
-    aabb.y0 = Math.fround(aabb.y0);
-    aabb.z0 = Math.fround(aabb.z0);
-    aabb.x1 = Math.fround(aabb.x1);
-    aabb.y1 = Math.fround(aabb.y1);
-    aabb.z1 = Math.fround(aabb.z1);
-}
 
 /**
  *

package/src/core/bvh8/bvh8_geometry_validate_indirect.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bvh8_geometry_validate_indirect.d.ts","sourceRoot":"","sources":["../../../../src/core/bvh8/bvh8_geometry_validate_indirect.js"],"names":[],"mappings":"AA0GA;;;;;;;;;;;;;GAaG;AACH,wEAHW,MAAM,EAAE,kBACR,MAAM,EAAE,QA0DlB"}
+{"version":3,"file":"bvh8_geometry_validate_indirect.d.ts","sourceRoot":"","sources":["../../../../src/core/bvh8/bvh8_geometry_validate_indirect.js"],"names":[],"mappings":"AA+FA;;;;;;;;;;;;;GAaG;AACH,wEAHW,MAAM,EAAE,kBACR,MAAM,EAAE,QA0DlB"}

package/src/core/bvh8/bvh8_geometry_validate_indirect.js

@@ -1,3 +1,4 @@
+import { aabb3_round_to_float32 } from "./aabb3_round_to_float32.js";
 import { bitCount } from "../binary/operations/bitCount.js";
 import { AABB3 } from "../geom/3d/aabb/AABB3.js";
 import { aabb3_from_v3_array } from "../geom/3d/aabb/aabb3_from_v3_array.js";
@@ -6,18 +7,6 @@ import { aabb3_from_triangle_by_index } from "./build/aabb3_from_triangle_by_ind
 import { bvh8_collect_primitives } from "./bvh8_count_primitives.js";
 import { bvh8_get_node_child_bounds } from "./bvh8_get_node_child_bounds.js";
 
-/**
- *
- * @param {AABB3} aabb
- */
-function aabb3_round_to_float32(aabb) {
-    aabb.x0 = Math.fround(aabb.x0);
-    aabb.y0 = Math.fround(aabb.y0);
-    aabb.z0 = Math.fround(aabb.z0);
-    aabb.x1 = Math.fround(aabb.x1);
-    aabb.y1 = Math.fround(aabb.y1);
-    aabb.z1 = Math.fround(aabb.z1);
-}
 
 /**
  *

package/src/core/cache/Cache.d.ts

@@ -83,6 +83,19 @@ export class Cache<Key, Value> {
      * @param {CacheElement<Key,Value>} element
      * @private
      */
+    /**
+     * Move `element` to the head of the MRU list.
+     *
+     * DUPLICATED, KNOWINGLY: {@link CacheRegionWTinylfu#touch} is the same splice. Both are thin wrappers
+     * around {@link CacheElement#unlink} plus head/tail fix-up, and the invariant they encode is that a
+     * node which IS the head must not be re-linked and a node which IS the tail must move the tail back
+     * before unlinking. Factoring this into a shared IntrusiveMruList would re-home ~22 private-field
+     * accesses in each class, including the eviction and iteration paths; that is worth doing on its own,
+     * with its own review, rather than as part of a bulk de-duplication.
+     *
+     * @param {CacheElement} element
+     * @private
+     */
     private __promote;
     /**
      * Number of elements stored in cache

package/src/core/cache/Cache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Cache.d.ts","sourceRoot":"","sources":["../../../../src/core/cache/Cache.js"],"names":[],"mappings":"AAUA;;;;;;;;;;;;;;;;;;;GAmBG;AACH;IAgBI;;;;;;;;;;OAUG;IACH,sGARW,MAAM,EA2FhB;IAzDG;;;;OAIG;IACH,mBAA4B;IAE5B;;;;OAIG;IACH,qBAAgC;IAEhC;;;;OAIG;IACH,gBAAmB;IACnB;;;;OAIG;IACH,eAAkB;IAGlB;;;;OAIG;IACH,aAIE;IAEF;;;;OAIG;IACH,eAA6B;IAE7B;;;OAGG;IACH,eAA6B;IAE7B;;;OAGG;IACH,WAAyB;IAG7B;;;;;OAKG;IACH,kBAqBC;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;OAEG;IACH,+BAEC;IAED;;;;;OAKG;IACH,qBAEC;IAED;;;OAGG;IACH,2BAeC;IAED,wBAEC;IAED;;;;OAIG;IACH,wBAaC;IAED;;;;;;OAMG;IACH,yBAHW,GAAG,GACD,OAAO,CAgCnB;IAED;;;;;OAKG;IACH,6BAUC;IAED;;;OAGG;IACH,sBAFa,aAAa,GAAG,EAAC,KAAK,CAAC,GAAC,IAAI,CAIxC;IAED;;;OAGG;IACH,YAFa,OAAO,CAkBnB;IAED;;;OAGG;IACH,gCAFW,MAAM,QAWhB;IAED;;;;OAIG;IACH,SAHW,GAAG,SACH,KAAK,QA+Ef;IAED;;;;OAIG;IACH,cAHW,GAAG,GACD,OAAO,CAInB;IAED;;;;OAIG;IACH,SAHW,GAAG,GACD,KAAK,GAAC,IAAI,CAYtB;IAGD;;;;;;OAMG;IACH,kBALW,GAAG,kBACM,GAAG,KAAE,KAAK,0BAElB,KAAK,CAchB;IAED;;;;OAIG;IACH,wBAqBC;IAED;;;;OAIG;IACH,YAHW,GAAG,GACD,OAAO,CAgBnB;IAED;;;;;OAKG;IACH,kBAHW,GAAG,GACD,OAAO,CAanB;IAED;;;;OAIG;IACH,cAcC;IAED;;;OAGG;IACH,aAOC;IAED;;;;;OAKG;IACH,6BAJqB,MAAM,OAAO,GAAG,SAAS,KAAK,KAAK,IAAI,kBAE/C,OAAO,CAMnB;IAGL;;;OAGG;IACH,6CAAmB;IAEnB;;;OAGG;IACH,+BA9FiB,OAAO,CA8FF;IAEtB;;;OAGG;IACH,4BAhLiB,OAAO,CAgLL;;CAlBlB;6BApkB4B,mBAAmB"}
+{"version":3,"file":"Cache.d.ts","sourceRoot":"","sources":["../../../../src/core/cache/Cache.js"],"names":[],"mappings":"AAUA;;;;;;;;;;;;;;;;;;;GAmBG;AACH;IAgBI;;;;;;;;;;OAUG;IACH,sGARW,MAAM,EA2FhB;IAzDG;;;;OAIG;IACH,mBAA4B;IAE5B;;;;OAIG;IACH,qBAAgC;IAEhC;;;;OAIG;IACH,gBAAmB;IACnB;;;;OAIG;IACH,eAAkB;IAGlB;;;;OAIG;IACH,aAIE;IAEF;;;;OAIG;IACH,eAA6B;IAE7B;;;OAGG;IACH,eAA6B;IAE7B;;;OAGG;IACH,WAAyB;IAG7B;;;;;OAKG;IACH;;;;;;;;;;;;OAYG;IACH,kBAqBC;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;OAEG;IACH,+BAEC;IAED;;;;;OAKG;IACH,qBAEC;IAED;;;OAGG;IACH,2BAeC;IAED,wBAEC;IAED;;;;OAIG;IACH,wBAaC;IAED;;;;;;OAMG;IACH,yBAHW,GAAG,GACD,OAAO,CAgCnB;IAED;;;;;OAKG;IACH,6BAUC;IAED;;;OAGG;IACH,sBAFa,aAAa,GAAG,EAAC,KAAK,CAAC,GAAC,IAAI,CAIxC;IAED;;;OAGG;IACH,YAFa,OAAO,CAkBnB;IAED;;;OAGG;IACH,gCAFW,MAAM,QAWhB;IAED;;;;OAIG;IACH,SAHW,GAAG,SACH,KAAK,QA+Ef;IAED;;;;OAIG;IACH,cAHW,GAAG,GACD,OAAO,CAInB;IAED;;;;OAIG;IACH,SAHW,GAAG,GACD,KAAK,GAAC,IAAI,CAYtB;IAGD;;;;;;OAMG;IACH,kBALW,GAAG,kBACM,GAAG,KAAE,KAAK,0BAElB,KAAK,CAchB;IAED;;;;OAIG;IACH,wBAqBC;IAED;;;;OAIG;IACH,YAHW,GAAG,GACD,OAAO,CAgBnB;IAED;;;;;OAKG;IACH,kBAHW,GAAG,GACD,OAAO,CAanB;IAED;;;;OAIG;IACH,cAcC;IAED;;;OAGG;IACH,aAOC;IAED;;;;;OAKG;IACH,6BAJqB,MAAM,OAAO,GAAG,SAAS,KAAK,KAAK,IAAI,kBAE/C,OAAO,CAMnB;IAGL;;;OAGG;IACH,6CAAmB;IAEnB;;;OAGG;IACH,+BA9FiB,OAAO,CA8FF;IAEtB;;;OAGG;IACH,4BAhLiB,OAAO,CAgLL;;CAlBlB;6BAjlB4B,mBAAmB"}

package/src/core/cache/Cache.js

@@ -146,6 +146,19 @@ export class Cache {
      * @param {CacheElement<Key,Value>} element
      * @private
      */
+    /**
+     * Move `element` to the head of the MRU list.
+     *
+     * DUPLICATED, KNOWINGLY: {@link CacheRegionWTinylfu#touch} is the same splice. Both are thin wrappers
+     * around {@link CacheElement#unlink} plus head/tail fix-up, and the invariant they encode is that a
+     * node which IS the head must not be re-linked and a node which IS the tail must move the tail back
+     * before unlinking. Factoring this into a shared IntrusiveMruList would re-home ~22 private-field
+     * accesses in each class, including the eviction and iteration paths; that is worth doing on its own,
+     * with its own review, rather than as part of a bulk de-duplication.
+     *
+     * @param {CacheElement} element
+     * @private
+     */
     __promote(element) {
         if (element === this.__first) {
             // already at the front

package/src/core/color/operations/color_darken.d.ts

@@ -1,9 +1,12 @@
 /**
+ * Darken a colour by scaling its OkHSV value channel down.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
  *
  * @param {Color} input
  * @param {number} [amount]
- * @returns {Color}
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
  */
 export function color_darken(input: Color, amount?: number): Color;
-import { Color } from "../Color.js";
 //# sourceMappingURL=color_darken.d.ts.map

package/src/core/color/operations/color_darken.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"color_darken.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_darken.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,oCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAoBjB;sBA9BqB,aAAa"}
+{"version":3,"file":"color_darken.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_darken.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,oDAHW,MAAM,SAahB"}

package/src/core/color/operations/color_darken.js

@@ -1,33 +1,24 @@
-import { assert } from "../../assert.js";
-import { clamp01 } from "../../math/clamp01.js";
-import { Color } from "../Color.js";
-import { linear_srgb_to_okhsv } from "../oklab/linear_srgb_to_okhsv.js";
-import { okhsv_to_linear_srgb } from "../oklab/okhsv_to_linear_srgb.js";
-
-const hsv = [0, 0, 0];
-
-/**
- *
- * @param {Color} input
- * @param {number} [amount]
- * @returns {Color}
- */
-export function color_darken(input, amount = 1) {
-    assert.isNumber(amount, 'amount');
-    assert.greaterThanOrEqual(amount, 0, 'amount');
-
-    if(amount === 0){
-        // skip allocation
-        return input;
-    }
-
-    const r = new Color();
-
-    linear_srgb_to_okhsv(hsv, input.r, input.g, input.b);
-
-    hsv[2] = clamp01(hsv[2] * clamp01(1 - amount));
-
-    okhsv_to_linear_srgb(r, ...hsv);
-
-    return r;
-}
+import { assert } from "../../assert.js";
+import { OKHSV_CHANNEL_VALUE, color_scale_okhsv_channel } from "./color_scale_okhsv_channel.js";
+
+/**
+ * Darken a colour by scaling its OkHSV value channel down.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
+ *
+ * @param {Color} input
+ * @param {number} [amount]
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
+ */
+export function color_darken(input, amount = 1) {
+    assert.isNumber(amount, 'amount');
+    assert.greaterThanOrEqual(amount, 0, 'amount');
+
+    if (amount === 0) {
+        // skip allocation, no change
+        return input;
+    }
+
+    return color_scale_okhsv_channel(input, OKHSV_CHANNEL_VALUE, 1 - amount);
+}

package/src/core/color/operations/color_desaturate.d.ts

@@ -1,9 +1,12 @@
 /**
+ * Desaturate a colour by scaling its OkHSV saturation channel down.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
  *
  * @param {Color} input
  * @param {number} [amount]
- * @returns {Color}
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
  */
 export function color_desaturate(input: Color, amount?: number): Color;
-import { Color } from "../Color.js";
 //# sourceMappingURL=color_desaturate.d.ts.map

package/src/core/color/operations/color_desaturate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"color_desaturate.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_desaturate.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,wCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAoBjB;sBA9BqB,aAAa"}
+{"version":3,"file":"color_desaturate.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_desaturate.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,wDAHW,MAAM,SAahB"}

package/src/core/color/operations/color_desaturate.js

@@ -1,33 +1,24 @@
-import { assert } from "../../assert.js";
-import { clamp01 } from "../../math/clamp01.js";
-import { Color } from "../Color.js";
-import { linear_srgb_to_okhsv } from "../oklab/linear_srgb_to_okhsv.js";
-import { okhsv_to_linear_srgb } from "../oklab/okhsv_to_linear_srgb.js";
-
-const hsv = [0, 0, 0];
-
-/**
- *
- * @param {Color} input
- * @param {number} [amount]
- * @returns {Color}
- */
-export function color_desaturate(input, amount = 1) {
-    assert.isNumber(amount, 'amount');
-    assert.greaterThanOrEqual(amount, 0, 'amount');
-
-    if (amount === 0) {
-        // no change
-        return input;
-    }
-
-    const r = new Color();
-
-    linear_srgb_to_okhsv(hsv, input.r, input.g, input.b);
-
-    hsv[1] = clamp01(hsv[1] * (1 - amount));
-
-    okhsv_to_linear_srgb(r, ...hsv);
-
-    return r;
-}
+import { assert } from "../../assert.js";
+import { OKHSV_CHANNEL_SATURATION, color_scale_okhsv_channel } from "./color_scale_okhsv_channel.js";
+
+/**
+ * Desaturate a colour by scaling its OkHSV saturation channel down.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
+ *
+ * @param {Color} input
+ * @param {number} [amount]
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
+ */
+export function color_desaturate(input, amount = 1) {
+    assert.isNumber(amount, 'amount');
+    assert.greaterThanOrEqual(amount, 0, 'amount');
+
+    if (amount === 0) {
+        // skip allocation, no change
+        return input;
+    }
+
+    return color_scale_okhsv_channel(input, OKHSV_CHANNEL_SATURATION, 1 - amount);
+}

package/src/core/color/operations/color_lighten.d.ts

@@ -1,9 +1,12 @@
 /**
+ * Lighten a colour by scaling its OkHSV value channel up.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
  *
  * @param {Color} input
  * @param {number} [amount]
- * @returns {Color}
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
  */
 export function color_lighten(input: Color, amount?: number): Color;
-import { Color } from "../Color.js";
 //# sourceMappingURL=color_lighten.d.ts.map

package/src/core/color/operations/color_lighten.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"color_lighten.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_lighten.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,qCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAoBjB;sBA9BqB,aAAa"}
+{"version":3,"file":"color_lighten.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_lighten.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,qDAHW,MAAM,SAahB"}

package/src/core/color/operations/color_lighten.js

@@ -1,33 +1,24 @@
-import { assert } from "../../assert.js";
-import { clamp01 } from "../../math/clamp01.js";
-import { Color } from "../Color.js";
-import { linear_srgb_to_okhsv } from "../oklab/linear_srgb_to_okhsv.js";
-import { okhsv_to_linear_srgb } from "../oklab/okhsv_to_linear_srgb.js";
-
-const hsv = [0, 0, 0];
-
-/**
- *
- * @param {Color} input
- * @param {number} [amount]
- * @returns {Color}
- */
-export function color_lighten(input, amount = 1) {
-    assert.isNumber(amount, 'amount');
-    assert.greaterThanOrEqual(amount, 0, 'amount');
-
-    if (amount === 0) {
-        // skip allocation, no change
-        return input;
-    }
-
-    const r = new Color();
-
-    linear_srgb_to_okhsv(hsv, input.r, input.g, input.b);
-
-    hsv[2] = clamp01(hsv[2] * (1 + amount));
-
-    okhsv_to_linear_srgb(r, ...hsv);
-
-    return r;
-}
+import { assert } from "../../assert.js";
+import { OKHSV_CHANNEL_VALUE, color_scale_okhsv_channel } from "./color_scale_okhsv_channel.js";
+
+/**
+ * Lighten a colour by scaling its OkHSV value channel up.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
+ *
+ * @param {Color} input
+ * @param {number} [amount]
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
+ */
+export function color_lighten(input, amount = 1) {
+    assert.isNumber(amount, 'amount');
+    assert.greaterThanOrEqual(amount, 0, 'amount');
+
+    if (amount === 0) {
+        // skip allocation, no change
+        return input;
+    }
+
+    return color_scale_okhsv_channel(input, OKHSV_CHANNEL_VALUE, 1 + amount);
+}

package/src/core/color/operations/color_saturate.d.ts

@@ -1,9 +1,12 @@
 /**
+ * Saturate a colour by scaling its OkHSV saturation channel up.
+ *
+ * `amount` of 0 is a no-op and returns `input` itself rather than a copy. The scaled channel is clamped to
+ * `[0, 1]`, so an `amount` beyond the useful range saturates rather than wrapping.
  *
  * @param {Color} input
  * @param {number} [amount]
- * @returns {Color}
+ * @returns {Color} `input` when `amount` is 0, otherwise a new Color
  */
 export function color_saturate(input: Color, amount?: number): Color;
-import { Color } from "../Color.js";
 //# sourceMappingURL=color_saturate.d.ts.map

package/src/core/color/operations/color_saturate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"color_saturate.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_saturate.js"],"names":[],"mappings":"AAQA;;;;;GAKG;AACH,sCAJW,KAAK,WACL,MAAM,GACJ,KAAK,CAoBjB;sBA9BqB,aAAa"}
+{"version":3,"file":"color_saturate.d.ts","sourceRoot":"","sources":["../../../../../src/core/color/operations/color_saturate.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,sDAHW,MAAM,SAahB"}