Struct SortKey 

pub struct SortKey {
    pub field: String,
    pub descending: bool,
}

One sort key for a bounded read; ascending puts nulls first and descending last. Include a unique identity key to make equal-value paging deterministic.

Fields

field: String

descending: bool

Trait Implementations

impl Clone for SortKey

fn clone(&self) -> SortKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortKey

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SortKey

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SortKey

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SortKey

impl StructuralPartialEq for SortKey