Module bitwise::word::gcd

Greatest Common Divisor algorithms that use bit manipulation.

Note: this is not intended to provide the fastest GCD implementation possible, but only to provide those algorithms that are implemented using bit manipulation.

A fast GCD implementation will probably want to switch algorithms depending on the size of the input, and will involve other algorithms like Lehmer's and probably parallelization. The benches/gcd.rs benchmarks might be useful for making these decisions.

Modules

euclid	Recursive implementation of the GCD algorithm.
steins
test_util