pub struct RootBracketResult<F: Scalar = f64> { /* private fields */ }Expand description
Result of an automatic root bracket search, including unsuccessful searches.
Implementations§
Source§impl<F: Scalar> RootBracketResult<F>
impl<F: Scalar> RootBracketResult<F>
Sourcepub fn bracket(&self) -> (F, F)
pub fn bracket(&self) -> (F, F)
Ordered, distinct endpoints. On failure these are the outermost samples, which need not bracket a root and may have an overflowing total width.
Sourcepub fn iterations(&self) -> u64
pub fn iterations(&self) -> u64
Number of expansion rounds that evaluated at least one new point.
Sourcepub fn function_evals(&self) -> u64
pub fn function_evals(&self) -> u64
Number of callback invocations, including all initial points.
Sourcepub fn reason(&self) -> BracketTerminationReason
pub fn reason(&self) -> BracketTerminationReason
Why the search stopped.
Trait Implementations§
impl<F: Copy + Scalar> Copy for RootBracketResult<F>
impl<F: PartialEq + Scalar> StructuralPartialEq for RootBracketResult<F>
Auto Trait Implementations§
impl<F> Freeze for RootBracketResult<F>
impl<F> RefUnwindSafe for RootBracketResult<F>where
[Sample<F>; 2]: RefUnwindSafe,
impl<F> Send for RootBracketResult<F>
impl<F> Sync for RootBracketResult<F>
impl<F> Unpin for RootBracketResult<F>
impl<F> UnsafeUnpin for RootBracketResult<F>where
[Sample<F>; 2]: UnsafeUnpin,
impl<F> UnwindSafe for RootBracketResult<F>where
[Sample<F>; 2]: UnwindSafe,
Blanket Implementations§
impl<T> Boilerplate for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T, U> Imply<T> for U
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<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§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.