Struct pmcore::algorithms::npag::NPAG
source · pub struct NPAG<E: Equation> { /* private fields */ }
Trait Implementations§
source§impl<E: Equation> Algorithm<E> for NPAG<E>
impl<E: Equation> Algorithm<E> for NPAG<E>
fn new(settings: Settings, equation: E, data: Data) -> Result<Box<Self>, Error>
fn into_npresult(&self) -> NPResult<E>
fn get_settings(&self) -> &Settings
fn get_data(&self) -> &Data
fn get_prior(&self) -> Array2<f64>
fn likelihood(&self) -> f64
fn inc_cycle(&mut self) -> usize
fn get_cycle(&self) -> usize
fn set_theta(&mut self, theta: Array2<f64>)
fn get_theta(&self) -> &Array2<f64>
fn psi(&self) -> &Array2<f64>
fn convergence_evaluation(&mut self)
fn converged(&self) -> bool
fn evaluation(&mut self) -> Result<(), (Error, NPResult<E>)>
fn condensation(&mut self) -> Result<(), (Error, NPResult<E>)>
fn optimizations(&mut self) -> Result<(), (Error, NPResult<E>)>
fn logs(&self)
fn expansion(&mut self) -> Result<(), (Error, NPResult<E>)>
fn write_psi(&self, path: &str)
fn write_theta(&self, path: &str)
fn n2ll(&self) -> f64
fn initialize(&mut self) -> Result<(), Error>
fn next_cycle(&mut self) -> Result<bool, (Error, NPResult<E>)>
fn fit(&mut self) -> Result<NPResult<E>, (Error, NPResult<E>)>
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>where
E: Send,
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> 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.§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.