You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: CHANGELOG.md
+6-1Lines changed: 6 additions & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -5,16 +5,21 @@ This file contains the changes to the crate since version 0.4.8.
5
5
This version focuses on adding support for generating primes and sieving numbers in arbitrary ranges, instead of always having to start from 0.
6
6
7
7
## Breaking changes
8
+
8
9
- Change the name of `are_prime` to `sieve`.
9
10
- Change the name of `are_prime_below` to `sieve_lt`.
10
11
- Change function signature of `sieve_lt`.
11
12
- Change the name of `largest_prime_leq` to `previous_prime`.
12
13
- Change the name of `smallest_prime_lt` to `next_prime`.
13
14
- Remove `moebius`.
14
15
15
-
## Other changes
16
+
## Other major changes
16
17
17
18
- Add `primes_geq`, `primes_lt`, and `sieve_geq` functions to work with arbitrary ranges.
18
19
- Add `primes_segment!` and `sieve_segment!` macros to simplify usage of the above functions. These macros compute the size of the second const generic that the above functions need. Due to restrictions on const arithmetic this can not be done inside the functions (unless I convert their normal input into const generics instead).
19
20
- Add `isqrt` function. This can be useful if you wish to compute the size of the second const generic yourself.
20
21
- Speed up `PRIMES::count_primes_leq` by using a binary instead of linear search.
0 commit comments