Struct rustc_data_structures::bitvec::SparseBitMatrix

pub struct SparseBitMatrix<R, C> where
    R: Idx,
    C: Idx,  { /* fields omitted */ }

Methods

impl<R: Idx, C: Idx> SparseBitMatrix<R, C>

pub fn new(rows: R, _columns: C) -> SparseBitMatrix<R, C>

Create a new rows x columns matrix, initially empty.

pub fn add(&mut self, row: R, column: C) -> bool

Sets the cell at (row, column) to true. Put another way, insert column to the bitset for row.

Returns true if this changed the matrix, and false otherwise.

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

Do the bits from row contain column? Put another way, is the matrix cell at (row, column) true? Put yet another way, if the matrix represents (transitive) reachability, can row reach column?

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

Add the bits from row read to the bits from row write, return true if anything changed.

This is used when computing transitive reachability because if you have an edge write -> read, because in that case write can reach everything that read can (and potentially more).

pub fn is_subset(&self, sub: R, sup: R) -> bool

True if sub is a subset of sup

pub fn iter<'a>(     &'a self,     row: R ) -> impl Iterator<Item = C> + 'a

Iterates through all the columns set to true in a given row of the matrix.

Trait Implementations

impl<R: Clone, C: Clone> Clone for SparseBitMatrix<R, C> where     R: Idx,     C: Idx,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R: Debug, C: Debug> Debug for SparseBitMatrix<R, C> where     R: Idx,     C: Idx,

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

Formats the value using the given formatter.