Struct Tiers 

pub struct Tiers {
    pub named: bool,
    pub ignored: bool,
}

Which tiers are on screen. Both axes are sets, which is what makes an unanticipated combination expressible without a new mode.

Fields

named: bool

Whether rule-named claims are shown.

ignored: bool

Whether gitignore-fallback claims are shown.

Implementations

impl Tiers

pub const ALL: [Self; 3]

Every state this axis can be in, in the order t walks them.

Three rather than four: the empty set shows no claims at all, which is not a view but a blank screen, so the key steps over it rather than offering it. Every other combination of the two axes is reachable, because the kind axis is toggled member by member.

pub const fn both() -> Self

Both.

pub const fn named() -> Self

Only what a rule named.

pub const fn ignored() -> Self

Only what the gitignore fallback found.

pub const fn has(self, tier: Tier) -> bool

Whether this tier survives.

pub fn next(self) -> Self

The next state of the axis.

pub fn label(self) -> &'static str

What the footer calls this state of the axis.

Trait Implementations

impl Clone for Tiers

fn clone(&self) -> Tiers

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Tiers

impl Debug for Tiers

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Tiers

impl Hash for Tiers

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Tiers

fn eq(&self, other: &Tiers) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Tiers