pub struct SweepPlan {
pub candidates: Vec<String>,
pub changed: Vec<String>,
pub deletions: Vec<String>,
pub refreshed: Vec<String>,
pub hashes: HashMap<String, [u8; 32]>,
}Expand description
The §4.3 decisions over a snapshot.
Fields§
§candidates: Vec<String>Paths not in the cache or whose (mtime_ns, size) differs, in walk order.
changed: Vec<String>Candidates whose bytes’ hash differs from the cache (or have no row).
deletions: Vec<String>Cached paths not on disk, in cache order.
refreshed: Vec<String>Candidates whose hash matched: only the stat is refreshed.
hashes: HashMap<String, [u8; 32]>The hash of every candidate (for the cache refresh).
Implementations§
Trait Implementations§
impl Eq for SweepPlan
impl StructuralPartialEq for SweepPlan
Auto Trait Implementations§
impl Freeze for SweepPlan
impl RefUnwindSafe for SweepPlan
impl Send for SweepPlan
impl Sync for SweepPlan
impl Unpin for SweepPlan
impl UnsafeUnpin for SweepPlan
impl UnwindSafe for SweepPlan
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.