@flighthq/math 0.1.0

package/dist/numberTheory.d.ts

@@ -0,0 +1,33 @@
+/** Return the factorial of non-negative integer `n`.
+ *
+ *  `factorial(0)` → `1` by convention. Throws for negative inputs or
+ *  non-integer inputs (programmer error). Returns `Infinity` for `n > 170`
+ *  (above IEEE 754 double precision range).
+ */
+export declare function factorial(n: number): number;
+/** Return the greatest common divisor of `a` and `b` (Euclidean algorithm).
+ *
+ *  Operates on the absolute values of the inputs, so negative arguments are
+ *  accepted. Throws when both `a` and `b` are `0` (programmer error — the GCD
+ *  of zero and zero is undefined).
+ */
+export declare function gcd(a: number, b: number): number;
+/** Return the squared distance `x² + y²`.
+ *
+ *  Allocation-free substitute for `Math.hypot(x, y) ** 2` when you only need
+ *  to compare distances. Prefer `hypot2` over `Math.hypot` in hot loops where
+ *  the actual distance value is not needed.
+ */
+export declare function hypot2(x: number, y: number): number;
+/** Return `true` if `n` is even. */
+export declare function isEven(n: number): boolean;
+/** Return `true` if `n` is odd. */
+export declare function isOdd(n: number): boolean;
+/** Return the least common multiple of `a` and `b`.
+ *
+ *  Operates on the absolute values of the inputs. Throws when both `a` and
+ *  `b` are `0` (see `gcd`). For very large inputs, the result may exceed
+ *  `Number.MAX_SAFE_INTEGER` and lose precision.
+ */
+export declare function lcm(a: number, b: number): number;
+//# sourceMappingURL=numberTheory.d.ts.map

package/dist/numberTheory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"numberTheory.d.ts","sourceRoot":"","sources":["../src/numberTheory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAM3C;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAUhD;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED,oCAAoC;AACpC,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAEzC;AAED,mCAAmC;AACnC,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAExC;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAGhD"}

package/dist/numberTheory.js

@@ -0,0 +1,62 @@
+/** Return the factorial of non-negative integer `n`.
+ *
+ *  `factorial(0)` → `1` by convention. Throws for negative inputs or
+ *  non-integer inputs (programmer error). Returns `Infinity` for `n > 170`
+ *  (above IEEE 754 double precision range).
+ */
+export function factorial(n) {
+    if (!Number.isInteger(n) || n < 0)
+        throw new RangeError('factorial: n must be a non-negative integer');
+    if (n === 0 || n === 1)
+        return 1;
+    let result = 1;
+    for (let i = 2; i <= n; i++)
+        result *= i;
+    return result;
+}
+/** Return the greatest common divisor of `a` and `b` (Euclidean algorithm).
+ *
+ *  Operates on the absolute values of the inputs, so negative arguments are
+ *  accepted. Throws when both `a` and `b` are `0` (programmer error — the GCD
+ *  of zero and zero is undefined).
+ */
+export function gcd(a, b) {
+    a = Math.abs(Math.trunc(a));
+    b = Math.abs(Math.trunc(b));
+    if (a === 0 && b === 0)
+        throw new RangeError('gcd: both arguments must not be 0');
+    while (b !== 0) {
+        const t = b;
+        b = a % b;
+        a = t;
+    }
+    return a;
+}
+/** Return the squared distance `x² + y²`.
+ *
+ *  Allocation-free substitute for `Math.hypot(x, y) ** 2` when you only need
+ *  to compare distances. Prefer `hypot2` over `Math.hypot` in hot loops where
+ *  the actual distance value is not needed.
+ */
+export function hypot2(x, y) {
+    return x * x + y * y;
+}
+/** Return `true` if `n` is even. */
+export function isEven(n) {
+    return (n & 1) === 0;
+}
+/** Return `true` if `n` is odd. */
+export function isOdd(n) {
+    return (n & 1) === 1;
+}
+/** Return the least common multiple of `a` and `b`.
+ *
+ *  Operates on the absolute values of the inputs. Throws when both `a` and
+ *  `b` are `0` (see `gcd`). For very large inputs, the result may exceed
+ *  `Number.MAX_SAFE_INTEGER` and lose precision.
+ */
+export function lcm(a, b) {
+    const g = gcd(a, b);
+    return (Math.abs(Math.trunc(a)) / g) * Math.abs(Math.trunc(b));
+}
+//# sourceMappingURL=numberTheory.js.map

