Struct Sort 

pub struct Sort {
    pub input: PlanNodeId,
    pub items: Vec<ResolvedSortItem>,
    pub top_k: Option<usize>,
    pub limit: Option<SortLimit>,
}

Fields

input: PlanNodeId

items: Vec<ResolvedSortItem>

top_k: Option<usize>

Optional upper bound for rows the sort must retain because a parent LIMIT will discard everything after this many sorted rows.

limit: Option<SortLimit>

The parent LIMIT’s SKIP / LIMIT expressions when they are not literals (LIMIT $n): the executor evaluates them once per run and keeps only skip + limit rows, like a static Sort::top_k.

Trait Implementations

impl Clone for Sort

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Sort

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

Formats the value using the given formatter.