Struct SortingColumn

pub struct SortingColumn {
    pub column_idx: i32,
    pub descending: bool,
    pub nulls_first: bool,
}

Sort order within a RowGroup of a leaf column

Fields

column_idx: i32

The ordinal position of the column (in this row group) *

descending: bool

If true, indicates this column is sorted in descending order. *

nulls_first: bool

If true, nulls will come before non-null values, otherwise, nulls go at the end.

Implementations

impl SortingColumn

pub fn new( column_idx: i32, descending: bool, nulls_first: bool, ) -> SortingColumn

Trait Implementations

impl Clone for SortingColumn

fn clone(&self) -> SortingColumn

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SortingColumn

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

Formats the value using the given formatter.

impl Hash for SortingColumn

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 HeapSize for SortingColumn

fn heap_size(&self) -> usize

Return the size of any bytes allocated on the heap by this object, including heap memory in those structures

impl Ord for SortingColumn

fn cmp(&self, other: &SortingColumn) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for SortingColumn

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

fn partial_cmp(&self, other: &SortingColumn) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl TSerializable for SortingColumn

fn read_from_in_protocol<T: TInputProtocol>( i_prot: &mut T, ) -> Result<SortingColumn>

Reads the struct from the input Thrift protocol

fn write_to_out_protocol<T: TOutputProtocol>( &self, o_prot: &mut T, ) -> Result<()>

Writes the struct to the output Thrift protocol

impl Eq for SortingColumn

impl StructuralPartialEq for SortingColumn