@thi.ng/boids 1.1.9 → 1.1.11

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2025-06-09T17:24:08Z
+- **Last updated**: 2025-06-24T21:39:38Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.
@@ -11,6 +11,14 @@ See [Conventional Commits](https://conventionalcommits.org/) for commit guidelin
 **Note:** Unlisted _patch_ versions only involve non-code or otherwise excluded changes
 and/or version bumps of transitive dependencies.
 
+### [1.1.10](https://github.com/thi-ng/umbrella/tree/@thi.ng/boids@1.1.10) (2025-06-19)
+
+#### ⏱ Performance improvements
+
+- various minor optimizations ([f47c986](https://github.com/thi-ng/umbrella/commit/f47c986))
+  - hoist local vars in hotspots
+  - update Radial.setRadius() to avoid distance calc if possible
+
 ### [1.1.4](https://github.com/thi-ng/umbrella/tree/@thi.ng/boids@1.1.4) (2025-05-12)
 
 #### ⏱ Performance improvements

package/README.md

@@ -111,7 +111,7 @@ For Node.js REPL:
 const boids = await import("@thi.ng/boids");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 1.97 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 2.00 KB
 
 ## Dependencies
 

package/accel.js

@@ -5,7 +5,10 @@ const noAccel = () => {
       boids = $boids;
     },
     queryNeighborhood(neighborhood) {
-      for (let b of boids) neighborhood.consider(b.pos.curr, b);
+      for (let i = 0, n = boids.length; i < n; i++) {
+        const b = boids[i];
+        neighborhood.consider(b.pos.curr, b);
+      }
       return neighborhood;
     }
   };

package/behaviors/alignment.js

@@ -8,9 +8,10 @@ const alignment = (maxDist, weight = 1, amp) => {
       const { add, maddN, setN } = boid.api;
       const neighbors = boid.neighbors($maxDist(boid), boid.pos.curr);
       const num = neighbors.length;
+      let i, n;
       setN(force, 0);
-      for (let i = 0; i < num; i++) {
-        const n = neighbors[i];
+      for (i = 0; i < num; i++) {
+        n = neighbors[i];
         if (n !== boid) {
           amp ? maddN(force, n.vel.curr, amp(boid, n), force) : add(force, force, n.vel.curr);
         }

package/behaviors/cohesion.js

@@ -8,10 +8,10 @@ const cohesion = (maxDist, weight = 1, pred = () => true) => {
       const { add, mulN, setN } = boid.api;
       const neighbors = boid.neighbors($maxDist(boid), boid.pos.curr);
       setN(centroid, 0);
-      let used = 0;
       const num = neighbors.length;
-      for (let i = 0; i < num; i++) {
-        const n = neighbors[i];
+      let used = 0, i, n;
+      for (i = 0; i < num; i++) {
+        n = neighbors[i];
         if (n !== boid && pred(boid, n)) {
           add(centroid, centroid, n.pos.curr);
           used++;

package/behaviors/separation.js

@@ -1,5 +1,5 @@
 import { __ensureFn } from "../internal/ensure.js";
-const separation = (minDist, weight = 1, amp) => {
+const separation = (minDist, weight = 1, amp = () => 1) => {
   const $minDist = __ensureFn(minDist);
   const force = [];
   const delta = [];
@@ -19,7 +19,7 @@ const separation = (minDist, weight = 1, amp) => {
           maddN(
             force,
             delta,
-            (amp?.(boid, n) ?? 1) / (magSq(delta) + 1e-6),
+            amp(boid, n) / (magSq(delta) + 1e-6),
             force
           );
         }

package/behaviors/update.js

@@ -5,9 +5,10 @@ const blendedBehaviorUpdate = (boid) => {
     force
   } = boid;
   setN(force, 0);
-  for (let i = 0, n = behaviors.length; i < n; i++) {
-    const behavior = behaviors[i];
-    const weight = behavior.weight(boid);
+  let i, n, weight, behavior;
+  for (i = 0, n = behaviors.length; i < n; i++) {
+    behavior = behaviors[i];
+    weight = behavior.weight(boid);
     if (weight !== 0) maddN(force, behavior.update(boid), weight, force);
   }
   return force;

package/constrain.js

@@ -1,10 +1,9 @@
-import { wrapOnce } from "@thi.ng/math/interval";
 import { clamp2 as $clamp2, clamp3 as $clamp3 } from "@thi.ng/vectors/clamp";
 const clamp2 = (min, max) => (p) => $clamp2(p, p, min, max);
 const clamp3 = (min, max) => (p) => $clamp3(p, p, min, max);
 const __wrap = (p, i, x, min, max) => {
   if (x < min || x > max) {
-    p[i] = wrapOnce(x, min, max);
+    p[i] = x < min ? x - min + max : x > max ? x - max + min : x;
     return true;
   }
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/boids",
-  "version": "1.1.9",
+  "version": "1.1.11",
   "description": "n-dimensional boids simulation with modular behavior system",
   "type": "module",
   "module": "./index.js",
@@ -41,7 +41,7 @@
   "dependencies": {
     "@thi.ng/api": "^8.11.29",
     "@thi.ng/checks": "^3.7.9",
-    "@thi.ng/distance": "^3.0.1",
+    "@thi.ng/distance": "^3.0.2",
     "@thi.ng/geom-closest-point": "^2.1.176",
     "@thi.ng/geom-resample": "^3.0.48",
     "@thi.ng/math": "^5.11.29",
@@ -147,5 +147,5 @@
     "status": "alpha",
     "year": 2023
   },
-  "gitHead": "b076434a497b291ad33e81b1a15f6a71e2c82cc2\n"
+  "gitHead": "45e91ee75236e39fc87ea10fbabac1272bef62e3\n"
 }

package/region.d.ts

@@ -16,7 +16,7 @@ export declare class Radial<T> implements INeighborhood<ReadonlyVec, T>, IDeref<
     constructor(dist: IDistance<ReadonlyVec>, target: ReadonlyVec, radius?: number);
     deref(): T[];
     reset(): this;
-    setRadius(r: number): void;
+    setRadius(r: number): this;
     includesDistance(d: number, eucledian?: boolean): boolean;
     includesPosition(pos: ReadonlyVec): boolean;
     consider(pos: ReadonlyVec, val: T): number;

package/region.js

@@ -3,9 +3,9 @@ class Radial {
   constructor(dist, target, radius = Infinity) {
     this.dist = dist;
     this.target = target;
-    this.radius = radius;
     this.setRadius(radius);
   }
+  radius;
   _r;
   _items = [];
   deref() {
@@ -16,9 +16,12 @@ class Radial {
     return this;
   }
   setRadius(r) {
-    this.radius = Math.max(0, r);
-    this._r = this.dist.to(this.radius);
-    this.reset();
+    if (this.radius !== r) {
+      this.radius = Math.max(0, r);
+      this._r = this.dist.to(this.radius);
+    }
+    this._items.length = 0;
+    return this;
   }
   includesDistance(d, eucledian = true) {
     return (eucledian ? this.dist.to(d) : d) <= this._r;