Struct ra_ap_rustc_index::interval::SparseIntervalMatrix

pub struct SparseIntervalMatrix<R, C>
where
    R: Idx,
    C: Idx,
{ /* private fields */ }

This data structure optimizes for cases where the stored bits in each row are expected to be highly contiguous (long ranges of 1s or 0s), in contrast to BitMatrix and SparseBitMatrix which are optimized for “random”/non-contiguous bits and cheap(er) point queries at the expense of memory usage.

Implementations

impl<R: Idx, C: Step + Idx> SparseIntervalMatrix<R, C>

pub fn new(column_size: usize) -> SparseIntervalMatrix<R, C>

pub fn rows(&self) -> impl Iterator<Item = R>

pub fn row(&self, row: R) -> Option<&IntervalSet<C>>

pub fn union_row(&mut self, row: R, from: &IntervalSet<C>) -> bool

where C: Step,

pub fn union_rows(&mut self, read: R, write: R) -> bool

where C: Step,

pub fn insert_all_into_row(&mut self, row: R)

pub fn insert_range(&mut self, row: R, range: impl RangeBounds<C> + Clone)

pub fn insert(&mut self, row: R, point: C) -> bool

pub fn contains(&self, row: R, point: C) -> bool

Trait Implementations

impl<R, C> Clone for SparseIntervalMatrix<R, C>

where R: Idx + Clone, C: Idx + Clone,

fn clone(&self) -> SparseIntervalMatrix<R, C>

Returns a copy of the value.

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

Performs copy-assignment from source.