bump num-modular to version 0.6.1

Author: sylvestre

Cargo.toml

@@ -18,7 +18,7 @@ readme = "README.md"
 [dependencies]
 num-integer = "0.1.44"
 num-traits = "0.2.14"
-num-modular = "0.5.0"
+num-modular = "0.6.1"
 bitvec = "1.0.0"
 rand = "0.8.4"
 lru = "0.12.2"
@@ -33,7 +33,7 @@ features = ["rand"]
 default = ['big-table', 'big-int']
 big-table = []
 # TODO: use the new cargo feature to override the num-bigint option
-big-int = ['num-bigint', 'num-modular/num-bigint']
+big-int = ['num-modular/num-bigint', 'num-modular/num-traits', 'num-modular/num-integer']
 
 [workspace]
 members = [

src/mint.rs

@@ -669,17 +669,17 @@ impl<T: Integer + Clone, R: Reducer<T> + Clone> ModularPow<&Self, &Self> for Min
     #[inline]
     fn powm(self, exp: &Self, m: &Self) -> Self::Output {
         Self(Right(match (self.0, &exp.0, &m.0) {
-            (Left(v), Left(e), Left(m)) => ReducedInt::new(v, m).pow(e.clone()),
+            (Left(v), Left(e), Left(m)) => ReducedInt::new(v, m).pow(&e.clone()),
             (Right(v), Left(e), Left(m)) => {
                 debug_assert!(&v.modulus() == m);
-                v.pow(e.clone())
+                v.pow(&e.clone())
             }
             (_, _, _) => unreachable!(),
         }))
     }
 }
 
-pub type SmallMint<T> = Mint<T, Montgomery<T, T>>;
+pub type SmallMint<T> = Mint<T, Montgomery<T>>;
 
 #[cfg(test)]
 mod tests {

src/nt_funcs.rs

@@ -24,7 +24,6 @@ use crate::tables::{SMALL_PRIMES_INV, ZETA_LOG_TABLE};
 use crate::traits::{FactorizationConfig, Primality, PrimalityTestConfig, PrimalityUtils};
 use crate::{BitTest, ExactRoots};
 use num_integer::Roots;
-#[cfg(feature = "num-bigint")]
 use num_modular::DivExact;
 use num_modular::{ModularCoreOps, ModularInteger, MontgomeryInt};
 use num_traits::{CheckedAdd, FromPrimitive, Num, RefNum, ToPrimitive};

src/tables.rs

@@ -89,7 +89,7 @@ pub const SMALL_PRIMES_NEXT: u64 = 8167;
 
 //////////////////// Pre-computed inversions for primes ////////////////////
 #[cfg(feature = "big-table")]
-type P64 = num_modular::PreInv<u64>;
+type P64 = num_modular::PreModInv<u64>;
 
 /// Precomputed modular inverse for fast divisibility check
 ///