Releases: fosterchild1/AptInt
Releases · fosterchild1/AptInt
v2.1.2
v2.1.1
Changes since v2.1.0:
- Bug fixes
- Speed up square roots by a small margin
Contributors
- @OminousVibes made their first contribution in #11
View full changelog here.
v2.1.0
v2.0.0
Changes since v1.3.0:
- Switch to base 2^24
- Reduce general overhead by 3%
- Sped up multiplication in general by 1.14x (400 ms -> 350ms on n=100k)
- Sped up
:DivBurnikelZiegler()by a small margin - Addition best-case scenario is now
O(min(m,n) + max(m,n)/k), where k is a very, very, very large constant
View full changelog here.
Warning: this version is NOT backwards compatible.
v1.3.0
Changes since v1.2.0:
- Reduce overhead for all algorithms
- LowerThanRaw and EqualsRaw are now 1.2x faster
- Added in-place arguments for AddRaw and SubtractRaw
- Fixed bugs for KaratsubaSqrt and MultiplyToomCook3
- Implemented Burnikel-Ziegler division, speeding up division and sqrt by 5x.
View full changelog here.
b1.3.0
This is a beta release of the v1.3.0 patch. It may still include some bugs.
Changes since v1.2.0:
- Reduce overhead for all algorithms (speed up is pretty miniscule)
LowerThanRawandEqualsRaware now 1.2x faster- Added in-place arguments for
AddRawandSubtractRaw - Fixed bugs for
KaratsubaSqrtandMultiplyToomCook3 - Implemented Burnikel-Ziegler division, speeding division up by 5x.
View full Full changelog here.
v1.2.0
Changes since v1.1.0:
- Implement the Toom-Cook 3 algorithm for multiplication, speeding up multiplication by 200%.
- Implement the Karatsuba square root algorithm, speeding up
:sqrt()by 300%. - Better initial guess for the
NewtonHeronSqrtfunction - Speed up
:LeftShift()by a huge amount - Add
:ModPow()extension
View full Full changelog here.
v1.1.0
v1.0.2
Changes since v1.0.1:
- Speed up division by 300%
- Fix multiplication, modulo and division edge cases
v1.0.1
Changes since v1.0.0:
- Fix division for some edge cases
- Speed up multiplication by ~200%