Struct Bitmap 

pub struct Bitmap { /* private fields */ }

A packed validity mask: 1 bit per element, set = present (valid), clear = missing (volas.NA). Bits are stored LSB-first in u64 words; bits beyond len are kept clear so a popcount over every word counts exactly the present values.

Implementations

impl Bitmap

pub fn all_valid(len: usize) -> Bitmap

An all-present mask of len bits (every value valid).

pub fn from_valid_iter( len: usize, valid: impl IntoIterator<Item = bool>, ) -> Bitmap

Build from an iterator of valid flags (true = present).

pub fn len(&self) -> usize

Number of elements.

pub fn is_empty(&self) -> bool

Whether the mask covers no elements.

pub fn get(&self, i: usize) -> bool

Whether element i is present (valid). i is assumed in bounds.

pub fn set(&mut self, i: usize, valid: bool)

Mark element i present (valid = true) or missing. i in bounds.

pub fn null_count(&self) -> usize

Count of missing values (clear bits among the first len).

Trait Implementations

impl Clone for Bitmap

fn clone(&self) -> Bitmap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Bitmap

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

Formats the value using the given formatter.

impl PartialEq for Bitmap

fn eq(&self, other: &Self) -> bool

Equal when the same length and the same present/missing pattern (unused high bits are always clear, so a plain word comparison is exact).

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

Inequality operator !=.