Enum Sorting

#[non_exhaustive]
pub enum Sorting {
    Offset,
    OffsetReversed,
    Name,
}

Apply a kind of sorting

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.

Offset

Sort by addresses of offsets

OffsetReversed

Same as Sorting::Offset, but reversed

Name

Sort by name

Trait Implementations

impl Clone for Sorting

fn clone(&self) -> Sorting

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Sorting

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

Formats the value using the given formatter.

impl PartialEq for Sorting

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

impl Eq for Sorting

impl StructuralPartialEq for Sorting