use num_traits::{PrimInt, ToPrimitive, FromPrimitive, Unsigned};
pub mod sieve;
pub mod miller_rabin;
pub mod zeta;
#[cfg(test)]
mod tests;
pub trait PrimalityTest<N: PrimInt> {
fn name(&self) -> &'static str;
fn is_prime(&self, n: N) -> bool;
}
pub struct PrimalityRegistry<N: PrimInt> {
algorithms: Vec<Box<dyn PrimalityTest<N>>>,
}
impl<N: PrimInt + ToPrimitive + FromPrimitive + Unsigned> PrimalityRegistry<N> {
pub fn new() -> Self {
PrimalityRegistry {
algorithms: Vec::new(),
}
}
pub fn with_all_algorithms() -> Self {
let mut registry = PrimalityRegistry::new();
registry.register(sieve::SieveAlgorithm::default());
registry.register(miller_rabin::MillerRabinAlgorithm::default());
registry.register(zeta::ZetaAlgorithm::default());
registry
}
pub fn register<T: PrimalityTest<N> + 'static>(&mut self, algo: T) {
self.algorithms.push(Box::new(algo));
}
pub fn algorithms(&self) -> &[Box<dyn PrimalityTest<N>>] {
&self.algorithms
}
pub fn get_by_name(&self, name: &str) -> Option<&Box<dyn PrimalityTest<N>>> {
self.algorithms.iter().find(|a| a.name() == name)
}
}
impl<N: PrimInt + ToPrimitive + FromPrimitive + Unsigned> Default for PrimalityRegistry<N> {
fn default() -> Self {
Self::new()
}
}