Enum BlockOrder 

pub enum BlockOrder {
    InsertTime,
    EventTime,
}

How source blocks are ordered before being cut into JIT partitions.

The choice matters because generate_stream_jit_partitions_segment and the batched block queries driven by generate_stream_jit_partitions / generate_process_jit_partitions fetch blocks with ORDER BY insert_time, block_id, and that SQL order is what group_blocks_into_partitions starts from.

Variants

InsertTime

Registration order (insert_time, block_id), i.e. the SQL order is kept as-is. Correct for views that decode each block independently and declare no scan ordering: cutting an insert-ordered list always yields insert-time ranges that are non-decreasing and non-overlapping across partitions, by construction.

EventTime

Event order (begin_ticks, end_ticks). Required by views that build cross-block trees or derive event-time bounds from the list endpoints, and by any view declaring ScanOrdering::Concatenated over an event-time column. Sorting by event time can put blocks with out-of-order insert_time inside one partition or straddling a cut point, so group_blocks_into_partitions additionally enforces insert-safe cut points (see its docs) to keep JIT partitions’ insert-time ranges non-overlapping.

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<(), Error>

Formats the value using the given formatter.

impl Eq for BlockOrder

impl PartialEq for BlockOrder

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BlockOrder