Struct Garner 

pub struct Garner<T>
where
    T: Unsigned,
{ /* private fields */ }

Garner’s algorithm with precomputation for fixed moduli.

Implementations

impl<T> Garner<T>

where T: Unsigned,

pub fn new<M>(moduli: M, modulo: T) -> Option<Self>

where M: IntoIterator<Item = T>,

pub fn new_unchecked<M>(moduli: M, modulo: T) -> Self

where M: IntoIterator<Item = T>,

Examples found in repository

crates/competitive/src/math/garner.rs (line 36)

    pub fn new<M>(moduli: M, modulo: T) -> Option<Self>
    where
        M: IntoIterator<Item = T>,
    {
        if modulo == T::zero() {
            return None;
        }
        let moduli: Vec<_> = moduli.into_iter().collect();
        if moduli.iter().any(|&m| m.is_zero()) {
            return None;
        }
        let n = moduli.len();
        for i in 0..n {
            for j in 0..i {
                if moduli[i].gcd(moduli[j]) != T::one() {
                    return None;
                }
            }
        }
        Some(Self::new_unchecked(moduli, modulo))
    }

pub fn solve<B, I>(&self, residues: B) -> Option<T>

where B: IntoIterator<Item = T, IntoIter = I>, I: ExactSizeIterator<Item = T>,