Struct BoundaryOrder

pub struct BoundaryOrder(pub i32);

Enum to annotate whether lists of min/max elements inside ColumnIndex are ordered and if so, in which direction.

Tuple Fields

0: i32

Implementations

impl BoundaryOrder

pub const UNORDERED: BoundaryOrder = _

pub const ASCENDING: BoundaryOrder = _

pub const DESCENDING: BoundaryOrder = _

pub const ENUM_VALUES: &'static [Self] = _

Trait Implementations

impl Clone for BoundaryOrder

fn clone(&self) -> BoundaryOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BoundaryOrder

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

Formats the value using the given formatter.

impl From<&BoundaryOrder> for i32

fn from(e: &BoundaryOrder) -> i32

Converts to this type from the input type.

impl From<&i32> for BoundaryOrder

fn from(i: &i32) -> Self

Converts to this type from the input type.

impl From<BoundaryOrder> for i32

fn from(e: BoundaryOrder) -> i32

Converts to this type from the input type.

impl From<i32> for BoundaryOrder

fn from(i: i32) -> Self

Converts to this type from the input type.

impl Hash for BoundaryOrder

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 Ord for BoundaryOrder

fn cmp(&self, other: &BoundaryOrder) -> 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 BoundaryOrder

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

fn partial_cmp(&self, other: &BoundaryOrder) -> 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 BoundaryOrder

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

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

impl Copy for BoundaryOrder

impl Eq for BoundaryOrder

impl StructuralPartialEq for BoundaryOrder