pub struct RunPeak {
pub free_before: u64,
pub min_free_during: u64,
}Expand description
One determinism run’s MEASURED peak disk consumption on the worktree volume.
free_before is the available space measured immediately before the
run’s build started; min_free_during is the minimum the
FreeSpaceSampler observed while it ran. Their difference is the
peak the run needed at its worst moment — the figure the guard
projects forward to gate later runs.
Fields§
§free_before: u64Available bytes measured before the run built.
min_free_during: u64Minimum available bytes observed during the run’s build.
Implementations§
Source§impl RunPeak
impl RunPeak
Sourcepub fn consumed_bytes(&self) -> u64
pub fn consumed_bytes(&self) -> u64
Peak bytes the run consumed: the drop from free_before to the
minimum observed mid-run.
Clamped at 0: a min_free_during somehow above free_before
(free space grew mid-run — another process cleaned up) yields no
measured pressure, so the floor becomes the only gate.
Trait Implementations§
impl Copy for RunPeak
impl Eq for RunPeak
impl StructuralPartialEq for RunPeak
Auto Trait Implementations§
impl Freeze for RunPeak
impl RefUnwindSafe for RunPeak
impl Send for RunPeak
impl Sync for RunPeak
impl Unpin for RunPeak
impl UnsafeUnpin for RunPeak
impl UnwindSafe for RunPeak
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.