Struct FiniteLinearOrder 

pub struct FiniteLinearOrder {
    pub size: usize,
    pub order: Vec<usize>,
}

A finite linear order (totally ordered finite set).

Elements are represented as indices 0..n, with a permutation defining the order.

Fields

size: usize

Number of elements.

order: Vec<usize>

The permutation defining the order: order[i] is the i-th smallest element.

Implementations

impl FiniteLinearOrder

pub fn identity(n: usize) -> Self

Create the identity linear order on {0, …, n-1}.

pub fn from_permutation(perm: Vec<usize>) -> Option<Self>

Create a linear order from a permutation.

pub fn compare(&self, a: usize, b: usize) -> Ordering

Compare two elements a, b (by their rank in the order).

pub fn rank(&self, a: usize) -> Option<usize>

Get the rank (0-indexed position) of an element.

pub fn min_elem(&self) -> Option<usize>

Get the minimum element.

pub fn max_elem(&self) -> Option<usize>

Get the maximum element.

pub fn is_well_founded(&self) -> bool

Check if the order is well-founded (always true for finite sets).

pub fn reverse_order(&self) -> FiniteLinearOrder

Reverse the order.