Set rust-version to 1.81.0

Because crates.io auto sets it to 1.56.0 because the crate uses edition 2021. This version is too old to compile the crate.

Author: JSorngard

CHANGELOG.md

@@ -2,22 +2,28 @@
 
 This file contains the changes to the crate since version 0.4.8.
 
+## 0.9.5
+
+- Set `rust-version` to 1.81.0 since crates.io now auto sets it to the first
+ version on the given edition if you do not set anything.
+ For this crate that would be 1.56.0, which is too old to compile it.
+
 ## 0.9.4
 
 - Documentation improvements for the macros.
 
 ## 0.9.3
 
-- Clarify which crate versions have which MSRVs.
+- Clarified which crate versions have which MSRVs.
 
 ## 0.9.2
 
-- Correct docstring of `Primes<N>`.
+- Corrected docstring of `Primes<N>`.
 
 ## 0.9.1
 
-- Correct docstring of `Primes<N>::default`.
-- Correct docstring of `Primes<N>::new`.
+- Corrected docstring of `Primes<N>::default`.
+- Corrected docstring of `Primes<N>::new`.
 
 ## 0.9.0
 

Cargo.lock

@@ -1,14 +1,15 @@
 [package]
 name = "const-primes"
 authors = ["Johanna Sörngård <[email protected]>"]
-version = "0.9.4"
+version = "0.9.5"
 edition = "2021"
 license = "MIT OR Apache-2.0"
 keywords = ["const", "primes", "no_std", "prime-numbers"]
 categories = ["mathematics", "no-std", "no-std::no-alloc", "algorithms"]
 description = "Work with prime numbers in const contexts. Prime generation, primality testing, prime counting, and more."
 repository = "https://github.com/JSorngard/const-primes/"
 documentation = "https://docs.rs/const-primes"
+rust-version = "1.81.0"
 
 [dependencies]
 serde = { version = "1.0", default-features = false, features = ["derive"], optional = true }

Cargo.toml

@@ -14,7 +14,7 @@ or check whether a number is prime in a const function.
 
 `no_std` compatible when the `serde` feature is disabled.
 
-This version of the crate supports Rust versions 1.81.0 and up, 
+This version of the crate supports Rust versions 1.81.0 and up,
 while versions 0.8.7 and older support Rust versions 1.67.1 and up.
 
 ## Example: generate primes at compile time and use them for related computations
@@ -61,11 +61,13 @@ assert!(CHECK);
 
 ## Example: generate the three primes after 5000000031
 
-The crate also provides prime generation and sieving functionality for computing arrays of
-large prime numbers above or below some limit, without having to also include every single prime number from 2 and up in the
-resulting constant, and thus potentially the binary.  
-This functionality is most conveniently accessed through the macros `primes_segment!` and
-`sieve_segment!` that automatically compute the size of the prime sieve that is needed for a certain computation.
+The crate also provides prime generation and sieving functionality for computing
+arrays of large prime numbers above or below some limit, without having to also
+include every single prime number from 2 and up in the resulting constant,
+and thus potentially the binary.  
+This functionality is most conveniently accessed through the macros `primes_segment!`
+and `sieve_segment!` that automatically compute the size of the prime sieve that
+is needed for a certain computation.
 
 Compute 3 primes greater than or equal to 5000000031: