Security News
tea.xyz Spam Plagues npm and RubyGems Package Registries
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
compute-gcd
Advanced tools
Readme
Computes the greatest common divisor (gcd).
Note: the gcd is also known as the greatest common factor (gcf), highest common factor (hcf), highest common divisor, and greatest common measure (gcm).
$ npm install compute-gcd
For use in the browser, use browserify.
var gcd = require( 'compute-gcd' );
Computes the greatest common divisor (gcd) of two or more integers
.
var val = gcd( 48, 18 );
// returns 6
var val = gcd( 8, 12, 16 );
// returns 4
Computes the greatest common divisor (gcd) of two or more integers
.
var val = gcd( [48, 18] );
// returns 6
var val = gcd( [8, 12, 16] );
// returns 4
For object arrays
, provide an accessor function
for accessing array
values
var data = [
['beep', 4],
['boop', 8],
['bap', 12],
['baz', 16]
];
function getValue( d, i ) {
return d[ 1 ];
}
var arr = gcd( arr, getValue );
// returns 4
array
with a length less than 2
or a single integer
argument, the function returns null
.var gcd = require( 'compute-gcd' );
// Compute the gcd of random tuples...
var x, y, z, arr, val;
for ( var i = 0; i < 100; i++ ) {
x = Math.round( Math.random()*50 );
y = Math.round( Math.random()*50 );
z = Math.round( Math.random()*50 );
arr = [ x, y, z ];
val = gcd( arr );
console.log( arr, val );
}
To run the example code from the top-level application directory,
$ node ./examples/index.js
Unit tests use the Mocha test framework with Chai assertions. To run the tests, execute the following command in the top-level application directory:
$ make test
All new feature development should have corresponding unit tests to validate correct functionality.
This repository uses Istanbul as its code coverage tool. To generate a test coverage report, execute the following command in the top-level application directory:
$ make test-cov
Istanbul creates a ./reports/coverage
directory. To access an HTML version of the report,
$ make view-cov
Copyright © 2014-2015. Athan Reines.
FAQs
Computes the greatest common divisor (gcd).
The npm package compute-gcd receives a total of 690,853 weekly downloads. As such, compute-gcd popularity was classified as popular.
We found that compute-gcd demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 2 open source maintainers collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
Security News
As cyber threats become more autonomous, AI-powered defenses are crucial for businesses to stay ahead of attackers who can exploit software vulnerabilities at scale.
Security News
UnitedHealth Group disclosed that the ransomware attack on Change Healthcare compromised protected health information for millions in the U.S., with estimated costs to the company expected to reach $1 billion.