Struct Modifiers 

pub struct Modifiers(/* private fields */);

Input vocabulary, defined in crcbl_core::input and re-exported so a consumer of the event stream needs one use rather than two.

See the crate docs for why these live in crcbl-core. Modifier keys held when an input event was produced.

Latched state (Caps Lock, Num Lock) is included alongside held state because a rebind UI and a shortcut matcher both need it, and asking the shell for it later — after the event has been queued — would race with the user letting go.

Left and right modifiers are not distinguished here. The distinction survives in KeyCode (ShiftLeft versus ShiftRight), which is where a game that wants to bind them separately should look; a shortcut matcher never wants it, and duplicating the axis here would mean every contains(SHIFT) check had to remember to test two bits.

Implementations

impl Modifiers

pub const SHIFT: Modifiers

Either Shift key is held.

pub const CTRL: Modifiers

Either Control key is held.

pub const ALT: Modifiers

Either Alt key is held (Option on macOS).

pub const SUPER: Modifiers

Either Super key is held — Windows key, Command on macOS, Meta on X11.

pub const CAPS_LOCK: Modifiers

Caps Lock is latched on.

pub const NUM_LOCK: Modifiers

Num Lock is latched on.

pub const ALT_GR: Modifiers

AltGr / ISO Level-3 Shift is held.

Separate from ALT because on many European layouts AltGr produces characters, and a shortcut bound to Alt+E must not fire when the user types €.

impl Modifiers

pub const fn empty() -> Modifiers

Get a flags value with all bits unset.

pub const fn all() -> Modifiers

Get a flags value with all known bits set.

pub const fn bits(&self) -> u32

Get the underlying bits value.

The returned value is exactly the bits set in this flags value.

pub const fn from_bits(bits: u32) -> Option<Modifiers>

Convert from a bits value.

This method will return None if any unknown bits are set.

pub const fn from_bits_truncate(bits: u32) -> Modifiers

Convert from a bits value, unsetting any unknown bits.

pub const fn from_bits_retain(bits: u32) -> Modifiers

Convert from a bits value exactly.

pub fn from_name(name: &str) -> Option<Modifiers>

Get a flags value with the bits of a flag with the given name set.

This method will return None if name is empty or doesn’t correspond to any named flag.

pub const fn is_empty(&self) -> bool

Whether all bits in self are unset.

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

pub const fn intersects(&self, other: Modifiers) -> bool

Whether any set bits in other are also set in self.

pub const fn contains(&self, other: Modifiers) -> bool

Whether all set bits in other are also set in self.

pub fn insert(&mut self, other: Modifiers)

The bitwise or (|) of the bits in self and other.

pub fn remove(&mut self, other: Modifiers)

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. remove won’t truncate other, but the ! operator will.

pub fn toggle(&mut self, other: Modifiers)

The bitwise exclusive-or (^) of the bits in self and other.

pub fn set(&mut self, other: Modifiers, value: bool)

Call insert when value is true or remove when value is false.

pub const fn intersection(self, other: Modifiers) -> Modifiers

The bitwise and (&) of the bits in self and other.

pub const fn union(self, other: Modifiers) -> Modifiers

The bitwise or (|) of the bits in self and other.

pub const fn difference(self, other: Modifiers) -> Modifiers

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

pub const fn symmetric_difference(self, other: Modifiers) -> Modifiers

The bitwise exclusive-or (^) of the bits in self and other.

pub const fn complement(self) -> Modifiers

The bitwise negation (!) of the bits in self, truncating the result.

impl Modifiers

pub const fn iter(&self) -> Iter<Modifiers>

Yield a set of contained flags values.

Each yielded flags value will correspond to a defined named flag. Any unknown bits will be yielded together as a final flags value.

pub const fn iter_names(&self) -> IterNames<Modifiers>

Yield a set of contained named flags values.

This method is like iter, except only yields bits in contained named flags. Any unknown bits, or bits not corresponding to a contained flag will not be yielded.

impl Modifiers

pub const CHORD: Modifiers

The modifiers a shortcut matcher cares about: Shift, Ctrl, Alt, Super.

Masks off latched state, which is never part of a chord.

pub const fn chord(self) -> Modifiers

Just the chord bits of self.

Trait Implementations

impl Binary for Modifiers

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

Formats the value using the given formatter.

impl BitAnd for Modifiers

fn bitand(self, other: Modifiers) -> Modifiers

The bitwise and (&) of the bits in self and other.

type Output = Modifiers

The resulting type after applying the & operator.

impl BitAndAssign for Modifiers

fn bitand_assign(&mut self, other: Modifiers)

