Struct rustc_data_structures::bitvec::BitMatrix

pub struct BitMatrix { /* fields omitted */ }

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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 BitMatrix

pub fn new(rows: usize, columns: usize) -> BitMatrix

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

Create a new rows x columns matrix, initially empty.

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

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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

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

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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 intersection(&self, a: usize, b: usize) -> Vec<usize>

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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

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

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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 BitVectorIter<'a>

impl<'a> Iterator for BitVectorIter<'a> type Item = usize;

pub fn iter<'a>(&'a self, row: usize) -> BitVectorIter<'a>

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

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

Trait Implementations

impl Clone for BitMatrix

fn clone(&self) -> BitMatrix

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BitMatrix

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

Formats the value using the given formatter.