Struct heron::rapier_plugin::rapier3d::prelude::SolverFlags
pub struct SolverFlags { /* private fields */ }
Expand description
Flags affecting the behavior of the constraints solver for a given contact manifold.
Implementations
impl SolverFlags
impl SolverFlags
pub const COMPUTE_IMPULSES: SolverFlags = Self{ bits: 1,}
pub const COMPUTE_IMPULSES: SolverFlags = Self{ bits: 1,}
The constraint solver will take this contact manifold into account for force computation.
pub const fn empty() -> SolverFlags
pub const fn empty() -> SolverFlags
Returns an empty set of flags.
pub const fn all() -> SolverFlags
pub const fn all() -> SolverFlags
Returns the set containing all flags.
pub const fn from_bits(bits: u32) -> Option<SolverFlags>
pub const fn from_bits(bits: u32) -> Option<SolverFlags>
Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.
pub const fn from_bits_truncate(bits: u32) -> SolverFlags
pub const fn from_bits_truncate(bits: u32) -> SolverFlags
Convert from underlying bit representation, dropping any bits that do not correspond to flags.
pub const unsafe fn from_bits_unchecked(bits: u32) -> SolverFlags
pub const unsafe fn from_bits_unchecked(bits: u32) -> SolverFlags
Convert from underlying bit representation, preserving all bits (even those not corresponding to a defined flag).
Safety
The caller of the bitflags!
macro can chose to allow or
disallow extra bits for their bitflags type.
The caller of from_bits_unchecked()
has to ensure that
all bits correspond to a defined flag or that extra bits
are valid for this bitflags type.
pub const fn intersects(&self, other: SolverFlags) -> bool
pub const fn intersects(&self, other: SolverFlags) -> bool
Returns true
if there are flags common to both self
and other
.
pub const fn contains(&self, other: SolverFlags) -> bool
pub const fn contains(&self, other: SolverFlags) -> bool
Returns true
if all of the flags in other
are contained within self
.
pub fn insert(&mut self, other: SolverFlags)
pub fn insert(&mut self, other: SolverFlags)
Inserts the specified flags in-place.
pub fn remove(&mut self, other: SolverFlags)
pub fn remove(&mut self, other: SolverFlags)
Removes the specified flags in-place.
pub fn toggle(&mut self, other: SolverFlags)
pub fn toggle(&mut self, other: SolverFlags)
Toggles the specified flags in-place.
pub fn set(&mut self, other: SolverFlags, value: bool)
pub fn set(&mut self, other: SolverFlags, value: bool)
Inserts or removes the specified flags depending on the passed value.
pub const fn intersection(self, other: SolverFlags) -> SolverFlags
pub const fn intersection(self, other: SolverFlags) -> SolverFlags
Returns the intersection between the flags in self
and
other
.
Specifically, the returned set contains only the flags which are
present in both self
and other
.
This is equivalent to using the &
operator (e.g.
ops::BitAnd
), as in flags & other
.
pub const fn union(self, other: SolverFlags) -> SolverFlags
pub const fn union(self, other: SolverFlags) -> SolverFlags
Returns the union of between the flags in self
and other
.
Specifically, the returned set contains all flags which are
present in either self
or other
, including any which are
present in both (see Self::symmetric_difference
if that
is undesirable).
This is equivalent to using the |
operator (e.g.
ops::BitOr
), as in flags | other
.
pub const fn difference(self, other: SolverFlags) -> SolverFlags
pub const fn difference(self, other: SolverFlags) -> SolverFlags
Returns the difference between the flags in self
and other
.
Specifically, the returned set contains all flags present in
self
, except for the ones present in other
.
It is also conceptually equivalent to the “bit-clear” operation:
flags & !other
(and this syntax is also supported).
This is equivalent to using the -
operator (e.g.
ops::Sub
), as in flags - other
.
pub const fn symmetric_difference(self, other: SolverFlags) -> SolverFlags
pub const fn symmetric_difference(self, other: SolverFlags) -> SolverFlags
Returns the symmetric difference between the flags
in self
and other
.
Specifically, the returned set contains the flags present which
are present in self
or other
, but that are not present in
both. Equivalently, it contains the flags present in exactly
one of the sets self
and other
.
This is equivalent to using the ^
operator (e.g.
ops::BitXor
), as in flags ^ other
.
pub const fn complement(self) -> SolverFlags
pub const fn complement(self) -> SolverFlags
Returns the complement of this set of flags.
Specifically, the returned set contains all the flags which are
not set in self
, but which are allowed for this type.
Alternatively, it can be thought of as the set difference
between Self::all()
and self
(e.g. Self::all() - self
)
This is equivalent to using the !
operator (e.g.
ops::Not
), as in !flags
.
Trait Implementations
impl Binary for SolverFlags
impl Binary for SolverFlags
impl BitAnd<SolverFlags> for SolverFlags
impl BitAnd<SolverFlags> for SolverFlags
fn bitand(self, other: SolverFlags) -> SolverFlags
fn bitand(self, other: SolverFlags) -> SolverFlags
Returns the intersection between the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
&
operator.impl BitAndAssign<SolverFlags> for SolverFlags
impl BitAndAssign<SolverFlags> for SolverFlags
fn bitand_assign(&mut self, other: SolverFlags)
fn bitand_assign(&mut self, other: SolverFlags)
Disables all flags disabled in the set.
impl BitOr<SolverFlags> for SolverFlags
impl BitOr<SolverFlags> for SolverFlags
fn bitor(self, other: SolverFlags) -> SolverFlags
fn bitor(self, other: SolverFlags) -> SolverFlags
Returns the union of the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
|
operator.impl BitOrAssign<SolverFlags> for SolverFlags
impl BitOrAssign<SolverFlags> for SolverFlags
fn bitor_assign(&mut self, other: SolverFlags)
fn bitor_assign(&mut self, other: SolverFlags)
Adds the set of flags.
impl BitXor<SolverFlags> for SolverFlags
impl BitXor<SolverFlags> for SolverFlags
fn bitxor(self, other: SolverFlags) -> SolverFlags
fn bitxor(self, other: SolverFlags) -> SolverFlags
Returns the left flags, but with all the right flags toggled.
type Output = SolverFlags
type Output = SolverFlags
^
operator.impl BitXorAssign<SolverFlags> for SolverFlags
impl BitXorAssign<SolverFlags> for SolverFlags
fn bitxor_assign(&mut self, other: SolverFlags)
fn bitxor_assign(&mut self, other: SolverFlags)
Toggles the set of flags.
impl Clone for SolverFlags
impl Clone for SolverFlags
fn clone(&self) -> SolverFlags
fn clone(&self) -> SolverFlags
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreimpl Debug for SolverFlags
impl Debug for SolverFlags
impl Default for SolverFlags
impl Default for SolverFlags
fn default() -> SolverFlags
fn default() -> SolverFlags
impl Extend<SolverFlags> for SolverFlags
impl Extend<SolverFlags> for SolverFlags
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = SolverFlags>,
fn extend<T>(&mut self, iterator: T)where
T: IntoIterator<Item = SolverFlags>,
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)impl FromIterator<SolverFlags> for SolverFlags
impl FromIterator<SolverFlags> for SolverFlags
fn from_iter<T>(iterator: T) -> SolverFlagswhere
T: IntoIterator<Item = SolverFlags>,
fn from_iter<T>(iterator: T) -> SolverFlagswhere
T: IntoIterator<Item = SolverFlags>,
impl Hash for SolverFlags
impl Hash for SolverFlags
impl LowerHex for SolverFlags
impl LowerHex for SolverFlags
impl Not for SolverFlags
impl Not for SolverFlags
fn not(self) -> SolverFlags
fn not(self) -> SolverFlags
Returns the complement of this set of flags.
type Output = SolverFlags
type Output = SolverFlags
!
operator.impl Octal for SolverFlags
impl Octal for SolverFlags
impl Ord for SolverFlags
impl Ord for SolverFlags
fn cmp(&self, other: &SolverFlags) -> Ordering
fn cmp(&self, other: &SolverFlags) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
1.21.0 · sourcefn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,
impl PartialEq<SolverFlags> for SolverFlags
impl PartialEq<SolverFlags> for SolverFlags
fn eq(&self, other: &SolverFlags) -> bool
fn eq(&self, other: &SolverFlags) -> bool
impl PartialOrd<SolverFlags> for SolverFlags
impl PartialOrd<SolverFlags> for SolverFlags
fn partial_cmp(&self, other: &SolverFlags) -> Option<Ordering>
fn partial_cmp(&self, other: &SolverFlags) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moreimpl Sub<SolverFlags> for SolverFlags
impl Sub<SolverFlags> for SolverFlags
fn sub(self, other: SolverFlags) -> SolverFlags
fn sub(self, other: SolverFlags) -> SolverFlags
Returns the set difference of the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
-
operator.impl SubAssign<SolverFlags> for SolverFlags
impl SubAssign<SolverFlags> for SolverFlags
fn sub_assign(&mut self, other: SolverFlags)
fn sub_assign(&mut self, other: SolverFlags)
Disables all flags enabled in the set.
impl UpperHex for SolverFlags
impl UpperHex for SolverFlags
impl Copy for SolverFlags
impl Eq for SolverFlags
impl StructuralEq for SolverFlags
impl StructuralPartialEq for SolverFlags
Auto Trait Implementations
impl RefUnwindSafe for SolverFlags
impl Send for SolverFlags
impl Sync for SolverFlags
impl Unpin for SolverFlags
impl UnwindSafe for SolverFlags
Blanket Implementations
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
T
[ShaderType
] for self
. When used in [AsBindGroup
]
derives, it is safe to assume that all images in self
exist. Read moresourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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
. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn 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. Read morefn 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. Read moreimpl<T> DynHash for Twhere
T: DynEq + Hash,
impl<T> DynHash for Twhere
T: DynEq + Hash,
sourceimpl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Self
using data from the given [World]sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
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 morefn 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.