Enum query_structure::prelude::OrderByHop

pub enum OrderByHop {
    Relation(RelationFieldRef),
    Composite(CompositeFieldRef),
}

Describes a hop over to a relation or composite for an orderBy statement.

Variants

Relation(RelationFieldRef)

Composite(CompositeFieldRef)

Implementations

impl OrderByHop

pub fn as_relation_hop(&self) -> Option<&RelationFieldRef>

Trait Implementations

impl Clone for OrderByHop

fn clone(&self) -> OrderByHop

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for OrderByHop

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

Formats the value using the given formatter.

impl From<&Zipper<CompositeFieldId>> for OrderByHop

fn from(cf: &CompositeFieldRef) -> Self

Converts to this type from the input type.

impl From<&Zipper<RelationFieldId>> for OrderByHop

fn from(rf: &RelationFieldRef) -> Self

Converts to this type from the input type.

impl From<Zipper<CompositeFieldId>> for OrderByHop

fn from(cf: CompositeFieldRef) -> Self

Converts to this type from the input type.

impl From<Zipper<RelationFieldId>> for OrderByHop

fn from(rf: RelationFieldRef) -> Self

Converts to this type from the input type.

impl Hash for OrderByHop

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for OrderByHop

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

impl StructuralEq for OrderByHop

impl StructuralPartialEq for OrderByHop