Struct newton_rootfinder::iteratives::Iteratives [−][src]
pub struct Iteratives<'a, T: Iterative> { /* fields omitted */ }Expand description
A slice of iteratives
This struct is used as a wrapper to act on a slice of several iteratives
It provides the same method as the Iterative trait with the plural suffix:
step_limitationscompute_perturbations
Implementations
Compute a limited step for several iteratives
Return the new value after the application of the step limitation (and not the step).
This is required as it can be limited by an interval for the iteratives.
pub fn compute_perturbations<D>(
&self,
iterative_values: &OVector<f64, D>
) -> OVector<f64, D> where
D: Dim,
DefaultAllocator: Allocator<f64, D>,
pub fn compute_perturbations<D>(
&self,
iterative_values: &OVector<f64, D>
) -> OVector<f64, D> where
D: Dim,
DefaultAllocator: Allocator<f64, D>,
Compute the perturbation for several iteratives
Trait Implementations
Auto Trait Implementations
impl<'a, T> RefUnwindSafe for Iteratives<'a, T> where
T: RefUnwindSafe,
impl<'a, T> Send for Iteratives<'a, T> where
T: Sync,
impl<'a, T> Sync for Iteratives<'a, T> where
T: Sync,
impl<'a, T> Unpin for Iteratives<'a, T>
impl<'a, T> UnwindSafe for Iteratives<'a, T> where
T: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.