pub struct StressProcessor { /* private fields */ }Expand description
Low-level stress solver (conjugate gradient on a bond graph).
This wraps the C++ StressProcessor via FFI. For most use cases,
prefer ExtStressSolver which includes
NvBlast actor management and fracture support.
Implementations§
Source§impl StressProcessor
impl StressProcessor
Sourcepub fn new(
nodes: &[StressNodeDesc],
bonds: &[StressBondDesc],
params: StressDataParams,
) -> Option<Self>
pub fn new( nodes: &[StressNodeDesc], bonds: &[StressBondDesc], params: StressDataParams, ) -> Option<Self>
Create a new processor from node and bond descriptors.
pub fn node_count(&self) -> u32
pub fn bond_count(&self) -> u32
pub fn node_desc(&self, index: u32) -> Option<StressNodeDesc>
pub fn bond_desc(&self, index: u32) -> Option<StressBondDesc>
Sourcepub fn remove_bond(&mut self, bond_index: u32) -> bool
pub fn remove_bond(&mut self, bond_index: u32) -> bool
Remove a bond from the solver. Returns true on success.
Sourcepub fn solve(
&mut self,
impulses: &mut [StressImpulse],
velocities: &[StressVelocity],
params: StressSolverParams,
resume: bool,
) -> Result<(i32, StressErrorSq), &'static str>
pub fn solve( &mut self, impulses: &mut [StressImpulse], velocities: &[StressVelocity], params: StressSolverParams, resume: bool, ) -> Result<(i32, StressErrorSq), &'static str>
Solve for impulses given node velocities.
impulses must have length == bond_count(), velocities must have length == node_count().
Sourcepub fn using_simd() -> bool
pub fn using_simd() -> bool
Check if the compiled solver uses SIMD.
Trait Implementations§
Source§impl Drop for StressProcessor
impl Drop for StressProcessor
impl Send for StressProcessor
impl Sync for StressProcessor
Auto Trait Implementations§
impl Freeze for StressProcessor
impl RefUnwindSafe for StressProcessor
impl Unpin for StressProcessor
impl UnsafeUnpin for StressProcessor
impl UnwindSafe for StressProcessor
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>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn 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>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which 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)
Converts
&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)
Converts
&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> DowncastSend for T
impl<T> DowncastSend for T
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.