Struct heron::rapier_plugin::rapier::geometry::SolverFlags [−]
pub struct SolverFlags { /* fields omitted */ }
Flags affecting the behavior of the constraints solver for a given contact manifold.
Implementations
impl SolverFlags
pub const COMPUTE_IMPULSES: SolverFlags
The constraint solver will take this contact manifold into account for force computation.
pub const MODIFY_SOLVER_CONTACTS: SolverFlags
The user-defined physics hooks will be used to modify the solver contacts of this contact manifold.
pub const fn empty() -> SolverFlags
Returns an empty set of flags
pub const fn all() -> SolverFlags
Returns the set containing all flags.
pub const fn bits(&self) -> u32
Returns the raw value of the flags currently stored.
pub 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
Convert from underlying bit representation, dropping any bits that do not correspond to flags.
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).
pub const fn is_empty(&self) -> bool
Returns true
if no flags are currently stored.
pub const fn is_all(&self) -> bool
Returns true
if all flags are currently set.
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
Returns true
all of the flags in other
are contained within self
.
pub fn insert(&mut self, other: SolverFlags)
Inserts the specified flags in-place.
pub fn remove(&mut self, other: SolverFlags)
Removes the specified flags in-place.
pub fn toggle(&mut self, other: SolverFlags)
Toggles the specified flags in-place.
pub fn set(&mut self, other: SolverFlags, value: bool)
Inserts or removes the specified flags depending on the passed value.
Trait Implementations
impl Binary for SolverFlags
impl BitAnd<SolverFlags> for SolverFlags
type Output = SolverFlags
The resulting type after applying the &
operator.
pub fn bitand(self, other: SolverFlags) -> SolverFlags
Returns the intersection between the two sets of flags.
impl BitAndAssign<SolverFlags> for SolverFlags
pub fn bitand_assign(&mut self, other: SolverFlags)
Disables all flags disabled in the set.
impl BitOr<SolverFlags> for SolverFlags
type Output = SolverFlags
The resulting type after applying the |
operator.
pub fn bitor(self, other: SolverFlags) -> SolverFlags
Returns the union of the two sets of flags.
impl BitOrAssign<SolverFlags> for SolverFlags
pub fn bitor_assign(&mut self, other: SolverFlags)
Adds the set of flags.
impl BitXor<SolverFlags> for SolverFlags
type Output = SolverFlags
The resulting type after applying the ^
operator.
pub fn bitxor(self, other: SolverFlags) -> SolverFlags
Returns the left flags, but with all the right flags toggled.
impl BitXorAssign<SolverFlags> for SolverFlags
pub fn bitxor_assign(&mut self, other: SolverFlags)
Toggles the set of flags.
impl Clone for SolverFlags
pub fn clone(&self) -> SolverFlags
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Copy for SolverFlags
impl Debug for SolverFlags
impl Default for SolverFlags
pub fn default() -> SolverFlags
impl Eq for SolverFlags
impl Extend<SolverFlags> for SolverFlags
pub fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SolverFlags>,
T: IntoIterator<Item = SolverFlags>,
pub fn extend_one(&mut self, item: A)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl FromIterator<SolverFlags> for SolverFlags
pub fn from_iter<T>(iterator: T) -> SolverFlags where
T: IntoIterator<Item = SolverFlags>,
T: IntoIterator<Item = SolverFlags>,
impl Hash for SolverFlags
pub fn hash<__H>(&self, state: &mut __H) where
__H: Hasher,
__H: Hasher,
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl LowerHex for SolverFlags
impl Not for SolverFlags
type Output = SolverFlags
The resulting type after applying the !
operator.
pub fn not(self) -> SolverFlags
Returns the complement of this set of flags.
impl Octal for SolverFlags
impl Ord for SolverFlags
pub fn cmp(&self, other: &SolverFlags) -> Ordering
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl PartialEq<SolverFlags> for SolverFlags
pub fn eq(&self, other: &SolverFlags) -> bool
pub fn ne(&self, other: &SolverFlags) -> bool
impl PartialOrd<SolverFlags> for SolverFlags
pub fn partial_cmp(&self, other: &SolverFlags) -> Option<Ordering>
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl StructuralEq for SolverFlags
impl StructuralPartialEq for SolverFlags
impl Sub<SolverFlags> for SolverFlags
type Output = SolverFlags
The resulting type after applying the -
operator.
pub fn sub(self, other: SolverFlags) -> SolverFlags
Returns the set difference of the two sets of flags.
impl SubAssign<SolverFlags> for SolverFlags
pub fn sub_assign(&mut self, other: SolverFlags)
Disables all flags enabled in the set.
impl UpperHex 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> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Any for T where
T: Any,
T: Any,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> CallHasher for T where
T: Hash + ?Sized,
T: Hash + ?Sized,
pub default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64 where
B: BuildHasher,
H: Hash + ?Sized,
B: BuildHasher,
H: Hash + ?Sized,
impl<T> CallHasher for T where
T: Hash,
T: Hash,
impl<T> CloneAny for T where
T: Any + Clone,
T: Any + Clone,
impl<T, Right> ClosedSub<Right> for T where
T: Sub<Right, Output = T> + SubAssign<Right>,
T: Sub<Right, Output = T> + SubAssign<Right>,
impl<T> Component for T where
T: 'static + Send + Sync,
T: 'static + Send + Sync,
impl<T> Downcast for T where
T: Any,
T: Any,
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn as_any(&self) -> &(dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
impl<T> Downcast<T> for T
impl<T> DowncastSync for T where
T: Any + Send + Sync,
T: Any + Send + Sync,
impl<T> DynEq for T where
T: Any + Eq,
T: Any + Eq,
pub fn as_any(&self) -> &(dyn Any + 'static)
pub fn dyn_eq(&self, other: &(dyn DynEq + 'static)) -> bool
impl<T> DynHash for T where
T: DynEq + Hash,
T: DynEq + Hash,
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
pub fn equivalent(&self, key: &K) -> bool
[src]
impl<T> From<T> for T
[src]
impl<T> FromWorld for T where
T: Default,
T: Default,
pub fn from_world(_world: &mut World) -> T
impl<T> Instrument for T
[src]
pub fn instrument(self, span: Span) -> Instrumented<Self>
[src]
pub fn in_current_span(self) -> Instrumented<Self>
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,
impl<T> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
pub unsafe fn deref<'a>(ptr: usize) -> &'a T
pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T
pub unsafe fn drop(ptr: usize)
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> Scalar for T where
T: Copy + PartialEq<T> + Debug + Any,
[src]
T: Copy + PartialEq<T> + Debug + Any,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn is_in_subset(&self) -> bool
pub fn to_subset_unchecked(&self) -> SS
pub fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,
T: 'static + Send + Sync + Clone,
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
impl<T> Upcast<T> for T
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,