Struct BlockOrder 

pub struct BlockOrder {
    pub within_blocks: OrderKind,
    pub between_blocks: OrderKind,
}

The ordering contract for a row partition within and between its blocks.

Fields

within_blocks: OrderKind

Whether ordinal order matters inside each block.

between_blocks: OrderKind

Whether the block list itself is ordered.

Implementations

impl BlockOrder

pub const fn new(within_blocks: OrderKind, between_blocks: OrderKind) -> Self

Creates an explicit ordering contract.

pub const fn total() -> Self

Marks both block-internal and block-to-block order as total.

pub const fn partially_ordered_blocks() -> Self

Marks block-internal order as total but block-to-block order as partial.

pub const fn unordered() -> Self

Marks both block-internal and block-to-block order as intentionally absent.

Trait Implementations

impl Clone for BlockOrder

fn clone(&self) -> BlockOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BlockOrder

impl Debug for BlockOrder

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

Formats the value using the given formatter.

impl Eq for BlockOrder

impl Hash for BlockOrder

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 PartialEq for BlockOrder

fn eq(&self, other: &BlockOrder) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BlockOrder