Enum datafusion::physical_plan::windows::PartitionSearchMode

pub enum PartitionSearchMode {
    Linear,
    PartiallySorted(Vec<usize>),
    Sorted,
}

Specifies aggregation grouping and/or window partitioning properties of a set of expressions in terms of the existing ordering. For example, if the existing ordering is [a ASC, b ASC, c ASC]:

• A PARTITION BY b clause will result in Linear mode.
• A PARTITION BY a, c or a PARTITION BY c, a clause will result in PartiallySorted([0]) or PartiallySorted([1]) modes, respectively. The vector stores the index of a in the respective PARTITION BY expression.
• A PARTITION BY a, b or a PARTITION BY b, a clause will result in Sorted mode. Note that the examples above are applicable for GROUP BY clauses too.

Variants

Linear

There is no partial permutation of the expressions satisfying the existing ordering.

PartiallySorted(Vec<usize>)

There is a partial permutation of the expressions satisfying the existing ordering. Indices describing the longest partial permutation are stored in the vector.

Sorted

There is a (full) permutation of the expressions satisfying the existing ordering.

Trait Implementations

impl Clone for PartitionSearchMode

fn clone(&self) -> PartitionSearchMode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PartitionSearchMode

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

Formats the value using the given formatter.

impl PartialEq for PartitionSearchMode

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