Enum OrderRepr 

pub enum OrderRepr {
    Exact,
    Relative,
}

Representation of order cache in an order-cached list. This will determine when the order cache is invalidated.

Variants

Exact

The order exactly represents the position in the list. e.g.

List: (Head = 0) <-> A(1) <-> B(2) <-> C(3) <-> (Tail = usize::MAX)

Invalidates the order cache on any insertion or removal except when inserting at the end or removing the last element.

Relative

The order represents a relative position in the list, but not necessarily the exact index. e.g.

List: (Head = 0) <-> A(1) <-> B(3) <-> C(4) <-> (Tail = usize::MAX)

Trait Implementations

impl Clone for OrderRepr

fn clone(&self) -> OrderRepr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OrderRepr

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

Formats the value using the given formatter.

impl PartialEq for OrderRepr

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

impl Eq for OrderRepr

impl StructuralPartialEq for OrderRepr