Struct UiState
pub struct UiState(/* private fields */);Expand description
Current UI state.
Implementations§
§impl UiState
impl UiState
pub const IS_MAP_OPEN: UiState
pub const IS_COMPASS_TOP_RIGHT: UiState
pub const DOES_COMPASS_HAVE_ROTATION_ENABLED: UiState
pub const GAME_HAS_FOCUS: UiState
pub const IS_IN_COMPETITIVE_MODE: UiState
pub const TEXTBOX_HAS_FOCUS: UiState
pub const IS_IN_COMBAT: UiState
§impl UiState
impl UiState
pub const fn bits(&self) -> u32
pub const fn bits(&self) -> u32
Get the underlying bits value.
The returned value is exactly the bits set in this flags value.
pub const fn from_bits(bits: u32) -> Option<UiState>
pub const fn from_bits(bits: u32) -> Option<UiState>
Convert from a bits value.
This method will return None if any unknown bits are set.
pub const fn from_bits_truncate(bits: u32) -> UiState
pub const fn from_bits_truncate(bits: u32) -> UiState
Convert from a bits value, unsetting any unknown bits.
pub const fn from_bits_retain(bits: u32) -> UiState
pub const fn from_bits_retain(bits: u32) -> UiState
Convert from a bits value exactly.
pub fn from_name(name: &str) -> Option<UiState>
pub fn from_name(name: &str) -> Option<UiState>
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: UiState) -> bool
pub const fn intersects(&self, other: UiState) -> bool
Whether any set bits in other are also set in self.
pub const fn contains(&self, other: UiState) -> bool
pub const fn contains(&self, other: UiState) -> bool
Whether all set bits in other are also set in self.
pub fn remove(&mut self, other: UiState)
pub fn remove(&mut self, other: UiState)
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 set(&mut self, other: UiState, value: bool)
pub fn set(&mut self, other: UiState, value: bool)
Call insert when value is true or remove when value is false.
pub const fn intersection(self, other: UiState) -> UiState
pub const fn intersection(self, other: UiState) -> UiState
The bitwise and (&) of the bits in self and other.
pub const fn union(self, other: UiState) -> UiState
pub const fn union(self, other: UiState) -> UiState
The bitwise or (|) of the bits in self and other.
pub const fn difference(self, other: UiState) -> UiState
pub const fn difference(self, other: UiState) -> UiState
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: UiState) -> UiState
pub const fn symmetric_difference(self, other: UiState) -> UiState
The bitwise exclusive-or (^) of the bits in self and other.
pub const fn complement(self) -> UiState
pub const fn complement(self) -> UiState
The bitwise negation (!) of the bits in self, truncating the result.
§impl UiState
impl UiState
pub const fn iter(&self) -> Iter<UiState>
pub const fn iter(&self) -> Iter<UiState>
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<UiState>
pub const fn iter_names(&self) -> IterNames<UiState>
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 UiState
impl BitAndAssign for UiState
§fn bitand_assign(&mut self, other: UiState)
fn bitand_assign(&mut self, other: UiState)
The bitwise and (&) of the bits in self and other.
§impl BitOrAssign for UiState
impl BitOrAssign for UiState
§fn bitor_assign(&mut self, other: UiState)
fn bitor_assign(&mut self, other: UiState)
The bitwise or (|) of the bits in self and other.
§impl BitXorAssign for UiState
impl BitXorAssign for UiState
§fn bitxor_assign(&mut self, other: UiState)
fn bitxor_assign(&mut self, other: UiState)
The bitwise exclusive-or (^) of the bits in self and other.
§impl Extend<UiState> for UiState
impl Extend<UiState> for UiState
§fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = UiState>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = UiState>,
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 UiState
impl Flags for UiState
§fn from_bits_retain(bits: u32) -> UiState
fn from_bits_retain(bits: u32) -> UiState
§fn known_bits(&self) -> Self::Bits
fn known_bits(&self) -> Self::Bits
§fn unknown_bits(&self) -> Self::Bits
fn unknown_bits(&self) -> Self::Bits
§fn contains_unknown_bits(&self) -> bool
fn contains_unknown_bits(&self) -> bool
true if any unknown bits are set.§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 iter_defined_names() -> IterDefinedNames<Self>
fn iter_defined_names() -> IterDefinedNames<Self>
Self::FLAGS].§fn iter_equal_names(&self) -> IterEqualNames<Self>
fn iter_equal_names(&self) -> IterEqualNames<Self>
§fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
other are also set in self.§fn contains(&self, other: Self) -> boolwhere
Self: Sized,
fn contains(&self, other: Self) -> boolwhere
Self: Sized,
other are also set in self.§fn insert(&mut self, other: Self)where
Self: Sized,
fn insert(&mut self, other: Self)where
Self: Sized,
|) of the bits in self and other.§fn toggle(&mut self, other: Self)where
Self: Sized,
fn toggle(&mut self, other: Self)where
Self: Sized,
^) of the bits in self and other.§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 self and other.§fn difference(self, other: Self) -> Self
fn difference(self, other: Self) -> Self
§fn symmetric_difference(self, other: Self) -> Self
fn symmetric_difference(self, other: Self) -> Self
^) of the bits in self and other.§fn complement(self) -> Self
fn complement(self) -> Self
!) of the bits in self, truncating the result.§impl FromIterator<UiState> for UiState
impl FromIterator<UiState> for UiState
§fn from_iter<T>(iterator: T) -> UiStatewhere
T: IntoIterator<Item = UiState>,
fn from_iter<T>(iterator: T) -> UiStatewhere
T: IntoIterator<Item = UiState>,
The bitwise or (|) of the bits in each flags value.
§impl IntoIterator for UiState
impl IntoIterator for UiState
§impl Ord for UiState
impl Ord for UiState
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
§impl PartialOrd for UiState
impl PartialOrd for UiState
§impl Sub for UiState
impl Sub for UiState
§impl SubAssign for UiState
impl SubAssign for UiState
§fn sub_assign(&mut self, other: UiState)
fn sub_assign(&mut self, other: UiState)
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.