Struct Front

pub struct Front<T>
where
    T: AsRef<[f32]>,
{ /* private fields */ }

A front is a collection of scores that are non-dominated with respect to each other. This is useful for multi-objective optimization problems where the goal is to find the best solutions that are not dominated by any other solution. This results in what is called the Pareto front.

Implementations

impl<T> Front<T>

where T: AsRef<[f32]>,

pub fn new<F>( range: Range<usize>, objective: Objective, thread_pool: Arc<Executor>, comp: F, ) -> Self

where F: Fn(&T, &T) -> Ordering + Send + Sync + 'static,

pub fn range(&self) -> Range<usize>

pub fn objective(&self) -> Objective

pub fn values(&self) -> &[Arc<T>]

pub fn add_all(&mut self, items: &[T]) -> usize

where T: Eq + Hash + Clone + Send + Sync + 'static,

pub fn filter(&mut self)

Trait Implementations

impl<T> Clone for Front<T>

where T: AsRef<[f32]> + Clone,

fn clone(&self) -> Front<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.