Enum Algorithm 

pub enum Algorithm {
    Auto,
    F4,
    F5,
    Buchberger,
    MultiModular,
}

Algorithm selector for groebner_basis.

Auto picks a backend based on the ideal’s size and structure; the other variants force a specific algorithm. See groebner_basis for the unified entry point.

Variants

Auto

Automatically select the most suitable algorithm: the multi-modular pipeline for ℚ ideals (fast path since 0.25.0), F4 otherwise.

F4

Force the F4 matrix algorithm (Faugère 1999).

F5

Force the F5 signature-based algorithm (Faugère 2002).

Buchberger

Force Buchberger’s classic S-polynomial iteration.

MultiModular

Force the multi-modular pipeline (crate::groebner::multi_modular): parallel F5 over lucky primes + CRT/rational reconstruction + exact ℚ verification, with a Hensel-lift shortcut. Only applies to ℚ coefficients; other domains fall back to F4.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Algorithm

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Default for Algorithm

fn default() -> Algorithm

Returns the “default value” for a type.

impl Eq for Algorithm

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Algorithm