pub struct NonConvexOpt<T, N, D>where
T: FloatNum,
N: Dim,
D: Dim,
OVector<bool, N>: Send + Sync,
OVector<bool, D>: Send + Sync,
OMatrix<bool, U1, N>: Send + Sync,
OVector<T, D>: Send + Sync,
OVector<T, N>: Send + Sync,
OMatrix<T, D, D>: Send + Sync,
OMatrix<T, N, D>: Send + Sync,
OMatrix<T, U1, D>: Send + Sync,
DefaultAllocator: Allocator<D> + Allocator<N> + Allocator<N, D> + Allocator<D, D> + Allocator<U1, D> + Allocator<U1, N>,{
pub alg: Box<dyn OptimizationAlgorithm<T, N, D>>,
pub conf: OptConf,
pub converged: bool,
}Fields§
§alg: Box<dyn OptimizationAlgorithm<T, N, D>>§conf: OptConf§converged: boolImplementations§
Source§impl<T, N, D> NonConvexOpt<T, N, D>where
T: FloatNum,
N: Dim,
D: Dim,
OVector<bool, N>: Send + Sync,
OVector<bool, D>: Send + Sync,
OMatrix<bool, U1, N>: Send + Sync,
OVector<T, D>: Send + Sync,
OVector<T, N>: Send + Sync,
OMatrix<T, D, D>: Send + Sync,
OMatrix<T, N, D>: Send + Sync,
OMatrix<T, U1, D>: Send + Sync,
DefaultAllocator: Allocator<D> + Allocator<N> + Allocator<N, D> + Allocator<D, D> + Allocator<U1, D> + Allocator<U1, N>,
impl<T, N, D> NonConvexOpt<T, N, D>where
T: FloatNum,
N: Dim,
D: Dim,
OVector<bool, N>: Send + Sync,
OVector<bool, D>: Send + Sync,
OMatrix<bool, U1, N>: Send + Sync,
OVector<T, D>: Send + Sync,
OVector<T, N>: Send + Sync,
OMatrix<T, D, D>: Send + Sync,
OMatrix<T, N, D>: Send + Sync,
OMatrix<T, U1, D>: Send + Sync,
DefaultAllocator: Allocator<D> + Allocator<N> + Allocator<N, D> + Allocator<D, D> + Allocator<U1, D> + Allocator<U1, N>,
pub fn new<F: ObjectiveFunction<T, D> + 'static, G: BooleanConstraintFunction<T, D> + 'static>( conf: Config, init_pop: OMatrix<T, N, D>, obj_f: F, constr_f: Option<G>, ) -> Self
pub fn step(&mut self)
pub fn run(&mut self) -> &State<T, N, D>
pub fn get_best_individual(&self) -> OVector<T, D>
pub fn get_population(&self) -> OMatrix<T, N, D>
Auto Trait Implementations§
impl<T, N, D> Freeze for NonConvexOpt<T, N, D>where
DefaultAllocator: Sized,
impl<T, N, D> !RefUnwindSafe for NonConvexOpt<T, N, D>
impl<T, N, D> !Send for NonConvexOpt<T, N, D>
impl<T, N, D> !Sync for NonConvexOpt<T, N, D>
impl<T, N, D> Unpin for NonConvexOpt<T, N, D>where
DefaultAllocator: Sized,
impl<T, N, D> !UnwindSafe for NonConvexOpt<T, N, D>
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> 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.