package/dist/numberTheory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"numberTheory.js","sourceRoot":"","sources":["../src/numberTheory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,6CAA6C,CAAC,CAAC;IACvG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,MAAM,IAAI,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;IAClF,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAS;IACzC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC;AAED,oCAAoC;AACpC,MAAM,UAAU,MAAM,CAAC,CAAS;IAC9B,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,KAAK,CAAC,CAAS;IAC7B,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;IACtC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC"}

package/dist/random.d.ts

@@ -0,0 +1,20 @@
+import type { RandomSource } from '@flighthq/types';
+export type { RandomSource };
+/** Create a fast, deterministic pseudo-random generator seeded by an integer.
+ *
+ *  Uses the mulberry32 algorithm: a single 32-bit state, good statistical
+ *  quality for gameplay/VFX use, and identical output across platforms for a
+ *  given seed. Two generators created with the same seed produce the same
+ *  sequence, so seeding two consumers identically makes them run in lockstep.
+ *
+ *  This is the SDK's reusable seeded random — used wherever a render or
+ *  simulation must be reproducible (particle emitters, the landing backgrounds,
+ *  visual-regression capture) rather than each call site reimplementing it.
+ *
+ *  ```ts
+ *  const random = createRandomSource(0x1234);
+ *  const value = random(); // a number in [0, 1)
+ *  ```
+ */
+export declare function createRandomSource(seed: number): RandomSource;
+//# sourceMappingURL=random.d.ts.map

package/dist/random.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../src/random.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD,YAAY,EAAE,YAAY,EAAE,CAAC;AAE7B;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAS7D"}

package/dist/random.js

