Enum Order 

pub enum Order {
    AccessOrder,
    InsertionOrder,
}

An enum used to specify the iteration order for the LinkedHashMap.

InsertionOrder is the order in which the keys were inserted into the map from least recently inserted (oldest) to most recently inserted (newest).

AccessOrder is the order in which the keys in the map were last accessed from least-recently accessed (oldest) to most recently accessed (newest).

Variants

AccessOrder

LinkedHashMap iteration order from least-recently accessed to most-recently accessed.

InsertionOrder

LinkedHashMap iteration order from least-recently inserted to most-recently inserted.

Trait Implementations

impl Debug for Order

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

Formats the value using the given formatter.

impl PartialEq for Order

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

impl StructuralPartialEq for Order