Struct OrderFinding 

pub struct OrderFinding {
    pub earlier: usize,
    pub later: usize,
    pub cause: OrderCause,
}

One actual adjacent pair whose required chronological order is not proven.

Fields

earlier: usize

Original earlier archive timestamp ordinal.

later: usize

Original next archive timestamp ordinal.

cause: OrderCause

Reversal, overlap or missing information, independently of trust facts.

Trait Implementations

impl Clone for OrderFinding

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for OrderFinding

impl Debug for OrderFinding

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

Formats the value using the given formatter.

impl Eq for OrderFinding

impl PartialEq for OrderFinding

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OrderFinding