Struct OrderingCert 

pub struct OrderingCert {
    pub n: usize,
    pub edge: Vec<u32>,
}

A re-checkable ordering-principle refutation: the recovered element/edge identification of a complete GT(n) core. edge[i * n + j] is the comparison variable x_ij (“i < j”) for the ordered pair (i, j); diagonal entries (i == j) are u32::MAX and unused. Given this map a checker re-verifies that every totality, antisymmetry, transitivity, and no-maximum clause is present — the whole certificate, no trust in the recognizer.

Fields

n: usize

The number of ordered elements.

edge: Vec<u32>

The comparison variable x_ij at flat index i * n + j (diagonal = u32::MAX).

Implementations

impl OrderingCert

pub fn byte_len(&self) -> usize

The serialized size in bytes: the element count plus one 32-bit variable id per off-diagonal ordered pair — the O(n²) identification a checker consumes.

Trait Implementations

impl Clone for OrderingCert

fn clone(&self) -> OrderingCert

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OrderingCert

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

Formats the value using the given formatter.

impl PartialEq for OrderingCert

fn eq(&self, other: &OrderingCert) -> 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 Eq for OrderingCert

impl StructuralPartialEq for OrderingCert