Current collected state Current
Observed since 20 Oct, 17:47 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
binary_gcd
An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.
hex · 3 observations shown. Missing days are unknown. Counter changes are not daily download totals.
| Date / source period | Value | Observed at |
|---|---|---|
| 2026-10-23 | 319 | 2026-10-23T22:39:59.5246120Z |
| 2026-10-22 | 317 | 2026-10-22T12:56:54.0928749Z |
| 2026-10-20 | 315 | 2026-10-20T18:54:52.3784937Z |
| Package / target | Requirement | Relationship |
|---|---|---|
nstandardEnvironment{
"app": "nstandard",
"repository": ""
} | ~> 0.1 | runtime |
No distribution files are present in the collected metadata.
Observed since 20 Oct, 17:47 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
package_version:14177906a11e1152359cd821b49605d9e9aeabc286ad5ed13bd0932ceeffe210