We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
With inspiration from Ruby:
ceil() / floor() round(precision) lcm(_int) / gcd(_int) isOdd() / isEven() times() / upto() / downto() chr() next() / prev()
The text was updated successfully, but these errors were encountered:
Added Number.prototype.gcd. Ref #4
9819a4e
An implementation of Stein's binary algorithm. Often faster than Euclidean's.
Added Number.prototype.lcm. Ref #4
602d6de
Added Number.[ceil,floor,char,abs]. Ref #4
4d00da9
These just alias other methods so no real need for tests.
Fixed gcd and lcm. Added Number.prototype.round. Ref #4
b7d785a
Long story - was using wrong tests which gave a false positive!
Made Number.prototype.[chr,even,odd] getters. Ref #4
ede890a
This makes a lot more sense to me. Any opinions?
I've decided against times / upto / downto for now. May change this in the future but not for this milestone.
Sorry, something went wrong.
ollym
No branches or pull requests
With inspiration from Ruby:
ceil() / floor()
round(precision)
lcm(_int) / gcd(_int)
isOdd() / isEven()
times() / upto() / downto()
chr()
next() / prev()
The text was updated successfully, but these errors were encountered: