Enum BoundaryOrder 

pub enum BoundaryOrder {
    UNORDERED = 0,
    ASCENDING = 1,
    DESCENDING = 2,
}

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

Variants

UNORDERED = 0

ASCENDING = 1

DESCENDING = 2

Implementations

impl BoundaryOrder

pub const VARIANTS: &'static [Self]

Returns a slice containing every variant of this enum.

pub const MAX_DISCRIMINANT: i32 = 2i32

Returns the largest discriminant value defined for this enum.

const fn max_discriminant_impl() -> i32

Trait Implementations

impl Clone for BoundaryOrder

fn clone(&self) -> BoundaryOrder

Returns a duplicate 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 Display for BoundaryOrder

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

Formats the value using the given formatter.

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

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 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<'a, R: ThriftCompactInputProtocol<'a>> ReadThrift<'a, R> for BoundaryOrder

fn read_thrift(prot: &mut R) -> Result<Self>

Read an object of type Self from the input protocol object.

impl WriteThrift for BoundaryOrder

const ELEMENT_TYPE: ElementType = ElementType::I32

The ElementType to use when a list of this object is written.

fn write_thrift<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, ) -> Result<()>

Serialize this object to the given writer.

impl WriteThriftField for BoundaryOrder

fn write_thrift_field<W: Write>( &self, writer: &mut ThriftCompactOutputProtocol<W>, field_id: i16, last_field_id: i16, ) -> Result<i16>

Used to write struct fields (which may be primitive or IDL defined types). This will write the field marker for the given field_id, using last_field_id to compute the field delta used by the Thrift compact protocol. On success this will return field_id to be used in chaining.

impl Copy for BoundaryOrder

impl Eq for BoundaryOrder

impl StructuralPartialEq for BoundaryOrder