pub struct BiteOpt { /* private fields */ }Expand description
Implementations§
Source§impl BiteOpt
impl BiteOpt
Sourcepub fn new(
lower: &[f64],
upper: &[f64],
init: Option<&[f64]>,
p: &BiteParams,
) -> Self
pub fn new( lower: &[f64], upper: &[f64], init: Option<&[f64]>, p: &BiteParams, ) -> Self
Construct BiteOpt for finite box bounds and an optional initial point.
§Panics
Panics on any configuration validate_bite_inputs rejects. Call that
function first to validate user-supplied input without panicking.
Sourcepub fn ask(&mut self, batch: usize) -> Vec<Vec<f64>>
pub fn ask(&mut self, batch: usize) -> Vec<Vec<f64>>
Ask for up to batch candidate rows (real-valued). During the initial
population fill the batch is capped to the remaining init members.
Sourcepub fn current_batch_size(&self) -> usize
pub fn current_batch_size(&self) -> usize
Number of candidates awaiting a matching tell.
Sourcepub fn population_size(&self) -> usize
pub fn population_size(&self) -> usize
Size of the principal adaptive population.
Sourcepub fn stop_code(&self) -> i32
pub fn stop_code(&self) -> i32
Current termination code, or zero while optimization can continue.
Sourcepub fn result_public(&self) -> BiteResult
pub fn result_public(&self) -> BiteResult
Return a snapshot of the best result found so far.
Sourcepub fn optimize(&mut self, obj: &impl Objective) -> BiteResult
pub fn optimize(&mut self, obj: &impl Objective) -> BiteResult
Run until the evaluation budget or a stop condition is reached.
Auto Trait Implementations§
impl Freeze for BiteOpt
impl RefUnwindSafe for BiteOpt
impl Send for BiteOpt
impl Sync for BiteOpt
impl Unpin for BiteOpt
impl UnsafeUnpin for BiteOpt
impl UnwindSafe for BiteOpt
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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.