Struct I32COSet 

pub struct I32COSet { /* private fields */ }

Immutable canonical interval set.

Internally this is an Arc<[I32CO]>, so cloning a I32COSet is cheap.

Canonical invariant:

for every adjacent pair a, b:
    a.end_excl() < b.start()

The strict < means both overlap and adjacency have already been merged.

Implementations

impl I32COSet

pub fn interval_count(&self) -> u32

Returns the number of canonical intervals.

For the I32CO domain, the maximum canonical interval count is 128, e.g. alternating single-point intervals across [i32::MIN, i32::MAX).

pub fn is_empty(&self) -> bool

Returns whether the set contains no intervals.

pub fn as_slice(&self) -> &[I32CO]

Returns the canonical interval slice.

The returned slice is sorted, non-overlapping, and contains no adjacent intervals.

pub fn iter_intervals(&self) -> impl Iterator<Item = I32CO>

Iterates over canonical intervals by value.

impl I32COSet

pub fn contains_point(&self, x: i32) -> bool

Returns whether x is covered by any interval in the set.

Complexity: O(log n).

pub fn contains_interval(&self, query: I32CO) -> bool

Returns whether query is fully contained by one interval.

Since the set is canonical, a contained query interval can only be contained by the interval immediately preceding or starting at query.start().

Complexity: O(log n).

pub fn intersects_interval(&self, query: I32CO) -> bool

Returns whether query intersects any interval in the set.

Complexity: O(log n).

impl I32COSet

pub fn interval_containing_point(&self, x: i32) -> Option<I32CO>

Returns the unique interval containing x, if any.

Because the set is canonical, at most one interval can contain a single point.

Complexity: O(log n).

impl I32COSet

pub fn intervals_intersecting( &self, query: I32CO, ) -> impl Iterator<Item = I32CO>

Iterates over all canonical intervals intersecting query.

The iterator yields original intervals stored in the set, not clipped intersection segments.

Complexity: O(log n + k), where k is the number of returned intervals.

pub fn intersections(&self, query: I32CO) -> impl Iterator<Item = I32CO>

Iterates over clipped intersection segments with query.

Example:

set:   [10, 20), [30, 40)
query: [15, 35)
out:   [15, 20), [30, 35)

Complexity: O(log n + k), where k is the number of intersecting intervals.

impl I32COSet

pub fn covered_len(&self, query: I32CO) -> u32

Returns the covered length inside query.

Since I32COSet is canonical, all intersection segments are disjoint, so summing their lengths is valid.

The result is always <= query.len().

pub fn uncovered_len(&self, query: I32CO) -> u32

Returns the uncovered length inside query.

pub fn coverage_ratio(&self, query: I32CO) -> f32

Returns covered_len(query) / query.len() as f32.

query.len() is non-zero because I32CO cannot represent an empty interval.

Trait Implementations

impl Clone for I32COSet

fn clone(&self) -> I32COSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for I32COSet

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

Formats the value using the given formatter.

impl PartialEq for I32COSet

fn eq(&self, other: &I32COSet) -> 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 Eq for I32COSet

impl StructuralPartialEq for I32COSet