pub struct ConstraintSolver {
pub iteration_count: u32,
pub baumgarte_factor: f32,
pub warm_start: bool,
pub substep_count: u32,
}Expand description
Sequential-impulse + XPBD constraint solver.
Call solve() once per physics step. Internally iterates
iteration_count times applying velocity and/or position corrections.
Fields§
§iteration_count: u32§baumgarte_factor: f32§warm_start: bool§substep_count: u32Number of XPBD substeps (for solve_xpbd).
Implementations§
Source§impl ConstraintSolver
impl ConstraintSolver
pub fn new(iterations: u32) -> Self
Sourcepub fn solve(
&self,
bodies: &mut HashMap<BodyHandle, BodyState>,
constraints: &mut [Box<dyn Constraint>],
dt: f32,
)
pub fn solve( &self, bodies: &mut HashMap<BodyHandle, BodyState>, constraints: &mut [Box<dyn Constraint>], dt: f32, )
Solve all constraints using sequential impulses (velocity level).
Sourcepub fn solve_positions(
&self,
bodies: &mut HashMap<BodyHandle, BodyState>,
constraints: &mut [Box<dyn Constraint>],
dt: f32,
)
pub fn solve_positions( &self, bodies: &mut HashMap<BodyHandle, BodyState>, constraints: &mut [Box<dyn Constraint>], dt: f32, )
Apply position correction (post-solve) using Baumgarte stabilization.
Sourcepub fn solve_xpbd(
&self,
bodies: &mut HashMap<BodyHandle, BodyState>,
constraints: &mut [Box<dyn Constraint>],
dt: f32,
)
pub fn solve_xpbd( &self, bodies: &mut HashMap<BodyHandle, BodyState>, constraints: &mut [Box<dyn Constraint>], dt: f32, )
Solve using XPBD with substep integration.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ConstraintSolver
impl RefUnwindSafe for ConstraintSolver
impl Send for ConstraintSolver
impl Sync for ConstraintSolver
impl Unpin for ConstraintSolver
impl UnsafeUnpin for ConstraintSolver
impl UnwindSafe for ConstraintSolver
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
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
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>
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)
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)
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.