Struct bisection_search::BisectionSearch
source · pub struct BisectionSearch<T, F>{
pub interval: Interval<T>,
/* private fields */
}Fields§
§interval: Interval<T>Implementations§
source§impl<T, F> BisectionSearch<T, F>
impl<T, F> BisectionSearch<T, F>
Trait Implementations§
Auto Trait Implementations§
impl<T, F> Freeze for BisectionSearch<T, F>
impl<T, F> RefUnwindSafe for BisectionSearch<T, F>where
T: RefUnwindSafe,
F: RefUnwindSafe,
impl<T, F> Send for BisectionSearch<T, F>
impl<T, F> Sync for BisectionSearch<T, F>
impl<T, F> Unpin for BisectionSearch<T, F>
impl<T, F> UnwindSafe for BisectionSearch<T, F>where
T: UnwindSafe,
F: UnwindSafe,
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<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.