@@ -0,0 +1,27 @@
+/** Create a fast, deterministic pseudo-random generator seeded by an integer.
+ *
+ *  Uses the mulberry32 algorithm: a single 32-bit state, good statistical
+ *  quality for gameplay/VFX use, and identical output across platforms for a
+ *  given seed. Two generators created with the same seed produce the same
+ *  sequence, so seeding two consumers identically makes them run in lockstep.
+ *
+ *  This is the SDK's reusable seeded random — used wherever a render or
+ *  simulation must be reproducible (particle emitters, the landing backgrounds,
+ *  visual-regression capture) rather than each call site reimplementing it.
+ *
+ *  ```ts
+ *  const random = createRandomSource(0x1234);
+ *  const value = random(); // a number in [0, 1)
+ *  ```
+ */
+export function createRandomSource(seed) {
+    // Coerce to a 32-bit unsigned integer; non-finite seeds collapse to 0.
+    let a = Number.isFinite(seed) ? seed >>> 0 : 0;
+    return function seededRandom() {
+        a = (a + 0x6d2b79f5) | 0;
+        let t = Math.imul(a ^ (a >>> 15), 1 | a);
+        t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+//# sourceMappingURL=random.js.map

package/dist/random.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sourceRoot":"","sources":["../src/random.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,uEAAuE;IACvE,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,OAAO,SAAS,YAAY;QAC1B,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC"}

package/dist/randomDistributions.d.ts

@@ -0,0 +1,105 @@
+import type { RandomSource, Vector2Like, Vector3Like } from '@flighthq/types';
+/** Pick a random element from `items`, returning `undefined` for an empty array.
+ *
+ *  Does not mutate `items`. Deterministic: same `random` sequence → same picks.
+ */
+export declare function pick<T>(random: RandomSource, items: Readonly<T[]>): T | undefined;
+/** Return an exponentially-distributed random number with the given `rate`
+ *  (λ > 0, mean = 1/λ).
+ *
+ *  Uses the inverse CDF method: `-ln(U) / rate` where U is uniform on (0, 1].
+ *  Suitable for modeling inter-arrival times in a Poisson process, particle
+ *  lifetimes, and decay events.
+ *
+ *  The result is always non-negative. Throws if `rate <= 0`.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export declare function randomExponential(random: RandomSource, rate?: number): number;
+/** Return a normally-distributed random number with the given `mean` and
+ *  `standardDeviation`, using the Box–Muller transform.
+ *
+ *  Each call consumes two values from `random` and discards one (the simplest
+ *  variant — use `randomGaussianPair` if you need both). The result can be any
+ *  finite number; it is not clamped.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export declare function randomGaussian(random: RandomSource, mean?: number, standardDeviation?: number): number;
+/** Return two independent normally-distributed random numbers as `[z0, z1]`
+ *  sharing the same Box–Muller pair.
+ *
+ *  Prefer this over calling `randomGaussian` twice when both samples are
+ *  needed — it consumes exactly 2 values from `random` instead of 4.
+ */
+export declare function randomGaussianPair(random: RandomSource, mean?: number, standardDeviation?: number): readonly [number, number];
+/** Sample a uniformly-distributed point inside the unit disc (including the
+ *  boundary) and write it into `out.x` / `out.y`.
+ *
+ *  Uses rejection sampling to avoid the over-dense centre that polar-radius
+ *  sampling without a square-root correction produces.
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe).
+ *  No allocation.
+ */
+export declare function randomInsideUnitDisc(random: RandomSource, out: Vector2Like): void;
+/** Sample a uniformly-distributed point inside the unit sphere (radius ≤ 1)
+ *  and write it into `out.x` / `out.y` / `out.z`.
+ *
+ *  Uses 3D box rejection sampling: repeatedly draw from [-1, 1]³ until the
+ *  point is inside the sphere. Expected draws per call ≈ 1.91 (sphere:cube
+ *  volume ratio π/6 ≈ 0.524, so ~1.9× draws on average — fast in practice).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe:
+ *  all reads are complete before any write). No allocation.
+ */
+export declare function randomInsideUnitSphere(random: RandomSource, out: Vector3Like): void;
+/** Sample a uniformly-distributed point on the unit circle and write it into
+ *  `out.x` / `out.y`. The result has unit length (x² + y² = 1).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe:
+ *  all reads complete before any write). No allocation.
+ */
+export declare function randomOnUnitCircle(random: RandomSource, out: Vector2Like): void;
+/** Sample a uniformly-distributed point on the surface of the unit sphere
+ *  and write it into `out.x` / `out.y` / `out.z`.
+ *
+ *  Uses the Marsaglia (1972) method — two uniform samples → rejection → a point
+ *  on the sphere. The result has unit length (x² + y² + z² = 1).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe).
+ *  No allocation.
+ */
+export declare function randomOnUnitSphere(random: RandomSource, out: Vector3Like): void;
+/** Return a Poisson-distributed random integer with mean `lambda` (λ > 0).
+ *
+ *  Uses Knuth's multiplicative algorithm: multiply independent uniform samples
+ *  until their product falls below `exp(-λ)`. Accurate and simple for small
+ *  `lambda` (λ ≤ ~30); for large lambda, `randomGaussian(random, lambda,
+ *  Math.sqrt(lambda))` is a faster approximation.
+ *
+ *  The result is a non-negative integer. Throws if `lambda <= 0`.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export declare function randomPoisson(random: RandomSource, lambda?: number): number;
+/** Return a random index from a weight array, selected proportionally to
+ *  each weight. Weights do not need to sum to 1.
+ *
+ *  Returns `-1` for an empty or all-zero weight array.
+ *
+ *  Useful for weighted spawn rules in particle emitters.
+ */
+export declare function randomWeighted(random: RandomSource, weights: Readonly<number[]>): number;
+/** Return a new array with the elements of `items` shuffled in a random order
+ *  (Fisher–Yates / Knuth shuffle). Allocates a copy; does not mutate `items`.
+ *
+ *  Deterministic: same `random` state → same shuffled order.
+ */
+export declare function shuffle<T>(random: RandomSource, items: Readonly<T[]>): T[];
+/** Shuffle `items` in place using the Fisher–Yates algorithm.
+ *
+ *  Mutates `items`. Deterministic: same `random` state → same shuffled order.
+ */
+export declare function shuffleInPlace<T>(random: RandomSource, items: T[]): void;
+//# sourceMappingURL=randomDistributions.d.ts.map

package/dist/randomDistributions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"randomDistributions.d.ts","sourceRoot":"","sources":["../src/randomDistributions.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9E;;;GAGG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAGjF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,GAAE,MAAU,GAAG,MAAM,CAKhF;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,MAAM,CAO5G;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,YAAY,EACpB,IAAI,GAAE,MAAU,EAChB,iBAAiB,GAAE,MAAU,GAC5B,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAQ3B;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAUjF;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAYnF;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAM/E;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAiB/E;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,GAAE,MAAU,GAAG,MAAM,CAU9E;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAUxF;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAI1E;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAOxE"}

package/dist/randomDistributions.js

@@ -0,0 +1,209 @@
+/** Pick a random element from `items`, returning `undefined` for an empty array.
+ *
+ *  Does not mutate `items`. Deterministic: same `random` sequence → same picks.
+ */
+export function pick(random, items) {
+    if (items.length === 0)
+        return undefined;
+    return items[Math.floor(random() * items.length)];
+}
+/** Return an exponentially-distributed random number with the given `rate`
+ *  (λ > 0, mean = 1/λ).
+ *
+ *  Uses the inverse CDF method: `-ln(U) / rate` where U is uniform on (0, 1].
+ *  Suitable for modeling inter-arrival times in a Poisson process, particle
+ *  lifetimes, and decay events.
+ *
+ *  The result is always non-negative. Throws if `rate <= 0`.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export function randomExponential(random, rate = 1) {
+    if (rate <= 0)
+        throw new RangeError('randomExponential: rate must be > 0');
+    const u = random();
+    // Avoid ln(0) — replace exactly 0 with the smallest usable positive value.
+    return -Math.log(u === 0 ? Number.EPSILON : u) / rate;
+}
+/** Return a normally-distributed random number with the given `mean` and
+ *  `standardDeviation`, using the Box–Muller transform.
+ *
+ *  Each call consumes two values from `random` and discards one (the simplest
+ *  variant — use `randomGaussianPair` if you need both). The result can be any
+ *  finite number; it is not clamped.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export function randomGaussian(random, mean = 0, standardDeviation = 1) {
+    // Box–Muller: uses two uniform samples to produce two independent standard
+    // normal values. We discard the second one for simplicity.
+    const u1 = random();
+    const u2 = random();
+    const z = Math.sqrt(-2 * Math.log(u1 === 0 ? Number.EPSILON : u1)) * Math.cos(Math.PI * 2 * u2);
+    return mean + z * standardDeviation;
+}
+/** Return two independent normally-distributed random numbers as `[z0, z1]`
+ *  sharing the same Box–Muller pair.
+ *
+ *  Prefer this over calling `randomGaussian` twice when both samples are
+ *  needed — it consumes exactly 2 values from `random` instead of 4.
+ */
+export function randomGaussianPair(random, mean = 0, standardDeviation = 1) {
+    const u1 = random();
+    const u2 = random();
+    const mag = Math.sqrt(-2 * Math.log(u1 === 0 ? Number.EPSILON : u1));
+    const angle = Math.PI * 2 * u2;
+    const z0 = mean + mag * Math.cos(angle) * standardDeviation;
+    const z1 = mean + mag * Math.sin(angle) * standardDeviation;
+    return [z0, z1];
+}
+/** Sample a uniformly-distributed point inside the unit disc (including the
+ *  boundary) and write it into `out.x` / `out.y`.
+ *
+ *  Uses rejection sampling to avoid the over-dense centre that polar-radius
+ *  sampling without a square-root correction produces.
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe).
+ *  No allocation.
+ */
+export function randomInsideUnitDisc(random, out) {
+    // Square rejection sampling: draw from [-1, 1]² until inside the unit disc.
+    let x;
+    let y;
+    do {
+        x = random() * 2 - 1;
+        y = random() * 2 - 1;
+    } while (x * x + y * y > 1);
+    out.x = x;
+    out.y = y;
+}
+/** Sample a uniformly-distributed point inside the unit sphere (radius ≤ 1)
+ *  and write it into `out.x` / `out.y` / `out.z`.
+ *
+ *  Uses 3D box rejection sampling: repeatedly draw from [-1, 1]³ until the
+ *  point is inside the sphere. Expected draws per call ≈ 1.91 (sphere:cube
+ *  volume ratio π/6 ≈ 0.524, so ~1.9× draws on average — fast in practice).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe:
+ *  all reads are complete before any write). No allocation.
+ */
+export function randomInsideUnitSphere(random, out) {
+    let x;
+    let y;
+    let z;
+    do {
+        x = random() * 2 - 1;
+        y = random() * 2 - 1;
+        z = random() * 2 - 1;
+    } while (x * x + y * y + z * z > 1);
+    out.x = x;
+    out.y = y;
+    out.z = z;
+}
+/** Sample a uniformly-distributed point on the unit circle and write it into
+ *  `out.x` / `out.y`. The result has unit length (x² + y² = 1).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe:
+ *  all reads complete before any write). No allocation.
+ */
+export function randomOnUnitCircle(random, out) {
+    const angle = random() * Math.PI * 2;
+    const x = Math.cos(angle);
+    const y = Math.sin(angle);
+    out.x = x;
+    out.y = y;
+}
+/** Sample a uniformly-distributed point on the surface of the unit sphere
+ *  and write it into `out.x` / `out.y` / `out.z`.
+ *
+ *  Uses the Marsaglia (1972) method — two uniform samples → rejection → a point
+ *  on the sphere. The result has unit length (x² + y² + z² = 1).
+ *
+ *  The `out` parameter may be the same object as any other argument (alias-safe).
+ *  No allocation.
+ */
+export function randomOnUnitSphere(random, out) {
+    let x;
+    let y;
+    let s;
+    // Marsaglia's method: sample inside the unit disc in 2D, then project.
+    do {
+        x = random() * 2 - 1;
+        y = random() * 2 - 1;
+        s = x * x + y * y;
+    } while (s >= 1);
+    const f = 2 * Math.sqrt(1 - s);
+    const rx = x * f;
+    const ry = y * f;
+    const rz = 1 - 2 * s;
+    out.x = rx;
+    out.y = ry;
+    out.z = rz;
+}
+/** Return a Poisson-distributed random integer with mean `lambda` (λ > 0).
+ *
+ *  Uses Knuth's multiplicative algorithm: multiply independent uniform samples
+ *  until their product falls below `exp(-λ)`. Accurate and simple for small
+ *  `lambda` (λ ≤ ~30); for large lambda, `randomGaussian(random, lambda,
+ *  Math.sqrt(lambda))` is a faster approximation.
+ *
+ *  The result is a non-negative integer. Throws if `lambda <= 0`.
+ *
+ *  Deterministic: same `random` sequence → same output sequence.
+ */
+export function randomPoisson(random, lambda = 1) {
+    if (lambda <= 0)
+        throw new RangeError('randomPoisson: lambda must be > 0');
+    const limit = Math.exp(-lambda);
+    let k = 0;
+    let product = random();
+    while (product > limit) {
+        k++;
+        product *= random();
+    }
+    return k;
+}
+/** Return a random index from a weight array, selected proportionally to
+ *  each weight. Weights do not need to sum to 1.
+ *
+ *  Returns `-1` for an empty or all-zero weight array.
+ *
+ *  Useful for weighted spawn rules in particle emitters.
+ */
+export function randomWeighted(random, weights) {
+    let total = 0;
+    for (let i = 0; i < weights.length; i++)
+        total += weights[i];
+    if (total <= 0)
+        return -1;
+    let r = random() * total;
+    for (let i = 0; i < weights.length; i++) {
+        r -= weights[i];
+        if (r <= 0)
+            return i;
+    }
+    return weights.length - 1;
+}
+/** Return a new array with the elements of `items` shuffled in a random order
+ *  (Fisher–Yates / Knuth shuffle). Allocates a copy; does not mutate `items`.
+ *
+ *  Deterministic: same `random` state → same shuffled order.
+ */
+export function shuffle(random, items) {
+    const copy = items.slice();
+    shuffleInPlace(random, copy);
+    return copy;
+}
+/** Shuffle `items` in place using the Fisher–Yates algorithm.
+ *
+ *  Mutates `items`. Deterministic: same `random` state → same shuffled order.
+ */
+export function shuffleInPlace(random, items) {
+    for (let i = items.length - 1; i > 0; i--) {
+        const j = Math.floor(random() * (i + 1));
+        const tmp = items[i];
+        items[i] = items[j];
+        items[j] = tmp;
+    }
+}
+//# sourceMappingURL=randomDistributions.js.map

package/dist/randomDistributions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"randomDistributions.js","sourceRoot":"","sources":["../src/randomDistributions.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,UAAU,IAAI,CAAI,MAAoB,EAAE,KAAoB;IAChE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAoB,EAAE,OAAe,CAAC;IACtE,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,qCAAqC,CAAC,CAAC;IAC3E,MAAM,CAAC,GAAG,MAAM,EAAE,CAAC;IACnB,2EAA2E;IAC3E,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AACxD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,MAAoB,EAAE,OAAe,CAAC,EAAE,oBAA4B,CAAC;IAClG,2EAA2E;IAC3E,2DAA2D;IAC3D,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IAChG,OAAO,IAAI,GAAG,CAAC,GAAG,iBAAiB,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAoB,EACpB,OAAe,CAAC,EAChB,oBAA4B,CAAC;IAE7B,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC/B,MAAM,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,iBAAiB,CAAC;IAC5D,MAAM,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,iBAAiB,CAAC;IAC5D,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAoB,EAAE,GAAgB;IACzE,4EAA4E;IAC5E,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,GAAG,CAAC;QACF,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IAC5B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAAoB,EAAE,GAAgB;IAC3E,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,GAAG,CAAC;QACF,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;IACpC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAoB,EAAE,GAAgB;IACvE,MAAM,KAAK,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IACrC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACV,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAoB,EAAE,GAAgB;IACvE,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,uEAAuE;IACvE,GAAG,CAAC;QACF,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;IACjB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IACX,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,MAAoB,EAAE,SAAiB,CAAC;IACpE,IAAI,MAAM,IAAI,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,mCAAmC,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,OAAO,GAAG,MAAM,EAAE,CAAC;IACvB,OAAO,OAAO,GAAG,KAAK,EAAE,CAAC;QACvB,CAAC,EAAE,CAAC;QACJ,OAAO,IAAI,MAAM,EAAE,CAAC;IACtB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,MAAoB,EAAE,OAA2B;IAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,KAAK,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAI,MAAoB,EAAE,KAAoB;IACnE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAI,MAAoB,EAAE,KAAU;IAChE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACjB,CAAC;AACH,CAAC"}

package/dist/randomRange.d.ts

@@ -0,0 +1,18 @@
+import type { RandomSource } from '@flighthq/types';
+/** Return a random boolean with the given `probability` of being `true`.
+ *
+ *  `probability` is clamped to `[0, 1]`; `0.5` is a fair coin flip.
+ */
+export declare function randomBool(random: RandomSource, probability?: number): boolean;
+/** Return a random integer in the inclusive range `[min, max]`.
+ *
+ *  Both bounds must be integers; the function passes them through `Math.floor`
+ *  so non-integer bounds are truncated toward zero rather than throwing. Throws
+ *  if `min > max`.
+ */
+export declare function randomInt(random: RandomSource, min: number, max: number): number;
+/** Return a random float in the half-open range `[min, max)`. */
+export declare function randomRange(random: RandomSource, min: number, max: number): number;
+/** Return a random sign: either `1` or `-1` with equal probability. */
+export declare function randomSign(random: RandomSource): number;
+//# sourceMappingURL=randomRange.d.ts.map

package/dist/randomRange.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"randomRange.d.ts","sourceRoot":"","sources":["../src/randomRange.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,YAAY,EAAE,WAAW,GAAE,MAAY,GAAG,OAAO,CAEnF;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAKhF;AAED,iEAAiE;AACjE,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAElF;AAED,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAEvD"}

package/dist/randomRange.js

@@ -0,0 +1,29 @@
+/** Return a random boolean with the given `probability` of being `true`.
+ *
+ *  `probability` is clamped to `[0, 1]`; `0.5` is a fair coin flip.
+ */
+export function randomBool(random, probability = 0.5) {
+    return random() < probability;
+}
+/** Return a random integer in the inclusive range `[min, max]`.
+ *
+ *  Both bounds must be integers; the function passes them through `Math.floor`
+ *  so non-integer bounds are truncated toward zero rather than throwing. Throws
+ *  if `min > max`.
+ */
+export function randomInt(random, min, max) {
+    const lo = Math.floor(min);
+    const hi = Math.floor(max);
+    if (lo > hi)
+        throw new RangeError('randomInt: min must be <= max');
+    return lo + Math.floor(random() * (hi - lo + 1));
+}
+/** Return a random float in the half-open range `[min, max)`. */
+export function randomRange(random, min, max) {
+    return min + random() * (max - min);
+}
+/** Return a random sign: either `1` or `-1` with equal probability. */
+export function randomSign(random) {
+    return random() < 0.5 ? -1 : 1;
+}
+//# sourceMappingURL=randomRange.js.map

package/dist/randomRange.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"randomRange.js","sourceRoot":"","sources":["../src/randomRange.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,MAAoB,EAAE,cAAsB,GAAG;IACxE,OAAO,MAAM,EAAE,GAAG,WAAW,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,MAAoB,EAAE,GAAW,EAAE,GAAW;IACtE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;IACnE,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,WAAW,CAAC,MAAoB,EAAE,GAAW,EAAE,GAAW;IACxE,OAAO,GAAG,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AACtC,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,UAAU,CAAC,MAAoB;IAC7C,OAAO,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC"}

package/dist/rounding.d.ts

@@ -0,0 +1,35 @@
+/** Return `value` ceiled to the nearest multiple of `step`.
+ *
+ *  `ceilTo(7, 5)` → `10`. When `step <= 0` the result is `value`.
+ */
+export declare function ceilTo(value: number, step: number): number;
+/** True non-negative modulo: `euclideanMod(value, divisor)`.
+ *
+ *  Unlike JavaScript's `%` operator, the result is always in `[0, divisor)`
+ *  regardless of the sign of `value`. Throws when `divisor === 0` (programmer
+ *  error: a zero divisor is always a bug at the call site).
+ *
+ *  ```ts
+ *  euclideanMod(-1, 4) // 3  (JS: -1)
+ *  euclideanMod(7, 4)  // 3
+ *  ```
+ */
+export declare function euclideanMod(value: number, divisor: number): number;
+/** Return `value` floored to the nearest multiple of `step`.
+ *
+ *  `floorTo(7, 5)` → `5`. When `step <= 0` the result is `value`.
+ */
+export declare function floorTo(value: number, step: number): number;
+/** Return the fractional part of `value` — the part after the decimal point.
+ *
+ *  Always returns a value in `[0, 1)` for positive inputs. For negative inputs
+ *  the sign is preserved (e.g. `fract(-1.3)` → `-0.3`), mirroring GLSL `fract`.
+ */
+export declare function fract(value: number): number;
+/** Round `value` to the nearest multiple of `step`.
+ *
+ *  `roundTo(7, 5)` → `5`; `roundTo(8, 5)` → `10`. When `step <= 0` the
+ *  result is `value`. Also useful as a snap / quantize primitive.
+ */
+export declare function roundTo(value: number, step: number): number;
+//# sourceMappingURL=rounding.d.ts.map

package/dist/rounding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rounding.d.ts","sourceRoot":"","sources":["../src/rounding.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAG1D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAGnE;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAG3D;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE3C;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAG3D"}

package/dist/rounding.js

@@ -0,0 +1,53 @@
+/** Return `value` ceiled to the nearest multiple of `step`.
+ *
+ *  `ceilTo(7, 5)` → `10`. When `step <= 0` the result is `value`.
+ */
+export function ceilTo(value, step) {
+    if (step <= 0)
+        return value;
+    return Math.ceil(value / step) * step;
+}
+/** True non-negative modulo: `euclideanMod(value, divisor)`.
+ *
+ *  Unlike JavaScript's `%` operator, the result is always in `[0, divisor)`
+ *  regardless of the sign of `value`. Throws when `divisor === 0` (programmer
+ *  error: a zero divisor is always a bug at the call site).
+ *
+ *  ```ts
+ *  euclideanMod(-1, 4) // 3  (JS: -1)
+ *  euclideanMod(7, 4)  // 3
+ *  ```
+ */
+export function euclideanMod(value, divisor) {
+    if (divisor === 0)
+        throw new RangeError('euclideanMod: divisor must not be 0');
+    return ((value % divisor) + divisor) % divisor;
+}
+/** Return `value` floored to the nearest multiple of `step`.
+ *
+ *  `floorTo(7, 5)` → `5`. When `step <= 0` the result is `value`.
+ */
+export function floorTo(value, step) {
+    if (step <= 0)
+        return value;
+    return Math.floor(value / step) * step;
+}
+/** Return the fractional part of `value` — the part after the decimal point.
+ *
+ *  Always returns a value in `[0, 1)` for positive inputs. For negative inputs
+ *  the sign is preserved (e.g. `fract(-1.3)` → `-0.3`), mirroring GLSL `fract`.
+ */
+export function fract(value) {
+    return value - Math.trunc(value);
+}
+/** Round `value` to the nearest multiple of `step`.
+ *
+ *  `roundTo(7, 5)` → `5`; `roundTo(8, 5)` → `10`. When `step <= 0` the
+ *  result is `value`. Also useful as a snap / quantize primitive.
+ */
+export function roundTo(value, step) {
+    if (step <= 0)
+        return value;
+    return Math.round(value / step) * step;
+}
+//# sourceMappingURL=rounding.js.map

package/dist/rounding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rounding.js","sourceRoot":"","sources":["../src/rounding.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,KAAa,EAAE,IAAY;IAChD,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACxC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,OAAe;IACzD,IAAI,OAAO,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,qCAAqC,CAAC,CAAC;IAC/E,OAAO,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,IAAY;IACjD,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa;IACjC,OAAO,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa,EAAE,IAAY;IACjD,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACzC,CAAC"}