* optimization: in taking the GCD of bignums, reduce the two bignums
to approximately the same size (using Euclid's algorithm) before
applying the more sophisticated binary GCD. (thanks to Juho
Snellman)
* optimization: COUNT on bitvectors now operates word-at-a-time.
* optimization: in taking the GCD of bignums, reduce the two bignums
to approximately the same size (using Euclid's algorithm) before
applying the more sophisticated binary GCD. (thanks to Juho
Snellman)
* optimization: COUNT on bitvectors now operates word-at-a-time.