Struct Grlex 

pub struct Grlex;

Graded lexicographic ordering: first by total degree descending, then lexicographic.

Grlex is sometimes preferred over grevlex in Gröbner basis computations because it can lead to smaller intermediate matrices in the F4 algorithm.

Example

use ocas_poly::sparse::{Grlex, MonomialOrder};

let a = [2, 0]; // x^2, degree 2
let b = [1, 1]; // x*y, degree 2
let c = [0, 3]; // y^3, degree 3
// c has highest degree, so it comes first
assert_eq!(Grlex::cmp(&c, &a), std::cmp::Ordering::Less);
// a and b have same degree; a > b lexicographically
assert_eq!(Grlex::cmp(&a, &b), std::cmp::Ordering::Greater);

Trait Implementations

impl Clone for Grlex

fn clone(&self) -> Grlex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Grlex

impl Debug for Grlex

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

Formats the value using the given formatter.

impl Eq for Grlex

impl MonomialOrder for Grlex

fn cmp(lhs: &[usize], rhs: &[usize]) -> Ordering

Compare two exponent vectors.

impl PartialEq for Grlex

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Grlex