[−][src]Trait roots::Convergency
The way to check if the algorithm has finished by either finding a root or reaching the iteration limit.
Required methods
fn is_root_found(&mut self, y: F) -> bool
Return true if the given Y value is close enough to the zero
fn is_converged(&mut self, x1: F, x2: F) -> bool
Return true if given x values are close enough to each other
fn is_iteration_limit_reached(&mut self, iter: usize) -> bool
Return true if no more iterations desired
Implementors
impl<F: FloatType + Display + LowerExp> Convergency<F> for DebugConvergency<F>
[src]
fn is_root_found(&mut self, y: F) -> bool
[src]
Prints the value being checked
fn is_converged(&mut self, x1: F, x2: F) -> bool
[src]
Prints values being checked
fn is_iteration_limit_reached(&mut self, iter: usize) -> bool
[src]
Updates internal iteration counter
impl<F: FloatType> Convergency<F> for SimpleConvergency<F>
[src]
fn is_root_found(&mut self, y: F) -> bool
[src]
fn is_converged(&mut self, x1: F, x2: F) -> bool
[src]
fn is_iteration_limit_reached(&mut self, iter: usize) -> bool
[src]
impl<F: FloatType> Convergency<F> for F
[src]
fn is_root_found(&mut self, y: F) -> bool
[src]
Return true if the given Y value is close enough to the zero
fn is_converged(&mut self, x1: F, x2: F) -> bool
[src]
Return true if given x values are close enough to each other
fn is_iteration_limit_reached(&mut self, iter: usize) -> bool
[src]
Return true if no more iterations desired