Struct ColumnarOrderByValues 

pub struct ColumnarOrderByValues { /* private fields */ }

Columnar layout for ORDER BY values - optimized for sorting performance

Instead of Vec<Vec<(Value, bool)>> (row-oriented, N allocations for N rows), this uses Vec<Vec<Value>> (column-oriented, K allocations for K ORDER BY columns).

Benefits:

• Reduces allocations from O(N) to O(K) where K = number of ORDER BY columns
• Stores ascending flags once per column instead of once per value
• Better cache locality when accessing sort keys across rows

Implementations

impl ColumnarOrderByValues

pub fn is_empty(&self) -> bool

Check if empty

pub fn num_columns(&self) -> usize

Get number of columns

pub fn get(&self, row_idx: usize, col_idx: usize) -> Option<&Value>

Get value at (row, column)

pub fn get_first(&self, row_idx: usize) -> Option<&Value>

Get first ORDER BY value for a row

pub fn is_ascending(&self, col_idx: usize) -> bool

Get ascending flag for column

pub fn nulls_first(&self, col_idx: usize) -> bool

Get resolved NULL placement for column.

pub fn rows_equal(&self, row_a: usize, row_b: usize) -> bool

Compare ORDER BY values of two rows for equality (without cloning) Returns true if all ORDER BY column values are equal

Trait Implementations

impl Clone for ColumnarOrderByValues

fn clone(&self) -> ColumnarOrderByValues

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ColumnarOrderByValues

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

Formats the value using the given formatter.