Enum DeletionVector

pub enum DeletionVector {
    NoDeletions,
    Set(HashSet<u32>),
    Bitmap(RoaringBitmap),
}

Represents a set of deleted row offsets in a single fragment.

Variants

NoDeletions

Set(HashSet<u32>)

Bitmap(RoaringBitmap)

Implementations

impl DeletionVector

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains(&self, i: u32) -> bool

pub fn contains_range(&self, range: Range<u32>) -> bool

pub fn iter(&self) -> Box<dyn Iterator<Item = u32> + Send + '_>

pub fn into_sorted_iter(self) -> Box<dyn Iterator<Item = u32> + Send + 'static>

pub fn to_sorted_iter<'a>(&'a self) -> Box<dyn Iterator<Item = u32> + Send + 'a>

Create an iterator that iterates over the values in the deletion vector in sorted order.

pub fn build_predicate(&self, row_ids: Iter<'_, u64>) -> Option<BooleanArray>

Trait Implementations

impl Clone for DeletionVector

fn clone(&self) -> DeletionVector

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DeletionVector

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

Formats the value using the given formatter.

impl DeepSizeOf for DeletionVector

fn deep_size_of_children(&self, context: &mut Context) -> usize

Returns an estimation of the heap-managed storage of this object. This does not include the size of the object itself.

fn deep_size_of(&self) -> usize

Returns an estimation of a total size of memory owned by the object, including heap-managed storage.

impl Default for DeletionVector

fn default() -> Self

Returns the “default value” for a type.

impl Extend<u32> for DeletionVector

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl From<&DeletionVector> for RoaringBitmap

fn from(value: &DeletionVector) -> Self

Converts to this type from the input type.

impl FromIterator<u32> for DeletionVector

fn from_iter<T: IntoIterator<Item = u32>>(iter: T) -> Self

Creates a value from an iterator.

impl IntoIterator for DeletionVector

impl DeletionVector { pub fn get(i: u32) -> bool { … } } impl BitAnd for DeletionVector { … }

type IntoIter = Box<dyn Iterator<Item = <DeletionVector as IntoIterator>::Item> + Send>

Which kind of iterator are we turning this into?

type Item = u32

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for DeletionVector

fn eq(&self, other: &Self) -> 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.