Struct heron::rapier_plugin::rapier2d::prelude::SolverFlags [−]
pub struct SolverFlags { /* fields omitted */ }
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
pub const COMPUTE_IMPULSES: SolverFlags
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
pub fn bitand(self, other: SolverFlags) -> SolverFlags
pub fn bitand(self, other: SolverFlags) -> SolverFlags
Returns the intersection between the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
The resulting type after applying the &
operator.
impl BitAndAssign<SolverFlags> for SolverFlags
impl BitAndAssign<SolverFlags> for SolverFlags
pub fn bitand_assign(&mut self, other: SolverFlags)
pub fn bitand_assign(&mut self, other: SolverFlags)
Disables all flags disabled in the set.
impl BitOr<SolverFlags> for SolverFlags
impl BitOr<SolverFlags> for SolverFlags
pub fn bitor(self, other: SolverFlags) -> SolverFlags
pub fn bitor(self, other: SolverFlags) -> SolverFlags
Returns the union of the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
The resulting type after applying the |
operator.
impl BitOrAssign<SolverFlags> for SolverFlags
impl BitOrAssign<SolverFlags> for SolverFlags
pub fn bitor_assign(&mut self, other: SolverFlags)
pub fn bitor_assign(&mut self, other: SolverFlags)
Adds the set of flags.
impl BitXor<SolverFlags> for SolverFlags
impl BitXor<SolverFlags> for SolverFlags
pub fn bitxor(self, other: SolverFlags) -> SolverFlags
pub fn bitxor(self, other: SolverFlags) -> SolverFlags
Returns the left flags, but with all the right flags toggled.
type Output = SolverFlags
type Output = SolverFlags
The resulting type after applying the ^
operator.
impl BitXorAssign<SolverFlags> for SolverFlags
impl BitXorAssign<SolverFlags> for SolverFlags
pub fn bitxor_assign(&mut self, other: SolverFlags)
pub fn bitxor_assign(&mut self, other: SolverFlags)
Toggles the set of flags.
impl Clone for SolverFlags
impl Clone for SolverFlags
pub fn clone(&self) -> SolverFlags
pub fn clone(&self) -> SolverFlags
Returns a copy of the value. Read more
Performs copy-assignment from source
. Read more
impl Debug for SolverFlags
impl Debug for SolverFlags
impl Default for SolverFlags
impl Default for SolverFlags
pub fn default() -> SolverFlags
pub fn default() -> SolverFlags
Returns the “default value” for a type. Read more
impl Extend<SolverFlags> for SolverFlags
impl Extend<SolverFlags> for SolverFlags
pub fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SolverFlags>,
pub fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SolverFlags>,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
impl FromIterator<SolverFlags> for SolverFlags
impl FromIterator<SolverFlags> for SolverFlags
pub fn from_iter<T>(iterator: T) -> SolverFlags where
T: IntoIterator<Item = SolverFlags>,
pub fn from_iter<T>(iterator: T) -> SolverFlags where
T: IntoIterator<Item = SolverFlags>,
Creates a value from an iterator. Read more
impl Hash for SolverFlags
impl Hash for SolverFlags
impl LowerHex for SolverFlags
impl LowerHex for SolverFlags
impl Not for SolverFlags
impl Not for SolverFlags
pub fn not(self) -> SolverFlags
pub fn not(self) -> SolverFlags
Returns the complement of this set of flags.
type Output = SolverFlags
type Output = SolverFlags
The resulting type after applying the !
operator.
impl Octal for SolverFlags
impl Octal for SolverFlags
impl Ord for SolverFlags
impl Ord for SolverFlags
pub fn cmp(&self, other: &SolverFlags) -> Ordering
pub fn cmp(&self, other: &SolverFlags) -> Ordering
Compares and returns the maximum of two values. Read more
Compares and returns the minimum of two values. Read more
impl PartialEq<SolverFlags> for SolverFlags
impl PartialEq<SolverFlags> for SolverFlags
pub fn eq(&self, other: &SolverFlags) -> bool
pub fn eq(&self, other: &SolverFlags) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
pub fn ne(&self, other: &SolverFlags) -> bool
pub fn ne(&self, other: &SolverFlags) -> bool
This method tests for !=
.
impl PartialOrd<SolverFlags> for SolverFlags
impl PartialOrd<SolverFlags> for SolverFlags
pub fn partial_cmp(&self, other: &SolverFlags) -> Option<Ordering>
pub fn partial_cmp(&self, other: &SolverFlags) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
impl Sub<SolverFlags> for SolverFlags
impl Sub<SolverFlags> for SolverFlags
pub fn sub(self, other: SolverFlags) -> SolverFlags
pub fn sub(self, other: SolverFlags) -> SolverFlags
Returns the set difference of the two sets of flags.
type Output = SolverFlags
type Output = SolverFlags
The resulting type after applying the -
operator.
impl SubAssign<SolverFlags> for SolverFlags
impl SubAssign<SolverFlags> for SolverFlags
pub fn sub_assign(&mut self, other: SolverFlags)
pub 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
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert 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 more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<T> DynHash for T where
T: DynEq + Hash,
impl<T> DynHash for T where
T: DynEq + Hash,
impl<T> FromWorld for T where
T: Default,
impl<T> FromWorld for T where
T: Default,
pub fn from_world(_world: &mut World) -> T
pub fn from_world(_world: &mut World) -> T
Creates Self
using data from the given [World]
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more