## unreleased
- Use [`primal`](https://crates.io/crates/primal) in `is_gaussian_prime` algorithm.
Much, much faster!
- Added a new example `prime1mod4` to compute a certain kind of Gaussian prime.
- Rename `is_divisor_of` method to `divides`.
- Add `units` function to return ±1, ±*i*.
- Add `is_associated` method.
## Release 0.4.0 (2022-01-28)
Add `gaussint` macro for creating new `GaussianInt`s.
## Release 0.3.1 (2022-01-28)
Fix the status badge on crates.io.
## Release 0.3.0 (2022-01-28)
- Add a method to test for congruence between two Gaussian integers, modulo a third.
- Add methods to test for "even" and "odd" Gaussian integers.
## Earlier
Lost to time...