Struct SortOrder

pub struct SortOrder(/* private fields */);

This enum describes how the items in a widget are sorted.

C++ enum: Qt::SortOrder.

C++ documentation:

This enum describes how the items in a widget are sorted.

Implementations

impl SortOrder

pub fn to_int(&self) -> c_int

impl SortOrder

pub const AscendingOrder: SortOrder

The items are sorted ascending e.g. starts with ‘AAA’ ends with ‘ZZZ’ in Latin-1 locales (C++ enum variant: AscendingOrder = 0)

pub const DescendingOrder: SortOrder

The items are sorted descending e.g. starts with ‘ZZZ’ ends with ‘AAA’ in Latin-1 locales (C++ enum variant: DescendingOrder = 1)

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

fn from(value: SortOrder) -> Self

Converts to this type from the input type.

impl From<i32> for SortOrder

fn from(value: c_int) -> Self

Converts to this type from the input type.

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

impl Eq for SortOrder

impl StructuralPartialEq for SortOrder