Struct DeltaForest 

pub struct DeltaForest { /* private fields */ }

The dependents of every entry, as a forest.

Children are in ascending entry order inside child_of, which is what makes a depth-first walk of a subtree a fixed sequence and therefore makes the resolver’s output independent of how many workers walked it.

Implementations

impl DeltaForest

pub fn build(w: &PackWalk) -> Result<Self>

Build it from the walk, and from nothing else.

pub fn entries(&self) -> usize

pub fn children(&self, i: u32) -> &[u32]

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

pub fn whole_roots(&self) -> &[u32]

The entries that need no lookup at all to resolve.

pub fn ref_roots(&self) -> &[u32]

The REF_DELTA entries, in ascending order.

pub fn closure_of(&self, roots: &[u32]) -> EntrySet

Which entries a round covers, given the roots it starts from.

One forward sweep and no stack: a parent’s index is always lower than its child’s (offsets ascend), so i is reachable exactly when its parent is, and that is already decided by the time the sweep gets to i.

pub fn subtree_size(&self, r: u32) -> u64

Total nodes in the subtree rooted at r, counting r. What a scheduler weighs a unit by, and what a test asserts a partition against.