Enum SortStrategy 

pub enum SortStrategy {
    None,
    Incremental {
        prefix_len: usize,
    },
    Full,
}

Strategy hint returned by plan_sort — tells the runtime whether to use a full sort, an incremental sort, or skip the sort operator entirely because the input is already sorted.

Variants

None

Input is already in the required order — no sort needed. The planner can elide the Sort node.

Incremental

Input matches a prefix of the required order. Use incremental_sort_top_k with the matching prefix length.

Fields

prefix_len: usize

Full

Input has no relevant order. Full sort required.

Trait Implementations

impl Clone for SortStrategy

fn clone(&self) -> SortStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortStrategy

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

Formats the value using the given formatter.

impl PartialEq for SortStrategy

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

impl Eq for SortStrategy

impl StructuralPartialEq for SortStrategy