peterolson / BigInteger.js / 69

69

Pull #57

travis-ci

mizar 
gcd: use lowestOneBit, change to iterative. lcm: to multiply after divide.
Pull Request #57: gcd: use lowestOneBit, to iterative. lcm: multiply after divide.

20 of 20 new or added lines in 1 file covered. (100.0%)

765 of 781 relevant lines covered (97.95%)

165086.81 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

97.95
/BigInteger.js


Build SHA Not Found

The commit SHA "7e34fe7f818a566d6f6c3ac9e9201ca502889777" was not found in your repository, so the file cannot be loaded. This may be because you posted from a local development environment, or your CI created an ephemeral commit.