Calculate the sum of double-precision floating-point strided array elements, ignoring NaN values and using an improved Kahan–Babuška algorithm.
Return the Cartesian product.
Flatten an array.
Calculate the cumulative sum of single-precision floating-point strided array elements using ordinary recursive summation.
Generate pseudorandom numbers drawn from a Student's t-distribution.
Calculate the cumulative sum of strided array elements using ordinary recursive summation.
Compute the Bessel function of the first kind of order zero.
Dispatch — workspace control plane for agent-native apps. Vault, integrations, destinations, scheduled jobs, and cross-app delegation, shipped as a single drop-in package.
Calculate the arithmetic mean of a double-precision floating-point strided array using a two-pass error correction algorithm.
F distribution mode.
Serialize a two-sample Z-test results object as a formatted string.
Test whether a string matches a Node.js built-in module name.
Orchestrator agent that drives multiple ggcoder sessions across projects from a single chat
C API for registering a Node-API module exporting a strided array interface for applying a unary callback to a single-precision floating-point strided input array according to a strided mask array and assigning results to a single-precision floating-poin
Add a scalar constant to each double-precision floating-point strided array element and compute the sum.
Group element entries as arrays associated with distinct keys.
Base classes for wiring client app code to redux and event framework
Logistic distribution logarithm of probability density function (PDF).
Calculate the cumulative sum of single-precision floating-point strided array elements.
Compute an arithmetic mean and corrected sample standard deviation incrementally.
Gaussian filter for ndarrays
An action management framework
Determine if an array data type can be safely cast or, for floating-point data types, downcast to another array data type.
Calculate the sum of strided array elements, ignoring NaN values and using a second-order iterative Kahan–Babuška algorithm.