Struct nphysics3d::counters::SolverCounters [−][src]
pub struct SolverCounters { pub nconstraints: usize, pub ncontacts: usize, pub velocity_resolution_time: Timer, pub assembly_time: Timer, pub velocity_update_time: Timer, pub position_resolution_time: Timer, }
Expand description
Performance counters related to constraints resolution.
Fields
nconstraints: usize
Number of constraints generated.
ncontacts: usize
Number of contacts found.
velocity_resolution_time: Timer
Time spent for the resolution of the constraints (force computation).
assembly_time: Timer
Time spent for the assembly of all the constraints into a linear complentarity problem.
velocity_update_time: Timer
Time spent for the update of the velocity of the bodies.
position_resolution_time: Timer
Time spent for the update of the position of the bodies.
Implementations
Trait Implementations
Returns the “default value” for a type. Read more
Auto Trait Implementations
impl RefUnwindSafe for SolverCounters
impl Send for SolverCounters
impl Sync for SolverCounters
impl Unpin for SolverCounters
impl UnwindSafe for SolverCounters
Blanket Implementations
Mutably borrows from an owned value. Read more
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
. Read more
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.