Struct BlockOrder 

pub struct BlockOrder { /* private fields */ }

Block ordering: partition variables into contiguous blocks, each compared under its own sub-ordering.

Blocks are defined by boundaries: a sorted list of split points (exclusive upper bounds, not including n_vars). For example, boundaries = [2] with orders = [Lex, Grevlex] on a 4-variable polynomial means: compare variables 0–1 under Lex first; if equal, compare variables 2–3 under Grevlex.

Example

use ocas_poly::sparse::{BlockOrder, MonomialOrder, SubOrder};
use smallvec::smallvec;

let ord = BlockOrder::new(smallvec![2], smallvec![SubOrder::Lex, SubOrder::Grevlex]);
// First compare variables 0–1 lex, then variables 2–3 grevlex.
let a = [1, 0, 0, 0]; // x₀
let b = [0, 1, 0, 0]; // x₁
// Lex: [1,0] > [0,1], so a is "greater" (comes first in ordering)
assert_eq!(ord.cmp(&a, &b), std::cmp::Ordering::Greater);

Implementations

impl BlockOrder

pub fn new( boundaries: SmallVec<[usize; 4]>, orders: SmallVec<[SubOrder; 4]>, ) -> Self

Create a new block ordering.

boundaries must be sorted in ascending order and not include n_vars. orders.len() must equal boundaries.len() + 1.

Trait Implementations

impl Clone for BlockOrder

fn clone(&self) -> BlockOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BlockOrder

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

Formats the value using the given formatter.

impl Default for BlockOrder

fn default() -> Self

Default: single block with Grevlex.

impl Eq for BlockOrder

impl MonomialOrder for BlockOrder

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

Compare two exponent vectors.

impl PartialEq for BlockOrder

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BlockOrder