pub struct SortingColumn {
pub column_idx: i32,
pub descending: bool,
pub nulls_first: bool,
}👎Deprecated since 57.0.0:
The format module is no longer maintained, and will be removed in 59.0.0
Expand description
Sort order within a RowGroup of a leaf column
Fields§
§column_idx: i32👎Deprecated since 57.0.0:
The format module is no longer maintained, and will be removed in 59.0.0
The ordinal position of the column (in this row group) *
descending: bool👎Deprecated since 57.0.0:
The format module is no longer maintained, and will be removed in 59.0.0
If true, indicates this column is sorted in descending order. *
nulls_first: bool👎Deprecated since 57.0.0:
The format module is no longer maintained, and will be removed in 59.0.0
If true, nulls will come before non-null values, otherwise, nulls go at the end.
Implementations§
Trait Implementations§
Source§impl Clone for SortingColumn
impl Clone for SortingColumn
Source§fn clone(&self) -> SortingColumn
fn clone(&self) -> SortingColumn
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SortingColumn
impl Debug for SortingColumn
impl Eq for SortingColumn
Source§impl Hash for SortingColumn
impl Hash for SortingColumn
Source§impl Ord for SortingColumn
impl Ord for SortingColumn
Source§fn cmp(&self, other: &SortingColumn) -> Ordering
fn cmp(&self, other: &SortingColumn) -> Ordering
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for SortingColumn
impl PartialEq for SortingColumn
Source§impl PartialOrd for SortingColumn
impl PartialOrd for SortingColumn
impl StructuralPartialEq for SortingColumn
Source§impl TSerializable for SortingColumn
impl TSerializable for SortingColumn
Source§fn read_from_in_protocol<T: TInputProtocol>(
i_prot: &mut T,
) -> Result<SortingColumn>
fn read_from_in_protocol<T: TInputProtocol>( i_prot: &mut T, ) -> Result<SortingColumn>
Reads the struct from the input Thrift protocol
Source§fn write_to_out_protocol<T: TOutputProtocol>(
&self,
o_prot: &mut T,
) -> Result<()>
fn write_to_out_protocol<T: TOutputProtocol>( &self, o_prot: &mut T, ) -> Result<()>
Writes the struct to the output Thrift protocol
Auto Trait Implementations§
impl Freeze for SortingColumn
impl RefUnwindSafe for SortingColumn
impl Send for SortingColumn
impl Sync for SortingColumn
impl Unpin for SortingColumn
impl UnsafeUnpin for SortingColumn
impl UnwindSafe for SortingColumn
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.