Struct OverlapPlan 

pub struct OverlapPlan {
    pub ends: Vec<i64>,
    pub offsets: Vec<usize>,
    pub interval_ids: Vec<usize>,
}

Which intervals cover each segment, for aggregating interval values in any way.

Segments are cut at every interval start and end, and cover 0..max(end) (or 0..length). Segment s ends at ends[s] and is covered by intervals interval_ids[offsets[s]..offsets[s + 1]] (sorted; none where uncovered). This is the same layout as an Arrow list column.

The ids can be large when many intervals overlap deeply; for sums, counts, maxima and minima, the coverage_* functions avoid building them.

Fields

ends: Vec<i64>

offsets: Vec<usize>

interval_ids: Vec<usize>

Implementations

impl OverlapPlan

pub fn num_segments(&self) -> usize

pub fn ids(&self, s: usize) -> &[usize]

The ids of the intervals covering segment s.

Trait Implementations

impl Clone for OverlapPlan

fn clone(&self) -> OverlapPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OverlapPlan

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

Formats the value using the given formatter.

impl Eq for OverlapPlan

impl PartialEq for OverlapPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OverlapPlan