Enum gtk4::AccessibleSort

#[non_exhaustive]
pub enum AccessibleSort {
    None,
    Ascending,
    Descending,
    Other,
    // some variants omitted
}

The possible values for the AccessibleProperty::Sort accessible property.

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.

None

There is no defined sort applied to the column.

Ascending

Items are sorted in ascending order by this column.

Descending

Items are sorted in descending order by this column.

Other

A sort algorithm other than ascending or descending has been applied.

Trait Implementations

impl Clone for AccessibleSort

fn clone(&self) -> AccessibleSort

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AccessibleSort

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

Formats the value using the given formatter.

impl Display for AccessibleSort

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

Formats the value using the given formatter.

impl<'a> FromValue<'a> for AccessibleSort

type Checker = GenericValueTypeChecker<AccessibleSort>

Value type checker.

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

Get the contained value from a Value.

impl Hash for AccessibleSort

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 AccessibleSort

fn cmp(&self, other: &AccessibleSort) -> 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<AccessibleSort> for AccessibleSort

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

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

fn static_type() -> Type

Returns the type identifier of Self.

impl ToValue for AccessibleSort

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 AccessibleSort

type Type = AccessibleSort

Type to get the Type from.

impl Copy for AccessibleSort

impl Eq for AccessibleSort

impl StructuralEq for AccessibleSort

impl StructuralPartialEq for AccessibleSort