167 lines
4 KiB
Rust
167 lines
4 KiB
Rust
use std::collections::HashSet;
|
|
use std::marker::PhantomData;
|
|
|
|
use strum::{EnumIter, IntoEnumIterator};
|
|
|
|
use crate::prelude::*;
|
|
use crate::theme;
|
|
|
|
#[derive(Element, Clone)]
|
|
pub struct Keybinding<S: 'static + Send + Sync + Clone> {
|
|
state_type: PhantomData<S>,
|
|
|
|
/// A keybinding consists of a key and a set of modifier keys.
|
|
/// More then one keybinding produces a chord.
|
|
///
|
|
/// This should always contain at least one element.
|
|
keybinding: Vec<(String, ModifierKeys)>,
|
|
}
|
|
|
|
impl<S: 'static + Send + Sync + Clone> Keybinding<S> {
|
|
pub fn new(key: String, modifiers: ModifierKeys) -> Self {
|
|
Self {
|
|
state_type: PhantomData,
|
|
keybinding: vec![(key, modifiers)],
|
|
}
|
|
}
|
|
|
|
pub fn new_chord(
|
|
first_note: (String, ModifierKeys),
|
|
second_note: (String, ModifierKeys),
|
|
) -> Self {
|
|
Self {
|
|
state_type: PhantomData,
|
|
keybinding: vec![first_note, second_note],
|
|
}
|
|
}
|
|
|
|
fn render(&mut self, cx: &mut ViewContext<S>) -> impl Element<State = S> {
|
|
div()
|
|
.flex()
|
|
.gap_2()
|
|
.children(self.keybinding.iter().map(|(key, modifiers)| {
|
|
div()
|
|
.flex()
|
|
.gap_1()
|
|
.children(ModifierKey::iter().filter_map(|modifier| {
|
|
if modifiers.0.contains(&modifier) {
|
|
Some(Key::new(modifier.glyph()))
|
|
} else {
|
|
None
|
|
}
|
|
}))
|
|
.child(Key::new(key.clone()))
|
|
}))
|
|
}
|
|
}
|
|
|
|
#[derive(Element)]
|
|
pub struct Key<S: 'static + Send + Sync> {
|
|
state_type: PhantomData<S>,
|
|
key: String,
|
|
}
|
|
|
|
impl<S: 'static + Send + Sync> Key<S> {
|
|
pub fn new<K>(key: K) -> Self
|
|
where
|
|
K: Into<String>,
|
|
{
|
|
Self {
|
|
state_type: PhantomData,
|
|
key: key.into(),
|
|
}
|
|
}
|
|
|
|
fn render(&mut self, cx: &mut ViewContext<S>) -> impl Element<State = S> {
|
|
let theme = theme(cx);
|
|
|
|
div()
|
|
.px_2()
|
|
.py_0()
|
|
.rounded_md()
|
|
.text_sm()
|
|
.text_color(theme.lowest.on.default.foreground)
|
|
.fill(theme.lowest.on.default.background)
|
|
.child(self.key.clone())
|
|
}
|
|
}
|
|
|
|
// NOTE: The order the modifier keys appear in this enum impacts the order in
|
|
// which they are rendered in the UI.
|
|
#[derive(Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Clone, Copy, EnumIter)]
|
|
pub enum ModifierKey {
|
|
Control,
|
|
Alt,
|
|
Command,
|
|
Shift,
|
|
}
|
|
|
|
impl ModifierKey {
|
|
/// Returns the glyph for the [`ModifierKey`].
|
|
pub fn glyph(&self) -> char {
|
|
match self {
|
|
Self::Control => '^',
|
|
Self::Alt => '⌥',
|
|
Self::Command => '⌘',
|
|
Self::Shift => '⇧',
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Clone)]
|
|
pub struct ModifierKeys(HashSet<ModifierKey>);
|
|
|
|
impl ModifierKeys {
|
|
pub fn new() -> Self {
|
|
Self(HashSet::new())
|
|
}
|
|
|
|
pub fn all() -> Self {
|
|
Self(HashSet::from_iter(ModifierKey::iter()))
|
|
}
|
|
|
|
pub fn add(mut self, modifier: ModifierKey) -> Self {
|
|
self.0.insert(modifier);
|
|
self
|
|
}
|
|
|
|
pub fn control(mut self, control: bool) -> Self {
|
|
if control {
|
|
self.0.insert(ModifierKey::Control);
|
|
} else {
|
|
self.0.remove(&ModifierKey::Control);
|
|
}
|
|
|
|
self
|
|
}
|
|
|
|
pub fn alt(mut self, alt: bool) -> Self {
|
|
if alt {
|
|
self.0.insert(ModifierKey::Alt);
|
|
} else {
|
|
self.0.remove(&ModifierKey::Alt);
|
|
}
|
|
|
|
self
|
|
}
|
|
|
|
pub fn command(mut self, command: bool) -> Self {
|
|
if command {
|
|
self.0.insert(ModifierKey::Command);
|
|
} else {
|
|
self.0.remove(&ModifierKey::Command);
|
|
}
|
|
|
|
self
|
|
}
|
|
|
|
pub fn shift(mut self, shift: bool) -> Self {
|
|
if shift {
|
|
self.0.insert(ModifierKey::Shift);
|
|
} else {
|
|
self.0.remove(&ModifierKey::Shift);
|
|
}
|
|
|
|
self
|
|
}
|
|
}
|