Struct rustc_data_structures::bitvec::BitMatrix[][src]

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

A "bit matrix" is basically a matrix of booleans represented as one gigantic bitvector. In other words, it is as if you have rows bitvectors, each of length columns.

Methods

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

Create a new rows x columns matrix, initially empty.

Sets the cell at (row, column) to true. Put another way, add 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?

Important traits for Vec<u8>

Returns those indices that are true in rows a and b. This is an O(n) operation where n is the number of elements (somewhat independent from the actual size of the intersection, in particular).

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

Important traits for BitIter<'a, C>

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

Trait Implementations

impl<R: Clone + Idx, C: Clone + Idx> Clone for BitMatrix<R, C>
[src]

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

impl<R: Debug + Idx, C: Debug + Idx> Debug for BitMatrix<R, C>
[src]

Formats the value using the given formatter. Read more

Auto Trait Implementations

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

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