pub struct GridSearch<P> {
pub scores: Vec<(P, f64)>,
pub best: usize,
}Expand description
The result of grid_search: each candidate’s mean score, and the
best (lowest) one.
Fields§
§scores: Vec<(P, f64)>(candidate, mean score over the splits), in the order given.
best: usizeIndex of the candidate with the lowest mean score.
Trait Implementations§
Source§impl<P: Clone> Clone for GridSearch<P>
impl<P: Clone> Clone for GridSearch<P>
Source§impl<P: Debug> Debug for GridSearch<P>
impl<P: Debug> Debug for GridSearch<P>
Source§impl<P: PartialEq> PartialEq for GridSearch<P>
impl<P: PartialEq> PartialEq for GridSearch<P>
impl<P: PartialEq> StructuralPartialEq for GridSearch<P>
Auto Trait Implementations§
impl<P> Freeze for GridSearch<P>
impl<P> RefUnwindSafe for GridSearch<P>
impl<P> Send for GridSearch<P>
impl<P> Sync for GridSearch<P>
impl<P> Unpin for GridSearch<P>
impl<P> UnsafeUnpin for GridSearch<P>
impl<P> UnwindSafe for GridSearch<P>
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> 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 more