Enum gtk4::SorterOrder

#[non_exhaustive]
pub enum SorterOrder {
    Partial,
    None,
    Total,
}

Describes the type of order that a Sorter may produce.

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.

Partial

A partial order. Any Ordering is possible.

None

No order, all elements are considered equal. gtk_sorter_compare() will only return Ordering::Equal.

Total

A total order. gtk_sorter_compare() will only return Ordering::Equal if an item is compared with itself. Two different items will never cause this value to be returned.

Trait Implementations

impl Clone for SorterOrder

fn clone(&self) -> SorterOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SorterOrder

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

Formats the value using the given formatter.

impl Display for SorterOrder

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

Formats the value using the given formatter.

impl<'a> FromValue<'a> for SorterOrder

type Checker = GenericValueTypeChecker<SorterOrder>

Value type checker.

unsafe fn from_value(value: &'a Value) -> Self

Get the contained value from a Value.

impl Hash for SorterOrder

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

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 Ord for SorterOrder

fn cmp(&self, other: &SorterOrder) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<SorterOrder> for SorterOrder

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<SorterOrder> for SorterOrder

fn partial_cmp(&self, other: &SorterOrder) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl StaticType for SorterOrder

fn static_type() -> Type

Returns the type identifier of Self.

impl ToValue for SorterOrder

fn to_value(&self) -> Value

Convert a value to a Value.

fn value_type(&self) -> Type

Returns the type identifer of self.

impl ValueType for SorterOrder

type Type = SorterOrder

Type to get the Type from.

impl Copy for SorterOrder

impl Eq for SorterOrder

impl StructuralEq for SorterOrder

impl StructuralPartialEq for SorterOrder