The bitwise and (&) of the bits in self and other.

impl BitOr for Modifiers

fn bitor(self, other: Modifiers) -> Modifiers

The bitwise or (|) of the bits in self and other.

type Output = Modifiers

The resulting type after applying the | operator.

impl BitOrAssign for Modifiers

fn bitor_assign(&mut self, other: Modifiers)

The bitwise or (|) of the bits in self and other.

impl BitXor for Modifiers

fn bitxor(self, other: Modifiers) -> Modifiers

The bitwise exclusive-or (^) of the bits in self and other.

type Output = Modifiers

The resulting type after applying the ^ operator.

impl BitXorAssign for Modifiers

fn bitxor_assign(&mut self, other: Modifiers)

The bitwise exclusive-or (^) of the bits in self and other.

impl Clone for Modifiers

fn clone(&self) -> Modifiers

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Modifiers

impl Debug for Modifiers

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

Formats the value using the given formatter.

impl Default for Modifiers

fn default() -> Modifiers

Returns the “default value” for a type.

impl Eq for Modifiers

impl Extend<Modifiers> for Modifiers

fn extend<T>(&mut self, iterator: T)

where T: IntoIterator<Item = Modifiers>,

The bitwise or (|) of the bits in each flags value.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl Flags for Modifiers

const FLAGS: &'static [Flag<Modifiers>]

The set of defined flags.

type Bits = u32

The underlying bits type.

fn bits(&self) -> u32

Get the underlying bits value.

fn from_bits_retain(bits: u32) -> Modifiers

Convert from a bits value exactly.

fn all_named() -> Modifiers

Get a flags value with all bits from named flags set.

fn empty() -> Self

Get a flags value with all bits unset.

fn all() -> Self

Get a flags value with all known bits set.

fn known_bits(&self) -> Self::Bits

Get the known bits from a flags value.

fn unknown_bits(&self) -> Self::Bits

Get the unknown bits from a flags value.

fn contains_unknown_bits(&self) -> bool

This method will return true if any unknown bits are set.

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value.

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values.

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values.

fn iter_defined_names() -> IterDefinedNames<Self>

Yield a set of all named flags defined by Self::FLAGS.

fn iter_equal_names(&self) -> IterEqualNames<Self>

Get an iterator over all defined names for this flags value.

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

fn intersects(&self, other: Self) -> bool

where Self: Sized,

Whether any set bits in other are also set in self.

fn contains(&self, other: Self) -> bool

where Self: Sized,

Whether all set bits in other are also set in self.

fn truncate(&mut self)

where Self: Sized,

Remove any unknown bits from the flags.

fn insert(&mut self, other: Self)

where Self: Sized,

The bitwise or (|) of the bits in self and other.

fn remove(&mut self, other: Self)

where Self: Sized,

The intersection of self with the complement of other (&!).

fn toggle(&mut self, other: Self)

where Self: Sized,

The bitwise exclusive-or (^) of the bits in self and other.

fn set(&mut self, other: Self, value: bool)

where Self: Sized,

Call Flags::insert when value is true or Flags::remove when value is false.

fn clear(&mut self)

where Self: Sized,

Unsets all bits in the flags.

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in self and other.

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in self and other.

fn difference(self, other: Self) -> Self

The intersection of self with the complement of other (&!).

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in self and other.

fn complement(self) -> Self

The bitwise negation (!) of the bits in self, truncating the result.

impl FromIterator<Modifiers> for Modifiers

fn from_iter<T>(iterator: T) -> Modifiers

where T: IntoIterator<Item = Modifiers>,

The bitwise or (|) of the bits in each flags value.

impl Hash for Modifiers

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

where __H: Hasher,

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 IntoIterator for Modifiers

type Item = Modifiers

The type of the elements being iterated over.

type IntoIter = Iter<Modifiers>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <Modifiers as IntoIterator>::IntoIter

Creates an iterator from a value.

impl LowerHex for Modifiers

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

Formats the value using the given formatter.

impl Not for Modifiers

fn not(self) -> Modifiers

The bitwise negation (!) of the bits in self, truncating the result.

type Output = Modifiers

The resulting type after applying the ! operator.

impl Octal for Modifiers

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

Formats the value using the given formatter.

impl PartialEq for Modifiers

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Modifiers

impl Sub for Modifiers

fn sub(self, other: Modifiers) -> Modifiers

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

type Output = Modifiers

The resulting type after applying the - operator.

impl SubAssign for Modifiers

fn sub_assign(&mut self, other: Modifiers)

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

impl UpperHex for Modifiers

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

Formats the value using the given formatter.