Struct SortBy 

pub struct SortBy { /* private fields */ }

Implementations

impl SortBy

pub fn expr(&self) -> Option<Expr>

pub fn nulls_first(&self) -> Option<NullsFirst>

pub fn nulls_last(&self) -> Option<NullsLast>

pub fn sort_asc(&self) -> Option<SortAsc>

pub fn sort_desc(&self) -> Option<SortDesc>

pub fn sort_using(&self) -> Option<SortUsing>

Trait Implementations

impl AstNode for SortBy

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 SortBy

fn clone(&self) -> SortBy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortBy

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

Formats the value using the given formatter.

impl Hash for SortBy

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 SortBy

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

impl StructuralPartialEq for SortBy