Skip to main content

SignoriniModel

Struct SignoriniModel 

Source
pub struct SignoriniModel<N>
where N: RealField + Copy,
{ /* private fields */ }
Expand description

A contact model generating one non-penetration constraint per contact.

This is a frictionless contact model.

Implementations§

Source§

impl<N> SignoriniModel<N>
where N: RealField + Copy,

Source

pub fn new() -> SignoriniModel<N>

Create a new Signorini contact model.

Source

pub fn build_velocity_constraint<B, Handle, CollHandle>( parameters: &IntegrationParameters<N>, body1: &B, part1: &(dyn BodyPart<N> + 'static), handle1: BodyPartHandle<Handle>, body2: &B, part2: &(dyn BodyPart<N> + 'static), handle2: BodyPartHandle<Handle>, props: &LocalMaterialProperties<N>, manifold: &ColliderContactManifold<'_, N, Handle, CollHandle>, ext_vels: &Matrix<N, Dynamic, Const<1>, VecStorage<N, Dynamic, Const<1>>>, c: &TrackedContact<N>, impulse: N, ground_j_id: &mut usize, j_id: &mut usize, jacobians: &mut [N], constraints: &mut ConstraintSet<N, Handle, CollHandle, ContactId>, ) -> bool
where B: Body<N> + ?Sized, Handle: BodyHandle, CollHandle: ColliderHandle,

Build a non-penetration velocity-based constraint for the given contact.

Source

pub fn is_constraint_active<Handle, CollHandle>( c: &TrackedContact<N>, manifold: &ColliderContactManifold<'_, N, Handle, CollHandle>, ) -> bool
where Handle: BodyHandle, CollHandle: ColliderHandle,

Checks if the given constraint is active.

Source

pub fn build_position_constraint<Handle, CollHandle>( bodies: &dyn BodySet<N, Handle = Handle>, manifold: &ColliderContactManifold<'_, N, Handle, CollHandle>, c: &TrackedContact<N>, constraints: &mut ConstraintSet<N, Handle, CollHandle, ContactId>, )
where Handle: BodyHandle, CollHandle: ColliderHandle,

Builds non-linear position-based non-penetration constraints for the given contact manifold.

Trait Implementations§

Source§

impl<N, Handle, CollHandle> ContactModel<N, Handle, CollHandle> for SignoriniModel<N>
where N: RealField + Copy, Handle: BodyHandle, CollHandle: ColliderHandle,

Source§

fn num_velocity_constraints( &self, c: &ColliderContactManifold<'_, N, Handle, CollHandle>, ) -> usize

Maximum number of velocity constraint to be generated for each contact.
Source§

fn constraints( &mut self, parameters: &IntegrationParameters<N>, coefficients: &MaterialsCoefficientsTable<N>, bodies: &dyn BodySet<N, Handle = Handle>, ext_vels: &Matrix<N, Dynamic, Const<1>, VecStorage<N, Dynamic, Const<1>>>, manifolds: &[ColliderContactManifold<'_, N, Handle, CollHandle>], ground_j_id: &mut usize, j_id: &mut usize, jacobians: &mut [N], constraints: &mut ConstraintSet<N, Handle, CollHandle, ContactId>, )

Generate all constraints for the given contact manifolds.
Source§

fn cache_impulses( &mut self, constraints: &ConstraintSet<N, Handle, CollHandle, ContactId>, )

Stores all the impulses found by the solver into a cache for warmstarting.

Auto Trait Implementations§

§

impl<N> Freeze for SignoriniModel<N>

§

impl<N> RefUnwindSafe for SignoriniModel<N>
where N: RefUnwindSafe,

§

impl<N> Send for SignoriniModel<N>

§

impl<N> Sync for SignoriniModel<N>

§

impl<N> Unpin for SignoriniModel<N>
where N: Unpin,

§

impl<N> UnsafeUnpin for SignoriniModel<N>

§

impl<N> UnwindSafe for SignoriniModel<N>
where N: UnwindSafe,

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> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn 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.
Source§

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

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

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

Convert &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)

Convert &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> DowncastSync for T
where T: Any + Send + Sync,

Source§

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

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> Finalize for T

Source§

unsafe fn finalize_raw(data: *mut ())

Safety Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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> 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, 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.
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> Component for T
where T: Send + Sync + 'static,

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,