gaussiant 0.8.0

Gaussian integers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

## v0.8.0 (2022-02-09)

- Improve implementation of `Display` to handle e.g., "1-i" and "-i".

## v0.7.0 (2022-02-01)

- Return a `usize` for the `norm()`, since it is always a positive real number.
- Add `get_pos_g_ints` and `get_pos_g_primes` functions
  to return iterators of Gaussian integers and primes with positive real parts.
- Add `mod-arith` example demonstrating properties of modular arithmetic.
- Implement [`FromStr`] for `GaussianInt`.

[`FromStr`]: https://doc.rust-lang.org/std/str/trait.FromStr.html

## v0.6.0 (2022-01-31)

- Implement `num_traits::One` and `num_traits::Zero` for `GaussianInt`.
- Require integer types of `Gaussiant<T>` to implement [`num_integer::Integer`].
- Implement assignment operators in [`num_traits::NumAssignOps`].

[`num_integer::Integer`]: https://docs.rs/num-integer/latest/num_integer/trait.Integer.html
[`num_traits::NumAssignOps`]: https://docs.rs/num-traits/latest/num_traits/trait.NumAssignOps.html

## v0.5.1 (2022-01-30)

- Add new example to show basic plotting.
- Edit documentation.

## v0.5.0 (2022-01-29)

- 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.

## v0.4.0 (2022-01-28)

<!-- Releasing software is fun! -->

Add `gaussint` macro for creating new `GaussianInt`s.

## v0.3.1 (2022-01-28)

Fix the status badge on crates.io.

## v0.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...