Struct Sort

pub struct Sort {
    pub key: SortKey,
    pub descending: bool,
}

How a result is ordered.

A query with no order is a query whose second page means nothing: paging is only meaningful while the order is the same on every run. Catalog order is the default because it is deterministic; everything else is asked for.

Fields

key: SortKey

What to order on.

descending: bool

true to put the largest, latest or highest first.

Implementations

impl Sort

pub fn parse(input: &str) -> Result<Sort, QueryError>

Reads year, year- or -year; the sign is the direction.

Trait Implementations

impl Clone for Sort

fn clone(&self) -> Sort

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Sort

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

Formats the value using the given formatter.

impl PartialEq for Sort

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

impl Eq for Sort

impl StructuralPartialEq for Sort