#[non_exhaustive]pub struct KeyChord {
pub key: UiKey,
pub modifiers: KeyModifiers,
}Expand description
A keyboard chord for app-level hotkey registration. Match a key with
an exact modifier mask: KeyChord::ctrl('f') does not also match
Ctrl+Shift+F, and KeyChord::vim('j') does not match if any
modifier is held.
Register chords from App::hotkeys; the library matches them
against incoming key presses ahead of focus activation routing and
emits a UiEvent with kind = UiEventKind::Hotkey and key
equal to the registered name.
Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.key: UiKey§modifiers: KeyModifiersImplementations§
Source§impl KeyChord
impl KeyChord
Sourcepub fn vim(c: char) -> Self
pub fn vim(c: char) -> Self
A bare key with no modifiers (vim-style). KeyChord::vim('j')
matches the j key with no Ctrl/Shift/Alt/Logo held.
Sourcepub fn ctrl_shift(c: char) -> Self
pub fn ctrl_shift(c: char) -> Self
Ctrl+Shift+<char>.
Sourcepub fn named(key: UiKey) -> Self
pub fn named(key: UiKey) -> Self
A named key with no modifiers (e.g. KeyChord::named(UiKey::Escape)).
pub fn with_modifiers(self, modifiers: KeyModifiers) -> Self
Sourcepub fn matches(&self, key: &UiKey, modifiers: KeyModifiers) -> bool
pub fn matches(&self, key: &UiKey, modifiers: KeyModifiers) -> bool
Strict match: keys equal AND modifier mask is identical. Holding extra modifiers does not match a chord that didn’t request them.
Trait Implementations§
impl Eq for KeyChord
impl StructuralPartialEq for KeyChord
Auto Trait Implementations§
impl Freeze for KeyChord
impl RefUnwindSafe for KeyChord
impl Send for KeyChord
impl Sync for KeyChord
impl Unpin for KeyChord
impl UnsafeUnpin for KeyChord
impl UnwindSafe for KeyChord
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§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.