pub struct CartesianConstraint<N: RealField + Copy, Handle: BodyHandle> { /* private fields */ }
Expand description
A constraint that removes all relative angular motion between two body parts.
Implementations§
Source§impl<N: RealField + Copy, Handle: BodyHandle> CartesianConstraint<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> CartesianConstraint<N, Handle>
Sourcepub fn new(
b1: BodyPartHandle<Handle>,
b2: BodyPartHandle<Handle>,
anchor1: Point<N>,
ref_frame1: Rotation<N>,
anchor2: Point<N>,
ref_frame2: Rotation<N>,
) -> Self
pub fn new( b1: BodyPartHandle<Handle>, b2: BodyPartHandle<Handle>, anchor1: Point<N>, ref_frame1: Rotation<N>, anchor2: Point<N>, ref_frame2: Rotation<N>, ) -> Self
Creates a cartesian constraint between two body parts.
This will ensure the rotational parts of the frames given identified by ref_frame1
and
ref_frame2
and attached to the corresponding bodies will coincide.
Sourcepub fn set_reference_frame_1(&mut self, ref_frame1: Rotation<N>)
pub fn set_reference_frame_1(&mut self, ref_frame1: Rotation<N>)
Changes the reference frame for the first body part.
Sourcepub fn set_reference_frame_2(&mut self, frame2: Rotation<N>)
pub fn set_reference_frame_2(&mut self, frame2: Rotation<N>)
Changes the reference frame for the second body part.
Sourcepub fn set_anchor_1(&mut self, anchor1: Point<N>)
pub fn set_anchor_1(&mut self, anchor1: Point<N>)
Changes the attach point for the first body part.
Sourcepub fn set_anchor_2(&mut self, anchor2: Point<N>)
pub fn set_anchor_2(&mut self, anchor2: Point<N>)
Changes the attach point for the second body part.
Sourcepub fn set_break_torque(&mut self, break_torque: N)
pub fn set_break_torque(&mut self, break_torque: N)
The maximum torque this joint can absorb before breaking.
Trait Implementations§
Source§impl<N: RealField + Copy, Handle: BodyHandle> JointConstraint<N, Handle> for CartesianConstraint<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> JointConstraint<N, Handle> for CartesianConstraint<N, Handle>
Source§fn num_velocity_constraints(&self) -> usize
fn num_velocity_constraints(&self) -> usize
The maximum number of velocity constraints generated by this joint.
Source§fn anchors(&self) -> (BodyPartHandle<Handle>, BodyPartHandle<Handle>)
fn anchors(&self) -> (BodyPartHandle<Handle>, BodyPartHandle<Handle>)
The two body parts affected by this joint.
Source§fn velocity_constraints(
&mut self,
_: &IntegrationParameters<N>,
bodies: &dyn BodySet<N, Handle = Handle>,
ext_vels: &DVector<N>,
ground_j_id: &mut usize,
j_id: &mut usize,
jacobians: &mut [N],
constraints: &mut LinearConstraints<N, usize>,
)
fn velocity_constraints( &mut self, _: &IntegrationParameters<N>, bodies: &dyn BodySet<N, Handle = Handle>, ext_vels: &DVector<N>, ground_j_id: &mut usize, j_id: &mut usize, jacobians: &mut [N], constraints: &mut LinearConstraints<N, usize>, )
Initialize and retrieve all the constraints appied to the bodies attached to this joint.
Source§fn cache_impulses(
&mut self,
constraints: &LinearConstraints<N, usize>,
inv_dt: N,
)
fn cache_impulses( &mut self, constraints: &LinearConstraints<N, usize>, inv_dt: N, )
Called after velocity constraint resolution, allows the joint to keep a cache of impulses generated for each constraint.
Source§impl<N: RealField + Copy, Handle: BodyHandle> NonlinearConstraintGenerator<N, Handle> for CartesianConstraint<N, Handle>
impl<N: RealField + Copy, Handle: BodyHandle> NonlinearConstraintGenerator<N, Handle> for CartesianConstraint<N, Handle>
Source§fn num_position_constraints(
&self,
bodies: &dyn BodySet<N, Handle = Handle>,
) -> usize
fn num_position_constraints( &self, bodies: &dyn BodySet<N, Handle = Handle>, ) -> usize
Maximum of non-linear position constraint this generator needs to output.
Source§fn position_constraint(
&self,
parameters: &IntegrationParameters<N>,
_: usize,
bodies: &mut dyn BodySet<N, Handle = Handle>,
jacobians: &mut [N],
) -> Option<GenericNonlinearConstraint<N, Handle>>
fn position_constraint( &self, parameters: &IntegrationParameters<N>, _: usize, bodies: &mut dyn BodySet<N, Handle = Handle>, jacobians: &mut [N], ) -> Option<GenericNonlinearConstraint<N, Handle>>
Generate the
i
-th position constraint of this generator.Auto Trait Implementations§
impl<N, Handle> Freeze for CartesianConstraint<N, Handle>
impl<N, Handle> RefUnwindSafe for CartesianConstraint<N, Handle>where
N: RefUnwindSafe,
Handle: RefUnwindSafe,
impl<N, Handle> Send for CartesianConstraint<N, Handle>
impl<N, Handle> Sync for CartesianConstraint<N, Handle>
impl<N, Handle> Unpin for CartesianConstraint<N, Handle>
impl<N, Handle> UnwindSafe for CartesianConstraint<N, Handle>where
N: UnwindSafe,
Handle: UnwindSafe,
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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.