Struct IntCrtSolver 

pub struct IntCrtSolver { /* private fields */ }

Chinese Remainder Theorem solver for a system of congruences.

Solves: x ≡ r_i (mod m_i) for pairwise coprime moduli.

Implementations

impl IntCrtSolver

pub fn new() -> Self

Create a new CRT solver with no congruences.

pub fn add_congruence(&mut self, remainder: i64, modulus: i64)

Add a congruence x ≡ remainder (mod modulus).

pub fn solve(&self) -> Option<(i64, i64)>

Solve the system and return the smallest non-negative x, plus the combined modulus M. Returns None if the moduli are not pairwise coprime.

pub fn len(&self) -> usize

Number of congruences registered.

pub fn is_empty(&self) -> bool

Returns true if no congruences have been added.

Trait Implementations

impl Clone for IntCrtSolver

fn clone(&self) -> IntCrtSolver

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for IntCrtSolver

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for IntCrtSolver

fn default() -> Self

Returns the “default value” for a type.