Struct oxygengine_physics_2d::prelude::solver::MoreauJeanSolver
source · pub struct MoreauJeanSolver<N, Handle, CollHandle>where
N: RealField + Copy,
Handle: BodyHandle,
CollHandle: ColliderHandle,{ /* private fields */ }
Expand description
Moreau-Jean time-stepping scheme.
Implementations§
source§impl<N, Handle, CollHandle> MoreauJeanSolver<N, Handle, CollHandle>where
N: RealField + Copy,
Handle: BodyHandle,
CollHandle: ColliderHandle,
impl<N, Handle, CollHandle> MoreauJeanSolver<N, Handle, CollHandle>where N: RealField + Copy, Handle: BodyHandle, CollHandle: ColliderHandle,
sourcepub fn new(
contact_model: Box<dyn ContactModel<N, Handle, CollHandle>, Global>
) -> MoreauJeanSolver<N, Handle, CollHandle>
pub fn new( contact_model: Box<dyn ContactModel<N, Handle, CollHandle>, Global> ) -> MoreauJeanSolver<N, Handle, CollHandle>
Create a new time-stepping scheme with the given contact model.
sourcepub fn set_contact_model(
&mut self,
model: Box<dyn ContactModel<N, Handle, CollHandle>, Global>
)
pub fn set_contact_model( &mut self, model: Box<dyn ContactModel<N, Handle, CollHandle>, Global> )
Sets the contact model.
sourcepub fn step<Colliders, Constraints>(
&mut self,
counters: &mut Counters,
bodies: &mut dyn BodySet<N, Handle = Handle>,
colliders: &Colliders,
joints: &mut Constraints,
manifolds: &[ColliderContactManifold<'_, N, Handle, CollHandle>],
island: &[Handle],
island_joints: &[<Constraints as JointConstraintSet<N, Handle>>::Handle],
parameters: &IntegrationParameters<N>,
coefficients: &MaterialsCoefficientsTable<N>
)where
Colliders: ColliderSet<N, Handle, Handle = CollHandle>,
Constraints: JointConstraintSet<N, Handle>,
pub fn step<Colliders, Constraints>( &mut self, counters: &mut Counters, bodies: &mut dyn BodySet<N, Handle = Handle>, colliders: &Colliders, joints: &mut Constraints, manifolds: &[ColliderContactManifold<'_, N, Handle, CollHandle>], island: &[Handle], island_joints: &[<Constraints as JointConstraintSet<N, Handle>>::Handle], parameters: &IntegrationParameters<N>, coefficients: &MaterialsCoefficientsTable<N> )where Colliders: ColliderSet<N, Handle, Handle = CollHandle>, Constraints: JointConstraintSet<N, Handle>,
Perform one step of the time-stepping scheme.
sourcepub fn step_ccd<Colliders, Constraints>(
&mut self,
counters: &mut Counters,
bodies: &mut dyn BodySet<N, Handle = Handle>,
colliders: &Colliders,
joints: &mut Constraints,
manifolds: &[ColliderContactManifold<'_, N, Handle, CollHandle>],
ccd_bodies: &[Handle],
island: &[Handle],
island_joints: &[<Constraints as JointConstraintSet<N, Handle>>::Handle],
parameters: &IntegrationParameters<N>,
coefficients: &MaterialsCoefficientsTable<N>
)where
Colliders: ColliderSet<N, Handle, Handle = CollHandle>,
Constraints: JointConstraintSet<N, Handle>,
pub fn step_ccd<Colliders, Constraints>( &mut self, counters: &mut Counters, bodies: &mut dyn BodySet<N, Handle = Handle>, colliders: &Colliders, joints: &mut Constraints, manifolds: &[ColliderContactManifold<'_, N, Handle, CollHandle>], ccd_bodies: &[Handle], island: &[Handle], island_joints: &[<Constraints as JointConstraintSet<N, Handle>>::Handle], parameters: &IntegrationParameters<N>, coefficients: &MaterialsCoefficientsTable<N> )where Colliders: ColliderSet<N, Handle, Handle = CollHandle>, Constraints: JointConstraintSet<N, Handle>,
Perform one sub-step of the time-stepping scheme as part of a CCD integration.
Auto Trait Implementations§
impl<N, Handle, CollHandle> !RefUnwindSafe for MoreauJeanSolver<N, Handle, CollHandle>
impl<N, Handle, CollHandle> Send for MoreauJeanSolver<N, Handle, CollHandle>
impl<N, Handle, CollHandle> Sync for MoreauJeanSolver<N, Handle, CollHandle>
impl<N, Handle, CollHandle> Unpin for MoreauJeanSolver<N, Handle, CollHandle>where CollHandle: Unpin, Handle: Unpin, N: Unpin,
impl<N, Handle, CollHandle> !UnwindSafe for MoreauJeanSolver<N, Handle, CollHandle>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
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
.§fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
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.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.§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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.