Struct Flags
pub struct Flags(/* private fields */);Implementationsยง
ยงimpl Flags
impl Flags
pub const INTERPOLATE_COLORS_IN_PREMUL: Flags
ยงimpl Flags
impl Flags
pub const fn empty() -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn empty() -> Flags
Get a flags value with all bits unset.
pub const fn all() -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn all() -> Flags
Get a flags value with all known bits set.
pub const fn bits(&self) -> u32
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
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<Flags>
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn from_bits(bits: u32) -> Option<Flags>
Convert from a bits value.
This method will return None if any unknown bits are set.
pub const fn from_bits_truncate(bits: u32) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn from_bits_truncate(bits: u32) -> Flags
Convert from a bits value, unsetting any unknown bits.
pub const fn from_bits_retain(bits: u32) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn from_bits_retain(bits: u32) -> Flags
Convert from a bits value exactly.
pub fn from_name(name: &str) -> Option<Flags>
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub fn from_name(name: &str) -> Option<Flags>
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
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn is_empty(&self) -> bool
Whether all bits in self are unset.
pub const fn is_all(&self) -> bool
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn is_all(&self) -> bool
Whether all known bits in this flags value are set.
pub const fn intersects(&self, other: Flags) -> bool
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn intersects(&self, other: Flags) -> bool
Whether any set bits in other are also set in self.
pub const fn contains(&self, other: Flags) -> bool
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn contains(&self, other: Flags) -> bool
Whether all set bits in other are also set in self.
pub fn insert(&mut self, other: Flags)
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub fn insert(&mut self, other: Flags)
The bitwise or (|) of the bits in self and other.
pub fn remove(&mut self, other: Flags)
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub fn remove(&mut self, other: Flags)
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: Flags)
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub fn toggle(&mut self, other: Flags)
The bitwise exclusive-or (^) of the bits in self and other.
pub fn set(&mut self, other: Flags, value: bool)
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub fn set(&mut self, other: Flags, value: bool)
Call insert when value is true or remove when value is false.
pub const fn intersection(self, other: Flags) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn intersection(self, other: Flags) -> Flags
The bitwise and (&) of the bits in self and other.
pub const fn union(self, other: Flags) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn union(self, other: Flags) -> Flags
The bitwise or (|) of the bits in self and other.
pub const fn difference(self, other: Flags) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn difference(self, other: Flags) -> Flags
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: Flags) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn symmetric_difference(self, other: Flags) -> Flags
The bitwise exclusive-or (^) of the bits in self and other.
pub const fn complement(self) -> Flags
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn complement(self) -> Flags
The bitwise negation (!) of the bits in self, truncating the result.
ยงimpl Flags
impl Flags
pub const fn iter(&self) -> Iter<Flags>
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn iter(&self) -> Iter<Flags>
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<Flags>
๐Deprecated since 0.94.0: Use the skia_safe::gradient module
pub const fn iter_names(&self) -> IterNames<Flags>
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 Flags
impl BitAndAssign for Flags
ยงfn bitand_assign(&mut self, other: Flags)
fn bitand_assign(&mut self, other: Flags)
The bitwise and (&) of the bits in self and other.
ยงimpl BitOrAssign for Flags
impl BitOrAssign for Flags
ยงfn bitor_assign(&mut self, other: Flags)
fn bitor_assign(&mut self, other: Flags)
The bitwise or (|) of the bits in self and other.
ยงimpl BitXorAssign for Flags
impl BitXorAssign for Flags
ยงfn bitxor_assign(&mut self, other: Flags)
fn bitxor_assign(&mut self, other: Flags)
The bitwise exclusive-or (^) of the bits in self and other.
ยงimpl Extend<Flags> for Flags
impl Extend<Flags> for Flags
ยงfn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Flags>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Flags>,
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 Flags
impl Flags for Flags
ยงfn from_bits_retain(bits: u32) -> Flags
fn from_bits_retain(bits: u32) -> Flags
ยง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 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 From<Flags> for Interpolation
impl From<Flags> for Interpolation
ยงfn from(flags: Flags) -> Interpolation
fn from(flags: Flags) -> Interpolation
ยงimpl FromIterator<Flags> for Flags
impl FromIterator<Flags> for Flags
ยงfn from_iter<T>(iterator: T) -> Flagswhere
T: IntoIterator<Item = Flags>,
fn from_iter<T>(iterator: T) -> Flagswhere
T: IntoIterator<Item = Flags>,
The bitwise or (|) of the bits in each flags value.
ยงimpl IntoIterator for Flags
impl IntoIterator for Flags
ยงimpl Ord for Flags
impl Ord for Flags
ยงimpl PartialOrd for Flags
impl PartialOrd for Flags
ยงimpl Sub for Flags
impl Sub for Flags
ยงimpl SubAssign for Flags
impl SubAssign for Flags
ยงfn sub_assign(&mut self, other: Flags)
fn sub_assign(&mut self, other: Flags)
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 Copy for Flags
impl Eq for Flags
impl StructuralPartialEq for Flags
Auto Trait Implementationsยง
impl Freeze for Flags
impl RefUnwindSafe for Flags
impl Send for Flags
impl Sync for Flags
impl Unpin for Flags
impl UnsafeUnpin for Flags
impl UnwindSafe for Flags
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,
ยงimpl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
ยง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
key and return true if they are equal.