pub struct ProbabilisticBisector<T> { /* private fields */ }Implementations§
Source§impl<T: Float + FromPrimitive + Debug> ProbabilisticBisector<T>
impl<T: Float + FromPrimitive + Debug> ProbabilisticBisector<T>
pub fn new(domain: Range<T>, confidence_level: ConfidenceLevel<T>) -> Self
Trait Implementations§
Source§impl<O, T> Calculation<O, BisectorState<T>> for ProbabilisticBisector<T>
impl<O, T> Calculation<O, BisectorState<T>> for ProbabilisticBisector<T>
Source§const NAME: &'static str = "Probabilistic Bisector Algorithm"
const NAME: &'static str = "Probabilistic Bisector Algorithm"
An identifier for the calculation. Read more
Source§type Output = CombinedConfidenceInterval<T>
type Output = CombinedConfidenceInterval<T>
The type returned to the caller. Read more
Source§fn initialise(
&mut self,
problem: &mut Problem<O>,
state: BisectorState<T>,
) -> Result<BisectorState<T>, Self::Error>
fn initialise( &mut self, problem: &mut Problem<O>, state: BisectorState<T>, ) -> Result<BisectorState<T>, Self::Error>
Initialisation. Read more
Source§fn next(
&mut self,
problem: &mut Problem<O>,
state: BisectorState<T>,
) -> Result<BisectorState<T>, Self::Error>
fn next( &mut self, problem: &mut Problem<O>, state: BisectorState<T>, ) -> Result<BisectorState<T>, Self::Error>
One iteration of the core algorithm
Auto Trait Implementations§
impl<T> Freeze for ProbabilisticBisector<T>where
T: Freeze,
impl<T> RefUnwindSafe for ProbabilisticBisector<T>where
T: RefUnwindSafe,
impl<T> Send for ProbabilisticBisector<T>where
T: Send,
impl<T> Sync for ProbabilisticBisector<T>where
T: Sync,
impl<T> Unpin for ProbabilisticBisector<T>where
T: Unpin,
impl<T> UnwindSafe for ProbabilisticBisector<T>where
T: 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<C, P, S> GenerateBuilder<P, S> for C
impl<C, P, S> GenerateBuilder<P, S> for C
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.