Struct kip_sql::planner::operator::sort::SortOperator

pub struct SortOperator {
    pub sort_fields: Vec<SortField>,
    pub limit: Option<usize>,
}

Fields

sort_fields: Vec<SortField>

limit: Option<usize>

Support push down limit to sort plan.

Trait Implementations

impl Clone for SortOperator

fn clone(&self) -> SortOperator

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SortOperator

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

Formats the value using the given formatter.

impl Hash for SortOperator

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 SortOperator

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

impl StructuralEq for SortOperator

impl StructuralPartialEq for SortOperator