Enum SortOrder 

pub enum SortOrder {
    SortAsc(SortAsc),
    SortDesc(SortDesc),
    SortUsing(SortUsing),
}

Variants

SortAsc(SortAsc)

SortDesc(SortDesc)

SortUsing(SortUsing)

Trait Implementations

impl AstNode for SortOrder

fn can_cast(kind: SyntaxKind) -> bool

fn cast(syntax: SyntaxNode) -> Option<Self>

fn syntax(&self) -> &SyntaxNode

fn clone_for_update(&self) -> Self

where Self: Sized,

fn clone_subtree(&self) -> Self

where Self: Sized,

impl Clone for SortOrder

fn clone(&self) -> SortOrder

Returns a duplicate 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 Eq for SortOrder

impl From<SortAsc> for SortOrder

fn from(node: SortAsc) -> SortOrder

Converts to this type from the input type.

impl From<SortDesc> for SortOrder

fn from(node: SortDesc) -> SortOrder

Converts to this type from the input type.

impl From<SortUsing> for SortOrder

fn from(node: SortUsing) -> SortOrder

Converts to this type from the input type.

impl Hash for SortOrder

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 SortOrder

fn eq(&self, other: &SortOrder) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SortOrder