pub struct NPAG<E: Equation + Send + 'static> { /* private fields */ }Trait Implementations§
Source§impl<E: Equation + Send + 'static> Algorithms<E> for NPAG<E>
impl<E: Equation + Send + 'static> Algorithms<E> for NPAG<E>
fn new(settings: Settings, equation: E, data: Data) -> Result<Box<Self>, Error>
fn into_npresult(&self) -> NPResult<E>
fn settings(&self) -> &Settings
fn get_prior(&self) -> Theta
Source§fn likelihood(&self) -> f64
fn likelihood(&self) -> f64
Get the current likelihood
Source§fn increment_cycle(&mut self) -> usize
fn increment_cycle(&mut self) -> usize
Increment the cycle counter and return the new value
Source§fn evaluation(&mut self) -> Result<Status>
fn evaluation(&mut self) -> Result<Status>
Evaluate convergence criteria and update status
fn estimation(&mut self) -> Result<()>
Source§fn condensation(&mut self) -> Result<()>
fn condensation(&mut self) -> Result<()>
Source§fn optimizations(&mut self) -> Result<()>
fn optimizations(&mut self) -> Result<()>
Source§fn set_status(&mut self, status: Status)
fn set_status(&mut self, status: Status)
Set the current Status of the algorithm
Source§fn log_cycle_state(&mut self)
fn log_cycle_state(&mut self)
Create and log a cycle state with the current algorithm state
fn validate_psi(&mut self) -> Result<()>
Source§fn initialize(&mut self) -> Result<()>
fn initialize(&mut self) -> Result<()>
Auto Trait Implementations§
impl<E> Freeze for NPAG<E>where
E: Freeze,
impl<E> RefUnwindSafe for NPAG<E>where
E: RefUnwindSafe,
impl<E> Send for NPAG<E>
impl<E> Sync for NPAG<E>
impl<E> Unpin for NPAG<E>where
E: Unpin,
impl<E> UnwindSafe for NPAG<E>where
E: 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
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.