Enum Order 

#[non_exhaustive]
pub enum Order {
    Natural,
    Arbitrary,
    Sorted,
    Significant,
}

How significant the order of the elements of a container is.

The default (Order::Natural) means the natural semantics of the container: the order of sequences is significant, the order of maps is not but the emitted order is kept. Only deviations are marked.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Natural

The natural semantics of the container.

Arbitrary

The order is not significant and the elements are emitted in an arbitrary order that can change between runs (HashMap, HashSet).

Sorted

The order is not significant and the elements are sorted (BTreeMap, BTreeSet).

Significant

The order is significant, also for maps.

Trait Implementations

impl Clone for Order

fn clone(&self) -> Order

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Order

impl Debug for Order

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

Formats the value using the given formatter.

impl Default for Order

fn default() -> Order

Returns the “default value” for a type.

impl Eq for Order

impl Hash for Order

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Order

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Order