Struct indexical::impls::bit_set::SparseBitMatrix
pub struct SparseBitMatrix<R, C>where
R: Idx,
C: Idx,{ /* private fields */ }Expand description
A fixed-column-size, variable-row-size 2D bit matrix with a moderately sparse representation.
Initially, every row has no explicit representation. If any bit within a
row is set, the entire row is instantiated as Some(<HybridBitSet>).
Furthermore, any previously uninstantiated rows prior to it will be
instantiated as None. Those prior rows may themselves become fully
instantiated later on if any of their bits are set.
R and C are index types used to identify rows and columns respectively;
typically newtyped usize wrappers, but they can also just be usize.
Auto Trait Implementations§
impl<R, C> RefUnwindSafe for SparseBitMatrix<R, C>where
C: RefUnwindSafe,
impl<R, C> Send for SparseBitMatrix<R, C>where
C: Send,
impl<R, C> Sync for SparseBitMatrix<R, C>where
C: Sync,
impl<R, C> Unpin for SparseBitMatrix<R, C>where
C: Unpin,
impl<R, C> UnwindSafe for SparseBitMatrix<R, C>where
C: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more