Struct Barrier
pub struct Barrier(/* private fields */);unstable-wgpu-27 only.Expand description
Memory barrier flags.
Implementations§
§impl Barrier
impl Barrier
pub const STORAGE: Barrier
Available on crate feature wgpu-27 only.
pub const STORAGE: Barrier
wgpu-27 only.Barrier affects all AddressSpace::Storage accesses.
pub const WORK_GROUP: Barrier
Available on crate feature wgpu-27 only.
pub const WORK_GROUP: Barrier
wgpu-27 only.Barrier affects all AddressSpace::WorkGroup accesses.
§impl Barrier
impl Barrier
pub const fn empty() -> Barrier
Available on crate feature wgpu-27 only.
pub const fn empty() -> Barrier
wgpu-27 only.Get a flags value with all bits unset.
pub const fn all() -> Barrier
Available on crate feature wgpu-27 only.
pub const fn all() -> Barrier
wgpu-27 only.Get a flags value with all known bits set.
pub const fn bits(&self) -> u32
Available on crate feature wgpu-27 only.
pub const fn bits(&self) -> u32
wgpu-27 only.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<Barrier>
Available on crate feature wgpu-27 only.
pub const fn from_bits(bits: u32) -> Option<Barrier>
wgpu-27 only.Convert from a bits value.
This method will return None if any unknown bits are set.
pub const fn from_bits_truncate(bits: u32) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn from_bits_truncate(bits: u32) -> Barrier
wgpu-27 only.Convert from a bits value, unsetting any unknown bits.
pub const fn from_bits_retain(bits: u32) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn from_bits_retain(bits: u32) -> Barrier
wgpu-27 only.Convert from a bits value exactly.
pub fn from_name(name: &str) -> Option<Barrier>
Available on crate feature wgpu-27 only.
pub fn from_name(name: &str) -> Option<Barrier>
wgpu-27 only.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
Available on crate feature wgpu-27 only.
pub const fn is_empty(&self) -> bool
wgpu-27 only.Whether all bits in self are unset.
pub const fn is_all(&self) -> bool
Available on crate feature wgpu-27 only.
pub const fn is_all(&self) -> bool
wgpu-27 only.Whether all known bits in this flags value are set.
pub const fn intersects(&self, other: Barrier) -> bool
Available on crate feature wgpu-27 only.
pub const fn intersects(&self, other: Barrier) -> bool
wgpu-27 only.Whether any set bits in other are also set in self.
pub const fn contains(&self, other: Barrier) -> bool
Available on crate feature wgpu-27 only.
pub const fn contains(&self, other: Barrier) -> bool
wgpu-27 only.Whether all set bits in other are also set in self.
pub fn insert(&mut self, other: Barrier)
Available on crate feature wgpu-27 only.
pub fn insert(&mut self, other: Barrier)
wgpu-27 only.The bitwise or (|) of the bits in self and other.
pub fn remove(&mut self, other: Barrier)
Available on crate feature wgpu-27 only.
pub fn remove(&mut self, other: Barrier)
wgpu-27 only.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: Barrier)
Available on crate feature wgpu-27 only.
pub fn toggle(&mut self, other: Barrier)
wgpu-27 only.The bitwise exclusive-or (^) of the bits in self and other.
pub fn set(&mut self, other: Barrier, value: bool)
Available on crate feature wgpu-27 only.
pub fn set(&mut self, other: Barrier, value: bool)
wgpu-27 only.Call insert when value is true or remove when value is false.
pub const fn intersection(self, other: Barrier) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn intersection(self, other: Barrier) -> Barrier
wgpu-27 only.The bitwise and (&) of the bits in self and other.
pub const fn union(self, other: Barrier) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn union(self, other: Barrier) -> Barrier
wgpu-27 only.The bitwise or (|) of the bits in self and other.
pub const fn difference(self, other: Barrier) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn difference(self, other: Barrier) -> Barrier
wgpu-27 only.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: Barrier) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn symmetric_difference(self, other: Barrier) -> Barrier
wgpu-27 only.The bitwise exclusive-or (^) of the bits in self and other.
pub const fn complement(self) -> Barrier
Available on crate feature wgpu-27 only.
pub const fn complement(self) -> Barrier
wgpu-27 only.The bitwise negation (!) of the bits in self, truncating the result.
§impl Barrier
impl Barrier
pub const fn iter(&self) -> Iter<Barrier>
Available on crate feature wgpu-27 only.
pub const fn iter(&self) -> Iter<Barrier>
wgpu-27 only.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<Barrier>
Available on crate feature wgpu-27 only.
pub const fn iter_names(&self) -> IterNames<Barrier>
wgpu-27 only.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 Barrier
impl BitAndAssign for Barrier
§fn bitand_assign(&mut self, other: Barrier)
fn bitand_assign(&mut self, other: Barrier)
The bitwise and (&) of the bits in self and other.
§impl BitOrAssign for Barrier
impl BitOrAssign for Barrier
§fn bitor_assign(&mut self, other: Barrier)
fn bitor_assign(&mut self, other: Barrier)
The bitwise or (|) of the bits in self and other.
§impl BitXorAssign for Barrier
impl BitXorAssign for Barrier
§fn bitxor_assign(&mut self, other: Barrier)
fn bitxor_assign(&mut self, other: Barrier)
The bitwise exclusive-or (^) of the bits in self and other.
§impl Extend<Barrier> for Barrier
impl Extend<Barrier> for Barrier
§fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Barrier>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = Barrier>,
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 Barrier
impl Flags for Barrier
§fn from_bits_retain(bits: u32) -> Barrier
fn from_bits_retain(bits: u32) -> Barrier
§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 FromIterator<Barrier> for Barrier
impl FromIterator<Barrier> for Barrier
§fn from_iter<T>(iterator: T) -> Barrierwhere
T: IntoIterator<Item = Barrier>,
fn from_iter<T>(iterator: T) -> Barrierwhere
T: IntoIterator<Item = Barrier>,
The bitwise or (|) of the bits in each flags value.
§impl IntoIterator for Barrier
impl IntoIterator for Barrier
§impl Sub for Barrier
impl Sub for Barrier
§impl SubAssign for Barrier
impl SubAssign for Barrier
§fn sub_assign(&mut self, other: Barrier)
fn sub_assign(&mut self, other: Barrier)
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 Barrier
impl Eq for Barrier
impl StructuralPartialEq for Barrier
Auto Trait Implementations§
impl Freeze for Barrier
impl RefUnwindSafe for Barrier
impl Send for Barrier
impl Sync for Barrier
impl Unpin for Barrier
impl UnsafeUnpin for Barrier
impl UnwindSafe for Barrier
Blanket Implementations§
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<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
key and return true if they are equal.§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<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
ReadEndian::read_from_little_endian().§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.