Compute the greatest common divisor (gcd).
JavaScript
1
0
Apache License 2.0
This is a JavaScript library for computing the greatest common divisor (gcd) of two integers, part of the stdlib standard library focused on numerical computing. It provides both JavaScript and C APIs, with rigorous testing and documentation, and is designed for developers needing reliable mathematical functions in Node.js or browser environments.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of stdlib-js/math-base-special-gcd
Double-precision floating-point negative infinity.
Double-precision floating-point positive infinity.
Maximum signed 32-bit integer.
Test if a finite double-precision floating-point number is an integer.
Test if a double-precision floating-point numeric value is NaN.
C APIs for registering a Node-API module exporting an interface for invoking a binary numerical function.
Modulus function.
Load a manifest for compiling source files.
Insert array element values and the result of a callback function into a format string and print the result.
Create an array containing pseudorandom numbers drawn from a discrete uniform distribution.
Wrap `require` in a try/catch block.
tap-producing test harness for node and browsers
Yet another JS code coverage tool that computes statement, line, function and branch coverage with module loader hooks to transparently add coverage when running tests. Supports all JS coverage use ca
Minimal TAP output formatter.
Benchmark harness.
Support the repos that depend on this repository
Top contributors
stdlib-bot
78 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet