Struct PartialOrderChecker 

pub struct PartialOrderChecker<T> {
    pub elements: Vec<T>,
    pub le: Box<dyn Fn(&T, &T) -> bool>,
}

Checker for partial-order properties on a finite set encoded as a comparison closure.

Fields

elements: Vec<T>

Elements of the poset.

le: Box<dyn Fn(&T, &T) -> bool>

The underlying partial order relation: returns true iff a ≤ b.

Implementations

impl<T: Clone + PartialEq> PartialOrderChecker<T>

pub fn new(elements: Vec<T>, le: impl Fn(&T, &T) -> bool + 'static) -> Self

Create a new checker.

pub fn check_reflexive(&self) -> bool

Verify reflexivity: ∀ a, a ≤ a.

pub fn check_transitive(&self) -> bool

Verify transitivity: ∀ a b c, a ≤ b ∧ b ≤ c → a ≤ c.

pub fn check_antisymmetric(&self) -> bool

Verify antisymmetry: ∀ a b, a ≤ b ∧ b ≤ a → a = b.

pub fn is_partial_order(&self) -> bool

Check all three partial-order axioms at once.

pub fn maximal_elements(&self) -> Vec<T>

Find all maximal elements (no strictly larger element exists).

pub fn minimal_elements(&self) -> Vec<T>

Find all minimal elements.