Struct Bools 

pub struct Bools<VC = Vec<u64>, TC = [u64; 2]> {
    pub values: VC,
    pub tail: TC,
}

A store for maintaining Vec<bool>.

Packed bits are stored in values as complete u64 words. The tail holds [last_word, last_bits]: the partial word being filled and the count of valid bits in it. In the owned form tail is [u64; 2]; in the borrowed form it is &[u64] of length 2.

Fields

values: VC

The bundles of bits that form complete u64 values.

tail: TC

[last_word, last_bits]: the partial word and the number of valid bits in it.

Trait Implementations

impl<'a, VC: AsBytes<'a>> AsBytes<'a> for Bools<VC, &'a [u64]>

fn as_bytes(&self) -> impl Iterator<Item = (u64, &'a [u8])>

Presents self as a sequence of byte slices, with their required alignment.

impl<VC: BorrowIndexAs<u64>> Borrow for Bools<VC>

type Ref<'a> = bool

For each lifetime, a reference with that lifetime.

type Borrowed<'a> = Bools<<VC as Borrow>::Borrowed<'a>, &'a [u64]> where VC: 'a

The type of a borrowed container.

fn borrow<'a>(&'a self) -> Self::Borrowed<'a>

Converts a reference to the type to a borrowed variant.

fn reborrow<'b, 'a: 'b>(thing: Self::Borrowed<'a>) -> Self::Borrowed<'b>

where VC: 'a,

Reborrows the borrowed type to a shorter lifetime. See Columnar::reborrow for details.

fn reborrow_ref<'b, 'a: 'b>(thing: Self::Ref<'a>) -> Self::Ref<'b>

where Self: 'a,

Reborrows the borrowed type to a shorter lifetime. See Columnar::reborrow for details.

impl<VC: Clear> Clear for Bools<VC>

fn clear(&mut self)

Clears self, without changing its capacity.

impl<VC: Clone, TC: Clone> Clone for Bools<VC, TC>

fn clone(&self) -> Bools<VC, TC>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<VC: PushIndexAs<u64>> Container for Bools<VC>

fn reserve_for<'a, I>(&mut self, selves: I)

where Self: 'a, I: Iterator<Item = Self::Borrowed<'a>> + Clone,

fn with_capacity_for<'a, I>(selves: I) -> Self

where Self: 'a, I: Iterator<Item = Self::Borrowed<'a>> + Clone,

Allocates an empty container that can be extended by selves without reallocation.

fn extend_from_self(&mut self, other: Self::Borrowed<'_>, range: Range<usize>)

Extends self by a range in other.

impl<VC: Debug, TC: Debug> Debug for Bools<VC, TC>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<VC: Default, TC: Default> Default for Bools<VC, TC>

fn default() -> Bools<VC, TC>

Returns the “default value” for a type.

impl<'a, VC: FromBytes<'a>> FromBytes<'a> for Bools<VC, &'a [u64]>

const SLICE_COUNT: usize

The number of byte slices this type consumes when reconstructed.

fn from_bytes(bytes: &mut impl Iterator<Item = &'a [u8]>) -> Self

Reconstructs self from a sequence of correctly aligned and sized bytes slices.

fn from_store(store: &DecodedStore<'a>, offset: &mut usize) -> Self

Reconstructs self from a DecodedStore, using direct random access at a given offset.

fn element_sizes(sizes: &mut Vec<usize>) -> Result<(), String>

Reports the element sizes (in bytes) for each slice this type consumes.

fn validate(slices: &[(&[u64], u8)]) -> Result<(), String>

Validates that the given slices are compatible with this type.

impl<VC: Len + IndexAs<u64>, TC: IndexAs<u64>> Index for &Bools<VC, TC>

type Ref = bool

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

Returns the reference type for location index.

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<VC: Len + IndexAs<u64>, TC: IndexAs<u64>> Index for Bools<VC, TC>

type Ref = bool

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

Returns the reference type for location index.

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<VC: Len, TC: IndexAs<u64>> Len for Bools<VC, TC>

fn len(&self) -> usize

The number of contained elements.

fn is_empty(&self) -> bool

Whether this contains no elements.

impl<VC: PartialEq, TC: PartialEq> PartialEq for Bools<VC, TC>

fn eq(&self, other: &Bools<VC, TC>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, VC: for<'b> Push<&'b u64>> Push<&'a bool> for Bools<VC>

fn push(&mut self, bit: &'a bool)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<VC: for<'a> Push<&'a u64>> Push<bool> for Bools<VC>

fn push(&mut self, bit: bool)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<VC: Copy, TC: Copy> Copy for Bools<VC, TC>

impl<VC, TC> StructuralPartialEq for Bools<VC, TC>