pub struct MinimizationObserver(/* private fields */);Expand description
An Observer which can be used to monitor the progress of a minimization.
This should be paired with a Python object which has an observe method
that takes the current step and a method-specific minimization status object.
Trait Implementations§
Source§impl Clone for MinimizationObserver
impl Clone for MinimizationObserver
Source§fn clone(&self) -> MinimizationObserver
fn clone(&self) -> MinimizationObserver
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<'a, 'py> FromPyObject<'a, 'py> for MinimizationObserver
impl<'a, 'py> FromPyObject<'a, 'py> for MinimizationObserver
Source§impl<A, P, C> Observer<A, P, GradientFreeStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
impl<A, P, C> Observer<A, P, GradientFreeStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
Source§fn observe(
&mut self,
current_step: usize,
_algorithm: &A,
_problem: &P,
status: &GradientFreeStatus,
_args: &MaybeThreadPool,
_config: &C,
)
fn observe( &mut self, current_step: usize, _algorithm: &A, _problem: &P, status: &GradientFreeStatus, _args: &MaybeThreadPool, _config: &C, )
An observation method which is called on each step of an
Algorithm.Source§impl<A, P, C> Observer<A, P, GradientStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
impl<A, P, C> Observer<A, P, GradientStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
Source§fn observe(
&mut self,
current_step: usize,
_algorithm: &A,
_problem: &P,
status: &GradientStatus,
_args: &MaybeThreadPool,
_config: &C,
)
fn observe( &mut self, current_step: usize, _algorithm: &A, _problem: &P, status: &GradientStatus, _args: &MaybeThreadPool, _config: &C, )
An observation method which is called on each step of an
Algorithm.Source§impl<A, P, C> Observer<A, P, SwarmStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
impl<A, P, C> Observer<A, P, SwarmStatus, MaybeThreadPool, LadduError, C> for MinimizationObserver
Source§fn observe(
&mut self,
current_step: usize,
_algorithm: &A,
_problem: &P,
status: &SwarmStatus,
_args: &MaybeThreadPool,
_config: &C,
)
fn observe( &mut self, current_step: usize, _algorithm: &A, _problem: &P, status: &SwarmStatus, _args: &MaybeThreadPool, _config: &C, )
An observation method which is called on each step of an
Algorithm.Auto Trait Implementations§
impl Freeze for MinimizationObserver
impl !RefUnwindSafe for MinimizationObserver
impl Send for MinimizationObserver
impl Sync for MinimizationObserver
impl Unpin for MinimizationObserver
impl UnsafeUnpin for MinimizationObserver
impl !UnwindSafe for MinimizationObserver
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
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.