Change order of doclinks in sieve_segment!

src/lib.rs

@@ -109,20 +109,20 @@
 // This is used since there is currently no way to be generic over types that can do arithmetic at compile time.
 type Underlying = u32;
 
-mod prime_counting;
-mod prime_generation;
 mod integer_math;
 mod other_prime;
 mod primality_checking;
 mod prime_cache;
+mod prime_counting;
+mod prime_generation;
 mod sieving;
 
-pub use prime_counting::count_primes;
-pub use prime_generation::{primes, primes_geq, primes_lt, GenerationError};
 pub use integer_math::isqrt;
 pub use other_prime::{next_prime, previous_prime};
 pub use primality_checking::is_prime;
 pub use prime_cache::Primes;
+pub use prime_counting::count_primes;
+pub use prime_generation::{primes, primes_geq, primes_lt, GenerationError};
 pub use sieving::{sieve, sieve_geq, sieve_lt, SieveError};
 
 #[cfg(test)]

src/sieving.rs

@@ -339,7 +339,7 @@ pub const fn sieve_geq<const N: usize, const MEM: usize>(
     Ok(ans)
 }
 
-/// Call [`sieve_lt`] and [`sieve_geq`], and automatically compute the memory requirement of the sieve.
+/// Call [`sieve_geq`] or [`sieve_lt`], and automatically compute the memory requirement of the sieve.
 ///
 /// Computes the value of the const generic `MEM` as `isqrt(upper_limit) + 1` for [`sieve_lt`]
 /// and as `isqrt(lower_limit) + 1 + N` for [`sieve_geq`].