Enum atspi_common::SortOrder

#[repr(u32)]
pub enum SortOrder {
    Invalid,
    Canonical,
    Flow,
    Tab,
    ReverseCanonical,
    ReverseFlow,
    ReverseTab,
}

Enumeration used by interface CollectionProxy to specify the way crate::accessible::Accessible objects should be sorted.

Variants

Invalid

Invalid sort order

Canonical

Canonical sort order

Flow

Flow sort order

Tab

Tab sort order

ReverseCanonical

Reverse canonical sort order

ReverseFlow

Reverse flow sort order

ReverseTab

Reverse tab sort order

Trait Implementations

impl Clone for SortOrder

fn clone(&self) -> SortOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SortOrder

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SortOrder

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq<SortOrder> for SortOrder

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Type for SortOrder

fn signature() -> Signature<'static>

Get the signature for the implementing type.

impl Copy for SortOrder

impl Eq for SortOrder

impl StructuralEq for SortOrder

impl StructuralPartialEq for SortOrder