pub struct RecursiveConfig {
pub nb_iterations_left: usize,
pub low_thresh: Float,
pub high_thresh: Float,
pub random_thresh: Float,
}Expand description
Configuration of the recursive nature of candidates selection. If the number of points obtained after one iteration is not within given bounds, the algorithm adapts the base block size and re-iterates.
Fields§
§nb_iterations_left: usizeMax number of iterations left.
low_thresh: FloatLow percentage threshold of target number of points.
high_thresh: FloatHigh percentage threshold of target number of points.
random_thresh: FloatThreshold such that if we have random_thresh < points_ratio < high_thresh, we randomly sample points to have approximatel the desired target number of candidate points.
Auto Trait Implementations§
impl Freeze for RecursiveConfig
impl RefUnwindSafe for RecursiveConfig
impl Send for RecursiveConfig
impl Sync for RecursiveConfig
impl Unpin for RecursiveConfig
impl UnwindSafe for RecursiveConfig
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<T> SetParameter for T
impl<T> SetParameter 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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.