@jwaterfaucett/euclidean_gcd

v0.0.1 MITLicense declared in the package manifest.

find the greatest common divisor of two numbers x and y using Euclid's algorithm.

85

Security score

0 known advisories in v0.0.1

0-100 score computed by this site from verifiable signals only: known OSV.dev advisories affecting this exact version, how recently it was published, and the repository's OpenSSF Scorecard.advisory penalty −0 · staleness penalty −15

Weekly downloads

Downloads across all versions in the last 7 days, from the official npm downloads API (api.npmjs.org).

—

Unpacked size

Size of v0.0.1 on disk after npm install extracts the tarball, as reported by the npm registry.

—

Dependencies

Direct runtime dependencies declared by v0.0.1. Transitive dependencies are not counted here — use the lockfile audit for the full tree.

0

Last publish

When v0.0.1 was published to the registry. Long gaps can indicate an unmaintained package.

9 years ago

Security advisories

Vulnerabilities affecting v0.0.1 specifically, from OSV.dev — the open database aggregating the GitHub Advisory Database (GHSA) and CVEs. Links open the full advisory.

No known vulnerabilities affect v0.0.1.