CartesianConstraint

Struct CartesianConstraint 

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

Source

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.

Source

pub fn set_reference_frame_1(&mut self, ref_frame1: Rotation<N>)

Changes the reference frame for the first body part.

Source

pub fn set_reference_frame_2(&mut self, frame2: Rotation<N>)

Changes the reference frame for the second body part.

Source

pub fn set_anchor_1(&mut self, anchor1: Point<N>)

Changes the attach point for the first body part.

Source

pub fn set_anchor_2(&mut self, anchor2: Point<N>)

Changes the attach point for the second body part.

Source

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>

Source§

fn is_broken(&self) -> bool

Returns true if this joint is broken.
Source§

fn num_velocity_constraints(&self) -> usize

The maximum number of velocity constraints generated by this joint.
Source§

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>, )

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, )

Called after velocity constraint resolution, allows the joint to keep a cache of impulses generated for each constraint.
Source§

fn is_active(&self, bodies: &dyn BodySet<N, Handle = Handle>) -> bool

Return true if the constraint is active. Read more
Source§

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

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>>

Generate the i-th position constraint of this generator.

Auto Trait Implementations§

§

impl<N, Handle> Freeze for CartesianConstraint<N, Handle>
where N: Freeze, Handle: Freeze,

§

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>
where N: Unpin, Handle: Unpin,

§

impl<N, Handle> UnwindSafe for CartesianConstraint<N, Handle>
where N: UnwindSafe, Handle: 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 + Sync + Send>

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> 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.