pub enum Order {
Lex,
GrLex,
GRevLex,
Weighted(Arc<[u32]>, Arc<Self>),
Block(Arc<[(Self, usize)]>),
}Expand description
A monomial order on exponent vectors, variable 0 most significant.
Variants§
Lex
GrLex
GRevLex
Weighted(Arc<[u32]>, Arc<Self>)
Weighted degree first, ties broken by the inner order.
Block(Arc<[(Self, usize)]>)
Product order: each block of variables compared by its own order, left to right.
Implementations§
Source§impl Order
impl Order
pub fn weighted(weights: impl Into<Arc<[u32]>>, tie: Self) -> Self
pub fn block(blocks: impl Into<Arc<[(Self, usize)]>>) -> Self
Sourcepub fn elimination(k: usize, rest: usize) -> Self
pub fn elimination(k: usize, rest: usize) -> Self
Graded reverse lex on the first k variables, then on the remaining rest.
Sourcepub fn eliminates(&self, k: usize) -> bool
pub fn eliminates(&self, k: usize) -> bool
Whether every monomial involving x_0..x_{k-1} exceeds every one free of them, so a Groebner
basis meets F[x_k..] in a basis of the elimination ideal.
pub fn compare(&self, a: &Monomial, b: &Monomial) -> Ordering
pub fn compare_exps(&self, a: &[u32], b: &[u32]) -> Ordering
Trait Implementations§
impl Eq for Order
impl StructuralPartialEq for Order
Auto Trait Implementations§
impl Freeze for Order
impl RefUnwindSafe for Order
impl Send for Order
impl Sync for Order
impl Unpin for Order
impl UnsafeUnpin for Order
impl UnwindSafe for Order
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more