pub struct GenericNonlinearConstraint<N, Handle>{
pub body1: BodyPartHandle<Handle>,
pub body2: Option<BodyPartHandle<Handle>>,
pub is_angular: bool,
pub dim1: usize,
pub dim2: usize,
pub wj_id1: usize,
pub wj_id2: usize,
pub rhs: N,
pub r: N,
}Expand description
A generic non-linear position constraint.
Fields§
§body1: BodyPartHandle<Handle>The first body affected by the constraint.
body2: Option<BodyPartHandle<Handle>>The second body affected by the constraint.
is_angular: boolWhether this constraint affects the bodies translation or orientation.
dim1: usizeNumber of degree of freedom of the first body.
dim2: usizeNumber of degree of freedom of the second body.
wj_id1: usizeIndex of the first entry of the constraint jacobian multiplied by the inverse mass of the first body.
wj_id2: usizeIndex of the first entry of the constraint jacobian multiplied by the inverse mass of the second body.
rhs: NThe target position change this constraint must apply.
r: NThe scaling parameter of the SOR-prox method.
Implementations§
Source§impl<N, Handle> GenericNonlinearConstraint<N, Handle>
impl<N, Handle> GenericNonlinearConstraint<N, Handle>
Sourcepub fn new(
body1: BodyPartHandle<Handle>,
body2: Option<BodyPartHandle<Handle>>,
is_angular: bool,
dim1: usize,
dim2: usize,
wj_id1: usize,
wj_id2: usize,
rhs: N,
r: N,
) -> GenericNonlinearConstraint<N, Handle>
pub fn new( body1: BodyPartHandle<Handle>, body2: Option<BodyPartHandle<Handle>>, is_angular: bool, dim1: usize, dim2: usize, wj_id1: usize, wj_id2: usize, rhs: N, r: N, ) -> GenericNonlinearConstraint<N, Handle>
Initialize a new nonlinear constraint.
Auto Trait Implementations§
impl<N, Handle> Freeze for GenericNonlinearConstraint<N, Handle>
impl<N, Handle> RefUnwindSafe for GenericNonlinearConstraint<N, Handle>where
N: RefUnwindSafe,
Handle: RefUnwindSafe,
impl<N, Handle> Send for GenericNonlinearConstraint<N, Handle>
impl<N, Handle> Sync for GenericNonlinearConstraint<N, Handle>
impl<N, Handle> Unpin for GenericNonlinearConstraint<N, Handle>
impl<N, Handle> UnsafeUnpin for GenericNonlinearConstraint<N, Handle>where
N: UnsafeUnpin,
Handle: UnsafeUnpin,
impl<N, Handle> UnwindSafe for GenericNonlinearConstraint<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.