Method capacity

cranelift/bitset/src/compound.rs:162–164

Get `n + 1` where `n` is the largest value that can be stored inside this set without growing the backing storage. That is, this set can store any value `x` such that `x < bitset.capacity()` without growing the backing storage. # Example ``` use cranelift_bitset::CompoundBitSet; let mut bitset = CompoundBitSet::new(); // New bitsets have zero capacity -- they allocate lazily. assert_eq!(bitse

(&self)

    /// assert!(bitset.capacity() >= 999);
    ///```
    pub fn capacity(&self) -> usize {
        self.elems.len() * Self::BITS_PER_SCALAR
    }

    /// Is this bitset empty?
    ///