pub struct LiveSet {
pub live: BTreeSet<Hash>,
pub missing: Vec<Hash>,
pub roots: usize,
pub scanned: usize,
}Expand description
Result of the mark phase: the validated live set.
Objects are opaque (see the module docs), so “live” means exactly “a root the host supplied that is physically present in the store”.
Fields§
§live: BTreeSet<Hash>Roots present in the store — the live set to sweep against.
missing: Vec<Hash>Roots absent from the store (neither loose nor packed), sorted. Missing roots are reported, never fatal: they may indicate a stale host index or a blob that was already swept.
roots: usizeNumber of roots supplied by the host.
scanned: usizeDistinct objects physically present (loose ∪ packed).
Trait Implementations§
impl Eq for LiveSet
impl StructuralPartialEq for LiveSet
Auto Trait Implementations§
impl Freeze for LiveSet
impl RefUnwindSafe for LiveSet
impl Send for LiveSet
impl Sync for LiveSet
impl Unpin for LiveSet
impl UnsafeUnpin for LiveSet
impl UnwindSafe for LiveSet
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more