Struct ModifiersKeys 

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

Implementations

impl ModifiersKeys

pub const LSHIFT: ModifiersKeys

pub const RSHIFT: ModifiersKeys

pub const LCONTROL: ModifiersKeys

pub const RCONTROL: ModifiersKeys

pub const LALT: ModifiersKeys

pub const RALT: ModifiersKeys

pub const LMETA: ModifiersKeys

pub const RMETA: ModifiersKeys

pub const LSUPER: ModifiersKeys

👎Deprecated: use LMETA instead

pub const RSUPER: ModifiersKeys

👎Deprecated: use RMETA instead

impl ModifiersKeys

pub const fn empty() -> ModifiersKeys

Get a flags value with all bits unset.

pub const fn all() -> ModifiersKeys

Get a flags value with all known bits set.

pub const fn bits(&self) -> u8

Get the underlying bits value.

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

pub const fn from_bits(bits: u8) -> Option<ModifiersKeys>

Convert from a bits value.

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

pub const fn from_bits_truncate(bits: u8) -> ModifiersKeys

Convert from a bits value, unsetting any unknown bits.

pub const fn from_bits_retain(bits: u8) -> ModifiersKeys

Convert from a bits value exactly.

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

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: ModifiersKeys) -> bool

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

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

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

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

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

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

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: ModifiersKeys)

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

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

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

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

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

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

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

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

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: ModifiersKeys) -> ModifiersKeys

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

pub const fn complement(self) -> ModifiersKeys

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

impl ModifiersKeys

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

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<ModifiersKeys>

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.

Trait Implementations

impl Binary for ModifiersKeys

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

Formats the value using the given formatter.

impl BitAnd for ModifiersKeys

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

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

type Output = ModifiersKeys

The resulting type after applying the & operator.

impl BitAndAssign for ModifiersKeys

fn bitand_assign(&mut self, other: ModifiersKeys)

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

impl BitOr for ModifiersKeys

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

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

type Output = ModifiersKeys

The resulting type after applying the | operator.

impl BitOrAssign for ModifiersKeys

fn bitor_assign(&mut self, other: ModifiersKeys)

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

impl BitXor for ModifiersKeys

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

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

type Output = ModifiersKeys

The resulting type after applying the ^ operator.

impl BitXorAssign for ModifiersKeys

fn bitxor_assign(&mut self, other: ModifiersKeys)

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

impl Clone for ModifiersKeys

fn clone(&self) -> ModifiersKeys

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModifiersKeys

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

Formats the value using the given formatter.

impl Default for ModifiersKeys

fn default() -> ModifiersKeys

Returns the “default value” for a type.

impl Extend<ModifiersKeys> for ModifiersKeys

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

where T: IntoIterator<Item = ModifiersKeys>,

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

fn extend_one(&mut self, item: A)

🔬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 ModifiersKeys

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

The set of defined flags.

type Bits = u8

The underlying bits type.

fn bits(&self) -> u8

Get the underlying bits value.

fn from_bits_retain(bits: u8) -> ModifiersKeys

Convert from a bits value exactly.

fn all_named() -> ModifiersKeys

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<ModifiersKeys> for ModifiersKeys

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

where T: IntoIterator<Item = ModifiersKeys>,

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

impl Hash for ModifiersKeys

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 ModifiersKeys

type Item = ModifiersKeys

The type of the elements being iterated over.

type IntoIter = Iter<ModifiersKeys>

Which kind of iterator are we turning this into?

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

Creates an iterator from a value.

impl LowerHex for ModifiersKeys

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

Formats the value using the given formatter.

impl Not for ModifiersKeys

fn not(self) -> ModifiersKeys

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

type Output = ModifiersKeys

The resulting type after applying the ! operator.

impl Octal for ModifiersKeys

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

Formats the value using the given formatter.

impl PartialEq for ModifiersKeys

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Sub for ModifiersKeys

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

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 = ModifiersKeys

The resulting type after applying the - operator.

impl SubAssign for ModifiersKeys

fn sub_assign(&mut self, other: ModifiersKeys)

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 ModifiersKeys

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

Formats the value using the given formatter.

impl Copy for ModifiersKeys

impl Eq for ModifiersKeys

impl StructuralPartialEq for ModifiersKeys