Struct ReachTable 

pub struct ReachTable {
    pub commits: Vec<u32>,
    pub bitmaps: Vec<RoaringBitmap>,
}

The live reachability table: entry i is the closure of the commit at ordinal commits[i].

Fields

commits: Vec<u32>

bitmaps: Vec<RoaringBitmap>

Implementations

impl ReachTable

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn by_row(&self, graph: &OrdGraph) -> Vec<u32>

row → entry index (or NONE), over graph. Rebuilt at every fold beside the graph; the table itself is not.

pub fn to_entries( &self, space: &OrdinalSpace<'_>, remap: Option<&[u32]>, ) -> Option<Vec<ReachEntry>>

The sealed spelling, with every ordinal mapped through remap (old → sorted). None if a set bit maps to NONE — an entry naming an object the target space lacks would be a silent over-claim.

pub fn remapped(&self, remap: &[u32]) -> Option<ReachTable>

Renumber every bit through remap (old ordinal → new ordinal); an entry whose commit maps to NONE is dropped, a BIT that does is a refusal (None: rebuild). One array index per bit.

pub fn pruned(&self, graph: &OrdGraph, max: usize) -> ReachTable

Keep at most max entries: the current tips first, then an even sample of the rest in table order.

Trait Implementations

impl Clone for ReachTable

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReachTable

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

Formats the value using the given formatter.

impl Default for ReachTable

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for ReachTable

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ReachTable