Module bit_set 

Re-exports

use std::marker::PhantomData; 🔒

use std::ops::Bound; 🔒

use std::ops::Range; 🔒

use std::ops::RangeBounds; 🔒

use std::rc::Rc; 🔒

use std::fmt; 🔒

use std::iter; 🔒

use std::slice; 🔒

use rustc_macros::Decodable_NoContext; 🔒

use rustc_macros::Encodable_NoContext; 🔒

use crate::Idx; 🔒

use crate::IndexVec; 🔒

use Chunk::*; 🔒

Structs

BitIter

BitMatrix

A fixed-size 2D bit matrix type with a dense representation.

ChunkedBitIter

ChunkedBitSet

A fixed-size bitset type with a partially dense, partially sparse representation. The bitset is broken into chunks, and chunks that are all zeros or all ones are represented and handled very efficiently.

DenseBitSet

A fixed-size bitset type with a dense representation.

GrowableBitSet

A resizable bitset type with a dense representation.

SparseBitMatrix

A fixed-column-size, variable-row-size 2D bit matrix with a moderately sparse representation.

Enums

Chunk 🔒

ChunkIter 🔒

MixedBitIter

MixedBitSet

A bitset with a mixed representation, using DenseBitSet for small and medium bitsets, and ChunkedBitSet for large bitsets, i.e. those with enough bits for at least two chunks. This is a good choice for many bitsets that can have large domain sizes (e.g. 5000+).

Constants

CHUNK_BITS 🔒

CHUNK_WORDS 🔒

WORD_BITS 🔒

WORD_BYTES 🔒

Functions

chunk_index 🔒

chunk_word_index_and_mask 🔒

clear_excess_bits_in_final_word 🔒

count_ones 🔒

inclusive_start_end 🔒

insert 🔒

max_bit 🔒

num_words 🔒

update_words 🔒

Sets lhs[i] = op(lhs[i], rhs[i]) for each index i in both slices. The slices must have the same length.

word_index_and_mask 🔒

would_modify_words 🔒

Returns true if a call to update_words would modify lhs, i.e. lhs[i] != op(lhs[i], rhs[i]) for some i.

Type Aliases

ChunkSize 🔒

ChunkSize is small to keep Chunk small. The static assertion ensures it’s not too small.

Word 🔒