Skip to main content

SolverContactGeneric

Struct SolverContactGeneric 

Source
#[repr(C, align(16))]
pub struct SolverContactGeneric<N: ScalarType, const LANES: usize> { pub anchor1: N::Vector, pub anchor2: N::Vector, pub dist: N, pub tangent_velocity: N::Vector, pub contact_id: [ContactId; LANES], }
Expand description

A contact seen by the constraints solver for computing forces.

Fields§

§anchor1: N::Vector

The contact point on the first body’s surface (contact skin baked in), in that body’s CoM-centered local frame so it rides rigidly with the body — what lets contact recycling skip the per-frame world refresh. World-space instead for a side without a solver body (none, or world-attached by dominance — fixed bodies included). Inside PhysicsHooks::modify_solver_contacts this always holds the fresh world-space point (hooks run before localization).

§anchor2: N::Vector

The contact point on the second body’s surface, expressed like Self::anchor1 (world-space when the second side is world-attached, i.e. relative_dominance < 0, or inside the contact-modification hook).

§dist: N

Distance between the contact points along the normal at the last full contact update (negative = penetration), minus the contact skins. Writable from PhysicsHooks::modify_solver_contacts (the delta is baked into the anchors after the hook); afterwards the solver re-derives the live separation and never reads this.

§tangent_velocity: N::Vector

The desired tangent relative velocity at the contact point.

This is set to zero by default. Set to a non-zero value to simulate, e.g., conveyor belts.

§contact_id: [ContactId; LANES]

The index of the manifold contact used to generate this solver contact, in the low 31 bits; bit 31 (NEW_CONTACT_BIT) is set if this contact did not exist during the last full contact update (recycled steps leave it untouched; the solver derives contact newness from the warm-start state instead).

Implementations§

Source§

impl SolverContactGeneric<WideF32x4, SIMD_WIDTH>

Source

pub unsafe fn gather_unchecked( contacts: &[&[SolverContact]; 4], ks: [usize; 4], ) -> Self

Gathers one solver contact per lane, at a per-lane index (the lanes of a constraint chunk may have different active-contact counts, so callers clamp each lane’s index to its own count).

§Safety

Every ks[k] must be a valid index into contacts[k] — the gather reads each lane’s slice unchecked.

Source§

impl<N: ScalarType, const LANES: usize> SolverContactGeneric<N, LANES>

Source

pub fn contact_indices(&self) -> [ContactId; LANES]

The manifold contact indices, with the is-new bit masked off.

These indices are only valid within the timestep that produced this solver contact: manifold points may be reordered or replaced by the next narrow-phase update.

Trait Implementations§

Source§

impl<N: Clone + ScalarType, const LANES: usize> Clone for SolverContactGeneric<N, LANES>
where N::Vector: Clone,

Source§

fn clone(&self) -> SolverContactGeneric<N, LANES>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<N: Copy + ScalarType, const LANES: usize> Copy for SolverContactGeneric<N, LANES>
where N::Vector: Copy,

Source§

impl<N: Debug + ScalarType, const LANES: usize> Debug for SolverContactGeneric<N, LANES>
where N::Vector: Debug,

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<N, const LANES: usize> Freeze for SolverContactGeneric<N, LANES>
where <N as ScalarType>::Vector: Freeze, N: Freeze,

§

impl<N, const LANES: usize> RefUnwindSafe for SolverContactGeneric<N, LANES>

§

impl<N, const LANES: usize> Send for SolverContactGeneric<N, LANES>
where <N as ScalarType>::Vector: Send,

§

impl<N, const LANES: usize> Sync for SolverContactGeneric<N, LANES>
where <N as ScalarType>::Vector: Sync,

§

impl<N, const LANES: usize> Unpin for SolverContactGeneric<N, LANES>
where <N as ScalarType>::Vector: Unpin, N: Unpin,

§

impl<N, const LANES: usize> UnsafeUnpin for SolverContactGeneric<N, LANES>

§

impl<N, const LANES: usize> UnwindSafe for SolverContactGeneric<N, LANES>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
Source§

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> DowncastSend for T
where T: Any + Send,

Source§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Send + Sync>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, W> HasTypeWitness<W> for T
where W: MakeTypeWitness<Arg = T>, T: ?Sized,

Source§

const WITNESS: W = W::MAKE

A constant of the type witness
Source§

impl<T> Identity for T
where T: ?Sized,

Source§

const TYPE_EQ: TypeEq<T, <T as Identity>::Type> = TypeEq::NEW

Proof that Self is the same type as Self::Type, provides methods for casting between Self and Self::Type.
Source§

type Type = T

The same type as Self, used to emulate type equality bounds (T == U) with associated type equality constraints (T: Identity<Type = U>).
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts 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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts 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
Source§

impl<T> MaybeSync for T
where T: Sync + ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.