pub struct Roll {
pub bytes: u64,
pub claims: usize,
pub unpriced: usize,
}Expand description
What a row’s subtree is worth: the three numbers every total on the screen is made of.
Carried together because a filter has to be able to answer all three about what it shows rather than about what is there, and answering two of them consistently is not enough — a selection stated in bytes that came from one set and directories that came from another is the arithmetic a reader would catch first.
Fields§
§bytes: u64Measured reclaimable bytes.
claims: usizeClaims, priced or not.
unpriced: usizeHow many of those claims nobody has put a number on.
Implementations§
Source§impl Roll
impl Roll
Sourcepub fn label(&self) -> String
pub fn label(&self) -> String
What the size column shows: a number, or a dash when there is nothing to add up yet.
The distinction the performance thesis forces onto the front end. A default scan
prices 8% of what it finds, so 0 and “not looked” are wildly different facts about a
row and rendering both as 0 B would report a 40 GiB node_modules as empty.
There is a third state between those two, and it is the ordinary one for an
ancestor while the pool works: some of what is under here is priced and some is not.
4.2 GiB for a row that is really worth 4.9 GiB is wrong in the direction a cleaner
must not be wrong in, so it is spelled > 4.2 GiB. The > is true the whole time it
is up, it costs nothing, and it is what turns the number climbing underneath it into
information rather than a number that cannot make its mind up.
Trait Implementations§
impl Copy for Roll
impl Eq for Roll
impl StructuralPartialEq for Roll
Auto Trait Implementations§
impl Freeze for Roll
impl RefUnwindSafe for Roll
impl Send for Roll
impl Sync for Roll
impl Unpin for Roll
impl UnsafeUnpin for Roll
impl UnwindSafe for Roll
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
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§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more