pub struct Kinds {
pub unrecoverable: bool,
pub dependencies: bool,
pub build: bool,
pub cache: bool,
pub noise: bool,
}Expand description
Which kinds are on screen.
Spelled as one named boolean per member rather than as a bitset, because the vocabulary is closed and a member that arrived without being written out here is a member no key could reach — which is #626’s own finding, that a model whose expressiveness no interface exposes has not been built yet.
Fields§
§unrecoverable: boolThings nothing brings back.
dependencies: boolInstalled third-party code.
build: boolCompiled output.
cache: boolRegenerated automatically.
noise: boolLogs and the cruft an operating system leaves behind.
Implementations§
Source§impl Kinds
impl Kinds
Sourcepub const fn none() -> Self
pub const fn none() -> Self
None of them, which is what a tier-two-only view wants: it is not narrowing the named claims, it is leaving them out.
Sourcepub const fn toggling(self, kind: Kind) -> Self
pub const fn toggling(self, kind: Kind) -> Self
The same set with one member turned on or off — one key, one axis member.
Sourcepub fn label(self) -> String
pub fn label(self) -> String
The kinds on screen, named, or none when the axis is empty.
The full set says every kind rather than listing five words, and that is the honest
spelling as well as the short one: this line sits on a header and inside a confirmation
warning, and an axis that is not narrowing anything should not take a line to say so.
Trait Implementations§
impl Copy for Kinds
impl Eq for Kinds
impl StructuralPartialEq for Kinds
Auto Trait Implementations§
impl Freeze for Kinds
impl RefUnwindSafe for Kinds
impl Send for Kinds
impl Sync for Kinds
impl Unpin for Kinds
impl UnsafeUnpin for Kinds
impl UnwindSafe for Kinds
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