Changes for version 0.07 - 2017-04-28
- IMPROVEMENTS
- Minor optimization in `numify()` for integers and rationals.
- Added checks for exact divisibility of two integers.
- Optimized the gcd() and lcm() functions when the second argument is a native integer.
- Documentation improvements.
- FIXES
- Fixed the creation of very large constant integers in `:overload` mode.
- Fixed the creation of binary, octal and hexadecimal constants that contain underscores (in `:overload` mode).
Modules
Arbitrary size precision for integers, rationals, floating-points and complex numbers.
Examples
- examples/agm_pi.pl
- examples/arithmetic_coding.pl
- examples/bernoulli_numbers_recursive.pl
- examples/bernoulli_seidel.pl
- examples/binary_arithmetic_coding.pl
- examples/binradix_arithmetic_coding.pl
- examples/computing_pi.pl
- examples/faulhaber_s_formula.pl
- examples/fibonacci.pl
- examples/fibonacci_validation.pl
- examples/halley_s_method.pl
- examples/inverse_of_factorial.pl
- examples/is_power.pl
- examples/lambert_W.pl
- examples/miller_rabin_primality_test.pl
- examples/newton_s_method.pl
- examples/pi_machin.pl
- examples/power_pairs.pl
- examples/prime_count_approx.pl
- examples/rsa_algorithm.pl
- examples/solve_pell_equation.pl
- examples/tac-compressor.pl
- examples/tribonacci.pl
- examples/zeta_2n.pl
- examples/zeta_2n_fast.pl