Struct Modifiers
pub struct Modifiers(/* private fields */);
Expand description
The state of the modifier keys.
Implementations§
§impl Modifiers
impl Modifiers
pub const fn bits(&self) -> u8
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<Modifiers>
pub const fn from_bits(bits: u8) -> 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: u8) -> Modifiers
pub const fn from_bits_truncate(bits: u8) -> Modifiers
Convert from a bits value, unsetting any unknown bits.
pub const fn from_bits_retain(bits: u8) -> Modifiers
pub const fn from_bits_retain(bits: u8) -> Modifiers
Convert from a bits value exactly.
pub fn from_name(name: &str) -> Option<Modifiers>
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 intersects(&self, other: Modifiers) -> bool
pub const fn intersects(&self, other: Modifiers) -> bool
Whether any set bits in a source flags value are also set in a target flags value.
pub const fn contains(&self, other: Modifiers) -> bool
pub const fn contains(&self, other: Modifiers) -> bool
Whether all set bits in a source flags value are also set in a target flags value.
pub fn remove(&mut self, other: Modifiers)
pub fn remove(&mut self, other: Modifiers)
The intersection of a source flags value with the complement of a target flags value (&!
).
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)
pub fn toggle(&mut self, other: Modifiers)
The bitwise exclusive-or (^
) of the bits in two flags values.
pub fn set(&mut self, other: Modifiers, value: bool)
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
pub const fn intersection(self, other: Modifiers) -> Modifiers
The bitwise and (&
) of the bits in two flags values.
pub const fn union(self, other: Modifiers) -> Modifiers
pub const fn union(self, other: Modifiers) -> Modifiers
The bitwise or (|
) of the bits in two flags values.
pub const fn difference(self, other: Modifiers) -> Modifiers
pub const fn difference(self, other: Modifiers) -> Modifiers
The intersection of a source flags value with the complement of a target flags value (&!
).
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
pub const fn symmetric_difference(self, other: Modifiers) -> Modifiers
The bitwise exclusive-or (^
) of the bits in two flags values.
pub const fn complement(self) -> Modifiers
pub const fn complement(self) -> Modifiers
The bitwise negation (!
) of the bits in a flags value, truncating the result.
§impl Modifiers
impl Modifiers
pub const fn iter(&self) -> Iter<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>
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.
Trait Implementations§
§impl BitAndAssign for Modifiers
impl BitAndAssign for Modifiers
§fn bitand_assign(&mut self, other: Modifiers)
fn bitand_assign(&mut self, other: Modifiers)
The bitwise and (&
) of the bits in two flags values.
§impl BitOrAssign for Modifiers
impl BitOrAssign for Modifiers
§fn bitor_assign(&mut self, other: Modifiers)
fn bitor_assign(&mut self, other: Modifiers)
The bitwise or (|
) of the bits in two flags values.
§impl BitXorAssign for Modifiers
impl BitXorAssign for Modifiers
§fn bitxor_assign(&mut self, other: Modifiers)
fn bitxor_assign(&mut self, other: Modifiers)
The bitwise exclusive-or (^
) of the bits in two flags values.
§impl Extend<Modifiers> for Modifiers
impl Extend<Modifiers> for Modifiers
§fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Modifiers>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Modifiers>,
The bitwise or (|
) of the bits in each flags value.
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)§impl Flags for Modifiers
impl Flags for Modifiers
§fn from_bits_retain(bits: u8) -> Modifiers
fn from_bits_retain(bits: u8) -> Modifiers
§fn from_bits_truncate(bits: Self::Bits) -> Self
fn from_bits_truncate(bits: Self::Bits) -> Self
§fn from_name(name: &str) -> Option<Self>
fn from_name(name: &str) -> Option<Self>
§fn iter_names(&self) -> IterNames<Self>
fn iter_names(&self) -> IterNames<Self>
§fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
§fn contains(&self, other: Self) -> boolwhere
Self: Sized,
fn contains(&self, other: Self) -> boolwhere
Self: Sized,
§fn insert(&mut self, other: Self)where
Self: Sized,
fn insert(&mut self, other: Self)where
Self: Sized,
|
) of the bits in two flags values.§fn remove(&mut self, other: Self)where
Self: Sized,
fn remove(&mut self, other: Self)where
Self: Sized,
&!
). Read more§fn toggle(&mut self, other: Self)where
Self: Sized,
fn toggle(&mut self, other: Self)where
Self: Sized,
^
) of the bits in two flags values.§fn set(&mut self, other: Self, value: bool)where
Self: Sized,
fn set(&mut self, other: Self, value: bool)where
Self: Sized,
Flags::insert
] when value
is true
or [Flags::remove
] when value
is false
.§fn intersection(self, other: Self) -> Self
fn intersection(self, other: Self) -> Self
&
) of the bits in two flags values.§fn difference(self, other: Self) -> Self
fn difference(self, other: Self) -> Self
&!
). Read more§fn symmetric_difference(self, other: Self) -> Self
fn symmetric_difference(self, other: Self) -> Self
^
) of the bits in two flags values.§fn complement(self) -> Self
fn complement(self) -> Self
!
) of the bits in a flags value, truncating the result.§impl FromIterator<Modifiers> for Modifiers
impl FromIterator<Modifiers> for Modifiers
§fn from_iter<T>(iterator: T) -> Modifierswhere
T: IntoIterator<Item = Modifiers>,
fn from_iter<T>(iterator: T) -> Modifierswhere
T: IntoIterator<Item = Modifiers>,
The bitwise or (|
) of the bits in each flags value.
§impl IntoIterator for Modifiers
impl IntoIterator for Modifiers
§impl Sub for Modifiers
impl Sub for Modifiers
§impl SubAssign for Modifiers
impl SubAssign for Modifiers
§fn sub_assign(&mut self, other: Modifiers)
fn sub_assign(&mut self, other: Modifiers)
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
impl Copy for Modifiers
impl Eq for Modifiers
impl StructuralPartialEq for Modifiers
Auto Trait Implementations§
impl Freeze for Modifiers
impl RefUnwindSafe for Modifiers
impl Send for Modifiers
impl Sync for Modifiers
impl Unpin for Modifiers
impl UnwindSafe for Modifiers
Blanket Implementations§
§impl<T> AnyEq for T
impl<T> AnyEq for T
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.