Enum atspi_common::object_match::SortOrder

#[repr(u32)]
pub enum SortOrder {
    Invalid = 0,
    Canonical = 1,
    Flow = 2,
    Tab = 3,
    ReverseCanonical = 4,
    ReverseFlow = 5,
    ReverseTab = 6,
}

Enumeration used by interface CollectionProxy to specify the way ObjectRef objects should be sorted.

Note

Only Canonical and ReverseCanonical are currently implemented in the known implementation of Collection.

see: issue 140. “Are all the AtspiCollectionSortOrder types really a thing?”

Variants

Invalid = 0

Invalid sort order

Unimplemented

Canonical = 1

Canonical sort order

Flow = 2

Flow sort order

Unimplemented

Tab = 3

Tab sort order

Unimplemented

ReverseCanonical = 4

Reverse canonical sort order

ReverseFlow = 5

Reverse flow sort order

Unimplemented

ReverseTab = 6

Reverse tab sort order

Unimplemented

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 for SortOrder

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