Struct rustc_data_structures::bitvec::SparseBitMatrix[][src]

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

A moderately sparse bit matrix: rows are appended lazily, but columns within appended rows are instantiated fully upon creation.

Methods

impl<R: Idx, C: Idx> SparseBitMatrix<R, C>
[src]

Create a new empty sparse bit matrix with no rows or columns.

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.

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?

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).

Merge a row, from, into the into row.

Add all bits to the given row.

Number of elements in the matrix.

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

Iterates through each row and the accompanying bit set.

Trait Implementations

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

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

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

Formats the value using the given formatter. Read more

Auto Trait Implementations

impl<R, C> Send for SparseBitMatrix<R, C> where
    C: Send

impl<R, C> Sync for SparseBitMatrix<R, C> where
    C: Sync