Struct RowIdSet 

pub struct RowIdSet { /* private fields */ }

A set of stable row ids backed by a 64-bit Roaring bitmap.

This is a thin wrapper around RoaringTreemap. It represents a collection of unique row ids and provides the common row-set operations defined by RowSetOps.

Implementations

impl RowIdSet

pub fn new() -> Self

Creates an empty set of row ids.

pub fn iter(&self) -> impl Iterator<Item = u64> + '_

Returns an iterator over the contained row ids in ascending order.

pub fn union(self, other: &Self) -> Self

Returns the union of self and other.

pub fn difference(self, other: &Self) -> Self

Returns the set difference self \\ other.

Trait Implementations

impl Clone for RowIdSet

fn clone(&self) -> RowIdSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RowIdSet

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

Formats the value using the given formatter.

impl Default for RowIdSet

fn default() -> RowIdSet

Returns the “default value” for a type.

impl PartialEq for RowIdSet

fn eq(&self, other: &RowIdSet) -> 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 RowSetOps for RowIdSet

type Row = u64

Logical row handle (u64 for both row ids and row addresses).

fn is_empty(&self) -> bool

Returns true if the set is empty.

fn len(&self) -> Option<u64>

Returns the number of rows in the set, if it is known.

fn remove(&mut self, row: Self::Row) -> bool

Remove a value from the row set.

fn contains(&self, row: Self::Row) -> bool

Returns whether this set contains the given row.

fn union_all(other: &[&Self]) -> Self

Returns the union of other and init self.

fn from_sorted_iter<I>(iter: I) -> Result<Self>

where I: IntoIterator<Item = Self::Row>,

Builds a row set from an iterator of rows.

impl StructuralPartialEq for RowIdSet