@iyulab/u-numflow 0.2.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 iyulab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,88 @@
+# u-numflow
+
+**Domain-agnostic mathematical primitives in Rust**
+
+[![Crates.io](https://img.shields.io/crates/v/u-numflow.svg)](https://crates.io/crates/u-numflow)
+[![docs.rs](https://docs.rs/u-numflow/badge.svg)](https://docs.rs/u-numflow)
+[![CI](https://github.com/iyulab/u-numflow/actions/workflows/ci.yml/badge.svg)](https://github.com/iyulab/u-numflow/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE)
+
+## 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/t/F/chi² CDF, inverse normal CDF, regularized incomplete beta/gamma, erf |
+| `transforms` | Data transformations: Box-Cox (λ via MLE golden-section search), inverse Box-Cox |
+| `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
+
+```toml
+[dependencies]
+u-numflow = "0.2"
+```
+
+```rust
+use u_numflow::stats::OnlineStats;
+use u_numflow::distributions::{PertDistribution, Distribution};
+use u_numflow::random::Rng;
+
+// Online statistics with numerical stability
+let mut stats = OnlineStats::new();
+for x in [1.0, 2.0, 3.0, 4.0, 5.0] {
+    stats.push(x);
+}
+assert_eq!(stats.mean(), 3.0);
+
+// PERT distribution sampling
+let pert = PertDistribution::new(1.0, 4.0, 7.0);
+let mut rng = Rng::seed_from_u64(42);
+let sample = pert.sample(&mut rng);
+
+// Seeded shuffling for reproducibility
+let mut items = vec![1, 2, 3, 4, 5];
+u_numflow::random::shuffle(&mut items, &mut rng);
+
+// Box-Cox transformation (non-normal data normalization)
+use u_numflow::transforms::{estimate_lambda, box_cox};
+let data = [1.0, 2.0, 4.0, 8.0, 16.0];
+let lambda = estimate_lambda(&data, -2.0, 2.0).unwrap(); // MLE via golden-section
+let transformed = box_cox(&data, lambda).unwrap();
+```
+
+## Build & Test
+
+```bash
+cargo build
+cargo test
+```
+
+## Dependencies
+
+- `rand` 0.9 — Random number generation
+- `proptest` 1.4 — Property-based testing (dev only)
+
+## License
+
+MIT License — see [LICENSE](LICENSE).
+
+## Related
+
+- [u-metaheur](https://github.com/iyulab/u-metaheur) — Metaheuristic optimization (GA, SA, ALNS, CP)
+- [u-geometry](https://github.com/iyulab/u-geometry) — Computational geometry
+- [u-schedule](https://github.com/iyulab/u-schedule) — Scheduling framework
+- [u-nesting](https://github.com/iyulab/U-Nesting) — 2D/3D nesting and bin packing

package/package.json

@@ -0,0 +1,32 @@
+{
+  "name": "@iyulab/u-numflow",
+  "type": "module",
+  "collaborators": [
+    "iyulab"
+  ],
+  "description": "Mathematical primitives for the U-Engine ecosystem: statistics, probability, random sampling, and collections.",
+  "version": "0.2.1",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/iyulab/u-numflow"
+  },
+  "files": [
+    "u_numflow_bg.wasm",
+    "u_numflow.js",
+    "u_numflow_bg.js",
+    "u_numflow.d.ts"
+  ],
+  "main": "u_numflow.js",
+  "types": "u_numflow.d.ts",
+  "sideEffects": [
+    "./u_numflow.js",
+    "./snippets/*"
+  ],
+  "keywords": [
+    "statistics",
+    "probability",
+    "optimization",
+    "mathematics"
+  ]
+}

package/u_numflow.d.ts

@@ -0,0 +1,54 @@
+/* tslint:disable */
+/* eslint-disable */
+
+/**
+ * Apply the Box-Cox power transformation to positive data.
+ *
+ * All values in `data` must be strictly positive.
+ *
+ * # Errors
+ * Returns a `JsValue` error string if data contains non-positive values or
+ * has fewer than 2 elements.
+ */
+export function box_cox(data: Float64Array, lambda: number): Float64Array;
+
+/**
+ * Estimate the optimal Box-Cox lambda via profile maximum likelihood.
+ *
+ * Searches in the range `[lambda_min, lambda_max]` using golden-section search.
+ *
+ * # Errors
+ * Returns a `JsValue` error string if data contains non-positive values,
+ * has fewer than 2 elements, or `lambda_min >= lambda_max`.
+ */
+export function estimate_lambda(data: Float64Array, lambda_min: number, lambda_max: number): number;
+
+/**
+ * Arithmetic mean of `data` using Kahan compensated summation.
+ *
+ * Returns `NaN` if `data` is empty or contains non-finite values.
+ */
+export function mean(data: Float64Array): number;
+
+/**
+ * Standard normal CDF Φ(x) = P(Z ≤ x) for Z ~ N(0, 1).
+ *
+ * To evaluate a general normal N(μ, σ), pass `(x - μ) / σ`.
+ *
+ * Uses Abramowitz & Stegun formula 26.2.17 (max abs error < 7.5 × 10⁻⁸).
+ */
+export function normal_cdf(x: number): number;
+
+/**
+ * Sample standard deviation of `data` (Bessel-corrected, denominator n−1).
+ *
+ * Returns `NaN` if `data` has fewer than 2 elements or contains non-finite values.
+ */
+export function std_dev(data: Float64Array): number;
+
+/**
+ * Sample variance of `data` (Bessel-corrected, denominator n−1).
+ *
+ * Returns `NaN` if `data` has fewer than 2 elements or contains non-finite values.
+ */
+export function variance(data: Float64Array): number;

package/u_numflow.js

@@ -0,0 +1,9 @@
+/* @ts-self-types="./u_numflow.d.ts" */
+
+import * as wasm from "./u_numflow_bg.wasm";
+import { __wbg_set_wasm } from "./u_numflow_bg.js";
+__wbg_set_wasm(wasm);
+wasm.__wbindgen_start();
+export {
+    box_cox, estimate_lambda, mean, normal_cdf, std_dev, variance
+} from "./u_numflow_bg.js";

package/u_numflow_bg.js

@@ -0,0 +1,176 @@
+/**
+ * Apply the Box-Cox power transformation to positive data.
+ *
+ * All values in `data` must be strictly positive.
+ *
+ * # Errors
+ * Returns a `JsValue` error string if data contains non-positive values or
+ * has fewer than 2 elements.
+ * @param {Float64Array} data
+ * @param {number} lambda
+ * @returns {Float64Array}
+ */
+export function box_cox(data, lambda) {
+    const ptr0 = passArrayF64ToWasm0(data, wasm.__wbindgen_malloc);
+    const len0 = WASM_VECTOR_LEN;
+    const ret = wasm.box_cox(ptr0, len0, lambda);
+    if (ret[3]) {
+        throw takeFromExternrefTable0(ret[2]);
+    }
+    var v2 = getArrayF64FromWasm0(ret[0], ret[1]).slice();
+    wasm.__wbindgen_free(ret[0], ret[1] * 8, 8);
+    return v2;
+}
+
+/**
+ * Estimate the optimal Box-Cox lambda via profile maximum likelihood.
+ *
+ * Searches in the range `[lambda_min, lambda_max]` using golden-section search.
+ *
+ * # Errors
+ * Returns a `JsValue` error string if data contains non-positive values,
+ * has fewer than 2 elements, or `lambda_min >= lambda_max`.
+ * @param {Float64Array} data
+ * @param {number} lambda_min
+ * @param {number} lambda_max
+ * @returns {number}
+ */
+export function estimate_lambda(data, lambda_min, lambda_max) {
+    const ptr0 = passArrayF64ToWasm0(data, wasm.__wbindgen_malloc);
+    const len0 = WASM_VECTOR_LEN;
+    const ret = wasm.estimate_lambda(ptr0, len0, lambda_min, lambda_max);
+    if (ret[2]) {
+        throw takeFromExternrefTable0(ret[1]);
+    }
+    return ret[0];
+}
+
+/**
+ * Arithmetic mean of `data` using Kahan compensated summation.
+ *
+ * Returns `NaN` if `data` is empty or contains non-finite values.
+ * @param {Float64Array} data
+ * @returns {number}
+ */
+export function mean(data) {
+    const ptr0 = passArrayF64ToWasm0(data, wasm.__wbindgen_malloc);
+    const len0 = WASM_VECTOR_LEN;
+    const ret = wasm.mean(ptr0, len0);
+    return ret;
+}
+
+/**
+ * Standard normal CDF Φ(x) = P(Z ≤ x) for Z ~ N(0, 1).
+ *
+ * To evaluate a general normal N(μ, σ), pass `(x - μ) / σ`.
+ *
+ * Uses Abramowitz & Stegun formula 26.2.17 (max abs error < 7.5 × 10⁻⁸).
+ * @param {number} x
+ * @returns {number}
+ */
+export function normal_cdf(x) {
+    const ret = wasm.normal_cdf(x);
+    return ret;
+}
+
+/**
+ * Sample standard deviation of `data` (Bessel-corrected, denominator n−1).
+ *
+ * Returns `NaN` if `data` has fewer than 2 elements or contains non-finite values.
+ * @param {Float64Array} data
+ * @returns {number}
+ */
+export function std_dev(data) {
+    const ptr0 = passArrayF64ToWasm0(data, wasm.__wbindgen_malloc);
+    const len0 = WASM_VECTOR_LEN;
+    const ret = wasm.std_dev(ptr0, len0);
+    return ret;
+}
+
+/**
+ * Sample variance of `data` (Bessel-corrected, denominator n−1).
+ *
+ * Returns `NaN` if `data` has fewer than 2 elements or contains non-finite values.
+ * @param {Float64Array} data
+ * @returns {number}
+ */
+export function variance(data) {
+    const ptr0 = passArrayF64ToWasm0(data, wasm.__wbindgen_malloc);
+    const len0 = WASM_VECTOR_LEN;
+    const ret = wasm.variance(ptr0, len0);
+    return ret;
+}
+export function __wbindgen_cast_0000000000000001(arg0, arg1) {
+    // Cast intrinsic for `Ref(String) -> Externref`.
+    const ret = getStringFromWasm0(arg0, arg1);
+    return ret;
+}
+export function __wbindgen_init_externref_table() {
+    const table = wasm.__wbindgen_externrefs;
+    const offset = table.grow(4);
+    table.set(0, undefined);
+    table.set(offset + 0, undefined);
+    table.set(offset + 1, null);
+    table.set(offset + 2, true);
+    table.set(offset + 3, false);
+}
+function getArrayF64FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getFloat64ArrayMemory0().subarray(ptr / 8, ptr / 8 + len);
+}
+
+let cachedFloat64ArrayMemory0 = null;
+function getFloat64ArrayMemory0() {
+    if (cachedFloat64ArrayMemory0 === null || cachedFloat64ArrayMemory0.byteLength === 0) {
+        cachedFloat64ArrayMemory0 = new Float64Array(wasm.memory.buffer);
+    }
+    return cachedFloat64ArrayMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return decodeText(ptr, len);
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function passArrayF64ToWasm0(arg, malloc) {
+    const ptr = malloc(arg.length * 8, 8) >>> 0;
+    getFloat64ArrayMemory0().set(arg, ptr / 8);
+    WASM_VECTOR_LEN = arg.length;
+    return ptr;
+}
+
+function takeFromExternrefTable0(idx) {
+    const value = wasm.__wbindgen_externrefs.get(idx);
+    wasm.__externref_table_dealloc(idx);
+    return value;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+const MAX_SAFARI_DECODE_BYTES = 2146435072;
+let numBytesDecoded = 0;
+function decodeText(ptr, len) {
+    numBytesDecoded += len;
+    if (numBytesDecoded >= MAX_SAFARI_DECODE_BYTES) {
+        cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+        cachedTextDecoder.decode();
+        numBytesDecoded = len;
+    }
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+let WASM_VECTOR_LEN = 0;
+
+
+let wasm;
+export function __wbg_set_wasm(val) {
+    wasm = val;
+}