@newkrok/nape-js 3.16.1 → 3.17.0

package/README.md

@@ -9,10 +9,13 @@
 [![CI](https://github.com/NewKrok/nape-js/actions/workflows/ci.yml/badge.svg)](https://github.com/NewKrok/nape-js/actions/workflows/ci.yml)
 [![bundle size](https://img.shields.io/badge/gzip-16%20KB-blue.svg)](https://github.com/NewKrok/nape-js)
 [![license](https://img.shields.io/npm/l/@newkrok/nape-js.svg)](https://github.com/NewKrok/nape-js/blob/master/LICENSE)
+[![docs](https://img.shields.io/badge/docs-online-blue.svg)](https://newkrok.github.io/nape-js/)
 
 Fully typed, tree-shakeable 2D physics engine — a modern TypeScript rewrite of the
 [Nape](https://github.com/deltaluca/nape) Haxe physics engine.
 
+**[Homepage & Interactive Demos](https://newkrok.github.io/nape-js/)** | **[API Reference](https://newkrok.github.io/nape-js/api/)** | **[Examples](https://newkrok.github.io/nape-js/examples.html)** | **[Multiplayer Demo](https://newkrok.github.io/nape-js/multiplayer.html)**
+
 - Originally created in Haxe by Luca Deltodesco
 - Ported to TypeScript by Istvan Krisztian Somoracz
 

package/dist/{ConvexResult-CzVZh3d_.d.cts → ConvexResult-DafossGq.d.cts}

@@ -1866,6 +1866,25 @@ declare class Space {
      */
     get deterministic(): boolean;
     set deterministic(value: boolean);
+    /**
+     * Number of sub-steps performed per `step()` call. Each sub-step uses
+     * `deltaTime / subSteps` and the same velocity/position iteration counts.
+     *
+     * Higher values improve simulation stability (stacking, fast objects, joint
+     * stiffness) at the cost of proportionally more CPU time.
+     *
+     * - `1` (default) — standard single-step behaviour, zero overhead.
+     * - `4` — good balance between quality and performance for most games.
+     * - `8+` — high-precision, useful for stiff constraints or very fast objects.
+     *
+     * **Performance:** cost scales linearly — `subSteps = 4` ≈ 4× solver work.
+     * Tip: you can lower `velocityIterations` to compensate (e.g. 10 iter × 1 step
+     * → 3 iter × 4 sub-steps ≈ similar quality at ~1.2× cost).
+     *
+     * @throws If set to a value less than 1 or NaN.
+     */
+    get subSteps(): number;
+    set subSteps(value: number);
     /**
      * Global angular drag coefficient applied to all bodies.
      * @throws If set to NaN.

package/dist/{ConvexResult-CzVZh3d_.d.ts → ConvexResult-DafossGq.d.ts}

@@ -1866,6 +1866,25 @@ declare class Space {
      */
     get deterministic(): boolean;
     set deterministic(value: boolean);
+    /**
+     * Number of sub-steps performed per `step()` call. Each sub-step uses
+     * `deltaTime / subSteps` and the same velocity/position iteration counts.
+     *
+     * Higher values improve simulation stability (stacking, fast objects, joint
+     * stiffness) at the cost of proportionally more CPU time.
+     *
+     * - `1` (default) — standard single-step behaviour, zero overhead.
+     * - `4` — good balance between quality and performance for most games.
+     * - `8+` — high-precision, useful for stiff constraints or very fast objects.
+     *
+     * **Performance:** cost scales linearly — `subSteps = 4` ≈ 4× solver work.
+     * Tip: you can lower `velocityIterations` to compensate (e.g. 10 iter × 1 step
+     * → 3 iter × 4 sub-steps ≈ similar quality at ~1.2× cost).
+     *
+     * @throws If set to a value less than 1 or NaN.
+     */
+    get subSteps(): number;
+    set subSteps(value: number);
     /**
      * Global angular drag coefficient applied to all bodies.
      * @throws If set to NaN.