pub struct MappedKeyboard {
// some fields omitted
}
A wayland keyboard mapped to its keymap
It wraps an event iterator on this keyboard, catching the Keymap, Key, and Modifiers
events of the keyboard to handle them using libxkbcommon. All other events are directly
forwarded.
Methods
Creates a mapped keyboard by extracting the keyboard from a seat.
Make sure the initialization phase of the keyboard is finished
(with Display::sync_roundtrip()
for example), otherwise the
keymap won't be available.
Will return Err() if libxkbcommon.so
is not available or the
keyboard had no associated keymap.
Trait Implementations
1.0.0fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B
1.0.0fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool
1.0.0fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool
1.0.0fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool
1.0.0fn skip(self, n: usize) -> Skip<Self>
1.0.0fn take(self, n: usize) -> Take<Self>
1.0.0fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>
1.0.0fn fuse(self) -> Fuse<Self>
1.0.0fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()
1.0.0fn by_ref(&mut self) -> &mut Self
1.0.0fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B
1.0.0fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool
1.0.0fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool
1.0.0fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool
1.0.0fn max(self) -> Option<Self::Item> where Self::Item: Ord
1.0.0fn min(self) -> Option<Self::Item> where Self::Item: Ord
fn max_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord
1.6.0fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B
fn min_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B
1.6.0fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B
1.0.0fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>
1.0.0fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>
1.0.0fn cycle(self) -> Cycle<Self> where Self: Clone
fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero
fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One