Enum RetireMatch 

pub enum RetireMatch {
    Containment,
    Overlap,
}

Which SQL predicate retire_partitions uses to find partitions to replace.

There is no JIT registry to infer “this view regroups blocks across runs” from view_set_name/view_instance_id alone, so callers must say which rule applies to them.

Variants

Containment

The existing partition is fully contained in the new [begin_insert_time, end_insert_time] range (begin_insert_time >= $3 AND end_insert_time <= $4, with an exact-match special case when the new range is degenerate). Correct whenever a view’s cut points are stable across materialization runs: a rewritten range either exactly reproduces an old partition’s range (matched by the exact-match case) or strictly extends it (matched by containment). This holds for every JIT view under BlockOrder::InsertTime and for every non-JIT (batch/merge) partition write. Used by everything except the two BlockOrder::EventTime JIT views.

Overlap

An inclusive insert-range intersection test – tstzrange(begin, end, '[]') && tstzrange($3, $4, '[]') – with same-run siblings excluded by identity (see same_run_ranges below). The '[]' bounds matter twice over: a partition’s [begin_insert_time, end_insert_time] is the inclusive min/max of its blocks’ insert times, so two partitions that merely touch at one instant can both contain a block at that instant and must be considered intersecting; and an inclusive range is never empty, so degenerate [t, t] partitions (on either side) intersect anything containing t – with Postgres’s default half-open ranges, tstzrange(t, t) is empty and && is vacuously false.

Required by thread_spans_view.rs / net_spans_view.rs, whose BlockOrder::EventTime grouping can move an earlier cut point between jit_update runs (see jit_partitions::group_blocks_into_partitions), so a later run’s narrower spec can leave behind a stale, wider partition that merely overlaps the new range instead of being contained by it – Containment alone would never retire it, and the subsequent insert would trip the lakehouse_partitions_no_overlap exclusion constraint.

Tolerated gap: retiring the stale partition and inserting the new, narrower one are two statements in one transaction, so a range the old partition covered but the new one does not yet (a sibling later in the same jit_update loop covers it) is transiently missing until that sibling is written – or, if the loop fails, until the next successful jit_update. Tolerable because JIT partitions are regenerated on demand from blocks_view and are not the source of truth for their own data.

Trait Implementations

impl Clone for RetireMatch

fn clone(&self) -> RetireMatch

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RetireMatch

impl Debug for RetireMatch

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

Formats the value using the given formatter.

impl Eq for RetireMatch

impl PartialEq for RetireMatch

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RetireMatch