pareto_front 1.2.1

Builds a Pareto front incrementaly.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

#![allow(dead_code)]
use pareto_front::{Dominate, ParetoFront};

/// test element
#[derive(Debug, PartialEq)]
struct ParetoElement
{
    cost: usize,
    quality: f32,
    score: i64
}

/// implement the `Dominate` trait
impl Dominate for ParetoElement
{
    fn dominate(&self, x: &Self) -> bool
    {
        (self.cost <= x.cost) && (self.quality >= x.quality) && (self.score >= x.score) && (self != x)
    }
}

fn main()
{
    // data to be put in the front
    let x = ParetoElement { cost: 35, quality: 0.5, score: 4 };
    let y = ParetoElement { cost: 350, quality: 0.05, score: 2 };
    let z = ParetoElement { cost: 5, quality: 0.25, score: 5 };

    // insertions in the front
    let mut front = ParetoFront::new();
    front.push(x);
    front.push(y);
    front.push(z);

    // display of the result
    for (i, element) in front.iter().enumerate()
    {
        println!("{}: {:?}", i, element);
    }
}