Skip to main content

PbdDistanceConstraint

Struct PbdDistanceConstraint 

Source
pub struct PbdDistanceConstraint {
    pub indices: [usize; 2],
    pub rest_length: Real,
    pub k: Real,
}
Expand description

A simple PBD distance constraint between two particles.

Fields§

§indices: [usize; 2]

Indices of the two particles.

§rest_length: Real

Rest (target) distance.

§k: Real

Stiffness in [0, 1].

Implementations§

Source§

impl PbdDistanceConstraint

Source

pub fn new(i: usize, j: usize, rest_length: Real, stiffness: Real) -> Self

Create a new distance constraint.

Trait Implementations§

Source§

impl PbdConstraint for PbdDistanceConstraint

Source§

fn evaluate(&self, positions: &[[Real; 3]]) -> Real

Evaluate constraint C(p) — returns violation (0 = satisfied).
Source§

fn gradient(&self, positions: &[[Real; 3]]) -> Vec<[Real; 3]>

Compute constraint gradient ∇C with respect to each particle position.
Source§

fn particle_indices(&self) -> &[usize]

Particle indices involved in this constraint.
Source§

fn stiffness(&self) -> Real

Stiffness in range [0, 1] (1 = fully rigid, 0 = no correction).

Auto Trait Implementations§

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