u-numflow
Domain-agnostic mathematical primitives in Rust
Overview
u-numflow provides foundational mathematical, statistical, and probabilistic building blocks. Entirely domain-agnostic with no external dependencies beyond rand.
Modules
| Module | Description |
|---|---|
stats |
Descriptive statistics (mean, variance, skewness, kurtosis) with Welford's online algorithm and Neumaier summation |
distributions |
Probability distributions: Uniform, Triangular, PERT, Normal, LogNormal |
special |
Special functions: normal CDF and tail-precise survival function (and their inverses), t/F/chi² CDF and quantiles, the noncentral t CDF (Lenth AS 243 — the distribution power is computed from), regularized incomplete beta/gamma, erf |
transforms |
Data transformations: Box-Cox (λ via MLE golden-section search), inverse Box-Cox |
fourier |
Discrete Fourier transform of any length (radix-2 for powers of two, Bluestein otherwise): fft, ifft, rfft, Complex |
matrix |
Dense matrix operations: determinant, inverse, Cholesky decomposition, Jacobi eigenvalue decomposition |
random |
Seeded RNG, Fisher-Yates shuffle, weighted sampling, random subset selection |
collections |
Specialized data structures: Union-Find with path compression and union-by-rank |
Design Philosophy
- Numerical stability first — Welford's algorithm for variance, Neumaier summation for accumulation
- Reproducibility — Seeded RNG support for deterministic experiments
- Property-based testing — Mathematical invariants verified via
proptest
Quick Start
[]
= "0.2"
use Pert;
use ;
use WelfordAccumulator;
// Online statistics with numerical stability (Welford)
let mut stats = new;
for x in
assert_eq!;
// PERT distribution: moments and quantiles; sample by inverting a uniform draw
let pert = new.unwrap;
assert_eq!;
let p90 = pert.quantile.unwrap;
assert!;
// Seeded shuffling for reproducibility
let mut rng = create_rng;
let mut items = vec!;
shuffle;
// Box-Cox transformation (non-normal data normalization)
use ;
let data = ;
let fit = estimate_lambda.unwrap; // MLE via golden-section
let transformed = box_cox.unwrap;
assert_eq!;
// Discrete Fourier transform of any length
use rfft;
let signal: = .map.collect;
let spectrum = rfft; // 30 complex bins; bin 3 carries the energy
assert!;
Build & Test
Dependencies
rand0.9 — Random number generationproptest1.4 — Property-based testing (dev only)
License
MIT License — see LICENSE.
npm (WebAssembly)
The package resolves per environment via a conditional exports map:
| Environment | Entry |
|---|---|
| Bundlers (webpack, Vite, …) | ESM + WebAssembly ESM-integration (default condition) |
Node.js — require(), ESM import, CJS TS runners (tsx, ts-node) |
CJS glue loading the wasm from the filesystem (node condition) — no loader hooks or flags |
A browser without a bundler is not supported: the package loads its .wasm
file with an ES module import, which browsers refuse (application/wasm is not a
module script type), so <script type="module"> from a CDN fails, and CDN
re-bundling services fail on the same import. Use a bundler or Node.
Exported functions: mean, std_dev, variance, normal_cdf, normal_sf (upper tail P(Z > x), computed directly so tail probabilities keep ~15 significant digits), box_cox, estimate_lambda (returns { lambda, at_bound } — at_bound is true when the likelihood was still rising at an end of the search range, so lambda is that limit), and
rfft(data) -> Float64Array — the DFT of a real sequence of any length, interleaved as
[re0, im0, re1, im1, …] (bins k and n − k are conjugates, so 0..=n/2 describes the spectrum).
Distribution functions for critical values and p-values — each returns a number and
throws (an Error naming the argument — see Errors below) when an argument is outside the domain,
rather than returning NaN:
| Function | Returns |
|---|---|
inverse_normal_cdf(p) |
z with P(Z ≤ z) = p |
t_distribution_cdf(t, df) / t_distribution_quantile(p, df) |
Student's t; a two-sided critical value at level α is t_distribution_quantile(1 − α/2, df) |
f_distribution_cdf(x, df1, df2) / f_distribution_quantile(p, df1, df2) |
F |
chi_squared_cdf(x, k) / chi_squared_quantile(p, k) |
χ² |
p must lie strictly between 0 and 1 and every degrees-of-freedom argument must be a
finite number > 0 (fractional values are allowed).
const = require;
; // 2.2281…
Errors. A refusal throws an Error whose message is readable text and which
carries a code naming the reason, next to the values behind it:
const = require;
try catch
code |
Fields | Meaning |
|---|---|---|
parameter_out_of_range |
parameter, min, max (or null), got |
p not strictly inside (0, 1), or a degrees of freedom that is not a finite number > 0 (both bounds excluded) |
value_not_finite |
parameter (for a scalar argument) |
A NaN argument, or a NaN or infinity in box_cox/estimate_lambda data |
non_positive_data |
— | Box-Cox data with a value ≤ 0 |
insufficient_data |
— | Box-Cox data with fewer than 2 values |
invalid_transform |
— | A Box-Cox result that is not finite |
invalid_lambda_range |
— | estimate_lambda bounds that are not finite with lambda_min < lambda_max |
TypeScript
Every exported function declares its parameter and return types, and the declarations are generated from the same structs the binding reads and serialises, so they cannot drift from what it actually accepts and returns:
export function estimate_lambda(data: Float64Array, lambda_min: number, lambda_max: number): LambdaEstimateDto;
An absent optional value is declared T | undefined, which is what the binding
sends. Nothing needs an as cast -- and a wrong assumption about a result's
shape is a compile error rather than something that fails at run time.
Every parameter is a number or a Float64Array, so there is nothing to
declare beyond what wasm-bindgen already does; the publishing workflow keeps it
that way. The binding still validates every input at the boundary, and a
rejected one says what was wrong.
Related
- u-metaheur — Metaheuristic optimization (GA, SA, ALNS, CP)
- u-geometry — Computational geometry
- u-schedule — Scheduling framework
- u-nesting — 2D/3D nesting and bin packing